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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
28 #include "statistics.h"
30 #include "double-int.h"
32 /* Codes of tree nodes */
34 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
39 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
45 #define MAX_TREE_CODES 512
46 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
47 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
49 /* Number of language-independent tree codes. */
50 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
52 /* Tree code classes. */
54 /* Each tree_code has an associated code class represented by a
57 enum tree_code_class {
58 tcc_exceptional, /* An exceptional code (fits no category). */
59 tcc_constant, /* A constant. */
60 /* Order of tcc_type and tcc_declaration is important. */
61 tcc_type, /* A type object code. */
62 tcc_declaration, /* A declaration (also serving as variable refs). */
63 tcc_reference, /* A reference to storage. */
64 tcc_comparison, /* A comparison expression. */
65 tcc_unary, /* A unary arithmetic expression. */
66 tcc_binary, /* A binary arithmetic expression. */
67 tcc_statement, /* A statement expression, which have side effects
68 but usually no interesting value. */
69 tcc_vl_exp, /* A function call or other expression with a
70 variable-length operand vector. */
71 tcc_expression, /* Any other expression. */
72 tcc_gimple_stmt /* A GIMPLE statement. */
75 /* Each tree code class has an associated string representation.
76 These must correspond to the tree_code_class entries. */
78 extern const char *const tree_code_class_strings[];
80 /* Returns the string representing CLASS. */
82 #define TREE_CODE_CLASS_STRING(CLASS)\
83 tree_code_class_strings[(int) (CLASS)]
85 extern const enum tree_code_class tree_code_type[];
86 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
88 /* Nonzero if CODE represents an exceptional code. */
90 #define EXCEPTIONAL_CLASS_P(CODE)\
91 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
93 /* Nonzero if CODE represents a constant. */
95 #define CONSTANT_CLASS_P(CODE)\
96 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
98 /* Nonzero if CODE represents a type. */
100 #define TYPE_P(CODE)\
101 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
103 /* Nonzero if CODE represents a declaration. */
105 #define DECL_P(CODE)\
106 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
108 /* Nonzero if CODE represents a memory tag. */
110 #define MTAG_P(CODE) \
111 (TREE_CODE (CODE) == STRUCT_FIELD_TAG \
112 || TREE_CODE (CODE) == NAME_MEMORY_TAG \
113 || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG \
114 || TREE_CODE (CODE) == MEMORY_PARTITION_TAG)
117 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
119 #define VAR_OR_FUNCTION_DECL_P(DECL)\
120 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
122 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
123 ascending code order. */
125 #define INDIRECT_REF_P(CODE)\
126 (TREE_CODE (CODE) == INDIRECT_REF \
127 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
128 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
130 /* Nonzero if CODE represents a reference. */
132 #define REFERENCE_CLASS_P(CODE)\
133 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
135 /* Nonzero if CODE represents a comparison. */
137 #define COMPARISON_CLASS_P(CODE)\
138 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
140 /* Nonzero if CODE represents a unary arithmetic expression. */
142 #define UNARY_CLASS_P(CODE)\
143 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
145 /* Nonzero if CODE represents a binary arithmetic expression. */
147 #define BINARY_CLASS_P(CODE)\
148 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
150 /* Nonzero if CODE represents a statement expression. */
152 #define STATEMENT_CLASS_P(CODE)\
153 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
155 /* Nonzero if CODE represents a function call-like expression with a
156 variable-length operand vector. */
158 #define VL_EXP_CLASS_P(CODE)\
159 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
161 /* Nonzero if CODE represents any other expression. */
163 #define EXPRESSION_CLASS_P(CODE)\
164 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
166 /* Returns nonzero iff CODE represents a type or declaration. */
168 #define IS_TYPE_OR_DECL_P(CODE)\
169 (TYPE_P (CODE) || DECL_P (CODE))
171 /* Returns nonzero iff CLASS is the tree-code class of an
174 #define IS_EXPR_CODE_CLASS(CLASS)\
175 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
177 /* Returns nonzer iff CLASS is a GIMPLE statement. */
179 #define IS_GIMPLE_STMT_CODE_CLASS(CLASS) ((CLASS) == tcc_gimple_stmt)
181 /* Returns nonzero iff NODE is an expression of some kind. */
183 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
185 /* Returns nonzero iff NODE is an OpenMP directive. */
187 #define OMP_DIRECTIVE_P(NODE) \
188 (TREE_CODE (NODE) == OMP_PARALLEL \
189 || TREE_CODE (NODE) == OMP_FOR \
190 || TREE_CODE (NODE) == OMP_SECTIONS \
191 || TREE_CODE (NODE) == OMP_SINGLE \
192 || TREE_CODE (NODE) == OMP_SECTION \
193 || TREE_CODE (NODE) == OMP_MASTER \
194 || TREE_CODE (NODE) == OMP_ORDERED \
195 || TREE_CODE (NODE) == OMP_CRITICAL \
196 || TREE_CODE (NODE) == OMP_RETURN \
197 || TREE_CODE (NODE) == OMP_CONTINUE)
199 /* Number of argument-words in each kind of tree-node. */
201 extern const unsigned char tree_code_length[];
202 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
204 /* Names of tree components. */
206 extern const char *const tree_code_name[];
208 /* A vectors of trees. */
210 DEF_VEC_ALLOC_P(tree,gc);
211 DEF_VEC_ALLOC_P(tree,heap);
214 /* Classify which part of the compiler has defined a given builtin function.
215 Note that we assume below that this is no more than two bits. */
224 /* Names for the above. */
225 extern const char *const built_in_class_names[4];
227 /* Codes that identify the various built in functions
228 so that expand_call can identify them quickly. */
230 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
231 enum built_in_function
233 #include "builtins.def"
235 /* Complex division routines in libgcc. These are done via builtins
236 because emit_library_call_value can't handle complex values. */
237 BUILT_IN_COMPLEX_MUL_MIN,
238 BUILT_IN_COMPLEX_MUL_MAX
239 = BUILT_IN_COMPLEX_MUL_MIN
240 + MAX_MODE_COMPLEX_FLOAT
241 - MIN_MODE_COMPLEX_FLOAT,
243 BUILT_IN_COMPLEX_DIV_MIN,
244 BUILT_IN_COMPLEX_DIV_MAX
245 = BUILT_IN_COMPLEX_DIV_MIN
246 + MAX_MODE_COMPLEX_FLOAT
247 - MIN_MODE_COMPLEX_FLOAT,
249 /* Upper bound on non-language-specific builtins. */
254 /* Names for the above. */
255 extern const char * built_in_names[(int) END_BUILTINS];
257 /* Helper macros for math builtins. */
259 #define BUILTIN_EXP10_P(FN) \
260 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
261 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
263 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
264 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
265 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
267 #define BUILTIN_SQRT_P(FN) \
268 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
270 #define BUILTIN_CBRT_P(FN) \
271 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
273 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
275 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
276 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
277 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
279 /* An array of _DECL trees for the above. */
280 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
281 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
283 /* In an OMP_CLAUSE node. */
285 /* Number of operands and names for each clause. */
286 extern unsigned const char omp_clause_num_ops[];
287 extern const char * const omp_clause_code_name[];
289 /* Clause codes. Do not reorder, as this is used to index into the tables
290 omp_clause_num_ops and omp_clause_code_name. */
293 /* Clause zero is special-cased inside the parser
294 (c_parser_omp_variable_list). */
295 OMP_CLAUSE_ERROR = 0,
297 /* OpenMP clause: private (variable_list). */
300 /* OpenMP clause: shared (variable_list). */
303 /* OpenMP clause: firstprivate (variable_list). */
304 OMP_CLAUSE_FIRSTPRIVATE,
306 /* OpenMP clause: lastprivate (variable_list). */
307 OMP_CLAUSE_LASTPRIVATE,
309 /* OpenMP clause: reduction (operator:variable_list).
310 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
311 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
312 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
314 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
315 placeholder used in OMP_CLAUSE_REDUCTION_MERGE. */
316 OMP_CLAUSE_REDUCTION,
318 /* OpenMP clause: copyin (variable_list). */
321 /* OpenMP clause: copyprivate (variable_list). */
322 OMP_CLAUSE_COPYPRIVATE,
324 /* OpenMP clause: if (scalar-expression). */
327 /* OpenMP clause: num_threads (integer-expression). */
328 OMP_CLAUSE_NUM_THREADS,
330 /* OpenMP clause: schedule. */
333 /* OpenMP clause: nowait. */
336 /* OpenMP clause: ordered. */
339 /* OpenMP clause: default. */
343 /* The definition of tree nodes fills the next several pages. */
345 /* A tree node can represent a data type, a variable, an expression
346 or a statement. Each node has a TREE_CODE which says what kind of
347 thing it represents. Some common codes are:
348 INTEGER_TYPE -- represents a type of integers.
349 ARRAY_TYPE -- represents a type of pointer.
350 VAR_DECL -- represents a declared variable.
351 INTEGER_CST -- represents a constant integer value.
352 PLUS_EXPR -- represents a sum (an expression).
354 As for the contents of a tree node: there are some fields
355 that all nodes share. Each TREE_CODE has various special-purpose
356 fields as well. The fields of a node are never accessed directly,
357 always through accessor macros. */
359 /* Every kind of tree node starts with this structure,
360 so all nodes have these fields.
362 See the accessor macros, defined below, for documentation of the
366 struct tree_base GTY(())
368 ENUM_BITFIELD(tree_code) code : 16;
370 unsigned side_effects_flag : 1;
371 unsigned constant_flag : 1;
372 unsigned addressable_flag : 1;
373 unsigned volatile_flag : 1;
374 unsigned readonly_flag : 1;
375 unsigned unsigned_flag : 1;
376 unsigned asm_written_flag: 1;
377 unsigned nowarning_flag : 1;
379 unsigned used_flag : 1;
380 unsigned nothrow_flag : 1;
381 unsigned static_flag : 1;
382 unsigned public_flag : 1;
383 unsigned private_flag : 1;
384 unsigned protected_flag : 1;
385 unsigned deprecated_flag : 1;
386 unsigned invariant_flag : 1;
388 unsigned lang_flag_0 : 1;
389 unsigned lang_flag_1 : 1;
390 unsigned lang_flag_2 : 1;
391 unsigned lang_flag_3 : 1;
392 unsigned lang_flag_4 : 1;
393 unsigned lang_flag_5 : 1;
394 unsigned lang_flag_6 : 1;
395 unsigned visited : 1;
399 /* FIXME tuples: Eventually, we need to move this somewhere external to
401 union tree_ann_d *ann;
404 struct tree_common GTY(())
406 struct tree_base base;
411 /* GIMPLE_MODIFY_STMT */
412 struct gimple_stmt GTY(())
414 struct tree_base base;
417 /* FIXME tuples: Eventually this should be of type ``struct gimple_expr''. */
418 tree GTY ((length ("TREE_CODE_LENGTH (TREE_CODE (&%h))"))) operands[1];
421 /* The following table lists the uses of each of the above flags and
422 for which types of nodes they are defined. Note that expressions
428 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
429 ..._TYPE, IDENTIFIER_NODE.
430 In a STMT_EXPR, it means we want the result of the enclosed
432 CALL_EXPR_TAILCALL in CALL_EXPR
433 CASE_LOW_SEEN in CASE_LABEL_EXPR
438 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
441 TREE_SYMBOL_REFERENCED in
444 TARGET_EXPR, WITH_CLEANUP_EXPR
447 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
448 TYPE_REF_CAN_ALIAS_ALL in
449 POINTER_TYPE, REFERENCE_TYPE
454 CALL_CANNOT_INLINE_P in
460 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
462 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
465 TYPE_CACHED_VALUES_P in
467 SAVE_EXPR_RESOLVED_P in
469 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
470 OMP_CLAUSE_LASTPRIVATE
471 OMP_CLAUSE_PRIVATE_DEBUG in
478 CALL_EXPR_RETURN_SLOT_OPT in
481 PARM_DECL, RESULT_DECL
486 OMP_PARALLEL_COMBINED in
509 TREE_THIS_VOLATILE in
527 TYPE_SIZES_GIMPLIFIED
536 BIT_FIELD_REF_UNSIGNED in
542 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
548 expressions, IDENTIFIER_NODE
553 CALL_EXPR, FUNCTION_DECL
559 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
566 IDENTIFIER_TRANSPARENT_ALIAS in
571 Used in tree traversals to mark visited nodes.
581 ... any expr or decl node
584 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
585 enum tree_node_structure_enum {
586 #include "treestruct.def"
591 /* Define accessors for the fields that all tree nodes have
592 (though some fields are not used for all kinds of nodes). */
594 /* The tree-code says what kind of node it is.
595 Codes are defined in tree.def. */
596 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
597 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
599 /* When checking is enabled, errors will be generated if a tree node
600 is accessed incorrectly. The macros die with a fatal error. */
601 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
603 #define TREE_CHECK(T, CODE) __extension__ \
604 ({ __typeof (T) const __t = (T); \
605 if (TREE_CODE (__t) != (CODE)) \
606 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
610 #define TREE_NOT_CHECK(T, CODE) __extension__ \
611 ({ __typeof (T) const __t = (T); \
612 if (TREE_CODE (__t) == (CODE)) \
613 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
617 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
618 ({ __typeof (T) const __t = (T); \
619 if (TREE_CODE (__t) != (CODE1) \
620 && TREE_CODE (__t) != (CODE2)) \
621 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
622 (CODE1), (CODE2), 0); \
625 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
626 ({ __typeof (T) const __t = (T); \
627 if (TREE_CODE (__t) == (CODE1) \
628 || TREE_CODE (__t) == (CODE2)) \
629 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
630 (CODE1), (CODE2), 0); \
633 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
634 ({ __typeof (T) const __t = (T); \
635 if (TREE_CODE (__t) != (CODE1) \
636 && TREE_CODE (__t) != (CODE2) \
637 && TREE_CODE (__t) != (CODE3)) \
638 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
639 (CODE1), (CODE2), (CODE3), 0); \
642 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
643 ({ __typeof (T) const __t = (T); \
644 if (TREE_CODE (__t) == (CODE1) \
645 || TREE_CODE (__t) == (CODE2) \
646 || TREE_CODE (__t) == (CODE3)) \
647 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
648 (CODE1), (CODE2), (CODE3), 0); \
651 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
652 ({ __typeof (T) const __t = (T); \
653 if (TREE_CODE (__t) != (CODE1) \
654 && TREE_CODE (__t) != (CODE2) \
655 && TREE_CODE (__t) != (CODE3) \
656 && TREE_CODE (__t) != (CODE4)) \
657 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
658 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
661 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
662 ({ __typeof (T) const __t = (T); \
663 if (TREE_CODE (__t) == (CODE1) \
664 || TREE_CODE (__t) == (CODE2) \
665 || TREE_CODE (__t) == (CODE3) \
666 || TREE_CODE (__t) == (CODE4)) \
667 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
668 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
671 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
672 ({ __typeof (T) const __t = (T); \
673 if (TREE_CODE (__t) != (CODE1) \
674 && TREE_CODE (__t) != (CODE2) \
675 && TREE_CODE (__t) != (CODE3) \
676 && TREE_CODE (__t) != (CODE4) \
677 && TREE_CODE (__t) != (CODE5)) \
678 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
679 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
682 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
683 ({ __typeof (T) const __t = (T); \
684 if (TREE_CODE (__t) == (CODE1) \
685 || TREE_CODE (__t) == (CODE2) \
686 || TREE_CODE (__t) == (CODE3) \
687 || TREE_CODE (__t) == (CODE4) \
688 || TREE_CODE (__t) == (CODE5)) \
689 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
690 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
693 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
694 ({ __typeof (T) const __t = (T); \
695 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
696 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
700 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
701 ({ __typeof (T) const __t = (T); \
702 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
703 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
707 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
708 ({ __typeof (T) const __t = (T); \
709 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
710 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
714 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
715 ({ __typeof (T) const __t = (T); \
716 if (TREE_CODE (__t) != OMP_CLAUSE) \
717 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
719 if (__t->omp_clause.code != (CODE)) \
720 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
724 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
725 ({ __typeof (T) const __t = (T); \
726 if (TREE_CODE (__t) != OMP_CLAUSE) \
727 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
729 if ((int) __t->omp_clause.code < (int) (CODE1) \
730 || (int) __t->omp_clause.code > (int) (CODE2)) \
731 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
732 __FUNCTION__, (CODE1), (CODE2)); \
735 /* These checks have to be special cased. */
736 #define EXPR_CHECK(T) __extension__ \
737 ({ __typeof (T) const __t = (T); \
738 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
739 if (!IS_EXPR_CODE_CLASS (__c)) \
740 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
744 #define GIMPLE_STMT_CHECK(T) __extension__ \
745 ({ __typeof (T) const __t = (T); \
746 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
747 if (!IS_GIMPLE_STMT_CODE_CLASS (__c)) \
748 tree_class_check_failed (__t, tcc_gimple_stmt, __FILE__, __LINE__,\
752 /* These checks have to be special cased. */
753 #define NON_TYPE_CHECK(T) __extension__ \
754 ({ __typeof (T) const __t = (T); \
756 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
760 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
761 (*({__typeof (T) const __t = (T); \
762 const int __i = (I); \
763 if (TREE_CODE (__t) != TREE_VEC) \
764 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
766 if (__i < 0 || __i >= __t->vec.length) \
767 tree_vec_elt_check_failed (__i, __t->vec.length, \
768 __FILE__, __LINE__, __FUNCTION__); \
769 &__t->vec.a[__i]; }))
771 #define PHI_NODE_ELT_CHECK(T, I) __extension__ \
772 (*({__typeof (T) const __t = (T); \
773 const int __i = (I); \
774 if (TREE_CODE (__t) != PHI_NODE) \
775 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
777 if (__i < 0 || __i >= __t->phi.capacity) \
778 phi_node_elt_check_failed (__i, __t->phi.num_args, \
779 __FILE__, __LINE__, __FUNCTION__); \
780 &__t->phi.a[__i]; }))
782 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
783 (*({__typeof (T) const __t = (T); \
784 const int __i = (I); \
785 if (TREE_CODE (__t) != OMP_CLAUSE) \
786 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
788 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
789 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
791 &__t->omp_clause.ops[__i]; }))
793 /* Special checks for TREE_OPERANDs. */
794 #define TREE_OPERAND_CHECK(T, I) __extension__ \
795 (*({__typeof (T) const __t = EXPR_CHECK (T); \
796 const int __i = (I); \
797 if (GIMPLE_TUPLE_P (__t)) \
798 gcc_unreachable (); \
799 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
800 tree_operand_check_failed (__i, __t, \
801 __FILE__, __LINE__, __FUNCTION__); \
802 &__t->exp.operands[__i]; }))
804 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
805 (*({__typeof (T) const __t = (T); \
806 const int __i = (I); \
807 if (TREE_CODE (__t) != CODE) \
808 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
809 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
810 tree_operand_check_failed (__i, __t, \
811 __FILE__, __LINE__, __FUNCTION__); \
812 &__t->exp.operands[__i]; }))
814 /* Special checks for GIMPLE_STMT_OPERANDs. */
815 #define GIMPLE_STMT_OPERAND_CHECK(T, I) __extension__ \
816 (*({__typeof (T) const __t = GIMPLE_STMT_CHECK (T); \
817 const int __i = (I); \
818 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
819 tree_operand_check_failed (__i, __t, \
820 __FILE__, __LINE__, __FUNCTION__); \
821 &__t->gstmt.operands[__i]; }))
823 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
825 ({__typeof (T) const __t = (T); \
826 const int __i = (I); \
827 if (TREE_CODE (__t) != (CODE)) \
828 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
829 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
830 tree_operand_check_failed (__i, __t, \
831 __FILE__, __LINE__, __FUNCTION__); \
832 &__t->exp.operands[__i]; }))
834 /* Nodes are chained together for many purposes.
835 Types are chained together to record them for being output to the debugger
836 (see the function `chain_type').
837 Decls in the same scope are chained together to record the contents
839 Statement nodes for successive statements used to be chained together.
840 Often lists of things are represented by TREE_LIST nodes that
841 are chained together. */
843 #define TREE_CHAIN(NODE) __extension__ \
844 (*({__typeof (NODE) const __t = (NODE); \
845 if (GIMPLE_TUPLE_P (__t)) \
846 gcc_unreachable (); \
847 &__t->common.chain; }))
849 /* In all nodes that are expressions, this is the data type of the expression.
850 In POINTER_TYPE nodes, this is the type that the pointer points to.
851 In ARRAY_TYPE nodes, this is the type of the elements.
852 In VECTOR_TYPE nodes, this is the type of the elements. */
853 #define TREE_TYPE(NODE) __extension__ \
854 (*({__typeof (NODE) const __t = (NODE); \
855 if (GIMPLE_TUPLE_P (__t)) \
856 gcc_unreachable (); \
857 &__t->common.type; }))
859 extern void tree_contains_struct_check_failed (const tree,
860 const enum tree_node_structure_enum,
861 const char *, int, const char *)
864 extern void tree_check_failed (const tree, const char *, int, const char *,
865 ...) ATTRIBUTE_NORETURN;
866 extern void tree_not_check_failed (const tree, const char *, int, const char *,
867 ...) ATTRIBUTE_NORETURN;
868 extern void tree_class_check_failed (const tree, const enum tree_code_class,
869 const char *, int, const char *)
871 extern void tree_range_check_failed (const tree, const char *, int,
872 const char *, enum tree_code,
874 extern void tree_not_class_check_failed (const tree,
875 const enum tree_code_class,
876 const char *, int, const char *)
878 extern void tree_vec_elt_check_failed (int, int, const char *,
881 extern void phi_node_elt_check_failed (int, int, const char *,
884 extern void tree_operand_check_failed (int, tree,
885 const char *, int, const char *)
887 extern void omp_clause_check_failed (const tree, const char *, int,
888 const char *, enum omp_clause_code)
890 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
893 extern void omp_clause_range_check_failed (const tree, const char *, int,
894 const char *, enum omp_clause_code,
895 enum omp_clause_code)
898 #else /* not ENABLE_TREE_CHECKING, or not gcc */
900 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
901 #define TREE_CHECK(T, CODE) (T)
902 #define TREE_NOT_CHECK(T, CODE) (T)
903 #define TREE_CHECK2(T, CODE1, CODE2) (T)
904 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
905 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
906 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
907 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
908 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
909 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
910 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
911 #define TREE_CLASS_CHECK(T, CODE) (T)
912 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
913 #define EXPR_CHECK(T) (T)
914 #define GIMPLE_STMT_CHECK(T) (T)
915 #define NON_TYPE_CHECK(T) (T)
916 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
917 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
918 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
919 #define GIMPLE_STMT_OPERAND_CHECK(T, I) ((T)->gstmt.operands[I])
920 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
921 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
922 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
923 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
924 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
926 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
927 #define TREE_TYPE(NODE) ((NODE)->common.type)
931 #define TREE_BLOCK(NODE) *(tree_block (NODE))
933 #include "tree-check.h"
935 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
936 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
937 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
938 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
939 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
940 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
941 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
942 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
943 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
944 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
945 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
946 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
948 #define RECORD_OR_UNION_CHECK(T) \
949 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
950 #define NOT_RECORD_OR_UNION_CHECK(T) \
951 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
953 #define NUMERICAL_TYPE_CHECK(T) \
954 TREE_CHECK4 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE)
956 /* Nonzero if NODE is a GIMPLE statement. */
957 #define GIMPLE_STMT_P(NODE) \
958 (TREE_CODE_CLASS (TREE_CODE ((NODE))) == tcc_gimple_stmt)
960 /* Nonzero if NODE is a GIMPLE tuple. */
961 #define GIMPLE_TUPLE_P(NODE) (GIMPLE_STMT_P (NODE) || TREE_CODE (NODE) == PHI_NODE)
963 /* A GIMPLE tuple that has a ``locus'' field. */
964 #define GIMPLE_TUPLE_HAS_LOCUS_P(NODE) GIMPLE_STMT_P ((NODE))
966 /* Like TREE_OPERAND but works with GIMPLE stmt tuples as well.
968 If you know the NODE is a GIMPLE statement, use GIMPLE_STMT_OPERAND. If the
969 NODE code is unknown at compile time, use this macro. */
970 #define GENERIC_TREE_OPERAND(NODE, I) *(generic_tree_operand ((NODE), (I)))
972 /* Like TREE_TYPE but returns void_type_node for gimple tuples that have
975 #define GENERIC_TREE_TYPE(NODE) *(generic_tree_type ((NODE)))
977 /* Here is how primitive or already-canonicalized types' hash codes
979 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
981 /* A simple hash function for an arbitrary tree node. This must not be
982 used in hash tables which are saved to a PCH. */
983 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
985 /* The TREE_CHAIN but it is able to handle tuples. */
986 #define GENERIC_NEXT(NODE) \
987 (TREE_CODE (NODE) == PHI_NODE ? PHI_CHAIN (NODE) : \
988 GIMPLE_STMT_P (NODE) ? NULL_TREE : TREE_CHAIN (NODE))
990 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
991 that don't change the machine mode. */
993 #define STRIP_NOPS(EXP) \
994 while ((TREE_CODE (EXP) == NOP_EXPR \
995 || TREE_CODE (EXP) == CONVERT_EXPR \
996 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
997 && TREE_OPERAND (EXP, 0) != error_mark_node \
998 && (TYPE_MODE (TREE_TYPE (EXP)) \
999 == TYPE_MODE (GENERIC_TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1000 (EXP) = TREE_OPERAND (EXP, 0)
1002 /* Like STRIP_NOPS, but don't let the signedness change either. */
1004 #define STRIP_SIGN_NOPS(EXP) \
1005 while ((TREE_CODE (EXP) == NOP_EXPR \
1006 || TREE_CODE (EXP) == CONVERT_EXPR \
1007 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1008 && TREE_OPERAND (EXP, 0) != error_mark_node \
1009 && (TYPE_MODE (TREE_TYPE (EXP)) \
1010 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1011 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
1012 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1013 (EXP) = TREE_OPERAND (EXP, 0)
1015 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1017 #define STRIP_TYPE_NOPS(EXP) \
1018 while ((TREE_CODE (EXP) == NOP_EXPR \
1019 || TREE_CODE (EXP) == CONVERT_EXPR \
1020 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1021 && TREE_OPERAND (EXP, 0) != error_mark_node \
1022 && (TREE_TYPE (EXP) \
1023 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1024 (EXP) = TREE_OPERAND (EXP, 0)
1026 /* Remove unnecessary type conversions according to
1027 tree_ssa_useless_type_conversion. */
1029 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1030 while (tree_ssa_useless_type_conversion (EXP)) \
1031 EXP = TREE_OPERAND (EXP, 0)
1033 /* Nonzero if TYPE represents an integral type. Note that we do not
1034 include COMPLEX types here. Keep these checks in ascending code
1037 #define INTEGRAL_TYPE_P(TYPE) \
1038 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1039 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1040 || TREE_CODE (TYPE) == INTEGER_TYPE)
1042 /* Nonzero if TYPE represents a scalar floating-point type. */
1044 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1046 /* Nonzero if TYPE represents a complex floating-point type. */
1048 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1049 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1050 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1052 /* Nonzero if TYPE represents a vector floating-point type. */
1054 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1055 (TREE_CODE (TYPE) == VECTOR_TYPE \
1056 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1058 /* Nonzero if TYPE represents a floating-point type, including complex
1059 and vector floating-point types. The vector and complex check does
1060 not use the previous two macros to enable early folding. */
1062 #define FLOAT_TYPE_P(TYPE) \
1063 (SCALAR_FLOAT_TYPE_P (TYPE) \
1064 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1065 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1066 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1068 /* Nonzero if TYPE represents a decimal floating-point type. */
1069 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1070 (SCALAR_FLOAT_TYPE_P (TYPE) \
1071 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1073 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1074 Keep these checks in ascending code order. */
1076 #define AGGREGATE_TYPE_P(TYPE) \
1077 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1078 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1080 /* Nonzero if TYPE represents a pointer or reference type.
1081 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1082 ascending code order. */
1084 #define POINTER_TYPE_P(TYPE) \
1085 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1087 /* Nonzero if this type is a complete type. */
1088 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1090 /* Nonzero if this type is the (possibly qualified) void type. */
1091 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1093 /* Nonzero if this type is complete or is cv void. */
1094 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1095 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1097 /* Nonzero if this type is complete or is an array with unspecified bound. */
1098 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1099 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1102 /* Define many boolean fields that all tree nodes have. */
1104 /* In VAR_DECL nodes, nonzero means address of this is needed.
1105 So it cannot be in a register.
1106 In a FUNCTION_DECL, nonzero means its address is needed.
1107 So it must be compiled even if it is an inline function.
1108 In a FIELD_DECL node, it means that the programmer is permitted to
1109 construct the address of this field. This is used for aliasing
1110 purposes: see record_component_aliases.
1111 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1112 In LABEL_DECL nodes, it means a goto for this label has been seen
1113 from a place outside all binding contours that restore stack levels.
1114 In ..._TYPE nodes, it means that objects of this type must
1115 be fully addressable. This means that pieces of this
1116 object cannot go into register parameters, for example.
1117 In IDENTIFIER_NODEs, this means that some extern decl for this name
1118 had its address taken. That matters for inline functions. */
1119 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1121 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1122 exit of a function. Calls for which this is true are candidates for tail
1123 call optimizations. */
1124 #define CALL_EXPR_TAILCALL(NODE) \
1125 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1127 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1128 CASE_LOW operand has been processed. */
1129 #define CASE_LOW_SEEN(NODE) \
1130 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1132 /* In a VAR_DECL, nonzero means allocate static storage.
1133 In a FUNCTION_DECL, nonzero if function has been defined.
1134 In a CONSTRUCTOR, nonzero means allocate static storage.
1136 ??? This is also used in lots of other nodes in unclear ways which
1137 should be cleaned up some day. */
1138 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1140 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
1141 should only be executed if an exception is thrown, not on normal exit
1143 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1145 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1146 CASE_HIGH operand has been processed. */
1147 #define CASE_HIGH_SEEN(NODE) \
1148 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1150 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1151 #define CALL_CANNOT_INLINE_P(NODE) ((NODE)->base.static_flag)
1153 /* In an expr node (usually a conversion) this means the node was made
1154 implicitly and should not lead to any sort of warning. In a decl node,
1155 warnings concerning the decl should be suppressed. This is used at
1156 least for used-before-set warnings, and it set after one warning is
1158 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1160 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1161 this string as an argument. */
1162 #define TREE_SYMBOL_REFERENCED(NODE) \
1163 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1165 /* Nonzero in a pointer or reference type means the data pointed to
1166 by this type can alias anything. */
1167 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1168 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1170 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1171 #define MOVE_NONTEMPORAL(NODE) \
1172 (GIMPLE_MODIFY_STMT_CHECK (NODE)->base.static_flag)
1174 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1175 there was an overflow in folding. */
1177 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1179 /* ??? This is an obsolete synonym for TREE_OVERFLOW. */
1180 #define TREE_CONSTANT_OVERFLOW(NODE) TREE_OVERFLOW(NODE)
1182 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1184 #define TREE_OVERFLOW_P(EXPR) \
1185 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1187 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1188 nonzero means name is to be accessible from outside this module.
1189 In an IDENTIFIER_NODE, nonzero means an external declaration
1190 accessible from outside this module was previously seen
1191 for this name in an inner scope. */
1192 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1194 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1195 of cached values, or is something else. */
1196 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1198 /* In a SAVE_EXPR, indicates that the original expression has already
1199 been substituted with a VAR_DECL that contains the value. */
1200 #define SAVE_EXPR_RESOLVED_P(NODE) \
1201 (TREE_CHECK (NODE, SAVE_EXPR)->base.public_flag)
1203 /* In any expression, decl, or constant, nonzero means it has side effects or
1204 reevaluation of the whole expression could produce a different value.
1205 This is set if any subexpression is a function call, a side effect or a
1206 reference to a volatile variable. In a ..._DECL, this is set only if the
1207 declaration said `volatile'. This will never be set for a constant. */
1208 #define TREE_SIDE_EFFECTS(NODE) \
1209 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1211 /* In a LABEL_DECL, nonzero means this label had its address taken
1212 and therefore can never be deleted and is a jump target for
1214 #define FORCED_LABEL(NODE) ((NODE)->base.side_effects_flag)
1216 /* Nonzero means this expression is volatile in the C sense:
1217 its address should be of type `volatile WHATEVER *'.
1218 In other words, the declared item is volatile qualified.
1219 This is used in _DECL nodes and _REF nodes.
1220 On a FUNCTION_DECL node, this means the function does not
1221 return normally. This is the same effect as setting
1222 the attribute noreturn on the function in C.
1224 In a ..._TYPE node, means this type is volatile-qualified.
1225 But use TYPE_VOLATILE instead of this macro when the node is a type,
1226 because eventually we may make that a different bit.
1228 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1229 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1231 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1232 accessing the memory pointed to won't generate a trap. However,
1233 this only applies to an object when used appropriately: it doesn't
1234 mean that writing a READONLY mem won't trap. Similarly for
1235 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1237 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1238 (or slice of the array) always belongs to the range of the array.
1239 I.e. that the access will not trap, provided that the access to
1240 the base to the array will not trap. */
1241 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1243 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1244 nonzero means it may not be the lhs of an assignment. */
1245 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1247 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1248 #define TREE_READONLY_DECL_P(NODE)\
1249 (DECL_P (NODE) && TREE_READONLY (NODE))
1251 /* Value of expression is constant. Always on in all ..._CST nodes. May
1252 also appear in an expression or decl where the value is constant. */
1253 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1255 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1256 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1257 (TYPE_CHECK (NODE)->base.constant_flag)
1259 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1260 #define DECL_UNSIGNED(NODE) \
1261 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1263 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1264 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1265 (BIT_FIELD_REF_CHECK (NODE)->base.unsigned_flag)
1267 /* In integral and pointer types, means an unsigned type. */
1268 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1270 /* Nonzero in a VAR_DECL means assembler code has been written.
1271 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1272 This is interesting in an inline function, since it might not need
1273 to be compiled separately.
1274 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1275 if the sdb debugging info for the type has been written.
1276 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1277 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1279 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1281 /* Nonzero in a _DECL if the name is used in its scope.
1282 Nonzero in an expr node means inhibit warning if value is unused.
1283 In IDENTIFIER_NODEs, this means that some extern decl for this name
1285 In a BLOCK, this means that the block contains variables that are used. */
1286 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1288 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1289 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1290 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1292 /* In a CALL_EXPR, means that it's safe to use the target of the call
1293 expansion as the return slot for a call that returns in memory. */
1294 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->base.private_flag)
1296 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1297 reference (and the TREE_TYPE is a pointer to the true type). */
1298 #define DECL_BY_REFERENCE(NODE) \
1299 (DECL_COMMON_CHECK (NODE)->base.private_flag)
1301 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1302 thunked-to function. */
1303 #define CALL_FROM_THUNK_P(NODE) \
1304 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1306 /* In a type, nonzero means that all objects of the type are guaranteed by the
1307 language or front-end to be properly aligned, so we can indicate that a MEM
1308 of this type is aligned at least to the alignment of the type, even if it
1309 doesn't appear that it is. We see this, for example, in object-oriented
1310 languages where a tag field may show this is an object of a more-aligned
1311 variant of the more generic type.
1313 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1315 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1317 /* Used in classes in C++. */
1318 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1319 /* Used in classes in C++.
1320 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1321 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1323 /* Nonzero in a _DECL if the use of the name is defined as a
1324 deprecated feature by __attribute__((deprecated)). */
1325 #define TREE_DEPRECATED(NODE) \
1326 ((NODE)->base.deprecated_flag)
1328 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1329 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1330 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1331 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1333 /* Value of expression is function invariant. A strict subset of
1334 TREE_CONSTANT, such an expression is constant over any one function
1335 invocation, though not across different invocations. May appear in
1336 any expression node. */
1337 #define TREE_INVARIANT(NODE) ((NODE)->base.invariant_flag)
1339 /* These flags are available for each language front end to use internally. */
1340 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1341 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1342 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1343 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1344 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1345 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1346 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1348 /* Define additional fields and accessors for nodes representing constants. */
1350 /* In an INTEGER_CST node. These two together make a 2-word integer.
1351 If the data type is signed, the value is sign-extended to 2 words
1352 even though not all of them may really be in use.
1353 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1354 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1355 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1356 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1358 #define INT_CST_LT(A, B) \
1359 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1360 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1361 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1363 #define INT_CST_LT_UNSIGNED(A, B) \
1364 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1365 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1366 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1367 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1368 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1370 struct tree_int_cst GTY(())
1372 struct tree_common common;
1376 /* In a REAL_CST node. struct real_value is an opaque entity, with
1377 manipulators defined in real.h. We don't want tree.h depending on
1378 real.h and transitively on tm.h. */
1381 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1382 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1384 struct tree_real_cst GTY(())
1386 struct tree_common common;
1387 struct real_value * real_cst_ptr;
1390 /* In a STRING_CST */
1391 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1392 #define TREE_STRING_POINTER(NODE) \
1393 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1395 struct tree_string GTY(())
1397 struct tree_common common;
1402 /* In a COMPLEX_CST node. */
1403 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1404 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1406 struct tree_complex GTY(())
1408 struct tree_common common;
1413 /* In a VECTOR_CST node. */
1414 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1416 struct tree_vector GTY(())
1418 struct tree_common common;
1424 /* Define fields and accessors for some special-purpose tree nodes. */
1426 #define IDENTIFIER_LENGTH(NODE) \
1427 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1428 #define IDENTIFIER_POINTER(NODE) \
1429 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1430 #define IDENTIFIER_HASH_VALUE(NODE) \
1431 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1433 /* Translate a hash table identifier pointer to a tree_identifier
1434 pointer, and vice versa. */
1436 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1437 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1438 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1440 struct tree_identifier GTY(())
1442 struct tree_common common;
1443 struct ht_identifier id;
1446 /* In a TREE_LIST node. */
1447 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1448 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1450 struct tree_list GTY(())
1452 struct tree_common common;
1457 /* In a TREE_VEC node. */
1458 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1459 #define TREE_VEC_END(NODE) \
1460 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1462 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1464 struct tree_vec GTY(())
1466 struct tree_common common;
1468 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1471 /* In a CONSTRUCTOR node. */
1472 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1474 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1475 value of each element (stored within VAL). IX must be a scratch variable
1476 of unsigned integer type. */
1477 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1478 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1480 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1484 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1485 the value of each element (stored within VAL) and its index (stored
1486 within INDEX). IX must be a scratch variable of unsigned integer type. */
1487 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1488 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1490 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1491 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1495 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1496 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1498 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1499 _ce___->index = INDEX; \
1500 _ce___->value = VALUE; \
1503 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1504 element. INDEX can optionally design the position of VALUE: in arrays,
1505 it is the index where VALUE has to be placed; in structures, it is the
1506 FIELD_DECL of the member. */
1507 typedef struct constructor_elt_d GTY(())
1513 DEF_VEC_O(constructor_elt);
1514 DEF_VEC_ALLOC_O(constructor_elt,gc);
1516 struct tree_constructor GTY(())
1518 struct tree_common common;
1519 VEC(constructor_elt,gc) *elts;
1522 /* Define fields and accessors for some nodes that represent expressions. */
1524 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1525 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1526 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1527 && integer_zerop (TREE_OPERAND (NODE, 0)))
1529 /* In ordinary expression nodes. */
1530 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1531 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1533 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1534 length. Its value includes the length operand itself; that is,
1535 the minimum valid length is 1.
1536 Note that we have to bypass the use of TREE_OPERAND to access
1537 that field to avoid infinite recursion in expanding the macros. */
1538 #define VL_EXP_OPERAND_LENGTH(NODE) \
1539 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1541 /* In gimple statements. */
1542 #define GIMPLE_STMT_OPERAND(NODE, I) GIMPLE_STMT_OPERAND_CHECK (NODE, I)
1543 #define GIMPLE_STMT_LOCUS(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.locus)
1544 #define GIMPLE_STMT_BLOCK(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.block)
1546 /* In a LOOP_EXPR node. */
1547 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1549 /* The source location of this expression. Non-tree_exp nodes such as
1550 decls and constants can be shared among multiple locations, so
1552 #define EXPR_LOCATION(NODE) expr_location ((NODE))
1553 #define SET_EXPR_LOCATION(NODE, FROM) set_expr_location ((NODE), (FROM))
1554 #define EXPR_HAS_LOCATION(NODE) expr_has_location ((NODE))
1555 #define EXPR_LOCUS(NODE) expr_locus ((NODE))
1556 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1557 #define EXPR_FILENAME(NODE) *(expr_filename ((NODE)))
1558 #define EXPR_LINENO(NODE) *(expr_lineno ((NODE)))
1560 /* True if a tree is an expression or statement that can have a
1562 #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE) || GIMPLE_STMT_P (NODE))
1564 /* In a TARGET_EXPR node. */
1565 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1566 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1567 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1569 /* DECL_EXPR accessor. This gives access to the DECL associated with
1570 the given declaration statement. */
1571 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1573 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1575 /* SWITCH_EXPR accessors. These give access to the condition, body and
1576 original condition type (before any compiler conversions)
1577 of the switch statement, respectively. */
1578 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1579 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1580 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1582 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1583 of a case label, respectively. */
1584 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1585 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1586 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1588 /* The operands of a TARGET_MEM_REF. */
1589 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1590 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1591 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1592 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1593 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1594 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1595 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1597 /* The operands of a BIND_EXPR. */
1598 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1599 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1600 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1602 /* GOTO_EXPR accessor. This gives access to the label associated with
1603 a goto statement. */
1604 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1606 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1607 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1608 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1610 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1611 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1612 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1613 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1614 /* Nonzero if we want to create an ASM_INPUT instead of an
1615 ASM_OPERAND with no operands. */
1616 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1617 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1619 /* COND_EXPR accessors. */
1620 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1621 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1622 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1624 /* Accessors for the chains of recurrences. */
1625 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1626 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1627 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1628 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1630 /* LABEL_EXPR accessor. This gives access to the label associated with
1631 the given label expression. */
1632 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1634 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1635 accessors for SSA operands. */
1637 /* CATCH_EXPR accessors. */
1638 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1639 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1641 /* EH_FILTER_EXPR accessors. */
1642 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1643 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1644 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1646 /* CHANGE_DYNAMIC_TYPE_EXPR accessors. */
1647 #define CHANGE_DYNAMIC_TYPE_NEW_TYPE(NODE) \
1648 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 0)
1649 #define CHANGE_DYNAMIC_TYPE_LOCATION(NODE) \
1650 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 1)
1652 /* OBJ_TYPE_REF accessors. */
1653 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1654 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1655 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1657 /* ASSERT_EXPR accessors. */
1658 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1659 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1661 /* CALL_EXPR accessors.
1663 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1664 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1665 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1666 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1667 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1669 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1670 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1671 the argument count is zero when checking is enabled. Instead, do
1672 the pointer arithmetic to advance past the 3 fixed operands in a
1673 CALL_EXPR. That produces a valid pointer to just past the end of the
1674 operand array, even if it's not valid to dereference it. */
1675 #define CALL_EXPR_ARGP(NODE) \
1676 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1678 /* OpenMP directive and clause accessors. */
1680 #define OMP_BODY(NODE) \
1681 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1682 #define OMP_CLAUSES(NODE) \
1683 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1685 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1686 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1687 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1688 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1690 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1691 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1692 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1693 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1694 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1695 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1697 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1698 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1700 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1702 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1703 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1705 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1707 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1709 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1710 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1712 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1713 #define OMP_CLAUSE_DECL(NODE) \
1714 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1715 OMP_CLAUSE_PRIVATE, \
1716 OMP_CLAUSE_COPYPRIVATE), 0)
1718 /* True on an OMP_SECTION statement that was the last lexical member.
1719 This status is meaningful in the implementation of lastprivate. */
1720 #define OMP_SECTION_LAST(NODE) \
1721 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1723 /* True on an OMP_RETURN statement if the return does not require a
1724 thread synchronization via some sort of barrier. The exact barrier
1725 that would otherwise be emitted is dependent on the OMP statement
1726 with which this return is associated. */
1727 #define OMP_RETURN_NOWAIT(NODE) \
1728 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1730 /* True on an OMP_PARALLEL statement if it represents an explicit
1731 combined parallel work-sharing constructs. */
1732 #define OMP_PARALLEL_COMBINED(NODE) \
1733 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1735 /* True on a PRIVATE clause if its decl is kept around for debugging
1736 information only and its DECL_VALUE_EXPR is supposed to point
1737 to what it has been remapped to. */
1738 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1739 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1741 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1742 decl is present in the chain. */
1743 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1744 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1746 #define OMP_CLAUSE_IF_EXPR(NODE) \
1747 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1748 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1749 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1750 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1751 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1753 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1754 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1755 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1756 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1757 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1758 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1759 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1760 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1762 enum omp_clause_schedule_kind
1764 OMP_CLAUSE_SCHEDULE_STATIC,
1765 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1766 OMP_CLAUSE_SCHEDULE_GUIDED,
1767 OMP_CLAUSE_SCHEDULE_RUNTIME
1770 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1771 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1773 enum omp_clause_default_kind
1775 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1776 OMP_CLAUSE_DEFAULT_SHARED,
1777 OMP_CLAUSE_DEFAULT_NONE,
1778 OMP_CLAUSE_DEFAULT_PRIVATE
1781 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1782 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1784 struct tree_exp GTY(())
1786 struct tree_common common;
1789 tree GTY ((special ("tree_exp"),
1790 desc ("TREE_CODE ((tree) &%0)")))
1794 /* SSA_NAME accessors. */
1796 /* Returns the variable being referenced. Once released, this is the
1797 only field that can be relied upon. */
1798 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1800 /* Returns the statement which defines this reference. Note that
1801 we use the same field when chaining SSA_NAME nodes together on
1802 the SSA_NAME freelist. */
1803 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1805 /* Returns the SSA version number of this SSA name. Note that in
1806 tree SSA, version numbers are not per variable and may be recycled. */
1807 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1809 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1810 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1812 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1813 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1815 /* Nonzero if this SSA_NAME expression is currently on the free list of
1816 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1817 has no meaning for an SSA_NAME. */
1818 #define SSA_NAME_IN_FREE_LIST(NODE) \
1819 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1821 /* Nonzero if this SSA_NAME is the default definition for the
1822 underlying symbol. A default SSA name is created for symbol S if
1823 the very first reference to S in the function is a read operation.
1824 Default definitions are always created by an empty statement and
1825 belong to no basic block. */
1826 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1827 SSA_NAME_CHECK (NODE)->base.volatile_flag
1829 /* Attributes for SSA_NAMEs for pointer-type variables. */
1830 #define SSA_NAME_PTR_INFO(N) \
1831 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1833 /* Get the value of this SSA_NAME, if available. */
1834 #define SSA_NAME_VALUE(N) \
1835 SSA_NAME_CHECK (N)->ssa_name.value_handle
1837 #ifndef _TREE_FLOW_H
1838 struct ptr_info_def;
1843 /* Immediate use linking structure. This structure is used for maintaining
1844 a doubly linked list of uses of an SSA_NAME. */
1845 typedef struct ssa_use_operand_d GTY(())
1847 struct ssa_use_operand_d* GTY((skip(""))) prev;
1848 struct ssa_use_operand_d* GTY((skip(""))) next;
1849 tree GTY((skip(""))) stmt;
1850 tree *GTY((skip(""))) use;
1851 } ssa_use_operand_t;
1853 /* Return the immediate_use information for an SSA_NAME. */
1854 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1856 struct tree_ssa_name GTY(())
1858 struct tree_common common;
1860 /* _DECL wrapped by this SSA name. */
1863 /* SSA version number. */
1864 unsigned int version;
1866 /* Pointer attributes used for alias analysis. */
1867 struct ptr_info_def *ptr_info;
1869 /* Value for SSA name used by various passes.
1871 Right now only invariants are allowed to persist beyond a pass in
1872 this field; in the future we will allow VALUE_HANDLEs to persist
1876 /* Immediate uses list for this SSA_NAME. */
1877 struct ssa_use_operand_d imm_uses;
1880 /* In a PHI_NODE node. */
1882 /* These 2 macros should be considered off limits for use by developers. If
1883 you wish to access the use or def fields of a PHI_NODE in the SSA
1884 optimizers, use the accessor macros found in tree-ssa-operands.h.
1885 These two macros are to be used only by those accessor macros, and other
1886 select places where we *absolutely* must take the address of the tree. */
1888 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1889 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1891 /* PHI_NODEs for each basic block are chained together in a single linked
1892 list. The head of the list is linked from the block annotation, and
1893 the link to the next PHI is in PHI_CHAIN. */
1894 #define PHI_CHAIN(NODE) PHI_NODE_CHECK (NODE)->phi.chain
1896 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1897 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1898 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1899 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1900 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1901 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1903 struct phi_arg_d GTY(())
1905 /* imm_use MUST be the first element in struct because we do some
1906 pointer arithmetic with it. See phi_arg_index_from_use. */
1907 struct ssa_use_operand_d imm_use;
1911 struct tree_phi_node GTY(())
1913 struct tree_base common;
1919 /* Basic block holding this PHI node. */
1920 struct basic_block_def *bb;
1922 /* Arguments of the PHI node. These are maintained in the same
1923 order as predecessor edge vector BB->PREDS. */
1924 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1928 #define OMP_CLAUSE_CODE(NODE) \
1929 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1931 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1932 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1934 #define OMP_CLAUSE_CODE(NODE) \
1935 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1937 #define OMP_CLAUSE_OPERAND(NODE, I) \
1938 OMP_CLAUSE_ELT_CHECK (NODE, I)
1940 struct tree_omp_clause GTY(())
1942 struct tree_common common;
1943 enum omp_clause_code code;
1944 union omp_clause_subcode {
1945 enum omp_clause_default_kind default_kind;
1946 enum omp_clause_schedule_kind schedule_kind;
1947 enum tree_code reduction_code;
1948 } GTY ((skip)) subcode;
1949 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1953 struct varray_head_tag;
1955 /* In a BLOCK node. */
1956 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1957 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1958 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1959 /* Note: when changing this, make sure to find the places
1960 that use chainon or nreverse. */
1961 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1962 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1963 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1965 /* Nonzero means that this block is prepared to handle exceptions
1966 listed in the BLOCK_VARS slot. */
1967 #define BLOCK_HANDLER_BLOCK(NODE) \
1968 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1970 /* An index number for this block. These values are not guaranteed to
1971 be unique across functions -- whether or not they are depends on
1972 the debugging output format in use. */
1973 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1975 /* If block reordering splits a lexical block into discontiguous
1976 address ranges, we'll make a copy of the original block.
1978 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1979 In that case, we have one source block that has been replicated
1980 (through inlining or unrolling) into many logical blocks, and that
1981 these logical blocks have different physical variables in them.
1983 In this case, we have one logical block split into several
1984 non-contiguous address ranges. Most debug formats can't actually
1985 represent this idea directly, so we fake it by creating multiple
1986 logical blocks with the same variables in them. However, for those
1987 that do support non-contiguous regions, these allow the original
1988 logical block to be reconstructed, along with the set of address
1991 One of the logical block fragments is arbitrarily chosen to be
1992 the ORIGIN. The other fragments will point to the origin via
1993 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1994 be null. The list of fragments will be chained through
1995 BLOCK_FRAGMENT_CHAIN from the origin. */
1997 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1998 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2000 /* For an inlined function, this gives the location where it was called
2001 from. This is only set in the top level block, which corresponds to the
2002 inlined function scope. This is used in the debug output routines. */
2004 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2006 struct tree_block GTY(())
2008 struct tree_common common;
2010 unsigned handler_block_flag : 1;
2011 unsigned abstract_flag : 1;
2012 unsigned block_num : 30;
2017 tree abstract_origin;
2018 tree fragment_origin;
2019 tree fragment_chain;
2023 /* Define fields and accessors for nodes representing data types. */
2025 /* See tree.def for documentation of the use of these fields.
2026 Look at the documentation of the various ..._TYPE tree codes.
2028 Note that the type.values, type.minval, and type.maxval fields are
2029 overloaded and used for different macros in different kinds of types.
2030 Each macro must check to ensure the tree node is of the proper kind of
2031 type. Note also that some of the front-ends also overload these fields,
2032 so they must be checked as well. */
2034 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2035 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2036 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2037 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
2038 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2039 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2040 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2041 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2042 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2043 (INTEGER_TYPE_CHECK (NODE)->type.values \
2044 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2045 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2046 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2047 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2048 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2049 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2050 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2051 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2052 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2053 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2054 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2055 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2056 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2057 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2058 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2059 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2060 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2061 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2062 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2063 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2065 /* The "canonical" type for this type node, which can be used to
2066 compare the type for equality with another type. If two types are
2067 equal (based on the semantics of the language), then they will have
2068 equivalent TYPE_CANONICAL entries.
2070 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2071 be used for comparison against other types. Instead, the type is
2072 said to require structural equality checks, described in
2073 TYPE_STRUCTURAL_EQUALITY_P. */
2074 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2075 /* Indicates that the type node requires structural equality
2076 checks. The compiler will need to look at the composition of the
2077 type to determine whether it is equal to another type, rather than
2078 just comparing canonical type pointers. For instance, we would need
2079 to look at the return and parameter types of a FUNCTION_TYPE
2081 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2082 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2083 type node requires structural equality. */
2084 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2085 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2087 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2088 in the debugging output. We use this to describe a vector as a
2089 structure containing an array. */
2090 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2092 /* For record and union types, information about this type, as a base type
2094 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2096 /* For non record and union types, used in a language-dependent way. */
2097 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2099 /* The (language-specific) typed-based alias set for this type.
2100 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2101 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2102 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2103 type can alias objects of any type. */
2104 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2106 /* Nonzero iff the typed-based alias set for this type has been
2108 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2110 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2112 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2114 /* The alignment necessary for objects of this type.
2115 The value is an int, measured in bits. */
2116 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2118 /* 1 if the alignment for this type was requested by "aligned" attribute,
2119 0 if it is the default for this type. */
2120 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2122 /* The alignment for NODE, in bytes. */
2123 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2125 /* If your language allows you to declare types, and you want debug info
2126 for them, then you need to generate corresponding TYPE_DECL nodes.
2127 These "stub" TYPE_DECL nodes have no name, and simply point at the
2128 type node. You then set the TYPE_STUB_DECL field of the type node
2129 to point back at the TYPE_DECL node. This allows the debug routines
2130 to know that the two nodes represent the same type, so that we only
2131 get one debug info record for them. */
2132 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2134 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2135 has BLKmode only because it lacks the alignment requirement for
2137 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2139 /* In an INTEGER_TYPE, it means the type represents a size. We use
2140 this both for validity checking and to permit optimizations that
2141 are unsafe for other types. Note that the C `size_t' type should
2142 *not* have this flag set. The `size_t' type is simply a typedef
2143 for an ordinary integer type that happens to be the type of an
2144 expression returned by `sizeof'; `size_t' has no special
2145 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2146 always actual sizes. */
2147 #define TYPE_IS_SIZETYPE(NODE) \
2148 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2150 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
2151 pointer depressed. */
2152 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
2153 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2155 /* Nonzero in a type considered volatile as a whole. */
2156 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2158 /* Means this type is const-qualified. */
2159 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2161 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2163 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2165 /* There is a TYPE_QUAL value for each type qualifier. They can be
2166 combined by bitwise-or to form the complete set of qualifiers for a
2169 #define TYPE_UNQUALIFIED 0x0
2170 #define TYPE_QUAL_CONST 0x1
2171 #define TYPE_QUAL_VOLATILE 0x2
2172 #define TYPE_QUAL_RESTRICT 0x4
2174 /* The set of type qualifiers for this type. */
2175 #define TYPE_QUALS(NODE) \
2176 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2177 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2178 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2180 /* These flags are available for each language front end to use internally. */
2181 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2182 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2183 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2184 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2185 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2186 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2187 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2189 /* Used to keep track of visited nodes in tree traversals. This is set to
2190 0 by copy_node and make_node. */
2191 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2193 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2194 that distinguish string from array of char).
2195 If set in a INTEGER_TYPE, indicates a character type. */
2196 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2198 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2199 object of the given ARRAY_TYPE. This allows temporaries to be
2201 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2202 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2204 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2205 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2206 (((unsigned HOST_WIDE_INT) 1) \
2207 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2209 /* Set precision to n when we have 2^n sub-parts of the vector. */
2210 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2211 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2213 /* Indicates that objects of this type must be initialized by calling a
2214 function when they are created. */
2215 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2216 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2218 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2219 the same way that the first union alternative would be passed. */
2220 #define TYPE_TRANSPARENT_UNION(NODE) \
2221 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2223 /* For an ARRAY_TYPE, indicates that it is not permitted to
2224 take the address of a component of the type. */
2225 #define TYPE_NONALIASED_COMPONENT(NODE) \
2226 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2228 /* Indicated that objects of this type should be laid out in as
2229 compact a way as possible. */
2230 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2232 /* Used by type_contains_placeholder_p to avoid recomputation.
2233 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2234 this field directly. */
2235 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2236 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2240 struct tree_type GTY(())
2242 struct tree_common common;
2249 unsigned int precision : 9;
2250 ENUM_BITFIELD(machine_mode) mode : 7;
2252 unsigned string_flag : 1;
2253 unsigned no_force_blk_flag : 1;
2254 unsigned needs_constructing_flag : 1;
2255 unsigned transparent_union_flag : 1;
2256 unsigned packed_flag : 1;
2257 unsigned restrict_flag : 1;
2258 unsigned contains_placeholder_bits : 2;
2260 unsigned lang_flag_0 : 1;
2261 unsigned lang_flag_1 : 1;
2262 unsigned lang_flag_2 : 1;
2263 unsigned lang_flag_3 : 1;
2264 unsigned lang_flag_4 : 1;
2265 unsigned lang_flag_5 : 1;
2266 unsigned lang_flag_6 : 1;
2267 unsigned user_align : 1;
2272 union tree_type_symtab {
2273 int GTY ((tag ("0"))) address;
2274 char * GTY ((tag ("1"))) pointer;
2275 struct die_struct * GTY ((tag ("2"))) die;
2276 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2277 descbits ("2"))) symtab;
2286 HOST_WIDE_INT alias_set;
2287 /* Points to a structure whose details depend on the language in use. */
2288 struct lang_type *lang_specific;
2291 /* Define accessor macros for information about type inheritance
2294 A "basetype" means a particular usage of a data type for inheritance
2295 in another type. Each such basetype usage has its own "binfo"
2296 object to describe it. The binfo object is a TREE_VEC node.
2298 Inheritance is represented by the binfo nodes allocated for a
2299 given type. For example, given types C and D, such that D is
2300 inherited by C, 3 binfo nodes will be allocated: one for describing
2301 the binfo properties of C, similarly one for D, and one for
2302 describing the binfo properties of D as a base type for C.
2303 Thus, given a pointer to class C, one can get a pointer to the binfo
2304 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2306 /* BINFO specific flags. */
2308 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2309 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2311 /* Flags for language dependent use. */
2312 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2313 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2314 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2315 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2316 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2317 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2318 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2320 /* The actual data type node being inherited in this basetype. */
2321 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2323 /* The offset where this basetype appears in its containing type.
2324 BINFO_OFFSET slot holds the offset (in bytes)
2325 from the base of the complete object to the base of the part of the
2326 object that is allocated on behalf of this `type'.
2327 This is always 0 except when there is multiple inheritance. */
2329 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2330 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2332 /* The virtual function table belonging to this basetype. Virtual
2333 function tables provide a mechanism for run-time method dispatching.
2334 The entries of a virtual function table are language-dependent. */
2336 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2338 /* The virtual functions in the virtual function table. This is
2339 a TREE_LIST that is used as an initial approximation for building
2340 a virtual function table for this basetype. */
2341 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2343 /* A vector of binfos for the direct basetypes inherited by this
2346 If this basetype describes type D as inherited in C, and if the
2347 basetypes of D are E and F, then this vector contains binfos for
2348 inheritance of E and F by C. */
2349 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2351 /* The number of basetypes for NODE. */
2352 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2354 /* Accessor macro to get to the Nth base binfo of this binfo. */
2355 #define BINFO_BASE_BINFO(NODE,N) \
2356 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2357 #define BINFO_BASE_ITERATE(NODE,N,B) \
2358 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2359 #define BINFO_BASE_APPEND(NODE,T) \
2360 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2362 /* For a BINFO record describing a virtual base class, i.e., one where
2363 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2364 base. The actual contents are language-dependent. In the C++
2365 front-end this field is an INTEGER_CST giving an offset into the
2366 vtable where the offset to the virtual base can be found. */
2367 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2369 /* Indicates the accesses this binfo has to its bases. The values are
2370 access_public_node, access_protected_node or access_private_node.
2371 If this array is not present, public access is implied. */
2372 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2374 #define BINFO_BASE_ACCESS(NODE,N) \
2375 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2376 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2377 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2379 /* The index in the VTT where this subobject's sub-VTT can be found.
2380 NULL_TREE if there is no sub-VTT. */
2381 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2383 /* The index in the VTT where the vptr for this subobject can be
2384 found. NULL_TREE if there is no secondary vptr in the VTT. */
2385 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2387 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2388 inheriting this base for non-virtual bases. For virtual bases it
2389 points either to the binfo for which this is a primary binfo, or to
2390 the binfo of the most derived type. */
2391 #define BINFO_INHERITANCE_CHAIN(NODE) \
2392 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2394 struct tree_binfo GTY (())
2396 struct tree_common common;
2402 VEC(tree,gc) *base_accesses;
2408 VEC(tree,none) base_binfos;
2412 /* Define fields and accessors for nodes representing declared names. */
2414 /* Nonzero if DECL represents a variable for the SSA passes. */
2415 #define SSA_VAR_P(DECL) \
2416 (TREE_CODE (DECL) == VAR_DECL \
2417 || TREE_CODE (DECL) == PARM_DECL \
2418 || TREE_CODE (DECL) == RESULT_DECL \
2420 || (TREE_CODE (DECL) == SSA_NAME \
2421 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2422 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2423 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2424 || MTAG_P (SSA_NAME_VAR (DECL)))))
2429 /* Enumerate visibility settings. */
2430 #ifndef SYMBOL_VISIBILITY_DEFINED
2431 #define SYMBOL_VISIBILITY_DEFINED
2432 enum symbol_visibility
2435 VISIBILITY_PROTECTED,
2444 /* This is the name of the object as written by the user.
2445 It is an IDENTIFIER_NODE. */
2446 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2448 /* Every ..._DECL node gets a unique number. */
2449 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2451 /* These two fields describe where in the source code the declaration
2452 was. If the declaration appears in several places (as for a C
2453 function that is declared first and then defined later), this
2454 information should refer to the definition. */
2455 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2456 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2457 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2458 #ifdef USE_MAPPED_LOCATION
2459 #define DECL_IS_BUILTIN(DECL) \
2460 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2462 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2465 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2466 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2467 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2468 points to either the FUNCTION_DECL for the containing function,
2469 the RECORD_TYPE or UNION_TYPE for the containing type, or
2470 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2472 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2473 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2474 struct tree_decl_minimal GTY(())
2476 struct tree_common common;
2483 /* When computing aliasing information, we represent the memory pointed-to
2484 by pointers with artificial variables called "memory tags" (MT). There
2485 are two kinds of tags, namely symbol and name:
2487 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2488 represent all the pointed-to locations and variables pointed-to by
2489 the same pointer symbol. Usually, this set is computed using
2490 type-based analysis (i.e., alias set classes), but this may not
2493 Name tags (NMT) are used in flow-sensitive points-to alias
2494 analysis, they represent the variables and memory locations
2495 pointed-to by a specific SSA_NAME pointer.
2497 In general, given a pointer P with a symbol tag SMT, the alias set
2498 of SMT should be the union of all the alias sets of the NMTs of
2499 every SSA_NAME for P. */
2500 struct tree_memory_tag GTY(())
2502 struct tree_decl_minimal common;
2504 bitmap GTY ((skip)) aliases;
2506 unsigned int is_global:1;
2509 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2510 #define MTAG_ALIASES(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.aliases)
2512 struct tree_struct_field_tag GTY(())
2514 struct tree_memory_tag common;
2516 /* Parent variable. */
2519 /* Offset inside structure. */
2520 unsigned HOST_WIDE_INT offset;
2522 /* Size of the field. */
2523 unsigned HOST_WIDE_INT size;
2525 /* Alias set for a DECL_NONADDRESSABLE_P field. Otherwise -1. */
2526 HOST_WIDE_INT alias_set;
2528 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2529 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2530 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2531 #define SFT_NONADDRESSABLE_P(NODE) \
2532 (STRUCT_FIELD_TAG_CHECK (NODE)->sft.alias_set != -1)
2533 #define SFT_ALIAS_SET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.alias_set)
2535 /* Memory Partition Tags (MPTs) group memory symbols under one
2536 common name for the purposes of placing memory PHI nodes. */
2538 struct tree_memory_partition_tag GTY(())
2540 struct tree_memory_tag common;
2542 /* Set of symbols grouped under this MPT. */
2546 #define MPT_SYMBOLS(NODE) (MEMORY_PARTITION_TAG_CHECK (NODE)->mpt.symbols)
2549 /* For any sort of a ..._DECL node, this points to the original (abstract)
2550 decl node which this decl is an instance of, or else it is NULL indicating
2551 that this decl is not an instance of some other decl. For example,
2552 in a nested declaration of an inline function, this points back to the
2554 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2556 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2557 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2558 #define DECL_ORIGIN(NODE) \
2559 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2561 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2562 inline instance of some original (abstract) decl from an inline function;
2563 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2564 nodes can also have their abstract origin set to themselves. */
2565 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2566 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2568 /* In a DECL this is the field where attributes are stored. */
2569 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2571 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2572 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2573 For a VAR_DECL, holds the initial value.
2574 For a PARM_DECL, not used--default
2575 values for parameters are encoded in the type of the function,
2576 not in the PARM_DECL slot.
2577 For a FIELD_DECL, this is used for enumeration values and the C
2578 frontend uses it for temporarily storing bitwidth of bitfields.
2580 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2581 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2583 /* Holds the size of the datum, in bits, as a tree expression.
2584 Need not be constant. */
2585 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2586 /* Likewise for the size in bytes. */
2587 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2588 /* Holds the alignment required for the datum, in bits. */
2589 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2590 /* The alignment of NODE, in bytes. */
2591 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2592 /* Set if the alignment of this DECL has been set by the user, for
2593 example with an 'aligned' attribute. */
2594 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2595 /* Holds the machine mode corresponding to the declaration of a variable or
2596 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2598 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2600 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2601 operation it is. Note, however, that this field is overloaded, with
2602 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2603 checked before any access to the former. */
2604 #define DECL_FUNCTION_CODE(NODE) \
2605 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2606 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2607 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2609 /* Nonzero for a given ..._DECL node means that the name of this node should
2610 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2611 the body of the function should also be ignored. */
2612 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2614 /* Nonzero for a given ..._DECL node means that this node represents an
2615 "abstract instance" of the given declaration (e.g. in the original
2616 declaration of an inline function). When generating symbolic debugging
2617 information, we mustn't try to generate any address information for nodes
2618 marked as "abstract instances" because we don't actually generate
2619 any code or allocate any data space for such instances. */
2620 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2622 /* Language-specific decl information. */
2623 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2625 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2626 do not allocate storage, and refer to a definition elsewhere. Note that
2627 this does not necessarily imply the entity represented by NODE
2628 has no program source-level definition in this translation unit. For
2629 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2630 DECL_EXTERNAL may be true simultaneously; that can be the case for
2631 a C99 "extern inline" function. */
2632 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2634 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2635 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2637 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2639 Also set in some languages for variables, etc., outside the normal
2640 lexical scope, such as class instance variables. */
2641 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2643 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2644 Used in FIELD_DECLs for vtable pointers.
2645 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2646 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2648 /* Used to indicate that this DECL represents a compiler-generated entity. */
2649 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2651 /* Additional flags for language-specific uses. */
2652 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2653 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2654 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2655 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2656 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2657 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2658 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2659 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2661 /* Used to indicate an alias set for the memory pointed to by this
2662 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2663 pointer (or reference) type. */
2664 #define DECL_POINTER_ALIAS_SET(NODE) \
2665 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2667 /* Nonzero if an alias set has been assigned to this declaration. */
2668 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2669 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2671 /* Nonzero for a decl which is at file scope. */
2672 #define DECL_FILE_SCOPE_P(EXP) \
2673 (! DECL_CONTEXT (EXP) \
2674 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2676 /* Nonzero for a decl that is decorated using attribute used.
2677 This indicates compiler tools that this decl needs to be preserved. */
2678 #define DECL_PRESERVE_P(DECL) \
2679 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2681 /* For function local variables of COMPLEX and VECTOR types,
2682 indicates that the variable is not aliased, and that all
2683 modifications to the variable have been adjusted so that
2684 they are killing assignments. Thus the variable may now
2685 be treated as a GIMPLE register, and use real instead of
2686 virtual ops in SSA form. */
2687 #define DECL_GIMPLE_REG_P(DECL) \
2688 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2690 /* For a DECL with pointer type, this is set if Type Based Alias
2691 Analysis should not be applied to this DECL. */
2692 #define DECL_NO_TBAA_P(DECL) \
2693 DECL_COMMON_CHECK (DECL)->decl_common.no_tbaa_flag
2695 struct tree_decl_common GTY(())
2697 struct tree_decl_minimal common;
2700 ENUM_BITFIELD(machine_mode) mode : 8;
2702 unsigned nonlocal_flag : 1;
2703 unsigned virtual_flag : 1;
2704 unsigned ignored_flag : 1;
2705 unsigned abstract_flag : 1;
2706 unsigned artificial_flag : 1;
2707 unsigned user_align : 1;
2708 unsigned preserve_flag: 1;
2709 unsigned debug_expr_is_from : 1;
2711 unsigned lang_flag_0 : 1;
2712 unsigned lang_flag_1 : 1;
2713 unsigned lang_flag_2 : 1;
2714 unsigned lang_flag_3 : 1;
2715 unsigned lang_flag_4 : 1;
2716 unsigned lang_flag_5 : 1;
2717 unsigned lang_flag_6 : 1;
2718 unsigned lang_flag_7 : 1;
2720 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2721 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2722 unsigned decl_flag_0 : 1;
2723 /* In FIELD_DECL, this is DECL_PACKED. */
2724 unsigned decl_flag_1 : 1;
2725 /* In FIELD_DECL, this is DECL_BIT_FIELD
2726 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2727 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2728 unsigned decl_flag_2 : 1;
2729 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2730 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2731 unsigned decl_flag_3 : 1;
2732 /* Logically, these two would go in a theoretical base shared by var and
2734 unsigned gimple_reg_flag : 1;
2735 /* In a DECL with pointer type, set if no TBAA should be done. */
2736 unsigned no_tbaa_flag : 1;
2737 /* Padding so that 'align' can be on a 32-bit boundary. */
2738 unsigned decl_common_unused : 2;
2740 unsigned int align : 24;
2741 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2742 unsigned int off_align : 8;
2747 tree abstract_origin;
2749 HOST_WIDE_INT pointer_alias_set;
2750 /* Points to a structure whose details depend on the language in use. */
2751 struct lang_decl *lang_specific;
2754 extern tree decl_value_expr_lookup (tree);
2755 extern void decl_value_expr_insert (tree, tree);
2757 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2758 if transformations have made this more complicated than evaluating the
2759 decl itself. This should only be used for debugging; once this field has
2760 been set, the decl itself may not legitimately appear in the function. */
2761 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2762 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2763 #define DECL_VALUE_EXPR(NODE) \
2764 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2765 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2766 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2768 /* Holds the RTL expression for the value of a variable or function.
2769 This value can be evaluated lazily for functions, variables with
2770 static storage duration, and labels. */
2771 #define DECL_RTL(NODE) \
2772 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2773 ? (NODE)->decl_with_rtl.rtl \
2774 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2776 /* Set the DECL_RTL for NODE to RTL. */
2777 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2779 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2780 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2782 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2783 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2785 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2786 NODE1, it will not be set for NODE2; this is a lazy copy. */
2787 #define COPY_DECL_RTL(NODE1, NODE2) \
2788 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2790 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2791 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2793 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2794 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2796 struct tree_decl_with_rtl GTY(())
2798 struct tree_decl_common common;
2802 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2803 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2804 of the structure. */
2805 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2807 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2808 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2809 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2810 natural alignment of the field's type). */
2811 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2813 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2814 if so, the type that was originally specified for it.
2815 TREE_TYPE may have been modified (in finish_struct). */
2816 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2818 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2819 if nonzero, indicates that the field occupies the type. */
2820 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2822 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2823 DECL_FIELD_OFFSET which are known to be always zero.
2824 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2826 #define DECL_OFFSET_ALIGN(NODE) \
2827 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2829 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2830 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2831 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2832 /* 1 if the alignment for this type was requested by "aligned" attribute,
2833 0 if it is the default for this type. */
2835 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2836 which this FIELD_DECL is defined. This information is needed when
2837 writing debugging information about vfield and vbase decls for C++. */
2838 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2840 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2841 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2843 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2845 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2847 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2849 #define DECL_NONADDRESSABLE_P(NODE) \
2850 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2852 struct tree_field_decl GTY(())
2854 struct tree_decl_common common;
2857 tree bit_field_type;
2864 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2865 dense, unique within any one function, and may be used to index arrays.
2866 If the value is -1, then no UID has been assigned. */
2867 #define LABEL_DECL_UID(NODE) \
2868 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2870 /* In LABEL_DECL nodes, nonzero means that an error message about
2871 jumping into such a binding contour has been printed for this label. */
2872 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2874 struct tree_label_decl GTY(())
2876 struct tree_decl_with_rtl common;
2877 /* Java's verifier has some need to store information about labels,
2878 and was using fields that no longer exist on labels.
2879 Once the verifier doesn't need these anymore, they should be removed. */
2883 unsigned int java_field_4;
2887 struct tree_result_decl GTY(())
2889 struct tree_decl_with_rtl common;
2892 struct tree_const_decl GTY(())
2894 struct tree_decl_with_rtl common;
2897 /* For a PARM_DECL, records the data type used to pass the argument,
2898 which may be different from the type seen in the program. */
2899 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2901 /* For PARM_DECL, holds an RTL for the stack slot or register
2902 where the data was actually passed. */
2903 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2905 struct tree_parm_decl GTY(())
2907 struct tree_decl_with_rtl common;
2912 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2913 this variable in a BIND_EXPR. */
2914 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2915 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2917 /* Used to indicate that the linkage status of this DECL is not yet known,
2918 so it should not be output now. */
2919 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2921 /* Nonzero for a given ..._DECL node means that no warnings should be
2922 generated just because this node is unused. */
2923 #define DECL_IN_SYSTEM_HEADER(NODE) \
2924 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2926 /* Used to indicate that this DECL has weak linkage. */
2927 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2929 /* Internal to the gimplifier. Indicates that the value is a formal
2930 temporary controlled by the gimplifier. */
2931 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2932 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2934 /* Used to indicate that the DECL is a dllimport. */
2935 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2937 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2938 based on a variable with a restrict qualified type. If it is,
2939 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2942 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2943 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2944 #define DECL_GET_RESTRICT_BASE(NODE) \
2945 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2946 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2947 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2949 extern tree decl_restrict_base_lookup (tree);
2950 extern void decl_restrict_base_insert (tree, tree);
2952 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2953 not be put out unless it is needed in this translation unit.
2954 Entities like this are shared across translation units (like weak
2955 entities), but are guaranteed to be generated by any translation
2956 unit that needs them, and therefore need not be put out anywhere
2957 where they are not needed. DECL_COMDAT is just a hint to the
2958 back-end; it is up to front-ends which set this flag to ensure
2959 that there will never be any harm, other than bloat, in putting out
2960 something which is DECL_COMDAT. */
2961 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2963 /* A replaceable function is one which may be replaced at link-time
2964 with an entirely different definition, provided that the
2965 replacement has the same type. For example, functions declared
2966 with __attribute__((weak)) on most systems are replaceable.
2968 COMDAT functions are not replaceable, since all definitions of the
2969 function must be equivalent. It is important that COMDAT functions
2970 not be treated as replaceable so that use of C++ template
2971 instantiations is not penalized.
2973 For example, DECL_REPLACEABLE is used to determine whether or not a
2974 function (including a template instantiation) which is not
2975 explicitly declared "inline" can be inlined. If the function is
2976 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2977 implementation chosen at link-time may be different. However, a
2978 function that is not DECL_REPLACEABLE can be inlined, since all
2979 versions of the function will be functionally identical. */
2980 #define DECL_REPLACEABLE_P(NODE) \
2981 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2983 /* The name of the object as the assembler will see it (but before any
2984 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2985 as DECL_NAME. It is an IDENTIFIER_NODE. */
2986 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2988 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2989 This is true of all DECL nodes except FIELD_DECL. */
2990 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2991 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2993 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2994 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2996 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2997 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2999 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3000 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3001 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3003 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3004 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3005 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3006 semantics of using this macro, are different than saying:
3008 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3010 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3012 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3013 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3014 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3015 DECL_ASSEMBLER_NAME (DECL1)) \
3018 /* Records the section name in a section attribute. Used to pass
3019 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3020 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3022 /* Value of the decls's visibility attribute */
3023 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3025 /* Nonzero means that the decl had its visibility specified rather than
3027 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3029 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3030 multiple translation units should be merged. */
3031 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
3033 struct tree_decl_with_vis GTY(())
3035 struct tree_decl_with_rtl common;
3036 tree assembler_name;
3039 /* Belong to VAR_DECL exclusively. */
3040 unsigned defer_output:1;
3041 unsigned hard_register:1;
3042 unsigned thread_local:1;
3043 unsigned common_flag:1;
3044 unsigned in_text_section : 1;
3045 unsigned gimple_formal_temp : 1;
3046 unsigned dllimport_flag : 1;
3047 unsigned based_on_restrict_p : 1;
3048 /* Used by C++. Might become a generic decl flag. */
3049 unsigned shadowed_for_var_p : 1;
3051 /* Don't belong to VAR_DECL exclusively. */
3052 unsigned in_system_header_flag : 1;
3053 unsigned weak_flag:1;
3054 unsigned seen_in_bind_expr : 1;
3055 unsigned comdat_flag : 1;
3056 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3057 unsigned visibility_specified : 1;
3058 /* Belong to FUNCTION_DECL exclusively. */
3059 unsigned one_only : 1;
3060 unsigned init_priority_p:1;
3062 /* Belongs to VAR_DECL exclusively. */
3063 ENUM_BITFIELD(tls_model) tls_model : 3;
3064 /* 11 unused bits. */
3067 /* In a VAR_DECL that's static,
3068 nonzero if the space is in the text section. */
3069 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3071 /* Nonzero for a given ..._DECL node means that this node should be
3072 put in .common, if possible. If a DECL_INITIAL is given, and it
3073 is not error_mark_node, then the decl cannot be put in .common. */
3074 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3076 /* In a VAR_DECL, nonzero if the decl is a register variable with
3077 an explicit asm specification. */
3078 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3080 extern tree decl_debug_expr_lookup (tree);
3081 extern void decl_debug_expr_insert (tree, tree);
3082 /* For VAR_DECL, this is set to either an expression that it was split
3083 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3084 subexpressions that it was split into. */
3085 #define DECL_DEBUG_EXPR(NODE) \
3086 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3088 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3089 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3091 /* An initializationp priority. */
3092 typedef unsigned short priority_type;
3094 extern priority_type decl_init_priority_lookup (tree);
3095 extern priority_type decl_fini_priority_lookup (tree);
3096 extern void decl_init_priority_insert (tree, priority_type);
3097 extern void decl_fini_priority_insert (tree, priority_type);
3099 /* In a non-local VAR_DECL with static storage duration, true if the
3100 variable has an initialization priority. If false, the variable
3101 will be initialized at the DEFAULT_INIT_PRIORITY. */
3102 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3103 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3105 /* For a VAR_DECL or FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set,
3106 the initialization priority of NODE. */
3107 #define DECL_INIT_PRIORITY(NODE) \
3108 (decl_init_priority_lookup (NODE))
3109 /* Set the initialization priority for NODE to VAL. */
3110 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3111 (decl_init_priority_insert (NODE, VAL))
3113 /* For a FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set, the
3114 finalization priority of NODE. */
3115 #define DECL_FINI_PRIORITY(NODE) \
3116 (decl_fini_priority_lookup (NODE))
3117 /* Set the finalization priority for NODE to VAL. */
3118 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3119 (decl_fini_priority_insert (NODE, VAL))
3121 /* The initialization priority for entities for which no explicit
3122 initialization priority has been specified. */
3123 #define DEFAULT_INIT_PRIORITY 65535
3125 /* The maximum allowed initialization priority. */
3126 #define MAX_INIT_PRIORITY 65535
3128 /* The largest priority value reserved for use by system runtime
3130 #define MAX_RESERVED_INIT_PRIORITY 100
3132 /* In a VAR_DECL, the model to use if the data should be allocated from
3133 thread-local storage. */
3134 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3136 /* In a VAR_DECL, nonzero if the data should be allocated from
3137 thread-local storage. */
3138 #define DECL_THREAD_LOCAL_P(NODE) \
3139 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
3141 struct tree_var_decl GTY(())
3143 struct tree_decl_with_vis common;
3147 /* This field is used to reference anything in decl.result and is meant only
3148 for use by the garbage collector. */
3149 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3151 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3152 Before the struct containing the FUNCTION_DECL is laid out,
3153 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3154 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3155 function. When the class is laid out, this pointer is changed
3156 to an INTEGER_CST node which is suitable for use as an index
3157 into the virtual function table.
3158 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3159 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3161 struct tree_decl_non_common GTY(())
3164 struct tree_decl_with_vis common;
3165 /* C++ uses this in namespaces. */
3167 /* C++ uses this in templates. */
3169 /* Almost all FE's use this. */
3171 /* C++ uses this in namespaces. */
3175 /* In FUNCTION_DECL, holds the decl for the return value. */
3176 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3178 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3179 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3181 /* In a FUNCTION_DECL, the saved representation of the body of the
3183 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3185 /* Nonzero in a FUNCTION_DECL means this function should be treated
3186 as if it were a malloc, meaning it returns a pointer that is
3188 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3190 /* Nonzero in a FUNCTION_DECL means this function may return more
3192 #define DECL_IS_RETURNS_TWICE(NODE) \
3193 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3195 /* Nonzero in a FUNCTION_DECL means this function should be treated
3196 as "pure" function (like const function, but may read global memory). */
3197 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3199 /* Nonzero in a FUNCTION_DECL means this function should be treated
3200 as "novops" function (function that does not read global memory,
3201 but may have arbitrary side effects). */
3202 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3204 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3205 at the beginning or end of execution. */
3206 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3207 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3209 #define DECL_STATIC_DESTRUCTOR(NODE) \
3210 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3212 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3213 be instrumented with calls to support routines. */
3214 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3215 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3217 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3218 disabled in this function. */
3219 #define DECL_NO_LIMIT_STACK(NODE) \
3220 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3222 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3223 static chain is not needed. */
3224 #define DECL_NO_STATIC_CHAIN(NODE) \
3225 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3227 /* Nonzero for a decl that cgraph has decided should be inlined into
3228 at least one call site. It is not meaningful to look at this
3229 directly; always use cgraph_function_possibly_inlined_p. */
3230 #define DECL_POSSIBLY_INLINED(DECL) \
3231 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3233 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3234 where it is called. */
3235 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3237 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3238 such as via the `inline' keyword in C/C++. This flag controls the linkage
3239 semantics of 'inline'; whether or not the function is inlined is
3240 controlled by DECL_INLINE. */
3241 #define DECL_DECLARED_INLINE_P(NODE) \
3242 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3244 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3245 that describes the status of this function. */
3246 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3248 /* In a FUNCTION_DECL, nonzero means a built in function. */
3249 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3251 /* For a builtin function, identify which part of the compiler defined it. */
3252 #define DECL_BUILT_IN_CLASS(NODE) \
3253 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3255 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3256 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3258 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3259 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3261 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3262 arguments/result/saved_tree fields by front ends. It was either inherit
3263 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3264 which seemed a bit strange. */
3266 struct tree_function_decl GTY(())
3268 struct tree_decl_non_common common;
3270 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3271 DECL_FUNCTION_CODE. Otherwise unused. */
3272 enum built_in_function function_code;
3274 unsigned static_ctor_flag : 1;
3275 unsigned static_dtor_flag : 1;
3276 unsigned uninlinable : 1;
3277 unsigned possibly_inlined : 1;
3278 unsigned novops_flag : 1;
3279 unsigned returns_twice_flag : 1;
3280 unsigned malloc_flag : 1;
3281 unsigned pure_flag : 1;
3283 unsigned declared_inline_flag : 1;
3284 unsigned regdecl_flag : 1;
3285 unsigned inline_flag : 1;
3286 unsigned no_instrument_function_entry_exit : 1;
3287 unsigned no_limit_stack : 1;
3288 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3293 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3294 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3296 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3297 into stabs. Instead it will generate cross reference ('x') of names.
3298 This uses the same flag as DECL_EXTERNAL. */
3299 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3300 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3302 struct tree_type_decl GTY(())
3304 struct tree_decl_non_common common;
3308 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3309 To reduce overhead, the nodes containing the statements are not trees.
3310 This avoids the overhead of tree_common on all linked list elements.
3312 Use the interface in tree-iterator.h to access this node. */
3314 #define STATEMENT_LIST_HEAD(NODE) \
3315 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3316 #define STATEMENT_LIST_TAIL(NODE) \
3317 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3319 struct tree_statement_list_node
3320 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3322 struct tree_statement_list_node *prev;
3323 struct tree_statement_list_node *next;
3327 struct tree_statement_list
3330 struct tree_common common;
3331 struct tree_statement_list_node *head;
3332 struct tree_statement_list_node *tail;
3335 #define VALUE_HANDLE_ID(NODE) \
3336 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3338 #define VALUE_HANDLE_EXPR_SET(NODE) \
3339 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3341 /* Defined and used in tree-ssa-pre.c. */
3343 struct tree_value_handle GTY(())
3345 struct tree_common common;
3347 /* The set of expressions represented by this handle. */
3348 struct bitmap_set * GTY ((skip)) expr_set;
3350 /* Unique ID for this value handle. IDs are handed out in a
3351 conveniently dense form starting at 0, so that we can make
3352 bitmaps of value handles. */
3356 /* Define the overall contents of a tree node.
3357 It may be any of the structures declared above
3358 for various types of node. */
3360 union tree_node GTY ((ptr_alias (union lang_tree_node),
3361 desc ("tree_node_structure (&%h)")))
3363 struct tree_base GTY ((tag ("TS_BASE"))) base;
3364 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3365 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3366 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3367 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3368 struct tree_string GTY ((tag ("TS_STRING"))) string;
3369 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3370 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3371 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3372 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3373 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3374 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3375 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3376 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3377 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3378 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3379 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3380 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3381 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3382 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3383 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3384 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3385 struct tree_list GTY ((tag ("TS_LIST"))) list;
3386 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3387 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3388 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3389 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3390 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3391 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3392 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3393 struct gimple_stmt GTY ((tag ("TS_GIMPLE_STATEMENT"))) gstmt;
3394 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3395 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3396 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3397 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3398 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3399 struct tree_memory_partition_tag GTY ((tag ("TS_MEMORY_PARTITION_TAG"))) mpt;
3402 /* Standard named or nameless data types of the C compiler. */
3424 TI_INTEGER_MINUS_ONE,
3441 TI_COMPLEX_INTEGER_TYPE,
3442 TI_COMPLEX_FLOAT_TYPE,
3443 TI_COMPLEX_DOUBLE_TYPE,
3444 TI_COMPLEX_LONG_DOUBLE_TYPE,
3448 TI_LONG_DOUBLE_TYPE,
3452 TI_LONG_DOUBLE_PTR_TYPE,
3453 TI_INTEGER_PTR_TYPE,
3462 TI_VA_LIST_GPR_COUNTER_FIELD,
3463 TI_VA_LIST_FPR_COUNTER_FIELD,
3470 TI_DFLOAT32_PTR_TYPE,
3471 TI_DFLOAT64_PTR_TYPE,
3472 TI_DFLOAT128_PTR_TYPE,
3481 extern GTY(()) tree global_trees[TI_MAX];
3483 #define error_mark_node global_trees[TI_ERROR_MARK]
3485 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3486 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3487 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3488 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3489 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3491 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3492 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3493 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3494 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3495 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3497 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3498 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3500 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3501 #define integer_one_node global_trees[TI_INTEGER_ONE]
3502 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3503 #define size_zero_node global_trees[TI_SIZE_ZERO]
3504 #define size_one_node global_trees[TI_SIZE_ONE]
3505 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3506 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3507 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3509 /* Base access nodes. */
3510 #define access_public_node global_trees[TI_PUBLIC]
3511 #define access_protected_node global_trees[TI_PROTECTED]
3512 #define access_private_node global_trees[TI_PRIVATE]
3514 #define null_pointer_node global_trees[TI_NULL_POINTER]
3516 #define float_type_node global_trees[TI_FLOAT_TYPE]
3517 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3518 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3520 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3521 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3522 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3523 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3525 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3526 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3527 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3528 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3530 #define void_type_node global_trees[TI_VOID_TYPE]
3531 /* The C type `void *'. */
3532 #define ptr_type_node global_trees[TI_PTR_TYPE]
3533 /* The C type `const void *'. */
3534 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3535 /* The C type `size_t'. */
3536 #define size_type_node global_trees[TI_SIZE_TYPE]
3537 #define pid_type_node global_trees[TI_PID_TYPE]
3538 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3539 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3540 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3541 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3542 /* The C type `FILE *'. */
3543 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3545 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3546 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3547 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3549 /* The decimal floating point types. */
3550 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3551 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3552 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3553 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3554 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3555 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3557 /* The node that should be placed at the end of a parameter list to
3558 indicate that the function does not take a variable number of
3559 arguments. The TREE_VALUE will be void_type_node and there will be
3560 no TREE_CHAIN. Language-independent code should not assume
3561 anything else about this node. */
3562 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3564 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3565 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3567 /* An enumeration of the standard C integer types. These must be
3568 ordered so that shorter types appear before longer ones, and so
3569 that signed types appear before unsigned ones, for the correct
3570 functioning of interpret_integer() in c-lex.c. */
3571 enum integer_type_kind
3583 itk_unsigned_long_long,
3587 typedef enum integer_type_kind integer_type_kind;
3589 /* The standard C integer types. Use integer_type_kind to index into
3591 extern GTY(()) tree integer_types[itk_none];
3593 #define char_type_node integer_types[itk_char]
3594 #define signed_char_type_node integer_types[itk_signed_char]
3595 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3596 #define short_integer_type_node integer_types[itk_short]
3597 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3598 #define integer_type_node integer_types[itk_int]
3599 #define unsigned_type_node integer_types[itk_unsigned_int]
3600 #define long_integer_type_node integer_types[itk_long]
3601 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3602 #define long_long_integer_type_node integer_types[itk_long_long]
3603 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3605 /* Set to the default thread-local storage (tls) model to use. */
3607 extern enum tls_model flag_tls_default;
3610 /* A pointer-to-function member type looks like:
3617 If __pfn is NULL, it is a NULL pointer-to-member-function.
3619 (Because the vtable is always the first thing in the object, we
3620 don't need its offset.) If the function is virtual, then PFN is
3621 one plus twice the index into the vtable; otherwise, it is just a
3622 pointer to the function.
3624 Unfortunately, using the lowest bit of PFN doesn't work in
3625 architectures that don't impose alignment requirements on function
3626 addresses, or that use the lowest bit to tell one ISA from another,
3627 for example. For such architectures, we use the lowest bit of
3628 DELTA instead of the lowest bit of the PFN, and DELTA will be
3631 enum ptrmemfunc_vbit_where_t
3633 ptrmemfunc_vbit_in_pfn,
3634 ptrmemfunc_vbit_in_delta
3637 #define NULL_TREE (tree) NULL
3639 extern tree decl_assembler_name (tree);
3640 extern bool decl_assembler_name_equal (tree decl, tree asmname);
3642 /* Compute the number of bytes occupied by 'node'. This routine only
3643 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3645 extern size_t tree_size (const_tree);
3647 /* Compute the number of bytes occupied by a tree with code CODE. This
3648 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3650 extern size_t tree_code_size (enum tree_code);
3652 /* Lowest level primitive for allocating a node.
3653 The TREE_CODE is the only argument. Contents are initialized
3654 to zero except for a few of the common fields. */
3656 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3657 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3659 /* Make a copy of a node, with all the same contents. */
3661 extern tree copy_node_stat (tree MEM_STAT_DECL);
3662 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3664 /* Make a copy of a chain of TREE_LIST nodes. */
3666 extern tree copy_list (tree);
3669 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3670 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3672 /* Make a TREE_VEC. */
3674 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3675 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3677 /* Tree nodes for SSA analysis. */
3679 extern void init_phinodes (void);
3680 extern void fini_phinodes (void);
3681 extern void release_phi_node (tree);
3682 #ifdef GATHER_STATISTICS
3683 extern void phinodes_print_statistics (void);
3686 extern void init_ssanames (void);
3687 extern void fini_ssanames (void);
3688 extern tree make_ssa_name (tree, tree);
3689 extern tree duplicate_ssa_name (tree, tree);
3690 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3691 extern void release_ssa_name (tree);
3692 extern void release_defs (tree);
3693 extern void replace_ssa_name_symbol (tree, tree);
3695 #ifdef GATHER_STATISTICS
3696 extern void ssanames_print_statistics (void);
3699 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3700 The name is supplied as a char *. */
3702 extern tree get_identifier (const char *);
3704 #if GCC_VERSION >= 3000
3705 #define get_identifier(str) \
3706 (__builtin_constant_p (str) \
3707 ? get_identifier_with_length ((str), strlen (str)) \
3708 : get_identifier (str))
3712 /* Identical to get_identifier, except that the length is assumed
3715 extern tree get_identifier_with_length (const char *, size_t);
3717 /* If an identifier with the name TEXT (a null-terminated string) has
3718 previously been referred to, return that node; otherwise return
3721 extern tree maybe_get_identifier (const char *);
3723 /* Construct various types of nodes. */
3725 extern tree build_nt (enum tree_code, ...);
3726 extern tree build_nt_call_list (tree, tree);
3728 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3729 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3730 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3731 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3732 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3733 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3734 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3735 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3736 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3737 tree MEM_STAT_DECL);
3738 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3739 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3740 tree MEM_STAT_DECL);
3741 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3742 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3743 tree, tree, tree MEM_STAT_DECL);
3744 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3745 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3747 extern tree build_gimple_modify_stmt_stat (tree, tree MEM_STAT_DECL);
3748 #define build_gimple_modify_stmt(t1,t2) \
3749 build_gimple_modify_stmt_stat (t1,t2 MEM_STAT_INFO)
3751 extern tree build_int_cst (tree, HOST_WIDE_INT);
3752 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3753 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3754 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3755 extern tree build_int_cst_wide_type (tree,
3756 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3757 extern tree build_vector (tree, tree);
3758 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3759 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3760 extern tree build_constructor_single (tree, tree, tree);
3761 extern tree build_constructor_from_list (tree, tree);
3762 extern tree build_real_from_int_cst (tree, const_tree);
3763 extern tree build_complex (tree, tree, tree);
3764 extern tree build_one_cst (tree);
3765 extern tree build_string (int, const char *);
3766 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3767 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3768 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3769 extern tree build_fn_decl (const char *, tree);
3770 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3771 extern tree build_block (tree, tree, tree, tree);
3772 #ifndef USE_MAPPED_LOCATION
3773 extern void annotate_with_file_line (tree, const char *, int);
3774 extern void annotate_with_locus (tree, location_t);
3776 extern tree build_empty_stmt (void);
3777 extern tree build_omp_clause (enum omp_clause_code);
3779 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3780 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3782 extern tree build_call_list (tree, tree, tree);
3783 extern tree build_call_nary (tree, tree, int, ...);
3784 extern tree build_call_valist (tree, tree, int, va_list);
3785 extern tree build_call_array (tree, tree, int, tree*);
3787 /* Construct various nodes representing data types. */
3789 extern tree make_signed_type (int);
3790 extern tree make_unsigned_type (int);
3791 extern tree signed_or_unsigned_type_for (int, tree);
3792 extern tree signed_type_for (tree);
3793 extern tree unsigned_type_for (tree);
3794 extern void initialize_sizetypes (bool);
3795 extern void set_sizetype (tree);
3796 extern void fixup_unsigned_type (tree);
3797 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3798 extern tree build_pointer_type (tree);
3799 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3800 extern tree build_reference_type (tree);
3801 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3802 extern tree build_vector_type (tree innertype, int nunits);
3803 extern tree build_type_no_quals (tree);
3804 extern tree build_index_type (tree);
3805 extern tree build_index_2_type (tree, tree);
3806 extern tree build_array_type (tree, tree);
3807 extern tree build_function_type (tree, tree);
3808 extern tree build_function_type_list (tree, ...);
3809 extern tree build_method_type_directly (tree, tree, tree);
3810 extern tree build_method_type (tree, tree);
3811 extern tree build_offset_type (tree, tree);
3812 extern tree build_complex_type (tree);
3813 extern tree build_resx (int);
3814 extern tree array_type_nelts (const_tree);
3815 extern bool in_array_bounds_p (tree);
3816 extern bool range_in_array_bounds_p (tree);
3818 extern tree value_member (tree, tree);
3819 extern tree purpose_member (const_tree, tree);
3821 extern int attribute_list_equal (tree, tree);
3822 extern int attribute_list_contained (tree, tree);
3823 extern int tree_int_cst_equal (const_tree, const_tree);
3824 extern int tree_int_cst_lt (const_tree, const_tree);
3825 extern int tree_int_cst_compare (const_tree, const_tree);
3826 extern int host_integerp (const_tree, int);
3827 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
3828 extern int tree_int_cst_msb (const_tree);
3829 extern int tree_int_cst_sgn (const_tree);
3830 extern int tree_int_cst_sign_bit (tree);
3831 extern bool tree_expr_nonnegative_p (tree);
3832 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
3833 extern bool may_negate_without_overflow_p (tree);
3834 extern tree get_inner_array_type (tree);
3836 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3837 put the prototype here. Rtl.h does declare the prototype if
3838 tree.h had been included. */
3840 extern tree make_tree (tree, rtx);
3842 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3845 Such modified types already made are recorded so that duplicates
3848 extern tree build_type_attribute_variant (tree, tree);
3849 extern tree build_decl_attribute_variant (tree, tree);
3851 /* Structure describing an attribute and a function to handle it. */
3852 struct attribute_spec
3854 /* The name of the attribute (without any leading or trailing __),
3855 or NULL to mark the end of a table of attributes. */
3856 const char *const name;
3857 /* The minimum length of the list of arguments of the attribute. */
3858 const int min_length;
3859 /* The maximum length of the list of arguments of the attribute
3860 (-1 for no maximum). */
3861 const int max_length;
3862 /* Whether this attribute requires a DECL. If it does, it will be passed
3863 from types of DECLs, function return types and array element types to
3864 the DECLs, function types and array types respectively; but when
3865 applied to a type in any other circumstances, it will be ignored with
3866 a warning. (If greater control is desired for a given attribute,
3867 this should be false, and the flags argument to the handler may be
3868 used to gain greater control in that case.) */
3869 const bool decl_required;
3870 /* Whether this attribute requires a type. If it does, it will be passed
3871 from a DECL to the type of that DECL. */
3872 const bool type_required;
3873 /* Whether this attribute requires a function (or method) type. If it does,
3874 it will be passed from a function pointer type to the target type,
3875 and from a function return type (which is not itself a function
3876 pointer type) to the function type. */
3877 const bool function_type_required;
3878 /* Function to handle this attribute. NODE points to the node to which
3879 the attribute is to be applied. If a DECL, it should be modified in
3880 place; if a TYPE, a copy should be created. NAME is the name of the
3881 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3882 of the arguments (which may be NULL). FLAGS gives further information
3883 about the context of the attribute. Afterwards, the attributes will
3884 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3885 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3886 as well as in any other cases when the attributes should not be added
3887 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3888 applied to another type or DECL later may be returned;
3889 otherwise the return value should be NULL_TREE. This pointer may be
3890 NULL if no special handling is required beyond the checks implied
3891 by the rest of this structure. */
3892 tree (*const handler) (tree *node, tree name, tree args,
3893 int flags, bool *no_add_attrs);
3896 /* Flags that may be passed in the third argument of decl_attributes, and
3897 to handler functions for attributes. */
3898 enum attribute_flags
3900 /* The type passed in is the type of a DECL, and any attributes that
3901 should be passed in again to be applied to the DECL rather than the
3902 type should be returned. */
3903 ATTR_FLAG_DECL_NEXT = 1,
3904 /* The type passed in is a function return type, and any attributes that
3905 should be passed in again to be applied to the function type rather
3906 than the return type should be returned. */
3907 ATTR_FLAG_FUNCTION_NEXT = 2,
3908 /* The type passed in is an array element type, and any attributes that
3909 should be passed in again to be applied to the array type rather
3910 than the element type should be returned. */
3911 ATTR_FLAG_ARRAY_NEXT = 4,
3912 /* The type passed in is a structure, union or enumeration type being
3913 created, and should be modified in place. */
3914 ATTR_FLAG_TYPE_IN_PLACE = 8,
3915 /* The attributes are being applied by default to a library function whose
3916 name indicates known behavior, and should be silently ignored if they
3917 are not in fact compatible with the function type. */
3918 ATTR_FLAG_BUILT_IN = 16
3921 /* Default versions of target-overridable functions. */
3923 extern tree merge_decl_attributes (tree, tree);
3924 extern tree merge_type_attributes (tree, tree);
3926 /* Given a tree node and a string, return nonzero if the tree node is
3927 a valid attribute name for the string. */
3929 extern int is_attribute_p (const char *, const_tree);
3931 /* Given an attribute name and a list of attributes, return the list element
3932 of the attribute or NULL_TREE if not found. */
3934 extern tree lookup_attribute (const char *, tree);
3936 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3939 extern tree remove_attribute (const char *, tree);
3941 /* Given two attributes lists, return a list of their union. */
3943 extern tree merge_attributes (tree, tree);
3945 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3946 /* Given two Windows decl attributes lists, possibly including
3947 dllimport, return a list of their union . */
3948 extern tree merge_dllimport_decl_attributes (tree, tree);
3950 /* Handle a "dllimport" or "dllexport" attribute. */
3951 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3954 /* Check whether CAND is suitable to be returned from get_qualified_type
3955 (BASE, TYPE_QUALS). */
3957 extern bool check_qualified_type (const_tree, const_tree, int);
3959 /* Return a version of the TYPE, qualified as indicated by the
3960 TYPE_QUALS, if one exists. If no qualified version exists yet,
3961 return NULL_TREE. */
3963 extern tree get_qualified_type (tree, int);
3965 /* Like get_qualified_type, but creates the type if it does not
3966 exist. This function never returns NULL_TREE. */
3968 extern tree build_qualified_type (tree, int);
3970 /* Like build_qualified_type, but only deals with the `const' and
3971 `volatile' qualifiers. This interface is retained for backwards
3972 compatibility with the various front-ends; new code should use
3973 build_qualified_type instead. */
3975 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3976 build_qualified_type ((TYPE), \
3977 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3978 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3980 /* Make a copy of a type node. */
3982 extern tree build_distinct_type_copy (tree);
3983 extern tree build_variant_type_copy (tree);
3985 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3986 fields. Optionally specify an alignment, and then lay it out. */
3988 extern void finish_builtin_struct (tree, const char *,
3991 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3992 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3993 node, does nothing except for the first time. */
3995 extern void layout_type (tree);
3997 /* These functions allow a front-end to perform a manual layout of a
3998 RECORD_TYPE. (For instance, if the placement of subsequent fields
3999 depends on the placement of fields so far.) Begin by calling
4000 start_record_layout. Then, call place_field for each of the
4001 fields. Then, call finish_record_layout. See layout_type for the
4002 default way in which these functions are used. */
4004 typedef struct record_layout_info_s
4006 /* The RECORD_TYPE that we are laying out. */
4008 /* The offset into the record so far, in bytes, not including bits in
4011 /* The last known alignment of SIZE. */
4012 unsigned int offset_align;
4013 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4015 /* The alignment of the record so far, in bits. */
4016 unsigned int record_align;
4017 /* The alignment of the record so far, ignoring #pragma pack and
4018 __attribute__ ((packed)), in bits. */
4019 unsigned int unpacked_align;
4020 /* The previous field layed out. */
4022 /* The static variables (i.e., class variables, as opposed to
4023 instance variables) encountered in T. */
4024 tree pending_statics;
4025 /* Bits remaining in the current alignment group */
4026 int remaining_in_alignment;
4027 /* True if we've seen a packed field that didn't have normal
4028 alignment anyway. */
4029 int packed_maybe_necessary;
4030 } *record_layout_info;
4032 extern void set_lang_adjust_rli (void (*) (record_layout_info));
4033 extern record_layout_info start_record_layout (tree);
4034 extern tree bit_from_pos (tree, tree);
4035 extern tree byte_from_pos (tree, tree);
4036 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4037 extern void normalize_offset (tree *, tree *, unsigned int);
4038 extern tree rli_size_unit_so_far (record_layout_info);
4039 extern tree rli_size_so_far (record_layout_info);
4040 extern void normalize_rli (record_layout_info);
4041 extern void place_field (record_layout_info, tree);
4042 extern void compute_record_mode (tree);
4043 extern void finish_record_layout (record_layout_info, int);
4045 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4046 return a canonicalized ..._TYPE node, so that duplicates are not made.
4047 How the hash code is computed is up to the caller, as long as any two
4048 callers that could hash identical-looking type nodes agree. */
4050 extern tree type_hash_canon (unsigned int, tree);
4052 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4053 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4054 fields. Call this only once for any given decl node.
4056 Second argument is the boundary that this field can be assumed to
4057 be starting at (in bits). Zero means it can be assumed aligned
4058 on any boundary that may be needed. */
4060 extern void layout_decl (tree, unsigned);
4062 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4063 a previous call to layout_decl and calls it again. */
4065 extern void relayout_decl (tree);
4067 /* Return the mode for data of a given size SIZE and mode class CLASS.
4068 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4069 The value is BLKmode if no other mode is found. This is like
4070 mode_for_size, but is passed a tree. */
4072 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
4074 /* Return an expr equal to X but certainly not valid as an lvalue. */
4076 extern tree non_lvalue (tree);
4078 extern tree convert (tree, tree);
4079 extern unsigned int expr_align (const_tree);
4080 extern tree expr_first (tree);
4081 extern tree expr_last (tree);
4082 extern tree expr_only (tree);
4083 extern tree size_in_bytes (tree);
4084 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4085 extern HOST_WIDE_INT max_int_size_in_bytes (tree);
4086 extern tree bit_position (const_tree);
4087 extern HOST_WIDE_INT int_bit_position (const_tree);
4088 extern tree byte_position (const_tree);
4089 extern HOST_WIDE_INT int_byte_position (const_tree);
4091 /* Define data structures, macros, and functions for handling sizes
4092 and the various types used to represent sizes. */
4096 SIZETYPE, /* Normal representation of sizes in bytes. */
4097 SSIZETYPE, /* Signed representation of sizes in bytes. */
4098 BITSIZETYPE, /* Normal representation of sizes in bits. */
4099 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4102 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4104 #define sizetype sizetype_tab[(int) SIZETYPE]
4105 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4106 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4107 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4109 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4110 extern tree size_binop (enum tree_code, tree, tree);
4111 extern tree size_diffop (tree, tree);
4113 #define size_int(L) size_int_kind (L, SIZETYPE)
4114 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4115 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4116 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4118 extern tree round_up (tree, int);
4119 extern tree round_down (tree, int);
4120 extern tree get_pending_sizes (void);
4121 extern void put_pending_size (tree);
4122 extern void put_pending_sizes (tree);
4124 /* Type for sizes of data-type. */
4126 #define BITS_PER_UNIT_LOG \
4127 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4128 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4129 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4131 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4132 extern unsigned int maximum_field_alignment;
4133 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4134 extern unsigned int initial_max_fld_align;
4136 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4137 by making the last node in X point to Y.
4138 Returns X, except if X is 0 returns Y. */
4140 extern tree chainon (tree, tree);
4142 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4144 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4145 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4147 /* Return the last tree node in a chain. */
4149 extern tree tree_last (tree);
4151 /* Reverse the order of elements in a chain, and return the new head. */
4153 extern tree nreverse (tree);
4155 /* Returns the length of a chain of nodes
4156 (number of chain pointers to follow before reaching a null pointer). */
4158 extern int list_length (const_tree);
4160 /* Returns the number of FIELD_DECLs in a type. */
4162 extern int fields_length (const_tree);
4164 /* Given an initializer INIT, return TRUE if INIT is zero or some
4165 aggregate of zeros. Otherwise return FALSE. */
4167 extern bool initializer_zerop (const_tree);
4169 /* Examine CTOR to discover:
4170 * how many scalar fields are set to nonzero values,
4171 and place it in *P_NZ_ELTS;
4172 * how many scalar fields in total are in CTOR,
4173 and place it in *P_ELT_COUNT.
4174 * if a type is a union, and the initializer from the constructor
4175 is not the largest element in the union, then set *p_must_clear.
4177 Return whether or not CTOR is a valid static constant initializer, the same
4178 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4180 extern bool categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4183 extern HOST_WIDE_INT count_type_elements (tree, bool);
4185 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4187 extern int integer_zerop (const_tree);
4189 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4191 extern int integer_onep (const_tree);
4193 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4194 all of whose significant bits are 1. */
4196 extern int integer_all_onesp (const_tree);
4198 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4199 exactly one bit 1. */
4201 extern int integer_pow2p (const_tree);
4203 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4204 with a nonzero value. */
4206 extern int integer_nonzerop (const_tree);
4208 extern bool cst_and_fits_in_hwi (const_tree);
4209 extern tree num_ending_zeros (const_tree);
4211 /* staticp (tree x) is nonzero if X is a reference to data allocated
4212 at a fixed address in memory. Returns the outermost data. */
4214 extern tree staticp (tree);
4216 /* save_expr (EXP) returns an expression equivalent to EXP
4217 but it can be used multiple times within context CTX
4218 and only evaluate EXP once. */
4220 extern tree save_expr (tree);
4222 /* Look inside EXPR and into any simple arithmetic operations. Return
4223 the innermost non-arithmetic node. */
4225 extern tree skip_simple_arithmetic (tree);
4227 /* Return which tree structure is used by T. */
4229 enum tree_node_structure_enum tree_node_structure (const_tree);
4231 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4232 or offset that depends on a field within a record.
4234 Note that we only allow such expressions within simple arithmetic
4237 extern bool contains_placeholder_p (tree);
4239 /* This macro calls the above function but short-circuits the common
4240 case of a constant to save time. Also check for null. */
4242 #define CONTAINS_PLACEHOLDER_P(EXP) \
4243 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4245 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4246 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4249 extern bool type_contains_placeholder_p (tree);
4251 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4252 return a tree with all occurrences of references to F in a
4253 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4254 contains only arithmetic expressions. */
4256 extern tree substitute_in_expr (tree, tree, tree);
4258 /* This macro calls the above function but short-circuits the common
4259 case of a constant to save time and also checks for NULL. */
4261 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4262 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4264 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4265 for it within OBJ, a tree that is an object or a chain of references. */
4267 extern tree substitute_placeholder_in_expr (tree, tree);
4269 /* This macro calls the above function but short-circuits the common
4270 case of a constant to save time and also checks for NULL. */
4272 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4273 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4274 : substitute_placeholder_in_expr (EXP, OBJ))
4276 /* variable_size (EXP) is like save_expr (EXP) except that it
4277 is for the special case of something that is part of a
4278 variable size for a data type. It makes special arrangements
4279 to compute the value at the right time when the data type
4280 belongs to a function parameter. */
4282 extern tree variable_size (tree);
4284 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4285 but it can be used multiple times
4286 and only evaluate the subexpressions once. */
4288 extern tree stabilize_reference (tree);
4290 /* Subroutine of stabilize_reference; this is called for subtrees of
4291 references. Any expression with side-effects must be put in a SAVE_EXPR
4292 to ensure that it is only evaluated once. */
4294 extern tree stabilize_reference_1 (tree);
4296 /* Return EXP, stripped of any conversions to wider types
4297 in such a way that the result of converting to type FOR_TYPE
4298 is the same as if EXP were converted to FOR_TYPE.
4299 If FOR_TYPE is 0, it signifies EXP's type. */
4301 extern tree get_unwidened (tree, tree);
4303 /* Return OP or a simpler expression for a narrower value
4304 which can be sign-extended or zero-extended to give back OP.
4305 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4306 or 0 if the value should be sign-extended. */
4308 extern tree get_narrower (tree, int *);
4310 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4311 look for nested component-refs or array-refs at constant positions
4312 and find the ultimate containing object, which is returned. */
4314 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4315 tree *, enum machine_mode *, int *, int *,
4318 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4319 look for whether EXP or any nested component-refs within EXP is marked
4322 extern bool contains_packed_reference (tree exp);
4324 /* Return 1 if T is an expression that get_inner_reference handles. */
4326 extern int handled_component_p (const_tree);
4328 /* Return a tree of sizetype representing the size, in bytes, of the element
4329 of EXP, an ARRAY_REF. */
4331 extern tree array_ref_element_size (tree);
4333 /* Return a tree representing the lower bound of the array mentioned in
4334 EXP, an ARRAY_REF. */
4336 extern tree array_ref_low_bound (tree);
4338 /* Return a tree representing the upper bound of the array mentioned in
4339 EXP, an ARRAY_REF. */
4341 extern tree array_ref_up_bound (tree);
4343 /* Return a tree representing the offset, in bytes, of the field referenced
4344 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4346 extern tree component_ref_field_offset (tree);
4348 /* Given a DECL or TYPE, return the scope in which it was declared, or
4349 NUL_TREE if there is no containing scope. */
4351 extern tree get_containing_scope (const_tree);
4353 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4355 extern tree decl_function_context (const_tree);
4357 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4358 this _DECL with its context, or zero if none. */
4359 extern tree decl_type_context (const_tree);
4361 /* Return 1 if EXPR is the real constant zero. */
4362 extern int real_zerop (const_tree);
4364 /* Declare commonly used variables for tree structure. */
4366 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4367 Zero means allow extended lvalues. */
4369 extern int pedantic_lvalues;
4371 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4373 extern GTY(()) tree current_function_decl;
4375 /* Nonzero means a FUNC_BEGIN label was emitted. */
4376 extern GTY(()) const char * current_function_func_begin_label;
4379 extern unsigned crc32_string (unsigned, const char *);
4380 extern void clean_symbol_name (char *);
4381 extern tree get_file_function_name (const char *);
4382 extern tree get_callee_fndecl (tree);
4383 extern void change_decl_assembler_name (tree, tree);
4384 extern int type_num_arguments (const_tree);
4385 extern bool associative_tree_code (enum tree_code);
4386 extern bool commutative_tree_code (enum tree_code);
4387 extern tree upper_bound_in_type (tree, tree);
4388 extern tree lower_bound_in_type (tree, tree);
4389 extern int operand_equal_for_phi_arg_p (tree, tree);
4390 extern bool empty_body_p (tree);
4391 extern tree call_expr_arg (tree, int);
4392 extern tree *call_expr_argp (tree, int);
4393 extern tree call_expr_arglist (tree);
4397 extern void expand_expr_stmt (tree);
4398 extern int warn_if_unused_value (tree, location_t);
4399 extern void expand_label (tree);
4400 extern void expand_goto (tree);
4402 extern rtx expand_stack_save (void);
4403 extern void expand_stack_restore (tree);
4404 extern void expand_return (tree);
4405 extern int is_body_block (tree);
4408 extern void using_eh_for_cleanups (void);
4410 /* In fold-const.c */
4412 /* Non-zero if we are folding constants inside an initializer; zero
4414 extern int folding_initializer;
4416 /* Convert between trees and native memory representation. */
4417 extern int native_encode_expr (tree, unsigned char *, int);
4418 extern tree native_interpret_expr (tree, unsigned char *, int);
4420 /* Fold constants as much as possible in an expression.
4421 Returns the simplified expression.
4422 Acts only on the top level of the expression;
4423 if the argument itself cannot be simplified, its
4424 subexpressions are not changed. */
4426 extern tree fold (tree);
4427 extern tree fold_unary (enum tree_code, tree, tree);
4428 extern tree fold_binary (enum tree_code, tree, tree, tree);
4429 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4430 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4431 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4432 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4433 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4434 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4435 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4436 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4437 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4438 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4439 extern tree fold_build_call_array (tree, tree, int, tree *);
4440 extern tree fold_build_call_array_initializer (tree, tree, int, tree *);
4441 extern bool fold_convertible_p (tree, tree);
4442 extern tree fold_convert (tree, tree);
4443 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4444 extern tree fold_ignored_result (tree);
4445 extern tree fold_abs_const (tree, tree);
4446 extern tree fold_indirect_ref_1 (tree, tree);
4447 extern void fold_defer_overflow_warnings (void);
4448 extern void fold_undefer_overflow_warnings (bool, tree, int);
4449 extern void fold_undefer_and_ignore_overflow_warnings (void);
4450 extern bool fold_deferring_overflow_warnings_p (void);
4451 extern tree maybe_fold_offset_to_reference (tree, tree, tree);
4453 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4456 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4457 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, const_tree);
4458 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4459 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4460 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4462 #define add_double(l1,h1,l2,h2,lv,hv) \
4463 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4464 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4465 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4466 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4467 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4468 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4470 #define mul_double(l1,h1,l2,h2,lv,hv) \
4471 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4472 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4473 HOST_WIDE_INT, unsigned int,
4474 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4475 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4476 HOST_WIDE_INT, unsigned int,
4477 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4478 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4479 HOST_WIDE_INT, unsigned int,
4480 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4481 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4482 HOST_WIDE_INT, unsigned int,
4483 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4485 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4486 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4487 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4488 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4491 enum operand_equal_flag
4497 extern int operand_equal_p (tree, tree, unsigned int);
4498 extern int multiple_of_p (tree, tree, tree);
4499 extern tree omit_one_operand (tree, tree, tree);
4500 extern tree omit_two_operands (tree, tree, tree, tree);
4501 extern tree invert_truthvalue (tree);
4502 extern tree fold_truth_not_expr (tree);
4503 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4504 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4505 extern tree fold_read_from_constant_string (tree);
4506 extern tree int_const_binop (enum tree_code, tree, tree, int);
4507 extern tree build_fold_addr_expr (tree);
4508 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4509 extern tree fold_strip_sign_ops (tree);
4510 extern tree build_fold_addr_expr_with_type (tree, tree);
4511 extern tree build_fold_indirect_ref (tree);
4512 extern tree fold_indirect_ref (tree);
4513 extern tree constant_boolean_node (int, tree);
4514 extern tree build_low_bits_mask (tree, unsigned);
4516 extern bool tree_swap_operands_p (tree, tree, bool);
4517 extern void swap_tree_operands (tree, tree *, tree *);
4518 extern enum tree_code swap_tree_comparison (enum tree_code);
4520 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4521 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4523 extern bool tree_expr_nonzero_p (tree);
4524 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4525 extern int multiple_of_p (tree, tree, tree);
4528 extern tree fold_call_expr (tree, bool);
4529 extern tree fold_builtin_fputs (tree, tree, bool, bool, tree);
4530 extern tree fold_builtin_strcpy (tree, tree, tree, tree);
4531 extern tree fold_builtin_strncpy (tree, tree, tree, tree, tree);
4532 extern tree fold_builtin_memory_chk (tree, tree, tree, tree, tree, tree, bool,
4533 enum built_in_function);
4534 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, tree, tree, bool,
4535 enum built_in_function);
4536 extern tree fold_builtin_strncpy_chk (tree, tree, tree, tree, tree);
4537 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4538 extern bool fold_builtin_next_arg (tree, bool);
4539 extern enum built_in_function builtin_mathfn_code (tree);
4540 extern tree build_function_call_expr (tree, tree);
4541 extern tree fold_build_call_expr (tree, tree, tree, tree);
4542 extern tree fold_builtin_call_array (tree, tree, int, tree *);
4543 extern void debug_fold_checksum (tree);
4544 extern tree build_call_expr (tree, int, ...);
4545 extern tree mathfn_built_in (tree, enum built_in_function fn);
4546 extern tree strip_float_extensions (tree);
4547 extern tree c_strlen (tree, int);
4548 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4549 extern tree build_va_arg_indirect_ref (tree);
4550 extern tree build_string_literal (int, const char *);
4551 extern bool validate_arglist (tree, ...);
4552 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4553 extern int get_pointer_alignment (tree, unsigned int);
4556 extern tree strip_float_extensions (tree);
4559 extern void record_component_aliases (tree);
4560 extern HOST_WIDE_INT get_alias_set (tree);
4561 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4562 extern int alias_sets_must_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4563 extern int objects_must_conflict_p (tree, tree);
4566 extern int really_constant_p (const_tree);
4567 extern int int_fits_type_p (const_tree, const_tree);
4568 extern void get_type_static_bounds (tree, mpz_t, mpz_t);
4569 extern bool variably_modified_type_p (tree, tree);
4570 extern int tree_log2 (const_tree);
4571 extern int tree_floor_log2 (const_tree);
4572 extern int simple_cst_equal (tree, tree);
4573 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
4574 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4575 extern int type_list_equal (tree, tree);
4576 extern int chain_member (const_tree, const_tree);
4577 extern tree type_hash_lookup (unsigned int, tree);
4578 extern void type_hash_add (unsigned int, tree);
4579 extern int simple_cst_list_equal (const_tree, const_tree);
4580 extern void dump_tree_statistics (void);
4581 extern void expand_function_end (void);
4582 extern void expand_function_start (tree);
4583 extern void stack_protect_prologue (void);
4584 extern void stack_protect_epilogue (void);
4585 extern void recompute_tree_invariant_for_addr_expr (tree);
4586 extern bool needs_to_live_in_memory (tree);
4587 extern tree reconstruct_complex_type (tree, tree);
4589 extern int real_onep (const_tree);
4590 extern int real_twop (const_tree);
4591 extern int real_minus_onep (const_tree);
4592 extern void init_ttree (void);
4593 extern void build_common_tree_nodes (bool, bool);
4594 extern void build_common_tree_nodes_2 (int);
4595 extern void build_common_builtin_nodes (void);
4596 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4597 extern tree build_range_type (tree, tree, tree);
4598 extern HOST_WIDE_INT int_cst_value (const_tree);
4599 extern tree build_addr (tree, tree);
4601 extern bool fields_compatible_p (tree, tree);
4602 extern tree find_compatible_field (tree, tree);
4604 extern location_t expr_location (tree);
4605 extern void set_expr_location (tree, location_t);
4606 extern bool expr_has_location (tree);
4608 #ifdef USE_MAPPED_LOCATION
4614 extern void set_expr_locus (tree,
4615 #ifdef USE_MAPPED_LOCATION
4616 source_location *loc
4621 extern const char **expr_filename (tree);
4622 extern int *expr_lineno (tree);
4623 extern tree *tree_block (tree);
4624 extern tree *generic_tree_operand (tree, int);
4625 extern tree *generic_tree_type (tree);
4628 extern void expand_main_function (void);
4629 extern void init_dummy_function_start (void);
4630 extern void expand_dummy_function_end (void);
4631 extern unsigned int init_function_for_compilation (void);
4632 extern void allocate_struct_function (tree);
4633 extern void init_function_start (tree);
4634 extern bool use_register_for_decl (tree);
4635 extern void generate_setjmp_warnings (void);
4636 extern void init_temp_slots (void);
4637 extern void free_temp_slots (void);
4638 extern void pop_temp_slots (void);
4639 extern void push_temp_slots (void);
4640 extern void preserve_temp_slots (rtx);
4641 extern int aggregate_value_p (tree, tree);
4642 extern void push_function_context (void);
4643 extern void pop_function_context (void);
4644 extern void push_function_context_to (tree);
4645 extern void pop_function_context_from (tree);
4646 extern tree gimplify_parameters (void);
4648 /* In print-rtl.c */
4650 extern void print_rtl (FILE *, const_rtx);
4653 /* In print-tree.c */
4654 extern void debug_tree (tree);
4656 extern void dump_addr (FILE*, const char *, void *);
4657 extern void print_node (FILE *, const char *, tree, int);
4658 extern void print_node_brief (FILE *, const char *, tree, int);
4659 extern void indent_to (FILE *, int);
4662 /* In tree-inline.c: */
4663 extern bool debug_find_tree (tree, tree);
4664 /* This is in tree-inline.c since the routine uses
4665 data structures from the inliner. */
4666 extern tree unsave_expr_now (tree);
4667 extern tree build_duplicate_type (tree);
4671 /* Nonzero if this is a call to a function whose return value depends
4672 solely on its arguments, has no side effects, and does not read
4675 /* Nonzero if this call will never return. */
4676 #define ECF_NORETURN 2
4677 /* Nonzero if this is a call to malloc or a related function. */
4678 #define ECF_MALLOC 4
4679 /* Nonzero if it is plausible that this is a call to alloca. */
4680 #define ECF_MAY_BE_ALLOCA 8
4681 /* Nonzero if this is a call to a function that won't throw an exception. */
4682 #define ECF_NOTHROW 16
4683 /* Nonzero if this is a call to setjmp or a related function. */
4684 #define ECF_RETURNS_TWICE 32
4685 /* Nonzero if this call replaces the current stack frame. */
4686 #define ECF_SIBCALL 64
4687 /* Nonzero if this is a call to "pure" function (like const function,
4688 but may read memory. */
4689 #define ECF_PURE 128
4690 /* Nonzero if this is a call to a function that returns with the stack
4691 pointer depressed. */
4692 #define ECF_SP_DEPRESSED 256
4693 /* Create libcall block around the call. */
4694 #define ECF_LIBCALL_BLOCK 512
4695 /* Function does not read or write memory (but may have side effects, so
4696 it does not necessarily fit ECF_CONST). */
4697 #define ECF_NOVOPS 1024
4699 extern int flags_from_decl_or_type (tree);
4700 extern int call_expr_flags (tree);
4702 extern int setjmp_call_p (tree);
4703 extern bool alloca_call_p (tree);
4704 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
4705 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
4709 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4710 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4711 it should be modified in place; if a TYPE, a copy should be created
4712 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4713 information, in the form of a bitwise OR of flags in enum attribute_flags
4714 from tree.h. Depending on these flags, some attributes may be
4715 returned to be applied at a later stage (for example, to apply
4716 a decl attribute to the declaration rather than to its type). */
4717 extern tree decl_attributes (tree *, tree, int);
4719 /* In integrate.c */
4720 extern void set_decl_abstract_flags (tree, int);
4721 extern void set_decl_origin_self (tree);
4723 /* In stor-layout.c */
4724 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
4725 extern void fixup_signed_type (tree);
4726 extern void internal_reference_types (void);
4727 extern unsigned int update_alignment_for_field (record_layout_info, tree,
4730 extern void make_decl_rtl (tree);
4731 extern void make_decl_one_only (tree);
4732 extern int supports_one_only (void);
4733 extern void resolve_unique_section (tree, int, int);
4734 extern void mark_referenced (tree);
4735 extern void mark_decl_referenced (tree);
4736 extern void notice_global_symbol (tree);
4737 extern void set_user_assembler_name (tree, const char *);
4738 extern void process_pending_assemble_externals (void);
4739 extern void finish_aliases_1 (void);
4740 extern void finish_aliases_2 (void);
4741 extern tree emutls_decl (tree);
4744 extern void expand_computed_goto (tree);
4745 extern bool parse_output_constraint (const char **, int, int, int,
4746 bool *, bool *, bool *);
4747 extern bool parse_input_constraint (const char **, int, int, int, int,
4748 const char * const *, bool *, bool *);
4749 extern void expand_asm_expr (tree);
4750 extern tree resolve_asm_operand_names (tree, tree, tree);
4751 extern void expand_case (tree);
4752 extern void expand_decl (tree);
4753 extern void expand_anon_union_decl (tree, tree, tree);
4755 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4756 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
4759 /* In gimplify.c. */
4760 extern tree create_artificial_label (void);
4761 extern void gimplify_function_tree (tree);
4762 extern const char *get_name (tree);
4763 extern tree unshare_expr (tree);
4764 extern void sort_case_labels (tree);
4766 /* Interface of the DWARF2 unwind info support. */
4768 /* Generate a new label for the CFI info to refer to. */
4770 extern char *dwarf2out_cfi_label (void);
4772 /* Entry point to update the canonical frame address (CFA). */
4774 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
4776 /* Add the CFI for saving a register window. */
4778 extern void dwarf2out_window_save (const char *);
4780 /* Add a CFI to update the running total of the size of arguments pushed
4783 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
4785 /* Entry point for saving a register to the stack. */
4787 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
4789 /* Entry point for saving the return address in the stack. */
4791 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
4793 /* Entry point for saving the return address in a register. */
4795 extern void dwarf2out_return_reg (const char *, unsigned);
4797 /* Entry point for saving the first register into the second. */
4799 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
4801 /* In tree-inline.c */
4803 /* The type of a set of already-visited pointers. Functions for creating
4804 and manipulating it are declared in pointer-set.h */
4805 struct pointer_set_t;
4807 /* The type of a callback function for walking over tree structure. */
4809 typedef tree (*walk_tree_fn) (tree *, int *, void *);
4810 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
4811 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
4813 /* Assign the RTX to declaration. */
4815 extern void set_decl_rtl (tree, rtx);
4816 extern void set_decl_incoming_rtl (tree, rtx);
4818 /* Enum and arrays used for tree allocation stats.
4819 Keep in sync with tree.c:tree_node_kind_names. */
4845 extern int tree_node_counts[];
4846 extern int tree_node_sizes[];
4848 /* True if we are in gimple form and the actions of the folders need to
4849 be restricted. False if we are not in gimple form and folding is not
4850 restricted to creating gimple expressions. */
4851 extern bool in_gimple_form;
4853 /* In tree-gimple.c. */
4854 extern tree get_base_address (tree t);
4856 /* In tree-vectorizer.c. */
4857 extern void vect_set_verbosity_level (const char *);
4861 struct tree_map_base GTY(())
4866 extern int tree_map_base_eq (const void *, const void *);
4867 extern unsigned int tree_map_base_hash (const void *);
4868 extern int tree_map_base_marked_p (const void *);
4870 /* Map from a tree to another tree. */
4872 struct tree_map GTY(())
4874 struct tree_map_base base;
4879 #define tree_map_eq tree_map_base_eq
4880 extern unsigned int tree_map_hash (const void *);
4881 #define tree_map_marked_p tree_map_base_marked_p
4883 /* Map from a tree to an int. */
4885 struct tree_int_map GTY(())
4887 struct tree_map_base base;
4891 #define tree_int_map_eq tree_map_base_eq
4892 #define tree_int_map_hash tree_map_base_hash
4893 #define tree_int_map_marked_p tree_map_base_marked_p
4895 /* Map from a tree to initialization/finalization priorities. */
4897 struct tree_priority_map GTY(())
4899 struct tree_map_base base;
4904 #define tree_priority_map_eq tree_map_base_eq
4905 #define tree_priority_map_hash tree_map_base_hash
4906 #define tree_priority_map_marked_p tree_map_base_marked_p
4908 /* In tree-ssa-address.c. */
4909 extern tree tree_mem_ref_addr (tree, tree);
4910 extern void copy_mem_ref_info (tree, tree);
4913 extern bool ssa_name_nonzero_p (tree);
4914 extern bool ssa_name_nonnegative_p (tree);
4916 /* In tree-object-size.c. */
4917 extern void init_object_sizes (void);
4918 extern void fini_object_sizes (void);
4919 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
4922 extern unsigned HOST_WIDE_INT highest_pow2_factor (tree);
4924 /* In tree-inline.c. */
4926 void init_inline_once (void);
4928 /* Compute the number of operands in an expression node NODE. For
4929 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4930 otherwise it is looked up from the node's code. */
4932 tree_operand_length (tree node)
4934 if (VL_EXP_CLASS_P (node))
4935 return VL_EXP_OPERAND_LENGTH (node);
4937 return TREE_CODE_LENGTH (TREE_CODE (node));
4940 /* Abstract iterators for CALL_EXPRs. These static inline definitions
4941 have to go towards the end of tree.h so that union tree_node is fully
4942 defined by this point. */
4944 /* Structure containing iterator state. */
4945 typedef struct call_expr_arg_iterator_d GTY (())
4947 tree t; /* the call_expr */
4948 int n; /* argument count */
4949 int i; /* next argument index */
4950 } call_expr_arg_iterator;
4952 /* Initialize the abstract argument list iterator object ITER with the
4953 arguments from CALL_EXPR node EXP. */
4955 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4958 iter->n = call_expr_nargs (exp);
4962 /* Return the next argument from abstract argument list iterator object ITER,
4963 and advance its state. Return NULL_TREE if there are no more arguments. */
4965 next_call_expr_arg (call_expr_arg_iterator *iter)
4968 if (iter->i >= iter->n)
4970 result = CALL_EXPR_ARG (iter->t, iter->i);
4975 /* Initialize the abstract argument list iterator object ITER, then advance
4976 past and return the first argument. Useful in for expressions, e.g.
4977 for (arg = first_call_expr_arg (exp, &iter); arg;
4978 arg = next_call_expr_arg (&iter)) */
4980 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4982 init_call_expr_arg_iterator (exp, iter);
4983 return next_call_expr_arg (iter);
4986 /* Test whether there are more arguments in abstract argument list iterator
4987 ITER, without changing its state. */
4989 more_call_expr_args_p (const call_expr_arg_iterator *iter)
4991 return (iter->i < iter->n);
4995 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4996 (of type call_expr_arg_iterator) to hold the iteration state. */
4997 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4998 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4999 (arg) = next_call_expr_arg (&(iter)))
5001 #endif /* GCC_TREE_H */