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_INT_FN(FN) case FN: case FN##L: case FN##LL
278 /* An array of _DECL trees for the above. */
279 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
280 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
282 /* In an OMP_CLAUSE node. */
284 /* Number of operands and names for each clause. */
285 extern unsigned const char omp_clause_num_ops[];
286 extern const char * const omp_clause_code_name[];
288 /* Clause codes. Do not reorder, as this is used to index into the tables
289 omp_clause_num_ops and omp_clause_code_name. */
292 /* Clause zero is special-cased inside the parser
293 (c_parser_omp_variable_list). */
294 OMP_CLAUSE_ERROR = 0,
296 /* OpenMP clause: private (variable_list). */
299 /* OpenMP clause: shared (variable_list). */
302 /* OpenMP clause: firstprivate (variable_list). */
303 OMP_CLAUSE_FIRSTPRIVATE,
305 /* OpenMP clause: lastprivate (variable_list). */
306 OMP_CLAUSE_LASTPRIVATE,
308 /* OpenMP clause: reduction (operator:variable_list).
309 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
310 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
311 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
313 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
314 placeholder used in OMP_CLAUSE_REDUCTION_MERGE. */
315 OMP_CLAUSE_REDUCTION,
317 /* OpenMP clause: copyin (variable_list). */
320 /* OpenMP clause: copyprivate (variable_list). */
321 OMP_CLAUSE_COPYPRIVATE,
323 /* OpenMP clause: if (scalar-expression). */
326 /* OpenMP clause: num_threads (integer-expression). */
327 OMP_CLAUSE_NUM_THREADS,
329 /* OpenMP clause: schedule. */
332 /* OpenMP clause: nowait. */
335 /* OpenMP clause: ordered. */
338 /* OpenMP clause: default. */
342 /* The definition of tree nodes fills the next several pages. */
344 /* A tree node can represent a data type, a variable, an expression
345 or a statement. Each node has a TREE_CODE which says what kind of
346 thing it represents. Some common codes are:
347 INTEGER_TYPE -- represents a type of integers.
348 ARRAY_TYPE -- represents a type of pointer.
349 VAR_DECL -- represents a declared variable.
350 INTEGER_CST -- represents a constant integer value.
351 PLUS_EXPR -- represents a sum (an expression).
353 As for the contents of a tree node: there are some fields
354 that all nodes share. Each TREE_CODE has various special-purpose
355 fields as well. The fields of a node are never accessed directly,
356 always through accessor macros. */
358 /* Every kind of tree node starts with this structure,
359 so all nodes have these fields.
361 See the accessor macros, defined below, for documentation of the
365 struct tree_base GTY(())
367 ENUM_BITFIELD(tree_code) code : 16;
369 unsigned side_effects_flag : 1;
370 unsigned constant_flag : 1;
371 unsigned addressable_flag : 1;
372 unsigned volatile_flag : 1;
373 unsigned readonly_flag : 1;
374 unsigned unsigned_flag : 1;
375 unsigned asm_written_flag: 1;
376 unsigned nowarning_flag : 1;
378 unsigned used_flag : 1;
379 unsigned nothrow_flag : 1;
380 unsigned static_flag : 1;
381 unsigned public_flag : 1;
382 unsigned private_flag : 1;
383 unsigned protected_flag : 1;
384 unsigned deprecated_flag : 1;
385 unsigned invariant_flag : 1;
387 unsigned lang_flag_0 : 1;
388 unsigned lang_flag_1 : 1;
389 unsigned lang_flag_2 : 1;
390 unsigned lang_flag_3 : 1;
391 unsigned lang_flag_4 : 1;
392 unsigned lang_flag_5 : 1;
393 unsigned lang_flag_6 : 1;
394 unsigned visited : 1;
398 /* FIXME tuples: Eventually, we need to move this somewhere external to
400 union tree_ann_d *ann;
403 struct tree_common GTY(())
405 struct tree_base base;
410 /* GIMPLE_MODIFY_STMT */
411 struct gimple_stmt GTY(())
413 struct tree_base base;
416 /* FIXME tuples: Eventually this should be of type ``struct gimple_expr''. */
417 tree GTY ((length ("TREE_CODE_LENGTH (TREE_CODE (&%h))"))) operands[1];
420 /* The following table lists the uses of each of the above flags and
421 for which types of nodes they are defined. Note that expressions
427 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
428 ..._TYPE, IDENTIFIER_NODE.
429 In a STMT_EXPR, it means we want the result of the enclosed
431 CALL_EXPR_TAILCALL in CALL_EXPR
432 CASE_LOW_SEEN in CASE_LABEL_EXPR
437 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
440 TREE_SYMBOL_REFERENCED in
443 TARGET_EXPR, WITH_CLEANUP_EXPR
446 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
447 TYPE_REF_CAN_ALIAS_ALL in
448 POINTER_TYPE, REFERENCE_TYPE
449 CASE_HIGH_SEEN in CASE_LABEL_EXPR
454 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
456 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
459 TYPE_CACHED_VALUES_P in
461 SAVE_EXPR_RESOLVED_P in
463 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
464 OMP_CLAUSE_LASTPRIVATE
465 OMP_CLAUSE_PRIVATE_DEBUG in
472 CALL_EXPR_RETURN_SLOT_OPT in
475 PARM_DECL, RESULT_DECL
480 OMP_PARALLEL_COMBINED in
503 TREE_THIS_VOLATILE in
521 TYPE_SIZES_GIMPLIFIED
530 BIT_FIELD_REF_UNSIGNED in
536 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
542 expressions, IDENTIFIER_NODE
547 CALL_EXPR, FUNCTION_DECL
553 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
560 IDENTIFIER_TRANSPARENT_ALIAS in
565 Used in tree traversals to mark visited nodes.
575 ... any expr or decl node
578 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
579 enum tree_node_structure_enum {
580 #include "treestruct.def"
585 /* Define accessors for the fields that all tree nodes have
586 (though some fields are not used for all kinds of nodes). */
588 /* The tree-code says what kind of node it is.
589 Codes are defined in tree.def. */
590 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
591 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
593 /* When checking is enabled, errors will be generated if a tree node
594 is accessed incorrectly. The macros die with a fatal error. */
595 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
597 #define TREE_CHECK(T, CODE) __extension__ \
598 ({ const tree __t = (T); \
599 if (TREE_CODE (__t) != (CODE)) \
600 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
604 #define TREE_NOT_CHECK(T, CODE) __extension__ \
605 ({ const tree __t = (T); \
606 if (TREE_CODE (__t) == (CODE)) \
607 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
611 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
612 ({ const tree __t = (T); \
613 if (TREE_CODE (__t) != (CODE1) \
614 && TREE_CODE (__t) != (CODE2)) \
615 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
616 (CODE1), (CODE2), 0); \
619 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
620 ({ const tree __t = (T); \
621 if (TREE_CODE (__t) == (CODE1) \
622 || TREE_CODE (__t) == (CODE2)) \
623 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
624 (CODE1), (CODE2), 0); \
627 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
628 ({ const tree __t = (T); \
629 if (TREE_CODE (__t) != (CODE1) \
630 && TREE_CODE (__t) != (CODE2) \
631 && TREE_CODE (__t) != (CODE3)) \
632 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
633 (CODE1), (CODE2), (CODE3), 0); \
636 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
637 ({ const tree __t = (T); \
638 if (TREE_CODE (__t) == (CODE1) \
639 || TREE_CODE (__t) == (CODE2) \
640 || TREE_CODE (__t) == (CODE3)) \
641 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
642 (CODE1), (CODE2), (CODE3), 0); \
645 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
646 ({ const tree __t = (T); \
647 if (TREE_CODE (__t) != (CODE1) \
648 && TREE_CODE (__t) != (CODE2) \
649 && TREE_CODE (__t) != (CODE3) \
650 && TREE_CODE (__t) != (CODE4)) \
651 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
652 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
655 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
656 ({ const tree __t = (T); \
657 if (TREE_CODE (__t) == (CODE1) \
658 || TREE_CODE (__t) == (CODE2) \
659 || TREE_CODE (__t) == (CODE3) \
660 || TREE_CODE (__t) == (CODE4)) \
661 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
662 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
665 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
666 ({ const tree __t = (T); \
667 if (TREE_CODE (__t) != (CODE1) \
668 && TREE_CODE (__t) != (CODE2) \
669 && TREE_CODE (__t) != (CODE3) \
670 && TREE_CODE (__t) != (CODE4) \
671 && TREE_CODE (__t) != (CODE5)) \
672 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
673 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
676 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
677 ({ const tree __t = (T); \
678 if (TREE_CODE (__t) == (CODE1) \
679 || TREE_CODE (__t) == (CODE2) \
680 || TREE_CODE (__t) == (CODE3) \
681 || TREE_CODE (__t) == (CODE4) \
682 || TREE_CODE (__t) == (CODE5)) \
683 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
684 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
687 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
688 ({ const tree __t = (T); \
689 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
690 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
694 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
695 ({ const tree __t = (T); \
696 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
697 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
701 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
702 ({ const tree __t = (T); \
703 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
704 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
708 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
709 ({ const tree __t = (T); \
710 if (TREE_CODE (__t) != OMP_CLAUSE) \
711 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
713 if (__t->omp_clause.code != (CODE)) \
714 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
718 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
719 ({ const tree __t = (T); \
720 if (TREE_CODE (__t) != OMP_CLAUSE) \
721 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
723 if ((int) __t->omp_clause.code < (int) (CODE1) \
724 || (int) __t->omp_clause.code > (int) (CODE2)) \
725 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
726 __FUNCTION__, (CODE1), (CODE2)); \
729 /* These checks have to be special cased. */
730 #define EXPR_CHECK(T) __extension__ \
731 ({ const tree __t = (T); \
732 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
733 if (!IS_EXPR_CODE_CLASS (__c)) \
734 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
738 #define GIMPLE_STMT_CHECK(T) __extension__ \
739 ({ const tree __t = (T); \
740 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
741 if (!IS_GIMPLE_STMT_CODE_CLASS (__c)) \
742 tree_class_check_failed (__t, tcc_gimple_stmt, __FILE__, __LINE__,\
746 /* These checks have to be special cased. */
747 #define NON_TYPE_CHECK(T) __extension__ \
748 ({ const tree __t = (T); \
750 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
754 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
755 (*({const tree __t = (T); \
756 const int __i = (I); \
757 if (TREE_CODE (__t) != TREE_VEC) \
758 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
760 if (__i < 0 || __i >= __t->vec.length) \
761 tree_vec_elt_check_failed (__i, __t->vec.length, \
762 __FILE__, __LINE__, __FUNCTION__); \
763 &__t->vec.a[__i]; }))
765 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
766 (*({const tree __t = t; \
767 const int __i = (i); \
768 if (TREE_CODE (__t) != PHI_NODE) \
769 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
771 if (__i < 0 || __i >= __t->phi.capacity) \
772 phi_node_elt_check_failed (__i, __t->phi.num_args, \
773 __FILE__, __LINE__, __FUNCTION__); \
774 &__t->phi.a[__i]; }))
776 #define OMP_CLAUSE_ELT_CHECK(t, i) __extension__ \
777 (*({const tree __t = t; \
778 const int __i = (i); \
779 if (TREE_CODE (__t) != OMP_CLAUSE) \
780 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
782 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
783 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
785 &__t->omp_clause.ops[__i]; }))
787 /* Special checks for TREE_OPERANDs. */
788 #define TREE_OPERAND_CHECK(T, I) __extension__ \
789 (*({const tree __t = EXPR_CHECK (T); \
790 const int __i = (I); \
791 if (GIMPLE_TUPLE_P (__t)) \
792 gcc_unreachable (); \
793 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
794 tree_operand_check_failed (__i, __t, \
795 __FILE__, __LINE__, __FUNCTION__); \
796 &__t->exp.operands[__i]; }))
798 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
799 (*({const tree __t = (T); \
800 const int __i = (I); \
801 if (TREE_CODE (__t) != CODE) \
802 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
803 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
804 tree_operand_check_failed (__i, __t, \
805 __FILE__, __LINE__, __FUNCTION__); \
806 &__t->exp.operands[__i]; }))
808 /* Special checks for GIMPLE_STMT_OPERANDs. */
809 #define GIMPLE_STMT_OPERAND_CHECK(T, I) __extension__ \
810 (*({const tree __t = GIMPLE_STMT_CHECK (T); \
811 const int __i = (I); \
812 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
813 tree_operand_check_failed (__i, __t, \
814 __FILE__, __LINE__, __FUNCTION__); \
815 &__t->gstmt.operands[__i]; }))
817 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
819 ({const tree __t = (T); \
820 const int __i = (I); \
821 if (TREE_CODE (__t) != (CODE)) \
822 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
823 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
824 tree_operand_check_failed (__i, __t, \
825 __FILE__, __LINE__, __FUNCTION__); \
826 &__t->exp.operands[__i]; }))
828 /* Nodes are chained together for many purposes.
829 Types are chained together to record them for being output to the debugger
830 (see the function `chain_type').
831 Decls in the same scope are chained together to record the contents
833 Statement nodes for successive statements used to be chained together.
834 Often lists of things are represented by TREE_LIST nodes that
835 are chained together. */
837 #define TREE_CHAIN(NODE) __extension__ \
838 (*({const tree __t = (NODE); \
839 if (GIMPLE_TUPLE_P (__t)) \
840 gcc_unreachable (); \
841 &__t->common.chain; }))
843 /* In all nodes that are expressions, this is the data type of the expression.
844 In POINTER_TYPE nodes, this is the type that the pointer points to.
845 In ARRAY_TYPE nodes, this is the type of the elements.
846 In VECTOR_TYPE nodes, this is the type of the elements. */
847 #define TREE_TYPE(NODE) __extension__ \
848 (*({const tree __t = (NODE); \
849 if (GIMPLE_TUPLE_P (__t)) \
850 gcc_unreachable (); \
851 &__t->common.type; }))
853 extern void tree_contains_struct_check_failed (const tree,
854 const enum tree_node_structure_enum,
855 const char *, int, const char *)
858 extern void tree_check_failed (const tree, const char *, int, const char *,
859 ...) ATTRIBUTE_NORETURN;
860 extern void tree_not_check_failed (const tree, const char *, int, const char *,
861 ...) ATTRIBUTE_NORETURN;
862 extern void tree_class_check_failed (const tree, const enum tree_code_class,
863 const char *, int, const char *)
865 extern void tree_range_check_failed (const tree, const char *, int,
866 const char *, enum tree_code,
868 extern void tree_not_class_check_failed (const tree,
869 const enum tree_code_class,
870 const char *, int, const char *)
872 extern void tree_vec_elt_check_failed (int, int, const char *,
875 extern void phi_node_elt_check_failed (int, int, const char *,
878 extern void tree_operand_check_failed (int, tree,
879 const char *, int, const char *)
881 extern void omp_clause_check_failed (const tree, const char *, int,
882 const char *, enum omp_clause_code)
884 extern void omp_clause_operand_check_failed (int, tree, const char *,
887 extern void omp_clause_range_check_failed (const tree, const char *, int,
888 const char *, enum omp_clause_code,
889 enum omp_clause_code)
892 #else /* not ENABLE_TREE_CHECKING, or not gcc */
894 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
895 #define TREE_CHECK(T, CODE) (T)
896 #define TREE_NOT_CHECK(T, CODE) (T)
897 #define TREE_CHECK2(T, CODE1, CODE2) (T)
898 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
899 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
900 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
901 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
902 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
903 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
904 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
905 #define TREE_CLASS_CHECK(T, CODE) (T)
906 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
907 #define EXPR_CHECK(T) (T)
908 #define GIMPLE_STMT_CHECK(T) (T)
909 #define NON_TYPE_CHECK(T) (T)
910 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
911 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
912 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
913 #define GIMPLE_STMT_OPERAND_CHECK(T, I) ((T)->gstmt.operands[I])
914 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
915 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
916 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
917 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
918 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
920 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
921 #define TREE_TYPE(NODE) ((NODE)->common.type)
925 #define TREE_BLOCK(NODE) *(tree_block (NODE))
927 #include "tree-check.h"
929 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
930 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
931 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
932 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
933 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
934 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
935 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
936 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
937 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
938 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
939 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
940 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
942 #define RECORD_OR_UNION_CHECK(T) \
943 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
944 #define NOT_RECORD_OR_UNION_CHECK(T) \
945 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
947 #define NUMERICAL_TYPE_CHECK(T) \
948 TREE_CHECK4 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE)
950 /* Nonzero if NODE is a GIMPLE statement. */
951 #define GIMPLE_STMT_P(NODE) \
952 (TREE_CODE_CLASS (TREE_CODE ((NODE))) == tcc_gimple_stmt)
954 /* Nonzero if NODE is a GIMPLE tuple. */
955 #define GIMPLE_TUPLE_P(NODE) (GIMPLE_STMT_P (NODE) || TREE_CODE (NODE) == PHI_NODE)
957 /* A GIMPLE tuple that has a ``locus'' field. */
958 #define GIMPLE_TUPLE_HAS_LOCUS_P(NODE) GIMPLE_STMT_P ((NODE))
960 /* Like TREE_OPERAND but works with GIMPLE stmt tuples as well.
962 If you know the NODE is a GIMPLE statement, use GIMPLE_STMT_OPERAND. If the
963 NODE code is unknown at compile time, use this macro. */
964 #define GENERIC_TREE_OPERAND(NODE, I) *(generic_tree_operand ((NODE), (I)))
966 /* Like TREE_TYPE but returns void_type_node for gimple tuples that have
969 #define GENERIC_TREE_TYPE(NODE) *(generic_tree_type ((NODE)))
971 /* Here is how primitive or already-canonicalized types' hash codes
973 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
975 /* A simple hash function for an arbitrary tree node. This must not be
976 used in hash tables which are saved to a PCH. */
977 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
979 /* The TREE_CHAIN but it is able to handle tuples. */
980 #define GENERIC_NEXT(NODE) \
981 (TREE_CODE (NODE) == PHI_NODE ? PHI_CHAIN (NODE) : \
982 GIMPLE_STMT_P (NODE) ? NULL_TREE : TREE_CHAIN (NODE))
984 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
985 that don't change the machine mode. */
987 #define STRIP_NOPS(EXP) \
988 while ((TREE_CODE (EXP) == NOP_EXPR \
989 || TREE_CODE (EXP) == CONVERT_EXPR \
990 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
991 && TREE_OPERAND (EXP, 0) != error_mark_node \
992 && (TYPE_MODE (TREE_TYPE (EXP)) \
993 == TYPE_MODE (GENERIC_TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
994 (EXP) = TREE_OPERAND (EXP, 0)
996 /* Like STRIP_NOPS, but don't let the signedness change either. */
998 #define STRIP_SIGN_NOPS(EXP) \
999 while ((TREE_CODE (EXP) == NOP_EXPR \
1000 || TREE_CODE (EXP) == CONVERT_EXPR \
1001 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1002 && TREE_OPERAND (EXP, 0) != error_mark_node \
1003 && (TYPE_MODE (TREE_TYPE (EXP)) \
1004 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1005 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
1006 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1007 (EXP) = TREE_OPERAND (EXP, 0)
1009 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1011 #define STRIP_TYPE_NOPS(EXP) \
1012 while ((TREE_CODE (EXP) == NOP_EXPR \
1013 || TREE_CODE (EXP) == CONVERT_EXPR \
1014 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1015 && TREE_OPERAND (EXP, 0) != error_mark_node \
1016 && (TREE_TYPE (EXP) \
1017 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1018 (EXP) = TREE_OPERAND (EXP, 0)
1020 /* Remove unnecessary type conversions according to
1021 tree_ssa_useless_type_conversion. */
1023 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1024 while (tree_ssa_useless_type_conversion (EXP)) \
1025 EXP = TREE_OPERAND (EXP, 0)
1027 /* Nonzero if TYPE represents an integral type. Note that we do not
1028 include COMPLEX types here. Keep these checks in ascending code
1031 #define INTEGRAL_TYPE_P(TYPE) \
1032 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1033 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1034 || TREE_CODE (TYPE) == INTEGER_TYPE)
1036 /* Nonzero if TYPE represents a scalar floating-point type. */
1038 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1040 /* Nonzero if TYPE represents a complex floating-point type. */
1042 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1043 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1044 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1046 /* Nonzero if TYPE represents a vector floating-point type. */
1048 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1049 (TREE_CODE (TYPE) == VECTOR_TYPE \
1050 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1052 /* Nonzero if TYPE represents a floating-point type, including complex
1053 and vector floating-point types. The vector and complex check does
1054 not use the previous two macros to enable early folding. */
1056 #define FLOAT_TYPE_P(TYPE) \
1057 (SCALAR_FLOAT_TYPE_P (TYPE) \
1058 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1059 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1060 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1062 /* Nonzero if TYPE represents a decimal floating-point type. */
1063 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1064 (SCALAR_FLOAT_TYPE_P (TYPE) \
1065 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1067 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1068 Keep these checks in ascending code order. */
1070 #define AGGREGATE_TYPE_P(TYPE) \
1071 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1072 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1074 /* Nonzero if TYPE represents a pointer or reference type.
1075 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1076 ascending code order. */
1078 #define POINTER_TYPE_P(TYPE) \
1079 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1081 /* Nonzero if this type is a complete type. */
1082 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1084 /* Nonzero if this type is the (possibly qualified) void type. */
1085 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1087 /* Nonzero if this type is complete or is cv void. */
1088 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1089 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1091 /* Nonzero if this type is complete or is an array with unspecified bound. */
1092 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1093 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1096 /* Define many boolean fields that all tree nodes have. */
1098 /* In VAR_DECL nodes, nonzero means address of this is needed.
1099 So it cannot be in a register.
1100 In a FUNCTION_DECL, nonzero means its address is needed.
1101 So it must be compiled even if it is an inline function.
1102 In a FIELD_DECL node, it means that the programmer is permitted to
1103 construct the address of this field. This is used for aliasing
1104 purposes: see record_component_aliases.
1105 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1106 In LABEL_DECL nodes, it means a goto for this label has been seen
1107 from a place outside all binding contours that restore stack levels.
1108 In ..._TYPE nodes, it means that objects of this type must
1109 be fully addressable. This means that pieces of this
1110 object cannot go into register parameters, for example.
1111 In IDENTIFIER_NODEs, this means that some extern decl for this name
1112 had its address taken. That matters for inline functions. */
1113 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1115 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1116 exit of a function. Calls for which this is true are candidates for tail
1117 call optimizations. */
1118 #define CALL_EXPR_TAILCALL(NODE) \
1119 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1121 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1122 CASE_LOW operand has been processed. */
1123 #define CASE_LOW_SEEN(NODE) \
1124 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1126 /* In a VAR_DECL, nonzero means allocate static storage.
1127 In a FUNCTION_DECL, nonzero if function has been defined.
1128 In a CONSTRUCTOR, nonzero means allocate static storage.
1130 ??? This is also used in lots of other nodes in unclear ways which
1131 should be cleaned up some day. */
1132 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1134 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
1135 should only be executed if an exception is thrown, not on normal exit
1137 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1139 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1140 CASE_HIGH operand has been processed. */
1141 #define CASE_HIGH_SEEN(NODE) \
1142 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1144 /* In an expr node (usually a conversion) this means the node was made
1145 implicitly and should not lead to any sort of warning. In a decl node,
1146 warnings concerning the decl should be suppressed. This is used at
1147 least for used-before-set warnings, and it set after one warning is
1149 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1151 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1152 this string as an argument. */
1153 #define TREE_SYMBOL_REFERENCED(NODE) \
1154 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1156 /* Nonzero in a pointer or reference type means the data pointed to
1157 by this type can alias anything. */
1158 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1159 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1161 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1162 there was an overflow in folding. */
1164 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1166 /* ??? This is an obsolete synonym for TREE_OVERFLOW. */
1167 #define TREE_CONSTANT_OVERFLOW(NODE) TREE_OVERFLOW(NODE)
1169 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1171 #define TREE_OVERFLOW_P(EXPR) \
1172 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1174 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1175 nonzero means name is to be accessible from outside this module.
1176 In an IDENTIFIER_NODE, nonzero means an external declaration
1177 accessible from outside this module was previously seen
1178 for this name in an inner scope. */
1179 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1181 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1182 of cached values, or is something else. */
1183 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1185 /* In a SAVE_EXPR, indicates that the original expression has already
1186 been substituted with a VAR_DECL that contains the value. */
1187 #define SAVE_EXPR_RESOLVED_P(NODE) \
1188 (TREE_CHECK (NODE, SAVE_EXPR)->base.public_flag)
1190 /* In any expression, decl, or constant, nonzero means it has side effects or
1191 reevaluation of the whole expression could produce a different value.
1192 This is set if any subexpression is a function call, a side effect or a
1193 reference to a volatile variable. In a ..._DECL, this is set only if the
1194 declaration said `volatile'. This will never be set for a constant. */
1195 #define TREE_SIDE_EFFECTS(NODE) \
1196 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1198 /* In a LABEL_DECL, nonzero means this label had its address taken
1199 and therefore can never be deleted and is a jump target for
1201 #define FORCED_LABEL(NODE) ((NODE)->base.side_effects_flag)
1203 /* Nonzero means this expression is volatile in the C sense:
1204 its address should be of type `volatile WHATEVER *'.
1205 In other words, the declared item is volatile qualified.
1206 This is used in _DECL nodes and _REF nodes.
1207 On a FUNCTION_DECL node, this means the function does not
1208 return normally. This is the same effect as setting
1209 the attribute noreturn on the function in C.
1211 In a ..._TYPE node, means this type is volatile-qualified.
1212 But use TYPE_VOLATILE instead of this macro when the node is a type,
1213 because eventually we may make that a different bit.
1215 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1216 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1218 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1219 accessing the memory pointed to won't generate a trap. However,
1220 this only applies to an object when used appropriately: it doesn't
1221 mean that writing a READONLY mem won't trap. Similarly for
1222 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1224 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1225 (or slice of the array) always belongs to the range of the array.
1226 I.e. that the access will not trap, provided that the access to
1227 the base to the array will not trap. */
1228 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1230 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1231 nonzero means it may not be the lhs of an assignment. */
1232 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1234 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1235 #define TREE_READONLY_DECL_P(NODE)\
1236 (DECL_P (NODE) && TREE_READONLY (NODE))
1238 /* Value of expression is constant. Always on in all ..._CST nodes. May
1239 also appear in an expression or decl where the value is constant. */
1240 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1242 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1243 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1244 (TYPE_CHECK (NODE)->base.constant_flag)
1246 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1247 #define DECL_UNSIGNED(NODE) \
1248 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1250 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1251 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1252 (BIT_FIELD_REF_CHECK (NODE)->base.unsigned_flag)
1254 /* In integral and pointer types, means an unsigned type. */
1255 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1257 /* Nonzero in a VAR_DECL means assembler code has been written.
1258 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1259 This is interesting in an inline function, since it might not need
1260 to be compiled separately.
1261 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1262 if the sdb debugging info for the type has been written.
1263 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1264 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1266 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1268 /* Nonzero in a _DECL if the name is used in its scope.
1269 Nonzero in an expr node means inhibit warning if value is unused.
1270 In IDENTIFIER_NODEs, this means that some extern decl for this name
1272 In a BLOCK, this means that the block contains variables that are used. */
1273 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1275 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1276 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1277 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1279 /* In a CALL_EXPR, means that it's safe to use the target of the call
1280 expansion as the return slot for a call that returns in memory. */
1281 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->base.private_flag)
1283 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1284 reference (and the TREE_TYPE is a pointer to the true type). */
1285 #define DECL_BY_REFERENCE(NODE) \
1286 (DECL_COMMON_CHECK (NODE)->base.private_flag)
1288 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1289 thunked-to function. */
1290 #define CALL_FROM_THUNK_P(NODE) \
1291 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1293 /* In a type, nonzero means that all objects of the type are guaranteed by the
1294 language or front-end to be properly aligned, so we can indicate that a MEM
1295 of this type is aligned at least to the alignment of the type, even if it
1296 doesn't appear that it is. We see this, for example, in object-oriented
1297 languages where a tag field may show this is an object of a more-aligned
1298 variant of the more generic type.
1300 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1302 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1304 /* Used in classes in C++. */
1305 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1306 /* Used in classes in C++.
1307 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1308 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1310 /* Nonzero in a _DECL if the use of the name is defined as a
1311 deprecated feature by __attribute__((deprecated)). */
1312 #define TREE_DEPRECATED(NODE) \
1313 ((NODE)->base.deprecated_flag)
1315 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1316 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1317 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1318 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1320 /* Value of expression is function invariant. A strict subset of
1321 TREE_CONSTANT, such an expression is constant over any one function
1322 invocation, though not across different invocations. May appear in
1323 any expression node. */
1324 #define TREE_INVARIANT(NODE) ((NODE)->base.invariant_flag)
1326 /* These flags are available for each language front end to use internally. */
1327 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1328 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1329 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1330 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1331 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1332 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1333 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1335 /* Define additional fields and accessors for nodes representing constants. */
1337 /* In an INTEGER_CST node. These two together make a 2-word integer.
1338 If the data type is signed, the value is sign-extended to 2 words
1339 even though not all of them may really be in use.
1340 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1341 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1342 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1343 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1345 #define INT_CST_LT(A, B) \
1346 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1347 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1348 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1350 #define INT_CST_LT_UNSIGNED(A, B) \
1351 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1352 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1353 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1354 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1355 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1357 struct tree_int_cst GTY(())
1359 struct tree_common common;
1363 /* In a REAL_CST node. struct real_value is an opaque entity, with
1364 manipulators defined in real.h. We don't want tree.h depending on
1365 real.h and transitively on tm.h. */
1368 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1369 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1371 struct tree_real_cst GTY(())
1373 struct tree_common common;
1374 struct real_value * real_cst_ptr;
1377 /* In a STRING_CST */
1378 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1379 #define TREE_STRING_POINTER(NODE) \
1380 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1382 struct tree_string GTY(())
1384 struct tree_common common;
1389 /* In a COMPLEX_CST node. */
1390 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1391 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1393 struct tree_complex GTY(())
1395 struct tree_common common;
1400 /* In a VECTOR_CST node. */
1401 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1403 struct tree_vector GTY(())
1405 struct tree_common common;
1411 /* Define fields and accessors for some special-purpose tree nodes. */
1413 #define IDENTIFIER_LENGTH(NODE) \
1414 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1415 #define IDENTIFIER_POINTER(NODE) \
1416 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1417 #define IDENTIFIER_HASH_VALUE(NODE) \
1418 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1420 /* Translate a hash table identifier pointer to a tree_identifier
1421 pointer, and vice versa. */
1423 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1424 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1425 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1427 struct tree_identifier GTY(())
1429 struct tree_common common;
1430 struct ht_identifier id;
1433 /* In a TREE_LIST node. */
1434 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1435 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1437 struct tree_list GTY(())
1439 struct tree_common common;
1444 /* In a TREE_VEC node. */
1445 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1446 #define TREE_VEC_END(NODE) \
1447 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1449 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1451 struct tree_vec GTY(())
1453 struct tree_common common;
1455 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1458 /* In a CONSTRUCTOR node. */
1459 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1461 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1462 value of each element (stored within VAL). IX must be a scratch variable
1463 of unsigned integer type. */
1464 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1465 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1467 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1471 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1472 the value of each element (stored within VAL) and its index (stored
1473 within INDEX). IX must be a scratch variable of unsigned integer type. */
1474 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1475 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1477 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1478 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1482 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1483 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1485 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1486 _ce___->index = INDEX; \
1487 _ce___->value = VALUE; \
1490 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1491 element. INDEX can optionally design the position of VALUE: in arrays,
1492 it is the index where VALUE has to be placed; in structures, it is the
1493 FIELD_DECL of the member. */
1494 typedef struct constructor_elt_d GTY(())
1500 DEF_VEC_O(constructor_elt);
1501 DEF_VEC_ALLOC_O(constructor_elt,gc);
1503 struct tree_constructor GTY(())
1505 struct tree_common common;
1506 VEC(constructor_elt,gc) *elts;
1509 /* Define fields and accessors for some nodes that represent expressions. */
1511 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1512 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1513 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1514 && integer_zerop (TREE_OPERAND (NODE, 0)))
1516 /* In ordinary expression nodes. */
1517 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1518 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1520 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1521 length. Its value includes the length operand itself; that is,
1522 the minimum valid length is 1.
1523 Note that we have to bypass the use of TREE_OPERAND to access
1524 that field to avoid infinite recursion in expanding the macros. */
1525 #define VL_EXP_OPERAND_LENGTH(NODE) \
1526 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1528 /* In gimple statements. */
1529 #define GIMPLE_STMT_OPERAND(NODE, I) GIMPLE_STMT_OPERAND_CHECK (NODE, I)
1530 #define GIMPLE_STMT_LOCUS(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.locus)
1531 #define GIMPLE_STMT_BLOCK(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.block)
1533 /* In a LOOP_EXPR node. */
1534 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1536 /* The source location of this expression. Non-tree_exp nodes such as
1537 decls and constants can be shared among multiple locations, so
1539 #define EXPR_LOCATION(NODE) expr_location ((NODE))
1540 #define SET_EXPR_LOCATION(NODE, FROM) set_expr_location ((NODE), (FROM))
1541 #define EXPR_HAS_LOCATION(NODE) expr_has_location ((NODE))
1542 #define EXPR_LOCUS(NODE) expr_locus ((NODE))
1543 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1544 #define EXPR_FILENAME(NODE) *(expr_filename ((NODE)))
1545 #define EXPR_LINENO(NODE) *(expr_lineno ((NODE)))
1547 /* True if a tree is an expression or statement that can have a
1549 #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE) || GIMPLE_STMT_P (NODE))
1551 /* In a TARGET_EXPR node. */
1552 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1553 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1554 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1556 /* DECL_EXPR accessor. This gives access to the DECL associated with
1557 the given declaration statement. */
1558 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1560 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1562 /* SWITCH_EXPR accessors. These give access to the condition, body and
1563 original condition type (before any compiler conversions)
1564 of the switch statement, respectively. */
1565 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1566 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1567 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1569 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1570 of a case label, respectively. */
1571 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1572 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1573 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1575 /* The operands of a TARGET_MEM_REF. */
1576 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1577 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1578 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1579 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1580 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1581 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1582 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1584 /* The operands of a BIND_EXPR. */
1585 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1586 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1587 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1589 /* GOTO_EXPR accessor. This gives access to the label associated with
1590 a goto statement. */
1591 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1593 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1594 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1595 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1597 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1598 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1599 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1600 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1601 /* Nonzero if we want to create an ASM_INPUT instead of an
1602 ASM_OPERAND with no operands. */
1603 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1604 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1606 /* COND_EXPR accessors. */
1607 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1608 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1609 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1611 /* Accessors for the chains of recurrences. */
1612 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1613 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1614 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1615 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1617 /* LABEL_EXPR accessor. This gives access to the label associated with
1618 the given label expression. */
1619 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1621 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1622 accessors for SSA operands. */
1624 /* CATCH_EXPR accessors. */
1625 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1626 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1628 /* EH_FILTER_EXPR accessors. */
1629 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1630 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1631 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1633 /* OBJ_TYPE_REF accessors. */
1634 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1635 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1636 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1638 /* ASSERT_EXPR accessors. */
1639 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1640 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1642 /* CALL_EXPR accessors.
1644 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1645 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1646 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1647 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1648 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1650 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1651 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1652 the argument count is zero when checking is enabled. Instead, do
1653 the pointer arithmetic to advance past the 3 fixed operands in a
1654 CALL_EXPR. That produces a valid pointer to just past the end of the
1655 operand array, even if it's not valid to dereference it. */
1656 #define CALL_EXPR_ARGP(NODE) \
1657 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1659 /* OpenMP directive and clause accessors. */
1661 #define OMP_BODY(NODE) \
1662 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1663 #define OMP_CLAUSES(NODE) \
1664 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1666 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1667 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1668 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1669 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1671 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1672 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1673 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1674 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1675 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1676 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1678 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1679 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1681 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1683 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1684 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1686 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1688 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1690 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1691 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1693 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1694 #define OMP_CLAUSE_DECL(NODE) \
1695 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1696 OMP_CLAUSE_PRIVATE, \
1697 OMP_CLAUSE_COPYPRIVATE), 0)
1699 /* True on an OMP_SECTION statement that was the last lexical member.
1700 This status is meaningful in the implementation of lastprivate. */
1701 #define OMP_SECTION_LAST(NODE) \
1702 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1704 /* True on an OMP_RETURN statement if the return does not require a
1705 thread synchronization via some sort of barrier. The exact barrier
1706 that would otherwise be emitted is dependent on the OMP statement
1707 with which this return is associated. */
1708 #define OMP_RETURN_NOWAIT(NODE) \
1709 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1711 /* True on an OMP_PARALLEL statement if it represents an explicit
1712 combined parallel work-sharing constructs. */
1713 #define OMP_PARALLEL_COMBINED(NODE) \
1714 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1716 /* True on a PRIVATE clause if its decl is kept around for debugging
1717 information only and its DECL_VALUE_EXPR is supposed to point
1718 to what it has been remapped to. */
1719 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1720 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1722 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1723 decl is present in the chain. */
1724 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1725 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1727 #define OMP_CLAUSE_IF_EXPR(NODE) \
1728 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1729 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1730 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1731 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1732 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1734 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1735 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1736 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1737 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1738 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1739 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1740 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1741 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1743 enum omp_clause_schedule_kind
1745 OMP_CLAUSE_SCHEDULE_STATIC,
1746 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1747 OMP_CLAUSE_SCHEDULE_GUIDED,
1748 OMP_CLAUSE_SCHEDULE_RUNTIME
1751 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1752 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1754 enum omp_clause_default_kind
1756 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1757 OMP_CLAUSE_DEFAULT_SHARED,
1758 OMP_CLAUSE_DEFAULT_NONE,
1759 OMP_CLAUSE_DEFAULT_PRIVATE
1762 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1763 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1765 struct tree_exp GTY(())
1767 struct tree_common common;
1770 tree GTY ((special ("tree_exp"),
1771 desc ("TREE_CODE ((tree) &%0)")))
1775 /* SSA_NAME accessors. */
1777 /* Returns the variable being referenced. Once released, this is the
1778 only field that can be relied upon. */
1779 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1781 /* Returns the statement which defines this reference. Note that
1782 we use the same field when chaining SSA_NAME nodes together on
1783 the SSA_NAME freelist. */
1784 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1786 /* Returns the SSA version number of this SSA name. Note that in
1787 tree SSA, version numbers are not per variable and may be recycled. */
1788 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1790 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1791 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1793 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1794 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1796 /* Nonzero if this SSA_NAME expression is currently on the free list of
1797 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1798 has no meaning for an SSA_NAME. */
1799 #define SSA_NAME_IN_FREE_LIST(NODE) \
1800 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1802 /* Nonzero if this SSA_NAME is the default definition for the
1803 underlying symbol. A default SSA name is created for symbol S if
1804 the very first reference to S in the function is a read operation.
1805 Default definitions are always created by an empty statement and
1806 belong to no basic block. */
1807 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1808 SSA_NAME_CHECK (NODE)->base.volatile_flag
1810 /* Attributes for SSA_NAMEs for pointer-type variables. */
1811 #define SSA_NAME_PTR_INFO(N) \
1812 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1814 /* Get the value of this SSA_NAME, if available. */
1815 #define SSA_NAME_VALUE(N) \
1816 SSA_NAME_CHECK (N)->ssa_name.value_handle
1818 #ifndef _TREE_FLOW_H
1819 struct ptr_info_def;
1824 /* Immediate use linking structure. This structure is used for maintaining
1825 a doubly linked list of uses of an SSA_NAME. */
1826 typedef struct ssa_use_operand_d GTY(())
1828 struct ssa_use_operand_d* GTY((skip(""))) prev;
1829 struct ssa_use_operand_d* GTY((skip(""))) next;
1830 tree GTY((skip(""))) stmt;
1831 tree *GTY((skip(""))) use;
1832 } ssa_use_operand_t;
1834 /* Return the immediate_use information for an SSA_NAME. */
1835 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1837 struct tree_ssa_name GTY(())
1839 struct tree_common common;
1841 /* _DECL wrapped by this SSA name. */
1844 /* SSA version number. */
1845 unsigned int version;
1847 /* Pointer attributes used for alias analysis. */
1848 struct ptr_info_def *ptr_info;
1850 /* Value for SSA name used by various passes.
1852 Right now only invariants are allowed to persist beyond a pass in
1853 this field; in the future we will allow VALUE_HANDLEs to persist
1857 /* Immediate uses list for this SSA_NAME. */
1858 struct ssa_use_operand_d imm_uses;
1861 /* In a PHI_NODE node. */
1863 /* These 2 macros should be considered off limits for use by developers. If
1864 you wish to access the use or def fields of a PHI_NODE in the SSA
1865 optimizers, use the accessor macros found in tree-ssa-operands.h.
1866 These two macros are to be used only by those accessor macros, and other
1867 select places where we *absolutely* must take the address of the tree. */
1869 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1870 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1872 /* PHI_NODEs for each basic block are chained together in a single linked
1873 list. The head of the list is linked from the block annotation, and
1874 the link to the next PHI is in PHI_CHAIN. */
1875 #define PHI_CHAIN(NODE) PHI_NODE_CHECK (NODE)->phi.chain
1877 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1878 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1879 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1880 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1881 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1882 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1884 struct phi_arg_d GTY(())
1886 /* imm_use MUST be the first element in struct because we do some
1887 pointer arithmetic with it. See phi_arg_index_from_use. */
1888 struct ssa_use_operand_d imm_use;
1892 struct tree_phi_node GTY(())
1894 struct tree_base common;
1900 /* Basic block holding this PHI node. */
1901 struct basic_block_def *bb;
1903 /* Arguments of the PHI node. These are maintained in the same
1904 order as predecessor edge vector BB->PREDS. */
1905 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1909 #define OMP_CLAUSE_CODE(NODE) \
1910 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1912 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1913 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1915 #define OMP_CLAUSE_CODE(NODE) \
1916 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1918 #define OMP_CLAUSE_OPERAND(NODE, I) \
1919 OMP_CLAUSE_ELT_CHECK (NODE, I)
1921 struct tree_omp_clause GTY(())
1923 struct tree_common common;
1924 enum omp_clause_code code;
1925 union omp_clause_subcode {
1926 enum omp_clause_default_kind default_kind;
1927 enum omp_clause_schedule_kind schedule_kind;
1928 enum tree_code reduction_code;
1929 } GTY ((skip)) subcode;
1930 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1934 struct varray_head_tag;
1936 /* In a BLOCK node. */
1937 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1938 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1939 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1940 /* Note: when changing this, make sure to find the places
1941 that use chainon or nreverse. */
1942 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1943 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1944 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1946 /* Nonzero means that this block is prepared to handle exceptions
1947 listed in the BLOCK_VARS slot. */
1948 #define BLOCK_HANDLER_BLOCK(NODE) \
1949 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1951 /* An index number for this block. These values are not guaranteed to
1952 be unique across functions -- whether or not they are depends on
1953 the debugging output format in use. */
1954 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1956 /* If block reordering splits a lexical block into discontiguous
1957 address ranges, we'll make a copy of the original block.
1959 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1960 In that case, we have one source block that has been replicated
1961 (through inlining or unrolling) into many logical blocks, and that
1962 these logical blocks have different physical variables in them.
1964 In this case, we have one logical block split into several
1965 non-contiguous address ranges. Most debug formats can't actually
1966 represent this idea directly, so we fake it by creating multiple
1967 logical blocks with the same variables in them. However, for those
1968 that do support non-contiguous regions, these allow the original
1969 logical block to be reconstructed, along with the set of address
1972 One of the logical block fragments is arbitrarily chosen to be
1973 the ORIGIN. The other fragments will point to the origin via
1974 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1975 be null. The list of fragments will be chained through
1976 BLOCK_FRAGMENT_CHAIN from the origin. */
1978 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1979 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1981 /* For an inlined function, this gives the location where it was called
1982 from. This is only set in the top level block, which corresponds to the
1983 inlined function scope. This is used in the debug output routines. */
1985 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1987 struct tree_block GTY(())
1989 struct tree_common common;
1991 unsigned handler_block_flag : 1;
1992 unsigned abstract_flag : 1;
1993 unsigned block_num : 30;
1998 tree abstract_origin;
1999 tree fragment_origin;
2000 tree fragment_chain;
2004 /* Define fields and accessors for nodes representing data types. */
2006 /* See tree.def for documentation of the use of these fields.
2007 Look at the documentation of the various ..._TYPE tree codes.
2009 Note that the type.values, type.minval, and type.maxval fields are
2010 overloaded and used for different macros in different kinds of types.
2011 Each macro must check to ensure the tree node is of the proper kind of
2012 type. Note also that some of the front-ends also overload these fields,
2013 so they must be checked as well. */
2015 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2016 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2017 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2018 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
2019 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2020 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2021 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2022 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2023 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2024 (INTEGER_TYPE_CHECK (NODE)->type.values \
2025 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2026 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2027 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2028 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2029 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2030 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2031 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2032 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2033 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2034 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2035 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2036 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2037 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2038 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2039 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2040 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2041 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2042 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2043 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2044 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2046 /* The "canonical" type for this type node, which can be used to
2047 compare the type for equality with another type. If two types are
2048 equal (based on the semantics of the language), then they will have
2049 equivalent TYPE_CANONICAL entries.
2051 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2052 be used for comparison against other types. Instead, the type is
2053 said to require structural equality checks, described in
2054 TYPE_STRUCTURAL_EQUALITY_P. */
2055 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2056 /* Indicates that the type node requires structural equality
2057 checks. The compiler will need to look at the composition of the
2058 type to determine whether it is equal to another type, rather than
2059 just comparing canonical type pointers. For instance, we would need
2060 to look at the return and parameter types of a FUNCTION_TYPE
2062 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2063 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2064 type node requires structural equality. */
2065 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2066 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2068 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2069 in the debugging output. We use this to describe a vector as a
2070 structure containing an array. */
2071 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2073 /* For record and union types, information about this type, as a base type
2075 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2077 /* For non record and union types, used in a language-dependent way. */
2078 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2080 /* The (language-specific) typed-based alias set for this type.
2081 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2082 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2083 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2084 type can alias objects of any type. */
2085 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2087 /* Nonzero iff the typed-based alias set for this type has been
2089 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2091 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2093 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2095 /* The alignment necessary for objects of this type.
2096 The value is an int, measured in bits. */
2097 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2099 /* 1 if the alignment for this type was requested by "aligned" attribute,
2100 0 if it is the default for this type. */
2101 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2103 /* The alignment for NODE, in bytes. */
2104 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2106 /* If your language allows you to declare types, and you want debug info
2107 for them, then you need to generate corresponding TYPE_DECL nodes.
2108 These "stub" TYPE_DECL nodes have no name, and simply point at the
2109 type node. You then set the TYPE_STUB_DECL field of the type node
2110 to point back at the TYPE_DECL node. This allows the debug routines
2111 to know that the two nodes represent the same type, so that we only
2112 get one debug info record for them. */
2113 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2115 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2116 has BLKmode only because it lacks the alignment requirement for
2118 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2120 /* In an INTEGER_TYPE, it means the type represents a size. We use
2121 this both for validity checking and to permit optimizations that
2122 are unsafe for other types. Note that the C `size_t' type should
2123 *not* have this flag set. The `size_t' type is simply a typedef
2124 for an ordinary integer type that happens to be the type of an
2125 expression returned by `sizeof'; `size_t' has no special
2126 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2127 always actual sizes. */
2128 #define TYPE_IS_SIZETYPE(NODE) \
2129 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2131 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
2132 pointer depressed. */
2133 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
2134 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2136 /* Nonzero in a type considered volatile as a whole. */
2137 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2139 /* Means this type is const-qualified. */
2140 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2142 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2144 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2146 /* There is a TYPE_QUAL value for each type qualifier. They can be
2147 combined by bitwise-or to form the complete set of qualifiers for a
2150 #define TYPE_UNQUALIFIED 0x0
2151 #define TYPE_QUAL_CONST 0x1
2152 #define TYPE_QUAL_VOLATILE 0x2
2153 #define TYPE_QUAL_RESTRICT 0x4
2155 /* The set of type qualifiers for this type. */
2156 #define TYPE_QUALS(NODE) \
2157 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2158 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2159 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2161 /* These flags are available for each language front end to use internally. */
2162 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2163 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2164 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2165 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2166 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2167 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2168 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2170 /* Used to keep track of visited nodes in tree traversals. This is set to
2171 0 by copy_node and make_node. */
2172 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2174 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2175 that distinguish string from array of char).
2176 If set in a INTEGER_TYPE, indicates a character type. */
2177 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2179 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2180 object of the given ARRAY_TYPE. This allows temporaries to be
2182 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2183 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2185 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2186 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2187 (((unsigned HOST_WIDE_INT) 1) \
2188 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2190 /* Set precision to n when we have 2^n sub-parts of the vector. */
2191 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2192 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2194 /* Indicates that objects of this type must be initialized by calling a
2195 function when they are created. */
2196 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2197 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2199 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2200 the same way that the first union alternative would be passed. */
2201 #define TYPE_TRANSPARENT_UNION(NODE) \
2202 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2204 /* For an ARRAY_TYPE, indicates that it is not permitted to
2205 take the address of a component of the type. */
2206 #define TYPE_NONALIASED_COMPONENT(NODE) \
2207 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2209 /* Indicated that objects of this type should be laid out in as
2210 compact a way as possible. */
2211 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2213 /* Used by type_contains_placeholder_p to avoid recomputation.
2214 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2215 this field directly. */
2216 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2217 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2221 struct tree_type GTY(())
2223 struct tree_common common;
2230 unsigned int precision : 9;
2231 ENUM_BITFIELD(machine_mode) mode : 7;
2233 unsigned string_flag : 1;
2234 unsigned no_force_blk_flag : 1;
2235 unsigned needs_constructing_flag : 1;
2236 unsigned transparent_union_flag : 1;
2237 unsigned packed_flag : 1;
2238 unsigned restrict_flag : 1;
2239 unsigned contains_placeholder_bits : 2;
2241 unsigned lang_flag_0 : 1;
2242 unsigned lang_flag_1 : 1;
2243 unsigned lang_flag_2 : 1;
2244 unsigned lang_flag_3 : 1;
2245 unsigned lang_flag_4 : 1;
2246 unsigned lang_flag_5 : 1;
2247 unsigned lang_flag_6 : 1;
2248 unsigned user_align : 1;
2253 union tree_type_symtab {
2254 int GTY ((tag ("0"))) address;
2255 char * GTY ((tag ("1"))) pointer;
2256 struct die_struct * GTY ((tag ("2"))) die;
2257 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2258 descbits ("2"))) symtab;
2267 HOST_WIDE_INT alias_set;
2268 /* Points to a structure whose details depend on the language in use. */
2269 struct lang_type *lang_specific;
2272 /* Define accessor macros for information about type inheritance
2275 A "basetype" means a particular usage of a data type for inheritance
2276 in another type. Each such basetype usage has its own "binfo"
2277 object to describe it. The binfo object is a TREE_VEC node.
2279 Inheritance is represented by the binfo nodes allocated for a
2280 given type. For example, given types C and D, such that D is
2281 inherited by C, 3 binfo nodes will be allocated: one for describing
2282 the binfo properties of C, similarly one for D, and one for
2283 describing the binfo properties of D as a base type for C.
2284 Thus, given a pointer to class C, one can get a pointer to the binfo
2285 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2287 /* BINFO specific flags. */
2289 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2290 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2292 /* Flags for language dependent use. */
2293 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2294 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2295 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2296 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2297 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2298 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2299 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2301 /* The actual data type node being inherited in this basetype. */
2302 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2304 /* The offset where this basetype appears in its containing type.
2305 BINFO_OFFSET slot holds the offset (in bytes)
2306 from the base of the complete object to the base of the part of the
2307 object that is allocated on behalf of this `type'.
2308 This is always 0 except when there is multiple inheritance. */
2310 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2311 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2313 /* The virtual function table belonging to this basetype. Virtual
2314 function tables provide a mechanism for run-time method dispatching.
2315 The entries of a virtual function table are language-dependent. */
2317 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2319 /* The virtual functions in the virtual function table. This is
2320 a TREE_LIST that is used as an initial approximation for building
2321 a virtual function table for this basetype. */
2322 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2324 /* A vector of binfos for the direct basetypes inherited by this
2327 If this basetype describes type D as inherited in C, and if the
2328 basetypes of D are E and F, then this vector contains binfos for
2329 inheritance of E and F by C. */
2330 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2332 /* The number of basetypes for NODE. */
2333 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2335 /* Accessor macro to get to the Nth base binfo of this binfo. */
2336 #define BINFO_BASE_BINFO(NODE,N) \
2337 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2338 #define BINFO_BASE_ITERATE(NODE,N,B) \
2339 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2340 #define BINFO_BASE_APPEND(NODE,T) \
2341 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2343 /* For a BINFO record describing a virtual base class, i.e., one where
2344 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2345 base. The actual contents are language-dependent. In the C++
2346 front-end this field is an INTEGER_CST giving an offset into the
2347 vtable where the offset to the virtual base can be found. */
2348 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2350 /* Indicates the accesses this binfo has to its bases. The values are
2351 access_public_node, access_protected_node or access_private_node.
2352 If this array is not present, public access is implied. */
2353 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2355 #define BINFO_BASE_ACCESS(NODE,N) \
2356 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2357 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2358 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2360 /* The index in the VTT where this subobject's sub-VTT can be found.
2361 NULL_TREE if there is no sub-VTT. */
2362 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2364 /* The index in the VTT where the vptr for this subobject can be
2365 found. NULL_TREE if there is no secondary vptr in the VTT. */
2366 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2368 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2369 inheriting this base for non-virtual bases. For virtual bases it
2370 points either to the binfo for which this is a primary binfo, or to
2371 the binfo of the most derived type. */
2372 #define BINFO_INHERITANCE_CHAIN(NODE) \
2373 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2375 struct tree_binfo GTY (())
2377 struct tree_common common;
2383 VEC(tree,gc) *base_accesses;
2389 VEC(tree,none) base_binfos;
2393 /* Define fields and accessors for nodes representing declared names. */
2395 /* Nonzero if DECL represents a variable for the SSA passes. */
2396 #define SSA_VAR_P(DECL) \
2397 (TREE_CODE (DECL) == VAR_DECL \
2398 || TREE_CODE (DECL) == PARM_DECL \
2399 || TREE_CODE (DECL) == RESULT_DECL \
2401 || (TREE_CODE (DECL) == SSA_NAME \
2402 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2403 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2404 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2405 || MTAG_P (SSA_NAME_VAR (DECL)))))
2410 /* Enumerate visibility settings. */
2411 #ifndef SYMBOL_VISIBILITY_DEFINED
2412 #define SYMBOL_VISIBILITY_DEFINED
2413 enum symbol_visibility
2416 VISIBILITY_PROTECTED,
2425 /* This is the name of the object as written by the user.
2426 It is an IDENTIFIER_NODE. */
2427 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2429 /* Every ..._DECL node gets a unique number. */
2430 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2432 /* These two fields describe where in the source code the declaration
2433 was. If the declaration appears in several places (as for a C
2434 function that is declared first and then defined later), this
2435 information should refer to the definition. */
2436 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2437 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2438 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2439 #ifdef USE_MAPPED_LOCATION
2440 #define DECL_IS_BUILTIN(DECL) \
2441 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2443 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2446 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2447 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2448 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2449 points to either the FUNCTION_DECL for the containing function,
2450 the RECORD_TYPE or UNION_TYPE for the containing type, or
2451 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2453 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2454 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2455 struct tree_decl_minimal GTY(())
2457 struct tree_common common;
2464 /* When computing aliasing information, we represent the memory pointed-to
2465 by pointers with artificial variables called "memory tags" (MT). There
2466 are two kinds of tags, namely symbol and name:
2468 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2469 represent all the pointed-to locations and variables pointed-to by
2470 the same pointer symbol. Usually, this set is computed using
2471 type-based analysis (i.e., alias set classes), but this may not
2474 Name tags (NMT) are used in flow-sensitive points-to alias
2475 analysis, they represent the variables and memory locations
2476 pointed-to by a specific SSA_NAME pointer.
2478 In general, given a pointer P with a symbol tag SMT, the alias set
2479 of SMT should be the union of all the alias sets of the NMTs of
2480 every SSA_NAME for P. */
2481 struct tree_memory_tag GTY(())
2483 struct tree_decl_minimal common;
2485 bitmap GTY ((skip)) aliases;
2487 unsigned int is_global:1;
2490 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2491 #define MTAG_ALIASES(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.aliases)
2493 struct tree_struct_field_tag GTY(())
2495 struct tree_memory_tag common;
2497 /* Parent variable. */
2500 /* Offset inside structure. */
2501 unsigned HOST_WIDE_INT offset;
2503 /* Size of the field. */
2504 unsigned HOST_WIDE_INT size;
2507 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2508 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2509 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2511 /* Memory Partition Tags (MPTs) group memory symbols under one
2512 common name for the purposes of placing memory PHI nodes. */
2514 struct tree_memory_partition_tag GTY(())
2516 struct tree_memory_tag common;
2518 /* Set of symbols grouped under this MPT. */
2522 #define MPT_SYMBOLS(NODE) (MEMORY_PARTITION_TAG_CHECK (NODE)->mpt.symbols)
2525 /* For any sort of a ..._DECL node, this points to the original (abstract)
2526 decl node which this decl is an instance of, or else it is NULL indicating
2527 that this decl is not an instance of some other decl. For example,
2528 in a nested declaration of an inline function, this points back to the
2530 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2532 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2533 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2534 #define DECL_ORIGIN(NODE) \
2535 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2537 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2538 inline instance of some original (abstract) decl from an inline function;
2539 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2540 nodes can also have their abstract origin set to themselves. */
2541 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2542 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2544 /* In a DECL this is the field where attributes are stored. */
2545 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2547 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2548 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2549 For a VAR_DECL, holds the initial value.
2550 For a PARM_DECL, not used--default
2551 values for parameters are encoded in the type of the function,
2552 not in the PARM_DECL slot.
2553 For a FIELD_DECL, this is used for enumeration values and the C
2554 frontend uses it for temporarily storing bitwidth of bitfields.
2556 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2557 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2559 /* Holds the size of the datum, in bits, as a tree expression.
2560 Need not be constant. */
2561 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2562 /* Likewise for the size in bytes. */
2563 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2564 /* Holds the alignment required for the datum, in bits. */
2565 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.u1.a.align)
2566 /* The alignment of NODE, in bytes. */
2567 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2568 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2569 DECL_FIELD_OFFSET which are known to be always zero.
2570 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2572 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2573 /* Holds the machine mode corresponding to the declaration of a variable or
2574 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2576 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2578 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2579 operation it is. Note, however, that this field is overloaded, with
2580 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2581 checked before any access to the former. */
2582 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_common.u1.f)
2583 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2584 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2586 /* Nonzero for a given ..._DECL node means that the name of this node should
2587 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2588 the body of the function should also be ignored. */
2589 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2591 /* Nonzero for a given ..._DECL node means that this node represents an
2592 "abstract instance" of the given declaration (e.g. in the original
2593 declaration of an inline function). When generating symbolic debugging
2594 information, we mustn't try to generate any address information for nodes
2595 marked as "abstract instances" because we don't actually generate
2596 any code or allocate any data space for such instances. */
2597 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2599 /* Language-specific decl information. */
2600 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2602 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2603 do not allocate storage, and refer to a definition elsewhere. Note that
2604 this does not necessarily imply the entity represented by NODE
2605 has no program source-level definition in this translation unit. For
2606 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2607 DECL_EXTERNAL may be true simultaneously; that can be the case for
2608 a C99 "extern inline" function. */
2609 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2611 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2612 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2614 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2616 Also set in some languages for variables, etc., outside the normal
2617 lexical scope, such as class instance variables. */
2618 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2620 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2621 Used in FIELD_DECLs for vtable pointers.
2622 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2623 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2625 /* Used to indicate that this DECL represents a compiler-generated entity. */
2626 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2628 /* Additional flags for language-specific uses. */
2629 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2630 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2631 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2632 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2633 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2634 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2635 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2636 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2638 /* Used to indicate an alias set for the memory pointed to by this
2639 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2640 pointer (or reference) type. */
2641 #define DECL_POINTER_ALIAS_SET(NODE) \
2642 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2644 /* Nonzero if an alias set has been assigned to this declaration. */
2645 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2646 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2648 /* Nonzero for a decl which is at file scope. */
2649 #define DECL_FILE_SCOPE_P(EXP) \
2650 (! DECL_CONTEXT (EXP) \
2651 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2653 /* Nonzero for a decl that is decorated using attribute used.
2654 This indicates compiler tools that this decl needs to be preserved. */
2655 #define DECL_PRESERVE_P(DECL) \
2656 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2658 /* For function local variables of COMPLEX and VECTOR types,
2659 indicates that the variable is not aliased, and that all
2660 modifications to the variable have been adjusted so that
2661 they are killing assignments. Thus the variable may now
2662 be treated as a GIMPLE register, and use real instead of
2663 virtual ops in SSA form. */
2664 #define DECL_GIMPLE_REG_P(DECL) \
2665 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2667 struct tree_decl_common GTY(())
2669 struct tree_decl_minimal common;
2672 ENUM_BITFIELD(machine_mode) mode : 8;
2674 unsigned nonlocal_flag : 1;
2675 unsigned virtual_flag : 1;
2676 unsigned ignored_flag : 1;
2677 unsigned abstract_flag : 1;
2678 unsigned artificial_flag : 1;
2679 unsigned user_align : 1;
2680 unsigned preserve_flag: 1;
2681 unsigned debug_expr_is_from : 1;
2683 unsigned lang_flag_0 : 1;
2684 unsigned lang_flag_1 : 1;
2685 unsigned lang_flag_2 : 1;
2686 unsigned lang_flag_3 : 1;
2687 unsigned lang_flag_4 : 1;
2688 unsigned lang_flag_5 : 1;
2689 unsigned lang_flag_6 : 1;
2690 unsigned lang_flag_7 : 1;
2692 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2693 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2694 unsigned decl_flag_0 : 1;
2695 /* In FIELD_DECL, this is DECL_PACKED. */
2696 unsigned decl_flag_1 : 1;
2697 /* In FIELD_DECL, this is DECL_BIT_FIELD
2698 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2699 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2700 unsigned decl_flag_2 : 1;
2701 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2702 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2703 unsigned decl_flag_3 : 1;
2704 /* Logically, these two would go in a theoretical base shared by var and
2706 unsigned gimple_reg_flag : 1;
2708 union tree_decl_u1 {
2709 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2710 DECL_FUNCTION_CODE. */
2711 enum built_in_function f;
2712 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2713 is used by language-dependent code. */
2715 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2717 struct tree_decl_u1_a {
2718 unsigned int align : 24;
2719 unsigned int off_align : 8;
2726 tree abstract_origin;
2728 HOST_WIDE_INT pointer_alias_set;
2729 /* Points to a structure whose details depend on the language in use. */
2730 struct lang_decl *lang_specific;
2733 extern tree decl_value_expr_lookup (tree);
2734 extern void decl_value_expr_insert (tree, tree);
2736 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2737 if transformations have made this more complicated than evaluating the
2738 decl itself. This should only be used for debugging; once this field has
2739 been set, the decl itself may not legitimately appear in the function. */
2740 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2741 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2742 #define DECL_VALUE_EXPR(NODE) \
2743 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2744 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2745 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2747 /* Holds the RTL expression for the value of a variable or function.
2748 This value can be evaluated lazily for functions, variables with
2749 static storage duration, and labels. */
2750 #define DECL_RTL(NODE) \
2751 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2752 ? (NODE)->decl_with_rtl.rtl \
2753 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2755 /* Set the DECL_RTL for NODE to RTL. */
2756 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2758 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2759 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2761 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2762 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2764 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2765 NODE1, it will not be set for NODE2; this is a lazy copy. */
2766 #define COPY_DECL_RTL(NODE1, NODE2) \
2767 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2769 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2770 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2772 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2773 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2775 struct tree_decl_with_rtl GTY(())
2777 struct tree_decl_common common;
2781 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2782 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2783 of the structure. */
2784 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2786 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2787 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2788 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2789 natural alignment of the field's type). */
2790 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2792 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2793 if so, the type that was originally specified for it.
2794 TREE_TYPE may have been modified (in finish_struct). */
2795 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2797 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2798 if nonzero, indicates that the field occupies the type. */
2799 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2801 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2802 DECL_FIELD_OFFSET which are known to be always zero.
2803 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2805 #define DECL_OFFSET_ALIGN(NODE) \
2806 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align)
2808 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2809 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2810 (FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align = exact_log2 ((X) & -(X)))
2811 /* 1 if the alignment for this type was requested by "aligned" attribute,
2812 0 if it is the default for this type. */
2814 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2815 which this FIELD_DECL is defined. This information is needed when
2816 writing debugging information about vfield and vbase decls for C++. */
2817 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2819 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2820 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2822 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2824 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2826 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2828 #define DECL_NONADDRESSABLE_P(NODE) \
2829 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2831 struct tree_field_decl GTY(())
2833 struct tree_decl_common common;
2836 tree bit_field_type;
2843 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2844 dense, unique within any one function, and may be used to index arrays.
2845 If the value is -1, then no UID has been assigned. */
2846 #define LABEL_DECL_UID(NODE) \
2847 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2849 /* In LABEL_DECL nodes, nonzero means that an error message about
2850 jumping into such a binding contour has been printed for this label. */
2851 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2853 struct tree_label_decl GTY(())
2855 struct tree_decl_with_rtl common;
2856 /* Java's verifier has some need to store information about labels,
2857 and was using fields that no longer exist on labels.
2858 Once the verifier doesn't need these anymore, they should be removed. */
2862 unsigned int java_field_4;
2866 struct tree_result_decl GTY(())
2868 struct tree_decl_with_rtl common;
2871 struct tree_const_decl GTY(())
2873 struct tree_decl_with_rtl common;
2876 /* For a PARM_DECL, records the data type used to pass the argument,
2877 which may be different from the type seen in the program. */
2878 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2880 /* For PARM_DECL, holds an RTL for the stack slot or register
2881 where the data was actually passed. */
2882 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2884 struct tree_parm_decl GTY(())
2886 struct tree_decl_with_rtl common;
2891 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2892 this variable in a BIND_EXPR. */
2893 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2894 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2896 /* Used to indicate that the linkage status of this DECL is not yet known,
2897 so it should not be output now. */
2898 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2900 /* Nonzero for a given ..._DECL node means that no warnings should be
2901 generated just because this node is unused. */
2902 #define DECL_IN_SYSTEM_HEADER(NODE) \
2903 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2905 /* Used to indicate that this DECL has weak linkage. */
2906 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2908 /* Internal to the gimplifier. Indicates that the value is a formal
2909 temporary controlled by the gimplifier. */
2910 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2911 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2913 /* Used to indicate that the DECL is a dllimport. */
2914 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2916 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2917 based on a variable with a restrict qualified type. If it is,
2918 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2921 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2922 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2923 #define DECL_GET_RESTRICT_BASE(NODE) \
2924 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2925 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2926 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2928 extern tree decl_restrict_base_lookup (tree);
2929 extern void decl_restrict_base_insert (tree, tree);
2931 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2932 not be put out unless it is needed in this translation unit.
2933 Entities like this are shared across translation units (like weak
2934 entities), but are guaranteed to be generated by any translation
2935 unit that needs them, and therefore need not be put out anywhere
2936 where they are not needed. DECL_COMDAT is just a hint to the
2937 back-end; it is up to front-ends which set this flag to ensure
2938 that there will never be any harm, other than bloat, in putting out
2939 something which is DECL_COMDAT. */
2940 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2942 /* A replaceable function is one which may be replaced at link-time
2943 with an entirely different definition, provided that the
2944 replacement has the same type. For example, functions declared
2945 with __attribute__((weak)) on most systems are replaceable.
2947 COMDAT functions are not replaceable, since all definitions of the
2948 function must be equivalent. It is important that COMDAT functions
2949 not be treated as replaceable so that use of C++ template
2950 instantiations is not penalized.
2952 For example, DECL_REPLACEABLE is used to determine whether or not a
2953 function (including a template instantiation) which is not
2954 explicitly declared "inline" can be inlined. If the function is
2955 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2956 implementation chosen at link-time may be different. However, a
2957 function that is not DECL_REPLACEABLE can be inlined, since all
2958 versions of the function will be functionally identical. */
2959 #define DECL_REPLACEABLE_P(NODE) \
2960 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2962 /* The name of the object as the assembler will see it (but before any
2963 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2964 as DECL_NAME. It is an IDENTIFIER_NODE. */
2965 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2967 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2968 This is true of all DECL nodes except FIELD_DECL. */
2969 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2970 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2972 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2973 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2975 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2976 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2978 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2979 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2980 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2982 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2983 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2984 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2985 semantics of using this macro, are different than saying:
2987 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2989 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2991 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2992 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2993 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2994 DECL_ASSEMBLER_NAME (DECL1)) \
2997 /* Records the section name in a section attribute. Used to pass
2998 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2999 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3001 /* Value of the decls's visibility attribute */
3002 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3004 /* Nonzero means that the decl had its visibility specified rather than
3006 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3008 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3009 multiple translation units should be merged. */
3010 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
3012 struct tree_decl_with_vis GTY(())
3014 struct tree_decl_with_rtl common;
3015 tree assembler_name;
3018 /* Belong to VAR_DECL exclusively. */
3019 unsigned defer_output:1;
3020 unsigned hard_register:1;
3021 unsigned thread_local:1;
3022 unsigned common_flag:1;
3023 unsigned in_text_section : 1;
3024 unsigned gimple_formal_temp : 1;
3025 unsigned dllimport_flag : 1;
3026 unsigned based_on_restrict_p : 1;
3027 /* Used by C++. Might become a generic decl flag. */
3028 unsigned shadowed_for_var_p : 1;
3030 /* Don't belong to VAR_DECL exclusively. */
3031 unsigned in_system_header_flag : 1;
3032 unsigned weak_flag:1;
3033 unsigned seen_in_bind_expr : 1;
3034 unsigned comdat_flag : 1;
3035 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3036 unsigned visibility_specified : 1;
3037 /* Belong to FUNCTION_DECL exclusively. */
3038 unsigned one_only : 1;
3039 unsigned init_priority_p:1;
3041 /* Belongs to VAR_DECL exclusively. */
3042 ENUM_BITFIELD(tls_model) tls_model : 3;
3043 /* 11 unused bits. */
3046 /* In a VAR_DECL that's static,
3047 nonzero if the space is in the text section. */
3048 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3050 /* Nonzero for a given ..._DECL node means that this node should be
3051 put in .common, if possible. If a DECL_INITIAL is given, and it
3052 is not error_mark_node, then the decl cannot be put in .common. */
3053 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3055 /* In a VAR_DECL, nonzero if the decl is a register variable with
3056 an explicit asm specification. */
3057 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3059 extern tree decl_debug_expr_lookup (tree);
3060 extern void decl_debug_expr_insert (tree, tree);
3061 /* For VAR_DECL, this is set to either an expression that it was split
3062 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3063 subexpressions that it was split into. */
3064 #define DECL_DEBUG_EXPR(NODE) \
3065 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3067 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3068 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3070 /* An initializationp priority. */
3071 typedef unsigned short priority_type;
3073 extern priority_type decl_init_priority_lookup (tree);
3074 extern priority_type decl_fini_priority_lookup (tree);
3075 extern void decl_init_priority_insert (tree, priority_type);
3076 extern void decl_fini_priority_insert (tree, priority_type);
3078 /* In a non-local VAR_DECL with static storage duration, true if the
3079 variable has an initialization priority. If false, the variable
3080 will be initialized at the DEFAULT_INIT_PRIORITY. */
3081 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3082 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3084 /* For a VAR_DECL or FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set,
3085 the initialization priority of NODE. */
3086 #define DECL_INIT_PRIORITY(NODE) \
3087 (decl_init_priority_lookup (NODE))
3088 /* Set the initialization priority for NODE to VAL. */
3089 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3090 (decl_init_priority_insert (NODE, VAL))
3092 /* For a FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set, the
3093 finalization priority of NODE. */
3094 #define DECL_FINI_PRIORITY(NODE) \
3095 (decl_fini_priority_lookup (NODE))
3096 /* Set the finalization priority for NODE to VAL. */
3097 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3098 (decl_fini_priority_insert (NODE, VAL))
3100 /* The initialization priority for entities for which no explicit
3101 initialization priority has been specified. */
3102 #define DEFAULT_INIT_PRIORITY 65535
3104 /* The maximum allowed initialization priority. */
3105 #define MAX_INIT_PRIORITY 65535
3107 /* The largest priority value reserved for use by system runtime
3109 #define MAX_RESERVED_INIT_PRIORITY 100
3111 /* In a VAR_DECL, the model to use if the data should be allocated from
3112 thread-local storage. */
3113 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3115 /* In a VAR_DECL, nonzero if the data should be allocated from
3116 thread-local storage. */
3117 #define DECL_THREAD_LOCAL_P(NODE) \
3118 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
3120 struct tree_var_decl GTY(())
3122 struct tree_decl_with_vis common;
3126 /* This field is used to reference anything in decl.result and is meant only
3127 for use by the garbage collector. */
3128 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3130 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3131 Before the struct containing the FUNCTION_DECL is laid out,
3132 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3133 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3134 function. When the class is laid out, this pointer is changed
3135 to an INTEGER_CST node which is suitable for use as an index
3136 into the virtual function table.
3137 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3138 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3140 struct tree_decl_non_common GTY(())
3143 struct tree_decl_with_vis common;
3144 /* C++ uses this in namespaces. */
3146 /* C++ uses this in templates. */
3148 /* Almost all FE's use this. */
3150 /* C++ uses this in namespaces. */
3154 /* In FUNCTION_DECL, holds the decl for the return value. */
3155 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3157 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3158 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3160 /* In a FUNCTION_DECL, the saved representation of the body of the
3162 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3164 /* Nonzero in a FUNCTION_DECL means this function should be treated
3165 as if it were a malloc, meaning it returns a pointer that is
3167 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3169 /* Nonzero in a FUNCTION_DECL means this function may return more
3171 #define DECL_IS_RETURNS_TWICE(NODE) \
3172 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3174 /* Nonzero in a FUNCTION_DECL means this function should be treated
3175 as "pure" function (like const function, but may read global memory). */
3176 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3178 /* Nonzero in a FUNCTION_DECL means this function should be treated
3179 as "novops" function (function that does not read global memory,
3180 but may have arbitrary side effects). */
3181 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3183 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3184 at the beginning or end of execution. */
3185 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3186 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3188 #define DECL_STATIC_DESTRUCTOR(NODE) \
3189 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3191 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3192 be instrumented with calls to support routines. */
3193 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3194 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3196 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3197 disabled in this function. */
3198 #define DECL_NO_LIMIT_STACK(NODE) \
3199 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3201 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3202 static chain is not needed. */
3203 #define DECL_NO_STATIC_CHAIN(NODE) \
3204 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3206 /* Nonzero for a decl that cgraph has decided should be inlined into
3207 at least one call site. It is not meaningful to look at this
3208 directly; always use cgraph_function_possibly_inlined_p. */
3209 #define DECL_POSSIBLY_INLINED(DECL) \
3210 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3212 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3213 where it is called. */
3214 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3216 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3217 such as via the `inline' keyword in C/C++. This flag controls the linkage
3218 semantics of 'inline'; whether or not the function is inlined is
3219 controlled by DECL_INLINE. */
3220 #define DECL_DECLARED_INLINE_P(NODE) \
3221 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3223 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3224 that describes the status of this function. */
3225 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3227 /* In a FUNCTION_DECL, nonzero means a built in function. */
3228 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3230 /* For a builtin function, identify which part of the compiler defined it. */
3231 #define DECL_BUILT_IN_CLASS(NODE) \
3232 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3234 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3235 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3237 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3238 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3240 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3241 arguments/result/saved_tree fields by front ends. It was either inherit
3242 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3243 which seemed a bit strange. */
3245 struct tree_function_decl GTY(())
3247 struct tree_decl_non_common common;
3249 unsigned static_ctor_flag : 1;
3250 unsigned static_dtor_flag : 1;
3251 unsigned uninlinable : 1;
3252 unsigned possibly_inlined : 1;
3253 unsigned novops_flag : 1;
3254 unsigned returns_twice_flag : 1;
3255 unsigned malloc_flag : 1;
3256 unsigned pure_flag : 1;
3258 unsigned declared_inline_flag : 1;
3259 unsigned regdecl_flag : 1;
3260 unsigned inline_flag : 1;
3261 unsigned no_instrument_function_entry_exit : 1;
3262 unsigned no_limit_stack : 1;
3263 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3268 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3269 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3271 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3272 into stabs. Instead it will generate cross reference ('x') of names.
3273 This uses the same flag as DECL_EXTERNAL. */
3274 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3275 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3277 struct tree_type_decl GTY(())
3279 struct tree_decl_non_common common;
3283 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3284 To reduce overhead, the nodes containing the statements are not trees.
3285 This avoids the overhead of tree_common on all linked list elements.
3287 Use the interface in tree-iterator.h to access this node. */
3289 #define STATEMENT_LIST_HEAD(NODE) \
3290 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3291 #define STATEMENT_LIST_TAIL(NODE) \
3292 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3294 struct tree_statement_list_node
3295 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3297 struct tree_statement_list_node *prev;
3298 struct tree_statement_list_node *next;
3302 struct tree_statement_list
3305 struct tree_common common;
3306 struct tree_statement_list_node *head;
3307 struct tree_statement_list_node *tail;
3310 #define VALUE_HANDLE_ID(NODE) \
3311 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3313 #define VALUE_HANDLE_EXPR_SET(NODE) \
3314 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3316 #define VALUE_HANDLE_VUSES(NODE) \
3317 (VALUE_HANDLE_CHECK (NODE)->value_handle.vuses)
3319 /* Defined and used in tree-ssa-pre.c. */
3321 struct tree_value_handle GTY(())
3323 struct tree_common common;
3325 /* The set of expressions represented by this handle. */
3326 struct bitmap_set * GTY ((skip)) expr_set;
3328 /* Unique ID for this value handle. IDs are handed out in a
3329 conveniently dense form starting at 0, so that we can make
3330 bitmaps of value handles. */
3333 /* Set of virtual uses represented by this handle. */
3334 VEC (tree, gc) *vuses;
3337 /* Define the overall contents of a tree node.
3338 It may be any of the structures declared above
3339 for various types of node. */
3341 union tree_node GTY ((ptr_alias (union lang_tree_node),
3342 desc ("tree_node_structure (&%h)")))
3344 struct tree_base GTY ((tag ("TS_BASE"))) base;
3345 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3346 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3347 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3348 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3349 struct tree_string GTY ((tag ("TS_STRING"))) string;
3350 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3351 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3352 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3353 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3354 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3355 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3356 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3357 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3358 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3359 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3360 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3361 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3362 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3363 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3364 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3365 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3366 struct tree_list GTY ((tag ("TS_LIST"))) list;
3367 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3368 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3369 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3370 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3371 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3372 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3373 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3374 struct gimple_stmt GTY ((tag ("TS_GIMPLE_STATEMENT"))) gstmt;
3375 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3376 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3377 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3378 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3379 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3380 struct tree_memory_partition_tag GTY ((tag ("TS_MEMORY_PARTITION_TAG"))) mpt;
3383 /* Standard named or nameless data types of the C compiler. */
3405 TI_INTEGER_MINUS_ONE,
3422 TI_COMPLEX_INTEGER_TYPE,
3423 TI_COMPLEX_FLOAT_TYPE,
3424 TI_COMPLEX_DOUBLE_TYPE,
3425 TI_COMPLEX_LONG_DOUBLE_TYPE,
3429 TI_LONG_DOUBLE_TYPE,
3433 TI_LONG_DOUBLE_PTR_TYPE,
3434 TI_INTEGER_PTR_TYPE,
3443 TI_VA_LIST_GPR_COUNTER_FIELD,
3444 TI_VA_LIST_FPR_COUNTER_FIELD,
3451 TI_DFLOAT32_PTR_TYPE,
3452 TI_DFLOAT64_PTR_TYPE,
3453 TI_DFLOAT128_PTR_TYPE,
3462 extern GTY(()) tree global_trees[TI_MAX];
3464 #define error_mark_node global_trees[TI_ERROR_MARK]
3466 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3467 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3468 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3469 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3470 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3472 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3473 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3474 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3475 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3476 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3478 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3479 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3481 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3482 #define integer_one_node global_trees[TI_INTEGER_ONE]
3483 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3484 #define size_zero_node global_trees[TI_SIZE_ZERO]
3485 #define size_one_node global_trees[TI_SIZE_ONE]
3486 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3487 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3488 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3490 /* Base access nodes. */
3491 #define access_public_node global_trees[TI_PUBLIC]
3492 #define access_protected_node global_trees[TI_PROTECTED]
3493 #define access_private_node global_trees[TI_PRIVATE]
3495 #define null_pointer_node global_trees[TI_NULL_POINTER]
3497 #define float_type_node global_trees[TI_FLOAT_TYPE]
3498 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3499 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3501 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3502 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3503 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3504 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3506 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3507 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3508 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3509 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3511 #define void_type_node global_trees[TI_VOID_TYPE]
3512 /* The C type `void *'. */
3513 #define ptr_type_node global_trees[TI_PTR_TYPE]
3514 /* The C type `const void *'. */
3515 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3516 /* The C type `size_t'. */
3517 #define size_type_node global_trees[TI_SIZE_TYPE]
3518 #define pid_type_node global_trees[TI_PID_TYPE]
3519 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3520 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3521 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3522 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3523 /* The C type `FILE *'. */
3524 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3526 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3527 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3528 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3530 /* The decimal floating point types. */
3531 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3532 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3533 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3534 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3535 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3536 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3538 /* The node that should be placed at the end of a parameter list to
3539 indicate that the function does not take a variable number of
3540 arguments. The TREE_VALUE will be void_type_node and there will be
3541 no TREE_CHAIN. Language-independent code should not assume
3542 anything else about this node. */
3543 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3545 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3546 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3548 /* An enumeration of the standard C integer types. These must be
3549 ordered so that shorter types appear before longer ones, and so
3550 that signed types appear before unsigned ones, for the correct
3551 functioning of interpret_integer() in c-lex.c. */
3552 enum integer_type_kind
3564 itk_unsigned_long_long,
3568 typedef enum integer_type_kind integer_type_kind;
3570 /* The standard C integer types. Use integer_type_kind to index into
3572 extern GTY(()) tree integer_types[itk_none];
3574 #define char_type_node integer_types[itk_char]
3575 #define signed_char_type_node integer_types[itk_signed_char]
3576 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3577 #define short_integer_type_node integer_types[itk_short]
3578 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3579 #define integer_type_node integer_types[itk_int]
3580 #define unsigned_type_node integer_types[itk_unsigned_int]
3581 #define long_integer_type_node integer_types[itk_long]
3582 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3583 #define long_long_integer_type_node integer_types[itk_long_long]
3584 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3586 /* Set to the default thread-local storage (tls) model to use. */
3588 extern enum tls_model flag_tls_default;
3591 /* A pointer-to-function member type looks like:
3598 If __pfn is NULL, it is a NULL pointer-to-member-function.
3600 (Because the vtable is always the first thing in the object, we
3601 don't need its offset.) If the function is virtual, then PFN is
3602 one plus twice the index into the vtable; otherwise, it is just a
3603 pointer to the function.
3605 Unfortunately, using the lowest bit of PFN doesn't work in
3606 architectures that don't impose alignment requirements on function
3607 addresses, or that use the lowest bit to tell one ISA from another,
3608 for example. For such architectures, we use the lowest bit of
3609 DELTA instead of the lowest bit of the PFN, and DELTA will be
3612 enum ptrmemfunc_vbit_where_t
3614 ptrmemfunc_vbit_in_pfn,
3615 ptrmemfunc_vbit_in_delta
3618 #define NULL_TREE (tree) NULL
3620 extern tree decl_assembler_name (tree);
3621 extern bool decl_assembler_name_equal (tree decl, tree asmname);
3623 /* Compute the number of bytes occupied by 'node'. This routine only
3624 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3626 extern size_t tree_size (tree);
3628 /* Compute the number of bytes occupied by a tree with code CODE. This
3629 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3631 extern size_t tree_code_size (enum tree_code);
3633 /* Lowest level primitive for allocating a node.
3634 The TREE_CODE is the only argument. Contents are initialized
3635 to zero except for a few of the common fields. */
3637 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3638 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3640 /* Make a copy of a node, with all the same contents. */
3642 extern tree copy_node_stat (tree MEM_STAT_DECL);
3643 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3645 /* Make a copy of a chain of TREE_LIST nodes. */
3647 extern tree copy_list (tree);
3650 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3651 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3653 /* Make a TREE_VEC. */
3655 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3656 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3658 /* Tree nodes for SSA analysis. */
3660 extern void init_phinodes (void);
3661 extern void fini_phinodes (void);
3662 extern void release_phi_node (tree);
3663 #ifdef GATHER_STATISTICS
3664 extern void phinodes_print_statistics (void);
3667 extern void init_ssanames (void);
3668 extern void fini_ssanames (void);
3669 extern tree make_ssa_name (tree, tree);
3670 extern tree duplicate_ssa_name (tree, tree);
3671 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3672 extern void release_ssa_name (tree);
3673 extern void release_defs (tree);
3674 extern void replace_ssa_name_symbol (tree, tree);
3676 #ifdef GATHER_STATISTICS
3677 extern void ssanames_print_statistics (void);
3680 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3681 The name is supplied as a char *. */
3683 extern tree get_identifier (const char *);
3685 #if GCC_VERSION >= 3000
3686 #define get_identifier(str) \
3687 (__builtin_constant_p (str) \
3688 ? get_identifier_with_length ((str), strlen (str)) \
3689 : get_identifier (str))
3693 /* Identical to get_identifier, except that the length is assumed
3696 extern tree get_identifier_with_length (const char *, size_t);
3698 /* If an identifier with the name TEXT (a null-terminated string) has
3699 previously been referred to, return that node; otherwise return
3702 extern tree maybe_get_identifier (const char *);
3704 /* Construct various types of nodes. */
3706 extern tree build_nt (enum tree_code, ...);
3707 extern tree build_nt_call_list (tree, tree);
3709 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3710 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3711 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3712 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3713 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3714 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3715 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3716 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3717 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3718 tree MEM_STAT_DECL);
3719 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3720 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3721 tree MEM_STAT_DECL);
3722 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3723 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3724 tree, tree, tree MEM_STAT_DECL);
3725 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3726 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3728 extern tree build_gimple_modify_stmt_stat (tree, tree MEM_STAT_DECL);
3729 #define build_gimple_modify_stmt(t1,t2) \
3730 build_gimple_modify_stmt_stat (t1,t2 MEM_STAT_INFO)
3732 extern tree build_int_cst (tree, HOST_WIDE_INT);
3733 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3734 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3735 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3736 extern tree build_int_cst_wide_type (tree,
3737 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3738 extern tree build_vector (tree, tree);
3739 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3740 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3741 extern tree build_constructor_single (tree, tree, tree);
3742 extern tree build_constructor_from_list (tree, tree);
3743 extern tree build_real_from_int_cst (tree, tree);
3744 extern tree build_complex (tree, tree, tree);
3745 extern tree build_one_cst (tree);
3746 extern tree build_string (int, const char *);
3747 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3748 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3749 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3750 extern tree build_fn_decl (const char *, tree);
3751 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3752 extern tree build_block (tree, tree, tree, tree);
3753 #ifndef USE_MAPPED_LOCATION
3754 extern void annotate_with_file_line (tree, const char *, int);
3755 extern void annotate_with_locus (tree, location_t);
3757 extern tree build_empty_stmt (void);
3758 extern tree build_omp_clause (enum omp_clause_code);
3760 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3761 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3763 extern tree build_call_list (tree, tree, tree);
3764 extern tree build_call_nary (tree, tree, int, ...);
3765 extern tree build_call_valist (tree, tree, int, va_list);
3766 extern tree build_call_array (tree, tree, int, tree*);
3768 /* Construct various nodes representing data types. */
3770 extern tree make_signed_type (int);
3771 extern tree make_unsigned_type (int);
3772 extern tree signed_type_for (tree);
3773 extern tree unsigned_type_for (tree);
3774 extern void initialize_sizetypes (bool);
3775 extern void set_sizetype (tree);
3776 extern void fixup_unsigned_type (tree);
3777 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3778 extern tree build_pointer_type (tree);
3779 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3780 extern tree build_reference_type (tree);
3781 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3782 extern tree build_vector_type (tree innertype, int nunits);
3783 extern tree build_type_no_quals (tree);
3784 extern tree build_index_type (tree);
3785 extern tree build_index_2_type (tree, tree);
3786 extern tree build_array_type (tree, tree);
3787 extern tree build_function_type (tree, tree);
3788 extern tree build_function_type_list (tree, ...);
3789 extern tree build_method_type_directly (tree, tree, tree);
3790 extern tree build_method_type (tree, tree);
3791 extern tree build_offset_type (tree, tree);
3792 extern tree build_complex_type (tree);
3793 extern tree build_resx (int);
3794 extern tree array_type_nelts (tree);
3795 extern bool in_array_bounds_p (tree);
3796 extern bool range_in_array_bounds_p (tree);
3798 extern tree value_member (tree, tree);
3799 extern tree purpose_member (tree, tree);
3801 extern int attribute_list_equal (tree, tree);
3802 extern int attribute_list_contained (tree, tree);
3803 extern int tree_int_cst_equal (tree, tree);
3804 extern int tree_int_cst_lt (tree, tree);
3805 extern int tree_int_cst_compare (tree, tree);
3806 extern int host_integerp (tree, int);
3807 extern HOST_WIDE_INT tree_low_cst (tree, int);
3808 extern int tree_int_cst_msb (tree);
3809 extern int tree_int_cst_sgn (tree);
3810 extern int tree_int_cst_sign_bit (tree);
3811 extern bool tree_expr_nonnegative_p (tree);
3812 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
3813 extern bool may_negate_without_overflow_p (tree);
3814 extern tree get_inner_array_type (tree);
3816 extern tree get_signed_or_unsigned_type (int unsignedp, tree type);
3818 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3819 put the prototype here. Rtl.h does declare the prototype if
3820 tree.h had been included. */
3822 extern tree make_tree (tree, rtx);
3824 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3827 Such modified types already made are recorded so that duplicates
3830 extern tree build_type_attribute_variant (tree, tree);
3831 extern tree build_decl_attribute_variant (tree, tree);
3833 /* Structure describing an attribute and a function to handle it. */
3834 struct attribute_spec
3836 /* The name of the attribute (without any leading or trailing __),
3837 or NULL to mark the end of a table of attributes. */
3838 const char *const name;
3839 /* The minimum length of the list of arguments of the attribute. */
3840 const int min_length;
3841 /* The maximum length of the list of arguments of the attribute
3842 (-1 for no maximum). */
3843 const int max_length;
3844 /* Whether this attribute requires a DECL. If it does, it will be passed
3845 from types of DECLs, function return types and array element types to
3846 the DECLs, function types and array types respectively; but when
3847 applied to a type in any other circumstances, it will be ignored with
3848 a warning. (If greater control is desired for a given attribute,
3849 this should be false, and the flags argument to the handler may be
3850 used to gain greater control in that case.) */
3851 const bool decl_required;
3852 /* Whether this attribute requires a type. If it does, it will be passed
3853 from a DECL to the type of that DECL. */
3854 const bool type_required;
3855 /* Whether this attribute requires a function (or method) type. If it does,
3856 it will be passed from a function pointer type to the target type,
3857 and from a function return type (which is not itself a function
3858 pointer type) to the function type. */
3859 const bool function_type_required;
3860 /* Function to handle this attribute. NODE points to the node to which
3861 the attribute is to be applied. If a DECL, it should be modified in
3862 place; if a TYPE, a copy should be created. NAME is the name of the
3863 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3864 of the arguments (which may be NULL). FLAGS gives further information
3865 about the context of the attribute. Afterwards, the attributes will
3866 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3867 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3868 as well as in any other cases when the attributes should not be added
3869 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3870 applied to another type or DECL later may be returned;
3871 otherwise the return value should be NULL_TREE. This pointer may be
3872 NULL if no special handling is required beyond the checks implied
3873 by the rest of this structure. */
3874 tree (*const handler) (tree *node, tree name, tree args,
3875 int flags, bool *no_add_attrs);
3878 /* Flags that may be passed in the third argument of decl_attributes, and
3879 to handler functions for attributes. */
3880 enum attribute_flags
3882 /* The type passed in is the type of a DECL, and any attributes that
3883 should be passed in again to be applied to the DECL rather than the
3884 type should be returned. */
3885 ATTR_FLAG_DECL_NEXT = 1,
3886 /* The type passed in is a function return type, and any attributes that
3887 should be passed in again to be applied to the function type rather
3888 than the return type should be returned. */
3889 ATTR_FLAG_FUNCTION_NEXT = 2,
3890 /* The type passed in is an array element type, and any attributes that
3891 should be passed in again to be applied to the array type rather
3892 than the element type should be returned. */
3893 ATTR_FLAG_ARRAY_NEXT = 4,
3894 /* The type passed in is a structure, union or enumeration type being
3895 created, and should be modified in place. */
3896 ATTR_FLAG_TYPE_IN_PLACE = 8,
3897 /* The attributes are being applied by default to a library function whose
3898 name indicates known behavior, and should be silently ignored if they
3899 are not in fact compatible with the function type. */
3900 ATTR_FLAG_BUILT_IN = 16
3903 /* Default versions of target-overridable functions. */
3905 extern tree merge_decl_attributes (tree, tree);
3906 extern tree merge_type_attributes (tree, tree);
3908 /* Given a tree node and a string, return nonzero if the tree node is
3909 a valid attribute name for the string. */
3911 extern int is_attribute_p (const char *, tree);
3913 /* Given an attribute name and a list of attributes, return the list element
3914 of the attribute or NULL_TREE if not found. */
3916 extern tree lookup_attribute (const char *, tree);
3918 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3921 extern tree remove_attribute (const char *, tree);
3923 /* Given two attributes lists, return a list of their union. */
3925 extern tree merge_attributes (tree, tree);
3927 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3928 /* Given two Windows decl attributes lists, possibly including
3929 dllimport, return a list of their union . */
3930 extern tree merge_dllimport_decl_attributes (tree, tree);
3932 /* Handle a "dllimport" or "dllexport" attribute. */
3933 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3936 /* Check whether CAND is suitable to be returned from get_qualified_type
3937 (BASE, TYPE_QUALS). */
3939 extern bool check_qualified_type (tree, tree, int);
3941 /* Return a version of the TYPE, qualified as indicated by the
3942 TYPE_QUALS, if one exists. If no qualified version exists yet,
3943 return NULL_TREE. */
3945 extern tree get_qualified_type (tree, int);
3947 /* Like get_qualified_type, but creates the type if it does not
3948 exist. This function never returns NULL_TREE. */
3950 extern tree build_qualified_type (tree, int);
3952 /* Like build_qualified_type, but only deals with the `const' and
3953 `volatile' qualifiers. This interface is retained for backwards
3954 compatibility with the various front-ends; new code should use
3955 build_qualified_type instead. */
3957 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3958 build_qualified_type ((TYPE), \
3959 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3960 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3962 /* Make a copy of a type node. */
3964 extern tree build_distinct_type_copy (tree);
3965 extern tree build_variant_type_copy (tree);
3967 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3968 fields. Optionally specify an alignment, and then lay it out. */
3970 extern void finish_builtin_struct (tree, const char *,
3973 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3974 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3975 node, does nothing except for the first time. */
3977 extern void layout_type (tree);
3979 /* These functions allow a front-end to perform a manual layout of a
3980 RECORD_TYPE. (For instance, if the placement of subsequent fields
3981 depends on the placement of fields so far.) Begin by calling
3982 start_record_layout. Then, call place_field for each of the
3983 fields. Then, call finish_record_layout. See layout_type for the
3984 default way in which these functions are used. */
3986 typedef struct record_layout_info_s
3988 /* The RECORD_TYPE that we are laying out. */
3990 /* The offset into the record so far, in bytes, not including bits in
3993 /* The last known alignment of SIZE. */
3994 unsigned int offset_align;
3995 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3997 /* The alignment of the record so far, in bits. */
3998 unsigned int record_align;
3999 /* The alignment of the record so far, ignoring #pragma pack and
4000 __attribute__ ((packed)), in bits. */
4001 unsigned int unpacked_align;
4002 /* The previous field layed out. */
4004 /* The static variables (i.e., class variables, as opposed to
4005 instance variables) encountered in T. */
4006 tree pending_statics;
4007 /* Bits remaining in the current alignment group */
4008 int remaining_in_alignment;
4009 /* True if we've seen a packed field that didn't have normal
4010 alignment anyway. */
4011 int packed_maybe_necessary;
4012 } *record_layout_info;
4014 extern void set_lang_adjust_rli (void (*) (record_layout_info));
4015 extern record_layout_info start_record_layout (tree);
4016 extern tree bit_from_pos (tree, tree);
4017 extern tree byte_from_pos (tree, tree);
4018 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4019 extern void normalize_offset (tree *, tree *, unsigned int);
4020 extern tree rli_size_unit_so_far (record_layout_info);
4021 extern tree rli_size_so_far (record_layout_info);
4022 extern void normalize_rli (record_layout_info);
4023 extern void place_field (record_layout_info, tree);
4024 extern void compute_record_mode (tree);
4025 extern void finish_record_layout (record_layout_info, int);
4027 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4028 return a canonicalized ..._TYPE node, so that duplicates are not made.
4029 How the hash code is computed is up to the caller, as long as any two
4030 callers that could hash identical-looking type nodes agree. */
4032 extern tree type_hash_canon (unsigned int, tree);
4034 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4035 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4036 fields. Call this only once for any given decl node.
4038 Second argument is the boundary that this field can be assumed to
4039 be starting at (in bits). Zero means it can be assumed aligned
4040 on any boundary that may be needed. */
4042 extern void layout_decl (tree, unsigned);
4044 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4045 a previous call to layout_decl and calls it again. */
4047 extern void relayout_decl (tree);
4049 /* Return the mode for data of a given size SIZE and mode class CLASS.
4050 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4051 The value is BLKmode if no other mode is found. This is like
4052 mode_for_size, but is passed a tree. */
4054 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
4056 /* Return an expr equal to X but certainly not valid as an lvalue. */
4058 extern tree non_lvalue (tree);
4060 extern tree convert (tree, tree);
4061 extern unsigned int expr_align (tree);
4062 extern tree expr_first (tree);
4063 extern tree expr_last (tree);
4064 extern tree expr_only (tree);
4065 extern tree size_in_bytes (tree);
4066 extern HOST_WIDE_INT int_size_in_bytes (tree);
4067 extern HOST_WIDE_INT max_int_size_in_bytes (tree);
4068 extern tree bit_position (tree);
4069 extern HOST_WIDE_INT int_bit_position (tree);
4070 extern tree byte_position (tree);
4071 extern HOST_WIDE_INT int_byte_position (tree);
4073 /* Define data structures, macros, and functions for handling sizes
4074 and the various types used to represent sizes. */
4078 SIZETYPE, /* Normal representation of sizes in bytes. */
4079 SSIZETYPE, /* Signed representation of sizes in bytes. */
4080 BITSIZETYPE, /* Normal representation of sizes in bits. */
4081 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4084 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4086 #define sizetype sizetype_tab[(int) SIZETYPE]
4087 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4088 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4089 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4091 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4092 extern tree size_binop (enum tree_code, tree, tree);
4093 extern tree size_diffop (tree, tree);
4095 #define size_int(L) size_int_kind (L, SIZETYPE)
4096 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4097 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4098 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4100 extern tree round_up (tree, int);
4101 extern tree round_down (tree, int);
4102 extern tree get_pending_sizes (void);
4103 extern void put_pending_size (tree);
4104 extern void put_pending_sizes (tree);
4106 /* Type for sizes of data-type. */
4108 #define BITS_PER_UNIT_LOG \
4109 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4110 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4111 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4113 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4114 extern unsigned int maximum_field_alignment;
4115 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4116 extern unsigned int initial_max_fld_align;
4118 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4119 by making the last node in X point to Y.
4120 Returns X, except if X is 0 returns Y. */
4122 extern tree chainon (tree, tree);
4124 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4126 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4127 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4129 /* Return the last tree node in a chain. */
4131 extern tree tree_last (tree);
4133 /* Reverse the order of elements in a chain, and return the new head. */
4135 extern tree nreverse (tree);
4137 /* Returns the length of a chain of nodes
4138 (number of chain pointers to follow before reaching a null pointer). */
4140 extern int list_length (tree);
4142 /* Returns the number of FIELD_DECLs in a type. */
4144 extern int fields_length (tree);
4146 /* Given an initializer INIT, return TRUE if INIT is zero or some
4147 aggregate of zeros. Otherwise return FALSE. */
4149 extern bool initializer_zerop (tree);
4151 /* Examine CTOR to discover:
4152 * how many scalar fields are set to nonzero values,
4153 and place it in *P_NZ_ELTS;
4154 * how many scalar fields in total are in CTOR,
4155 and place it in *P_ELT_COUNT.
4156 * if a type is a union, and the initializer from the constructor
4157 is not the largest element in the union, then set *p_must_clear.
4159 Return whether or not CTOR is a valid static constant initializer, the same
4160 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4162 extern bool categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4165 extern HOST_WIDE_INT count_type_elements (tree, bool);
4167 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4169 extern int integer_zerop (tree);
4171 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4173 extern int integer_onep (tree);
4175 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4176 all of whose significant bits are 1. */
4178 extern int integer_all_onesp (tree);
4180 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4181 exactly one bit 1. */
4183 extern int integer_pow2p (tree);
4185 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4186 with a nonzero value. */
4188 extern int integer_nonzerop (tree);
4190 extern bool cst_and_fits_in_hwi (tree);
4191 extern tree num_ending_zeros (tree);
4193 /* staticp (tree x) is nonzero if X is a reference to data allocated
4194 at a fixed address in memory. Returns the outermost data. */
4196 extern tree staticp (tree);
4198 /* save_expr (EXP) returns an expression equivalent to EXP
4199 but it can be used multiple times within context CTX
4200 and only evaluate EXP once. */
4202 extern tree save_expr (tree);
4204 /* Look inside EXPR and into any simple arithmetic operations. Return
4205 the innermost non-arithmetic node. */
4207 extern tree skip_simple_arithmetic (tree);
4209 /* Return which tree structure is used by T. */
4211 enum tree_node_structure_enum tree_node_structure (tree);
4213 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4214 or offset that depends on a field within a record.
4216 Note that we only allow such expressions within simple arithmetic
4219 extern bool contains_placeholder_p (tree);
4221 /* This macro calls the above function but short-circuits the common
4222 case of a constant to save time. Also check for null. */
4224 #define CONTAINS_PLACEHOLDER_P(EXP) \
4225 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4227 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4228 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4231 extern bool type_contains_placeholder_p (tree);
4233 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4234 return a tree with all occurrences of references to F in a
4235 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4236 contains only arithmetic expressions. */
4238 extern tree substitute_in_expr (tree, tree, tree);
4240 /* This macro calls the above function but short-circuits the common
4241 case of a constant to save time and also checks for NULL. */
4243 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4244 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4246 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4247 for it within OBJ, a tree that is an object or a chain of references. */
4249 extern tree substitute_placeholder_in_expr (tree, tree);
4251 /* This macro calls the above function but short-circuits the common
4252 case of a constant to save time and also checks for NULL. */
4254 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4255 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4256 : substitute_placeholder_in_expr (EXP, OBJ))
4258 /* variable_size (EXP) is like save_expr (EXP) except that it
4259 is for the special case of something that is part of a
4260 variable size for a data type. It makes special arrangements
4261 to compute the value at the right time when the data type
4262 belongs to a function parameter. */
4264 extern tree variable_size (tree);
4266 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4267 but it can be used multiple times
4268 and only evaluate the subexpressions once. */
4270 extern tree stabilize_reference (tree);
4272 /* Subroutine of stabilize_reference; this is called for subtrees of
4273 references. Any expression with side-effects must be put in a SAVE_EXPR
4274 to ensure that it is only evaluated once. */
4276 extern tree stabilize_reference_1 (tree);
4278 /* Return EXP, stripped of any conversions to wider types
4279 in such a way that the result of converting to type FOR_TYPE
4280 is the same as if EXP were converted to FOR_TYPE.
4281 If FOR_TYPE is 0, it signifies EXP's type. */
4283 extern tree get_unwidened (tree, tree);
4285 /* Return OP or a simpler expression for a narrower value
4286 which can be sign-extended or zero-extended to give back OP.
4287 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4288 or 0 if the value should be sign-extended. */
4290 extern tree get_narrower (tree, int *);
4292 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4293 look for nested component-refs or array-refs at constant positions
4294 and find the ultimate containing object, which is returned. */
4296 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4297 tree *, enum machine_mode *, int *, int *,
4300 /* Return 1 if T is an expression that get_inner_reference handles. */
4302 extern int handled_component_p (tree);
4304 /* Return a tree of sizetype representing the size, in bytes, of the element
4305 of EXP, an ARRAY_REF. */
4307 extern tree array_ref_element_size (tree);
4309 /* Return a tree representing the lower bound of the array mentioned in
4310 EXP, an ARRAY_REF. */
4312 extern tree array_ref_low_bound (tree);
4314 /* Return a tree representing the upper bound of the array mentioned in
4315 EXP, an ARRAY_REF. */
4317 extern tree array_ref_up_bound (tree);
4319 /* Return a tree representing the offset, in bytes, of the field referenced
4320 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4322 extern tree component_ref_field_offset (tree);
4324 /* Given a DECL or TYPE, return the scope in which it was declared, or
4325 NUL_TREE if there is no containing scope. */
4327 extern tree get_containing_scope (tree);
4329 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4331 extern tree decl_function_context (tree);
4333 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4334 this _DECL with its context, or zero if none. */
4335 extern tree decl_type_context (tree);
4337 /* Return 1 if EXPR is the real constant zero. */
4338 extern int real_zerop (tree);
4340 /* Declare commonly used variables for tree structure. */
4342 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4343 Zero means allow extended lvalues. */
4345 extern int pedantic_lvalues;
4347 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4349 extern GTY(()) tree current_function_decl;
4351 /* Nonzero means a FUNC_BEGIN label was emitted. */
4352 extern GTY(()) const char * current_function_func_begin_label;
4355 extern unsigned crc32_string (unsigned, const char *);
4356 extern void clean_symbol_name (char *);
4357 extern tree get_file_function_name (const char *);
4358 extern tree get_callee_fndecl (tree);
4359 extern void change_decl_assembler_name (tree, tree);
4360 extern int type_num_arguments (tree);
4361 extern bool associative_tree_code (enum tree_code);
4362 extern bool commutative_tree_code (enum tree_code);
4363 extern tree upper_bound_in_type (tree, tree);
4364 extern tree lower_bound_in_type (tree, tree);
4365 extern int operand_equal_for_phi_arg_p (tree, tree);
4366 extern bool empty_body_p (tree);
4367 extern tree call_expr_arg (tree, int);
4368 extern tree *call_expr_argp (tree, int);
4369 extern tree call_expr_arglist (tree);
4373 extern void expand_expr_stmt (tree);
4374 extern int warn_if_unused_value (tree, location_t);
4375 extern void expand_label (tree);
4376 extern void expand_goto (tree);
4378 extern rtx expand_stack_save (void);
4379 extern void expand_stack_restore (tree);
4380 extern void expand_return (tree);
4381 extern int is_body_block (tree);
4384 extern void using_eh_for_cleanups (void);
4386 /* In fold-const.c */
4388 /* Non-zero if we are folding constants inside an initializer; zero
4390 extern int folding_initializer;
4392 /* Convert between trees and native memory representation. */
4393 extern int native_encode_expr (tree, unsigned char *, int);
4394 extern tree native_interpret_expr (tree, unsigned char *, int);
4396 /* Fold constants as much as possible in an expression.
4397 Returns the simplified expression.
4398 Acts only on the top level of the expression;
4399 if the argument itself cannot be simplified, its
4400 subexpressions are not changed. */
4402 extern tree fold (tree);
4403 extern tree fold_unary (enum tree_code, tree, tree);
4404 extern tree fold_binary (enum tree_code, tree, tree, tree);
4405 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4406 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4407 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4408 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4409 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4410 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4411 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4412 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4413 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4414 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4415 extern tree fold_build_call_array (tree, tree, int, tree *);
4416 extern tree fold_build_call_array_initializer (tree, tree, int, tree *);
4417 extern tree fold_convert (tree, tree);
4418 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4419 extern tree fold_ignored_result (tree);
4420 extern tree fold_abs_const (tree, tree);
4421 extern tree fold_indirect_ref_1 (tree, tree);
4422 extern void fold_defer_overflow_warnings (void);
4423 extern void fold_undefer_overflow_warnings (bool, tree, int);
4424 extern void fold_undefer_and_ignore_overflow_warnings (void);
4425 extern bool fold_deferring_overflow_warnings_p (void);
4426 extern tree maybe_fold_offset_to_reference (tree, tree, tree);
4428 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4431 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4432 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, tree);
4433 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4434 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4435 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4437 #define add_double(l1,h1,l2,h2,lv,hv) \
4438 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4439 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4440 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4441 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4442 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4443 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4445 #define mul_double(l1,h1,l2,h2,lv,hv) \
4446 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4447 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4448 HOST_WIDE_INT, unsigned int,
4449 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4450 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4451 HOST_WIDE_INT, unsigned int,
4452 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4453 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4454 HOST_WIDE_INT, unsigned int,
4455 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4456 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4457 HOST_WIDE_INT, unsigned int,
4458 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4460 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4461 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4462 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4463 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4466 enum operand_equal_flag
4472 extern int operand_equal_p (tree, tree, unsigned int);
4473 extern int multiple_of_p (tree, tree, tree);
4474 extern tree omit_one_operand (tree, tree, tree);
4475 extern tree omit_two_operands (tree, tree, tree, tree);
4476 extern tree invert_truthvalue (tree);
4477 extern tree fold_truth_not_expr (tree);
4478 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4479 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4480 extern tree fold_read_from_constant_string (tree);
4481 extern tree int_const_binop (enum tree_code, tree, tree, int);
4482 extern tree build_fold_addr_expr (tree);
4483 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4484 extern tree fold_strip_sign_ops (tree);
4485 extern tree build_fold_addr_expr_with_type (tree, tree);
4486 extern tree build_fold_indirect_ref (tree);
4487 extern tree fold_indirect_ref (tree);
4488 extern tree constant_boolean_node (int, tree);
4489 extern tree build_low_bits_mask (tree, unsigned);
4491 extern bool tree_swap_operands_p (tree, tree, bool);
4492 extern void swap_tree_operands (tree, tree *, tree *);
4493 extern enum tree_code swap_tree_comparison (enum tree_code);
4495 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4496 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4498 extern bool tree_expr_nonzero_p (tree);
4499 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4500 extern int multiple_of_p (tree, tree, tree);
4503 extern tree fold_call_expr (tree, bool);
4504 extern tree fold_builtin_fputs (tree, tree, bool, bool, tree);
4505 extern tree fold_builtin_strcpy (tree, tree, tree, tree);
4506 extern tree fold_builtin_strncpy (tree, tree, tree, tree, tree);
4507 extern tree fold_builtin_memory_chk (tree, tree, tree, tree, tree, tree, bool,
4508 enum built_in_function);
4509 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, tree, tree, bool,
4510 enum built_in_function);
4511 extern tree fold_builtin_strncpy_chk (tree, tree, tree, tree, tree);
4512 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4513 extern bool fold_builtin_next_arg (tree, bool);
4514 extern enum built_in_function builtin_mathfn_code (tree);
4515 extern tree build_function_call_expr (tree, tree);
4516 extern tree fold_build_call_expr (tree, tree, tree, tree);
4517 extern tree fold_builtin_call_array (tree, tree, int, tree *);
4518 extern tree build_call_expr (tree, int, ...);
4519 extern tree mathfn_built_in (tree, enum built_in_function fn);
4520 extern tree strip_float_extensions (tree);
4521 extern tree c_strlen (tree, int);
4522 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4523 extern tree build_va_arg_indirect_ref (tree);
4524 extern tree build_string_literal (int, const char *);
4525 extern bool validate_arglist (tree, ...);
4526 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4527 extern int get_pointer_alignment (tree, unsigned int);
4530 extern tree strip_float_extensions (tree);
4533 extern void record_component_aliases (tree);
4534 extern HOST_WIDE_INT get_alias_set (tree);
4535 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4536 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4537 extern int objects_must_conflict_p (tree, tree);
4540 extern int really_constant_p (tree);
4541 extern int int_fits_type_p (tree, tree);
4542 extern void get_type_static_bounds (tree, mpz_t, mpz_t);
4543 extern bool variably_modified_type_p (tree, tree);
4544 extern int tree_log2 (tree);
4545 extern int tree_floor_log2 (tree);
4546 extern int simple_cst_equal (tree, tree);
4547 extern hashval_t iterative_hash_expr (tree, hashval_t);
4548 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
4549 extern int type_list_equal (tree, tree);
4550 extern int chain_member (tree, tree);
4551 extern tree type_hash_lookup (unsigned int, tree);
4552 extern void type_hash_add (unsigned int, tree);
4553 extern int simple_cst_list_equal (tree, tree);
4554 extern void dump_tree_statistics (void);
4555 extern void expand_function_end (void);
4556 extern void expand_function_start (tree);
4557 extern void stack_protect_prologue (void);
4558 extern void stack_protect_epilogue (void);
4559 extern void recompute_tree_invariant_for_addr_expr (tree);
4560 extern bool needs_to_live_in_memory (tree);
4561 extern tree reconstruct_complex_type (tree, tree);
4563 extern int real_onep (tree);
4564 extern int real_twop (tree);
4565 extern int real_minus_onep (tree);
4566 extern void init_ttree (void);
4567 extern void build_common_tree_nodes (bool, bool);
4568 extern void build_common_tree_nodes_2 (int);
4569 extern void build_common_builtin_nodes (void);
4570 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4571 extern tree build_range_type (tree, tree, tree);
4572 extern HOST_WIDE_INT int_cst_value (tree);
4573 extern tree build_addr (tree, tree);
4575 extern bool fields_compatible_p (tree, tree);
4576 extern tree find_compatible_field (tree, tree);
4578 extern location_t expr_location (tree);
4579 extern void set_expr_location (tree, location_t);
4580 extern bool expr_has_location (tree);
4582 #ifdef USE_MAPPED_LOCATION
4588 extern void set_expr_locus (tree,
4589 #ifdef USE_MAPPED_LOCATION
4590 source_location *loc
4595 extern const char **expr_filename (tree);
4596 extern int *expr_lineno (tree);
4597 extern tree *tree_block (tree);
4598 extern tree *generic_tree_operand (tree, int);
4599 extern tree *generic_tree_type (tree);
4602 extern void expand_main_function (void);
4603 extern void init_dummy_function_start (void);
4604 extern void expand_dummy_function_end (void);
4605 extern unsigned int init_function_for_compilation (void);
4606 extern void allocate_struct_function (tree);
4607 extern void init_function_start (tree);
4608 extern bool use_register_for_decl (tree);
4609 extern void setjmp_vars_warning (tree);
4610 extern void setjmp_args_warning (void);
4611 extern void init_temp_slots (void);
4612 extern void free_temp_slots (void);
4613 extern void pop_temp_slots (void);
4614 extern void push_temp_slots (void);
4615 extern void preserve_temp_slots (rtx);
4616 extern int aggregate_value_p (tree, tree);
4617 extern void push_function_context (void);
4618 extern void pop_function_context (void);
4619 extern void push_function_context_to (tree);
4620 extern void pop_function_context_from (tree);
4621 extern tree gimplify_parameters (void);
4623 /* In print-rtl.c */
4625 extern void print_rtl (FILE *, rtx);
4628 /* In print-tree.c */
4629 extern void debug_tree (tree);
4631 extern void dump_addr (FILE*, const char *, void *);
4632 extern void print_node (FILE *, const char *, tree, int);
4633 extern void print_node_brief (FILE *, const char *, tree, int);
4634 extern void indent_to (FILE *, int);
4637 /* In tree-inline.c: */
4638 extern bool debug_find_tree (tree, tree);
4639 /* This is in tree-inline.c since the routine uses
4640 data structures from the inliner. */
4641 extern tree unsave_expr_now (tree);
4642 extern tree build_duplicate_type (tree);
4645 extern rtx emit_line_note (location_t);
4649 /* Nonzero if this is a call to a function whose return value depends
4650 solely on its arguments, has no side effects, and does not read
4653 /* Nonzero if this call will never return. */
4654 #define ECF_NORETURN 2
4655 /* Nonzero if this is a call to malloc or a related function. */
4656 #define ECF_MALLOC 4
4657 /* Nonzero if it is plausible that this is a call to alloca. */
4658 #define ECF_MAY_BE_ALLOCA 8
4659 /* Nonzero if this is a call to a function that won't throw an exception. */
4660 #define ECF_NOTHROW 16
4661 /* Nonzero if this is a call to setjmp or a related function. */
4662 #define ECF_RETURNS_TWICE 32
4663 /* Nonzero if this call replaces the current stack frame. */
4664 #define ECF_SIBCALL 64
4665 /* Nonzero if this is a call to "pure" function (like const function,
4666 but may read memory. */
4667 #define ECF_PURE 128
4668 /* Nonzero if this is a call to a function that returns with the stack
4669 pointer depressed. */
4670 #define ECF_SP_DEPRESSED 256
4671 /* Create libcall block around the call. */
4672 #define ECF_LIBCALL_BLOCK 512
4673 /* Function does not read or write memory (but may have side effects, so
4674 it does not necessarily fit ECF_CONST). */
4675 #define ECF_NOVOPS 1024
4677 extern int flags_from_decl_or_type (tree);
4678 extern int call_expr_flags (tree);
4680 extern int setjmp_call_p (tree);
4681 extern bool alloca_call_p (tree);
4682 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
4683 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
4687 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4688 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4689 it should be modified in place; if a TYPE, a copy should be created
4690 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4691 information, in the form of a bitwise OR of flags in enum attribute_flags
4692 from tree.h. Depending on these flags, some attributes may be
4693 returned to be applied at a later stage (for example, to apply
4694 a decl attribute to the declaration rather than to its type). */
4695 extern tree decl_attributes (tree *, tree, int);
4697 /* In integrate.c */
4698 extern void set_decl_abstract_flags (tree, int);
4699 extern void set_decl_origin_self (tree);
4701 /* In stor-layout.c */
4702 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
4703 extern void fixup_signed_type (tree);
4704 extern void internal_reference_types (void);
4705 extern unsigned int update_alignment_for_field (record_layout_info, tree,
4708 extern void make_decl_rtl (tree);
4709 extern void make_decl_one_only (tree);
4710 extern int supports_one_only (void);
4711 extern void resolve_unique_section (tree, int, int);
4712 extern void mark_referenced (tree);
4713 extern void mark_decl_referenced (tree);
4714 extern void notice_global_symbol (tree);
4715 extern void set_user_assembler_name (tree, const char *);
4716 extern void process_pending_assemble_externals (void);
4717 extern void finish_aliases_1 (void);
4718 extern void finish_aliases_2 (void);
4719 extern tree emutls_decl (tree);
4722 extern void expand_computed_goto (tree);
4723 extern bool parse_output_constraint (const char **, int, int, int,
4724 bool *, bool *, bool *);
4725 extern bool parse_input_constraint (const char **, int, int, int, int,
4726 const char * const *, bool *, bool *);
4727 extern void expand_asm_expr (tree);
4728 extern tree resolve_asm_operand_names (tree, tree, tree);
4729 extern void expand_case (tree);
4730 extern void expand_decl (tree);
4731 extern void expand_anon_union_decl (tree, tree, tree);
4733 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4734 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
4737 /* In gimplify.c. */
4738 extern tree create_artificial_label (void);
4739 extern void gimplify_function_tree (tree);
4740 extern const char *get_name (tree);
4741 extern tree unshare_expr (tree);
4742 extern void sort_case_labels (tree);
4744 /* Interface of the DWARF2 unwind info support. */
4746 /* Generate a new label for the CFI info to refer to. */
4748 extern char *dwarf2out_cfi_label (void);
4750 /* Entry point to update the canonical frame address (CFA). */
4752 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
4754 /* Add the CFI for saving a register window. */
4756 extern void dwarf2out_window_save (const char *);
4758 /* Add a CFI to update the running total of the size of arguments pushed
4761 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
4763 /* Entry point for saving a register to the stack. */
4765 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
4767 /* Entry point for saving the return address in the stack. */
4769 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
4771 /* Entry point for saving the return address in a register. */
4773 extern void dwarf2out_return_reg (const char *, unsigned);
4775 /* Entry point for saving the first register into the second. */
4777 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
4779 /* In tree-inline.c */
4781 /* The type of a set of already-visited pointers. Functions for creating
4782 and manipulating it are declared in pointer-set.h */
4783 struct pointer_set_t;
4785 /* The type of a callback function for walking over tree structure. */
4787 typedef tree (*walk_tree_fn) (tree *, int *, void *);
4788 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
4789 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
4791 /* Assign the RTX to declaration. */
4793 extern void set_decl_rtl (tree, rtx);
4794 extern void set_decl_incoming_rtl (tree, rtx);
4796 /* Enum and arrays used for tree allocation stats.
4797 Keep in sync with tree.c:tree_node_kind_names. */
4823 extern int tree_node_counts[];
4824 extern int tree_node_sizes[];
4826 /* True if we are in gimple form and the actions of the folders need to
4827 be restricted. False if we are not in gimple form and folding is not
4828 restricted to creating gimple expressions. */
4829 extern bool in_gimple_form;
4831 /* In tree-gimple.c. */
4832 extern tree get_base_address (tree t);
4834 /* In tree-vectorizer.c. */
4835 extern void vect_set_verbosity_level (const char *);
4839 struct tree_map_base GTY(())
4844 extern int tree_map_base_eq (const void *, const void *);
4845 extern unsigned int tree_map_base_hash (const void *);
4846 extern int tree_map_base_marked_p (const void *);
4848 /* Map from a tree to another tree. */
4850 struct tree_map GTY(())
4852 struct tree_map_base base;
4857 #define tree_map_eq tree_map_base_eq
4858 extern unsigned int tree_map_hash (const void *);
4859 #define tree_map_marked_p tree_map_base_marked_p
4861 /* Map from a tree to an int. */
4863 struct tree_int_map GTY(())
4865 struct tree_map_base base;
4869 #define tree_int_map_eq tree_map_base_eq
4870 #define tree_int_map_hash tree_map_base_hash
4871 #define tree_int_map_marked_p tree_map_base_marked_p
4873 /* Map from a tree to initialization/finalization priorities. */
4875 struct tree_priority_map GTY(())
4877 struct tree_map_base base;
4882 #define tree_priority_map_eq tree_map_base_eq
4883 #define tree_priority_map_hash tree_map_base_hash
4884 #define tree_priority_map_marked_p tree_map_base_marked_p
4886 /* In tree-ssa-address.c. */
4887 extern tree tree_mem_ref_addr (tree, tree);
4888 extern void copy_mem_ref_info (tree, tree);
4891 extern bool ssa_name_nonzero_p (tree);
4892 extern bool ssa_name_nonnegative_p (tree);
4894 /* In tree-object-size.c. */
4895 extern void init_object_sizes (void);
4896 extern void fini_object_sizes (void);
4897 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
4900 extern unsigned HOST_WIDE_INT highest_pow2_factor (tree);
4902 /* In tree-inline.c. */
4904 void init_inline_once (void);
4906 /* Compute the number of operands in an expression node NODE. For
4907 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4908 otherwise it is looked up from the node's code. */
4910 tree_operand_length (tree node)
4912 if (VL_EXP_CLASS_P (node))
4913 return VL_EXP_OPERAND_LENGTH (node);
4915 return TREE_CODE_LENGTH (TREE_CODE (node));
4918 /* Abstract iterators for CALL_EXPRs. These static inline definitions
4919 have to go towards the end of tree.h so that union tree_node is fully
4920 defined by this point. */
4922 /* Structure containing iterator state. */
4923 typedef struct call_expr_arg_iterator_d GTY (())
4925 tree t; /* the call_expr */
4926 int n; /* argument count */
4927 int i; /* next argument index */
4928 } call_expr_arg_iterator;
4930 /* Initialize the abstract argument list iterator object ITER with the
4931 arguments from CALL_EXPR node EXP. */
4933 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4936 iter->n = call_expr_nargs (exp);
4940 /* Return the next argument from abstract argument list iterator object ITER,
4941 and advance its state. Return NULL_TREE if there are no more arguments. */
4943 next_call_expr_arg (call_expr_arg_iterator *iter)
4946 if (iter->i >= iter->n)
4948 result = CALL_EXPR_ARG (iter->t, iter->i);
4953 /* Initialize the abstract argument list iterator object ITER, then advance
4954 past and return the first argument. Useful in for expressions, e.g.
4955 for (arg = first_call_expr_arg (exp, &iter); arg;
4956 arg = next_call_expr_arg (&iter)) */
4958 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4960 init_call_expr_arg_iterator (exp, iter);
4961 return next_call_expr_arg (iter);
4964 /* Test whether there are more arguments in abstract argument list iterator
4965 ITER, without changing its state. */
4967 more_call_expr_args_p (const call_expr_arg_iterator *iter)
4969 return (iter->i < iter->n);
4973 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4974 (of type call_expr_arg_iterator) to hold the iteration state. */
4975 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4976 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4977 (arg) = next_call_expr_arg (&(iter)))
4979 #endif /* GCC_TREE_H */