1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
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
420 fields, and the table below which connects the fields and the
423 struct GTY(()) tree_base
{
424 ENUM_BITFIELD(tree_code
) code
: 16;
426 unsigned side_effects_flag
: 1;
427 unsigned constant_flag
: 1;
428 unsigned addressable_flag
: 1;
429 unsigned volatile_flag
: 1;
430 unsigned readonly_flag
: 1;
431 unsigned asm_written_flag
: 1;
432 unsigned nowarning_flag
: 1;
433 unsigned visited
: 1;
435 unsigned used_flag
: 1;
436 unsigned nothrow_flag
: 1;
437 unsigned static_flag
: 1;
438 unsigned public_flag
: 1;
439 unsigned private_flag
: 1;
440 unsigned protected_flag
: 1;
441 unsigned deprecated_flag
: 1;
442 unsigned default_def_flag
: 1;
445 /* The bits in the following structure should only be used with
446 accessor macros that constrain inputs with tree checking. */
448 unsigned lang_flag_0
: 1;
449 unsigned lang_flag_1
: 1;
450 unsigned lang_flag_2
: 1;
451 unsigned lang_flag_3
: 1;
452 unsigned lang_flag_4
: 1;
453 unsigned lang_flag_5
: 1;
454 unsigned lang_flag_6
: 1;
455 unsigned saturating_flag
: 1;
457 unsigned unsigned_flag
: 1;
458 unsigned packed_flag
: 1;
459 unsigned user_align
: 1;
460 unsigned nameless_flag
: 1;
465 /* This field is only used with TREE_TYPE nodes; the only reason it is
466 present in tree_base instead of tree_type is to save space. The size
467 of the field must be large enough to hold addr_space_t values. */
468 unsigned address_space
: 8;
470 /* The following fields are present in tree_base to save space. The
471 nodes using them do not require any of the flags above and so can
472 make better use of the 4-byte sized word. */
473 /* VEC length. This field is only used with TREE_VEC. */
475 /* SSA version number. This field is only used with SSA_NAME. */
476 unsigned int version
;
480 /* The following table lists the uses of each of the above flags and
481 for which types of nodes they are defined.
486 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL
489 CONSTRUCTOR, IDENTIFIER_NODE
492 CALL_EXPR_TAILCALL in
498 PREDICT_EXPR_OUTCOME in
504 VAR_DECL, FUNCTION_DECL
507 TREE_NO_TRAMPOLINE in
513 TREE_SYMBOL_REFERENCED in
517 TARGET_EXPR, WITH_CLEANUP_EXPR
519 TRY_CATCH_IS_CLEANUP in
525 TYPE_REF_CAN_ALIAS_ALL in
526 POINTER_TYPE, REFERENCE_TYPE
534 TRANSACTION_EXPR_OUTER in
540 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
543 VAR_DECL, FUNCTION_DECL
549 CALL_EXPR_VA_ARG_PACK in
552 TYPE_CACHED_VALUES_P in
555 SAVE_EXPR_RESOLVED_P in
558 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
559 OMP_CLAUSE_LASTPRIVATE
561 OMP_CLAUSE_PRIVATE_DEBUG in
564 TRANSACTION_EXPR_RELAXED in
572 CALL_EXPR_RETURN_SLOT_OPT in
578 OMP_PARALLEL_COMBINED in
581 OMP_CLAUSE_PRIVATE_OUTER_REF in
584 TYPE_REF_IS_RVALUE in
596 CALL_FROM_THUNK_P and
597 CALL_ALLOCA_FOR_VAR_P in
612 TREE_THIS_VOLATILE in
635 TYPE_SIZES_GIMPLIFIED in
649 VAR_DECL, FUNCTION_DECL, TYPE_DECL
650 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
653 SSA_NAME_OCCURS_IN_ABNORMAL_PHI in
673 INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, ARRAY_RANGE_REF
675 SSA_NAME_IN_FREELIST in
684 IDENTIFIER_TRANSPARENT_ALIAS in
690 all trees (used liberally by many passes)
697 VAR_DECL_IS_VIRTUAL_OPERAND in
711 TYPE_VECTOR_OPAQUE in
714 SSA_NAME_IS_DEFAULT_DEF in
717 DECL_NONLOCAL_FRAME in
721 struct GTY(()) tree_typed
{
722 struct tree_base base
;
726 struct GTY(()) tree_common
{
727 struct tree_typed typed
;
732 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
733 enum tree_node_structure_enum
{
734 #include "treestruct.def"
739 /* Define accessors for the fields that all tree nodes have
740 (though some fields are not used for all kinds of nodes). */
742 /* The tree-code says what kind of node it is.
743 Codes are defined in tree.def. */
744 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
745 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
747 /* When checking is enabled, errors will be generated if a tree node
748 is accessed incorrectly. The macros die with a fatal error. */
749 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
751 #define TREE_CHECK(T, CODE) \
752 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
754 #define TREE_NOT_CHECK(T, CODE) \
755 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
757 #define TREE_CHECK2(T, CODE1, CODE2) \
758 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
760 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
761 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
763 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
764 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
766 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
767 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
768 (CODE1), (CODE2), (CODE3)))
770 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
771 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
772 (CODE1), (CODE2), (CODE3), (CODE4)))
774 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
775 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
776 (CODE1), (CODE2), (CODE3), (CODE4)))
778 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
779 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
780 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
782 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
783 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
784 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
786 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
787 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
789 #define TREE_CLASS_CHECK(T, CLASS) \
790 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
792 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
793 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
795 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
796 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
798 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
799 (omp_clause_range_check ((T), (CODE1), (CODE2), \
800 __FILE__, __LINE__, __FUNCTION__))
802 /* These checks have to be special cased. */
803 #define EXPR_CHECK(T) \
804 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
806 /* These checks have to be special cased. */
807 #define NON_TYPE_CHECK(T) \
808 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
810 #define TREE_VEC_ELT_CHECK(T, I) \
811 (*(CONST_CAST2 (tree *, typeof (T)*, \
812 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
814 #define OMP_CLAUSE_ELT_CHECK(T, I) \
815 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
817 /* Special checks for TREE_OPERANDs. */
818 #define TREE_OPERAND_CHECK(T, I) \
819 (*(CONST_CAST2 (tree*, typeof (T)*, \
820 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
822 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
823 (*(tree_operand_check_code ((T), (CODE), (I), \
824 __FILE__, __LINE__, __FUNCTION__)))
826 /* Nodes are chained together for many purposes.
827 Types are chained together to record them for being output to the debugger
828 (see the function `chain_type').
829 Decls in the same scope are chained together to record the contents
831 Statement nodes for successive statements used to be chained together.
832 Often lists of things are represented by TREE_LIST nodes that
833 are chained together. */
835 #define TREE_CHAIN(NODE) \
836 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
838 /* In all nodes that are expressions, this is the data type of the expression.
839 In POINTER_TYPE nodes, this is the type that the pointer points to.
840 In ARRAY_TYPE nodes, this is the type of the elements.
841 In VECTOR_TYPE nodes, this is the type of the elements. */
842 #define TREE_TYPE(NODE) \
843 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
845 extern void tree_contains_struct_check_failed (const_tree
,
846 const enum tree_node_structure_enum
,
847 const char *, int, const char *)
850 extern void tree_check_failed (const_tree
, const char *, int, const char *,
851 ...) ATTRIBUTE_NORETURN
;
852 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
853 ...) ATTRIBUTE_NORETURN
;
854 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
855 const char *, int, const char *)
857 extern void tree_range_check_failed (const_tree
, const char *, int,
858 const char *, enum tree_code
,
861 extern void tree_not_class_check_failed (const_tree
,
862 const enum tree_code_class
,
863 const char *, int, const char *)
865 extern void tree_vec_elt_check_failed (int, int, const char *,
868 extern void phi_node_elt_check_failed (int, int, const char *,
871 extern void tree_operand_check_failed (int, const_tree
,
872 const char *, int, const char *)
874 extern void omp_clause_check_failed (const_tree
, const char *, int,
875 const char *, enum omp_clause_code
)
877 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
880 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
881 const char *, enum omp_clause_code
,
882 enum omp_clause_code
)
885 #else /* not ENABLE_TREE_CHECKING, or not gcc */
887 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
888 #define TREE_CHECK(T, CODE) (T)
889 #define TREE_NOT_CHECK(T, CODE) (T)
890 #define TREE_CHECK2(T, CODE1, CODE2) (T)
891 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
892 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
893 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
894 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
895 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
896 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
897 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
898 #define TREE_CLASS_CHECK(T, CODE) (T)
899 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
900 #define EXPR_CHECK(T) (T)
901 #define NON_TYPE_CHECK(T) (T)
902 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
903 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
904 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
905 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
906 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
907 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
909 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
910 #define TREE_TYPE(NODE) ((NODE)->typed.type)
914 #define TREE_BLOCK(NODE) (tree_block (NODE))
915 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
917 #include "tree-check.h"
919 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
920 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
921 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
922 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
923 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
924 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
925 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
926 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
927 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
928 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
929 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
931 #define RECORD_OR_UNION_CHECK(T) \
932 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
933 #define NOT_RECORD_OR_UNION_CHECK(T) \
934 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
936 #define NUMERICAL_TYPE_CHECK(T) \
937 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
940 /* Here is how primitive or already-canonicalized types' hash codes
942 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
944 /* A simple hash function for an arbitrary tree node. This must not be
945 used in hash tables which are saved to a PCH. */
946 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
948 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
949 #define CONVERT_EXPR_CODE_P(CODE) \
950 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
952 /* Similarly, but accept an expressions instead of a tree code. */
953 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
955 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
957 #define CASE_CONVERT \
961 /* Given an expression as a tree, strip any conversion that generates
962 no instruction. Accepts both tree and const_tree arguments since
963 we are not modifying the tree itself. */
965 #define STRIP_NOPS(EXP) \
966 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
968 /* Like STRIP_NOPS, but don't let the signedness change either. */
970 #define STRIP_SIGN_NOPS(EXP) \
971 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
973 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
975 #define STRIP_TYPE_NOPS(EXP) \
976 while ((CONVERT_EXPR_P (EXP) \
977 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
978 && TREE_OPERAND (EXP, 0) != error_mark_node \
979 && (TREE_TYPE (EXP) \
980 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
981 (EXP) = TREE_OPERAND (EXP, 0)
983 /* Remove unnecessary type conversions according to
984 tree_ssa_useless_type_conversion. */
986 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
987 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
989 /* Nonzero if TYPE represents an integral type. Note that we do not
990 include COMPLEX types here. Keep these checks in ascending code
993 #define INTEGRAL_TYPE_P(TYPE) \
994 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
995 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
996 || TREE_CODE (TYPE) == INTEGER_TYPE)
998 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1000 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1001 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1003 /* Nonzero if TYPE represents a saturating fixed-point type. */
1005 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1006 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1008 /* Nonzero if TYPE represents a fixed-point type. */
1010 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1012 /* Nonzero if TYPE represents a scalar floating-point type. */
1014 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1016 /* Nonzero if TYPE represents a complex floating-point type. */
1018 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1019 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1020 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1022 /* Nonzero if TYPE represents a vector integer type. */
1024 #define VECTOR_INTEGER_TYPE_P(TYPE) \
1025 (TREE_CODE (TYPE) == VECTOR_TYPE \
1026 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
1029 /* Nonzero if TYPE represents a vector floating-point type. */
1031 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1032 (TREE_CODE (TYPE) == VECTOR_TYPE \
1033 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1035 /* Nonzero if TYPE represents a floating-point type, including complex
1036 and vector floating-point types. The vector and complex check does
1037 not use the previous two macros to enable early folding. */
1039 #define FLOAT_TYPE_P(TYPE) \
1040 (SCALAR_FLOAT_TYPE_P (TYPE) \
1041 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1042 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1043 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1045 /* Nonzero if TYPE represents a decimal floating-point type. */
1046 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1047 (SCALAR_FLOAT_TYPE_P (TYPE) \
1048 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1050 /* Nonzero if TYPE is a record or union type. */
1051 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1052 (TREE_CODE (TYPE) == RECORD_TYPE \
1053 || TREE_CODE (TYPE) == UNION_TYPE \
1054 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1056 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1057 Keep these checks in ascending code order. */
1059 #define AGGREGATE_TYPE_P(TYPE) \
1060 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1062 /* Nonzero if TYPE represents a pointer or reference type.
1063 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1064 ascending code order. */
1066 #define POINTER_TYPE_P(TYPE) \
1067 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1069 /* Nonzero if TYPE represents a pointer to function. */
1070 #define FUNCTION_POINTER_TYPE_P(TYPE) \
1071 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
1073 /* Nonzero if this type is a complete type. */
1074 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1076 /* Nonzero if this type is the (possibly qualified) void type. */
1077 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1079 /* Nonzero if this type is complete or is cv void. */
1080 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1081 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1083 /* Nonzero if this type is complete or is an array with unspecified bound. */
1084 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1085 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1088 /* Define many boolean fields that all tree nodes have. */
1090 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
1091 of this is needed. So it cannot be in a register.
1092 In a FUNCTION_DECL it has no meaning.
1093 In LABEL_DECL nodes, it means a goto for this label has been seen
1094 from a place outside all binding contours that restore stack levels.
1095 In an artificial SSA_NAME that points to a stack partition with at least
1096 two variables, it means that at least one variable has TREE_ADDRESSABLE.
1097 In ..._TYPE nodes, it means that objects of this type must be fully
1098 addressable. This means that pieces of this object cannot go into
1099 register parameters, for example. If this a function type, this
1100 means that the value must be returned in memory.
1101 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1102 In IDENTIFIER_NODEs, this means that some extern decl for this name
1103 had its address taken. That matters for inline functions.
1104 In a STMT_EXPR, it means we want the result of the enclosed expression. */
1105 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1107 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1108 exit of a function. Calls for which this is true are candidates for tail
1109 call optimizations. */
1110 #define CALL_EXPR_TAILCALL(NODE) \
1111 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1113 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1114 CASE_LOW operand has been processed. */
1115 #define CASE_LOW_SEEN(NODE) \
1116 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1118 #define PREDICT_EXPR_OUTCOME(NODE) \
1119 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1120 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1121 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1122 #define PREDICT_EXPR_PREDICTOR(NODE) \
1123 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1125 /* In a VAR_DECL, nonzero means allocate static storage.
1126 In a FUNCTION_DECL, nonzero if function has been defined.
1127 In a CONSTRUCTOR, nonzero means allocate static storage. */
1128 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1130 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1131 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1133 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1134 should only be executed if an exception is thrown, not on normal exit
1136 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1138 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1139 separate cleanup in honor_protect_cleanup_actions. */
1140 #define TRY_CATCH_IS_CLEANUP(NODE) \
1141 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1143 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1144 CASE_HIGH operand has been processed. */
1145 #define CASE_HIGH_SEEN(NODE) \
1146 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1148 /* Used to mark scoped enums. */
1149 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
1151 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
1152 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
1154 /* In an expr node (usually a conversion) this means the node was made
1155 implicitly and should not lead to any sort of warning. In a decl node,
1156 warnings concerning the decl should be suppressed. This is used at
1157 least for used-before-set warnings, and it set after one warning is
1159 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1161 /* Used to indicate that this TYPE represents a compiler-generated entity. */
1162 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
1164 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1165 this string as an argument. */
1166 #define TREE_SYMBOL_REFERENCED(NODE) \
1167 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1169 /* Nonzero in a pointer or reference type means the data pointed to
1170 by this type can alias anything. */
1171 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1172 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1174 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1175 there was an overflow in folding. */
1177 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1179 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1181 #define TREE_OVERFLOW_P(EXPR) \
1182 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1184 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1185 nonzero means name is to be accessible from outside this translation unit.
1186 In an IDENTIFIER_NODE, nonzero means an external declaration
1187 accessible from outside this translation unit was previously seen
1188 for this name in an inner scope. */
1189 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1191 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1192 of cached values, or is something else. */
1193 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1195 /* In a SAVE_EXPR, indicates that the original expression has already
1196 been substituted with a VAR_DECL that contains the value. */
1197 #define SAVE_EXPR_RESOLVED_P(NODE) \
1198 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1200 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1202 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1203 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1205 /* In any expression, decl, or constant, nonzero means it has side effects or
1206 reevaluation of the whole expression could produce a different value.
1207 This is set if any subexpression is a function call, a side effect or a
1208 reference to a volatile variable. In a ..._DECL, this is set only if the
1209 declaration said `volatile'. This will never be set for a constant. */
1210 #define TREE_SIDE_EFFECTS(NODE) \
1211 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1213 /* In a LABEL_DECL, nonzero means this label had its address taken
1214 and therefore can never be deleted and is a jump target for
1216 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1218 /* Nonzero means this expression is volatile in the C sense:
1219 its address should be of type `volatile WHATEVER *'.
1220 In other words, the declared item is volatile qualified.
1221 This is used in _DECL nodes and _REF nodes.
1222 On a FUNCTION_DECL node, this means the function does not
1223 return normally. This is the same effect as setting
1224 the attribute noreturn on the function in C.
1226 In a ..._TYPE node, means this type is volatile-qualified.
1227 But use TYPE_VOLATILE instead of this macro when the node is a type,
1228 because eventually we may make that a different bit.
1230 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1231 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1233 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1234 accessing the memory pointed to won't generate a trap. However,
1235 this only applies to an object when used appropriately: it doesn't
1236 mean that writing a READONLY mem won't trap.
1238 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1239 (or slice of the array) always belongs to the range of the array.
1240 I.e. that the access will not trap, provided that the access to
1241 the base to the array will not trap. */
1242 #define TREE_THIS_NOTRAP(NODE) \
1243 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
1244 ARRAY_RANGE_REF)->base.nothrow_flag)
1246 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1247 nonzero means it may not be the lhs of an assignment.
1248 Nonzero in a FUNCTION_DECL means this function should be treated
1249 as "const" function (can only read its arguments). */
1250 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1252 /* Value of expression is constant. Always on in all ..._CST nodes. May
1253 also appear in an expression or decl where the value is constant. */
1254 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1256 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1257 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1258 (TYPE_CHECK (NODE)->base.constant_flag)
1260 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1261 #define DECL_UNSIGNED(NODE) \
1262 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
1264 /* In integral and pointer types, means an unsigned type. */
1265 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
1267 /* True if overflow wraps around for the given integral type. That
1268 is, TYPE_MAX + 1 == TYPE_MIN. */
1269 #define TYPE_OVERFLOW_WRAPS(TYPE) \
1270 (TYPE_UNSIGNED (TYPE) || flag_wrapv)
1272 /* True if overflow is undefined for the given integral type. We may
1273 optimize on the assumption that values in the type never overflow.
1275 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
1276 must issue a warning based on warn_strict_overflow. In some cases
1277 it will be appropriate to issue the warning immediately, and in
1278 other cases it will be appropriate to simply set a flag and let the
1279 caller decide whether a warning is appropriate or not. */
1280 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
1281 (!TYPE_UNSIGNED (TYPE) && !flag_wrapv && !flag_trapv && flag_strict_overflow)
1283 /* True if overflow for the given integral type should issue a
1285 #define TYPE_OVERFLOW_TRAPS(TYPE) \
1286 (!TYPE_UNSIGNED (TYPE) && flag_trapv)
1288 /* True if pointer types have undefined overflow. */
1289 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
1291 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1292 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1293 This is interesting in an inline function, since it might not need
1294 to be compiled separately.
1295 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
1296 or TYPE_DECL if the debugging info for the type has been written.
1297 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1298 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1300 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1302 /* Nonzero in a _DECL if the name is used in its scope.
1303 Nonzero in an expr node means inhibit warning if value is unused.
1304 In IDENTIFIER_NODEs, this means that some extern decl for this name
1306 In a BLOCK, this means that the block contains variables that are used. */
1307 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1309 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
1310 throw an exception. In a CALL_EXPR, nonzero means the call cannot
1311 throw. We can't easily check the node type here as the C++
1312 frontend also uses this flag (for AGGR_INIT_EXPR). */
1313 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1315 /* In a CALL_EXPR, means that it's safe to use the target of the call
1316 expansion as the return slot for a call that returns in memory. */
1317 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1318 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1320 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1321 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1323 #define DECL_BY_REFERENCE(NODE) \
1324 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1325 RESULT_DECL)->decl_common.decl_by_reference_flag)
1327 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1328 can be used as restricted tag to disambiguate against other restrict
1329 pointers. Used by fortran to capture something like non-addressability
1330 (which it isn't really because the middle-end does take addresses of
1332 #define DECL_RESTRICTED_P(NODE) \
1333 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1334 RESULT_DECL)->decl_common.decl_restricted_flag)
1336 #define DECL_READ_P(NODE) \
1337 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1339 #define DECL_NONSHAREABLE(NODE) \
1340 (TREE_CHECK2 (NODE, VAR_DECL, \
1341 RESULT_DECL)->decl_common.decl_nonshareable_flag)
1343 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1344 thunked-to function. */
1345 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1347 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
1348 it has been built for the declaration of a variable-sized object. */
1349 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
1350 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1352 /* In a type, nonzero means that all objects of the type are guaranteed by the
1353 language or front-end to be properly aligned, so we can indicate that a MEM
1354 of this type is aligned at least to the alignment of the type, even if it
1355 doesn't appear that it is. We see this, for example, in object-oriented
1356 languages where a tag field may show this is an object of a more-aligned
1357 variant of the more generic type.
1359 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1361 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1363 /* Used in classes in C++. */
1364 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1365 /* Used in classes in C++. */
1366 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1368 /* True if reference type NODE is a C++ rvalue reference. */
1369 #define TYPE_REF_IS_RVALUE(NODE) \
1370 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1372 /* Nonzero in a _DECL if the use of the name is defined as a
1373 deprecated feature by __attribute__((deprecated)). */
1374 #define TREE_DEPRECATED(NODE) \
1375 ((NODE)->base.deprecated_flag)
1377 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1378 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1379 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1380 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1382 /* In fixed-point types, means a saturating type. */
1383 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
1385 /* These flags are available for each language front end to use internally. */
1386 #define TREE_LANG_FLAG_0(NODE) \
1387 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
1388 #define TREE_LANG_FLAG_1(NODE) \
1389 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
1390 #define TREE_LANG_FLAG_2(NODE) \
1391 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
1392 #define TREE_LANG_FLAG_3(NODE) \
1393 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
1394 #define TREE_LANG_FLAG_4(NODE) \
1395 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
1396 #define TREE_LANG_FLAG_5(NODE) \
1397 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
1398 #define TREE_LANG_FLAG_6(NODE) \
1399 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
1401 /* Define additional fields and accessors for nodes representing constants. */
1403 /* In an INTEGER_CST node. These two together make a 2-word integer.
1404 If the data type is signed, the value is sign-extended to 2 words
1405 even though not all of them may really be in use.
1406 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1407 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1408 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1409 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1411 #define INT_CST_LT(A, B) \
1412 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1413 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1414 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1416 #define INT_CST_LT_UNSIGNED(A, B) \
1417 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1418 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1419 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1420 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1421 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1423 struct GTY(()) tree_int_cst
{
1424 struct tree_typed typed
;
1428 /* In a REAL_CST node. struct real_value is an opaque entity, with
1429 manipulators defined in real.h. We don't want tree.h depending on
1430 real.h and transitively on tm.h. */
1433 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1434 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1436 struct GTY(()) tree_real_cst
{
1437 struct tree_typed typed
;
1438 struct real_value
* real_cst_ptr
;
1441 /* In a FIXED_CST node. */
1444 #define TREE_FIXED_CST_PTR(NODE) \
1445 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1446 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1448 struct GTY(()) tree_fixed_cst
{
1449 struct tree_typed typed
;
1450 struct fixed_value
* fixed_cst_ptr
;
1453 /* In a STRING_CST */
1454 /* In C terms, this is sizeof, not strlen. */
1455 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1456 #define TREE_STRING_POINTER(NODE) \
1457 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1459 struct GTY(()) tree_string
{
1460 struct tree_typed typed
;
1465 /* In a COMPLEX_CST node. */
1466 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1467 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1469 struct GTY(()) tree_complex
{
1470 struct tree_typed typed
;
1475 /* In a VECTOR_CST node. */
1476 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1477 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
1478 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
1480 struct GTY(()) tree_vector
{
1481 struct tree_typed typed
;
1482 tree
GTY ((length ("TYPE_VECTOR_SUBPARTS (TREE_TYPE ((tree)&%h))"))) elts
[1];
1487 /* Define fields and accessors for some special-purpose tree nodes. */
1489 #define IDENTIFIER_LENGTH(NODE) \
1490 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1491 #define IDENTIFIER_POINTER(NODE) \
1492 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1493 #define IDENTIFIER_HASH_VALUE(NODE) \
1494 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1496 /* Translate a hash table identifier pointer to a tree_identifier
1497 pointer, and vice versa. */
1499 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1500 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1501 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1503 struct GTY(()) tree_identifier
{
1504 struct tree_common common
;
1505 struct ht_identifier id
;
1508 /* In a TREE_LIST node. */
1509 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1510 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1512 struct GTY(()) tree_list
{
1513 struct tree_common common
;
1518 /* In a TREE_VEC node. */
1519 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1520 #define TREE_VEC_END(NODE) \
1521 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1523 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1525 struct GTY(()) tree_vec
{
1526 struct tree_common common
;
1527 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
1530 /* In a CONSTRUCTOR node. */
1531 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1532 #define CONSTRUCTOR_ELT(NODE,IDX) \
1533 (&VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1534 #define CONSTRUCTOR_NELTS(NODE) \
1535 (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1537 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1538 value of each element (stored within VAL). IX must be a scratch variable
1539 of unsigned integer type. */
1540 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1541 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1543 : ((VAL = VEC_index (constructor_elt, V, IX).value), \
1547 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1548 the value of each element (stored within VAL) and its index (stored
1549 within INDEX). IX must be a scratch variable of unsigned integer type. */
1550 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1551 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1553 : (((void) (VAL = VEC_index (constructor_elt, V, IX).value)), \
1554 (INDEX = VEC_index (constructor_elt, V, IX).index), \
1558 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1559 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1561 constructor_elt _ce___ = {INDEX, VALUE}; \
1562 VEC_safe_push (constructor_elt, gc, V, _ce___); \
1565 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1566 constructor output purposes. */
1567 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1568 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1570 /* True if NODE is a clobber right hand side, an expression of indeterminate
1571 value that clobbers the LHS in a copy instruction. We use a volatile
1572 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1573 In particular the volatile flag causes us to not prematurely remove
1574 such clobber instructions. */
1575 #define TREE_CLOBBER_P(NODE) \
1576 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1578 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1579 element. INDEX can optionally design the position of VALUE: in arrays,
1580 it is the index where VALUE has to be placed; in structures, it is the
1581 FIELD_DECL of the member. */
1582 typedef struct GTY(()) constructor_elt_d
{
1587 DEF_VEC_O(constructor_elt
);
1588 DEF_VEC_ALLOC_O(constructor_elt
,gc
);
1590 struct GTY(()) tree_constructor
{
1591 struct tree_typed typed
;
1592 VEC(constructor_elt
,gc
) *elts
;
1595 /* Define fields and accessors for some nodes that represent expressions. */
1597 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1598 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1599 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1600 && integer_zerop (TREE_OPERAND (NODE, 0)))
1602 /* In ordinary expression nodes. */
1603 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1604 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1606 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1607 length. Its value includes the length operand itself; that is,
1608 the minimum valid length is 1.
1609 Note that we have to bypass the use of TREE_OPERAND to access
1610 that field to avoid infinite recursion in expanding the macros. */
1611 #define VL_EXP_OPERAND_LENGTH(NODE) \
1612 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1614 /* Nonzero if is_gimple_debug() may possibly hold. */
1615 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1617 /* In a LOOP_EXPR node. */
1618 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1620 /* The source location of this expression. Non-tree_exp nodes such as
1621 decls and constants can be shared among multiple locations, so
1623 #define EXPR_LOCATION(NODE) \
1624 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1625 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1626 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1627 != UNKNOWN_LOCATION)
1628 /* The location to be used in a diagnostic about this expression. Do not
1629 use this macro if the location will be assigned to other expressions. */
1630 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) \
1631 ? (NODE)->exp.locus : input_location)
1632 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1633 ? (NODE)->exp.locus : (LOCUS))
1634 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1635 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1637 /* True if a tree is an expression or statement that can have a
1639 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1641 extern void protected_set_expr_location (tree
, location_t
);
1643 /* In a TARGET_EXPR node. */
1644 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1645 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1646 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1648 /* DECL_EXPR accessor. This gives access to the DECL associated with
1649 the given declaration statement. */
1650 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1652 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1654 /* COMPOUND_LITERAL_EXPR accessors. */
1655 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1656 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1657 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1658 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1660 /* SWITCH_EXPR accessors. These give access to the condition, body and
1661 original condition type (before any compiler conversions)
1662 of the switch statement, respectively. */
1663 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1664 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1665 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1667 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1668 of a case label, respectively. */
1669 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1670 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1671 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1672 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1674 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1675 corresponding MEM_REF operands. */
1676 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1677 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1678 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1679 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1680 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1682 /* The operands of a BIND_EXPR. */
1683 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1684 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1685 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1687 /* GOTO_EXPR accessor. This gives access to the label associated with
1688 a goto statement. */
1689 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1691 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1692 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1693 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1695 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1696 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1697 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1698 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1699 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1700 /* Nonzero if we want to create an ASM_INPUT instead of an
1701 ASM_OPERAND with no operands. */
1702 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1703 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1705 /* COND_EXPR accessors. */
1706 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1707 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1708 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1710 /* Accessors for the chains of recurrences. */
1711 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1712 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1713 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1714 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1716 /* LABEL_EXPR accessor. This gives access to the label associated with
1717 the given label expression. */
1718 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1720 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1721 accessors for SSA operands. */
1723 /* CATCH_EXPR accessors. */
1724 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1725 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1727 /* EH_FILTER_EXPR accessors. */
1728 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1729 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1731 /* OBJ_TYPE_REF accessors. */
1732 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1733 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1734 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1736 /* ASSERT_EXPR accessors. */
1737 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1738 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1740 /* CALL_EXPR accessors.
1742 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1743 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1744 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1745 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1747 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1748 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1749 the argument count is zero when checking is enabled. Instead, do
1750 the pointer arithmetic to advance past the 3 fixed operands in a
1751 CALL_EXPR. That produces a valid pointer to just past the end of the
1752 operand array, even if it's not valid to dereference it. */
1753 #define CALL_EXPR_ARGP(NODE) \
1754 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1756 /* TM directives and accessors. */
1757 #define TRANSACTION_EXPR_BODY(NODE) \
1758 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1759 #define TRANSACTION_EXPR_OUTER(NODE) \
1760 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1761 #define TRANSACTION_EXPR_RELAXED(NODE) \
1762 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1764 /* OpenMP directive and clause accessors. */
1766 #define OMP_BODY(NODE) \
1767 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1768 #define OMP_CLAUSES(NODE) \
1769 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1771 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1772 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1774 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1775 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1777 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1778 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1779 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1781 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1782 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1783 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1784 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1785 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1786 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1788 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1789 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1791 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1793 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1794 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1796 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1798 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1800 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1801 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1803 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1804 #define OMP_CLAUSE_DECL(NODE) \
1805 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1806 OMP_CLAUSE_PRIVATE, \
1807 OMP_CLAUSE_COPYPRIVATE), 0)
1808 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1809 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1810 != UNKNOWN_LOCATION)
1811 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1813 /* True on an OMP_SECTION statement that was the last lexical member.
1814 This status is meaningful in the implementation of lastprivate. */
1815 #define OMP_SECTION_LAST(NODE) \
1816 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1818 /* True on an OMP_PARALLEL statement if it represents an explicit
1819 combined parallel work-sharing constructs. */
1820 #define OMP_PARALLEL_COMBINED(NODE) \
1821 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1823 /* True on a PRIVATE clause if its decl is kept around for debugging
1824 information only and its DECL_VALUE_EXPR is supposed to point
1825 to what it has been remapped to. */
1826 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1827 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1829 /* True on a PRIVATE clause if ctor needs access to outer region's
1831 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1832 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1834 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1835 decl is present in the chain. */
1836 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1837 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1838 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1839 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1840 OMP_CLAUSE_LASTPRIVATE),\
1842 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1843 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1845 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1846 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1847 #define OMP_CLAUSE_IF_EXPR(NODE) \
1848 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1849 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1850 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1851 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1852 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1854 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1855 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1856 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1857 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1858 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1859 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1861 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1862 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1863 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1864 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1865 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1866 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1867 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1868 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1869 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1870 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1871 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1872 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1874 enum omp_clause_schedule_kind
1876 OMP_CLAUSE_SCHEDULE_STATIC
,
1877 OMP_CLAUSE_SCHEDULE_DYNAMIC
,
1878 OMP_CLAUSE_SCHEDULE_GUIDED
,
1879 OMP_CLAUSE_SCHEDULE_AUTO
,
1880 OMP_CLAUSE_SCHEDULE_RUNTIME
1883 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1884 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1886 enum omp_clause_default_kind
1888 OMP_CLAUSE_DEFAULT_UNSPECIFIED
,
1889 OMP_CLAUSE_DEFAULT_SHARED
,
1890 OMP_CLAUSE_DEFAULT_NONE
,
1891 OMP_CLAUSE_DEFAULT_PRIVATE
,
1892 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1895 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1896 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1898 struct GTY(()) tree_exp
{
1899 struct tree_typed typed
;
1901 tree
GTY ((special ("tree_exp"),
1902 desc ("TREE_CODE ((tree) &%0)")))
1906 /* SSA_NAME accessors. */
1908 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1909 if there is no name associated with it. */
1910 #define SSA_NAME_IDENTIFIER(NODE) \
1911 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1912 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1913 ? (NODE)->ssa_name.var \
1914 : DECL_NAME ((NODE)->ssa_name.var)) \
1917 /* Returns the variable being referenced. This can be NULL_TREE for
1918 temporaries not associated with any user variable.
1919 Once released, this is the only field that can be relied upon. */
1920 #define SSA_NAME_VAR(NODE) \
1921 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1922 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1923 ? NULL_TREE : (NODE)->ssa_name.var)
1925 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1926 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1928 /* Returns the statement which defines this SSA name. */
1929 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1931 /* Returns the SSA version number of this SSA name. Note that in
1932 tree SSA, version numbers are not per variable and may be recycled. */
1933 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1935 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1936 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1938 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1939 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1941 /* Nonzero if this SSA_NAME expression is currently on the free list of
1942 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1943 has no meaning for an SSA_NAME. */
1944 #define SSA_NAME_IN_FREE_LIST(NODE) \
1945 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1947 /* Nonzero if this SSA_NAME is the default definition for the
1948 underlying symbol. A default SSA name is created for symbol S if
1949 the very first reference to S in the function is a read operation.
1950 Default definitions are always created by an empty statement and
1951 belong to no basic block. */
1952 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1953 SSA_NAME_CHECK (NODE)->base.default_def_flag
1955 /* Attributes for SSA_NAMEs for pointer-type variables. */
1956 #define SSA_NAME_PTR_INFO(N) \
1957 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1959 /* Defined in tree-flow.h. */
1960 struct ptr_info_def
;
1962 /* Immediate use linking structure. This structure is used for maintaining
1963 a doubly linked list of uses of an SSA_NAME. */
1964 typedef struct GTY(()) ssa_use_operand_d
{
1965 struct ssa_use_operand_d
* GTY((skip(""))) prev
;
1966 struct ssa_use_operand_d
* GTY((skip(""))) next
;
1967 /* Immediate uses for a given SSA name are maintained as a cyclic
1968 list. To recognize the root of this list, the location field
1969 needs to point to the original SSA name. Since statements and
1970 SSA names are of different data types, we need this union. See
1971 the explanation in struct immediate_use_iterator_d. */
1972 union { gimple stmt
; tree ssa_name
; } GTY((skip(""))) loc
;
1973 tree
*GTY((skip(""))) use
;
1974 } ssa_use_operand_t
;
1976 /* Return the immediate_use information for an SSA_NAME. */
1977 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1979 struct GTY(()) tree_ssa_name
{
1980 struct tree_typed typed
;
1982 /* _DECL wrapped by this SSA name. */
1985 /* Statement that defines this SSA name. */
1988 /* Pointer attributes used for alias analysis. */
1989 struct ptr_info_def
*ptr_info
;
1991 /* Immediate uses list for this SSA_NAME. */
1992 struct ssa_use_operand_d imm_uses
;
1995 struct GTY(()) phi_arg_d
{
1996 /* imm_use MUST be the first element in struct because we do some
1997 pointer arithmetic with it. See phi_arg_index_from_use. */
1998 struct ssa_use_operand_d imm_use
;
2004 #define OMP_CLAUSE_CODE(NODE) \
2005 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2007 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2008 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2010 #define OMP_CLAUSE_CODE(NODE) \
2011 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2013 #define OMP_CLAUSE_OPERAND(NODE, I) \
2014 OMP_CLAUSE_ELT_CHECK (NODE, I)
2016 struct GTY(()) tree_omp_clause
{
2017 struct tree_common common
;
2019 enum omp_clause_code code
;
2020 union omp_clause_subcode
{
2021 enum omp_clause_default_kind default_kind
;
2022 enum omp_clause_schedule_kind schedule_kind
;
2023 enum tree_code reduction_code
;
2024 } GTY ((skip
)) subcode
;
2026 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
2028 gimple_seq gimple_reduction_init
;
2029 gimple_seq gimple_reduction_merge
;
2031 tree
GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops
[1];
2035 /* In a BLOCK node. */
2036 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2037 #define BLOCK_NONLOCALIZED_VARS(NODE) \
2038 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2039 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2040 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
2041 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \
2042 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
2043 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2044 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2045 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
2046 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2047 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
2049 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
2050 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
2052 /* An index number for this block. These values are not guaranteed to
2053 be unique across functions -- whether or not they are depends on
2054 the debugging output format in use. */
2055 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2057 /* If block reordering splits a lexical block into discontiguous
2058 address ranges, we'll make a copy of the original block.
2060 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2061 In that case, we have one source block that has been replicated
2062 (through inlining or unrolling) into many logical blocks, and that
2063 these logical blocks have different physical variables in them.
2065 In this case, we have one logical block split into several
2066 non-contiguous address ranges. Most debug formats can't actually
2067 represent this idea directly, so we fake it by creating multiple
2068 logical blocks with the same variables in them. However, for those
2069 that do support non-contiguous regions, these allow the original
2070 logical block to be reconstructed, along with the set of address
2073 One of the logical block fragments is arbitrarily chosen to be
2074 the ORIGIN. The other fragments will point to the origin via
2075 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2076 be null. The list of fragments will be chained through
2077 BLOCK_FRAGMENT_CHAIN from the origin. */
2079 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2080 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2082 /* For an inlined function, this gives the location where it was called
2083 from. This is only set in the top level block, which corresponds to the
2084 inlined function scope. This is used in the debug output routines. */
2086 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2088 struct GTY(()) tree_block
{
2089 struct tree_base base
;
2092 unsigned abstract_flag
: 1;
2093 unsigned block_num
: 31;
2098 VEC(tree
,gc
) *nonlocalized_vars
;
2102 tree abstract_origin
;
2103 tree fragment_origin
;
2104 tree fragment_chain
;
2107 /* Define fields and accessors for nodes representing data types. */
2109 /* See tree.def for documentation of the use of these fields.
2110 Look at the documentation of the various ..._TYPE tree codes.
2112 Note that the type.values, type.minval, and type.maxval fields are
2113 overloaded and used for different macros in different kinds of types.
2114 Each macro must check to ensure the tree node is of the proper kind of
2115 type. Note also that some of the front-ends also overload these fields,
2116 so they must be checked as well. */
2118 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2119 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2120 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2121 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2122 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2123 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2124 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2125 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2126 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2127 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2129 /* Vector types need to check target flags to determine type. */
2130 extern enum machine_mode
vector_type_mode (const_tree
);
2131 #define TYPE_MODE(NODE) \
2132 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2133 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2134 #define SET_TYPE_MODE(NODE, MODE) \
2135 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2137 /* The "canonical" type for this type node, which is used by frontends to
2138 compare the type for equality with another type. If two types are
2139 equal (based on the semantics of the language), then they will have
2140 equivalent TYPE_CANONICAL entries.
2142 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2143 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2144 be used for comparison against other types. Instead, the type is
2145 said to require structural equality checks, described in
2146 TYPE_STRUCTURAL_EQUALITY_P.
2148 For unqualified aggregate and function types the middle-end relies on
2149 TYPE_CANONICAL to tell whether two variables can be assigned
2150 to each other without a conversion. The middle-end also makes sure
2151 to assign the same alias-sets to the type partition with equal
2152 TYPE_CANONICAL of their unqualified variants. */
2153 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2154 /* Indicates that the type node requires structural equality
2155 checks. The compiler will need to look at the composition of the
2156 type to determine whether it is equal to another type, rather than
2157 just comparing canonical type pointers. For instance, we would need
2158 to look at the return and parameter types of a FUNCTION_TYPE
2160 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2161 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2162 type node requires structural equality. */
2163 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2165 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2166 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2168 /* The (language-specific) typed-based alias set for this type.
2169 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2170 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2171 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2172 type can alias objects of any type. */
2173 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2175 /* Nonzero iff the typed-based alias set for this type has been
2177 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2178 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2180 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2182 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2184 /* The alignment necessary for objects of this type.
2185 The value is an int, measured in bits. */
2186 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
2188 /* 1 if the alignment for this type was requested by "aligned" attribute,
2189 0 if it is the default for this type. */
2190 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2192 /* The alignment for NODE, in bytes. */
2193 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2195 /* If your language allows you to declare types, and you want debug info
2196 for them, then you need to generate corresponding TYPE_DECL nodes.
2197 These "stub" TYPE_DECL nodes have no name, and simply point at the
2198 type node. You then set the TYPE_STUB_DECL field of the type node
2199 to point back at the TYPE_DECL node. This allows the debug routines
2200 to know that the two nodes represent the same type, so that we only
2201 get one debug info record for them. */
2202 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2204 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2205 has BLKmode only because it lacks the alignment requirement for
2207 #define TYPE_NO_FORCE_BLK(NODE) \
2208 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2210 /* Nonzero in a type considered volatile as a whole. */
2211 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2213 /* Means this type is const-qualified. */
2214 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2216 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2218 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2220 /* If nonzero, type's name shouldn't be emitted into debug info. */
2221 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2223 /* The address space the type is in. */
2224 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2226 /* There is a TYPE_QUAL value for each type qualifier. They can be
2227 combined by bitwise-or to form the complete set of qualifiers for a
2231 TYPE_UNQUALIFIED
= 0x0,
2232 TYPE_QUAL_CONST
= 0x1,
2233 TYPE_QUAL_VOLATILE
= 0x2,
2234 TYPE_QUAL_RESTRICT
= 0x4
2237 /* Encode/decode the named memory support as part of the qualifier. If more
2238 than 8 qualifiers are added, these macros need to be adjusted. */
2239 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2240 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2242 /* Return all qualifiers except for the address space qualifiers. */
2243 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2245 /* Only keep the address space out of the qualifiers and discard the other
2247 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2249 /* The set of type qualifiers for this type. */
2250 #define TYPE_QUALS(NODE) \
2251 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2252 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2253 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2254 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2256 /* The same as TYPE_QUALS without the address space qualifications. */
2257 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2258 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2259 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2260 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2262 /* These flags are available for each language front end to use internally. */
2263 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2264 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2265 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2266 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2267 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2268 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2269 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2271 /* Used to keep track of visited nodes in tree traversals. This is set to
2272 0 by copy_node and make_node. */
2273 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2275 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2276 that distinguish string from array of char).
2277 If set in a INTEGER_TYPE, indicates a character type. */
2278 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
2280 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2281 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2282 (((unsigned HOST_WIDE_INT) 1) \
2283 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
2285 /* Set precision to n when we have 2^n sub-parts of the vector. */
2286 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2287 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
2289 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2290 about missing conversions to other vector types of the same size. */
2291 #define TYPE_VECTOR_OPAQUE(NODE) \
2292 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2294 /* Indicates that objects of this type must be initialized by calling a
2295 function when they are created. */
2296 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2297 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2299 /* Indicates that a UNION_TYPE object should be passed the same way that
2300 the first union alternative would be passed, or that a RECORD_TYPE
2301 object should be passed the same way that the first (and only) member
2303 #define TYPE_TRANSPARENT_AGGR(NODE) \
2304 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2306 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2307 address of a component of the type. This is the counterpart of
2308 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2309 #define TYPE_NONALIASED_COMPONENT(NODE) \
2310 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2312 /* Indicated that objects of this type should be laid out in as
2313 compact a way as possible. */
2314 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2316 /* Used by type_contains_placeholder_p to avoid recomputation.
2317 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2318 this field directly. */
2319 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2320 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2322 /* The debug output functions use the symtab union field to store
2323 information specific to the debugging format. The different debug
2324 output hooks store different types in the union field. These three
2325 macros are used to access different fields in the union. The debug
2326 hooks are responsible for consistently using only a specific
2329 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2330 hold the type's number in the generated stabs. */
2331 #define TYPE_SYMTAB_ADDRESS(NODE) \
2332 (TYPE_CHECK (NODE)->type_common.symtab.address)
2334 /* Symtab field as a string. Used by COFF generator in sdbout.c to
2335 hold struct/union type tag names. */
2336 #define TYPE_SYMTAB_POINTER(NODE) \
2337 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
2339 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2340 in dwarf2out.c to point to the DIE generated for the type. */
2341 #define TYPE_SYMTAB_DIE(NODE) \
2342 (TYPE_CHECK (NODE)->type_common.symtab.die)
2344 /* The garbage collector needs to know the interpretation of the
2345 symtab field. These constants represent the different types in the
2348 #define TYPE_SYMTAB_IS_ADDRESS (0)
2349 #define TYPE_SYMTAB_IS_POINTER (1)
2350 #define TYPE_SYMTAB_IS_DIE (2)
2354 struct GTY(()) tree_type_common
{
2355 struct tree_common common
;
2361 unsigned int precision
: 10;
2362 unsigned no_force_blk_flag
: 1;
2363 unsigned needs_constructing_flag
: 1;
2364 unsigned transparent_aggr_flag
: 1;
2365 unsigned restrict_flag
: 1;
2366 unsigned contains_placeholder_bits
: 2;
2368 ENUM_BITFIELD(machine_mode
) mode
: 8;
2370 unsigned string_flag
: 1;
2371 unsigned lang_flag_0
: 1;
2372 unsigned lang_flag_1
: 1;
2373 unsigned lang_flag_2
: 1;
2374 unsigned lang_flag_3
: 1;
2375 unsigned lang_flag_4
: 1;
2376 unsigned lang_flag_5
: 1;
2377 unsigned lang_flag_6
: 1;
2380 alias_set_type alias_set
;
2383 union tree_type_symtab
{
2384 int GTY ((tag ("TYPE_SYMTAB_IS_ADDRESS"))) address
;
2385 const char * GTY ((tag ("TYPE_SYMTAB_IS_POINTER"))) pointer
;
2386 struct die_struct
* GTY ((tag ("TYPE_SYMTAB_IS_DIE"))) die
;
2387 } GTY ((desc ("debug_hooks->tree_type_symtab_field"))) symtab
;
2395 #define TYPE_LANG_SPECIFIC(NODE) \
2396 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2398 struct GTY(()) tree_type_with_lang_specific
{
2399 struct tree_type_common common
;
2400 /* Points to a structure whose details depend on the language in use. */
2401 struct lang_type
*lang_specific
;
2404 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2405 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2406 #define TYPE_FIELDS(NODE) \
2407 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2408 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type_non_common.values)
2409 #define TYPE_ARG_TYPES(NODE) \
2410 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2411 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK(NODE)->type_non_common.values)
2413 #define TYPE_METHODS(NODE) \
2414 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2415 #define TYPE_VFIELD(NODE) \
2416 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2417 #define TYPE_METHOD_BASETYPE(NODE) \
2418 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2419 #define TYPE_OFFSET_BASETYPE(NODE) \
2420 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2421 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2422 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2423 #define TYPE_NEXT_PTR_TO(NODE) \
2424 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2425 #define TYPE_NEXT_REF_TO(NODE) \
2426 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2427 #define TYPE_MIN_VALUE(NODE) \
2428 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2429 #define TYPE_MAX_VALUE(NODE) \
2430 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2432 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2433 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2435 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2436 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2438 /* For record and union types, information about this type, as a base type
2440 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo)
2442 /* For non record and union types, used in a language-dependent way. */
2443 #define TYPE_LANG_SLOT_1(NODE) \
2444 (NOT_RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo)
2446 struct GTY(()) tree_type_non_common
{
2447 struct tree_type_with_lang_specific with_lang_specific
;
2454 /* Define accessor macros for information about type inheritance
2457 A "basetype" means a particular usage of a data type for inheritance
2458 in another type. Each such basetype usage has its own "binfo"
2459 object to describe it. The binfo object is a TREE_VEC node.
2461 Inheritance is represented by the binfo nodes allocated for a
2462 given type. For example, given types C and D, such that D is
2463 inherited by C, 3 binfo nodes will be allocated: one for describing
2464 the binfo properties of C, similarly one for D, and one for
2465 describing the binfo properties of D as a base type for C.
2466 Thus, given a pointer to class C, one can get a pointer to the binfo
2467 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2469 /* BINFO specific flags. */
2471 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2472 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2474 /* Flags for language dependent use. */
2475 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2476 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2477 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2478 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2479 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2480 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2481 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2483 /* The actual data type node being inherited in this basetype. */
2484 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2486 /* The offset where this basetype appears in its containing type.
2487 BINFO_OFFSET slot holds the offset (in bytes)
2488 from the base of the complete object to the base of the part of the
2489 object that is allocated on behalf of this `type'.
2490 This is always 0 except when there is multiple inheritance. */
2492 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2493 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2495 /* The virtual function table belonging to this basetype. Virtual
2496 function tables provide a mechanism for run-time method dispatching.
2497 The entries of a virtual function table are language-dependent. */
2499 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2501 /* The virtual functions in the virtual function table. This is
2502 a TREE_LIST that is used as an initial approximation for building
2503 a virtual function table for this basetype. */
2504 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2506 /* A vector of binfos for the direct basetypes inherited by this
2509 If this basetype describes type D as inherited in C, and if the
2510 basetypes of D are E and F, then this vector contains binfos for
2511 inheritance of E and F by C. */
2512 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2514 /* The number of basetypes for NODE. */
2515 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2517 /* Accessor macro to get to the Nth base binfo of this binfo. */
2518 #define BINFO_BASE_BINFO(NODE,N) \
2519 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2520 #define BINFO_BASE_ITERATE(NODE,N,B) \
2521 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2522 #define BINFO_BASE_APPEND(NODE,T) \
2523 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2525 /* For a BINFO record describing a virtual base class, i.e., one where
2526 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2527 base. The actual contents are language-dependent. In the C++
2528 front-end this field is an INTEGER_CST giving an offset into the
2529 vtable where the offset to the virtual base can be found. */
2530 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2532 /* Indicates the accesses this binfo has to its bases. The values are
2533 access_public_node, access_protected_node or access_private_node.
2534 If this array is not present, public access is implied. */
2535 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2537 #define BINFO_BASE_ACCESS(NODE,N) \
2538 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2539 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2540 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2542 /* The index in the VTT where this subobject's sub-VTT can be found.
2543 NULL_TREE if there is no sub-VTT. */
2544 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2546 /* The index in the VTT where the vptr for this subobject can be
2547 found. NULL_TREE if there is no secondary vptr in the VTT. */
2548 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2550 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2551 inheriting this base for non-virtual bases. For virtual bases it
2552 points either to the binfo for which this is a primary binfo, or to
2553 the binfo of the most derived type. */
2554 #define BINFO_INHERITANCE_CHAIN(NODE) \
2555 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2557 struct GTY (()) tree_binfo
{
2558 struct tree_common common
;
2564 VEC(tree
,gc
) *base_accesses
;
2570 VEC(tree
,none
) base_binfos
;
2574 /* Define fields and accessors for nodes representing declared names. */
2576 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2577 have an associated SSA name. */
2578 #define SSA_VAR_P(DECL) \
2579 (TREE_CODE (DECL) == VAR_DECL \
2580 || TREE_CODE (DECL) == PARM_DECL \
2581 || TREE_CODE (DECL) == RESULT_DECL \
2582 || TREE_CODE (DECL) == SSA_NAME)
2586 /* Enumerate visibility settings. */
2587 #ifndef SYMBOL_VISIBILITY_DEFINED
2588 #define SYMBOL_VISIBILITY_DEFINED
2589 enum symbol_visibility
2592 VISIBILITY_PROTECTED
,
2600 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2602 /* This is the name of the object as written by the user.
2603 It is an IDENTIFIER_NODE. */
2604 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2606 /* Every ..._DECL node gets a unique number. */
2607 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2609 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2611 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2613 /* Every ..._DECL node gets a unique number that stays the same even
2614 when the decl is copied by the inliner once it is set. */
2615 #define DECL_PT_UID(NODE) \
2616 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2617 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2618 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2619 #define SET_DECL_PT_UID(NODE, UID) \
2620 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2621 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2622 be preserved when copyin the decl. */
2623 #define DECL_PT_UID_SET_P(NODE) \
2624 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2626 /* These two fields describe where in the source code the declaration
2627 was. If the declaration appears in several places (as for a C
2628 function that is declared first and then defined later), this
2629 information should refer to the definition. */
2630 #define DECL_SOURCE_LOCATION(NODE) \
2631 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2632 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2633 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2634 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2635 #define DECL_IS_BUILTIN(DECL) \
2636 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2638 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2639 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2640 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2641 nodes, this points to either the FUNCTION_DECL for the containing
2642 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2643 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2644 scope". In particular, for VAR_DECLs which are virtual table pointers
2645 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2647 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2648 #define DECL_FIELD_CONTEXT(NODE) \
2649 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2651 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2652 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2654 struct GTY(()) tree_decl_minimal
{
2655 struct tree_common common
;
2663 /* For any sort of a ..._DECL node, this points to the original (abstract)
2664 decl node which this decl is an inlined/cloned instance of, or else it
2665 is NULL indicating that this decl is not an instance of some other decl.
2667 The C front-end also uses this in a nested declaration of an inline
2668 function, to point back to the definition. */
2669 #define DECL_ABSTRACT_ORIGIN(NODE) \
2670 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2672 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2673 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2674 #define DECL_ORIGIN(NODE) \
2675 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2677 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2678 inline instance of some original (abstract) decl from an inline function;
2679 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2680 nodes can also have their abstract origin set to themselves. */
2681 #define DECL_FROM_INLINE(NODE) \
2682 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2683 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2685 /* In a DECL this is the field where attributes are stored. */
2686 #define DECL_ATTRIBUTES(NODE) \
2687 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2689 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2690 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2691 For a VAR_DECL, holds the initial value.
2692 For a PARM_DECL, used for DECL_ARG_TYPE--default
2693 values for parameters are encoded in the type of the function,
2694 not in the PARM_DECL slot.
2695 For a FIELD_DECL, this is used for enumeration values and the C
2696 frontend uses it for temporarily storing bitwidth of bitfields.
2698 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2699 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2701 /* Holds the size of the datum, in bits, as a tree expression.
2702 Need not be constant. */
2703 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2704 /* Likewise for the size in bytes. */
2705 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2706 /* Holds the alignment required for the datum, in bits. */
2707 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2708 /* The alignment of NODE, in bytes. */
2709 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2710 /* Set if the alignment of this DECL has been set by the user, for
2711 example with an 'aligned' attribute. */
2712 #define DECL_USER_ALIGN(NODE) \
2713 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2714 /* Holds the machine mode corresponding to the declaration of a variable or
2715 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2717 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2719 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2720 operation it is. Note, however, that this field is overloaded, with
2721 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2722 checked before any access to the former. */
2723 #define DECL_FUNCTION_CODE(NODE) \
2724 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2725 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2726 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2728 #define DECL_FUNCTION_PERSONALITY(NODE) \
2729 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2731 /* Nonzero for a given ..._DECL node means that the name of this node should
2732 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2733 the associated type should be ignored. For a FUNCTION_DECL, the body of
2734 the function should also be ignored. */
2735 #define DECL_IGNORED_P(NODE) \
2736 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2738 /* Nonzero for a given ..._DECL node means that this node represents an
2739 "abstract instance" of the given declaration (e.g. in the original
2740 declaration of an inline function). When generating symbolic debugging
2741 information, we mustn't try to generate any address information for nodes
2742 marked as "abstract instances" because we don't actually generate
2743 any code or allocate any data space for such instances. */
2744 #define DECL_ABSTRACT(NODE) \
2745 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2747 /* Language-specific decl information. */
2748 #define DECL_LANG_SPECIFIC(NODE) \
2749 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2751 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2752 do not allocate storage, and refer to a definition elsewhere. Note that
2753 this does not necessarily imply the entity represented by NODE
2754 has no program source-level definition in this translation unit. For
2755 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2756 DECL_EXTERNAL may be true simultaneously; that can be the case for
2757 a C99 "extern inline" function. */
2758 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2760 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2761 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2763 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2765 Also set in some languages for variables, etc., outside the normal
2766 lexical scope, such as class instance variables. */
2767 #define DECL_NONLOCAL(NODE) \
2768 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2770 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2771 Used in FIELD_DECLs for vtable pointers.
2772 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2773 #define DECL_VIRTUAL_P(NODE) \
2774 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2776 /* Used to indicate that this DECL represents a compiler-generated entity. */
2777 #define DECL_ARTIFICIAL(NODE) \
2778 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2780 /* Additional flags for language-specific uses. */
2781 #define DECL_LANG_FLAG_0(NODE) \
2782 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2783 #define DECL_LANG_FLAG_1(NODE) \
2784 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2785 #define DECL_LANG_FLAG_2(NODE) \
2786 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2787 #define DECL_LANG_FLAG_3(NODE) \
2788 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2789 #define DECL_LANG_FLAG_4(NODE) \
2790 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2791 #define DECL_LANG_FLAG_5(NODE) \
2792 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2793 #define DECL_LANG_FLAG_6(NODE) \
2794 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2795 #define DECL_LANG_FLAG_7(NODE) \
2796 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2797 #define DECL_LANG_FLAG_8(NODE) \
2798 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2800 /* Nonzero for a scope which is equal to file scope. */
2801 #define SCOPE_FILE_SCOPE_P(EXP) \
2802 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2803 /* Nonzero for a decl which is at file scope. */
2804 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2805 /* Nonzero for a type which is at file scope. */
2806 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2808 /* Nonzero for a decl that is decorated using attribute used.
2809 This indicates to compiler tools that this decl needs to be preserved. */
2810 #define DECL_PRESERVE_P(DECL) \
2811 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2813 /* For function local variables of COMPLEX and VECTOR types,
2814 indicates that the variable is not aliased, and that all
2815 modifications to the variable have been adjusted so that
2816 they are killing assignments. Thus the variable may now
2817 be treated as a GIMPLE register, and use real instead of
2818 virtual ops in SSA form. */
2819 #define DECL_GIMPLE_REG_P(DECL) \
2820 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2822 struct GTY(()) tree_decl_common
{
2823 struct tree_decl_minimal common
;
2826 ENUM_BITFIELD(machine_mode
) mode
: 8;
2828 unsigned nonlocal_flag
: 1;
2829 unsigned virtual_flag
: 1;
2830 unsigned ignored_flag
: 1;
2831 unsigned abstract_flag
: 1;
2832 unsigned artificial_flag
: 1;
2833 unsigned preserve_flag
: 1;
2834 unsigned debug_expr_is_from
: 1;
2836 unsigned lang_flag_0
: 1;
2837 unsigned lang_flag_1
: 1;
2838 unsigned lang_flag_2
: 1;
2839 unsigned lang_flag_3
: 1;
2840 unsigned lang_flag_4
: 1;
2841 unsigned lang_flag_5
: 1;
2842 unsigned lang_flag_6
: 1;
2843 unsigned lang_flag_7
: 1;
2844 unsigned lang_flag_8
: 1;
2846 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2847 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2848 unsigned decl_flag_0
: 1;
2849 /* In FIELD_DECL, this is DECL_BIT_FIELD
2850 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2851 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2852 unsigned decl_flag_1
: 1;
2853 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2854 In VAR_DECL, PARM_DECL and RESULT_DECL, this is
2855 DECL_HAS_VALUE_EXPR_P. */
2856 unsigned decl_flag_2
: 1;
2857 /* Logically, these two would go in a theoretical base shared by var and
2859 unsigned gimple_reg_flag
: 1;
2860 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2861 unsigned decl_by_reference_flag
: 1;
2862 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2863 unsigned decl_restricted_flag
: 1;
2865 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2867 unsigned decl_read_flag
: 1;
2869 /* In VAR_DECL or RESULT_DECL set when significant code movement precludes
2870 attempting to share the stack slot with some other variable. */
2871 unsigned decl_nonshareable_flag
: 1;
2873 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2874 unsigned int off_align
: 8;
2876 /* 24-bits unused. */
2878 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2881 /* UID for points-to sets, stable over copying from inlining. */
2882 unsigned int pt_uid
;
2887 tree abstract_origin
;
2889 /* Points to a structure whose details depend on the language in use. */
2890 struct lang_decl
*lang_specific
;
2893 extern tree
decl_value_expr_lookup (tree
);
2894 extern void decl_value_expr_insert (tree
, tree
);
2896 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2897 if transformations have made this more complicated than evaluating the
2898 decl itself. This should only be used for debugging; once this field has
2899 been set, the decl itself may not legitimately appear in the function. */
2900 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2901 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2902 ->decl_common.decl_flag_2)
2903 #define DECL_VALUE_EXPR(NODE) \
2904 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2905 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2906 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2908 /* Holds the RTL expression for the value of a variable or function.
2909 This value can be evaluated lazily for functions, variables with
2910 static storage duration, and labels. */
2911 #define DECL_RTL(NODE) \
2912 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2913 ? (NODE)->decl_with_rtl.rtl \
2914 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2916 /* Set the DECL_RTL for NODE to RTL. */
2917 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2919 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2920 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2922 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2923 #define DECL_RTL_SET_P(NODE) \
2924 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2926 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2927 NODE1, it will not be set for NODE2; this is a lazy copy. */
2928 #define COPY_DECL_RTL(NODE1, NODE2) \
2929 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2930 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2932 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2933 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2935 #if (GCC_VERSION >= 2007)
2936 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2937 ({ tree const __d = (decl); \
2938 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2939 /* Dereference it so the compiler knows it can't be NULL even \
2940 without assertion checking. */ \
2941 &*DECL_RTL_IF_SET (__d); })
2943 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2946 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2947 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2949 struct GTY(()) tree_decl_with_rtl
{
2950 struct tree_decl_common common
;
2954 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2955 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2956 of the structure. */
2957 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2959 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2960 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2961 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2962 natural alignment of the field's type). */
2963 #define DECL_FIELD_BIT_OFFSET(NODE) \
2964 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2966 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2967 if so, the type that was originally specified for it.
2968 TREE_TYPE may have been modified (in finish_struct). */
2969 #define DECL_BIT_FIELD_TYPE(NODE) \
2970 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2972 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2973 representative FIELD_DECL. */
2974 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2975 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2977 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2978 if nonzero, indicates that the field occupies the type. */
2979 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2981 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2982 DECL_FIELD_OFFSET which are known to be always zero.
2983 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2985 #define DECL_OFFSET_ALIGN(NODE) \
2986 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2988 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2989 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2990 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2992 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2993 which this FIELD_DECL is defined. This information is needed when
2994 writing debugging information about vfield and vbase decls for C++. */
2995 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2997 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2998 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
3000 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
3002 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3004 /* Used in a FIELD_DECL to indicate that we cannot form the address of
3005 this component. This makes it possible for Type-Based Alias Analysis
3006 to disambiguate accesses to this field with indirect accesses using
3009 struct S { int i; } s;
3012 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
3014 From the implementation's viewpoint, the alias set of the type of the
3015 field 'i' (int) will not be recorded as a subset of that of the type of
3016 's' (struct S) in record_component_aliases. The counterpart is that
3017 accesses to s.i must not be given the alias set of the type of 'i'
3018 (int) but instead directly that of the type of 's' (struct S). */
3019 #define DECL_NONADDRESSABLE_P(NODE) \
3020 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3022 struct GTY(()) tree_field_decl
{
3023 struct tree_decl_common common
;
3026 tree bit_field_type
;
3032 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3033 dense, unique within any one function, and may be used to index arrays.
3034 If the value is -1, then no UID has been assigned. */
3035 #define LABEL_DECL_UID(NODE) \
3036 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
3038 /* In a LABEL_DECL, the EH region number for which the label is the
3039 post_landing_pad. */
3040 #define EH_LANDING_PAD_NR(NODE) \
3041 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
3043 /* In LABEL_DECL nodes, nonzero means that an error message about
3044 jumping into such a binding contour has been printed for this label. */
3045 #define DECL_ERROR_ISSUED(NODE) \
3046 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
3048 struct GTY(()) tree_label_decl
{
3049 struct tree_decl_with_rtl common
;
3051 int eh_landing_pad_nr
;
3054 struct GTY(()) tree_result_decl
{
3055 struct tree_decl_with_rtl common
;
3058 struct GTY(()) tree_const_decl
{
3059 struct tree_decl_common common
;
3062 /* For a PARM_DECL, records the data type used to pass the argument,
3063 which may be different from the type seen in the program. */
3064 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3066 /* For PARM_DECL, holds an RTL for the stack slot or register
3067 where the data was actually passed. */
3068 #define DECL_INCOMING_RTL(NODE) \
3069 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3071 struct GTY(()) tree_parm_decl
{
3072 struct tree_decl_with_rtl common
;
3077 /* Nonzero for a given ..._DECL node means that no warnings should be
3078 generated just because this node is unused. */
3079 #define DECL_IN_SYSTEM_HEADER(NODE) \
3080 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
3082 /* Used to indicate that the linkage status of this DECL is not yet known,
3083 so it should not be output now. */
3084 #define DECL_DEFER_OUTPUT(NODE) \
3085 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3087 /* In a VAR_DECL that's static,
3088 nonzero if the space is in the text section. */
3089 #define DECL_IN_TEXT_SECTION(NODE) \
3090 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3092 /* In a VAR_DECL that's static,
3093 nonzero if it belongs to the global constant pool. */
3094 #define DECL_IN_CONSTANT_POOL(NODE) \
3095 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3097 /* Nonzero for a given ..._DECL node means that this node should be
3098 put in .common, if possible. If a DECL_INITIAL is given, and it
3099 is not error_mark_node, then the decl cannot be put in .common. */
3100 #define DECL_COMMON(NODE) \
3101 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3103 /* In a VAR_DECL, nonzero if the decl is a register variable with
3104 an explicit asm specification. */
3105 #define DECL_HARD_REGISTER(NODE) \
3106 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3108 /* Used to indicate that this DECL has weak linkage. */
3109 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3111 /* Used to indicate that the DECL is a dllimport. */
3112 #define DECL_DLLIMPORT_P(NODE) \
3113 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3115 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3116 not be put out unless it is needed in this translation unit.
3117 Entities like this are shared across translation units (like weak
3118 entities), but are guaranteed to be generated by any translation
3119 unit that needs them, and therefore need not be put out anywhere
3120 where they are not needed. DECL_COMDAT is just a hint to the
3121 back-end; it is up to front-ends which set this flag to ensure
3122 that there will never be any harm, other than bloat, in putting out
3123 something which is DECL_COMDAT. */
3124 #define DECL_COMDAT(NODE) \
3125 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3127 #define DECL_COMDAT_GROUP(NODE) \
3128 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
3130 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3131 multiple translation units should be merged. */
3132 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
3134 /* The name of the object as the assembler will see it (but before any
3135 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3136 as DECL_NAME. It is an IDENTIFIER_NODE. */
3137 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3139 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3140 This is true of all DECL nodes except FIELD_DECL. */
3141 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3142 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3144 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3145 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3147 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3148 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
3149 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3151 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3152 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3153 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3155 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3156 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3157 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3158 semantics of using this macro, are different than saying:
3160 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3162 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3164 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3165 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3166 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3167 DECL_ASSEMBLER_NAME (DECL1)) \
3170 /* Records the section name in a section attribute. Used to pass
3171 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3172 #define DECL_SECTION_NAME(NODE) \
3173 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3175 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3176 this variable in a BIND_EXPR. */
3177 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3178 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3180 /* Value of the decls's visibility attribute */
3181 #define DECL_VISIBILITY(NODE) \
3182 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3184 /* Nonzero means that the decl had its visibility specified rather than
3186 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3187 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3189 /* In a VAR_DECL, the model to use if the data should be allocated from
3190 thread-local storage. */
3191 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3193 /* In a VAR_DECL, nonzero if the data should be allocated from
3194 thread-local storage. */
3195 #define DECL_THREAD_LOCAL_P(NODE) \
3196 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3198 /* In a non-local VAR_DECL with static storage duration, true if the
3199 variable has an initialization priority. If false, the variable
3200 will be initialized at the DEFAULT_INIT_PRIORITY. */
3201 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3202 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3204 /* Specify whether the section name was set by user or by
3205 compiler via -ffunction-sections. */
3206 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
3207 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
3209 struct GTY(()) tree_decl_with_vis
{
3210 struct tree_decl_with_rtl common
;
3211 tree assembler_name
;
3215 /* Belong to VAR_DECL exclusively. */
3216 unsigned defer_output
: 1;
3217 unsigned hard_register
: 1;
3218 unsigned thread_local
: 1;
3219 unsigned common_flag
: 1;
3220 unsigned in_text_section
: 1;
3221 unsigned in_constant_pool
: 1;
3222 unsigned dllimport_flag
: 1;
3223 /* Don't belong to VAR_DECL exclusively. */
3224 unsigned weak_flag
: 1;
3226 unsigned seen_in_bind_expr
: 1;
3227 unsigned comdat_flag
: 1;
3228 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
3229 unsigned visibility_specified
: 1;
3230 /* Belongs to VAR_DECL exclusively. */
3231 ENUM_BITFIELD(tls_model
) tls_model
: 3;
3233 /* Belong to FUNCTION_DECL exclusively. */
3234 unsigned init_priority_p
: 1;
3235 /* Used by C++ only. Might become a generic decl flag. */
3236 unsigned shadowed_for_var_p
: 1;
3237 /* When SECTION_NAME is implied by -ffunsection-section. */
3238 unsigned implicit_section_name_p
: 1;
3239 /* 13 unused bits. */
3242 extern tree
decl_debug_expr_lookup (tree
);
3243 extern void decl_debug_expr_insert (tree
, tree
);
3244 /* For VAR_DECL, this is set to either an expression that it was split
3245 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3246 subexpressions that it was split into. */
3247 #define DECL_DEBUG_EXPR(NODE) \
3248 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3250 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3251 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3253 /* An initialization priority. */
3254 typedef unsigned short priority_type
;
3256 extern priority_type
decl_init_priority_lookup (tree
);
3257 extern priority_type
decl_fini_priority_lookup (tree
);
3258 extern void decl_init_priority_insert (tree
, priority_type
);
3259 extern void decl_fini_priority_insert (tree
, priority_type
);
3261 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3263 #define DECL_INIT_PRIORITY(NODE) \
3264 (decl_init_priority_lookup (NODE))
3265 /* Set the initialization priority for NODE to VAL. */
3266 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3267 (decl_init_priority_insert (NODE, VAL))
3269 /* For a FUNCTION_DECL the finalization priority of NODE. */
3270 #define DECL_FINI_PRIORITY(NODE) \
3271 (decl_fini_priority_lookup (NODE))
3272 /* Set the finalization priority for NODE to VAL. */
3273 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3274 (decl_fini_priority_insert (NODE, VAL))
3276 /* The initialization priority for entities for which no explicit
3277 initialization priority has been specified. */
3278 #define DEFAULT_INIT_PRIORITY 65535
3280 /* The maximum allowed initialization priority. */
3281 #define MAX_INIT_PRIORITY 65535
3283 /* The largest priority value reserved for use by system runtime
3285 #define MAX_RESERVED_INIT_PRIORITY 100
3287 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
3288 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
3289 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
3291 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
3292 #define DECL_NONLOCAL_FRAME(NODE) \
3293 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
3295 struct GTY(()) tree_var_decl
{
3296 struct tree_decl_with_vis common
;
3300 /* This field is used to reference anything in decl.result and is meant only
3301 for use by the garbage collector. */
3302 #define DECL_RESULT_FLD(NODE) \
3303 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3305 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3306 Before the struct containing the FUNCTION_DECL is laid out,
3307 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3308 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3309 function. When the class is laid out, this pointer is changed
3310 to an INTEGER_CST node which is suitable for use as an index
3311 into the virtual function table.
3312 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3313 #define DECL_VINDEX(NODE) \
3314 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3317 tree_decl_non_common
{
3318 struct tree_decl_with_vis common
;
3319 /* C++ uses this in namespaces. */
3321 /* C++ uses this in templates. */
3323 /* Almost all FE's use this. */
3325 /* C++ uses this in namespaces and function_decls. */
3329 /* In FUNCTION_DECL, holds the decl for the return value. */
3330 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3332 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3333 #define DECL_UNINLINABLE(NODE) \
3334 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3336 /* In a FUNCTION_DECL, the saved representation of the body of the
3338 #define DECL_SAVED_TREE(NODE) \
3339 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3341 /* Nonzero in a FUNCTION_DECL means this function should be treated
3342 as if it were a malloc, meaning it returns a pointer that is
3344 #define DECL_IS_MALLOC(NODE) \
3345 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3347 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3348 C++ operator new, meaning that it returns a pointer for which we
3349 should not use type based aliasing. */
3350 #define DECL_IS_OPERATOR_NEW(NODE) \
3351 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3353 /* Nonzero in a FUNCTION_DECL means this function may return more
3355 #define DECL_IS_RETURNS_TWICE(NODE) \
3356 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3358 /* Nonzero in a FUNCTION_DECL means this function should be treated
3359 as "pure" function (like const function, but may read global memory). */
3360 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3362 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3363 the const or pure function may not terminate. When this is nonzero
3364 for a const or pure function, it can be dealt with by cse passes
3365 but cannot be removed by dce passes since you are not allowed to
3366 change an infinite looping program into one that terminates without
3368 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3369 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3371 /* Nonzero in a FUNCTION_DECL means this function should be treated
3372 as "novops" function (function that does not read global memory,
3373 but may have arbitrary side effects). */
3374 #define DECL_IS_NOVOPS(NODE) \
3375 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3377 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3378 at the beginning or end of execution. */
3379 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3380 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3382 #define DECL_STATIC_DESTRUCTOR(NODE) \
3383 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3385 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3386 be instrumented with calls to support routines. */
3387 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3388 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3390 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3391 disabled in this function. */
3392 #define DECL_NO_LIMIT_STACK(NODE) \
3393 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3395 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3396 #define DECL_STATIC_CHAIN(NODE) \
3397 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3399 /* Nonzero for a decl that cgraph has decided should be inlined into
3400 at least one call site. It is not meaningful to look at this
3401 directly; always use cgraph_function_possibly_inlined_p. */
3402 #define DECL_POSSIBLY_INLINED(DECL) \
3403 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3405 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3406 such as via the `inline' keyword in C/C++. This flag controls the linkage
3407 semantics of 'inline' */
3408 #define DECL_DECLARED_INLINE_P(NODE) \
3409 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3411 /* Nonzero in a FUNCTION_DECL means this function should not get
3412 -Winline warnings. */
3413 #define DECL_NO_INLINE_WARNING_P(NODE) \
3414 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3416 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3417 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3418 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3420 /* Nonzero if a FUNCTION_CODE is a TM load. */
3421 #define BUILTIN_TM_LOAD_P(FN) \
3422 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3424 /* Nonzero if a FUNCTION_CODE is a TM store. */
3425 #define BUILTIN_TM_STORE_P(FN) \
3426 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3428 #define CASE_BUILT_IN_TM_LOAD(FN) \
3429 case BUILT_IN_TM_LOAD_##FN: \
3430 case BUILT_IN_TM_LOAD_RAR_##FN: \
3431 case BUILT_IN_TM_LOAD_RAW_##FN: \
3432 case BUILT_IN_TM_LOAD_RFW_##FN
3434 #define CASE_BUILT_IN_TM_STORE(FN) \
3435 case BUILT_IN_TM_STORE_##FN: \
3436 case BUILT_IN_TM_STORE_WAR_##FN: \
3437 case BUILT_IN_TM_STORE_WAW_##FN
3439 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3440 disregarding size and cost heuristics. This is equivalent to using
3441 the always_inline attribute without the required diagnostics if the
3442 function cannot be inlined. */
3443 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3444 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3446 extern VEC(tree
, gc
) **decl_debug_args_lookup (tree
);
3447 extern VEC(tree
, gc
) **decl_debug_args_insert (tree
);
3449 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3450 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3451 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3453 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3454 that describes the status of this function. */
3455 #define DECL_STRUCT_FUNCTION(NODE) \
3456 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3458 /* In a FUNCTION_DECL, nonzero means a built in function. */
3459 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3461 /* For a builtin function, identify which part of the compiler defined it. */
3462 #define DECL_BUILT_IN_CLASS(NODE) \
3463 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3465 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3466 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3468 #define DECL_ARGUMENTS(NODE) \
3469 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3470 #define DECL_ARGUMENT_FLD(NODE) \
3471 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3473 /* In FUNCTION_DECL, the function specific target options to use when compiling
3475 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3476 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3478 /* In FUNCTION_DECL, the function specific optimization options to use when
3479 compiling this function. */
3480 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3481 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3483 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3484 arguments/result/saved_tree fields by front ends. It was either inherit
3485 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3486 which seemed a bit strange. */
3488 struct GTY(()) tree_function_decl
{
3489 struct tree_decl_non_common common
;
3493 /* The personality function. Used for stack unwinding. */
3496 /* Function specific options that are used by this function. */
3497 tree function_specific_target
; /* target options */
3498 tree function_specific_optimization
; /* optimization options */
3500 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3501 DECL_FUNCTION_CODE. Otherwise unused.
3502 ??? The bitfield needs to be able to hold all target function
3504 ENUM_BITFIELD(built_in_function
) function_code
: 11;
3505 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
3507 unsigned static_ctor_flag
: 1;
3508 unsigned static_dtor_flag
: 1;
3509 unsigned uninlinable
: 1;
3511 unsigned possibly_inlined
: 1;
3512 unsigned novops_flag
: 1;
3513 unsigned returns_twice_flag
: 1;
3514 unsigned malloc_flag
: 1;
3515 unsigned operator_new_flag
: 1;
3516 unsigned declared_inline_flag
: 1;
3517 unsigned regdecl_flag
: 1;
3518 unsigned no_inline_warning_flag
: 1;
3520 unsigned no_instrument_function_entry_exit
: 1;
3521 unsigned no_limit_stack
: 1;
3522 unsigned disregard_inline_limits
: 1;
3523 unsigned pure_flag
: 1;
3524 unsigned looping_const_or_pure_flag
: 1;
3525 unsigned has_debug_args_flag
: 1;
3526 unsigned tm_clone_flag
: 1;
3531 /* The source language of the translation-unit. */
3532 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3533 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3535 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3537 struct GTY(()) tree_translation_unit_decl
{
3538 struct tree_decl_common common
;
3539 /* Source language of this translation unit. Used for DWARF output. */
3540 const char * GTY((skip(""))) language
;
3541 /* TODO: Non-optimization used to build this translation unit. */
3542 /* TODO: Root of a partial DWARF tree for global types and decls. */
3545 /* A vector of all translation-units. */
3546 extern GTY (()) VEC(tree
,gc
) *all_translation_units
;
3548 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3549 #define DECL_ORIGINAL_TYPE(NODE) \
3550 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3552 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3553 into stabs. Instead it will generate cross reference ('x') of names.
3554 This uses the same flag as DECL_EXTERNAL. */
3555 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3556 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3558 /* Getter of the imported declaration associated to the
3559 IMPORTED_DECL node. */
3560 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3561 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3563 struct GTY(()) tree_type_decl
{
3564 struct tree_decl_non_common common
;
3568 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3569 To reduce overhead, the nodes containing the statements are not trees.
3570 This avoids the overhead of tree_common on all linked list elements.
3572 Use the interface in tree-iterator.h to access this node. */
3574 #define STATEMENT_LIST_HEAD(NODE) \
3575 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3576 #define STATEMENT_LIST_TAIL(NODE) \
3577 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3579 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3581 struct tree_statement_list_node
*prev
;
3582 struct tree_statement_list_node
*next
;
3586 struct GTY(()) tree_statement_list
3588 struct tree_typed typed
;
3589 struct tree_statement_list_node
*head
;
3590 struct tree_statement_list_node
*tail
;
3594 /* Optimization options used by a function. */
3596 struct GTY(()) tree_optimization_option
{
3597 struct tree_common common
;
3599 /* The optimization options used by the user. */
3600 struct cl_optimization opts
;
3603 #define TREE_OPTIMIZATION(NODE) \
3604 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3606 /* Return a tree node that encapsulates the current optimization options. */
3607 extern tree
build_optimization_node (void);
3609 /* Target options used by a function. */
3611 struct GTY(()) tree_target_option
{
3612 struct tree_common common
;
3614 /* The optimization options used by the user. */
3615 struct cl_target_option opts
;
3618 #define TREE_TARGET_OPTION(NODE) \
3619 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3621 /* Return a tree node that encapsulates the current target options. */
3622 extern tree
build_target_option_node (void);
3625 /* Define the overall contents of a tree node.
3626 It may be any of the structures declared above
3627 for various types of node. */
3629 union GTY ((ptr_alias (union lang_tree_node
),
3630 desc ("tree_node_structure (&%h)"), variable_size
)) tree_node
{
3631 struct tree_base
GTY ((tag ("TS_BASE"))) base
;
3632 struct tree_typed
GTY ((tag ("TS_TYPED"))) typed
;
3633 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
3634 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
3635 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
3636 struct tree_fixed_cst
GTY ((tag ("TS_FIXED_CST"))) fixed_cst
;
3637 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
3638 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
3639 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
3640 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
3641 struct tree_decl_minimal
GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal
;
3642 struct tree_decl_common
GTY ((tag ("TS_DECL_COMMON"))) decl_common
;
3643 struct tree_decl_with_rtl
GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl
;
3644 struct tree_decl_non_common
GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common
;
3645 struct tree_parm_decl
GTY ((tag ("TS_PARM_DECL"))) parm_decl
;
3646 struct tree_decl_with_vis
GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis
;
3647 struct tree_var_decl
GTY ((tag ("TS_VAR_DECL"))) var_decl
;
3648 struct tree_field_decl
GTY ((tag ("TS_FIELD_DECL"))) field_decl
;
3649 struct tree_label_decl
GTY ((tag ("TS_LABEL_DECL"))) label_decl
;
3650 struct tree_result_decl
GTY ((tag ("TS_RESULT_DECL"))) result_decl
;
3651 struct tree_const_decl
GTY ((tag ("TS_CONST_DECL"))) const_decl
;
3652 struct tree_type_decl
GTY ((tag ("TS_TYPE_DECL"))) type_decl
;
3653 struct tree_function_decl
GTY ((tag ("TS_FUNCTION_DECL"))) function_decl
;
3654 struct tree_translation_unit_decl
GTY ((tag ("TS_TRANSLATION_UNIT_DECL")))
3655 translation_unit_decl
;
3656 struct tree_type_common
GTY ((tag ("TS_TYPE_COMMON"))) type_common
;
3657 struct tree_type_with_lang_specific
GTY ((tag ("TS_TYPE_WITH_LANG_SPECIFIC")))
3658 type_with_lang_specific
;
3659 struct tree_type_non_common
GTY ((tag ("TS_TYPE_NON_COMMON")))
3661 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
3662 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
3663 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
3664 struct tree_ssa_name
GTY ((tag ("TS_SSA_NAME"))) ssa_name
;
3665 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
3666 struct tree_binfo
GTY ((tag ("TS_BINFO"))) binfo
;
3667 struct tree_statement_list
GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list
;
3668 struct tree_constructor
GTY ((tag ("TS_CONSTRUCTOR"))) constructor
;
3669 struct tree_omp_clause
GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause
;
3670 struct tree_optimization_option
GTY ((tag ("TS_OPTIMIZATION"))) optimization
;
3671 struct tree_target_option
GTY ((tag ("TS_TARGET_OPTION"))) target_option
;
3674 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3677 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
3679 if (TREE_CODE (__t
) != __c
)
3680 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3685 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
3688 if (TREE_CODE (__t
) == __c
)
3689 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3694 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3695 enum tree_code __c1
, enum tree_code __c2
)
3697 if (TREE_CODE (__t
) != __c1
3698 && TREE_CODE (__t
) != __c2
)
3699 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3704 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3705 enum tree_code __c1
, enum tree_code __c2
)
3707 if (TREE_CODE (__t
) == __c1
3708 || TREE_CODE (__t
) == __c2
)
3709 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3714 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3715 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3717 if (TREE_CODE (__t
) != __c1
3718 && TREE_CODE (__t
) != __c2
3719 && TREE_CODE (__t
) != __c3
)
3720 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3725 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3726 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3728 if (TREE_CODE (__t
) == __c1
3729 || TREE_CODE (__t
) == __c2
3730 || TREE_CODE (__t
) == __c3
)
3731 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3736 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3737 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3738 enum tree_code __c4
)
3740 if (TREE_CODE (__t
) != __c1
3741 && TREE_CODE (__t
) != __c2
3742 && TREE_CODE (__t
) != __c3
3743 && TREE_CODE (__t
) != __c4
)
3744 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3749 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3750 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3751 enum tree_code __c4
)
3753 if (TREE_CODE (__t
) == __c1
3754 || TREE_CODE (__t
) == __c2
3755 || TREE_CODE (__t
) == __c3
3756 || TREE_CODE (__t
) == __c4
)
3757 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3762 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3763 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3764 enum tree_code __c4
, enum tree_code __c5
)
3766 if (TREE_CODE (__t
) != __c1
3767 && TREE_CODE (__t
) != __c2
3768 && TREE_CODE (__t
) != __c3
3769 && TREE_CODE (__t
) != __c4
3770 && TREE_CODE (__t
) != __c5
)
3771 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3776 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3777 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3778 enum tree_code __c4
, enum tree_code __c5
)
3780 if (TREE_CODE (__t
) == __c1
3781 || TREE_CODE (__t
) == __c2
3782 || TREE_CODE (__t
) == __c3
3783 || TREE_CODE (__t
) == __c4
3784 || TREE_CODE (__t
) == __c5
)
3785 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3790 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
3791 const char *__f
, int __l
, const char *__g
)
3793 if (tree_contains_struct
[TREE_CODE(__t
)][__s
] != 1)
3794 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3799 tree_class_check (tree __t
, const enum tree_code_class __class
,
3800 const char *__f
, int __l
, const char *__g
)
3802 if (TREE_CODE_CLASS (TREE_CODE(__t
)) != __class
)
3803 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3808 tree_range_check (tree __t
,
3809 enum tree_code __code1
, enum tree_code __code2
,
3810 const char *__f
, int __l
, const char *__g
)
3812 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3813 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3818 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
3819 const char *__f
, int __l
, const char *__g
)
3821 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3822 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3823 if (__t
->omp_clause
.code
!= __code
)
3824 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3829 omp_clause_range_check (tree __t
,
3830 enum omp_clause_code __code1
,
3831 enum omp_clause_code __code2
,
3832 const char *__f
, int __l
, const char *__g
)
3834 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3835 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3836 if ((int) __t
->omp_clause
.code
< (int) __code1
3837 || (int) __t
->omp_clause
.code
> (int) __code2
)
3838 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3842 /* These checks have to be special cased. */
3845 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3847 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3848 if (!IS_EXPR_CODE_CLASS (__c
))
3849 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3853 /* These checks have to be special cased. */
3856 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3859 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3864 tree_vec_elt_check (tree __t
, int __i
,
3865 const char *__f
, int __l
, const char *__g
)
3867 if (TREE_CODE (__t
) != TREE_VEC
)
3868 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3869 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3870 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3871 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3875 omp_clause_elt_check (tree __t
, int __i
,
3876 const char *__f
, int __l
, const char *__g
)
3878 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3879 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3880 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3881 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3882 return &__t
->omp_clause
.ops
[__i
];
3886 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3889 if (TREE_CODE (__t
) != __c
)
3890 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3895 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3898 if (TREE_CODE (__t
) == __c
)
3899 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3904 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3905 enum tree_code __c1
, enum tree_code __c2
)
3907 if (TREE_CODE (__t
) != __c1
3908 && TREE_CODE (__t
) != __c2
)
3909 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3914 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3915 enum tree_code __c1
, enum tree_code __c2
)
3917 if (TREE_CODE (__t
) == __c1
3918 || TREE_CODE (__t
) == __c2
)
3919 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3924 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3925 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3927 if (TREE_CODE (__t
) != __c1
3928 && TREE_CODE (__t
) != __c2
3929 && TREE_CODE (__t
) != __c3
)
3930 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3935 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3936 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3938 if (TREE_CODE (__t
) == __c1
3939 || TREE_CODE (__t
) == __c2
3940 || TREE_CODE (__t
) == __c3
)
3941 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3946 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3947 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3948 enum tree_code __c4
)
3950 if (TREE_CODE (__t
) != __c1
3951 && TREE_CODE (__t
) != __c2
3952 && TREE_CODE (__t
) != __c3
3953 && TREE_CODE (__t
) != __c4
)
3954 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3959 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3960 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3961 enum tree_code __c4
)
3963 if (TREE_CODE (__t
) == __c1
3964 || TREE_CODE (__t
) == __c2
3965 || TREE_CODE (__t
) == __c3
3966 || TREE_CODE (__t
) == __c4
)
3967 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3972 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3973 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3974 enum tree_code __c4
, enum tree_code __c5
)
3976 if (TREE_CODE (__t
) != __c1
3977 && TREE_CODE (__t
) != __c2
3978 && TREE_CODE (__t
) != __c3
3979 && TREE_CODE (__t
) != __c4
3980 && TREE_CODE (__t
) != __c5
)
3981 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3986 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3987 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3988 enum tree_code __c4
, enum tree_code __c5
)
3990 if (TREE_CODE (__t
) == __c1
3991 || TREE_CODE (__t
) == __c2
3992 || TREE_CODE (__t
) == __c3
3993 || TREE_CODE (__t
) == __c4
3994 || TREE_CODE (__t
) == __c5
)
3995 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
4000 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
4001 const char *__f
, int __l
, const char *__g
)
4003 if (tree_contains_struct
[TREE_CODE(__t
)][__s
] != 1)
4004 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
4009 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
4010 const char *__f
, int __l
, const char *__g
)
4012 if (TREE_CODE_CLASS (TREE_CODE(__t
)) != __class
)
4013 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
4018 tree_range_check (const_tree __t
,
4019 enum tree_code __code1
, enum tree_code __code2
,
4020 const char *__f
, int __l
, const char *__g
)
4022 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
4023 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
4028 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
4029 const char *__f
, int __l
, const char *__g
)
4031 if (TREE_CODE (__t
) != OMP_CLAUSE
)
4032 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
4033 if (__t
->omp_clause
.code
!= __code
)
4034 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
4039 omp_clause_range_check (const_tree __t
,
4040 enum omp_clause_code __code1
,
4041 enum omp_clause_code __code2
,
4042 const char *__f
, int __l
, const char *__g
)
4044 if (TREE_CODE (__t
) != OMP_CLAUSE
)
4045 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
4046 if ((int) __t
->omp_clause
.code
< (int) __code1
4047 || (int) __t
->omp_clause
.code
> (int) __code2
)
4048 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
4053 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
4055 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
4056 if (!IS_EXPR_CODE_CLASS (__c
))
4057 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
4062 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
4065 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
4070 tree_vec_elt_check (const_tree __t
, int __i
,
4071 const char *__f
, int __l
, const char *__g
)
4073 if (TREE_CODE (__t
) != TREE_VEC
)
4074 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
4075 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
4076 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
4077 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
4078 //return &__t->vec.a[__i];
4082 omp_clause_elt_check (const_tree __t
, int __i
,
4083 const char *__f
, int __l
, const char *__g
)
4085 if (TREE_CODE (__t
) != OMP_CLAUSE
)
4086 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
4087 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
4088 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
4089 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
4094 /* Compute the number of operands in an expression node NODE. For
4095 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4096 otherwise it is looked up from the node's code. */
4098 tree_operand_length (const_tree node
)
4100 if (VL_EXP_CLASS_P (node
))
4101 return VL_EXP_OPERAND_LENGTH (node
);
4103 return TREE_CODE_LENGTH (TREE_CODE (node
));
4106 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4108 /* Special checks for TREE_OPERANDs. */
4110 tree_operand_check (tree __t
, int __i
,
4111 const char *__f
, int __l
, const char *__g
)
4113 const_tree __u
= EXPR_CHECK (__t
);
4114 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
4115 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
4116 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
4120 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
4121 const char *__f
, int __l
, const char *__g
)
4123 if (TREE_CODE (__t
) != __code
)
4124 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
4125 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
4126 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
4127 return &__t
->exp
.operands
[__i
];
4131 tree_operand_check (const_tree __t
, int __i
,
4132 const char *__f
, int __l
, const char *__g
)
4134 const_tree __u
= EXPR_CHECK (__t
);
4135 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
4136 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
4137 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
4141 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
4142 const char *__f
, int __l
, const char *__g
)
4144 if (TREE_CODE (__t
) != __code
)
4145 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
4146 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
4147 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
4148 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
4154 /* Standard named or nameless data types of the C compiler. */
4178 TI_INTEGER_MINUS_ONE
,
4195 TI_COMPLEX_INTEGER_TYPE
,
4196 TI_COMPLEX_FLOAT_TYPE
,
4197 TI_COMPLEX_DOUBLE_TYPE
,
4198 TI_COMPLEX_LONG_DOUBLE_TYPE
,
4202 TI_LONG_DOUBLE_TYPE
,
4206 TI_LONG_DOUBLE_PTR_TYPE
,
4207 TI_INTEGER_PTR_TYPE
,
4216 TI_VA_LIST_GPR_COUNTER_FIELD
,
4217 TI_VA_LIST_FPR_COUNTER_FIELD
,
4224 TI_DFLOAT32_PTR_TYPE
,
4225 TI_DFLOAT64_PTR_TYPE
,
4226 TI_DFLOAT128_PTR_TYPE
,
4235 TI_SAT_LLFRACT_TYPE
,
4236 TI_SAT_USFRACT_TYPE
,
4238 TI_SAT_ULFRACT_TYPE
,
4239 TI_SAT_ULLFRACT_TYPE
,
4251 TI_SAT_LLACCUM_TYPE
,
4252 TI_SAT_USACCUM_TYPE
,
4254 TI_SAT_ULACCUM_TYPE
,
4255 TI_SAT_ULLACCUM_TYPE
,
4301 TI_OPTIMIZATION_DEFAULT
,
4302 TI_OPTIMIZATION_CURRENT
,
4303 TI_TARGET_OPTION_DEFAULT
,
4304 TI_TARGET_OPTION_CURRENT
,
4305 TI_CURRENT_TARGET_PRAGMA
,
4306 TI_CURRENT_OPTIMIZE_PRAGMA
,
4311 extern GTY(()) tree global_trees
[TI_MAX
];
4313 #define error_mark_node global_trees[TI_ERROR_MARK]
4315 #define intQI_type_node global_trees[TI_INTQI_TYPE]
4316 #define intHI_type_node global_trees[TI_INTHI_TYPE]
4317 #define intSI_type_node global_trees[TI_INTSI_TYPE]
4318 #define intDI_type_node global_trees[TI_INTDI_TYPE]
4319 #define intTI_type_node global_trees[TI_INTTI_TYPE]
4321 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
4322 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
4323 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
4324 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
4325 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
4327 #define uint16_type_node global_trees[TI_UINT16_TYPE]
4328 #define uint32_type_node global_trees[TI_UINT32_TYPE]
4329 #define uint64_type_node global_trees[TI_UINT64_TYPE]
4331 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
4332 #define integer_one_node global_trees[TI_INTEGER_ONE]
4333 #define integer_three_node global_trees[TI_INTEGER_THREE]
4334 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
4335 #define size_zero_node global_trees[TI_SIZE_ZERO]
4336 #define size_one_node global_trees[TI_SIZE_ONE]
4337 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
4338 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
4339 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
4341 /* Base access nodes. */
4342 #define access_public_node global_trees[TI_PUBLIC]
4343 #define access_protected_node global_trees[TI_PROTECTED]
4344 #define access_private_node global_trees[TI_PRIVATE]
4346 #define null_pointer_node global_trees[TI_NULL_POINTER]
4348 #define float_type_node global_trees[TI_FLOAT_TYPE]
4349 #define double_type_node global_trees[TI_DOUBLE_TYPE]
4350 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
4352 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
4353 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
4354 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
4355 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
4357 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
4358 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
4359 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
4360 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
4362 #define void_type_node global_trees[TI_VOID_TYPE]
4363 /* The C type `void *'. */
4364 #define ptr_type_node global_trees[TI_PTR_TYPE]
4365 /* The C type `const void *'. */
4366 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
4367 /* The C type `size_t'. */
4368 #define size_type_node global_trees[TI_SIZE_TYPE]
4369 #define pid_type_node global_trees[TI_PID_TYPE]
4370 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
4371 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
4372 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
4373 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
4374 /* The C type `FILE *'. */
4375 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
4377 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
4378 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
4379 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
4381 /* The decimal floating point types. */
4382 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
4383 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
4384 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
4385 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
4386 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
4387 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
4389 /* The fixed-point types. */
4390 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
4391 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
4392 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
4393 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
4394 #define sat_unsigned_short_fract_type_node \
4395 global_trees[TI_SAT_USFRACT_TYPE]
4396 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4397 #define sat_unsigned_long_fract_type_node \
4398 global_trees[TI_SAT_ULFRACT_TYPE]
4399 #define sat_unsigned_long_long_fract_type_node \
4400 global_trees[TI_SAT_ULLFRACT_TYPE]
4401 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4402 #define fract_type_node global_trees[TI_FRACT_TYPE]
4403 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4404 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4405 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4406 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4407 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4408 #define unsigned_long_long_fract_type_node \
4409 global_trees[TI_ULLFRACT_TYPE]
4410 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4411 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4412 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4413 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4414 #define sat_unsigned_short_accum_type_node \
4415 global_trees[TI_SAT_USACCUM_TYPE]
4416 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4417 #define sat_unsigned_long_accum_type_node \
4418 global_trees[TI_SAT_ULACCUM_TYPE]
4419 #define sat_unsigned_long_long_accum_type_node \
4420 global_trees[TI_SAT_ULLACCUM_TYPE]
4421 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4422 #define accum_type_node global_trees[TI_ACCUM_TYPE]
4423 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4424 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4425 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4426 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4427 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4428 #define unsigned_long_long_accum_type_node \
4429 global_trees[TI_ULLACCUM_TYPE]
4430 #define qq_type_node global_trees[TI_QQ_TYPE]
4431 #define hq_type_node global_trees[TI_HQ_TYPE]
4432 #define sq_type_node global_trees[TI_SQ_TYPE]
4433 #define dq_type_node global_trees[TI_DQ_TYPE]
4434 #define tq_type_node global_trees[TI_TQ_TYPE]
4435 #define uqq_type_node global_trees[TI_UQQ_TYPE]
4436 #define uhq_type_node global_trees[TI_UHQ_TYPE]
4437 #define usq_type_node global_trees[TI_USQ_TYPE]
4438 #define udq_type_node global_trees[TI_UDQ_TYPE]
4439 #define utq_type_node global_trees[TI_UTQ_TYPE]
4440 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4441 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4442 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4443 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4444 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4445 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4446 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4447 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4448 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4449 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4450 #define ha_type_node global_trees[TI_HA_TYPE]
4451 #define sa_type_node global_trees[TI_SA_TYPE]
4452 #define da_type_node global_trees[TI_DA_TYPE]
4453 #define ta_type_node global_trees[TI_TA_TYPE]
4454 #define uha_type_node global_trees[TI_UHA_TYPE]
4455 #define usa_type_node global_trees[TI_USA_TYPE]
4456 #define uda_type_node global_trees[TI_UDA_TYPE]
4457 #define uta_type_node global_trees[TI_UTA_TYPE]
4458 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4459 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4460 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4461 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4462 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4463 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4464 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4465 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4467 /* The node that should be placed at the end of a parameter list to
4468 indicate that the function does not take a variable number of
4469 arguments. The TREE_VALUE will be void_type_node and there will be
4470 no TREE_CHAIN. Language-independent code should not assume
4471 anything else about this node. */
4472 #define void_list_node global_trees[TI_VOID_LIST_NODE]
4474 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4475 #define MAIN_NAME_P(NODE) \
4476 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4478 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4480 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4481 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4483 /* Default/current target options (TARGET_OPTION_NODE). */
4484 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4485 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4487 /* Default tree list option(), optimize() pragmas to be linked into the
4489 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4490 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4492 /* An enumeration of the standard C integer types. These must be
4493 ordered so that shorter types appear before longer ones, and so
4494 that signed types appear before unsigned ones, for the correct
4495 functioning of interpret_integer() in c-lex.c. */
4496 enum integer_type_kind
4508 itk_unsigned_long_long
,
4510 itk_unsigned_int128
,
4514 typedef enum integer_type_kind integer_type_kind
;
4516 /* The standard C integer types. Use integer_type_kind to index into
4518 extern GTY(()) tree integer_types
[itk_none
];
4520 #define char_type_node integer_types[itk_char]
4521 #define signed_char_type_node integer_types[itk_signed_char]
4522 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4523 #define short_integer_type_node integer_types[itk_short]
4524 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4525 #define integer_type_node integer_types[itk_int]
4526 #define unsigned_type_node integer_types[itk_unsigned_int]
4527 #define long_integer_type_node integer_types[itk_long]
4528 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4529 #define long_long_integer_type_node integer_types[itk_long_long]
4530 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4531 #define int128_integer_type_node integer_types[itk_int128]
4532 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
4534 /* A pointer-to-function member type looks like:
4541 If __pfn is NULL, it is a NULL pointer-to-member-function.
4543 (Because the vtable is always the first thing in the object, we
4544 don't need its offset.) If the function is virtual, then PFN is
4545 one plus twice the index into the vtable; otherwise, it is just a
4546 pointer to the function.
4548 Unfortunately, using the lowest bit of PFN doesn't work in
4549 architectures that don't impose alignment requirements on function
4550 addresses, or that use the lowest bit to tell one ISA from another,
4551 for example. For such architectures, we use the lowest bit of
4552 DELTA instead of the lowest bit of the PFN, and DELTA will be
4555 enum ptrmemfunc_vbit_where_t
4557 ptrmemfunc_vbit_in_pfn
,
4558 ptrmemfunc_vbit_in_delta
4561 #define NULL_TREE (tree) NULL
4563 /* True if NODE is an erroneous expression. */
4565 #define error_operand_p(NODE) \
4566 ((NODE) == error_mark_node \
4567 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
4569 extern tree
decl_assembler_name (tree
);
4570 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
4571 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
4573 /* Compute the number of bytes occupied by 'node'. This routine only
4574 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4576 extern size_t tree_size (const_tree
);
4578 /* Compute the number of bytes occupied by a tree with code CODE. This
4579 function cannot be used for TREE_VEC codes, which are of variable
4581 extern size_t tree_code_size (enum tree_code
);
4583 /* Allocate and return a new UID from the DECL_UID namespace. */
4584 extern int allocate_decl_uid (void);
4586 /* Lowest level primitive for allocating a node.
4587 The TREE_CODE is the only argument. Contents are initialized
4588 to zero except for a few of the common fields. */
4590 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
4591 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
4593 /* Make a copy of a node, with all the same contents. */
4595 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
4596 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
4598 /* Make a copy of a chain of TREE_LIST nodes. */
4600 extern tree
copy_list (tree
);
4602 /* Make a CASE_LABEL_EXPR. */
4604 extern tree
build_case_label (tree
, tree
, tree
);
4607 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
4608 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
4610 /* Make a TREE_VEC. */
4612 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
4613 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
4615 /* Return the (unique) IDENTIFIER_NODE node for a given name.
4616 The name is supplied as a char *. */
4618 extern tree
get_identifier (const char *);
4620 #if GCC_VERSION >= 3000
4621 #define get_identifier(str) \
4622 (__builtin_constant_p (str) \
4623 ? get_identifier_with_length ((str), strlen (str)) \
4624 : get_identifier (str))
4628 /* Identical to get_identifier, except that the length is assumed
4631 extern tree
get_identifier_with_length (const char *, size_t);
4633 /* If an identifier with the name TEXT (a null-terminated string) has
4634 previously been referred to, return that node; otherwise return
4637 extern tree
maybe_get_identifier (const char *);
4639 /* Construct various types of nodes. */
4641 extern tree
build_nt (enum tree_code
, ...);
4642 extern tree
build_nt_call_vec (tree
, VEC(tree
,gc
) *);
4644 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
4645 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
4646 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
4647 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
4648 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
4649 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
4650 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
4651 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
4652 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
4653 tree MEM_STAT_DECL
);
4654 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4655 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4656 tree MEM_STAT_DECL
);
4657 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4659 /* _loc versions of build[1-5]. */
4662 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
4663 tree arg1 MEM_STAT_DECL
)
4665 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
4666 if (CAN_HAVE_LOCATION_P (t
))
4667 SET_EXPR_LOCATION (t
, loc
);
4670 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
4673 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4674 tree arg1 MEM_STAT_DECL
)
4676 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4677 if (CAN_HAVE_LOCATION_P (t
))
4678 SET_EXPR_LOCATION (t
, loc
);
4681 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
4684 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4685 tree arg1
, tree arg2 MEM_STAT_DECL
)
4687 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4688 if (CAN_HAVE_LOCATION_P (t
))
4689 SET_EXPR_LOCATION (t
, loc
);
4692 #define build3_loc(l,c,t1,t2,t3,t4) \
4693 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
4696 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4697 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
4699 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4700 if (CAN_HAVE_LOCATION_P (t
))
4701 SET_EXPR_LOCATION (t
, loc
);
4704 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
4705 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4708 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4709 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4711 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
4712 arg4 PASS_MEM_STAT
);
4713 if (CAN_HAVE_LOCATION_P (t
))
4714 SET_EXPR_LOCATION (t
, loc
);
4717 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
4718 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4720 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
4721 #define build_var_debug_value(t1,t2) \
4722 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
4724 /* Constructs double_int from tree CST. */
4726 static inline double_int
4727 tree_to_double_int (const_tree cst
)
4729 return TREE_INT_CST (cst
);
4732 extern tree
double_int_to_tree (tree
, double_int
);
4733 extern bool double_int_fits_to_tree_p (const_tree
, double_int
);
4734 extern tree
force_fit_type_double (tree
, double_int
, int, bool);
4736 /* Create an INT_CST node with a CST value zero extended. */
4739 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
4741 return double_int_to_tree (type
, double_int::from_uhwi (cst
));
4744 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
4745 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
4746 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
4747 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
4748 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
4749 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
4750 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
4751 extern tree
build_vector_from_ctor (tree
, VEC(constructor_elt
,gc
) *);
4752 extern tree
build_vector_from_val (tree
, tree
);
4753 extern tree
build_constructor (tree
, VEC(constructor_elt
,gc
) *);
4754 extern tree
build_constructor_single (tree
, tree
, tree
);
4755 extern tree
build_constructor_from_list (tree
, tree
);
4756 extern tree
build_real_from_int_cst (tree
, const_tree
);
4757 extern tree
build_complex (tree
, tree
, tree
);
4758 extern tree
build_one_cst (tree
);
4759 extern tree
build_zero_cst (tree
);
4760 extern tree
build_string (int, const char *);
4761 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
4762 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4763 extern tree
build_tree_list_vec_stat (const VEC(tree
,gc
) * MEM_STAT_DECL
);
4764 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
4765 extern tree
build_decl_stat (location_t
, enum tree_code
,
4766 tree
, tree MEM_STAT_DECL
);
4767 extern tree
build_fn_decl (const char *, tree
);
4768 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
4769 extern tree
build_translation_unit_decl (tree
);
4770 extern tree
build_block (tree
, tree
, tree
, tree
);
4771 extern tree
build_empty_stmt (location_t
);
4772 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4774 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
4775 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4777 extern tree
build_call_nary (tree
, tree
, int, ...);
4778 extern tree
build_call_valist (tree
, tree
, int, va_list);
4779 #define build_call_array(T1,T2,N,T3)\
4780 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4781 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4782 extern tree
build_call_vec (tree
, tree
, VEC(tree
,gc
) *);
4784 /* Construct various nodes representing data types. */
4786 extern tree
make_signed_type (int);
4787 extern tree
make_unsigned_type (int);
4788 extern tree
signed_or_unsigned_type_for (int, tree
);
4789 extern tree
signed_type_for (tree
);
4790 extern tree
unsigned_type_for (tree
);
4791 extern tree
truth_type_for (tree
);
4792 extern void initialize_sizetypes (void);
4793 extern void fixup_unsigned_type (tree
);
4794 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
4795 extern tree
build_pointer_type (tree
);
4796 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
4797 extern tree
build_reference_type (tree
);
4798 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
4799 extern tree
build_vector_type (tree innertype
, int nunits
);
4800 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
4801 extern tree
build_type_no_quals (tree
);
4802 extern tree
build_index_type (tree
);
4803 extern tree
build_array_type (tree
, tree
);
4804 extern tree
build_nonshared_array_type (tree
, tree
);
4805 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
4806 extern tree
build_function_type (tree
, tree
);
4807 extern tree
build_function_type_list (tree
, ...);
4808 extern tree
build_function_decl_skip_args (tree
, bitmap
, bool);
4809 extern tree
build_varargs_function_type_list (tree
, ...);
4810 extern tree
build_function_type_array (tree
, int, tree
*);
4811 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4812 #define build_function_type_vec(RET, V) \
4813 build_function_type_array (RET, VEC_length (tree, V), VEC_address (tree, V))
4814 #define build_varargs_function_type_vec(RET, V) \
4815 build_varargs_function_type_array (RET, VEC_length (tree, V), \
4816 VEC_address (tree, V))
4817 extern tree
build_method_type_directly (tree
, tree
, tree
);
4818 extern tree
build_method_type (tree
, tree
);
4819 extern tree
build_offset_type (tree
, tree
);
4820 extern tree
build_complex_type (tree
);
4821 extern tree
array_type_nelts (const_tree
);
4822 extern bool in_array_bounds_p (tree
);
4823 extern bool range_in_array_bounds_p (tree
);
4825 extern tree
value_member (tree
, tree
);
4826 extern tree
purpose_member (const_tree
, tree
);
4827 extern bool vec_member (const_tree
, VEC(tree
,gc
) *);
4828 extern tree
chain_index (int, tree
);
4830 extern int attribute_list_equal (const_tree
, const_tree
);
4831 extern int attribute_list_contained (const_tree
, const_tree
);
4832 extern int tree_int_cst_equal (const_tree
, const_tree
);
4833 extern int tree_int_cst_lt (const_tree
, const_tree
);
4834 extern int tree_int_cst_compare (const_tree
, const_tree
);
4835 extern int host_integerp (const_tree
, int)
4836 #ifndef ENABLE_TREE_CHECKING
4837 ATTRIBUTE_PURE
/* host_integerp is pure only when checking is disabled. */
4840 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
4841 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4842 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4843 tree_low_cst (const_tree t
, int pos
)
4845 gcc_assert (host_integerp (t
, pos
));
4846 return TREE_INT_CST_LOW (t
);
4849 extern HOST_WIDE_INT
size_low_cst (const_tree
);
4850 extern int tree_int_cst_sgn (const_tree
);
4851 extern int tree_int_cst_sign_bit (const_tree
);
4852 extern unsigned int tree_int_cst_min_precision (tree
, bool);
4853 extern bool tree_expr_nonnegative_p (tree
);
4854 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
4855 extern bool may_negate_without_overflow_p (const_tree
);
4856 extern tree
strip_array_types (tree
);
4857 extern tree
excess_precision_type (tree
);
4858 extern bool valid_constant_size_p (const_tree
);
4860 /* Construct various nodes representing fract or accum data types. */
4862 extern tree
make_fract_type (int, int, int);
4863 extern tree
make_accum_type (int, int, int);
4865 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4866 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4867 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4868 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4869 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4870 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4871 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4872 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4874 #define make_or_reuse_signed_fract_type(P) \
4875 make_or_reuse_fract_type (P, 0, 0)
4876 #define make_or_reuse_unsigned_fract_type(P) \
4877 make_or_reuse_fract_type (P, 1, 0)
4878 #define make_or_reuse_sat_signed_fract_type(P) \
4879 make_or_reuse_fract_type (P, 0, 1)
4880 #define make_or_reuse_sat_unsigned_fract_type(P) \
4881 make_or_reuse_fract_type (P, 1, 1)
4882 #define make_or_reuse_signed_accum_type(P) \
4883 make_or_reuse_accum_type (P, 0, 0)
4884 #define make_or_reuse_unsigned_accum_type(P) \
4885 make_or_reuse_accum_type (P, 1, 0)
4886 #define make_or_reuse_sat_signed_accum_type(P) \
4887 make_or_reuse_accum_type (P, 0, 1)
4888 #define make_or_reuse_sat_unsigned_accum_type(P) \
4889 make_or_reuse_accum_type (P, 1, 1)
4891 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4892 put the prototype here. Rtl.h does declare the prototype if
4893 tree.h had been included. */
4895 extern tree
make_tree (tree
, rtx
);
4897 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4900 Such modified types already made are recorded so that duplicates
4903 extern tree
build_type_attribute_variant (tree
, tree
);
4904 extern tree
build_decl_attribute_variant (tree
, tree
);
4905 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
4907 /* Return 0 if the attributes for two types are incompatible, 1 if they
4908 are compatible, and 2 if they are nearly compatible (which causes a
4909 warning to be generated). */
4910 extern int comp_type_attributes (const_tree
, const_tree
);
4912 /* Structure describing an attribute and a function to handle it. */
4913 struct attribute_spec
4915 /* The name of the attribute (without any leading or trailing __),
4916 or NULL to mark the end of a table of attributes. */
4918 /* The minimum length of the list of arguments of the attribute. */
4920 /* The maximum length of the list of arguments of the attribute
4921 (-1 for no maximum). */
4923 /* Whether this attribute requires a DECL. If it does, it will be passed
4924 from types of DECLs, function return types and array element types to
4925 the DECLs, function types and array types respectively; but when
4926 applied to a type in any other circumstances, it will be ignored with
4927 a warning. (If greater control is desired for a given attribute,
4928 this should be false, and the flags argument to the handler may be
4929 used to gain greater control in that case.) */
4931 /* Whether this attribute requires a type. If it does, it will be passed
4932 from a DECL to the type of that DECL. */
4934 /* Whether this attribute requires a function (or method) type. If it does,
4935 it will be passed from a function pointer type to the target type,
4936 and from a function return type (which is not itself a function
4937 pointer type) to the function type. */
4938 bool function_type_required
;
4939 /* Function to handle this attribute. NODE points to the node to which
4940 the attribute is to be applied. If a DECL, it should be modified in
4941 place; if a TYPE, a copy should be created. NAME is the name of the
4942 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4943 of the arguments (which may be NULL). FLAGS gives further information
4944 about the context of the attribute. Afterwards, the attributes will
4945 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4946 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4947 as well as in any other cases when the attributes should not be added
4948 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4949 applied to another type or DECL later may be returned;
4950 otherwise the return value should be NULL_TREE. This pointer may be
4951 NULL if no special handling is required beyond the checks implied
4952 by the rest of this structure. */
4953 tree (*handler
) (tree
*node
, tree name
, tree args
,
4954 int flags
, bool *no_add_attrs
);
4955 /* Specifies if attribute affects type's identity. */
4956 bool affects_type_identity
;
4959 /* Flags that may be passed in the third argument of decl_attributes, and
4960 to handler functions for attributes. */
4961 enum attribute_flags
4963 /* The type passed in is the type of a DECL, and any attributes that
4964 should be passed in again to be applied to the DECL rather than the
4965 type should be returned. */
4966 ATTR_FLAG_DECL_NEXT
= 1,
4967 /* The type passed in is a function return type, and any attributes that
4968 should be passed in again to be applied to the function type rather
4969 than the return type should be returned. */
4970 ATTR_FLAG_FUNCTION_NEXT
= 2,
4971 /* The type passed in is an array element type, and any attributes that
4972 should be passed in again to be applied to the array type rather
4973 than the element type should be returned. */
4974 ATTR_FLAG_ARRAY_NEXT
= 4,
4975 /* The type passed in is a structure, union or enumeration type being
4976 created, and should be modified in place. */
4977 ATTR_FLAG_TYPE_IN_PLACE
= 8,
4978 /* The attributes are being applied by default to a library function whose
4979 name indicates known behavior, and should be silently ignored if they
4980 are not in fact compatible with the function type. */
4981 ATTR_FLAG_BUILT_IN
= 16,
4982 /* A given attribute has been parsed as a C++-11 attribute. */
4983 ATTR_FLAG_CXX11
= 32
4986 /* Default versions of target-overridable functions. */
4988 extern tree
merge_decl_attributes (tree
, tree
);
4989 extern tree
merge_type_attributes (tree
, tree
);
4991 /* This function is a private implementation detail of lookup_attribute()
4992 and you should never call it directly. */
4993 extern tree
private_lookup_attribute (const char *, size_t, tree
);
4995 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4996 return a pointer to the attribute's list element if the attribute
4997 is part of the list, or NULL_TREE if not found. If the attribute
4998 appears more than once, this only returns the first occurrence; the
4999 TREE_CHAIN of the return value should be passed back in if further
5000 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
5004 lookup_attribute (const char *attr_name
, tree list
)
5006 gcc_checking_assert (attr_name
[0] != '_');
5007 /* In most cases, list is NULL_TREE. */
5008 if (list
== NULL_TREE
)
5011 /* Do the strlen() before calling the out-of-line implementation.
5012 In most cases attr_name is a string constant, and the compiler
5013 will optimize the strlen() away. */
5014 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
5017 /* This function is a private implementation detail of
5018 is_attribute_p() and you should never call it directly. */
5019 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
5021 /* Given an identifier node IDENT and a string ATTR_NAME, return true
5022 if the identifier node is a valid attribute name for the string.
5023 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
5024 be the identifier for 'text' or for '__text__'. */
5027 is_attribute_p (const char *attr_name
, const_tree ident
)
5029 gcc_checking_assert (attr_name
[0] != '_');
5030 /* Do the strlen() before calling the out-of-line implementation.
5031 In most cases attr_name is a string constant, and the compiler
5032 will optimize the strlen() away. */
5033 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
5036 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5037 modified list. ATTR_NAME must be in the form 'text' (not
5040 extern tree
remove_attribute (const char *, tree
);
5042 /* Given two attributes lists, return a list of their union. */
5044 extern tree
merge_attributes (tree
, tree
);
5046 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5047 /* Given two Windows decl attributes lists, possibly including
5048 dllimport, return a list of their union . */
5049 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
5051 /* Handle a "dllimport" or "dllexport" attribute. */
5052 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
5055 /* Check whether CAND is suitable to be returned from get_qualified_type
5056 (BASE, TYPE_QUALS). */
5058 extern bool check_qualified_type (const_tree
, const_tree
, int);
5060 /* Return a version of the TYPE, qualified as indicated by the
5061 TYPE_QUALS, if one exists. If no qualified version exists yet,
5062 return NULL_TREE. */
5064 extern tree
get_qualified_type (tree
, int);
5066 /* Like get_qualified_type, but creates the type if it does not
5067 exist. This function never returns NULL_TREE. */
5069 extern tree
build_qualified_type (tree
, int);
5071 /* Create a variant of type T with alignment ALIGN. */
5073 extern tree
build_aligned_type (tree
, unsigned int);
5075 /* Like build_qualified_type, but only deals with the `const' and
5076 `volatile' qualifiers. This interface is retained for backwards
5077 compatibility with the various front-ends; new code should use
5078 build_qualified_type instead. */
5080 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
5081 build_qualified_type ((TYPE), \
5082 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
5083 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
5085 /* Make a copy of a type node. */
5087 extern tree
build_distinct_type_copy (tree
);
5088 extern tree
build_variant_type_copy (tree
);
5090 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
5091 fields. Optionally specify an alignment, and then lay it out. */
5093 extern void finish_builtin_struct (tree
, const char *,
5096 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
5097 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
5098 node, does nothing except for the first time. */
5100 extern void layout_type (tree
);
5102 /* These functions allow a front-end to perform a manual layout of a
5103 RECORD_TYPE. (For instance, if the placement of subsequent fields
5104 depends on the placement of fields so far.) Begin by calling
5105 start_record_layout. Then, call place_field for each of the
5106 fields. Then, call finish_record_layout. See layout_type for the
5107 default way in which these functions are used. */
5109 typedef struct record_layout_info_s
5111 /* The RECORD_TYPE that we are laying out. */
5113 /* The offset into the record so far, in bytes, not including bits in
5116 /* The last known alignment of SIZE. */
5117 unsigned int offset_align
;
5118 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
5120 /* The alignment of the record so far, in bits. */
5121 unsigned int record_align
;
5122 /* The alignment of the record so far, ignoring #pragma pack and
5123 __attribute__ ((packed)), in bits. */
5124 unsigned int unpacked_align
;
5125 /* The previous field laid out. */
5127 /* The static variables (i.e., class variables, as opposed to
5128 instance variables) encountered in T. */
5129 VEC(tree
,gc
) *pending_statics
;
5130 /* Bits remaining in the current alignment group */
5131 int remaining_in_alignment
;
5132 /* True if we've seen a packed field that didn't have normal
5133 alignment anyway. */
5134 int packed_maybe_necessary
;
5135 } *record_layout_info
;
5137 extern record_layout_info
start_record_layout (tree
);
5138 extern tree
bit_from_pos (tree
, tree
);
5139 extern tree
byte_from_pos (tree
, tree
);
5140 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
5141 extern void normalize_offset (tree
*, tree
*, unsigned int);
5142 extern tree
rli_size_unit_so_far (record_layout_info
);
5143 extern tree
rli_size_so_far (record_layout_info
);
5144 extern void normalize_rli (record_layout_info
);
5145 extern void place_field (record_layout_info
, tree
);
5146 extern void compute_record_mode (tree
);
5147 extern void finish_record_layout (record_layout_info
, int);
5149 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
5150 return a canonicalized ..._TYPE node, so that duplicates are not made.
5151 How the hash code is computed is up to the caller, as long as any two
5152 callers that could hash identical-looking type nodes agree. */
5154 extern tree
type_hash_canon (unsigned int, tree
);
5156 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
5157 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
5158 fields. Call this only once for any given decl node.
5160 Second argument is the boundary that this field can be assumed to
5161 be starting at (in bits). Zero means it can be assumed aligned
5162 on any boundary that may be needed. */
5164 extern void layout_decl (tree
, unsigned);
5166 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
5167 a previous call to layout_decl and calls it again. */
5169 extern void relayout_decl (tree
);
5171 /* Return the mode for data of a given size SIZE and mode class CLASS.
5172 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
5173 The value is BLKmode if no other mode is found. This is like
5174 mode_for_size, but is passed a tree. */
5176 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
5178 /* Return an expr equal to X but certainly not valid as an lvalue. */
5180 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
5181 extern tree
non_lvalue_loc (location_t
, tree
);
5183 extern tree
convert (tree
, tree
);
5184 extern unsigned int expr_align (const_tree
);
5185 extern tree
expr_first (tree
);
5186 extern tree
expr_last (tree
);
5187 extern tree
size_in_bytes (const_tree
);
5188 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
5189 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
5190 extern tree
tree_expr_size (const_tree
);
5191 extern tree
bit_position (const_tree
);
5192 extern HOST_WIDE_INT
int_bit_position (const_tree
);
5193 extern tree
byte_position (const_tree
);
5194 extern HOST_WIDE_INT
int_byte_position (const_tree
);
5196 /* Define data structures, macros, and functions for handling sizes
5197 and the various types used to represent sizes. */
5201 stk_sizetype
, /* Normal representation of sizes in bytes. */
5202 stk_ssizetype
, /* Signed representation of sizes in bytes. */
5203 stk_bitsizetype
, /* Normal representation of sizes in bits. */
5204 stk_sbitsizetype
, /* Signed representation of sizes in bits. */
5208 extern GTY(()) tree sizetype_tab
[(int) stk_type_kind_last
];
5210 #define sizetype sizetype_tab[(int) stk_sizetype]
5211 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
5212 #define ssizetype sizetype_tab[(int) stk_ssizetype]
5213 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
5215 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
5216 #define size_binop(CODE,T1,T2)\
5217 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5218 extern tree
size_binop_loc (location_t
, enum tree_code
, tree
, tree
);
5219 #define size_diffop(T1,T2)\
5220 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
5221 extern tree
size_diffop_loc (location_t
, tree
, tree
);
5223 #define size_int(L) size_int_kind (L, stk_sizetype)
5224 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
5225 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
5226 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
5228 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
5229 extern tree
round_up_loc (location_t
, tree
, int);
5230 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
5231 extern tree
round_down_loc (location_t
, tree
, int);
5232 extern void finalize_size_functions (void);
5234 /* Type for sizes of data-type. */
5236 #define BITS_PER_UNIT_LOG \
5237 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
5238 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
5239 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
5241 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
5242 extern unsigned int maximum_field_alignment
;
5244 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
5245 by making the last node in X point to Y.
5246 Returns X, except if X is 0 returns Y. */
5248 extern tree
chainon (tree
, tree
);
5250 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
5252 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
5253 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
5255 /* Return the last tree node in a chain. */
5257 extern tree
tree_last (tree
);
5259 /* Reverse the order of elements in a chain, and return the new head. */
5261 extern tree
nreverse (tree
);
5263 /* Returns the length of a chain of nodes
5264 (number of chain pointers to follow before reaching a null pointer). */
5266 extern int list_length (const_tree
);
5268 /* Returns the number of FIELD_DECLs in a type. */
5270 extern int fields_length (const_tree
);
5272 /* Returns the first FIELD_DECL in a type. */
5274 extern tree
first_field (const_tree
);
5276 /* Given an initializer INIT, return TRUE if INIT is zero or some
5277 aggregate of zeros. Otherwise return FALSE. */
5279 extern bool initializer_zerop (const_tree
);
5281 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
5283 extern VEC(tree
,gc
) *ctor_to_vec (tree
);
5285 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*,
5286 HOST_WIDE_INT
*, bool *);
5288 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
5290 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
5292 extern int integer_zerop (const_tree
);
5294 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
5296 extern int integer_onep (const_tree
);
5298 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
5299 all of whose significant bits are 1. */
5301 extern int integer_all_onesp (const_tree
);
5303 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
5304 exactly one bit 1. */
5306 extern int integer_pow2p (const_tree
);
5308 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
5309 with a nonzero value. */
5311 extern int integer_nonzerop (const_tree
);
5313 extern bool cst_and_fits_in_hwi (const_tree
);
5314 extern tree
num_ending_zeros (const_tree
);
5316 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
5319 extern int fixed_zerop (const_tree
);
5321 /* staticp (tree x) is nonzero if X is a reference to data allocated
5322 at a fixed address in memory. Returns the outermost data. */
5324 extern tree
staticp (tree
);
5326 /* save_expr (EXP) returns an expression equivalent to EXP
5327 but it can be used multiple times within context CTX
5328 and only evaluate EXP once. */
5330 extern tree
save_expr (tree
);
5332 /* Look inside EXPR and into any simple arithmetic operations. Return
5333 the innermost non-arithmetic node. */
5335 extern tree
skip_simple_arithmetic (tree
);
5337 /* Return which tree structure is used by T. */
5339 enum tree_node_structure_enum
tree_node_structure (const_tree
);
5341 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
5342 size or offset that depends on a field within a record. */
5344 extern bool contains_placeholder_p (const_tree
);
5346 /* This macro calls the above function but short-circuits the common
5347 case of a constant to save time. Also check for null. */
5349 #define CONTAINS_PLACEHOLDER_P(EXP) \
5350 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
5352 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
5353 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
5356 extern bool type_contains_placeholder_p (tree
);
5358 /* Given a tree EXP, find all occurrences of references to fields
5359 in a PLACEHOLDER_EXPR and place them in vector REFS without
5360 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
5361 we assume here that EXP contains only arithmetic expressions
5362 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
5365 extern void find_placeholder_in_expr (tree
, VEC (tree
, heap
) **);
5367 /* This macro calls the above function but short-circuits the common
5368 case of a constant to save time and also checks for NULL. */
5370 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
5372 if((EXP) && !TREE_CONSTANT (EXP)) \
5373 find_placeholder_in_expr (EXP, V); \
5376 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
5377 return a tree with all occurrences of references to F in a
5378 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
5379 CONST_DECLs. Note that we assume here that EXP contains only
5380 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
5381 occurring only in their argument list. */
5383 extern tree
substitute_in_expr (tree
, tree
, tree
);
5385 /* This macro calls the above function but short-circuits the common
5386 case of a constant to save time and also checks for NULL. */
5388 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
5389 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
5391 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
5392 for it within OBJ, a tree that is an object or a chain of references. */
5394 extern tree
substitute_placeholder_in_expr (tree
, tree
);
5396 /* This macro calls the above function but short-circuits the common
5397 case of a constant to save time and also checks for NULL. */
5399 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
5400 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
5401 : substitute_placeholder_in_expr (EXP, OBJ))
5403 /* variable_size (EXP) is like save_expr (EXP) except that it
5404 is for the special case of something that is part of a
5405 variable size for a data type. It makes special arrangements
5406 to compute the value at the right time when the data type
5407 belongs to a function parameter. */
5409 extern tree
variable_size (tree
);
5411 /* stabilize_reference (EXP) returns a reference equivalent to EXP
5412 but it can be used multiple times
5413 and only evaluate the subexpressions once. */
5415 extern tree
stabilize_reference (tree
);
5417 /* Subroutine of stabilize_reference; this is called for subtrees of
5418 references. Any expression with side-effects must be put in a SAVE_EXPR
5419 to ensure that it is only evaluated once. */
5421 extern tree
stabilize_reference_1 (tree
);
5423 /* Return EXP, stripped of any conversions to wider types
5424 in such a way that the result of converting to type FOR_TYPE
5425 is the same as if EXP were converted to FOR_TYPE.
5426 If FOR_TYPE is 0, it signifies EXP's type. */
5428 extern tree
get_unwidened (tree
, tree
);
5430 /* Return OP or a simpler expression for a narrower value
5431 which can be sign-extended or zero-extended to give back OP.
5432 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5433 or 0 if the value should be sign-extended. */
5435 extern tree
get_narrower (tree
, int *);
5437 /* Return true if T is an expression that get_inner_reference handles. */
5440 handled_component_p (const_tree t
)
5442 switch (TREE_CODE (t
))
5447 case ARRAY_RANGE_REF
:
5450 case VIEW_CONVERT_EXPR
:
5458 /* Given an expression EXP that is a handled_component_p,
5459 look for the ultimate containing object, which is returned and specify
5460 the access position and size. */
5462 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
5463 tree
*, enum machine_mode
*, int *, int *,
5466 /* Return a tree of sizetype representing the size, in bytes, of the element
5467 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5469 extern tree
array_ref_element_size (tree
);
5471 bool array_at_struct_end_p (tree
);
5473 /* Return a tree representing the lower bound of the array mentioned in
5474 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5476 extern tree
array_ref_low_bound (tree
);
5478 /* Return a tree representing the upper bound of the array mentioned in
5479 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5481 extern tree
array_ref_up_bound (tree
);
5483 /* Return a tree representing the offset, in bytes, of the field referenced
5484 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5486 extern tree
component_ref_field_offset (tree
);
5488 /* Given a DECL or TYPE, return the scope in which it was declared, or
5489 NUL_TREE if there is no containing scope. */
5491 extern tree
get_containing_scope (const_tree
);
5493 /* Return the FUNCTION_DECL which provides this _DECL with its context,
5495 extern tree
decl_function_context (const_tree
);
5497 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5498 this _DECL with its context, or zero if none. */
5499 extern tree
decl_type_context (const_tree
);
5501 /* Return 1 if EXPR is the real constant zero. */
5502 extern int real_zerop (const_tree
);
5504 /* Declare commonly used variables for tree structure. */
5506 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
5507 Zero means allow extended lvalues. */
5509 extern int pedantic_lvalues
;
5511 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
5513 extern GTY(()) tree current_function_decl
;
5515 /* Nonzero means a FUNC_BEGIN label was emitted. */
5516 extern GTY(()) const char * current_function_func_begin_label
;
5518 /* Iterator for going through the function arguments. */
5520 tree next
; /* TREE_LIST pointing to the next argument */
5521 } function_args_iterator
;
5523 /* Initialize the iterator I with arguments from function FNDECL */
5526 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
5528 i
->next
= TYPE_ARG_TYPES (fntype
);
5531 /* Return a pointer that holds the next argument if there are more arguments to
5532 handle, otherwise return NULL. */
5534 static inline tree
*
5535 function_args_iter_cond_ptr (function_args_iterator
*i
)
5537 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
5540 /* Return the next argument if there are more arguments to handle, otherwise
5544 function_args_iter_cond (function_args_iterator
*i
)
5546 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
5549 /* Advance to the next argument. */
5551 function_args_iter_next (function_args_iterator
*i
)
5553 gcc_assert (i
->next
!= NULL_TREE
);
5554 i
->next
= TREE_CHAIN (i
->next
);
5557 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
5560 inlined_function_outer_scope_p (const_tree block
)
5562 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
5565 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5566 to point to the next tree element. ITER is an instance of
5567 function_args_iterator used to iterate the arguments. */
5568 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5569 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5570 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5571 function_args_iter_next (&(ITER)))
5573 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5574 to the next tree element. ITER is an instance of function_args_iterator
5575 used to iterate the arguments. */
5576 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5577 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5578 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5579 function_args_iter_next (&(ITER)))
5584 extern unsigned crc32_string (unsigned, const char *);
5585 extern unsigned crc32_byte (unsigned, char);
5586 extern unsigned crc32_unsigned (unsigned, unsigned);
5587 extern void clean_symbol_name (char *);
5588 extern tree
get_file_function_name (const char *);
5589 extern tree
get_callee_fndecl (const_tree
);
5590 extern int type_num_arguments (const_tree
);
5591 extern bool associative_tree_code (enum tree_code
);
5592 extern bool commutative_tree_code (enum tree_code
);
5593 extern bool commutative_ternary_tree_code (enum tree_code
);
5594 extern tree
upper_bound_in_type (tree
, tree
);
5595 extern tree
lower_bound_in_type (tree
, tree
);
5596 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
5597 extern tree
create_artificial_label (location_t
);
5598 extern const char *get_name (tree
);
5599 extern bool stdarg_p (const_tree
);
5600 extern bool prototype_p (tree
);
5601 extern bool is_typedef_decl (tree x
);
5602 extern bool typedef_variant_p (tree
);
5603 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
5604 extern tree
build_low_bits_mask (tree
, unsigned);
5605 extern tree
tree_strip_nop_conversions (tree
);
5606 extern tree
tree_strip_sign_nop_conversions (tree
);
5607 extern const_tree
strip_invariant_refs (const_tree
);
5608 extern tree
lhd_gcc_personality (void);
5609 extern void assign_assembler_name_if_neeeded (tree
);
5610 extern void warn_deprecated_use (tree
, tree
);
5614 extern void change_decl_assembler_name (tree
, tree
);
5617 extern tree
unshare_expr (tree
);
5621 extern void expand_label (tree
);
5622 extern void expand_goto (tree
);
5624 extern rtx
expand_stack_save (void);
5625 extern void expand_stack_restore (tree
);
5626 extern void expand_return (tree
);
5629 extern void using_eh_for_cleanups (void);
5631 extern bool tree_could_trap_p (tree
);
5632 extern bool operation_could_trap_helper_p (enum tree_code
, bool, bool, bool,
5633 bool, tree
, bool *);
5634 extern bool operation_could_trap_p (enum tree_code
, bool, bool, tree
);
5635 extern bool tree_could_throw_p (tree
);
5637 /* Compare and hash for any structure which begins with a canonical
5638 pointer. Assumes all pointers are interchangeable, which is sort
5639 of already assumed by gcc elsewhere IIRC. */
5642 struct_ptr_eq (const void *a
, const void *b
)
5644 const void * const * x
= (const void * const *) a
;
5645 const void * const * y
= (const void * const *) b
;
5649 static inline hashval_t
5650 struct_ptr_hash (const void *a
)
5652 const void * const * x
= (const void * const *) a
;
5653 return (intptr_t)*x
>> 4;
5656 /* In fold-const.c */
5658 /* Non-zero if we are folding constants inside an initializer; zero
5660 extern int folding_initializer
;
5662 /* Convert between trees and native memory representation. */
5663 extern int native_encode_expr (const_tree
, unsigned char *, int);
5664 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
5666 /* Fold constants as much as possible in an expression.
5667 Returns the simplified expression.
5668 Acts only on the top level of the expression;
5669 if the argument itself cannot be simplified, its
5670 subexpressions are not changed. */
5672 extern tree
fold (tree
);
5673 #define fold_unary(CODE,T1,T2)\
5674 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5675 extern tree
fold_unary_loc (location_t
, enum tree_code
, tree
, tree
);
5676 #define fold_unary_ignore_overflow(CODE,T1,T2)\
5677 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5678 extern tree
fold_unary_ignore_overflow_loc (location_t
, enum tree_code
, tree
, tree
);
5679 #define fold_binary(CODE,T1,T2,T3)\
5680 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
5681 extern tree
fold_binary_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
5682 #define fold_ternary(CODE,T1,T2,T3,T4)\
5683 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
5684 extern tree
fold_ternary_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
5685 #define fold_build1(c,t1,t2)\
5686 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
5687 #define fold_build1_loc(l,c,t1,t2)\
5688 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
5689 extern tree
fold_build1_stat_loc (location_t
, enum tree_code
, tree
,
5690 tree MEM_STAT_DECL
);
5691 #define fold_build2(c,t1,t2,t3)\
5692 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
5693 #define fold_build2_loc(l,c,t1,t2,t3)\
5694 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
5695 extern tree
fold_build2_stat_loc (location_t
, enum tree_code
, tree
, tree
,
5696 tree MEM_STAT_DECL
);
5697 #define fold_build3(c,t1,t2,t3,t4)\
5698 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
5699 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
5700 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
5701 extern tree
fold_build3_stat_loc (location_t
, enum tree_code
, tree
, tree
, tree
,
5702 tree MEM_STAT_DECL
);
5703 extern tree
fold_build1_initializer_loc (location_t
, enum tree_code
, tree
, tree
);
5704 extern tree
fold_build2_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
5705 extern tree
fold_build3_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
5706 #define fold_build_call_array(T1,T2,N,T4)\
5707 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5708 extern tree
fold_build_call_array_loc (location_t
, tree
, tree
, int, tree
*);
5709 #define fold_build_call_array_initializer(T1,T2,N,T4)\
5710 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5711 extern tree
fold_build_call_array_initializer_loc (location_t
, tree
, tree
, int, tree
*);
5712 extern bool fold_convertible_p (const_tree
, const_tree
);
5713 #define fold_convert(T1,T2)\
5714 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
5715 extern tree
fold_convert_loc (location_t
, tree
, tree
);
5716 extern tree
fold_single_bit_test (location_t
, enum tree_code
, tree
, tree
, tree
);
5717 extern tree
fold_ignored_result (tree
);
5718 extern tree
fold_abs_const (tree
, tree
);
5719 extern tree
fold_indirect_ref_1 (location_t
, tree
, tree
);
5720 extern void fold_defer_overflow_warnings (void);
5721 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
5722 extern void fold_undefer_and_ignore_overflow_warnings (void);
5723 extern bool fold_deferring_overflow_warnings_p (void);
5724 extern tree
fold_fma (location_t
, tree
, tree
, tree
, tree
);
5726 enum operand_equal_flag
5730 OEP_CONSTANT_ADDRESS_OF
= 4
5733 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
5734 extern int multiple_of_p (tree
, const_tree
, const_tree
);
5735 #define omit_one_operand(T1,T2,T3)\
5736 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
5737 extern tree
omit_one_operand_loc (location_t
, tree
, tree
, tree
);
5738 #define omit_two_operands(T1,T2,T3,T4)\
5739 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
5740 extern tree
omit_two_operands_loc (location_t
, tree
, tree
, tree
, tree
);
5741 #define invert_truthvalue(T)\
5742 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
5743 extern tree
invert_truthvalue_loc (location_t
, tree
);
5744 extern tree
fold_truth_not_expr (location_t
, tree
);
5745 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
5746 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
5747 extern tree
fold_read_from_constant_string (tree
);
5748 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
);
5749 #define build_fold_addr_expr(T)\
5750 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
5751 extern tree
build_fold_addr_expr_loc (location_t
, tree
);
5752 #define build_fold_addr_expr_with_type(T,TYPE)\
5753 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
5754 extern tree
build_fold_addr_expr_with_type_loc (location_t
, tree
, tree
);
5755 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
5756 extern tree
fold_strip_sign_ops (tree
);
5757 #define build_fold_indirect_ref(T)\
5758 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5759 extern tree
build_fold_indirect_ref_loc (location_t
, tree
);
5760 #define fold_indirect_ref(T)\
5761 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5762 extern tree
fold_indirect_ref_loc (location_t
, tree
);
5763 extern tree
build_simple_mem_ref_loc (location_t
, tree
);
5764 #define build_simple_mem_ref(T)\
5765 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
5766 extern double_int
mem_ref_offset (const_tree
);
5767 extern tree
reference_alias_ptr_type (const_tree
);
5768 extern tree
build_invariant_address (tree
, tree
, HOST_WIDE_INT
);
5769 extern tree
constant_boolean_node (bool, tree
);
5770 extern tree
div_if_zero_remainder (enum tree_code
, const_tree
, const_tree
);
5772 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
5773 extern enum tree_code
swap_tree_comparison (enum tree_code
);
5775 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
5776 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
5778 extern bool tree_expr_nonzero_p (tree
);
5779 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
5780 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
5782 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
5783 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
5784 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
5786 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5787 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5788 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
5790 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
5792 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
5793 extern tree
combine_comparisons (location_t
, enum tree_code
, enum tree_code
,
5794 enum tree_code
, tree
, tree
, tree
);
5795 extern void debug_fold_checksum (const_tree
);
5797 /* Return nonzero if CODE is a tree code that represents a truth value. */
5799 truth_value_p (enum tree_code code
)
5801 return (TREE_CODE_CLASS (code
) == tcc_comparison
5802 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5803 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5804 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5807 /* Return whether TYPE is a type suitable for an offset for
5808 a POINTER_PLUS_EXPR. */
5810 ptrofftype_p (tree type
)
5812 return (INTEGRAL_TYPE_P (type
)
5813 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
5814 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
5817 /* Return OFF converted to a pointer offset type suitable as offset for
5818 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
5820 convert_to_ptrofftype_loc (location_t loc
, tree off
)
5822 return fold_convert_loc (loc
, sizetype
, off
);
5824 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
5826 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
5828 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
5830 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
5831 ptr
, fold_convert_loc (loc
, sizetype
, off
));
5833 #define fold_build_pointer_plus(p,o) \
5834 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
5836 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
5838 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
5840 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
5841 ptr
, size_int (off
));
5843 #define fold_build_pointer_plus_hwi(p,o) \
5844 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
5847 extern bool avoid_folding_inline_builtin (tree
);
5848 extern tree
fold_call_expr (location_t
, tree
, bool);
5849 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
5850 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
5851 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
5852 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
5853 enum built_in_function
);
5854 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
5855 enum built_in_function
);
5856 extern tree
fold_builtin_stxncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
5857 enum built_in_function
);
5858 extern tree
fold_builtin_snprintf_chk (location_t
, tree
, tree
, enum built_in_function
);
5859 extern bool fold_builtin_next_arg (tree
, bool);
5860 extern enum built_in_function
builtin_mathfn_code (const_tree
);
5861 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
5862 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
5863 extern tree
build_call_expr_loc_vec (location_t
, tree
, VEC(tree
,gc
) *);
5864 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
5865 extern tree
build_call_expr (tree
, int, ...);
5866 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
5867 extern tree
c_strlen (tree
, int);
5868 extern tree
std_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
5869 extern tree
build_va_arg_indirect_ref (tree
);
5870 extern tree
build_string_literal (int, const char *);
5871 extern bool validate_arglist (const_tree
, ...);
5872 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
5873 extern bool is_builtin_fn (tree
);
5874 extern bool get_object_alignment_1 (tree
, unsigned int *,
5875 unsigned HOST_WIDE_INT
*);
5876 extern unsigned int get_object_alignment (tree
);
5877 extern bool get_pointer_alignment_1 (tree
, unsigned int *,
5878 unsigned HOST_WIDE_INT
*);
5879 extern unsigned int get_pointer_alignment (tree
);
5880 extern tree
fold_call_stmt (gimple
, bool);
5881 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
5882 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
5883 extern tree
make_range_step (location_t
, enum tree_code
, tree
, tree
, tree
,
5884 tree
*, tree
*, int *, bool *);
5885 extern tree
build_range_check (location_t
, tree
, tree
, int, tree
, tree
);
5886 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
5888 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
5889 extern bool is_simple_builtin (tree
);
5890 extern bool is_inexpensive_builtin (tree
);
5893 extern tree
strip_float_extensions (tree
);
5896 extern int really_constant_p (const_tree
);
5897 extern bool decl_address_invariant_p (const_tree
);
5898 extern bool decl_address_ip_invariant_p (const_tree
);
5899 extern bool int_fits_type_p (const_tree
, const_tree
);
5900 #ifndef GENERATOR_FILE
5901 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5903 extern bool variably_modified_type_p (tree
, tree
);
5904 extern int tree_log2 (const_tree
);
5905 extern int tree_floor_log2 (const_tree
);
5906 extern int simple_cst_equal (const_tree
, const_tree
);
5907 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
5908 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
5909 const_tree
, hashval_t
);
5910 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5911 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
5912 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5913 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5914 extern int type_list_equal (const_tree
, const_tree
);
5915 extern int chain_member (const_tree
, const_tree
);
5916 extern tree
type_hash_lookup (unsigned int, tree
);
5917 extern void type_hash_add (unsigned int, tree
);
5918 extern int simple_cst_list_equal (const_tree
, const_tree
);
5919 extern void dump_tree_statistics (void);
5920 extern void recompute_tree_invariant_for_addr_expr (tree
);
5921 extern bool needs_to_live_in_memory (const_tree
);
5922 extern tree
reconstruct_complex_type (tree
, tree
);
5924 extern int real_onep (const_tree
);
5925 extern int real_twop (const_tree
);
5926 extern int real_minus_onep (const_tree
);
5927 extern void init_ttree (void);
5928 extern void build_common_tree_nodes (bool, bool);
5929 extern void build_common_builtin_nodes (void);
5930 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5931 extern tree
build_range_type (tree
, tree
, tree
);
5932 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
5933 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5934 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5935 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
5937 extern tree
tree_block (tree
);
5938 extern void tree_set_block (tree
, tree
);
5939 extern location_t
*block_nonartificial_location (tree
);
5940 extern location_t
tree_nonartificial_location (tree
);
5942 extern tree
block_ultimate_origin (const_tree
);
5944 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
5945 extern tree
get_ref_base_and_extent (tree
, HOST_WIDE_INT
*,
5946 HOST_WIDE_INT
*, HOST_WIDE_INT
*);
5948 /* In tree-nested.c */
5949 extern tree
build_addr (tree
, tree
);
5952 extern void expand_main_function (void);
5953 extern void expand_function_end (void);
5954 extern void expand_function_start (tree
);
5955 extern void stack_protect_prologue (void);
5956 extern void stack_protect_epilogue (void);
5957 extern void init_dummy_function_start (void);
5958 extern void expand_dummy_function_end (void);
5959 extern void allocate_struct_function (tree
, bool);
5960 extern void push_struct_function (tree fndecl
);
5961 extern void init_function_start (tree
);
5962 extern bool use_register_for_decl (const_tree
);
5963 extern void generate_setjmp_warnings (void);
5964 extern void init_temp_slots (void);
5965 extern void free_temp_slots (void);
5966 extern void pop_temp_slots (void);
5967 extern void push_temp_slots (void);
5968 extern void preserve_temp_slots (rtx
);
5969 extern int aggregate_value_p (const_tree
, const_tree
);
5970 extern void push_function_context (void);
5971 extern void pop_function_context (void);
5972 extern gimple_seq
gimplify_parameters (void);
5974 /* In print-rtl.c */
5976 extern void print_rtl (FILE *, const_rtx
);
5979 /* In print-tree.c */
5980 extern void debug_tree (tree
);
5981 extern void debug_vec_tree (VEC(tree
,gc
) *);
5983 extern void dump_addr (FILE*, const char *, const void *);
5984 extern void print_node (FILE *, const char *, tree
, int);
5985 extern void print_vec_tree (FILE *, const char *, VEC(tree
,gc
) *, int);
5986 extern void print_node_brief (FILE *, const char *, const_tree
, int);
5987 extern void indent_to (FILE *, int);
5990 /* In tree-inline.c: */
5991 extern bool debug_find_tree (tree
, tree
);
5992 /* This is in tree-inline.c since the routine uses
5993 data structures from the inliner. */
5994 extern tree
unsave_expr_now (tree
);
5995 extern tree
build_duplicate_type (tree
);
5999 /* Nonzero if this is a call to a function whose return value depends
6000 solely on its arguments, has no side effects, and does not read
6001 global memory. This corresponds to TREE_READONLY for function
6003 #define ECF_CONST (1 << 0)
6004 /* Nonzero if this is a call to "pure" function (like const function,
6005 but may read memory. This corresponds to DECL_PURE_P for function
6007 #define ECF_PURE (1 << 1)
6008 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
6009 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
6010 for function decls.*/
6011 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
6012 /* Nonzero if this call will never return. */
6013 #define ECF_NORETURN (1 << 3)
6014 /* Nonzero if this is a call to malloc or a related function. */
6015 #define ECF_MALLOC (1 << 4)
6016 /* Nonzero if it is plausible that this is a call to alloca. */
6017 #define ECF_MAY_BE_ALLOCA (1 << 5)
6018 /* Nonzero if this is a call to a function that won't throw an exception. */
6019 #define ECF_NOTHROW (1 << 6)
6020 /* Nonzero if this is a call to setjmp or a related function. */
6021 #define ECF_RETURNS_TWICE (1 << 7)
6022 /* Nonzero if this call replaces the current stack frame. */
6023 #define ECF_SIBCALL (1 << 8)
6024 /* Function does not read or write memory (but may have side effects, so
6025 it does not necessarily fit ECF_CONST). */
6026 #define ECF_NOVOPS (1 << 9)
6027 /* The function does not lead to calls within current function unit. */
6028 #define ECF_LEAF (1 << 10)
6029 /* Nonzero if this call does not affect transactions. */
6030 #define ECF_TM_PURE (1 << 11)
6031 /* Nonzero if this call is into the transaction runtime library. */
6032 #define ECF_TM_BUILTIN (1 << 12)
6034 extern int flags_from_decl_or_type (const_tree
);
6035 extern int call_expr_flags (const_tree
);
6037 /* Call argument flags. */
6039 /* Nonzero if the argument is not dereferenced recursively, thus only
6040 directly reachable memory is read or written. */
6041 #define EAF_DIRECT (1 << 0)
6042 /* Nonzero if memory reached by the argument is not clobbered. */
6043 #define EAF_NOCLOBBER (1 << 1)
6044 /* Nonzero if the argument does not escape. */
6045 #define EAF_NOESCAPE (1 << 2)
6046 /* Nonzero if the argument is not used by the function. */
6047 #define EAF_UNUSED (1 << 3)
6049 /* Call return flags. */
6051 /* Mask for the argument number that is returned. Lower two bits of
6052 the return flags, encodes argument slots zero to three. */
6053 #define ERF_RETURN_ARG_MASK (3)
6054 /* Nonzero if the return value is equal to the argument number
6055 flags & ERF_RETURN_ARG_MASK. */
6056 #define ERF_RETURNS_ARG (1 << 2)
6057 /* Nonzero if the return value does not alias with anything. Functions
6058 with the malloc attribute have this set on their return value. */
6059 #define ERF_NOALIAS (1 << 3)
6061 extern int setjmp_call_p (const_tree
);
6062 extern bool gimple_alloca_call_p (const_gimple
);
6063 extern bool alloca_call_p (const_tree
);
6064 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
6065 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
6069 extern const struct attribute_spec
*lookup_attribute_spec (const_tree
);
6070 extern const struct attribute_spec
*lookup_scoped_attribute_spec (const_tree
,
6073 extern void init_attributes (void);
6075 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
6076 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
6077 it should be modified in place; if a TYPE, a copy should be created
6078 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
6079 information, in the form of a bitwise OR of flags in enum attribute_flags
6080 from tree.h. Depending on these flags, some attributes may be
6081 returned to be applied at a later stage (for example, to apply
6082 a decl attribute to the declaration rather than to its type). */
6083 extern tree
decl_attributes (tree
*, tree
, int);
6085 extern bool cxx11_attribute_p (const_tree
);
6087 extern tree
get_attribute_name (const_tree
);
6089 extern tree
get_attribute_namespace (const_tree
);
6091 extern void apply_tm_attr (tree
, tree
);
6093 /* In stor-layout.c */
6094 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
6095 extern void fixup_signed_type (tree
);
6096 extern void internal_reference_types (void);
6097 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
6100 extern tree
tree_output_constant_def (tree
);
6101 extern void make_decl_rtl (tree
);
6102 extern rtx
make_decl_rtl_for_debug (tree
);
6103 extern void make_decl_one_only (tree
, tree
);
6104 extern int supports_one_only (void);
6105 extern void resolve_unique_section (tree
, int, int);
6106 extern void mark_referenced (tree
);
6107 extern void mark_decl_referenced (tree
);
6108 extern void notice_global_symbol (tree
);
6109 extern void set_user_assembler_name (tree
, const char *);
6110 extern void process_pending_assemble_externals (void);
6111 extern bool decl_replaceable_p (tree
);
6112 extern bool decl_binds_to_current_def_p (tree
);
6113 extern enum tls_model
decl_default_tls_model (const_tree
);
6115 /* Declare DECL to be a weak symbol. */
6116 extern void declare_weak (tree
);
6117 /* Merge weak status. */
6118 extern void merge_weak (tree
, tree
);
6119 /* Make one symbol an alias for another. */
6120 extern void assemble_alias (tree
, tree
);
6122 /* Return nonzero if VALUE is a valid constant-valued expression
6123 for use in initializing a static variable; one that can be an
6124 element of a "constant" initializer.
6126 Return null_pointer_node if the value is absolute;
6127 if it is relocatable, return the variable that determines the relocation.
6128 We assume that VALUE has been folded as much as possible;
6129 therefore, we do not need to check for such things as
6130 arithmetic-combinations of integers. */
6131 extern tree
initializer_constant_valid_p (tree
, tree
);
6133 /* Return true if VALUE is a valid constant-valued expression
6134 for use in initializing a static bit-field; one that can be
6135 an element of a "constant" initializer. */
6136 extern bool initializer_constant_valid_for_bitfield_p (tree
);
6138 /* Whether a constructor CTOR is a valid static constant initializer if all
6139 its elements are. This used to be internal to initializer_constant_valid_p
6140 and has been exposed to let other functions like categorize_ctor_elements
6141 evaluate the property while walking a constructor for other purposes. */
6143 extern bool constructor_static_from_elts_p (const_tree
);
6146 extern void expand_computed_goto (tree
);
6147 extern bool parse_output_constraint (const char **, int, int, int,
6148 bool *, bool *, bool *);
6149 extern bool parse_input_constraint (const char **, int, int, int, int,
6150 const char * const *, bool *, bool *);
6151 extern void expand_asm_stmt (gimple
);
6152 extern tree
resolve_asm_operand_names (tree
, tree
, tree
, tree
);
6154 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
6155 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
6159 /* In tree-inline.c */
6161 /* The type of a set of already-visited pointers. Functions for creating
6162 and manipulating it are declared in pointer-set.h */
6163 struct pointer_set_t
;
6165 /* The type of a callback function for walking over tree structure. */
6167 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
6169 /* The type of a callback function that represents a custom walk_tree. */
6171 typedef tree (*walk_tree_lh
) (tree
*, int *, tree (*) (tree
*, int *, void *),
6172 void *, struct pointer_set_t
*);
6174 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
6176 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
6178 #define walk_tree(a,b,c,d) \
6179 walk_tree_1 (a, b, c, d, NULL)
6180 #define walk_tree_without_duplicates(a,b,c) \
6181 walk_tree_without_duplicates_1 (a, b, c, NULL)
6184 /* Assign the RTX to declaration. */
6186 extern void set_decl_rtl (tree
, rtx
);
6187 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
6189 /* Enum and arrays used for tree allocation stats.
6190 Keep in sync with tree.c:tree_node_kind_names. */
6212 extern int tree_node_counts
[];
6213 extern int tree_node_sizes
[];
6215 /* True if we are in gimple form and the actions of the folders need to
6216 be restricted. False if we are not in gimple form and folding is not
6217 restricted to creating gimple expressions. */
6218 extern bool in_gimple_form
;
6221 extern tree
get_base_address (tree t
);
6222 extern void mark_addressable (tree
);
6226 struct GTY(()) tree_map_base
{
6230 extern int tree_map_base_eq (const void *, const void *);
6231 extern unsigned int tree_map_base_hash (const void *);
6232 extern int tree_map_base_marked_p (const void *);
6233 extern bool list_equal_p (const_tree
, const_tree
);
6235 /* Map from a tree to another tree. */
6237 struct GTY(()) tree_map
{
6238 struct tree_map_base base
;
6243 #define tree_map_eq tree_map_base_eq
6244 extern unsigned int tree_map_hash (const void *);
6245 #define tree_map_marked_p tree_map_base_marked_p
6247 /* Map from a decl tree to another tree. */
6249 struct GTY(()) tree_decl_map
{
6250 struct tree_map_base base
;
6254 #define tree_decl_map_eq tree_map_base_eq
6255 extern unsigned int tree_decl_map_hash (const void *);
6256 #define tree_decl_map_marked_p tree_map_base_marked_p
6258 /* Map from a tree to an int. */
6260 struct GTY(()) tree_int_map
{
6261 struct tree_map_base base
;
6265 #define tree_int_map_eq tree_map_base_eq
6266 #define tree_int_map_hash tree_map_base_hash
6267 #define tree_int_map_marked_p tree_map_base_marked_p
6269 /* Map from a tree to initialization/finalization priorities. */
6271 struct GTY(()) tree_priority_map
{
6272 struct tree_map_base base
;
6277 #define tree_priority_map_eq tree_map_base_eq
6278 #define tree_priority_map_hash tree_map_base_hash
6279 #define tree_priority_map_marked_p tree_map_base_marked_p
6281 /* Map from a decl tree to a tree vector. */
6283 struct GTY(()) tree_vec_map
{
6284 struct tree_map_base base
;
6288 #define tree_vec_map_eq tree_map_base_eq
6289 #define tree_vec_map_hash tree_decl_map_hash
6290 #define tree_vec_map_marked_p tree_map_base_marked_p
6294 tree
target_for_debug_bind (tree
);
6296 /* In tree-ssa-address.c. */
6297 extern tree
tree_mem_ref_addr (tree
, tree
);
6298 extern void copy_ref_info (tree
, tree
);
6301 extern bool ssa_name_nonnegative_p (const_tree
);
6303 /* In tree-object-size.c. */
6304 extern void init_object_sizes (void);
6305 extern void fini_object_sizes (void);
6306 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
6310 /* Determine whether the LEN bytes can be moved by using several move
6311 instructions. Return nonzero if a call to move_by_pieces should
6313 extern int can_move_by_pieces (unsigned HOST_WIDE_INT
, unsigned int);
6315 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
6316 extern tree
build_personality_function (const char *);
6318 /* In trans-mem.c. */
6319 extern tree
build_tm_abort_call (location_t
, bool);
6320 extern bool is_tm_safe (const_tree
);
6321 extern bool is_tm_pure (const_tree
);
6322 extern bool is_tm_may_cancel_outer (tree
);
6323 extern bool is_tm_ending_fndecl (tree
);
6324 extern void record_tm_replacement (tree
, tree
);
6325 extern void tm_malloc_replacement (tree
);
6328 is_tm_safe_or_pure (const_tree x
)
6330 return is_tm_safe (x
) || is_tm_pure (x
);
6333 /* In tree-inline.c. */
6335 void init_inline_once (void);
6337 /* Abstract iterators for CALL_EXPRs. These static inline definitions
6338 have to go towards the end of tree.h so that union tree_node is fully
6339 defined by this point. */
6341 /* Structure containing iterator state. */
6342 typedef struct call_expr_arg_iterator_d
{
6343 tree t
; /* the call_expr */
6344 int n
; /* argument count */
6345 int i
; /* next argument index */
6346 } call_expr_arg_iterator
;
6348 typedef struct const_call_expr_arg_iterator_d
{
6349 const_tree t
; /* the call_expr */
6350 int n
; /* argument count */
6351 int i
; /* next argument index */
6352 } const_call_expr_arg_iterator
;
6354 /* Initialize the abstract argument list iterator object ITER with the
6355 arguments from CALL_EXPR node EXP. */
6357 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
6360 iter
->n
= call_expr_nargs (exp
);
6365 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
6368 iter
->n
= call_expr_nargs (exp
);
6372 /* Return the next argument from abstract argument list iterator object ITER,
6373 and advance its state. Return NULL_TREE if there are no more arguments. */
6375 next_call_expr_arg (call_expr_arg_iterator
*iter
)
6378 if (iter
->i
>= iter
->n
)
6380 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
6385 static inline const_tree
6386 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
6389 if (iter
->i
>= iter
->n
)
6391 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
6396 /* Initialize the abstract argument list iterator object ITER, then advance
6397 past and return the first argument. Useful in for expressions, e.g.
6398 for (arg = first_call_expr_arg (exp, &iter); arg;
6399 arg = next_call_expr_arg (&iter)) */
6401 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
6403 init_call_expr_arg_iterator (exp
, iter
);
6404 return next_call_expr_arg (iter
);
6407 static inline const_tree
6408 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
6410 init_const_call_expr_arg_iterator (exp
, iter
);
6411 return next_const_call_expr_arg (iter
);
6414 /* Test whether there are more arguments in abstract argument list iterator
6415 ITER, without changing its state. */
6417 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
6419 return (iter
->i
< iter
->n
);
6423 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
6425 return (iter
->i
< iter
->n
);
6428 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
6429 (of type call_expr_arg_iterator) to hold the iteration state. */
6430 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
6431 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
6432 (arg) = next_call_expr_arg (&(iter)))
6434 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
6435 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
6436 (arg) = next_const_call_expr_arg (&(iter)))
6438 /* Return true if tree node T is a language-specific node. */
6440 is_lang_specific (tree t
)
6442 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
6445 /* In gimple-low.c. */
6446 extern bool block_may_fallthru (const_tree
);
6449 /* Functional interface to the builtin functions. */
6451 /* The builtin_info structure holds the FUNCTION_DECL of the standard builtin
6452 function, and a flag that says if the function is available implicitly, or
6453 whether the user has to code explicit calls to __builtin_<xxx>. */
6455 typedef struct GTY(()) builtin_info_type_d
{
6456 tree decl
[(int)END_BUILTINS
];
6457 bool implicit_p
[(int)END_BUILTINS
];
6458 } builtin_info_type
;
6460 extern GTY(()) builtin_info_type builtin_info
;
6462 /* Valid builtin number. */
6463 #define BUILTIN_VALID_P(FNCODE) \
6464 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
6466 /* Return the tree node for an explicit standard builtin function or NULL. */
6468 builtin_decl_explicit (enum built_in_function fncode
)
6470 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6472 return builtin_info
.decl
[(size_t)fncode
];
6475 /* Return the tree node for an implicit builtin function or NULL. */
6477 builtin_decl_implicit (enum built_in_function fncode
)
6479 size_t uns_fncode
= (size_t)fncode
;
6480 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6482 if (!builtin_info
.implicit_p
[uns_fncode
])
6485 return builtin_info
.decl
[uns_fncode
];
6488 /* Set explicit builtin function nodes and whether it is an implicit
6492 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
6494 size_t ufncode
= (size_t)fncode
;
6496 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
6497 && (decl
!= NULL_TREE
|| !implicit_p
));
6499 builtin_info
.decl
[ufncode
] = decl
;
6500 builtin_info
.implicit_p
[ufncode
] = implicit_p
;
6503 /* Set the implicit flag for a builtin function. */
6506 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
6508 size_t uns_fncode
= (size_t)fncode
;
6510 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
6511 && builtin_info
.decl
[uns_fncode
] != NULL_TREE
);
6513 builtin_info
.implicit_p
[uns_fncode
] = implicit_p
;
6516 /* Return whether the standard builtin function can be used as an explicit
6520 builtin_decl_explicit_p (enum built_in_function fncode
)
6522 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6523 return (builtin_info
.decl
[(size_t)fncode
] != NULL_TREE
);
6526 /* Return whether the standard builtin function can be used implicitly. */
6529 builtin_decl_implicit_p (enum built_in_function fncode
)
6531 size_t uns_fncode
= (size_t)fncode
;
6533 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6534 return (builtin_info
.decl
[uns_fncode
] != NULL_TREE
6535 && builtin_info
.implicit_p
[uns_fncode
]);
6538 #endif /* GCC_TREE_H */