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, 2012
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 /* When procesing aliases on symtab level, we need the declaration of target.
243 For this reason we need to queue aliases and process them after all declarations
244 has been produced. */
246 typedef struct GTY(()) alias_pair
252 /* Define gc'd vector type. */
253 DEF_VEC_O(alias_pair
);
254 DEF_VEC_ALLOC_O(alias_pair
,gc
);
256 extern GTY(()) VEC(alias_pair
,gc
) * alias_pairs
;
259 /* Classify which part of the compiler has defined a given builtin function.
260 Note that we assume below that this is no more than two bits. */
269 /* Last marker used for LTO stremaing of built_in_class. We can not add it
270 to the enum since we need the enumb to fit in 2 bits. */
271 #define BUILT_IN_LAST (BUILT_IN_NORMAL + 1)
273 /* Names for the above. */
274 extern const char *const built_in_class_names
[4];
276 /* Codes that identify the various built in functions
277 so that expand_call can identify them quickly. */
279 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
280 enum built_in_function
282 #include "builtins.def"
284 /* Complex division routines in libgcc. These are done via builtins
285 because emit_library_call_value can't handle complex values. */
286 BUILT_IN_COMPLEX_MUL_MIN
,
287 BUILT_IN_COMPLEX_MUL_MAX
288 = BUILT_IN_COMPLEX_MUL_MIN
289 + MAX_MODE_COMPLEX_FLOAT
290 - MIN_MODE_COMPLEX_FLOAT
,
292 BUILT_IN_COMPLEX_DIV_MIN
,
293 BUILT_IN_COMPLEX_DIV_MAX
294 = BUILT_IN_COMPLEX_DIV_MIN
295 + MAX_MODE_COMPLEX_FLOAT
296 - MIN_MODE_COMPLEX_FLOAT
,
298 /* Upper bound on non-language-specific builtins. */
303 /* Names for the above. */
304 extern const char * built_in_names
[(int) END_BUILTINS
];
306 /* Helper macros for math builtins. */
308 #define BUILTIN_EXP10_P(FN) \
309 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
310 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
312 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
313 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
314 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
316 #define BUILTIN_SQRT_P(FN) \
317 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
319 #define BUILTIN_CBRT_P(FN) \
320 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
322 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
324 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
325 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
326 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
328 /* In an OMP_CLAUSE node. */
330 /* Number of operands and names for each clause. */
331 extern unsigned const char omp_clause_num_ops
[];
332 extern const char * const omp_clause_code_name
[];
334 /* Clause codes. Do not reorder, as this is used to index into the tables
335 omp_clause_num_ops and omp_clause_code_name. */
338 /* Clause zero is special-cased inside the parser
339 (c_parser_omp_variable_list). */
340 OMP_CLAUSE_ERROR
= 0,
342 /* OpenMP clause: private (variable_list). */
345 /* OpenMP clause: shared (variable_list). */
348 /* OpenMP clause: firstprivate (variable_list). */
349 OMP_CLAUSE_FIRSTPRIVATE
,
351 /* OpenMP clause: lastprivate (variable_list). */
352 OMP_CLAUSE_LASTPRIVATE
,
354 /* OpenMP clause: reduction (operator:variable_list).
355 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
356 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
357 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
359 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
360 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
361 OMP_CLAUSE_REDUCTION
,
363 /* OpenMP clause: copyin (variable_list). */
366 /* OpenMP clause: copyprivate (variable_list). */
367 OMP_CLAUSE_COPYPRIVATE
,
369 /* OpenMP clause: if (scalar-expression). */
372 /* OpenMP clause: num_threads (integer-expression). */
373 OMP_CLAUSE_NUM_THREADS
,
375 /* OpenMP clause: schedule. */
378 /* OpenMP clause: nowait. */
381 /* OpenMP clause: ordered. */
384 /* OpenMP clause: default. */
387 /* OpenMP clause: collapse (constant-integer-expression). */
390 /* OpenMP clause: untied. */
393 /* OpenMP clause: final (scalar-expression). */
396 /* OpenMP clause: mergeable. */
400 /* The definition of tree nodes fills the next several pages. */
402 /* A tree node can represent a data type, a variable, an expression
403 or a statement. Each node has a TREE_CODE which says what kind of
404 thing it represents. Some common codes are:
405 INTEGER_TYPE -- represents a type of integers.
406 ARRAY_TYPE -- represents a type of pointer.
407 VAR_DECL -- represents a declared variable.
408 INTEGER_CST -- represents a constant integer value.
409 PLUS_EXPR -- represents a sum (an expression).
411 As for the contents of a tree node: there are some fields
412 that all nodes share. Each TREE_CODE has various special-purpose
413 fields as well. The fields of a node are never accessed directly,
414 always through accessor macros. */
416 /* Every kind of tree node starts with this structure,
417 so all nodes have these fields.
419 See the accessor macros, defined below, for documentation of the
422 struct GTY(()) tree_base
{
423 ENUM_BITFIELD(tree_code
) code
: 16;
425 unsigned side_effects_flag
: 1;
426 unsigned constant_flag
: 1;
427 unsigned addressable_flag
: 1;
428 unsigned volatile_flag
: 1;
429 unsigned readonly_flag
: 1;
430 unsigned unsigned_flag
: 1;
431 unsigned asm_written_flag
: 1;
432 unsigned nowarning_flag
: 1;
434 unsigned used_flag
: 1;
435 unsigned nothrow_flag
: 1;
436 unsigned static_flag
: 1;
437 unsigned public_flag
: 1;
438 unsigned private_flag
: 1;
439 unsigned protected_flag
: 1;
440 unsigned deprecated_flag
: 1;
441 unsigned saturating_flag
: 1;
443 unsigned default_def_flag
: 1;
444 unsigned lang_flag_0
: 1;
445 unsigned lang_flag_1
: 1;
446 unsigned lang_flag_2
: 1;
447 unsigned lang_flag_3
: 1;
448 unsigned lang_flag_4
: 1;
449 unsigned lang_flag_5
: 1;
450 unsigned lang_flag_6
: 1;
452 unsigned visited
: 1;
453 unsigned packed_flag
: 1;
454 unsigned user_align
: 1;
455 unsigned nameless_flag
: 1;
459 /* This field is only used with type nodes; the only reason it is present
460 in tree_base instead of tree_type is to save space. The size of the
461 field must be large enough to hold addr_space_t values. */
462 unsigned address_space
: 8;
465 struct GTY(()) tree_typed
{
466 struct tree_base base
;
470 struct GTY(()) tree_common
{
471 struct tree_typed typed
;
475 /* The following table lists the uses of each of the above flags and
476 for which types of nodes they are defined.
481 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL
483 CONSTRUCTOR, IDENTIFIER_NODE
484 STMT_EXPR, it means we want the result of the enclosed expression
486 CALL_EXPR_TAILCALL in
495 VAR_DECL, FUNCTION_DECL
498 TREE_NO_TRAMPOLINE in
504 TREE_SYMBOL_REFERENCED in
508 TARGET_EXPR, WITH_CLEANUP_EXPR
510 TRY_CATCH_IS_CLEANUP in
516 TYPE_REF_CAN_ALIAS_ALL in
517 POINTER_TYPE, REFERENCE_TYPE
528 TRANSACTION_EXPR_OUTER in
534 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
537 VAR_DECL, FUNCTION_DECL
543 CALL_EXPR_VA_ARG_PACK in
546 TYPE_CACHED_VALUES_P in
549 SAVE_EXPR_RESOLVED_P in
552 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
553 OMP_CLAUSE_LASTPRIVATE
555 OMP_CLAUSE_PRIVATE_DEBUG in
558 TRANSACTION_EXPR_RELAXED in
566 CALL_EXPR_RETURN_SLOT_OPT in
572 OMP_PARALLEL_COMBINED in
574 OMP_CLAUSE_PRIVATE_OUTER_REF in
577 TYPE_REF_IS_RVALUE in
586 CALL_FROM_THUNK_P and
587 CALL_ALLOCA_FOR_VAR_P in
602 TREE_THIS_VOLATILE in
625 TYPE_SIZES_GIMPLIFIED in
639 VAR_DECL, FUNCTION_DECL, TYPE_DECL
640 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
641 BLOCK, SSA_NAME, STRING_CST
660 INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, ARRAY_RANGE_REF
668 IDENTIFIER_TRANSPARENT_ALIAS in
674 all trees (used liberally by many passes)
681 VAR_DECL_IS_VIRTUAL_OPERAND in
695 TYPE_VECTOR_OPAQUE in
698 SSA_NAME_IS_DEFAULT_DEF in
703 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
704 enum tree_node_structure_enum
{
705 #include "treestruct.def"
710 /* Define accessors for the fields that all tree nodes have
711 (though some fields are not used for all kinds of nodes). */
713 /* The tree-code says what kind of node it is.
714 Codes are defined in tree.def. */
715 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
716 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
718 /* When checking is enabled, errors will be generated if a tree node
719 is accessed incorrectly. The macros die with a fatal error. */
720 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
722 #define TREE_CHECK(T, CODE) __extension__ \
723 ({ __typeof (T) const __t = (T); \
724 if (TREE_CODE (__t) != (CODE)) \
725 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
729 #define TREE_NOT_CHECK(T, CODE) __extension__ \
730 ({ __typeof (T) const __t = (T); \
731 if (TREE_CODE (__t) == (CODE)) \
732 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
736 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
737 ({ __typeof (T) const __t = (T); \
738 if (TREE_CODE (__t) != (CODE1) \
739 && TREE_CODE (__t) != (CODE2)) \
740 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
741 (CODE1), (CODE2), 0); \
744 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
745 ({ __typeof (T) const __t = (T); \
746 if (TREE_CODE (__t) == (CODE1) \
747 || TREE_CODE (__t) == (CODE2)) \
748 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
749 (CODE1), (CODE2), 0); \
752 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
753 ({ __typeof (T) const __t = (T); \
754 if (TREE_CODE (__t) != (CODE1) \
755 && TREE_CODE (__t) != (CODE2) \
756 && TREE_CODE (__t) != (CODE3)) \
757 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
758 (CODE1), (CODE2), (CODE3), 0); \
761 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
762 ({ __typeof (T) const __t = (T); \
763 if (TREE_CODE (__t) == (CODE1) \
764 || TREE_CODE (__t) == (CODE2) \
765 || TREE_CODE (__t) == (CODE3)) \
766 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
767 (CODE1), (CODE2), (CODE3), 0); \
770 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __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_CODE (__t) != (CODE4)) \
776 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
777 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
780 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
781 ({ __typeof (T) const __t = (T); \
782 if (TREE_CODE (__t) == (CODE1) \
783 || TREE_CODE (__t) == (CODE2) \
784 || TREE_CODE (__t) == (CODE3) \
785 || TREE_CODE (__t) == (CODE4)) \
786 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
787 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
790 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
791 ({ __typeof (T) const __t = (T); \
792 if (TREE_CODE (__t) != (CODE1) \
793 && TREE_CODE (__t) != (CODE2) \
794 && TREE_CODE (__t) != (CODE3) \
795 && TREE_CODE (__t) != (CODE4) \
796 && TREE_CODE (__t) != (CODE5)) \
797 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
798 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
801 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
802 ({ __typeof (T) const __t = (T); \
803 if (TREE_CODE (__t) == (CODE1) \
804 || TREE_CODE (__t) == (CODE2) \
805 || TREE_CODE (__t) == (CODE3) \
806 || TREE_CODE (__t) == (CODE4) \
807 || TREE_CODE (__t) == (CODE5)) \
808 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
809 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
812 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
813 ({ __typeof (T) const __t = (T); \
814 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
815 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
819 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
820 ({ __typeof (T) const __t = (T); \
821 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
822 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
826 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
827 ({ __typeof (T) const __t = (T); \
828 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
829 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
833 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
834 ({ __typeof (T) const __t = (T); \
835 if (TREE_CODE (__t) != OMP_CLAUSE) \
836 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
838 if (__t->omp_clause.code != (CODE)) \
839 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
843 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
844 ({ __typeof (T) const __t = (T); \
845 if (TREE_CODE (__t) != OMP_CLAUSE) \
846 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
848 if ((int) __t->omp_clause.code < (int) (CODE1) \
849 || (int) __t->omp_clause.code > (int) (CODE2)) \
850 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
851 __FUNCTION__, (CODE1), (CODE2)); \
854 /* These checks have to be special cased. */
855 #define EXPR_CHECK(T) __extension__ \
856 ({ __typeof (T) const __t = (T); \
857 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
858 if (!IS_EXPR_CODE_CLASS (__c)) \
859 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
863 /* These checks have to be special cased. */
864 #define NON_TYPE_CHECK(T) __extension__ \
865 ({ __typeof (T) const __t = (T); \
867 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
871 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
872 (*({__typeof (T) const __t = (T); \
873 const int __i = (I); \
874 if (TREE_CODE (__t) != TREE_VEC) \
875 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
877 if (__i < 0 || __i >= __t->vec.length) \
878 tree_vec_elt_check_failed (__i, __t->vec.length, \
879 __FILE__, __LINE__, __FUNCTION__); \
880 &__t->vec.a[__i]; }))
882 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
883 (*({__typeof (T) const __t = (T); \
884 const int __i = (I); \
885 if (TREE_CODE (__t) != OMP_CLAUSE) \
886 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
888 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
889 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
891 &__t->omp_clause.ops[__i]; }))
893 /* Special checks for TREE_OPERANDs. */
894 #define TREE_OPERAND_CHECK(T, I) __extension__ \
895 (*({__typeof (T) const __t = EXPR_CHECK (T); \
896 const int __i = (I); \
897 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
898 tree_operand_check_failed (__i, __t, \
899 __FILE__, __LINE__, __FUNCTION__); \
900 &__t->exp.operands[__i]; }))
902 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
903 (*({__typeof (T) const __t = (T); \
904 const int __i = (I); \
905 if (TREE_CODE (__t) != CODE) \
906 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
907 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
908 tree_operand_check_failed (__i, __t, \
909 __FILE__, __LINE__, __FUNCTION__); \
910 &__t->exp.operands[__i]; }))
912 /* Nodes are chained together for many purposes.
913 Types are chained together to record them for being output to the debugger
914 (see the function `chain_type').
915 Decls in the same scope are chained together to record the contents
917 Statement nodes for successive statements used to be chained together.
918 Often lists of things are represented by TREE_LIST nodes that
919 are chained together. */
921 #define TREE_CHAIN(NODE) __extension__ \
922 (*({__typeof (NODE) const __t = CONTAINS_STRUCT_CHECK (NODE, TS_COMMON);\
923 &__t->common.chain; }))
925 /* In all nodes that are expressions, this is the data type of the expression.
926 In POINTER_TYPE nodes, this is the type that the pointer points to.
927 In ARRAY_TYPE nodes, this is the type of the elements.
928 In VECTOR_TYPE nodes, this is the type of the elements. */
929 #define TREE_TYPE(NODE) __extension__ \
930 (*({__typeof (NODE) const __t = CONTAINS_STRUCT_CHECK (NODE, TS_TYPED); \
931 &__t->typed.type; }))
933 extern void tree_contains_struct_check_failed (const_tree
,
934 const enum tree_node_structure_enum
,
935 const char *, int, const char *)
938 extern void tree_check_failed (const_tree
, const char *, int, const char *,
939 ...) ATTRIBUTE_NORETURN
;
940 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
941 ...) ATTRIBUTE_NORETURN
;
942 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
943 const char *, int, const char *)
945 extern void tree_range_check_failed (const_tree
, const char *, int,
946 const char *, enum tree_code
,
949 extern void tree_not_class_check_failed (const_tree
,
950 const enum tree_code_class
,
951 const char *, int, const char *)
953 extern void tree_vec_elt_check_failed (int, int, const char *,
956 extern void phi_node_elt_check_failed (int, int, const char *,
959 extern void tree_operand_check_failed (int, const_tree
,
960 const char *, int, const char *)
962 extern void omp_clause_check_failed (const_tree
, const char *, int,
963 const char *, enum omp_clause_code
)
965 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
968 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
969 const char *, enum omp_clause_code
,
970 enum omp_clause_code
)
973 #else /* not ENABLE_TREE_CHECKING, or not gcc */
975 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
976 #define TREE_CHECK(T, CODE) (T)
977 #define TREE_NOT_CHECK(T, CODE) (T)
978 #define TREE_CHECK2(T, CODE1, CODE2) (T)
979 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
980 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
981 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
982 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
983 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
984 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
985 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
986 #define TREE_CLASS_CHECK(T, CODE) (T)
987 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
988 #define EXPR_CHECK(T) (T)
989 #define NON_TYPE_CHECK(T) (T)
990 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
991 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
992 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
993 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
994 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
995 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
997 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
998 #define TREE_TYPE(NODE) ((NODE)->typed.type)
1002 #define TREE_BLOCK(NODE) *(tree_block (NODE))
1004 #include "tree-check.h"
1006 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
1007 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
1008 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
1009 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
1010 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
1011 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
1012 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
1013 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
1014 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
1015 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
1016 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
1018 #define RECORD_OR_UNION_CHECK(T) \
1019 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
1020 #define NOT_RECORD_OR_UNION_CHECK(T) \
1021 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
1023 #define NUMERICAL_TYPE_CHECK(T) \
1024 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
1027 /* Here is how primitive or already-canonicalized types' hash codes
1029 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
1031 /* A simple hash function for an arbitrary tree node. This must not be
1032 used in hash tables which are saved to a PCH. */
1033 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
1035 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
1036 #define CONVERT_EXPR_CODE_P(CODE) \
1037 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
1039 /* Similarly, but accept an expressions instead of a tree code. */
1040 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
1042 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
1044 #define CASE_CONVERT \
1048 /* Given an expression as a tree, strip any conversion that generates
1049 no instruction. Accepts both tree and const_tree arguments since
1050 we are not modifying the tree itself. */
1052 #define STRIP_NOPS(EXP) \
1053 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
1055 /* Like STRIP_NOPS, but don't let the signedness change either. */
1057 #define STRIP_SIGN_NOPS(EXP) \
1058 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
1060 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1062 #define STRIP_TYPE_NOPS(EXP) \
1063 while ((CONVERT_EXPR_P (EXP) \
1064 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1065 && TREE_OPERAND (EXP, 0) != error_mark_node \
1066 && (TREE_TYPE (EXP) \
1067 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1068 (EXP) = TREE_OPERAND (EXP, 0)
1070 /* Remove unnecessary type conversions according to
1071 tree_ssa_useless_type_conversion. */
1073 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1074 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1076 /* Nonzero if TYPE represents an integral type. Note that we do not
1077 include COMPLEX types here. Keep these checks in ascending code
1080 #define INTEGRAL_TYPE_P(TYPE) \
1081 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1082 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1083 || TREE_CODE (TYPE) == INTEGER_TYPE)
1085 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1087 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1088 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1090 /* Nonzero if TYPE represents a saturating fixed-point type. */
1092 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1093 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1095 /* Nonzero if TYPE represents a fixed-point type. */
1097 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1099 /* Nonzero if TYPE represents a scalar floating-point type. */
1101 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1103 /* Nonzero if TYPE represents a complex floating-point type. */
1105 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1106 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1107 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1109 /* Nonzero if TYPE represents a vector integer type. */
1111 #define VECTOR_INTEGER_TYPE_P(TYPE) \
1112 (TREE_CODE (TYPE) == VECTOR_TYPE \
1113 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
1116 /* Nonzero if TYPE represents a vector floating-point type. */
1118 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1119 (TREE_CODE (TYPE) == VECTOR_TYPE \
1120 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1122 /* Nonzero if TYPE represents a floating-point type, including complex
1123 and vector floating-point types. The vector and complex check does
1124 not use the previous two macros to enable early folding. */
1126 #define FLOAT_TYPE_P(TYPE) \
1127 (SCALAR_FLOAT_TYPE_P (TYPE) \
1128 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1129 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1130 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1132 /* Nonzero if TYPE represents a decimal floating-point type. */
1133 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1134 (SCALAR_FLOAT_TYPE_P (TYPE) \
1135 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1137 /* Nonzero if TYPE is a record or union type. */
1138 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1139 (TREE_CODE (TYPE) == RECORD_TYPE \
1140 || TREE_CODE (TYPE) == UNION_TYPE \
1141 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1143 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1144 Keep these checks in ascending code order. */
1146 #define AGGREGATE_TYPE_P(TYPE) \
1147 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1149 /* Nonzero if TYPE represents a pointer or reference type.
1150 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1151 ascending code order. */
1153 #define POINTER_TYPE_P(TYPE) \
1154 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1156 /* Nonzero if this type is a complete type. */
1157 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1159 /* Nonzero if this type is the (possibly qualified) void type. */
1160 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1162 /* Nonzero if this type is complete or is cv void. */
1163 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1164 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1166 /* Nonzero if this type is complete or is an array with unspecified bound. */
1167 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1168 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1171 /* Define many boolean fields that all tree nodes have. */
1173 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
1174 of this is needed. So it cannot be in a register.
1175 In a FUNCTION_DECL it has no meaning.
1176 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1177 In LABEL_DECL nodes, it means a goto for this label has been seen
1178 from a place outside all binding contours that restore stack levels.
1179 In ..._TYPE nodes, it means that objects of this type must be fully
1180 addressable. This means that pieces of this object cannot go into
1181 register parameters, for example. If this a function type, this
1182 means that the value must be returned in memory.
1183 In IDENTIFIER_NODEs, this means that some extern decl for this name
1184 had its address taken. That matters for inline functions. */
1185 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1187 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1188 exit of a function. Calls for which this is true are candidates for tail
1189 call optimizations. */
1190 #define CALL_EXPR_TAILCALL(NODE) \
1191 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1193 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1194 CASE_LOW operand has been processed. */
1195 #define CASE_LOW_SEEN(NODE) \
1196 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1198 #define PREDICT_EXPR_OUTCOME(NODE) \
1199 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1200 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1201 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1202 #define PREDICT_EXPR_PREDICTOR(NODE) \
1203 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1205 /* In a VAR_DECL, nonzero means allocate static storage.
1206 In a FUNCTION_DECL, nonzero if function has been defined.
1207 In a CONSTRUCTOR, nonzero means allocate static storage. */
1208 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1210 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1211 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1213 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1214 should only be executed if an exception is thrown, not on normal exit
1216 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1218 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1219 separate cleanup in honor_protect_cleanup_actions. */
1220 #define TRY_CATCH_IS_CLEANUP(NODE) \
1221 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1223 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1224 CASE_HIGH operand has been processed. */
1225 #define CASE_HIGH_SEEN(NODE) \
1226 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1228 /* Used to mark scoped enums. */
1229 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
1231 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
1232 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
1234 /* In an expr node (usually a conversion) this means the node was made
1235 implicitly and should not lead to any sort of warning. In a decl node,
1236 warnings concerning the decl should be suppressed. This is used at
1237 least for used-before-set warnings, and it set after one warning is
1239 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1241 /* Used to indicate that this TYPE represents a compiler-generated entity. */
1242 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
1244 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1245 this string as an argument. */
1246 #define TREE_SYMBOL_REFERENCED(NODE) \
1247 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1249 /* Nonzero in a pointer or reference type means the data pointed to
1250 by this type can alias anything. */
1251 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1252 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1254 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1255 #define MOVE_NONTEMPORAL(NODE) \
1256 (EXPR_CHECK (NODE)->base.static_flag)
1258 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1259 there was an overflow in folding. */
1261 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1263 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1265 #define TREE_OVERFLOW_P(EXPR) \
1266 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1268 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1269 nonzero means name is to be accessible from outside this translation unit.
1270 In an IDENTIFIER_NODE, nonzero means an external declaration
1271 accessible from outside this translation unit was previously seen
1272 for this name in an inner scope. */
1273 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1275 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1276 of cached values, or is something else. */
1277 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1279 /* In a SAVE_EXPR, indicates that the original expression has already
1280 been substituted with a VAR_DECL that contains the value. */
1281 #define SAVE_EXPR_RESOLVED_P(NODE) \
1282 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1284 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1286 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1287 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1289 /* In any expression, decl, or constant, nonzero means it has side effects or
1290 reevaluation of the whole expression could produce a different value.
1291 This is set if any subexpression is a function call, a side effect or a
1292 reference to a volatile variable. In a ..._DECL, this is set only if the
1293 declaration said `volatile'. This will never be set for a constant. */
1294 #define TREE_SIDE_EFFECTS(NODE) \
1295 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1297 /* In a LABEL_DECL, nonzero means this label had its address taken
1298 and therefore can never be deleted and is a jump target for
1300 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1302 /* Nonzero means this expression is volatile in the C sense:
1303 its address should be of type `volatile WHATEVER *'.
1304 In other words, the declared item is volatile qualified.
1305 This is used in _DECL nodes and _REF nodes.
1306 On a FUNCTION_DECL node, this means the function does not
1307 return normally. This is the same effect as setting
1308 the attribute noreturn on the function in C.
1310 In a ..._TYPE node, means this type is volatile-qualified.
1311 But use TYPE_VOLATILE instead of this macro when the node is a type,
1312 because eventually we may make that a different bit.
1314 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1315 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1317 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1318 accessing the memory pointed to won't generate a trap. However,
1319 this only applies to an object when used appropriately: it doesn't
1320 mean that writing a READONLY mem won't trap.
1322 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1323 (or slice of the array) always belongs to the range of the array.
1324 I.e. that the access will not trap, provided that the access to
1325 the base to the array will not trap. */
1326 #define TREE_THIS_NOTRAP(NODE) \
1327 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
1328 ARRAY_RANGE_REF)->base.nothrow_flag)
1330 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1331 nonzero means it may not be the lhs of an assignment.
1332 Nonzero in a FUNCTION_DECL means this function should be treated
1333 as "const" function (can only read its arguments). */
1334 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1336 /* Value of expression is constant. Always on in all ..._CST nodes. May
1337 also appear in an expression or decl where the value is constant. */
1338 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1340 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1341 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1342 (TYPE_CHECK (NODE)->base.constant_flag)
1344 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1345 #define DECL_UNSIGNED(NODE) \
1346 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1348 /* In integral and pointer types, means an unsigned type. */
1349 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1351 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1352 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1353 This is interesting in an inline function, since it might not need
1354 to be compiled separately.
1355 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
1356 or TYPE_DECL if the debugging info for the type has been written.
1357 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1358 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1360 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1362 /* Nonzero in a _DECL if the name is used in its scope.
1363 Nonzero in an expr node means inhibit warning if value is unused.
1364 In IDENTIFIER_NODEs, this means that some extern decl for this name
1366 In a BLOCK, this means that the block contains variables that are used. */
1367 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1369 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
1370 throw an exception. In a CALL_EXPR, nonzero means the call cannot
1371 throw. We can't easily check the node type here as the C++
1372 frontend also uses this flag (for AGGR_INIT_EXPR). */
1373 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1375 /* In a CALL_EXPR, means that it's safe to use the target of the call
1376 expansion as the return slot for a call that returns in memory. */
1377 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1378 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1380 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1381 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1383 #define DECL_BY_REFERENCE(NODE) \
1384 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1385 RESULT_DECL)->decl_common.decl_by_reference_flag)
1387 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1388 can be used as restricted tag to disambiguate against other restrict
1389 pointers. Used by fortran to capture something like non-addressability
1390 (which it isn't really because the middle-end does take addresses of
1392 #define DECL_RESTRICTED_P(NODE) \
1393 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1394 RESULT_DECL)->decl_common.decl_restricted_flag)
1396 #define DECL_READ_P(NODE) \
1397 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1399 #define DECL_NONSHAREABLE(NODE) \
1400 (TREE_CHECK2 (NODE, VAR_DECL, \
1401 RESULT_DECL)->decl_common.decl_nonshareable_flag)
1403 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1404 thunked-to function. */
1405 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1407 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
1408 it has been built for the declaration of a variable-sized object. */
1409 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
1410 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1412 /* In a type, nonzero means that all objects of the type are guaranteed by the
1413 language or front-end to be properly aligned, so we can indicate that a MEM
1414 of this type is aligned at least to the alignment of the type, even if it
1415 doesn't appear that it is. We see this, for example, in object-oriented
1416 languages where a tag field may show this is an object of a more-aligned
1417 variant of the more generic type.
1419 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1421 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1423 /* Used in classes in C++. */
1424 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1425 /* Used in classes in C++. */
1426 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1428 /* True if reference type NODE is a C++ rvalue reference. */
1429 #define TYPE_REF_IS_RVALUE(NODE) \
1430 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1432 /* Nonzero in a _DECL if the use of the name is defined as a
1433 deprecated feature by __attribute__((deprecated)). */
1434 #define TREE_DEPRECATED(NODE) \
1435 ((NODE)->base.deprecated_flag)
1437 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1438 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1439 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1440 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1442 /* In fixed-point types, means a saturating type. */
1443 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1445 /* These flags are available for each language front end to use internally. */
1446 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1447 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1448 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1449 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1450 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1451 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1452 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1454 /* Define additional fields and accessors for nodes representing constants. */
1456 /* In an INTEGER_CST node. These two together make a 2-word integer.
1457 If the data type is signed, the value is sign-extended to 2 words
1458 even though not all of them may really be in use.
1459 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1460 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1461 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1462 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1464 #define INT_CST_LT(A, B) \
1465 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1466 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1467 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1469 #define INT_CST_LT_UNSIGNED(A, B) \
1470 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1471 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1472 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1473 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1474 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1476 struct GTY(()) tree_int_cst
{
1477 struct tree_typed typed
;
1481 /* In a REAL_CST node. struct real_value is an opaque entity, with
1482 manipulators defined in real.h. We don't want tree.h depending on
1483 real.h and transitively on tm.h. */
1486 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1487 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1489 struct GTY(()) tree_real_cst
{
1490 struct tree_typed typed
;
1491 struct real_value
* real_cst_ptr
;
1494 /* In a FIXED_CST node. */
1497 #define TREE_FIXED_CST_PTR(NODE) \
1498 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1499 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1501 struct GTY(()) tree_fixed_cst
{
1502 struct tree_typed typed
;
1503 struct fixed_value
* fixed_cst_ptr
;
1506 /* In a STRING_CST */
1507 /* In C terms, this is sizeof, not strlen. */
1508 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1509 #define TREE_STRING_POINTER(NODE) \
1510 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1512 struct GTY(()) tree_string
{
1513 struct tree_typed typed
;
1518 /* In a COMPLEX_CST node. */
1519 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1520 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1522 struct GTY(()) tree_complex
{
1523 struct tree_typed typed
;
1528 /* In a VECTOR_CST node. */
1529 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1530 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
1531 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
1533 struct GTY(()) tree_vector
{
1534 struct tree_typed typed
;
1535 tree
GTY ((length ("TYPE_VECTOR_SUBPARTS (TREE_TYPE ((tree)&%h))"))) elts
[1];
1540 /* Define fields and accessors for some special-purpose tree nodes. */
1542 #define IDENTIFIER_LENGTH(NODE) \
1543 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1544 #define IDENTIFIER_POINTER(NODE) \
1545 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1546 #define IDENTIFIER_HASH_VALUE(NODE) \
1547 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1549 /* Translate a hash table identifier pointer to a tree_identifier
1550 pointer, and vice versa. */
1552 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1553 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1554 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1556 struct GTY(()) tree_identifier
{
1557 struct tree_common common
;
1558 struct ht_identifier id
;
1561 /* In a TREE_LIST node. */
1562 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1563 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1565 struct GTY(()) tree_list
{
1566 struct tree_common common
;
1571 /* In a TREE_VEC node. */
1572 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1573 #define TREE_VEC_END(NODE) \
1574 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1576 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1578 struct GTY(()) tree_vec
{
1579 struct tree_common common
;
1581 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
1584 /* In a CONSTRUCTOR node. */
1585 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1586 #define CONSTRUCTOR_ELT(NODE,IDX) \
1587 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1588 #define CONSTRUCTOR_NELTS(NODE) \
1589 (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1591 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1592 value of each element (stored within VAL). IX must be a scratch variable
1593 of unsigned integer type. */
1594 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1595 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1597 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1601 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1602 the value of each element (stored within VAL) and its index (stored
1603 within INDEX). IX must be a scratch variable of unsigned integer type. */
1604 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1605 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1607 : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \
1608 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1612 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1613 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1615 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1616 _ce___->index = INDEX; \
1617 _ce___->value = VALUE; \
1620 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1621 constructor output purposes. */
1622 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1623 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1625 /* True if NODE is a clobber right hand side, an expression of indeterminate
1626 value that clobbers the LHS in a copy instruction. We use a volatile
1627 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1628 In particular the volatile flag causes us to not prematurely remove
1629 such clobber instructions. */
1630 #define TREE_CLOBBER_P(NODE) \
1631 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1633 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1634 element. INDEX can optionally design the position of VALUE: in arrays,
1635 it is the index where VALUE has to be placed; in structures, it is the
1636 FIELD_DECL of the member. */
1637 typedef struct GTY(()) constructor_elt_d
{
1642 DEF_VEC_O(constructor_elt
);
1643 DEF_VEC_ALLOC_O(constructor_elt
,gc
);
1645 struct GTY(()) tree_constructor
{
1646 struct tree_typed typed
;
1647 VEC(constructor_elt
,gc
) *elts
;
1650 /* Define fields and accessors for some nodes that represent expressions. */
1652 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1653 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1654 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1655 && integer_zerop (TREE_OPERAND (NODE, 0)))
1657 /* In ordinary expression nodes. */
1658 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1659 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1661 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1662 length. Its value includes the length operand itself; that is,
1663 the minimum valid length is 1.
1664 Note that we have to bypass the use of TREE_OPERAND to access
1665 that field to avoid infinite recursion in expanding the macros. */
1666 #define VL_EXP_OPERAND_LENGTH(NODE) \
1667 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1669 /* Nonzero if is_gimple_debug() may possibly hold. */
1670 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1672 /* In a LOOP_EXPR node. */
1673 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1675 /* The source location of this expression. Non-tree_exp nodes such as
1676 decls and constants can be shared among multiple locations, so
1678 #define EXPR_LOCATION(NODE) \
1679 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1680 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1681 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1682 /* The location to be used in a diagnostic about this expression. Do not
1683 use this macro if the location will be assigned to other expressions. */
1684 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) ? (NODE)->exp.locus : input_location)
1685 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1686 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1688 /* True if a tree is an expression or statement that can have a
1690 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1692 extern void protected_set_expr_location (tree
, location_t
);
1694 /* In a TARGET_EXPR node. */
1695 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1696 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1697 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1699 /* DECL_EXPR accessor. This gives access to the DECL associated with
1700 the given declaration statement. */
1701 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1703 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1705 /* COMPOUND_LITERAL_EXPR accessors. */
1706 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1707 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1708 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1709 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1711 /* SWITCH_EXPR accessors. These give access to the condition, body and
1712 original condition type (before any compiler conversions)
1713 of the switch statement, respectively. */
1714 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1715 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1716 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1718 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1719 of a case label, respectively. */
1720 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1721 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1722 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1723 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1725 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1726 corresponding MEM_REF operands. */
1727 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1728 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1729 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1730 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1731 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1733 /* The operands of a BIND_EXPR. */
1734 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1735 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1736 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1738 /* GOTO_EXPR accessor. This gives access to the label associated with
1739 a goto statement. */
1740 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1742 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1743 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1744 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1746 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1747 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1748 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1749 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1750 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1751 /* Nonzero if we want to create an ASM_INPUT instead of an
1752 ASM_OPERAND with no operands. */
1753 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1754 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1756 /* COND_EXPR accessors. */
1757 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1758 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1759 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1761 /* Accessors for the chains of recurrences. */
1762 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1763 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1764 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1765 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1767 /* LABEL_EXPR accessor. This gives access to the label associated with
1768 the given label expression. */
1769 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1771 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1772 accessors for SSA operands. */
1774 /* CATCH_EXPR accessors. */
1775 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1776 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1778 /* EH_FILTER_EXPR accessors. */
1779 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1780 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1782 /* OBJ_TYPE_REF accessors. */
1783 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1784 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1785 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1787 /* ASSERT_EXPR accessors. */
1788 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1789 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1791 /* CALL_EXPR accessors.
1793 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1794 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1795 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1796 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1798 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1799 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1800 the argument count is zero when checking is enabled. Instead, do
1801 the pointer arithmetic to advance past the 3 fixed operands in a
1802 CALL_EXPR. That produces a valid pointer to just past the end of the
1803 operand array, even if it's not valid to dereference it. */
1804 #define CALL_EXPR_ARGP(NODE) \
1805 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1807 /* TM directives and accessors. */
1808 #define TRANSACTION_EXPR_BODY(NODE) \
1809 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1810 #define TRANSACTION_EXPR_OUTER(NODE) \
1811 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1812 #define TRANSACTION_EXPR_RELAXED(NODE) \
1813 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1815 /* OpenMP directive and clause accessors. */
1817 #define OMP_BODY(NODE) \
1818 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1819 #define OMP_CLAUSES(NODE) \
1820 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1822 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1823 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1825 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1826 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1828 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1829 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1830 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1832 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1833 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1834 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1835 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1836 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1837 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1839 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1840 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1842 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1844 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1845 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1847 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1849 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1851 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1852 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1854 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1855 #define OMP_CLAUSE_DECL(NODE) \
1856 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1857 OMP_CLAUSE_PRIVATE, \
1858 OMP_CLAUSE_COPYPRIVATE), 0)
1859 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1860 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1861 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1863 /* True on an OMP_SECTION statement that was the last lexical member.
1864 This status is meaningful in the implementation of lastprivate. */
1865 #define OMP_SECTION_LAST(NODE) \
1866 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1868 /* True on an OMP_PARALLEL statement if it represents an explicit
1869 combined parallel work-sharing constructs. */
1870 #define OMP_PARALLEL_COMBINED(NODE) \
1871 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1873 /* True on a PRIVATE clause if its decl is kept around for debugging
1874 information only and its DECL_VALUE_EXPR is supposed to point
1875 to what it has been remapped to. */
1876 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1877 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1879 /* True on a PRIVATE clause if ctor needs access to outer region's
1881 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1882 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1884 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1885 decl is present in the chain. */
1886 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1887 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1888 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1889 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1890 OMP_CLAUSE_LASTPRIVATE),\
1892 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1893 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1895 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1896 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1897 #define OMP_CLAUSE_IF_EXPR(NODE) \
1898 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1899 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1900 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1901 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1902 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1904 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1905 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1906 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1907 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1908 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1909 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1911 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1912 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1913 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1914 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1915 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1916 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1917 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1918 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1919 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1920 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1921 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1922 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1924 enum omp_clause_schedule_kind
1926 OMP_CLAUSE_SCHEDULE_STATIC
,
1927 OMP_CLAUSE_SCHEDULE_DYNAMIC
,
1928 OMP_CLAUSE_SCHEDULE_GUIDED
,
1929 OMP_CLAUSE_SCHEDULE_AUTO
,
1930 OMP_CLAUSE_SCHEDULE_RUNTIME
1933 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1934 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1936 enum omp_clause_default_kind
1938 OMP_CLAUSE_DEFAULT_UNSPECIFIED
,
1939 OMP_CLAUSE_DEFAULT_SHARED
,
1940 OMP_CLAUSE_DEFAULT_NONE
,
1941 OMP_CLAUSE_DEFAULT_PRIVATE
,
1942 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1945 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1946 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1948 struct GTY(()) tree_exp
{
1949 struct tree_typed typed
;
1952 tree
GTY ((special ("tree_exp"),
1953 desc ("TREE_CODE ((tree) &%0)")))
1957 /* SSA_NAME accessors. */
1959 /* Returns the variable being referenced. Once released, this is the
1960 only field that can be relied upon. */
1961 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1963 /* Returns the statement which defines this SSA name. */
1964 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1966 /* Returns the SSA version number of this SSA name. Note that in
1967 tree SSA, version numbers are not per variable and may be recycled. */
1968 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1970 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1971 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1973 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1974 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1976 /* Nonzero if this SSA_NAME expression is currently on the free list of
1977 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1978 has no meaning for an SSA_NAME. */
1979 #define SSA_NAME_IN_FREE_LIST(NODE) \
1980 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1982 /* Nonzero if this SSA_NAME is the default definition for the
1983 underlying symbol. A default SSA name is created for symbol S if
1984 the very first reference to S in the function is a read operation.
1985 Default definitions are always created by an empty statement and
1986 belong to no basic block. */
1987 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1988 SSA_NAME_CHECK (NODE)->base.default_def_flag
1990 /* Attributes for SSA_NAMEs for pointer-type variables. */
1991 #define SSA_NAME_PTR_INFO(N) \
1992 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1994 /* Defined in tree-flow.h. */
1995 struct ptr_info_def
;
1997 /* Immediate use linking structure. This structure is used for maintaining
1998 a doubly linked list of uses of an SSA_NAME. */
1999 typedef struct GTY(()) ssa_use_operand_d
{
2000 struct ssa_use_operand_d
* GTY((skip(""))) prev
;
2001 struct ssa_use_operand_d
* GTY((skip(""))) next
;
2002 /* Immediate uses for a given SSA name are maintained as a cyclic
2003 list. To recognize the root of this list, the location field
2004 needs to point to the original SSA name. Since statements and
2005 SSA names are of different data types, we need this union. See
2006 the explanation in struct immediate_use_iterator_d. */
2007 union { gimple stmt
; tree ssa_name
; } GTY((skip(""))) loc
;
2008 tree
*GTY((skip(""))) use
;
2009 } ssa_use_operand_t
;
2011 /* Return the immediate_use information for an SSA_NAME. */
2012 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
2014 struct GTY(()) tree_ssa_name
{
2015 struct tree_typed typed
;
2017 /* _DECL wrapped by this SSA name. */
2020 /* Statement that defines this SSA name. */
2023 /* SSA version number. */
2024 unsigned int version
;
2026 /* Pointer attributes used for alias analysis. */
2027 struct ptr_info_def
*ptr_info
;
2029 /* Immediate uses list for this SSA_NAME. */
2030 struct ssa_use_operand_d imm_uses
;
2033 struct GTY(()) phi_arg_d
{
2034 /* imm_use MUST be the first element in struct because we do some
2035 pointer arithmetic with it. See phi_arg_index_from_use. */
2036 struct ssa_use_operand_d imm_use
;
2043 #define OMP_CLAUSE_CODE(NODE) \
2044 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2046 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2047 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2049 #define OMP_CLAUSE_CODE(NODE) \
2050 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2052 #define OMP_CLAUSE_OPERAND(NODE, I) \
2053 OMP_CLAUSE_ELT_CHECK (NODE, I)
2055 struct GTY(()) tree_omp_clause
{
2056 struct tree_common common
;
2058 enum omp_clause_code code
;
2059 union omp_clause_subcode
{
2060 enum omp_clause_default_kind default_kind
;
2061 enum omp_clause_schedule_kind schedule_kind
;
2062 enum tree_code reduction_code
;
2063 } GTY ((skip
)) subcode
;
2065 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
2067 gimple_seq gimple_reduction_init
;
2068 gimple_seq gimple_reduction_merge
;
2070 tree
GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops
[1];
2074 /* In a BLOCK node. */
2075 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2076 #define BLOCK_NONLOCALIZED_VARS(NODE) \
2077 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2078 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2079 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
2080 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \
2081 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
2082 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2083 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2084 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
2085 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2086 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
2088 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
2089 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.nameless_flag)
2091 /* An index number for this block. These values are not guaranteed to
2092 be unique across functions -- whether or not they are depends on
2093 the debugging output format in use. */
2094 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2096 /* If block reordering splits a lexical block into discontiguous
2097 address ranges, we'll make a copy of the original block.
2099 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2100 In that case, we have one source block that has been replicated
2101 (through inlining or unrolling) into many logical blocks, and that
2102 these logical blocks have different physical variables in them.
2104 In this case, we have one logical block split into several
2105 non-contiguous address ranges. Most debug formats can't actually
2106 represent this idea directly, so we fake it by creating multiple
2107 logical blocks with the same variables in them. However, for those
2108 that do support non-contiguous regions, these allow the original
2109 logical block to be reconstructed, along with the set of address
2112 One of the logical block fragments is arbitrarily chosen to be
2113 the ORIGIN. The other fragments will point to the origin via
2114 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2115 be null. The list of fragments will be chained through
2116 BLOCK_FRAGMENT_CHAIN from the origin. */
2118 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2119 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2121 /* For an inlined function, this gives the location where it was called
2122 from. This is only set in the top level block, which corresponds to the
2123 inlined function scope. This is used in the debug output routines. */
2125 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2127 struct GTY(()) tree_block
{
2128 struct tree_base base
;
2131 unsigned abstract_flag
: 1;
2132 unsigned block_num
: 31;
2137 VEC(tree
,gc
) *nonlocalized_vars
;
2141 tree abstract_origin
;
2142 tree fragment_origin
;
2143 tree fragment_chain
;
2146 /* Define fields and accessors for nodes representing data types. */
2148 /* See tree.def for documentation of the use of these fields.
2149 Look at the documentation of the various ..._TYPE tree codes.
2151 Note that the type.values, type.minval, and type.maxval fields are
2152 overloaded and used for different macros in different kinds of types.
2153 Each macro must check to ensure the tree node is of the proper kind of
2154 type. Note also that some of the front-ends also overload these fields,
2155 so they must be checked as well. */
2157 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2158 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2159 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2160 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2161 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2162 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2163 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2164 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2165 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2166 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2168 /* Vector types need to check target flags to determine type. */
2169 extern enum machine_mode
vector_type_mode (const_tree
);
2170 #define TYPE_MODE(NODE) \
2171 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2172 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2173 #define SET_TYPE_MODE(NODE, MODE) \
2174 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2176 /* The "canonical" type for this type node, which is used by frontends to
2177 compare the type for equality with another type. If two types are
2178 equal (based on the semantics of the language), then they will have
2179 equivalent TYPE_CANONICAL entries.
2181 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2182 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2183 be used for comparison against other types. Instead, the type is
2184 said to require structural equality checks, described in
2185 TYPE_STRUCTURAL_EQUALITY_P.
2187 For unqualified aggregate and function types the middle-end relies on
2188 TYPE_CANONICAL to tell whether two variables can be assigned
2189 to each other without a conversion. The middle-end also makes sure
2190 to assign the same alias-sets to the type partition with equal
2191 TYPE_CANONICAL of their unqualified variants. */
2192 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2193 /* Indicates that the type node requires structural equality
2194 checks. The compiler will need to look at the composition of the
2195 type to determine whether it is equal to another type, rather than
2196 just comparing canonical type pointers. For instance, we would need
2197 to look at the return and parameter types of a FUNCTION_TYPE
2199 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2200 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2201 type node requires structural equality. */
2202 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2204 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2205 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2207 /* The (language-specific) typed-based alias set for this type.
2208 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2209 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2210 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2211 type can alias objects of any type. */
2212 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2214 /* Nonzero iff the typed-based alias set for this type has been
2216 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2217 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2219 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2221 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2223 /* The alignment necessary for objects of this type.
2224 The value is an int, measured in bits. */
2225 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
2227 /* 1 if the alignment for this type was requested by "aligned" attribute,
2228 0 if it is the default for this type. */
2229 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.user_align)
2231 /* The alignment for NODE, in bytes. */
2232 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2234 /* If your language allows you to declare types, and you want debug info
2235 for them, then you need to generate corresponding TYPE_DECL nodes.
2236 These "stub" TYPE_DECL nodes have no name, and simply point at the
2237 type node. You then set the TYPE_STUB_DECL field of the type node
2238 to point back at the TYPE_DECL node. This allows the debug routines
2239 to know that the two nodes represent the same type, so that we only
2240 get one debug info record for them. */
2241 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2243 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2244 has BLKmode only because it lacks the alignment requirement for
2246 #define TYPE_NO_FORCE_BLK(NODE) \
2247 (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 ((int) ((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 ((int) ((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_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2677 #define DECL_IS_BUILTIN(DECL) \
2678 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2680 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2681 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2682 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2683 nodes, this points to either the FUNCTION_DECL for the containing
2684 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2685 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2686 scope". In particular, for VAR_DECLs which are virtual table pointers
2687 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2689 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2690 #define DECL_FIELD_CONTEXT(NODE) \
2691 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2693 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2694 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.nameless_flag)
2696 struct GTY(()) tree_decl_minimal
{
2697 struct tree_common common
;
2705 /* For any sort of a ..._DECL node, this points to the original (abstract)
2706 decl node which this decl is an inlined/cloned instance of, or else it
2707 is NULL indicating that this decl is not an instance of some other decl.
2709 The C front-end also uses this in a nested declaration of an inline
2710 function, to point back to the definition. */
2711 #define DECL_ABSTRACT_ORIGIN(NODE) \
2712 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2714 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2715 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2716 #define DECL_ORIGIN(NODE) \
2717 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2719 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2720 inline instance of some original (abstract) decl from an inline function;
2721 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2722 nodes can also have their abstract origin set to themselves. */
2723 #define DECL_FROM_INLINE(NODE) \
2724 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2725 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2727 /* In a DECL this is the field where attributes are stored. */
2728 #define DECL_ATTRIBUTES(NODE) \
2729 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2731 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2732 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2733 For a VAR_DECL, holds the initial value.
2734 For a PARM_DECL, used for DECL_ARG_TYPE--default
2735 values for parameters are encoded in the type of the function,
2736 not in the PARM_DECL slot.
2737 For a FIELD_DECL, this is used for enumeration values and the C
2738 frontend uses it for temporarily storing bitwidth of bitfields.
2740 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2741 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2743 /* Holds the size of the datum, in bits, as a tree expression.
2744 Need not be constant. */
2745 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2746 /* Likewise for the size in bytes. */
2747 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2748 /* Holds the alignment required for the datum, in bits. */
2749 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2750 /* The alignment of NODE, in bytes. */
2751 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2752 /* Set if the alignment of this DECL has been set by the user, for
2753 example with an 'aligned' attribute. */
2754 #define DECL_USER_ALIGN(NODE) \
2755 (DECL_COMMON_CHECK (NODE)->base.user_align)
2756 /* Holds the machine mode corresponding to the declaration of a variable or
2757 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2759 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2761 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2762 operation it is. Note, however, that this field is overloaded, with
2763 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2764 checked before any access to the former. */
2765 #define DECL_FUNCTION_CODE(NODE) \
2766 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2767 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2768 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2770 #define DECL_FUNCTION_PERSONALITY(NODE) \
2771 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2773 /* Nonzero for a given ..._DECL node means that the name of this node should
2774 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2775 the associated type should be ignored. For a FUNCTION_DECL, the body of
2776 the function should also be ignored. */
2777 #define DECL_IGNORED_P(NODE) \
2778 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2780 /* Nonzero for a given ..._DECL node means that this node represents an
2781 "abstract instance" of the given declaration (e.g. in the original
2782 declaration of an inline function). When generating symbolic debugging
2783 information, we mustn't try to generate any address information for nodes
2784 marked as "abstract instances" because we don't actually generate
2785 any code or allocate any data space for such instances. */
2786 #define DECL_ABSTRACT(NODE) \
2787 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2789 /* Language-specific decl information. */
2790 #define DECL_LANG_SPECIFIC(NODE) \
2791 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2793 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2794 do not allocate storage, and refer to a definition elsewhere. Note that
2795 this does not necessarily imply the entity represented by NODE
2796 has no program source-level definition in this translation unit. For
2797 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2798 DECL_EXTERNAL may be true simultaneously; that can be the case for
2799 a C99 "extern inline" function. */
2800 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2802 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2803 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2805 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2807 Also set in some languages for variables, etc., outside the normal
2808 lexical scope, such as class instance variables. */
2809 #define DECL_NONLOCAL(NODE) \
2810 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2812 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2813 Used in FIELD_DECLs for vtable pointers.
2814 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2815 #define DECL_VIRTUAL_P(NODE) \
2816 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2818 /* Used to indicate that this DECL represents a compiler-generated entity. */
2819 #define DECL_ARTIFICIAL(NODE) \
2820 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2822 /* Additional flags for language-specific uses. */
2823 #define DECL_LANG_FLAG_0(NODE) \
2824 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2825 #define DECL_LANG_FLAG_1(NODE) \
2826 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2827 #define DECL_LANG_FLAG_2(NODE) \
2828 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2829 #define DECL_LANG_FLAG_3(NODE) \
2830 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2831 #define DECL_LANG_FLAG_4(NODE) \
2832 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2833 #define DECL_LANG_FLAG_5(NODE) \
2834 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2835 #define DECL_LANG_FLAG_6(NODE) \
2836 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2837 #define DECL_LANG_FLAG_7(NODE) \
2838 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2839 #define DECL_LANG_FLAG_8(NODE) \
2840 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2842 /* Nonzero for a scope which is equal to file scope. */
2843 #define SCOPE_FILE_SCOPE_P(EXP) \
2844 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2845 /* Nonzero for a decl which is at file scope. */
2846 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2847 /* Nonzero for a type which is at file scope. */
2848 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2850 /* Nonzero for a decl that is decorated using attribute used.
2851 This indicates to compiler tools that this decl needs to be preserved. */
2852 #define DECL_PRESERVE_P(DECL) \
2853 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2855 /* For function local variables of COMPLEX and VECTOR types,
2856 indicates that the variable is not aliased, and that all
2857 modifications to the variable have been adjusted so that
2858 they are killing assignments. Thus the variable may now
2859 be treated as a GIMPLE register, and use real instead of
2860 virtual ops in SSA form. */
2861 #define DECL_GIMPLE_REG_P(DECL) \
2862 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2864 struct GTY(()) tree_decl_common
{
2865 struct tree_decl_minimal common
;
2868 ENUM_BITFIELD(machine_mode
) mode
: 8;
2870 unsigned nonlocal_flag
: 1;
2871 unsigned virtual_flag
: 1;
2872 unsigned ignored_flag
: 1;
2873 unsigned abstract_flag
: 1;
2874 unsigned artificial_flag
: 1;
2875 unsigned preserve_flag
: 1;
2876 unsigned debug_expr_is_from
: 1;
2878 unsigned lang_flag_0
: 1;
2879 unsigned lang_flag_1
: 1;
2880 unsigned lang_flag_2
: 1;
2881 unsigned lang_flag_3
: 1;
2882 unsigned lang_flag_4
: 1;
2883 unsigned lang_flag_5
: 1;
2884 unsigned lang_flag_6
: 1;
2885 unsigned lang_flag_7
: 1;
2886 unsigned lang_flag_8
: 1;
2888 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2889 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2890 unsigned decl_flag_0
: 1;
2891 /* In FIELD_DECL, this is DECL_BIT_FIELD
2892 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2893 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2894 unsigned decl_flag_1
: 1;
2895 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2896 In VAR_DECL, PARM_DECL and RESULT_DECL, this is
2897 DECL_HAS_VALUE_EXPR_P. */
2898 unsigned decl_flag_2
: 1;
2899 /* Logically, these two would go in a theoretical base shared by var and
2901 unsigned gimple_reg_flag
: 1;
2902 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2903 unsigned decl_by_reference_flag
: 1;
2904 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2905 unsigned decl_restricted_flag
: 1;
2907 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2909 unsigned decl_read_flag
: 1;
2911 /* In VAR_DECL or RESULT_DECL set when significant code movement precludes
2912 attempting to share the stack slot with some other variable. */
2913 unsigned decl_nonshareable_flag
: 1;
2915 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2916 unsigned int off_align
: 8;
2918 /* 24-bits unused. */
2920 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2923 /* UID for points-to sets, stable over copying from inlining. */
2924 unsigned int pt_uid
;
2929 tree abstract_origin
;
2931 /* Points to a structure whose details depend on the language in use. */
2932 struct lang_decl
*lang_specific
;
2935 extern tree
decl_value_expr_lookup (tree
);
2936 extern void decl_value_expr_insert (tree
, tree
);
2938 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2939 if transformations have made this more complicated than evaluating the
2940 decl itself. This should only be used for debugging; once this field has
2941 been set, the decl itself may not legitimately appear in the function. */
2942 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2943 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2944 ->decl_common.decl_flag_2)
2945 #define DECL_VALUE_EXPR(NODE) \
2946 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2947 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2948 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2950 /* Holds the RTL expression for the value of a variable or function.
2951 This value can be evaluated lazily for functions, variables with
2952 static storage duration, and labels. */
2953 #define DECL_RTL(NODE) \
2954 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2955 ? (NODE)->decl_with_rtl.rtl \
2956 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2958 /* Set the DECL_RTL for NODE to RTL. */
2959 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2961 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2962 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2964 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2965 #define DECL_RTL_SET_P(NODE) \
2966 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2968 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2969 NODE1, it will not be set for NODE2; this is a lazy copy. */
2970 #define COPY_DECL_RTL(NODE1, NODE2) \
2971 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2972 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2974 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2975 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2977 #if (GCC_VERSION >= 2007)
2978 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2979 ({ tree const __d = (decl); \
2980 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2981 /* Dereference it so the compiler knows it can't be NULL even \
2982 without assertion checking. */ \
2983 &*DECL_RTL_IF_SET (__d); })
2985 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2988 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2989 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2991 struct GTY(()) tree_decl_with_rtl
{
2992 struct tree_decl_common common
;
2996 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2997 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2998 of the structure. */
2999 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
3001 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
3002 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
3003 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
3004 natural alignment of the field's type). */
3005 #define DECL_FIELD_BIT_OFFSET(NODE) \
3006 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
3008 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
3009 if so, the type that was originally specified for it.
3010 TREE_TYPE may have been modified (in finish_struct). */
3011 #define DECL_BIT_FIELD_TYPE(NODE) \
3012 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
3014 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
3015 representative FIELD_DECL. */
3016 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
3017 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3019 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
3020 if nonzero, indicates that the field occupies the type. */
3021 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3023 /* For FIELD_DECLs, off_align holds the number of low-order bits of
3024 DECL_FIELD_OFFSET which are known to be always zero.
3025 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
3027 #define DECL_OFFSET_ALIGN(NODE) \
3028 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
3030 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
3031 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
3032 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
3034 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
3035 which this FIELD_DECL is defined. This information is needed when
3036 writing debugging information about vfield and vbase decls for C++. */
3037 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
3039 /* In a FIELD_DECL, indicates this field should be bit-packed. */
3040 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.packed_flag)
3042 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
3044 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3046 /* Used in a FIELD_DECL to indicate that we cannot form the address of
3047 this component. This makes it possible for Type-Based Alias Analysis
3048 to disambiguate accesses to this field with indirect accesses using
3051 struct S { int i; } s;
3054 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
3056 From the implementation's viewpoint, the alias set of the type of the
3057 field 'i' (int) will not be recorded as a subset of that of the type of
3058 's' (struct S) in record_component_aliases. The counterpart is that
3059 accesses to s.i must not be given the alias set of the type of 'i'
3060 (int) but instead directly that of the type of 's' (struct S). */
3061 #define DECL_NONADDRESSABLE_P(NODE) \
3062 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3064 struct GTY(()) tree_field_decl
{
3065 struct tree_decl_common common
;
3068 tree bit_field_type
;
3074 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3075 dense, unique within any one function, and may be used to index arrays.
3076 If the value is -1, then no UID has been assigned. */
3077 #define LABEL_DECL_UID(NODE) \
3078 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
3080 /* In a LABEL_DECL, the EH region number for which the label is the
3081 post_landing_pad. */
3082 #define EH_LANDING_PAD_NR(NODE) \
3083 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
3085 /* In LABEL_DECL nodes, nonzero means that an error message about
3086 jumping into such a binding contour has been printed for this label. */
3087 #define DECL_ERROR_ISSUED(NODE) \
3088 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
3090 struct GTY(()) tree_label_decl
{
3091 struct tree_decl_with_rtl common
;
3093 int eh_landing_pad_nr
;
3097 struct GTY(()) tree_result_decl
{
3098 struct tree_decl_with_rtl common
;
3099 struct var_ann_d
*ann
;
3102 struct GTY(()) tree_const_decl
{
3103 struct tree_decl_common common
;
3106 /* For a PARM_DECL, records the data type used to pass the argument,
3107 which may be different from the type seen in the program. */
3108 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3110 /* For PARM_DECL, holds an RTL for the stack slot or register
3111 where the data was actually passed. */
3112 #define DECL_INCOMING_RTL(NODE) \
3113 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3115 struct GTY(()) tree_parm_decl
{
3116 struct tree_decl_with_rtl common
;
3118 struct var_ann_d
*ann
;
3122 /* Nonzero for a given ..._DECL node means that no warnings should be
3123 generated just because this node is unused. */
3124 #define DECL_IN_SYSTEM_HEADER(NODE) \
3125 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
3127 /* Used to indicate that the linkage status of this DECL is not yet known,
3128 so it should not be output now. */
3129 #define DECL_DEFER_OUTPUT(NODE) \
3130 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3132 /* In a VAR_DECL that's static,
3133 nonzero if the space is in the text section. */
3134 #define DECL_IN_TEXT_SECTION(NODE) \
3135 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3137 /* In a VAR_DECL that's static,
3138 nonzero if it belongs to the global constant pool. */
3139 #define DECL_IN_CONSTANT_POOL(NODE) \
3140 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3142 /* Nonzero for a given ..._DECL node means that this node should be
3143 put in .common, if possible. If a DECL_INITIAL is given, and it
3144 is not error_mark_node, then the decl cannot be put in .common. */
3145 #define DECL_COMMON(NODE) \
3146 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3148 /* In a VAR_DECL, nonzero if the decl is a register variable with
3149 an explicit asm specification. */
3150 #define DECL_HARD_REGISTER(NODE) \
3151 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3153 /* Used to indicate that this DECL has weak linkage. */
3154 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3156 /* Used to indicate that the DECL is a dllimport. */
3157 #define DECL_DLLIMPORT_P(NODE) \
3158 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3160 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3161 not be put out unless it is needed in this translation unit.
3162 Entities like this are shared across translation units (like weak
3163 entities), but are guaranteed to be generated by any translation
3164 unit that needs them, and therefore need not be put out anywhere
3165 where they are not needed. DECL_COMDAT is just a hint to the
3166 back-end; it is up to front-ends which set this flag to ensure
3167 that there will never be any harm, other than bloat, in putting out
3168 something which is DECL_COMDAT. */
3169 #define DECL_COMDAT(NODE) \
3170 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3172 #define DECL_COMDAT_GROUP(NODE) \
3173 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
3175 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3176 multiple translation units should be merged. */
3177 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
3179 /* The name of the object as the assembler will see it (but before any
3180 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3181 as DECL_NAME. It is an IDENTIFIER_NODE. */
3182 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3184 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3185 This is true of all DECL nodes except FIELD_DECL. */
3186 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3187 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3189 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3190 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3192 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3193 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
3194 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3196 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3197 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3198 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3200 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3201 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3202 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3203 semantics of using this macro, are different than saying:
3205 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3207 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3209 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3210 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3211 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3212 DECL_ASSEMBLER_NAME (DECL1)) \
3215 /* Records the section name in a section attribute. Used to pass
3216 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3217 #define DECL_SECTION_NAME(NODE) \
3218 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3220 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3221 this variable in a BIND_EXPR. */
3222 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3223 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3225 /* Value of the decls's visibility attribute */
3226 #define DECL_VISIBILITY(NODE) \
3227 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3229 /* Nonzero means that the decl had its visibility specified rather than
3231 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3232 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3234 /* In a VAR_DECL, the model to use if the data should be allocated from
3235 thread-local storage. */
3236 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3238 /* In a VAR_DECL, nonzero if the data should be allocated from
3239 thread-local storage. */
3240 #define DECL_THREAD_LOCAL_P(NODE) \
3241 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3243 /* In a non-local VAR_DECL with static storage duration, true if the
3244 variable has an initialization priority. If false, the variable
3245 will be initialized at the DEFAULT_INIT_PRIORITY. */
3246 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3247 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3249 /* Specify whether the section name was set by user or by
3250 compiler via -ffunction-sections. */
3251 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
3252 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
3254 struct GTY(()) tree_decl_with_vis
{
3255 struct tree_decl_with_rtl common
;
3256 tree assembler_name
;
3260 /* Belong to VAR_DECL exclusively. */
3261 unsigned defer_output
: 1;
3262 unsigned hard_register
: 1;
3263 unsigned thread_local
: 1;
3264 unsigned common_flag
: 1;
3265 unsigned in_text_section
: 1;
3266 unsigned in_constant_pool
: 1;
3267 unsigned dllimport_flag
: 1;
3268 /* Don't belong to VAR_DECL exclusively. */
3269 unsigned weak_flag
: 1;
3271 unsigned seen_in_bind_expr
: 1;
3272 unsigned comdat_flag
: 1;
3273 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
3274 unsigned visibility_specified
: 1;
3275 /* Belongs to VAR_DECL exclusively. */
3276 ENUM_BITFIELD(tls_model
) tls_model
: 3;
3278 /* Belong to FUNCTION_DECL exclusively. */
3279 unsigned init_priority_p
: 1;
3280 /* Used by C++ only. Might become a generic decl flag. */
3281 unsigned shadowed_for_var_p
: 1;
3282 /* When SECTION_NAME is implied by -ffunsection-section. */
3283 unsigned implicit_section_name_p
: 1;
3284 /* 13 unused bits. */
3287 extern tree
decl_debug_expr_lookup (tree
);
3288 extern void decl_debug_expr_insert (tree
, tree
);
3289 /* For VAR_DECL, this is set to either an expression that it was split
3290 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3291 subexpressions that it was split into. */
3292 #define DECL_DEBUG_EXPR(NODE) \
3293 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3295 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3296 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3298 /* An initialization priority. */
3299 typedef unsigned short priority_type
;
3301 extern priority_type
decl_init_priority_lookup (tree
);
3302 extern priority_type
decl_fini_priority_lookup (tree
);
3303 extern void decl_init_priority_insert (tree
, priority_type
);
3304 extern void decl_fini_priority_insert (tree
, priority_type
);
3306 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3308 #define DECL_INIT_PRIORITY(NODE) \
3309 (decl_init_priority_lookup (NODE))
3310 /* Set the initialization priority for NODE to VAL. */
3311 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3312 (decl_init_priority_insert (NODE, VAL))
3314 /* For a FUNCTION_DECL the finalization priority of NODE. */
3315 #define DECL_FINI_PRIORITY(NODE) \
3316 (decl_fini_priority_lookup (NODE))
3317 /* Set the finalization priority for NODE to VAL. */
3318 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3319 (decl_fini_priority_insert (NODE, VAL))
3321 /* The initialization priority for entities for which no explicit
3322 initialization priority has been specified. */
3323 #define DEFAULT_INIT_PRIORITY 65535
3325 /* The maximum allowed initialization priority. */
3326 #define MAX_INIT_PRIORITY 65535
3328 /* The largest priority value reserved for use by system runtime
3330 #define MAX_RESERVED_INIT_PRIORITY 100
3332 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
3333 (VAR_DECL_CHECK (NODE)->base.saturating_flag)
3335 #define DECL_VAR_ANN_PTR(NODE) \
3336 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \
3337 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \
3338 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \
3341 struct GTY(()) tree_var_decl
{
3342 struct tree_decl_with_vis common
;
3343 struct var_ann_d
*ann
;
3347 /* This field is used to reference anything in decl.result and is meant only
3348 for use by the garbage collector. */
3349 #define DECL_RESULT_FLD(NODE) \
3350 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3352 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3353 Before the struct containing the FUNCTION_DECL is laid out,
3354 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3355 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3356 function. When the class is laid out, this pointer is changed
3357 to an INTEGER_CST node which is suitable for use as an index
3358 into the virtual function table.
3359 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3360 #define DECL_VINDEX(NODE) \
3361 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3364 tree_decl_non_common
{
3365 struct tree_decl_with_vis common
;
3366 /* C++ uses this in namespaces. */
3368 /* C++ uses this in templates. */
3370 /* Almost all FE's use this. */
3372 /* C++ uses this in namespaces and function_decls. */
3376 /* In FUNCTION_DECL, holds the decl for the return value. */
3377 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3379 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3380 #define DECL_UNINLINABLE(NODE) \
3381 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3383 /* In a FUNCTION_DECL, the saved representation of the body of the
3385 #define DECL_SAVED_TREE(NODE) \
3386 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3388 /* Nonzero in a FUNCTION_DECL means this function should be treated
3389 as if it were a malloc, meaning it returns a pointer that is
3391 #define DECL_IS_MALLOC(NODE) \
3392 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3394 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3395 C++ operator new, meaning that it returns a pointer for which we
3396 should not use type based aliasing. */
3397 #define DECL_IS_OPERATOR_NEW(NODE) \
3398 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3400 /* Nonzero in a FUNCTION_DECL means this function may return more
3402 #define DECL_IS_RETURNS_TWICE(NODE) \
3403 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3405 /* Nonzero in a FUNCTION_DECL means this function should be treated
3406 as "pure" function (like const function, but may read global memory). */
3407 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3409 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3410 the const or pure function may not terminate. When this is nonzero
3411 for a const or pure function, it can be dealt with by cse passes
3412 but cannot be removed by dce passes since you are not allowed to
3413 change an infinite looping program into one that terminates without
3415 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3416 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3418 /* Nonzero in a FUNCTION_DECL means this function should be treated
3419 as "novops" function (function that does not read global memory,
3420 but may have arbitrary side effects). */
3421 #define DECL_IS_NOVOPS(NODE) \
3422 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3424 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3425 at the beginning or end of execution. */
3426 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3427 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3429 #define DECL_STATIC_DESTRUCTOR(NODE) \
3430 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3432 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3433 be instrumented with calls to support routines. */
3434 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3435 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3437 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3438 disabled in this function. */
3439 #define DECL_NO_LIMIT_STACK(NODE) \
3440 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3442 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3443 #define DECL_STATIC_CHAIN(NODE) \
3444 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3446 /* Nonzero for a decl that cgraph has decided should be inlined into
3447 at least one call site. It is not meaningful to look at this
3448 directly; always use cgraph_function_possibly_inlined_p. */
3449 #define DECL_POSSIBLY_INLINED(DECL) \
3450 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3452 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3453 such as via the `inline' keyword in C/C++. This flag controls the linkage
3454 semantics of 'inline' */
3455 #define DECL_DECLARED_INLINE_P(NODE) \
3456 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3458 /* Nonzero in a FUNCTION_DECL means this function should not get
3459 -Winline warnings. */
3460 #define DECL_NO_INLINE_WARNING_P(NODE) \
3461 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3463 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3464 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3465 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3467 /* Nonzero if a FUNCTION_CODE is a TM load. */
3468 #define BUILTIN_TM_LOAD_P(FN) \
3469 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3471 /* Nonzero if a FUNCTION_CODE is a TM store. */
3472 #define BUILTIN_TM_STORE_P(FN) \
3473 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3475 #define CASE_BUILT_IN_TM_LOAD(FN) \
3476 case BUILT_IN_TM_LOAD_##FN: \
3477 case BUILT_IN_TM_LOAD_RAR_##FN: \
3478 case BUILT_IN_TM_LOAD_RAW_##FN: \
3479 case BUILT_IN_TM_LOAD_RFW_##FN
3481 #define CASE_BUILT_IN_TM_STORE(FN) \
3482 case BUILT_IN_TM_STORE_##FN: \
3483 case BUILT_IN_TM_STORE_WAR_##FN: \
3484 case BUILT_IN_TM_STORE_WAW_##FN
3486 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3487 disregarding size and cost heuristics. This is equivalent to using
3488 the always_inline attribute without the required diagnostics if the
3489 function cannot be inlined. */
3490 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3491 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3493 extern VEC(tree
, gc
) **decl_debug_args_lookup (tree
);
3494 extern VEC(tree
, gc
) **decl_debug_args_insert (tree
);
3496 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3497 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3498 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3500 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3501 that describes the status of this function. */
3502 #define DECL_STRUCT_FUNCTION(NODE) \
3503 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3505 /* In a FUNCTION_DECL, nonzero means a built in function. */
3506 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3508 /* For a builtin function, identify which part of the compiler defined it. */
3509 #define DECL_BUILT_IN_CLASS(NODE) \
3510 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3512 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3513 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3515 #define DECL_ARGUMENTS(NODE) \
3516 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3517 #define DECL_ARGUMENT_FLD(NODE) \
3518 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3520 /* In FUNCTION_DECL, the function specific target options to use when compiling
3522 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3523 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3525 /* In FUNCTION_DECL, the function specific optimization options to use when
3526 compiling this function. */
3527 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3528 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3530 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3531 arguments/result/saved_tree fields by front ends. It was either inherit
3532 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3533 which seemed a bit strange. */
3535 struct GTY(()) tree_function_decl
{
3536 struct tree_decl_non_common common
;
3540 /* The personality function. Used for stack unwinding. */
3543 /* Function specific options that are used by this function. */
3544 tree function_specific_target
; /* target options */
3545 tree function_specific_optimization
; /* optimization options */
3547 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3548 DECL_FUNCTION_CODE. Otherwise unused.
3549 ??? The bitfield needs to be able to hold all target function
3551 ENUM_BITFIELD(built_in_function
) function_code
: 11;
3552 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
3554 unsigned static_ctor_flag
: 1;
3555 unsigned static_dtor_flag
: 1;
3556 unsigned uninlinable
: 1;
3558 unsigned possibly_inlined
: 1;
3559 unsigned novops_flag
: 1;
3560 unsigned returns_twice_flag
: 1;
3561 unsigned malloc_flag
: 1;
3562 unsigned operator_new_flag
: 1;
3563 unsigned declared_inline_flag
: 1;
3564 unsigned regdecl_flag
: 1;
3565 unsigned no_inline_warning_flag
: 1;
3567 unsigned no_instrument_function_entry_exit
: 1;
3568 unsigned no_limit_stack
: 1;
3569 unsigned disregard_inline_limits
: 1;
3570 unsigned pure_flag
: 1;
3571 unsigned looping_const_or_pure_flag
: 1;
3572 unsigned has_debug_args_flag
: 1;
3573 unsigned tm_clone_flag
: 1;
3578 /* The source language of the translation-unit. */
3579 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3580 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3582 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3584 struct GTY(()) tree_translation_unit_decl
{
3585 struct tree_decl_common common
;
3586 /* Source language of this translation unit. Used for DWARF output. */
3587 const char * GTY((skip(""))) language
;
3588 /* TODO: Non-optimization used to build this translation unit. */
3589 /* TODO: Root of a partial DWARF tree for global types and decls. */
3592 /* A vector of all translation-units. */
3593 extern GTY (()) VEC(tree
,gc
) *all_translation_units
;
3595 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3596 #define DECL_ORIGINAL_TYPE(NODE) \
3597 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3599 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3600 into stabs. Instead it will generate cross reference ('x') of names.
3601 This uses the same flag as DECL_EXTERNAL. */
3602 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3603 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3605 /* Getter of the imported declaration associated to the
3606 IMPORTED_DECL node. */
3607 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3608 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3610 struct GTY(()) tree_type_decl
{
3611 struct tree_decl_non_common common
;
3615 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3616 To reduce overhead, the nodes containing the statements are not trees.
3617 This avoids the overhead of tree_common on all linked list elements.
3619 Use the interface in tree-iterator.h to access this node. */
3621 #define STATEMENT_LIST_HEAD(NODE) \
3622 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3623 #define STATEMENT_LIST_TAIL(NODE) \
3624 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3626 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3628 struct tree_statement_list_node
*prev
;
3629 struct tree_statement_list_node
*next
;
3633 struct GTY(()) tree_statement_list
3635 struct tree_typed typed
;
3636 struct tree_statement_list_node
*head
;
3637 struct tree_statement_list_node
*tail
;
3641 /* Optimization options used by a function. */
3643 struct GTY(()) tree_optimization_option
{
3644 struct tree_common common
;
3646 /* The optimization options used by the user. */
3647 struct cl_optimization opts
;
3650 #define TREE_OPTIMIZATION(NODE) \
3651 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3653 /* Return a tree node that encapsulates the current optimization options. */
3654 extern tree
build_optimization_node (void);
3656 /* Target options used by a function. */
3658 struct GTY(()) tree_target_option
{
3659 struct tree_common common
;
3661 /* The optimization options used by the user. */
3662 struct cl_target_option opts
;
3665 #define TREE_TARGET_OPTION(NODE) \
3666 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3668 /* Return a tree node that encapsulates the current target options. */
3669 extern tree
build_target_option_node (void);
3672 /* Define the overall contents of a tree node.
3673 It may be any of the structures declared above
3674 for various types of node. */
3676 union GTY ((ptr_alias (union lang_tree_node
),
3677 desc ("tree_node_structure (&%h)"), variable_size
)) tree_node
{
3678 struct tree_base
GTY ((tag ("TS_BASE"))) base
;
3679 struct tree_typed
GTY ((tag ("TS_TYPED"))) typed
;
3680 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
3681 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
3682 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
3683 struct tree_fixed_cst
GTY ((tag ("TS_FIXED_CST"))) fixed_cst
;
3684 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
3685 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
3686 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
3687 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
3688 struct tree_decl_minimal
GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal
;
3689 struct tree_decl_common
GTY ((tag ("TS_DECL_COMMON"))) decl_common
;
3690 struct tree_decl_with_rtl
GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl
;
3691 struct tree_decl_non_common
GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common
;
3692 struct tree_parm_decl
GTY ((tag ("TS_PARM_DECL"))) parm_decl
;
3693 struct tree_decl_with_vis
GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis
;
3694 struct tree_var_decl
GTY ((tag ("TS_VAR_DECL"))) var_decl
;
3695 struct tree_field_decl
GTY ((tag ("TS_FIELD_DECL"))) field_decl
;
3696 struct tree_label_decl
GTY ((tag ("TS_LABEL_DECL"))) label_decl
;
3697 struct tree_result_decl
GTY ((tag ("TS_RESULT_DECL"))) result_decl
;
3698 struct tree_const_decl
GTY ((tag ("TS_CONST_DECL"))) const_decl
;
3699 struct tree_type_decl
GTY ((tag ("TS_TYPE_DECL"))) type_decl
;
3700 struct tree_function_decl
GTY ((tag ("TS_FUNCTION_DECL"))) function_decl
;
3701 struct tree_translation_unit_decl
GTY ((tag ("TS_TRANSLATION_UNIT_DECL")))
3702 translation_unit_decl
;
3703 struct tree_type_common
GTY ((tag ("TS_TYPE_COMMON"))) type_common
;
3704 struct tree_type_with_lang_specific
GTY ((tag ("TS_TYPE_WITH_LANG_SPECIFIC")))
3705 type_with_lang_specific
;
3706 struct tree_type_non_common
GTY ((tag ("TS_TYPE_NON_COMMON")))
3708 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
3709 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
3710 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
3711 struct tree_ssa_name
GTY ((tag ("TS_SSA_NAME"))) ssa_name
;
3712 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
3713 struct tree_binfo
GTY ((tag ("TS_BINFO"))) binfo
;
3714 struct tree_statement_list
GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list
;
3715 struct tree_constructor
GTY ((tag ("TS_CONSTRUCTOR"))) constructor
;
3716 struct tree_omp_clause
GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause
;
3717 struct tree_optimization_option
GTY ((tag ("TS_OPTIMIZATION"))) optimization
;
3718 struct tree_target_option
GTY ((tag ("TS_TARGET_OPTION"))) target_option
;
3721 /* Standard named or nameless data types of the C compiler. */
3745 TI_INTEGER_MINUS_ONE
,
3762 TI_COMPLEX_INTEGER_TYPE
,
3763 TI_COMPLEX_FLOAT_TYPE
,
3764 TI_COMPLEX_DOUBLE_TYPE
,
3765 TI_COMPLEX_LONG_DOUBLE_TYPE
,
3769 TI_LONG_DOUBLE_TYPE
,
3773 TI_LONG_DOUBLE_PTR_TYPE
,
3774 TI_INTEGER_PTR_TYPE
,
3783 TI_VA_LIST_GPR_COUNTER_FIELD
,
3784 TI_VA_LIST_FPR_COUNTER_FIELD
,
3791 TI_DFLOAT32_PTR_TYPE
,
3792 TI_DFLOAT64_PTR_TYPE
,
3793 TI_DFLOAT128_PTR_TYPE
,
3802 TI_SAT_LLFRACT_TYPE
,
3803 TI_SAT_USFRACT_TYPE
,
3805 TI_SAT_ULFRACT_TYPE
,
3806 TI_SAT_ULLFRACT_TYPE
,
3818 TI_SAT_LLACCUM_TYPE
,
3819 TI_SAT_USACCUM_TYPE
,
3821 TI_SAT_ULACCUM_TYPE
,
3822 TI_SAT_ULLACCUM_TYPE
,
3868 TI_OPTIMIZATION_DEFAULT
,
3869 TI_OPTIMIZATION_CURRENT
,
3870 TI_TARGET_OPTION_DEFAULT
,
3871 TI_TARGET_OPTION_CURRENT
,
3872 TI_CURRENT_TARGET_PRAGMA
,
3873 TI_CURRENT_OPTIMIZE_PRAGMA
,
3878 extern GTY(()) tree global_trees
[TI_MAX
];
3880 #define error_mark_node global_trees[TI_ERROR_MARK]
3882 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3883 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3884 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3885 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3886 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3888 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3889 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3890 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3891 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3892 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3894 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3895 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3896 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3898 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3899 #define integer_one_node global_trees[TI_INTEGER_ONE]
3900 #define integer_three_node global_trees[TI_INTEGER_THREE]
3901 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3902 #define size_zero_node global_trees[TI_SIZE_ZERO]
3903 #define size_one_node global_trees[TI_SIZE_ONE]
3904 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3905 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3906 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3908 /* Base access nodes. */
3909 #define access_public_node global_trees[TI_PUBLIC]
3910 #define access_protected_node global_trees[TI_PROTECTED]
3911 #define access_private_node global_trees[TI_PRIVATE]
3913 #define null_pointer_node global_trees[TI_NULL_POINTER]
3915 #define float_type_node global_trees[TI_FLOAT_TYPE]
3916 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3917 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3919 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3920 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3921 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3922 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3924 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3925 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3926 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3927 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3929 #define void_type_node global_trees[TI_VOID_TYPE]
3930 /* The C type `void *'. */
3931 #define ptr_type_node global_trees[TI_PTR_TYPE]
3932 /* The C type `const void *'. */
3933 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3934 /* The C type `size_t'. */
3935 #define size_type_node global_trees[TI_SIZE_TYPE]
3936 #define pid_type_node global_trees[TI_PID_TYPE]
3937 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3938 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3939 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3940 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3941 /* The C type `FILE *'. */
3942 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3944 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3945 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3946 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3948 /* The decimal floating point types. */
3949 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3950 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3951 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3952 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3953 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3954 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3956 /* The fixed-point types. */
3957 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3958 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3959 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3960 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3961 #define sat_unsigned_short_fract_type_node \
3962 global_trees[TI_SAT_USFRACT_TYPE]
3963 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3964 #define sat_unsigned_long_fract_type_node \
3965 global_trees[TI_SAT_ULFRACT_TYPE]
3966 #define sat_unsigned_long_long_fract_type_node \
3967 global_trees[TI_SAT_ULLFRACT_TYPE]
3968 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3969 #define fract_type_node global_trees[TI_FRACT_TYPE]
3970 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3971 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3972 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3973 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3974 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3975 #define unsigned_long_long_fract_type_node \
3976 global_trees[TI_ULLFRACT_TYPE]
3977 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3978 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3979 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3980 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3981 #define sat_unsigned_short_accum_type_node \
3982 global_trees[TI_SAT_USACCUM_TYPE]
3983 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3984 #define sat_unsigned_long_accum_type_node \
3985 global_trees[TI_SAT_ULACCUM_TYPE]
3986 #define sat_unsigned_long_long_accum_type_node \
3987 global_trees[TI_SAT_ULLACCUM_TYPE]
3988 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3989 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3990 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3991 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3992 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3993 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3994 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3995 #define unsigned_long_long_accum_type_node \
3996 global_trees[TI_ULLACCUM_TYPE]
3997 #define qq_type_node global_trees[TI_QQ_TYPE]
3998 #define hq_type_node global_trees[TI_HQ_TYPE]
3999 #define sq_type_node global_trees[TI_SQ_TYPE]
4000 #define dq_type_node global_trees[TI_DQ_TYPE]
4001 #define tq_type_node global_trees[TI_TQ_TYPE]
4002 #define uqq_type_node global_trees[TI_UQQ_TYPE]
4003 #define uhq_type_node global_trees[TI_UHQ_TYPE]
4004 #define usq_type_node global_trees[TI_USQ_TYPE]
4005 #define udq_type_node global_trees[TI_UDQ_TYPE]
4006 #define utq_type_node global_trees[TI_UTQ_TYPE]
4007 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4008 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4009 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4010 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4011 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4012 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4013 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4014 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4015 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4016 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4017 #define ha_type_node global_trees[TI_HA_TYPE]
4018 #define sa_type_node global_trees[TI_SA_TYPE]
4019 #define da_type_node global_trees[TI_DA_TYPE]
4020 #define ta_type_node global_trees[TI_TA_TYPE]
4021 #define uha_type_node global_trees[TI_UHA_TYPE]
4022 #define usa_type_node global_trees[TI_USA_TYPE]
4023 #define uda_type_node global_trees[TI_UDA_TYPE]
4024 #define uta_type_node global_trees[TI_UTA_TYPE]
4025 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4026 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4027 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4028 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4029 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4030 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4031 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4032 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4034 /* The node that should be placed at the end of a parameter list to
4035 indicate that the function does not take a variable number of
4036 arguments. The TREE_VALUE will be void_type_node and there will be
4037 no TREE_CHAIN. Language-independent code should not assume
4038 anything else about this node. */
4039 #define void_list_node global_trees[TI_VOID_LIST_NODE]
4041 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4042 #define MAIN_NAME_P(NODE) \
4043 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4045 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4047 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4048 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4050 /* Default/current target options (TARGET_OPTION_NODE). */
4051 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4052 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4054 /* Default tree list option(), optimize() pragmas to be linked into the
4056 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4057 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4059 /* An enumeration of the standard C integer types. These must be
4060 ordered so that shorter types appear before longer ones, and so
4061 that signed types appear before unsigned ones, for the correct
4062 functioning of interpret_integer() in c-lex.c. */
4063 enum integer_type_kind
4075 itk_unsigned_long_long
,
4077 itk_unsigned_int128
,
4081 typedef enum integer_type_kind integer_type_kind
;
4083 /* The standard C integer types. Use integer_type_kind to index into
4085 extern GTY(()) tree integer_types
[itk_none
];
4087 #define char_type_node integer_types[itk_char]
4088 #define signed_char_type_node integer_types[itk_signed_char]
4089 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4090 #define short_integer_type_node integer_types[itk_short]
4091 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4092 #define integer_type_node integer_types[itk_int]
4093 #define unsigned_type_node integer_types[itk_unsigned_int]
4094 #define long_integer_type_node integer_types[itk_long]
4095 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4096 #define long_long_integer_type_node integer_types[itk_long_long]
4097 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4098 #define int128_integer_type_node integer_types[itk_int128]
4099 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
4101 /* A pointer-to-function member type looks like:
4108 If __pfn is NULL, it is a NULL pointer-to-member-function.
4110 (Because the vtable is always the first thing in the object, we
4111 don't need its offset.) If the function is virtual, then PFN is
4112 one plus twice the index into the vtable; otherwise, it is just a
4113 pointer to the function.
4115 Unfortunately, using the lowest bit of PFN doesn't work in
4116 architectures that don't impose alignment requirements on function
4117 addresses, or that use the lowest bit to tell one ISA from another,
4118 for example. For such architectures, we use the lowest bit of
4119 DELTA instead of the lowest bit of the PFN, and DELTA will be
4122 enum ptrmemfunc_vbit_where_t
4124 ptrmemfunc_vbit_in_pfn
,
4125 ptrmemfunc_vbit_in_delta
4128 #define NULL_TREE (tree) NULL
4130 /* True if NODE is an erroneous expression. */
4132 #define error_operand_p(NODE) \
4133 ((NODE) == error_mark_node \
4134 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
4136 extern tree
decl_assembler_name (tree
);
4137 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
4138 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
4140 /* Compute the number of bytes occupied by 'node'. This routine only
4141 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4143 extern size_t tree_size (const_tree
);
4145 /* Compute the number of bytes occupied by a tree with code CODE. This
4146 function cannot be used for TREE_VEC codes, which are of variable
4148 extern size_t tree_code_size (enum tree_code
);
4150 /* Allocate and return a new UID from the DECL_UID namespace. */
4151 extern int allocate_decl_uid (void);
4153 /* Lowest level primitive for allocating a node.
4154 The TREE_CODE is the only argument. Contents are initialized
4155 to zero except for a few of the common fields. */
4157 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
4158 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
4160 /* Make a copy of a node, with all the same contents. */
4162 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
4163 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
4165 /* Make a copy of a chain of TREE_LIST nodes. */
4167 extern tree
copy_list (tree
);
4169 /* Make a CASE_LABEL_EXPR. */
4171 extern tree
build_case_label (tree
, tree
, tree
);
4174 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
4175 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
4177 /* Make a TREE_VEC. */
4179 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
4180 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
4182 /* Return the (unique) IDENTIFIER_NODE node for a given name.
4183 The name is supplied as a char *. */
4185 extern tree
get_identifier (const char *);
4187 #if GCC_VERSION >= 3000
4188 #define get_identifier(str) \
4189 (__builtin_constant_p (str) \
4190 ? get_identifier_with_length ((str), strlen (str)) \
4191 : get_identifier (str))
4195 /* Identical to get_identifier, except that the length is assumed
4198 extern tree
get_identifier_with_length (const char *, size_t);
4200 /* If an identifier with the name TEXT (a null-terminated string) has
4201 previously been referred to, return that node; otherwise return
4204 extern tree
maybe_get_identifier (const char *);
4206 /* Construct various types of nodes. */
4208 extern tree
build_nt (enum tree_code
, ...);
4209 extern tree
build_nt_call_vec (tree
, VEC(tree
,gc
) *);
4211 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
4212 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
4213 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
4214 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
4215 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
4216 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
4217 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
4218 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
4219 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
4220 tree MEM_STAT_DECL
);
4221 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4222 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4223 tree MEM_STAT_DECL
);
4224 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4225 extern tree
build6_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4226 tree
, tree MEM_STAT_DECL
);
4227 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
4228 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4230 /* _loc versions of build[1-6]. */
4233 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
4234 tree arg1 MEM_STAT_DECL
)
4236 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
4237 if (CAN_HAVE_LOCATION_P (t
))
4238 SET_EXPR_LOCATION (t
, loc
);
4241 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
4244 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4245 tree arg1 MEM_STAT_DECL
)
4247 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4248 if (CAN_HAVE_LOCATION_P (t
))
4249 SET_EXPR_LOCATION (t
, loc
);
4252 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
4255 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4256 tree arg1
, tree arg2 MEM_STAT_DECL
)
4258 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4259 if (CAN_HAVE_LOCATION_P (t
))
4260 SET_EXPR_LOCATION (t
, loc
);
4263 #define build3_loc(l,c,t1,t2,t3,t4) \
4264 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
4267 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4268 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
4270 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4271 if (CAN_HAVE_LOCATION_P (t
))
4272 SET_EXPR_LOCATION (t
, loc
);
4275 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
4276 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4279 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4280 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4282 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
4283 arg4 PASS_MEM_STAT
);
4284 if (CAN_HAVE_LOCATION_P (t
))
4285 SET_EXPR_LOCATION (t
, loc
);
4288 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
4289 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4292 build6_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4293 tree arg1
, tree arg2
, tree arg3
, tree arg4
,
4294 tree arg5 MEM_STAT_DECL
)
4296 tree t
= build6_stat (code
, type
, arg0
, arg1
, arg2
, arg3
, arg4
,
4297 arg5 PASS_MEM_STAT
);
4298 if (CAN_HAVE_LOCATION_P (t
))
4299 SET_EXPR_LOCATION (t
, loc
);
4302 #define build6_loc(l,c,t1,t2,t3,t4,t5,t6,t7) \
4303 build6_stat_loc (l,c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4305 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
4306 #define build_var_debug_value(t1,t2) \
4307 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
4309 /* Constructs double_int from tree CST. */
4311 static inline double_int
4312 tree_to_double_int (const_tree cst
)
4314 return TREE_INT_CST (cst
);
4317 extern tree
double_int_to_tree (tree
, double_int
);
4318 extern bool double_int_fits_to_tree_p (const_tree
, double_int
);
4319 extern tree
force_fit_type_double (tree
, double_int
, int, bool);
4321 /* Create an INT_CST node with a CST value zero extended. */
4324 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
4326 return double_int_to_tree (type
, uhwi_to_double_int (cst
));
4329 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
4330 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
4331 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
4332 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
4333 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
4334 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
4335 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
4336 extern tree
build_vector_from_ctor (tree
, VEC(constructor_elt
,gc
) *);
4337 extern tree
build_vector_from_val (tree
, tree
);
4338 extern tree
build_constructor (tree
, VEC(constructor_elt
,gc
) *);
4339 extern tree
build_constructor_single (tree
, tree
, tree
);
4340 extern tree
build_constructor_from_list (tree
, tree
);
4341 extern tree
build_real_from_int_cst (tree
, const_tree
);
4342 extern tree
build_complex (tree
, tree
, tree
);
4343 extern tree
build_one_cst (tree
);
4344 extern tree
build_zero_cst (tree
);
4345 extern tree
build_string (int, const char *);
4346 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
4347 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4348 extern tree
build_tree_list_vec_stat (const VEC(tree
,gc
) * MEM_STAT_DECL
);
4349 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
4350 extern tree
build_decl_stat (location_t
, enum tree_code
,
4351 tree
, tree MEM_STAT_DECL
);
4352 extern tree
build_fn_decl (const char *, tree
);
4353 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
4354 extern tree
build_translation_unit_decl (tree
);
4355 extern tree
build_block (tree
, tree
, tree
, tree
);
4356 extern tree
build_empty_stmt (location_t
);
4357 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4359 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
4360 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4362 extern tree
build_call_nary (tree
, tree
, int, ...);
4363 extern tree
build_call_valist (tree
, tree
, int, va_list);
4364 #define build_call_array(T1,T2,N,T3)\
4365 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4366 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4367 extern tree
build_call_vec (tree
, tree
, VEC(tree
,gc
) *);
4369 /* Construct various nodes representing data types. */
4371 extern tree
make_signed_type (int);
4372 extern tree
make_unsigned_type (int);
4373 extern tree
signed_or_unsigned_type_for (int, tree
);
4374 extern tree
signed_type_for (tree
);
4375 extern tree
unsigned_type_for (tree
);
4376 extern void initialize_sizetypes (void);
4377 extern void fixup_unsigned_type (tree
);
4378 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
4379 extern tree
build_pointer_type (tree
);
4380 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
4381 extern tree
build_reference_type (tree
);
4382 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
4383 extern tree
build_vector_type (tree innertype
, int nunits
);
4384 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
4385 extern tree
build_type_no_quals (tree
);
4386 extern tree
build_index_type (tree
);
4387 extern tree
build_array_type (tree
, tree
);
4388 extern tree
build_nonshared_array_type (tree
, tree
);
4389 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
4390 extern tree
build_function_type (tree
, tree
);
4391 extern tree
build_function_type_list (tree
, ...);
4392 extern tree
build_function_decl_skip_args (tree
, bitmap
, bool);
4393 extern tree
build_varargs_function_type_list (tree
, ...);
4394 extern tree
build_function_type_array (tree
, int, tree
*);
4395 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4396 #define build_function_type_vec(RET, V) \
4397 build_function_type_array (RET, VEC_length (tree, V), VEC_address (tree, V))
4398 #define build_varargs_function_type_vec(RET, V) \
4399 build_varargs_function_type_array (RET, VEC_length (tree, V), \
4400 VEC_address (tree, V))
4401 extern tree
build_method_type_directly (tree
, tree
, tree
);
4402 extern tree
build_method_type (tree
, tree
);
4403 extern tree
build_offset_type (tree
, tree
);
4404 extern tree
build_complex_type (tree
);
4405 extern tree
array_type_nelts (const_tree
);
4406 extern bool in_array_bounds_p (tree
);
4407 extern bool range_in_array_bounds_p (tree
);
4409 extern tree
value_member (tree
, tree
);
4410 extern tree
purpose_member (const_tree
, tree
);
4411 extern bool vec_member (const_tree
, VEC(tree
,gc
) *);
4412 extern tree
chain_index (int, tree
);
4414 extern int attribute_list_equal (const_tree
, const_tree
);
4415 extern int attribute_list_contained (const_tree
, const_tree
);
4416 extern int tree_int_cst_equal (const_tree
, const_tree
);
4417 extern int tree_int_cst_lt (const_tree
, const_tree
);
4418 extern int tree_int_cst_compare (const_tree
, const_tree
);
4419 extern int host_integerp (const_tree
, int)
4420 #ifndef ENABLE_TREE_CHECKING
4421 ATTRIBUTE_PURE
/* host_integerp is pure only when checking is disabled. */
4424 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
4425 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4426 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4427 tree_low_cst (const_tree t
, int pos
)
4429 gcc_assert (host_integerp (t
, pos
));
4430 return TREE_INT_CST_LOW (t
);
4433 extern HOST_WIDE_INT
size_low_cst (const_tree
);
4434 extern int tree_int_cst_sgn (const_tree
);
4435 extern int tree_int_cst_sign_bit (const_tree
);
4436 extern unsigned int tree_int_cst_min_precision (tree
, bool);
4437 extern bool tree_expr_nonnegative_p (tree
);
4438 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
4439 extern bool may_negate_without_overflow_p (const_tree
);
4440 extern tree
strip_array_types (tree
);
4441 extern tree
excess_precision_type (tree
);
4442 extern bool valid_constant_size_p (const_tree
);
4444 /* Construct various nodes representing fract or accum data types. */
4446 extern tree
make_fract_type (int, int, int);
4447 extern tree
make_accum_type (int, int, int);
4449 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4450 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4451 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4452 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4453 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4454 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4455 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4456 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4458 #define make_or_reuse_signed_fract_type(P) \
4459 make_or_reuse_fract_type (P, 0, 0)
4460 #define make_or_reuse_unsigned_fract_type(P) \
4461 make_or_reuse_fract_type (P, 1, 0)
4462 #define make_or_reuse_sat_signed_fract_type(P) \
4463 make_or_reuse_fract_type (P, 0, 1)
4464 #define make_or_reuse_sat_unsigned_fract_type(P) \
4465 make_or_reuse_fract_type (P, 1, 1)
4466 #define make_or_reuse_signed_accum_type(P) \
4467 make_or_reuse_accum_type (P, 0, 0)
4468 #define make_or_reuse_unsigned_accum_type(P) \
4469 make_or_reuse_accum_type (P, 1, 0)
4470 #define make_or_reuse_sat_signed_accum_type(P) \
4471 make_or_reuse_accum_type (P, 0, 1)
4472 #define make_or_reuse_sat_unsigned_accum_type(P) \
4473 make_or_reuse_accum_type (P, 1, 1)
4475 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4476 put the prototype here. Rtl.h does declare the prototype if
4477 tree.h had been included. */
4479 extern tree
make_tree (tree
, rtx
);
4481 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4484 Such modified types already made are recorded so that duplicates
4487 extern tree
build_type_attribute_variant (tree
, tree
);
4488 extern tree
build_decl_attribute_variant (tree
, tree
);
4489 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
4491 /* Return 0 if the attributes for two types are incompatible, 1 if they
4492 are compatible, and 2 if they are nearly compatible (which causes a
4493 warning to be generated). */
4494 extern int comp_type_attributes (const_tree
, const_tree
);
4496 /* Structure describing an attribute and a function to handle it. */
4497 struct attribute_spec
4499 /* The name of the attribute (without any leading or trailing __),
4500 or NULL to mark the end of a table of attributes. */
4501 const char *const name
;
4502 /* The minimum length of the list of arguments of the attribute. */
4503 const int min_length
;
4504 /* The maximum length of the list of arguments of the attribute
4505 (-1 for no maximum). */
4506 const int max_length
;
4507 /* Whether this attribute requires a DECL. If it does, it will be passed
4508 from types of DECLs, function return types and array element types to
4509 the DECLs, function types and array types respectively; but when
4510 applied to a type in any other circumstances, it will be ignored with
4511 a warning. (If greater control is desired for a given attribute,
4512 this should be false, and the flags argument to the handler may be
4513 used to gain greater control in that case.) */
4514 const bool decl_required
;
4515 /* Whether this attribute requires a type. If it does, it will be passed
4516 from a DECL to the type of that DECL. */
4517 const bool type_required
;
4518 /* Whether this attribute requires a function (or method) type. If it does,
4519 it will be passed from a function pointer type to the target type,
4520 and from a function return type (which is not itself a function
4521 pointer type) to the function type. */
4522 const bool function_type_required
;
4523 /* Function to handle this attribute. NODE points to the node to which
4524 the attribute is to be applied. If a DECL, it should be modified in
4525 place; if a TYPE, a copy should be created. NAME is the name of the
4526 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4527 of the arguments (which may be NULL). FLAGS gives further information
4528 about the context of the attribute. Afterwards, the attributes will
4529 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4530 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4531 as well as in any other cases when the attributes should not be added
4532 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4533 applied to another type or DECL later may be returned;
4534 otherwise the return value should be NULL_TREE. This pointer may be
4535 NULL if no special handling is required beyond the checks implied
4536 by the rest of this structure. */
4537 tree (*const handler
) (tree
*node
, tree name
, tree args
,
4538 int flags
, bool *no_add_attrs
);
4539 /* Specifies if attribute affects type's identity. */
4540 const bool affects_type_identity
;
4543 /* Flags that may be passed in the third argument of decl_attributes, and
4544 to handler functions for attributes. */
4545 enum attribute_flags
4547 /* The type passed in is the type of a DECL, and any attributes that
4548 should be passed in again to be applied to the DECL rather than the
4549 type should be returned. */
4550 ATTR_FLAG_DECL_NEXT
= 1,
4551 /* The type passed in is a function return type, and any attributes that
4552 should be passed in again to be applied to the function type rather
4553 than the return type should be returned. */
4554 ATTR_FLAG_FUNCTION_NEXT
= 2,
4555 /* The type passed in is an array element type, and any attributes that
4556 should be passed in again to be applied to the array type rather
4557 than the element type should be returned. */
4558 ATTR_FLAG_ARRAY_NEXT
= 4,
4559 /* The type passed in is a structure, union or enumeration type being
4560 created, and should be modified in place. */
4561 ATTR_FLAG_TYPE_IN_PLACE
= 8,
4562 /* The attributes are being applied by default to a library function whose
4563 name indicates known behavior, and should be silently ignored if they
4564 are not in fact compatible with the function type. */
4565 ATTR_FLAG_BUILT_IN
= 16
4568 /* Default versions of target-overridable functions. */
4570 extern tree
merge_decl_attributes (tree
, tree
);
4571 extern tree
merge_type_attributes (tree
, tree
);
4573 /* This function is a private implementation detail of lookup_attribute()
4574 and you should never call it directly. */
4575 extern tree
private_lookup_attribute (const char *, size_t, tree
);
4577 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4578 return a pointer to the attribute's list element if the attribute
4579 is part of the list, or NULL_TREE if not found. If the attribute
4580 appears more than once, this only returns the first occurrence; the
4581 TREE_CHAIN of the return value should be passed back in if further
4582 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
4586 lookup_attribute (const char *attr_name
, tree list
)
4588 gcc_checking_assert (attr_name
[0] != '_');
4589 /* In most cases, list is NULL_TREE. */
4590 if (list
== NULL_TREE
)
4593 /* Do the strlen() before calling the out-of-line implementation.
4594 In most cases attr_name is a string constant, and the compiler
4595 will optimize the strlen() away. */
4596 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
4599 /* This function is a private implementation detail of
4600 is_attribute_p() and you should never call it directly. */
4601 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
4603 /* Given an identifier node IDENT and a string ATTR_NAME, return true
4604 if the identifier node is a valid attribute name for the string.
4605 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
4606 be the identifier for 'text' or for '__text__'. */
4609 is_attribute_p (const char *attr_name
, const_tree ident
)
4611 gcc_checking_assert (attr_name
[0] != '_');
4612 /* Do the strlen() before calling the out-of-line implementation.
4613 In most cases attr_name is a string constant, and the compiler
4614 will optimize the strlen() away. */
4615 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
4618 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4619 modified list. ATTR_NAME must be in the form 'text' (not
4622 extern tree
remove_attribute (const char *, tree
);
4624 /* Given two attributes lists, return a list of their union. */
4626 extern tree
merge_attributes (tree
, tree
);
4628 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4629 /* Given two Windows decl attributes lists, possibly including
4630 dllimport, return a list of their union . */
4631 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4633 /* Handle a "dllimport" or "dllexport" attribute. */
4634 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4637 /* Check whether CAND is suitable to be returned from get_qualified_type
4638 (BASE, TYPE_QUALS). */
4640 extern bool check_qualified_type (const_tree
, const_tree
, int);
4642 /* Return a version of the TYPE, qualified as indicated by the
4643 TYPE_QUALS, if one exists. If no qualified version exists yet,
4644 return NULL_TREE. */
4646 extern tree
get_qualified_type (tree
, int);
4648 /* Like get_qualified_type, but creates the type if it does not
4649 exist. This function never returns NULL_TREE. */
4651 extern tree
build_qualified_type (tree
, int);
4653 /* Create a variant of type T with alignment ALIGN. */
4655 extern tree
build_aligned_type (tree
, unsigned int);
4657 /* Like build_qualified_type, but only deals with the `const' and
4658 `volatile' qualifiers. This interface is retained for backwards
4659 compatibility with the various front-ends; new code should use
4660 build_qualified_type instead. */
4662 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4663 build_qualified_type ((TYPE), \
4664 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4665 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4667 /* Make a copy of a type node. */
4669 extern tree
build_distinct_type_copy (tree
);
4670 extern tree
build_variant_type_copy (tree
);
4672 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4673 fields. Optionally specify an alignment, and then lay it out. */
4675 extern void finish_builtin_struct (tree
, const char *,
4678 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4679 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4680 node, does nothing except for the first time. */
4682 extern void layout_type (tree
);
4684 /* These functions allow a front-end to perform a manual layout of a
4685 RECORD_TYPE. (For instance, if the placement of subsequent fields
4686 depends on the placement of fields so far.) Begin by calling
4687 start_record_layout. Then, call place_field for each of the
4688 fields. Then, call finish_record_layout. See layout_type for the
4689 default way in which these functions are used. */
4691 typedef struct record_layout_info_s
4693 /* The RECORD_TYPE that we are laying out. */
4695 /* The offset into the record so far, in bytes, not including bits in
4698 /* The last known alignment of SIZE. */
4699 unsigned int offset_align
;
4700 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4702 /* The alignment of the record so far, in bits. */
4703 unsigned int record_align
;
4704 /* The alignment of the record so far, ignoring #pragma pack and
4705 __attribute__ ((packed)), in bits. */
4706 unsigned int unpacked_align
;
4707 /* The previous field laid out. */
4709 /* The static variables (i.e., class variables, as opposed to
4710 instance variables) encountered in T. */
4711 VEC(tree
,gc
) *pending_statics
;
4712 /* Bits remaining in the current alignment group */
4713 int remaining_in_alignment
;
4714 /* True if we've seen a packed field that didn't have normal
4715 alignment anyway. */
4716 int packed_maybe_necessary
;
4717 } *record_layout_info
;
4719 extern record_layout_info
start_record_layout (tree
);
4720 extern tree
bit_from_pos (tree
, tree
);
4721 extern tree
byte_from_pos (tree
, tree
);
4722 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
4723 extern void normalize_offset (tree
*, tree
*, unsigned int);
4724 extern tree
rli_size_unit_so_far (record_layout_info
);
4725 extern tree
rli_size_so_far (record_layout_info
);
4726 extern void normalize_rli (record_layout_info
);
4727 extern void place_field (record_layout_info
, tree
);
4728 extern void compute_record_mode (tree
);
4729 extern void finish_record_layout (record_layout_info
, int);
4731 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4732 return a canonicalized ..._TYPE node, so that duplicates are not made.
4733 How the hash code is computed is up to the caller, as long as any two
4734 callers that could hash identical-looking type nodes agree. */
4736 extern tree
type_hash_canon (unsigned int, tree
);
4738 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4739 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4740 fields. Call this only once for any given decl node.
4742 Second argument is the boundary that this field can be assumed to
4743 be starting at (in bits). Zero means it can be assumed aligned
4744 on any boundary that may be needed. */
4746 extern void layout_decl (tree
, unsigned);
4748 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4749 a previous call to layout_decl and calls it again. */
4751 extern void relayout_decl (tree
);
4753 /* Return the mode for data of a given size SIZE and mode class CLASS.
4754 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4755 The value is BLKmode if no other mode is found. This is like
4756 mode_for_size, but is passed a tree. */
4758 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
4760 /* Return an expr equal to X but certainly not valid as an lvalue. */
4762 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4763 extern tree
non_lvalue_loc (location_t
, tree
);
4765 extern tree
convert (tree
, tree
);
4766 extern unsigned int expr_align (const_tree
);
4767 extern tree
expr_first (tree
);
4768 extern tree
expr_last (tree
);
4769 extern tree
size_in_bytes (const_tree
);
4770 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4771 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4772 extern tree
tree_expr_size (const_tree
);
4773 extern tree
bit_position (const_tree
);
4774 extern HOST_WIDE_INT
int_bit_position (const_tree
);
4775 extern tree
byte_position (const_tree
);
4776 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4778 /* Define data structures, macros, and functions for handling sizes
4779 and the various types used to represent sizes. */
4783 stk_sizetype
, /* Normal representation of sizes in bytes. */
4784 stk_ssizetype
, /* Signed representation of sizes in bytes. */
4785 stk_bitsizetype
, /* Normal representation of sizes in bits. */
4786 stk_sbitsizetype
, /* Signed representation of sizes in bits. */
4790 extern GTY(()) tree sizetype_tab
[(int) stk_type_kind_last
];
4792 #define sizetype sizetype_tab[(int) stk_sizetype]
4793 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4794 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4795 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4797 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
4798 #define size_binop(CODE,T1,T2)\
4799 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4800 extern tree
size_binop_loc (location_t
, enum tree_code
, tree
, tree
);
4801 #define size_diffop(T1,T2)\
4802 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4803 extern tree
size_diffop_loc (location_t
, tree
, tree
);
4805 #define size_int(L) size_int_kind (L, stk_sizetype)
4806 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4807 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4808 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4810 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4811 extern tree
round_up_loc (location_t
, tree
, int);
4812 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4813 extern tree
round_down_loc (location_t
, tree
, int);
4814 extern void finalize_size_functions (void);
4816 /* Type for sizes of data-type. */
4818 #define BITS_PER_UNIT_LOG \
4819 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4820 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4821 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4823 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4824 extern unsigned int maximum_field_alignment
;
4826 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4827 by making the last node in X point to Y.
4828 Returns X, except if X is 0 returns Y. */
4830 extern tree
chainon (tree
, tree
);
4832 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4834 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4835 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4837 /* Return the last tree node in a chain. */
4839 extern tree
tree_last (tree
);
4841 /* Reverse the order of elements in a chain, and return the new head. */
4843 extern tree
nreverse (tree
);
4845 /* Returns the length of a chain of nodes
4846 (number of chain pointers to follow before reaching a null pointer). */
4848 extern int list_length (const_tree
);
4850 /* Returns the number of FIELD_DECLs in a type. */
4852 extern int fields_length (const_tree
);
4854 /* Returns the first FIELD_DECL in a type. */
4856 extern tree
first_field (const_tree
);
4858 /* Given an initializer INIT, return TRUE if INIT is zero or some
4859 aggregate of zeros. Otherwise return FALSE. */
4861 extern bool initializer_zerop (const_tree
);
4863 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4865 extern VEC(tree
,gc
) *ctor_to_vec (tree
);
4867 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*,
4868 HOST_WIDE_INT
*, bool *);
4870 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
4872 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4874 extern int integer_zerop (const_tree
);
4876 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4878 extern int integer_onep (const_tree
);
4880 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4881 all of whose significant bits are 1. */
4883 extern int integer_all_onesp (const_tree
);
4885 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4886 exactly one bit 1. */
4888 extern int integer_pow2p (const_tree
);
4890 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4891 with a nonzero value. */
4893 extern int integer_nonzerop (const_tree
);
4895 extern bool cst_and_fits_in_hwi (const_tree
);
4896 extern tree
num_ending_zeros (const_tree
);
4898 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4901 extern int fixed_zerop (const_tree
);
4903 /* staticp (tree x) is nonzero if X is a reference to data allocated
4904 at a fixed address in memory. Returns the outermost data. */
4906 extern tree
staticp (tree
);
4908 /* save_expr (EXP) returns an expression equivalent to EXP
4909 but it can be used multiple times within context CTX
4910 and only evaluate EXP once. */
4912 extern tree
save_expr (tree
);
4914 /* Look inside EXPR and into any simple arithmetic operations. Return
4915 the innermost non-arithmetic node. */
4917 extern tree
skip_simple_arithmetic (tree
);
4919 /* Return which tree structure is used by T. */
4921 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4923 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4924 size or offset that depends on a field within a record. */
4926 extern bool contains_placeholder_p (const_tree
);
4928 /* This macro calls the above function but short-circuits the common
4929 case of a constant to save time. Also check for null. */
4931 #define CONTAINS_PLACEHOLDER_P(EXP) \
4932 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4934 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4935 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4938 extern bool type_contains_placeholder_p (tree
);
4940 /* Given a tree EXP, find all occurrences of references to fields
4941 in a PLACEHOLDER_EXPR and place them in vector REFS without
4942 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4943 we assume here that EXP contains only arithmetic expressions
4944 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4947 extern void find_placeholder_in_expr (tree
, VEC (tree
, heap
) **);
4949 /* This macro calls the above function but short-circuits the common
4950 case of a constant to save time and also checks for NULL. */
4952 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4954 if((EXP) && !TREE_CONSTANT (EXP)) \
4955 find_placeholder_in_expr (EXP, V); \
4958 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4959 return a tree with all occurrences of references to F in a
4960 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4961 CONST_DECLs. Note that we assume here that EXP contains only
4962 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4963 occurring only in their argument list. */
4965 extern tree
substitute_in_expr (tree
, tree
, tree
);
4967 /* This macro calls the above function but short-circuits the common
4968 case of a constant to save time and also checks for NULL. */
4970 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4971 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4973 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4974 for it within OBJ, a tree that is an object or a chain of references. */
4976 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4978 /* This macro calls the above function but short-circuits the common
4979 case of a constant to save time and also checks for NULL. */
4981 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4982 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4983 : substitute_placeholder_in_expr (EXP, OBJ))
4985 /* variable_size (EXP) is like save_expr (EXP) except that it
4986 is for the special case of something that is part of a
4987 variable size for a data type. It makes special arrangements
4988 to compute the value at the right time when the data type
4989 belongs to a function parameter. */
4991 extern tree
variable_size (tree
);
4993 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4994 but it can be used multiple times
4995 and only evaluate the subexpressions once. */
4997 extern tree
stabilize_reference (tree
);
4999 /* Subroutine of stabilize_reference; this is called for subtrees of
5000 references. Any expression with side-effects must be put in a SAVE_EXPR
5001 to ensure that it is only evaluated once. */
5003 extern tree
stabilize_reference_1 (tree
);
5005 /* Return EXP, stripped of any conversions to wider types
5006 in such a way that the result of converting to type FOR_TYPE
5007 is the same as if EXP were converted to FOR_TYPE.
5008 If FOR_TYPE is 0, it signifies EXP's type. */
5010 extern tree
get_unwidened (tree
, tree
);
5012 /* Return OP or a simpler expression for a narrower value
5013 which can be sign-extended or zero-extended to give back OP.
5014 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5015 or 0 if the value should be sign-extended. */
5017 extern tree
get_narrower (tree
, int *);
5019 /* Return true if T is an expression that get_inner_reference handles. */
5022 handled_component_p (const_tree t
)
5024 switch (TREE_CODE (t
))
5029 case ARRAY_RANGE_REF
:
5032 case VIEW_CONVERT_EXPR
:
5040 /* Given an expression EXP that is a handled_component_p,
5041 look for the ultimate containing object, which is returned and specify
5042 the access position and size. */
5044 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
5045 tree
*, enum machine_mode
*, int *, int *,
5048 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
5049 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
5050 EXP is marked as PACKED. */
5052 extern bool contains_packed_reference (const_tree exp
);
5054 /* Return a tree of sizetype representing the size, in bytes, of the element
5055 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5057 extern tree
array_ref_element_size (tree
);
5059 bool array_at_struct_end_p (tree
);
5061 /* Return a tree representing the lower bound of the array mentioned in
5062 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5064 extern tree
array_ref_low_bound (tree
);
5066 /* Return a tree representing the upper bound of the array mentioned in
5067 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5069 extern tree
array_ref_up_bound (tree
);
5071 /* Return a tree representing the offset, in bytes, of the field referenced
5072 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5074 extern tree
component_ref_field_offset (tree
);
5076 /* Given a DECL or TYPE, return the scope in which it was declared, or
5077 NUL_TREE if there is no containing scope. */
5079 extern tree
get_containing_scope (const_tree
);
5081 /* Return the FUNCTION_DECL which provides this _DECL with its context,
5083 extern tree
decl_function_context (const_tree
);
5085 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5086 this _DECL with its context, or zero if none. */
5087 extern tree
decl_type_context (const_tree
);
5089 /* Return 1 if EXPR is the real constant zero. */
5090 extern int real_zerop (const_tree
);
5092 /* Declare commonly used variables for tree structure. */
5094 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
5095 Zero means allow extended lvalues. */
5097 extern int pedantic_lvalues
;
5099 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
5101 extern GTY(()) tree current_function_decl
;
5103 /* Nonzero means a FUNC_BEGIN label was emitted. */
5104 extern GTY(()) const char * current_function_func_begin_label
;
5106 /* Iterator for going through the function arguments. */
5108 tree next
; /* TREE_LIST pointing to the next argument */
5109 } function_args_iterator
;
5111 /* Initialize the iterator I with arguments from function FNDECL */
5114 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
5116 i
->next
= TYPE_ARG_TYPES (fntype
);
5119 /* Return a pointer that holds the next argument if there are more arguments to
5120 handle, otherwise return NULL. */
5122 static inline tree
*
5123 function_args_iter_cond_ptr (function_args_iterator
*i
)
5125 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
5128 /* Return the next argument if there are more arguments to handle, otherwise
5132 function_args_iter_cond (function_args_iterator
*i
)
5134 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
5137 /* Advance to the next argument. */
5139 function_args_iter_next (function_args_iterator
*i
)
5141 gcc_assert (i
->next
!= NULL_TREE
);
5142 i
->next
= TREE_CHAIN (i
->next
);
5145 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
5148 inlined_function_outer_scope_p (const_tree block
)
5150 return BLOCK_SOURCE_LOCATION (block
) != UNKNOWN_LOCATION
;
5153 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5154 to point to the next tree element. ITER is an instance of
5155 function_args_iterator used to iterate the arguments. */
5156 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5157 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5158 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5159 function_args_iter_next (&(ITER)))
5161 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5162 to the next tree element. ITER is an instance of function_args_iterator
5163 used to iterate the arguments. */
5164 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5165 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5166 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5167 function_args_iter_next (&(ITER)))
5172 extern unsigned crc32_string (unsigned, const char *);
5173 extern unsigned crc32_byte (unsigned, char);
5174 extern unsigned crc32_unsigned (unsigned, unsigned);
5175 extern void clean_symbol_name (char *);
5176 extern tree
get_file_function_name (const char *);
5177 extern tree
get_callee_fndecl (const_tree
);
5178 extern int type_num_arguments (const_tree
);
5179 extern bool associative_tree_code (enum tree_code
);
5180 extern bool commutative_tree_code (enum tree_code
);
5181 extern bool commutative_ternary_tree_code (enum tree_code
);
5182 extern tree
upper_bound_in_type (tree
, tree
);
5183 extern tree
lower_bound_in_type (tree
, tree
);
5184 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
5185 extern tree
create_artificial_label (location_t
);
5186 extern const char *get_name (tree
);
5187 extern bool stdarg_p (const_tree
);
5188 extern bool prototype_p (tree
);
5189 extern bool is_typedef_decl (tree x
);
5190 extern bool typedef_variant_p (tree
);
5191 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
5192 extern tree
build_low_bits_mask (tree
, unsigned);
5193 extern tree
tree_strip_nop_conversions (tree
);
5194 extern tree
tree_strip_sign_nop_conversions (tree
);
5195 extern const_tree
strip_invariant_refs (const_tree
);
5196 extern tree
lhd_gcc_personality (void);
5197 extern void assign_assembler_name_if_neeeded (tree
);
5198 extern void warn_deprecated_use (tree
, tree
);
5202 extern void change_decl_assembler_name (tree
, tree
);
5205 extern tree
unshare_expr (tree
);
5209 extern void expand_expr_stmt (tree
);
5210 extern void expand_label (tree
);
5211 extern void expand_goto (tree
);
5213 extern rtx
expand_stack_save (void);
5214 extern void expand_stack_restore (tree
);
5215 extern void expand_return (tree
);
5218 extern void using_eh_for_cleanups (void);
5220 extern bool tree_could_trap_p (tree
);
5221 extern bool operation_could_trap_helper_p (enum tree_code
, bool, bool, bool,
5222 bool, tree
, bool *);
5223 extern bool operation_could_trap_p (enum tree_code
, bool, bool, tree
);
5224 extern bool tree_could_throw_p (tree
);
5226 /* Compare and hash for any structure which begins with a canonical
5227 pointer. Assumes all pointers are interchangeable, which is sort
5228 of already assumed by gcc elsewhere IIRC. */
5231 struct_ptr_eq (const void *a
, const void *b
)
5233 const void * const * x
= (const void * const *) a
;
5234 const void * const * y
= (const void * const *) b
;
5238 static inline hashval_t
5239 struct_ptr_hash (const void *a
)
5241 const void * const * x
= (const void * const *) a
;
5242 return (intptr_t)*x
>> 4;
5245 /* In fold-const.c */
5247 /* Non-zero if we are folding constants inside an initializer; zero
5249 extern int folding_initializer
;
5251 /* Convert between trees and native memory representation. */
5252 extern int native_encode_expr (const_tree
, unsigned char *, int);
5253 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
5255 /* Fold constants as much as possible in an expression.
5256 Returns the simplified expression.
5257 Acts only on the top level of the expression;
5258 if the argument itself cannot be simplified, its
5259 subexpressions are not changed. */
5261 extern tree
fold (tree
);
5262 #define fold_unary(CODE,T1,T2)\
5263 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5264 extern tree
fold_unary_loc (location_t
, enum tree_code
, tree
, tree
);
5265 #define fold_unary_ignore_overflow(CODE,T1,T2)\
5266 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5267 extern tree
fold_unary_ignore_overflow_loc (location_t
, enum tree_code
, tree
, tree
);
5268 #define fold_binary(CODE,T1,T2,T3)\
5269 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
5270 extern tree
fold_binary_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
5271 #define fold_ternary(CODE,T1,T2,T3,T4)\
5272 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
5273 extern tree
fold_ternary_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
5274 #define fold_build1(c,t1,t2)\
5275 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
5276 #define fold_build1_loc(l,c,t1,t2)\
5277 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
5278 extern tree
fold_build1_stat_loc (location_t
, enum tree_code
, tree
,
5279 tree MEM_STAT_DECL
);
5280 #define fold_build2(c,t1,t2,t3)\
5281 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
5282 #define fold_build2_loc(l,c,t1,t2,t3)\
5283 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
5284 extern tree
fold_build2_stat_loc (location_t
, enum tree_code
, tree
, tree
,
5285 tree MEM_STAT_DECL
);
5286 #define fold_build3(c,t1,t2,t3,t4)\
5287 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
5288 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
5289 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
5290 extern tree
fold_build3_stat_loc (location_t
, enum tree_code
, tree
, tree
, tree
,
5291 tree MEM_STAT_DECL
);
5292 extern tree
fold_build1_initializer_loc (location_t
, enum tree_code
, tree
, tree
);
5293 extern tree
fold_build2_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
5294 extern tree
fold_build3_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
5295 #define fold_build_call_array(T1,T2,N,T4)\
5296 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5297 extern tree
fold_build_call_array_loc (location_t
, tree
, tree
, int, tree
*);
5298 #define fold_build_call_array_initializer(T1,T2,N,T4)\
5299 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5300 extern tree
fold_build_call_array_initializer_loc (location_t
, tree
, tree
, int, tree
*);
5301 extern bool fold_convertible_p (const_tree
, const_tree
);
5302 #define fold_convert(T1,T2)\
5303 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
5304 extern tree
fold_convert_loc (location_t
, tree
, tree
);
5305 extern tree
fold_single_bit_test (location_t
, enum tree_code
, tree
, tree
, tree
);
5306 extern tree
fold_ignored_result (tree
);
5307 extern tree
fold_abs_const (tree
, tree
);
5308 extern tree
fold_indirect_ref_1 (location_t
, tree
, tree
);
5309 extern void fold_defer_overflow_warnings (void);
5310 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
5311 extern void fold_undefer_and_ignore_overflow_warnings (void);
5312 extern bool fold_deferring_overflow_warnings_p (void);
5313 extern tree
fold_fma (location_t
, tree
, tree
, tree
, tree
);
5315 enum operand_equal_flag
5319 OEP_CONSTANT_ADDRESS_OF
= 4
5322 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
5323 extern int multiple_of_p (tree
, const_tree
, const_tree
);
5324 #define omit_one_operand(T1,T2,T3)\
5325 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
5326 extern tree
omit_one_operand_loc (location_t
, tree
, tree
, tree
);
5327 #define omit_two_operands(T1,T2,T3,T4)\
5328 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
5329 extern tree
omit_two_operands_loc (location_t
, tree
, tree
, tree
, tree
);
5330 #define invert_truthvalue(T)\
5331 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
5332 extern tree
invert_truthvalue_loc (location_t
, tree
);
5333 extern tree
fold_truth_not_expr (location_t
, tree
);
5334 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
5335 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
5336 extern tree
fold_read_from_constant_string (tree
);
5337 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
);
5338 #define build_fold_addr_expr(T)\
5339 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
5340 extern tree
build_fold_addr_expr_loc (location_t
, tree
);
5341 #define build_fold_addr_expr_with_type(T,TYPE)\
5342 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
5343 extern tree
build_fold_addr_expr_with_type_loc (location_t
, tree
, tree
);
5344 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
5345 extern tree
fold_strip_sign_ops (tree
);
5346 #define build_fold_indirect_ref(T)\
5347 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5348 extern tree
build_fold_indirect_ref_loc (location_t
, tree
);
5349 #define fold_indirect_ref(T)\
5350 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5351 extern tree
fold_indirect_ref_loc (location_t
, tree
);
5352 extern tree
build_simple_mem_ref_loc (location_t
, tree
);
5353 #define build_simple_mem_ref(T)\
5354 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
5355 extern double_int
mem_ref_offset (const_tree
);
5356 extern tree
reference_alias_ptr_type (const_tree
);
5357 extern tree
build_invariant_address (tree
, tree
, HOST_WIDE_INT
);
5358 extern tree
constant_boolean_node (bool, tree
);
5359 extern tree
div_if_zero_remainder (enum tree_code
, const_tree
, const_tree
);
5361 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
5362 extern enum tree_code
swap_tree_comparison (enum tree_code
);
5364 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
5365 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
5367 extern bool tree_expr_nonzero_p (tree
);
5368 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
5369 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
5371 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
5372 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
5373 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
5375 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5376 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5377 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
5379 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
5381 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
5382 extern tree
combine_comparisons (location_t
, enum tree_code
, enum tree_code
,
5383 enum tree_code
, tree
, tree
, tree
);
5384 extern void debug_fold_checksum (const_tree
);
5386 /* Return nonzero if CODE is a tree code that represents a truth value. */
5388 truth_value_p (enum tree_code code
)
5390 return (TREE_CODE_CLASS (code
) == tcc_comparison
5391 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5392 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5393 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5396 /* Return whether TYPE is a type suitable for an offset for
5397 a POINTER_PLUS_EXPR. */
5399 ptrofftype_p (tree type
)
5401 return (INTEGRAL_TYPE_P (type
)
5402 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
5403 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
5406 /* Return OFF converted to a pointer offset type suitable as offset for
5407 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
5409 convert_to_ptrofftype_loc (location_t loc
, tree off
)
5411 return fold_convert_loc (loc
, sizetype
, off
);
5413 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
5415 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
5417 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
5419 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
5420 ptr
, fold_convert_loc (loc
, sizetype
, off
));
5422 #define fold_build_pointer_plus(p,o) \
5423 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
5425 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
5427 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
5429 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
5430 ptr
, size_int (off
));
5432 #define fold_build_pointer_plus_hwi(p,o) \
5433 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
5436 extern bool avoid_folding_inline_builtin (tree
);
5437 extern tree
fold_call_expr (location_t
, tree
, bool);
5438 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
5439 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
5440 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
5441 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
5442 enum built_in_function
);
5443 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
5444 enum built_in_function
);
5445 extern tree
fold_builtin_stxncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
5446 enum built_in_function
);
5447 extern tree
fold_builtin_snprintf_chk (location_t
, tree
, tree
, enum built_in_function
);
5448 extern bool fold_builtin_next_arg (tree
, bool);
5449 extern enum built_in_function
builtin_mathfn_code (const_tree
);
5450 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
5451 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
5452 extern tree
build_call_expr_loc_vec (location_t
, tree
, VEC(tree
,gc
) *);
5453 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
5454 extern tree
build_call_expr (tree
, int, ...);
5455 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
5456 extern tree
c_strlen (tree
, int);
5457 extern tree
std_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
5458 extern tree
build_va_arg_indirect_ref (tree
);
5459 extern tree
build_string_literal (int, const char *);
5460 extern bool validate_arglist (const_tree
, ...);
5461 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
5462 extern bool is_builtin_fn (tree
);
5463 extern bool get_object_alignment_1 (tree
, unsigned int *,
5464 unsigned HOST_WIDE_INT
*);
5465 extern unsigned int get_object_alignment (tree
);
5466 extern unsigned int get_object_or_type_alignment (tree
);
5467 extern bool get_pointer_alignment_1 (tree
, unsigned int *,
5468 unsigned HOST_WIDE_INT
*);
5469 extern unsigned int get_pointer_alignment (tree
);
5470 extern tree
fold_call_stmt (gimple
, bool);
5471 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
5472 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
5473 extern tree
make_range_step (location_t
, enum tree_code
, tree
, tree
, tree
,
5474 tree
*, tree
*, int *, bool *);
5475 extern tree
build_range_check (location_t
, tree
, tree
, int, tree
, tree
);
5476 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
5478 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
5479 extern bool is_simple_builtin (tree
);
5480 extern bool is_inexpensive_builtin (tree
);
5483 extern tree
strip_float_extensions (tree
);
5486 extern int really_constant_p (const_tree
);
5487 extern bool decl_address_invariant_p (const_tree
);
5488 extern bool decl_address_ip_invariant_p (const_tree
);
5489 extern bool int_fits_type_p (const_tree
, const_tree
);
5490 #ifndef GENERATOR_FILE
5491 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5493 extern bool variably_modified_type_p (tree
, tree
);
5494 extern int tree_log2 (const_tree
);
5495 extern int tree_floor_log2 (const_tree
);
5496 extern int simple_cst_equal (const_tree
, const_tree
);
5497 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
5498 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
5499 const_tree
, hashval_t
);
5500 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5501 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
5502 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5503 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5504 extern int type_list_equal (const_tree
, const_tree
);
5505 extern int chain_member (const_tree
, const_tree
);
5506 extern tree
type_hash_lookup (unsigned int, tree
);
5507 extern void type_hash_add (unsigned int, tree
);
5508 extern int simple_cst_list_equal (const_tree
, const_tree
);
5509 extern void dump_tree_statistics (void);
5510 extern void recompute_tree_invariant_for_addr_expr (tree
);
5511 extern bool needs_to_live_in_memory (const_tree
);
5512 extern tree
reconstruct_complex_type (tree
, tree
);
5514 extern int real_onep (const_tree
);
5515 extern int real_twop (const_tree
);
5516 extern int real_minus_onep (const_tree
);
5517 extern void init_ttree (void);
5518 extern void build_common_tree_nodes (bool, bool);
5519 extern void build_common_builtin_nodes (void);
5520 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5521 extern tree
build_range_type (tree
, tree
, tree
);
5522 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
5523 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5524 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5525 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
5527 extern tree
*tree_block (tree
);
5528 extern location_t
*block_nonartificial_location (tree
);
5529 extern location_t
tree_nonartificial_location (tree
);
5531 extern tree
block_ultimate_origin (const_tree
);
5533 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
5535 /* In tree-nested.c */
5536 extern tree
build_addr (tree
, tree
);
5539 extern void expand_main_function (void);
5540 extern void expand_function_end (void);
5541 extern void expand_function_start (tree
);
5542 extern void stack_protect_prologue (void);
5543 extern void stack_protect_epilogue (void);
5544 extern void init_dummy_function_start (void);
5545 extern void expand_dummy_function_end (void);
5546 extern void allocate_struct_function (tree
, bool);
5547 extern void push_struct_function (tree fndecl
);
5548 extern void init_function_start (tree
);
5549 extern bool use_register_for_decl (const_tree
);
5550 extern void generate_setjmp_warnings (void);
5551 extern void init_temp_slots (void);
5552 extern void free_temp_slots (void);
5553 extern void pop_temp_slots (void);
5554 extern void push_temp_slots (void);
5555 extern void preserve_temp_slots (rtx
);
5556 extern int aggregate_value_p (const_tree
, const_tree
);
5557 extern void push_function_context (void);
5558 extern void pop_function_context (void);
5559 extern gimple_seq
gimplify_parameters (void);
5561 /* In print-rtl.c */
5563 extern void print_rtl (FILE *, const_rtx
);
5566 /* In print-tree.c */
5567 extern void debug_tree (tree
);
5568 extern void debug_vec_tree (VEC(tree
,gc
) *);
5570 extern void dump_addr (FILE*, const char *, const void *);
5571 extern void print_node (FILE *, const char *, tree
, int);
5572 extern void print_vec_tree (FILE *, const char *, VEC(tree
,gc
) *, int);
5573 extern void print_node_brief (FILE *, const char *, const_tree
, int);
5574 extern void indent_to (FILE *, int);
5577 /* In tree-inline.c: */
5578 extern bool debug_find_tree (tree
, tree
);
5579 /* This is in tree-inline.c since the routine uses
5580 data structures from the inliner. */
5581 extern tree
unsave_expr_now (tree
);
5582 extern tree
build_duplicate_type (tree
);
5586 /* Nonzero if this is a call to a function whose return value depends
5587 solely on its arguments, has no side effects, and does not read
5588 global memory. This corresponds to TREE_READONLY for function
5590 #define ECF_CONST (1 << 0)
5591 /* Nonzero if this is a call to "pure" function (like const function,
5592 but may read memory. This corresponds to DECL_PURE_P for function
5594 #define ECF_PURE (1 << 1)
5595 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5596 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5597 for function decls.*/
5598 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5599 /* Nonzero if this call will never return. */
5600 #define ECF_NORETURN (1 << 3)
5601 /* Nonzero if this is a call to malloc or a related function. */
5602 #define ECF_MALLOC (1 << 4)
5603 /* Nonzero if it is plausible that this is a call to alloca. */
5604 #define ECF_MAY_BE_ALLOCA (1 << 5)
5605 /* Nonzero if this is a call to a function that won't throw an exception. */
5606 #define ECF_NOTHROW (1 << 6)
5607 /* Nonzero if this is a call to setjmp or a related function. */
5608 #define ECF_RETURNS_TWICE (1 << 7)
5609 /* Nonzero if this call replaces the current stack frame. */
5610 #define ECF_SIBCALL (1 << 8)
5611 /* Function does not read or write memory (but may have side effects, so
5612 it does not necessarily fit ECF_CONST). */
5613 #define ECF_NOVOPS (1 << 9)
5614 /* The function does not lead to calls within current function unit. */
5615 #define ECF_LEAF (1 << 10)
5616 /* Nonzero if this call does not affect transactions. */
5617 #define ECF_TM_PURE (1 << 11)
5618 /* Nonzero if this call is into the transaction runtime library. */
5619 #define ECF_TM_BUILTIN (1 << 12)
5621 extern int flags_from_decl_or_type (const_tree
);
5622 extern int call_expr_flags (const_tree
);
5624 /* Call argument flags. */
5626 /* Nonzero if the argument is not dereferenced recursively, thus only
5627 directly reachable memory is read or written. */
5628 #define EAF_DIRECT (1 << 0)
5629 /* Nonzero if memory reached by the argument is not clobbered. */
5630 #define EAF_NOCLOBBER (1 << 1)
5631 /* Nonzero if the argument does not escape. */
5632 #define EAF_NOESCAPE (1 << 2)
5633 /* Nonzero if the argument is not used by the function. */
5634 #define EAF_UNUSED (1 << 3)
5636 /* Call return flags. */
5638 /* Mask for the argument number that is returned. Lower two bits of
5639 the return flags, encodes argument slots zero to three. */
5640 #define ERF_RETURN_ARG_MASK (3)
5641 /* Nonzero if the return value is equal to the argument number
5642 flags & ERF_RETURN_ARG_MASK. */
5643 #define ERF_RETURNS_ARG (1 << 2)
5644 /* Nonzero if the return value does not alias with anything. Functions
5645 with the malloc attribute have this set on their return value. */
5646 #define ERF_NOALIAS (1 << 3)
5648 extern int setjmp_call_p (const_tree
);
5649 extern bool gimple_alloca_call_p (const_gimple
);
5650 extern bool alloca_call_p (const_tree
);
5651 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
5652 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
5656 extern const struct attribute_spec
*lookup_attribute_spec (const_tree
);
5658 extern void init_attributes (void);
5660 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5661 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5662 it should be modified in place; if a TYPE, a copy should be created
5663 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5664 information, in the form of a bitwise OR of flags in enum attribute_flags
5665 from tree.h. Depending on these flags, some attributes may be
5666 returned to be applied at a later stage (for example, to apply
5667 a decl attribute to the declaration rather than to its type). */
5668 extern tree
decl_attributes (tree
*, tree
, int);
5670 extern void apply_tm_attr (tree
, tree
);
5672 /* In stor-layout.c */
5673 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
5674 extern void fixup_signed_type (tree
);
5675 extern void internal_reference_types (void);
5676 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
5679 extern tree
tree_output_constant_def (tree
);
5680 extern void make_decl_rtl (tree
);
5681 extern rtx
make_decl_rtl_for_debug (tree
);
5682 extern void make_decl_one_only (tree
, tree
);
5683 extern int supports_one_only (void);
5684 extern void resolve_unique_section (tree
, int, int);
5685 extern void mark_referenced (tree
);
5686 extern void mark_decl_referenced (tree
);
5687 extern void notice_global_symbol (tree
);
5688 extern void set_user_assembler_name (tree
, const char *);
5689 extern void process_pending_assemble_externals (void);
5690 extern bool decl_replaceable_p (tree
);
5691 extern bool decl_binds_to_current_def_p (tree
);
5692 extern enum tls_model
decl_default_tls_model (const_tree
);
5694 /* Declare DECL to be a weak symbol. */
5695 extern void declare_weak (tree
);
5696 /* Merge weak status. */
5697 extern void merge_weak (tree
, tree
);
5698 /* Make one symbol an alias for another. */
5699 extern void assemble_alias (tree
, tree
);
5701 /* Return nonzero if VALUE is a valid constant-valued expression
5702 for use in initializing a static variable; one that can be an
5703 element of a "constant" initializer.
5705 Return null_pointer_node if the value is absolute;
5706 if it is relocatable, return the variable that determines the relocation.
5707 We assume that VALUE has been folded as much as possible;
5708 therefore, we do not need to check for such things as
5709 arithmetic-combinations of integers. */
5710 extern tree
initializer_constant_valid_p (tree
, tree
);
5712 /* Return true if VALUE is a valid constant-valued expression
5713 for use in initializing a static bit-field; one that can be
5714 an element of a "constant" initializer. */
5715 extern bool initializer_constant_valid_for_bitfield_p (tree
);
5717 /* Whether a constructor CTOR is a valid static constant initializer if all
5718 its elements are. This used to be internal to initializer_constant_valid_p
5719 and has been exposed to let other functions like categorize_ctor_elements
5720 evaluate the property while walking a constructor for other purposes. */
5722 extern bool constructor_static_from_elts_p (const_tree
);
5725 extern void expand_computed_goto (tree
);
5726 extern bool parse_output_constraint (const char **, int, int, int,
5727 bool *, bool *, bool *);
5728 extern bool parse_input_constraint (const char **, int, int, int, int,
5729 const char * const *, bool *, bool *);
5730 extern void expand_asm_stmt (gimple
);
5731 extern tree
resolve_asm_operand_names (tree
, tree
, tree
, tree
);
5732 extern void expand_case (gimple
);
5734 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5735 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
5739 /* In tree-inline.c */
5741 /* The type of a set of already-visited pointers. Functions for creating
5742 and manipulating it are declared in pointer-set.h */
5743 struct pointer_set_t
;
5745 /* The type of a callback function for walking over tree structure. */
5747 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
5749 /* The type of a callback function that represents a custom walk_tree. */
5751 typedef tree (*walk_tree_lh
) (tree
*, int *, tree (*) (tree
*, int *, void *),
5752 void *, struct pointer_set_t
*);
5754 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
5756 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5758 #define walk_tree(a,b,c,d) \
5759 walk_tree_1 (a, b, c, d, NULL)
5760 #define walk_tree_without_duplicates(a,b,c) \
5761 walk_tree_without_duplicates_1 (a, b, c, NULL)
5764 /* Assign the RTX to declaration. */
5766 extern void set_decl_rtl (tree
, rtx
);
5767 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
5769 /* Enum and arrays used for tree allocation stats.
5770 Keep in sync with tree.c:tree_node_kind_names. */
5792 extern int tree_node_counts
[];
5793 extern int tree_node_sizes
[];
5795 /* True if we are in gimple form and the actions of the folders need to
5796 be restricted. False if we are not in gimple form and folding is not
5797 restricted to creating gimple expressions. */
5798 extern bool in_gimple_form
;
5801 extern tree
get_base_address (tree t
);
5802 extern void mark_addressable (tree
);
5806 struct GTY(()) tree_map_base
{
5810 extern int tree_map_base_eq (const void *, const void *);
5811 extern unsigned int tree_map_base_hash (const void *);
5812 extern int tree_map_base_marked_p (const void *);
5813 extern bool list_equal_p (const_tree
, const_tree
);
5815 /* Map from a tree to another tree. */
5817 struct GTY(()) tree_map
{
5818 struct tree_map_base base
;
5823 #define tree_map_eq tree_map_base_eq
5824 extern unsigned int tree_map_hash (const void *);
5825 #define tree_map_marked_p tree_map_base_marked_p
5827 /* Map from a decl tree to another tree. */
5829 struct GTY(()) tree_decl_map
{
5830 struct tree_map_base base
;
5834 #define tree_decl_map_eq tree_map_base_eq
5835 extern unsigned int tree_decl_map_hash (const void *);
5836 #define tree_decl_map_marked_p tree_map_base_marked_p
5838 /* Map from a tree to an int. */
5840 struct GTY(()) tree_int_map
{
5841 struct tree_map_base base
;
5845 #define tree_int_map_eq tree_map_base_eq
5846 #define tree_int_map_hash tree_map_base_hash
5847 #define tree_int_map_marked_p tree_map_base_marked_p
5849 /* Map from a tree to initialization/finalization priorities. */
5851 struct GTY(()) tree_priority_map
{
5852 struct tree_map_base base
;
5857 #define tree_priority_map_eq tree_map_base_eq
5858 #define tree_priority_map_hash tree_map_base_hash
5859 #define tree_priority_map_marked_p tree_map_base_marked_p
5861 /* Map from a decl tree to a tree vector. */
5863 struct GTY(()) tree_vec_map
{
5864 struct tree_map_base base
;
5868 #define tree_vec_map_eq tree_map_base_eq
5869 #define tree_vec_map_hash tree_decl_map_hash
5870 #define tree_vec_map_marked_p tree_map_base_marked_p
5874 tree
target_for_debug_bind (tree
);
5876 /* In tree-ssa-address.c. */
5877 extern tree
tree_mem_ref_addr (tree
, tree
);
5878 extern void copy_mem_ref_info (tree
, tree
);
5879 extern void copy_ref_info (tree
, tree
);
5882 extern bool ssa_name_nonnegative_p (const_tree
);
5884 /* In tree-object-size.c. */
5885 extern void init_object_sizes (void);
5886 extern void fini_object_sizes (void);
5887 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
5891 /* Determine whether the LEN bytes can be moved by using several move
5892 instructions. Return nonzero if a call to move_by_pieces should
5894 extern int can_move_by_pieces (unsigned HOST_WIDE_INT
, unsigned int);
5896 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
5897 extern tree
build_personality_function (const char *);
5899 /* In trans-mem.c. */
5900 extern tree
build_tm_abort_call (location_t
, bool);
5901 extern bool is_tm_safe (const_tree
);
5902 extern bool is_tm_pure (const_tree
);
5903 extern bool is_tm_may_cancel_outer (tree
);
5904 extern bool is_tm_ending_fndecl (tree
);
5905 extern void record_tm_replacement (tree
, tree
);
5906 extern void tm_malloc_replacement (tree
);
5909 is_tm_safe_or_pure (const_tree x
)
5911 return is_tm_safe (x
) || is_tm_pure (x
);
5914 /* In tree-inline.c. */
5916 void init_inline_once (void);
5918 /* Compute the number of operands in an expression node NODE. For
5919 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5920 otherwise it is looked up from the node's code. */
5922 tree_operand_length (const_tree node
)
5924 if (VL_EXP_CLASS_P (node
))
5925 return VL_EXP_OPERAND_LENGTH (node
);
5927 return TREE_CODE_LENGTH (TREE_CODE (node
));
5930 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5931 have to go towards the end of tree.h so that union tree_node is fully
5932 defined by this point. */
5934 /* Structure containing iterator state. */
5935 typedef struct call_expr_arg_iterator_d
{
5936 tree t
; /* the call_expr */
5937 int n
; /* argument count */
5938 int i
; /* next argument index */
5939 } call_expr_arg_iterator
;
5941 typedef struct const_call_expr_arg_iterator_d
{
5942 const_tree t
; /* the call_expr */
5943 int n
; /* argument count */
5944 int i
; /* next argument index */
5945 } const_call_expr_arg_iterator
;
5947 /* Initialize the abstract argument list iterator object ITER with the
5948 arguments from CALL_EXPR node EXP. */
5950 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5953 iter
->n
= call_expr_nargs (exp
);
5958 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5961 iter
->n
= call_expr_nargs (exp
);
5965 /* Return the next argument from abstract argument list iterator object ITER,
5966 and advance its state. Return NULL_TREE if there are no more arguments. */
5968 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5971 if (iter
->i
>= iter
->n
)
5973 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5978 static inline const_tree
5979 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5982 if (iter
->i
>= iter
->n
)
5984 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5989 /* Initialize the abstract argument list iterator object ITER, then advance
5990 past and return the first argument. Useful in for expressions, e.g.
5991 for (arg = first_call_expr_arg (exp, &iter); arg;
5992 arg = next_call_expr_arg (&iter)) */
5994 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5996 init_call_expr_arg_iterator (exp
, iter
);
5997 return next_call_expr_arg (iter
);
6000 static inline const_tree
6001 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
6003 init_const_call_expr_arg_iterator (exp
, iter
);
6004 return next_const_call_expr_arg (iter
);
6007 /* Test whether there are more arguments in abstract argument list iterator
6008 ITER, without changing its state. */
6010 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
6012 return (iter
->i
< iter
->n
);
6016 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
6018 return (iter
->i
< iter
->n
);
6021 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
6022 (of type call_expr_arg_iterator) to hold the iteration state. */
6023 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
6024 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
6025 (arg) = next_call_expr_arg (&(iter)))
6027 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
6028 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
6029 (arg) = next_const_call_expr_arg (&(iter)))
6031 /* Return true if tree node T is a language-specific node. */
6033 is_lang_specific (tree t
)
6035 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
6038 /* In gimple-low.c. */
6039 extern bool block_may_fallthru (const_tree
);
6042 /* Functional interface to the builtin functions. */
6044 /* The builtin_info structure holds the FUNCTION_DECL of the standard builtin
6045 function, and a flag that says if the function is available implicitly, or
6046 whether the user has to code explicit calls to __builtin_<xxx>. */
6048 typedef struct GTY(()) builtin_info_type_d
{
6049 tree decl
[(int)END_BUILTINS
];
6050 bool implicit_p
[(int)END_BUILTINS
];
6051 } builtin_info_type
;
6053 extern GTY(()) builtin_info_type builtin_info
;
6055 /* Valid builtin number. */
6056 #define BUILTIN_VALID_P(FNCODE) \
6057 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
6059 /* Return the tree node for an explicit standard builtin function or NULL. */
6061 builtin_decl_explicit (enum built_in_function fncode
)
6063 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6065 return builtin_info
.decl
[(size_t)fncode
];
6068 /* Return the tree node for an implicit builtin function or NULL. */
6070 builtin_decl_implicit (enum built_in_function fncode
)
6072 size_t uns_fncode
= (size_t)fncode
;
6073 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6075 if (!builtin_info
.implicit_p
[uns_fncode
])
6078 return builtin_info
.decl
[uns_fncode
];
6081 /* Set explicit builtin function nodes and whether it is an implicit
6085 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
6087 size_t ufncode
= (size_t)fncode
;
6089 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
6090 && (decl
!= NULL_TREE
|| !implicit_p
));
6092 builtin_info
.decl
[ufncode
] = decl
;
6093 builtin_info
.implicit_p
[ufncode
] = implicit_p
;
6096 /* Set the implicit flag for a builtin function. */
6099 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
6101 size_t uns_fncode
= (size_t)fncode
;
6103 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
6104 && builtin_info
.decl
[uns_fncode
] != NULL_TREE
);
6106 builtin_info
.implicit_p
[uns_fncode
] = implicit_p
;
6109 /* Return whether the standard builtin function can be used as an explicit
6113 builtin_decl_explicit_p (enum built_in_function fncode
)
6115 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6116 return (builtin_info
.decl
[(size_t)fncode
] != NULL_TREE
);
6119 /* Return whether the standard builtin function can be used implicitly. */
6122 builtin_decl_implicit_p (enum built_in_function fncode
)
6124 size_t uns_fncode
= (size_t)fncode
;
6126 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6127 return (builtin_info
.decl
[uns_fncode
] != NULL_TREE
6128 && builtin_info
.implicit_p
[uns_fncode
]);
6131 #endif /* GCC_TREE_H */