1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
28 #include "statistics.h"
30 #include "double-int.h"
32 /* Codes of tree nodes */
34 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
39 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
45 #define MAX_TREE_CODES 512
46 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
47 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
49 /* Number of language-independent tree codes. */
50 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
52 /* Tree code classes. */
54 /* Each tree_code has an associated code class represented by a
57 enum tree_code_class {
58 tcc_exceptional, /* An exceptional code (fits no category). */
59 tcc_constant, /* A constant. */
60 /* Order of tcc_type and tcc_declaration is important. */
61 tcc_type, /* A type object code. */
62 tcc_declaration, /* A declaration (also serving as variable refs). */
63 tcc_reference, /* A reference to storage. */
64 tcc_comparison, /* A comparison expression. */
65 tcc_unary, /* A unary arithmetic expression. */
66 tcc_binary, /* A binary arithmetic expression. */
67 tcc_statement, /* A statement expression, which have side effects
68 but usually no interesting value. */
69 tcc_vl_exp, /* A function call or other expression with a
70 variable-length operand vector. */
71 tcc_expression, /* Any other expression. */
72 tcc_gimple_stmt /* A GIMPLE statement. */
75 /* Each tree code class has an associated string representation.
76 These must correspond to the tree_code_class entries. */
78 extern const char *const tree_code_class_strings[];
80 /* Returns the string representing CLASS. */
82 #define TREE_CODE_CLASS_STRING(CLASS)\
83 tree_code_class_strings[(int) (CLASS)]
85 extern const enum tree_code_class tree_code_type[];
86 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
88 /* Nonzero if CODE represents an exceptional code. */
90 #define EXCEPTIONAL_CLASS_P(CODE)\
91 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
93 /* Nonzero if CODE represents a constant. */
95 #define CONSTANT_CLASS_P(CODE)\
96 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
98 /* Nonzero if CODE represents a type. */
100 #define TYPE_P(CODE)\
101 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
103 /* Nonzero if CODE represents a declaration. */
105 #define DECL_P(CODE)\
106 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
108 /* Nonzero if CODE represents a memory tag. */
110 #define MTAG_P(CODE) \
111 (TREE_CODE (CODE) == STRUCT_FIELD_TAG \
112 || TREE_CODE (CODE) == NAME_MEMORY_TAG \
113 || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG \
114 || TREE_CODE (CODE) == MEMORY_PARTITION_TAG)
117 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
119 #define VAR_OR_FUNCTION_DECL_P(DECL)\
120 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
122 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
123 ascending code order. */
125 #define INDIRECT_REF_P(CODE)\
126 (TREE_CODE (CODE) == INDIRECT_REF \
127 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
128 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
130 /* Nonzero if CODE represents a reference. */
132 #define REFERENCE_CLASS_P(CODE)\
133 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
135 /* Nonzero if CODE represents a comparison. */
137 #define COMPARISON_CLASS_P(CODE)\
138 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
140 /* Nonzero if CODE represents a unary arithmetic expression. */
142 #define UNARY_CLASS_P(CODE)\
143 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
145 /* Nonzero if CODE represents a binary arithmetic expression. */
147 #define BINARY_CLASS_P(CODE)\
148 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
150 /* Nonzero if CODE represents a statement expression. */
152 #define STATEMENT_CLASS_P(CODE)\
153 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
155 /* Nonzero if CODE represents a function call-like expression with a
156 variable-length operand vector. */
158 #define VL_EXP_CLASS_P(CODE)\
159 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
161 /* Nonzero if CODE represents any other expression. */
163 #define EXPRESSION_CLASS_P(CODE)\
164 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
166 /* Returns nonzero iff CODE represents a type or declaration. */
168 #define IS_TYPE_OR_DECL_P(CODE)\
169 (TYPE_P (CODE) || DECL_P (CODE))
171 /* Returns nonzero iff CLASS is the tree-code class of an
174 #define IS_EXPR_CODE_CLASS(CLASS)\
175 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
177 /* Returns nonzer iff CLASS is a GIMPLE statement. */
179 #define IS_GIMPLE_STMT_CODE_CLASS(CLASS) ((CLASS) == tcc_gimple_stmt)
181 /* Returns nonzero iff NODE is an expression of some kind. */
183 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
185 /* Returns nonzero iff NODE is an OpenMP directive. */
187 #define OMP_DIRECTIVE_P(NODE) \
188 (TREE_CODE (NODE) == OMP_PARALLEL \
189 || TREE_CODE (NODE) == OMP_FOR \
190 || TREE_CODE (NODE) == OMP_SECTIONS \
191 || TREE_CODE (NODE) == OMP_SINGLE \
192 || TREE_CODE (NODE) == OMP_SECTION \
193 || TREE_CODE (NODE) == OMP_MASTER \
194 || TREE_CODE (NODE) == OMP_ORDERED \
195 || TREE_CODE (NODE) == OMP_CRITICAL \
196 || TREE_CODE (NODE) == OMP_RETURN \
197 || TREE_CODE (NODE) == OMP_CONTINUE)
199 /* Number of argument-words in each kind of tree-node. */
201 extern const unsigned char tree_code_length[];
202 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
204 /* Names of tree components. */
206 extern const char *const tree_code_name[];
208 /* A vectors of trees. */
210 DEF_VEC_ALLOC_P(tree,gc);
211 DEF_VEC_ALLOC_P(tree,heap);
214 /* Classify which part of the compiler has defined a given builtin function.
215 Note that we assume below that this is no more than two bits. */
224 /* Names for the above. */
225 extern const char *const built_in_class_names[4];
227 /* Codes that identify the various built in functions
228 so that expand_call can identify them quickly. */
230 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
231 enum built_in_function
233 #include "builtins.def"
235 /* Complex division routines in libgcc. These are done via builtins
236 because emit_library_call_value can't handle complex values. */
237 BUILT_IN_COMPLEX_MUL_MIN,
238 BUILT_IN_COMPLEX_MUL_MAX
239 = BUILT_IN_COMPLEX_MUL_MIN
240 + MAX_MODE_COMPLEX_FLOAT
241 - MIN_MODE_COMPLEX_FLOAT,
243 BUILT_IN_COMPLEX_DIV_MIN,
244 BUILT_IN_COMPLEX_DIV_MAX
245 = BUILT_IN_COMPLEX_DIV_MIN
246 + MAX_MODE_COMPLEX_FLOAT
247 - MIN_MODE_COMPLEX_FLOAT,
249 /* Upper bound on non-language-specific builtins. */
254 /* Names for the above. */
255 extern const char * built_in_names[(int) END_BUILTINS];
257 /* Helper macros for math builtins. */
259 #define BUILTIN_EXP10_P(FN) \
260 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
261 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
263 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
264 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
265 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
267 #define BUILTIN_SQRT_P(FN) \
268 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
270 #define BUILTIN_CBRT_P(FN) \
271 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
273 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
275 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
276 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
277 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
279 /* An array of _DECL trees for the above. */
280 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
281 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
283 /* In an OMP_CLAUSE node. */
285 /* Number of operands and names for each clause. */
286 extern unsigned const char omp_clause_num_ops[];
287 extern const char * const omp_clause_code_name[];
289 /* Clause codes. Do not reorder, as this is used to index into the tables
290 omp_clause_num_ops and omp_clause_code_name. */
293 /* Clause zero is special-cased inside the parser
294 (c_parser_omp_variable_list). */
295 OMP_CLAUSE_ERROR = 0,
297 /* OpenMP clause: private (variable_list). */
300 /* OpenMP clause: shared (variable_list). */
303 /* OpenMP clause: firstprivate (variable_list). */
304 OMP_CLAUSE_FIRSTPRIVATE,
306 /* OpenMP clause: lastprivate (variable_list). */
307 OMP_CLAUSE_LASTPRIVATE,
309 /* OpenMP clause: reduction (operator:variable_list).
310 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
311 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
312 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
314 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
315 placeholder used in OMP_CLAUSE_REDUCTION_MERGE. */
316 OMP_CLAUSE_REDUCTION,
318 /* OpenMP clause: copyin (variable_list). */
321 /* OpenMP clause: copyprivate (variable_list). */
322 OMP_CLAUSE_COPYPRIVATE,
324 /* OpenMP clause: if (scalar-expression). */
327 /* OpenMP clause: num_threads (integer-expression). */
328 OMP_CLAUSE_NUM_THREADS,
330 /* OpenMP clause: schedule. */
333 /* OpenMP clause: nowait. */
336 /* OpenMP clause: ordered. */
339 /* OpenMP clause: default. */
343 /* The definition of tree nodes fills the next several pages. */
345 /* A tree node can represent a data type, a variable, an expression
346 or a statement. Each node has a TREE_CODE which says what kind of
347 thing it represents. Some common codes are:
348 INTEGER_TYPE -- represents a type of integers.
349 ARRAY_TYPE -- represents a type of pointer.
350 VAR_DECL -- represents a declared variable.
351 INTEGER_CST -- represents a constant integer value.
352 PLUS_EXPR -- represents a sum (an expression).
354 As for the contents of a tree node: there are some fields
355 that all nodes share. Each TREE_CODE has various special-purpose
356 fields as well. The fields of a node are never accessed directly,
357 always through accessor macros. */
359 /* Every kind of tree node starts with this structure,
360 so all nodes have these fields.
362 See the accessor macros, defined below, for documentation of the
366 struct tree_base GTY(())
368 ENUM_BITFIELD(tree_code) code : 16;
370 unsigned side_effects_flag : 1;
371 unsigned constant_flag : 1;
372 unsigned addressable_flag : 1;
373 unsigned volatile_flag : 1;
374 unsigned readonly_flag : 1;
375 unsigned unsigned_flag : 1;
376 unsigned asm_written_flag: 1;
377 unsigned nowarning_flag : 1;
379 unsigned used_flag : 1;
380 unsigned nothrow_flag : 1;
381 unsigned static_flag : 1;
382 unsigned public_flag : 1;
383 unsigned private_flag : 1;
384 unsigned protected_flag : 1;
385 unsigned deprecated_flag : 1;
386 unsigned invariant_flag : 1;
388 unsigned lang_flag_0 : 1;
389 unsigned lang_flag_1 : 1;
390 unsigned lang_flag_2 : 1;
391 unsigned lang_flag_3 : 1;
392 unsigned lang_flag_4 : 1;
393 unsigned lang_flag_5 : 1;
394 unsigned lang_flag_6 : 1;
395 unsigned visited : 1;
399 /* FIXME tuples: Eventually, we need to move this somewhere external to
401 union tree_ann_d *ann;
404 struct tree_common GTY(())
406 struct tree_base base;
411 /* GIMPLE_MODIFY_STMT */
412 struct gimple_stmt GTY(())
414 struct tree_base base;
417 /* FIXME tuples: Eventually this should be of type ``struct gimple_expr''. */
418 tree GTY ((length ("TREE_CODE_LENGTH (TREE_CODE (&%h))"))) operands[1];
421 /* The following table lists the uses of each of the above flags and
422 for which types of nodes they are defined. Note that expressions
428 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
429 ..._TYPE, IDENTIFIER_NODE.
430 In a STMT_EXPR, it means we want the result of the enclosed
432 CALL_EXPR_TAILCALL in CALL_EXPR
433 CASE_LOW_SEEN in CASE_LABEL_EXPR
438 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
441 TREE_SYMBOL_REFERENCED in
444 TARGET_EXPR, WITH_CLEANUP_EXPR
447 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
448 TYPE_REF_CAN_ALIAS_ALL in
449 POINTER_TYPE, REFERENCE_TYPE
452 CASE_HIGH_SEEN in CASE_LABEL_EXPR
457 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
459 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
462 TYPE_CACHED_VALUES_P in
464 SAVE_EXPR_RESOLVED_P in
466 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
467 OMP_CLAUSE_LASTPRIVATE
468 OMP_CLAUSE_PRIVATE_DEBUG in
475 CALL_EXPR_RETURN_SLOT_OPT in
478 PARM_DECL, RESULT_DECL
483 OMP_PARALLEL_COMBINED in
506 TREE_THIS_VOLATILE in
524 TYPE_SIZES_GIMPLIFIED
533 BIT_FIELD_REF_UNSIGNED in
539 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
545 expressions, IDENTIFIER_NODE
550 CALL_EXPR, FUNCTION_DECL
556 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
563 IDENTIFIER_TRANSPARENT_ALIAS in
568 Used in tree traversals to mark visited nodes.
578 ... any expr or decl node
581 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
582 enum tree_node_structure_enum {
583 #include "treestruct.def"
588 /* Define accessors for the fields that all tree nodes have
589 (though some fields are not used for all kinds of nodes). */
591 /* The tree-code says what kind of node it is.
592 Codes are defined in tree.def. */
593 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
594 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
596 /* When checking is enabled, errors will be generated if a tree node
597 is accessed incorrectly. The macros die with a fatal error. */
598 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
600 #define TREE_CHECK(T, CODE) __extension__ \
601 ({ const tree __t = (T); \
602 if (TREE_CODE (__t) != (CODE)) \
603 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
607 #define TREE_NOT_CHECK(T, CODE) __extension__ \
608 ({ const tree __t = (T); \
609 if (TREE_CODE (__t) == (CODE)) \
610 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
614 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
615 ({ const tree __t = (T); \
616 if (TREE_CODE (__t) != (CODE1) \
617 && TREE_CODE (__t) != (CODE2)) \
618 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
619 (CODE1), (CODE2), 0); \
622 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
623 ({ const tree __t = (T); \
624 if (TREE_CODE (__t) == (CODE1) \
625 || TREE_CODE (__t) == (CODE2)) \
626 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
627 (CODE1), (CODE2), 0); \
630 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
631 ({ const tree __t = (T); \
632 if (TREE_CODE (__t) != (CODE1) \
633 && TREE_CODE (__t) != (CODE2) \
634 && TREE_CODE (__t) != (CODE3)) \
635 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
636 (CODE1), (CODE2), (CODE3), 0); \
639 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
640 ({ const tree __t = (T); \
641 if (TREE_CODE (__t) == (CODE1) \
642 || TREE_CODE (__t) == (CODE2) \
643 || TREE_CODE (__t) == (CODE3)) \
644 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
645 (CODE1), (CODE2), (CODE3), 0); \
648 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
649 ({ const tree __t = (T); \
650 if (TREE_CODE (__t) != (CODE1) \
651 && TREE_CODE (__t) != (CODE2) \
652 && TREE_CODE (__t) != (CODE3) \
653 && TREE_CODE (__t) != (CODE4)) \
654 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
655 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
658 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
659 ({ const tree __t = (T); \
660 if (TREE_CODE (__t) == (CODE1) \
661 || TREE_CODE (__t) == (CODE2) \
662 || TREE_CODE (__t) == (CODE3) \
663 || TREE_CODE (__t) == (CODE4)) \
664 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
665 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
668 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
669 ({ const tree __t = (T); \
670 if (TREE_CODE (__t) != (CODE1) \
671 && TREE_CODE (__t) != (CODE2) \
672 && TREE_CODE (__t) != (CODE3) \
673 && TREE_CODE (__t) != (CODE4) \
674 && TREE_CODE (__t) != (CODE5)) \
675 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
676 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
679 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
680 ({ const tree __t = (T); \
681 if (TREE_CODE (__t) == (CODE1) \
682 || TREE_CODE (__t) == (CODE2) \
683 || TREE_CODE (__t) == (CODE3) \
684 || TREE_CODE (__t) == (CODE4) \
685 || TREE_CODE (__t) == (CODE5)) \
686 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
687 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
690 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
691 ({ const tree __t = (T); \
692 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
693 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
697 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
698 ({ const tree __t = (T); \
699 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
700 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
704 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
705 ({ const tree __t = (T); \
706 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
707 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
711 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
712 ({ const tree __t = (T); \
713 if (TREE_CODE (__t) != OMP_CLAUSE) \
714 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
716 if (__t->omp_clause.code != (CODE)) \
717 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
721 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
722 ({ const tree __t = (T); \
723 if (TREE_CODE (__t) != OMP_CLAUSE) \
724 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
726 if ((int) __t->omp_clause.code < (int) (CODE1) \
727 || (int) __t->omp_clause.code > (int) (CODE2)) \
728 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
729 __FUNCTION__, (CODE1), (CODE2)); \
732 /* These checks have to be special cased. */
733 #define EXPR_CHECK(T) __extension__ \
734 ({ const tree __t = (T); \
735 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
736 if (!IS_EXPR_CODE_CLASS (__c)) \
737 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
741 #define GIMPLE_STMT_CHECK(T) __extension__ \
742 ({ const tree __t = (T); \
743 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
744 if (!IS_GIMPLE_STMT_CODE_CLASS (__c)) \
745 tree_class_check_failed (__t, tcc_gimple_stmt, __FILE__, __LINE__,\
749 /* These checks have to be special cased. */
750 #define NON_TYPE_CHECK(T) __extension__ \
751 ({ const tree __t = (T); \
753 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
757 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
758 (*({const tree __t = (T); \
759 const int __i = (I); \
760 if (TREE_CODE (__t) != TREE_VEC) \
761 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
763 if (__i < 0 || __i >= __t->vec.length) \
764 tree_vec_elt_check_failed (__i, __t->vec.length, \
765 __FILE__, __LINE__, __FUNCTION__); \
766 &__t->vec.a[__i]; }))
768 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
769 (*({const tree __t = t; \
770 const int __i = (i); \
771 if (TREE_CODE (__t) != PHI_NODE) \
772 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
774 if (__i < 0 || __i >= __t->phi.capacity) \
775 phi_node_elt_check_failed (__i, __t->phi.num_args, \
776 __FILE__, __LINE__, __FUNCTION__); \
777 &__t->phi.a[__i]; }))
779 #define OMP_CLAUSE_ELT_CHECK(t, i) __extension__ \
780 (*({const tree __t = t; \
781 const int __i = (i); \
782 if (TREE_CODE (__t) != OMP_CLAUSE) \
783 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
785 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
786 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
788 &__t->omp_clause.ops[__i]; }))
790 /* Special checks for TREE_OPERANDs. */
791 #define TREE_OPERAND_CHECK(T, I) __extension__ \
792 (*({const tree __t = EXPR_CHECK (T); \
793 const int __i = (I); \
794 if (GIMPLE_TUPLE_P (__t)) \
795 gcc_unreachable (); \
796 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
797 tree_operand_check_failed (__i, __t, \
798 __FILE__, __LINE__, __FUNCTION__); \
799 &__t->exp.operands[__i]; }))
801 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
802 (*({const tree __t = (T); \
803 const int __i = (I); \
804 if (TREE_CODE (__t) != CODE) \
805 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
806 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
807 tree_operand_check_failed (__i, __t, \
808 __FILE__, __LINE__, __FUNCTION__); \
809 &__t->exp.operands[__i]; }))
811 /* Special checks for GIMPLE_STMT_OPERANDs. */
812 #define GIMPLE_STMT_OPERAND_CHECK(T, I) __extension__ \
813 (*({const tree __t = GIMPLE_STMT_CHECK (T); \
814 const int __i = (I); \
815 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
816 tree_operand_check_failed (__i, __t, \
817 __FILE__, __LINE__, __FUNCTION__); \
818 &__t->gstmt.operands[__i]; }))
820 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
822 ({const tree __t = (T); \
823 const int __i = (I); \
824 if (TREE_CODE (__t) != (CODE)) \
825 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
826 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
827 tree_operand_check_failed (__i, __t, \
828 __FILE__, __LINE__, __FUNCTION__); \
829 &__t->exp.operands[__i]; }))
831 /* Nodes are chained together for many purposes.
832 Types are chained together to record them for being output to the debugger
833 (see the function `chain_type').
834 Decls in the same scope are chained together to record the contents
836 Statement nodes for successive statements used to be chained together.
837 Often lists of things are represented by TREE_LIST nodes that
838 are chained together. */
840 #define TREE_CHAIN(NODE) __extension__ \
841 (*({const tree __t = (NODE); \
842 if (GIMPLE_TUPLE_P (__t)) \
843 gcc_unreachable (); \
844 &__t->common.chain; }))
846 /* In all nodes that are expressions, this is the data type of the expression.
847 In POINTER_TYPE nodes, this is the type that the pointer points to.
848 In ARRAY_TYPE nodes, this is the type of the elements.
849 In VECTOR_TYPE nodes, this is the type of the elements. */
850 #define TREE_TYPE(NODE) __extension__ \
851 (*({const tree __t = (NODE); \
852 if (GIMPLE_TUPLE_P (__t)) \
853 gcc_unreachable (); \
854 &__t->common.type; }))
856 extern void tree_contains_struct_check_failed (const tree,
857 const enum tree_node_structure_enum,
858 const char *, int, const char *)
861 extern void tree_check_failed (const tree, const char *, int, const char *,
862 ...) ATTRIBUTE_NORETURN;
863 extern void tree_not_check_failed (const tree, const char *, int, const char *,
864 ...) ATTRIBUTE_NORETURN;
865 extern void tree_class_check_failed (const tree, const enum tree_code_class,
866 const char *, int, const char *)
868 extern void tree_range_check_failed (const tree, const char *, int,
869 const char *, enum tree_code,
871 extern void tree_not_class_check_failed (const tree,
872 const enum tree_code_class,
873 const char *, int, const char *)
875 extern void tree_vec_elt_check_failed (int, int, const char *,
878 extern void phi_node_elt_check_failed (int, int, const char *,
881 extern void tree_operand_check_failed (int, tree,
882 const char *, int, const char *)
884 extern void omp_clause_check_failed (const tree, const char *, int,
885 const char *, enum omp_clause_code)
887 extern void omp_clause_operand_check_failed (int, tree, const char *,
890 extern void omp_clause_range_check_failed (const tree, const char *, int,
891 const char *, enum omp_clause_code,
892 enum omp_clause_code)
895 #else /* not ENABLE_TREE_CHECKING, or not gcc */
897 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
898 #define TREE_CHECK(T, CODE) (T)
899 #define TREE_NOT_CHECK(T, CODE) (T)
900 #define TREE_CHECK2(T, CODE1, CODE2) (T)
901 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
902 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
903 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
904 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
905 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
906 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
907 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
908 #define TREE_CLASS_CHECK(T, CODE) (T)
909 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
910 #define EXPR_CHECK(T) (T)
911 #define GIMPLE_STMT_CHECK(T) (T)
912 #define NON_TYPE_CHECK(T) (T)
913 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
914 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
915 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
916 #define GIMPLE_STMT_OPERAND_CHECK(T, I) ((T)->gstmt.operands[I])
917 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
918 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
919 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
920 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
921 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
923 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
924 #define TREE_TYPE(NODE) ((NODE)->common.type)
928 #define TREE_BLOCK(NODE) *(tree_block (NODE))
930 #include "tree-check.h"
932 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
933 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
934 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
935 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
936 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
937 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
938 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
939 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
940 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
941 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
942 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
943 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
945 #define RECORD_OR_UNION_CHECK(T) \
946 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
947 #define NOT_RECORD_OR_UNION_CHECK(T) \
948 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
950 #define NUMERICAL_TYPE_CHECK(T) \
951 TREE_CHECK4 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE)
953 /* Nonzero if NODE is a GIMPLE statement. */
954 #define GIMPLE_STMT_P(NODE) \
955 (TREE_CODE_CLASS (TREE_CODE ((NODE))) == tcc_gimple_stmt)
957 /* Nonzero if NODE is a GIMPLE tuple. */
958 #define GIMPLE_TUPLE_P(NODE) (GIMPLE_STMT_P (NODE) || TREE_CODE (NODE) == PHI_NODE)
960 /* A GIMPLE tuple that has a ``locus'' field. */
961 #define GIMPLE_TUPLE_HAS_LOCUS_P(NODE) GIMPLE_STMT_P ((NODE))
963 /* Like TREE_OPERAND but works with GIMPLE stmt tuples as well.
965 If you know the NODE is a GIMPLE statement, use GIMPLE_STMT_OPERAND. If the
966 NODE code is unknown at compile time, use this macro. */
967 #define GENERIC_TREE_OPERAND(NODE, I) *(generic_tree_operand ((NODE), (I)))
969 /* Like TREE_TYPE but returns void_type_node for gimple tuples that have
972 #define GENERIC_TREE_TYPE(NODE) *(generic_tree_type ((NODE)))
974 /* Here is how primitive or already-canonicalized types' hash codes
976 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
978 /* A simple hash function for an arbitrary tree node. This must not be
979 used in hash tables which are saved to a PCH. */
980 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
982 /* The TREE_CHAIN but it is able to handle tuples. */
983 #define GENERIC_NEXT(NODE) \
984 (TREE_CODE (NODE) == PHI_NODE ? PHI_CHAIN (NODE) : \
985 GIMPLE_STMT_P (NODE) ? NULL_TREE : TREE_CHAIN (NODE))
987 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
988 that don't change the machine mode. */
990 #define STRIP_NOPS(EXP) \
991 while ((TREE_CODE (EXP) == NOP_EXPR \
992 || TREE_CODE (EXP) == CONVERT_EXPR \
993 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
994 && TREE_OPERAND (EXP, 0) != error_mark_node \
995 && (TYPE_MODE (TREE_TYPE (EXP)) \
996 == TYPE_MODE (GENERIC_TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
997 (EXP) = TREE_OPERAND (EXP, 0)
999 /* Like STRIP_NOPS, but don't let the signedness change either. */
1001 #define STRIP_SIGN_NOPS(EXP) \
1002 while ((TREE_CODE (EXP) == NOP_EXPR \
1003 || TREE_CODE (EXP) == CONVERT_EXPR \
1004 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1005 && TREE_OPERAND (EXP, 0) != error_mark_node \
1006 && (TYPE_MODE (TREE_TYPE (EXP)) \
1007 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1008 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
1009 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1010 (EXP) = TREE_OPERAND (EXP, 0)
1012 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1014 #define STRIP_TYPE_NOPS(EXP) \
1015 while ((TREE_CODE (EXP) == NOP_EXPR \
1016 || TREE_CODE (EXP) == CONVERT_EXPR \
1017 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1018 && TREE_OPERAND (EXP, 0) != error_mark_node \
1019 && (TREE_TYPE (EXP) \
1020 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1021 (EXP) = TREE_OPERAND (EXP, 0)
1023 /* Remove unnecessary type conversions according to
1024 tree_ssa_useless_type_conversion. */
1026 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1027 while (tree_ssa_useless_type_conversion (EXP)) \
1028 EXP = TREE_OPERAND (EXP, 0)
1030 /* Nonzero if TYPE represents an integral type. Note that we do not
1031 include COMPLEX types here. Keep these checks in ascending code
1034 #define INTEGRAL_TYPE_P(TYPE) \
1035 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1036 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1037 || TREE_CODE (TYPE) == INTEGER_TYPE)
1039 /* Nonzero if TYPE represents a scalar floating-point type. */
1041 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1043 /* Nonzero if TYPE represents a complex floating-point type. */
1045 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1046 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1047 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1049 /* Nonzero if TYPE represents a vector floating-point type. */
1051 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1052 (TREE_CODE (TYPE) == VECTOR_TYPE \
1053 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1055 /* Nonzero if TYPE represents a floating-point type, including complex
1056 and vector floating-point types. The vector and complex check does
1057 not use the previous two macros to enable early folding. */
1059 #define FLOAT_TYPE_P(TYPE) \
1060 (SCALAR_FLOAT_TYPE_P (TYPE) \
1061 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1062 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1063 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1065 /* Nonzero if TYPE represents a decimal floating-point type. */
1066 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1067 (SCALAR_FLOAT_TYPE_P (TYPE) \
1068 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1070 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1071 Keep these checks in ascending code order. */
1073 #define AGGREGATE_TYPE_P(TYPE) \
1074 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1075 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1077 /* Nonzero if TYPE represents a pointer or reference type.
1078 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1079 ascending code order. */
1081 #define POINTER_TYPE_P(TYPE) \
1082 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1084 /* Nonzero if this type is a complete type. */
1085 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1087 /* Nonzero if this type is the (possibly qualified) void type. */
1088 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1090 /* Nonzero if this type is complete or is cv void. */
1091 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1092 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1094 /* Nonzero if this type is complete or is an array with unspecified bound. */
1095 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1096 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1099 /* Define many boolean fields that all tree nodes have. */
1101 /* In VAR_DECL nodes, nonzero means address of this is needed.
1102 So it cannot be in a register.
1103 In a FUNCTION_DECL, nonzero means its address is needed.
1104 So it must be compiled even if it is an inline function.
1105 In a FIELD_DECL node, it means that the programmer is permitted to
1106 construct the address of this field. This is used for aliasing
1107 purposes: see record_component_aliases.
1108 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1109 In LABEL_DECL nodes, it means a goto for this label has been seen
1110 from a place outside all binding contours that restore stack levels.
1111 In ..._TYPE nodes, it means that objects of this type must
1112 be fully addressable. This means that pieces of this
1113 object cannot go into register parameters, for example.
1114 In IDENTIFIER_NODEs, this means that some extern decl for this name
1115 had its address taken. That matters for inline functions. */
1116 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1118 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1119 exit of a function. Calls for which this is true are candidates for tail
1120 call optimizations. */
1121 #define CALL_EXPR_TAILCALL(NODE) \
1122 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1124 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1125 CASE_LOW operand has been processed. */
1126 #define CASE_LOW_SEEN(NODE) \
1127 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1129 /* In a VAR_DECL, nonzero means allocate static storage.
1130 In a FUNCTION_DECL, nonzero if function has been defined.
1131 In a CONSTRUCTOR, nonzero means allocate static storage.
1133 ??? This is also used in lots of other nodes in unclear ways which
1134 should be cleaned up some day. */
1135 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1137 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
1138 should only be executed if an exception is thrown, not on normal exit
1140 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1142 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1143 CASE_HIGH operand has been processed. */
1144 #define CASE_HIGH_SEEN(NODE) \
1145 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1147 /* In an expr node (usually a conversion) this means the node was made
1148 implicitly and should not lead to any sort of warning. In a decl node,
1149 warnings concerning the decl should be suppressed. This is used at
1150 least for used-before-set warnings, and it set after one warning is
1152 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1154 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1155 this string as an argument. */
1156 #define TREE_SYMBOL_REFERENCED(NODE) \
1157 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1159 /* Nonzero in a pointer or reference type means the data pointed to
1160 by this type can alias anything. */
1161 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1162 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1164 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1165 #define MOVE_NONTEMPORAL(NODE) \
1166 (GIMPLE_MODIFY_STMT_CHECK (NODE)->base.static_flag)
1168 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1169 there was an overflow in folding. */
1171 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1173 /* ??? This is an obsolete synonym for TREE_OVERFLOW. */
1174 #define TREE_CONSTANT_OVERFLOW(NODE) TREE_OVERFLOW(NODE)
1176 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1178 #define TREE_OVERFLOW_P(EXPR) \
1179 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1181 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1182 nonzero means name is to be accessible from outside this module.
1183 In an IDENTIFIER_NODE, nonzero means an external declaration
1184 accessible from outside this module was previously seen
1185 for this name in an inner scope. */
1186 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1188 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1189 of cached values, or is something else. */
1190 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1192 /* In a SAVE_EXPR, indicates that the original expression has already
1193 been substituted with a VAR_DECL that contains the value. */
1194 #define SAVE_EXPR_RESOLVED_P(NODE) \
1195 (TREE_CHECK (NODE, SAVE_EXPR)->base.public_flag)
1197 /* In any expression, decl, or constant, nonzero means it has side effects or
1198 reevaluation of the whole expression could produce a different value.
1199 This is set if any subexpression is a function call, a side effect or a
1200 reference to a volatile variable. In a ..._DECL, this is set only if the
1201 declaration said `volatile'. This will never be set for a constant. */
1202 #define TREE_SIDE_EFFECTS(NODE) \
1203 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1205 /* In a LABEL_DECL, nonzero means this label had its address taken
1206 and therefore can never be deleted and is a jump target for
1208 #define FORCED_LABEL(NODE) ((NODE)->base.side_effects_flag)
1210 /* Nonzero means this expression is volatile in the C sense:
1211 its address should be of type `volatile WHATEVER *'.
1212 In other words, the declared item is volatile qualified.
1213 This is used in _DECL nodes and _REF nodes.
1214 On a FUNCTION_DECL node, this means the function does not
1215 return normally. This is the same effect as setting
1216 the attribute noreturn on the function in C.
1218 In a ..._TYPE node, means this type is volatile-qualified.
1219 But use TYPE_VOLATILE instead of this macro when the node is a type,
1220 because eventually we may make that a different bit.
1222 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1223 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1225 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1226 accessing the memory pointed to won't generate a trap. However,
1227 this only applies to an object when used appropriately: it doesn't
1228 mean that writing a READONLY mem won't trap. Similarly for
1229 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1231 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1232 (or slice of the array) always belongs to the range of the array.
1233 I.e. that the access will not trap, provided that the access to
1234 the base to the array will not trap. */
1235 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1237 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1238 nonzero means it may not be the lhs of an assignment. */
1239 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1241 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1242 #define TREE_READONLY_DECL_P(NODE)\
1243 (DECL_P (NODE) && TREE_READONLY (NODE))
1245 /* Value of expression is constant. Always on in all ..._CST nodes. May
1246 also appear in an expression or decl where the value is constant. */
1247 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1249 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1250 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1251 (TYPE_CHECK (NODE)->base.constant_flag)
1253 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1254 #define DECL_UNSIGNED(NODE) \
1255 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1257 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1258 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1259 (BIT_FIELD_REF_CHECK (NODE)->base.unsigned_flag)
1261 /* In integral and pointer types, means an unsigned type. */
1262 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1264 /* Nonzero in a VAR_DECL means assembler code has been written.
1265 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1266 This is interesting in an inline function, since it might not need
1267 to be compiled separately.
1268 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1269 if the sdb debugging info for the type has been written.
1270 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1271 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1273 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1275 /* Nonzero in a _DECL if the name is used in its scope.
1276 Nonzero in an expr node means inhibit warning if value is unused.
1277 In IDENTIFIER_NODEs, this means that some extern decl for this name
1279 In a BLOCK, this means that the block contains variables that are used. */
1280 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1282 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1283 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1284 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1286 /* In a CALL_EXPR, means that it's safe to use the target of the call
1287 expansion as the return slot for a call that returns in memory. */
1288 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->base.private_flag)
1290 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1291 reference (and the TREE_TYPE is a pointer to the true type). */
1292 #define DECL_BY_REFERENCE(NODE) \
1293 (DECL_COMMON_CHECK (NODE)->base.private_flag)
1295 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1296 thunked-to function. */
1297 #define CALL_FROM_THUNK_P(NODE) \
1298 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1300 /* In a type, nonzero means that all objects of the type are guaranteed by the
1301 language or front-end to be properly aligned, so we can indicate that a MEM
1302 of this type is aligned at least to the alignment of the type, even if it
1303 doesn't appear that it is. We see this, for example, in object-oriented
1304 languages where a tag field may show this is an object of a more-aligned
1305 variant of the more generic type.
1307 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1309 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1311 /* Used in classes in C++. */
1312 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1313 /* Used in classes in C++.
1314 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1315 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1317 /* Nonzero in a _DECL if the use of the name is defined as a
1318 deprecated feature by __attribute__((deprecated)). */
1319 #define TREE_DEPRECATED(NODE) \
1320 ((NODE)->base.deprecated_flag)
1322 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1323 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1324 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1325 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1327 /* Value of expression is function invariant. A strict subset of
1328 TREE_CONSTANT, such an expression is constant over any one function
1329 invocation, though not across different invocations. May appear in
1330 any expression node. */
1331 #define TREE_INVARIANT(NODE) ((NODE)->base.invariant_flag)
1333 /* These flags are available for each language front end to use internally. */
1334 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1335 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1336 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1337 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1338 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1339 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1340 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1342 /* Define additional fields and accessors for nodes representing constants. */
1344 /* In an INTEGER_CST node. These two together make a 2-word integer.
1345 If the data type is signed, the value is sign-extended to 2 words
1346 even though not all of them may really be in use.
1347 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1348 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1349 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1350 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1352 #define INT_CST_LT(A, B) \
1353 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1354 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1355 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1357 #define INT_CST_LT_UNSIGNED(A, B) \
1358 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1359 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1360 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1361 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1362 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1364 struct tree_int_cst GTY(())
1366 struct tree_common common;
1370 /* In a REAL_CST node. struct real_value is an opaque entity, with
1371 manipulators defined in real.h. We don't want tree.h depending on
1372 real.h and transitively on tm.h. */
1375 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1376 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1378 struct tree_real_cst GTY(())
1380 struct tree_common common;
1381 struct real_value * real_cst_ptr;
1384 /* In a STRING_CST */
1385 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1386 #define TREE_STRING_POINTER(NODE) \
1387 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1389 struct tree_string GTY(())
1391 struct tree_common common;
1396 /* In a COMPLEX_CST node. */
1397 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1398 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1400 struct tree_complex GTY(())
1402 struct tree_common common;
1407 /* In a VECTOR_CST node. */
1408 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1410 struct tree_vector GTY(())
1412 struct tree_common common;
1418 /* Define fields and accessors for some special-purpose tree nodes. */
1420 #define IDENTIFIER_LENGTH(NODE) \
1421 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1422 #define IDENTIFIER_POINTER(NODE) \
1423 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1424 #define IDENTIFIER_HASH_VALUE(NODE) \
1425 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1427 /* Translate a hash table identifier pointer to a tree_identifier
1428 pointer, and vice versa. */
1430 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1431 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1432 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1434 struct tree_identifier GTY(())
1436 struct tree_common common;
1437 struct ht_identifier id;
1440 /* In a TREE_LIST node. */
1441 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1442 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1444 struct tree_list GTY(())
1446 struct tree_common common;
1451 /* In a TREE_VEC node. */
1452 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1453 #define TREE_VEC_END(NODE) \
1454 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1456 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1458 struct tree_vec GTY(())
1460 struct tree_common common;
1462 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1465 /* In a CONSTRUCTOR node. */
1466 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1468 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1469 value of each element (stored within VAL). IX must be a scratch variable
1470 of unsigned integer type. */
1471 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1472 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1474 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1478 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1479 the value of each element (stored within VAL) and its index (stored
1480 within INDEX). IX must be a scratch variable of unsigned integer type. */
1481 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1482 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1484 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1485 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1489 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1490 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1492 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1493 _ce___->index = INDEX; \
1494 _ce___->value = VALUE; \
1497 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1498 element. INDEX can optionally design the position of VALUE: in arrays,
1499 it is the index where VALUE has to be placed; in structures, it is the
1500 FIELD_DECL of the member. */
1501 typedef struct constructor_elt_d GTY(())
1507 DEF_VEC_O(constructor_elt);
1508 DEF_VEC_ALLOC_O(constructor_elt,gc);
1510 struct tree_constructor GTY(())
1512 struct tree_common common;
1513 VEC(constructor_elt,gc) *elts;
1516 /* Define fields and accessors for some nodes that represent expressions. */
1518 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1519 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1520 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1521 && integer_zerop (TREE_OPERAND (NODE, 0)))
1523 /* In ordinary expression nodes. */
1524 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1525 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1527 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1528 length. Its value includes the length operand itself; that is,
1529 the minimum valid length is 1.
1530 Note that we have to bypass the use of TREE_OPERAND to access
1531 that field to avoid infinite recursion in expanding the macros. */
1532 #define VL_EXP_OPERAND_LENGTH(NODE) \
1533 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1535 /* In gimple statements. */
1536 #define GIMPLE_STMT_OPERAND(NODE, I) GIMPLE_STMT_OPERAND_CHECK (NODE, I)
1537 #define GIMPLE_STMT_LOCUS(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.locus)
1538 #define GIMPLE_STMT_BLOCK(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.block)
1540 /* In a LOOP_EXPR node. */
1541 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1543 /* The source location of this expression. Non-tree_exp nodes such as
1544 decls and constants can be shared among multiple locations, so
1546 #define EXPR_LOCATION(NODE) expr_location ((NODE))
1547 #define SET_EXPR_LOCATION(NODE, FROM) set_expr_location ((NODE), (FROM))
1548 #define EXPR_HAS_LOCATION(NODE) expr_has_location ((NODE))
1549 #define EXPR_LOCUS(NODE) expr_locus ((NODE))
1550 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1551 #define EXPR_FILENAME(NODE) *(expr_filename ((NODE)))
1552 #define EXPR_LINENO(NODE) *(expr_lineno ((NODE)))
1554 /* True if a tree is an expression or statement that can have a
1556 #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE) || GIMPLE_STMT_P (NODE))
1558 /* In a TARGET_EXPR node. */
1559 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1560 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1561 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1563 /* DECL_EXPR accessor. This gives access to the DECL associated with
1564 the given declaration statement. */
1565 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1567 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1569 /* SWITCH_EXPR accessors. These give access to the condition, body and
1570 original condition type (before any compiler conversions)
1571 of the switch statement, respectively. */
1572 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1573 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1574 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1576 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1577 of a case label, respectively. */
1578 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1579 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1580 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1582 /* The operands of a TARGET_MEM_REF. */
1583 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1584 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1585 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1586 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1587 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1588 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1589 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1591 /* The operands of a BIND_EXPR. */
1592 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1593 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1594 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1596 /* GOTO_EXPR accessor. This gives access to the label associated with
1597 a goto statement. */
1598 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1600 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1601 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1602 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1604 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1605 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1606 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1607 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1608 /* Nonzero if we want to create an ASM_INPUT instead of an
1609 ASM_OPERAND with no operands. */
1610 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1611 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1613 /* COND_EXPR accessors. */
1614 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1615 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1616 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1618 /* Accessors for the chains of recurrences. */
1619 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1620 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1621 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1622 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1624 /* LABEL_EXPR accessor. This gives access to the label associated with
1625 the given label expression. */
1626 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1628 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1629 accessors for SSA operands. */
1631 /* CATCH_EXPR accessors. */
1632 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1633 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1635 /* EH_FILTER_EXPR accessors. */
1636 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1637 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1638 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1640 /* OBJ_TYPE_REF accessors. */
1641 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1642 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1643 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1645 /* ASSERT_EXPR accessors. */
1646 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1647 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1649 /* CALL_EXPR accessors.
1651 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1652 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1653 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1654 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1655 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1657 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1658 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1659 the argument count is zero when checking is enabled. Instead, do
1660 the pointer arithmetic to advance past the 3 fixed operands in a
1661 CALL_EXPR. That produces a valid pointer to just past the end of the
1662 operand array, even if it's not valid to dereference it. */
1663 #define CALL_EXPR_ARGP(NODE) \
1664 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1666 /* OpenMP directive and clause accessors. */
1668 #define OMP_BODY(NODE) \
1669 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1670 #define OMP_CLAUSES(NODE) \
1671 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1673 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1674 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1675 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1676 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1678 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1679 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1680 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1681 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1682 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1683 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1685 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1686 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1688 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1690 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1691 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1693 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1695 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1697 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1698 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1700 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1701 #define OMP_CLAUSE_DECL(NODE) \
1702 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1703 OMP_CLAUSE_PRIVATE, \
1704 OMP_CLAUSE_COPYPRIVATE), 0)
1706 /* True on an OMP_SECTION statement that was the last lexical member.
1707 This status is meaningful in the implementation of lastprivate. */
1708 #define OMP_SECTION_LAST(NODE) \
1709 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1711 /* True on an OMP_RETURN statement if the return does not require a
1712 thread synchronization via some sort of barrier. The exact barrier
1713 that would otherwise be emitted is dependent on the OMP statement
1714 with which this return is associated. */
1715 #define OMP_RETURN_NOWAIT(NODE) \
1716 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1718 /* True on an OMP_PARALLEL statement if it represents an explicit
1719 combined parallel work-sharing constructs. */
1720 #define OMP_PARALLEL_COMBINED(NODE) \
1721 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1723 /* True on a PRIVATE clause if its decl is kept around for debugging
1724 information only and its DECL_VALUE_EXPR is supposed to point
1725 to what it has been remapped to. */
1726 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1727 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1729 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1730 decl is present in the chain. */
1731 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1732 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1734 #define OMP_CLAUSE_IF_EXPR(NODE) \
1735 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1736 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1737 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1738 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1739 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1741 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1742 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1743 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1744 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1745 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1746 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1747 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1748 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1750 enum omp_clause_schedule_kind
1752 OMP_CLAUSE_SCHEDULE_STATIC,
1753 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1754 OMP_CLAUSE_SCHEDULE_GUIDED,
1755 OMP_CLAUSE_SCHEDULE_RUNTIME
1758 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1759 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1761 enum omp_clause_default_kind
1763 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1764 OMP_CLAUSE_DEFAULT_SHARED,
1765 OMP_CLAUSE_DEFAULT_NONE,
1766 OMP_CLAUSE_DEFAULT_PRIVATE
1769 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1770 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1772 struct tree_exp GTY(())
1774 struct tree_common common;
1777 tree GTY ((special ("tree_exp"),
1778 desc ("TREE_CODE ((tree) &%0)")))
1782 /* SSA_NAME accessors. */
1784 /* Returns the variable being referenced. Once released, this is the
1785 only field that can be relied upon. */
1786 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1788 /* Returns the statement which defines this reference. Note that
1789 we use the same field when chaining SSA_NAME nodes together on
1790 the SSA_NAME freelist. */
1791 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1793 /* Returns the SSA version number of this SSA name. Note that in
1794 tree SSA, version numbers are not per variable and may be recycled. */
1795 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1797 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1798 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1800 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1801 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1803 /* Nonzero if this SSA_NAME expression is currently on the free list of
1804 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1805 has no meaning for an SSA_NAME. */
1806 #define SSA_NAME_IN_FREE_LIST(NODE) \
1807 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1809 /* Nonzero if this SSA_NAME is the default definition for the
1810 underlying symbol. A default SSA name is created for symbol S if
1811 the very first reference to S in the function is a read operation.
1812 Default definitions are always created by an empty statement and
1813 belong to no basic block. */
1814 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1815 SSA_NAME_CHECK (NODE)->base.volatile_flag
1817 /* Attributes for SSA_NAMEs for pointer-type variables. */
1818 #define SSA_NAME_PTR_INFO(N) \
1819 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1821 /* Get the value of this SSA_NAME, if available. */
1822 #define SSA_NAME_VALUE(N) \
1823 SSA_NAME_CHECK (N)->ssa_name.value_handle
1825 #ifndef _TREE_FLOW_H
1826 struct ptr_info_def;
1831 /* Immediate use linking structure. This structure is used for maintaining
1832 a doubly linked list of uses of an SSA_NAME. */
1833 typedef struct ssa_use_operand_d GTY(())
1835 struct ssa_use_operand_d* GTY((skip(""))) prev;
1836 struct ssa_use_operand_d* GTY((skip(""))) next;
1837 tree GTY((skip(""))) stmt;
1838 tree *GTY((skip(""))) use;
1839 } ssa_use_operand_t;
1841 /* Return the immediate_use information for an SSA_NAME. */
1842 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1844 struct tree_ssa_name GTY(())
1846 struct tree_common common;
1848 /* _DECL wrapped by this SSA name. */
1851 /* SSA version number. */
1852 unsigned int version;
1854 /* Pointer attributes used for alias analysis. */
1855 struct ptr_info_def *ptr_info;
1857 /* Value for SSA name used by various passes.
1859 Right now only invariants are allowed to persist beyond a pass in
1860 this field; in the future we will allow VALUE_HANDLEs to persist
1864 /* Immediate uses list for this SSA_NAME. */
1865 struct ssa_use_operand_d imm_uses;
1868 /* In a PHI_NODE node. */
1870 /* These 2 macros should be considered off limits for use by developers. If
1871 you wish to access the use or def fields of a PHI_NODE in the SSA
1872 optimizers, use the accessor macros found in tree-ssa-operands.h.
1873 These two macros are to be used only by those accessor macros, and other
1874 select places where we *absolutely* must take the address of the tree. */
1876 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1877 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1879 /* PHI_NODEs for each basic block are chained together in a single linked
1880 list. The head of the list is linked from the block annotation, and
1881 the link to the next PHI is in PHI_CHAIN. */
1882 #define PHI_CHAIN(NODE) PHI_NODE_CHECK (NODE)->phi.chain
1884 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1885 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1886 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1887 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1888 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1889 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1891 struct phi_arg_d GTY(())
1893 /* imm_use MUST be the first element in struct because we do some
1894 pointer arithmetic with it. See phi_arg_index_from_use. */
1895 struct ssa_use_operand_d imm_use;
1899 struct tree_phi_node GTY(())
1901 struct tree_base common;
1907 /* Basic block holding this PHI node. */
1908 struct basic_block_def *bb;
1910 /* Arguments of the PHI node. These are maintained in the same
1911 order as predecessor edge vector BB->PREDS. */
1912 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1916 #define OMP_CLAUSE_CODE(NODE) \
1917 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1919 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1920 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1922 #define OMP_CLAUSE_CODE(NODE) \
1923 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1925 #define OMP_CLAUSE_OPERAND(NODE, I) \
1926 OMP_CLAUSE_ELT_CHECK (NODE, I)
1928 struct tree_omp_clause GTY(())
1930 struct tree_common common;
1931 enum omp_clause_code code;
1932 union omp_clause_subcode {
1933 enum omp_clause_default_kind default_kind;
1934 enum omp_clause_schedule_kind schedule_kind;
1935 enum tree_code reduction_code;
1936 } GTY ((skip)) subcode;
1937 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1941 struct varray_head_tag;
1943 /* In a BLOCK node. */
1944 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1945 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1946 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1947 /* Note: when changing this, make sure to find the places
1948 that use chainon or nreverse. */
1949 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1950 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1951 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1953 /* Nonzero means that this block is prepared to handle exceptions
1954 listed in the BLOCK_VARS slot. */
1955 #define BLOCK_HANDLER_BLOCK(NODE) \
1956 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1958 /* An index number for this block. These values are not guaranteed to
1959 be unique across functions -- whether or not they are depends on
1960 the debugging output format in use. */
1961 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1963 /* If block reordering splits a lexical block into discontiguous
1964 address ranges, we'll make a copy of the original block.
1966 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1967 In that case, we have one source block that has been replicated
1968 (through inlining or unrolling) into many logical blocks, and that
1969 these logical blocks have different physical variables in them.
1971 In this case, we have one logical block split into several
1972 non-contiguous address ranges. Most debug formats can't actually
1973 represent this idea directly, so we fake it by creating multiple
1974 logical blocks with the same variables in them. However, for those
1975 that do support non-contiguous regions, these allow the original
1976 logical block to be reconstructed, along with the set of address
1979 One of the logical block fragments is arbitrarily chosen to be
1980 the ORIGIN. The other fragments will point to the origin via
1981 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1982 be null. The list of fragments will be chained through
1983 BLOCK_FRAGMENT_CHAIN from the origin. */
1985 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1986 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1988 /* For an inlined function, this gives the location where it was called
1989 from. This is only set in the top level block, which corresponds to the
1990 inlined function scope. This is used in the debug output routines. */
1992 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1994 struct tree_block GTY(())
1996 struct tree_common common;
1998 unsigned handler_block_flag : 1;
1999 unsigned abstract_flag : 1;
2000 unsigned block_num : 30;
2005 tree abstract_origin;
2006 tree fragment_origin;
2007 tree fragment_chain;
2011 /* Define fields and accessors for nodes representing data types. */
2013 /* See tree.def for documentation of the use of these fields.
2014 Look at the documentation of the various ..._TYPE tree codes.
2016 Note that the type.values, type.minval, and type.maxval fields are
2017 overloaded and used for different macros in different kinds of types.
2018 Each macro must check to ensure the tree node is of the proper kind of
2019 type. Note also that some of the front-ends also overload these fields,
2020 so they must be checked as well. */
2022 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2023 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2024 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2025 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
2026 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2027 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2028 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2029 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2030 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2031 (INTEGER_TYPE_CHECK (NODE)->type.values \
2032 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2033 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2034 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2035 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2036 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2037 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2038 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2039 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2040 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2041 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2042 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2043 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2044 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2045 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2046 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2047 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2048 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2049 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2050 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2051 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2053 /* The "canonical" type for this type node, which can be used to
2054 compare the type for equality with another type. If two types are
2055 equal (based on the semantics of the language), then they will have
2056 equivalent TYPE_CANONICAL entries.
2058 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2059 be used for comparison against other types. Instead, the type is
2060 said to require structural equality checks, described in
2061 TYPE_STRUCTURAL_EQUALITY_P. */
2062 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2063 /* Indicates that the type node requires structural equality
2064 checks. The compiler will need to look at the composition of the
2065 type to determine whether it is equal to another type, rather than
2066 just comparing canonical type pointers. For instance, we would need
2067 to look at the return and parameter types of a FUNCTION_TYPE
2069 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2070 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2071 type node requires structural equality. */
2072 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2073 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2075 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2076 in the debugging output. We use this to describe a vector as a
2077 structure containing an array. */
2078 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2080 /* For record and union types, information about this type, as a base type
2082 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2084 /* For non record and union types, used in a language-dependent way. */
2085 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2087 /* The (language-specific) typed-based alias set for this type.
2088 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2089 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2090 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2091 type can alias objects of any type. */
2092 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2094 /* Nonzero iff the typed-based alias set for this type has been
2096 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2098 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2100 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2102 /* The alignment necessary for objects of this type.
2103 The value is an int, measured in bits. */
2104 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2106 /* 1 if the alignment for this type was requested by "aligned" attribute,
2107 0 if it is the default for this type. */
2108 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2110 /* The alignment for NODE, in bytes. */
2111 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2113 /* If your language allows you to declare types, and you want debug info
2114 for them, then you need to generate corresponding TYPE_DECL nodes.
2115 These "stub" TYPE_DECL nodes have no name, and simply point at the
2116 type node. You then set the TYPE_STUB_DECL field of the type node
2117 to point back at the TYPE_DECL node. This allows the debug routines
2118 to know that the two nodes represent the same type, so that we only
2119 get one debug info record for them. */
2120 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2122 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2123 has BLKmode only because it lacks the alignment requirement for
2125 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2127 /* In an INTEGER_TYPE, it means the type represents a size. We use
2128 this both for validity checking and to permit optimizations that
2129 are unsafe for other types. Note that the C `size_t' type should
2130 *not* have this flag set. The `size_t' type is simply a typedef
2131 for an ordinary integer type that happens to be the type of an
2132 expression returned by `sizeof'; `size_t' has no special
2133 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2134 always actual sizes. */
2135 #define TYPE_IS_SIZETYPE(NODE) \
2136 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2138 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
2139 pointer depressed. */
2140 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
2141 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2143 /* Nonzero in a type considered volatile as a whole. */
2144 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2146 /* Means this type is const-qualified. */
2147 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2149 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2151 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2153 /* There is a TYPE_QUAL value for each type qualifier. They can be
2154 combined by bitwise-or to form the complete set of qualifiers for a
2157 #define TYPE_UNQUALIFIED 0x0
2158 #define TYPE_QUAL_CONST 0x1
2159 #define TYPE_QUAL_VOLATILE 0x2
2160 #define TYPE_QUAL_RESTRICT 0x4
2162 /* The set of type qualifiers for this type. */
2163 #define TYPE_QUALS(NODE) \
2164 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2165 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2166 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2168 /* These flags are available for each language front end to use internally. */
2169 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2170 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2171 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2172 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2173 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2174 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2175 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2177 /* Used to keep track of visited nodes in tree traversals. This is set to
2178 0 by copy_node and make_node. */
2179 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2181 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2182 that distinguish string from array of char).
2183 If set in a INTEGER_TYPE, indicates a character type. */
2184 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2186 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2187 object of the given ARRAY_TYPE. This allows temporaries to be
2189 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2190 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2192 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2193 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2194 (((unsigned HOST_WIDE_INT) 1) \
2195 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2197 /* Set precision to n when we have 2^n sub-parts of the vector. */
2198 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2199 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2201 /* Indicates that objects of this type must be initialized by calling a
2202 function when they are created. */
2203 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2204 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2206 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2207 the same way that the first union alternative would be passed. */
2208 #define TYPE_TRANSPARENT_UNION(NODE) \
2209 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2211 /* For an ARRAY_TYPE, indicates that it is not permitted to
2212 take the address of a component of the type. */
2213 #define TYPE_NONALIASED_COMPONENT(NODE) \
2214 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2216 /* Indicated that objects of this type should be laid out in as
2217 compact a way as possible. */
2218 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2220 /* Used by type_contains_placeholder_p to avoid recomputation.
2221 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2222 this field directly. */
2223 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2224 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2228 struct tree_type GTY(())
2230 struct tree_common common;
2237 unsigned int precision : 9;
2238 ENUM_BITFIELD(machine_mode) mode : 7;
2240 unsigned string_flag : 1;
2241 unsigned no_force_blk_flag : 1;
2242 unsigned needs_constructing_flag : 1;
2243 unsigned transparent_union_flag : 1;
2244 unsigned packed_flag : 1;
2245 unsigned restrict_flag : 1;
2246 unsigned contains_placeholder_bits : 2;
2248 unsigned lang_flag_0 : 1;
2249 unsigned lang_flag_1 : 1;
2250 unsigned lang_flag_2 : 1;
2251 unsigned lang_flag_3 : 1;
2252 unsigned lang_flag_4 : 1;
2253 unsigned lang_flag_5 : 1;
2254 unsigned lang_flag_6 : 1;
2255 unsigned user_align : 1;
2260 union tree_type_symtab {
2261 int GTY ((tag ("0"))) address;
2262 char * GTY ((tag ("1"))) pointer;
2263 struct die_struct * GTY ((tag ("2"))) die;
2264 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2265 descbits ("2"))) symtab;
2274 HOST_WIDE_INT alias_set;
2275 /* Points to a structure whose details depend on the language in use. */
2276 struct lang_type *lang_specific;
2279 /* Define accessor macros for information about type inheritance
2282 A "basetype" means a particular usage of a data type for inheritance
2283 in another type. Each such basetype usage has its own "binfo"
2284 object to describe it. The binfo object is a TREE_VEC node.
2286 Inheritance is represented by the binfo nodes allocated for a
2287 given type. For example, given types C and D, such that D is
2288 inherited by C, 3 binfo nodes will be allocated: one for describing
2289 the binfo properties of C, similarly one for D, and one for
2290 describing the binfo properties of D as a base type for C.
2291 Thus, given a pointer to class C, one can get a pointer to the binfo
2292 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2294 /* BINFO specific flags. */
2296 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2297 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2299 /* Flags for language dependent use. */
2300 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2301 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2302 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2303 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2304 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2305 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2306 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2308 /* The actual data type node being inherited in this basetype. */
2309 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2311 /* The offset where this basetype appears in its containing type.
2312 BINFO_OFFSET slot holds the offset (in bytes)
2313 from the base of the complete object to the base of the part of the
2314 object that is allocated on behalf of this `type'.
2315 This is always 0 except when there is multiple inheritance. */
2317 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2318 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2320 /* The virtual function table belonging to this basetype. Virtual
2321 function tables provide a mechanism for run-time method dispatching.
2322 The entries of a virtual function table are language-dependent. */
2324 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2326 /* The virtual functions in the virtual function table. This is
2327 a TREE_LIST that is used as an initial approximation for building
2328 a virtual function table for this basetype. */
2329 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2331 /* A vector of binfos for the direct basetypes inherited by this
2334 If this basetype describes type D as inherited in C, and if the
2335 basetypes of D are E and F, then this vector contains binfos for
2336 inheritance of E and F by C. */
2337 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2339 /* The number of basetypes for NODE. */
2340 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2342 /* Accessor macro to get to the Nth base binfo of this binfo. */
2343 #define BINFO_BASE_BINFO(NODE,N) \
2344 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2345 #define BINFO_BASE_ITERATE(NODE,N,B) \
2346 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2347 #define BINFO_BASE_APPEND(NODE,T) \
2348 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2350 /* For a BINFO record describing a virtual base class, i.e., one where
2351 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2352 base. The actual contents are language-dependent. In the C++
2353 front-end this field is an INTEGER_CST giving an offset into the
2354 vtable where the offset to the virtual base can be found. */
2355 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2357 /* Indicates the accesses this binfo has to its bases. The values are
2358 access_public_node, access_protected_node or access_private_node.
2359 If this array is not present, public access is implied. */
2360 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2362 #define BINFO_BASE_ACCESS(NODE,N) \
2363 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2364 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2365 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2367 /* The index in the VTT where this subobject's sub-VTT can be found.
2368 NULL_TREE if there is no sub-VTT. */
2369 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2371 /* The index in the VTT where the vptr for this subobject can be
2372 found. NULL_TREE if there is no secondary vptr in the VTT. */
2373 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2375 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2376 inheriting this base for non-virtual bases. For virtual bases it
2377 points either to the binfo for which this is a primary binfo, or to
2378 the binfo of the most derived type. */
2379 #define BINFO_INHERITANCE_CHAIN(NODE) \
2380 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2382 struct tree_binfo GTY (())
2384 struct tree_common common;
2390 VEC(tree,gc) *base_accesses;
2396 VEC(tree,none) base_binfos;
2400 /* Define fields and accessors for nodes representing declared names. */
2402 /* Nonzero if DECL represents a variable for the SSA passes. */
2403 #define SSA_VAR_P(DECL) \
2404 (TREE_CODE (DECL) == VAR_DECL \
2405 || TREE_CODE (DECL) == PARM_DECL \
2406 || TREE_CODE (DECL) == RESULT_DECL \
2408 || (TREE_CODE (DECL) == SSA_NAME \
2409 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2410 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2411 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2412 || MTAG_P (SSA_NAME_VAR (DECL)))))
2417 /* Enumerate visibility settings. */
2418 #ifndef SYMBOL_VISIBILITY_DEFINED
2419 #define SYMBOL_VISIBILITY_DEFINED
2420 enum symbol_visibility
2423 VISIBILITY_PROTECTED,
2432 /* This is the name of the object as written by the user.
2433 It is an IDENTIFIER_NODE. */
2434 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2436 /* Every ..._DECL node gets a unique number. */
2437 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2439 /* These two fields describe where in the source code the declaration
2440 was. If the declaration appears in several places (as for a C
2441 function that is declared first and then defined later), this
2442 information should refer to the definition. */
2443 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2444 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2445 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2446 #ifdef USE_MAPPED_LOCATION
2447 #define DECL_IS_BUILTIN(DECL) \
2448 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2450 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2453 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2454 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2455 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2456 points to either the FUNCTION_DECL for the containing function,
2457 the RECORD_TYPE or UNION_TYPE for the containing type, or
2458 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2460 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2461 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2462 struct tree_decl_minimal GTY(())
2464 struct tree_common common;
2471 /* When computing aliasing information, we represent the memory pointed-to
2472 by pointers with artificial variables called "memory tags" (MT). There
2473 are two kinds of tags, namely symbol and name:
2475 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2476 represent all the pointed-to locations and variables pointed-to by
2477 the same pointer symbol. Usually, this set is computed using
2478 type-based analysis (i.e., alias set classes), but this may not
2481 Name tags (NMT) are used in flow-sensitive points-to alias
2482 analysis, they represent the variables and memory locations
2483 pointed-to by a specific SSA_NAME pointer.
2485 In general, given a pointer P with a symbol tag SMT, the alias set
2486 of SMT should be the union of all the alias sets of the NMTs of
2487 every SSA_NAME for P. */
2488 struct tree_memory_tag GTY(())
2490 struct tree_decl_minimal common;
2492 bitmap GTY ((skip)) aliases;
2494 unsigned int is_global:1;
2497 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2498 #define MTAG_ALIASES(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.aliases)
2500 struct tree_struct_field_tag GTY(())
2502 struct tree_memory_tag common;
2504 /* Parent variable. */
2507 /* Offset inside structure. */
2508 unsigned HOST_WIDE_INT offset;
2510 /* Size of the field. */
2511 unsigned HOST_WIDE_INT size;
2514 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2515 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2516 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2518 /* Memory Partition Tags (MPTs) group memory symbols under one
2519 common name for the purposes of placing memory PHI nodes. */
2521 struct tree_memory_partition_tag GTY(())
2523 struct tree_memory_tag common;
2525 /* Set of symbols grouped under this MPT. */
2529 #define MPT_SYMBOLS(NODE) (MEMORY_PARTITION_TAG_CHECK (NODE)->mpt.symbols)
2532 /* For any sort of a ..._DECL node, this points to the original (abstract)
2533 decl node which this decl is an instance of, or else it is NULL indicating
2534 that this decl is not an instance of some other decl. For example,
2535 in a nested declaration of an inline function, this points back to the
2537 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2539 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2540 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2541 #define DECL_ORIGIN(NODE) \
2542 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2544 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2545 inline instance of some original (abstract) decl from an inline function;
2546 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2547 nodes can also have their abstract origin set to themselves. */
2548 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2549 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2551 /* In a DECL this is the field where attributes are stored. */
2552 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2554 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2555 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2556 For a VAR_DECL, holds the initial value.
2557 For a PARM_DECL, not used--default
2558 values for parameters are encoded in the type of the function,
2559 not in the PARM_DECL slot.
2560 For a FIELD_DECL, this is used for enumeration values and the C
2561 frontend uses it for temporarily storing bitwidth of bitfields.
2563 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2564 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2566 /* Holds the size of the datum, in bits, as a tree expression.
2567 Need not be constant. */
2568 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2569 /* Likewise for the size in bytes. */
2570 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2571 /* Holds the alignment required for the datum, in bits. */
2572 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.u1.a.align)
2573 /* The alignment of NODE, in bytes. */
2574 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2575 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2576 DECL_FIELD_OFFSET which are known to be always zero.
2577 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2579 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2580 /* Holds the machine mode corresponding to the declaration of a variable or
2581 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2583 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2585 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2586 operation it is. Note, however, that this field is overloaded, with
2587 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2588 checked before any access to the former. */
2589 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_common.u1.f)
2590 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2591 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2593 /* Nonzero for a given ..._DECL node means that the name of this node should
2594 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2595 the body of the function should also be ignored. */
2596 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2598 /* Nonzero for a given ..._DECL node means that this node represents an
2599 "abstract instance" of the given declaration (e.g. in the original
2600 declaration of an inline function). When generating symbolic debugging
2601 information, we mustn't try to generate any address information for nodes
2602 marked as "abstract instances" because we don't actually generate
2603 any code or allocate any data space for such instances. */
2604 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2606 /* Language-specific decl information. */
2607 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2609 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2610 do not allocate storage, and refer to a definition elsewhere. Note that
2611 this does not necessarily imply the entity represented by NODE
2612 has no program source-level definition in this translation unit. For
2613 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2614 DECL_EXTERNAL may be true simultaneously; that can be the case for
2615 a C99 "extern inline" function. */
2616 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2618 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2619 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2621 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2623 Also set in some languages for variables, etc., outside the normal
2624 lexical scope, such as class instance variables. */
2625 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2627 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2628 Used in FIELD_DECLs for vtable pointers.
2629 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2630 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2632 /* Used to indicate that this DECL represents a compiler-generated entity. */
2633 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2635 /* Additional flags for language-specific uses. */
2636 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2637 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2638 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2639 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2640 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2641 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2642 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2643 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2645 /* Used to indicate an alias set for the memory pointed to by this
2646 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2647 pointer (or reference) type. */
2648 #define DECL_POINTER_ALIAS_SET(NODE) \
2649 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2651 /* Nonzero if an alias set has been assigned to this declaration. */
2652 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2653 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2655 /* Nonzero for a decl which is at file scope. */
2656 #define DECL_FILE_SCOPE_P(EXP) \
2657 (! DECL_CONTEXT (EXP) \
2658 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2660 /* Nonzero for a decl that is decorated using attribute used.
2661 This indicates compiler tools that this decl needs to be preserved. */
2662 #define DECL_PRESERVE_P(DECL) \
2663 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2665 /* For function local variables of COMPLEX and VECTOR types,
2666 indicates that the variable is not aliased, and that all
2667 modifications to the variable have been adjusted so that
2668 they are killing assignments. Thus the variable may now
2669 be treated as a GIMPLE register, and use real instead of
2670 virtual ops in SSA form. */
2671 #define DECL_GIMPLE_REG_P(DECL) \
2672 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2674 struct tree_decl_common GTY(())
2676 struct tree_decl_minimal common;
2679 ENUM_BITFIELD(machine_mode) mode : 8;
2681 unsigned nonlocal_flag : 1;
2682 unsigned virtual_flag : 1;
2683 unsigned ignored_flag : 1;
2684 unsigned abstract_flag : 1;
2685 unsigned artificial_flag : 1;
2686 unsigned user_align : 1;
2687 unsigned preserve_flag: 1;
2688 unsigned debug_expr_is_from : 1;
2690 unsigned lang_flag_0 : 1;
2691 unsigned lang_flag_1 : 1;
2692 unsigned lang_flag_2 : 1;
2693 unsigned lang_flag_3 : 1;
2694 unsigned lang_flag_4 : 1;
2695 unsigned lang_flag_5 : 1;
2696 unsigned lang_flag_6 : 1;
2697 unsigned lang_flag_7 : 1;
2699 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2700 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2701 unsigned decl_flag_0 : 1;
2702 /* In FIELD_DECL, this is DECL_PACKED. */
2703 unsigned decl_flag_1 : 1;
2704 /* In FIELD_DECL, this is DECL_BIT_FIELD
2705 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2706 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2707 unsigned decl_flag_2 : 1;
2708 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2709 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2710 unsigned decl_flag_3 : 1;
2711 /* Logically, these two would go in a theoretical base shared by var and
2713 unsigned gimple_reg_flag : 1;
2715 union tree_decl_u1 {
2716 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2717 DECL_FUNCTION_CODE. */
2718 enum built_in_function f;
2719 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2720 is used by language-dependent code. */
2722 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2724 struct tree_decl_u1_a {
2725 unsigned int align : 24;
2726 unsigned int off_align : 8;
2733 tree abstract_origin;
2735 HOST_WIDE_INT pointer_alias_set;
2736 /* Points to a structure whose details depend on the language in use. */
2737 struct lang_decl *lang_specific;
2740 extern tree decl_value_expr_lookup (tree);
2741 extern void decl_value_expr_insert (tree, tree);
2743 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2744 if transformations have made this more complicated than evaluating the
2745 decl itself. This should only be used for debugging; once this field has
2746 been set, the decl itself may not legitimately appear in the function. */
2747 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2748 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2749 #define DECL_VALUE_EXPR(NODE) \
2750 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2751 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2752 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2754 /* Holds the RTL expression for the value of a variable or function.
2755 This value can be evaluated lazily for functions, variables with
2756 static storage duration, and labels. */
2757 #define DECL_RTL(NODE) \
2758 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2759 ? (NODE)->decl_with_rtl.rtl \
2760 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2762 /* Set the DECL_RTL for NODE to RTL. */
2763 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2765 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2766 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2768 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2769 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2771 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2772 NODE1, it will not be set for NODE2; this is a lazy copy. */
2773 #define COPY_DECL_RTL(NODE1, NODE2) \
2774 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2776 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2777 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2779 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2780 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2782 struct tree_decl_with_rtl GTY(())
2784 struct tree_decl_common common;
2788 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2789 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2790 of the structure. */
2791 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2793 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2794 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2795 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2796 natural alignment of the field's type). */
2797 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2799 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2800 if so, the type that was originally specified for it.
2801 TREE_TYPE may have been modified (in finish_struct). */
2802 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2804 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2805 if nonzero, indicates that the field occupies the type. */
2806 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2808 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2809 DECL_FIELD_OFFSET which are known to be always zero.
2810 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2812 #define DECL_OFFSET_ALIGN(NODE) \
2813 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align)
2815 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2816 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2817 (FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align = exact_log2 ((X) & -(X)))
2818 /* 1 if the alignment for this type was requested by "aligned" attribute,
2819 0 if it is the default for this type. */
2821 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2822 which this FIELD_DECL is defined. This information is needed when
2823 writing debugging information about vfield and vbase decls for C++. */
2824 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2826 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2827 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2829 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2831 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2833 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2835 #define DECL_NONADDRESSABLE_P(NODE) \
2836 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2838 struct tree_field_decl GTY(())
2840 struct tree_decl_common common;
2843 tree bit_field_type;
2850 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2851 dense, unique within any one function, and may be used to index arrays.
2852 If the value is -1, then no UID has been assigned. */
2853 #define LABEL_DECL_UID(NODE) \
2854 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2856 /* In LABEL_DECL nodes, nonzero means that an error message about
2857 jumping into such a binding contour has been printed for this label. */
2858 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2860 struct tree_label_decl GTY(())
2862 struct tree_decl_with_rtl common;
2863 /* Java's verifier has some need to store information about labels,
2864 and was using fields that no longer exist on labels.
2865 Once the verifier doesn't need these anymore, they should be removed. */
2869 unsigned int java_field_4;
2873 struct tree_result_decl GTY(())
2875 struct tree_decl_with_rtl common;
2878 struct tree_const_decl GTY(())
2880 struct tree_decl_with_rtl common;
2883 /* For a PARM_DECL, records the data type used to pass the argument,
2884 which may be different from the type seen in the program. */
2885 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2887 /* For PARM_DECL, holds an RTL for the stack slot or register
2888 where the data was actually passed. */
2889 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2891 struct tree_parm_decl GTY(())
2893 struct tree_decl_with_rtl common;
2898 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2899 this variable in a BIND_EXPR. */
2900 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2901 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2903 /* Used to indicate that the linkage status of this DECL is not yet known,
2904 so it should not be output now. */
2905 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2907 /* Nonzero for a given ..._DECL node means that no warnings should be
2908 generated just because this node is unused. */
2909 #define DECL_IN_SYSTEM_HEADER(NODE) \
2910 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2912 /* Used to indicate that this DECL has weak linkage. */
2913 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2915 /* Internal to the gimplifier. Indicates that the value is a formal
2916 temporary controlled by the gimplifier. */
2917 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2918 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2920 /* Used to indicate that the DECL is a dllimport. */
2921 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2923 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2924 based on a variable with a restrict qualified type. If it is,
2925 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2928 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2929 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2930 #define DECL_GET_RESTRICT_BASE(NODE) \
2931 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2932 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2933 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2935 extern tree decl_restrict_base_lookup (tree);
2936 extern void decl_restrict_base_insert (tree, tree);
2938 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2939 not be put out unless it is needed in this translation unit.
2940 Entities like this are shared across translation units (like weak
2941 entities), but are guaranteed to be generated by any translation
2942 unit that needs them, and therefore need not be put out anywhere
2943 where they are not needed. DECL_COMDAT is just a hint to the
2944 back-end; it is up to front-ends which set this flag to ensure
2945 that there will never be any harm, other than bloat, in putting out
2946 something which is DECL_COMDAT. */
2947 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2949 /* A replaceable function is one which may be replaced at link-time
2950 with an entirely different definition, provided that the
2951 replacement has the same type. For example, functions declared
2952 with __attribute__((weak)) on most systems are replaceable.
2954 COMDAT functions are not replaceable, since all definitions of the
2955 function must be equivalent. It is important that COMDAT functions
2956 not be treated as replaceable so that use of C++ template
2957 instantiations is not penalized.
2959 For example, DECL_REPLACEABLE is used to determine whether or not a
2960 function (including a template instantiation) which is not
2961 explicitly declared "inline" can be inlined. If the function is
2962 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2963 implementation chosen at link-time may be different. However, a
2964 function that is not DECL_REPLACEABLE can be inlined, since all
2965 versions of the function will be functionally identical. */
2966 #define DECL_REPLACEABLE_P(NODE) \
2967 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2969 /* The name of the object as the assembler will see it (but before any
2970 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2971 as DECL_NAME. It is an IDENTIFIER_NODE. */
2972 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2974 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2975 This is true of all DECL nodes except FIELD_DECL. */
2976 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2977 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2979 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2980 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2982 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2983 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2985 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2986 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2987 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2989 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2990 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2991 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2992 semantics of using this macro, are different than saying:
2994 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2996 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2998 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2999 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3000 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3001 DECL_ASSEMBLER_NAME (DECL1)) \
3004 /* Records the section name in a section attribute. Used to pass
3005 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3006 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3008 /* Value of the decls's visibility attribute */
3009 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3011 /* Nonzero means that the decl had its visibility specified rather than
3013 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3015 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3016 multiple translation units should be merged. */
3017 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
3019 struct tree_decl_with_vis GTY(())
3021 struct tree_decl_with_rtl common;
3022 tree assembler_name;
3025 /* Belong to VAR_DECL exclusively. */
3026 unsigned defer_output:1;
3027 unsigned hard_register:1;
3028 unsigned thread_local:1;
3029 unsigned common_flag:1;
3030 unsigned in_text_section : 1;
3031 unsigned gimple_formal_temp : 1;
3032 unsigned dllimport_flag : 1;
3033 unsigned based_on_restrict_p : 1;
3034 /* Used by C++. Might become a generic decl flag. */
3035 unsigned shadowed_for_var_p : 1;
3037 /* Don't belong to VAR_DECL exclusively. */
3038 unsigned in_system_header_flag : 1;
3039 unsigned weak_flag:1;
3040 unsigned seen_in_bind_expr : 1;
3041 unsigned comdat_flag : 1;
3042 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3043 unsigned visibility_specified : 1;
3044 /* Belong to FUNCTION_DECL exclusively. */
3045 unsigned one_only : 1;
3046 unsigned init_priority_p:1;
3048 /* Belongs to VAR_DECL exclusively. */
3049 ENUM_BITFIELD(tls_model) tls_model : 3;
3050 /* 11 unused bits. */
3053 /* In a VAR_DECL that's static,
3054 nonzero if the space is in the text section. */
3055 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3057 /* Nonzero for a given ..._DECL node means that this node should be
3058 put in .common, if possible. If a DECL_INITIAL is given, and it
3059 is not error_mark_node, then the decl cannot be put in .common. */
3060 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3062 /* In a VAR_DECL, nonzero if the decl is a register variable with
3063 an explicit asm specification. */
3064 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3066 extern tree decl_debug_expr_lookup (tree);
3067 extern void decl_debug_expr_insert (tree, tree);
3068 /* For VAR_DECL, this is set to either an expression that it was split
3069 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3070 subexpressions that it was split into. */
3071 #define DECL_DEBUG_EXPR(NODE) \
3072 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3074 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3075 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3077 /* An initializationp priority. */
3078 typedef unsigned short priority_type;
3080 extern priority_type decl_init_priority_lookup (tree);
3081 extern priority_type decl_fini_priority_lookup (tree);
3082 extern void decl_init_priority_insert (tree, priority_type);
3083 extern void decl_fini_priority_insert (tree, priority_type);
3085 /* In a non-local VAR_DECL with static storage duration, true if the
3086 variable has an initialization priority. If false, the variable
3087 will be initialized at the DEFAULT_INIT_PRIORITY. */
3088 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3089 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3091 /* For a VAR_DECL or FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set,
3092 the initialization priority of NODE. */
3093 #define DECL_INIT_PRIORITY(NODE) \
3094 (decl_init_priority_lookup (NODE))
3095 /* Set the initialization priority for NODE to VAL. */
3096 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3097 (decl_init_priority_insert (NODE, VAL))
3099 /* For a FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set, the
3100 finalization priority of NODE. */
3101 #define DECL_FINI_PRIORITY(NODE) \
3102 (decl_fini_priority_lookup (NODE))
3103 /* Set the finalization priority for NODE to VAL. */
3104 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3105 (decl_fini_priority_insert (NODE, VAL))
3107 /* The initialization priority for entities for which no explicit
3108 initialization priority has been specified. */
3109 #define DEFAULT_INIT_PRIORITY 65535
3111 /* The maximum allowed initialization priority. */
3112 #define MAX_INIT_PRIORITY 65535
3114 /* The largest priority value reserved for use by system runtime
3116 #define MAX_RESERVED_INIT_PRIORITY 100
3118 /* In a VAR_DECL, the model to use if the data should be allocated from
3119 thread-local storage. */
3120 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3122 /* In a VAR_DECL, nonzero if the data should be allocated from
3123 thread-local storage. */
3124 #define DECL_THREAD_LOCAL_P(NODE) \
3125 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
3127 struct tree_var_decl GTY(())
3129 struct tree_decl_with_vis common;
3133 /* This field is used to reference anything in decl.result and is meant only
3134 for use by the garbage collector. */
3135 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3137 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3138 Before the struct containing the FUNCTION_DECL is laid out,
3139 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3140 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3141 function. When the class is laid out, this pointer is changed
3142 to an INTEGER_CST node which is suitable for use as an index
3143 into the virtual function table.
3144 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3145 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3147 struct tree_decl_non_common GTY(())
3150 struct tree_decl_with_vis common;
3151 /* C++ uses this in namespaces. */
3153 /* C++ uses this in templates. */
3155 /* Almost all FE's use this. */
3157 /* C++ uses this in namespaces. */
3161 /* In FUNCTION_DECL, holds the decl for the return value. */
3162 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3164 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3165 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3167 /* In a FUNCTION_DECL, the saved representation of the body of the
3169 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3171 /* Nonzero in a FUNCTION_DECL means this function should be treated
3172 as if it were a malloc, meaning it returns a pointer that is
3174 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3176 /* Nonzero in a FUNCTION_DECL means this function may return more
3178 #define DECL_IS_RETURNS_TWICE(NODE) \
3179 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3181 /* Nonzero in a FUNCTION_DECL means this function should be treated
3182 as "pure" function (like const function, but may read global memory). */
3183 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3185 /* Nonzero in a FUNCTION_DECL means this function should be treated
3186 as "novops" function (function that does not read global memory,
3187 but may have arbitrary side effects). */
3188 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3190 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3191 at the beginning or end of execution. */
3192 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3193 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3195 #define DECL_STATIC_DESTRUCTOR(NODE) \
3196 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3198 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3199 be instrumented with calls to support routines. */
3200 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3201 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3203 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3204 disabled in this function. */
3205 #define DECL_NO_LIMIT_STACK(NODE) \
3206 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3208 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3209 static chain is not needed. */
3210 #define DECL_NO_STATIC_CHAIN(NODE) \
3211 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3213 /* Nonzero for a decl that cgraph has decided should be inlined into
3214 at least one call site. It is not meaningful to look at this
3215 directly; always use cgraph_function_possibly_inlined_p. */
3216 #define DECL_POSSIBLY_INLINED(DECL) \
3217 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3219 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3220 where it is called. */
3221 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3223 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3224 such as via the `inline' keyword in C/C++. This flag controls the linkage
3225 semantics of 'inline'; whether or not the function is inlined is
3226 controlled by DECL_INLINE. */
3227 #define DECL_DECLARED_INLINE_P(NODE) \
3228 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3230 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3231 that describes the status of this function. */
3232 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3234 /* In a FUNCTION_DECL, nonzero means a built in function. */
3235 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3237 /* For a builtin function, identify which part of the compiler defined it. */
3238 #define DECL_BUILT_IN_CLASS(NODE) \
3239 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3241 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3242 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3244 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3245 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3247 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3248 arguments/result/saved_tree fields by front ends. It was either inherit
3249 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3250 which seemed a bit strange. */
3252 struct tree_function_decl GTY(())
3254 struct tree_decl_non_common common;
3256 unsigned static_ctor_flag : 1;
3257 unsigned static_dtor_flag : 1;
3258 unsigned uninlinable : 1;
3259 unsigned possibly_inlined : 1;
3260 unsigned novops_flag : 1;
3261 unsigned returns_twice_flag : 1;
3262 unsigned malloc_flag : 1;
3263 unsigned pure_flag : 1;
3265 unsigned declared_inline_flag : 1;
3266 unsigned regdecl_flag : 1;
3267 unsigned inline_flag : 1;
3268 unsigned no_instrument_function_entry_exit : 1;
3269 unsigned no_limit_stack : 1;
3270 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3275 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3276 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3278 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3279 into stabs. Instead it will generate cross reference ('x') of names.
3280 This uses the same flag as DECL_EXTERNAL. */
3281 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3282 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3284 struct tree_type_decl GTY(())
3286 struct tree_decl_non_common common;
3290 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3291 To reduce overhead, the nodes containing the statements are not trees.
3292 This avoids the overhead of tree_common on all linked list elements.
3294 Use the interface in tree-iterator.h to access this node. */
3296 #define STATEMENT_LIST_HEAD(NODE) \
3297 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3298 #define STATEMENT_LIST_TAIL(NODE) \
3299 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3301 struct tree_statement_list_node
3302 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3304 struct tree_statement_list_node *prev;
3305 struct tree_statement_list_node *next;
3309 struct tree_statement_list
3312 struct tree_common common;
3313 struct tree_statement_list_node *head;
3314 struct tree_statement_list_node *tail;
3317 #define VALUE_HANDLE_ID(NODE) \
3318 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3320 #define VALUE_HANDLE_EXPR_SET(NODE) \
3321 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3323 #define VALUE_HANDLE_VUSES(NODE) \
3324 (VALUE_HANDLE_CHECK (NODE)->value_handle.vuses)
3326 /* Defined and used in tree-ssa-pre.c. */
3328 struct tree_value_handle GTY(())
3330 struct tree_common common;
3332 /* The set of expressions represented by this handle. */
3333 struct bitmap_set * GTY ((skip)) expr_set;
3335 /* Unique ID for this value handle. IDs are handed out in a
3336 conveniently dense form starting at 0, so that we can make
3337 bitmaps of value handles. */
3340 /* Set of virtual uses represented by this handle. */
3341 VEC (tree, gc) *vuses;
3344 /* Define the overall contents of a tree node.
3345 It may be any of the structures declared above
3346 for various types of node. */
3348 union tree_node GTY ((ptr_alias (union lang_tree_node),
3349 desc ("tree_node_structure (&%h)")))
3351 struct tree_base GTY ((tag ("TS_BASE"))) base;
3352 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3353 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3354 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3355 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3356 struct tree_string GTY ((tag ("TS_STRING"))) string;
3357 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3358 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3359 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3360 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3361 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3362 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3363 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3364 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3365 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3366 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3367 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3368 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3369 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3370 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3371 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3372 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3373 struct tree_list GTY ((tag ("TS_LIST"))) list;
3374 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3375 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3376 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3377 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3378 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3379 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3380 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3381 struct gimple_stmt GTY ((tag ("TS_GIMPLE_STATEMENT"))) gstmt;
3382 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3383 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3384 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3385 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3386 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3387 struct tree_memory_partition_tag GTY ((tag ("TS_MEMORY_PARTITION_TAG"))) mpt;
3390 /* Standard named or nameless data types of the C compiler. */
3412 TI_INTEGER_MINUS_ONE,
3429 TI_COMPLEX_INTEGER_TYPE,
3430 TI_COMPLEX_FLOAT_TYPE,
3431 TI_COMPLEX_DOUBLE_TYPE,
3432 TI_COMPLEX_LONG_DOUBLE_TYPE,
3436 TI_LONG_DOUBLE_TYPE,
3440 TI_LONG_DOUBLE_PTR_TYPE,
3441 TI_INTEGER_PTR_TYPE,
3450 TI_VA_LIST_GPR_COUNTER_FIELD,
3451 TI_VA_LIST_FPR_COUNTER_FIELD,
3458 TI_DFLOAT32_PTR_TYPE,
3459 TI_DFLOAT64_PTR_TYPE,
3460 TI_DFLOAT128_PTR_TYPE,
3469 extern GTY(()) tree global_trees[TI_MAX];
3471 #define error_mark_node global_trees[TI_ERROR_MARK]
3473 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3474 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3475 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3476 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3477 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3479 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3480 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3481 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3482 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3483 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3485 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3486 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3488 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3489 #define integer_one_node global_trees[TI_INTEGER_ONE]
3490 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3491 #define size_zero_node global_trees[TI_SIZE_ZERO]
3492 #define size_one_node global_trees[TI_SIZE_ONE]
3493 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3494 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3495 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3497 /* Base access nodes. */
3498 #define access_public_node global_trees[TI_PUBLIC]
3499 #define access_protected_node global_trees[TI_PROTECTED]
3500 #define access_private_node global_trees[TI_PRIVATE]
3502 #define null_pointer_node global_trees[TI_NULL_POINTER]
3504 #define float_type_node global_trees[TI_FLOAT_TYPE]
3505 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3506 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3508 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3509 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3510 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3511 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3513 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3514 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3515 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3516 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3518 #define void_type_node global_trees[TI_VOID_TYPE]
3519 /* The C type `void *'. */
3520 #define ptr_type_node global_trees[TI_PTR_TYPE]
3521 /* The C type `const void *'. */
3522 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3523 /* The C type `size_t'. */
3524 #define size_type_node global_trees[TI_SIZE_TYPE]
3525 #define pid_type_node global_trees[TI_PID_TYPE]
3526 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3527 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3528 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3529 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3530 /* The C type `FILE *'. */
3531 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3533 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3534 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3535 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3537 /* The decimal floating point types. */
3538 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3539 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3540 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3541 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3542 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3543 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3545 /* The node that should be placed at the end of a parameter list to
3546 indicate that the function does not take a variable number of
3547 arguments. The TREE_VALUE will be void_type_node and there will be
3548 no TREE_CHAIN. Language-independent code should not assume
3549 anything else about this node. */
3550 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3552 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3553 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3555 /* An enumeration of the standard C integer types. These must be
3556 ordered so that shorter types appear before longer ones, and so
3557 that signed types appear before unsigned ones, for the correct
3558 functioning of interpret_integer() in c-lex.c. */
3559 enum integer_type_kind
3571 itk_unsigned_long_long,
3575 typedef enum integer_type_kind integer_type_kind;
3577 /* The standard C integer types. Use integer_type_kind to index into
3579 extern GTY(()) tree integer_types[itk_none];
3581 #define char_type_node integer_types[itk_char]
3582 #define signed_char_type_node integer_types[itk_signed_char]
3583 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3584 #define short_integer_type_node integer_types[itk_short]
3585 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3586 #define integer_type_node integer_types[itk_int]
3587 #define unsigned_type_node integer_types[itk_unsigned_int]
3588 #define long_integer_type_node integer_types[itk_long]
3589 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3590 #define long_long_integer_type_node integer_types[itk_long_long]
3591 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3593 /* Set to the default thread-local storage (tls) model to use. */
3595 extern enum tls_model flag_tls_default;
3598 /* A pointer-to-function member type looks like:
3605 If __pfn is NULL, it is a NULL pointer-to-member-function.
3607 (Because the vtable is always the first thing in the object, we
3608 don't need its offset.) If the function is virtual, then PFN is
3609 one plus twice the index into the vtable; otherwise, it is just a
3610 pointer to the function.
3612 Unfortunately, using the lowest bit of PFN doesn't work in
3613 architectures that don't impose alignment requirements on function
3614 addresses, or that use the lowest bit to tell one ISA from another,
3615 for example. For such architectures, we use the lowest bit of
3616 DELTA instead of the lowest bit of the PFN, and DELTA will be
3619 enum ptrmemfunc_vbit_where_t
3621 ptrmemfunc_vbit_in_pfn,
3622 ptrmemfunc_vbit_in_delta
3625 #define NULL_TREE (tree) NULL
3627 extern tree decl_assembler_name (tree);
3628 extern bool decl_assembler_name_equal (tree decl, tree asmname);
3630 /* Compute the number of bytes occupied by 'node'. This routine only
3631 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3633 extern size_t tree_size (tree);
3635 /* Compute the number of bytes occupied by a tree with code CODE. This
3636 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3638 extern size_t tree_code_size (enum tree_code);
3640 /* Lowest level primitive for allocating a node.
3641 The TREE_CODE is the only argument. Contents are initialized
3642 to zero except for a few of the common fields. */
3644 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3645 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3647 /* Make a copy of a node, with all the same contents. */
3649 extern tree copy_node_stat (tree MEM_STAT_DECL);
3650 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3652 /* Make a copy of a chain of TREE_LIST nodes. */
3654 extern tree copy_list (tree);
3657 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3658 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3660 /* Make a TREE_VEC. */
3662 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3663 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3665 /* Tree nodes for SSA analysis. */
3667 extern void init_phinodes (void);
3668 extern void fini_phinodes (void);
3669 extern void release_phi_node (tree);
3670 #ifdef GATHER_STATISTICS
3671 extern void phinodes_print_statistics (void);
3674 extern void init_ssanames (void);
3675 extern void fini_ssanames (void);
3676 extern tree make_ssa_name (tree, tree);
3677 extern tree duplicate_ssa_name (tree, tree);
3678 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3679 extern void release_ssa_name (tree);
3680 extern void release_defs (tree);
3681 extern void replace_ssa_name_symbol (tree, tree);
3683 #ifdef GATHER_STATISTICS
3684 extern void ssanames_print_statistics (void);
3687 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3688 The name is supplied as a char *. */
3690 extern tree get_identifier (const char *);
3692 #if GCC_VERSION >= 3000
3693 #define get_identifier(str) \
3694 (__builtin_constant_p (str) \
3695 ? get_identifier_with_length ((str), strlen (str)) \
3696 : get_identifier (str))
3700 /* Identical to get_identifier, except that the length is assumed
3703 extern tree get_identifier_with_length (const char *, size_t);
3705 /* If an identifier with the name TEXT (a null-terminated string) has
3706 previously been referred to, return that node; otherwise return
3709 extern tree maybe_get_identifier (const char *);
3711 /* Construct various types of nodes. */
3713 extern tree build_nt (enum tree_code, ...);
3714 extern tree build_nt_call_list (tree, tree);
3716 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3717 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3718 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3719 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3720 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3721 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3722 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3723 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3724 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3725 tree MEM_STAT_DECL);
3726 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3727 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3728 tree MEM_STAT_DECL);
3729 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3730 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3731 tree, tree, tree MEM_STAT_DECL);
3732 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3733 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3735 extern tree build_gimple_modify_stmt_stat (tree, tree MEM_STAT_DECL);
3736 #define build_gimple_modify_stmt(t1,t2) \
3737 build_gimple_modify_stmt_stat (t1,t2 MEM_STAT_INFO)
3739 extern tree build_int_cst (tree, HOST_WIDE_INT);
3740 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3741 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3742 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3743 extern tree build_int_cst_wide_type (tree,
3744 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3745 extern tree build_vector (tree, tree);
3746 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3747 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3748 extern tree build_constructor_single (tree, tree, tree);
3749 extern tree build_constructor_from_list (tree, tree);
3750 extern tree build_real_from_int_cst (tree, tree);
3751 extern tree build_complex (tree, tree, tree);
3752 extern tree build_one_cst (tree);
3753 extern tree build_string (int, const char *);
3754 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3755 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3756 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3757 extern tree build_fn_decl (const char *, tree);
3758 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3759 extern tree build_block (tree, tree, tree, tree);
3760 #ifndef USE_MAPPED_LOCATION
3761 extern void annotate_with_file_line (tree, const char *, int);
3762 extern void annotate_with_locus (tree, location_t);
3764 extern tree build_empty_stmt (void);
3765 extern tree build_omp_clause (enum omp_clause_code);
3767 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3768 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3770 extern tree build_call_list (tree, tree, tree);
3771 extern tree build_call_nary (tree, tree, int, ...);
3772 extern tree build_call_valist (tree, tree, int, va_list);
3773 extern tree build_call_array (tree, tree, int, tree*);
3775 /* Construct various nodes representing data types. */
3777 extern tree make_signed_type (int);
3778 extern tree make_unsigned_type (int);
3779 extern tree signed_or_unsigned_type_for (int, tree);
3780 extern tree signed_type_for (tree);
3781 extern tree unsigned_type_for (tree);
3782 extern void initialize_sizetypes (bool);
3783 extern void set_sizetype (tree);
3784 extern void fixup_unsigned_type (tree);
3785 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3786 extern tree build_pointer_type (tree);
3787 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3788 extern tree build_reference_type (tree);
3789 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3790 extern tree build_vector_type (tree innertype, int nunits);
3791 extern tree build_type_no_quals (tree);
3792 extern tree build_index_type (tree);
3793 extern tree build_index_2_type (tree, tree);
3794 extern tree build_array_type (tree, tree);
3795 extern tree build_function_type (tree, tree);
3796 extern tree build_function_type_list (tree, ...);
3797 extern tree build_method_type_directly (tree, tree, tree);
3798 extern tree build_method_type (tree, tree);
3799 extern tree build_offset_type (tree, tree);
3800 extern tree build_complex_type (tree);
3801 extern tree build_resx (int);
3802 extern tree array_type_nelts (tree);
3803 extern bool in_array_bounds_p (tree);
3804 extern bool range_in_array_bounds_p (tree);
3806 extern tree value_member (tree, tree);
3807 extern tree purpose_member (tree, tree);
3809 extern int attribute_list_equal (tree, tree);
3810 extern int attribute_list_contained (tree, tree);
3811 extern int tree_int_cst_equal (tree, tree);
3812 extern int tree_int_cst_lt (tree, tree);
3813 extern int tree_int_cst_compare (tree, tree);
3814 extern int host_integerp (tree, int);
3815 extern HOST_WIDE_INT tree_low_cst (tree, int);
3816 extern int tree_int_cst_msb (tree);
3817 extern int tree_int_cst_sgn (tree);
3818 extern int tree_int_cst_sign_bit (tree);
3819 extern bool tree_expr_nonnegative_p (tree);
3820 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
3821 extern bool may_negate_without_overflow_p (tree);
3822 extern tree get_inner_array_type (tree);
3824 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3825 put the prototype here. Rtl.h does declare the prototype if
3826 tree.h had been included. */
3828 extern tree make_tree (tree, rtx);
3830 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3833 Such modified types already made are recorded so that duplicates
3836 extern tree build_type_attribute_variant (tree, tree);
3837 extern tree build_decl_attribute_variant (tree, tree);
3839 /* Structure describing an attribute and a function to handle it. */
3840 struct attribute_spec
3842 /* The name of the attribute (without any leading or trailing __),
3843 or NULL to mark the end of a table of attributes. */
3844 const char *const name;
3845 /* The minimum length of the list of arguments of the attribute. */
3846 const int min_length;
3847 /* The maximum length of the list of arguments of the attribute
3848 (-1 for no maximum). */
3849 const int max_length;
3850 /* Whether this attribute requires a DECL. If it does, it will be passed
3851 from types of DECLs, function return types and array element types to
3852 the DECLs, function types and array types respectively; but when
3853 applied to a type in any other circumstances, it will be ignored with
3854 a warning. (If greater control is desired for a given attribute,
3855 this should be false, and the flags argument to the handler may be
3856 used to gain greater control in that case.) */
3857 const bool decl_required;
3858 /* Whether this attribute requires a type. If it does, it will be passed
3859 from a DECL to the type of that DECL. */
3860 const bool type_required;
3861 /* Whether this attribute requires a function (or method) type. If it does,
3862 it will be passed from a function pointer type to the target type,
3863 and from a function return type (which is not itself a function
3864 pointer type) to the function type. */
3865 const bool function_type_required;
3866 /* Function to handle this attribute. NODE points to the node to which
3867 the attribute is to be applied. If a DECL, it should be modified in
3868 place; if a TYPE, a copy should be created. NAME is the name of the
3869 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3870 of the arguments (which may be NULL). FLAGS gives further information
3871 about the context of the attribute. Afterwards, the attributes will
3872 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3873 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3874 as well as in any other cases when the attributes should not be added
3875 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3876 applied to another type or DECL later may be returned;
3877 otherwise the return value should be NULL_TREE. This pointer may be
3878 NULL if no special handling is required beyond the checks implied
3879 by the rest of this structure. */
3880 tree (*const handler) (tree *node, tree name, tree args,
3881 int flags, bool *no_add_attrs);
3884 /* Flags that may be passed in the third argument of decl_attributes, and
3885 to handler functions for attributes. */
3886 enum attribute_flags
3888 /* The type passed in is the type of a DECL, and any attributes that
3889 should be passed in again to be applied to the DECL rather than the
3890 type should be returned. */
3891 ATTR_FLAG_DECL_NEXT = 1,
3892 /* The type passed in is a function return type, and any attributes that
3893 should be passed in again to be applied to the function type rather
3894 than the return type should be returned. */
3895 ATTR_FLAG_FUNCTION_NEXT = 2,
3896 /* The type passed in is an array element type, and any attributes that
3897 should be passed in again to be applied to the array type rather
3898 than the element type should be returned. */
3899 ATTR_FLAG_ARRAY_NEXT = 4,
3900 /* The type passed in is a structure, union or enumeration type being
3901 created, and should be modified in place. */
3902 ATTR_FLAG_TYPE_IN_PLACE = 8,
3903 /* The attributes are being applied by default to a library function whose
3904 name indicates known behavior, and should be silently ignored if they
3905 are not in fact compatible with the function type. */
3906 ATTR_FLAG_BUILT_IN = 16
3909 /* Default versions of target-overridable functions. */
3911 extern tree merge_decl_attributes (tree, tree);
3912 extern tree merge_type_attributes (tree, tree);
3914 /* Given a tree node and a string, return nonzero if the tree node is
3915 a valid attribute name for the string. */
3917 extern int is_attribute_p (const char *, tree);
3919 /* Given an attribute name and a list of attributes, return the list element
3920 of the attribute or NULL_TREE if not found. */
3922 extern tree lookup_attribute (const char *, tree);
3924 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3927 extern tree remove_attribute (const char *, tree);
3929 /* Given two attributes lists, return a list of their union. */
3931 extern tree merge_attributes (tree, tree);
3933 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3934 /* Given two Windows decl attributes lists, possibly including
3935 dllimport, return a list of their union . */
3936 extern tree merge_dllimport_decl_attributes (tree, tree);
3938 /* Handle a "dllimport" or "dllexport" attribute. */
3939 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3942 /* Check whether CAND is suitable to be returned from get_qualified_type
3943 (BASE, TYPE_QUALS). */
3945 extern bool check_qualified_type (tree, tree, int);
3947 /* Return a version of the TYPE, qualified as indicated by the
3948 TYPE_QUALS, if one exists. If no qualified version exists yet,
3949 return NULL_TREE. */
3951 extern tree get_qualified_type (tree, int);
3953 /* Like get_qualified_type, but creates the type if it does not
3954 exist. This function never returns NULL_TREE. */
3956 extern tree build_qualified_type (tree, int);
3958 /* Like build_qualified_type, but only deals with the `const' and
3959 `volatile' qualifiers. This interface is retained for backwards
3960 compatibility with the various front-ends; new code should use
3961 build_qualified_type instead. */
3963 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3964 build_qualified_type ((TYPE), \
3965 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3966 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3968 /* Make a copy of a type node. */
3970 extern tree build_distinct_type_copy (tree);
3971 extern tree build_variant_type_copy (tree);
3973 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3974 fields. Optionally specify an alignment, and then lay it out. */
3976 extern void finish_builtin_struct (tree, const char *,
3979 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3980 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3981 node, does nothing except for the first time. */
3983 extern void layout_type (tree);
3985 /* These functions allow a front-end to perform a manual layout of a
3986 RECORD_TYPE. (For instance, if the placement of subsequent fields
3987 depends on the placement of fields so far.) Begin by calling
3988 start_record_layout. Then, call place_field for each of the
3989 fields. Then, call finish_record_layout. See layout_type for the
3990 default way in which these functions are used. */
3992 typedef struct record_layout_info_s
3994 /* The RECORD_TYPE that we are laying out. */
3996 /* The offset into the record so far, in bytes, not including bits in
3999 /* The last known alignment of SIZE. */
4000 unsigned int offset_align;
4001 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4003 /* The alignment of the record so far, in bits. */
4004 unsigned int record_align;
4005 /* The alignment of the record so far, ignoring #pragma pack and
4006 __attribute__ ((packed)), in bits. */
4007 unsigned int unpacked_align;
4008 /* The previous field layed out. */
4010 /* The static variables (i.e., class variables, as opposed to
4011 instance variables) encountered in T. */
4012 tree pending_statics;
4013 /* Bits remaining in the current alignment group */
4014 int remaining_in_alignment;
4015 /* True if we've seen a packed field that didn't have normal
4016 alignment anyway. */
4017 int packed_maybe_necessary;
4018 } *record_layout_info;
4020 extern void set_lang_adjust_rli (void (*) (record_layout_info));
4021 extern record_layout_info start_record_layout (tree);
4022 extern tree bit_from_pos (tree, tree);
4023 extern tree byte_from_pos (tree, tree);
4024 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4025 extern void normalize_offset (tree *, tree *, unsigned int);
4026 extern tree rli_size_unit_so_far (record_layout_info);
4027 extern tree rli_size_so_far (record_layout_info);
4028 extern void normalize_rli (record_layout_info);
4029 extern void place_field (record_layout_info, tree);
4030 extern void compute_record_mode (tree);
4031 extern void finish_record_layout (record_layout_info, int);
4033 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4034 return a canonicalized ..._TYPE node, so that duplicates are not made.
4035 How the hash code is computed is up to the caller, as long as any two
4036 callers that could hash identical-looking type nodes agree. */
4038 extern tree type_hash_canon (unsigned int, tree);
4040 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4041 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4042 fields. Call this only once for any given decl node.
4044 Second argument is the boundary that this field can be assumed to
4045 be starting at (in bits). Zero means it can be assumed aligned
4046 on any boundary that may be needed. */
4048 extern void layout_decl (tree, unsigned);
4050 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4051 a previous call to layout_decl and calls it again. */
4053 extern void relayout_decl (tree);
4055 /* Return the mode for data of a given size SIZE and mode class CLASS.
4056 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4057 The value is BLKmode if no other mode is found. This is like
4058 mode_for_size, but is passed a tree. */
4060 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
4062 /* Return an expr equal to X but certainly not valid as an lvalue. */
4064 extern tree non_lvalue (tree);
4066 extern tree convert (tree, tree);
4067 extern unsigned int expr_align (tree);
4068 extern tree expr_first (tree);
4069 extern tree expr_last (tree);
4070 extern tree expr_only (tree);
4071 extern tree size_in_bytes (tree);
4072 extern HOST_WIDE_INT int_size_in_bytes (tree);
4073 extern HOST_WIDE_INT max_int_size_in_bytes (tree);
4074 extern tree bit_position (tree);
4075 extern HOST_WIDE_INT int_bit_position (tree);
4076 extern tree byte_position (tree);
4077 extern HOST_WIDE_INT int_byte_position (tree);
4079 /* Define data structures, macros, and functions for handling sizes
4080 and the various types used to represent sizes. */
4084 SIZETYPE, /* Normal representation of sizes in bytes. */
4085 SSIZETYPE, /* Signed representation of sizes in bytes. */
4086 BITSIZETYPE, /* Normal representation of sizes in bits. */
4087 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4090 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4092 #define sizetype sizetype_tab[(int) SIZETYPE]
4093 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4094 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4095 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4097 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4098 extern tree size_binop (enum tree_code, tree, tree);
4099 extern tree size_diffop (tree, tree);
4101 #define size_int(L) size_int_kind (L, SIZETYPE)
4102 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4103 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4104 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4106 extern tree round_up (tree, int);
4107 extern tree round_down (tree, int);
4108 extern tree get_pending_sizes (void);
4109 extern void put_pending_size (tree);
4110 extern void put_pending_sizes (tree);
4112 /* Type for sizes of data-type. */
4114 #define BITS_PER_UNIT_LOG \
4115 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4116 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4117 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4119 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4120 extern unsigned int maximum_field_alignment;
4121 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4122 extern unsigned int initial_max_fld_align;
4124 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4125 by making the last node in X point to Y.
4126 Returns X, except if X is 0 returns Y. */
4128 extern tree chainon (tree, tree);
4130 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4132 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4133 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4135 /* Return the last tree node in a chain. */
4137 extern tree tree_last (tree);
4139 /* Reverse the order of elements in a chain, and return the new head. */
4141 extern tree nreverse (tree);
4143 /* Returns the length of a chain of nodes
4144 (number of chain pointers to follow before reaching a null pointer). */
4146 extern int list_length (tree);
4148 /* Returns the number of FIELD_DECLs in a type. */
4150 extern int fields_length (tree);
4152 /* Given an initializer INIT, return TRUE if INIT is zero or some
4153 aggregate of zeros. Otherwise return FALSE. */
4155 extern bool initializer_zerop (tree);
4157 /* Examine CTOR to discover:
4158 * how many scalar fields are set to nonzero values,
4159 and place it in *P_NZ_ELTS;
4160 * how many scalar fields in total are in CTOR,
4161 and place it in *P_ELT_COUNT.
4162 * if a type is a union, and the initializer from the constructor
4163 is not the largest element in the union, then set *p_must_clear.
4165 Return whether or not CTOR is a valid static constant initializer, the same
4166 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4168 extern bool categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4171 extern HOST_WIDE_INT count_type_elements (tree, bool);
4173 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4175 extern int integer_zerop (tree);
4177 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4179 extern int integer_onep (tree);
4181 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4182 all of whose significant bits are 1. */
4184 extern int integer_all_onesp (tree);
4186 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4187 exactly one bit 1. */
4189 extern int integer_pow2p (tree);
4191 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4192 with a nonzero value. */
4194 extern int integer_nonzerop (tree);
4196 extern bool cst_and_fits_in_hwi (tree);
4197 extern tree num_ending_zeros (tree);
4199 /* staticp (tree x) is nonzero if X is a reference to data allocated
4200 at a fixed address in memory. Returns the outermost data. */
4202 extern tree staticp (tree);
4204 /* save_expr (EXP) returns an expression equivalent to EXP
4205 but it can be used multiple times within context CTX
4206 and only evaluate EXP once. */
4208 extern tree save_expr (tree);
4210 /* Look inside EXPR and into any simple arithmetic operations. Return
4211 the innermost non-arithmetic node. */
4213 extern tree skip_simple_arithmetic (tree);
4215 /* Return which tree structure is used by T. */
4217 enum tree_node_structure_enum tree_node_structure (tree);
4219 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4220 or offset that depends on a field within a record.
4222 Note that we only allow such expressions within simple arithmetic
4225 extern bool contains_placeholder_p (tree);
4227 /* This macro calls the above function but short-circuits the common
4228 case of a constant to save time. Also check for null. */
4230 #define CONTAINS_PLACEHOLDER_P(EXP) \
4231 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4233 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4234 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4237 extern bool type_contains_placeholder_p (tree);
4239 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4240 return a tree with all occurrences of references to F in a
4241 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4242 contains only arithmetic expressions. */
4244 extern tree substitute_in_expr (tree, tree, tree);
4246 /* This macro calls the above function but short-circuits the common
4247 case of a constant to save time and also checks for NULL. */
4249 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4250 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4252 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4253 for it within OBJ, a tree that is an object or a chain of references. */
4255 extern tree substitute_placeholder_in_expr (tree, tree);
4257 /* This macro calls the above function but short-circuits the common
4258 case of a constant to save time and also checks for NULL. */
4260 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4261 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4262 : substitute_placeholder_in_expr (EXP, OBJ))
4264 /* variable_size (EXP) is like save_expr (EXP) except that it
4265 is for the special case of something that is part of a
4266 variable size for a data type. It makes special arrangements
4267 to compute the value at the right time when the data type
4268 belongs to a function parameter. */
4270 extern tree variable_size (tree);
4272 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4273 but it can be used multiple times
4274 and only evaluate the subexpressions once. */
4276 extern tree stabilize_reference (tree);
4278 /* Subroutine of stabilize_reference; this is called for subtrees of
4279 references. Any expression with side-effects must be put in a SAVE_EXPR
4280 to ensure that it is only evaluated once. */
4282 extern tree stabilize_reference_1 (tree);
4284 /* Return EXP, stripped of any conversions to wider types
4285 in such a way that the result of converting to type FOR_TYPE
4286 is the same as if EXP were converted to FOR_TYPE.
4287 If FOR_TYPE is 0, it signifies EXP's type. */
4289 extern tree get_unwidened (tree, tree);
4291 /* Return OP or a simpler expression for a narrower value
4292 which can be sign-extended or zero-extended to give back OP.
4293 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4294 or 0 if the value should be sign-extended. */
4296 extern tree get_narrower (tree, int *);
4298 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4299 look for nested component-refs or array-refs at constant positions
4300 and find the ultimate containing object, which is returned. */
4302 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4303 tree *, enum machine_mode *, int *, int *,
4306 /* Return 1 if T is an expression that get_inner_reference handles. */
4308 extern int handled_component_p (tree);
4310 /* Return a tree of sizetype representing the size, in bytes, of the element
4311 of EXP, an ARRAY_REF. */
4313 extern tree array_ref_element_size (tree);
4315 /* Return a tree representing the lower bound of the array mentioned in
4316 EXP, an ARRAY_REF. */
4318 extern tree array_ref_low_bound (tree);
4320 /* Return a tree representing the upper bound of the array mentioned in
4321 EXP, an ARRAY_REF. */
4323 extern tree array_ref_up_bound (tree);
4325 /* Return a tree representing the offset, in bytes, of the field referenced
4326 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4328 extern tree component_ref_field_offset (tree);
4330 /* Given a DECL or TYPE, return the scope in which it was declared, or
4331 NUL_TREE if there is no containing scope. */
4333 extern tree get_containing_scope (tree);
4335 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4337 extern tree decl_function_context (tree);
4339 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4340 this _DECL with its context, or zero if none. */
4341 extern tree decl_type_context (tree);
4343 /* Return 1 if EXPR is the real constant zero. */
4344 extern int real_zerop (tree);
4346 /* Declare commonly used variables for tree structure. */
4348 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4349 Zero means allow extended lvalues. */
4351 extern int pedantic_lvalues;
4353 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4355 extern GTY(()) tree current_function_decl;
4357 /* Nonzero means a FUNC_BEGIN label was emitted. */
4358 extern GTY(()) const char * current_function_func_begin_label;
4361 extern unsigned crc32_string (unsigned, const char *);
4362 extern void clean_symbol_name (char *);
4363 extern tree get_file_function_name (const char *);
4364 extern tree get_callee_fndecl (tree);
4365 extern void change_decl_assembler_name (tree, tree);
4366 extern int type_num_arguments (tree);
4367 extern bool associative_tree_code (enum tree_code);
4368 extern bool commutative_tree_code (enum tree_code);
4369 extern tree upper_bound_in_type (tree, tree);
4370 extern tree lower_bound_in_type (tree, tree);
4371 extern int operand_equal_for_phi_arg_p (tree, tree);
4372 extern bool empty_body_p (tree);
4373 extern tree call_expr_arg (tree, int);
4374 extern tree *call_expr_argp (tree, int);
4375 extern tree call_expr_arglist (tree);
4379 extern void expand_expr_stmt (tree);
4380 extern int warn_if_unused_value (tree, location_t);
4381 extern void expand_label (tree);
4382 extern void expand_goto (tree);
4384 extern rtx expand_stack_save (void);
4385 extern void expand_stack_restore (tree);
4386 extern void expand_return (tree);
4387 extern int is_body_block (tree);
4390 extern void using_eh_for_cleanups (void);
4392 /* In fold-const.c */
4394 /* Non-zero if we are folding constants inside an initializer; zero
4396 extern int folding_initializer;
4398 /* Convert between trees and native memory representation. */
4399 extern int native_encode_expr (tree, unsigned char *, int);
4400 extern tree native_interpret_expr (tree, unsigned char *, int);
4402 /* Fold constants as much as possible in an expression.
4403 Returns the simplified expression.
4404 Acts only on the top level of the expression;
4405 if the argument itself cannot be simplified, its
4406 subexpressions are not changed. */
4408 extern tree fold (tree);
4409 extern tree fold_unary (enum tree_code, tree, tree);
4410 extern tree fold_binary (enum tree_code, tree, tree, tree);
4411 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4412 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4413 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4414 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4415 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4416 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4417 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4418 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4419 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4420 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4421 extern tree fold_build_call_array (tree, tree, int, tree *);
4422 extern tree fold_build_call_array_initializer (tree, tree, int, tree *);
4423 extern tree fold_convert (tree, tree);
4424 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4425 extern tree fold_ignored_result (tree);
4426 extern tree fold_abs_const (tree, tree);
4427 extern tree fold_indirect_ref_1 (tree, tree);
4428 extern void fold_defer_overflow_warnings (void);
4429 extern void fold_undefer_overflow_warnings (bool, tree, int);
4430 extern void fold_undefer_and_ignore_overflow_warnings (void);
4431 extern bool fold_deferring_overflow_warnings_p (void);
4432 extern tree maybe_fold_offset_to_reference (tree, tree, tree);
4434 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4437 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4438 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, tree);
4439 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4440 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4441 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4443 #define add_double(l1,h1,l2,h2,lv,hv) \
4444 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4445 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4446 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4447 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4448 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4449 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4451 #define mul_double(l1,h1,l2,h2,lv,hv) \
4452 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4453 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4454 HOST_WIDE_INT, unsigned int,
4455 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4456 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4457 HOST_WIDE_INT, unsigned int,
4458 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4459 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4460 HOST_WIDE_INT, unsigned int,
4461 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4462 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4463 HOST_WIDE_INT, unsigned int,
4464 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4466 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4467 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4468 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4469 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4472 enum operand_equal_flag
4478 extern int operand_equal_p (tree, tree, unsigned int);
4479 extern int multiple_of_p (tree, tree, tree);
4480 extern tree omit_one_operand (tree, tree, tree);
4481 extern tree omit_two_operands (tree, tree, tree, tree);
4482 extern tree invert_truthvalue (tree);
4483 extern tree fold_truth_not_expr (tree);
4484 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4485 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4486 extern tree fold_read_from_constant_string (tree);
4487 extern tree int_const_binop (enum tree_code, tree, tree, int);
4488 extern tree build_fold_addr_expr (tree);
4489 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4490 extern tree fold_strip_sign_ops (tree);
4491 extern tree build_fold_addr_expr_with_type (tree, tree);
4492 extern tree build_fold_indirect_ref (tree);
4493 extern tree fold_indirect_ref (tree);
4494 extern tree constant_boolean_node (int, tree);
4495 extern tree build_low_bits_mask (tree, unsigned);
4497 extern bool tree_swap_operands_p (tree, tree, bool);
4498 extern void swap_tree_operands (tree, tree *, tree *);
4499 extern enum tree_code swap_tree_comparison (enum tree_code);
4501 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4502 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4504 extern bool tree_expr_nonzero_p (tree);
4505 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4506 extern int multiple_of_p (tree, tree, tree);
4509 extern tree fold_call_expr (tree, bool);
4510 extern tree fold_builtin_fputs (tree, tree, bool, bool, tree);
4511 extern tree fold_builtin_strcpy (tree, tree, tree, tree);
4512 extern tree fold_builtin_strncpy (tree, tree, tree, tree, tree);
4513 extern tree fold_builtin_memory_chk (tree, tree, tree, tree, tree, tree, bool,
4514 enum built_in_function);
4515 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, tree, tree, bool,
4516 enum built_in_function);
4517 extern tree fold_builtin_strncpy_chk (tree, tree, tree, tree, tree);
4518 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4519 extern bool fold_builtin_next_arg (tree, bool);
4520 extern enum built_in_function builtin_mathfn_code (tree);
4521 extern tree build_function_call_expr (tree, tree);
4522 extern tree fold_build_call_expr (tree, tree, tree, tree);
4523 extern tree fold_builtin_call_array (tree, tree, int, tree *);
4524 extern tree build_call_expr (tree, int, ...);
4525 extern tree mathfn_built_in (tree, enum built_in_function fn);
4526 extern tree strip_float_extensions (tree);
4527 extern tree c_strlen (tree, int);
4528 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4529 extern tree build_va_arg_indirect_ref (tree);
4530 extern tree build_string_literal (int, const char *);
4531 extern bool validate_arglist (tree, ...);
4532 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4533 extern int get_pointer_alignment (tree, unsigned int);
4536 extern tree strip_float_extensions (tree);
4539 extern void record_component_aliases (tree);
4540 extern HOST_WIDE_INT get_alias_set (tree);
4541 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4542 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4543 extern int objects_must_conflict_p (tree, tree);
4546 extern int really_constant_p (tree);
4547 extern int int_fits_type_p (tree, tree);
4548 extern void get_type_static_bounds (tree, mpz_t, mpz_t);
4549 extern bool variably_modified_type_p (tree, tree);
4550 extern int tree_log2 (tree);
4551 extern int tree_floor_log2 (tree);
4552 extern int simple_cst_equal (tree, tree);
4553 extern hashval_t iterative_hash_expr (tree, hashval_t);
4554 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
4555 extern int type_list_equal (tree, tree);
4556 extern int chain_member (tree, tree);
4557 extern tree type_hash_lookup (unsigned int, tree);
4558 extern void type_hash_add (unsigned int, tree);
4559 extern int simple_cst_list_equal (tree, tree);
4560 extern void dump_tree_statistics (void);
4561 extern void expand_function_end (void);
4562 extern void expand_function_start (tree);
4563 extern void stack_protect_prologue (void);
4564 extern void stack_protect_epilogue (void);
4565 extern void recompute_tree_invariant_for_addr_expr (tree);
4566 extern bool needs_to_live_in_memory (tree);
4567 extern tree reconstruct_complex_type (tree, tree);
4569 extern int real_onep (tree);
4570 extern int real_twop (tree);
4571 extern int real_minus_onep (tree);
4572 extern void init_ttree (void);
4573 extern void build_common_tree_nodes (bool, bool);
4574 extern void build_common_tree_nodes_2 (int);
4575 extern void build_common_builtin_nodes (void);
4576 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4577 extern tree build_range_type (tree, tree, tree);
4578 extern HOST_WIDE_INT int_cst_value (tree);
4579 extern tree build_addr (tree, tree);
4581 extern bool fields_compatible_p (tree, tree);
4582 extern tree find_compatible_field (tree, tree);
4584 extern location_t expr_location (tree);
4585 extern void set_expr_location (tree, location_t);
4586 extern bool expr_has_location (tree);
4588 #ifdef USE_MAPPED_LOCATION
4594 extern void set_expr_locus (tree,
4595 #ifdef USE_MAPPED_LOCATION
4596 source_location *loc
4601 extern const char **expr_filename (tree);
4602 extern int *expr_lineno (tree);
4603 extern tree *tree_block (tree);
4604 extern tree *generic_tree_operand (tree, int);
4605 extern tree *generic_tree_type (tree);
4608 extern void expand_main_function (void);
4609 extern void init_dummy_function_start (void);
4610 extern void expand_dummy_function_end (void);
4611 extern unsigned int init_function_for_compilation (void);
4612 extern void allocate_struct_function (tree);
4613 extern void init_function_start (tree);
4614 extern bool use_register_for_decl (tree);
4615 extern void generate_setjmp_warnings (void);
4616 extern void init_temp_slots (void);
4617 extern void free_temp_slots (void);
4618 extern void pop_temp_slots (void);
4619 extern void push_temp_slots (void);
4620 extern void preserve_temp_slots (rtx);
4621 extern int aggregate_value_p (tree, tree);
4622 extern void push_function_context (void);
4623 extern void pop_function_context (void);
4624 extern void push_function_context_to (tree);
4625 extern void pop_function_context_from (tree);
4626 extern tree gimplify_parameters (void);
4628 /* In print-rtl.c */
4630 extern void print_rtl (FILE *, rtx);
4633 /* In print-tree.c */
4634 extern void debug_tree (tree);
4636 extern void dump_addr (FILE*, const char *, void *);
4637 extern void print_node (FILE *, const char *, tree, int);
4638 extern void print_node_brief (FILE *, const char *, tree, int);
4639 extern void indent_to (FILE *, int);
4642 /* In tree-inline.c: */
4643 extern bool debug_find_tree (tree, tree);
4644 /* This is in tree-inline.c since the routine uses
4645 data structures from the inliner. */
4646 extern tree unsave_expr_now (tree);
4647 extern tree build_duplicate_type (tree);
4650 extern rtx emit_line_note (location_t);
4654 /* Nonzero if this is a call to a function whose return value depends
4655 solely on its arguments, has no side effects, and does not read
4658 /* Nonzero if this call will never return. */
4659 #define ECF_NORETURN 2
4660 /* Nonzero if this is a call to malloc or a related function. */
4661 #define ECF_MALLOC 4
4662 /* Nonzero if it is plausible that this is a call to alloca. */
4663 #define ECF_MAY_BE_ALLOCA 8
4664 /* Nonzero if this is a call to a function that won't throw an exception. */
4665 #define ECF_NOTHROW 16
4666 /* Nonzero if this is a call to setjmp or a related function. */
4667 #define ECF_RETURNS_TWICE 32
4668 /* Nonzero if this call replaces the current stack frame. */
4669 #define ECF_SIBCALL 64
4670 /* Nonzero if this is a call to "pure" function (like const function,
4671 but may read memory. */
4672 #define ECF_PURE 128
4673 /* Nonzero if this is a call to a function that returns with the stack
4674 pointer depressed. */
4675 #define ECF_SP_DEPRESSED 256
4676 /* Create libcall block around the call. */
4677 #define ECF_LIBCALL_BLOCK 512
4678 /* Function does not read or write memory (but may have side effects, so
4679 it does not necessarily fit ECF_CONST). */
4680 #define ECF_NOVOPS 1024
4682 extern int flags_from_decl_or_type (tree);
4683 extern int call_expr_flags (tree);
4685 extern int setjmp_call_p (tree);
4686 extern bool alloca_call_p (tree);
4687 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
4688 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
4692 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4693 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4694 it should be modified in place; if a TYPE, a copy should be created
4695 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4696 information, in the form of a bitwise OR of flags in enum attribute_flags
4697 from tree.h. Depending on these flags, some attributes may be
4698 returned to be applied at a later stage (for example, to apply
4699 a decl attribute to the declaration rather than to its type). */
4700 extern tree decl_attributes (tree *, tree, int);
4702 /* In integrate.c */
4703 extern void set_decl_abstract_flags (tree, int);
4704 extern void set_decl_origin_self (tree);
4706 /* In stor-layout.c */
4707 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
4708 extern void fixup_signed_type (tree);
4709 extern void internal_reference_types (void);
4710 extern unsigned int update_alignment_for_field (record_layout_info, tree,
4713 extern void make_decl_rtl (tree);
4714 extern void make_decl_one_only (tree);
4715 extern int supports_one_only (void);
4716 extern void resolve_unique_section (tree, int, int);
4717 extern void mark_referenced (tree);
4718 extern void mark_decl_referenced (tree);
4719 extern void notice_global_symbol (tree);
4720 extern void set_user_assembler_name (tree, const char *);
4721 extern void process_pending_assemble_externals (void);
4722 extern void finish_aliases_1 (void);
4723 extern void finish_aliases_2 (void);
4724 extern tree emutls_decl (tree);
4727 extern void expand_computed_goto (tree);
4728 extern bool parse_output_constraint (const char **, int, int, int,
4729 bool *, bool *, bool *);
4730 extern bool parse_input_constraint (const char **, int, int, int, int,
4731 const char * const *, bool *, bool *);
4732 extern void expand_asm_expr (tree);
4733 extern tree resolve_asm_operand_names (tree, tree, tree);
4734 extern void expand_case (tree);
4735 extern void expand_decl (tree);
4736 extern void expand_anon_union_decl (tree, tree, tree);
4738 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4739 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
4742 /* In gimplify.c. */
4743 extern tree create_artificial_label (void);
4744 extern void gimplify_function_tree (tree);
4745 extern const char *get_name (tree);
4746 extern tree unshare_expr (tree);
4747 extern void sort_case_labels (tree);
4749 /* Interface of the DWARF2 unwind info support. */
4751 /* Generate a new label for the CFI info to refer to. */
4753 extern char *dwarf2out_cfi_label (void);
4755 /* Entry point to update the canonical frame address (CFA). */
4757 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
4759 /* Add the CFI for saving a register window. */
4761 extern void dwarf2out_window_save (const char *);
4763 /* Add a CFI to update the running total of the size of arguments pushed
4766 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
4768 /* Entry point for saving a register to the stack. */
4770 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
4772 /* Entry point for saving the return address in the stack. */
4774 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
4776 /* Entry point for saving the return address in a register. */
4778 extern void dwarf2out_return_reg (const char *, unsigned);
4780 /* Entry point for saving the first register into the second. */
4782 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
4784 /* In tree-inline.c */
4786 /* The type of a set of already-visited pointers. Functions for creating
4787 and manipulating it are declared in pointer-set.h */
4788 struct pointer_set_t;
4790 /* The type of a callback function for walking over tree structure. */
4792 typedef tree (*walk_tree_fn) (tree *, int *, void *);
4793 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
4794 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
4796 /* Assign the RTX to declaration. */
4798 extern void set_decl_rtl (tree, rtx);
4799 extern void set_decl_incoming_rtl (tree, rtx);
4801 /* Enum and arrays used for tree allocation stats.
4802 Keep in sync with tree.c:tree_node_kind_names. */
4828 extern int tree_node_counts[];
4829 extern int tree_node_sizes[];
4831 /* True if we are in gimple form and the actions of the folders need to
4832 be restricted. False if we are not in gimple form and folding is not
4833 restricted to creating gimple expressions. */
4834 extern bool in_gimple_form;
4836 /* In tree-gimple.c. */
4837 extern tree get_base_address (tree t);
4839 /* In tree-vectorizer.c. */
4840 extern void vect_set_verbosity_level (const char *);
4844 struct tree_map_base GTY(())
4849 extern int tree_map_base_eq (const void *, const void *);
4850 extern unsigned int tree_map_base_hash (const void *);
4851 extern int tree_map_base_marked_p (const void *);
4853 /* Map from a tree to another tree. */
4855 struct tree_map GTY(())
4857 struct tree_map_base base;
4862 #define tree_map_eq tree_map_base_eq
4863 extern unsigned int tree_map_hash (const void *);
4864 #define tree_map_marked_p tree_map_base_marked_p
4866 /* Map from a tree to an int. */
4868 struct tree_int_map GTY(())
4870 struct tree_map_base base;
4874 #define tree_int_map_eq tree_map_base_eq
4875 #define tree_int_map_hash tree_map_base_hash
4876 #define tree_int_map_marked_p tree_map_base_marked_p
4878 /* Map from a tree to initialization/finalization priorities. */
4880 struct tree_priority_map GTY(())
4882 struct tree_map_base base;
4887 #define tree_priority_map_eq tree_map_base_eq
4888 #define tree_priority_map_hash tree_map_base_hash
4889 #define tree_priority_map_marked_p tree_map_base_marked_p
4891 /* In tree-ssa-address.c. */
4892 extern tree tree_mem_ref_addr (tree, tree);
4893 extern void copy_mem_ref_info (tree, tree);
4896 extern bool ssa_name_nonzero_p (tree);
4897 extern bool ssa_name_nonnegative_p (tree);
4899 /* In tree-object-size.c. */
4900 extern void init_object_sizes (void);
4901 extern void fini_object_sizes (void);
4902 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
4905 extern unsigned HOST_WIDE_INT highest_pow2_factor (tree);
4907 /* In tree-inline.c. */
4909 void init_inline_once (void);
4911 /* Compute the number of operands in an expression node NODE. For
4912 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4913 otherwise it is looked up from the node's code. */
4915 tree_operand_length (tree node)
4917 if (VL_EXP_CLASS_P (node))
4918 return VL_EXP_OPERAND_LENGTH (node);
4920 return TREE_CODE_LENGTH (TREE_CODE (node));
4923 /* Abstract iterators for CALL_EXPRs. These static inline definitions
4924 have to go towards the end of tree.h so that union tree_node is fully
4925 defined by this point. */
4927 /* Structure containing iterator state. */
4928 typedef struct call_expr_arg_iterator_d GTY (())
4930 tree t; /* the call_expr */
4931 int n; /* argument count */
4932 int i; /* next argument index */
4933 } call_expr_arg_iterator;
4935 /* Initialize the abstract argument list iterator object ITER with the
4936 arguments from CALL_EXPR node EXP. */
4938 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4941 iter->n = call_expr_nargs (exp);
4945 /* Return the next argument from abstract argument list iterator object ITER,
4946 and advance its state. Return NULL_TREE if there are no more arguments. */
4948 next_call_expr_arg (call_expr_arg_iterator *iter)
4951 if (iter->i >= iter->n)
4953 result = CALL_EXPR_ARG (iter->t, iter->i);
4958 /* Initialize the abstract argument list iterator object ITER, then advance
4959 past and return the first argument. Useful in for expressions, e.g.
4960 for (arg = first_call_expr_arg (exp, &iter); arg;
4961 arg = next_call_expr_arg (&iter)) */
4963 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4965 init_call_expr_arg_iterator (exp, iter);
4966 return next_call_expr_arg (iter);
4969 /* Test whether there are more arguments in abstract argument list iterator
4970 ITER, without changing its state. */
4972 more_call_expr_args_p (const call_expr_arg_iterator *iter)
4974 return (iter->i < iter->n);
4978 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4979 (of type call_expr_arg_iterator) to hold the iteration state. */
4980 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4981 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4982 (arg) = next_call_expr_arg (&(iter)))
4984 #endif /* GCC_TREE_H */