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 saturating_flag : 1;
391 unsigned default_def_flag : 1;
393 unsigned lang_flag_0 : 1;
394 unsigned lang_flag_1 : 1;
395 unsigned lang_flag_2 : 1;
396 unsigned lang_flag_3 : 1;
397 unsigned lang_flag_4 : 1;
398 unsigned lang_flag_5 : 1;
399 unsigned lang_flag_6 : 1;
400 unsigned visited : 1;
404 /* FIXME tuples: Eventually, we need to move this somewhere external to
406 union tree_ann_d *ann;
409 struct tree_common GTY(())
411 struct tree_base base;
416 /* GIMPLE_MODIFY_STMT */
417 struct gimple_stmt GTY(())
419 struct tree_base base;
422 /* FIXME tuples: Eventually this should be of type ``struct gimple_expr''. */
423 tree GTY ((length ("TREE_CODE_LENGTH (TREE_CODE (&%h))"))) operands[1];
426 /* The following table lists the uses of each of the above flags and
427 for which types of nodes they are defined. Note that expressions
433 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
434 ..._TYPE, IDENTIFIER_NODE.
435 In a STMT_EXPR, it means we want the result of the enclosed
437 CALL_EXPR_TAILCALL in CALL_EXPR
438 CASE_LOW_SEEN in CASE_LABEL_EXPR
439 RETURN_EXPR_OUTCOME in RETURN_EXPR
444 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
447 TREE_SYMBOL_REFERENCED in
450 TARGET_EXPR, WITH_CLEANUP_EXPR
451 TRY_CATCH_IS_CLEANUP in
455 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
456 TYPE_REF_CAN_ALIAS_ALL in
457 POINTER_TYPE, REFERENCE_TYPE
462 CALL_CANNOT_INLINE_P in
468 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
470 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
473 CALL_EXPR_VA_ARG_PACK in
475 TYPE_CACHED_VALUES_P in
477 SAVE_EXPR_RESOLVED_P in
479 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
480 OMP_CLAUSE_LASTPRIVATE
481 OMP_CLAUSE_PRIVATE_DEBUG in
488 CALL_EXPR_RETURN_SLOT_OPT in
491 PARM_DECL, RESULT_DECL
496 OMP_PARALLEL_COMBINED in
519 TREE_THIS_VOLATILE in
537 TYPE_SIZES_GIMPLIFIED
550 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
551 BLOCK, SSA_NAME, STRING_CST
556 expressions, IDENTIFIER_NODE
561 CALL_EXPR, FUNCTION_DECL
567 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
574 IDENTIFIER_TRANSPARENT_ALIAS in
579 Used in tree traversals to mark visited nodes.
589 ... any expr or decl node
592 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
593 enum tree_node_structure_enum {
594 #include "treestruct.def"
599 /* Define accessors for the fields that all tree nodes have
600 (though some fields are not used for all kinds of nodes). */
602 /* The tree-code says what kind of node it is.
603 Codes are defined in tree.def. */
604 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
605 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
607 /* When checking is enabled, errors will be generated if a tree node
608 is accessed incorrectly. The macros die with a fatal error. */
609 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
611 #define TREE_CHECK(T, CODE) __extension__ \
612 ({ __typeof (T) const __t = (T); \
613 if (TREE_CODE (__t) != (CODE)) \
614 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
618 #define TREE_NOT_CHECK(T, CODE) __extension__ \
619 ({ __typeof (T) const __t = (T); \
620 if (TREE_CODE (__t) == (CODE)) \
621 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
625 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
626 ({ __typeof (T) const __t = (T); \
627 if (TREE_CODE (__t) != (CODE1) \
628 && TREE_CODE (__t) != (CODE2)) \
629 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
630 (CODE1), (CODE2), 0); \
633 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
634 ({ __typeof (T) const __t = (T); \
635 if (TREE_CODE (__t) == (CODE1) \
636 || TREE_CODE (__t) == (CODE2)) \
637 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
638 (CODE1), (CODE2), 0); \
641 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
642 ({ __typeof (T) const __t = (T); \
643 if (TREE_CODE (__t) != (CODE1) \
644 && TREE_CODE (__t) != (CODE2) \
645 && TREE_CODE (__t) != (CODE3)) \
646 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
647 (CODE1), (CODE2), (CODE3), 0); \
650 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
651 ({ __typeof (T) const __t = (T); \
652 if (TREE_CODE (__t) == (CODE1) \
653 || TREE_CODE (__t) == (CODE2) \
654 || TREE_CODE (__t) == (CODE3)) \
655 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
656 (CODE1), (CODE2), (CODE3), 0); \
659 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
660 ({ __typeof (T) const __t = (T); \
661 if (TREE_CODE (__t) != (CODE1) \
662 && TREE_CODE (__t) != (CODE2) \
663 && TREE_CODE (__t) != (CODE3) \
664 && TREE_CODE (__t) != (CODE4)) \
665 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
666 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
669 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
670 ({ __typeof (T) const __t = (T); \
671 if (TREE_CODE (__t) == (CODE1) \
672 || TREE_CODE (__t) == (CODE2) \
673 || TREE_CODE (__t) == (CODE3) \
674 || TREE_CODE (__t) == (CODE4)) \
675 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
676 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
679 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
680 ({ __typeof (T) const __t = (T); \
681 if (TREE_CODE (__t) != (CODE1) \
682 && TREE_CODE (__t) != (CODE2) \
683 && TREE_CODE (__t) != (CODE3) \
684 && TREE_CODE (__t) != (CODE4) \
685 && TREE_CODE (__t) != (CODE5)) \
686 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
687 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
690 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
691 ({ __typeof (T) const __t = (T); \
692 if (TREE_CODE (__t) == (CODE1) \
693 || TREE_CODE (__t) == (CODE2) \
694 || TREE_CODE (__t) == (CODE3) \
695 || TREE_CODE (__t) == (CODE4) \
696 || TREE_CODE (__t) == (CODE5)) \
697 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
698 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
701 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
702 ({ __typeof (T) const __t = (T); \
703 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
704 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
708 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
709 ({ __typeof (T) const __t = (T); \
710 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
711 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
715 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
716 ({ __typeof (T) const __t = (T); \
717 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
718 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
722 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
723 ({ __typeof (T) const __t = (T); \
724 if (TREE_CODE (__t) != OMP_CLAUSE) \
725 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
727 if (__t->omp_clause.code != (CODE)) \
728 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
732 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
733 ({ __typeof (T) const __t = (T); \
734 if (TREE_CODE (__t) != OMP_CLAUSE) \
735 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
737 if ((int) __t->omp_clause.code < (int) (CODE1) \
738 || (int) __t->omp_clause.code > (int) (CODE2)) \
739 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
740 __FUNCTION__, (CODE1), (CODE2)); \
743 /* These checks have to be special cased. */
744 #define EXPR_CHECK(T) __extension__ \
745 ({ __typeof (T) const __t = (T); \
746 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
747 if (!IS_EXPR_CODE_CLASS (__c)) \
748 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
752 #define GIMPLE_STMT_CHECK(T) __extension__ \
753 ({ __typeof (T) const __t = (T); \
754 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
755 if (!IS_GIMPLE_STMT_CODE_CLASS (__c)) \
756 tree_class_check_failed (__t, tcc_gimple_stmt, __FILE__, __LINE__,\
760 /* These checks have to be special cased. */
761 #define NON_TYPE_CHECK(T) __extension__ \
762 ({ __typeof (T) const __t = (T); \
764 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
768 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
769 (*({__typeof (T) const __t = (T); \
770 const int __i = (I); \
771 if (TREE_CODE (__t) != TREE_VEC) \
772 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
774 if (__i < 0 || __i >= __t->vec.length) \
775 tree_vec_elt_check_failed (__i, __t->vec.length, \
776 __FILE__, __LINE__, __FUNCTION__); \
777 &__t->vec.a[__i]; }))
779 #define PHI_NODE_ELT_CHECK(T, I) __extension__ \
780 (*({__typeof (T) const __t = (T); \
781 const int __i = (I); \
782 if (TREE_CODE (__t) != PHI_NODE) \
783 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
785 if (__i < 0 || __i >= __t->phi.capacity) \
786 phi_node_elt_check_failed (__i, __t->phi.num_args, \
787 __FILE__, __LINE__, __FUNCTION__); \
788 &__t->phi.a[__i]; }))
790 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
791 (*({__typeof (T) const __t = (T); \
792 const int __i = (I); \
793 if (TREE_CODE (__t) != OMP_CLAUSE) \
794 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
796 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
797 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
799 &__t->omp_clause.ops[__i]; }))
801 /* Special checks for TREE_OPERANDs. */
802 #define TREE_OPERAND_CHECK(T, I) __extension__ \
803 (*({__typeof (T) const __t = EXPR_CHECK (T); \
804 const int __i = (I); \
805 if (GIMPLE_TUPLE_P (__t)) \
806 gcc_unreachable (); \
807 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
808 tree_operand_check_failed (__i, __t, \
809 __FILE__, __LINE__, __FUNCTION__); \
810 &__t->exp.operands[__i]; }))
812 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
813 (*({__typeof (T) const __t = (T); \
814 const int __i = (I); \
815 if (TREE_CODE (__t) != CODE) \
816 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
817 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
818 tree_operand_check_failed (__i, __t, \
819 __FILE__, __LINE__, __FUNCTION__); \
820 &__t->exp.operands[__i]; }))
822 /* Special checks for GIMPLE_STMT_OPERANDs. */
823 #define GIMPLE_STMT_OPERAND_CHECK(T, I) __extension__ \
824 (*({__typeof (T) const __t = GIMPLE_STMT_CHECK (T); \
825 const int __i = (I); \
826 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
827 tree_operand_check_failed (__i, __t, \
828 __FILE__, __LINE__, __FUNCTION__); \
829 &__t->gstmt.operands[__i]; }))
831 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
833 ({__typeof (T) const __t = (T); \
834 const int __i = (I); \
835 if (TREE_CODE (__t) != (CODE)) \
836 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
837 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
838 tree_operand_check_failed (__i, __t, \
839 __FILE__, __LINE__, __FUNCTION__); \
840 &__t->exp.operands[__i]; }))
842 /* Nodes are chained together for many purposes.
843 Types are chained together to record them for being output to the debugger
844 (see the function `chain_type').
845 Decls in the same scope are chained together to record the contents
847 Statement nodes for successive statements used to be chained together.
848 Often lists of things are represented by TREE_LIST nodes that
849 are chained together. */
851 #define TREE_CHAIN(NODE) __extension__ \
852 (*({__typeof (NODE) const __t = (NODE); \
853 if (GIMPLE_TUPLE_P (__t)) \
854 gcc_unreachable (); \
855 &__t->common.chain; }))
857 /* In all nodes that are expressions, this is the data type of the expression.
858 In POINTER_TYPE nodes, this is the type that the pointer points to.
859 In ARRAY_TYPE nodes, this is the type of the elements.
860 In VECTOR_TYPE nodes, this is the type of the elements. */
861 #define TREE_TYPE(NODE) __extension__ \
862 (*({__typeof (NODE) const __t = (NODE); \
863 if (GIMPLE_TUPLE_P (__t)) \
864 gcc_unreachable (); \
865 &__t->common.type; }))
867 extern void tree_contains_struct_check_failed (const_tree,
868 const enum tree_node_structure_enum,
869 const char *, int, const char *)
872 extern void tree_check_failed (const_tree, const char *, int, const char *,
873 ...) ATTRIBUTE_NORETURN;
874 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
875 ...) ATTRIBUTE_NORETURN;
876 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
877 const char *, int, const char *)
879 extern void tree_range_check_failed (const_tree, const char *, int,
880 const char *, enum tree_code,
882 extern void tree_not_class_check_failed (const_tree,
883 const enum tree_code_class,
884 const char *, int, const char *)
886 extern void tree_vec_elt_check_failed (int, int, const char *,
889 extern void phi_node_elt_check_failed (int, int, const char *,
892 extern void tree_operand_check_failed (int, const_tree,
893 const char *, int, const char *)
895 extern void omp_clause_check_failed (const_tree, const char *, int,
896 const char *, enum omp_clause_code)
898 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
901 extern void omp_clause_range_check_failed (const_tree, const char *, int,
902 const char *, enum omp_clause_code,
903 enum omp_clause_code)
906 #else /* not ENABLE_TREE_CHECKING, or not gcc */
908 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
909 #define TREE_CHECK(T, CODE) (T)
910 #define TREE_NOT_CHECK(T, CODE) (T)
911 #define TREE_CHECK2(T, CODE1, CODE2) (T)
912 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
913 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
914 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
915 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
916 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
917 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
918 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
919 #define TREE_CLASS_CHECK(T, CODE) (T)
920 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
921 #define EXPR_CHECK(T) (T)
922 #define GIMPLE_STMT_CHECK(T) (T)
923 #define NON_TYPE_CHECK(T) (T)
924 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
925 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
926 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
927 #define GIMPLE_STMT_OPERAND_CHECK(T, I) ((T)->gstmt.operands[I])
928 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
929 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
930 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
931 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
932 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
934 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
935 #define TREE_TYPE(NODE) ((NODE)->common.type)
939 #define TREE_BLOCK(NODE) *(tree_block (NODE))
941 #include "tree-check.h"
943 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
944 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
945 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
946 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
947 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
948 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
949 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
950 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
951 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
952 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
953 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
954 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
956 #define RECORD_OR_UNION_CHECK(T) \
957 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
958 #define NOT_RECORD_OR_UNION_CHECK(T) \
959 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
961 #define NUMERICAL_TYPE_CHECK(T) \
962 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
965 /* Nonzero if NODE is a GIMPLE statement. */
966 #define GIMPLE_STMT_P(NODE) \
967 (TREE_CODE_CLASS (TREE_CODE ((NODE))) == tcc_gimple_stmt)
969 /* Nonzero if NODE is a GIMPLE tuple. */
970 #define GIMPLE_TUPLE_P(NODE) (GIMPLE_STMT_P (NODE) || TREE_CODE (NODE) == PHI_NODE)
972 /* A GIMPLE tuple that has a ``locus'' field. */
973 #define GIMPLE_TUPLE_HAS_LOCUS_P(NODE) GIMPLE_STMT_P ((NODE))
975 /* Like TREE_OPERAND but works with GIMPLE stmt tuples as well.
977 If you know the NODE is a GIMPLE statement, use GIMPLE_STMT_OPERAND. If the
978 NODE code is unknown at compile time, use this macro. */
979 #define GENERIC_TREE_OPERAND(NODE, I) *(generic_tree_operand ((NODE), (I)))
981 /* Like TREE_TYPE but returns void_type_node for gimple tuples that have
984 #define GENERIC_TREE_TYPE(NODE) *(generic_tree_type ((NODE)))
986 /* Here is how primitive or already-canonicalized types' hash codes
988 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
990 /* A simple hash function for an arbitrary tree node. This must not be
991 used in hash tables which are saved to a PCH. */
992 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
994 /* The TREE_CHAIN but it is able to handle tuples. */
995 #define GENERIC_NEXT(NODE) \
996 (TREE_CODE (NODE) == PHI_NODE ? PHI_CHAIN (NODE) : \
997 GIMPLE_STMT_P (NODE) ? NULL_TREE : TREE_CHAIN (NODE))
999 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
1000 that don't change the machine mode. */
1002 #define STRIP_NOPS(EXP) \
1003 while ((TREE_CODE (EXP) == NOP_EXPR \
1004 || TREE_CODE (EXP) == CONVERT_EXPR \
1005 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1006 && TREE_OPERAND (EXP, 0) != error_mark_node \
1007 && (TYPE_MODE (TREE_TYPE (EXP)) \
1008 == TYPE_MODE (GENERIC_TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1009 (EXP) = TREE_OPERAND (EXP, 0)
1011 /* Like STRIP_NOPS, but don't let the signedness change either. */
1013 #define STRIP_SIGN_NOPS(EXP) \
1014 while ((TREE_CODE (EXP) == NOP_EXPR \
1015 || TREE_CODE (EXP) == CONVERT_EXPR \
1016 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1017 && TREE_OPERAND (EXP, 0) != error_mark_node \
1018 && (TYPE_MODE (TREE_TYPE (EXP)) \
1019 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1020 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
1021 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1022 && (POINTER_TYPE_P (TREE_TYPE (EXP)) \
1023 == POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1024 (EXP) = TREE_OPERAND (EXP, 0)
1026 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1028 #define STRIP_TYPE_NOPS(EXP) \
1029 while ((TREE_CODE (EXP) == NOP_EXPR \
1030 || TREE_CODE (EXP) == CONVERT_EXPR \
1031 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1032 && TREE_OPERAND (EXP, 0) != error_mark_node \
1033 && (TREE_TYPE (EXP) \
1034 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1035 (EXP) = TREE_OPERAND (EXP, 0)
1037 /* Remove unnecessary type conversions according to
1038 tree_ssa_useless_type_conversion. */
1040 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1041 while (tree_ssa_useless_type_conversion (EXP)) \
1042 EXP = TREE_OPERAND (EXP, 0)
1044 /* Nonzero if TYPE represents an integral type. Note that we do not
1045 include COMPLEX types here. Keep these checks in ascending code
1048 #define INTEGRAL_TYPE_P(TYPE) \
1049 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1050 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1051 || TREE_CODE (TYPE) == INTEGER_TYPE)
1053 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1055 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1056 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1058 /* Nonzero if TYPE represents a saturating fixed-point type. */
1060 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1061 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1063 /* Nonzero if TYPE represents a fixed-point type. */
1065 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1067 /* Nonzero if TYPE represents a scalar floating-point type. */
1069 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1071 /* Nonzero if TYPE represents a complex floating-point type. */
1073 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1074 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1075 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1077 /* Nonzero if TYPE represents a vector floating-point type. */
1079 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1080 (TREE_CODE (TYPE) == VECTOR_TYPE \
1081 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1083 /* Nonzero if TYPE represents a floating-point type, including complex
1084 and vector floating-point types. The vector and complex check does
1085 not use the previous two macros to enable early folding. */
1087 #define FLOAT_TYPE_P(TYPE) \
1088 (SCALAR_FLOAT_TYPE_P (TYPE) \
1089 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1090 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1091 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1093 /* Nonzero if TYPE represents a decimal floating-point type. */
1094 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1095 (SCALAR_FLOAT_TYPE_P (TYPE) \
1096 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1098 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1099 Keep these checks in ascending code order. */
1101 #define AGGREGATE_TYPE_P(TYPE) \
1102 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1103 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1105 /* Nonzero if TYPE represents a pointer or reference type.
1106 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1107 ascending code order. */
1109 #define POINTER_TYPE_P(TYPE) \
1110 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1112 /* Nonzero if this type is a complete type. */
1113 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1115 /* Nonzero if this type is the (possibly qualified) void type. */
1116 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1118 /* Nonzero if this type is complete or is cv void. */
1119 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1120 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1122 /* Nonzero if this type is complete or is an array with unspecified bound. */
1123 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1124 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1127 /* Define many boolean fields that all tree nodes have. */
1129 /* In VAR_DECL nodes, nonzero means address of this is needed.
1130 So it cannot be in a register.
1131 In a FUNCTION_DECL, nonzero means its address is needed.
1132 So it must be compiled even if it is an inline function.
1133 In a FIELD_DECL node, it means that the programmer is permitted to
1134 construct the address of this field. This is used for aliasing
1135 purposes: see record_component_aliases.
1136 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1137 In LABEL_DECL nodes, it means a goto for this label has been seen
1138 from a place outside all binding contours that restore stack levels.
1139 In ..._TYPE nodes, it means that objects of this type must
1140 be fully addressable. This means that pieces of this
1141 object cannot go into register parameters, for example.
1142 In IDENTIFIER_NODEs, this means that some extern decl for this name
1143 had its address taken. That matters for inline functions. */
1144 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1146 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1147 exit of a function. Calls for which this is true are candidates for tail
1148 call optimizations. */
1149 #define CALL_EXPR_TAILCALL(NODE) \
1150 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1152 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1153 CASE_LOW operand has been processed. */
1154 #define CASE_LOW_SEEN(NODE) \
1155 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1157 #define PREDICT_EXPR_OUTCOME(NODE) \
1158 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag)
1159 #define PREDICT_EXPR_PREDICTOR(NODE) \
1160 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1162 /* In a VAR_DECL, nonzero means allocate static storage.
1163 In a FUNCTION_DECL, nonzero if function has been defined.
1164 In a CONSTRUCTOR, nonzero means allocate static storage.
1166 ??? This is also used in lots of other nodes in unclear ways which
1167 should be cleaned up some day. */
1168 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1170 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1171 should only be executed if an exception is thrown, not on normal exit
1173 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1175 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1176 separate cleanup in honor_protect_cleanup_actions. */
1177 #define TRY_CATCH_IS_CLEANUP(NODE) \
1178 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1180 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1181 CASE_HIGH operand has been processed. */
1182 #define CASE_HIGH_SEEN(NODE) \
1183 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1185 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1186 #define CALL_CANNOT_INLINE_P(NODE) ((NODE)->base.static_flag)
1188 /* In an expr node (usually a conversion) this means the node was made
1189 implicitly and should not lead to any sort of warning. In a decl node,
1190 warnings concerning the decl should be suppressed. This is used at
1191 least for used-before-set warnings, and it set after one warning is
1193 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1195 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1196 this string as an argument. */
1197 #define TREE_SYMBOL_REFERENCED(NODE) \
1198 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1200 /* Nonzero in a pointer or reference type means the data pointed to
1201 by this type can alias anything. */
1202 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1203 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1205 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1206 #define MOVE_NONTEMPORAL(NODE) \
1207 (GIMPLE_MODIFY_STMT_CHECK (NODE)->base.static_flag)
1209 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1210 there was an overflow in folding. */
1212 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1214 /* ??? This is an obsolete synonym for TREE_OVERFLOW. */
1215 #define TREE_CONSTANT_OVERFLOW(NODE) TREE_OVERFLOW(NODE)
1217 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1219 #define TREE_OVERFLOW_P(EXPR) \
1220 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1222 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1223 nonzero means name is to be accessible from outside this module.
1224 In an IDENTIFIER_NODE, nonzero means an external declaration
1225 accessible from outside this module was previously seen
1226 for this name in an inner scope. */
1227 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1229 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1230 of cached values, or is something else. */
1231 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1233 /* In a SAVE_EXPR, indicates that the original expression has already
1234 been substituted with a VAR_DECL that contains the value. */
1235 #define SAVE_EXPR_RESOLVED_P(NODE) \
1236 (TREE_CHECK (NODE, SAVE_EXPR)->base.public_flag)
1238 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1240 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1241 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1243 /* In any expression, decl, or constant, nonzero means it has side effects or
1244 reevaluation of the whole expression could produce a different value.
1245 This is set if any subexpression is a function call, a side effect or a
1246 reference to a volatile variable. In a ..._DECL, this is set only if the
1247 declaration said `volatile'. This will never be set for a constant. */
1248 #define TREE_SIDE_EFFECTS(NODE) \
1249 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1251 /* In a LABEL_DECL, nonzero means this label had its address taken
1252 and therefore can never be deleted and is a jump target for
1254 #define FORCED_LABEL(NODE) ((NODE)->base.side_effects_flag)
1256 /* Nonzero means this expression is volatile in the C sense:
1257 its address should be of type `volatile WHATEVER *'.
1258 In other words, the declared item is volatile qualified.
1259 This is used in _DECL nodes and _REF nodes.
1260 On a FUNCTION_DECL node, this means the function does not
1261 return normally. This is the same effect as setting
1262 the attribute noreturn on the function in C.
1264 In a ..._TYPE node, means this type is volatile-qualified.
1265 But use TYPE_VOLATILE instead of this macro when the node is a type,
1266 because eventually we may make that a different bit.
1268 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1269 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1271 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1272 accessing the memory pointed to won't generate a trap. However,
1273 this only applies to an object when used appropriately: it doesn't
1274 mean that writing a READONLY mem won't trap. Similarly for
1275 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1277 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1278 (or slice of the array) always belongs to the range of the array.
1279 I.e. that the access will not trap, provided that the access to
1280 the base to the array will not trap. */
1281 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1283 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1284 nonzero means it may not be the lhs of an assignment. */
1285 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1287 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1288 #define TREE_READONLY_DECL_P(NODE)\
1289 (DECL_P (NODE) && TREE_READONLY (NODE))
1291 /* Value of expression is constant. Always on in all ..._CST nodes. May
1292 also appear in an expression or decl where the value is constant. */
1293 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1295 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1296 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1297 (TYPE_CHECK (NODE)->base.constant_flag)
1299 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1300 #define DECL_UNSIGNED(NODE) \
1301 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1303 /* In integral and pointer types, means an unsigned type. */
1304 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1306 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1307 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1308 This is interesting in an inline function, since it might not need
1309 to be compiled separately.
1310 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1311 if the sdb debugging info for the type has been written.
1312 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1313 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1315 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1317 /* Nonzero in a _DECL if the name is used in its scope.
1318 Nonzero in an expr node means inhibit warning if value is unused.
1319 In IDENTIFIER_NODEs, this means that some extern decl for this name
1321 In a BLOCK, this means that the block contains variables that are used. */
1322 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1324 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1325 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1326 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1328 /* In a CALL_EXPR, means that it's safe to use the target of the call
1329 expansion as the return slot for a call that returns in memory. */
1330 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->base.private_flag)
1332 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1333 reference (and the TREE_TYPE is a pointer to the true type). */
1334 #define DECL_BY_REFERENCE(NODE) \
1335 (DECL_COMMON_CHECK (NODE)->base.private_flag)
1337 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1338 thunked-to function. */
1339 #define CALL_FROM_THUNK_P(NODE) \
1340 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1342 /* In a type, nonzero means that all objects of the type are guaranteed by the
1343 language or front-end to be properly aligned, so we can indicate that a MEM
1344 of this type is aligned at least to the alignment of the type, even if it
1345 doesn't appear that it is. We see this, for example, in object-oriented
1346 languages where a tag field may show this is an object of a more-aligned
1347 variant of the more generic type.
1349 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1351 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1353 /* Used in classes in C++. */
1354 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1355 /* Used in classes in C++.
1356 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1357 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1359 /* Nonzero in a _DECL if the use of the name is defined as a
1360 deprecated feature by __attribute__((deprecated)). */
1361 #define TREE_DEPRECATED(NODE) \
1362 ((NODE)->base.deprecated_flag)
1364 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1365 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1366 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1367 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1369 /* In fixed-point types, means a saturating type. */
1370 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1372 /* These flags are available for each language front end to use internally. */
1373 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1374 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1375 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1376 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1377 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1378 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1379 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1381 /* Define additional fields and accessors for nodes representing constants. */
1383 /* In an INTEGER_CST node. These two together make a 2-word integer.
1384 If the data type is signed, the value is sign-extended to 2 words
1385 even though not all of them may really be in use.
1386 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1387 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1388 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1389 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1391 #define INT_CST_LT(A, B) \
1392 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1393 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1394 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1396 #define INT_CST_LT_UNSIGNED(A, B) \
1397 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1398 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1399 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1400 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1401 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1403 struct tree_int_cst GTY(())
1405 struct tree_common common;
1409 /* In a REAL_CST node. struct real_value is an opaque entity, with
1410 manipulators defined in real.h. We don't want tree.h depending on
1411 real.h and transitively on tm.h. */
1414 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1415 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1417 struct tree_real_cst GTY(())
1419 struct tree_common common;
1420 struct real_value * real_cst_ptr;
1423 /* In a FIXED_CST node. */
1426 #define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1427 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1429 struct tree_fixed_cst GTY(())
1431 struct tree_common common;
1432 struct fixed_value * fixed_cst_ptr;
1435 /* In a STRING_CST */
1436 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1437 #define TREE_STRING_POINTER(NODE) \
1438 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1440 struct tree_string GTY(())
1442 struct tree_common common;
1447 /* In a COMPLEX_CST node. */
1448 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1449 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1451 struct tree_complex GTY(())
1453 struct tree_common common;
1458 /* In a VECTOR_CST node. */
1459 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1461 struct tree_vector GTY(())
1463 struct tree_common common;
1469 /* Define fields and accessors for some special-purpose tree nodes. */
1471 #define IDENTIFIER_LENGTH(NODE) \
1472 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1473 #define IDENTIFIER_POINTER(NODE) \
1474 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1475 #define IDENTIFIER_HASH_VALUE(NODE) \
1476 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1478 /* Translate a hash table identifier pointer to a tree_identifier
1479 pointer, and vice versa. */
1481 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1482 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1483 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1485 struct tree_identifier GTY(())
1487 struct tree_common common;
1488 struct ht_identifier id;
1491 /* In a TREE_LIST node. */
1492 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1493 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1495 struct tree_list GTY(())
1497 struct tree_common common;
1502 /* In a TREE_VEC node. */
1503 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1504 #define TREE_VEC_END(NODE) \
1505 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1507 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1509 struct tree_vec GTY(())
1511 struct tree_common common;
1513 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1516 /* In a CONSTRUCTOR node. */
1517 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1519 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1520 value of each element (stored within VAL). IX must be a scratch variable
1521 of unsigned integer type. */
1522 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1523 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1525 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1529 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1530 the value of each element (stored within VAL) and its index (stored
1531 within INDEX). IX must be a scratch variable of unsigned integer type. */
1532 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1533 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1535 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1536 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1540 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1541 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1543 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1544 _ce___->index = INDEX; \
1545 _ce___->value = VALUE; \
1548 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1549 element. INDEX can optionally design the position of VALUE: in arrays,
1550 it is the index where VALUE has to be placed; in structures, it is the
1551 FIELD_DECL of the member. */
1552 typedef struct constructor_elt_d GTY(())
1558 DEF_VEC_O(constructor_elt);
1559 DEF_VEC_ALLOC_O(constructor_elt,gc);
1561 struct tree_constructor GTY(())
1563 struct tree_common common;
1564 VEC(constructor_elt,gc) *elts;
1567 /* Define fields and accessors for some nodes that represent expressions. */
1569 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1570 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1571 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1572 && integer_zerop (TREE_OPERAND (NODE, 0)))
1574 /* In ordinary expression nodes. */
1575 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1576 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1578 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1579 length. Its value includes the length operand itself; that is,
1580 the minimum valid length is 1.
1581 Note that we have to bypass the use of TREE_OPERAND to access
1582 that field to avoid infinite recursion in expanding the macros. */
1583 #define VL_EXP_OPERAND_LENGTH(NODE) \
1584 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1586 /* In gimple statements. */
1587 #define GIMPLE_STMT_OPERAND(NODE, I) GIMPLE_STMT_OPERAND_CHECK (NODE, I)
1588 #define GIMPLE_STMT_LOCUS(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.locus)
1589 #define GIMPLE_STMT_BLOCK(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.block)
1591 /* In a LOOP_EXPR node. */
1592 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1594 /* The source location of this expression. Non-tree_exp nodes such as
1595 decls and constants can be shared among multiple locations, so
1597 #define EXPR_LOCATION(NODE) expr_location ((NODE))
1598 #define SET_EXPR_LOCATION(NODE, FROM) set_expr_location ((NODE), (FROM))
1599 #define EXPR_HAS_LOCATION(NODE) expr_has_location ((NODE))
1600 #define EXPR_LOCUS(NODE) expr_locus ((NODE))
1601 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1602 #define EXPR_FILENAME(NODE) (expr_filename ((NODE)))
1603 #define EXPR_LINENO(NODE) (expr_lineno ((NODE)))
1605 /* True if a tree is an expression or statement that can have a
1607 #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE) || GIMPLE_STMT_P (NODE))
1609 /* In a TARGET_EXPR node. */
1610 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1611 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1612 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1614 /* DECL_EXPR accessor. This gives access to the DECL associated with
1615 the given declaration statement. */
1616 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1618 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1620 /* SWITCH_EXPR accessors. These give access to the condition, body and
1621 original condition type (before any compiler conversions)
1622 of the switch statement, respectively. */
1623 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1624 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1625 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1627 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1628 of a case label, respectively. */
1629 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1630 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1631 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1633 /* The operands of a TARGET_MEM_REF. */
1634 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1635 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1636 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1637 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1638 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1639 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1640 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1642 /* The operands of a BIND_EXPR. */
1643 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1644 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1645 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1647 /* GOTO_EXPR accessor. This gives access to the label associated with
1648 a goto statement. */
1649 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1651 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1652 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1653 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1655 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1656 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1657 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1658 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1659 /* Nonzero if we want to create an ASM_INPUT instead of an
1660 ASM_OPERAND with no operands. */
1661 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1662 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1664 /* COND_EXPR accessors. */
1665 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1666 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1667 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1669 /* Accessors for the chains of recurrences. */
1670 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1671 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1672 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1673 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1675 /* LABEL_EXPR accessor. This gives access to the label associated with
1676 the given label expression. */
1677 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1679 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1680 accessors for SSA operands. */
1682 /* CATCH_EXPR accessors. */
1683 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1684 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1686 /* EH_FILTER_EXPR accessors. */
1687 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1688 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1689 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1691 /* CHANGE_DYNAMIC_TYPE_EXPR accessors. */
1692 #define CHANGE_DYNAMIC_TYPE_NEW_TYPE(NODE) \
1693 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 0)
1694 #define CHANGE_DYNAMIC_TYPE_LOCATION(NODE) \
1695 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 1)
1697 /* OBJ_TYPE_REF accessors. */
1698 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1699 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1700 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1702 /* ASSERT_EXPR accessors. */
1703 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1704 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1706 /* CALL_EXPR accessors.
1708 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1709 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1710 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1711 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1712 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1714 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1715 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1716 the argument count is zero when checking is enabled. Instead, do
1717 the pointer arithmetic to advance past the 3 fixed operands in a
1718 CALL_EXPR. That produces a valid pointer to just past the end of the
1719 operand array, even if it's not valid to dereference it. */
1720 #define CALL_EXPR_ARGP(NODE) \
1721 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1723 /* OpenMP directive and clause accessors. */
1725 #define OMP_BODY(NODE) \
1726 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1727 #define OMP_CLAUSES(NODE) \
1728 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1730 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1731 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1732 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1733 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1735 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1736 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1737 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1738 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1739 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1740 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1742 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1743 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1744 #define OMP_SECTIONS_CONTROL(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 2)
1746 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1748 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1749 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1751 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1753 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1755 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1756 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1758 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1759 #define OMP_CLAUSE_DECL(NODE) \
1760 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1761 OMP_CLAUSE_PRIVATE, \
1762 OMP_CLAUSE_COPYPRIVATE), 0)
1764 /* True on an OMP_SECTION statement that was the last lexical member.
1765 This status is meaningful in the implementation of lastprivate. */
1766 #define OMP_SECTION_LAST(NODE) \
1767 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1769 /* True on an OMP_RETURN statement if the return does not require a
1770 thread synchronization via some sort of barrier. The exact barrier
1771 that would otherwise be emitted is dependent on the OMP statement
1772 with which this return is associated. */
1773 #define OMP_RETURN_NOWAIT(NODE) \
1774 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1776 /* True on an OMP_PARALLEL statement if it represents an explicit
1777 combined parallel work-sharing constructs. */
1778 #define OMP_PARALLEL_COMBINED(NODE) \
1779 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1781 /* True on a PRIVATE clause if its decl is kept around for debugging
1782 information only and its DECL_VALUE_EXPR is supposed to point
1783 to what it has been remapped to. */
1784 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1785 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1787 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1788 decl is present in the chain. */
1789 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1790 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1792 #define OMP_CLAUSE_IF_EXPR(NODE) \
1793 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1794 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1795 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1796 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1797 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1799 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1800 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1801 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1802 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1803 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1804 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1805 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1806 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1808 enum omp_clause_schedule_kind
1810 OMP_CLAUSE_SCHEDULE_STATIC,
1811 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1812 OMP_CLAUSE_SCHEDULE_GUIDED,
1813 OMP_CLAUSE_SCHEDULE_RUNTIME
1816 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1817 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1819 enum omp_clause_default_kind
1821 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1822 OMP_CLAUSE_DEFAULT_SHARED,
1823 OMP_CLAUSE_DEFAULT_NONE,
1824 OMP_CLAUSE_DEFAULT_PRIVATE
1827 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1828 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1830 struct tree_exp GTY(())
1832 struct tree_common common;
1835 tree GTY ((special ("tree_exp"),
1836 desc ("TREE_CODE ((tree) &%0)")))
1840 /* SSA_NAME accessors. */
1842 /* Returns the variable being referenced. Once released, this is the
1843 only field that can be relied upon. */
1844 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1846 /* Returns the statement which defines this reference. Note that
1847 we use the same field when chaining SSA_NAME nodes together on
1848 the SSA_NAME freelist. */
1849 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1851 /* Returns the SSA version number of this SSA name. Note that in
1852 tree SSA, version numbers are not per variable and may be recycled. */
1853 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1855 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1856 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1858 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1859 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1861 /* Nonzero if this SSA_NAME expression is currently on the free list of
1862 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1863 has no meaning for an SSA_NAME. */
1864 #define SSA_NAME_IN_FREE_LIST(NODE) \
1865 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1867 /* Nonzero if this SSA_NAME is the default definition for the
1868 underlying symbol. A default SSA name is created for symbol S if
1869 the very first reference to S in the function is a read operation.
1870 Default definitions are always created by an empty statement and
1871 belong to no basic block. */
1872 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1873 SSA_NAME_CHECK (NODE)->base.default_def_flag
1875 /* Attributes for SSA_NAMEs for pointer-type variables. */
1876 #define SSA_NAME_PTR_INFO(N) \
1877 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1879 /* Get the value of this SSA_NAME, if available. */
1880 #define SSA_NAME_VALUE(N) \
1881 SSA_NAME_CHECK (N)->ssa_name.value_handle
1883 #ifndef _TREE_FLOW_H
1884 struct ptr_info_def;
1889 /* Immediate use linking structure. This structure is used for maintaining
1890 a doubly linked list of uses of an SSA_NAME. */
1891 typedef struct ssa_use_operand_d GTY(())
1893 struct ssa_use_operand_d* GTY((skip(""))) prev;
1894 struct ssa_use_operand_d* GTY((skip(""))) next;
1895 tree GTY((skip(""))) stmt;
1896 tree *GTY((skip(""))) use;
1897 } ssa_use_operand_t;
1899 /* Return the immediate_use information for an SSA_NAME. */
1900 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1902 struct tree_ssa_name GTY(())
1904 struct tree_common common;
1906 /* _DECL wrapped by this SSA name. */
1909 /* SSA version number. */
1910 unsigned int version;
1912 /* Pointer attributes used for alias analysis. */
1913 struct ptr_info_def *ptr_info;
1915 /* Value for SSA name used by various passes.
1917 Right now only invariants are allowed to persist beyond a pass in
1918 this field; in the future we will allow VALUE_HANDLEs to persist
1922 /* Immediate uses list for this SSA_NAME. */
1923 struct ssa_use_operand_d imm_uses;
1926 /* In a PHI_NODE node. */
1928 /* These 2 macros should be considered off limits for use by developers. If
1929 you wish to access the use or def fields of a PHI_NODE in the SSA
1930 optimizers, use the accessor macros found in tree-ssa-operands.h.
1931 These two macros are to be used only by those accessor macros, and other
1932 select places where we *absolutely* must take the address of the tree. */
1934 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1935 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1937 /* PHI_NODEs for each basic block are chained together in a single linked
1938 list. The head of the list is linked from the block annotation, and
1939 the link to the next PHI is in PHI_CHAIN. */
1940 #define PHI_CHAIN(NODE) PHI_NODE_CHECK (NODE)->phi.chain
1942 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1943 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1944 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1945 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1946 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1947 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1949 struct phi_arg_d GTY(())
1951 /* imm_use MUST be the first element in struct because we do some
1952 pointer arithmetic with it. See phi_arg_index_from_use. */
1953 struct ssa_use_operand_d imm_use;
1957 struct tree_phi_node GTY(())
1959 struct tree_base common;
1965 /* Basic block holding this PHI node. */
1966 struct basic_block_def *bb;
1968 /* Arguments of the PHI node. These are maintained in the same
1969 order as predecessor edge vector BB->PREDS. */
1970 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1974 #define OMP_CLAUSE_CODE(NODE) \
1975 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1977 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1978 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1980 #define OMP_CLAUSE_CODE(NODE) \
1981 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1983 #define OMP_CLAUSE_OPERAND(NODE, I) \
1984 OMP_CLAUSE_ELT_CHECK (NODE, I)
1986 struct tree_omp_clause GTY(())
1988 struct tree_common common;
1989 enum omp_clause_code code;
1990 union omp_clause_subcode {
1991 enum omp_clause_default_kind default_kind;
1992 enum omp_clause_schedule_kind schedule_kind;
1993 enum tree_code reduction_code;
1994 } GTY ((skip)) subcode;
1995 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1999 struct varray_head_tag;
2001 /* In a BLOCK node. */
2002 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2003 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2004 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2005 /* Note: when changing this, make sure to find the places
2006 that use chainon or nreverse. */
2007 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
2008 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2009 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
2011 /* Nonzero means that this block is prepared to handle exceptions
2012 listed in the BLOCK_VARS slot. */
2013 #define BLOCK_HANDLER_BLOCK(NODE) \
2014 (BLOCK_CHECK (NODE)->block.handler_block_flag)
2016 /* An index number for this block. These values are not guaranteed to
2017 be unique across functions -- whether or not they are depends on
2018 the debugging output format in use. */
2019 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2021 /* If block reordering splits a lexical block into discontiguous
2022 address ranges, we'll make a copy of the original block.
2024 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2025 In that case, we have one source block that has been replicated
2026 (through inlining or unrolling) into many logical blocks, and that
2027 these logical blocks have different physical variables in them.
2029 In this case, we have one logical block split into several
2030 non-contiguous address ranges. Most debug formats can't actually
2031 represent this idea directly, so we fake it by creating multiple
2032 logical blocks with the same variables in them. However, for those
2033 that do support non-contiguous regions, these allow the original
2034 logical block to be reconstructed, along with the set of address
2037 One of the logical block fragments is arbitrarily chosen to be
2038 the ORIGIN. The other fragments will point to the origin via
2039 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2040 be null. The list of fragments will be chained through
2041 BLOCK_FRAGMENT_CHAIN from the origin. */
2043 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2044 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2046 /* For an inlined function, this gives the location where it was called
2047 from. This is only set in the top level block, which corresponds to the
2048 inlined function scope. This is used in the debug output routines. */
2050 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2052 struct tree_block GTY(())
2054 struct tree_common common;
2056 unsigned handler_block_flag : 1;
2057 unsigned abstract_flag : 1;
2058 unsigned block_num : 30;
2065 tree abstract_origin;
2066 tree fragment_origin;
2067 tree fragment_chain;
2070 /* Define fields and accessors for nodes representing data types. */
2072 /* See tree.def for documentation of the use of these fields.
2073 Look at the documentation of the various ..._TYPE tree codes.
2075 Note that the type.values, type.minval, and type.maxval fields are
2076 overloaded and used for different macros in different kinds of types.
2077 Each macro must check to ensure the tree node is of the proper kind of
2078 type. Note also that some of the front-ends also overload these fields,
2079 so they must be checked as well. */
2081 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2082 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2083 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2084 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
2085 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2086 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2087 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2088 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2089 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2090 (INTEGER_TYPE_CHECK (NODE)->type.values \
2091 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2092 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2093 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2094 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2095 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2096 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2097 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2098 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2099 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2100 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2101 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2102 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2103 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2104 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2105 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2106 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2107 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2108 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2109 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2110 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2112 /* The "canonical" type for this type node, which can be used to
2113 compare the type for equality with another type. If two types are
2114 equal (based on the semantics of the language), then they will have
2115 equivalent TYPE_CANONICAL entries.
2117 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2118 be used for comparison against other types. Instead, the type is
2119 said to require structural equality checks, described in
2120 TYPE_STRUCTURAL_EQUALITY_P. */
2121 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2122 /* Indicates that the type node requires structural equality
2123 checks. The compiler will need to look at the composition of the
2124 type to determine whether it is equal to another type, rather than
2125 just comparing canonical type pointers. For instance, we would need
2126 to look at the return and parameter types of a FUNCTION_TYPE
2128 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2129 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2130 type node requires structural equality. */
2131 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2132 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2133 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2134 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2136 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2137 in the debugging output. We use this to describe a vector as a
2138 structure containing an array. */
2139 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2141 /* For record and union types, information about this type, as a base type
2143 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2145 /* For non record and union types, used in a language-dependent way. */
2146 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2148 /* The (language-specific) typed-based alias set for this type.
2149 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2150 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2151 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2152 type can alias objects of any type. */
2153 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2155 /* Nonzero iff the typed-based alias set for this type has been
2157 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2159 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2161 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2163 /* The alignment necessary for objects of this type.
2164 The value is an int, measured in bits. */
2165 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2167 /* 1 if the alignment for this type was requested by "aligned" attribute,
2168 0 if it is the default for this type. */
2169 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2171 /* The alignment for NODE, in bytes. */
2172 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2174 /* If your language allows you to declare types, and you want debug info
2175 for them, then you need to generate corresponding TYPE_DECL nodes.
2176 These "stub" TYPE_DECL nodes have no name, and simply point at the
2177 type node. You then set the TYPE_STUB_DECL field of the type node
2178 to point back at the TYPE_DECL node. This allows the debug routines
2179 to know that the two nodes represent the same type, so that we only
2180 get one debug info record for them. */
2181 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2183 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2184 has BLKmode only because it lacks the alignment requirement for
2186 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2188 /* In an INTEGER_TYPE, it means the type represents a size. We use
2189 this both for validity checking and to permit optimizations that
2190 are unsafe for other types. Note that the C `size_t' type should
2191 *not* have this flag set. The `size_t' type is simply a typedef
2192 for an ordinary integer type that happens to be the type of an
2193 expression returned by `sizeof'; `size_t' has no special
2194 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2195 always actual sizes. */
2196 #define TYPE_IS_SIZETYPE(NODE) \
2197 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2199 /* Nonzero in a type considered volatile as a whole. */
2200 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2202 /* Means this type is const-qualified. */
2203 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2205 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2207 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2209 /* There is a TYPE_QUAL value for each type qualifier. They can be
2210 combined by bitwise-or to form the complete set of qualifiers for a
2213 #define TYPE_UNQUALIFIED 0x0
2214 #define TYPE_QUAL_CONST 0x1
2215 #define TYPE_QUAL_VOLATILE 0x2
2216 #define TYPE_QUAL_RESTRICT 0x4
2218 /* The set of type qualifiers for this type. */
2219 #define TYPE_QUALS(NODE) \
2220 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2221 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2222 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2224 /* These flags are available for each language front end to use internally. */
2225 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2226 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2227 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2228 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2229 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2230 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2231 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2233 /* Used to keep track of visited nodes in tree traversals. This is set to
2234 0 by copy_node and make_node. */
2235 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2237 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2238 that distinguish string from array of char).
2239 If set in a INTEGER_TYPE, indicates a character type. */
2240 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2242 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2243 object of the given ARRAY_TYPE. This allows temporaries to be
2245 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2246 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2248 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2249 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2250 (((unsigned HOST_WIDE_INT) 1) \
2251 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2253 /* Set precision to n when we have 2^n sub-parts of the vector. */
2254 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2255 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2257 /* Indicates that objects of this type must be initialized by calling a
2258 function when they are created. */
2259 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2260 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2262 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2263 the same way that the first union alternative would be passed. */
2264 #define TYPE_TRANSPARENT_UNION(NODE) \
2265 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2267 /* For an ARRAY_TYPE, indicates that it is not permitted to
2268 take the address of a component of the type. */
2269 #define TYPE_NONALIASED_COMPONENT(NODE) \
2270 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2272 /* Indicated that objects of this type should be laid out in as
2273 compact a way as possible. */
2274 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2276 /* Used by type_contains_placeholder_p to avoid recomputation.
2277 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2278 this field directly. */
2279 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2280 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2284 struct tree_type GTY(())
2286 struct tree_common common;
2293 unsigned int precision : 9;
2294 ENUM_BITFIELD(machine_mode) mode : 7;
2296 unsigned string_flag : 1;
2297 unsigned no_force_blk_flag : 1;
2298 unsigned needs_constructing_flag : 1;
2299 unsigned transparent_union_flag : 1;
2300 unsigned packed_flag : 1;
2301 unsigned restrict_flag : 1;
2302 unsigned contains_placeholder_bits : 2;
2304 unsigned lang_flag_0 : 1;
2305 unsigned lang_flag_1 : 1;
2306 unsigned lang_flag_2 : 1;
2307 unsigned lang_flag_3 : 1;
2308 unsigned lang_flag_4 : 1;
2309 unsigned lang_flag_5 : 1;
2310 unsigned lang_flag_6 : 1;
2311 unsigned user_align : 1;
2316 union tree_type_symtab {
2317 int GTY ((tag ("0"))) address;
2318 const char * GTY ((tag ("1"))) pointer;
2319 struct die_struct * GTY ((tag ("2"))) die;
2320 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2321 descbits ("2"))) symtab;
2330 alias_set_type alias_set;
2331 /* Points to a structure whose details depend on the language in use. */
2332 struct lang_type *lang_specific;
2335 /* Define accessor macros for information about type inheritance
2338 A "basetype" means a particular usage of a data type for inheritance
2339 in another type. Each such basetype usage has its own "binfo"
2340 object to describe it. The binfo object is a TREE_VEC node.
2342 Inheritance is represented by the binfo nodes allocated for a
2343 given type. For example, given types C and D, such that D is
2344 inherited by C, 3 binfo nodes will be allocated: one for describing
2345 the binfo properties of C, similarly one for D, and one for
2346 describing the binfo properties of D as a base type for C.
2347 Thus, given a pointer to class C, one can get a pointer to the binfo
2348 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2350 /* BINFO specific flags. */
2352 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2353 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2355 /* Flags for language dependent use. */
2356 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2357 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2358 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2359 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2360 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2361 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2362 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2364 /* The actual data type node being inherited in this basetype. */
2365 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2367 /* The offset where this basetype appears in its containing type.
2368 BINFO_OFFSET slot holds the offset (in bytes)
2369 from the base of the complete object to the base of the part of the
2370 object that is allocated on behalf of this `type'.
2371 This is always 0 except when there is multiple inheritance. */
2373 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2374 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2376 /* The virtual function table belonging to this basetype. Virtual
2377 function tables provide a mechanism for run-time method dispatching.
2378 The entries of a virtual function table are language-dependent. */
2380 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2382 /* The virtual functions in the virtual function table. This is
2383 a TREE_LIST that is used as an initial approximation for building
2384 a virtual function table for this basetype. */
2385 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2387 /* A vector of binfos for the direct basetypes inherited by this
2390 If this basetype describes type D as inherited in C, and if the
2391 basetypes of D are E and F, then this vector contains binfos for
2392 inheritance of E and F by C. */
2393 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2395 /* The number of basetypes for NODE. */
2396 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2398 /* Accessor macro to get to the Nth base binfo of this binfo. */
2399 #define BINFO_BASE_BINFO(NODE,N) \
2400 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2401 #define BINFO_BASE_ITERATE(NODE,N,B) \
2402 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2403 #define BINFO_BASE_APPEND(NODE,T) \
2404 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2406 /* For a BINFO record describing a virtual base class, i.e., one where
2407 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2408 base. The actual contents are language-dependent. In the C++
2409 front-end this field is an INTEGER_CST giving an offset into the
2410 vtable where the offset to the virtual base can be found. */
2411 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2413 /* Indicates the accesses this binfo has to its bases. The values are
2414 access_public_node, access_protected_node or access_private_node.
2415 If this array is not present, public access is implied. */
2416 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2418 #define BINFO_BASE_ACCESS(NODE,N) \
2419 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2420 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2421 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2423 /* The index in the VTT where this subobject's sub-VTT can be found.
2424 NULL_TREE if there is no sub-VTT. */
2425 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2427 /* The index in the VTT where the vptr for this subobject can be
2428 found. NULL_TREE if there is no secondary vptr in the VTT. */
2429 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2431 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2432 inheriting this base for non-virtual bases. For virtual bases it
2433 points either to the binfo for which this is a primary binfo, or to
2434 the binfo of the most derived type. */
2435 #define BINFO_INHERITANCE_CHAIN(NODE) \
2436 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2438 struct tree_binfo GTY (())
2440 struct tree_common common;
2446 VEC(tree,gc) *base_accesses;
2452 VEC(tree,none) base_binfos;
2456 /* Define fields and accessors for nodes representing declared names. */
2458 /* Nonzero if DECL represents a variable for the SSA passes. */
2459 #define SSA_VAR_P(DECL) \
2460 (TREE_CODE (DECL) == VAR_DECL \
2461 || TREE_CODE (DECL) == PARM_DECL \
2462 || TREE_CODE (DECL) == RESULT_DECL \
2464 || (TREE_CODE (DECL) == SSA_NAME \
2465 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2466 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2467 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2468 || MTAG_P (SSA_NAME_VAR (DECL)))))
2473 /* Enumerate visibility settings. */
2474 #ifndef SYMBOL_VISIBILITY_DEFINED
2475 #define SYMBOL_VISIBILITY_DEFINED
2476 enum symbol_visibility
2479 VISIBILITY_PROTECTED,
2488 /* This is the name of the object as written by the user.
2489 It is an IDENTIFIER_NODE. */
2490 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2492 /* Every ..._DECL node gets a unique number. */
2493 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2495 /* These two fields describe where in the source code the declaration
2496 was. If the declaration appears in several places (as for a C
2497 function that is declared first and then defined later), this
2498 information should refer to the definition. */
2499 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2500 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2501 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2502 #define DECL_IS_BUILTIN(DECL) \
2503 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2505 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2506 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2507 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2508 points to either the FUNCTION_DECL for the containing function,
2509 the RECORD_TYPE or UNION_TYPE for the containing type, or
2510 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2512 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2513 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2514 struct tree_decl_minimal GTY(())
2516 struct tree_common common;
2523 /* When computing aliasing information, we represent the memory pointed-to
2524 by pointers with artificial variables called "memory tags" (MT). There
2525 are two kinds of tags, namely symbol and name:
2527 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2528 represent all the pointed-to locations and variables pointed-to by
2529 the same pointer symbol. Usually, this set is computed using
2530 type-based analysis (i.e., alias set classes), but this may not
2533 Name tags (NMT) are used in flow-sensitive points-to alias
2534 analysis, they represent the variables and memory locations
2535 pointed-to by a specific SSA_NAME pointer.
2537 In general, given a pointer P with a symbol tag SMT, the alias set
2538 of SMT should be the union of all the alias sets of the NMTs of
2539 every SSA_NAME for P. */
2540 struct tree_memory_tag GTY(())
2542 struct tree_decl_minimal common;
2544 bitmap GTY ((skip)) aliases;
2546 /* True if this tag has global scope. */
2547 unsigned int is_global : 1;
2549 /* True if this tag is the first field of an aggregate type that
2550 can be used to find adjacent SFTs belonging to the same aggregate. */
2551 unsigned int base_for_components : 1;
2553 /* True if this tag should not be grouped into a memory partition. */
2554 unsigned int unpartitionable : 1;
2557 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2558 #define MTAG_ALIASES(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.aliases)
2560 struct tree_struct_field_tag GTY(())
2562 struct tree_memory_tag common;
2564 /* Parent variable. */
2567 /* Offset inside structure. */
2568 unsigned HOST_WIDE_INT offset;
2570 /* Size of the field. */
2571 unsigned HOST_WIDE_INT size;
2573 /* Alias set for a DECL_NONADDRESSABLE_P field. Otherwise -1. */
2574 alias_set_type alias_set;
2576 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2577 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2578 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2579 #define SFT_NONADDRESSABLE_P(NODE) \
2580 (STRUCT_FIELD_TAG_CHECK (NODE)->sft.alias_set != -1)
2581 #define SFT_ALIAS_SET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.alias_set)
2582 #define SFT_UNPARTITIONABLE_P(NODE) \
2583 (STRUCT_FIELD_TAG_CHECK (NODE)->sft.common.unpartitionable)
2584 #define SFT_BASE_FOR_COMPONENTS_P(NODE) \
2585 (STRUCT_FIELD_TAG_CHECK (NODE)->sft.common.base_for_components)
2587 /* Memory Partition Tags (MPTs) group memory symbols under one
2588 common name for the purposes of placing memory PHI nodes. */
2590 struct tree_memory_partition_tag GTY(())
2592 struct tree_memory_tag common;
2594 /* Set of symbols grouped under this MPT. */
2598 #define MPT_SYMBOLS(NODE) (MEMORY_PARTITION_TAG_CHECK (NODE)->mpt.symbols)
2601 /* For any sort of a ..._DECL node, this points to the original (abstract)
2602 decl node which this decl is an instance of, or else it is NULL indicating
2603 that this decl is not an instance of some other decl. For example,
2604 in a nested declaration of an inline function, this points back to the
2606 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2608 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2609 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2610 #define DECL_ORIGIN(NODE) \
2611 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2613 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2614 inline instance of some original (abstract) decl from an inline function;
2615 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2616 nodes can also have their abstract origin set to themselves. */
2617 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2618 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2620 /* In a DECL this is the field where attributes are stored. */
2621 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2623 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2624 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2625 For a VAR_DECL, holds the initial value.
2626 For a PARM_DECL, not used--default
2627 values for parameters are encoded in the type of the function,
2628 not in the PARM_DECL slot.
2629 For a FIELD_DECL, this is used for enumeration values and the C
2630 frontend uses it for temporarily storing bitwidth of bitfields.
2632 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2633 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2635 /* Holds the size of the datum, in bits, as a tree expression.
2636 Need not be constant. */
2637 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2638 /* Likewise for the size in bytes. */
2639 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2640 /* Holds the alignment required for the datum, in bits. */
2641 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2642 /* The alignment of NODE, in bytes. */
2643 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2644 /* Set if the alignment of this DECL has been set by the user, for
2645 example with an 'aligned' attribute. */
2646 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2647 /* Holds the machine mode corresponding to the declaration of a variable or
2648 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2650 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2652 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2653 operation it is. Note, however, that this field is overloaded, with
2654 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2655 checked before any access to the former. */
2656 #define DECL_FUNCTION_CODE(NODE) \
2657 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2658 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2659 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2661 /* Nonzero for a given ..._DECL node means that the name of this node should
2662 be ignored for symbolic debug purposes. */
2663 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2665 /* Nonzero for a given ..._DECL node means that this node represents an
2666 "abstract instance" of the given declaration (e.g. in the original
2667 declaration of an inline function). When generating symbolic debugging
2668 information, we mustn't try to generate any address information for nodes
2669 marked as "abstract instances" because we don't actually generate
2670 any code or allocate any data space for such instances. */
2671 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2673 /* Language-specific decl information. */
2674 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2676 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2677 do not allocate storage, and refer to a definition elsewhere. Note that
2678 this does not necessarily imply the entity represented by NODE
2679 has no program source-level definition in this translation unit. For
2680 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2681 DECL_EXTERNAL may be true simultaneously; that can be the case for
2682 a C99 "extern inline" function. */
2683 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2685 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2686 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2688 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2690 Also set in some languages for variables, etc., outside the normal
2691 lexical scope, such as class instance variables. */
2692 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2694 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2695 Used in FIELD_DECLs for vtable pointers.
2696 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2697 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2699 /* Used to indicate that this DECL represents a compiler-generated entity. */
2700 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2702 /* Additional flags for language-specific uses. */
2703 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2704 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2705 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2706 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2707 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2708 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2709 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2710 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2712 /* Used to indicate an alias set for the memory pointed to by this
2713 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2714 pointer (or reference) type. */
2715 #define DECL_POINTER_ALIAS_SET(NODE) \
2716 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2718 /* Nonzero if an alias set has been assigned to this declaration. */
2719 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2720 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2722 /* Nonzero for a decl which is at file scope. */
2723 #define DECL_FILE_SCOPE_P(EXP) \
2724 (! DECL_CONTEXT (EXP) \
2725 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2727 /* Nonzero for a decl that is decorated using attribute used.
2728 This indicates compiler tools that this decl needs to be preserved. */
2729 #define DECL_PRESERVE_P(DECL) \
2730 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2732 /* For function local variables of COMPLEX and VECTOR types,
2733 indicates that the variable is not aliased, and that all
2734 modifications to the variable have been adjusted so that
2735 they are killing assignments. Thus the variable may now
2736 be treated as a GIMPLE register, and use real instead of
2737 virtual ops in SSA form. */
2738 #define DECL_GIMPLE_REG_P(DECL) \
2739 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2741 /* For a DECL with pointer type, this is set if Type Based Alias
2742 Analysis should not be applied to this DECL. */
2743 #define DECL_NO_TBAA_P(DECL) \
2744 DECL_COMMON_CHECK (DECL)->decl_common.no_tbaa_flag
2746 struct tree_decl_common GTY(())
2748 struct tree_decl_minimal common;
2751 ENUM_BITFIELD(machine_mode) mode : 8;
2753 unsigned nonlocal_flag : 1;
2754 unsigned virtual_flag : 1;
2755 unsigned ignored_flag : 1;
2756 unsigned abstract_flag : 1;
2757 unsigned artificial_flag : 1;
2758 unsigned user_align : 1;
2759 unsigned preserve_flag: 1;
2760 unsigned debug_expr_is_from : 1;
2762 unsigned lang_flag_0 : 1;
2763 unsigned lang_flag_1 : 1;
2764 unsigned lang_flag_2 : 1;
2765 unsigned lang_flag_3 : 1;
2766 unsigned lang_flag_4 : 1;
2767 unsigned lang_flag_5 : 1;
2768 unsigned lang_flag_6 : 1;
2769 unsigned lang_flag_7 : 1;
2771 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2772 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2773 unsigned decl_flag_0 : 1;
2774 /* In FIELD_DECL, this is DECL_PACKED. */
2775 unsigned decl_flag_1 : 1;
2776 /* In FIELD_DECL, this is DECL_BIT_FIELD
2777 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2778 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2779 unsigned decl_flag_2 : 1;
2780 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2781 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2782 unsigned decl_flag_3 : 1;
2783 /* Logically, these two would go in a theoretical base shared by var and
2785 unsigned gimple_reg_flag : 1;
2786 /* In a DECL with pointer type, set if no TBAA should be done. */
2787 unsigned no_tbaa_flag : 1;
2788 /* Padding so that 'align' can be on a 32-bit boundary. */
2789 unsigned decl_common_unused : 2;
2791 unsigned int align : 24;
2792 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2793 unsigned int off_align : 8;
2798 tree abstract_origin;
2800 alias_set_type pointer_alias_set;
2801 /* Points to a structure whose details depend on the language in use. */
2802 struct lang_decl *lang_specific;
2805 extern tree decl_value_expr_lookup (tree);
2806 extern void decl_value_expr_insert (tree, tree);
2808 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2809 if transformations have made this more complicated than evaluating the
2810 decl itself. This should only be used for debugging; once this field has
2811 been set, the decl itself may not legitimately appear in the function. */
2812 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2813 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2814 #define DECL_VALUE_EXPR(NODE) \
2815 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2816 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2817 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2819 /* Holds the RTL expression for the value of a variable or function.
2820 This value can be evaluated lazily for functions, variables with
2821 static storage duration, and labels. */
2822 #define DECL_RTL(NODE) \
2823 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2824 ? (NODE)->decl_with_rtl.rtl \
2825 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2827 /* Set the DECL_RTL for NODE to RTL. */
2828 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2830 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2831 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2833 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2834 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2836 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2837 NODE1, it will not be set for NODE2; this is a lazy copy. */
2838 #define COPY_DECL_RTL(NODE1, NODE2) \
2839 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2841 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2842 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2844 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2845 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2847 struct tree_decl_with_rtl GTY(())
2849 struct tree_decl_common common;
2853 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2854 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2855 of the structure. */
2856 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2858 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2859 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2860 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2861 natural alignment of the field's type). */
2862 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2864 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2865 if so, the type that was originally specified for it.
2866 TREE_TYPE may have been modified (in finish_struct). */
2867 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2869 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2870 if nonzero, indicates that the field occupies the type. */
2871 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2873 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2874 DECL_FIELD_OFFSET which are known to be always zero.
2875 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2877 #define DECL_OFFSET_ALIGN(NODE) \
2878 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2880 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2881 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2882 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2883 /* 1 if the alignment for this type was requested by "aligned" attribute,
2884 0 if it is the default for this type. */
2886 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2887 which this FIELD_DECL is defined. This information is needed when
2888 writing debugging information about vfield and vbase decls for C++. */
2889 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2891 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2892 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2894 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2896 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2898 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2900 #define DECL_NONADDRESSABLE_P(NODE) \
2901 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2903 struct tree_field_decl GTY(())
2905 struct tree_decl_common common;
2908 tree bit_field_type;
2915 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2916 dense, unique within any one function, and may be used to index arrays.
2917 If the value is -1, then no UID has been assigned. */
2918 #define LABEL_DECL_UID(NODE) \
2919 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2921 /* In LABEL_DECL nodes, nonzero means that an error message about
2922 jumping into such a binding contour has been printed for this label. */
2923 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2925 struct tree_label_decl GTY(())
2927 struct tree_decl_with_rtl common;
2930 struct tree_result_decl GTY(())
2932 struct tree_decl_with_rtl common;
2935 struct tree_const_decl GTY(())
2937 struct tree_decl_with_rtl common;
2940 /* For a PARM_DECL, records the data type used to pass the argument,
2941 which may be different from the type seen in the program. */
2942 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2944 /* For PARM_DECL, holds an RTL for the stack slot or register
2945 where the data was actually passed. */
2946 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2948 struct tree_parm_decl GTY(())
2950 struct tree_decl_with_rtl common;
2955 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2956 this variable in a BIND_EXPR. */
2957 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2958 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2960 /* Used to indicate that the linkage status of this DECL is not yet known,
2961 so it should not be output now. */
2962 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2964 /* Nonzero for a given ..._DECL node means that no warnings should be
2965 generated just because this node is unused. */
2966 #define DECL_IN_SYSTEM_HEADER(NODE) \
2967 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2969 /* Used to indicate that this DECL has weak linkage. */
2970 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2972 /* Internal to the gimplifier. Indicates that the value is a formal
2973 temporary controlled by the gimplifier. */
2974 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2975 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2977 /* Used to indicate that the DECL is a dllimport. */
2978 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2980 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2981 based on a variable with a restrict qualified type. If it is,
2982 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2985 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2986 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2987 #define DECL_GET_RESTRICT_BASE(NODE) \
2988 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2989 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2990 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2992 extern tree decl_restrict_base_lookup (tree);
2993 extern void decl_restrict_base_insert (tree, tree);
2995 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2996 not be put out unless it is needed in this translation unit.
2997 Entities like this are shared across translation units (like weak
2998 entities), but are guaranteed to be generated by any translation
2999 unit that needs them, and therefore need not be put out anywhere
3000 where they are not needed. DECL_COMDAT is just a hint to the
3001 back-end; it is up to front-ends which set this flag to ensure
3002 that there will never be any harm, other than bloat, in putting out
3003 something which is DECL_COMDAT. */
3004 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3006 /* A replaceable function is one which may be replaced at link-time
3007 with an entirely different definition, provided that the
3008 replacement has the same type. For example, functions declared
3009 with __attribute__((weak)) on most systems are replaceable.
3011 COMDAT functions are not replaceable, since all definitions of the
3012 function must be equivalent. It is important that COMDAT functions
3013 not be treated as replaceable so that use of C++ template
3014 instantiations is not penalized.
3016 For example, DECL_REPLACEABLE is used to determine whether or not a
3017 function (including a template instantiation) which is not
3018 explicitly declared "inline" can be inlined. If the function is
3019 DECL_REPLACEABLE then it is not safe to do the inlining, since the
3020 implementation chosen at link-time may be different. However, a
3021 function that is not DECL_REPLACEABLE can be inlined, since all
3022 versions of the function will be functionally identical. */
3023 #define DECL_REPLACEABLE_P(NODE) \
3024 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
3026 /* The name of the object as the assembler will see it (but before any
3027 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3028 as DECL_NAME. It is an IDENTIFIER_NODE. */
3029 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3031 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3032 This is true of all DECL nodes except FIELD_DECL. */
3033 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3034 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3036 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3037 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3039 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3040 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3042 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3043 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3044 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3046 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3047 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3048 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3049 semantics of using this macro, are different than saying:
3051 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3053 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3055 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3056 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3057 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3058 DECL_ASSEMBLER_NAME (DECL1)) \
3061 /* Records the section name in a section attribute. Used to pass
3062 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3063 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3065 /* Value of the decls's visibility attribute */
3066 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3068 /* Nonzero means that the decl had its visibility specified rather than
3070 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3072 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3073 multiple translation units should be merged. */
3074 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
3076 struct tree_decl_with_vis GTY(())
3078 struct tree_decl_with_rtl common;
3079 tree assembler_name;
3082 /* Belong to VAR_DECL exclusively. */
3083 unsigned defer_output:1;
3084 unsigned hard_register:1;
3085 unsigned thread_local:1;
3086 unsigned common_flag:1;
3087 unsigned in_text_section : 1;
3088 unsigned gimple_formal_temp : 1;
3089 unsigned dllimport_flag : 1;
3090 unsigned based_on_restrict_p : 1;
3091 /* Used by C++. Might become a generic decl flag. */
3092 unsigned shadowed_for_var_p : 1;
3094 /* Don't belong to VAR_DECL exclusively. */
3095 unsigned in_system_header_flag : 1;
3096 unsigned weak_flag:1;
3097 unsigned seen_in_bind_expr : 1;
3098 unsigned comdat_flag : 1;
3099 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3100 unsigned visibility_specified : 1;
3101 /* Belong to FUNCTION_DECL exclusively. */
3102 unsigned one_only : 1;
3103 unsigned init_priority_p:1;
3105 /* Belongs to VAR_DECL exclusively. */
3106 ENUM_BITFIELD(tls_model) tls_model : 3;
3107 /* 11 unused bits. */
3110 /* In a VAR_DECL that's static,
3111 nonzero if the space is in the text section. */
3112 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3114 /* Nonzero for a given ..._DECL node means that this node should be
3115 put in .common, if possible. If a DECL_INITIAL is given, and it
3116 is not error_mark_node, then the decl cannot be put in .common. */
3117 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3119 /* In a VAR_DECL, nonzero if the decl is a register variable with
3120 an explicit asm specification. */
3121 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3123 extern tree decl_debug_expr_lookup (tree);
3124 extern void decl_debug_expr_insert (tree, tree);
3125 /* For VAR_DECL, this is set to either an expression that it was split
3126 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3127 subexpressions that it was split into. */
3128 #define DECL_DEBUG_EXPR(NODE) \
3129 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3131 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3132 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3134 /* An initializationp priority. */
3135 typedef unsigned short priority_type;
3137 extern priority_type decl_init_priority_lookup (tree);
3138 extern priority_type decl_fini_priority_lookup (tree);
3139 extern void decl_init_priority_insert (tree, priority_type);
3140 extern void decl_fini_priority_insert (tree, priority_type);
3142 /* In a non-local VAR_DECL with static storage duration, true if the
3143 variable has an initialization priority. If false, the variable
3144 will be initialized at the DEFAULT_INIT_PRIORITY. */
3145 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3146 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3148 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3150 #define DECL_INIT_PRIORITY(NODE) \
3151 (decl_init_priority_lookup (NODE))
3152 /* Set the initialization priority for NODE to VAL. */
3153 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3154 (decl_init_priority_insert (NODE, VAL))
3156 /* For a FUNCTION_DECL the finalization priority of NODE. */
3157 #define DECL_FINI_PRIORITY(NODE) \
3158 (decl_fini_priority_lookup (NODE))
3159 /* Set the finalization priority for NODE to VAL. */
3160 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3161 (decl_fini_priority_insert (NODE, VAL))
3163 /* The initialization priority for entities for which no explicit
3164 initialization priority has been specified. */
3165 #define DEFAULT_INIT_PRIORITY 65535
3167 /* The maximum allowed initialization priority. */
3168 #define MAX_INIT_PRIORITY 65535
3170 /* The largest priority value reserved for use by system runtime
3172 #define MAX_RESERVED_INIT_PRIORITY 100
3174 /* In a VAR_DECL, the model to use if the data should be allocated from
3175 thread-local storage. */
3176 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3178 /* In a VAR_DECL, nonzero if the data should be allocated from
3179 thread-local storage. */
3180 #define DECL_THREAD_LOCAL_P(NODE) \
3181 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
3183 struct tree_var_decl GTY(())
3185 struct tree_decl_with_vis common;
3189 /* This field is used to reference anything in decl.result and is meant only
3190 for use by the garbage collector. */
3191 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3193 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3194 Before the struct containing the FUNCTION_DECL is laid out,
3195 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3196 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3197 function. When the class is laid out, this pointer is changed
3198 to an INTEGER_CST node which is suitable for use as an index
3199 into the virtual function table.
3200 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3201 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3203 struct tree_decl_non_common GTY(())
3206 struct tree_decl_with_vis common;
3207 /* C++ uses this in namespaces. */
3209 /* C++ uses this in templates. */
3211 /* Almost all FE's use this. */
3213 /* C++ uses this in namespaces. */
3217 /* In FUNCTION_DECL, holds the decl for the return value. */
3218 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3220 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3221 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3223 /* In a FUNCTION_DECL, the saved representation of the body of the
3225 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3227 /* Nonzero in a FUNCTION_DECL means this function should be treated
3228 as if it were a malloc, meaning it returns a pointer that is
3230 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3232 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3233 C++ operator new, meaning that it returns a pointer for which we
3234 should not use type based aliasing. */
3235 #define DECL_IS_OPERATOR_NEW(NODE) \
3236 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3238 /* Nonzero in a FUNCTION_DECL means this function may return more
3240 #define DECL_IS_RETURNS_TWICE(NODE) \
3241 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3243 /* Nonzero in a FUNCTION_DECL means this function should be treated
3244 as "pure" function (like const function, but may read global memory). */
3245 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3247 /* Nonzero in a FUNCTION_DECL means this function should be treated
3248 as "novops" function (function that does not read global memory,
3249 but may have arbitrary side effects). */
3250 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3252 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3253 at the beginning or end of execution. */
3254 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3255 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3257 #define DECL_STATIC_DESTRUCTOR(NODE) \
3258 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3260 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3261 be instrumented with calls to support routines. */
3262 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3263 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3265 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3266 disabled in this function. */
3267 #define DECL_NO_LIMIT_STACK(NODE) \
3268 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3270 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3271 static chain is not needed. */
3272 #define DECL_NO_STATIC_CHAIN(NODE) \
3273 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3275 /* Nonzero for a decl that cgraph has decided should be inlined into
3276 at least one call site. It is not meaningful to look at this
3277 directly; always use cgraph_function_possibly_inlined_p. */
3278 #define DECL_POSSIBLY_INLINED(DECL) \
3279 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3281 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3282 where it is called. */
3283 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3285 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3286 such as via the `inline' keyword in C/C++. This flag controls the linkage
3287 semantics of 'inline'; whether or not the function is inlined is
3288 controlled by DECL_INLINE. */
3289 #define DECL_DECLARED_INLINE_P(NODE) \
3290 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3292 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3293 disregarding size and cost heuristics. This is equivalent to using
3294 the always_inline attribute without the required diagnostics if the
3295 function cannot be inlined. */
3296 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3297 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3299 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3300 that describes the status of this function. */
3301 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3303 /* In a FUNCTION_DECL, nonzero means a built in function. */
3304 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3306 /* For a builtin function, identify which part of the compiler defined it. */
3307 #define DECL_BUILT_IN_CLASS(NODE) \
3308 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3310 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3311 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3313 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3314 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3316 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3317 arguments/result/saved_tree fields by front ends. It was either inherit
3318 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3319 which seemed a bit strange. */
3321 struct tree_function_decl GTY(())
3323 struct tree_decl_non_common common;
3327 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3328 DECL_FUNCTION_CODE. Otherwise unused.
3329 ??? The bitfield needs to be able to hold all target function
3331 ENUM_BITFIELD(built_in_function) function_code : 11;
3332 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3334 unsigned static_ctor_flag : 1;
3335 unsigned static_dtor_flag : 1;
3336 unsigned uninlinable : 1;
3338 unsigned possibly_inlined : 1;
3339 unsigned novops_flag : 1;
3340 unsigned returns_twice_flag : 1;
3341 unsigned malloc_flag : 1;
3342 unsigned operator_new_flag : 1;
3343 unsigned pure_flag : 1;
3344 unsigned declared_inline_flag : 1;
3345 unsigned regdecl_flag : 1;
3347 unsigned inline_flag : 1;
3348 unsigned no_instrument_function_entry_exit : 1;
3349 unsigned no_limit_stack : 1;
3350 unsigned disregard_inline_limits : 1;
3355 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3356 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3358 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3359 into stabs. Instead it will generate cross reference ('x') of names.
3360 This uses the same flag as DECL_EXTERNAL. */
3361 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3362 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3364 struct tree_type_decl GTY(())
3366 struct tree_decl_non_common common;
3370 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3371 To reduce overhead, the nodes containing the statements are not trees.
3372 This avoids the overhead of tree_common on all linked list elements.
3374 Use the interface in tree-iterator.h to access this node. */
3376 #define STATEMENT_LIST_HEAD(NODE) \
3377 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3378 #define STATEMENT_LIST_TAIL(NODE) \
3379 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3381 struct tree_statement_list_node
3382 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3384 struct tree_statement_list_node *prev;
3385 struct tree_statement_list_node *next;
3389 struct tree_statement_list
3392 struct tree_common common;
3393 struct tree_statement_list_node *head;
3394 struct tree_statement_list_node *tail;
3397 #define VALUE_HANDLE_ID(NODE) \
3398 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3400 #define VALUE_HANDLE_EXPR_SET(NODE) \
3401 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3403 /* Defined and used in tree-ssa-pre.c. */
3405 struct tree_value_handle GTY(())
3407 struct tree_common common;
3409 /* The set of expressions represented by this handle. */
3410 struct bitmap_set * GTY ((skip)) expr_set;
3412 /* Unique ID for this value handle. IDs are handed out in a
3413 conveniently dense form starting at 0, so that we can make
3414 bitmaps of value handles. */
3418 /* Define the overall contents of a tree node.
3419 It may be any of the structures declared above
3420 for various types of node. */
3422 union tree_node GTY ((ptr_alias (union lang_tree_node),
3423 desc ("tree_node_structure (&%h)")))
3425 struct tree_base GTY ((tag ("TS_BASE"))) base;
3426 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3427 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3428 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3429 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3430 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3431 struct tree_string GTY ((tag ("TS_STRING"))) string;
3432 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3433 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3434 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3435 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3436 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3437 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3438 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3439 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3440 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3441 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3442 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3443 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3444 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3445 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3446 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3447 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3448 struct tree_list GTY ((tag ("TS_LIST"))) list;
3449 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3450 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3451 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3452 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3453 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3454 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3455 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3456 struct gimple_stmt GTY ((tag ("TS_GIMPLE_STATEMENT"))) gstmt;
3457 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3458 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3459 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3460 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3461 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3462 struct tree_memory_partition_tag GTY ((tag ("TS_MEMORY_PARTITION_TAG"))) mpt;
3465 /* Standard named or nameless data types of the C compiler. */
3487 TI_INTEGER_MINUS_ONE,
3504 TI_COMPLEX_INTEGER_TYPE,
3505 TI_COMPLEX_FLOAT_TYPE,
3506 TI_COMPLEX_DOUBLE_TYPE,
3507 TI_COMPLEX_LONG_DOUBLE_TYPE,
3511 TI_LONG_DOUBLE_TYPE,
3515 TI_LONG_DOUBLE_PTR_TYPE,
3516 TI_INTEGER_PTR_TYPE,
3525 TI_VA_LIST_GPR_COUNTER_FIELD,
3526 TI_VA_LIST_FPR_COUNTER_FIELD,
3533 TI_DFLOAT32_PTR_TYPE,
3534 TI_DFLOAT64_PTR_TYPE,
3535 TI_DFLOAT128_PTR_TYPE,
3544 TI_SAT_LLFRACT_TYPE,
3545 TI_SAT_USFRACT_TYPE,
3547 TI_SAT_ULFRACT_TYPE,
3548 TI_SAT_ULLFRACT_TYPE,
3560 TI_SAT_LLACCUM_TYPE,
3561 TI_SAT_USACCUM_TYPE,
3563 TI_SAT_ULACCUM_TYPE,
3564 TI_SAT_ULLACCUM_TYPE,
3613 extern GTY(()) tree global_trees[TI_MAX];
3615 #define error_mark_node global_trees[TI_ERROR_MARK]
3617 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3618 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3619 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3620 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3621 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3623 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3624 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3625 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3626 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3627 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3629 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3630 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3632 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3633 #define integer_one_node global_trees[TI_INTEGER_ONE]
3634 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3635 #define size_zero_node global_trees[TI_SIZE_ZERO]
3636 #define size_one_node global_trees[TI_SIZE_ONE]
3637 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3638 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3639 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3641 /* Base access nodes. */
3642 #define access_public_node global_trees[TI_PUBLIC]
3643 #define access_protected_node global_trees[TI_PROTECTED]
3644 #define access_private_node global_trees[TI_PRIVATE]
3646 #define null_pointer_node global_trees[TI_NULL_POINTER]
3648 #define float_type_node global_trees[TI_FLOAT_TYPE]
3649 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3650 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3652 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3653 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3654 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3655 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3657 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3658 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3659 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3660 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3662 #define void_type_node global_trees[TI_VOID_TYPE]
3663 /* The C type `void *'. */
3664 #define ptr_type_node global_trees[TI_PTR_TYPE]
3665 /* The C type `const void *'. */
3666 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3667 /* The C type `size_t'. */
3668 #define size_type_node global_trees[TI_SIZE_TYPE]
3669 #define pid_type_node global_trees[TI_PID_TYPE]
3670 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3671 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3672 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3673 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3674 /* The C type `FILE *'. */
3675 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3677 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3678 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3679 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3681 /* The decimal floating point types. */
3682 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3683 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3684 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3685 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3686 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3687 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3689 /* The fixed-point types. */
3690 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3691 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3692 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3693 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3694 #define sat_unsigned_short_fract_type_node \
3695 global_trees[TI_SAT_USFRACT_TYPE]
3696 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3697 #define sat_unsigned_long_fract_type_node \
3698 global_trees[TI_SAT_ULFRACT_TYPE]
3699 #define sat_unsigned_long_long_fract_type_node \
3700 global_trees[TI_SAT_ULLFRACT_TYPE]
3701 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3702 #define fract_type_node global_trees[TI_FRACT_TYPE]
3703 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3704 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3705 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3706 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3707 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3708 #define unsigned_long_long_fract_type_node \
3709 global_trees[TI_ULLFRACT_TYPE]
3710 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3711 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3712 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3713 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3714 #define sat_unsigned_short_accum_type_node \
3715 global_trees[TI_SAT_USACCUM_TYPE]
3716 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3717 #define sat_unsigned_long_accum_type_node \
3718 global_trees[TI_SAT_ULACCUM_TYPE]
3719 #define sat_unsigned_long_long_accum_type_node \
3720 global_trees[TI_SAT_ULLACCUM_TYPE]
3721 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3722 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3723 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3724 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3725 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3726 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3727 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3728 #define unsigned_long_long_accum_type_node \
3729 global_trees[TI_ULLACCUM_TYPE]
3730 #define qq_type_node global_trees[TI_QQ_TYPE]
3731 #define hq_type_node global_trees[TI_HQ_TYPE]
3732 #define sq_type_node global_trees[TI_SQ_TYPE]
3733 #define dq_type_node global_trees[TI_DQ_TYPE]
3734 #define tq_type_node global_trees[TI_TQ_TYPE]
3735 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3736 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3737 #define usq_type_node global_trees[TI_USQ_TYPE]
3738 #define udq_type_node global_trees[TI_UDQ_TYPE]
3739 #define utq_type_node global_trees[TI_UTQ_TYPE]
3740 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3741 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3742 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3743 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3744 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3745 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3746 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3747 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3748 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3749 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3750 #define ha_type_node global_trees[TI_HA_TYPE]
3751 #define sa_type_node global_trees[TI_SA_TYPE]
3752 #define da_type_node global_trees[TI_DA_TYPE]
3753 #define ta_type_node global_trees[TI_TA_TYPE]
3754 #define uha_type_node global_trees[TI_UHA_TYPE]
3755 #define usa_type_node global_trees[TI_USA_TYPE]
3756 #define uda_type_node global_trees[TI_UDA_TYPE]
3757 #define uta_type_node global_trees[TI_UTA_TYPE]
3758 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3759 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3760 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3761 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3762 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3763 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3764 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3765 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3767 /* The node that should be placed at the end of a parameter list to
3768 indicate that the function does not take a variable number of
3769 arguments. The TREE_VALUE will be void_type_node and there will be
3770 no TREE_CHAIN. Language-independent code should not assume
3771 anything else about this node. */
3772 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3774 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3775 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3777 /* An enumeration of the standard C integer types. These must be
3778 ordered so that shorter types appear before longer ones, and so
3779 that signed types appear before unsigned ones, for the correct
3780 functioning of interpret_integer() in c-lex.c. */
3781 enum integer_type_kind
3793 itk_unsigned_long_long,
3797 typedef enum integer_type_kind integer_type_kind;
3799 /* The standard C integer types. Use integer_type_kind to index into
3801 extern GTY(()) tree integer_types[itk_none];
3803 #define char_type_node integer_types[itk_char]
3804 #define signed_char_type_node integer_types[itk_signed_char]
3805 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3806 #define short_integer_type_node integer_types[itk_short]
3807 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3808 #define integer_type_node integer_types[itk_int]
3809 #define unsigned_type_node integer_types[itk_unsigned_int]
3810 #define long_integer_type_node integer_types[itk_long]
3811 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3812 #define long_long_integer_type_node integer_types[itk_long_long]
3813 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3815 /* Set to the default thread-local storage (tls) model to use. */
3817 extern enum tls_model flag_tls_default;
3820 /* A pointer-to-function member type looks like:
3827 If __pfn is NULL, it is a NULL pointer-to-member-function.
3829 (Because the vtable is always the first thing in the object, we
3830 don't need its offset.) If the function is virtual, then PFN is
3831 one plus twice the index into the vtable; otherwise, it is just a
3832 pointer to the function.
3834 Unfortunately, using the lowest bit of PFN doesn't work in
3835 architectures that don't impose alignment requirements on function
3836 addresses, or that use the lowest bit to tell one ISA from another,
3837 for example. For such architectures, we use the lowest bit of
3838 DELTA instead of the lowest bit of the PFN, and DELTA will be
3841 enum ptrmemfunc_vbit_where_t
3843 ptrmemfunc_vbit_in_pfn,
3844 ptrmemfunc_vbit_in_delta
3847 #define NULL_TREE (tree) NULL
3849 extern tree decl_assembler_name (tree);
3850 extern bool decl_assembler_name_equal (tree decl, tree asmname);
3852 /* Compute the number of bytes occupied by 'node'. This routine only
3853 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3855 extern size_t tree_size (const_tree);
3857 /* Compute the number of bytes occupied by a tree with code CODE. This
3858 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3860 extern size_t tree_code_size (enum tree_code);
3862 /* Lowest level primitive for allocating a node.
3863 The TREE_CODE is the only argument. Contents are initialized
3864 to zero except for a few of the common fields. */
3866 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3867 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3869 /* Make a copy of a node, with all the same contents. */
3871 extern tree copy_node_stat (tree MEM_STAT_DECL);
3872 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3874 /* Make a copy of a chain of TREE_LIST nodes. */
3876 extern tree copy_list (tree);
3879 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3880 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3882 /* Make a TREE_VEC. */
3884 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3885 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3887 /* Tree nodes for SSA analysis. */
3889 extern void init_phinodes (void);
3890 extern void fini_phinodes (void);
3891 extern void release_phi_node (tree);
3892 #ifdef GATHER_STATISTICS
3893 extern void phinodes_print_statistics (void);
3896 extern void init_ssanames (void);
3897 extern void fini_ssanames (void);
3898 extern tree make_ssa_name (tree, tree);
3899 extern tree duplicate_ssa_name (tree, tree);
3900 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3901 extern void release_ssa_name (tree);
3902 extern void release_defs (tree);
3903 extern void replace_ssa_name_symbol (tree, tree);
3905 #ifdef GATHER_STATISTICS
3906 extern void ssanames_print_statistics (void);
3909 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3910 The name is supplied as a char *. */
3912 extern tree get_identifier (const char *);
3914 #if GCC_VERSION >= 3000
3915 #define get_identifier(str) \
3916 (__builtin_constant_p (str) \
3917 ? get_identifier_with_length ((str), strlen (str)) \
3918 : get_identifier (str))
3922 /* Identical to get_identifier, except that the length is assumed
3925 extern tree get_identifier_with_length (const char *, size_t);
3927 /* If an identifier with the name TEXT (a null-terminated string) has
3928 previously been referred to, return that node; otherwise return
3931 extern tree maybe_get_identifier (const char *);
3933 /* Construct various types of nodes. */
3935 extern tree build_nt (enum tree_code, ...);
3936 extern tree build_nt_call_list (tree, tree);
3938 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3939 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3940 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3941 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3942 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3943 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3944 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3945 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3946 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3947 tree MEM_STAT_DECL);
3948 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3949 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3950 tree MEM_STAT_DECL);
3951 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3952 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3953 tree, tree, tree MEM_STAT_DECL);
3954 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3955 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3957 extern tree build_gimple_modify_stmt_stat (tree, tree MEM_STAT_DECL);
3958 #define build_gimple_modify_stmt(t1,t2) \
3959 build_gimple_modify_stmt_stat (t1,t2 MEM_STAT_INFO)
3961 extern tree build_int_cst (tree, HOST_WIDE_INT);
3962 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3963 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3964 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3965 extern tree build_int_cst_wide_type (tree,
3966 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3967 extern tree build_vector (tree, tree);
3968 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3969 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3970 extern tree build_constructor_single (tree, tree, tree);
3971 extern tree build_constructor_from_list (tree, tree);
3972 extern tree build_real_from_int_cst (tree, const_tree);
3973 extern tree build_complex (tree, tree, tree);
3974 extern tree build_one_cst (tree);
3975 extern tree build_string (int, const char *);
3976 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3977 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3978 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3979 extern tree build_fn_decl (const char *, tree);
3980 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3981 extern tree build_block (tree, tree, tree, tree);
3982 extern tree build_empty_stmt (void);
3983 extern tree build_omp_clause (enum omp_clause_code);
3985 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3986 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3988 extern tree build_call_list (tree, tree, tree);
3989 extern tree build_call_nary (tree, tree, int, ...);
3990 extern tree build_call_valist (tree, tree, int, va_list);
3991 extern tree build_call_array (tree, tree, int, tree*);
3993 /* Construct various nodes representing data types. */
3995 extern tree make_signed_type (int);
3996 extern tree make_unsigned_type (int);
3997 extern tree signed_or_unsigned_type_for (int, tree);
3998 extern tree signed_type_for (tree);
3999 extern tree unsigned_type_for (tree);
4000 extern void initialize_sizetypes (bool);
4001 extern void set_sizetype (tree);
4002 extern void fixup_unsigned_type (tree);
4003 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
4004 extern tree build_pointer_type (tree);
4005 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
4006 extern tree build_reference_type (tree);
4007 extern tree build_vector_type_for_mode (tree, enum machine_mode);
4008 extern tree build_vector_type (tree innertype, int nunits);
4009 extern tree build_type_no_quals (tree);
4010 extern tree build_index_type (tree);
4011 extern tree build_index_2_type (tree, tree);
4012 extern tree build_array_type (tree, tree);
4013 extern tree build_function_type (tree, tree);
4014 extern tree build_function_type_list (tree, ...);
4015 extern tree build_method_type_directly (tree, tree, tree);
4016 extern tree build_method_type (tree, tree);
4017 extern tree build_offset_type (tree, tree);
4018 extern tree build_complex_type (tree);
4019 extern tree build_resx (int);
4020 extern tree array_type_nelts (const_tree);
4021 extern bool in_array_bounds_p (tree);
4022 extern bool range_in_array_bounds_p (tree);
4024 extern tree value_member (tree, tree);
4025 extern tree purpose_member (const_tree, tree);
4027 extern int attribute_list_equal (const_tree, const_tree);
4028 extern int attribute_list_contained (const_tree, const_tree);
4029 extern int tree_int_cst_equal (const_tree, const_tree);
4030 extern int tree_int_cst_lt (const_tree, const_tree);
4031 extern int tree_int_cst_compare (const_tree, const_tree);
4032 extern int host_integerp (const_tree, int);
4033 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
4034 extern int tree_int_cst_msb (const_tree);
4035 extern int tree_int_cst_sgn (const_tree);
4036 extern int tree_int_cst_sign_bit (const_tree);
4037 extern bool tree_expr_nonnegative_p (tree);
4038 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
4039 extern bool may_negate_without_overflow_p (const_tree);
4040 extern tree get_inner_array_type (const_tree);
4042 /* Construct various nodes representing fract or accum data types. */
4044 extern tree make_fract_type (int, int, int);
4045 extern tree make_accum_type (int, int, int);
4047 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4048 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4049 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4050 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4051 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4052 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4053 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4054 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4056 #define make_or_reuse_signed_fract_type(P) \
4057 make_or_reuse_fract_type (P, 0, 0)
4058 #define make_or_reuse_unsigned_fract_type(P) \
4059 make_or_reuse_fract_type (P, 1, 0)
4060 #define make_or_reuse_sat_signed_fract_type(P) \
4061 make_or_reuse_fract_type (P, 0, 1)
4062 #define make_or_reuse_sat_unsigned_fract_type(P) \
4063 make_or_reuse_fract_type (P, 1, 1)
4064 #define make_or_reuse_signed_accum_type(P) \
4065 make_or_reuse_accum_type (P, 0, 0)
4066 #define make_or_reuse_unsigned_accum_type(P) \
4067 make_or_reuse_accum_type (P, 1, 0)
4068 #define make_or_reuse_sat_signed_accum_type(P) \
4069 make_or_reuse_accum_type (P, 0, 1)
4070 #define make_or_reuse_sat_unsigned_accum_type(P) \
4071 make_or_reuse_accum_type (P, 1, 1)
4073 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4074 put the prototype here. Rtl.h does declare the prototype if
4075 tree.h had been included. */
4077 extern tree make_tree (tree, rtx);
4079 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4082 Such modified types already made are recorded so that duplicates
4085 extern tree build_type_attribute_variant (tree, tree);
4086 extern tree build_decl_attribute_variant (tree, tree);
4088 /* Structure describing an attribute and a function to handle it. */
4089 struct attribute_spec
4091 /* The name of the attribute (without any leading or trailing __),
4092 or NULL to mark the end of a table of attributes. */
4093 const char *const name;
4094 /* The minimum length of the list of arguments of the attribute. */
4095 const int min_length;
4096 /* The maximum length of the list of arguments of the attribute
4097 (-1 for no maximum). */
4098 const int max_length;
4099 /* Whether this attribute requires a DECL. If it does, it will be passed
4100 from types of DECLs, function return types and array element types to
4101 the DECLs, function types and array types respectively; but when
4102 applied to a type in any other circumstances, it will be ignored with
4103 a warning. (If greater control is desired for a given attribute,
4104 this should be false, and the flags argument to the handler may be
4105 used to gain greater control in that case.) */
4106 const bool decl_required;
4107 /* Whether this attribute requires a type. If it does, it will be passed
4108 from a DECL to the type of that DECL. */
4109 const bool type_required;
4110 /* Whether this attribute requires a function (or method) type. If it does,
4111 it will be passed from a function pointer type to the target type,
4112 and from a function return type (which is not itself a function
4113 pointer type) to the function type. */
4114 const bool function_type_required;
4115 /* Function to handle this attribute. NODE points to the node to which
4116 the attribute is to be applied. If a DECL, it should be modified in
4117 place; if a TYPE, a copy should be created. NAME is the name of the
4118 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4119 of the arguments (which may be NULL). FLAGS gives further information
4120 about the context of the attribute. Afterwards, the attributes will
4121 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4122 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4123 as well as in any other cases when the attributes should not be added
4124 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4125 applied to another type or DECL later may be returned;
4126 otherwise the return value should be NULL_TREE. This pointer may be
4127 NULL if no special handling is required beyond the checks implied
4128 by the rest of this structure. */
4129 tree (*const handler) (tree *node, tree name, tree args,
4130 int flags, bool *no_add_attrs);
4133 /* Flags that may be passed in the third argument of decl_attributes, and
4134 to handler functions for attributes. */
4135 enum attribute_flags
4137 /* The type passed in is the type of a DECL, and any attributes that
4138 should be passed in again to be applied to the DECL rather than the
4139 type should be returned. */
4140 ATTR_FLAG_DECL_NEXT = 1,
4141 /* The type passed in is a function return type, and any attributes that
4142 should be passed in again to be applied to the function type rather
4143 than the return type should be returned. */
4144 ATTR_FLAG_FUNCTION_NEXT = 2,
4145 /* The type passed in is an array element type, and any attributes that
4146 should be passed in again to be applied to the array type rather
4147 than the element type should be returned. */
4148 ATTR_FLAG_ARRAY_NEXT = 4,
4149 /* The type passed in is a structure, union or enumeration type being
4150 created, and should be modified in place. */
4151 ATTR_FLAG_TYPE_IN_PLACE = 8,
4152 /* The attributes are being applied by default to a library function whose
4153 name indicates known behavior, and should be silently ignored if they
4154 are not in fact compatible with the function type. */
4155 ATTR_FLAG_BUILT_IN = 16
4158 /* Default versions of target-overridable functions. */
4160 extern tree merge_decl_attributes (tree, tree);
4161 extern tree merge_type_attributes (tree, tree);
4163 /* Given a tree node and a string, return nonzero if the tree node is
4164 a valid attribute name for the string. */
4166 extern int is_attribute_p (const char *, const_tree);
4168 /* Given an attribute name and a list of attributes, return the list element
4169 of the attribute or NULL_TREE if not found. */
4171 extern tree lookup_attribute (const char *, tree);
4173 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4176 extern tree remove_attribute (const char *, tree);
4178 /* Given two attributes lists, return a list of their union. */
4180 extern tree merge_attributes (tree, tree);
4182 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4183 /* Given two Windows decl attributes lists, possibly including
4184 dllimport, return a list of their union . */
4185 extern tree merge_dllimport_decl_attributes (tree, tree);
4187 /* Handle a "dllimport" or "dllexport" attribute. */
4188 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4191 /* Check whether CAND is suitable to be returned from get_qualified_type
4192 (BASE, TYPE_QUALS). */
4194 extern bool check_qualified_type (const_tree, const_tree, int);
4196 /* Return a version of the TYPE, qualified as indicated by the
4197 TYPE_QUALS, if one exists. If no qualified version exists yet,
4198 return NULL_TREE. */
4200 extern tree get_qualified_type (tree, int);
4202 /* Like get_qualified_type, but creates the type if it does not
4203 exist. This function never returns NULL_TREE. */
4205 extern tree build_qualified_type (tree, int);
4207 /* Like build_qualified_type, but only deals with the `const' and
4208 `volatile' qualifiers. This interface is retained for backwards
4209 compatibility with the various front-ends; new code should use
4210 build_qualified_type instead. */
4212 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4213 build_qualified_type ((TYPE), \
4214 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4215 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4217 /* Make a copy of a type node. */
4219 extern tree build_distinct_type_copy (tree);
4220 extern tree build_variant_type_copy (tree);
4222 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4223 fields. Optionally specify an alignment, and then lay it out. */
4225 extern void finish_builtin_struct (tree, const char *,
4228 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4229 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4230 node, does nothing except for the first time. */
4232 extern void layout_type (tree);
4234 /* These functions allow a front-end to perform a manual layout of a
4235 RECORD_TYPE. (For instance, if the placement of subsequent fields
4236 depends on the placement of fields so far.) Begin by calling
4237 start_record_layout. Then, call place_field for each of the
4238 fields. Then, call finish_record_layout. See layout_type for the
4239 default way in which these functions are used. */
4241 typedef struct record_layout_info_s
4243 /* The RECORD_TYPE that we are laying out. */
4245 /* The offset into the record so far, in bytes, not including bits in
4248 /* The last known alignment of SIZE. */
4249 unsigned int offset_align;
4250 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4252 /* The alignment of the record so far, in bits. */
4253 unsigned int record_align;
4254 /* The alignment of the record so far, ignoring #pragma pack and
4255 __attribute__ ((packed)), in bits. */
4256 unsigned int unpacked_align;
4257 /* The previous field layed out. */
4259 /* The static variables (i.e., class variables, as opposed to
4260 instance variables) encountered in T. */
4261 tree pending_statics;
4262 /* Bits remaining in the current alignment group */
4263 int remaining_in_alignment;
4264 /* True if we've seen a packed field that didn't have normal
4265 alignment anyway. */
4266 int packed_maybe_necessary;
4267 } *record_layout_info;
4269 extern record_layout_info start_record_layout (tree);
4270 extern tree bit_from_pos (tree, tree);
4271 extern tree byte_from_pos (tree, tree);
4272 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4273 extern void normalize_offset (tree *, tree *, unsigned int);
4274 extern tree rli_size_unit_so_far (record_layout_info);
4275 extern tree rli_size_so_far (record_layout_info);
4276 extern void normalize_rli (record_layout_info);
4277 extern void place_field (record_layout_info, tree);
4278 extern void compute_record_mode (tree);
4279 extern void finish_record_layout (record_layout_info, int);
4281 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4282 return a canonicalized ..._TYPE node, so that duplicates are not made.
4283 How the hash code is computed is up to the caller, as long as any two
4284 callers that could hash identical-looking type nodes agree. */
4286 extern tree type_hash_canon (unsigned int, tree);
4288 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4289 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4290 fields. Call this only once for any given decl node.
4292 Second argument is the boundary that this field can be assumed to
4293 be starting at (in bits). Zero means it can be assumed aligned
4294 on any boundary that may be needed. */
4296 extern void layout_decl (tree, unsigned);
4298 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4299 a previous call to layout_decl and calls it again. */
4301 extern void relayout_decl (tree);
4303 /* Return the mode for data of a given size SIZE and mode class CLASS.
4304 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4305 The value is BLKmode if no other mode is found. This is like
4306 mode_for_size, but is passed a tree. */
4308 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4310 /* Return an expr equal to X but certainly not valid as an lvalue. */
4312 extern tree non_lvalue (tree);
4314 extern tree convert (tree, tree);
4315 extern unsigned int expr_align (const_tree);
4316 extern tree expr_first (tree);
4317 extern tree expr_last (tree);
4318 extern tree expr_only (tree);
4319 extern tree size_in_bytes (const_tree);
4320 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4321 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4322 extern tree bit_position (const_tree);
4323 extern HOST_WIDE_INT int_bit_position (const_tree);
4324 extern tree byte_position (const_tree);
4325 extern HOST_WIDE_INT int_byte_position (const_tree);
4327 /* Define data structures, macros, and functions for handling sizes
4328 and the various types used to represent sizes. */
4332 SIZETYPE, /* Normal representation of sizes in bytes. */
4333 SSIZETYPE, /* Signed representation of sizes in bytes. */
4334 BITSIZETYPE, /* Normal representation of sizes in bits. */
4335 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4338 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4340 #define sizetype sizetype_tab[(int) SIZETYPE]
4341 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4342 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4343 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4345 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4346 extern tree size_binop (enum tree_code, tree, tree);
4347 extern tree size_diffop (tree, tree);
4349 #define size_int(L) size_int_kind (L, SIZETYPE)
4350 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4351 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4352 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4354 extern tree round_up (tree, int);
4355 extern tree round_down (tree, int);
4356 extern tree get_pending_sizes (void);
4357 extern void put_pending_size (tree);
4358 extern void put_pending_sizes (tree);
4360 /* Type for sizes of data-type. */
4362 #define BITS_PER_UNIT_LOG \
4363 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4364 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4365 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4367 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4368 extern unsigned int maximum_field_alignment;
4369 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4370 extern unsigned int initial_max_fld_align;
4372 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4373 by making the last node in X point to Y.
4374 Returns X, except if X is 0 returns Y. */
4376 extern tree chainon (tree, tree);
4378 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4380 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4381 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4383 /* Return the last tree node in a chain. */
4385 extern tree tree_last (tree);
4387 /* Reverse the order of elements in a chain, and return the new head. */
4389 extern tree nreverse (tree);
4391 /* Returns the length of a chain of nodes
4392 (number of chain pointers to follow before reaching a null pointer). */
4394 extern int list_length (const_tree);
4396 /* Returns the number of FIELD_DECLs in a type. */
4398 extern int fields_length (const_tree);
4400 /* Given an initializer INIT, return TRUE if INIT is zero or some
4401 aggregate of zeros. Otherwise return FALSE. */
4403 extern bool initializer_zerop (const_tree);
4405 /* Examine CTOR to discover:
4406 * how many scalar fields are set to nonzero values,
4407 and place it in *P_NZ_ELTS;
4408 * how many scalar fields in total are in CTOR,
4409 and place it in *P_ELT_COUNT.
4410 * if a type is a union, and the initializer from the constructor
4411 is not the largest element in the union, then set *p_must_clear.
4413 Return whether or not CTOR is a valid static constant initializer, the same
4414 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4416 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4419 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4421 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4423 extern int integer_zerop (const_tree);
4425 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4427 extern int integer_onep (const_tree);
4429 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4430 all of whose significant bits are 1. */
4432 extern int integer_all_onesp (const_tree);
4434 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4435 exactly one bit 1. */
4437 extern int integer_pow2p (const_tree);
4439 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4440 with a nonzero value. */
4442 extern int integer_nonzerop (const_tree);
4444 extern bool cst_and_fits_in_hwi (const_tree);
4445 extern tree num_ending_zeros (const_tree);
4447 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4450 extern int fixed_zerop (const_tree);
4452 /* staticp (tree x) is nonzero if X is a reference to data allocated
4453 at a fixed address in memory. Returns the outermost data. */
4455 extern tree staticp (tree);
4457 /* save_expr (EXP) returns an expression equivalent to EXP
4458 but it can be used multiple times within context CTX
4459 and only evaluate EXP once. */
4461 extern tree save_expr (tree);
4463 /* Look inside EXPR and into any simple arithmetic operations. Return
4464 the innermost non-arithmetic node. */
4466 extern tree skip_simple_arithmetic (tree);
4468 /* Return which tree structure is used by T. */
4470 enum tree_node_structure_enum tree_node_structure (const_tree);
4472 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4473 or offset that depends on a field within a record.
4475 Note that we only allow such expressions within simple arithmetic
4478 extern bool contains_placeholder_p (const_tree);
4480 /* This macro calls the above function but short-circuits the common
4481 case of a constant to save time. Also check for null. */
4483 #define CONTAINS_PLACEHOLDER_P(EXP) \
4484 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4486 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4487 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4490 extern bool type_contains_placeholder_p (tree);
4492 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4493 return a tree with all occurrences of references to F in a
4494 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4495 contains only arithmetic expressions. */
4497 extern tree substitute_in_expr (tree, tree, tree);
4499 /* This macro calls the above function but short-circuits the common
4500 case of a constant to save time and also checks for NULL. */
4502 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4503 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4505 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4506 for it within OBJ, a tree that is an object or a chain of references. */
4508 extern tree substitute_placeholder_in_expr (tree, tree);
4510 /* This macro calls the above function but short-circuits the common
4511 case of a constant to save time and also checks for NULL. */
4513 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4514 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4515 : substitute_placeholder_in_expr (EXP, OBJ))
4517 /* variable_size (EXP) is like save_expr (EXP) except that it
4518 is for the special case of something that is part of a
4519 variable size for a data type. It makes special arrangements
4520 to compute the value at the right time when the data type
4521 belongs to a function parameter. */
4523 extern tree variable_size (tree);
4525 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4526 but it can be used multiple times
4527 and only evaluate the subexpressions once. */
4529 extern tree stabilize_reference (tree);
4531 /* Subroutine of stabilize_reference; this is called for subtrees of
4532 references. Any expression with side-effects must be put in a SAVE_EXPR
4533 to ensure that it is only evaluated once. */
4535 extern tree stabilize_reference_1 (tree);
4537 /* Return EXP, stripped of any conversions to wider types
4538 in such a way that the result of converting to type FOR_TYPE
4539 is the same as if EXP were converted to FOR_TYPE.
4540 If FOR_TYPE is 0, it signifies EXP's type. */
4542 extern tree get_unwidened (tree, tree);
4544 /* Return OP or a simpler expression for a narrower value
4545 which can be sign-extended or zero-extended to give back OP.
4546 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4547 or 0 if the value should be sign-extended. */
4549 extern tree get_narrower (tree, int *);
4551 /* Return true if T is an expression that get_inner_reference handles. */
4553 extern int handled_component_p (const_tree);
4555 /* Given an expression EXP that is a handled_component_p,
4556 look for the ultimate containing object, which is returned and specify
4557 the access position and size. */
4559 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4560 tree *, enum machine_mode *, int *, int *,
4563 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4564 look for whether EXP or any nested component-refs within EXP is marked
4567 extern bool contains_packed_reference (const_tree exp);
4569 /* Return a tree of sizetype representing the size, in bytes, of the element
4570 of EXP, an ARRAY_REF. */
4572 extern tree array_ref_element_size (tree);
4574 /* Return a tree representing the lower bound of the array mentioned in
4575 EXP, an ARRAY_REF. */
4577 extern tree array_ref_low_bound (tree);
4579 /* Return a tree representing the upper bound of the array mentioned in
4580 EXP, an ARRAY_REF. */
4582 extern tree array_ref_up_bound (tree);
4584 /* Return a tree representing the offset, in bytes, of the field referenced
4585 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4587 extern tree component_ref_field_offset (tree);
4589 /* Given a DECL or TYPE, return the scope in which it was declared, or
4590 NUL_TREE if there is no containing scope. */
4592 extern tree get_containing_scope (const_tree);
4594 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4596 extern tree decl_function_context (const_tree);
4598 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4599 this _DECL with its context, or zero if none. */
4600 extern tree decl_type_context (const_tree);
4602 /* Return 1 if EXPR is the real constant zero. */
4603 extern int real_zerop (const_tree);
4605 /* Declare commonly used variables for tree structure. */
4607 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4608 Zero means allow extended lvalues. */
4610 extern int pedantic_lvalues;
4612 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4614 extern GTY(()) tree current_function_decl;
4616 /* Nonzero means a FUNC_BEGIN label was emitted. */
4617 extern GTY(()) const char * current_function_func_begin_label;
4619 /* Iterator for going through the function arguments. */
4621 tree fntype; /* function type declaration */
4622 tree next; /* TREE_LIST pointing to the next argument */
4623 } function_args_iterator;
4625 /* Initialize the iterator I with arguments from function FNDECL */
4628 function_args_iter_init (function_args_iterator *i, tree fntype)
4631 i->next = TYPE_ARG_TYPES (fntype);
4634 /* Return a pointer that holds the next argument if there are more arguments to
4635 handle, otherwise return NULL. */
4637 static inline tree *
4638 function_args_iter_cond_ptr (function_args_iterator *i)
4640 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4643 /* Return the next argument if there are more arguments to handle, otherwise
4647 function_args_iter_cond (function_args_iterator *i)
4649 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4652 /* Advance to the next argument. */
4654 function_args_iter_next (function_args_iterator *i)
4656 gcc_assert (i->next != NULL_TREE);
4657 i->next = TREE_CHAIN (i->next);
4660 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4661 to point to the next tree element. ITER is an instance of
4662 function_args_iterator used to iterate the arguments. */
4663 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4664 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4665 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4666 function_args_iter_next (&(ITER)))
4668 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4669 to the next tree element. ITER is an instance of function_args_iterator
4670 used to iterate the arguments. */
4671 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4672 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4673 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4674 function_args_iter_next (&(ITER)))
4679 extern unsigned crc32_string (unsigned, const char *);
4680 extern void clean_symbol_name (char *);
4681 extern tree get_file_function_name (const char *);
4682 extern tree get_callee_fndecl (const_tree);
4683 extern void change_decl_assembler_name (tree, tree);
4684 extern int type_num_arguments (const_tree);
4685 extern bool associative_tree_code (enum tree_code);
4686 extern bool commutative_tree_code (enum tree_code);
4687 extern tree upper_bound_in_type (tree, tree);
4688 extern tree lower_bound_in_type (tree, tree);
4689 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4690 extern bool empty_body_p (tree);
4691 extern tree call_expr_arg (tree, int);
4692 extern tree *call_expr_argp (tree, int);
4693 extern tree call_expr_arglist (tree);
4694 extern bool stdarg_p (tree);
4695 extern bool prototype_p (tree);
4696 extern int function_args_count (tree);
4697 extern bool auto_var_in_fn_p (const_tree, const_tree);
4701 extern void expand_expr_stmt (tree);
4702 extern int warn_if_unused_value (const_tree, location_t);
4703 extern void expand_label (tree);
4704 extern void expand_goto (tree);
4706 extern rtx expand_stack_save (void);
4707 extern void expand_stack_restore (tree);
4708 extern void expand_return (tree);
4709 extern int is_body_block (const_tree);
4712 extern void using_eh_for_cleanups (void);
4714 /* In fold-const.c */
4716 /* Non-zero if we are folding constants inside an initializer; zero
4718 extern int folding_initializer;
4720 /* Convert between trees and native memory representation. */
4721 extern int native_encode_expr (const_tree, unsigned char *, int);
4722 extern tree native_interpret_expr (tree, const unsigned char *, int);
4724 /* Fold constants as much as possible in an expression.
4725 Returns the simplified expression.
4726 Acts only on the top level of the expression;
4727 if the argument itself cannot be simplified, its
4728 subexpressions are not changed. */
4730 extern tree fold (tree);
4731 extern tree fold_unary (enum tree_code, tree, tree);
4732 extern tree fold_binary (enum tree_code, tree, tree, tree);
4733 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4734 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4735 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4736 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4737 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4738 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4739 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4740 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4741 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4742 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4743 extern tree fold_build_call_array (tree, tree, int, tree *);
4744 extern tree fold_build_call_array_initializer (tree, tree, int, tree *);
4745 extern bool fold_convertible_p (const_tree, const_tree);
4746 extern tree fold_convert (tree, tree);
4747 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4748 extern tree fold_ignored_result (tree);
4749 extern tree fold_abs_const (tree, tree);
4750 extern tree fold_indirect_ref_1 (tree, tree);
4751 extern void fold_defer_overflow_warnings (void);
4752 extern void fold_undefer_overflow_warnings (bool, const_tree, int);
4753 extern void fold_undefer_and_ignore_overflow_warnings (void);
4754 extern bool fold_deferring_overflow_warnings_p (void);
4755 extern tree maybe_fold_offset_to_reference (tree, tree, tree);
4757 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4760 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4761 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, const_tree);
4762 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4763 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4764 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4766 #define add_double(l1,h1,l2,h2,lv,hv) \
4767 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4768 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4769 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4770 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4771 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4772 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4774 #define mul_double(l1,h1,l2,h2,lv,hv) \
4775 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4776 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4777 HOST_WIDE_INT, unsigned int,
4778 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4779 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4780 HOST_WIDE_INT, unsigned int,
4781 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4782 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4783 HOST_WIDE_INT, unsigned int,
4784 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4785 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4786 HOST_WIDE_INT, unsigned int,
4787 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4789 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4790 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4791 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4792 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4795 enum operand_equal_flag
4801 extern int operand_equal_p (const_tree, const_tree, unsigned int);
4802 extern int multiple_of_p (tree, const_tree, const_tree);
4803 extern tree omit_one_operand (tree, tree, tree);
4804 extern tree omit_two_operands (tree, tree, tree, tree);
4805 extern tree invert_truthvalue (tree);
4806 extern tree fold_truth_not_expr (tree);
4807 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4808 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4809 extern tree fold_read_from_constant_string (tree);
4810 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
4811 extern tree build_fold_addr_expr (tree);
4812 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4813 extern tree fold_strip_sign_ops (tree);
4814 extern tree build_fold_addr_expr_with_type (tree, tree);
4815 extern tree build_fold_indirect_ref (tree);
4816 extern tree fold_indirect_ref (tree);
4817 extern tree constant_boolean_node (int, tree);
4818 extern tree build_low_bits_mask (tree, unsigned);
4820 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
4821 extern void swap_tree_operands (tree, tree *, tree *);
4822 extern enum tree_code swap_tree_comparison (enum tree_code);
4824 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4825 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4827 extern bool tree_expr_nonzero_p (tree);
4828 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
4829 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
4831 extern bool tree_single_nonzero_warnv_p (tree, bool *);
4832 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4833 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
4834 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
4836 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4837 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4838 extern bool tree_call_nonnegative_warnv_p (enum tree_code code, tree, tree,
4839 tree, tree, bool *);
4841 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4843 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
4846 extern tree fold_call_expr (tree, bool);
4847 extern tree fold_builtin_fputs (tree, tree, bool, bool, tree);
4848 extern tree fold_builtin_strcpy (tree, tree, tree, tree);
4849 extern tree fold_builtin_strncpy (tree, tree, tree, tree, tree);
4850 extern tree fold_builtin_memory_chk (tree, tree, tree, tree, tree, tree, bool,
4851 enum built_in_function);
4852 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, tree, tree, bool,
4853 enum built_in_function);
4854 extern tree fold_builtin_strncpy_chk (tree, tree, tree, tree, tree);
4855 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4856 extern bool fold_builtin_next_arg (tree, bool);
4857 extern enum built_in_function builtin_mathfn_code (const_tree);
4858 extern tree build_function_call_expr (tree, tree);
4859 extern tree fold_builtin_call_array (tree, tree, int, tree *);
4860 extern void debug_fold_checksum (const_tree);
4861 extern tree build_call_expr (tree, int, ...);
4862 extern tree mathfn_built_in (tree, enum built_in_function fn);
4863 extern tree strip_float_extensions (tree);
4864 extern tree c_strlen (tree, int);
4865 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4866 extern tree build_va_arg_indirect_ref (tree);
4867 extern tree build_string_literal (int, const char *);
4868 extern bool validate_arglist (const_tree, ...);
4869 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4870 extern int get_pointer_alignment (tree, unsigned int);
4873 extern tree strip_float_extensions (tree);
4876 extern int really_constant_p (const_tree);
4877 extern bool decl_address_invariant_p (const_tree);
4878 extern int int_fits_type_p (const_tree, const_tree);
4879 #ifndef GENERATOR_FILE
4880 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4882 extern bool variably_modified_type_p (tree, tree);
4883 extern int tree_log2 (const_tree);
4884 extern int tree_floor_log2 (const_tree);
4885 extern int simple_cst_equal (const_tree, const_tree);
4886 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
4887 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4888 extern int type_list_equal (const_tree, const_tree);
4889 extern int chain_member (const_tree, const_tree);
4890 extern tree type_hash_lookup (unsigned int, tree);
4891 extern void type_hash_add (unsigned int, tree);
4892 extern int simple_cst_list_equal (const_tree, const_tree);
4893 extern void dump_tree_statistics (void);
4894 extern void expand_function_end (void);
4895 extern void expand_function_start (tree);
4896 extern void stack_protect_prologue (void);
4897 extern void stack_protect_epilogue (void);
4898 extern void recompute_tree_invariant_for_addr_expr (tree);
4899 extern bool needs_to_live_in_memory (const_tree);
4900 extern tree reconstruct_complex_type (tree, tree);
4902 extern int real_onep (const_tree);
4903 extern int real_twop (const_tree);
4904 extern int real_minus_onep (const_tree);
4905 extern void init_ttree (void);
4906 extern void build_common_tree_nodes (bool, bool);
4907 extern void build_common_tree_nodes_2 (int);
4908 extern void build_common_builtin_nodes (void);
4909 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4910 extern tree build_range_type (tree, tree, tree);
4911 extern HOST_WIDE_INT int_cst_value (const_tree);
4912 extern tree build_addr (tree, tree);
4914 extern bool fields_compatible_p (const_tree, const_tree);
4915 extern tree find_compatible_field (tree, tree);
4917 extern location_t expr_location (const_tree);
4918 extern void set_expr_location (tree, location_t);
4919 extern bool expr_has_location (const_tree);
4921 extern location_t *expr_locus (const_tree);
4922 extern void set_expr_locus (tree, source_location *);
4923 extern const char *expr_filename (const_tree);
4924 extern int expr_lineno (const_tree);
4926 extern tree *tree_block (tree);
4927 extern tree *generic_tree_operand (tree, int);
4928 extern tree *generic_tree_type (tree);
4929 extern location_t *block_nonartificial_location (tree);
4932 extern void expand_main_function (void);
4933 extern void init_dummy_function_start (void);
4934 extern void expand_dummy_function_end (void);
4935 extern unsigned int init_function_for_compilation (void);
4936 extern void allocate_struct_function (tree, bool);
4937 extern void push_struct_function (tree fndecl);
4938 extern void init_function_start (tree);
4939 extern bool use_register_for_decl (const_tree);
4940 extern void generate_setjmp_warnings (void);
4941 extern void init_temp_slots (void);
4942 extern void free_temp_slots (void);
4943 extern void pop_temp_slots (void);
4944 extern void push_temp_slots (void);
4945 extern void preserve_temp_slots (rtx);
4946 extern int aggregate_value_p (const_tree, const_tree);
4947 extern void push_function_context (void);
4948 extern void pop_function_context (void);
4949 extern tree gimplify_parameters (void);
4951 /* In print-rtl.c */
4953 extern void print_rtl (FILE *, const_rtx);
4956 /* In print-tree.c */
4957 extern void debug_tree (tree);
4959 extern void dump_addr (FILE*, const char *, const void *);
4960 extern void print_node (FILE *, const char *, tree, int);
4961 extern void print_node_brief (FILE *, const char *, const_tree, int);
4962 extern void indent_to (FILE *, int);
4965 /* In tree-inline.c: */
4966 extern bool debug_find_tree (tree, tree);
4967 /* This is in tree-inline.c since the routine uses
4968 data structures from the inliner. */
4969 extern tree unsave_expr_now (tree);
4970 extern tree build_duplicate_type (tree);
4974 /* Nonzero if this is a call to a function whose return value depends
4975 solely on its arguments, has no side effects, and does not read
4978 /* Nonzero if this call will never return. */
4979 #define ECF_NORETURN 2
4980 /* Nonzero if this is a call to malloc or a related function. */
4981 #define ECF_MALLOC 4
4982 /* Nonzero if it is plausible that this is a call to alloca. */
4983 #define ECF_MAY_BE_ALLOCA 8
4984 /* Nonzero if this is a call to a function that won't throw an exception. */
4985 #define ECF_NOTHROW 16
4986 /* Nonzero if this is a call to setjmp or a related function. */
4987 #define ECF_RETURNS_TWICE 32
4988 /* Nonzero if this call replaces the current stack frame. */
4989 #define ECF_SIBCALL 64
4990 /* Nonzero if this is a call to "pure" function (like const function,
4991 but may read memory. */
4992 #define ECF_PURE 128
4993 /* Create libcall block around the call. */
4994 #define ECF_LIBCALL_BLOCK 256
4995 /* Function does not read or write memory (but may have side effects, so
4996 it does not necessarily fit ECF_CONST). */
4997 #define ECF_NOVOPS 512
4999 extern int flags_from_decl_or_type (const_tree);
5000 extern int call_expr_flags (const_tree);
5002 extern int setjmp_call_p (const_tree);
5003 extern bool alloca_call_p (const_tree);
5004 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
5005 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
5009 extern const struct attribute_spec *lookup_attribute_spec (tree);
5011 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5012 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5013 it should be modified in place; if a TYPE, a copy should be created
5014 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5015 information, in the form of a bitwise OR of flags in enum attribute_flags
5016 from tree.h. Depending on these flags, some attributes may be
5017 returned to be applied at a later stage (for example, to apply
5018 a decl attribute to the declaration rather than to its type). */
5019 extern tree decl_attributes (tree *, tree, int);
5021 /* In integrate.c */
5022 extern void set_decl_abstract_flags (tree, int);
5023 extern void set_decl_origin_self (tree);
5025 /* In stor-layout.c */
5026 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
5027 extern void fixup_signed_type (tree);
5028 extern void internal_reference_types (void);
5029 extern unsigned int update_alignment_for_field (record_layout_info, tree,
5032 extern void make_decl_rtl (tree);
5033 extern void make_decl_one_only (tree);
5034 extern int supports_one_only (void);
5035 extern void resolve_unique_section (tree, int, int);
5036 extern void mark_referenced (tree);
5037 extern void mark_decl_referenced (tree);
5038 extern void notice_global_symbol (tree);
5039 extern void set_user_assembler_name (tree, const char *);
5040 extern void process_pending_assemble_externals (void);
5041 extern void finish_aliases_1 (void);
5042 extern void finish_aliases_2 (void);
5043 extern tree emutls_decl (tree);
5046 extern void expand_computed_goto (tree);
5047 extern bool parse_output_constraint (const char **, int, int, int,
5048 bool *, bool *, bool *);
5049 extern bool parse_input_constraint (const char **, int, int, int, int,
5050 const char * const *, bool *, bool *);
5051 extern void expand_asm_expr (tree);
5052 extern tree resolve_asm_operand_names (tree, tree, tree);
5053 extern void expand_case (tree);
5054 extern void expand_decl (tree);
5055 extern void expand_anon_union_decl (tree, tree, tree);
5057 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5058 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
5061 /* In gimplify.c. */
5062 extern tree create_artificial_label (void);
5063 extern void gimplify_function_tree (tree);
5064 extern const char *get_name (const_tree);
5065 extern tree unshare_expr (tree);
5066 extern void sort_case_labels (tree);
5068 /* Interface of the DWARF2 unwind info support. */
5070 /* Generate a new label for the CFI info to refer to. */
5072 extern char *dwarf2out_cfi_label (void);
5074 /* Entry point to update the canonical frame address (CFA). */
5076 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
5078 /* Add the CFI for saving a register window. */
5080 extern void dwarf2out_window_save (const char *);
5082 /* Add a CFI to update the running total of the size of arguments pushed
5085 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
5087 /* Entry point for saving a register to the stack. */
5089 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5091 /* Entry point for saving the return address in the stack. */
5093 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5095 /* Entry point for saving the return address in a register. */
5097 extern void dwarf2out_return_reg (const char *, unsigned);
5099 /* Entry point for saving the first register into the second. */
5101 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5103 /* In tree-inline.c */
5105 /* The type of a set of already-visited pointers. Functions for creating
5106 and manipulating it are declared in pointer-set.h */
5107 struct pointer_set_t;
5109 /* The type of a callback function for walking over tree structure. */
5111 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5113 /* The type of a callback function that represents a custom walk_tree. */
5115 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5116 void *, struct pointer_set_t*);
5118 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5120 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5122 #define walk_tree(a,b,c,d) \
5123 walk_tree_1 (a, b, c, d, NULL)
5124 #define walk_tree_without_duplicates(a,b,c) \
5125 walk_tree_without_duplicates_1 (a, b, c, NULL)
5127 /* Assign the RTX to declaration. */
5129 extern void set_decl_rtl (tree, rtx);
5130 extern void set_decl_incoming_rtl (tree, rtx, bool);
5132 /* Enum and arrays used for tree allocation stats.
5133 Keep in sync with tree.c:tree_node_kind_names. */
5159 extern int tree_node_counts[];
5160 extern int tree_node_sizes[];
5162 /* True if we are in gimple form and the actions of the folders need to
5163 be restricted. False if we are not in gimple form and folding is not
5164 restricted to creating gimple expressions. */
5165 extern bool in_gimple_form;
5167 /* In tree-gimple.c. */
5168 extern tree get_base_address (tree t);
5170 /* In tree-vectorizer.c. */
5171 extern void vect_set_verbosity_level (const char *);
5175 struct tree_map_base GTY(())
5180 extern int tree_map_base_eq (const void *, const void *);
5181 extern unsigned int tree_map_base_hash (const void *);
5182 extern int tree_map_base_marked_p (const void *);
5184 /* Map from a tree to another tree. */
5186 struct tree_map GTY(())
5188 struct tree_map_base base;
5193 #define tree_map_eq tree_map_base_eq
5194 extern unsigned int tree_map_hash (const void *);
5195 #define tree_map_marked_p tree_map_base_marked_p
5197 /* Map from a tree to an int. */
5199 struct tree_int_map GTY(())
5201 struct tree_map_base base;
5205 #define tree_int_map_eq tree_map_base_eq
5206 #define tree_int_map_hash tree_map_base_hash
5207 #define tree_int_map_marked_p tree_map_base_marked_p
5209 /* Map from a tree to initialization/finalization priorities. */
5211 struct tree_priority_map GTY(())
5213 struct tree_map_base base;
5218 #define tree_priority_map_eq tree_map_base_eq
5219 #define tree_priority_map_hash tree_map_base_hash
5220 #define tree_priority_map_marked_p tree_map_base_marked_p
5222 /* In tree-ssa-address.c. */
5223 extern tree tree_mem_ref_addr (tree, tree);
5224 extern void copy_mem_ref_info (tree, tree);
5227 extern bool ssa_name_nonzero_p (const_tree);
5228 extern bool ssa_name_nonnegative_p (const_tree);
5230 /* In tree-object-size.c. */
5231 extern void init_object_sizes (void);
5232 extern void fini_object_sizes (void);
5233 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5236 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5238 /* In tree-inline.c. */
5240 void init_inline_once (void);
5242 /* Compute the number of operands in an expression node NODE. For
5243 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5244 otherwise it is looked up from the node's code. */
5246 tree_operand_length (const_tree node)
5248 if (VL_EXP_CLASS_P (node))
5249 return VL_EXP_OPERAND_LENGTH (node);
5251 return TREE_CODE_LENGTH (TREE_CODE (node));
5254 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5255 have to go towards the end of tree.h so that union tree_node is fully
5256 defined by this point. */
5258 /* Structure containing iterator state. */
5259 typedef struct call_expr_arg_iterator_d GTY (())
5261 tree t; /* the call_expr */
5262 int n; /* argument count */
5263 int i; /* next argument index */
5264 } call_expr_arg_iterator;
5266 typedef struct const_call_expr_arg_iterator_d GTY (())
5268 const_tree t; /* the call_expr */
5269 int n; /* argument count */
5270 int i; /* next argument index */
5271 } const_call_expr_arg_iterator;
5273 /* Initialize the abstract argument list iterator object ITER with the
5274 arguments from CALL_EXPR node EXP. */
5276 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5279 iter->n = call_expr_nargs (exp);
5284 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5287 iter->n = call_expr_nargs (exp);
5291 /* Return the next argument from abstract argument list iterator object ITER,
5292 and advance its state. Return NULL_TREE if there are no more arguments. */
5294 next_call_expr_arg (call_expr_arg_iterator *iter)
5297 if (iter->i >= iter->n)
5299 result = CALL_EXPR_ARG (iter->t, iter->i);
5304 static inline const_tree
5305 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5308 if (iter->i >= iter->n)
5310 result = CALL_EXPR_ARG (iter->t, iter->i);
5315 /* Initialize the abstract argument list iterator object ITER, then advance
5316 past and return the first argument. Useful in for expressions, e.g.
5317 for (arg = first_call_expr_arg (exp, &iter); arg;
5318 arg = next_call_expr_arg (&iter)) */
5320 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5322 init_call_expr_arg_iterator (exp, iter);
5323 return next_call_expr_arg (iter);
5326 static inline const_tree
5327 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5329 init_const_call_expr_arg_iterator (exp, iter);
5330 return next_const_call_expr_arg (iter);
5333 /* Test whether there are more arguments in abstract argument list iterator
5334 ITER, without changing its state. */
5336 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5338 return (iter->i < iter->n);
5342 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5344 return (iter->i < iter->n);
5347 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5348 (of type call_expr_arg_iterator) to hold the iteration state. */
5349 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5350 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5351 (arg) = next_call_expr_arg (&(iter)))
5353 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5354 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5355 (arg) = next_const_call_expr_arg (&(iter)))
5357 #endif /* GCC_TREE_H */