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 /* An array of _DECL trees for the above. */
340 extern GTY(()) tree built_in_decls
[(int) END_BUILTINS
];
341 extern GTY(()) tree implicit_built_in_decls
[(int) END_BUILTINS
];
343 /* In an OMP_CLAUSE node. */
345 /* Number of operands and names for each clause. */
346 extern unsigned const char omp_clause_num_ops
[];
347 extern const char * const omp_clause_code_name
[];
349 /* Clause codes. Do not reorder, as this is used to index into the tables
350 omp_clause_num_ops and omp_clause_code_name. */
353 /* Clause zero is special-cased inside the parser
354 (c_parser_omp_variable_list). */
355 OMP_CLAUSE_ERROR
= 0,
357 /* OpenMP clause: private (variable_list). */
360 /* OpenMP clause: shared (variable_list). */
363 /* OpenMP clause: firstprivate (variable_list). */
364 OMP_CLAUSE_FIRSTPRIVATE
,
366 /* OpenMP clause: lastprivate (variable_list). */
367 OMP_CLAUSE_LASTPRIVATE
,
369 /* OpenMP clause: reduction (operator:variable_list).
370 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
371 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
372 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
374 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
375 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
376 OMP_CLAUSE_REDUCTION
,
378 /* OpenMP clause: copyin (variable_list). */
381 /* OpenMP clause: copyprivate (variable_list). */
382 OMP_CLAUSE_COPYPRIVATE
,
384 /* OpenMP clause: if (scalar-expression). */
387 /* OpenMP clause: num_threads (integer-expression). */
388 OMP_CLAUSE_NUM_THREADS
,
390 /* OpenMP clause: schedule. */
393 /* OpenMP clause: nowait. */
396 /* OpenMP clause: ordered. */
399 /* OpenMP clause: default. */
402 /* OpenMP clause: collapse (constant-integer-expression). */
405 /* OpenMP clause: untied. */
408 /* OpenMP clause: final (scalar-expression). */
411 /* OpenMP clause: mergeable. */
415 /* The definition of tree nodes fills the next several pages. */
417 /* A tree node can represent a data type, a variable, an expression
418 or a statement. Each node has a TREE_CODE which says what kind of
419 thing it represents. Some common codes are:
420 INTEGER_TYPE -- represents a type of integers.
421 ARRAY_TYPE -- represents a type of pointer.
422 VAR_DECL -- represents a declared variable.
423 INTEGER_CST -- represents a constant integer value.
424 PLUS_EXPR -- represents a sum (an expression).
426 As for the contents of a tree node: there are some fields
427 that all nodes share. Each TREE_CODE has various special-purpose
428 fields as well. The fields of a node are never accessed directly,
429 always through accessor macros. */
431 /* Every kind of tree node starts with this structure,
432 so all nodes have these fields.
434 See the accessor macros, defined below, for documentation of the
437 struct GTY(()) tree_base
{
438 ENUM_BITFIELD(tree_code
) code
: 16;
440 unsigned side_effects_flag
: 1;
441 unsigned constant_flag
: 1;
442 unsigned addressable_flag
: 1;
443 unsigned volatile_flag
: 1;
444 unsigned readonly_flag
: 1;
445 unsigned unsigned_flag
: 1;
446 unsigned asm_written_flag
: 1;
447 unsigned nowarning_flag
: 1;
449 unsigned used_flag
: 1;
450 unsigned nothrow_flag
: 1;
451 unsigned static_flag
: 1;
452 unsigned public_flag
: 1;
453 unsigned private_flag
: 1;
454 unsigned protected_flag
: 1;
455 unsigned deprecated_flag
: 1;
456 unsigned saturating_flag
: 1;
458 unsigned default_def_flag
: 1;
459 unsigned lang_flag_0
: 1;
460 unsigned lang_flag_1
: 1;
461 unsigned lang_flag_2
: 1;
462 unsigned lang_flag_3
: 1;
463 unsigned lang_flag_4
: 1;
464 unsigned lang_flag_5
: 1;
465 unsigned lang_flag_6
: 1;
467 unsigned visited
: 1;
468 unsigned packed_flag
: 1;
469 unsigned user_align
: 1;
470 unsigned nameless_flag
: 1;
474 /* This field is only used with type nodes; the only reason it is present
475 in tree_base instead of tree_type is to save space. The size of the
476 field must be large enough to hold addr_space_t values. */
477 unsigned address_space
: 8;
480 struct GTY(()) tree_typed
{
481 struct tree_base base
;
485 struct GTY(()) tree_common
{
486 struct tree_typed typed
;
490 /* The following table lists the uses of each of the above flags and
491 for which types of nodes they are defined.
496 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL
498 CONSTRUCTOR, IDENTIFIER_NODE
499 STMT_EXPR, it means we want the result of the enclosed expression
501 CALL_EXPR_TAILCALL in
510 VAR_DECL, FUNCTION_DECL
513 TREE_NO_TRAMPOLINE in
519 TREE_SYMBOL_REFERENCED in
523 TARGET_EXPR, WITH_CLEANUP_EXPR
525 TRY_CATCH_IS_CLEANUP in
531 TYPE_REF_CAN_ALIAS_ALL in
532 POINTER_TYPE, REFERENCE_TYPE
540 CALL_CANNOT_INLINE_P in
549 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
552 VAR_DECL, FUNCTION_DECL
558 CALL_EXPR_VA_ARG_PACK in
561 TYPE_CACHED_VALUES_P in
564 SAVE_EXPR_RESOLVED_P in
567 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
568 OMP_CLAUSE_LASTPRIVATE
570 OMP_CLAUSE_PRIVATE_DEBUG in
578 CALL_EXPR_RETURN_SLOT_OPT in
584 OMP_PARALLEL_COMBINED in
586 OMP_CLAUSE_PRIVATE_OUTER_REF in
589 TYPE_REF_IS_RVALUE in
598 CALL_FROM_THUNK_P and
599 CALL_ALLOCA_FOR_VAR_P in
614 TREE_THIS_VOLATILE in
637 TYPE_SIZES_GIMPLIFIED in
648 REGISTER_DEFS_IN_THIS_STMT in
649 all expressions (tree-into-ssa.c)
654 VAR_DECL, FUNCTION_DECL
655 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
656 BLOCK, SSA_NAME, STRING_CST
659 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
678 INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, ARRAY_RANGE_REF
686 IDENTIFIER_TRANSPARENT_ALIAS in
689 STMT_IN_SSA_EDGE_WORKLIST in
690 all expressions (tree-ssa-propagate.c)
695 all trees (used liberally by many passes)
713 TYPE_VECTOR_OPAQUE in
716 SSA_NAME_IS_DEFAULT_DEF in
721 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
722 enum tree_node_structure_enum
{
723 #include "treestruct.def"
728 /* Define accessors for the fields that all tree nodes have
729 (though some fields are not used for all kinds of nodes). */
731 /* The tree-code says what kind of node it is.
732 Codes are defined in tree.def. */
733 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
734 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
736 /* When checking is enabled, errors will be generated if a tree node
737 is accessed incorrectly. The macros die with a fatal error. */
738 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
740 #define TREE_CHECK(T, CODE) __extension__ \
741 ({ __typeof (T) const __t = (T); \
742 if (TREE_CODE (__t) != (CODE)) \
743 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
747 #define TREE_NOT_CHECK(T, CODE) __extension__ \
748 ({ __typeof (T) const __t = (T); \
749 if (TREE_CODE (__t) == (CODE)) \
750 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
754 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
755 ({ __typeof (T) const __t = (T); \
756 if (TREE_CODE (__t) != (CODE1) \
757 && TREE_CODE (__t) != (CODE2)) \
758 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
759 (CODE1), (CODE2), 0); \
762 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
763 ({ __typeof (T) const __t = (T); \
764 if (TREE_CODE (__t) == (CODE1) \
765 || TREE_CODE (__t) == (CODE2)) \
766 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
767 (CODE1), (CODE2), 0); \
770 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
771 ({ __typeof (T) const __t = (T); \
772 if (TREE_CODE (__t) != (CODE1) \
773 && TREE_CODE (__t) != (CODE2) \
774 && TREE_CODE (__t) != (CODE3)) \
775 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
776 (CODE1), (CODE2), (CODE3), 0); \
779 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
780 ({ __typeof (T) const __t = (T); \
781 if (TREE_CODE (__t) == (CODE1) \
782 || TREE_CODE (__t) == (CODE2) \
783 || TREE_CODE (__t) == (CODE3)) \
784 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
785 (CODE1), (CODE2), (CODE3), 0); \
788 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
789 ({ __typeof (T) const __t = (T); \
790 if (TREE_CODE (__t) != (CODE1) \
791 && TREE_CODE (__t) != (CODE2) \
792 && TREE_CODE (__t) != (CODE3) \
793 && TREE_CODE (__t) != (CODE4)) \
794 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
795 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
798 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
799 ({ __typeof (T) const __t = (T); \
800 if (TREE_CODE (__t) == (CODE1) \
801 || TREE_CODE (__t) == (CODE2) \
802 || TREE_CODE (__t) == (CODE3) \
803 || TREE_CODE (__t) == (CODE4)) \
804 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
805 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
808 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
809 ({ __typeof (T) const __t = (T); \
810 if (TREE_CODE (__t) != (CODE1) \
811 && TREE_CODE (__t) != (CODE2) \
812 && TREE_CODE (__t) != (CODE3) \
813 && TREE_CODE (__t) != (CODE4) \
814 && TREE_CODE (__t) != (CODE5)) \
815 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
816 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
819 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
820 ({ __typeof (T) const __t = (T); \
821 if (TREE_CODE (__t) == (CODE1) \
822 || TREE_CODE (__t) == (CODE2) \
823 || TREE_CODE (__t) == (CODE3) \
824 || TREE_CODE (__t) == (CODE4) \
825 || TREE_CODE (__t) == (CODE5)) \
826 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
827 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
830 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
831 ({ __typeof (T) const __t = (T); \
832 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
833 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
837 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
838 ({ __typeof (T) const __t = (T); \
839 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
840 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
844 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
845 ({ __typeof (T) const __t = (T); \
846 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
847 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
851 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
852 ({ __typeof (T) const __t = (T); \
853 if (TREE_CODE (__t) != OMP_CLAUSE) \
854 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
856 if (__t->omp_clause.code != (CODE)) \
857 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
861 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
862 ({ __typeof (T) const __t = (T); \
863 if (TREE_CODE (__t) != OMP_CLAUSE) \
864 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
866 if ((int) __t->omp_clause.code < (int) (CODE1) \
867 || (int) __t->omp_clause.code > (int) (CODE2)) \
868 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
869 __FUNCTION__, (CODE1), (CODE2)); \
872 /* These checks have to be special cased. */
873 #define EXPR_CHECK(T) __extension__ \
874 ({ __typeof (T) const __t = (T); \
875 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
876 if (!IS_EXPR_CODE_CLASS (__c)) \
877 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
881 /* These checks have to be special cased. */
882 #define NON_TYPE_CHECK(T) __extension__ \
883 ({ __typeof (T) const __t = (T); \
885 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
889 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
890 (*({__typeof (T) const __t = (T); \
891 const int __i = (I); \
892 if (TREE_CODE (__t) != TREE_VEC) \
893 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
895 if (__i < 0 || __i >= __t->vec.length) \
896 tree_vec_elt_check_failed (__i, __t->vec.length, \
897 __FILE__, __LINE__, __FUNCTION__); \
898 &__t->vec.a[__i]; }))
900 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
901 (*({__typeof (T) const __t = (T); \
902 const int __i = (I); \
903 if (TREE_CODE (__t) != OMP_CLAUSE) \
904 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
906 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
907 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
909 &__t->omp_clause.ops[__i]; }))
911 /* Special checks for TREE_OPERANDs. */
912 #define TREE_OPERAND_CHECK(T, I) __extension__ \
913 (*({__typeof (T) const __t = EXPR_CHECK (T); \
914 const int __i = (I); \
915 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
916 tree_operand_check_failed (__i, __t, \
917 __FILE__, __LINE__, __FUNCTION__); \
918 &__t->exp.operands[__i]; }))
920 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
921 (*({__typeof (T) const __t = (T); \
922 const int __i = (I); \
923 if (TREE_CODE (__t) != CODE) \
924 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
925 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
926 tree_operand_check_failed (__i, __t, \
927 __FILE__, __LINE__, __FUNCTION__); \
928 &__t->exp.operands[__i]; }))
930 /* Nodes are chained together for many purposes.
931 Types are chained together to record them for being output to the debugger
932 (see the function `chain_type').
933 Decls in the same scope are chained together to record the contents
935 Statement nodes for successive statements used to be chained together.
936 Often lists of things are represented by TREE_LIST nodes that
937 are chained together. */
939 #define TREE_CHAIN(NODE) __extension__ \
940 (*({__typeof (NODE) const __t = CONTAINS_STRUCT_CHECK (NODE, TS_COMMON);\
941 &__t->common.chain; }))
943 /* In all nodes that are expressions, this is the data type of the expression.
944 In POINTER_TYPE nodes, this is the type that the pointer points to.
945 In ARRAY_TYPE nodes, this is the type of the elements.
946 In VECTOR_TYPE nodes, this is the type of the elements. */
947 #define TREE_TYPE(NODE) __extension__ \
948 (*({__typeof (NODE) const __t = CONTAINS_STRUCT_CHECK (NODE, TS_TYPED); \
949 &__t->typed.type; }))
951 extern void tree_contains_struct_check_failed (const_tree
,
952 const enum tree_node_structure_enum
,
953 const char *, int, const char *)
956 extern void tree_check_failed (const_tree
, const char *, int, const char *,
957 ...) ATTRIBUTE_NORETURN
;
958 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
959 ...) ATTRIBUTE_NORETURN
;
960 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
961 const char *, int, const char *)
963 extern void tree_range_check_failed (const_tree
, const char *, int,
964 const char *, enum tree_code
,
967 extern void tree_not_class_check_failed (const_tree
,
968 const enum tree_code_class
,
969 const char *, int, const char *)
971 extern void tree_vec_elt_check_failed (int, int, const char *,
974 extern void phi_node_elt_check_failed (int, int, const char *,
977 extern void tree_operand_check_failed (int, const_tree
,
978 const char *, int, const char *)
980 extern void omp_clause_check_failed (const_tree
, const char *, int,
981 const char *, enum omp_clause_code
)
983 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
986 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
987 const char *, enum omp_clause_code
,
988 enum omp_clause_code
)
991 #else /* not ENABLE_TREE_CHECKING, or not gcc */
993 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
994 #define TREE_CHECK(T, CODE) (T)
995 #define TREE_NOT_CHECK(T, CODE) (T)
996 #define TREE_CHECK2(T, CODE1, CODE2) (T)
997 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
998 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
999 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
1000 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
1001 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
1002 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
1003 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
1004 #define TREE_CLASS_CHECK(T, CODE) (T)
1005 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
1006 #define EXPR_CHECK(T) (T)
1007 #define NON_TYPE_CHECK(T) (T)
1008 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
1009 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
1010 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
1011 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
1012 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
1013 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
1015 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
1016 #define TREE_TYPE(NODE) ((NODE)->typed.type)
1020 #define TREE_BLOCK(NODE) *(tree_block (NODE))
1022 #include "tree-check.h"
1024 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
1025 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
1026 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
1027 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
1028 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
1029 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
1030 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
1031 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
1032 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
1033 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
1034 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
1036 #define RECORD_OR_UNION_CHECK(T) \
1037 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
1038 #define NOT_RECORD_OR_UNION_CHECK(T) \
1039 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
1041 #define NUMERICAL_TYPE_CHECK(T) \
1042 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
1045 /* Here is how primitive or already-canonicalized types' hash codes
1047 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
1049 /* A simple hash function for an arbitrary tree node. This must not be
1050 used in hash tables which are saved to a PCH. */
1051 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
1053 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
1054 #define CONVERT_EXPR_CODE_P(CODE) \
1055 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
1057 /* Similarly, but accept an expressions instead of a tree code. */
1058 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
1060 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
1062 #define CASE_CONVERT \
1066 /* Given an expression as a tree, strip any conversion that generates
1067 no instruction. Accepts both tree and const_tree arguments since
1068 we are not modifying the tree itself. */
1070 #define STRIP_NOPS(EXP) \
1071 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
1073 /* Like STRIP_NOPS, but don't let the signedness change either. */
1075 #define STRIP_SIGN_NOPS(EXP) \
1076 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
1078 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1080 #define STRIP_TYPE_NOPS(EXP) \
1081 while ((CONVERT_EXPR_P (EXP) \
1082 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1083 && TREE_OPERAND (EXP, 0) != error_mark_node \
1084 && (TREE_TYPE (EXP) \
1085 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1086 (EXP) = TREE_OPERAND (EXP, 0)
1088 /* Remove unnecessary type conversions according to
1089 tree_ssa_useless_type_conversion. */
1091 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1092 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1094 /* Nonzero if TYPE represents an integral type. Note that we do not
1095 include COMPLEX types here. Keep these checks in ascending code
1098 #define INTEGRAL_TYPE_P(TYPE) \
1099 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1100 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1101 || TREE_CODE (TYPE) == INTEGER_TYPE)
1103 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1105 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1106 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1108 /* Nonzero if TYPE represents a saturating fixed-point type. */
1110 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1111 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1113 /* Nonzero if TYPE represents a fixed-point type. */
1115 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1117 /* Nonzero if TYPE represents a scalar floating-point type. */
1119 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1121 /* Nonzero if TYPE represents a complex floating-point type. */
1123 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1124 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1125 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1127 /* Nonzero if TYPE represents a vector floating-point type. */
1129 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1130 (TREE_CODE (TYPE) == VECTOR_TYPE \
1131 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1133 /* Nonzero if TYPE represents a floating-point type, including complex
1134 and vector floating-point types. The vector and complex check does
1135 not use the previous two macros to enable early folding. */
1137 #define FLOAT_TYPE_P(TYPE) \
1138 (SCALAR_FLOAT_TYPE_P (TYPE) \
1139 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1140 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1141 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1143 /* Nonzero if TYPE represents a decimal floating-point type. */
1144 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1145 (SCALAR_FLOAT_TYPE_P (TYPE) \
1146 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1148 /* Nonzero if TYPE is a record or union type. */
1149 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1150 (TREE_CODE (TYPE) == RECORD_TYPE \
1151 || TREE_CODE (TYPE) == UNION_TYPE \
1152 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1154 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1155 Keep these checks in ascending code order. */
1157 #define AGGREGATE_TYPE_P(TYPE) \
1158 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1160 /* Nonzero if TYPE represents a pointer or reference type.
1161 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1162 ascending code order. */
1164 #define POINTER_TYPE_P(TYPE) \
1165 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1167 /* Nonzero if this type is a complete type. */
1168 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1170 /* Nonzero if this type is the (possibly qualified) void type. */
1171 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1173 /* Nonzero if this type is complete or is cv void. */
1174 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1175 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1177 /* Nonzero if this type is complete or is an array with unspecified bound. */
1178 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1179 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1182 /* Define many boolean fields that all tree nodes have. */
1184 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
1185 of this is needed. So it cannot be in a register.
1186 In a FUNCTION_DECL it has no meaning.
1187 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1188 In LABEL_DECL nodes, it means a goto for this label has been seen
1189 from a place outside all binding contours that restore stack levels.
1190 In ..._TYPE nodes, it means that objects of this type must be fully
1191 addressable. This means that pieces of this object cannot go into
1192 register parameters, for example. If this a function type, this
1193 means that the value must be returned in memory.
1194 In IDENTIFIER_NODEs, this means that some extern decl for this name
1195 had its address taken. That matters for inline functions. */
1196 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1198 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1199 exit of a function. Calls for which this is true are candidates for tail
1200 call optimizations. */
1201 #define CALL_EXPR_TAILCALL(NODE) \
1202 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1204 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1205 CASE_LOW operand has been processed. */
1206 #define CASE_LOW_SEEN(NODE) \
1207 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1209 #define PREDICT_EXPR_OUTCOME(NODE) \
1210 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1211 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1212 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1213 #define PREDICT_EXPR_PREDICTOR(NODE) \
1214 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1216 /* In a VAR_DECL, nonzero means allocate static storage.
1217 In a FUNCTION_DECL, nonzero if function has been defined.
1218 In a CONSTRUCTOR, nonzero means allocate static storage. */
1219 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1221 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1222 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1224 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1225 should only be executed if an exception is thrown, not on normal exit
1227 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1229 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1230 separate cleanup in honor_protect_cleanup_actions. */
1231 #define TRY_CATCH_IS_CLEANUP(NODE) \
1232 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1234 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1235 CASE_HIGH operand has been processed. */
1236 #define CASE_HIGH_SEEN(NODE) \
1237 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1239 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1240 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1242 /* Used to mark scoped enums. */
1243 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
1245 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
1246 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
1248 /* In an expr node (usually a conversion) this means the node was made
1249 implicitly and should not lead to any sort of warning. In a decl node,
1250 warnings concerning the decl should be suppressed. This is used at
1251 least for used-before-set warnings, and it set after one warning is
1253 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1255 /* Used to indicate that this TYPE represents a compiler-generated entity. */
1256 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
1258 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1259 this string as an argument. */
1260 #define TREE_SYMBOL_REFERENCED(NODE) \
1261 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1263 /* Nonzero in a pointer or reference type means the data pointed to
1264 by this type can alias anything. */
1265 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1266 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1268 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1269 #define MOVE_NONTEMPORAL(NODE) \
1270 (EXPR_CHECK (NODE)->base.static_flag)
1272 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1273 there was an overflow in folding. */
1275 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1277 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1279 #define TREE_OVERFLOW_P(EXPR) \
1280 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1282 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1283 nonzero means name is to be accessible from outside this translation unit.
1284 In an IDENTIFIER_NODE, nonzero means an external declaration
1285 accessible from outside this translation unit was previously seen
1286 for this name in an inner scope. */
1287 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1289 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1290 of cached values, or is something else. */
1291 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1293 /* In a SAVE_EXPR, indicates that the original expression has already
1294 been substituted with a VAR_DECL that contains the value. */
1295 #define SAVE_EXPR_RESOLVED_P(NODE) \
1296 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1298 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1300 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1301 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1303 /* In any expression, decl, or constant, nonzero means it has side effects or
1304 reevaluation of the whole expression could produce a different value.
1305 This is set if any subexpression is a function call, a side effect or a
1306 reference to a volatile variable. In a ..._DECL, this is set only if the
1307 declaration said `volatile'. This will never be set for a constant. */
1308 #define TREE_SIDE_EFFECTS(NODE) \
1309 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1311 /* In a LABEL_DECL, nonzero means this label had its address taken
1312 and therefore can never be deleted and is a jump target for
1314 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1316 /* Nonzero means this expression is volatile in the C sense:
1317 its address should be of type `volatile WHATEVER *'.
1318 In other words, the declared item is volatile qualified.
1319 This is used in _DECL nodes and _REF nodes.
1320 On a FUNCTION_DECL node, this means the function does not
1321 return normally. This is the same effect as setting
1322 the attribute noreturn on the function in C.
1324 In a ..._TYPE node, means this type is volatile-qualified.
1325 But use TYPE_VOLATILE instead of this macro when the node is a type,
1326 because eventually we may make that a different bit.
1328 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1329 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1331 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1332 accessing the memory pointed to won't generate a trap. However,
1333 this only applies to an object when used appropriately: it doesn't
1334 mean that writing a READONLY mem won't trap.
1336 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1337 (or slice of the array) always belongs to the range of the array.
1338 I.e. that the access will not trap, provided that the access to
1339 the base to the array will not trap. */
1340 #define TREE_THIS_NOTRAP(NODE) \
1341 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
1342 ARRAY_RANGE_REF)->base.nothrow_flag)
1344 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1345 nonzero means it may not be the lhs of an assignment.
1346 Nonzero in a FUNCTION_DECL means this function should be treated
1347 as "const" function (can only read its arguments). */
1348 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1350 /* Value of expression is constant. Always on in all ..._CST nodes. May
1351 also appear in an expression or decl where the value is constant. */
1352 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1354 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1355 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1356 (TYPE_CHECK (NODE)->base.constant_flag)
1358 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1359 #define DECL_UNSIGNED(NODE) \
1360 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1362 /* In integral and pointer types, means an unsigned type. */
1363 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1365 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1366 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1367 This is interesting in an inline function, since it might not need
1368 to be compiled separately.
1369 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1370 if the debugging info for the type has been written.
1371 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1372 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1374 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1376 /* Nonzero in a _DECL if the name is used in its scope.
1377 Nonzero in an expr node means inhibit warning if value is unused.
1378 In IDENTIFIER_NODEs, this means that some extern decl for this name
1380 In a BLOCK, this means that the block contains variables that are used. */
1381 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1383 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
1384 throw an exception. In a CALL_EXPR, nonzero means the call cannot
1385 throw. We can't easily check the node type here as the C++
1386 frontend also uses this flag (for AGGR_INIT_EXPR). */
1387 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1389 /* In a CALL_EXPR, means that it's safe to use the target of the call
1390 expansion as the return slot for a call that returns in memory. */
1391 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1392 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1394 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1395 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1397 #define DECL_BY_REFERENCE(NODE) \
1398 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1399 RESULT_DECL)->decl_common.decl_by_reference_flag)
1401 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1402 can be used as restricted tag to disambiguate against other restrict
1403 pointers. Used by fortran to capture something like non-addressability
1404 (which it isn't really because the middle-end does take addresses of
1406 #define DECL_RESTRICTED_P(NODE) \
1407 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1408 RESULT_DECL)->decl_common.decl_restricted_flag)
1410 #define DECL_READ_P(NODE) \
1411 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1413 #define DECL_NONSHAREABLE(NODE) \
1414 (TREE_CHECK2 (NODE, VAR_DECL, \
1415 RESULT_DECL)->decl_common.decl_nonshareable_flag)
1417 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1418 thunked-to function. */
1419 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1421 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
1422 it has been built for the declaration of a variable-sized object. */
1423 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
1424 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1426 /* In a type, nonzero means that all objects of the type are guaranteed by the
1427 language or front-end to be properly aligned, so we can indicate that a MEM
1428 of this type is aligned at least to the alignment of the type, even if it
1429 doesn't appear that it is. We see this, for example, in object-oriented
1430 languages where a tag field may show this is an object of a more-aligned
1431 variant of the more generic type.
1433 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1435 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1437 /* Used in classes in C++. */
1438 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1439 /* Used in classes in C++. */
1440 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1442 /* True if reference type NODE is a C++ rvalue reference. */
1443 #define TYPE_REF_IS_RVALUE(NODE) \
1444 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1446 /* Nonzero in a _DECL if the use of the name is defined as a
1447 deprecated feature by __attribute__((deprecated)). */
1448 #define TREE_DEPRECATED(NODE) \
1449 ((NODE)->base.deprecated_flag)
1451 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1452 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1453 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1454 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1456 /* In fixed-point types, means a saturating type. */
1457 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1459 /* These flags are available for each language front end to use internally. */
1460 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1461 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1462 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1463 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1464 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1465 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1466 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1468 /* Define additional fields and accessors for nodes representing constants. */
1470 /* In an INTEGER_CST node. These two together make a 2-word integer.
1471 If the data type is signed, the value is sign-extended to 2 words
1472 even though not all of them may really be in use.
1473 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1474 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1475 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1476 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1478 #define INT_CST_LT(A, B) \
1479 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1480 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1481 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1483 #define INT_CST_LT_UNSIGNED(A, B) \
1484 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1485 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1486 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1487 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1488 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1490 struct GTY(()) tree_int_cst
{
1491 struct tree_typed typed
;
1495 /* In a REAL_CST node. struct real_value is an opaque entity, with
1496 manipulators defined in real.h. We don't want tree.h depending on
1497 real.h and transitively on tm.h. */
1500 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1501 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1503 struct GTY(()) tree_real_cst
{
1504 struct tree_typed typed
;
1505 struct real_value
* real_cst_ptr
;
1508 /* In a FIXED_CST node. */
1511 #define TREE_FIXED_CST_PTR(NODE) \
1512 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1513 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1515 struct GTY(()) tree_fixed_cst
{
1516 struct tree_typed typed
;
1517 struct fixed_value
* fixed_cst_ptr
;
1520 /* In a STRING_CST */
1521 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1522 #define TREE_STRING_POINTER(NODE) \
1523 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1525 struct GTY(()) tree_string
{
1526 struct tree_typed typed
;
1531 /* In a COMPLEX_CST node. */
1532 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1533 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1535 struct GTY(()) tree_complex
{
1536 struct tree_typed typed
;
1541 /* In a VECTOR_CST node. */
1542 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1544 struct GTY(()) tree_vector
{
1545 struct tree_typed typed
;
1551 /* Define fields and accessors for some special-purpose tree nodes. */
1553 #define IDENTIFIER_LENGTH(NODE) \
1554 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1555 #define IDENTIFIER_POINTER(NODE) \
1556 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1557 #define IDENTIFIER_HASH_VALUE(NODE) \
1558 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1560 /* Translate a hash table identifier pointer to a tree_identifier
1561 pointer, and vice versa. */
1563 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1564 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1565 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1567 struct GTY(()) tree_identifier
{
1568 struct tree_common common
;
1569 struct ht_identifier id
;
1572 /* In a TREE_LIST node. */
1573 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1574 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1576 struct GTY(()) tree_list
{
1577 struct tree_common common
;
1582 /* In a TREE_VEC node. */
1583 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1584 #define TREE_VEC_END(NODE) \
1585 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1587 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1589 struct GTY(()) tree_vec
{
1590 struct tree_common common
;
1592 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
1595 /* In a CONSTRUCTOR node. */
1596 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1597 #define CONSTRUCTOR_ELT(NODE,IDX) \
1598 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1599 #define CONSTRUCTOR_NELTS(NODE) \
1600 (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1602 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1603 value of each element (stored within VAL). IX must be a scratch variable
1604 of unsigned integer type. */
1605 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1606 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1608 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1612 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1613 the value of each element (stored within VAL) and its index (stored
1614 within INDEX). IX must be a scratch variable of unsigned integer type. */
1615 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1616 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1618 : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \
1619 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1623 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1624 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1626 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1627 _ce___->index = INDEX; \
1628 _ce___->value = VALUE; \
1631 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1632 constructor output purposes. */
1633 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1634 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1636 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1637 element. INDEX can optionally design the position of VALUE: in arrays,
1638 it is the index where VALUE has to be placed; in structures, it is the
1639 FIELD_DECL of the member. */
1640 typedef struct GTY(()) constructor_elt_d
{
1645 DEF_VEC_O(constructor_elt
);
1646 DEF_VEC_ALLOC_O(constructor_elt
,gc
);
1648 struct GTY(()) tree_constructor
{
1649 struct tree_typed typed
;
1650 VEC(constructor_elt
,gc
) *elts
;
1653 /* Define fields and accessors for some nodes that represent expressions. */
1655 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1656 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1657 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1658 && integer_zerop (TREE_OPERAND (NODE, 0)))
1660 /* In ordinary expression nodes. */
1661 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1662 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1664 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1665 length. Its value includes the length operand itself; that is,
1666 the minimum valid length is 1.
1667 Note that we have to bypass the use of TREE_OPERAND to access
1668 that field to avoid infinite recursion in expanding the macros. */
1669 #define VL_EXP_OPERAND_LENGTH(NODE) \
1670 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1672 /* Nonzero if is_gimple_debug() may possibly hold. */
1673 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1675 /* In a LOOP_EXPR node. */
1676 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1678 /* The source location of this expression. Non-tree_exp nodes such as
1679 decls and constants can be shared among multiple locations, so
1681 #define EXPR_LOCATION(NODE) \
1682 (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1683 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1684 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1685 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) ? (NODE)->exp.locus : input_location)
1686 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1687 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1689 /* True if a tree is an expression or statement that can have a
1691 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1693 extern void protected_set_expr_location (tree
, location_t
);
1695 /* In a TARGET_EXPR node. */
1696 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1697 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1698 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1700 /* DECL_EXPR accessor. This gives access to the DECL associated with
1701 the given declaration statement. */
1702 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1704 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1706 /* COMPOUND_LITERAL_EXPR accessors. */
1707 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1708 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1709 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1710 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1712 /* SWITCH_EXPR accessors. These give access to the condition, body and
1713 original condition type (before any compiler conversions)
1714 of the switch statement, respectively. */
1715 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1716 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1717 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1719 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1720 of a case label, respectively. */
1721 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1722 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1723 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1724 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1726 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1727 corresponding MEM_REF operands. */
1728 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1729 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1730 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1731 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1732 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1734 /* The operands of a BIND_EXPR. */
1735 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1736 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1737 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1739 /* GOTO_EXPR accessor. This gives access to the label associated with
1740 a goto statement. */
1741 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1743 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1744 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1745 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1747 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1748 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1749 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1750 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1751 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1752 /* Nonzero if we want to create an ASM_INPUT instead of an
1753 ASM_OPERAND with no operands. */
1754 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1755 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1757 /* COND_EXPR accessors. */
1758 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1759 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1760 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1762 /* Accessors for the chains of recurrences. */
1763 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1764 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1765 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1766 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1768 /* LABEL_EXPR accessor. This gives access to the label associated with
1769 the given label expression. */
1770 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1772 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1773 accessors for SSA operands. */
1775 /* CATCH_EXPR accessors. */
1776 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1777 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1779 /* EH_FILTER_EXPR accessors. */
1780 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1781 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1783 /* OBJ_TYPE_REF accessors. */
1784 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1785 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1786 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1788 /* ASSERT_EXPR accessors. */
1789 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1790 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1792 /* CALL_EXPR accessors.
1794 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1795 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1796 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1797 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1799 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1800 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1801 the argument count is zero when checking is enabled. Instead, do
1802 the pointer arithmetic to advance past the 3 fixed operands in a
1803 CALL_EXPR. That produces a valid pointer to just past the end of the
1804 operand array, even if it's not valid to dereference it. */
1805 #define CALL_EXPR_ARGP(NODE) \
1806 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1808 /* OpenMP directive and clause accessors. */
1810 #define OMP_BODY(NODE) \
1811 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1812 #define OMP_CLAUSES(NODE) \
1813 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1815 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1816 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1818 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1819 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1821 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1822 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1823 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1825 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1826 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1827 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1828 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1829 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1830 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1832 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1833 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1835 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1837 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1838 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1840 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1842 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1844 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1845 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1847 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1848 #define OMP_CLAUSE_DECL(NODE) \
1849 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1850 OMP_CLAUSE_PRIVATE, \
1851 OMP_CLAUSE_COPYPRIVATE), 0)
1852 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1853 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1854 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1856 /* True on an OMP_SECTION statement that was the last lexical member.
1857 This status is meaningful in the implementation of lastprivate. */
1858 #define OMP_SECTION_LAST(NODE) \
1859 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1861 /* True on an OMP_PARALLEL statement if it represents an explicit
1862 combined parallel work-sharing constructs. */
1863 #define OMP_PARALLEL_COMBINED(NODE) \
1864 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1866 /* True on a PRIVATE clause if its decl is kept around for debugging
1867 information only and its DECL_VALUE_EXPR is supposed to point
1868 to what it has been remapped to. */
1869 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1870 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1872 /* True on a PRIVATE clause if ctor needs access to outer region's
1874 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1875 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1877 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1878 decl is present in the chain. */
1879 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1880 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1881 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1882 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1883 OMP_CLAUSE_LASTPRIVATE),\
1885 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1886 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1888 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1889 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1890 #define OMP_CLAUSE_IF_EXPR(NODE) \
1891 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1892 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1893 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1894 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1895 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1897 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1898 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1899 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1900 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1901 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1902 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1904 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1905 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1906 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1907 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1908 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1909 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1910 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1911 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1912 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1913 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1914 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1915 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1917 enum omp_clause_schedule_kind
1919 OMP_CLAUSE_SCHEDULE_STATIC
,
1920 OMP_CLAUSE_SCHEDULE_DYNAMIC
,
1921 OMP_CLAUSE_SCHEDULE_GUIDED
,
1922 OMP_CLAUSE_SCHEDULE_AUTO
,
1923 OMP_CLAUSE_SCHEDULE_RUNTIME
1926 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1927 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1929 enum omp_clause_default_kind
1931 OMP_CLAUSE_DEFAULT_UNSPECIFIED
,
1932 OMP_CLAUSE_DEFAULT_SHARED
,
1933 OMP_CLAUSE_DEFAULT_NONE
,
1934 OMP_CLAUSE_DEFAULT_PRIVATE
,
1935 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1938 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1939 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1941 struct GTY(()) tree_exp
{
1942 struct tree_typed typed
;
1945 tree
GTY ((special ("tree_exp"),
1946 desc ("TREE_CODE ((tree) &%0)")))
1950 /* SSA_NAME accessors. */
1952 /* Returns the variable being referenced. Once released, this is the
1953 only field that can be relied upon. */
1954 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1956 /* Returns the statement which defines this SSA name. */
1957 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1959 /* Returns the SSA version number of this SSA name. Note that in
1960 tree SSA, version numbers are not per variable and may be recycled. */
1961 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1963 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1964 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1966 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1967 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1969 /* Nonzero if this SSA_NAME expression is currently on the free list of
1970 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1971 has no meaning for an SSA_NAME. */
1972 #define SSA_NAME_IN_FREE_LIST(NODE) \
1973 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1975 /* Nonzero if this SSA_NAME is the default definition for the
1976 underlying symbol. A default SSA name is created for symbol S if
1977 the very first reference to S in the function is a read operation.
1978 Default definitions are always created by an empty statement and
1979 belong to no basic block. */
1980 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1981 SSA_NAME_CHECK (NODE)->base.default_def_flag
1983 /* Attributes for SSA_NAMEs for pointer-type variables. */
1984 #define SSA_NAME_PTR_INFO(N) \
1985 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1987 /* Defined in tree-flow.h. */
1988 struct ptr_info_def
;
1990 /* Immediate use linking structure. This structure is used for maintaining
1991 a doubly linked list of uses of an SSA_NAME. */
1992 typedef struct GTY(()) ssa_use_operand_d
{
1993 struct ssa_use_operand_d
* GTY((skip(""))) prev
;
1994 struct ssa_use_operand_d
* GTY((skip(""))) next
;
1995 /* Immediate uses for a given SSA name are maintained as a cyclic
1996 list. To recognize the root of this list, the location field
1997 needs to point to the original SSA name. Since statements and
1998 SSA names are of different data types, we need this union. See
1999 the explanation in struct immediate_use_iterator_d. */
2000 union { gimple stmt
; tree ssa_name
; } GTY((skip(""))) loc
;
2001 tree
*GTY((skip(""))) use
;
2002 } ssa_use_operand_t
;
2004 /* Return the immediate_use information for an SSA_NAME. */
2005 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
2007 struct GTY(()) tree_ssa_name
{
2008 struct tree_typed typed
;
2010 /* _DECL wrapped by this SSA name. */
2013 /* Statement that defines this SSA name. */
2016 /* SSA version number. */
2017 unsigned int version
;
2019 /* Pointer attributes used for alias analysis. */
2020 struct ptr_info_def
*ptr_info
;
2022 /* Immediate uses list for this SSA_NAME. */
2023 struct ssa_use_operand_d imm_uses
;
2026 struct GTY(()) phi_arg_d
{
2027 /* imm_use MUST be the first element in struct because we do some
2028 pointer arithmetic with it. See phi_arg_index_from_use. */
2029 struct ssa_use_operand_d imm_use
;
2035 #define OMP_CLAUSE_CODE(NODE) \
2036 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2038 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2039 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2041 #define OMP_CLAUSE_CODE(NODE) \
2042 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2044 #define OMP_CLAUSE_OPERAND(NODE, I) \
2045 OMP_CLAUSE_ELT_CHECK (NODE, I)
2047 struct GTY(()) tree_omp_clause
{
2048 struct tree_common common
;
2050 enum omp_clause_code code
;
2051 union omp_clause_subcode
{
2052 enum omp_clause_default_kind default_kind
;
2053 enum omp_clause_schedule_kind schedule_kind
;
2054 enum tree_code reduction_code
;
2055 } GTY ((skip
)) subcode
;
2057 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
2059 gimple_seq gimple_reduction_init
;
2060 gimple_seq gimple_reduction_merge
;
2062 tree
GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops
[1];
2066 /* In a BLOCK node. */
2067 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2068 #define BLOCK_NONLOCALIZED_VARS(NODE) \
2069 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2070 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2071 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
2072 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \
2073 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
2074 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2075 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2076 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
2077 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2078 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
2080 /* An index number for this block. These values are not guaranteed to
2081 be unique across functions -- whether or not they are depends on
2082 the debugging output format in use. */
2083 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2085 /* If block reordering splits a lexical block into discontiguous
2086 address ranges, we'll make a copy of the original block.
2088 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2089 In that case, we have one source block that has been replicated
2090 (through inlining or unrolling) into many logical blocks, and that
2091 these logical blocks have different physical variables in them.
2093 In this case, we have one logical block split into several
2094 non-contiguous address ranges. Most debug formats can't actually
2095 represent this idea directly, so we fake it by creating multiple
2096 logical blocks with the same variables in them. However, for those
2097 that do support non-contiguous regions, these allow the original
2098 logical block to be reconstructed, along with the set of address
2101 One of the logical block fragments is arbitrarily chosen to be
2102 the ORIGIN. The other fragments will point to the origin via
2103 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2104 be null. The list of fragments will be chained through
2105 BLOCK_FRAGMENT_CHAIN from the origin. */
2107 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2108 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2110 /* For an inlined function, this gives the location where it was called
2111 from. This is only set in the top level block, which corresponds to the
2112 inlined function scope. This is used in the debug output routines. */
2114 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2116 struct GTY(()) tree_block
{
2117 struct tree_base base
;
2120 unsigned abstract_flag
: 1;
2121 unsigned block_num
: 31;
2126 VEC(tree
,gc
) *nonlocalized_vars
;
2130 tree abstract_origin
;
2131 tree fragment_origin
;
2132 tree fragment_chain
;
2135 /* Define fields and accessors for nodes representing data types. */
2137 /* See tree.def for documentation of the use of these fields.
2138 Look at the documentation of the various ..._TYPE tree codes.
2140 Note that the type.values, type.minval, and type.maxval fields are
2141 overloaded and used for different macros in different kinds of types.
2142 Each macro must check to ensure the tree node is of the proper kind of
2143 type. Note also that some of the front-ends also overload these fields,
2144 so they must be checked as well. */
2146 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2147 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2148 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2149 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2150 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2151 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2152 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2153 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2154 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2155 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2157 /* Vector types need to check target flags to determine type. */
2158 extern enum machine_mode
vector_type_mode (const_tree
);
2159 #define TYPE_MODE(NODE) \
2160 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2161 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2162 #define SET_TYPE_MODE(NODE, MODE) \
2163 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2165 /* The "canonical" type for this type node, which is used by frontends to
2166 compare the type for equality with another type. If two types are
2167 equal (based on the semantics of the language), then they will have
2168 equivalent TYPE_CANONICAL entries.
2170 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2171 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2172 be used for comparison against other types. Instead, the type is
2173 said to require structural equality checks, described in
2174 TYPE_STRUCTURAL_EQUALITY_P.
2176 For unqualified aggregate and function types the middle-end relies on
2177 TYPE_CANONICAL to tell whether two variables can be assigned
2178 to each other without a conversion. The middle-end also makes sure
2179 to assign the same alias-sets to the type partition with equal
2180 TYPE_CANONICAL of their unqualified variants. */
2181 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2182 /* Indicates that the type node requires structural equality
2183 checks. The compiler will need to look at the composition of the
2184 type to determine whether it is equal to another type, rather than
2185 just comparing canonical type pointers. For instance, we would need
2186 to look at the return and parameter types of a FUNCTION_TYPE
2188 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2189 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2190 type node requires structural equality. */
2191 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2193 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2194 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2196 /* The (language-specific) typed-based alias set for this type.
2197 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2198 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2199 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2200 type can alias objects of any type. */
2201 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2203 /* Nonzero iff the typed-based alias set for this type has been
2205 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2206 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2208 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2210 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2212 /* The alignment necessary for objects of this type.
2213 The value is an int, measured in bits. */
2214 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
2216 /* 1 if the alignment for this type was requested by "aligned" attribute,
2217 0 if it is the default for this type. */
2218 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.user_align)
2220 /* The alignment for NODE, in bytes. */
2221 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2223 /* If your language allows you to declare types, and you want debug info
2224 for them, then you need to generate corresponding TYPE_DECL nodes.
2225 These "stub" TYPE_DECL nodes have no name, and simply point at the
2226 type node. You then set the TYPE_STUB_DECL field of the type node
2227 to point back at the TYPE_DECL node. This allows the debug routines
2228 to know that the two nodes represent the same type, so that we only
2229 get one debug info record for them. */
2230 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2232 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2233 has BLKmode only because it lacks the alignment requirement for
2235 #define TYPE_NO_FORCE_BLK(NODE) \
2236 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2238 /* In an INTEGER_TYPE, it means the type represents a size. We use
2239 this both for validity checking and to permit optimizations that
2240 are unsafe for other types. Note that the C `size_t' type should
2241 *not* have this flag set. The `size_t' type is simply a typedef
2242 for an ordinary integer type that happens to be the type of an
2243 expression returned by `sizeof'; `size_t' has no special
2244 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2245 always actual sizes. */
2246 #define TYPE_IS_SIZETYPE(NODE) \
2247 (INTEGER_TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2249 /* Nonzero in a type considered volatile as a whole. */
2250 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2252 /* Means this type is const-qualified. */
2253 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2255 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2257 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2259 /* If nonzero, type's name shouldn't be emitted into debug info. */
2260 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.nameless_flag)
2262 /* The address space the type is in. */
2263 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space)
2265 /* There is a TYPE_QUAL value for each type qualifier. They can be
2266 combined by bitwise-or to form the complete set of qualifiers for a
2270 TYPE_UNQUALIFIED
= 0x0,
2271 TYPE_QUAL_CONST
= 0x1,
2272 TYPE_QUAL_VOLATILE
= 0x2,
2273 TYPE_QUAL_RESTRICT
= 0x4
2276 /* Encode/decode the named memory support as part of the qualifier. If more
2277 than 8 qualifiers are added, these macros need to be adjusted. */
2278 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2279 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2281 /* Return all qualifiers except for the address space qualifiers. */
2282 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2284 /* Only keep the address space out of the qualifiers and discard the other
2286 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2288 /* The set of type qualifiers for this type. */
2289 #define TYPE_QUALS(NODE) \
2290 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2291 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2292 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2293 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))
2295 /* The same as TYPE_QUALS without the address space qualifications. */
2296 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2297 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2298 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2299 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2301 /* These flags are available for each language front end to use internally. */
2302 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2303 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2304 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2305 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2306 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2307 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2308 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2310 /* Used to keep track of visited nodes in tree traversals. This is set to
2311 0 by copy_node and make_node. */
2312 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2314 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2315 that distinguish string from array of char).
2316 If set in a INTEGER_TYPE, indicates a character type. */
2317 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
2319 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2320 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2321 (((unsigned HOST_WIDE_INT) 1) \
2322 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
2324 /* Set precision to n when we have 2^n sub-parts of the vector. */
2325 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2326 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
2328 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2329 about missing conversions to other vector types of the same size. */
2330 #define TYPE_VECTOR_OPAQUE(NODE) \
2331 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2333 /* Indicates that objects of this type must be initialized by calling a
2334 function when they are created. */
2335 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2336 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2338 /* Indicates that a UNION_TYPE object should be passed the same way that
2339 the first union alternative would be passed, or that a RECORD_TYPE
2340 object should be passed the same way that the first (and only) member
2342 #define TYPE_TRANSPARENT_AGGR(NODE) \
2343 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2345 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2346 address of a component of the type. This is the counterpart of
2347 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2348 #define TYPE_NONALIASED_COMPONENT(NODE) \
2349 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2351 /* Indicated that objects of this type should be laid out in as
2352 compact a way as possible. */
2353 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.packed_flag)
2355 /* Used by type_contains_placeholder_p to avoid recomputation.
2356 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2357 this field directly. */
2358 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2359 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2361 /* The debug output functions use the symtab union field to store
2362 information specific to the debugging format. The different debug
2363 output hooks store different types in the union field. These three
2364 macros are used to access different fields in the union. The debug
2365 hooks are responsible for consistently using only a specific
2368 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2369 hold the type's number in the generated stabs. */
2370 #define TYPE_SYMTAB_ADDRESS(NODE) \
2371 (TYPE_CHECK (NODE)->type_common.symtab.address)
2373 /* Symtab field as a string. Used by COFF generator in sdbout.c to
2374 hold struct/union type tag names. */
2375 #define TYPE_SYMTAB_POINTER(NODE) \
2376 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
2378 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2379 in dwarf2out.c to point to the DIE generated for the type. */
2380 #define TYPE_SYMTAB_DIE(NODE) \
2381 (TYPE_CHECK (NODE)->type_common.symtab.die)
2383 /* The garbage collector needs to know the interpretation of the
2384 symtab field. These constants represent the different types in the
2387 #define TYPE_SYMTAB_IS_ADDRESS (0)
2388 #define TYPE_SYMTAB_IS_POINTER (1)
2389 #define TYPE_SYMTAB_IS_DIE (2)
2393 struct GTY(()) tree_type_common
{
2394 struct tree_common common
;
2400 unsigned int precision
: 10;
2401 unsigned no_force_blk_flag
: 1;
2402 unsigned needs_constructing_flag
: 1;
2403 unsigned transparent_aggr_flag
: 1;
2404 unsigned restrict_flag
: 1;
2405 unsigned contains_placeholder_bits
: 2;
2407 ENUM_BITFIELD(machine_mode
) mode
: 8;
2409 unsigned string_flag
: 1;
2410 unsigned lang_flag_0
: 1;
2411 unsigned lang_flag_1
: 1;
2412 unsigned lang_flag_2
: 1;
2413 unsigned lang_flag_3
: 1;
2414 unsigned lang_flag_4
: 1;
2415 unsigned lang_flag_5
: 1;
2416 unsigned lang_flag_6
: 1;
2419 alias_set_type alias_set
;
2422 union tree_type_symtab
{
2423 int GTY ((tag ("TYPE_SYMTAB_IS_ADDRESS"))) address
;
2424 const char * GTY ((tag ("TYPE_SYMTAB_IS_POINTER"))) pointer
;
2425 struct die_struct
* GTY ((tag ("TYPE_SYMTAB_IS_DIE"))) die
;
2426 } GTY ((desc ("debug_hooks->tree_type_symtab_field"))) symtab
;
2434 #define TYPE_LANG_SPECIFIC(NODE) \
2435 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2437 struct GTY(()) tree_type_with_lang_specific
{
2438 struct tree_type_common common
;
2439 /* Points to a structure whose details depend on the language in use. */
2440 struct lang_type
*lang_specific
;
2443 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2444 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2445 #define TYPE_FIELDS(NODE) \
2446 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2447 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type_non_common.values)
2448 #define TYPE_ARG_TYPES(NODE) \
2449 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2450 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK(NODE)->type_non_common.values)
2452 #define TYPE_METHODS(NODE) \
2453 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2454 #define TYPE_VFIELD(NODE) \
2455 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2456 #define TYPE_METHOD_BASETYPE(NODE) \
2457 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2458 #define TYPE_OFFSET_BASETYPE(NODE) \
2459 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2460 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2461 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2462 #define TYPE_NEXT_PTR_TO(NODE) \
2463 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2464 #define TYPE_NEXT_REF_TO(NODE) \
2465 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2466 #define TYPE_MIN_VALUE(NODE) \
2467 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2468 #define TYPE_MAX_VALUE(NODE) \
2469 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2471 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2472 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2474 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2475 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2477 /* For record and union types, information about this type, as a base type
2479 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo)
2481 /* For non record and union types, used in a language-dependent way. */
2482 #define TYPE_LANG_SLOT_1(NODE) \
2483 (NOT_RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo)
2485 struct GTY(()) tree_type_non_common
{
2486 struct tree_type_with_lang_specific with_lang_specific
;
2493 /* Define accessor macros for information about type inheritance
2496 A "basetype" means a particular usage of a data type for inheritance
2497 in another type. Each such basetype usage has its own "binfo"
2498 object to describe it. The binfo object is a TREE_VEC node.
2500 Inheritance is represented by the binfo nodes allocated for a
2501 given type. For example, given types C and D, such that D is
2502 inherited by C, 3 binfo nodes will be allocated: one for describing
2503 the binfo properties of C, similarly one for D, and one for
2504 describing the binfo properties of D as a base type for C.
2505 Thus, given a pointer to class C, one can get a pointer to the binfo
2506 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2508 /* BINFO specific flags. */
2510 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2511 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2513 /* Flags for language dependent use. */
2514 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2515 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2516 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2517 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2518 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2519 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2520 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2522 /* The actual data type node being inherited in this basetype. */
2523 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2525 /* The offset where this basetype appears in its containing type.
2526 BINFO_OFFSET slot holds the offset (in bytes)
2527 from the base of the complete object to the base of the part of the
2528 object that is allocated on behalf of this `type'.
2529 This is always 0 except when there is multiple inheritance. */
2531 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2532 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2534 /* The virtual function table belonging to this basetype. Virtual
2535 function tables provide a mechanism for run-time method dispatching.
2536 The entries of a virtual function table are language-dependent. */
2538 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2540 /* The virtual functions in the virtual function table. This is
2541 a TREE_LIST that is used as an initial approximation for building
2542 a virtual function table for this basetype. */
2543 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2545 /* A vector of binfos for the direct basetypes inherited by this
2548 If this basetype describes type D as inherited in C, and if the
2549 basetypes of D are E and F, then this vector contains binfos for
2550 inheritance of E and F by C. */
2551 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2553 /* The number of basetypes for NODE. */
2554 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2556 /* Accessor macro to get to the Nth base binfo of this binfo. */
2557 #define BINFO_BASE_BINFO(NODE,N) \
2558 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2559 #define BINFO_BASE_ITERATE(NODE,N,B) \
2560 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2561 #define BINFO_BASE_APPEND(NODE,T) \
2562 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2564 /* For a BINFO record describing a virtual base class, i.e., one where
2565 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2566 base. The actual contents are language-dependent. In the C++
2567 front-end this field is an INTEGER_CST giving an offset into the
2568 vtable where the offset to the virtual base can be found. */
2569 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2571 /* Indicates the accesses this binfo has to its bases. The values are
2572 access_public_node, access_protected_node or access_private_node.
2573 If this array is not present, public access is implied. */
2574 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2576 #define BINFO_BASE_ACCESS(NODE,N) \
2577 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2578 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2579 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2581 /* The index in the VTT where this subobject's sub-VTT can be found.
2582 NULL_TREE if there is no sub-VTT. */
2583 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2585 /* The index in the VTT where the vptr for this subobject can be
2586 found. NULL_TREE if there is no secondary vptr in the VTT. */
2587 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2589 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2590 inheriting this base for non-virtual bases. For virtual bases it
2591 points either to the binfo for which this is a primary binfo, or to
2592 the binfo of the most derived type. */
2593 #define BINFO_INHERITANCE_CHAIN(NODE) \
2594 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2596 struct GTY (()) tree_binfo
{
2597 struct tree_common common
;
2603 VEC(tree
,gc
) *base_accesses
;
2609 VEC(tree
,none
) base_binfos
;
2613 /* Define fields and accessors for nodes representing declared names. */
2615 /* Nonzero if DECL represents a variable for the SSA passes. */
2616 #define SSA_VAR_P(DECL) \
2617 (TREE_CODE (DECL) == VAR_DECL \
2618 || TREE_CODE (DECL) == PARM_DECL \
2619 || TREE_CODE (DECL) == RESULT_DECL \
2620 || (TREE_CODE (DECL) == SSA_NAME \
2621 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2622 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2623 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2628 /* Enumerate visibility settings. */
2629 #ifndef SYMBOL_VISIBILITY_DEFINED
2630 #define SYMBOL_VISIBILITY_DEFINED
2631 enum symbol_visibility
2634 VISIBILITY_PROTECTED
,
2642 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2644 /* This is the name of the object as written by the user.
2645 It is an IDENTIFIER_NODE. */
2646 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2648 /* Every ..._DECL node gets a unique number. */
2649 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2651 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2653 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2655 /* Every ..._DECL node gets a unique number that stays the same even
2656 when the decl is copied by the inliner once it is set. */
2657 #define DECL_PT_UID(NODE) \
2658 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2659 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2660 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2661 #define SET_DECL_PT_UID(NODE, UID) \
2662 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2663 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2664 be preserved when copyin the decl. */
2665 #define DECL_PT_UID_SET_P(NODE) \
2666 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2668 /* These two fields describe where in the source code the declaration
2669 was. If the declaration appears in several places (as for a C
2670 function that is declared first and then defined later), this
2671 information should refer to the definition. */
2672 #define DECL_SOURCE_LOCATION(NODE) \
2673 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2674 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2675 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2676 #define DECL_IS_BUILTIN(DECL) \
2677 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2679 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2680 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2681 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2682 nodes, this points to either the FUNCTION_DECL for the containing
2683 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2684 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2686 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2687 #define DECL_FIELD_CONTEXT(NODE) \
2688 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2690 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2691 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.nameless_flag)
2693 struct GTY(()) tree_decl_minimal
{
2694 struct tree_common common
;
2702 /* For any sort of a ..._DECL node, this points to the original (abstract)
2703 decl node which this decl is an inlined/cloned instance of, or else it
2704 is NULL indicating that this decl is not an instance of some other decl.
2706 The C front-end also uses this in a nested declaration of an inline
2707 function, to point back to the definition. */
2708 #define DECL_ABSTRACT_ORIGIN(NODE) \
2709 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2711 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2712 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2713 #define DECL_ORIGIN(NODE) \
2714 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2716 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2717 inline instance of some original (abstract) decl from an inline function;
2718 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2719 nodes can also have their abstract origin set to themselves. */
2720 #define DECL_FROM_INLINE(NODE) \
2721 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2722 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2724 /* In a DECL this is the field where attributes are stored. */
2725 #define DECL_ATTRIBUTES(NODE) \
2726 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2728 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2729 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2730 For a VAR_DECL, holds the initial value.
2731 For a PARM_DECL, used for DECL_ARG_TYPE--default
2732 values for parameters are encoded in the type of the function,
2733 not in the PARM_DECL slot.
2734 For a FIELD_DECL, this is used for enumeration values and the C
2735 frontend uses it for temporarily storing bitwidth of bitfields.
2737 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2738 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2740 /* Holds the size of the datum, in bits, as a tree expression.
2741 Need not be constant. */
2742 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2743 /* Likewise for the size in bytes. */
2744 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2745 /* Holds the alignment required for the datum, in bits. */
2746 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2747 /* The alignment of NODE, in bytes. */
2748 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2749 /* Set if the alignment of this DECL has been set by the user, for
2750 example with an 'aligned' attribute. */
2751 #define DECL_USER_ALIGN(NODE) \
2752 (DECL_COMMON_CHECK (NODE)->base.user_align)
2753 /* Holds the machine mode corresponding to the declaration of a variable or
2754 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2756 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2758 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2759 operation it is. Note, however, that this field is overloaded, with
2760 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2761 checked before any access to the former. */
2762 #define DECL_FUNCTION_CODE(NODE) \
2763 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2764 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2765 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2767 #define DECL_FUNCTION_PERSONALITY(NODE) \
2768 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2770 /* Nonzero for a given ..._DECL node means that the name of this node should
2771 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2772 the associated type should be ignored. For a FUNCTION_DECL, the body of
2773 the function should also be ignored. */
2774 #define DECL_IGNORED_P(NODE) \
2775 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2777 /* Nonzero for a given ..._DECL node means that this node represents an
2778 "abstract instance" of the given declaration (e.g. in the original
2779 declaration of an inline function). When generating symbolic debugging
2780 information, we mustn't try to generate any address information for nodes
2781 marked as "abstract instances" because we don't actually generate
2782 any code or allocate any data space for such instances. */
2783 #define DECL_ABSTRACT(NODE) \
2784 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2786 /* Language-specific decl information. */
2787 #define DECL_LANG_SPECIFIC(NODE) \
2788 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2790 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2791 do not allocate storage, and refer to a definition elsewhere. Note that
2792 this does not necessarily imply the entity represented by NODE
2793 has no program source-level definition in this translation unit. For
2794 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2795 DECL_EXTERNAL may be true simultaneously; that can be the case for
2796 a C99 "extern inline" function. */
2797 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2799 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2800 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2802 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2804 Also set in some languages for variables, etc., outside the normal
2805 lexical scope, such as class instance variables. */
2806 #define DECL_NONLOCAL(NODE) \
2807 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2809 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2810 Used in FIELD_DECLs for vtable pointers.
2811 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2812 #define DECL_VIRTUAL_P(NODE) \
2813 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2815 /* Used to indicate that this DECL represents a compiler-generated entity. */
2816 #define DECL_ARTIFICIAL(NODE) \
2817 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2819 /* Additional flags for language-specific uses. */
2820 #define DECL_LANG_FLAG_0(NODE) \
2821 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2822 #define DECL_LANG_FLAG_1(NODE) \
2823 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2824 #define DECL_LANG_FLAG_2(NODE) \
2825 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2826 #define DECL_LANG_FLAG_3(NODE) \
2827 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2828 #define DECL_LANG_FLAG_4(NODE) \
2829 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2830 #define DECL_LANG_FLAG_5(NODE) \
2831 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2832 #define DECL_LANG_FLAG_6(NODE) \
2833 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2834 #define DECL_LANG_FLAG_7(NODE) \
2835 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2836 #define DECL_LANG_FLAG_8(NODE) \
2837 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2839 /* Nonzero for a scope which is equal to file scope. */
2840 #define SCOPE_FILE_SCOPE_P(EXP) \
2841 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2842 /* Nonzero for a decl which is at file scope. */
2843 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2844 /* Nonzero for a type which is at file scope. */
2845 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2847 /* Nonzero for a decl that is decorated using attribute used.
2848 This indicates to compiler tools that this decl needs to be preserved. */
2849 #define DECL_PRESERVE_P(DECL) \
2850 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2852 /* For function local variables of COMPLEX and VECTOR types,
2853 indicates that the variable is not aliased, and that all
2854 modifications to the variable have been adjusted so that
2855 they are killing assignments. Thus the variable may now
2856 be treated as a GIMPLE register, and use real instead of
2857 virtual ops in SSA form. */
2858 #define DECL_GIMPLE_REG_P(DECL) \
2859 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2861 struct GTY(()) tree_decl_common
{
2862 struct tree_decl_minimal common
;
2865 ENUM_BITFIELD(machine_mode
) mode
: 8;
2867 unsigned nonlocal_flag
: 1;
2868 unsigned virtual_flag
: 1;
2869 unsigned ignored_flag
: 1;
2870 unsigned abstract_flag
: 1;
2871 unsigned artificial_flag
: 1;
2872 unsigned preserve_flag
: 1;
2873 unsigned debug_expr_is_from
: 1;
2875 unsigned lang_flag_0
: 1;
2876 unsigned lang_flag_1
: 1;
2877 unsigned lang_flag_2
: 1;
2878 unsigned lang_flag_3
: 1;
2879 unsigned lang_flag_4
: 1;
2880 unsigned lang_flag_5
: 1;
2881 unsigned lang_flag_6
: 1;
2882 unsigned lang_flag_7
: 1;
2883 unsigned lang_flag_8
: 1;
2885 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2886 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2887 unsigned decl_flag_0
: 1;
2888 /* In FIELD_DECL, this is DECL_BIT_FIELD
2889 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2890 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2891 unsigned decl_flag_1
: 1;
2892 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2893 In VAR_DECL, PARM_DECL and RESULT_DECL, this is
2894 DECL_HAS_VALUE_EXPR_P. */
2895 unsigned decl_flag_2
: 1;
2896 /* Logically, these two would go in a theoretical base shared by var and
2898 unsigned gimple_reg_flag
: 1;
2899 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2900 unsigned decl_by_reference_flag
: 1;
2901 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2902 unsigned decl_restricted_flag
: 1;
2904 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2906 unsigned decl_read_flag
: 1;
2908 /* In VAR_DECL or RESULT_DECL set when significant code movement precludes
2909 attempting to share the stack slot with some other variable. */
2910 unsigned decl_nonshareable_flag
: 1;
2912 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2913 unsigned int off_align
: 8;
2915 /* 24-bits unused. */
2917 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2920 /* UID for points-to sets, stable over copying from inlining. */
2921 unsigned int pt_uid
;
2926 tree abstract_origin
;
2928 /* Points to a structure whose details depend on the language in use. */
2929 struct lang_decl
*lang_specific
;
2932 extern tree
decl_value_expr_lookup (tree
);
2933 extern void decl_value_expr_insert (tree
, tree
);
2935 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2936 if transformations have made this more complicated than evaluating the
2937 decl itself. This should only be used for debugging; once this field has
2938 been set, the decl itself may not legitimately appear in the function. */
2939 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2940 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2941 ->decl_common.decl_flag_2)
2942 #define DECL_VALUE_EXPR(NODE) \
2943 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2944 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2945 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2947 /* Holds the RTL expression for the value of a variable or function.
2948 This value can be evaluated lazily for functions, variables with
2949 static storage duration, and labels. */
2950 #define DECL_RTL(NODE) \
2951 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2952 ? (NODE)->decl_with_rtl.rtl \
2953 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2955 /* Set the DECL_RTL for NODE to RTL. */
2956 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2958 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2959 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2961 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2962 #define DECL_RTL_SET_P(NODE) \
2963 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2965 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2966 NODE1, it will not be set for NODE2; this is a lazy copy. */
2967 #define COPY_DECL_RTL(NODE1, NODE2) \
2968 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2969 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2971 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2972 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2974 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2975 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2977 struct GTY(()) tree_decl_with_rtl
{
2978 struct tree_decl_common common
;
2982 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2983 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2984 of the structure. */
2985 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2987 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2988 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2989 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2990 natural alignment of the field's type). */
2991 #define DECL_FIELD_BIT_OFFSET(NODE) \
2992 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2994 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2995 if so, the type that was originally specified for it.
2996 TREE_TYPE may have been modified (in finish_struct). */
2997 #define DECL_BIT_FIELD_TYPE(NODE) \
2998 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
3000 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
3001 if nonzero, indicates that the field occupies the type. */
3002 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3004 /* For FIELD_DECLs, off_align holds the number of low-order bits of
3005 DECL_FIELD_OFFSET which are known to be always zero.
3006 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
3008 #define DECL_OFFSET_ALIGN(NODE) \
3009 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
3011 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
3012 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
3013 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
3015 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
3016 which this FIELD_DECL is defined. This information is needed when
3017 writing debugging information about vfield and vbase decls for C++. */
3018 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
3020 /* In a FIELD_DECL, indicates this field should be bit-packed. */
3021 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.packed_flag)
3023 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
3025 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3027 /* Used in a FIELD_DECL to indicate that we cannot form the address of
3028 this component. This makes it possible for Type-Based Alias Analysis
3029 to disambiguate accesses to this field with indirect accesses using
3032 struct S { int i; } s;
3035 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
3037 From the implementation's viewpoint, the alias set of the type of the
3038 field 'i' (int) will not be recorded as a subset of that of the type of
3039 's' (struct S) in record_component_aliases. The counterpart is that
3040 accesses to s.i must not be given the alias set of the type of 'i'
3041 (int) but instead directly that of the type of 's' (struct S). */
3042 #define DECL_NONADDRESSABLE_P(NODE) \
3043 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3045 struct GTY(()) tree_field_decl
{
3046 struct tree_decl_common common
;
3049 tree bit_field_type
;
3055 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3056 dense, unique within any one function, and may be used to index arrays.
3057 If the value is -1, then no UID has been assigned. */
3058 #define LABEL_DECL_UID(NODE) \
3059 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
3061 /* In a LABEL_DECL, the EH region number for which the label is the
3062 post_landing_pad. */
3063 #define EH_LANDING_PAD_NR(NODE) \
3064 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
3066 /* In LABEL_DECL nodes, nonzero means that an error message about
3067 jumping into such a binding contour has been printed for this label. */
3068 #define DECL_ERROR_ISSUED(NODE) \
3069 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
3071 struct GTY(()) tree_label_decl
{
3072 struct tree_decl_with_rtl common
;
3074 int eh_landing_pad_nr
;
3078 struct GTY(()) tree_result_decl
{
3079 struct tree_decl_with_rtl common
;
3080 struct var_ann_d
*ann
;
3083 struct GTY(()) tree_const_decl
{
3084 struct tree_decl_common common
;
3087 /* For a PARM_DECL, records the data type used to pass the argument,
3088 which may be different from the type seen in the program. */
3089 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3091 /* For PARM_DECL, holds an RTL for the stack slot or register
3092 where the data was actually passed. */
3093 #define DECL_INCOMING_RTL(NODE) \
3094 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3096 struct GTY(()) tree_parm_decl
{
3097 struct tree_decl_with_rtl common
;
3099 struct var_ann_d
*ann
;
3103 /* Nonzero for a given ..._DECL node means that no warnings should be
3104 generated just because this node is unused. */
3105 #define DECL_IN_SYSTEM_HEADER(NODE) \
3106 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
3108 /* Used to indicate that the linkage status of this DECL is not yet known,
3109 so it should not be output now. */
3110 #define DECL_DEFER_OUTPUT(NODE) \
3111 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3113 /* In a VAR_DECL that's static,
3114 nonzero if the space is in the text section. */
3115 #define DECL_IN_TEXT_SECTION(NODE) \
3116 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3118 /* In a VAR_DECL that's static,
3119 nonzero if it belongs to the global constant pool. */
3120 #define DECL_IN_CONSTANT_POOL(NODE) \
3121 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3123 /* Nonzero for a given ..._DECL node means that this node should be
3124 put in .common, if possible. If a DECL_INITIAL is given, and it
3125 is not error_mark_node, then the decl cannot be put in .common. */
3126 #define DECL_COMMON(NODE) \
3127 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3129 /* In a VAR_DECL, nonzero if the decl is a register variable with
3130 an explicit asm specification. */
3131 #define DECL_HARD_REGISTER(NODE) \
3132 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3134 /* Used to indicate that this DECL has weak linkage. */
3135 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3137 /* Used to indicate that the DECL is a dllimport. */
3138 #define DECL_DLLIMPORT_P(NODE) \
3139 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3141 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3142 not be put out unless it is needed in this translation unit.
3143 Entities like this are shared across translation units (like weak
3144 entities), but are guaranteed to be generated by any translation
3145 unit that needs them, and therefore need not be put out anywhere
3146 where they are not needed. DECL_COMDAT is just a hint to the
3147 back-end; it is up to front-ends which set this flag to ensure
3148 that there will never be any harm, other than bloat, in putting out
3149 something which is DECL_COMDAT. */
3150 #define DECL_COMDAT(NODE) \
3151 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3153 #define DECL_COMDAT_GROUP(NODE) \
3154 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
3156 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3157 multiple translation units should be merged. */
3158 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
3160 /* The name of the object as the assembler will see it (but before any
3161 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3162 as DECL_NAME. It is an IDENTIFIER_NODE. */
3163 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3165 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3166 This is true of all DECL nodes except FIELD_DECL. */
3167 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3168 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3170 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3171 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3173 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3174 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
3175 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3177 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3178 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3179 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3181 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3182 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3183 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3184 semantics of using this macro, are different than saying:
3186 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3188 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3190 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3191 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3192 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3193 DECL_ASSEMBLER_NAME (DECL1)) \
3196 /* Records the section name in a section attribute. Used to pass
3197 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3198 #define DECL_SECTION_NAME(NODE) \
3199 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3201 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3202 this variable in a BIND_EXPR. */
3203 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3204 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3206 /* Value of the decls's visibility attribute */
3207 #define DECL_VISIBILITY(NODE) \
3208 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3210 /* Nonzero means that the decl had its visibility specified rather than
3212 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3213 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3215 /* In a VAR_DECL, the model to use if the data should be allocated from
3216 thread-local storage. */
3217 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3219 /* In a VAR_DECL, nonzero if the data should be allocated from
3220 thread-local storage. */
3221 #define DECL_THREAD_LOCAL_P(NODE) \
3222 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3224 /* In a non-local VAR_DECL with static storage duration, true if the
3225 variable has an initialization priority. If false, the variable
3226 will be initialized at the DEFAULT_INIT_PRIORITY. */
3227 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3228 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3230 /* Specify whether the section name was set by user or by
3231 compiler via -ffunction-sections. */
3232 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
3233 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
3235 struct GTY(()) tree_decl_with_vis
{
3236 struct tree_decl_with_rtl common
;
3237 tree assembler_name
;
3241 /* Belong to VAR_DECL exclusively. */
3242 unsigned defer_output
: 1;
3243 unsigned hard_register
: 1;
3244 unsigned thread_local
: 1;
3245 unsigned common_flag
: 1;
3246 unsigned in_text_section
: 1;
3247 unsigned in_constant_pool
: 1;
3248 unsigned dllimport_flag
: 1;
3249 /* Don't belong to VAR_DECL exclusively. */
3250 unsigned weak_flag
: 1;
3252 unsigned seen_in_bind_expr
: 1;
3253 unsigned comdat_flag
: 1;
3254 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
3255 unsigned visibility_specified
: 1;
3256 /* Belongs to VAR_DECL exclusively. */
3257 ENUM_BITFIELD(tls_model
) tls_model
: 3;
3259 /* Belong to FUNCTION_DECL exclusively. */
3260 unsigned init_priority_p
: 1;
3261 /* Used by C++ only. Might become a generic decl flag. */
3262 unsigned shadowed_for_var_p
: 1;
3263 /* When SECTION_NAME is implied by -ffunsection-section. */
3264 unsigned implicit_section_name_p
: 1;
3265 /* 13 unused bits. */
3268 extern tree
decl_debug_expr_lookup (tree
);
3269 extern void decl_debug_expr_insert (tree
, tree
);
3270 /* For VAR_DECL, this is set to either an expression that it was split
3271 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3272 subexpressions that it was split into. */
3273 #define DECL_DEBUG_EXPR(NODE) \
3274 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3276 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3277 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3279 /* An initialization priority. */
3280 typedef unsigned short priority_type
;
3282 extern priority_type
decl_init_priority_lookup (tree
);
3283 extern priority_type
decl_fini_priority_lookup (tree
);
3284 extern void decl_init_priority_insert (tree
, priority_type
);
3285 extern void decl_fini_priority_insert (tree
, priority_type
);
3287 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3289 #define DECL_INIT_PRIORITY(NODE) \
3290 (decl_init_priority_lookup (NODE))
3291 /* Set the initialization priority for NODE to VAL. */
3292 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3293 (decl_init_priority_insert (NODE, VAL))
3295 /* For a FUNCTION_DECL the finalization priority of NODE. */
3296 #define DECL_FINI_PRIORITY(NODE) \
3297 (decl_fini_priority_lookup (NODE))
3298 /* Set the finalization priority for NODE to VAL. */
3299 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3300 (decl_fini_priority_insert (NODE, VAL))
3302 /* The initialization priority for entities for which no explicit
3303 initialization priority has been specified. */
3304 #define DEFAULT_INIT_PRIORITY 65535
3306 /* The maximum allowed initialization priority. */
3307 #define MAX_INIT_PRIORITY 65535
3309 /* The largest priority value reserved for use by system runtime
3311 #define MAX_RESERVED_INIT_PRIORITY 100
3313 #define DECL_VAR_ANN_PTR(NODE) \
3314 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \
3315 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \
3316 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \
3319 struct GTY(()) tree_var_decl
{
3320 struct tree_decl_with_vis common
;
3321 struct var_ann_d
*ann
;
3325 /* This field is used to reference anything in decl.result and is meant only
3326 for use by the garbage collector. */
3327 #define DECL_RESULT_FLD(NODE) \
3328 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3330 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3331 Before the struct containing the FUNCTION_DECL is laid out,
3332 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3333 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3334 function. When the class is laid out, this pointer is changed
3335 to an INTEGER_CST node which is suitable for use as an index
3336 into the virtual function table.
3337 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3338 #define DECL_VINDEX(NODE) \
3339 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3342 tree_decl_non_common
{
3343 struct tree_decl_with_vis common
;
3344 /* C++ uses this in namespaces. */
3346 /* C++ uses this in templates. */
3348 /* Almost all FE's use this. */
3350 /* C++ uses this in namespaces and function_decls. */
3354 /* In FUNCTION_DECL, holds the decl for the return value. */
3355 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3357 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3358 #define DECL_UNINLINABLE(NODE) \
3359 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3361 /* In a FUNCTION_DECL, the saved representation of the body of the
3363 #define DECL_SAVED_TREE(NODE) \
3364 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3366 /* Nonzero in a FUNCTION_DECL means this function should be treated
3367 as if it were a malloc, meaning it returns a pointer that is
3369 #define DECL_IS_MALLOC(NODE) \
3370 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3372 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3373 C++ operator new, meaning that it returns a pointer for which we
3374 should not use type based aliasing. */
3375 #define DECL_IS_OPERATOR_NEW(NODE) \
3376 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3378 /* Nonzero in a FUNCTION_DECL means this function may return more
3380 #define DECL_IS_RETURNS_TWICE(NODE) \
3381 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3383 /* Nonzero in a FUNCTION_DECL means this function should be treated
3384 as "pure" function (like const function, but may read global memory). */
3385 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3387 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3388 the const or pure function may not terminate. When this is nonzero
3389 for a const or pure function, it can be dealt with by cse passes
3390 but cannot be removed by dce passes since you are not allowed to
3391 change an infinite looping program into one that terminates without
3393 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3394 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3396 /* Nonzero in a FUNCTION_DECL means this function should be treated
3397 as "novops" function (function that does not read global memory,
3398 but may have arbitrary side effects). */
3399 #define DECL_IS_NOVOPS(NODE) \
3400 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3402 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3403 at the beginning or end of execution. */
3404 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3405 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3407 #define DECL_STATIC_DESTRUCTOR(NODE) \
3408 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3410 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3411 be instrumented with calls to support routines. */
3412 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3413 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3415 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3416 disabled in this function. */
3417 #define DECL_NO_LIMIT_STACK(NODE) \
3418 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3420 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3421 #define DECL_STATIC_CHAIN(NODE) \
3422 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3424 /* Nonzero for a decl that cgraph has decided should be inlined into
3425 at least one call site. It is not meaningful to look at this
3426 directly; always use cgraph_function_possibly_inlined_p. */
3427 #define DECL_POSSIBLY_INLINED(DECL) \
3428 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3430 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3431 such as via the `inline' keyword in C/C++. This flag controls the linkage
3432 semantics of 'inline' */
3433 #define DECL_DECLARED_INLINE_P(NODE) \
3434 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3436 /* Nonzero in a FUNCTION_DECL means this function should not get
3437 -Winline warnings. */
3438 #define DECL_NO_INLINE_WARNING_P(NODE) \
3439 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3441 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3442 disregarding size and cost heuristics. This is equivalent to using
3443 the always_inline attribute without the required diagnostics if the
3444 function cannot be inlined. */
3445 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3446 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3448 extern VEC(tree
, gc
) **decl_debug_args_lookup (tree
);
3449 extern VEC(tree
, gc
) **decl_debug_args_insert (tree
);
3451 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3452 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3453 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3455 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3456 that describes the status of this function. */
3457 #define DECL_STRUCT_FUNCTION(NODE) \
3458 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3460 /* In a FUNCTION_DECL, nonzero means a built in function. */
3461 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3463 /* For a builtin function, identify which part of the compiler defined it. */
3464 #define DECL_BUILT_IN_CLASS(NODE) \
3465 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3467 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3468 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3470 #define DECL_ARGUMENTS(NODE) \
3471 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3472 #define DECL_ARGUMENT_FLD(NODE) \
3473 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3475 /* In FUNCTION_DECL, the function specific target options to use when compiling
3477 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3478 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3480 /* In FUNCTION_DECL, the function specific optimization options to use when
3481 compiling this function. */
3482 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3483 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3485 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3486 arguments/result/saved_tree fields by front ends. It was either inherit
3487 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3488 which seemed a bit strange. */
3490 struct GTY(()) tree_function_decl
{
3491 struct tree_decl_non_common common
;
3495 /* The personality function. Used for stack unwinding. */
3498 /* Function specific options that are used by this function. */
3499 tree function_specific_target
; /* target options */
3500 tree function_specific_optimization
; /* optimization options */
3502 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3503 DECL_FUNCTION_CODE. Otherwise unused.
3504 ??? The bitfield needs to be able to hold all target function
3506 ENUM_BITFIELD(built_in_function
) function_code
: 11;
3507 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
3509 unsigned static_ctor_flag
: 1;
3510 unsigned static_dtor_flag
: 1;
3511 unsigned uninlinable
: 1;
3513 unsigned possibly_inlined
: 1;
3514 unsigned novops_flag
: 1;
3515 unsigned returns_twice_flag
: 1;
3516 unsigned malloc_flag
: 1;
3517 unsigned operator_new_flag
: 1;
3518 unsigned declared_inline_flag
: 1;
3519 unsigned regdecl_flag
: 1;
3520 unsigned no_inline_warning_flag
: 1;
3522 unsigned no_instrument_function_entry_exit
: 1;
3523 unsigned no_limit_stack
: 1;
3524 unsigned disregard_inline_limits
: 1;
3525 unsigned pure_flag
: 1;
3526 unsigned looping_const_or_pure_flag
: 1;
3527 unsigned has_debug_args_flag
: 1;
3532 /* The source language of the translation-unit. */
3533 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3534 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3536 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3538 struct GTY(()) tree_translation_unit_decl
{
3539 struct tree_decl_common common
;
3540 /* Source language of this translation unit. Used for DWARF output. */
3541 const char * GTY((skip(""))) language
;
3542 /* TODO: Non-optimization used to build this translation unit. */
3543 /* TODO: Root of a partial DWARF tree for global types and decls. */
3546 /* A vector of all translation-units. */
3547 extern GTY (()) VEC(tree
,gc
) *all_translation_units
;
3549 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3550 #define DECL_ORIGINAL_TYPE(NODE) \
3551 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3553 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3554 into stabs. Instead it will generate cross reference ('x') of names.
3555 This uses the same flag as DECL_EXTERNAL. */
3556 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3557 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3559 /* Getter of the imported declaration associated to the
3560 IMPORTED_DECL node. */
3561 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3562 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3564 struct GTY(()) tree_type_decl
{
3565 struct tree_decl_non_common common
;
3569 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3570 To reduce overhead, the nodes containing the statements are not trees.
3571 This avoids the overhead of tree_common on all linked list elements.
3573 Use the interface in tree-iterator.h to access this node. */
3575 #define STATEMENT_LIST_HEAD(NODE) \
3576 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3577 #define STATEMENT_LIST_TAIL(NODE) \
3578 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3580 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3582 struct tree_statement_list_node
*prev
;
3583 struct tree_statement_list_node
*next
;
3587 struct GTY(()) tree_statement_list
3589 struct tree_typed typed
;
3590 struct tree_statement_list_node
*head
;
3591 struct tree_statement_list_node
*tail
;
3595 /* Optimization options used by a function. */
3597 struct GTY(()) tree_optimization_option
{
3598 struct tree_common common
;
3600 /* The optimization options used by the user. */
3601 struct cl_optimization opts
;
3604 #define TREE_OPTIMIZATION(NODE) \
3605 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3607 /* Return a tree node that encapsulates the current optimization options. */
3608 extern tree
build_optimization_node (void);
3610 /* Target options used by a function. */
3612 struct GTY(()) tree_target_option
{
3613 struct tree_common common
;
3615 /* The optimization options used by the user. */
3616 struct cl_target_option opts
;
3619 #define TREE_TARGET_OPTION(NODE) \
3620 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3622 /* Return a tree node that encapsulates the current target options. */
3623 extern tree
build_target_option_node (void);
3626 /* Define the overall contents of a tree node.
3627 It may be any of the structures declared above
3628 for various types of node. */
3630 union GTY ((ptr_alias (union lang_tree_node
),
3631 desc ("tree_node_structure (&%h)"), variable_size
)) tree_node
{
3632 struct tree_base
GTY ((tag ("TS_BASE"))) base
;
3633 struct tree_typed
GTY ((tag ("TS_TYPED"))) typed
;
3634 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
3635 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
3636 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
3637 struct tree_fixed_cst
GTY ((tag ("TS_FIXED_CST"))) fixed_cst
;
3638 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
3639 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
3640 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
3641 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
3642 struct tree_decl_minimal
GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal
;
3643 struct tree_decl_common
GTY ((tag ("TS_DECL_COMMON"))) decl_common
;
3644 struct tree_decl_with_rtl
GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl
;
3645 struct tree_decl_non_common
GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common
;
3646 struct tree_parm_decl
GTY ((tag ("TS_PARM_DECL"))) parm_decl
;
3647 struct tree_decl_with_vis
GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis
;
3648 struct tree_var_decl
GTY ((tag ("TS_VAR_DECL"))) var_decl
;
3649 struct tree_field_decl
GTY ((tag ("TS_FIELD_DECL"))) field_decl
;
3650 struct tree_label_decl
GTY ((tag ("TS_LABEL_DECL"))) label_decl
;
3651 struct tree_result_decl
GTY ((tag ("TS_RESULT_DECL"))) result_decl
;
3652 struct tree_const_decl
GTY ((tag ("TS_CONST_DECL"))) const_decl
;
3653 struct tree_type_decl
GTY ((tag ("TS_TYPE_DECL"))) type_decl
;
3654 struct tree_function_decl
GTY ((tag ("TS_FUNCTION_DECL"))) function_decl
;
3655 struct tree_translation_unit_decl
GTY ((tag ("TS_TRANSLATION_UNIT_DECL")))
3656 translation_unit_decl
;
3657 struct tree_type_common
GTY ((tag ("TS_TYPE_COMMON"))) type_common
;
3658 struct tree_type_with_lang_specific
GTY ((tag ("TS_TYPE_WITH_LANG_SPECIFIC")))
3659 type_with_lang_specific
;
3660 struct tree_type_non_common
GTY ((tag ("TS_TYPE_NON_COMMON")))
3662 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
3663 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
3664 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
3665 struct tree_ssa_name
GTY ((tag ("TS_SSA_NAME"))) ssa_name
;
3666 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
3667 struct tree_binfo
GTY ((tag ("TS_BINFO"))) binfo
;
3668 struct tree_statement_list
GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list
;
3669 struct tree_constructor
GTY ((tag ("TS_CONSTRUCTOR"))) constructor
;
3670 struct tree_omp_clause
GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause
;
3671 struct tree_optimization_option
GTY ((tag ("TS_OPTIMIZATION"))) optimization
;
3672 struct tree_target_option
GTY ((tag ("TS_TARGET_OPTION"))) target_option
;
3675 /* Standard named or nameless data types of the C compiler. */
3698 TI_INTEGER_MINUS_ONE
,
3715 TI_COMPLEX_INTEGER_TYPE
,
3716 TI_COMPLEX_FLOAT_TYPE
,
3717 TI_COMPLEX_DOUBLE_TYPE
,
3718 TI_COMPLEX_LONG_DOUBLE_TYPE
,
3722 TI_LONG_DOUBLE_TYPE
,
3726 TI_LONG_DOUBLE_PTR_TYPE
,
3727 TI_INTEGER_PTR_TYPE
,
3736 TI_VA_LIST_GPR_COUNTER_FIELD
,
3737 TI_VA_LIST_FPR_COUNTER_FIELD
,
3744 TI_DFLOAT32_PTR_TYPE
,
3745 TI_DFLOAT64_PTR_TYPE
,
3746 TI_DFLOAT128_PTR_TYPE
,
3755 TI_SAT_LLFRACT_TYPE
,
3756 TI_SAT_USFRACT_TYPE
,
3758 TI_SAT_ULFRACT_TYPE
,
3759 TI_SAT_ULLFRACT_TYPE
,
3771 TI_SAT_LLACCUM_TYPE
,
3772 TI_SAT_USACCUM_TYPE
,
3774 TI_SAT_ULACCUM_TYPE
,
3775 TI_SAT_ULLACCUM_TYPE
,
3821 TI_OPTIMIZATION_DEFAULT
,
3822 TI_OPTIMIZATION_CURRENT
,
3823 TI_TARGET_OPTION_DEFAULT
,
3824 TI_TARGET_OPTION_CURRENT
,
3825 TI_CURRENT_TARGET_PRAGMA
,
3826 TI_CURRENT_OPTIMIZE_PRAGMA
,
3831 extern GTY(()) tree global_trees
[TI_MAX
];
3833 #define error_mark_node global_trees[TI_ERROR_MARK]
3835 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3836 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3837 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3838 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3839 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3841 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3842 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3843 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3844 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3845 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3847 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3848 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3850 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3851 #define integer_one_node global_trees[TI_INTEGER_ONE]
3852 #define integer_three_node global_trees[TI_INTEGER_THREE]
3853 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3854 #define size_zero_node global_trees[TI_SIZE_ZERO]
3855 #define size_one_node global_trees[TI_SIZE_ONE]
3856 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3857 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3858 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3860 /* Base access nodes. */
3861 #define access_public_node global_trees[TI_PUBLIC]
3862 #define access_protected_node global_trees[TI_PROTECTED]
3863 #define access_private_node global_trees[TI_PRIVATE]
3865 #define null_pointer_node global_trees[TI_NULL_POINTER]
3867 #define float_type_node global_trees[TI_FLOAT_TYPE]
3868 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3869 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3871 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3872 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3873 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3874 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3876 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3877 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3878 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3879 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3881 #define void_type_node global_trees[TI_VOID_TYPE]
3882 /* The C type `void *'. */
3883 #define ptr_type_node global_trees[TI_PTR_TYPE]
3884 /* The C type `const void *'. */
3885 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3886 /* The C type `size_t'. */
3887 #define size_type_node global_trees[TI_SIZE_TYPE]
3888 #define pid_type_node global_trees[TI_PID_TYPE]
3889 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3890 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3891 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3892 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3893 /* The C type `FILE *'. */
3894 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3896 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3897 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3898 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3900 /* The decimal floating point types. */
3901 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3902 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3903 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3904 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3905 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3906 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3908 /* The fixed-point types. */
3909 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3910 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3911 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3912 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3913 #define sat_unsigned_short_fract_type_node \
3914 global_trees[TI_SAT_USFRACT_TYPE]
3915 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3916 #define sat_unsigned_long_fract_type_node \
3917 global_trees[TI_SAT_ULFRACT_TYPE]
3918 #define sat_unsigned_long_long_fract_type_node \
3919 global_trees[TI_SAT_ULLFRACT_TYPE]
3920 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3921 #define fract_type_node global_trees[TI_FRACT_TYPE]
3922 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3923 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3924 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3925 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3926 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3927 #define unsigned_long_long_fract_type_node \
3928 global_trees[TI_ULLFRACT_TYPE]
3929 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3930 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3931 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3932 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3933 #define sat_unsigned_short_accum_type_node \
3934 global_trees[TI_SAT_USACCUM_TYPE]
3935 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3936 #define sat_unsigned_long_accum_type_node \
3937 global_trees[TI_SAT_ULACCUM_TYPE]
3938 #define sat_unsigned_long_long_accum_type_node \
3939 global_trees[TI_SAT_ULLACCUM_TYPE]
3940 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3941 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3942 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3943 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3944 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3945 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3946 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3947 #define unsigned_long_long_accum_type_node \
3948 global_trees[TI_ULLACCUM_TYPE]
3949 #define qq_type_node global_trees[TI_QQ_TYPE]
3950 #define hq_type_node global_trees[TI_HQ_TYPE]
3951 #define sq_type_node global_trees[TI_SQ_TYPE]
3952 #define dq_type_node global_trees[TI_DQ_TYPE]
3953 #define tq_type_node global_trees[TI_TQ_TYPE]
3954 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3955 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3956 #define usq_type_node global_trees[TI_USQ_TYPE]
3957 #define udq_type_node global_trees[TI_UDQ_TYPE]
3958 #define utq_type_node global_trees[TI_UTQ_TYPE]
3959 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3960 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3961 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3962 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3963 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3964 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3965 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3966 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3967 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3968 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3969 #define ha_type_node global_trees[TI_HA_TYPE]
3970 #define sa_type_node global_trees[TI_SA_TYPE]
3971 #define da_type_node global_trees[TI_DA_TYPE]
3972 #define ta_type_node global_trees[TI_TA_TYPE]
3973 #define uha_type_node global_trees[TI_UHA_TYPE]
3974 #define usa_type_node global_trees[TI_USA_TYPE]
3975 #define uda_type_node global_trees[TI_UDA_TYPE]
3976 #define uta_type_node global_trees[TI_UTA_TYPE]
3977 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3978 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3979 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3980 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3981 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3982 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3983 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3984 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3986 /* The node that should be placed at the end of a parameter list to
3987 indicate that the function does not take a variable number of
3988 arguments. The TREE_VALUE will be void_type_node and there will be
3989 no TREE_CHAIN. Language-independent code should not assume
3990 anything else about this node. */
3991 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3993 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3994 #define MAIN_NAME_P(NODE) \
3995 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3997 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3999 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4000 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4002 /* Default/current target options (TARGET_OPTION_NODE). */
4003 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4004 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4006 /* Default tree list option(), optimize() pragmas to be linked into the
4008 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4009 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4011 /* An enumeration of the standard C integer types. These must be
4012 ordered so that shorter types appear before longer ones, and so
4013 that signed types appear before unsigned ones, for the correct
4014 functioning of interpret_integer() in c-lex.c. */
4015 enum integer_type_kind
4027 itk_unsigned_long_long
,
4029 itk_unsigned_int128
,
4033 typedef enum integer_type_kind integer_type_kind
;
4035 /* The standard C integer types. Use integer_type_kind to index into
4037 extern GTY(()) tree integer_types
[itk_none
];
4039 #define char_type_node integer_types[itk_char]
4040 #define signed_char_type_node integer_types[itk_signed_char]
4041 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4042 #define short_integer_type_node integer_types[itk_short]
4043 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4044 #define integer_type_node integer_types[itk_int]
4045 #define unsigned_type_node integer_types[itk_unsigned_int]
4046 #define long_integer_type_node integer_types[itk_long]
4047 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4048 #define long_long_integer_type_node integer_types[itk_long_long]
4049 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4050 #define int128_integer_type_node integer_types[itk_int128]
4051 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
4053 /* A pointer-to-function member type looks like:
4060 If __pfn is NULL, it is a NULL pointer-to-member-function.
4062 (Because the vtable is always the first thing in the object, we
4063 don't need its offset.) If the function is virtual, then PFN is
4064 one plus twice the index into the vtable; otherwise, it is just a
4065 pointer to the function.
4067 Unfortunately, using the lowest bit of PFN doesn't work in
4068 architectures that don't impose alignment requirements on function
4069 addresses, or that use the lowest bit to tell one ISA from another,
4070 for example. For such architectures, we use the lowest bit of
4071 DELTA instead of the lowest bit of the PFN, and DELTA will be
4074 enum ptrmemfunc_vbit_where_t
4076 ptrmemfunc_vbit_in_pfn
,
4077 ptrmemfunc_vbit_in_delta
4080 #define NULL_TREE (tree) NULL
4082 /* True if NODE is an erroneous expression. */
4084 #define error_operand_p(NODE) \
4085 ((NODE) == error_mark_node \
4086 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
4088 extern tree
decl_assembler_name (tree
);
4089 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
4090 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
4092 /* Compute the number of bytes occupied by 'node'. This routine only
4093 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4095 extern size_t tree_size (const_tree
);
4097 /* Compute the number of bytes occupied by a tree with code CODE. This
4098 function cannot be used for TREE_VEC codes, which are of variable
4100 extern size_t tree_code_size (enum tree_code
);
4102 /* Allocate and return a new UID from the DECL_UID namespace. */
4103 extern int allocate_decl_uid (void);
4105 /* Lowest level primitive for allocating a node.
4106 The TREE_CODE is the only argument. Contents are initialized
4107 to zero except for a few of the common fields. */
4109 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
4110 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
4112 /* Make a copy of a node, with all the same contents. */
4114 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
4115 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
4117 /* Make a copy of a chain of TREE_LIST nodes. */
4119 extern tree
copy_list (tree
);
4121 /* Make a CASE_LABEL_EXPR. */
4123 extern tree
build_case_label (tree
, tree
, tree
);
4126 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
4127 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
4129 /* Make a TREE_VEC. */
4131 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
4132 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
4134 /* Return the (unique) IDENTIFIER_NODE node for a given name.
4135 The name is supplied as a char *. */
4137 extern tree
get_identifier (const char *);
4139 #if GCC_VERSION >= 3000
4140 #define get_identifier(str) \
4141 (__builtin_constant_p (str) \
4142 ? get_identifier_with_length ((str), strlen (str)) \
4143 : get_identifier (str))
4147 /* Identical to get_identifier, except that the length is assumed
4150 extern tree
get_identifier_with_length (const char *, size_t);
4152 /* If an identifier with the name TEXT (a null-terminated string) has
4153 previously been referred to, return that node; otherwise return
4156 extern tree
maybe_get_identifier (const char *);
4158 /* Construct various types of nodes. */
4160 extern tree
build_nt (enum tree_code
, ...);
4161 extern tree
build_nt_call_vec (tree
, VEC(tree
,gc
) *);
4163 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
4164 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
4165 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
4166 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
4167 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
4168 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
4169 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
4170 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
4171 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
4172 tree MEM_STAT_DECL
);
4173 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4174 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4175 tree MEM_STAT_DECL
);
4176 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4177 extern tree
build6_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4178 tree
, tree MEM_STAT_DECL
);
4179 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
4180 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4182 /* _loc versions of build[1-6]. */
4185 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
4186 tree arg1 MEM_STAT_DECL
)
4188 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
4189 if (CAN_HAVE_LOCATION_P (t
))
4190 SET_EXPR_LOCATION (t
, loc
);
4193 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
4196 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4197 tree arg1 MEM_STAT_DECL
)
4199 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4200 if (CAN_HAVE_LOCATION_P (t
))
4201 SET_EXPR_LOCATION (t
, loc
);
4204 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
4207 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4208 tree arg1
, tree arg2 MEM_STAT_DECL
)
4210 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4211 if (CAN_HAVE_LOCATION_P (t
))
4212 SET_EXPR_LOCATION (t
, loc
);
4215 #define build3_loc(l,c,t1,t2,t3,t4) \
4216 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
4219 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4220 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
4222 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4223 if (CAN_HAVE_LOCATION_P (t
))
4224 SET_EXPR_LOCATION (t
, loc
);
4227 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
4228 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4231 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4232 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4234 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
4235 arg4 PASS_MEM_STAT
);
4236 if (CAN_HAVE_LOCATION_P (t
))
4237 SET_EXPR_LOCATION (t
, loc
);
4240 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
4241 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4244 build6_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4245 tree arg1
, tree arg2
, tree arg3
, tree arg4
,
4246 tree arg5 MEM_STAT_DECL
)
4248 tree t
= build6_stat (code
, type
, arg0
, arg1
, arg2
, arg3
, arg4
,
4249 arg5 PASS_MEM_STAT
);
4250 if (CAN_HAVE_LOCATION_P (t
))
4251 SET_EXPR_LOCATION (t
, loc
);
4254 #define build6_loc(l,c,t1,t2,t3,t4,t5,t6,t7) \
4255 build6_stat_loc (l,c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4257 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
4258 #define build_var_debug_value(t1,t2) \
4259 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
4261 /* Constructs double_int from tree CST. */
4263 static inline double_int
4264 tree_to_double_int (const_tree cst
)
4266 return TREE_INT_CST (cst
);
4269 extern tree
double_int_to_tree (tree
, double_int
);
4270 extern bool double_int_fits_to_tree_p (const_tree
, double_int
);
4271 extern tree
force_fit_type_double (tree
, double_int
, int, bool);
4273 /* Create an INT_CST node with a CST value zero extended. */
4276 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
4278 return double_int_to_tree (type
, uhwi_to_double_int (cst
));
4281 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
4282 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
4283 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
4284 extern tree
build_vector (tree
, tree
);
4285 extern tree
build_vector_from_ctor (tree
, VEC(constructor_elt
,gc
) *);
4286 extern tree
build_vector_from_val (tree
, tree
);
4287 extern tree
build_constructor (tree
, VEC(constructor_elt
,gc
) *);
4288 extern tree
build_constructor_single (tree
, tree
, tree
);
4289 extern tree
build_constructor_from_list (tree
, tree
);
4290 extern tree
build_real_from_int_cst (tree
, const_tree
);
4291 extern tree
build_complex (tree
, tree
, tree
);
4292 extern tree
build_one_cst (tree
);
4293 extern tree
build_zero_cst (tree
);
4294 extern tree
build_string (int, const char *);
4295 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
4296 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4297 extern tree
build_tree_list_vec_stat (const VEC(tree
,gc
) * MEM_STAT_DECL
);
4298 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
4299 extern tree
build_decl_stat (location_t
, enum tree_code
,
4300 tree
, tree MEM_STAT_DECL
);
4301 extern tree
build_fn_decl (const char *, tree
);
4302 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
4303 extern tree
build_translation_unit_decl (tree
);
4304 extern tree
build_block (tree
, tree
, tree
, tree
);
4305 extern tree
build_empty_stmt (location_t
);
4306 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4308 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
4309 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4311 extern tree
build_call_nary (tree
, tree
, int, ...);
4312 extern tree
build_call_valist (tree
, tree
, int, va_list);
4313 #define build_call_array(T1,T2,N,T3)\
4314 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4315 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4316 extern tree
build_call_vec (tree
, tree
, VEC(tree
,gc
) *);
4318 /* Construct various nodes representing data types. */
4320 extern tree
make_signed_type (int);
4321 extern tree
make_unsigned_type (int);
4322 extern tree
signed_or_unsigned_type_for (int, tree
);
4323 extern tree
signed_type_for (tree
);
4324 extern tree
unsigned_type_for (tree
);
4325 extern void initialize_sizetypes (void);
4326 extern void fixup_unsigned_type (tree
);
4327 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
4328 extern tree
build_pointer_type (tree
);
4329 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
4330 extern tree
build_reference_type (tree
);
4331 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
4332 extern tree
build_vector_type (tree innertype
, int nunits
);
4333 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
4334 extern tree
build_type_no_quals (tree
);
4335 extern tree
build_index_type (tree
);
4336 extern tree
build_array_type (tree
, tree
);
4337 extern tree
build_nonshared_array_type (tree
, tree
);
4338 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
4339 extern tree
build_function_type (tree
, tree
);
4340 extern tree
build_function_type_list (tree
, ...);
4341 extern tree
build_function_type_skip_args (tree
, bitmap
);
4342 extern tree
build_function_decl_skip_args (tree
, bitmap
);
4343 extern tree
build_varargs_function_type_list (tree
, ...);
4344 extern tree
build_function_type_array (tree
, int, tree
*);
4345 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4346 #define build_function_type_vec(RET, V) \
4347 build_function_type_array (RET, VEC_length (tree, V), VEC_address (tree, V))
4348 #define build_varargs_function_type_vec(RET, V) \
4349 build_varargs_function_type_array (RET, VEC_length (tree, V), \
4350 VEC_address (tree, V))
4351 extern tree
build_method_type_directly (tree
, tree
, tree
);
4352 extern tree
build_method_type (tree
, tree
);
4353 extern tree
build_offset_type (tree
, tree
);
4354 extern tree
build_complex_type (tree
);
4355 extern tree
array_type_nelts (const_tree
);
4356 extern bool in_array_bounds_p (tree
);
4357 extern bool range_in_array_bounds_p (tree
);
4359 extern tree
value_member (tree
, tree
);
4360 extern tree
purpose_member (const_tree
, tree
);
4361 extern bool vec_member (const_tree
, VEC(tree
,gc
) *);
4362 extern tree
chain_index (int, tree
);
4364 extern int attribute_list_equal (const_tree
, const_tree
);
4365 extern int attribute_list_contained (const_tree
, const_tree
);
4366 extern int tree_int_cst_equal (const_tree
, const_tree
);
4367 extern int tree_int_cst_lt (const_tree
, const_tree
);
4368 extern int tree_int_cst_compare (const_tree
, const_tree
);
4369 extern int host_integerp (const_tree
, int)
4370 #ifndef ENABLE_TREE_CHECKING
4371 ATTRIBUTE_PURE
/* host_integerp is pure only when checking is disabled. */
4374 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
4375 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4376 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4377 tree_low_cst (const_tree t
, int pos
)
4379 gcc_assert (host_integerp (t
, pos
));
4380 return TREE_INT_CST_LOW (t
);
4383 extern int tree_int_cst_sgn (const_tree
);
4384 extern int tree_int_cst_sign_bit (const_tree
);
4385 extern unsigned int tree_int_cst_min_precision (tree
, bool);
4386 extern bool tree_expr_nonnegative_p (tree
);
4387 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
4388 extern bool may_negate_without_overflow_p (const_tree
);
4389 extern tree
strip_array_types (tree
);
4390 extern tree
excess_precision_type (tree
);
4392 /* Construct various nodes representing fract or accum data types. */
4394 extern tree
make_fract_type (int, int, int);
4395 extern tree
make_accum_type (int, int, int);
4397 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4398 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4399 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4400 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4401 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4402 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4403 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4404 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4406 #define make_or_reuse_signed_fract_type(P) \
4407 make_or_reuse_fract_type (P, 0, 0)
4408 #define make_or_reuse_unsigned_fract_type(P) \
4409 make_or_reuse_fract_type (P, 1, 0)
4410 #define make_or_reuse_sat_signed_fract_type(P) \
4411 make_or_reuse_fract_type (P, 0, 1)
4412 #define make_or_reuse_sat_unsigned_fract_type(P) \
4413 make_or_reuse_fract_type (P, 1, 1)
4414 #define make_or_reuse_signed_accum_type(P) \
4415 make_or_reuse_accum_type (P, 0, 0)
4416 #define make_or_reuse_unsigned_accum_type(P) \
4417 make_or_reuse_accum_type (P, 1, 0)
4418 #define make_or_reuse_sat_signed_accum_type(P) \
4419 make_or_reuse_accum_type (P, 0, 1)
4420 #define make_or_reuse_sat_unsigned_accum_type(P) \
4421 make_or_reuse_accum_type (P, 1, 1)
4423 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4424 put the prototype here. Rtl.h does declare the prototype if
4425 tree.h had been included. */
4427 extern tree
make_tree (tree
, rtx
);
4429 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4432 Such modified types already made are recorded so that duplicates
4435 extern tree
build_type_attribute_variant (tree
, tree
);
4436 extern tree
build_decl_attribute_variant (tree
, tree
);
4437 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
4439 /* Return 0 if the attributes for two types are incompatible, 1 if they
4440 are compatible, and 2 if they are nearly compatible (which causes a
4441 warning to be generated). */
4442 extern int comp_type_attributes (const_tree
, const_tree
);
4444 /* Structure describing an attribute and a function to handle it. */
4445 struct attribute_spec
4447 /* The name of the attribute (without any leading or trailing __),
4448 or NULL to mark the end of a table of attributes. */
4449 const char *const name
;
4450 /* The minimum length of the list of arguments of the attribute. */
4451 const int min_length
;
4452 /* The maximum length of the list of arguments of the attribute
4453 (-1 for no maximum). */
4454 const int max_length
;
4455 /* Whether this attribute requires a DECL. If it does, it will be passed
4456 from types of DECLs, function return types and array element types to
4457 the DECLs, function types and array types respectively; but when
4458 applied to a type in any other circumstances, it will be ignored with
4459 a warning. (If greater control is desired for a given attribute,
4460 this should be false, and the flags argument to the handler may be
4461 used to gain greater control in that case.) */
4462 const bool decl_required
;
4463 /* Whether this attribute requires a type. If it does, it will be passed
4464 from a DECL to the type of that DECL. */
4465 const bool type_required
;
4466 /* Whether this attribute requires a function (or method) type. If it does,
4467 it will be passed from a function pointer type to the target type,
4468 and from a function return type (which is not itself a function
4469 pointer type) to the function type. */
4470 const bool function_type_required
;
4471 /* Function to handle this attribute. NODE points to the node to which
4472 the attribute is to be applied. If a DECL, it should be modified in
4473 place; if a TYPE, a copy should be created. NAME is the name of the
4474 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4475 of the arguments (which may be NULL). FLAGS gives further information
4476 about the context of the attribute. Afterwards, the attributes will
4477 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4478 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4479 as well as in any other cases when the attributes should not be added
4480 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4481 applied to another type or DECL later may be returned;
4482 otherwise the return value should be NULL_TREE. This pointer may be
4483 NULL if no special handling is required beyond the checks implied
4484 by the rest of this structure. */
4485 tree (*const handler
) (tree
*node
, tree name
, tree args
,
4486 int flags
, bool *no_add_attrs
);
4487 /* Specifies if attribute affects type's identity. */
4488 const bool affects_type_identity
;
4491 /* Flags that may be passed in the third argument of decl_attributes, and
4492 to handler functions for attributes. */
4493 enum attribute_flags
4495 /* The type passed in is the type of a DECL, and any attributes that
4496 should be passed in again to be applied to the DECL rather than the
4497 type should be returned. */
4498 ATTR_FLAG_DECL_NEXT
= 1,
4499 /* The type passed in is a function return type, and any attributes that
4500 should be passed in again to be applied to the function type rather
4501 than the return type should be returned. */
4502 ATTR_FLAG_FUNCTION_NEXT
= 2,
4503 /* The type passed in is an array element type, and any attributes that
4504 should be passed in again to be applied to the array type rather
4505 than the element type should be returned. */
4506 ATTR_FLAG_ARRAY_NEXT
= 4,
4507 /* The type passed in is a structure, union or enumeration type being
4508 created, and should be modified in place. */
4509 ATTR_FLAG_TYPE_IN_PLACE
= 8,
4510 /* The attributes are being applied by default to a library function whose
4511 name indicates known behavior, and should be silently ignored if they
4512 are not in fact compatible with the function type. */
4513 ATTR_FLAG_BUILT_IN
= 16
4516 /* Default versions of target-overridable functions. */
4518 extern tree
merge_decl_attributes (tree
, tree
);
4519 extern tree
merge_type_attributes (tree
, tree
);
4521 /* This function is a private implementation detail of lookup_attribute()
4522 and you should never call it directly. */
4523 extern tree
private_lookup_attribute (const char *, size_t, tree
);
4525 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4526 return a pointer to the attribute's list element if the attribute
4527 is part of the list, or NULL_TREE if not found. If the attribute
4528 appears more than once, this only returns the first occurrence; the
4529 TREE_CHAIN of the return value should be passed back in if further
4530 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
4534 lookup_attribute (const char *attr_name
, tree list
)
4536 gcc_checking_assert (attr_name
[0] != '_');
4537 /* In most cases, list is NULL_TREE. */
4538 if (list
== NULL_TREE
)
4541 /* Do the strlen() before calling the out-of-line implementation.
4542 In most cases attr_name is a string constant, and the compiler
4543 will optimize the strlen() away. */
4544 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
4547 /* This function is a private implementation detail of
4548 is_attribute_p() and you should never call it directly. */
4549 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
4551 /* Given an identifier node IDENT and a string ATTR_NAME, return true
4552 if the identifier node is a valid attribute name for the string.
4553 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
4554 be the identifier for 'text' or for '__text__'. */
4557 is_attribute_p (const char *attr_name
, const_tree ident
)
4559 gcc_checking_assert (attr_name
[0] != '_');
4560 /* Do the strlen() before calling the out-of-line implementation.
4561 In most cases attr_name is a string constant, and the compiler
4562 will optimize the strlen() away. */
4563 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
4566 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4567 modified list. ATTR_NAME must be in the form 'text' (not
4570 extern tree
remove_attribute (const char *, tree
);
4572 /* Given two attributes lists, return a list of their union. */
4574 extern tree
merge_attributes (tree
, tree
);
4576 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4577 /* Given two Windows decl attributes lists, possibly including
4578 dllimport, return a list of their union . */
4579 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4581 /* Handle a "dllimport" or "dllexport" attribute. */
4582 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4585 /* Check whether CAND is suitable to be returned from get_qualified_type
4586 (BASE, TYPE_QUALS). */
4588 extern bool check_qualified_type (const_tree
, const_tree
, int);
4590 /* Return a version of the TYPE, qualified as indicated by the
4591 TYPE_QUALS, if one exists. If no qualified version exists yet,
4592 return NULL_TREE. */
4594 extern tree
get_qualified_type (tree
, int);
4596 /* Like get_qualified_type, but creates the type if it does not
4597 exist. This function never returns NULL_TREE. */
4599 extern tree
build_qualified_type (tree
, int);
4601 /* Create a variant of type T with alignment ALIGN. */
4603 extern tree
build_aligned_type (tree
, unsigned int);
4605 /* Like build_qualified_type, but only deals with the `const' and
4606 `volatile' qualifiers. This interface is retained for backwards
4607 compatibility with the various front-ends; new code should use
4608 build_qualified_type instead. */
4610 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4611 build_qualified_type ((TYPE), \
4612 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4613 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4615 /* Make a copy of a type node. */
4617 extern tree
build_distinct_type_copy (tree
);
4618 extern tree
build_variant_type_copy (tree
);
4620 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4621 fields. Optionally specify an alignment, and then lay it out. */
4623 extern void finish_builtin_struct (tree
, const char *,
4626 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4627 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4628 node, does nothing except for the first time. */
4630 extern void layout_type (tree
);
4632 /* These functions allow a front-end to perform a manual layout of a
4633 RECORD_TYPE. (For instance, if the placement of subsequent fields
4634 depends on the placement of fields so far.) Begin by calling
4635 start_record_layout. Then, call place_field for each of the
4636 fields. Then, call finish_record_layout. See layout_type for the
4637 default way in which these functions are used. */
4639 typedef struct record_layout_info_s
4641 /* The RECORD_TYPE that we are laying out. */
4643 /* The offset into the record so far, in bytes, not including bits in
4646 /* The last known alignment of SIZE. */
4647 unsigned int offset_align
;
4648 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4650 /* The alignment of the record so far, in bits. */
4651 unsigned int record_align
;
4652 /* The alignment of the record so far, ignoring #pragma pack and
4653 __attribute__ ((packed)), in bits. */
4654 unsigned int unpacked_align
;
4655 /* The previous field layed out. */
4657 /* The static variables (i.e., class variables, as opposed to
4658 instance variables) encountered in T. */
4659 VEC(tree
,gc
) *pending_statics
;
4660 /* Bits remaining in the current alignment group */
4661 int remaining_in_alignment
;
4662 /* True if we've seen a packed field that didn't have normal
4663 alignment anyway. */
4664 int packed_maybe_necessary
;
4665 } *record_layout_info
;
4667 extern record_layout_info
start_record_layout (tree
);
4668 extern tree
bit_from_pos (tree
, tree
);
4669 extern tree
byte_from_pos (tree
, tree
);
4670 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
4671 extern void normalize_offset (tree
*, tree
*, unsigned int);
4672 extern tree
rli_size_unit_so_far (record_layout_info
);
4673 extern tree
rli_size_so_far (record_layout_info
);
4674 extern void normalize_rli (record_layout_info
);
4675 extern void place_field (record_layout_info
, tree
);
4676 extern void compute_record_mode (tree
);
4677 extern void finish_record_layout (record_layout_info
, int);
4679 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4680 return a canonicalized ..._TYPE node, so that duplicates are not made.
4681 How the hash code is computed is up to the caller, as long as any two
4682 callers that could hash identical-looking type nodes agree. */
4684 extern tree
type_hash_canon (unsigned int, tree
);
4686 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4687 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4688 fields. Call this only once for any given decl node.
4690 Second argument is the boundary that this field can be assumed to
4691 be starting at (in bits). Zero means it can be assumed aligned
4692 on any boundary that may be needed. */
4694 extern void layout_decl (tree
, unsigned);
4696 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4697 a previous call to layout_decl and calls it again. */
4699 extern void relayout_decl (tree
);
4701 /* Return the mode for data of a given size SIZE and mode class CLASS.
4702 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4703 The value is BLKmode if no other mode is found. This is like
4704 mode_for_size, but is passed a tree. */
4706 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
4708 /* Return an expr equal to X but certainly not valid as an lvalue. */
4710 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4711 extern tree
non_lvalue_loc (location_t
, tree
);
4713 extern tree
convert (tree
, tree
);
4714 extern unsigned int expr_align (const_tree
);
4715 extern tree
expr_first (tree
);
4716 extern tree
expr_last (tree
);
4717 extern tree
size_in_bytes (const_tree
);
4718 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4719 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4720 extern tree
tree_expr_size (const_tree
);
4721 extern tree
bit_position (const_tree
);
4722 extern HOST_WIDE_INT
int_bit_position (const_tree
);
4723 extern tree
byte_position (const_tree
);
4724 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4726 /* Define data structures, macros, and functions for handling sizes
4727 and the various types used to represent sizes. */
4731 SIZETYPE
, /* Normal representation of sizes in bytes. */
4732 SSIZETYPE
, /* Signed representation of sizes in bytes. */
4733 BITSIZETYPE
, /* Normal representation of sizes in bits. */
4734 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
4737 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
4739 #define sizetype sizetype_tab[(int) SIZETYPE]
4740 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4741 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4742 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4744 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
4745 #define size_binop(CODE,T1,T2)\
4746 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4747 extern tree
size_binop_loc (location_t
, enum tree_code
, tree
, tree
);
4748 #define size_diffop(T1,T2)\
4749 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4750 extern tree
size_diffop_loc (location_t
, tree
, tree
);
4752 #define size_int(L) size_int_kind (L, SIZETYPE)
4753 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4754 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4755 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4757 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4758 extern tree
round_up_loc (location_t
, tree
, int);
4759 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4760 extern tree
round_down_loc (location_t
, tree
, int);
4761 extern void finalize_size_functions (void);
4763 /* Type for sizes of data-type. */
4765 #define BITS_PER_UNIT_LOG \
4766 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4767 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4768 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4770 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4771 extern unsigned int maximum_field_alignment
;
4773 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4774 by making the last node in X point to Y.
4775 Returns X, except if X is 0 returns Y. */
4777 extern tree
chainon (tree
, tree
);
4779 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4781 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4782 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4784 /* Return the last tree node in a chain. */
4786 extern tree
tree_last (tree
);
4788 /* Reverse the order of elements in a chain, and return the new head. */
4790 extern tree
nreverse (tree
);
4792 /* Returns the length of a chain of nodes
4793 (number of chain pointers to follow before reaching a null pointer). */
4795 extern int list_length (const_tree
);
4797 /* Returns the number of FIELD_DECLs in a type. */
4799 extern int fields_length (const_tree
);
4801 /* Returns the first FIELD_DECL in a type. */
4803 extern tree
first_field (const_tree
);
4805 /* Given an initializer INIT, return TRUE if INIT is zero or some
4806 aggregate of zeros. Otherwise return FALSE. */
4808 extern bool initializer_zerop (const_tree
);
4810 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4812 extern VEC(tree
,gc
) *ctor_to_vec (tree
);
4814 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*,
4815 HOST_WIDE_INT
*, bool *);
4817 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
4819 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4821 extern int integer_zerop (const_tree
);
4823 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4825 extern int integer_onep (const_tree
);
4827 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4828 all of whose significant bits are 1. */
4830 extern int integer_all_onesp (const_tree
);
4832 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4833 exactly one bit 1. */
4835 extern int integer_pow2p (const_tree
);
4837 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4838 with a nonzero value. */
4840 extern int integer_nonzerop (const_tree
);
4842 extern bool cst_and_fits_in_hwi (const_tree
);
4843 extern tree
num_ending_zeros (const_tree
);
4845 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4848 extern int fixed_zerop (const_tree
);
4850 /* staticp (tree x) is nonzero if X is a reference to data allocated
4851 at a fixed address in memory. Returns the outermost data. */
4853 extern tree
staticp (tree
);
4855 /* save_expr (EXP) returns an expression equivalent to EXP
4856 but it can be used multiple times within context CTX
4857 and only evaluate EXP once. */
4859 extern tree
save_expr (tree
);
4861 /* Look inside EXPR and into any simple arithmetic operations. Return
4862 the innermost non-arithmetic node. */
4864 extern tree
skip_simple_arithmetic (tree
);
4866 /* Return which tree structure is used by T. */
4868 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4870 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4871 size or offset that depends on a field within a record. */
4873 extern bool contains_placeholder_p (const_tree
);
4875 /* This macro calls the above function but short-circuits the common
4876 case of a constant to save time. Also check for null. */
4878 #define CONTAINS_PLACEHOLDER_P(EXP) \
4879 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4881 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4882 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4885 extern bool type_contains_placeholder_p (tree
);
4887 /* Given a tree EXP, find all occurences of references to fields
4888 in a PLACEHOLDER_EXPR and place them in vector REFS without
4889 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4890 we assume here that EXP contains only arithmetic expressions
4891 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4894 extern void find_placeholder_in_expr (tree
, VEC (tree
, heap
) **);
4896 /* This macro calls the above function but short-circuits the common
4897 case of a constant to save time and also checks for NULL. */
4899 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4901 if((EXP) && !TREE_CONSTANT (EXP)) \
4902 find_placeholder_in_expr (EXP, V); \
4905 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4906 return a tree with all occurrences of references to F in a
4907 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4908 CONST_DECLs. Note that we assume here that EXP contains only
4909 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4910 occurring only in their argument list. */
4912 extern tree
substitute_in_expr (tree
, tree
, tree
);
4914 /* This macro calls the above function but short-circuits the common
4915 case of a constant to save time and also checks for NULL. */
4917 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4918 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4920 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4921 for it within OBJ, a tree that is an object or a chain of references. */
4923 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4925 /* This macro calls the above function but short-circuits the common
4926 case of a constant to save time and also checks for NULL. */
4928 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4929 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4930 : substitute_placeholder_in_expr (EXP, OBJ))
4932 /* variable_size (EXP) is like save_expr (EXP) except that it
4933 is for the special case of something that is part of a
4934 variable size for a data type. It makes special arrangements
4935 to compute the value at the right time when the data type
4936 belongs to a function parameter. */
4938 extern tree
variable_size (tree
);
4940 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4941 but it can be used multiple times
4942 and only evaluate the subexpressions once. */
4944 extern tree
stabilize_reference (tree
);
4946 /* Subroutine of stabilize_reference; this is called for subtrees of
4947 references. Any expression with side-effects must be put in a SAVE_EXPR
4948 to ensure that it is only evaluated once. */
4950 extern tree
stabilize_reference_1 (tree
);
4952 /* Return EXP, stripped of any conversions to wider types
4953 in such a way that the result of converting to type FOR_TYPE
4954 is the same as if EXP were converted to FOR_TYPE.
4955 If FOR_TYPE is 0, it signifies EXP's type. */
4957 extern tree
get_unwidened (tree
, tree
);
4959 /* Return OP or a simpler expression for a narrower value
4960 which can be sign-extended or zero-extended to give back OP.
4961 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4962 or 0 if the value should be sign-extended. */
4964 extern tree
get_narrower (tree
, int *);
4966 /* Return true if T is an expression that get_inner_reference handles. */
4969 handled_component_p (const_tree t
)
4971 switch (TREE_CODE (t
))
4976 case ARRAY_RANGE_REF
:
4977 case VIEW_CONVERT_EXPR
:
4987 /* Given an expression EXP that is a handled_component_p,
4988 look for the ultimate containing object, which is returned and specify
4989 the access position and size. */
4991 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4992 tree
*, enum machine_mode
*, int *, int *,
4995 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4996 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4997 EXP is marked as PACKED. */
4999 extern bool contains_packed_reference (const_tree exp
);
5001 /* Return a tree of sizetype representing the size, in bytes, of the element
5002 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5004 extern tree
array_ref_element_size (tree
);
5006 /* Return a tree representing the lower bound of the array mentioned in
5007 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5009 extern tree
array_ref_low_bound (tree
);
5011 /* Return a tree representing the upper bound of the array mentioned in
5012 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5014 extern tree
array_ref_up_bound (tree
);
5016 /* Return a tree representing the offset, in bytes, of the field referenced
5017 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5019 extern tree
component_ref_field_offset (tree
);
5021 /* Given a DECL or TYPE, return the scope in which it was declared, or
5022 NUL_TREE if there is no containing scope. */
5024 extern tree
get_containing_scope (const_tree
);
5026 /* Return the FUNCTION_DECL which provides this _DECL with its context,
5028 extern tree
decl_function_context (const_tree
);
5030 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5031 this _DECL with its context, or zero if none. */
5032 extern tree
decl_type_context (const_tree
);
5034 /* Return 1 if EXPR is the real constant zero. */
5035 extern int real_zerop (const_tree
);
5037 /* Declare commonly used variables for tree structure. */
5039 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
5040 Zero means allow extended lvalues. */
5042 extern int pedantic_lvalues
;
5044 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
5046 extern GTY(()) tree current_function_decl
;
5048 /* Nonzero means a FUNC_BEGIN label was emitted. */
5049 extern GTY(()) const char * current_function_func_begin_label
;
5051 /* Iterator for going through the function arguments. */
5053 tree next
; /* TREE_LIST pointing to the next argument */
5054 } function_args_iterator
;
5056 /* Initialize the iterator I with arguments from function FNDECL */
5059 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
5061 i
->next
= TYPE_ARG_TYPES (fntype
);
5064 /* Return a pointer that holds the next argument if there are more arguments to
5065 handle, otherwise return NULL. */
5067 static inline tree
*
5068 function_args_iter_cond_ptr (function_args_iterator
*i
)
5070 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
5073 /* Return the next argument if there are more arguments to handle, otherwise
5077 function_args_iter_cond (function_args_iterator
*i
)
5079 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
5082 /* Advance to the next argument. */
5084 function_args_iter_next (function_args_iterator
*i
)
5086 gcc_assert (i
->next
!= NULL_TREE
);
5087 i
->next
= TREE_CHAIN (i
->next
);
5090 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
5093 inlined_function_outer_scope_p (const_tree block
)
5095 return BLOCK_SOURCE_LOCATION (block
) != UNKNOWN_LOCATION
;
5098 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5099 to point to the next tree element. ITER is an instance of
5100 function_args_iterator used to iterate the arguments. */
5101 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5102 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5103 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5104 function_args_iter_next (&(ITER)))
5106 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5107 to the next tree element. ITER is an instance of function_args_iterator
5108 used to iterate the arguments. */
5109 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5110 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5111 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5112 function_args_iter_next (&(ITER)))
5117 extern unsigned crc32_string (unsigned, const char *);
5118 extern unsigned crc32_byte (unsigned, char);
5119 extern void clean_symbol_name (char *);
5120 extern tree
get_file_function_name (const char *);
5121 extern tree
get_callee_fndecl (const_tree
);
5122 extern int type_num_arguments (const_tree
);
5123 extern bool associative_tree_code (enum tree_code
);
5124 extern bool commutative_tree_code (enum tree_code
);
5125 extern bool commutative_ternary_tree_code (enum tree_code
);
5126 extern tree
upper_bound_in_type (tree
, tree
);
5127 extern tree
lower_bound_in_type (tree
, tree
);
5128 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
5129 extern tree
create_artificial_label (location_t
);
5130 extern const char *get_name (tree
);
5131 extern bool stdarg_p (const_tree
);
5132 extern bool prototype_p (tree
);
5133 extern bool is_typedef_decl (tree x
);
5134 extern bool typedef_variant_p (tree
);
5135 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
5136 extern tree
build_low_bits_mask (tree
, unsigned);
5137 extern tree
tree_strip_nop_conversions (tree
);
5138 extern tree
tree_strip_sign_nop_conversions (tree
);
5139 extern tree
lhd_gcc_personality (void);
5140 extern void assign_assembler_name_if_neeeded (tree
);
5141 extern void warn_deprecated_use (tree
, tree
);
5145 extern void change_decl_assembler_name (tree
, tree
);
5148 extern tree
unshare_expr (tree
);
5152 extern void expand_expr_stmt (tree
);
5153 extern int warn_if_unused_value (const_tree
, location_t
);
5154 extern void expand_label (tree
);
5155 extern void expand_goto (tree
);
5157 extern rtx
expand_stack_save (void);
5158 extern void expand_stack_restore (tree
);
5159 extern void expand_return (tree
);
5162 extern void using_eh_for_cleanups (void);
5164 /* In fold-const.c */
5166 /* Non-zero if we are folding constants inside an initializer; zero
5168 extern int folding_initializer
;
5170 /* Convert between trees and native memory representation. */
5171 extern int native_encode_expr (const_tree
, unsigned char *, int);
5172 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
5174 /* Fold constants as much as possible in an expression.
5175 Returns the simplified expression.
5176 Acts only on the top level of the expression;
5177 if the argument itself cannot be simplified, its
5178 subexpressions are not changed. */
5180 extern tree
fold (tree
);
5181 #define fold_unary(CODE,T1,T2)\
5182 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5183 extern tree
fold_unary_loc (location_t
, enum tree_code
, tree
, tree
);
5184 #define fold_unary_ignore_overflow(CODE,T1,T2)\
5185 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5186 extern tree
fold_unary_ignore_overflow_loc (location_t
, enum tree_code
, tree
, tree
);
5187 #define fold_binary(CODE,T1,T2,T3)\
5188 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
5189 extern tree
fold_binary_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
5190 #define fold_ternary(CODE,T1,T2,T3,T4)\
5191 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
5192 extern tree
fold_ternary_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
5193 #define fold_build1(c,t1,t2)\
5194 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
5195 #define fold_build1_loc(l,c,t1,t2)\
5196 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
5197 extern tree
fold_build1_stat_loc (location_t
, enum tree_code
, tree
,
5198 tree MEM_STAT_DECL
);
5199 #define fold_build2(c,t1,t2,t3)\
5200 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
5201 #define fold_build2_loc(l,c,t1,t2,t3)\
5202 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
5203 extern tree
fold_build2_stat_loc (location_t
, enum tree_code
, tree
, tree
,
5204 tree MEM_STAT_DECL
);
5205 #define fold_build3(c,t1,t2,t3,t4)\
5206 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
5207 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
5208 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
5209 extern tree
fold_build3_stat_loc (location_t
, enum tree_code
, tree
, tree
, tree
,
5210 tree MEM_STAT_DECL
);
5211 extern tree
fold_build1_initializer_loc (location_t
, enum tree_code
, tree
, tree
);
5212 extern tree
fold_build2_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
5213 extern tree
fold_build3_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
5214 #define fold_build_call_array(T1,T2,N,T4)\
5215 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5216 extern tree
fold_build_call_array_loc (location_t
, tree
, tree
, int, tree
*);
5217 #define fold_build_call_array_initializer(T1,T2,N,T4)\
5218 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5219 extern tree
fold_build_call_array_initializer_loc (location_t
, tree
, tree
, int, tree
*);
5220 extern bool fold_convertible_p (const_tree
, const_tree
);
5221 #define fold_convert(T1,T2)\
5222 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
5223 extern tree
fold_convert_loc (location_t
, tree
, tree
);
5224 extern tree
fold_single_bit_test (location_t
, enum tree_code
, tree
, tree
, tree
);
5225 extern tree
fold_ignored_result (tree
);
5226 extern tree
fold_abs_const (tree
, tree
);
5227 extern tree
fold_indirect_ref_1 (location_t
, tree
, tree
);
5228 extern void fold_defer_overflow_warnings (void);
5229 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
5230 extern void fold_undefer_and_ignore_overflow_warnings (void);
5231 extern bool fold_deferring_overflow_warnings_p (void);
5232 extern tree
fold_fma (location_t
, tree
, tree
, tree
, tree
);
5234 enum operand_equal_flag
5238 OEP_CONSTANT_ADDRESS_OF
= 4
5241 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
5242 extern int multiple_of_p (tree
, const_tree
, const_tree
);
5243 #define omit_one_operand(T1,T2,T3)\
5244 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
5245 extern tree
omit_one_operand_loc (location_t
, tree
, tree
, tree
);
5246 #define omit_two_operands(T1,T2,T3,T4)\
5247 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
5248 extern tree
omit_two_operands_loc (location_t
, tree
, tree
, tree
, tree
);
5249 #define invert_truthvalue(T)\
5250 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
5251 extern tree
invert_truthvalue_loc (location_t
, tree
);
5252 extern tree
fold_truth_not_expr (location_t
, tree
);
5253 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
5254 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
5255 extern tree
fold_read_from_constant_string (tree
);
5256 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
);
5257 #define build_fold_addr_expr(T)\
5258 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
5259 extern tree
build_fold_addr_expr_loc (location_t
, tree
);
5260 #define build_fold_addr_expr_with_type(T,TYPE)\
5261 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
5262 extern tree
build_fold_addr_expr_with_type_loc (location_t
, tree
, tree
);
5263 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
5264 extern tree
fold_strip_sign_ops (tree
);
5265 #define build_fold_indirect_ref(T)\
5266 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5267 extern tree
build_fold_indirect_ref_loc (location_t
, tree
);
5268 #define fold_indirect_ref(T)\
5269 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5270 extern tree
fold_indirect_ref_loc (location_t
, tree
);
5271 extern tree
build_simple_mem_ref_loc (location_t
, tree
);
5272 #define build_simple_mem_ref(T)\
5273 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
5274 extern double_int
mem_ref_offset (const_tree
);
5275 extern tree
reference_alias_ptr_type (const_tree
);
5276 extern tree
build_invariant_address (tree
, tree
, HOST_WIDE_INT
);
5277 extern tree
constant_boolean_node (int, tree
);
5278 extern tree
div_if_zero_remainder (enum tree_code
, const_tree
, const_tree
);
5280 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
5281 extern enum tree_code
swap_tree_comparison (enum tree_code
);
5283 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
5284 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
5286 extern bool tree_expr_nonzero_p (tree
);
5287 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
5288 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
5290 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
5291 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
5292 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
5294 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5295 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5296 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
5298 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
5300 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
5301 extern tree
combine_comparisons (location_t
, enum tree_code
, enum tree_code
,
5302 enum tree_code
, tree
, tree
, tree
);
5303 extern void debug_fold_checksum (const_tree
);
5305 /* Return nonzero if CODE is a tree code that represents a truth value. */
5307 truth_value_p (enum tree_code code
)
5309 return (TREE_CODE_CLASS (code
) == tcc_comparison
5310 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5311 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5312 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5315 /* Return whether TYPE is a type suitable for an offset for
5316 a POINTER_PLUS_EXPR. */
5318 ptrofftype_p (tree type
)
5320 return (INTEGRAL_TYPE_P (type
)
5321 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
5322 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
5325 /* Return OFF converted to a pointer offset type suitable as offset for
5326 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
5328 convert_to_ptrofftype_loc (location_t loc
, tree off
)
5330 return fold_convert_loc (loc
, sizetype
, off
);
5332 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
5334 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
5336 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
5338 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
5339 ptr
, fold_convert_loc (loc
, sizetype
, off
));
5341 #define fold_build_pointer_plus(p,o) \
5342 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
5344 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
5346 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
5348 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
5349 ptr
, size_int (off
));
5351 #define fold_build_pointer_plus_hwi(p,o) \
5352 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
5355 extern tree
fold_call_expr (location_t
, tree
, bool);
5356 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
5357 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
5358 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
5359 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
5360 enum built_in_function
);
5361 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
5362 enum built_in_function
);
5363 extern tree
fold_builtin_strncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
);
5364 extern tree
fold_builtin_snprintf_chk (location_t
, tree
, tree
, enum built_in_function
);
5365 extern bool fold_builtin_next_arg (tree
, bool);
5366 extern enum built_in_function
builtin_mathfn_code (const_tree
);
5367 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
5368 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
5369 extern tree
build_call_expr_loc_vec (location_t
, tree
, VEC(tree
,gc
) *);
5370 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
5371 extern tree
build_call_expr (tree
, int, ...);
5372 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
5373 extern tree
c_strlen (tree
, int);
5374 extern tree
std_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
5375 extern tree
build_va_arg_indirect_ref (tree
);
5376 extern tree
build_string_literal (int, const char *);
5377 extern bool validate_arglist (const_tree
, ...);
5378 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
5379 extern bool is_builtin_name (const char *);
5380 extern bool is_builtin_fn (tree
);
5381 extern unsigned int get_object_alignment_1 (tree
, unsigned HOST_WIDE_INT
*);
5382 extern unsigned int get_object_alignment (tree
);
5383 extern unsigned int get_pointer_alignment (tree
);
5384 extern tree
fold_call_stmt (gimple
, bool);
5385 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
5386 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
5387 extern tree
build_range_check (location_t
, tree
, tree
, int, tree
, tree
);
5388 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
5390 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
5391 extern bool is_simple_builtin (tree
);
5392 extern bool is_inexpensive_builtin (tree
);
5395 extern tree
strip_float_extensions (tree
);
5398 extern int really_constant_p (const_tree
);
5399 extern bool decl_address_invariant_p (const_tree
);
5400 extern bool decl_address_ip_invariant_p (const_tree
);
5401 extern bool int_fits_type_p (const_tree
, const_tree
);
5402 #ifndef GENERATOR_FILE
5403 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5405 extern bool variably_modified_type_p (tree
, tree
);
5406 extern int tree_log2 (const_tree
);
5407 extern int tree_floor_log2 (const_tree
);
5408 extern int simple_cst_equal (const_tree
, const_tree
);
5409 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
5410 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
5411 const_tree
, hashval_t
);
5412 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5413 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
5414 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5415 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5416 extern int type_list_equal (const_tree
, const_tree
);
5417 extern int chain_member (const_tree
, const_tree
);
5418 extern tree
type_hash_lookup (unsigned int, tree
);
5419 extern void type_hash_add (unsigned int, tree
);
5420 extern int simple_cst_list_equal (const_tree
, const_tree
);
5421 extern void dump_tree_statistics (void);
5422 extern void recompute_tree_invariant_for_addr_expr (tree
);
5423 extern bool needs_to_live_in_memory (const_tree
);
5424 extern tree
reconstruct_complex_type (tree
, tree
);
5426 extern int real_onep (const_tree
);
5427 extern int real_twop (const_tree
);
5428 extern int real_minus_onep (const_tree
);
5429 extern void init_ttree (void);
5430 extern void build_common_tree_nodes (bool, bool);
5431 extern void build_common_builtin_nodes (void);
5432 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5433 extern tree
build_range_type (tree
, tree
, tree
);
5434 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
5435 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5436 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5437 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
5439 extern tree
*tree_block (tree
);
5440 extern location_t
*block_nonartificial_location (tree
);
5441 extern location_t
tree_nonartificial_location (tree
);
5443 extern tree
block_ultimate_origin (const_tree
);
5445 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
5447 /* In tree-nested.c */
5448 extern tree
build_addr (tree
, tree
);
5451 extern void expand_main_function (void);
5452 extern void expand_function_end (void);
5453 extern void expand_function_start (tree
);
5454 extern void stack_protect_prologue (void);
5455 extern void stack_protect_epilogue (void);
5456 extern void init_dummy_function_start (void);
5457 extern void expand_dummy_function_end (void);
5458 extern unsigned int init_function_for_compilation (void);
5459 extern void allocate_struct_function (tree
, bool);
5460 extern void push_struct_function (tree fndecl
);
5461 extern void init_function_start (tree
);
5462 extern bool use_register_for_decl (const_tree
);
5463 extern void generate_setjmp_warnings (void);
5464 extern void init_temp_slots (void);
5465 extern void free_temp_slots (void);
5466 extern void pop_temp_slots (void);
5467 extern void push_temp_slots (void);
5468 extern void preserve_temp_slots (rtx
);
5469 extern int aggregate_value_p (const_tree
, const_tree
);
5470 extern void push_function_context (void);
5471 extern void pop_function_context (void);
5472 extern gimple_seq
gimplify_parameters (void);
5474 /* In print-rtl.c */
5476 extern void print_rtl (FILE *, const_rtx
);
5479 /* In print-tree.c */
5480 extern void debug_tree (tree
);
5481 extern void debug_vec_tree (VEC(tree
,gc
) *);
5483 extern void dump_addr (FILE*, const char *, const void *);
5484 extern void print_node (FILE *, const char *, tree
, int);
5485 extern void print_vec_tree (FILE *, const char *, VEC(tree
,gc
) *, int);
5486 extern void print_node_brief (FILE *, const char *, const_tree
, int);
5487 extern void indent_to (FILE *, int);
5490 /* In tree-inline.c: */
5491 extern bool debug_find_tree (tree
, tree
);
5492 /* This is in tree-inline.c since the routine uses
5493 data structures from the inliner. */
5494 extern tree
unsave_expr_now (tree
);
5495 extern tree
build_duplicate_type (tree
);
5499 /* Nonzero if this is a call to a function whose return value depends
5500 solely on its arguments, has no side effects, and does not read
5501 global memory. This corresponds to TREE_READONLY for function
5503 #define ECF_CONST (1 << 0)
5504 /* Nonzero if this is a call to "pure" function (like const function,
5505 but may read memory. This corresponds to DECL_PURE_P for function
5507 #define ECF_PURE (1 << 1)
5508 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5509 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5510 for function decls.*/
5511 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5512 /* Nonzero if this call will never return. */
5513 #define ECF_NORETURN (1 << 3)
5514 /* Nonzero if this is a call to malloc or a related function. */
5515 #define ECF_MALLOC (1 << 4)
5516 /* Nonzero if it is plausible that this is a call to alloca. */
5517 #define ECF_MAY_BE_ALLOCA (1 << 5)
5518 /* Nonzero if this is a call to a function that won't throw an exception. */
5519 #define ECF_NOTHROW (1 << 6)
5520 /* Nonzero if this is a call to setjmp or a related function. */
5521 #define ECF_RETURNS_TWICE (1 << 7)
5522 /* Nonzero if this call replaces the current stack frame. */
5523 #define ECF_SIBCALL (1 << 8)
5524 /* Function does not read or write memory (but may have side effects, so
5525 it does not necessarily fit ECF_CONST). */
5526 #define ECF_NOVOPS (1 << 9)
5527 /* The function does not lead to calls within current function unit. */
5528 #define ECF_LEAF (1 << 10)
5530 extern int flags_from_decl_or_type (const_tree
);
5531 extern int call_expr_flags (const_tree
);
5533 /* Call argument flags. */
5535 /* Nonzero if the argument is not dereferenced recursively, thus only
5536 directly reachable memory is read or written. */
5537 #define EAF_DIRECT (1 << 0)
5538 /* Nonzero if memory reached by the argument is not clobbered. */
5539 #define EAF_NOCLOBBER (1 << 1)
5540 /* Nonzero if the argument does not escape. */
5541 #define EAF_NOESCAPE (1 << 2)
5542 /* Nonzero if the argument is not used by the function. */
5543 #define EAF_UNUSED (1 << 3)
5545 /* Call return flags. */
5547 /* Mask for the argument number that is returned. Lower two bits of
5548 the return flags, encodes argument slots zero to three. */
5549 #define ERF_RETURN_ARG_MASK (3)
5550 /* Nonzero if the return value is equal to the argument number
5551 flags & ERF_RETURN_ARG_MASK. */
5552 #define ERF_RETURNS_ARG (1 << 2)
5553 /* Nonzero if the return value does not alias with anything. Functions
5554 with the malloc attribute have this set on their return value. */
5555 #define ERF_NOALIAS (1 << 3)
5557 extern int setjmp_call_p (const_tree
);
5558 extern bool gimple_alloca_call_p (const_gimple
);
5559 extern bool alloca_call_p (const_tree
);
5560 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
5561 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
5565 extern const struct attribute_spec
*lookup_attribute_spec (const_tree
);
5567 extern void init_attributes (void);
5569 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5570 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5571 it should be modified in place; if a TYPE, a copy should be created
5572 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5573 information, in the form of a bitwise OR of flags in enum attribute_flags
5574 from tree.h. Depending on these flags, some attributes may be
5575 returned to be applied at a later stage (for example, to apply
5576 a decl attribute to the declaration rather than to its type). */
5577 extern tree
decl_attributes (tree
*, tree
, int);
5579 /* In integrate.c */
5580 extern void set_decl_abstract_flags (tree
, int);
5581 extern void set_decl_origin_self (tree
);
5583 /* In stor-layout.c */
5584 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
5585 extern void fixup_signed_type (tree
);
5586 extern void internal_reference_types (void);
5587 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
5590 extern tree
tree_output_constant_def (tree
);
5591 extern void make_decl_rtl (tree
);
5592 extern rtx
make_decl_rtl_for_debug (tree
);
5593 extern void make_decl_one_only (tree
, tree
);
5594 extern int supports_one_only (void);
5595 extern void resolve_unique_section (tree
, int, int);
5596 extern void mark_referenced (tree
);
5597 extern void mark_decl_referenced (tree
);
5598 extern void notice_global_symbol (tree
);
5599 extern void set_user_assembler_name (tree
, const char *);
5600 extern void process_pending_assemble_externals (void);
5601 extern void finish_aliases_1 (void);
5602 extern void finish_aliases_2 (void);
5603 extern void remove_unreachable_alias_pairs (void);
5604 extern bool decl_replaceable_p (tree
);
5605 extern bool decl_binds_to_current_def_p (tree
);
5607 /* Derived type for use by compute_visible_aliases and callers. A symbol
5608 alias set is a pointer set into which we enter IDENTIFIER_NODES bearing
5609 the canonicalised assembler-level symbol names corresponding to decls
5610 and their aliases. */
5611 typedef struct pointer_set_t symbol_alias_set_t
;
5613 extern void symbol_alias_set_destroy (symbol_alias_set_t
*);
5614 extern int symbol_alias_set_contains (const symbol_alias_set_t
*, tree
);
5615 extern symbol_alias_set_t
* propagate_aliases_backward (bool (*)
5616 (tree
, tree
, void *),
5620 extern void expand_computed_goto (tree
);
5621 extern bool parse_output_constraint (const char **, int, int, int,
5622 bool *, bool *, bool *);
5623 extern bool parse_input_constraint (const char **, int, int, int, int,
5624 const char * const *, bool *, bool *);
5625 extern void expand_asm_stmt (gimple
);
5626 extern tree
resolve_asm_operand_names (tree
, tree
, tree
, tree
);
5627 extern bool expand_switch_using_bit_tests_p (tree
, tree
, unsigned int,
5629 extern void expand_case (gimple
);
5630 extern void expand_decl (tree
);
5632 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5633 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
5637 /* In tree-inline.c */
5639 /* The type of a set of already-visited pointers. Functions for creating
5640 and manipulating it are declared in pointer-set.h */
5641 struct pointer_set_t
;
5643 /* The type of a callback function for walking over tree structure. */
5645 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
5647 /* The type of a callback function that represents a custom walk_tree. */
5649 typedef tree (*walk_tree_lh
) (tree
*, int *, tree (*) (tree
*, int *, void *),
5650 void *, struct pointer_set_t
*);
5652 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
5654 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5656 #define walk_tree(a,b,c,d) \
5657 walk_tree_1 (a, b, c, d, NULL)
5658 #define walk_tree_without_duplicates(a,b,c) \
5659 walk_tree_without_duplicates_1 (a, b, c, NULL)
5662 /* Assign the RTX to declaration. */
5664 extern void set_decl_rtl (tree
, rtx
);
5665 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
5667 /* Enum and arrays used for tree allocation stats.
5668 Keep in sync with tree.c:tree_node_kind_names. */
5690 extern int tree_node_counts
[];
5691 extern int tree_node_sizes
[];
5693 /* True if we are in gimple form and the actions of the folders need to
5694 be restricted. False if we are not in gimple form and folding is not
5695 restricted to creating gimple expressions. */
5696 extern bool in_gimple_form
;
5699 extern tree
get_base_address (tree t
);
5700 extern void mark_addressable (tree
);
5704 struct GTY(()) tree_map_base
{
5708 extern int tree_map_base_eq (const void *, const void *);
5709 extern unsigned int tree_map_base_hash (const void *);
5710 extern int tree_map_base_marked_p (const void *);
5711 extern bool list_equal_p (const_tree
, const_tree
);
5713 /* Map from a tree to another tree. */
5715 struct GTY(()) tree_map
{
5716 struct tree_map_base base
;
5721 #define tree_map_eq tree_map_base_eq
5722 extern unsigned int tree_map_hash (const void *);
5723 #define tree_map_marked_p tree_map_base_marked_p
5725 /* Map from a decl tree to another tree. */
5727 struct GTY(()) tree_decl_map
{
5728 struct tree_map_base base
;
5732 #define tree_decl_map_eq tree_map_base_eq
5733 extern unsigned int tree_decl_map_hash (const void *);
5734 #define tree_decl_map_marked_p tree_map_base_marked_p
5736 /* Map from a tree to an int. */
5738 struct GTY(()) tree_int_map
{
5739 struct tree_map_base base
;
5743 #define tree_int_map_eq tree_map_base_eq
5744 #define tree_int_map_hash tree_map_base_hash
5745 #define tree_int_map_marked_p tree_map_base_marked_p
5747 /* Map from a tree to initialization/finalization priorities. */
5749 struct GTY(()) tree_priority_map
{
5750 struct tree_map_base base
;
5755 #define tree_priority_map_eq tree_map_base_eq
5756 #define tree_priority_map_hash tree_map_base_hash
5757 #define tree_priority_map_marked_p tree_map_base_marked_p
5759 /* Map from a decl tree to a tree vector. */
5761 struct GTY(()) tree_vec_map
{
5762 struct tree_map_base base
;
5766 #define tree_vec_map_eq tree_map_base_eq
5767 #define tree_vec_map_hash tree_decl_map_hash
5768 #define tree_vec_map_marked_p tree_map_base_marked_p
5772 tree
target_for_debug_bind (tree
);
5774 /* In tree-ssa-address.c. */
5775 extern tree
tree_mem_ref_addr (tree
, tree
);
5776 extern void copy_mem_ref_info (tree
, tree
);
5779 extern bool ssa_name_nonnegative_p (const_tree
);
5781 /* In tree-object-size.c. */
5782 extern void init_object_sizes (void);
5783 extern void fini_object_sizes (void);
5784 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
5787 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
5788 extern tree
build_personality_function (const char *);
5790 /* In tree-inline.c. */
5792 void init_inline_once (void);
5794 /* Compute the number of operands in an expression node NODE. For
5795 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5796 otherwise it is looked up from the node's code. */
5798 tree_operand_length (const_tree node
)
5800 if (VL_EXP_CLASS_P (node
))
5801 return VL_EXP_OPERAND_LENGTH (node
);
5803 return TREE_CODE_LENGTH (TREE_CODE (node
));
5806 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5807 have to go towards the end of tree.h so that union tree_node is fully
5808 defined by this point. */
5810 /* Structure containing iterator state. */
5811 typedef struct call_expr_arg_iterator_d
{
5812 tree t
; /* the call_expr */
5813 int n
; /* argument count */
5814 int i
; /* next argument index */
5815 } call_expr_arg_iterator
;
5817 typedef struct const_call_expr_arg_iterator_d
{
5818 const_tree t
; /* the call_expr */
5819 int n
; /* argument count */
5820 int i
; /* next argument index */
5821 } const_call_expr_arg_iterator
;
5823 /* Initialize the abstract argument list iterator object ITER with the
5824 arguments from CALL_EXPR node EXP. */
5826 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5829 iter
->n
= call_expr_nargs (exp
);
5834 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5837 iter
->n
= call_expr_nargs (exp
);
5841 /* Return the next argument from abstract argument list iterator object ITER,
5842 and advance its state. Return NULL_TREE if there are no more arguments. */
5844 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5847 if (iter
->i
>= iter
->n
)
5849 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5854 static inline const_tree
5855 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5858 if (iter
->i
>= iter
->n
)
5860 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5865 /* Initialize the abstract argument list iterator object ITER, then advance
5866 past and return the first argument. Useful in for expressions, e.g.
5867 for (arg = first_call_expr_arg (exp, &iter); arg;
5868 arg = next_call_expr_arg (&iter)) */
5870 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5872 init_call_expr_arg_iterator (exp
, iter
);
5873 return next_call_expr_arg (iter
);
5876 static inline const_tree
5877 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5879 init_const_call_expr_arg_iterator (exp
, iter
);
5880 return next_const_call_expr_arg (iter
);
5883 /* Test whether there are more arguments in abstract argument list iterator
5884 ITER, without changing its state. */
5886 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5888 return (iter
->i
< iter
->n
);
5892 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
5894 return (iter
->i
< iter
->n
);
5897 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5898 (of type call_expr_arg_iterator) to hold the iteration state. */
5899 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5900 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5901 (arg) = next_call_expr_arg (&(iter)))
5903 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5904 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5905 (arg) = next_const_call_expr_arg (&(iter)))
5907 /* Return true if tree node T is a language-specific node. */
5909 is_lang_specific (tree t
)
5911 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5914 /* In gimple-low.c. */
5915 extern bool block_may_fallthru (const_tree
);
5917 #endif /* GCC_TREE_H */