1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
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"
30 #include "double-int.h"
33 /* Codes of tree nodes */
35 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
40 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
46 #define MAX_TREE_CODES 512
47 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
48 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
50 /* Number of language-independent tree codes. */
51 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
53 /* Tree code classes. */
55 /* Each tree_code has an associated code class represented by a
58 enum tree_code_class {
59 tcc_exceptional, /* An exceptional code (fits no category). */
60 tcc_constant, /* A constant. */
61 /* Order of tcc_type and tcc_declaration is important. */
62 tcc_type, /* A type object code. */
63 tcc_declaration, /* A declaration (also serving as variable refs). */
64 tcc_reference, /* A reference to storage. */
65 tcc_comparison, /* A comparison expression. */
66 tcc_unary, /* A unary arithmetic expression. */
67 tcc_binary, /* A binary arithmetic expression. */
68 tcc_statement, /* A statement expression, which have side effects
69 but usually no interesting value. */
70 tcc_vl_exp, /* A function call or other expression with a
71 variable-length operand vector. */
72 tcc_expression, /* Any other expression. */
73 tcc_gimple_stmt /* A GIMPLE statement. */
76 /* Each tree code class has an associated string representation.
77 These must correspond to the tree_code_class entries. */
79 extern const char *const tree_code_class_strings[];
81 /* Returns the string representing CLASS. */
83 #define TREE_CODE_CLASS_STRING(CLASS)\
84 tree_code_class_strings[(int) (CLASS)]
86 extern const enum tree_code_class tree_code_type[];
87 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
89 /* Nonzero if CODE represents an exceptional code. */
91 #define EXCEPTIONAL_CLASS_P(CODE)\
92 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
94 /* Nonzero if CODE represents a constant. */
96 #define CONSTANT_CLASS_P(CODE)\
97 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
99 /* Nonzero if CODE represents a type. */
101 #define TYPE_P(CODE)\
102 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
104 /* Nonzero if CODE represents a declaration. */
106 #define DECL_P(CODE)\
107 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
109 /* Nonzero if CODE represents a memory tag. */
111 #define MTAG_P(CODE) \
112 (TREE_CODE (CODE) == STRUCT_FIELD_TAG \
113 || TREE_CODE (CODE) == NAME_MEMORY_TAG \
114 || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG \
115 || TREE_CODE (CODE) == MEMORY_PARTITION_TAG)
118 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
120 #define VAR_OR_FUNCTION_DECL_P(DECL)\
121 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
123 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
124 ascending code order. */
126 #define INDIRECT_REF_P(CODE)\
127 (TREE_CODE (CODE) == INDIRECT_REF \
128 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
129 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
131 /* Nonzero if CODE represents a reference. */
133 #define REFERENCE_CLASS_P(CODE)\
134 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
136 /* Nonzero if CODE represents a comparison. */
138 #define COMPARISON_CLASS_P(CODE)\
139 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
141 /* Nonzero if CODE represents a unary arithmetic expression. */
143 #define UNARY_CLASS_P(CODE)\
144 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
146 /* Nonzero if CODE represents a binary arithmetic expression. */
148 #define BINARY_CLASS_P(CODE)\
149 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
151 /* Nonzero if CODE represents a statement expression. */
153 #define STATEMENT_CLASS_P(CODE)\
154 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
156 /* Nonzero if CODE represents a function call-like expression with a
157 variable-length operand vector. */
159 #define VL_EXP_CLASS_P(CODE)\
160 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
162 /* Nonzero if CODE represents any other expression. */
164 #define EXPRESSION_CLASS_P(CODE)\
165 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
167 /* Returns nonzero iff CODE represents a type or declaration. */
169 #define IS_TYPE_OR_DECL_P(CODE)\
170 (TYPE_P (CODE) || DECL_P (CODE))
172 /* Returns nonzero iff CLASS is the tree-code class of an
175 #define IS_EXPR_CODE_CLASS(CLASS)\
176 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
178 /* Returns nonzer iff CLASS is a GIMPLE statement. */
180 #define IS_GIMPLE_STMT_CODE_CLASS(CLASS) ((CLASS) == tcc_gimple_stmt)
182 /* Returns nonzero iff NODE is an expression of some kind. */
184 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
186 /* Returns nonzero iff NODE is an OpenMP directive. */
188 #define OMP_DIRECTIVE_P(NODE) \
189 (TREE_CODE (NODE) == OMP_PARALLEL \
190 || TREE_CODE (NODE) == OMP_FOR \
191 || TREE_CODE (NODE) == OMP_SECTIONS \
192 || TREE_CODE (NODE) == OMP_SECTIONS_SWITCH \
193 || TREE_CODE (NODE) == OMP_SINGLE \
194 || TREE_CODE (NODE) == OMP_SECTION \
195 || TREE_CODE (NODE) == OMP_MASTER \
196 || TREE_CODE (NODE) == OMP_ORDERED \
197 || TREE_CODE (NODE) == OMP_CRITICAL \
198 || TREE_CODE (NODE) == OMP_RETURN \
199 || TREE_CODE (NODE) == OMP_ATOMIC_LOAD \
200 || TREE_CODE (NODE) == OMP_ATOMIC_STORE \
201 || TREE_CODE (NODE) == OMP_CONTINUE)
203 /* Number of argument-words in each kind of tree-node. */
205 extern const unsigned char tree_code_length[];
206 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
208 /* Names of tree components. */
210 extern const char *const tree_code_name[];
212 /* A vectors of trees. */
214 DEF_VEC_ALLOC_P(tree,gc);
215 DEF_VEC_ALLOC_P(tree,heap);
218 /* Classify which part of the compiler has defined a given builtin function.
219 Note that we assume below that this is no more than two bits. */
228 /* Names for the above. */
229 extern const char *const built_in_class_names[4];
231 /* Codes that identify the various built in functions
232 so that expand_call can identify them quickly. */
234 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
235 enum built_in_function
237 #include "builtins.def"
239 /* Complex division routines in libgcc. These are done via builtins
240 because emit_library_call_value can't handle complex values. */
241 BUILT_IN_COMPLEX_MUL_MIN,
242 BUILT_IN_COMPLEX_MUL_MAX
243 = BUILT_IN_COMPLEX_MUL_MIN
244 + MAX_MODE_COMPLEX_FLOAT
245 - MIN_MODE_COMPLEX_FLOAT,
247 BUILT_IN_COMPLEX_DIV_MIN,
248 BUILT_IN_COMPLEX_DIV_MAX
249 = BUILT_IN_COMPLEX_DIV_MIN
250 + MAX_MODE_COMPLEX_FLOAT
251 - MIN_MODE_COMPLEX_FLOAT,
253 /* Upper bound on non-language-specific builtins. */
258 /* Names for the above. */
259 extern const char * built_in_names[(int) END_BUILTINS];
261 /* Helper macros for math builtins. */
263 #define BUILTIN_EXP10_P(FN) \
264 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
265 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
267 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
268 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
269 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
271 #define BUILTIN_SQRT_P(FN) \
272 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
274 #define BUILTIN_CBRT_P(FN) \
275 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
277 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
279 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
280 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
281 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
283 /* An array of _DECL trees for the above. */
284 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
285 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
287 /* In an OMP_CLAUSE node. */
289 /* Number of operands and names for each clause. */
290 extern unsigned const char omp_clause_num_ops[];
291 extern const char * const omp_clause_code_name[];
293 /* Clause codes. Do not reorder, as this is used to index into the tables
294 omp_clause_num_ops and omp_clause_code_name. */
297 /* Clause zero is special-cased inside the parser
298 (c_parser_omp_variable_list). */
299 OMP_CLAUSE_ERROR = 0,
301 /* OpenMP clause: private (variable_list). */
304 /* OpenMP clause: shared (variable_list). */
307 /* OpenMP clause: firstprivate (variable_list). */
308 OMP_CLAUSE_FIRSTPRIVATE,
310 /* OpenMP clause: lastprivate (variable_list). */
311 OMP_CLAUSE_LASTPRIVATE,
313 /* OpenMP clause: reduction (operator:variable_list).
314 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
315 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
316 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
318 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
319 placeholder used in OMP_CLAUSE_REDUCTION_MERGE. */
320 OMP_CLAUSE_REDUCTION,
322 /* OpenMP clause: copyin (variable_list). */
325 /* OpenMP clause: copyprivate (variable_list). */
326 OMP_CLAUSE_COPYPRIVATE,
328 /* OpenMP clause: if (scalar-expression). */
331 /* OpenMP clause: num_threads (integer-expression). */
332 OMP_CLAUSE_NUM_THREADS,
334 /* OpenMP clause: schedule. */
337 /* OpenMP clause: nowait. */
340 /* OpenMP clause: ordered. */
343 /* OpenMP clause: default. */
347 /* The definition of tree nodes fills the next several pages. */
349 /* A tree node can represent a data type, a variable, an expression
350 or a statement. Each node has a TREE_CODE which says what kind of
351 thing it represents. Some common codes are:
352 INTEGER_TYPE -- represents a type of integers.
353 ARRAY_TYPE -- represents a type of pointer.
354 VAR_DECL -- represents a declared variable.
355 INTEGER_CST -- represents a constant integer value.
356 PLUS_EXPR -- represents a sum (an expression).
358 As for the contents of a tree node: there are some fields
359 that all nodes share. Each TREE_CODE has various special-purpose
360 fields as well. The fields of a node are never accessed directly,
361 always through accessor macros. */
363 /* Every kind of tree node starts with this structure,
364 so all nodes have these fields.
366 See the accessor macros, defined below, for documentation of the
370 struct tree_base GTY(())
372 ENUM_BITFIELD(tree_code) code : 16;
374 unsigned side_effects_flag : 1;
375 unsigned constant_flag : 1;
376 unsigned addressable_flag : 1;
377 unsigned volatile_flag : 1;
378 unsigned readonly_flag : 1;
379 unsigned unsigned_flag : 1;
380 unsigned asm_written_flag: 1;
381 unsigned nowarning_flag : 1;
383 unsigned used_flag : 1;
384 unsigned nothrow_flag : 1;
385 unsigned static_flag : 1;
386 unsigned public_flag : 1;
387 unsigned private_flag : 1;
388 unsigned protected_flag : 1;
389 unsigned deprecated_flag : 1;
390 unsigned invariant_flag : 1;
391 unsigned saturating_flag : 1;
392 unsigned default_def_flag : 1;
394 unsigned lang_flag_0 : 1;
395 unsigned lang_flag_1 : 1;
396 unsigned lang_flag_2 : 1;
397 unsigned lang_flag_3 : 1;
398 unsigned lang_flag_4 : 1;
399 unsigned lang_flag_5 : 1;
400 unsigned lang_flag_6 : 1;
401 unsigned visited : 1;
405 /* FIXME tuples: Eventually, we need to move this somewhere external to
407 union tree_ann_d *ann;
410 struct tree_common GTY(())
412 struct tree_base base;
417 /* GIMPLE_MODIFY_STMT */
418 struct gimple_stmt GTY(())
420 struct tree_base base;
423 /* FIXME tuples: Eventually this should be of type ``struct gimple_expr''. */
424 tree GTY ((length ("TREE_CODE_LENGTH (TREE_CODE (&%h))"))) operands[1];
427 /* The following table lists the uses of each of the above flags and
428 for which types of nodes they are defined. Note that expressions
434 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
435 ..._TYPE, IDENTIFIER_NODE.
436 In a STMT_EXPR, it means we want the result of the enclosed
438 CALL_EXPR_TAILCALL in CALL_EXPR
439 CASE_LOW_SEEN in CASE_LABEL_EXPR
440 RETURN_EXPR_OUTCOME in RETURN_EXPR
445 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
448 TREE_SYMBOL_REFERENCED in
451 TARGET_EXPR, WITH_CLEANUP_EXPR
452 TRY_CATCH_IS_CLEANUP in
456 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
457 TYPE_REF_CAN_ALIAS_ALL in
458 POINTER_TYPE, REFERENCE_TYPE
463 CALL_CANNOT_INLINE_P in
469 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
471 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
474 CALL_EXPR_VA_ARG_PACK in
476 TYPE_CACHED_VALUES_P in
478 SAVE_EXPR_RESOLVED_P in
480 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
481 OMP_CLAUSE_LASTPRIVATE
482 OMP_CLAUSE_PRIVATE_DEBUG in
489 CALL_EXPR_RETURN_SLOT_OPT in
492 PARM_DECL, RESULT_DECL
497 OMP_PARALLEL_COMBINED in
520 TREE_THIS_VOLATILE in
538 TYPE_SIZES_GIMPLIFIED
551 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
552 BLOCK, SSA_NAME, STRING_CST
557 expressions, IDENTIFIER_NODE
562 CALL_EXPR, FUNCTION_DECL
568 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
575 IDENTIFIER_TRANSPARENT_ALIAS in
580 Used in tree traversals to mark visited nodes.
595 ... any expr or decl node
598 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
599 enum tree_node_structure_enum {
600 #include "treestruct.def"
605 /* Define accessors for the fields that all tree nodes have
606 (though some fields are not used for all kinds of nodes). */
608 /* The tree-code says what kind of node it is.
609 Codes are defined in tree.def. */
610 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
611 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
613 /* When checking is enabled, errors will be generated if a tree node
614 is accessed incorrectly. The macros die with a fatal error. */
615 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
617 #define TREE_CHECK(T, CODE) __extension__ \
618 ({ __typeof (T) const __t = (T); \
619 if (TREE_CODE (__t) != (CODE)) \
620 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
624 #define TREE_NOT_CHECK(T, CODE) __extension__ \
625 ({ __typeof (T) const __t = (T); \
626 if (TREE_CODE (__t) == (CODE)) \
627 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
631 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
632 ({ __typeof (T) const __t = (T); \
633 if (TREE_CODE (__t) != (CODE1) \
634 && TREE_CODE (__t) != (CODE2)) \
635 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
636 (CODE1), (CODE2), 0); \
639 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
640 ({ __typeof (T) const __t = (T); \
641 if (TREE_CODE (__t) == (CODE1) \
642 || TREE_CODE (__t) == (CODE2)) \
643 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
644 (CODE1), (CODE2), 0); \
647 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
648 ({ __typeof (T) const __t = (T); \
649 if (TREE_CODE (__t) != (CODE1) \
650 && TREE_CODE (__t) != (CODE2) \
651 && TREE_CODE (__t) != (CODE3)) \
652 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
653 (CODE1), (CODE2), (CODE3), 0); \
656 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
657 ({ __typeof (T) const __t = (T); \
658 if (TREE_CODE (__t) == (CODE1) \
659 || TREE_CODE (__t) == (CODE2) \
660 || TREE_CODE (__t) == (CODE3)) \
661 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
662 (CODE1), (CODE2), (CODE3), 0); \
665 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
666 ({ __typeof (T) const __t = (T); \
667 if (TREE_CODE (__t) != (CODE1) \
668 && TREE_CODE (__t) != (CODE2) \
669 && TREE_CODE (__t) != (CODE3) \
670 && TREE_CODE (__t) != (CODE4)) \
671 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
672 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
675 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
676 ({ __typeof (T) const __t = (T); \
677 if (TREE_CODE (__t) == (CODE1) \
678 || TREE_CODE (__t) == (CODE2) \
679 || TREE_CODE (__t) == (CODE3) \
680 || TREE_CODE (__t) == (CODE4)) \
681 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
682 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
685 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
686 ({ __typeof (T) const __t = (T); \
687 if (TREE_CODE (__t) != (CODE1) \
688 && TREE_CODE (__t) != (CODE2) \
689 && TREE_CODE (__t) != (CODE3) \
690 && TREE_CODE (__t) != (CODE4) \
691 && TREE_CODE (__t) != (CODE5)) \
692 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
693 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
696 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
697 ({ __typeof (T) const __t = (T); \
698 if (TREE_CODE (__t) == (CODE1) \
699 || TREE_CODE (__t) == (CODE2) \
700 || TREE_CODE (__t) == (CODE3) \
701 || TREE_CODE (__t) == (CODE4) \
702 || TREE_CODE (__t) == (CODE5)) \
703 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
704 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
707 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
708 ({ __typeof (T) const __t = (T); \
709 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
710 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
714 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
715 ({ __typeof (T) const __t = (T); \
716 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
717 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
721 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
722 ({ __typeof (T) const __t = (T); \
723 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
724 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
728 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
729 ({ __typeof (T) const __t = (T); \
730 if (TREE_CODE (__t) != OMP_CLAUSE) \
731 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
733 if (__t->omp_clause.code != (CODE)) \
734 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
738 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
739 ({ __typeof (T) const __t = (T); \
740 if (TREE_CODE (__t) != OMP_CLAUSE) \
741 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
743 if ((int) __t->omp_clause.code < (int) (CODE1) \
744 || (int) __t->omp_clause.code > (int) (CODE2)) \
745 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
746 __FUNCTION__, (CODE1), (CODE2)); \
749 /* These checks have to be special cased. */
750 #define EXPR_CHECK(T) __extension__ \
751 ({ __typeof (T) const __t = (T); \
752 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
753 if (!IS_EXPR_CODE_CLASS (__c)) \
754 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
758 #define GIMPLE_STMT_CHECK(T) __extension__ \
759 ({ __typeof (T) const __t = (T); \
760 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
761 if (!IS_GIMPLE_STMT_CODE_CLASS (__c)) \
762 tree_class_check_failed (__t, tcc_gimple_stmt, __FILE__, __LINE__,\
766 /* These checks have to be special cased. */
767 #define NON_TYPE_CHECK(T) __extension__ \
768 ({ __typeof (T) const __t = (T); \
770 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
774 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
775 (*({__typeof (T) const __t = (T); \
776 const int __i = (I); \
777 if (TREE_CODE (__t) != TREE_VEC) \
778 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
780 if (__i < 0 || __i >= __t->vec.length) \
781 tree_vec_elt_check_failed (__i, __t->vec.length, \
782 __FILE__, __LINE__, __FUNCTION__); \
783 &__t->vec.a[__i]; }))
785 #define PHI_NODE_ELT_CHECK(T, I) __extension__ \
786 (*({__typeof (T) const __t = (T); \
787 const int __i = (I); \
788 if (TREE_CODE (__t) != PHI_NODE) \
789 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
791 if (__i < 0 || __i >= __t->phi.capacity) \
792 phi_node_elt_check_failed (__i, __t->phi.num_args, \
793 __FILE__, __LINE__, __FUNCTION__); \
794 &__t->phi.a[__i]; }))
796 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
797 (*({__typeof (T) const __t = (T); \
798 const int __i = (I); \
799 if (TREE_CODE (__t) != OMP_CLAUSE) \
800 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
802 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
803 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
805 &__t->omp_clause.ops[__i]; }))
807 /* Special checks for TREE_OPERANDs. */
808 #define TREE_OPERAND_CHECK(T, I) __extension__ \
809 (*({__typeof (T) const __t = EXPR_CHECK (T); \
810 const int __i = (I); \
811 if (GIMPLE_TUPLE_P (__t)) \
812 gcc_unreachable (); \
813 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
814 tree_operand_check_failed (__i, __t, \
815 __FILE__, __LINE__, __FUNCTION__); \
816 &__t->exp.operands[__i]; }))
818 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
819 (*({__typeof (T) const __t = (T); \
820 const int __i = (I); \
821 if (TREE_CODE (__t) != CODE) \
822 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
823 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
824 tree_operand_check_failed (__i, __t, \
825 __FILE__, __LINE__, __FUNCTION__); \
826 &__t->exp.operands[__i]; }))
828 /* Special checks for GIMPLE_STMT_OPERANDs. */
829 #define GIMPLE_STMT_OPERAND_CHECK(T, I) __extension__ \
830 (*({__typeof (T) const __t = GIMPLE_STMT_CHECK (T); \
831 const int __i = (I); \
832 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
833 tree_operand_check_failed (__i, __t, \
834 __FILE__, __LINE__, __FUNCTION__); \
835 &__t->gstmt.operands[__i]; }))
837 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
839 ({__typeof (T) const __t = (T); \
840 const int __i = (I); \
841 if (TREE_CODE (__t) != (CODE)) \
842 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
843 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
844 tree_operand_check_failed (__i, __t, \
845 __FILE__, __LINE__, __FUNCTION__); \
846 &__t->exp.operands[__i]; }))
848 /* Nodes are chained together for many purposes.
849 Types are chained together to record them for being output to the debugger
850 (see the function `chain_type').
851 Decls in the same scope are chained together to record the contents
853 Statement nodes for successive statements used to be chained together.
854 Often lists of things are represented by TREE_LIST nodes that
855 are chained together. */
857 #define TREE_CHAIN(NODE) __extension__ \
858 (*({__typeof (NODE) const __t = (NODE); \
859 if (GIMPLE_TUPLE_P (__t)) \
860 gcc_unreachable (); \
861 &__t->common.chain; }))
863 /* In all nodes that are expressions, this is the data type of the expression.
864 In POINTER_TYPE nodes, this is the type that the pointer points to.
865 In ARRAY_TYPE nodes, this is the type of the elements.
866 In VECTOR_TYPE nodes, this is the type of the elements. */
867 #define TREE_TYPE(NODE) __extension__ \
868 (*({__typeof (NODE) const __t = (NODE); \
869 if (GIMPLE_TUPLE_P (__t)) \
870 gcc_unreachable (); \
871 &__t->common.type; }))
873 extern void tree_contains_struct_check_failed (const_tree,
874 const enum tree_node_structure_enum,
875 const char *, int, const char *)
878 extern void tree_check_failed (const_tree, const char *, int, const char *,
879 ...) ATTRIBUTE_NORETURN;
880 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
881 ...) ATTRIBUTE_NORETURN;
882 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
883 const char *, int, const char *)
885 extern void tree_range_check_failed (const_tree, const char *, int,
886 const char *, enum tree_code,
888 extern void tree_not_class_check_failed (const_tree,
889 const enum tree_code_class,
890 const char *, int, const char *)
892 extern void tree_vec_elt_check_failed (int, int, const char *,
895 extern void phi_node_elt_check_failed (int, int, const char *,
898 extern void tree_operand_check_failed (int, const_tree,
899 const char *, int, const char *)
901 extern void omp_clause_check_failed (const_tree, const char *, int,
902 const char *, enum omp_clause_code)
904 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
907 extern void omp_clause_range_check_failed (const_tree, const char *, int,
908 const char *, enum omp_clause_code,
909 enum omp_clause_code)
912 #else /* not ENABLE_TREE_CHECKING, or not gcc */
914 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
915 #define TREE_CHECK(T, CODE) (T)
916 #define TREE_NOT_CHECK(T, CODE) (T)
917 #define TREE_CHECK2(T, CODE1, CODE2) (T)
918 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
919 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
920 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
921 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
922 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
923 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
924 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
925 #define TREE_CLASS_CHECK(T, CODE) (T)
926 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
927 #define EXPR_CHECK(T) (T)
928 #define GIMPLE_STMT_CHECK(T) (T)
929 #define NON_TYPE_CHECK(T) (T)
930 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
931 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
932 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
933 #define GIMPLE_STMT_OPERAND_CHECK(T, I) ((T)->gstmt.operands[I])
934 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
935 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
936 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
937 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
938 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
940 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
941 #define TREE_TYPE(NODE) ((NODE)->common.type)
945 #define TREE_BLOCK(NODE) *(tree_block (NODE))
947 #include "tree-check.h"
949 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
950 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
951 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
952 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
953 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
954 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
955 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
956 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
957 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
958 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
959 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
960 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
962 #define RECORD_OR_UNION_CHECK(T) \
963 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
964 #define NOT_RECORD_OR_UNION_CHECK(T) \
965 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
967 #define NUMERICAL_TYPE_CHECK(T) \
968 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
971 /* Nonzero if NODE is a GIMPLE statement. */
972 #define GIMPLE_STMT_P(NODE) \
973 (TREE_CODE_CLASS (TREE_CODE ((NODE))) == tcc_gimple_stmt)
975 /* Nonzero if NODE is a GIMPLE tuple. */
976 #define GIMPLE_TUPLE_P(NODE) (GIMPLE_STMT_P (NODE) || TREE_CODE (NODE) == PHI_NODE)
978 /* A GIMPLE tuple that has a ``locus'' field. */
979 #define GIMPLE_TUPLE_HAS_LOCUS_P(NODE) GIMPLE_STMT_P ((NODE))
981 /* Like TREE_OPERAND but works with GIMPLE stmt tuples as well.
983 If you know the NODE is a GIMPLE statement, use GIMPLE_STMT_OPERAND. If the
984 NODE code is unknown at compile time, use this macro. */
985 #define GENERIC_TREE_OPERAND(NODE, I) *(generic_tree_operand ((NODE), (I)))
987 /* Like TREE_TYPE but returns void_type_node for gimple tuples that have
990 #define GENERIC_TREE_TYPE(NODE) *(generic_tree_type ((NODE)))
992 /* Here is how primitive or already-canonicalized types' hash codes
994 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
996 /* A simple hash function for an arbitrary tree node. This must not be
997 used in hash tables which are saved to a PCH. */
998 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
1000 /* The TREE_CHAIN but it is able to handle tuples. */
1001 #define GENERIC_NEXT(NODE) \
1002 (TREE_CODE (NODE) == PHI_NODE ? PHI_CHAIN (NODE) : \
1003 GIMPLE_STMT_P (NODE) ? NULL_TREE : TREE_CHAIN (NODE))
1005 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
1006 that don't change the machine mode. */
1008 #define STRIP_NOPS(EXP) \
1009 while ((TREE_CODE (EXP) == NOP_EXPR \
1010 || TREE_CODE (EXP) == CONVERT_EXPR \
1011 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1012 && TREE_OPERAND (EXP, 0) != error_mark_node \
1013 && (TYPE_MODE (TREE_TYPE (EXP)) \
1014 == TYPE_MODE (GENERIC_TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1015 (EXP) = TREE_OPERAND (EXP, 0)
1017 /* Like STRIP_NOPS, but don't let the signedness change either. */
1019 #define STRIP_SIGN_NOPS(EXP) \
1020 while ((TREE_CODE (EXP) == NOP_EXPR \
1021 || TREE_CODE (EXP) == CONVERT_EXPR \
1022 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1023 && TREE_OPERAND (EXP, 0) != error_mark_node \
1024 && (TYPE_MODE (TREE_TYPE (EXP)) \
1025 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1026 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
1027 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1028 && (POINTER_TYPE_P (TREE_TYPE (EXP)) \
1029 == POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1030 (EXP) = TREE_OPERAND (EXP, 0)
1032 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1034 #define STRIP_TYPE_NOPS(EXP) \
1035 while ((TREE_CODE (EXP) == NOP_EXPR \
1036 || TREE_CODE (EXP) == CONVERT_EXPR \
1037 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1038 && TREE_OPERAND (EXP, 0) != error_mark_node \
1039 && (TREE_TYPE (EXP) \
1040 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1041 (EXP) = TREE_OPERAND (EXP, 0)
1043 /* Remove unnecessary type conversions according to
1044 tree_ssa_useless_type_conversion. */
1046 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1047 while (tree_ssa_useless_type_conversion (EXP)) \
1048 EXP = TREE_OPERAND (EXP, 0)
1050 /* Nonzero if TYPE represents an integral type. Note that we do not
1051 include COMPLEX types here. Keep these checks in ascending code
1054 #define INTEGRAL_TYPE_P(TYPE) \
1055 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1056 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1057 || TREE_CODE (TYPE) == INTEGER_TYPE)
1059 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1061 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1062 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1064 /* Nonzero if TYPE represents a saturating fixed-point type. */
1066 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1067 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1069 /* Nonzero if TYPE represents a fixed-point type. */
1071 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1073 /* Nonzero if TYPE represents a scalar floating-point type. */
1075 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1077 /* Nonzero if TYPE represents a complex floating-point type. */
1079 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1080 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1081 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1083 /* Nonzero if TYPE represents a vector floating-point type. */
1085 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1086 (TREE_CODE (TYPE) == VECTOR_TYPE \
1087 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1089 /* Nonzero if TYPE represents a floating-point type, including complex
1090 and vector floating-point types. The vector and complex check does
1091 not use the previous two macros to enable early folding. */
1093 #define FLOAT_TYPE_P(TYPE) \
1094 (SCALAR_FLOAT_TYPE_P (TYPE) \
1095 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1096 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1097 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1099 /* Nonzero if TYPE represents a decimal floating-point type. */
1100 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1101 (SCALAR_FLOAT_TYPE_P (TYPE) \
1102 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1104 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1105 Keep these checks in ascending code order. */
1107 #define AGGREGATE_TYPE_P(TYPE) \
1108 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1109 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1111 /* Nonzero if TYPE represents a pointer or reference type.
1112 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1113 ascending code order. */
1115 #define POINTER_TYPE_P(TYPE) \
1116 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1118 /* Nonzero if this type is a complete type. */
1119 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1121 /* Nonzero if this type is the (possibly qualified) void type. */
1122 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1124 /* Nonzero if this type is complete or is cv void. */
1125 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1126 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1128 /* Nonzero if this type is complete or is an array with unspecified bound. */
1129 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1130 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1133 /* Define many boolean fields that all tree nodes have. */
1135 /* In VAR_DECL nodes, nonzero means address of this is needed.
1136 So it cannot be in a register.
1137 In a FUNCTION_DECL, nonzero means its address is needed.
1138 So it must be compiled even if it is an inline function.
1139 In a FIELD_DECL node, it means that the programmer is permitted to
1140 construct the address of this field. This is used for aliasing
1141 purposes: see record_component_aliases.
1142 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1143 In LABEL_DECL nodes, it means a goto for this label has been seen
1144 from a place outside all binding contours that restore stack levels.
1145 In ..._TYPE nodes, it means that objects of this type must
1146 be fully addressable. This means that pieces of this
1147 object cannot go into register parameters, for example.
1148 In IDENTIFIER_NODEs, this means that some extern decl for this name
1149 had its address taken. That matters for inline functions. */
1150 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1152 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1153 exit of a function. Calls for which this is true are candidates for tail
1154 call optimizations. */
1155 #define CALL_EXPR_TAILCALL(NODE) \
1156 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1158 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1159 CASE_LOW operand has been processed. */
1160 #define CASE_LOW_SEEN(NODE) \
1161 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1163 #define PREDICT_EXPR_OUTCOME(NODE) \
1164 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag)
1165 #define PREDICT_EXPR_PREDICTOR(NODE) \
1166 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1168 /* In a VAR_DECL, nonzero means allocate static storage.
1169 In a FUNCTION_DECL, nonzero if function has been defined.
1170 In a CONSTRUCTOR, nonzero means allocate static storage.
1172 ??? This is also used in lots of other nodes in unclear ways which
1173 should be cleaned up some day. */
1174 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1176 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1177 should only be executed if an exception is thrown, not on normal exit
1179 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1181 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1182 separate cleanup in honor_protect_cleanup_actions. */
1183 #define TRY_CATCH_IS_CLEANUP(NODE) \
1184 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1186 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1187 CASE_HIGH operand has been processed. */
1188 #define CASE_HIGH_SEEN(NODE) \
1189 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1191 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1192 #define CALL_CANNOT_INLINE_P(NODE) ((NODE)->base.static_flag)
1194 /* In an expr node (usually a conversion) this means the node was made
1195 implicitly and should not lead to any sort of warning. In a decl node,
1196 warnings concerning the decl should be suppressed. This is used at
1197 least for used-before-set warnings, and it set after one warning is
1199 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1201 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1202 this string as an argument. */
1203 #define TREE_SYMBOL_REFERENCED(NODE) \
1204 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1206 /* Nonzero in a pointer or reference type means the data pointed to
1207 by this type can alias anything. */
1208 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1209 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1211 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1212 #define MOVE_NONTEMPORAL(NODE) \
1213 (GIMPLE_MODIFY_STMT_CHECK (NODE)->base.static_flag)
1215 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1216 there was an overflow in folding. */
1218 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1220 /* ??? This is an obsolete synonym for TREE_OVERFLOW. */
1221 #define TREE_CONSTANT_OVERFLOW(NODE) TREE_OVERFLOW(NODE)
1223 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1225 #define TREE_OVERFLOW_P(EXPR) \
1226 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1228 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1229 nonzero means name is to be accessible from outside this module.
1230 In an IDENTIFIER_NODE, nonzero means an external declaration
1231 accessible from outside this module was previously seen
1232 for this name in an inner scope. */
1233 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1235 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1236 of cached values, or is something else. */
1237 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1239 /* In a SAVE_EXPR, indicates that the original expression has already
1240 been substituted with a VAR_DECL that contains the value. */
1241 #define SAVE_EXPR_RESOLVED_P(NODE) \
1242 (TREE_CHECK (NODE, SAVE_EXPR)->base.public_flag)
1244 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1246 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1247 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1249 /* In any expression, decl, or constant, nonzero means it has side effects or
1250 reevaluation of the whole expression could produce a different value.
1251 This is set if any subexpression is a function call, a side effect or a
1252 reference to a volatile variable. In a ..._DECL, this is set only if the
1253 declaration said `volatile'. This will never be set for a constant. */
1254 #define TREE_SIDE_EFFECTS(NODE) \
1255 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1257 /* In a LABEL_DECL, nonzero means this label had its address taken
1258 and therefore can never be deleted and is a jump target for
1260 #define FORCED_LABEL(NODE) ((NODE)->base.side_effects_flag)
1262 /* Nonzero means this expression is volatile in the C sense:
1263 its address should be of type `volatile WHATEVER *'.
1264 In other words, the declared item is volatile qualified.
1265 This is used in _DECL nodes and _REF nodes.
1266 On a FUNCTION_DECL node, this means the function does not
1267 return normally. This is the same effect as setting
1268 the attribute noreturn on the function in C.
1270 In a ..._TYPE node, means this type is volatile-qualified.
1271 But use TYPE_VOLATILE instead of this macro when the node is a type,
1272 because eventually we may make that a different bit.
1274 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1275 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1277 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1278 accessing the memory pointed to won't generate a trap. However,
1279 this only applies to an object when used appropriately: it doesn't
1280 mean that writing a READONLY mem won't trap. Similarly for
1281 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1283 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1284 (or slice of the array) always belongs to the range of the array.
1285 I.e. that the access will not trap, provided that the access to
1286 the base to the array will not trap. */
1287 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1289 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1290 nonzero means it may not be the lhs of an assignment. */
1291 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1293 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1294 #define TREE_READONLY_DECL_P(NODE)\
1295 (DECL_P (NODE) && TREE_READONLY (NODE))
1297 /* Value of expression is constant. Always on in all ..._CST nodes. May
1298 also appear in an expression or decl where the value is constant. */
1299 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1301 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1302 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1303 (TYPE_CHECK (NODE)->base.constant_flag)
1305 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1306 #define DECL_UNSIGNED(NODE) \
1307 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1309 /* In integral and pointer types, means an unsigned type. */
1310 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1312 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1313 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1314 This is interesting in an inline function, since it might not need
1315 to be compiled separately.
1316 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1317 if the sdb debugging info for the type has been written.
1318 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1319 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1321 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1323 /* Nonzero in a _DECL if the name is used in its scope.
1324 Nonzero in an expr node means inhibit warning if value is unused.
1325 In IDENTIFIER_NODEs, this means that some extern decl for this name
1327 In a BLOCK, this means that the block contains variables that are used. */
1328 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1330 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1331 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1332 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1334 /* In a CALL_EXPR, means that it's safe to use the target of the call
1335 expansion as the return slot for a call that returns in memory. */
1336 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->base.private_flag)
1338 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1339 reference (and the TREE_TYPE is a pointer to the true type). */
1340 #define DECL_BY_REFERENCE(NODE) \
1341 (DECL_COMMON_CHECK (NODE)->base.private_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) \
1346 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1348 /* In a type, nonzero means that all objects of the type are guaranteed by the
1349 language or front-end to be properly aligned, so we can indicate that a MEM
1350 of this type is aligned at least to the alignment of the type, even if it
1351 doesn't appear that it is. We see this, for example, in object-oriented
1352 languages where a tag field may show this is an object of a more-aligned
1353 variant of the more generic type.
1355 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1357 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1359 /* Used in classes in C++. */
1360 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1361 /* Used in classes in C++.
1362 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1363 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1365 /* Nonzero in a _DECL if the use of the name is defined as a
1366 deprecated feature by __attribute__((deprecated)). */
1367 #define TREE_DEPRECATED(NODE) \
1368 ((NODE)->base.deprecated_flag)
1370 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1371 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1372 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1373 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1375 /* Value of expression is function invariant. A strict subset of
1376 TREE_CONSTANT, such an expression is constant over any one function
1377 invocation, though not across different invocations. May appear in
1378 any expression node. */
1379 #define TREE_INVARIANT(NODE) ((NODE)->base.invariant_flag)
1381 /* In fixed-point types, means a saturating type. */
1382 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1384 /* These flags are available for each language front end to use internally. */
1385 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1386 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1387 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1388 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1389 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1390 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1391 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1393 /* Define additional fields and accessors for nodes representing constants. */
1395 /* In an INTEGER_CST node. These two together make a 2-word integer.
1396 If the data type is signed, the value is sign-extended to 2 words
1397 even though not all of them may really be in use.
1398 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1399 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1400 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1401 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1403 #define INT_CST_LT(A, B) \
1404 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1405 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1406 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1408 #define INT_CST_LT_UNSIGNED(A, B) \
1409 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1410 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1411 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1412 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1413 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1415 struct tree_int_cst GTY(())
1417 struct tree_common common;
1421 /* In a REAL_CST node. struct real_value is an opaque entity, with
1422 manipulators defined in real.h. We don't want tree.h depending on
1423 real.h and transitively on tm.h. */
1426 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1427 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1429 struct tree_real_cst GTY(())
1431 struct tree_common common;
1432 struct real_value * real_cst_ptr;
1435 /* In a FIXED_CST node. */
1438 #define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1439 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1441 struct tree_fixed_cst GTY(())
1443 struct tree_common common;
1444 struct fixed_value * fixed_cst_ptr;
1447 /* In a STRING_CST */
1448 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1449 #define TREE_STRING_POINTER(NODE) \
1450 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1452 struct tree_string GTY(())
1454 struct tree_common common;
1459 /* In a COMPLEX_CST node. */
1460 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1461 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1463 struct tree_complex GTY(())
1465 struct tree_common common;
1470 /* In a VECTOR_CST node. */
1471 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1473 struct tree_vector GTY(())
1475 struct tree_common common;
1481 /* Define fields and accessors for some special-purpose tree nodes. */
1483 #define IDENTIFIER_LENGTH(NODE) \
1484 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1485 #define IDENTIFIER_POINTER(NODE) \
1486 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1487 #define IDENTIFIER_HASH_VALUE(NODE) \
1488 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1490 /* Translate a hash table identifier pointer to a tree_identifier
1491 pointer, and vice versa. */
1493 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1494 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1495 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1497 struct tree_identifier GTY(())
1499 struct tree_common common;
1500 struct ht_identifier id;
1503 /* In a TREE_LIST node. */
1504 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1505 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1507 struct tree_list GTY(())
1509 struct tree_common common;
1514 /* In a TREE_VEC node. */
1515 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1516 #define TREE_VEC_END(NODE) \
1517 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1519 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1521 struct tree_vec GTY(())
1523 struct tree_common common;
1525 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1528 /* In a CONSTRUCTOR node. */
1529 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1531 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1532 value of each element (stored within VAL). IX must be a scratch variable
1533 of unsigned integer type. */
1534 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1535 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1537 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1541 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1542 the value of each element (stored within VAL) and its index (stored
1543 within INDEX). IX must be a scratch variable of unsigned integer type. */
1544 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1545 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1547 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1548 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1552 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1553 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1555 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1556 _ce___->index = INDEX; \
1557 _ce___->value = VALUE; \
1560 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1561 element. INDEX can optionally design the position of VALUE: in arrays,
1562 it is the index where VALUE has to be placed; in structures, it is the
1563 FIELD_DECL of the member. */
1564 typedef struct constructor_elt_d GTY(())
1570 DEF_VEC_O(constructor_elt);
1571 DEF_VEC_ALLOC_O(constructor_elt,gc);
1573 struct tree_constructor GTY(())
1575 struct tree_common common;
1576 VEC(constructor_elt,gc) *elts;
1579 /* Define fields and accessors for some nodes that represent expressions. */
1581 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1582 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1583 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1584 && integer_zerop (TREE_OPERAND (NODE, 0)))
1586 /* In ordinary expression nodes. */
1587 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1588 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1590 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1591 length. Its value includes the length operand itself; that is,
1592 the minimum valid length is 1.
1593 Note that we have to bypass the use of TREE_OPERAND to access
1594 that field to avoid infinite recursion in expanding the macros. */
1595 #define VL_EXP_OPERAND_LENGTH(NODE) \
1596 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1598 /* In gimple statements. */
1599 #define GIMPLE_STMT_OPERAND(NODE, I) GIMPLE_STMT_OPERAND_CHECK (NODE, I)
1600 #define GIMPLE_STMT_LOCUS(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.locus)
1601 #define GIMPLE_STMT_BLOCK(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.block)
1603 /* In a LOOP_EXPR node. */
1604 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1606 /* The source location of this expression. Non-tree_exp nodes such as
1607 decls and constants can be shared among multiple locations, so
1609 #define EXPR_LOCATION(NODE) expr_location ((NODE))
1610 #define SET_EXPR_LOCATION(NODE, FROM) set_expr_location ((NODE), (FROM))
1611 #define EXPR_HAS_LOCATION(NODE) expr_has_location ((NODE))
1612 #define EXPR_LOCUS(NODE) expr_locus ((NODE))
1613 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1614 #define EXPR_FILENAME(NODE) (expr_filename ((NODE)))
1615 #define EXPR_LINENO(NODE) (expr_lineno ((NODE)))
1617 /* True if a tree is an expression or statement that can have a
1619 #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE) || GIMPLE_STMT_P (NODE))
1621 /* In a TARGET_EXPR node. */
1622 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1623 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1624 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1626 /* DECL_EXPR accessor. This gives access to the DECL associated with
1627 the given declaration statement. */
1628 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1630 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1632 /* SWITCH_EXPR accessors. These give access to the condition, body and
1633 original condition type (before any compiler conversions)
1634 of the switch statement, respectively. */
1635 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1636 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1637 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1639 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1640 of a case label, respectively. */
1641 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1642 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1643 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1645 /* The operands of a TARGET_MEM_REF. */
1646 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1647 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1648 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1649 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1650 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1651 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1652 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1654 /* The operands of a BIND_EXPR. */
1655 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1656 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1657 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1659 /* GOTO_EXPR accessor. This gives access to the label associated with
1660 a goto statement. */
1661 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1663 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1664 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1665 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1667 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1668 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1669 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1670 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1671 /* Nonzero if we want to create an ASM_INPUT instead of an
1672 ASM_OPERAND with no operands. */
1673 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1674 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1676 /* COND_EXPR accessors. */
1677 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1678 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1679 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1681 /* Accessors for the chains of recurrences. */
1682 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1683 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1684 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1685 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1687 /* LABEL_EXPR accessor. This gives access to the label associated with
1688 the given label expression. */
1689 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1691 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1692 accessors for SSA operands. */
1694 /* CATCH_EXPR accessors. */
1695 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1696 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1698 /* EH_FILTER_EXPR accessors. */
1699 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1700 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1701 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1703 /* CHANGE_DYNAMIC_TYPE_EXPR accessors. */
1704 #define CHANGE_DYNAMIC_TYPE_NEW_TYPE(NODE) \
1705 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 0)
1706 #define CHANGE_DYNAMIC_TYPE_LOCATION(NODE) \
1707 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 1)
1709 /* OBJ_TYPE_REF accessors. */
1710 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1711 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1712 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1714 /* ASSERT_EXPR accessors. */
1715 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1716 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1718 /* CALL_EXPR accessors.
1720 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1721 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1722 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1723 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1724 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1726 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1727 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1728 the argument count is zero when checking is enabled. Instead, do
1729 the pointer arithmetic to advance past the 3 fixed operands in a
1730 CALL_EXPR. That produces a valid pointer to just past the end of the
1731 operand array, even if it's not valid to dereference it. */
1732 #define CALL_EXPR_ARGP(NODE) \
1733 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1735 /* OpenMP directive and clause accessors. */
1737 #define OMP_BODY(NODE) \
1738 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1739 #define OMP_CLAUSES(NODE) \
1740 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1742 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1743 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1744 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1745 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1747 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1748 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1749 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1750 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1751 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1752 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1754 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1755 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1756 #define OMP_SECTIONS_CONTROL(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 2)
1758 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1760 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1761 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1763 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1765 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1767 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1768 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1770 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1771 #define OMP_CLAUSE_DECL(NODE) \
1772 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1773 OMP_CLAUSE_PRIVATE, \
1774 OMP_CLAUSE_COPYPRIVATE), 0)
1776 /* True on an OMP_SECTION statement that was the last lexical member.
1777 This status is meaningful in the implementation of lastprivate. */
1778 #define OMP_SECTION_LAST(NODE) \
1779 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1781 /* True on an OMP_RETURN statement if the return does not require a
1782 thread synchronization via some sort of barrier. The exact barrier
1783 that would otherwise be emitted is dependent on the OMP statement
1784 with which this return is associated. */
1785 #define OMP_RETURN_NOWAIT(NODE) \
1786 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1788 /* True on an OMP_PARALLEL statement if it represents an explicit
1789 combined parallel work-sharing constructs. */
1790 #define OMP_PARALLEL_COMBINED(NODE) \
1791 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1793 /* True on a PRIVATE clause if its decl is kept around for debugging
1794 information only and its DECL_VALUE_EXPR is supposed to point
1795 to what it has been remapped to. */
1796 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1797 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1799 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1800 decl is present in the chain. */
1801 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1802 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1804 #define OMP_CLAUSE_IF_EXPR(NODE) \
1805 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1806 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1807 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1808 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1809 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1811 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1812 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1813 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1814 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1815 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1816 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1817 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1818 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1820 enum omp_clause_schedule_kind
1822 OMP_CLAUSE_SCHEDULE_STATIC,
1823 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1824 OMP_CLAUSE_SCHEDULE_GUIDED,
1825 OMP_CLAUSE_SCHEDULE_RUNTIME
1828 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1829 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1831 enum omp_clause_default_kind
1833 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1834 OMP_CLAUSE_DEFAULT_SHARED,
1835 OMP_CLAUSE_DEFAULT_NONE,
1836 OMP_CLAUSE_DEFAULT_PRIVATE
1839 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1840 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1842 struct tree_exp GTY(())
1844 struct tree_common common;
1847 tree GTY ((special ("tree_exp"),
1848 desc ("TREE_CODE ((tree) &%0)")))
1852 /* SSA_NAME accessors. */
1854 /* Returns the variable being referenced. Once released, this is the
1855 only field that can be relied upon. */
1856 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1858 /* Returns the statement which defines this reference. Note that
1859 we use the same field when chaining SSA_NAME nodes together on
1860 the SSA_NAME freelist. */
1861 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1863 /* Returns the SSA version number of this SSA name. Note that in
1864 tree SSA, version numbers are not per variable and may be recycled. */
1865 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1867 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1868 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1870 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1871 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1873 /* Nonzero if this SSA_NAME expression is currently on the free list of
1874 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1875 has no meaning for an SSA_NAME. */
1876 #define SSA_NAME_IN_FREE_LIST(NODE) \
1877 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1879 /* Nonzero if this SSA_NAME is the default definition for the
1880 underlying symbol. A default SSA name is created for symbol S if
1881 the very first reference to S in the function is a read operation.
1882 Default definitions are always created by an empty statement and
1883 belong to no basic block. */
1884 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1885 SSA_NAME_CHECK (NODE)->base.default_def_flag
1887 /* Attributes for SSA_NAMEs for pointer-type variables. */
1888 #define SSA_NAME_PTR_INFO(N) \
1889 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1891 /* Get the value of this SSA_NAME, if available. */
1892 #define SSA_NAME_VALUE(N) \
1893 SSA_NAME_CHECK (N)->ssa_name.value_handle
1895 #ifndef _TREE_FLOW_H
1896 struct ptr_info_def;
1901 /* Immediate use linking structure. This structure is used for maintaining
1902 a doubly linked list of uses of an SSA_NAME. */
1903 typedef struct ssa_use_operand_d GTY(())
1905 struct ssa_use_operand_d* GTY((skip(""))) prev;
1906 struct ssa_use_operand_d* GTY((skip(""))) next;
1907 tree GTY((skip(""))) stmt;
1908 tree *GTY((skip(""))) use;
1909 } ssa_use_operand_t;
1911 /* Return the immediate_use information for an SSA_NAME. */
1912 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1914 struct tree_ssa_name GTY(())
1916 struct tree_common common;
1918 /* _DECL wrapped by this SSA name. */
1921 /* SSA version number. */
1922 unsigned int version;
1924 /* Pointer attributes used for alias analysis. */
1925 struct ptr_info_def *ptr_info;
1927 /* Value for SSA name used by various passes.
1929 Right now only invariants are allowed to persist beyond a pass in
1930 this field; in the future we will allow VALUE_HANDLEs to persist
1934 /* Immediate uses list for this SSA_NAME. */
1935 struct ssa_use_operand_d imm_uses;
1938 /* In a PHI_NODE node. */
1940 /* These 2 macros should be considered off limits for use by developers. If
1941 you wish to access the use or def fields of a PHI_NODE in the SSA
1942 optimizers, use the accessor macros found in tree-ssa-operands.h.
1943 These two macros are to be used only by those accessor macros, and other
1944 select places where we *absolutely* must take the address of the tree. */
1946 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1947 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1949 /* PHI_NODEs for each basic block are chained together in a single linked
1950 list. The head of the list is linked from the block annotation, and
1951 the link to the next PHI is in PHI_CHAIN. */
1952 #define PHI_CHAIN(NODE) PHI_NODE_CHECK (NODE)->phi.chain
1954 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1955 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1956 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1957 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1958 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1959 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1961 struct phi_arg_d GTY(())
1963 /* imm_use MUST be the first element in struct because we do some
1964 pointer arithmetic with it. See phi_arg_index_from_use. */
1965 struct ssa_use_operand_d imm_use;
1969 struct tree_phi_node GTY(())
1971 struct tree_base common;
1977 /* Basic block holding this PHI node. */
1978 struct basic_block_def *bb;
1980 /* Arguments of the PHI node. These are maintained in the same
1981 order as predecessor edge vector BB->PREDS. */
1982 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1986 #define OMP_CLAUSE_CODE(NODE) \
1987 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1989 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1990 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1992 #define OMP_CLAUSE_CODE(NODE) \
1993 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1995 #define OMP_CLAUSE_OPERAND(NODE, I) \
1996 OMP_CLAUSE_ELT_CHECK (NODE, I)
1998 struct tree_omp_clause GTY(())
2000 struct tree_common common;
2001 enum omp_clause_code code;
2002 union omp_clause_subcode {
2003 enum omp_clause_default_kind default_kind;
2004 enum omp_clause_schedule_kind schedule_kind;
2005 enum tree_code reduction_code;
2006 } GTY ((skip)) subcode;
2007 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
2011 struct varray_head_tag;
2013 /* In a BLOCK node. */
2014 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2015 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2016 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2017 /* Note: when changing this, make sure to find the places
2018 that use chainon or nreverse. */
2019 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
2020 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2021 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
2023 /* Nonzero means that this block is prepared to handle exceptions
2024 listed in the BLOCK_VARS slot. */
2025 #define BLOCK_HANDLER_BLOCK(NODE) \
2026 (BLOCK_CHECK (NODE)->block.handler_block_flag)
2028 /* An index number for this block. These values are not guaranteed to
2029 be unique across functions -- whether or not they are depends on
2030 the debugging output format in use. */
2031 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2033 /* If block reordering splits a lexical block into discontiguous
2034 address ranges, we'll make a copy of the original block.
2036 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2037 In that case, we have one source block that has been replicated
2038 (through inlining or unrolling) into many logical blocks, and that
2039 these logical blocks have different physical variables in them.
2041 In this case, we have one logical block split into several
2042 non-contiguous address ranges. Most debug formats can't actually
2043 represent this idea directly, so we fake it by creating multiple
2044 logical blocks with the same variables in them. However, for those
2045 that do support non-contiguous regions, these allow the original
2046 logical block to be reconstructed, along with the set of address
2049 One of the logical block fragments is arbitrarily chosen to be
2050 the ORIGIN. The other fragments will point to the origin via
2051 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2052 be null. The list of fragments will be chained through
2053 BLOCK_FRAGMENT_CHAIN from the origin. */
2055 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2056 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2058 /* For an inlined function, this gives the location where it was called
2059 from. This is only set in the top level block, which corresponds to the
2060 inlined function scope. This is used in the debug output routines. */
2062 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2064 struct tree_block GTY(())
2066 struct tree_common common;
2068 unsigned handler_block_flag : 1;
2069 unsigned abstract_flag : 1;
2070 unsigned block_num : 30;
2077 tree abstract_origin;
2078 tree fragment_origin;
2079 tree fragment_chain;
2082 /* Define fields and accessors for nodes representing data types. */
2084 /* See tree.def for documentation of the use of these fields.
2085 Look at the documentation of the various ..._TYPE tree codes.
2087 Note that the type.values, type.minval, and type.maxval fields are
2088 overloaded and used for different macros in different kinds of types.
2089 Each macro must check to ensure the tree node is of the proper kind of
2090 type. Note also that some of the front-ends also overload these fields,
2091 so they must be checked as well. */
2093 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2094 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2095 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2096 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
2097 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2098 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2099 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2100 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2101 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2102 (INTEGER_TYPE_CHECK (NODE)->type.values \
2103 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2104 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2105 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2106 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2107 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2108 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2109 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2110 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2111 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2112 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2113 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2114 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2115 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2116 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2117 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2118 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2119 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2120 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2121 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2122 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2124 /* The "canonical" type for this type node, which can be used to
2125 compare the type for equality with another type. If two types are
2126 equal (based on the semantics of the language), then they will have
2127 equivalent TYPE_CANONICAL entries.
2129 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2130 be used for comparison against other types. Instead, the type is
2131 said to require structural equality checks, described in
2132 TYPE_STRUCTURAL_EQUALITY_P. */
2133 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2134 /* Indicates that the type node requires structural equality
2135 checks. The compiler will need to look at the composition of the
2136 type to determine whether it is equal to another type, rather than
2137 just comparing canonical type pointers. For instance, we would need
2138 to look at the return and parameter types of a FUNCTION_TYPE
2140 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2141 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2142 type node requires structural equality. */
2143 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2144 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2145 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2146 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2148 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2149 in the debugging output. We use this to describe a vector as a
2150 structure containing an array. */
2151 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2153 /* For record and union types, information about this type, as a base type
2155 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2157 /* For non record and union types, used in a language-dependent way. */
2158 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2160 /* The (language-specific) typed-based alias set for this type.
2161 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2162 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2163 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2164 type can alias objects of any type. */
2165 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2167 /* Nonzero iff the typed-based alias set for this type has been
2169 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2171 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2173 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2175 /* The alignment necessary for objects of this type.
2176 The value is an int, measured in bits. */
2177 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2179 /* 1 if the alignment for this type was requested by "aligned" attribute,
2180 0 if it is the default for this type. */
2181 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2183 /* The alignment for NODE, in bytes. */
2184 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2186 /* If your language allows you to declare types, and you want debug info
2187 for them, then you need to generate corresponding TYPE_DECL nodes.
2188 These "stub" TYPE_DECL nodes have no name, and simply point at the
2189 type node. You then set the TYPE_STUB_DECL field of the type node
2190 to point back at the TYPE_DECL node. This allows the debug routines
2191 to know that the two nodes represent the same type, so that we only
2192 get one debug info record for them. */
2193 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2195 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2196 has BLKmode only because it lacks the alignment requirement for
2198 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2200 /* In an INTEGER_TYPE, it means the type represents a size. We use
2201 this both for validity checking and to permit optimizations that
2202 are unsafe for other types. Note that the C `size_t' type should
2203 *not* have this flag set. The `size_t' type is simply a typedef
2204 for an ordinary integer type that happens to be the type of an
2205 expression returned by `sizeof'; `size_t' has no special
2206 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2207 always actual sizes. */
2208 #define TYPE_IS_SIZETYPE(NODE) \
2209 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2211 /* Nonzero in a type considered volatile as a whole. */
2212 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2214 /* Means this type is const-qualified. */
2215 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2217 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2219 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2221 /* There is a TYPE_QUAL value for each type qualifier. They can be
2222 combined by bitwise-or to form the complete set of qualifiers for a
2225 #define TYPE_UNQUALIFIED 0x0
2226 #define TYPE_QUAL_CONST 0x1
2227 #define TYPE_QUAL_VOLATILE 0x2
2228 #define TYPE_QUAL_RESTRICT 0x4
2230 /* The set of type qualifiers for this type. */
2231 #define TYPE_QUALS(NODE) \
2232 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2233 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2234 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2236 /* These flags are available for each language front end to use internally. */
2237 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2238 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2239 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2240 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2241 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2242 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2243 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2245 /* Used to keep track of visited nodes in tree traversals. This is set to
2246 0 by copy_node and make_node. */
2247 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2249 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2250 that distinguish string from array of char).
2251 If set in a INTEGER_TYPE, indicates a character type. */
2252 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2254 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2255 object of the given ARRAY_TYPE. This allows temporaries to be
2257 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2258 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2260 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2261 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2262 (((unsigned HOST_WIDE_INT) 1) \
2263 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2265 /* Set precision to n when we have 2^n sub-parts of the vector. */
2266 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2267 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2269 /* Indicates that objects of this type must be initialized by calling a
2270 function when they are created. */
2271 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2272 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2274 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2275 the same way that the first union alternative would be passed. */
2276 #define TYPE_TRANSPARENT_UNION(NODE) \
2277 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2279 /* For an ARRAY_TYPE, indicates that it is not permitted to
2280 take the address of a component of the type. */
2281 #define TYPE_NONALIASED_COMPONENT(NODE) \
2282 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2284 /* Indicated that objects of this type should be laid out in as
2285 compact a way as possible. */
2286 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2288 /* Used by type_contains_placeholder_p to avoid recomputation.
2289 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2290 this field directly. */
2291 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2292 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2296 struct tree_type GTY(())
2298 struct tree_common common;
2305 unsigned int precision : 9;
2306 ENUM_BITFIELD(machine_mode) mode : 7;
2308 unsigned string_flag : 1;
2309 unsigned no_force_blk_flag : 1;
2310 unsigned needs_constructing_flag : 1;
2311 unsigned transparent_union_flag : 1;
2312 unsigned packed_flag : 1;
2313 unsigned restrict_flag : 1;
2314 unsigned contains_placeholder_bits : 2;
2316 unsigned lang_flag_0 : 1;
2317 unsigned lang_flag_1 : 1;
2318 unsigned lang_flag_2 : 1;
2319 unsigned lang_flag_3 : 1;
2320 unsigned lang_flag_4 : 1;
2321 unsigned lang_flag_5 : 1;
2322 unsigned lang_flag_6 : 1;
2323 unsigned user_align : 1;
2328 union tree_type_symtab {
2329 int GTY ((tag ("0"))) address;
2330 const char * GTY ((tag ("1"))) pointer;
2331 struct die_struct * GTY ((tag ("2"))) die;
2332 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2333 descbits ("2"))) symtab;
2342 alias_set_type alias_set;
2343 /* Points to a structure whose details depend on the language in use. */
2344 struct lang_type *lang_specific;
2347 /* Define accessor macros for information about type inheritance
2350 A "basetype" means a particular usage of a data type for inheritance
2351 in another type. Each such basetype usage has its own "binfo"
2352 object to describe it. The binfo object is a TREE_VEC node.
2354 Inheritance is represented by the binfo nodes allocated for a
2355 given type. For example, given types C and D, such that D is
2356 inherited by C, 3 binfo nodes will be allocated: one for describing
2357 the binfo properties of C, similarly one for D, and one for
2358 describing the binfo properties of D as a base type for C.
2359 Thus, given a pointer to class C, one can get a pointer to the binfo
2360 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2362 /* BINFO specific flags. */
2364 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2365 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2367 /* Flags for language dependent use. */
2368 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2369 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2370 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2371 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2372 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2373 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2374 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2376 /* The actual data type node being inherited in this basetype. */
2377 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2379 /* The offset where this basetype appears in its containing type.
2380 BINFO_OFFSET slot holds the offset (in bytes)
2381 from the base of the complete object to the base of the part of the
2382 object that is allocated on behalf of this `type'.
2383 This is always 0 except when there is multiple inheritance. */
2385 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2386 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2388 /* The virtual function table belonging to this basetype. Virtual
2389 function tables provide a mechanism for run-time method dispatching.
2390 The entries of a virtual function table are language-dependent. */
2392 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2394 /* The virtual functions in the virtual function table. This is
2395 a TREE_LIST that is used as an initial approximation for building
2396 a virtual function table for this basetype. */
2397 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2399 /* A vector of binfos for the direct basetypes inherited by this
2402 If this basetype describes type D as inherited in C, and if the
2403 basetypes of D are E and F, then this vector contains binfos for
2404 inheritance of E and F by C. */
2405 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2407 /* The number of basetypes for NODE. */
2408 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2410 /* Accessor macro to get to the Nth base binfo of this binfo. */
2411 #define BINFO_BASE_BINFO(NODE,N) \
2412 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2413 #define BINFO_BASE_ITERATE(NODE,N,B) \
2414 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2415 #define BINFO_BASE_APPEND(NODE,T) \
2416 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2418 /* For a BINFO record describing a virtual base class, i.e., one where
2419 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2420 base. The actual contents are language-dependent. In the C++
2421 front-end this field is an INTEGER_CST giving an offset into the
2422 vtable where the offset to the virtual base can be found. */
2423 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2425 /* Indicates the accesses this binfo has to its bases. The values are
2426 access_public_node, access_protected_node or access_private_node.
2427 If this array is not present, public access is implied. */
2428 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2430 #define BINFO_BASE_ACCESS(NODE,N) \
2431 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2432 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2433 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2435 /* The index in the VTT where this subobject's sub-VTT can be found.
2436 NULL_TREE if there is no sub-VTT. */
2437 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2439 /* The index in the VTT where the vptr for this subobject can be
2440 found. NULL_TREE if there is no secondary vptr in the VTT. */
2441 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2443 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2444 inheriting this base for non-virtual bases. For virtual bases it
2445 points either to the binfo for which this is a primary binfo, or to
2446 the binfo of the most derived type. */
2447 #define BINFO_INHERITANCE_CHAIN(NODE) \
2448 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2450 struct tree_binfo GTY (())
2452 struct tree_common common;
2458 VEC(tree,gc) *base_accesses;
2464 VEC(tree,none) base_binfos;
2468 /* Define fields and accessors for nodes representing declared names. */
2470 /* Nonzero if DECL represents a variable for the SSA passes. */
2471 #define SSA_VAR_P(DECL) \
2472 (TREE_CODE (DECL) == VAR_DECL \
2473 || TREE_CODE (DECL) == PARM_DECL \
2474 || TREE_CODE (DECL) == RESULT_DECL \
2476 || (TREE_CODE (DECL) == SSA_NAME \
2477 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2478 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2479 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2480 || MTAG_P (SSA_NAME_VAR (DECL)))))
2485 /* Enumerate visibility settings. */
2486 #ifndef SYMBOL_VISIBILITY_DEFINED
2487 #define SYMBOL_VISIBILITY_DEFINED
2488 enum symbol_visibility
2491 VISIBILITY_PROTECTED,
2500 /* This is the name of the object as written by the user.
2501 It is an IDENTIFIER_NODE. */
2502 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2504 /* Every ..._DECL node gets a unique number. */
2505 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2507 /* These two fields describe where in the source code the declaration
2508 was. If the declaration appears in several places (as for a C
2509 function that is declared first and then defined later), this
2510 information should refer to the definition. */
2511 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2512 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2513 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2514 #define DECL_IS_BUILTIN(DECL) \
2515 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2517 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2518 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2519 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2520 points to either the FUNCTION_DECL for the containing function,
2521 the RECORD_TYPE or UNION_TYPE for the containing type, or
2522 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2524 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2525 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2526 struct tree_decl_minimal GTY(())
2528 struct tree_common common;
2535 /* When computing aliasing information, we represent the memory pointed-to
2536 by pointers with artificial variables called "memory tags" (MT). There
2537 are two kinds of tags, namely symbol and name:
2539 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2540 represent all the pointed-to locations and variables pointed-to by
2541 the same pointer symbol. Usually, this set is computed using
2542 type-based analysis (i.e., alias set classes), but this may not
2545 Name tags (NMT) are used in flow-sensitive points-to alias
2546 analysis, they represent the variables and memory locations
2547 pointed-to by a specific SSA_NAME pointer.
2549 In general, given a pointer P with a symbol tag SMT, the alias set
2550 of SMT should be the union of all the alias sets of the NMTs of
2551 every SSA_NAME for P. */
2552 struct tree_memory_tag GTY(())
2554 struct tree_decl_minimal common;
2556 bitmap GTY ((skip)) aliases;
2558 /* True if this tag has global scope. */
2559 unsigned int is_global : 1;
2561 /* True if this tag is the first field of an aggregate type that
2562 can be used to find adjacent SFTs belonging to the same aggregate. */
2563 unsigned int base_for_components : 1;
2565 /* True if this tag should not be grouped into a memory partition. */
2566 unsigned int unpartitionable : 1;
2569 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2570 #define MTAG_ALIASES(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.aliases)
2572 struct tree_struct_field_tag GTY(())
2574 struct tree_memory_tag common;
2576 /* Parent variable. */
2579 /* Offset inside structure. */
2580 unsigned HOST_WIDE_INT offset;
2582 /* Size of the field. */
2583 unsigned HOST_WIDE_INT size;
2585 /* Alias set for a DECL_NONADDRESSABLE_P field. Otherwise -1. */
2586 alias_set_type alias_set;
2588 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2589 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2590 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2591 #define SFT_NONADDRESSABLE_P(NODE) \
2592 (STRUCT_FIELD_TAG_CHECK (NODE)->sft.alias_set != -1)
2593 #define SFT_ALIAS_SET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.alias_set)
2594 #define SFT_UNPARTITIONABLE_P(NODE) \
2595 (STRUCT_FIELD_TAG_CHECK (NODE)->sft.common.unpartitionable)
2596 #define SFT_BASE_FOR_COMPONENTS_P(NODE) \
2597 (STRUCT_FIELD_TAG_CHECK (NODE)->sft.common.base_for_components)
2599 /* Memory Partition Tags (MPTs) group memory symbols under one
2600 common name for the purposes of placing memory PHI nodes. */
2602 struct tree_memory_partition_tag GTY(())
2604 struct tree_memory_tag common;
2606 /* Set of symbols grouped under this MPT. */
2610 #define MPT_SYMBOLS(NODE) (MEMORY_PARTITION_TAG_CHECK (NODE)->mpt.symbols)
2613 /* For any sort of a ..._DECL node, this points to the original (abstract)
2614 decl node which this decl is an instance of, or else it is NULL indicating
2615 that this decl is not an instance of some other decl. For example,
2616 in a nested declaration of an inline function, this points back to the
2618 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2620 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2621 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2622 #define DECL_ORIGIN(NODE) \
2623 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2625 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2626 inline instance of some original (abstract) decl from an inline function;
2627 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2628 nodes can also have their abstract origin set to themselves. */
2629 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2630 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2632 /* In a DECL this is the field where attributes are stored. */
2633 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2635 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2636 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2637 For a VAR_DECL, holds the initial value.
2638 For a PARM_DECL, not used--default
2639 values for parameters are encoded in the type of the function,
2640 not in the PARM_DECL slot.
2641 For a FIELD_DECL, this is used for enumeration values and the C
2642 frontend uses it for temporarily storing bitwidth of bitfields.
2644 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2645 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2647 /* Holds the size of the datum, in bits, as a tree expression.
2648 Need not be constant. */
2649 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2650 /* Likewise for the size in bytes. */
2651 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2652 /* Holds the alignment required for the datum, in bits. */
2653 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2654 /* The alignment of NODE, in bytes. */
2655 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2656 /* Set if the alignment of this DECL has been set by the user, for
2657 example with an 'aligned' attribute. */
2658 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2659 /* Holds the machine mode corresponding to the declaration of a variable or
2660 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2662 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2664 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2665 operation it is. Note, however, that this field is overloaded, with
2666 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2667 checked before any access to the former. */
2668 #define DECL_FUNCTION_CODE(NODE) \
2669 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2670 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2671 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2673 /* Nonzero for a given ..._DECL node means that the name of this node should
2674 be ignored for symbolic debug purposes. */
2675 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2677 /* Nonzero for a given ..._DECL node means that this node represents an
2678 "abstract instance" of the given declaration (e.g. in the original
2679 declaration of an inline function). When generating symbolic debugging
2680 information, we mustn't try to generate any address information for nodes
2681 marked as "abstract instances" because we don't actually generate
2682 any code or allocate any data space for such instances. */
2683 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2685 /* Language-specific decl information. */
2686 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2688 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2689 do not allocate storage, and refer to a definition elsewhere. Note that
2690 this does not necessarily imply the entity represented by NODE
2691 has no program source-level definition in this translation unit. For
2692 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2693 DECL_EXTERNAL may be true simultaneously; that can be the case for
2694 a C99 "extern inline" function. */
2695 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2697 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2698 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2700 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2702 Also set in some languages for variables, etc., outside the normal
2703 lexical scope, such as class instance variables. */
2704 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2706 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2707 Used in FIELD_DECLs for vtable pointers.
2708 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2709 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2711 /* Used to indicate that this DECL represents a compiler-generated entity. */
2712 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2714 /* Additional flags for language-specific uses. */
2715 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2716 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2717 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2718 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2719 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2720 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2721 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2722 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2724 /* Used to indicate an alias set for the memory pointed to by this
2725 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2726 pointer (or reference) type. */
2727 #define DECL_POINTER_ALIAS_SET(NODE) \
2728 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2730 /* Nonzero if an alias set has been assigned to this declaration. */
2731 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2732 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2734 /* Nonzero for a decl which is at file scope. */
2735 #define DECL_FILE_SCOPE_P(EXP) \
2736 (! DECL_CONTEXT (EXP) \
2737 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2739 /* Nonzero for a decl that is decorated using attribute used.
2740 This indicates compiler tools that this decl needs to be preserved. */
2741 #define DECL_PRESERVE_P(DECL) \
2742 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2744 /* For function local variables of COMPLEX and VECTOR types,
2745 indicates that the variable is not aliased, and that all
2746 modifications to the variable have been adjusted so that
2747 they are killing assignments. Thus the variable may now
2748 be treated as a GIMPLE register, and use real instead of
2749 virtual ops in SSA form. */
2750 #define DECL_GIMPLE_REG_P(DECL) \
2751 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2753 /* For a DECL with pointer type, this is set if Type Based Alias
2754 Analysis should not be applied to this DECL. */
2755 #define DECL_NO_TBAA_P(DECL) \
2756 DECL_COMMON_CHECK (DECL)->decl_common.no_tbaa_flag
2758 struct tree_decl_common GTY(())
2760 struct tree_decl_minimal common;
2763 ENUM_BITFIELD(machine_mode) mode : 8;
2765 unsigned nonlocal_flag : 1;
2766 unsigned virtual_flag : 1;
2767 unsigned ignored_flag : 1;
2768 unsigned abstract_flag : 1;
2769 unsigned artificial_flag : 1;
2770 unsigned user_align : 1;
2771 unsigned preserve_flag: 1;
2772 unsigned debug_expr_is_from : 1;
2774 unsigned lang_flag_0 : 1;
2775 unsigned lang_flag_1 : 1;
2776 unsigned lang_flag_2 : 1;
2777 unsigned lang_flag_3 : 1;
2778 unsigned lang_flag_4 : 1;
2779 unsigned lang_flag_5 : 1;
2780 unsigned lang_flag_6 : 1;
2781 unsigned lang_flag_7 : 1;
2783 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2784 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2785 unsigned decl_flag_0 : 1;
2786 /* In FIELD_DECL, this is DECL_PACKED. */
2787 unsigned decl_flag_1 : 1;
2788 /* In FIELD_DECL, this is DECL_BIT_FIELD
2789 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2790 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2791 unsigned decl_flag_2 : 1;
2792 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2793 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2794 unsigned decl_flag_3 : 1;
2795 /* Logically, these two would go in a theoretical base shared by var and
2797 unsigned gimple_reg_flag : 1;
2798 /* In a DECL with pointer type, set if no TBAA should be done. */
2799 unsigned no_tbaa_flag : 1;
2800 /* Padding so that 'align' can be on a 32-bit boundary. */
2801 unsigned decl_common_unused : 2;
2803 unsigned int align : 24;
2804 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2805 unsigned int off_align : 8;
2810 tree abstract_origin;
2812 alias_set_type pointer_alias_set;
2813 /* Points to a structure whose details depend on the language in use. */
2814 struct lang_decl *lang_specific;
2817 extern tree decl_value_expr_lookup (tree);
2818 extern void decl_value_expr_insert (tree, tree);
2820 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2821 if transformations have made this more complicated than evaluating the
2822 decl itself. This should only be used for debugging; once this field has
2823 been set, the decl itself may not legitimately appear in the function. */
2824 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2825 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2826 #define DECL_VALUE_EXPR(NODE) \
2827 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2828 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2829 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2831 /* Holds the RTL expression for the value of a variable or function.
2832 This value can be evaluated lazily for functions, variables with
2833 static storage duration, and labels. */
2834 #define DECL_RTL(NODE) \
2835 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2836 ? (NODE)->decl_with_rtl.rtl \
2837 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2839 /* Set the DECL_RTL for NODE to RTL. */
2840 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2842 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2843 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2845 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2846 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2848 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2849 NODE1, it will not be set for NODE2; this is a lazy copy. */
2850 #define COPY_DECL_RTL(NODE1, NODE2) \
2851 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2853 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2854 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2856 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2857 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2859 struct tree_decl_with_rtl GTY(())
2861 struct tree_decl_common common;
2865 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2866 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2867 of the structure. */
2868 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2870 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2871 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2872 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2873 natural alignment of the field's type). */
2874 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2876 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2877 if so, the type that was originally specified for it.
2878 TREE_TYPE may have been modified (in finish_struct). */
2879 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2881 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2882 if nonzero, indicates that the field occupies the type. */
2883 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2885 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2886 DECL_FIELD_OFFSET which are known to be always zero.
2887 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2889 #define DECL_OFFSET_ALIGN(NODE) \
2890 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2892 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2893 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2894 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2895 /* 1 if the alignment for this type was requested by "aligned" attribute,
2896 0 if it is the default for this type. */
2898 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2899 which this FIELD_DECL is defined. This information is needed when
2900 writing debugging information about vfield and vbase decls for C++. */
2901 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2903 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2904 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2906 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2908 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2910 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2912 #define DECL_NONADDRESSABLE_P(NODE) \
2913 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2915 struct tree_field_decl GTY(())
2917 struct tree_decl_common common;
2920 tree bit_field_type;
2927 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2928 dense, unique within any one function, and may be used to index arrays.
2929 If the value is -1, then no UID has been assigned. */
2930 #define LABEL_DECL_UID(NODE) \
2931 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2933 /* In LABEL_DECL nodes, nonzero means that an error message about
2934 jumping into such a binding contour has been printed for this label. */
2935 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2937 struct tree_label_decl GTY(())
2939 struct tree_decl_with_rtl common;
2942 struct tree_result_decl GTY(())
2944 struct tree_decl_with_rtl common;
2947 struct tree_const_decl GTY(())
2949 struct tree_decl_with_rtl common;
2952 /* For a PARM_DECL, records the data type used to pass the argument,
2953 which may be different from the type seen in the program. */
2954 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2956 /* For PARM_DECL, holds an RTL for the stack slot or register
2957 where the data was actually passed. */
2958 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2960 struct tree_parm_decl GTY(())
2962 struct tree_decl_with_rtl common;
2967 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2968 this variable in a BIND_EXPR. */
2969 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2970 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2972 /* Used to indicate that the linkage status of this DECL is not yet known,
2973 so it should not be output now. */
2974 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2976 /* Nonzero for a given ..._DECL node means that no warnings should be
2977 generated just because this node is unused. */
2978 #define DECL_IN_SYSTEM_HEADER(NODE) \
2979 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2981 /* Used to indicate that this DECL has weak linkage. */
2982 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2984 /* Internal to the gimplifier. Indicates that the value is a formal
2985 temporary controlled by the gimplifier. */
2986 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2987 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2989 /* Used to indicate that the DECL is a dllimport. */
2990 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2992 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2993 based on a variable with a restrict qualified type. If it is,
2994 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2997 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2998 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2999 #define DECL_GET_RESTRICT_BASE(NODE) \
3000 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
3001 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
3002 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
3004 extern tree decl_restrict_base_lookup (tree);
3005 extern void decl_restrict_base_insert (tree, tree);
3007 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3008 not be put out unless it is needed in this translation unit.
3009 Entities like this are shared across translation units (like weak
3010 entities), but are guaranteed to be generated by any translation
3011 unit that needs them, and therefore need not be put out anywhere
3012 where they are not needed. DECL_COMDAT is just a hint to the
3013 back-end; it is up to front-ends which set this flag to ensure
3014 that there will never be any harm, other than bloat, in putting out
3015 something which is DECL_COMDAT. */
3016 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3018 /* A replaceable function is one which may be replaced at link-time
3019 with an entirely different definition, provided that the
3020 replacement has the same type. For example, functions declared
3021 with __attribute__((weak)) on most systems are replaceable.
3023 COMDAT functions are not replaceable, since all definitions of the
3024 function must be equivalent. It is important that COMDAT functions
3025 not be treated as replaceable so that use of C++ template
3026 instantiations is not penalized.
3028 For example, DECL_REPLACEABLE is used to determine whether or not a
3029 function (including a template instantiation) which is not
3030 explicitly declared "inline" can be inlined. If the function is
3031 DECL_REPLACEABLE then it is not safe to do the inlining, since the
3032 implementation chosen at link-time may be different. However, a
3033 function that is not DECL_REPLACEABLE can be inlined, since all
3034 versions of the function will be functionally identical. */
3035 #define DECL_REPLACEABLE_P(NODE) \
3036 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
3038 /* The name of the object as the assembler will see it (but before any
3039 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3040 as DECL_NAME. It is an IDENTIFIER_NODE. */
3041 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3043 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3044 This is true of all DECL nodes except FIELD_DECL. */
3045 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3046 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3048 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3049 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3051 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3052 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3054 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3055 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3056 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3058 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3059 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3060 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3061 semantics of using this macro, are different than saying:
3063 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3065 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3067 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3068 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3069 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3070 DECL_ASSEMBLER_NAME (DECL1)) \
3073 /* Records the section name in a section attribute. Used to pass
3074 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3075 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3077 /* Value of the decls's visibility attribute */
3078 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3080 /* Nonzero means that the decl had its visibility specified rather than
3082 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3084 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3085 multiple translation units should be merged. */
3086 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
3088 struct tree_decl_with_vis GTY(())
3090 struct tree_decl_with_rtl common;
3091 tree assembler_name;
3094 /* Belong to VAR_DECL exclusively. */
3095 unsigned defer_output:1;
3096 unsigned hard_register:1;
3097 unsigned thread_local:1;
3098 unsigned common_flag:1;
3099 unsigned in_text_section : 1;
3100 unsigned gimple_formal_temp : 1;
3101 unsigned dllimport_flag : 1;
3102 unsigned based_on_restrict_p : 1;
3103 /* Used by C++. Might become a generic decl flag. */
3104 unsigned shadowed_for_var_p : 1;
3106 /* Don't belong to VAR_DECL exclusively. */
3107 unsigned in_system_header_flag : 1;
3108 unsigned weak_flag:1;
3109 unsigned seen_in_bind_expr : 1;
3110 unsigned comdat_flag : 1;
3111 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3112 unsigned visibility_specified : 1;
3113 /* Belong to FUNCTION_DECL exclusively. */
3114 unsigned one_only : 1;
3115 unsigned init_priority_p:1;
3117 /* Belongs to VAR_DECL exclusively. */
3118 ENUM_BITFIELD(tls_model) tls_model : 3;
3119 /* 11 unused bits. */
3122 /* In a VAR_DECL that's static,
3123 nonzero if the space is in the text section. */
3124 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3126 /* Nonzero for a given ..._DECL node means that this node should be
3127 put in .common, if possible. If a DECL_INITIAL is given, and it
3128 is not error_mark_node, then the decl cannot be put in .common. */
3129 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3131 /* In a VAR_DECL, nonzero if the decl is a register variable with
3132 an explicit asm specification. */
3133 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3135 extern tree decl_debug_expr_lookup (tree);
3136 extern void decl_debug_expr_insert (tree, tree);
3137 /* For VAR_DECL, this is set to either an expression that it was split
3138 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3139 subexpressions that it was split into. */
3140 #define DECL_DEBUG_EXPR(NODE) \
3141 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3143 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3144 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3146 /* An initializationp priority. */
3147 typedef unsigned short priority_type;
3149 extern priority_type decl_init_priority_lookup (tree);
3150 extern priority_type decl_fini_priority_lookup (tree);
3151 extern void decl_init_priority_insert (tree, priority_type);
3152 extern void decl_fini_priority_insert (tree, priority_type);
3154 /* In a non-local VAR_DECL with static storage duration, true if the
3155 variable has an initialization priority. If false, the variable
3156 will be initialized at the DEFAULT_INIT_PRIORITY. */
3157 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3158 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3160 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3162 #define DECL_INIT_PRIORITY(NODE) \
3163 (decl_init_priority_lookup (NODE))
3164 /* Set the initialization priority for NODE to VAL. */
3165 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3166 (decl_init_priority_insert (NODE, VAL))
3168 /* For a FUNCTION_DECL the finalization priority of NODE. */
3169 #define DECL_FINI_PRIORITY(NODE) \
3170 (decl_fini_priority_lookup (NODE))
3171 /* Set the finalization priority for NODE to VAL. */
3172 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3173 (decl_fini_priority_insert (NODE, VAL))
3175 /* The initialization priority for entities for which no explicit
3176 initialization priority has been specified. */
3177 #define DEFAULT_INIT_PRIORITY 65535
3179 /* The maximum allowed initialization priority. */
3180 #define MAX_INIT_PRIORITY 65535
3182 /* The largest priority value reserved for use by system runtime
3184 #define MAX_RESERVED_INIT_PRIORITY 100
3186 /* In a VAR_DECL, the model to use if the data should be allocated from
3187 thread-local storage. */
3188 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3190 /* In a VAR_DECL, nonzero if the data should be allocated from
3191 thread-local storage. */
3192 #define DECL_THREAD_LOCAL_P(NODE) \
3193 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
3195 struct tree_var_decl GTY(())
3197 struct tree_decl_with_vis common;
3201 /* This field is used to reference anything in decl.result and is meant only
3202 for use by the garbage collector. */
3203 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3205 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3206 Before the struct containing the FUNCTION_DECL is laid out,
3207 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3208 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3209 function. When the class is laid out, this pointer is changed
3210 to an INTEGER_CST node which is suitable for use as an index
3211 into the virtual function table.
3212 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3213 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3215 struct tree_decl_non_common GTY(())
3218 struct tree_decl_with_vis common;
3219 /* C++ uses this in namespaces. */
3221 /* C++ uses this in templates. */
3223 /* Almost all FE's use this. */
3225 /* C++ uses this in namespaces. */
3229 /* In FUNCTION_DECL, holds the decl for the return value. */
3230 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3232 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3233 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3235 /* In a FUNCTION_DECL, the saved representation of the body of the
3237 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3239 /* Nonzero in a FUNCTION_DECL means this function should be treated
3240 as if it were a malloc, meaning it returns a pointer that is
3242 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3244 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3245 C++ operator new, meaning that it returns a pointer for which we
3246 should not use type based aliasing. */
3247 #define DECL_IS_OPERATOR_NEW(NODE) \
3248 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3250 /* Nonzero in a FUNCTION_DECL means this function may return more
3252 #define DECL_IS_RETURNS_TWICE(NODE) \
3253 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3255 /* Nonzero in a FUNCTION_DECL means this function should be treated
3256 as "pure" function (like const function, but may read global memory). */
3257 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3259 /* Nonzero in a FUNCTION_DECL means this function should be treated
3260 as "novops" function (function that does not read global memory,
3261 but may have arbitrary side effects). */
3262 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3264 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3265 at the beginning or end of execution. */
3266 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3267 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3269 #define DECL_STATIC_DESTRUCTOR(NODE) \
3270 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3272 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3273 be instrumented with calls to support routines. */
3274 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3275 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3277 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3278 disabled in this function. */
3279 #define DECL_NO_LIMIT_STACK(NODE) \
3280 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3282 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3283 static chain is not needed. */
3284 #define DECL_NO_STATIC_CHAIN(NODE) \
3285 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3287 /* Nonzero for a decl that cgraph has decided should be inlined into
3288 at least one call site. It is not meaningful to look at this
3289 directly; always use cgraph_function_possibly_inlined_p. */
3290 #define DECL_POSSIBLY_INLINED(DECL) \
3291 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3293 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3294 where it is called. */
3295 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3297 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3298 such as via the `inline' keyword in C/C++. This flag controls the linkage
3299 semantics of 'inline'; whether or not the function is inlined is
3300 controlled by DECL_INLINE. */
3301 #define DECL_DECLARED_INLINE_P(NODE) \
3302 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3304 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3305 disregarding size and cost heuristics. This is equivalent to using
3306 the always_inline attribute without the required diagnostics if the
3307 function cannot be inlined. */
3308 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3309 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3311 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3312 that describes the status of this function. */
3313 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3315 /* In a FUNCTION_DECL, nonzero means a built in function. */
3316 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3318 /* For a builtin function, identify which part of the compiler defined it. */
3319 #define DECL_BUILT_IN_CLASS(NODE) \
3320 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3322 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3323 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3325 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3326 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3328 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3329 arguments/result/saved_tree fields by front ends. It was either inherit
3330 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3331 which seemed a bit strange. */
3333 struct tree_function_decl GTY(())
3335 struct tree_decl_non_common common;
3339 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3340 DECL_FUNCTION_CODE. Otherwise unused.
3341 ??? The bitfield needs to be able to hold all target function
3343 ENUM_BITFIELD(built_in_function) function_code : 11;
3344 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3346 unsigned static_ctor_flag : 1;
3347 unsigned static_dtor_flag : 1;
3348 unsigned uninlinable : 1;
3350 unsigned possibly_inlined : 1;
3351 unsigned novops_flag : 1;
3352 unsigned returns_twice_flag : 1;
3353 unsigned malloc_flag : 1;
3354 unsigned operator_new_flag : 1;
3355 unsigned pure_flag : 1;
3356 unsigned declared_inline_flag : 1;
3357 unsigned regdecl_flag : 1;
3359 unsigned inline_flag : 1;
3360 unsigned no_instrument_function_entry_exit : 1;
3361 unsigned no_limit_stack : 1;
3362 unsigned disregard_inline_limits : 1;
3367 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3368 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3370 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3371 into stabs. Instead it will generate cross reference ('x') of names.
3372 This uses the same flag as DECL_EXTERNAL. */
3373 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3374 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3376 struct tree_type_decl GTY(())
3378 struct tree_decl_non_common common;
3382 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3383 To reduce overhead, the nodes containing the statements are not trees.
3384 This avoids the overhead of tree_common on all linked list elements.
3386 Use the interface in tree-iterator.h to access this node. */
3388 #define STATEMENT_LIST_HEAD(NODE) \
3389 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3390 #define STATEMENT_LIST_TAIL(NODE) \
3391 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3393 struct tree_statement_list_node
3394 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3396 struct tree_statement_list_node *prev;
3397 struct tree_statement_list_node *next;
3401 struct tree_statement_list
3404 struct tree_common common;
3405 struct tree_statement_list_node *head;
3406 struct tree_statement_list_node *tail;
3409 #define VALUE_HANDLE_ID(NODE) \
3410 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3412 #define VALUE_HANDLE_EXPR_SET(NODE) \
3413 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3415 /* Defined and used in tree-ssa-pre.c. */
3417 struct tree_value_handle GTY(())
3419 struct tree_common common;
3421 /* The set of expressions represented by this handle. */
3422 struct bitmap_set * GTY ((skip)) expr_set;
3424 /* Unique ID for this value handle. IDs are handed out in a
3425 conveniently dense form starting at 0, so that we can make
3426 bitmaps of value handles. */
3430 /* Define the overall contents of a tree node.
3431 It may be any of the structures declared above
3432 for various types of node. */
3434 union tree_node GTY ((ptr_alias (union lang_tree_node),
3435 desc ("tree_node_structure (&%h)")))
3437 struct tree_base GTY ((tag ("TS_BASE"))) base;
3438 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3439 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3440 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3441 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3442 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3443 struct tree_string GTY ((tag ("TS_STRING"))) string;
3444 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3445 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3446 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3447 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3448 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3449 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3450 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3451 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3452 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3453 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3454 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3455 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3456 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3457 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3458 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3459 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3460 struct tree_list GTY ((tag ("TS_LIST"))) list;
3461 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3462 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3463 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3464 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3465 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3466 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3467 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3468 struct gimple_stmt GTY ((tag ("TS_GIMPLE_STATEMENT"))) gstmt;
3469 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3470 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3471 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3472 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3473 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3474 struct tree_memory_partition_tag GTY ((tag ("TS_MEMORY_PARTITION_TAG"))) mpt;
3477 /* Standard named or nameless data types of the C compiler. */
3499 TI_INTEGER_MINUS_ONE,
3516 TI_COMPLEX_INTEGER_TYPE,
3517 TI_COMPLEX_FLOAT_TYPE,
3518 TI_COMPLEX_DOUBLE_TYPE,
3519 TI_COMPLEX_LONG_DOUBLE_TYPE,
3523 TI_LONG_DOUBLE_TYPE,
3527 TI_LONG_DOUBLE_PTR_TYPE,
3528 TI_INTEGER_PTR_TYPE,
3537 TI_VA_LIST_GPR_COUNTER_FIELD,
3538 TI_VA_LIST_FPR_COUNTER_FIELD,
3545 TI_DFLOAT32_PTR_TYPE,
3546 TI_DFLOAT64_PTR_TYPE,
3547 TI_DFLOAT128_PTR_TYPE,
3556 TI_SAT_LLFRACT_TYPE,
3557 TI_SAT_USFRACT_TYPE,
3559 TI_SAT_ULFRACT_TYPE,
3560 TI_SAT_ULLFRACT_TYPE,
3572 TI_SAT_LLACCUM_TYPE,
3573 TI_SAT_USACCUM_TYPE,
3575 TI_SAT_ULACCUM_TYPE,
3576 TI_SAT_ULLACCUM_TYPE,
3625 extern GTY(()) tree global_trees[TI_MAX];
3627 #define error_mark_node global_trees[TI_ERROR_MARK]
3629 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3630 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3631 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3632 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3633 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3635 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3636 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3637 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3638 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3639 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3641 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3642 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3644 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3645 #define integer_one_node global_trees[TI_INTEGER_ONE]
3646 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3647 #define size_zero_node global_trees[TI_SIZE_ZERO]
3648 #define size_one_node global_trees[TI_SIZE_ONE]
3649 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3650 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3651 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3653 /* Base access nodes. */
3654 #define access_public_node global_trees[TI_PUBLIC]
3655 #define access_protected_node global_trees[TI_PROTECTED]
3656 #define access_private_node global_trees[TI_PRIVATE]
3658 #define null_pointer_node global_trees[TI_NULL_POINTER]
3660 #define float_type_node global_trees[TI_FLOAT_TYPE]
3661 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3662 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3664 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3665 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3666 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3667 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3669 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3670 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3671 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3672 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3674 #define void_type_node global_trees[TI_VOID_TYPE]
3675 /* The C type `void *'. */
3676 #define ptr_type_node global_trees[TI_PTR_TYPE]
3677 /* The C type `const void *'. */
3678 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3679 /* The C type `size_t'. */
3680 #define size_type_node global_trees[TI_SIZE_TYPE]
3681 #define pid_type_node global_trees[TI_PID_TYPE]
3682 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3683 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3684 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3685 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3686 /* The C type `FILE *'. */
3687 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3689 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3690 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3691 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3693 /* The decimal floating point types. */
3694 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3695 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3696 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3697 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3698 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3699 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3701 /* The fixed-point types. */
3702 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3703 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3704 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3705 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3706 #define sat_unsigned_short_fract_type_node \
3707 global_trees[TI_SAT_USFRACT_TYPE]
3708 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3709 #define sat_unsigned_long_fract_type_node \
3710 global_trees[TI_SAT_ULFRACT_TYPE]
3711 #define sat_unsigned_long_long_fract_type_node \
3712 global_trees[TI_SAT_ULLFRACT_TYPE]
3713 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3714 #define fract_type_node global_trees[TI_FRACT_TYPE]
3715 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3716 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3717 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3718 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3719 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3720 #define unsigned_long_long_fract_type_node \
3721 global_trees[TI_ULLFRACT_TYPE]
3722 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3723 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3724 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3725 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3726 #define sat_unsigned_short_accum_type_node \
3727 global_trees[TI_SAT_USACCUM_TYPE]
3728 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3729 #define sat_unsigned_long_accum_type_node \
3730 global_trees[TI_SAT_ULACCUM_TYPE]
3731 #define sat_unsigned_long_long_accum_type_node \
3732 global_trees[TI_SAT_ULLACCUM_TYPE]
3733 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3734 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3735 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3736 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3737 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3738 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3739 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3740 #define unsigned_long_long_accum_type_node \
3741 global_trees[TI_ULLACCUM_TYPE]
3742 #define qq_type_node global_trees[TI_QQ_TYPE]
3743 #define hq_type_node global_trees[TI_HQ_TYPE]
3744 #define sq_type_node global_trees[TI_SQ_TYPE]
3745 #define dq_type_node global_trees[TI_DQ_TYPE]
3746 #define tq_type_node global_trees[TI_TQ_TYPE]
3747 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3748 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3749 #define usq_type_node global_trees[TI_USQ_TYPE]
3750 #define udq_type_node global_trees[TI_UDQ_TYPE]
3751 #define utq_type_node global_trees[TI_UTQ_TYPE]
3752 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3753 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3754 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3755 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3756 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3757 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3758 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3759 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3760 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3761 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3762 #define ha_type_node global_trees[TI_HA_TYPE]
3763 #define sa_type_node global_trees[TI_SA_TYPE]
3764 #define da_type_node global_trees[TI_DA_TYPE]
3765 #define ta_type_node global_trees[TI_TA_TYPE]
3766 #define uha_type_node global_trees[TI_UHA_TYPE]
3767 #define usa_type_node global_trees[TI_USA_TYPE]
3768 #define uda_type_node global_trees[TI_UDA_TYPE]
3769 #define uta_type_node global_trees[TI_UTA_TYPE]
3770 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3771 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3772 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3773 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3774 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3775 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3776 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3777 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3779 /* The node that should be placed at the end of a parameter list to
3780 indicate that the function does not take a variable number of
3781 arguments. The TREE_VALUE will be void_type_node and there will be
3782 no TREE_CHAIN. Language-independent code should not assume
3783 anything else about this node. */
3784 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3786 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3787 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3789 /* An enumeration of the standard C integer types. These must be
3790 ordered so that shorter types appear before longer ones, and so
3791 that signed types appear before unsigned ones, for the correct
3792 functioning of interpret_integer() in c-lex.c. */
3793 enum integer_type_kind
3805 itk_unsigned_long_long,
3809 typedef enum integer_type_kind integer_type_kind;
3811 /* The standard C integer types. Use integer_type_kind to index into
3813 extern GTY(()) tree integer_types[itk_none];
3815 #define char_type_node integer_types[itk_char]
3816 #define signed_char_type_node integer_types[itk_signed_char]
3817 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3818 #define short_integer_type_node integer_types[itk_short]
3819 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3820 #define integer_type_node integer_types[itk_int]
3821 #define unsigned_type_node integer_types[itk_unsigned_int]
3822 #define long_integer_type_node integer_types[itk_long]
3823 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3824 #define long_long_integer_type_node integer_types[itk_long_long]
3825 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3827 /* Set to the default thread-local storage (tls) model to use. */
3829 extern enum tls_model flag_tls_default;
3832 /* A pointer-to-function member type looks like:
3839 If __pfn is NULL, it is a NULL pointer-to-member-function.
3841 (Because the vtable is always the first thing in the object, we
3842 don't need its offset.) If the function is virtual, then PFN is
3843 one plus twice the index into the vtable; otherwise, it is just a
3844 pointer to the function.
3846 Unfortunately, using the lowest bit of PFN doesn't work in
3847 architectures that don't impose alignment requirements on function
3848 addresses, or that use the lowest bit to tell one ISA from another,
3849 for example. For such architectures, we use the lowest bit of
3850 DELTA instead of the lowest bit of the PFN, and DELTA will be
3853 enum ptrmemfunc_vbit_where_t
3855 ptrmemfunc_vbit_in_pfn,
3856 ptrmemfunc_vbit_in_delta
3859 #define NULL_TREE (tree) NULL
3861 extern tree decl_assembler_name (tree);
3862 extern bool decl_assembler_name_equal (tree decl, tree asmname);
3864 /* Compute the number of bytes occupied by 'node'. This routine only
3865 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3867 extern size_t tree_size (const_tree);
3869 /* Compute the number of bytes occupied by a tree with code CODE. This
3870 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3872 extern size_t tree_code_size (enum tree_code);
3874 /* Lowest level primitive for allocating a node.
3875 The TREE_CODE is the only argument. Contents are initialized
3876 to zero except for a few of the common fields. */
3878 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3879 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3881 /* Make a copy of a node, with all the same contents. */
3883 extern tree copy_node_stat (tree MEM_STAT_DECL);
3884 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3886 /* Make a copy of a chain of TREE_LIST nodes. */
3888 extern tree copy_list (tree);
3891 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3892 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3894 /* Make a TREE_VEC. */
3896 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3897 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3899 /* Tree nodes for SSA analysis. */
3901 extern void init_phinodes (void);
3902 extern void fini_phinodes (void);
3903 extern void release_phi_node (tree);
3904 #ifdef GATHER_STATISTICS
3905 extern void phinodes_print_statistics (void);
3908 extern void init_ssanames (void);
3909 extern void fini_ssanames (void);
3910 extern tree make_ssa_name (tree, tree);
3911 extern tree duplicate_ssa_name (tree, tree);
3912 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3913 extern void release_ssa_name (tree);
3914 extern void release_defs (tree);
3915 extern void replace_ssa_name_symbol (tree, tree);
3917 #ifdef GATHER_STATISTICS
3918 extern void ssanames_print_statistics (void);
3921 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3922 The name is supplied as a char *. */
3924 extern tree get_identifier (const char *);
3926 #if GCC_VERSION >= 3000
3927 #define get_identifier(str) \
3928 (__builtin_constant_p (str) \
3929 ? get_identifier_with_length ((str), strlen (str)) \
3930 : get_identifier (str))
3934 /* Identical to get_identifier, except that the length is assumed
3937 extern tree get_identifier_with_length (const char *, size_t);
3939 /* If an identifier with the name TEXT (a null-terminated string) has
3940 previously been referred to, return that node; otherwise return
3943 extern tree maybe_get_identifier (const char *);
3945 /* Construct various types of nodes. */
3947 extern tree build_nt (enum tree_code, ...);
3948 extern tree build_nt_call_list (tree, tree);
3950 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3951 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3952 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3953 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3954 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3955 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3956 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3957 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3958 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3959 tree MEM_STAT_DECL);
3960 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3961 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3962 tree MEM_STAT_DECL);
3963 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3964 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3965 tree, tree, tree MEM_STAT_DECL);
3966 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3967 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3969 extern tree build_gimple_modify_stmt_stat (tree, tree MEM_STAT_DECL);
3970 #define build_gimple_modify_stmt(t1,t2) \
3971 build_gimple_modify_stmt_stat (t1,t2 MEM_STAT_INFO)
3973 extern tree build_int_cst (tree, HOST_WIDE_INT);
3974 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3975 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3976 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3977 extern tree build_int_cst_wide_type (tree,
3978 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3979 extern tree build_vector (tree, tree);
3980 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3981 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3982 extern tree build_constructor_single (tree, tree, tree);
3983 extern tree build_constructor_from_list (tree, tree);
3984 extern tree build_real_from_int_cst (tree, const_tree);
3985 extern tree build_complex (tree, tree, tree);
3986 extern tree build_one_cst (tree);
3987 extern tree build_string (int, const char *);
3988 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3989 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3990 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3991 extern tree build_fn_decl (const char *, tree);
3992 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3993 extern tree build_block (tree, tree, tree, tree);
3994 extern tree build_empty_stmt (void);
3995 extern tree build_omp_clause (enum omp_clause_code);
3997 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3998 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4000 extern tree build_call_list (tree, tree, tree);
4001 extern tree build_call_nary (tree, tree, int, ...);
4002 extern tree build_call_valist (tree, tree, int, va_list);
4003 extern tree build_call_array (tree, tree, int, tree*);
4005 /* Construct various nodes representing data types. */
4007 extern tree make_signed_type (int);
4008 extern tree make_unsigned_type (int);
4009 extern tree signed_or_unsigned_type_for (int, tree);
4010 extern tree signed_type_for (tree);
4011 extern tree unsigned_type_for (tree);
4012 extern void initialize_sizetypes (bool);
4013 extern void set_sizetype (tree);
4014 extern void fixup_unsigned_type (tree);
4015 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
4016 extern tree build_pointer_type (tree);
4017 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
4018 extern tree build_reference_type (tree);
4019 extern tree build_vector_type_for_mode (tree, enum machine_mode);
4020 extern tree build_vector_type (tree innertype, int nunits);
4021 extern tree build_type_no_quals (tree);
4022 extern tree build_index_type (tree);
4023 extern tree build_index_2_type (tree, tree);
4024 extern tree build_array_type (tree, tree);
4025 extern tree build_function_type (tree, tree);
4026 extern tree build_function_type_list (tree, ...);
4027 extern tree build_method_type_directly (tree, tree, tree);
4028 extern tree build_method_type (tree, tree);
4029 extern tree build_offset_type (tree, tree);
4030 extern tree build_complex_type (tree);
4031 extern tree build_resx (int);
4032 extern tree array_type_nelts (const_tree);
4033 extern bool in_array_bounds_p (tree);
4034 extern bool range_in_array_bounds_p (tree);
4036 extern tree value_member (tree, tree);
4037 extern tree purpose_member (const_tree, tree);
4039 extern int attribute_list_equal (const_tree, const_tree);
4040 extern int attribute_list_contained (const_tree, const_tree);
4041 extern int tree_int_cst_equal (const_tree, const_tree);
4042 extern int tree_int_cst_lt (const_tree, const_tree);
4043 extern int tree_int_cst_compare (const_tree, const_tree);
4044 extern int host_integerp (const_tree, int);
4045 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
4046 extern int tree_int_cst_msb (const_tree);
4047 extern int tree_int_cst_sgn (const_tree);
4048 extern int tree_int_cst_sign_bit (const_tree);
4049 extern bool tree_expr_nonnegative_p (tree);
4050 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
4051 extern bool may_negate_without_overflow_p (const_tree);
4052 extern tree get_inner_array_type (const_tree);
4054 /* Construct various nodes representing fract or accum data types. */
4056 extern tree make_fract_type (int, int, int);
4057 extern tree make_accum_type (int, int, int);
4059 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4060 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4061 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4062 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4063 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4064 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4065 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4066 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4068 #define make_or_reuse_signed_fract_type(P) \
4069 make_or_reuse_fract_type (P, 0, 0)
4070 #define make_or_reuse_unsigned_fract_type(P) \
4071 make_or_reuse_fract_type (P, 1, 0)
4072 #define make_or_reuse_sat_signed_fract_type(P) \
4073 make_or_reuse_fract_type (P, 0, 1)
4074 #define make_or_reuse_sat_unsigned_fract_type(P) \
4075 make_or_reuse_fract_type (P, 1, 1)
4076 #define make_or_reuse_signed_accum_type(P) \
4077 make_or_reuse_accum_type (P, 0, 0)
4078 #define make_or_reuse_unsigned_accum_type(P) \
4079 make_or_reuse_accum_type (P, 1, 0)
4080 #define make_or_reuse_sat_signed_accum_type(P) \
4081 make_or_reuse_accum_type (P, 0, 1)
4082 #define make_or_reuse_sat_unsigned_accum_type(P) \
4083 make_or_reuse_accum_type (P, 1, 1)
4085 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4086 put the prototype here. Rtl.h does declare the prototype if
4087 tree.h had been included. */
4089 extern tree make_tree (tree, rtx);
4091 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4094 Such modified types already made are recorded so that duplicates
4097 extern tree build_type_attribute_variant (tree, tree);
4098 extern tree build_decl_attribute_variant (tree, tree);
4100 /* Structure describing an attribute and a function to handle it. */
4101 struct attribute_spec
4103 /* The name of the attribute (without any leading or trailing __),
4104 or NULL to mark the end of a table of attributes. */
4105 const char *const name;
4106 /* The minimum length of the list of arguments of the attribute. */
4107 const int min_length;
4108 /* The maximum length of the list of arguments of the attribute
4109 (-1 for no maximum). */
4110 const int max_length;
4111 /* Whether this attribute requires a DECL. If it does, it will be passed
4112 from types of DECLs, function return types and array element types to
4113 the DECLs, function types and array types respectively; but when
4114 applied to a type in any other circumstances, it will be ignored with
4115 a warning. (If greater control is desired for a given attribute,
4116 this should be false, and the flags argument to the handler may be
4117 used to gain greater control in that case.) */
4118 const bool decl_required;
4119 /* Whether this attribute requires a type. If it does, it will be passed
4120 from a DECL to the type of that DECL. */
4121 const bool type_required;
4122 /* Whether this attribute requires a function (or method) type. If it does,
4123 it will be passed from a function pointer type to the target type,
4124 and from a function return type (which is not itself a function
4125 pointer type) to the function type. */
4126 const bool function_type_required;
4127 /* Function to handle this attribute. NODE points to the node to which
4128 the attribute is to be applied. If a DECL, it should be modified in
4129 place; if a TYPE, a copy should be created. NAME is the name of the
4130 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4131 of the arguments (which may be NULL). FLAGS gives further information
4132 about the context of the attribute. Afterwards, the attributes will
4133 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4134 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4135 as well as in any other cases when the attributes should not be added
4136 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4137 applied to another type or DECL later may be returned;
4138 otherwise the return value should be NULL_TREE. This pointer may be
4139 NULL if no special handling is required beyond the checks implied
4140 by the rest of this structure. */
4141 tree (*const handler) (tree *node, tree name, tree args,
4142 int flags, bool *no_add_attrs);
4145 /* Flags that may be passed in the third argument of decl_attributes, and
4146 to handler functions for attributes. */
4147 enum attribute_flags
4149 /* The type passed in is the type of a DECL, and any attributes that
4150 should be passed in again to be applied to the DECL rather than the
4151 type should be returned. */
4152 ATTR_FLAG_DECL_NEXT = 1,
4153 /* The type passed in is a function return type, and any attributes that
4154 should be passed in again to be applied to the function type rather
4155 than the return type should be returned. */
4156 ATTR_FLAG_FUNCTION_NEXT = 2,
4157 /* The type passed in is an array element type, and any attributes that
4158 should be passed in again to be applied to the array type rather
4159 than the element type should be returned. */
4160 ATTR_FLAG_ARRAY_NEXT = 4,
4161 /* The type passed in is a structure, union or enumeration type being
4162 created, and should be modified in place. */
4163 ATTR_FLAG_TYPE_IN_PLACE = 8,
4164 /* The attributes are being applied by default to a library function whose
4165 name indicates known behavior, and should be silently ignored if they
4166 are not in fact compatible with the function type. */
4167 ATTR_FLAG_BUILT_IN = 16
4170 /* Default versions of target-overridable functions. */
4172 extern tree merge_decl_attributes (tree, tree);
4173 extern tree merge_type_attributes (tree, tree);
4175 /* Given a tree node and a string, return nonzero if the tree node is
4176 a valid attribute name for the string. */
4178 extern int is_attribute_p (const char *, const_tree);
4180 /* Given an attribute name and a list of attributes, return the list element
4181 of the attribute or NULL_TREE if not found. */
4183 extern tree lookup_attribute (const char *, tree);
4185 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4188 extern tree remove_attribute (const char *, tree);
4190 /* Given two attributes lists, return a list of their union. */
4192 extern tree merge_attributes (tree, tree);
4194 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4195 /* Given two Windows decl attributes lists, possibly including
4196 dllimport, return a list of their union . */
4197 extern tree merge_dllimport_decl_attributes (tree, tree);
4199 /* Handle a "dllimport" or "dllexport" attribute. */
4200 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4203 /* Check whether CAND is suitable to be returned from get_qualified_type
4204 (BASE, TYPE_QUALS). */
4206 extern bool check_qualified_type (const_tree, const_tree, int);
4208 /* Return a version of the TYPE, qualified as indicated by the
4209 TYPE_QUALS, if one exists. If no qualified version exists yet,
4210 return NULL_TREE. */
4212 extern tree get_qualified_type (tree, int);
4214 /* Like get_qualified_type, but creates the type if it does not
4215 exist. This function never returns NULL_TREE. */
4217 extern tree build_qualified_type (tree, int);
4219 /* Like build_qualified_type, but only deals with the `const' and
4220 `volatile' qualifiers. This interface is retained for backwards
4221 compatibility with the various front-ends; new code should use
4222 build_qualified_type instead. */
4224 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4225 build_qualified_type ((TYPE), \
4226 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4227 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4229 /* Make a copy of a type node. */
4231 extern tree build_distinct_type_copy (tree);
4232 extern tree build_variant_type_copy (tree);
4234 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4235 fields. Optionally specify an alignment, and then lay it out. */
4237 extern void finish_builtin_struct (tree, const char *,
4240 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4241 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4242 node, does nothing except for the first time. */
4244 extern void layout_type (tree);
4246 /* These functions allow a front-end to perform a manual layout of a
4247 RECORD_TYPE. (For instance, if the placement of subsequent fields
4248 depends on the placement of fields so far.) Begin by calling
4249 start_record_layout. Then, call place_field for each of the
4250 fields. Then, call finish_record_layout. See layout_type for the
4251 default way in which these functions are used. */
4253 typedef struct record_layout_info_s
4255 /* The RECORD_TYPE that we are laying out. */
4257 /* The offset into the record so far, in bytes, not including bits in
4260 /* The last known alignment of SIZE. */
4261 unsigned int offset_align;
4262 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4264 /* The alignment of the record so far, in bits. */
4265 unsigned int record_align;
4266 /* The alignment of the record so far, ignoring #pragma pack and
4267 __attribute__ ((packed)), in bits. */
4268 unsigned int unpacked_align;
4269 /* The previous field layed out. */
4271 /* The static variables (i.e., class variables, as opposed to
4272 instance variables) encountered in T. */
4273 tree pending_statics;
4274 /* Bits remaining in the current alignment group */
4275 int remaining_in_alignment;
4276 /* True if we've seen a packed field that didn't have normal
4277 alignment anyway. */
4278 int packed_maybe_necessary;
4279 } *record_layout_info;
4281 extern record_layout_info start_record_layout (tree);
4282 extern tree bit_from_pos (tree, tree);
4283 extern tree byte_from_pos (tree, tree);
4284 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4285 extern void normalize_offset (tree *, tree *, unsigned int);
4286 extern tree rli_size_unit_so_far (record_layout_info);
4287 extern tree rli_size_so_far (record_layout_info);
4288 extern void normalize_rli (record_layout_info);
4289 extern void place_field (record_layout_info, tree);
4290 extern void compute_record_mode (tree);
4291 extern void finish_record_layout (record_layout_info, int);
4293 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4294 return a canonicalized ..._TYPE node, so that duplicates are not made.
4295 How the hash code is computed is up to the caller, as long as any two
4296 callers that could hash identical-looking type nodes agree. */
4298 extern tree type_hash_canon (unsigned int, tree);
4300 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4301 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4302 fields. Call this only once for any given decl node.
4304 Second argument is the boundary that this field can be assumed to
4305 be starting at (in bits). Zero means it can be assumed aligned
4306 on any boundary that may be needed. */
4308 extern void layout_decl (tree, unsigned);
4310 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4311 a previous call to layout_decl and calls it again. */
4313 extern void relayout_decl (tree);
4315 /* Return the mode for data of a given size SIZE and mode class CLASS.
4316 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4317 The value is BLKmode if no other mode is found. This is like
4318 mode_for_size, but is passed a tree. */
4320 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4322 /* Return an expr equal to X but certainly not valid as an lvalue. */
4324 extern tree non_lvalue (tree);
4326 extern tree convert (tree, tree);
4327 extern unsigned int expr_align (const_tree);
4328 extern tree expr_first (tree);
4329 extern tree expr_last (tree);
4330 extern tree expr_only (tree);
4331 extern tree size_in_bytes (const_tree);
4332 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4333 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4334 extern tree bit_position (const_tree);
4335 extern HOST_WIDE_INT int_bit_position (const_tree);
4336 extern tree byte_position (const_tree);
4337 extern HOST_WIDE_INT int_byte_position (const_tree);
4339 /* Define data structures, macros, and functions for handling sizes
4340 and the various types used to represent sizes. */
4344 SIZETYPE, /* Normal representation of sizes in bytes. */
4345 SSIZETYPE, /* Signed representation of sizes in bytes. */
4346 BITSIZETYPE, /* Normal representation of sizes in bits. */
4347 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4350 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4352 #define sizetype sizetype_tab[(int) SIZETYPE]
4353 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4354 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4355 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4357 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4358 extern tree size_binop (enum tree_code, tree, tree);
4359 extern tree size_diffop (tree, tree);
4361 #define size_int(L) size_int_kind (L, SIZETYPE)
4362 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4363 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4364 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4366 extern tree round_up (tree, int);
4367 extern tree round_down (tree, int);
4368 extern tree get_pending_sizes (void);
4369 extern void put_pending_size (tree);
4370 extern void put_pending_sizes (tree);
4372 /* Type for sizes of data-type. */
4374 #define BITS_PER_UNIT_LOG \
4375 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4376 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4377 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4379 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4380 extern unsigned int maximum_field_alignment;
4381 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4382 extern unsigned int initial_max_fld_align;
4384 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4385 by making the last node in X point to Y.
4386 Returns X, except if X is 0 returns Y. */
4388 extern tree chainon (tree, tree);
4390 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4392 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4393 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4395 /* Return the last tree node in a chain. */
4397 extern tree tree_last (tree);
4399 /* Reverse the order of elements in a chain, and return the new head. */
4401 extern tree nreverse (tree);
4403 /* Returns the length of a chain of nodes
4404 (number of chain pointers to follow before reaching a null pointer). */
4406 extern int list_length (const_tree);
4408 /* Returns the number of FIELD_DECLs in a type. */
4410 extern int fields_length (const_tree);
4412 /* Given an initializer INIT, return TRUE if INIT is zero or some
4413 aggregate of zeros. Otherwise return FALSE. */
4415 extern bool initializer_zerop (const_tree);
4417 /* Examine CTOR to discover:
4418 * how many scalar fields are set to nonzero values,
4419 and place it in *P_NZ_ELTS;
4420 * how many scalar fields in total are in CTOR,
4421 and place it in *P_ELT_COUNT.
4422 * if a type is a union, and the initializer from the constructor
4423 is not the largest element in the union, then set *p_must_clear.
4425 Return whether or not CTOR is a valid static constant initializer, the same
4426 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4428 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4431 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4433 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4435 extern int integer_zerop (const_tree);
4437 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4439 extern int integer_onep (const_tree);
4441 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4442 all of whose significant bits are 1. */
4444 extern int integer_all_onesp (const_tree);
4446 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4447 exactly one bit 1. */
4449 extern int integer_pow2p (const_tree);
4451 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4452 with a nonzero value. */
4454 extern int integer_nonzerop (const_tree);
4456 extern bool cst_and_fits_in_hwi (const_tree);
4457 extern tree num_ending_zeros (const_tree);
4459 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4462 extern int fixed_zerop (const_tree);
4464 /* staticp (tree x) is nonzero if X is a reference to data allocated
4465 at a fixed address in memory. Returns the outermost data. */
4467 extern tree staticp (tree);
4469 /* save_expr (EXP) returns an expression equivalent to EXP
4470 but it can be used multiple times within context CTX
4471 and only evaluate EXP once. */
4473 extern tree save_expr (tree);
4475 /* Look inside EXPR and into any simple arithmetic operations. Return
4476 the innermost non-arithmetic node. */
4478 extern tree skip_simple_arithmetic (tree);
4480 /* Return which tree structure is used by T. */
4482 enum tree_node_structure_enum tree_node_structure (const_tree);
4484 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4485 or offset that depends on a field within a record.
4487 Note that we only allow such expressions within simple arithmetic
4490 extern bool contains_placeholder_p (const_tree);
4492 /* This macro calls the above function but short-circuits the common
4493 case of a constant to save time. Also check for null. */
4495 #define CONTAINS_PLACEHOLDER_P(EXP) \
4496 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4498 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4499 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4502 extern bool type_contains_placeholder_p (tree);
4504 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4505 return a tree with all occurrences of references to F in a
4506 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4507 contains only arithmetic expressions. */
4509 extern tree substitute_in_expr (tree, tree, tree);
4511 /* This macro calls the above function but short-circuits the common
4512 case of a constant to save time and also checks for NULL. */
4514 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4515 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4517 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4518 for it within OBJ, a tree that is an object or a chain of references. */
4520 extern tree substitute_placeholder_in_expr (tree, tree);
4522 /* This macro calls the above function but short-circuits the common
4523 case of a constant to save time and also checks for NULL. */
4525 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4526 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4527 : substitute_placeholder_in_expr (EXP, OBJ))
4529 /* variable_size (EXP) is like save_expr (EXP) except that it
4530 is for the special case of something that is part of a
4531 variable size for a data type. It makes special arrangements
4532 to compute the value at the right time when the data type
4533 belongs to a function parameter. */
4535 extern tree variable_size (tree);
4537 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4538 but it can be used multiple times
4539 and only evaluate the subexpressions once. */
4541 extern tree stabilize_reference (tree);
4543 /* Subroutine of stabilize_reference; this is called for subtrees of
4544 references. Any expression with side-effects must be put in a SAVE_EXPR
4545 to ensure that it is only evaluated once. */
4547 extern tree stabilize_reference_1 (tree);
4549 /* Return EXP, stripped of any conversions to wider types
4550 in such a way that the result of converting to type FOR_TYPE
4551 is the same as if EXP were converted to FOR_TYPE.
4552 If FOR_TYPE is 0, it signifies EXP's type. */
4554 extern tree get_unwidened (tree, tree);
4556 /* Return OP or a simpler expression for a narrower value
4557 which can be sign-extended or zero-extended to give back OP.
4558 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4559 or 0 if the value should be sign-extended. */
4561 extern tree get_narrower (tree, int *);
4563 /* Return true if T is an expression that get_inner_reference handles. */
4565 extern int handled_component_p (const_tree);
4567 /* Given an expression EXP that is a handled_component_p,
4568 look for the ultimate containing object, which is returned and specify
4569 the access position and size. */
4571 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4572 tree *, enum machine_mode *, int *, int *,
4575 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4576 look for whether EXP or any nested component-refs within EXP is marked
4579 extern bool contains_packed_reference (const_tree exp);
4581 /* Return a tree of sizetype representing the size, in bytes, of the element
4582 of EXP, an ARRAY_REF. */
4584 extern tree array_ref_element_size (tree);
4586 /* Return a tree representing the lower bound of the array mentioned in
4587 EXP, an ARRAY_REF. */
4589 extern tree array_ref_low_bound (tree);
4591 /* Return a tree representing the upper bound of the array mentioned in
4592 EXP, an ARRAY_REF. */
4594 extern tree array_ref_up_bound (tree);
4596 /* Return a tree representing the offset, in bytes, of the field referenced
4597 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4599 extern tree component_ref_field_offset (tree);
4601 /* Given a DECL or TYPE, return the scope in which it was declared, or
4602 NUL_TREE if there is no containing scope. */
4604 extern tree get_containing_scope (const_tree);
4606 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4608 extern tree decl_function_context (const_tree);
4610 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4611 this _DECL with its context, or zero if none. */
4612 extern tree decl_type_context (const_tree);
4614 /* Return 1 if EXPR is the real constant zero. */
4615 extern int real_zerop (const_tree);
4617 /* Declare commonly used variables for tree structure. */
4619 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4620 Zero means allow extended lvalues. */
4622 extern int pedantic_lvalues;
4624 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4626 extern GTY(()) tree current_function_decl;
4628 /* Nonzero means a FUNC_BEGIN label was emitted. */
4629 extern GTY(()) const char * current_function_func_begin_label;
4631 /* Iterator for going through the function arguments. */
4633 tree fntype; /* function type declaration */
4634 tree next; /* TREE_LIST pointing to the next argument */
4635 } function_args_iterator;
4637 /* Initialize the iterator I with arguments from function FNDECL */
4640 function_args_iter_init (function_args_iterator *i, tree fntype)
4643 i->next = TYPE_ARG_TYPES (fntype);
4646 /* Return a pointer that holds the next argument if there are more arguments to
4647 handle, otherwise return NULL. */
4649 static inline tree *
4650 function_args_iter_cond_ptr (function_args_iterator *i)
4652 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4655 /* Return the next argument if there are more arguments to handle, otherwise
4659 function_args_iter_cond (function_args_iterator *i)
4661 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4664 /* Advance to the next argument. */
4666 function_args_iter_next (function_args_iterator *i)
4668 gcc_assert (i->next != NULL_TREE);
4669 i->next = TREE_CHAIN (i->next);
4672 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4673 to point to the next tree element. ITER is an instance of
4674 function_args_iterator used to iterate the arguments. */
4675 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4676 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4677 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4678 function_args_iter_next (&(ITER)))
4680 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4681 to the next tree element. ITER is an instance of function_args_iterator
4682 used to iterate the arguments. */
4683 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4684 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4685 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4686 function_args_iter_next (&(ITER)))
4691 extern unsigned crc32_string (unsigned, const char *);
4692 extern void clean_symbol_name (char *);
4693 extern tree get_file_function_name (const char *);
4694 extern tree get_callee_fndecl (const_tree);
4695 extern void change_decl_assembler_name (tree, tree);
4696 extern int type_num_arguments (const_tree);
4697 extern bool associative_tree_code (enum tree_code);
4698 extern bool commutative_tree_code (enum tree_code);
4699 extern tree upper_bound_in_type (tree, tree);
4700 extern tree lower_bound_in_type (tree, tree);
4701 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4702 extern bool empty_body_p (tree);
4703 extern tree call_expr_arg (tree, int);
4704 extern tree *call_expr_argp (tree, int);
4705 extern tree call_expr_arglist (tree);
4706 extern bool stdarg_p (tree);
4707 extern bool prototype_p (tree);
4708 extern int function_args_count (tree);
4709 extern bool auto_var_in_fn_p (const_tree, const_tree);
4713 extern void expand_expr_stmt (tree);
4714 extern int warn_if_unused_value (const_tree, location_t);
4715 extern void expand_label (tree);
4716 extern void expand_goto (tree);
4718 extern rtx expand_stack_save (void);
4719 extern void expand_stack_restore (tree);
4720 extern void expand_return (tree);
4721 extern int is_body_block (const_tree);
4724 extern void using_eh_for_cleanups (void);
4726 /* In fold-const.c */
4728 /* Non-zero if we are folding constants inside an initializer; zero
4730 extern int folding_initializer;
4732 /* Convert between trees and native memory representation. */
4733 extern int native_encode_expr (const_tree, unsigned char *, int);
4734 extern tree native_interpret_expr (tree, const unsigned char *, int);
4736 /* Fold constants as much as possible in an expression.
4737 Returns the simplified expression.
4738 Acts only on the top level of the expression;
4739 if the argument itself cannot be simplified, its
4740 subexpressions are not changed. */
4742 extern tree fold (tree);
4743 extern tree fold_unary (enum tree_code, tree, tree);
4744 extern tree fold_binary (enum tree_code, tree, tree, tree);
4745 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4746 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4747 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4748 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4749 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4750 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4751 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4752 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4753 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4754 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4755 extern tree fold_build_call_array (tree, tree, int, tree *);
4756 extern tree fold_build_call_array_initializer (tree, tree, int, tree *);
4757 extern bool fold_convertible_p (const_tree, const_tree);
4758 extern tree fold_convert (tree, tree);
4759 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4760 extern tree fold_ignored_result (tree);
4761 extern tree fold_abs_const (tree, tree);
4762 extern tree fold_indirect_ref_1 (tree, tree);
4763 extern void fold_defer_overflow_warnings (void);
4764 extern void fold_undefer_overflow_warnings (bool, const_tree, int);
4765 extern void fold_undefer_and_ignore_overflow_warnings (void);
4766 extern bool fold_deferring_overflow_warnings_p (void);
4767 extern tree maybe_fold_offset_to_reference (tree, tree, tree);
4769 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4772 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4773 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, const_tree);
4774 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4775 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4776 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4778 #define add_double(l1,h1,l2,h2,lv,hv) \
4779 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4780 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4781 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4782 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4783 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4784 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4786 #define mul_double(l1,h1,l2,h2,lv,hv) \
4787 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4788 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4789 HOST_WIDE_INT, unsigned int,
4790 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4791 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4792 HOST_WIDE_INT, unsigned int,
4793 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4794 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4795 HOST_WIDE_INT, unsigned int,
4796 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4797 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4798 HOST_WIDE_INT, unsigned int,
4799 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4801 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4802 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4803 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4804 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4807 enum operand_equal_flag
4813 extern int operand_equal_p (const_tree, const_tree, unsigned int);
4814 extern int multiple_of_p (tree, const_tree, const_tree);
4815 extern tree omit_one_operand (tree, tree, tree);
4816 extern tree omit_two_operands (tree, tree, tree, tree);
4817 extern tree invert_truthvalue (tree);
4818 extern tree fold_truth_not_expr (tree);
4819 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4820 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4821 extern tree fold_read_from_constant_string (tree);
4822 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
4823 extern tree build_fold_addr_expr (tree);
4824 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4825 extern tree fold_strip_sign_ops (tree);
4826 extern tree build_fold_addr_expr_with_type (tree, tree);
4827 extern tree build_fold_indirect_ref (tree);
4828 extern tree fold_indirect_ref (tree);
4829 extern tree constant_boolean_node (int, tree);
4830 extern tree build_low_bits_mask (tree, unsigned);
4832 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
4833 extern void swap_tree_operands (tree, tree *, tree *);
4834 extern enum tree_code swap_tree_comparison (enum tree_code);
4836 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4837 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4839 extern bool tree_expr_nonzero_p (tree);
4840 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
4841 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
4843 extern bool tree_single_nonzero_warnv_p (tree, bool *);
4844 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4845 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
4846 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
4848 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4849 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4850 extern bool tree_call_nonnegative_warnv_p (enum tree_code code, tree, tree,
4851 tree, tree, bool *);
4853 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4855 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
4858 extern tree fold_call_expr (tree, bool);
4859 extern tree fold_builtin_fputs (tree, tree, bool, bool, tree);
4860 extern tree fold_builtin_strcpy (tree, tree, tree, tree);
4861 extern tree fold_builtin_strncpy (tree, tree, tree, tree, tree);
4862 extern tree fold_builtin_memory_chk (tree, tree, tree, tree, tree, tree, bool,
4863 enum built_in_function);
4864 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, tree, tree, bool,
4865 enum built_in_function);
4866 extern tree fold_builtin_strncpy_chk (tree, tree, tree, tree, tree);
4867 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4868 extern bool fold_builtin_next_arg (tree, bool);
4869 extern enum built_in_function builtin_mathfn_code (const_tree);
4870 extern tree build_function_call_expr (tree, tree);
4871 extern tree fold_builtin_call_array (tree, tree, int, tree *);
4872 extern void debug_fold_checksum (const_tree);
4873 extern tree build_call_expr (tree, int, ...);
4874 extern tree mathfn_built_in (tree, enum built_in_function fn);
4875 extern tree strip_float_extensions (tree);
4876 extern tree c_strlen (tree, int);
4877 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4878 extern tree build_va_arg_indirect_ref (tree);
4879 extern tree build_string_literal (int, const char *);
4880 extern bool validate_arglist (const_tree, ...);
4881 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4882 extern int get_pointer_alignment (tree, unsigned int);
4885 extern tree strip_float_extensions (tree);
4888 extern int really_constant_p (const_tree);
4889 extern int int_fits_type_p (const_tree, const_tree);
4890 #ifndef GENERATOR_FILE
4891 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4893 extern bool variably_modified_type_p (tree, tree);
4894 extern int tree_log2 (const_tree);
4895 extern int tree_floor_log2 (const_tree);
4896 extern int simple_cst_equal (const_tree, const_tree);
4897 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
4898 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4899 extern int type_list_equal (const_tree, const_tree);
4900 extern int chain_member (const_tree, const_tree);
4901 extern tree type_hash_lookup (unsigned int, tree);
4902 extern void type_hash_add (unsigned int, tree);
4903 extern int simple_cst_list_equal (const_tree, const_tree);
4904 extern void dump_tree_statistics (void);
4905 extern void expand_function_end (void);
4906 extern void expand_function_start (tree);
4907 extern void stack_protect_prologue (void);
4908 extern void stack_protect_epilogue (void);
4909 extern void recompute_tree_invariant_for_addr_expr (tree);
4910 extern bool needs_to_live_in_memory (const_tree);
4911 extern tree reconstruct_complex_type (tree, tree);
4913 extern int real_onep (const_tree);
4914 extern int real_twop (const_tree);
4915 extern int real_minus_onep (const_tree);
4916 extern void init_ttree (void);
4917 extern void build_common_tree_nodes (bool, bool);
4918 extern void build_common_tree_nodes_2 (int);
4919 extern void build_common_builtin_nodes (void);
4920 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4921 extern tree build_range_type (tree, tree, tree);
4922 extern HOST_WIDE_INT int_cst_value (const_tree);
4923 extern tree build_addr (tree, tree);
4925 extern bool fields_compatible_p (const_tree, const_tree);
4926 extern tree find_compatible_field (tree, tree);
4928 extern location_t expr_location (const_tree);
4929 extern void set_expr_location (tree, location_t);
4930 extern bool expr_has_location (const_tree);
4932 extern location_t *expr_locus (const_tree);
4933 extern void set_expr_locus (tree, source_location *);
4934 extern const char *expr_filename (const_tree);
4935 extern int expr_lineno (const_tree);
4937 extern tree *tree_block (tree);
4938 extern tree *generic_tree_operand (tree, int);
4939 extern tree *generic_tree_type (tree);
4940 extern location_t *block_nonartificial_location (tree);
4943 extern void expand_main_function (void);
4944 extern void init_dummy_function_start (void);
4945 extern void expand_dummy_function_end (void);
4946 extern unsigned int init_function_for_compilation (void);
4947 extern void allocate_struct_function (tree, bool);
4948 extern void push_struct_function (tree fndecl);
4949 extern void init_function_start (tree);
4950 extern bool use_register_for_decl (const_tree);
4951 extern void generate_setjmp_warnings (void);
4952 extern void init_temp_slots (void);
4953 extern void free_temp_slots (void);
4954 extern void pop_temp_slots (void);
4955 extern void push_temp_slots (void);
4956 extern void preserve_temp_slots (rtx);
4957 extern int aggregate_value_p (const_tree, const_tree);
4958 extern void push_function_context (void);
4959 extern void pop_function_context (void);
4960 extern tree gimplify_parameters (void);
4962 /* In print-rtl.c */
4964 extern void print_rtl (FILE *, const_rtx);
4967 /* In print-tree.c */
4968 extern void debug_tree (tree);
4970 extern void dump_addr (FILE*, const char *, const void *);
4971 extern void print_node (FILE *, const char *, tree, int);
4972 extern void print_node_brief (FILE *, const char *, const_tree, int);
4973 extern void indent_to (FILE *, int);
4976 /* In tree-inline.c: */
4977 extern bool debug_find_tree (tree, tree);
4978 /* This is in tree-inline.c since the routine uses
4979 data structures from the inliner. */
4980 extern tree unsave_expr_now (tree);
4981 extern tree build_duplicate_type (tree);
4985 /* Nonzero if this is a call to a function whose return value depends
4986 solely on its arguments, has no side effects, and does not read
4989 /* Nonzero if this call will never return. */
4990 #define ECF_NORETURN 2
4991 /* Nonzero if this is a call to malloc or a related function. */
4992 #define ECF_MALLOC 4
4993 /* Nonzero if it is plausible that this is a call to alloca. */
4994 #define ECF_MAY_BE_ALLOCA 8
4995 /* Nonzero if this is a call to a function that won't throw an exception. */
4996 #define ECF_NOTHROW 16
4997 /* Nonzero if this is a call to setjmp or a related function. */
4998 #define ECF_RETURNS_TWICE 32
4999 /* Nonzero if this call replaces the current stack frame. */
5000 #define ECF_SIBCALL 64
5001 /* Nonzero if this is a call to "pure" function (like const function,
5002 but may read memory. */
5003 #define ECF_PURE 128
5004 /* Create libcall block around the call. */
5005 #define ECF_LIBCALL_BLOCK 256
5006 /* Function does not read or write memory (but may have side effects, so
5007 it does not necessarily fit ECF_CONST). */
5008 #define ECF_NOVOPS 512
5010 extern int flags_from_decl_or_type (const_tree);
5011 extern int call_expr_flags (const_tree);
5013 extern int setjmp_call_p (const_tree);
5014 extern bool alloca_call_p (const_tree);
5015 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
5016 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
5020 extern const struct attribute_spec *lookup_attribute_spec (tree);
5022 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5023 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5024 it should be modified in place; if a TYPE, a copy should be created
5025 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5026 information, in the form of a bitwise OR of flags in enum attribute_flags
5027 from tree.h. Depending on these flags, some attributes may be
5028 returned to be applied at a later stage (for example, to apply
5029 a decl attribute to the declaration rather than to its type). */
5030 extern tree decl_attributes (tree *, tree, int);
5032 /* In integrate.c */
5033 extern void set_decl_abstract_flags (tree, int);
5034 extern void set_decl_origin_self (tree);
5036 /* In stor-layout.c */
5037 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
5038 extern void fixup_signed_type (tree);
5039 extern void internal_reference_types (void);
5040 extern unsigned int update_alignment_for_field (record_layout_info, tree,
5043 extern void make_decl_rtl (tree);
5044 extern void make_decl_one_only (tree);
5045 extern int supports_one_only (void);
5046 extern void resolve_unique_section (tree, int, int);
5047 extern void mark_referenced (tree);
5048 extern void mark_decl_referenced (tree);
5049 extern void notice_global_symbol (tree);
5050 extern void set_user_assembler_name (tree, const char *);
5051 extern void process_pending_assemble_externals (void);
5052 extern void finish_aliases_1 (void);
5053 extern void finish_aliases_2 (void);
5054 extern tree emutls_decl (tree);
5057 extern void expand_computed_goto (tree);
5058 extern bool parse_output_constraint (const char **, int, int, int,
5059 bool *, bool *, bool *);
5060 extern bool parse_input_constraint (const char **, int, int, int, int,
5061 const char * const *, bool *, bool *);
5062 extern void expand_asm_expr (tree);
5063 extern tree resolve_asm_operand_names (tree, tree, tree);
5064 extern void expand_case (tree);
5065 extern void expand_decl (tree);
5066 extern void expand_anon_union_decl (tree, tree, tree);
5068 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5069 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
5072 /* In gimplify.c. */
5073 extern tree create_artificial_label (void);
5074 extern void gimplify_function_tree (tree);
5075 extern const char *get_name (const_tree);
5076 extern tree unshare_expr (tree);
5077 extern void sort_case_labels (tree);
5079 /* Interface of the DWARF2 unwind info support. */
5081 /* Generate a new label for the CFI info to refer to. */
5083 extern char *dwarf2out_cfi_label (void);
5085 /* Entry point to update the canonical frame address (CFA). */
5087 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
5089 /* Add the CFI for saving a register window. */
5091 extern void dwarf2out_window_save (const char *);
5093 /* Add a CFI to update the running total of the size of arguments pushed
5096 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
5098 /* Entry point for saving a register to the stack. */
5100 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5102 /* Entry point for saving the return address in the stack. */
5104 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5106 /* Entry point for saving the return address in a register. */
5108 extern void dwarf2out_return_reg (const char *, unsigned);
5110 /* Entry point for saving the first register into the second. */
5112 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5114 /* In tree-inline.c */
5116 /* The type of a set of already-visited pointers. Functions for creating
5117 and manipulating it are declared in pointer-set.h */
5118 struct pointer_set_t;
5120 /* The type of a callback function for walking over tree structure. */
5122 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5124 /* The type of a callback function that represents a custom walk_tree. */
5126 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5127 void *, struct pointer_set_t*);
5129 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5131 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5133 #define walk_tree(a,b,c,d) \
5134 walk_tree_1 (a, b, c, d, NULL)
5135 #define walk_tree_without_duplicates(a,b,c) \
5136 walk_tree_without_duplicates_1 (a, b, c, NULL)
5138 /* Assign the RTX to declaration. */
5140 extern void set_decl_rtl (tree, rtx);
5141 extern void set_decl_incoming_rtl (tree, rtx, bool);
5143 /* Enum and arrays used for tree allocation stats.
5144 Keep in sync with tree.c:tree_node_kind_names. */
5170 extern int tree_node_counts[];
5171 extern int tree_node_sizes[];
5173 /* True if we are in gimple form and the actions of the folders need to
5174 be restricted. False if we are not in gimple form and folding is not
5175 restricted to creating gimple expressions. */
5176 extern bool in_gimple_form;
5178 /* In tree-gimple.c. */
5179 extern tree get_base_address (tree t);
5181 /* In tree-vectorizer.c. */
5182 extern void vect_set_verbosity_level (const char *);
5186 struct tree_map_base GTY(())
5191 extern int tree_map_base_eq (const void *, const void *);
5192 extern unsigned int tree_map_base_hash (const void *);
5193 extern int tree_map_base_marked_p (const void *);
5195 /* Map from a tree to another tree. */
5197 struct tree_map GTY(())
5199 struct tree_map_base base;
5204 #define tree_map_eq tree_map_base_eq
5205 extern unsigned int tree_map_hash (const void *);
5206 #define tree_map_marked_p tree_map_base_marked_p
5208 /* Map from a tree to an int. */
5210 struct tree_int_map GTY(())
5212 struct tree_map_base base;
5216 #define tree_int_map_eq tree_map_base_eq
5217 #define tree_int_map_hash tree_map_base_hash
5218 #define tree_int_map_marked_p tree_map_base_marked_p
5220 /* Map from a tree to initialization/finalization priorities. */
5222 struct tree_priority_map GTY(())
5224 struct tree_map_base base;
5229 #define tree_priority_map_eq tree_map_base_eq
5230 #define tree_priority_map_hash tree_map_base_hash
5231 #define tree_priority_map_marked_p tree_map_base_marked_p
5233 /* In tree-ssa-address.c. */
5234 extern tree tree_mem_ref_addr (tree, tree);
5235 extern void copy_mem_ref_info (tree, tree);
5238 extern bool ssa_name_nonzero_p (const_tree);
5239 extern bool ssa_name_nonnegative_p (const_tree);
5241 /* In tree-object-size.c. */
5242 extern void init_object_sizes (void);
5243 extern void fini_object_sizes (void);
5244 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5247 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5249 /* In tree-inline.c. */
5251 void init_inline_once (void);
5253 /* Compute the number of operands in an expression node NODE. For
5254 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5255 otherwise it is looked up from the node's code. */
5257 tree_operand_length (const_tree node)
5259 if (VL_EXP_CLASS_P (node))
5260 return VL_EXP_OPERAND_LENGTH (node);
5262 return TREE_CODE_LENGTH (TREE_CODE (node));
5265 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5266 have to go towards the end of tree.h so that union tree_node is fully
5267 defined by this point. */
5269 /* Structure containing iterator state. */
5270 typedef struct call_expr_arg_iterator_d GTY (())
5272 tree t; /* the call_expr */
5273 int n; /* argument count */
5274 int i; /* next argument index */
5275 } call_expr_arg_iterator;
5277 typedef struct const_call_expr_arg_iterator_d GTY (())
5279 const_tree t; /* the call_expr */
5280 int n; /* argument count */
5281 int i; /* next argument index */
5282 } const_call_expr_arg_iterator;
5284 /* Initialize the abstract argument list iterator object ITER with the
5285 arguments from CALL_EXPR node EXP. */
5287 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5290 iter->n = call_expr_nargs (exp);
5295 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5298 iter->n = call_expr_nargs (exp);
5302 /* Return the next argument from abstract argument list iterator object ITER,
5303 and advance its state. Return NULL_TREE if there are no more arguments. */
5305 next_call_expr_arg (call_expr_arg_iterator *iter)
5308 if (iter->i >= iter->n)
5310 result = CALL_EXPR_ARG (iter->t, iter->i);
5315 static inline const_tree
5316 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5319 if (iter->i >= iter->n)
5321 result = CALL_EXPR_ARG (iter->t, iter->i);
5326 /* Initialize the abstract argument list iterator object ITER, then advance
5327 past and return the first argument. Useful in for expressions, e.g.
5328 for (arg = first_call_expr_arg (exp, &iter); arg;
5329 arg = next_call_expr_arg (&iter)) */
5331 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5333 init_call_expr_arg_iterator (exp, iter);
5334 return next_call_expr_arg (iter);
5337 static inline const_tree
5338 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5340 init_const_call_expr_arg_iterator (exp, iter);
5341 return next_const_call_expr_arg (iter);
5344 /* Test whether there are more arguments in abstract argument list iterator
5345 ITER, without changing its state. */
5347 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5349 return (iter->i < iter->n);
5353 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5355 return (iter->i < iter->n);
5358 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5359 (of type call_expr_arg_iterator) to hold the iteration state. */
5360 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5361 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5362 (arg) = next_call_expr_arg (&(iter)))
5364 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5365 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5366 (arg) = next_const_call_expr_arg (&(iter)))
5368 #endif /* GCC_TREE_H */