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 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
25 #include <sys/param.h>
27 # define __PAST_END(array, offset) (((typeof(*(array)) *)(array))[offset])
33 #include "statistics.h"
36 /* Codes of tree nodes */
38 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
43 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
49 extern unsigned char tree_contains_struct[256][64];
50 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
52 /* Number of language-independent tree codes. */
53 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
55 /* Tree code classes. */
57 /* Each tree_code has an associated code class represented by a
60 enum tree_code_class {
61 tcc_exceptional, /* An exceptional code (fits no category). */
62 tcc_constant, /* A constant. */
63 /* Order of tcc_type and tcc_declaration is important. */
64 tcc_type, /* A type object code. */
65 tcc_declaration, /* A declaration (also serving as variable refs). */
66 tcc_reference, /* A reference to storage. */
67 tcc_comparison, /* A comparison expression. */
68 tcc_unary, /* A unary arithmetic expression. */
69 tcc_binary, /* A binary arithmetic expression. */
70 tcc_statement, /* A statement expression, which have side effects
71 but usually no interesting value. */
72 tcc_expression /* Any other expression. */
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 #define MAX_TREE_CODES 256
86 extern const enum tree_code_class tree_code_type[];
87 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
89 /* Nonzero if CODE represents an exceptional code. */
91 #define EXCEPTIONAL_CLASS_P(CODE)\
92 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
94 /* Nonzero if CODE represents a constant. */
96 #define CONSTANT_CLASS_P(CODE)\
97 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
99 /* Nonzero if CODE represents a type. */
101 #define TYPE_P(CODE)\
102 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
104 /* Nonzero if CODE represents a declaration. */
106 #define DECL_P(CODE)\
107 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
109 /* Nonzero if CODE represents a memory tag. */
111 #define MTAG_P(CODE) \
112 (TREE_CODE (CODE) == STRUCT_FIELD_TAG \
113 || TREE_CODE (CODE) == NAME_MEMORY_TAG \
114 || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG)
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 any other expression. */
157 #define EXPRESSION_CLASS_P(CODE)\
158 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
160 /* Returns nonzero iff CODE represents a type or declaration. */
162 #define IS_TYPE_OR_DECL_P(CODE)\
163 (TYPE_P (CODE) || DECL_P (CODE))
165 /* Returns nonzero iff CLASS is the tree-code class of an
168 #define IS_EXPR_CODE_CLASS(CLASS)\
169 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
171 /* Returns nonzero iff NODE is an expression of some kind. */
173 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
175 /* Returns nonzero iff NODE is an OpenMP directive. */
177 #define OMP_DIRECTIVE_P(NODE) \
178 (TREE_CODE (NODE) == OMP_PARALLEL \
179 || TREE_CODE (NODE) == OMP_FOR \
180 || TREE_CODE (NODE) == OMP_SECTIONS \
181 || TREE_CODE (NODE) == OMP_SINGLE \
182 || TREE_CODE (NODE) == OMP_SECTION \
183 || TREE_CODE (NODE) == OMP_MASTER \
184 || TREE_CODE (NODE) == OMP_ORDERED \
185 || TREE_CODE (NODE) == OMP_CRITICAL \
186 || TREE_CODE (NODE) == OMP_RETURN \
187 || TREE_CODE (NODE) == OMP_CONTINUE)
189 /* Number of argument-words in each kind of tree-node. */
191 extern const unsigned char tree_code_length[];
192 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
194 /* Names of tree components. */
196 extern const char *const tree_code_name[];
198 /* A vectors of trees. */
200 DEF_VEC_ALLOC_P(tree,gc);
201 DEF_VEC_ALLOC_P(tree,heap);
204 /* Classify which part of the compiler has defined a given builtin function.
205 Note that we assume below that this is no more than two bits. */
214 /* Names for the above. */
215 extern const char *const built_in_class_names[4];
217 /* Codes that identify the various built in functions
218 so that expand_call can identify them quickly. */
220 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
221 enum built_in_function
223 #include "builtins.def"
225 /* Complex division routines in libgcc. These are done via builtins
226 because emit_library_call_value can't handle complex values. */
227 BUILT_IN_COMPLEX_MUL_MIN,
228 BUILT_IN_COMPLEX_MUL_MAX
229 = BUILT_IN_COMPLEX_MUL_MIN
230 + MAX_MODE_COMPLEX_FLOAT
231 - MIN_MODE_COMPLEX_FLOAT,
233 BUILT_IN_COMPLEX_DIV_MIN,
234 BUILT_IN_COMPLEX_DIV_MAX
235 = BUILT_IN_COMPLEX_DIV_MIN
236 + MAX_MODE_COMPLEX_FLOAT
237 - MIN_MODE_COMPLEX_FLOAT,
239 /* Upper bound on non-language-specific builtins. */
244 /* Names for the above. */
245 extern const char * built_in_names[(int) END_BUILTINS];
247 /* Helper macros for math builtins. */
249 #define BUILTIN_EXP10_P(FN) \
250 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
251 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
253 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
254 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
255 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
257 #define BUILTIN_SQRT_P(FN) \
258 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
260 #define BUILTIN_CBRT_P(FN) \
261 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
263 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
265 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
266 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
268 /* An array of _DECL trees for the above. */
269 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
270 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
272 /* In an OMP_CLAUSE node. */
274 /* Number of operands and names for each clause. */
275 extern unsigned const char omp_clause_num_ops[];
276 extern const char * const omp_clause_code_name[];
278 /* Clause codes. Do not reorder, as this is used to index into the tables
279 omp_clause_num_ops and omp_clause_code_name. */
282 /* Clause zero is special-cased inside the parser
283 (c_parser_omp_variable_list). */
284 OMP_CLAUSE_ERROR = 0,
286 /* OpenMP clause: private (variable_list). */
289 /* OpenMP clause: shared (variable_list). */
292 /* OpenMP clause: firstprivate (variable_list). */
293 OMP_CLAUSE_FIRSTPRIVATE,
295 /* OpenMP clause: lastprivate (variable_list). */
296 OMP_CLAUSE_LASTPRIVATE,
298 /* OpenMP clause: reduction (operator:variable_list).
299 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
300 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
301 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
303 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
304 placeholder used in OMP_CLAUSE_REDUCTION_MERGE. */
305 OMP_CLAUSE_REDUCTION,
307 /* OpenMP clause: copyin (variable_list). */
310 /* OpenMP clause: copyprivate (variable_list). */
311 OMP_CLAUSE_COPYPRIVATE,
313 /* OpenMP clause: if (scalar-expression). */
316 /* OpenMP clause: num_threads (integer-expression). */
317 OMP_CLAUSE_NUM_THREADS,
319 /* OpenMP clause: schedule. */
322 /* OpenMP clause: nowait. */
325 /* OpenMP clause: ordered. */
328 /* OpenMP clause: default. */
332 /* The definition of tree nodes fills the next several pages. */
334 /* A tree node can represent a data type, a variable, an expression
335 or a statement. Each node has a TREE_CODE which says what kind of
336 thing it represents. Some common codes are:
337 INTEGER_TYPE -- represents a type of integers.
338 ARRAY_TYPE -- represents a type of pointer.
339 VAR_DECL -- represents a declared variable.
340 INTEGER_CST -- represents a constant integer value.
341 PLUS_EXPR -- represents a sum (an expression).
343 As for the contents of a tree node: there are some fields
344 that all nodes share. Each TREE_CODE has various special-purpose
345 fields as well. The fields of a node are never accessed directly,
346 always through accessor macros. */
348 /* Every kind of tree node starts with this structure,
349 so all nodes have these fields.
351 See the accessor macros, defined below, for documentation of the
355 struct tree_common GTY(())
359 union tree_ann_d *ann;
361 ENUM_BITFIELD(tree_code) code : 8;
363 unsigned side_effects_flag : 1;
364 unsigned constant_flag : 1;
365 unsigned addressable_flag : 1;
366 unsigned volatile_flag : 1;
367 unsigned readonly_flag : 1;
368 unsigned unsigned_flag : 1;
369 unsigned asm_written_flag: 1;
370 unsigned nowarning_flag : 1;
372 unsigned used_flag : 1;
373 unsigned nothrow_flag : 1;
374 unsigned static_flag : 1;
375 unsigned public_flag : 1;
376 unsigned private_flag : 1;
377 unsigned protected_flag : 1;
378 unsigned deprecated_flag : 1;
379 unsigned invariant_flag : 1;
381 unsigned lang_flag_0 : 1;
382 unsigned lang_flag_1 : 1;
383 unsigned lang_flag_2 : 1;
384 unsigned lang_flag_3 : 1;
385 unsigned lang_flag_4 : 1;
386 unsigned lang_flag_5 : 1;
387 unsigned lang_flag_6 : 1;
388 unsigned visited : 1;
391 /* The following table lists the uses of each of the above flags and
392 for which types of nodes they are defined. Note that expressions
398 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
399 ..._TYPE, IDENTIFIER_NODE.
400 In a STMT_EXPR, it means we want the result of the enclosed
402 CALL_EXPR_TAILCALL in CALL_EXPR
403 CASE_LOW_SEEN in CASE_LABEL_EXPR
408 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
411 TREE_CONSTANT_OVERFLOW in
412 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
413 TREE_SYMBOL_REFERENCED in
416 TARGET_EXPR, WITH_CLEANUP_EXPR
419 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
420 TYPE_REF_CAN_ALIAS_ALL in
421 POINTER_TYPE, REFERENCE_TYPE
422 CASE_HIGH_SEEN in CASE_LABEL_EXPR
427 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
429 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
432 TYPE_CACHED_VALUES_P in
434 SAVE_EXPR_RESOLVED_P in
436 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
437 OMP_CLAUSE_LASTPRIVATE
438 OMP_CLAUSE_PRIVATE_DEBUG in
445 CALL_EXPR_RETURN_SLOT_OPT in
448 PARM_DECL, RESULT_DECL
453 OMP_PARALLEL_COMBINED in
476 TREE_THIS_VOLATILE in
494 TYPE_SIZES_GIMPLIFIED
503 BIT_FIELD_REF_UNSIGNED in
509 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
515 expressions, IDENTIFIER_NODE
520 CALL_EXPR, FUNCTION_DECL
526 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
533 IDENTIFIER_TRANSPARENT_ALIAS in
538 Used in tree traversals to mark visited nodes.
548 ... any expr or decl node
551 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
552 enum tree_node_structure_enum {
553 #include "treestruct.def"
558 /* Define accessors for the fields that all tree nodes have
559 (though some fields are not used for all kinds of nodes). */
561 /* The tree-code says what kind of node it is.
562 Codes are defined in tree.def. */
563 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
564 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
566 /* When checking is enabled, errors will be generated if a tree node
567 is accessed incorrectly. The macros die with a fatal error. */
568 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
570 #define TREE_CHECK(T, CODE) __extension__ \
571 ({ const tree __t = (T); \
572 if (TREE_CODE (__t) != (CODE)) \
573 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
577 #define TREE_NOT_CHECK(T, CODE) __extension__ \
578 ({ const tree __t = (T); \
579 if (TREE_CODE (__t) == (CODE)) \
580 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
584 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
585 ({ const tree __t = (T); \
586 if (TREE_CODE (__t) != (CODE1) \
587 && TREE_CODE (__t) != (CODE2)) \
588 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
589 (CODE1), (CODE2), 0); \
592 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
593 ({ const tree __t = (T); \
594 if (TREE_CODE (__t) == (CODE1) \
595 || TREE_CODE (__t) == (CODE2)) \
596 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
597 (CODE1), (CODE2), 0); \
600 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
601 ({ const tree __t = (T); \
602 if (TREE_CODE (__t) != (CODE1) \
603 && TREE_CODE (__t) != (CODE2) \
604 && TREE_CODE (__t) != (CODE3)) \
605 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
606 (CODE1), (CODE2), (CODE3), 0); \
609 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
610 ({ const tree __t = (T); \
611 if (TREE_CODE (__t) == (CODE1) \
612 || TREE_CODE (__t) == (CODE2) \
613 || TREE_CODE (__t) == (CODE3)) \
614 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
615 (CODE1), (CODE2), (CODE3), 0); \
618 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
619 ({ const tree __t = (T); \
620 if (TREE_CODE (__t) != (CODE1) \
621 && TREE_CODE (__t) != (CODE2) \
622 && TREE_CODE (__t) != (CODE3) \
623 && TREE_CODE (__t) != (CODE4)) \
624 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
625 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
628 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
629 ({ const tree __t = (T); \
630 if (TREE_CODE (__t) == (CODE1) \
631 || TREE_CODE (__t) == (CODE2) \
632 || TREE_CODE (__t) == (CODE3) \
633 || TREE_CODE (__t) == (CODE4)) \
634 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
635 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
638 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
639 ({ const tree __t = (T); \
640 if (TREE_CODE (__t) != (CODE1) \
641 && TREE_CODE (__t) != (CODE2) \
642 && TREE_CODE (__t) != (CODE3) \
643 && TREE_CODE (__t) != (CODE4) \
644 && TREE_CODE (__t) != (CODE5)) \
645 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
646 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
649 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
650 ({ const tree __t = (T); \
651 if (TREE_CODE (__t) == (CODE1) \
652 || TREE_CODE (__t) == (CODE2) \
653 || TREE_CODE (__t) == (CODE3) \
654 || TREE_CODE (__t) == (CODE4) \
655 || TREE_CODE (__t) == (CODE5)) \
656 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
657 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
660 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
661 ({ const tree __t = (T); \
662 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
663 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
667 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
668 ({ const tree __t = (T); \
669 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
670 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
674 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
675 ({ const tree __t = (T); \
676 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
677 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
681 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
682 ({ const tree __t = (T); \
683 if (TREE_CODE (__t) != OMP_CLAUSE) \
684 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
686 if (__t->omp_clause.code != (CODE)) \
687 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
691 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
692 ({ const tree __t = (T); \
693 if (TREE_CODE (__t) != OMP_CLAUSE) \
694 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
696 if ((int) __t->omp_clause.code < (int) (CODE1) \
697 || (int) __t->omp_clause.code > (int) (CODE2)) \
698 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
699 __FUNCTION__, (CODE1), (CODE2)); \
702 /* These checks have to be special cased. */
703 #define EXPR_CHECK(T) __extension__ \
704 ({ const tree __t = (T); \
705 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
706 if (!IS_EXPR_CODE_CLASS (__c)) \
707 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
711 /* These checks have to be special cased. */
712 #define NON_TYPE_CHECK(T) __extension__ \
713 ({ const tree __t = (T); \
715 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
719 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
720 (*({const tree __t = (T); \
721 const int __i = (I); \
722 if (TREE_CODE (__t) != TREE_VEC) \
723 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
725 if (__i < 0 || __i >= __t->vec.length) \
726 tree_vec_elt_check_failed (__i, __t->vec.length, \
727 __FILE__, __LINE__, __FUNCTION__); \
728 &__t->vec.a[__i]; }))
730 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
731 (*({const tree __t = t; \
732 const int __i = (i); \
733 if (TREE_CODE (__t) != PHI_NODE) \
734 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
736 if (__i < 0 || __i >= __t->phi.capacity) \
737 phi_node_elt_check_failed (__i, __t->phi.num_args, \
738 __FILE__, __LINE__, __FUNCTION__); \
739 &__t->phi.a[__i]; }))
741 #define OMP_CLAUSE_ELT_CHECK(t, i) __extension__ \
742 (*({const tree __t = t; \
743 const int __i = (i); \
744 if (TREE_CODE (__t) != OMP_CLAUSE) \
745 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
747 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
748 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
750 &__t->omp_clause.ops[__i]; }))
752 /* Special checks for TREE_OPERANDs. */
753 #define TREE_OPERAND_CHECK(T, I) __extension__ \
754 (*({const tree __t = EXPR_CHECK (T); \
755 const int __i = (I); \
756 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
757 tree_operand_check_failed (__i, TREE_CODE (__t), \
758 __FILE__, __LINE__, __FUNCTION__); \
759 &__t->exp.operands[__i]; }))
761 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
762 (*({const tree __t = (T); \
763 const int __i = (I); \
764 if (TREE_CODE (__t) != CODE) \
765 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
766 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
767 tree_operand_check_failed (__i, (CODE), \
768 __FILE__, __LINE__, __FUNCTION__); \
769 &__t->exp.operands[__i]; }))
771 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
773 ({const tree __t = (T); \
774 const int __i = (I); \
775 if (TREE_CODE (__t) != (CODE)) \
776 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
777 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
778 tree_operand_check_failed (__i, (CODE), \
779 __FILE__, __LINE__, __FUNCTION__); \
780 &__t->exp.operands[__i]; }))
782 extern void tree_contains_struct_check_failed (const tree,
783 const enum tree_node_structure_enum,
784 const char *, int, const char *)
787 extern void tree_check_failed (const tree, const char *, int, const char *,
788 ...) ATTRIBUTE_NORETURN;
789 extern void tree_not_check_failed (const tree, const char *, int, const char *,
790 ...) ATTRIBUTE_NORETURN;
791 extern void tree_class_check_failed (const tree, const enum tree_code_class,
792 const char *, int, const char *)
794 extern void tree_range_check_failed (const tree, const char *, int,
795 const char *, enum tree_code,
797 extern void tree_not_class_check_failed (const tree,
798 const enum tree_code_class,
799 const char *, int, const char *)
801 extern void tree_vec_elt_check_failed (int, int, const char *,
804 extern void phi_node_elt_check_failed (int, int, const char *,
807 extern void tree_operand_check_failed (int, enum tree_code,
808 const char *, int, const char *)
810 extern void omp_clause_check_failed (const tree, const char *, int,
811 const char *, enum omp_clause_code)
813 extern void omp_clause_operand_check_failed (int, tree, const char *,
816 extern void omp_clause_range_check_failed (const tree, const char *, int,
817 const char *, enum omp_clause_code,
818 enum omp_clause_code)
821 #else /* not ENABLE_TREE_CHECKING, or not gcc */
823 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
824 #define TREE_CHECK(T, CODE) (T)
825 #define TREE_NOT_CHECK(T, CODE) (T)
826 #define TREE_CHECK2(T, CODE1, CODE2) (T)
827 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
828 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
829 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
830 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
831 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
832 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
833 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
834 #define TREE_CLASS_CHECK(T, CODE) (T)
835 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
836 #define EXPR_CHECK(T) (T)
837 #define NON_TYPE_CHECK(T) (T)
838 #define TREE_VEC_ELT_CHECK(T, I) __PAST_END((T)->vec.a, I)
839 #define TREE_OPERAND_CHECK(T, I) __PAST_END((T)->exp.operands, I)
840 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __PAST_END((T)->exp.operands, I)
841 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
842 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
843 #define OMP_CLAUSE_ELT_CHECK(T, i) __PAST_END((T)->omp_clause.ops, i)
844 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
845 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
849 #define TREE_BLOCK(NODE) (EXPR_CHECK (NODE)->exp.block)
851 #include "tree-check.h"
853 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
854 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
855 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
856 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
857 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
858 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
859 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
860 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
861 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
862 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
863 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
865 #define RECORD_OR_UNION_CHECK(T) \
866 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
867 #define NOT_RECORD_OR_UNION_CHECK(T) \
868 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
870 #define NUMERICAL_TYPE_CHECK(T) \
871 TREE_CHECK4 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE)
873 /* In all nodes that are expressions, this is the data type of the expression.
874 In POINTER_TYPE nodes, this is the type that the pointer points to.
875 In ARRAY_TYPE nodes, this is the type of the elements.
876 In VECTOR_TYPE nodes, this is the type of the elements. */
877 #define TREE_TYPE(NODE) ((NODE)->common.type)
879 /* Here is how primitive or already-canonicalized types' hash codes
881 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
883 /* A simple hash function for an arbitrary tree node. This must not be
884 used in hash tables which are saved to a PCH. */
885 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
887 /* Nodes are chained together for many purposes.
888 Types are chained together to record them for being output to the debugger
889 (see the function `chain_type').
890 Decls in the same scope are chained together to record the contents
892 Statement nodes for successive statements used to be chained together.
893 Often lists of things are represented by TREE_LIST nodes that
894 are chained together. */
896 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
898 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
899 that don't change the machine mode. */
901 #define STRIP_NOPS(EXP) \
902 while ((TREE_CODE (EXP) == NOP_EXPR \
903 || TREE_CODE (EXP) == CONVERT_EXPR \
904 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
905 && TREE_OPERAND (EXP, 0) != error_mark_node \
906 && (TYPE_MODE (TREE_TYPE (EXP)) \
907 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
908 (EXP) = TREE_OPERAND (EXP, 0)
910 /* Like STRIP_NOPS, but don't let the signedness change either. */
912 #define STRIP_SIGN_NOPS(EXP) \
913 while ((TREE_CODE (EXP) == NOP_EXPR \
914 || TREE_CODE (EXP) == CONVERT_EXPR \
915 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
916 && TREE_OPERAND (EXP, 0) != error_mark_node \
917 && (TYPE_MODE (TREE_TYPE (EXP)) \
918 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
919 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
920 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
921 (EXP) = TREE_OPERAND (EXP, 0)
923 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
925 #define STRIP_TYPE_NOPS(EXP) \
926 while ((TREE_CODE (EXP) == NOP_EXPR \
927 || TREE_CODE (EXP) == CONVERT_EXPR \
928 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
929 && TREE_OPERAND (EXP, 0) != error_mark_node \
930 && (TREE_TYPE (EXP) \
931 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
932 (EXP) = TREE_OPERAND (EXP, 0)
934 /* Remove unnecessary type conversions according to
935 tree_ssa_useless_type_conversion. */
937 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
938 while (tree_ssa_useless_type_conversion (EXP)) \
939 EXP = TREE_OPERAND (EXP, 0)
941 /* Nonzero if TYPE represents an integral type. Note that we do not
942 include COMPLEX types here. Keep these checks in ascending code
945 #define INTEGRAL_TYPE_P(TYPE) \
946 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
947 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
948 || TREE_CODE (TYPE) == INTEGER_TYPE)
950 /* Nonzero if TYPE represents a scalar floating-point type. */
952 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
954 /* Nonzero if TYPE represents a complex floating-point type. */
956 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
957 (TREE_CODE (TYPE) == COMPLEX_TYPE \
958 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
960 /* Nonzero if TYPE represents a vector floating-point type. */
962 #define VECTOR_FLOAT_TYPE_P(TYPE) \
963 (TREE_CODE (TYPE) == VECTOR_TYPE \
964 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
966 /* Nonzero if TYPE represents a floating-point type, including complex
967 and vector floating-point types. The vector and complex check does
968 not use the previous two macros to enable early folding. */
970 #define FLOAT_TYPE_P(TYPE) \
971 (SCALAR_FLOAT_TYPE_P (TYPE) \
972 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
973 || TREE_CODE (TYPE) == VECTOR_TYPE) \
974 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
976 /* Nonzero if TYPE represents a decimal floating-point type. */
977 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
978 (SCALAR_FLOAT_TYPE_P (TYPE) \
979 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
981 /* Nonzero if TYPE represents an aggregate (multi-component) type.
982 Keep these checks in ascending code order. */
984 #define AGGREGATE_TYPE_P(TYPE) \
985 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
986 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
988 /* Nonzero if TYPE represents a pointer or reference type.
989 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
990 ascending code order. */
992 #define POINTER_TYPE_P(TYPE) \
993 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
995 /* Nonzero if this type is a complete type. */
996 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
998 /* Nonzero if this type is the (possibly qualified) void type. */
999 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1001 /* Nonzero if this type is complete or is cv void. */
1002 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1003 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1005 /* Nonzero if this type is complete or is an array with unspecified bound. */
1006 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1007 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1010 /* Define many boolean fields that all tree nodes have. */
1012 /* In VAR_DECL nodes, nonzero means address of this is needed.
1013 So it cannot be in a register.
1014 In a FUNCTION_DECL, nonzero means its address is needed.
1015 So it must be compiled even if it is an inline function.
1016 In a FIELD_DECL node, it means that the programmer is permitted to
1017 construct the address of this field. This is used for aliasing
1018 purposes: see record_component_aliases.
1019 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1020 In LABEL_DECL nodes, it means a goto for this label has been seen
1021 from a place outside all binding contours that restore stack levels.
1022 In ..._TYPE nodes, it means that objects of this type must
1023 be fully addressable. This means that pieces of this
1024 object cannot go into register parameters, for example.
1025 In IDENTIFIER_NODEs, this means that some extern decl for this name
1026 had its address taken. That matters for inline functions. */
1027 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
1029 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1030 exit of a function. Calls for which this is true are candidates for tail
1031 call optimizations. */
1032 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
1034 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1035 CASE_LOW operand has been processed. */
1036 #define CASE_LOW_SEEN(NODE) \
1037 (CASE_LABEL_EXPR_CHECK (NODE)->common.addressable_flag)
1039 /* In a VAR_DECL, nonzero means allocate static storage.
1040 In a FUNCTION_DECL, nonzero if function has been defined.
1041 In a CONSTRUCTOR, nonzero means allocate static storage.
1043 ??? This is also used in lots of other nodes in unclear ways which
1044 should be cleaned up some day. */
1045 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
1047 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
1048 should only be executed if an exception is thrown, not on normal exit
1050 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
1052 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1053 CASE_HIGH operand has been processed. */
1054 #define CASE_HIGH_SEEN(NODE) \
1055 (CASE_LABEL_EXPR_CHECK (NODE)->common.static_flag)
1057 /* In an expr node (usually a conversion) this means the node was made
1058 implicitly and should not lead to any sort of warning. In a decl node,
1059 warnings concerning the decl should be suppressed. This is used at
1060 least for used-before-set warnings, and it set after one warning is
1062 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
1064 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
1065 there was an overflow in folding. This is distinct from
1066 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
1067 occur in constant expressions. */
1068 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
1070 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1071 this string as an argument. */
1072 #define TREE_SYMBOL_REFERENCED(NODE) \
1073 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
1075 /* Nonzero in a pointer or reference type means the data pointed to
1076 by this type can alias anything. */
1077 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1078 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
1080 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1081 there was an overflow in folding, and no warning has been issued
1082 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
1083 but not vice versa. */
1085 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->common.public_flag)
1087 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1089 #define TREE_OVERFLOW_P(EXPR) \
1090 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1092 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1093 nonzero means name is to be accessible from outside this module.
1094 In an IDENTIFIER_NODE, nonzero means an external declaration
1095 accessible from outside this module was previously seen
1096 for this name in an inner scope. */
1097 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
1099 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1100 of cached values, or is something else. */
1101 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->common.public_flag)
1103 /* In a SAVE_EXPR, indicates that the original expression has already
1104 been substituted with a VAR_DECL that contains the value. */
1105 #define SAVE_EXPR_RESOLVED_P(NODE) \
1106 (TREE_CHECK (NODE, SAVE_EXPR)->common.public_flag)
1108 /* In any expression, decl, or constant, nonzero means it has side effects or
1109 reevaluation of the whole expression could produce a different value.
1110 This is set if any subexpression is a function call, a side effect or a
1111 reference to a volatile variable. In a ..._DECL, this is set only if the
1112 declaration said `volatile'. This will never be set for a constant. */
1113 #define TREE_SIDE_EFFECTS(NODE) \
1114 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
1116 /* In a LABEL_DECL, nonzero means this label had its address taken
1117 and therefore can never be deleted and is a jump target for
1119 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
1121 /* Nonzero means this expression is volatile in the C sense:
1122 its address should be of type `volatile WHATEVER *'.
1123 In other words, the declared item is volatile qualified.
1124 This is used in _DECL nodes and _REF nodes.
1125 On a FUNCTION_DECL node, this means the function does not
1126 return normally. This is the same effect as setting
1127 the attribute noreturn on the function in C.
1129 In a ..._TYPE node, means this type is volatile-qualified.
1130 But use TYPE_VOLATILE instead of this macro when the node is a type,
1131 because eventually we may make that a different bit.
1133 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1134 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
1136 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1137 accessing the memory pointed to won't generate a trap. However,
1138 this only applies to an object when used appropriately: it doesn't
1139 mean that writing a READONLY mem won't trap. Similarly for
1140 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1142 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1143 (or slice of the array) always belongs to the range of the array.
1144 I.e. that the access will not trap, provided that the access to
1145 the base to the array will not trap. */
1146 #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag)
1148 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1149 nonzero means it may not be the lhs of an assignment. */
1150 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
1152 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1153 #define TREE_READONLY_DECL_P(NODE)\
1154 (DECL_P (NODE) && TREE_READONLY (NODE))
1156 /* Value of expression is constant. Always on in all ..._CST nodes. May
1157 also appear in an expression or decl where the value is constant. */
1158 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
1160 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1161 #define TYPE_SIZES_GIMPLIFIED(NODE) (TYPE_CHECK (NODE)->common.constant_flag)
1163 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1164 #define DECL_UNSIGNED(NODE) (DECL_COMMON_CHECK (NODE)->common.unsigned_flag)
1166 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1167 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1168 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
1170 /* In integral and pointer types, means an unsigned type. */
1171 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
1173 /* Nonzero in a VAR_DECL means assembler code has been written.
1174 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1175 This is interesting in an inline function, since it might not need
1176 to be compiled separately.
1177 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1178 if the sdb debugging info for the type has been written.
1179 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1180 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1182 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
1184 /* Nonzero in a _DECL if the name is used in its scope.
1185 Nonzero in an expr node means inhibit warning if value is unused.
1186 In IDENTIFIER_NODEs, this means that some extern decl for this name
1188 In a BLOCK, this means that the block contains variables that are used. */
1189 #define TREE_USED(NODE) ((NODE)->common.used_flag)
1191 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1192 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1193 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
1195 /* In a CALL_EXPR, means that it's safe to use the target of the call
1196 expansion as the return slot for a call that returns in memory. */
1197 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->common.private_flag)
1199 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1200 reference (and the TREE_TYPE is a pointer to the true type). */
1201 #define DECL_BY_REFERENCE(NODE) (DECL_COMMON_CHECK (NODE)->common.private_flag)
1203 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1204 thunked-to function. */
1205 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->common.protected_flag)
1207 /* In a type, nonzero means that all objects of the type are guaranteed by the
1208 language or front-end to be properly aligned, so we can indicate that a MEM
1209 of this type is aligned at least to the alignment of the type, even if it
1210 doesn't appear that it is. We see this, for example, in object-oriented
1211 languages where a tag field may show this is an object of a more-aligned
1212 variant of the more generic type.
1214 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1216 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
1218 /* Used in classes in C++. */
1219 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
1220 /* Used in classes in C++.
1221 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1222 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
1224 /* Nonzero in a _DECL if the use of the name is defined as a
1225 deprecated feature by __attribute__((deprecated)). */
1226 #define TREE_DEPRECATED(NODE) \
1227 ((NODE)->common.deprecated_flag)
1229 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1230 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1231 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1232 (IDENTIFIER_NODE_CHECK (NODE)->common.deprecated_flag)
1234 /* Value of expression is function invariant. A strict subset of
1235 TREE_CONSTANT, such an expression is constant over any one function
1236 invocation, though not across different invocations. May appear in
1237 any expression node. */
1238 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
1240 /* These flags are available for each language front end to use internally. */
1241 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
1242 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
1243 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
1244 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
1245 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
1246 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
1247 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
1249 /* Define additional fields and accessors for nodes representing constants. */
1251 /* In an INTEGER_CST node. These two together make a 2-word integer.
1252 If the data type is signed, the value is sign-extended to 2 words
1253 even though not all of them may really be in use.
1254 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1255 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1256 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1257 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1259 #define INT_CST_LT(A, B) \
1260 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1261 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1262 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1264 #define INT_CST_LT_UNSIGNED(A, B) \
1265 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1266 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1267 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1268 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1269 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1271 struct tree_int_cst GTY(())
1273 struct tree_common common;
1277 /* In a REAL_CST node. struct real_value is an opaque entity, with
1278 manipulators defined in real.h. We don't want tree.h depending on
1279 real.h and transitively on tm.h. */
1282 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1283 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1285 struct tree_real_cst GTY(())
1287 struct tree_common common;
1288 struct real_value * real_cst_ptr;
1291 /* In a STRING_CST */
1292 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1293 #define TREE_STRING_POINTER(NODE) \
1294 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1296 struct tree_string GTY(())
1298 struct tree_common common;
1303 /* In a COMPLEX_CST node. */
1304 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1305 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1307 struct tree_complex GTY(())
1309 struct tree_common common;
1314 /* In a VECTOR_CST node. */
1315 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1317 struct tree_vector GTY(())
1319 struct tree_common common;
1325 /* Define fields and accessors for some special-purpose tree nodes. */
1327 #define IDENTIFIER_LENGTH(NODE) \
1328 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1329 #define IDENTIFIER_POINTER(NODE) \
1330 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1331 #define IDENTIFIER_HASH_VALUE(NODE) \
1332 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1334 /* Translate a hash table identifier pointer to a tree_identifier
1335 pointer, and vice versa. */
1337 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1338 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1339 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1341 struct tree_identifier GTY(())
1343 struct tree_common common;
1344 struct ht_identifier id;
1347 /* In a TREE_LIST node. */
1348 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1349 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1351 struct tree_list GTY(())
1353 struct tree_common common;
1358 /* In a TREE_VEC node. */
1359 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1360 #define TREE_VEC_END(NODE) \
1361 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1363 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1365 struct tree_vec GTY(())
1367 struct tree_common common;
1369 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1372 /* In a CONSTRUCTOR node. */
1373 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1375 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1376 value of each element (stored within VAL). IX must be a scratch variable
1377 of unsigned integer type. */
1378 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1379 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1381 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1385 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1386 the value of each element (stored within VAL) and its index (stored
1387 within INDEX). IX must be a scratch variable of unsigned integer type. */
1388 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1389 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1391 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1392 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1396 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1397 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1399 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1400 _ce___->index = INDEX; \
1401 _ce___->value = VALUE; \
1404 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1405 element. INDEX can optionally design the position of VALUE: in arrays,
1406 it is the index where VALUE has to be placed; in structures, it is the
1407 FIELD_DECL of the member. */
1408 typedef struct constructor_elt_d GTY(())
1414 DEF_VEC_O(constructor_elt);
1415 DEF_VEC_ALLOC_O(constructor_elt,gc);
1417 struct tree_constructor GTY(())
1419 struct tree_common common;
1420 VEC(constructor_elt,gc) *elts;
1423 /* Define fields and accessors for some nodes that represent expressions. */
1425 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1426 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1427 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1428 && integer_zerop (TREE_OPERAND (NODE, 0)))
1430 /* In ordinary expression nodes. */
1431 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1432 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1434 /* In a LOOP_EXPR node. */
1435 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1437 #ifdef USE_MAPPED_LOCATION
1438 /* The source location of this expression. Non-tree_exp nodes such as
1439 decls and constants can be shared among multiple locations, so
1441 #define EXPR_LOCATION(NODE) \
1442 (EXPR_P (NODE) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1443 #define SET_EXPR_LOCATION(NODE, FROM) \
1444 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1445 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1446 /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */
1447 #define EXPR_LOCUS(NODE) \
1448 (EXPR_P (NODE) ? &(NODE)->exp.locus : (location_t *)NULL)
1449 #define SET_EXPR_LOCUS(NODE, FROM) \
1450 do { source_location *loc_tmp = FROM; \
1451 EXPR_CHECK (NODE)->exp.locus \
1452 = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0)
1453 #define EXPR_FILENAME(NODE) \
1454 LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus)
1455 #define EXPR_LINENO(NODE) \
1456 LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1458 /* The source location of this expression. Non-tree_exp nodes such as
1459 decls and constants can be shared among multiple locations, so
1461 #define EXPR_LOCUS(NODE) \
1462 (EXPR_P (NODE) ? (NODE)->exp.locus : (location_t *)NULL)
1463 #define SET_EXPR_LOCUS(NODE, FROM) \
1464 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1465 #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM)
1466 #define EXPR_FILENAME(NODE) \
1467 (EXPR_CHECK (NODE)->exp.locus->file)
1468 #define EXPR_LINENO(NODE) \
1469 (EXPR_CHECK (NODE)->exp.locus->line)
1470 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1471 #define EXPR_LOCATION(NODE) \
1472 (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION)
1475 /* In a TARGET_EXPR node. */
1476 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1477 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1478 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1480 /* DECL_EXPR accessor. This gives access to the DECL associated with
1481 the given declaration statement. */
1482 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1484 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1486 /* SWITCH_EXPR accessors. These give access to the condition, body and
1487 original condition type (before any compiler conversions)
1488 of the switch statement, respectively. */
1489 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1490 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1491 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1493 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1494 of a case label, respectively. */
1495 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1496 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1497 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1499 /* The operands of a TARGET_MEM_REF. */
1500 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1501 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1502 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1503 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1504 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1505 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1506 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1508 /* The operands of a BIND_EXPR. */
1509 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1510 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1511 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1513 /* GOTO_EXPR accessor. This gives access to the label associated with
1514 a goto statement. */
1515 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1517 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1518 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1519 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1521 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1522 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1523 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1524 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1525 /* Nonzero if we want to create an ASM_INPUT instead of an
1526 ASM_OPERAND with no operands. */
1527 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1528 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1530 /* COND_EXPR accessors. */
1531 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1532 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1533 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1535 /* LABEL_EXPR accessor. This gives access to the label associated with
1536 the given label expression. */
1537 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1539 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1540 accessors for SSA operands. */
1542 /* CATCH_EXPR accessors. */
1543 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1544 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1546 /* EH_FILTER_EXPR accessors. */
1547 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1548 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1549 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1551 /* OBJ_TYPE_REF accessors. */
1552 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1553 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1554 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1556 /* ASSERT_EXPR accessors. */
1557 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1558 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1560 /* OpenMP directive and clause accessors. */
1562 #define OMP_BODY(NODE) \
1563 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1564 #define OMP_CLAUSES(NODE) \
1565 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1567 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1568 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1569 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1570 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1572 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1573 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1574 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1575 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1576 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1577 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1579 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1580 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1582 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1584 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1585 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1587 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1589 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1591 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1592 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1594 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1595 #define OMP_CLAUSE_DECL(NODE) \
1596 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1597 OMP_CLAUSE_PRIVATE, \
1598 OMP_CLAUSE_COPYPRIVATE), 0)
1600 /* True on an OMP_SECTION statement that was the last lexical member.
1601 This status is meaningful in the implementation of lastprivate. */
1602 #define OMP_SECTION_LAST(NODE) \
1603 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1605 /* True on an OMP_RETURN statement if the return does not require a
1606 thread synchronization via some sort of barrier. The exact barrier
1607 that would otherwise be emitted is dependent on the OMP statement
1608 with which this return is associated. */
1609 #define OMP_RETURN_NOWAIT(NODE) \
1610 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1612 /* True on an OMP_PARALLEL statement if it represents an explicit
1613 combined parallel work-sharing constructs. */
1614 #define OMP_PARALLEL_COMBINED(NODE) \
1615 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1617 /* True on a PRIVATE clause if its decl is kept around for debugging
1618 information only and its DECL_VALUE_EXPR is supposed to point
1619 to what it has been remapped to. */
1620 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1621 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1623 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1624 decl is present in the chain. */
1625 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1626 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1628 #define OMP_CLAUSE_IF_EXPR(NODE) \
1629 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1630 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1631 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1632 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1633 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1635 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1636 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1637 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1638 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1639 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1640 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1641 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1642 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1644 enum omp_clause_schedule_kind
1646 OMP_CLAUSE_SCHEDULE_STATIC,
1647 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1648 OMP_CLAUSE_SCHEDULE_GUIDED,
1649 OMP_CLAUSE_SCHEDULE_RUNTIME
1652 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1653 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1655 enum omp_clause_default_kind
1657 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1658 OMP_CLAUSE_DEFAULT_SHARED,
1659 OMP_CLAUSE_DEFAULT_NONE,
1660 OMP_CLAUSE_DEFAULT_PRIVATE
1663 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1664 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1666 struct tree_exp GTY(())
1668 struct tree_common common;
1672 tree GTY ((special ("tree_exp"),
1673 desc ("TREE_CODE ((tree) &%0)")))
1677 /* SSA_NAME accessors. */
1679 /* Returns the variable being referenced. Once released, this is the
1680 only field that can be relied upon. */
1681 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1683 /* Returns the statement which defines this reference. Note that
1684 we use the same field when chaining SSA_NAME nodes together on
1685 the SSA_NAME freelist. */
1686 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1688 /* Returns the SSA version number of this SSA name. Note that in
1689 tree SSA, version numbers are not per variable and may be recycled. */
1690 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1692 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1693 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1695 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1696 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1698 /* Nonzero if this SSA_NAME expression is currently on the free list of
1699 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1700 has no meaning for an SSA_NAME. */
1701 #define SSA_NAME_IN_FREE_LIST(NODE) \
1702 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1704 /* Attributes for SSA_NAMEs for pointer-type variables. */
1705 #define SSA_NAME_PTR_INFO(N) \
1706 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1708 /* Get the value of this SSA_NAME, if available. */
1709 #define SSA_NAME_VALUE(N) \
1710 SSA_NAME_CHECK (N)->ssa_name.value_handle
1712 #ifndef _TREE_FLOW_H
1713 struct ptr_info_def;
1718 /* Immediate use linking structure. This structure is used for maintaining
1719 a doubly linked list of uses of an SSA_NAME. */
1720 typedef struct ssa_use_operand_d GTY(())
1722 struct ssa_use_operand_d* GTY((skip(""))) prev;
1723 struct ssa_use_operand_d* GTY((skip(""))) next;
1724 tree GTY((skip(""))) stmt;
1725 tree *GTY((skip(""))) use;
1726 } ssa_use_operand_t;
1728 /* Return the immediate_use information for an SSA_NAME. */
1729 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1731 struct tree_ssa_name GTY(())
1733 struct tree_common common;
1735 /* _DECL wrapped by this SSA name. */
1738 /* SSA version number. */
1739 unsigned int version;
1741 /* Pointer attributes used for alias analysis. */
1742 struct ptr_info_def *ptr_info;
1744 /* Value for SSA name used by various passes.
1746 Right now only invariants are allowed to persist beyond a pass in
1747 this field; in the future we will allow VALUE_HANDLEs to persist
1751 /* Immediate uses list for this SSA_NAME. */
1752 struct ssa_use_operand_d imm_uses;
1755 /* In a PHI_NODE node. */
1757 /* These 2 macros should be considered off limits for use by developers. If
1758 you wish to access the use or def fields of a PHI_NODE in the SSA
1759 optimizers, use the accessor macros found in tree-ssa-operands.h.
1760 These two macros are to be used only by those accessor macros, and other
1761 select places where we *absolutely* must take the address of the tree. */
1763 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1764 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1766 /* PHI_NODEs for each basic block are chained together in a single linked
1767 list. The head of the list is linked from the block annotation, and
1768 the link to the next PHI is in PHI_CHAIN. */
1769 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1771 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1772 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1773 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1774 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1775 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1776 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1778 struct phi_arg_d GTY(())
1780 /* imm_use MUST be the first element in struct because we do some
1781 pointer arithmetic with it. See phi_arg_index_from_use. */
1782 struct ssa_use_operand_d imm_use;
1786 struct tree_phi_node GTY(())
1788 struct tree_common common;
1793 /* Basic block to that the phi node belongs. */
1794 struct basic_block_def *bb;
1796 /* Arguments of the PHI node. These are maintained in the same
1797 order as predecessor edge vector BB->PREDS. */
1798 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1801 #define OMP_CLAUSE_CODE(NODE) \
1802 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1804 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1805 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1807 #define OMP_CLAUSE_CODE(NODE) \
1808 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1810 #define OMP_CLAUSE_OPERAND(NODE, I) \
1811 OMP_CLAUSE_ELT_CHECK (NODE, I)
1813 struct tree_omp_clause GTY(())
1815 struct tree_common common;
1816 enum omp_clause_code code;
1817 union omp_clause_subcode {
1818 enum omp_clause_default_kind default_kind;
1819 enum omp_clause_schedule_kind schedule_kind;
1820 enum tree_code reduction_code;
1821 } GTY ((skip)) subcode;
1822 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1826 struct varray_head_tag;
1828 /* In a BLOCK node. */
1829 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1830 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1831 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1832 /* Note: when changing this, make sure to find the places
1833 that use chainon or nreverse. */
1834 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1835 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1836 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1838 /* Nonzero means that this block is prepared to handle exceptions
1839 listed in the BLOCK_VARS slot. */
1840 #define BLOCK_HANDLER_BLOCK(NODE) \
1841 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1843 /* An index number for this block. These values are not guaranteed to
1844 be unique across functions -- whether or not they are depends on
1845 the debugging output format in use. */
1846 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1848 /* If block reordering splits a lexical block into discontiguous
1849 address ranges, we'll make a copy of the original block.
1851 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1852 In that case, we have one source block that has been replicated
1853 (through inlining or unrolling) into many logical blocks, and that
1854 these logical blocks have different physical variables in them.
1856 In this case, we have one logical block split into several
1857 non-contiguous address ranges. Most debug formats can't actually
1858 represent this idea directly, so we fake it by creating multiple
1859 logical blocks with the same variables in them. However, for those
1860 that do support non-contiguous regions, these allow the original
1861 logical block to be reconstructed, along with the set of address
1864 One of the logical block fragments is arbitrarily chosen to be
1865 the ORIGIN. The other fragments will point to the origin via
1866 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1867 be null. The list of fragments will be chained through
1868 BLOCK_FRAGMENT_CHAIN from the origin. */
1870 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1871 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1873 /* For an inlined function, this gives the location where it was called
1874 from. This is only set in the top level block, which corresponds to the
1875 inlined function scope. This is used in the debug output routines. */
1877 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1879 struct tree_block GTY(())
1881 struct tree_common common;
1883 unsigned handler_block_flag : 1;
1884 unsigned abstract_flag : 1;
1885 unsigned block_num : 30;
1890 tree abstract_origin;
1891 tree fragment_origin;
1892 tree fragment_chain;
1896 /* Define fields and accessors for nodes representing data types. */
1898 /* See tree.def for documentation of the use of these fields.
1899 Look at the documentation of the various ..._TYPE tree codes.
1901 Note that the type.values, type.minval, and type.maxval fields are
1902 overloaded and used for different macros in different kinds of types.
1903 Each macro must check to ensure the tree node is of the proper kind of
1904 type. Note also that some of the front-ends also overload these fields,
1905 so they must be checked as well. */
1907 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1908 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1909 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1910 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1911 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1912 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
1913 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
1914 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
1915 #define TYPE_ORIG_SIZE_TYPE(NODE) \
1916 (INTEGER_TYPE_CHECK (NODE)->type.values \
1917 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
1918 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
1919 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
1920 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1921 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1922 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1923 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1924 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1925 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1926 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1927 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1928 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1929 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1930 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1931 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1932 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1933 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1934 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1935 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1936 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1937 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1939 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1940 in the debugging output. We use this to describe a vector as a
1941 structure containing an array. */
1942 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1944 /* For record and union types, information about this type, as a base type
1946 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1948 /* For non record and union types, used in a language-dependent way. */
1949 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1951 /* The (language-specific) typed-based alias set for this type.
1952 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1953 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1954 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1955 type can alias objects of any type. */
1956 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1958 /* Nonzero iff the typed-based alias set for this type has been
1960 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1962 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1964 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1966 /* The alignment necessary for objects of this type.
1967 The value is an int, measured in bits. */
1968 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1970 /* 1 if the alignment for this type was requested by "aligned" attribute,
1971 0 if it is the default for this type. */
1972 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1974 /* The alignment for NODE, in bytes. */
1975 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1977 /* If your language allows you to declare types, and you want debug info
1978 for them, then you need to generate corresponding TYPE_DECL nodes.
1979 These "stub" TYPE_DECL nodes have no name, and simply point at the
1980 type node. You then set the TYPE_STUB_DECL field of the type node
1981 to point back at the TYPE_DECL node. This allows the debug routines
1982 to know that the two nodes represent the same type, so that we only
1983 get one debug info record for them. */
1984 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1986 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1987 has BLKmode only because it lacks the alignment requirement for
1989 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1991 /* In an INTEGER_TYPE, it means the type represents a size. We use
1992 this both for validity checking and to permit optimizations that
1993 are unsafe for other types. Note that the C `size_t' type should
1994 *not* have this flag set. The `size_t' type is simply a typedef
1995 for an ordinary integer type that happens to be the type of an
1996 expression returned by `sizeof'; `size_t' has no special
1997 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1998 always actual sizes. */
1999 #define TYPE_IS_SIZETYPE(NODE) \
2000 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2002 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
2003 pointer depressed. */
2004 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
2005 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2007 /* Nonzero in a type considered volatile as a whole. */
2008 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
2010 /* Means this type is const-qualified. */
2011 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
2013 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2015 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2017 /* There is a TYPE_QUAL value for each type qualifier. They can be
2018 combined by bitwise-or to form the complete set of qualifiers for a
2021 #define TYPE_UNQUALIFIED 0x0
2022 #define TYPE_QUAL_CONST 0x1
2023 #define TYPE_QUAL_VOLATILE 0x2
2024 #define TYPE_QUAL_RESTRICT 0x4
2026 /* The set of type qualifiers for this type. */
2027 #define TYPE_QUALS(NODE) \
2028 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2029 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2030 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2032 /* These flags are available for each language front end to use internally. */
2033 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2034 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2035 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2036 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2037 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2038 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2039 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2041 /* Used to keep track of visited nodes in tree traversals. This is set to
2042 0 by copy_node and make_node. */
2043 #define TREE_VISITED(NODE) ((NODE)->common.visited)
2045 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2046 that distinguish string from array of char).
2047 If set in a INTEGER_TYPE, indicates a character type. */
2048 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2050 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2051 object of the given ARRAY_TYPE. This allows temporaries to be
2053 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2054 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2056 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2057 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2058 (((unsigned HOST_WIDE_INT) 1) \
2059 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2061 /* Set precision to n when we have 2^n sub-parts of the vector. */
2062 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2063 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2065 /* Indicates that objects of this type must be initialized by calling a
2066 function when they are created. */
2067 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2068 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2070 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2071 the same way that the first union alternative would be passed. */
2072 #define TYPE_TRANSPARENT_UNION(NODE) \
2073 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2075 /* For an ARRAY_TYPE, indicates that it is not permitted to
2076 take the address of a component of the type. */
2077 #define TYPE_NONALIASED_COMPONENT(NODE) \
2078 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2080 /* Indicated that objects of this type should be laid out in as
2081 compact a way as possible. */
2082 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2084 /* Used by type_contains_placeholder_p to avoid recomputation.
2085 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2086 this field directly. */
2087 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2088 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2092 struct tree_type GTY(())
2094 struct tree_common common;
2101 unsigned int precision : 9;
2102 ENUM_BITFIELD(machine_mode) mode : 7;
2104 unsigned string_flag : 1;
2105 unsigned no_force_blk_flag : 1;
2106 unsigned needs_constructing_flag : 1;
2107 unsigned transparent_union_flag : 1;
2108 unsigned packed_flag : 1;
2109 unsigned restrict_flag : 1;
2110 unsigned contains_placeholder_bits : 2;
2112 unsigned lang_flag_0 : 1;
2113 unsigned lang_flag_1 : 1;
2114 unsigned lang_flag_2 : 1;
2115 unsigned lang_flag_3 : 1;
2116 unsigned lang_flag_4 : 1;
2117 unsigned lang_flag_5 : 1;
2118 unsigned lang_flag_6 : 1;
2119 unsigned user_align : 1;
2124 union tree_type_symtab {
2125 int GTY ((tag ("0"))) address;
2126 char * GTY ((tag ("1"))) pointer;
2127 struct die_struct * GTY ((tag ("2"))) die;
2128 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2129 descbits ("2"))) symtab;
2137 HOST_WIDE_INT alias_set;
2138 /* Points to a structure whose details depend on the language in use. */
2139 struct lang_type *lang_specific;
2142 /* Define accessor macros for information about type inheritance
2145 A "basetype" means a particular usage of a data type for inheritance
2146 in another type. Each such basetype usage has its own "binfo"
2147 object to describe it. The binfo object is a TREE_VEC node.
2149 Inheritance is represented by the binfo nodes allocated for a
2150 given type. For example, given types C and D, such that D is
2151 inherited by C, 3 binfo nodes will be allocated: one for describing
2152 the binfo properties of C, similarly one for D, and one for
2153 describing the binfo properties of D as a base type for C.
2154 Thus, given a pointer to class C, one can get a pointer to the binfo
2155 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2157 /* BINFO specific flags. */
2159 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2160 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag)
2162 /* Flags for language dependent use. */
2163 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2164 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2165 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2166 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2167 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2168 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2169 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2171 /* The actual data type node being inherited in this basetype. */
2172 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2174 /* The offset where this basetype appears in its containing type.
2175 BINFO_OFFSET slot holds the offset (in bytes)
2176 from the base of the complete object to the base of the part of the
2177 object that is allocated on behalf of this `type'.
2178 This is always 0 except when there is multiple inheritance. */
2180 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2181 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2183 /* The virtual function table belonging to this basetype. Virtual
2184 function tables provide a mechanism for run-time method dispatching.
2185 The entries of a virtual function table are language-dependent. */
2187 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2189 /* The virtual functions in the virtual function table. This is
2190 a TREE_LIST that is used as an initial approximation for building
2191 a virtual function table for this basetype. */
2192 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2194 /* A vector of binfos for the direct basetypes inherited by this
2197 If this basetype describes type D as inherited in C, and if the
2198 basetypes of D are E and F, then this vector contains binfos for
2199 inheritance of E and F by C. */
2200 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2202 /* The number of basetypes for NODE. */
2203 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2205 /* Accessor macro to get to the Nth base binfo of this binfo. */
2206 #define BINFO_BASE_BINFO(NODE,N) \
2207 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2208 #define BINFO_BASE_ITERATE(NODE,N,B) \
2209 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2210 #define BINFO_BASE_APPEND(NODE,T) \
2211 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2213 /* For a BINFO record describing a virtual base class, i.e., one where
2214 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2215 base. The actual contents are language-dependent. In the C++
2216 front-end this field is an INTEGER_CST giving an offset into the
2217 vtable where the offset to the virtual base can be found. */
2218 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2220 /* Indicates the accesses this binfo has to its bases. The values are
2221 access_public_node, access_protected_node or access_private_node.
2222 If this array is not present, public access is implied. */
2223 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2225 #define BINFO_BASE_ACCESS(NODE,N) \
2226 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2227 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2228 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2230 /* The index in the VTT where this subobject's sub-VTT can be found.
2231 NULL_TREE if there is no sub-VTT. */
2232 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2234 /* The index in the VTT where the vptr for this subobject can be
2235 found. NULL_TREE if there is no secondary vptr in the VTT. */
2236 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2238 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2239 inheriting this base for non-virtual bases. For virtual bases it
2240 points either to the binfo for which this is a primary binfo, or to
2241 the binfo of the most derived type. */
2242 #define BINFO_INHERITANCE_CHAIN(NODE) \
2243 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2245 struct tree_binfo GTY (())
2247 struct tree_common common;
2253 VEC(tree,gc) *base_accesses;
2259 VEC(tree,none) base_binfos;
2263 /* Define fields and accessors for nodes representing declared names. */
2265 /* Nonzero if DECL represents a variable for the SSA passes. */
2266 #define SSA_VAR_P(DECL) \
2267 (TREE_CODE (DECL) == VAR_DECL \
2268 || TREE_CODE (DECL) == PARM_DECL \
2269 || TREE_CODE (DECL) == RESULT_DECL \
2271 || (TREE_CODE (DECL) == SSA_NAME \
2272 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2273 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2274 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2275 || MTAG_P (SSA_NAME_VAR (DECL)))))
2280 /* Enumerate visibility settings. */
2281 #ifndef SYMBOL_VISIBILITY_DEFINED
2282 #define SYMBOL_VISIBILITY_DEFINED
2283 enum symbol_visibility
2286 VISIBILITY_PROTECTED,
2295 /* This is the name of the object as written by the user.
2296 It is an IDENTIFIER_NODE. */
2297 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2299 /* Every ..._DECL node gets a unique number. */
2300 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2302 /* These two fields describe where in the source code the declaration
2303 was. If the declaration appears in several places (as for a C
2304 function that is declared first and then defined later), this
2305 information should refer to the definition. */
2306 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2307 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2308 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2309 #ifdef USE_MAPPED_LOCATION
2310 #define DECL_IS_BUILTIN(DECL) \
2311 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2313 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2316 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2317 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2318 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2319 points to either the FUNCTION_DECL for the containing function,
2320 the RECORD_TYPE or UNION_TYPE for the containing type, or
2321 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2323 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2324 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2325 struct tree_decl_minimal GTY(())
2327 struct tree_common common;
2334 /* When computing aliasing information, we represent the memory pointed-to
2335 by pointers with artificial variables called "memory tags" (MT). There
2336 are two kinds of tags, namely symbol and name:
2338 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2339 represent all the pointed-to locations and variables pointed-to by
2340 the same pointer symbol. Usually, this set is computed using
2341 type-based analysis (i.e., alias set classes), but this may not
2344 Name tags (NMT) are used in flow-sensitive points-to alias
2345 analysis, they represent the variables and memory locations
2346 pointed-to by a specific SSA_NAME pointer.
2348 In general, given a pointer P with a symbol tag SMT, the alias set
2349 of SMT should be the union of all the alias sets of the NMTs of
2350 every SSA_NAME for P. */
2351 struct tree_memory_tag GTY(())
2353 struct tree_decl_minimal common;
2354 unsigned int is_global:1;
2355 unsigned int is_used_alone:1;
2356 unsigned int old_used_alone:1;
2359 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2361 /* This flag is true if a SMT is used as the V_MAY_DEF or VUSE operand
2362 directly, because the access had all of the SMT's aliases pruned
2364 #define SMT_USED_ALONE(NODE) (SYMBOL_MEMORY_TAG_CHECK (NODE)->mtag.is_used_alone)
2366 /* This flag is used to temporarily store the old value of the used alone
2367 flag when updating so we know whether to mark the symbol for
2369 #define SMT_OLD_USED_ALONE(NODE) (SYMBOL_MEMORY_TAG_CHECK (NODE)->mtag.old_used_alone)
2371 struct tree_struct_field_tag GTY(())
2373 struct tree_memory_tag common;
2375 /* Parent variable. */
2378 /* Offset inside structure. */
2379 unsigned HOST_WIDE_INT offset;
2381 /* Size of the field. */
2382 unsigned HOST_WIDE_INT size;
2385 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2386 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2387 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2389 /* For any sort of a ..._DECL node, this points to the original (abstract)
2390 decl node which this decl is an instance of, or else it is NULL indicating
2391 that this decl is not an instance of some other decl. For example,
2392 in a nested declaration of an inline function, this points back to the
2394 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2396 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2397 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2398 #define DECL_ORIGIN(NODE) \
2399 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2401 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2402 inline instance of some original (abstract) decl from an inline function;
2403 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2404 nodes can also have their abstract origin set to themselves. */
2405 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2406 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2408 /* In a DECL this is the field where attributes are stored. */
2409 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2411 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2412 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2413 For a VAR_DECL, holds the initial value.
2414 For a PARM_DECL, not used--default
2415 values for parameters are encoded in the type of the function,
2416 not in the PARM_DECL slot.
2417 For a FIELD_DECL, this is used for enumeration values and the C
2418 frontend uses it for temporarily storing bitwidth of bitfields.
2420 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2421 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2423 /* Holds the size of the datum, in bits, as a tree expression.
2424 Need not be constant. */
2425 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2426 /* Likewise for the size in bytes. */
2427 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2428 /* Holds the alignment required for the datum, in bits. */
2429 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.u1.a.align)
2430 /* The alignment of NODE, in bytes. */
2431 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2432 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2433 DECL_FIELD_OFFSET which are known to be always zero.
2434 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2436 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2437 /* Holds the machine mode corresponding to the declaration of a variable or
2438 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2440 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2442 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2443 operation it is. Note, however, that this field is overloaded, with
2444 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2445 checked before any access to the former. */
2446 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_common.u1.f)
2447 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2448 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2450 /* Nonzero for a given ..._DECL node means that the name of this node should
2451 be ignored for symbolic debug purposes. */
2452 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2454 /* Nonzero for a given ..._DECL node means that this node represents an
2455 "abstract instance" of the given declaration (e.g. in the original
2456 declaration of an inline function). When generating symbolic debugging
2457 information, we mustn't try to generate any address information for nodes
2458 marked as "abstract instances" because we don't actually generate
2459 any code or allocate any data space for such instances. */
2460 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2462 /* Language-specific decl information. */
2463 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2465 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2466 do not allocate storage, and refer to a definition elsewhere. Note that
2467 this does not necessarily imply the entity represented by NODE
2468 has no program source-level definition in this translation unit. For
2469 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2470 DECL_EXTERNAL may be true simultaneously; that can be the case for
2471 a C99 "extern inline" function. */
2472 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2474 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
2476 #define DEFAULT_INIT_PRIORITY 65535
2477 #define MAX_INIT_PRIORITY 65535
2478 #define MAX_RESERVED_INIT_PRIORITY 100
2481 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2482 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2484 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2486 Also set in some languages for variables, etc., outside the normal
2487 lexical scope, such as class instance variables. */
2488 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2490 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2491 Used in FIELD_DECLs for vtable pointers.
2492 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2493 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2495 /* Used to indicate that this DECL represents a compiler-generated entity. */
2496 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2498 /* Additional flags for language-specific uses. */
2499 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2500 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2501 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2502 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2503 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2504 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2505 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2506 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2508 /* Used to indicate an alias set for the memory pointed to by this
2509 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2510 pointer (or reference) type. */
2511 #define DECL_POINTER_ALIAS_SET(NODE) \
2512 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2514 /* Nonzero if an alias set has been assigned to this declaration. */
2515 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2516 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2518 /* Nonzero for a decl which is at file scope. */
2519 #define DECL_FILE_SCOPE_P(EXP) \
2520 (! DECL_CONTEXT (EXP) \
2521 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2523 /* Nonzero for a decl that is decorated using attribute used.
2524 This indicates compiler tools that this decl needs to be preserved. */
2525 #define DECL_PRESERVE_P(DECL) \
2526 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2528 /* For function local variables of COMPLEX type, indicates that the
2529 variable is not aliased, and that all modifications to the variable
2530 have been adjusted so that they are killing assignments. Thus the
2531 variable may now be treated as a GIMPLE register, and use real
2532 instead of virtual ops in SSA form. */
2533 #define DECL_COMPLEX_GIMPLE_REG_P(DECL) \
2534 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2536 /* This is true if DECL is call clobbered in the current function.
2537 The result of this flag should always be the same as
2538 bitmap_bit_p (call_clobbered_vars, DECL_UID (decl)). */
2539 #define DECL_CALL_CLOBBERED(DECL) \
2540 DECL_COMMON_CHECK (DECL)->decl_common.call_clobbered_flag
2542 struct tree_decl_common GTY(())
2544 struct tree_decl_minimal common;
2547 ENUM_BITFIELD(machine_mode) mode : 8;
2549 unsigned nonlocal_flag : 1;
2550 unsigned virtual_flag : 1;
2551 unsigned ignored_flag : 1;
2552 unsigned abstract_flag : 1;
2553 unsigned artificial_flag : 1;
2554 unsigned user_align : 1;
2555 unsigned preserve_flag: 1;
2556 unsigned debug_expr_is_from : 1;
2558 unsigned lang_flag_0 : 1;
2559 unsigned lang_flag_1 : 1;
2560 unsigned lang_flag_2 : 1;
2561 unsigned lang_flag_3 : 1;
2562 unsigned lang_flag_4 : 1;
2563 unsigned lang_flag_5 : 1;
2564 unsigned lang_flag_6 : 1;
2565 unsigned lang_flag_7 : 1;
2567 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2568 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2569 unsigned decl_flag_0 : 1;
2570 /* In FIELD_DECL, this is DECL_PACKED. */
2571 unsigned decl_flag_1 : 1;
2572 /* In FIELD_DECL, this is DECL_BIT_FIELD
2573 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2574 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2575 unsigned decl_flag_2 : 1;
2576 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2577 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2578 unsigned decl_flag_3 : 1;
2579 /* Logically, these two would go in a theoretical base shared by var and
2581 unsigned gimple_reg_flag : 1;
2582 unsigned call_clobbered_flag : 1;
2584 union tree_decl_u1 {
2585 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2586 DECL_FUNCTION_CODE. */
2587 enum built_in_function f;
2588 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2589 is used by language-dependent code. */
2591 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2593 struct tree_decl_u1_a {
2594 unsigned int align : 24;
2595 unsigned int off_align : 8;
2602 tree abstract_origin;
2604 HOST_WIDE_INT pointer_alias_set;
2605 /* Points to a structure whose details depend on the language in use. */
2606 struct lang_decl *lang_specific;
2609 extern tree decl_value_expr_lookup (tree);
2610 extern void decl_value_expr_insert (tree, tree);
2612 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2613 if transformations have made this more complicated than evaluating the
2614 decl itself. This should only be used for debugging; once this field has
2615 been set, the decl itself may not legitimately appear in the function. */
2616 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2617 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2618 #define DECL_VALUE_EXPR(NODE) \
2619 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2620 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2621 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2623 /* Holds the RTL expression for the value of a variable or function.
2624 This value can be evaluated lazily for functions, variables with
2625 static storage duration, and labels. */
2626 #define DECL_RTL(NODE) \
2627 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2628 ? (NODE)->decl_with_rtl.rtl \
2629 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2631 /* Set the DECL_RTL for NODE to RTL. */
2632 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2634 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2635 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2637 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2638 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2640 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2641 NODE1, it will not be set for NODE2; this is a lazy copy. */
2642 #define COPY_DECL_RTL(NODE1, NODE2) \
2643 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2645 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2646 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2648 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2649 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2651 struct tree_decl_with_rtl GTY(())
2653 struct tree_decl_common common;
2657 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2658 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2659 of the structure. */
2660 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2662 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2663 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2664 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2665 natural alignment of the field's type). */
2666 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2668 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2669 if so, the type that was originally specified for it.
2670 TREE_TYPE may have been modified (in finish_struct). */
2671 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2673 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2674 if nonzero, indicates that the field occupies the type. */
2675 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2677 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2678 DECL_FIELD_OFFSET which are known to be always zero.
2679 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2681 #define DECL_OFFSET_ALIGN(NODE) \
2682 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align)
2684 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2685 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2686 (FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align = exact_log2 ((X) & -(X)))
2687 /* 1 if the alignment for this type was requested by "aligned" attribute,
2688 0 if it is the default for this type. */
2690 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2691 which this FIELD_DECL is defined. This information is needed when
2692 writing debugging information about vfield and vbase decls for C++. */
2693 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2695 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2696 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2698 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2700 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2702 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2704 #define DECL_NONADDRESSABLE_P(NODE) \
2705 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2707 struct tree_field_decl GTY(())
2709 struct tree_decl_common common;
2712 tree bit_field_type;
2719 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2720 dense, unique within any one function, and may be used to index arrays.
2721 If the value is -1, then no UID has been assigned. */
2722 #define LABEL_DECL_UID(NODE) \
2723 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2725 /* In LABEL_DECL nodes, nonzero means that an error message about
2726 jumping into such a binding contour has been printed for this label. */
2727 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2729 struct tree_label_decl GTY(())
2731 struct tree_decl_with_rtl common;
2732 /* Java's verifier has some need to store information about labels,
2733 and was using fields that no longer exist on labels.
2734 Once the verifier doesn't need these anymore, they should be removed. */
2738 unsigned int java_field_4;
2742 struct tree_result_decl GTY(())
2744 struct tree_decl_with_rtl common;
2747 struct tree_const_decl GTY(())
2749 struct tree_decl_with_rtl common;
2752 /* For a PARM_DECL, records the data type used to pass the argument,
2753 which may be different from the type seen in the program. */
2754 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2756 /* For PARM_DECL, holds an RTL for the stack slot or register
2757 where the data was actually passed. */
2758 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2760 struct tree_parm_decl GTY(())
2762 struct tree_decl_with_rtl common;
2767 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2768 this variable in a BIND_EXPR. */
2769 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2770 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2772 /* Used to indicate that the linkage status of this DECL is not yet known,
2773 so it should not be output now. */
2774 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2776 /* Nonzero for a given ..._DECL node means that no warnings should be
2777 generated just because this node is unused. */
2778 #define DECL_IN_SYSTEM_HEADER(NODE) \
2779 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2781 /* Used to indicate that this DECL has weak linkage. */
2782 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2784 /* Internal to the gimplifier. Indicates that the value is a formal
2785 temporary controlled by the gimplifier. */
2786 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2787 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2789 /* Used to indicate that the DECL is a dllimport. */
2790 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2792 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2793 based on a variable with a restrict qualified type. If it is,
2794 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2797 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2798 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2799 #define DECL_GET_RESTRICT_BASE(NODE) \
2800 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2801 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2802 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2804 extern tree decl_restrict_base_lookup (tree);
2805 extern void decl_restrict_base_insert (tree, tree);
2807 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2808 not be put out unless it is needed in this translation unit.
2809 Entities like this are shared across translation units (like weak
2810 entities), but are guaranteed to be generated by any translation
2811 unit that needs them, and therefore need not be put out anywhere
2812 where they are not needed. DECL_COMDAT is just a hint to the
2813 back-end; it is up to front-ends which set this flag to ensure
2814 that there will never be any harm, other than bloat, in putting out
2815 something which is DECL_COMDAT. */
2816 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2818 /* A replaceable function is one which may be replaced at link-time
2819 with an entirely different definition, provided that the
2820 replacement has the same type. For example, functions declared
2821 with __attribute__((weak)) on most systems are replaceable.
2823 COMDAT functions are not replaceable, since all definitions of the
2824 function must be equivalent. It is important that COMDAT functions
2825 not be treated as replaceable so that use of C++ template
2826 instantiations is not penalized.
2828 For example, DECL_REPLACEABLE is used to determine whether or not a
2829 function (including a template instantiation) which is not
2830 explicitly declared "inline" can be inlined. If the function is
2831 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2832 implementation chosen at link-time may be different. However, a
2833 function that is not DECL_REPLACEABLE can be inlined, since all
2834 versions of the function will be functionally identical. */
2835 #define DECL_REPLACEABLE_P(NODE) \
2836 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2838 /* The name of the object as the assembler will see it (but before any
2839 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2840 as DECL_NAME. It is an IDENTIFIER_NODE. */
2841 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2843 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2844 This is true of all DECL nodes except FIELD_DECL. */
2845 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2846 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2848 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2849 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2851 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2852 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2854 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2855 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2856 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2858 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2859 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2860 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2861 semantics of using this macro, are different than saying:
2863 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2865 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2867 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2868 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2869 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2870 DECL_ASSEMBLER_NAME (DECL1)) \
2873 /* Records the section name in a section attribute. Used to pass
2874 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2875 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2877 /* Value of the decls's visibility attribute */
2878 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2880 /* Nonzero means that the decl had its visibility specified rather than
2882 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2884 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2885 multiple translation units should be merged. */
2886 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
2888 struct tree_decl_with_vis GTY(())
2890 struct tree_decl_with_rtl common;
2891 tree assembler_name;
2894 /* Belong to VAR_DECL exclusively. */
2895 unsigned defer_output:1;
2896 unsigned hard_register:1;
2897 unsigned thread_local:1;
2898 unsigned common_flag:1;
2899 unsigned in_text_section : 1;
2900 unsigned gimple_formal_temp : 1;
2901 unsigned dllimport_flag : 1;
2902 unsigned based_on_restrict_p : 1;
2903 /* Used by C++. Might become a generic decl flag. */
2904 unsigned shadowed_for_var_p : 1;
2906 /* Don't belong to VAR_DECL exclusively. */
2907 unsigned in_system_header_flag : 1;
2908 unsigned weak_flag:1;
2909 unsigned seen_in_bind_expr : 1;
2910 unsigned comdat_flag : 1;
2911 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2912 unsigned visibility_specified : 1;
2913 /* Belong to FUNCTION_DECL exclusively. */
2914 unsigned one_only : 1;
2915 unsigned init_priority_p:1;
2917 /* Belongs to VAR_DECL exclusively. */
2918 ENUM_BITFIELD(tls_model) tls_model : 3;
2919 /* 11 unused bits. */
2922 /* In a VAR_DECL that's static,
2923 nonzero if the space is in the text section. */
2924 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2926 /* Nonzero for a given ..._DECL node means that this node should be
2927 put in .common, if possible. If a DECL_INITIAL is given, and it
2928 is not error_mark_node, then the decl cannot be put in .common. */
2929 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2931 /* In a VAR_DECL, nonzero if the decl is a register variable with
2932 an explicit asm specification. */
2933 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2935 extern tree decl_debug_expr_lookup (tree);
2936 extern void decl_debug_expr_insert (tree, tree);
2937 /* For VAR_DECL, this is set to either an expression that it was split
2938 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
2939 subexpressions that it was split into. */
2940 #define DECL_DEBUG_EXPR(NODE) \
2941 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2943 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2944 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2947 extern unsigned short decl_init_priority_lookup (tree);
2948 extern void decl_init_priority_insert (tree, unsigned short);
2950 /* In a non-local VAR_DECL with static storage duration, this is the
2951 initialization priority. If this value is zero, the NODE will be
2952 initialized at the DEFAULT_INIT_PRIORITY. Only used by C++ FE*/
2954 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2955 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2956 #define DECL_INIT_PRIORITY(NODE) \
2957 (decl_init_priority_lookup (VAR_DECL_CHECK (NODE)))
2958 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2959 (decl_init_priority_insert (VAR_DECL_CHECK (NODE), VAL))
2961 /* In a VAR_DECL, the model to use if the data should be allocated from
2962 thread-local storage. */
2963 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2965 /* In a VAR_DECL, nonzero if the data should be allocated from
2966 thread-local storage. */
2967 #define DECL_THREAD_LOCAL_P(NODE) \
2968 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
2970 struct tree_var_decl GTY(())
2972 struct tree_decl_with_vis common;
2976 /* This field is used to reference anything in decl.result and is meant only
2977 for use by the garbage collector. */
2978 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2980 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2981 Before the struct containing the FUNCTION_DECL is laid out,
2982 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2983 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2984 function. When the class is laid out, this pointer is changed
2985 to an INTEGER_CST node which is suitable for use as an index
2986 into the virtual function table.
2987 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
2988 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2990 struct tree_decl_non_common GTY(())
2993 struct tree_decl_with_vis common;
2994 /* C++ uses this in namespaces. */
2996 /* C++ uses this in templates. */
2998 /* Almost all FE's use this. */
3000 /* C++ uses this in namespaces. */
3004 /* In FUNCTION_DECL, holds the decl for the return value. */
3005 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3007 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3008 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3010 /* In a FUNCTION_DECL, the saved representation of the body of the
3012 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3014 /* Nonzero in a FUNCTION_DECL means this function should be treated
3015 as if it were a malloc, meaning it returns a pointer that is
3017 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3019 /* Nonzero in a FUNCTION_DECL means this function may return more
3021 #define DECL_IS_RETURNS_TWICE(NODE) \
3022 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3024 /* Nonzero in a FUNCTION_DECL means this function should be treated
3025 as "pure" function (like const function, but may read global memory). */
3026 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3028 /* Nonzero in a FUNCTION_DECL means this function should be treated
3029 as "novops" function (function that does not read global memory,
3030 but may have arbitrary side effects). */
3031 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3033 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3034 at the beginning or end of execution. */
3035 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3036 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3038 #define DECL_STATIC_DESTRUCTOR(NODE) \
3039 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3041 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3042 be instrumented with calls to support routines. */
3043 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3044 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3046 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3047 disabled in this function. */
3048 #define DECL_NO_LIMIT_STACK(NODE) \
3049 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3051 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3052 static chain is not needed. */
3053 #define DECL_NO_STATIC_CHAIN(NODE) \
3054 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3056 /* Nonzero for a decl that cgraph has decided should be inlined into
3057 at least one call site. It is not meaningful to look at this
3058 directly; always use cgraph_function_possibly_inlined_p. */
3059 #define DECL_POSSIBLY_INLINED(DECL) \
3060 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3062 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3063 where it is called. */
3064 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3066 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3067 such as via the `inline' keyword in C/C++. This flag controls the linkage
3068 semantics of 'inline'; whether or not the function is inlined is
3069 controlled by DECL_INLINE. */
3070 #define DECL_DECLARED_INLINE_P(NODE) \
3071 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3073 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3074 that describes the status of this function. */
3075 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3077 /* In a FUNCTION_DECL, nonzero means a built in function. */
3078 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3080 /* For a builtin function, identify which part of the compiler defined it. */
3081 #define DECL_BUILT_IN_CLASS(NODE) \
3082 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3084 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3085 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3087 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3088 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3090 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3091 arguments/result/saved_tree fields by front ends. It was either inherit
3092 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3093 which seemed a bit strange. */
3095 struct tree_function_decl GTY(())
3097 struct tree_decl_non_common common;
3099 unsigned static_ctor_flag : 1;
3100 unsigned static_dtor_flag : 1;
3101 unsigned uninlinable : 1;
3102 unsigned possibly_inlined : 1;
3103 unsigned novops_flag : 1;
3104 unsigned returns_twice_flag : 1;
3105 unsigned malloc_flag : 1;
3106 unsigned pure_flag : 1;
3108 unsigned declared_inline_flag : 1;
3109 unsigned regdecl_flag : 1;
3110 unsigned inline_flag : 1;
3111 unsigned no_instrument_function_entry_exit : 1;
3112 unsigned no_limit_stack : 1;
3113 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3118 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3119 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3121 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3122 into stabs. Instead it will generate cross reference ('x') of names.
3123 This uses the same flag as DECL_EXTERNAL. */
3124 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3125 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3127 struct tree_type_decl GTY(())
3129 struct tree_decl_non_common common;
3133 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3134 To reduce overhead, the nodes containing the statements are not trees.
3135 This avoids the overhead of tree_common on all linked list elements.
3137 Use the interface in tree-iterator.h to access this node. */
3139 #define STATEMENT_LIST_HEAD(NODE) \
3140 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3141 #define STATEMENT_LIST_TAIL(NODE) \
3142 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3144 struct tree_statement_list_node
3145 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3147 struct tree_statement_list_node *prev;
3148 struct tree_statement_list_node *next;
3152 struct tree_statement_list
3155 struct tree_common common;
3156 struct tree_statement_list_node *head;
3157 struct tree_statement_list_node *tail;
3160 #define VALUE_HANDLE_ID(NODE) \
3161 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3163 #define VALUE_HANDLE_EXPR_SET(NODE) \
3164 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3166 #define VALUE_HANDLE_VUSES(NODE) \
3167 (VALUE_HANDLE_CHECK (NODE)->value_handle.vuses)
3169 /* Defined and used in tree-ssa-pre.c. */
3172 struct tree_value_handle GTY(())
3174 struct tree_common common;
3176 /* The set of expressions represented by this handle. */
3177 struct value_set * GTY ((skip)) expr_set;
3179 /* Unique ID for this value handle. IDs are handed out in a
3180 conveniently dense form starting at 0, so that we can make
3181 bitmaps of value handles. */
3184 /* Set of virtual uses represented by this handle. */
3185 VEC (tree, gc) *vuses;
3188 /* Define the overall contents of a tree node.
3189 It may be any of the structures declared above
3190 for various types of node. */
3192 union tree_node GTY ((ptr_alias (union lang_tree_node),
3193 desc ("tree_node_structure (&%h)")))
3195 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3196 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3197 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3198 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3199 struct tree_string GTY ((tag ("TS_STRING"))) string;
3200 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3201 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3202 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3203 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3204 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3205 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3206 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3207 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3208 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3209 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3210 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3211 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3212 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3213 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3214 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3215 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3216 struct tree_list GTY ((tag ("TS_LIST"))) list;
3217 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3218 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3219 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3220 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3221 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3222 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3223 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3224 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3225 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3226 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3227 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3228 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3231 /* Standard named or nameless data types of the C compiler. */
3253 TI_INTEGER_MINUS_ONE,
3270 TI_COMPLEX_INTEGER_TYPE,
3271 TI_COMPLEX_FLOAT_TYPE,
3272 TI_COMPLEX_DOUBLE_TYPE,
3273 TI_COMPLEX_LONG_DOUBLE_TYPE,
3277 TI_LONG_DOUBLE_TYPE,
3281 TI_LONG_DOUBLE_PTR_TYPE,
3282 TI_INTEGER_PTR_TYPE,
3291 TI_VA_LIST_GPR_COUNTER_FIELD,
3292 TI_VA_LIST_FPR_COUNTER_FIELD,
3299 TI_DFLOAT32_PTR_TYPE,
3300 TI_DFLOAT64_PTR_TYPE,
3301 TI_DFLOAT128_PTR_TYPE,
3310 extern GTY(()) tree global_trees[TI_MAX];
3312 #define error_mark_node global_trees[TI_ERROR_MARK]
3314 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3315 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3316 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3317 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3318 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3320 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3321 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3322 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3323 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3324 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3326 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3327 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3329 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3330 #define integer_one_node global_trees[TI_INTEGER_ONE]
3331 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3332 #define size_zero_node global_trees[TI_SIZE_ZERO]
3333 #define size_one_node global_trees[TI_SIZE_ONE]
3334 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3335 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3336 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3338 /* Base access nodes. */
3339 #define access_public_node global_trees[TI_PUBLIC]
3340 #define access_protected_node global_trees[TI_PROTECTED]
3341 #define access_private_node global_trees[TI_PRIVATE]
3343 #define null_pointer_node global_trees[TI_NULL_POINTER]
3345 #define float_type_node global_trees[TI_FLOAT_TYPE]
3346 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3347 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3349 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3350 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3351 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3352 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3354 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3355 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3356 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3357 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3359 #define void_type_node global_trees[TI_VOID_TYPE]
3360 /* The C type `void *'. */
3361 #define ptr_type_node global_trees[TI_PTR_TYPE]
3362 /* The C type `const void *'. */
3363 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3364 /* The C type `size_t'. */
3365 #define size_type_node global_trees[TI_SIZE_TYPE]
3366 #define pid_type_node global_trees[TI_PID_TYPE]
3367 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3368 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3369 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3370 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3371 /* The C type `FILE *'. */
3372 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3374 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3375 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3376 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3378 /* The decimal floating point types. */
3379 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3380 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3381 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3382 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3383 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3384 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3386 /* The node that should be placed at the end of a parameter list to
3387 indicate that the function does not take a variable number of
3388 arguments. The TREE_VALUE will be void_type_node and there will be
3389 no TREE_CHAIN. Language-independent code should not assume
3390 anything else about this node. */
3391 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3393 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3394 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3396 /* An enumeration of the standard C integer types. These must be
3397 ordered so that shorter types appear before longer ones, and so
3398 that signed types appear before unsigned ones, for the correct
3399 functioning of interpret_integer() in c-lex.c. */
3400 enum integer_type_kind
3412 itk_unsigned_long_long,
3416 typedef enum integer_type_kind integer_type_kind;
3418 /* The standard C integer types. Use integer_type_kind to index into
3420 extern GTY(()) tree integer_types[itk_none];
3422 #define char_type_node integer_types[itk_char]
3423 #define signed_char_type_node integer_types[itk_signed_char]
3424 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3425 #define short_integer_type_node integer_types[itk_short]
3426 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3427 #define integer_type_node integer_types[itk_int]
3428 #define unsigned_type_node integer_types[itk_unsigned_int]
3429 #define long_integer_type_node integer_types[itk_long]
3430 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3431 #define long_long_integer_type_node integer_types[itk_long_long]
3432 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3434 /* Set to the default thread-local storage (tls) model to use. */
3436 extern enum tls_model flag_tls_default;
3439 /* A pointer-to-function member type looks like:
3446 If __pfn is NULL, it is a NULL pointer-to-member-function.
3448 (Because the vtable is always the first thing in the object, we
3449 don't need its offset.) If the function is virtual, then PFN is
3450 one plus twice the index into the vtable; otherwise, it is just a
3451 pointer to the function.
3453 Unfortunately, using the lowest bit of PFN doesn't work in
3454 architectures that don't impose alignment requirements on function
3455 addresses, or that use the lowest bit to tell one ISA from another,
3456 for example. For such architectures, we use the lowest bit of
3457 DELTA instead of the lowest bit of the PFN, and DELTA will be
3460 enum ptrmemfunc_vbit_where_t
3462 ptrmemfunc_vbit_in_pfn,
3463 ptrmemfunc_vbit_in_delta
3466 #define NULL_TREE (tree) NULL
3468 extern tree decl_assembler_name (tree);
3470 /* Compute the number of bytes occupied by 'node'. This routine only
3471 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3473 extern size_t tree_size (tree);
3475 /* Compute the number of bytes occupied by a tree with code CODE. This
3476 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3478 extern size_t tree_code_size (enum tree_code);
3480 /* Lowest level primitive for allocating a node.
3481 The TREE_CODE is the only argument. Contents are initialized
3482 to zero except for a few of the common fields. */
3484 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3485 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3487 /* Make a copy of a node, with all the same contents. */
3489 extern tree copy_node_stat (tree MEM_STAT_DECL);
3490 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3492 /* Make a copy of a chain of TREE_LIST nodes. */
3494 extern tree copy_list (tree);
3497 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3498 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3500 /* Make a TREE_VEC. */
3502 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3503 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3505 /* Tree nodes for SSA analysis. */
3507 extern void init_phinodes (void);
3508 extern void fini_phinodes (void);
3509 extern void release_phi_node (tree);
3510 #ifdef GATHER_STATISTICS
3511 extern void phinodes_print_statistics (void);
3514 extern void init_ssanames (void);
3515 extern void fini_ssanames (void);
3516 extern tree make_ssa_name (tree, tree);
3517 extern tree duplicate_ssa_name (tree, tree);
3518 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3519 extern void release_ssa_name (tree);
3520 extern void release_defs (tree);
3521 extern void replace_ssa_name_symbol (tree, tree);
3523 #ifdef GATHER_STATISTICS
3524 extern void ssanames_print_statistics (void);
3527 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3528 The name is supplied as a char *. */
3530 extern tree get_identifier (const char *);
3532 #if GCC_VERSION >= 3000
3533 #define get_identifier(str) \
3534 (__builtin_constant_p (str) \
3535 ? get_identifier_with_length ((str), strlen (str)) \
3536 : get_identifier (str))
3540 /* Identical to get_identifier, except that the length is assumed
3543 extern tree get_identifier_with_length (const char *, size_t);
3545 /* If an identifier with the name TEXT (a null-terminated string) has
3546 previously been referred to, return that node; otherwise return
3549 extern tree maybe_get_identifier (const char *);
3551 /* Construct various types of nodes. */
3553 extern tree build_nt (enum tree_code, ...);
3555 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3556 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3557 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3558 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3559 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3560 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3561 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3562 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3563 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3564 tree MEM_STAT_DECL);
3565 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3566 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3567 tree MEM_STAT_DECL);
3568 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3569 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3570 tree, tree, tree MEM_STAT_DECL);
3571 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3572 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3574 extern tree build_int_cst (tree, HOST_WIDE_INT);
3575 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3576 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3577 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3578 extern tree build_vector (tree, tree);
3579 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3580 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3581 extern tree build_constructor_single (tree, tree, tree);
3582 extern tree build_constructor_from_list (tree, tree);
3583 extern tree build_real_from_int_cst (tree, tree);
3584 extern tree build_complex (tree, tree, tree);
3585 extern tree build_one_cst (tree);
3586 extern tree build_string (int, const char *);
3587 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3588 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3589 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3590 extern tree build_fn_decl (const char *, tree);
3591 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3592 extern tree build_block (tree, tree, tree, tree);
3593 #ifndef USE_MAPPED_LOCATION
3594 extern void annotate_with_file_line (tree, const char *, int);
3595 extern void annotate_with_locus (tree, location_t);
3597 extern tree build_empty_stmt (void);
3598 extern tree build_omp_clause (enum omp_clause_code);
3600 /* Construct various nodes representing data types. */
3602 extern tree make_signed_type (int);
3603 extern tree make_unsigned_type (int);
3604 extern tree signed_type_for (tree);
3605 extern tree unsigned_type_for (tree);
3606 extern void initialize_sizetypes (bool);
3607 extern void set_sizetype (tree);
3608 extern void fixup_unsigned_type (tree);
3609 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3610 extern tree build_pointer_type (tree);
3611 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3612 extern tree build_reference_type (tree);
3613 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3614 extern tree build_vector_type (tree innertype, int nunits);
3615 extern tree build_type_no_quals (tree);
3616 extern tree build_index_type (tree);
3617 extern tree build_index_2_type (tree, tree);
3618 extern tree build_array_type (tree, tree);
3619 extern tree build_function_type (tree, tree);
3620 extern tree build_function_type_list (tree, ...);
3621 extern tree build_method_type_directly (tree, tree, tree);
3622 extern tree build_method_type (tree, tree);
3623 extern tree build_offset_type (tree, tree);
3624 extern tree build_complex_type (tree);
3625 extern tree build_resx (int);
3626 extern tree array_type_nelts (tree);
3627 extern bool in_array_bounds_p (tree);
3628 extern bool range_in_array_bounds_p (tree);
3630 extern tree value_member (tree, tree);
3631 extern tree purpose_member (tree, tree);
3633 extern int attribute_list_equal (tree, tree);
3634 extern int attribute_list_contained (tree, tree);
3635 extern int tree_int_cst_equal (tree, tree);
3636 extern int tree_int_cst_lt (tree, tree);
3637 extern int tree_int_cst_compare (tree, tree);
3638 extern int host_integerp (tree, int);
3639 extern HOST_WIDE_INT tree_low_cst (tree, int);
3640 extern int tree_int_cst_msb (tree);
3641 extern int tree_int_cst_sgn (tree);
3642 extern int tree_int_cst_sign_bit (tree);
3643 extern int tree_expr_nonnegative_p (tree);
3644 extern int tree_expr_nonnegative_warnv_p (tree, bool *);
3645 extern bool may_negate_without_overflow_p (tree);
3646 extern tree get_inner_array_type (tree);
3648 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3649 put the prototype here. Rtl.h does declare the prototype if
3650 tree.h had been included. */
3652 extern tree make_tree (tree, rtx);
3654 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3657 Such modified types already made are recorded so that duplicates
3660 extern tree build_type_attribute_variant (tree, tree);
3661 extern tree build_decl_attribute_variant (tree, tree);
3663 /* Structure describing an attribute and a function to handle it. */
3664 struct attribute_spec
3666 /* The name of the attribute (without any leading or trailing __),
3667 or NULL to mark the end of a table of attributes. */
3668 const char *const name;
3669 /* The minimum length of the list of arguments of the attribute. */
3670 const int min_length;
3671 /* The maximum length of the list of arguments of the attribute
3672 (-1 for no maximum). */
3673 const int max_length;
3674 /* Whether this attribute requires a DECL. If it does, it will be passed
3675 from types of DECLs, function return types and array element types to
3676 the DECLs, function types and array types respectively; but when
3677 applied to a type in any other circumstances, it will be ignored with
3678 a warning. (If greater control is desired for a given attribute,
3679 this should be false, and the flags argument to the handler may be
3680 used to gain greater control in that case.) */
3681 const bool decl_required;
3682 /* Whether this attribute requires a type. If it does, it will be passed
3683 from a DECL to the type of that DECL. */
3684 const bool type_required;
3685 /* Whether this attribute requires a function (or method) type. If it does,
3686 it will be passed from a function pointer type to the target type,
3687 and from a function return type (which is not itself a function
3688 pointer type) to the function type. */
3689 const bool function_type_required;
3690 /* Function to handle this attribute. NODE points to the node to which
3691 the attribute is to be applied. If a DECL, it should be modified in
3692 place; if a TYPE, a copy should be created. NAME is the name of the
3693 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3694 of the arguments (which may be NULL). FLAGS gives further information
3695 about the context of the attribute. Afterwards, the attributes will
3696 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3697 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3698 as well as in any other cases when the attributes should not be added
3699 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3700 applied to another type or DECL later may be returned;
3701 otherwise the return value should be NULL_TREE. This pointer may be
3702 NULL if no special handling is required beyond the checks implied
3703 by the rest of this structure. */
3704 tree (*const handler) (tree *node, tree name, tree args,
3705 int flags, bool *no_add_attrs);
3708 /* Flags that may be passed in the third argument of decl_attributes, and
3709 to handler functions for attributes. */
3710 enum attribute_flags
3712 /* The type passed in is the type of a DECL, and any attributes that
3713 should be passed in again to be applied to the DECL rather than the
3714 type should be returned. */
3715 ATTR_FLAG_DECL_NEXT = 1,
3716 /* The type passed in is a function return type, and any attributes that
3717 should be passed in again to be applied to the function type rather
3718 than the return type should be returned. */
3719 ATTR_FLAG_FUNCTION_NEXT = 2,
3720 /* The type passed in is an array element type, and any attributes that
3721 should be passed in again to be applied to the array type rather
3722 than the element type should be returned. */
3723 ATTR_FLAG_ARRAY_NEXT = 4,
3724 /* The type passed in is a structure, union or enumeration type being
3725 created, and should be modified in place. */
3726 ATTR_FLAG_TYPE_IN_PLACE = 8,
3727 /* The attributes are being applied by default to a library function whose
3728 name indicates known behavior, and should be silently ignored if they
3729 are not in fact compatible with the function type. */
3730 ATTR_FLAG_BUILT_IN = 16
3733 /* Default versions of target-overridable functions. */
3735 extern tree merge_decl_attributes (tree, tree);
3736 extern tree merge_type_attributes (tree, tree);
3738 /* Given a tree node and a string, return nonzero if the tree node is
3739 a valid attribute name for the string. */
3741 extern int is_attribute_p (const char *, tree);
3743 /* Given an attribute name and a list of attributes, return the list element
3744 of the attribute or NULL_TREE if not found. */
3746 extern tree lookup_attribute (const char *, tree);
3748 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3751 extern tree remove_attribute (const char *, tree);
3753 /* Given two attributes lists, return a list of their union. */
3755 extern tree merge_attributes (tree, tree);
3757 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3758 /* Given two Windows decl attributes lists, possibly including
3759 dllimport, return a list of their union . */
3760 extern tree merge_dllimport_decl_attributes (tree, tree);
3762 /* Handle a "dllimport" or "dllexport" attribute. */
3763 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3766 /* Check whether CAND is suitable to be returned from get_qualified_type
3767 (BASE, TYPE_QUALS). */
3769 extern bool check_qualified_type (tree, tree, int);
3771 /* Return a version of the TYPE, qualified as indicated by the
3772 TYPE_QUALS, if one exists. If no qualified version exists yet,
3773 return NULL_TREE. */
3775 extern tree get_qualified_type (tree, int);
3777 /* Like get_qualified_type, but creates the type if it does not
3778 exist. This function never returns NULL_TREE. */
3780 extern tree build_qualified_type (tree, int);
3782 /* Like build_qualified_type, but only deals with the `const' and
3783 `volatile' qualifiers. This interface is retained for backwards
3784 compatibility with the various front-ends; new code should use
3785 build_qualified_type instead. */
3787 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3788 build_qualified_type ((TYPE), \
3789 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3790 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3792 /* Make a copy of a type node. */
3794 extern tree build_distinct_type_copy (tree);
3795 extern tree build_variant_type_copy (tree);
3797 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3798 fields. Optionally specify an alignment, and then lay it out. */
3800 extern void finish_builtin_struct (tree, const char *,
3803 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3804 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3805 node, does nothing except for the first time. */
3807 extern void layout_type (tree);
3809 /* These functions allow a front-end to perform a manual layout of a
3810 RECORD_TYPE. (For instance, if the placement of subsequent fields
3811 depends on the placement of fields so far.) Begin by calling
3812 start_record_layout. Then, call place_field for each of the
3813 fields. Then, call finish_record_layout. See layout_type for the
3814 default way in which these functions are used. */
3816 typedef struct record_layout_info_s
3818 /* The RECORD_TYPE that we are laying out. */
3820 /* The offset into the record so far, in bytes, not including bits in
3823 /* The last known alignment of SIZE. */
3824 unsigned int offset_align;
3825 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3827 /* The alignment of the record so far, in bits. */
3828 unsigned int record_align;
3829 /* The alignment of the record so far, ignoring #pragma pack and
3830 __attribute__ ((packed)), in bits. */
3831 unsigned int unpacked_align;
3832 /* The previous field layed out. */
3834 /* The static variables (i.e., class variables, as opposed to
3835 instance variables) encountered in T. */
3836 tree pending_statics;
3837 /* Bits remaining in the current alignment group */
3838 int remaining_in_alignment;
3839 /* True if we've seen a packed field that didn't have normal
3840 alignment anyway. */
3841 int packed_maybe_necessary;
3842 } *record_layout_info;
3844 extern void set_lang_adjust_rli (void (*) (record_layout_info));
3845 extern record_layout_info start_record_layout (tree);
3846 extern tree bit_from_pos (tree, tree);
3847 extern tree byte_from_pos (tree, tree);
3848 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
3849 extern void normalize_offset (tree *, tree *, unsigned int);
3850 extern tree rli_size_unit_so_far (record_layout_info);
3851 extern tree rli_size_so_far (record_layout_info);
3852 extern void normalize_rli (record_layout_info);
3853 extern void place_field (record_layout_info, tree);
3854 extern void compute_record_mode (tree);
3855 extern void finish_record_layout (record_layout_info, int);
3857 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3858 return a canonicalized ..._TYPE node, so that duplicates are not made.
3859 How the hash code is computed is up to the caller, as long as any two
3860 callers that could hash identical-looking type nodes agree. */
3862 extern tree type_hash_canon (unsigned int, tree);
3864 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3865 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3866 fields. Call this only once for any given decl node.
3868 Second argument is the boundary that this field can be assumed to
3869 be starting at (in bits). Zero means it can be assumed aligned
3870 on any boundary that may be needed. */
3872 extern void layout_decl (tree, unsigned);
3874 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3875 a previous call to layout_decl and calls it again. */
3877 extern void relayout_decl (tree);
3879 /* Return the mode for data of a given size SIZE and mode class CLASS.
3880 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3881 The value is BLKmode if no other mode is found. This is like
3882 mode_for_size, but is passed a tree. */
3884 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
3886 /* Return an expr equal to X but certainly not valid as an lvalue. */
3888 extern tree non_lvalue (tree);
3890 extern tree convert (tree, tree);
3891 extern unsigned int expr_align (tree);
3892 extern tree expr_first (tree);
3893 extern tree expr_last (tree);
3894 extern tree expr_only (tree);
3895 extern tree size_in_bytes (tree);
3896 extern HOST_WIDE_INT int_size_in_bytes (tree);
3897 extern HOST_WIDE_INT max_int_size_in_bytes (tree);
3898 extern tree bit_position (tree);
3899 extern HOST_WIDE_INT int_bit_position (tree);
3900 extern tree byte_position (tree);
3901 extern HOST_WIDE_INT int_byte_position (tree);
3903 /* Define data structures, macros, and functions for handling sizes
3904 and the various types used to represent sizes. */
3908 SIZETYPE, /* Normal representation of sizes in bytes. */
3909 SSIZETYPE, /* Signed representation of sizes in bytes. */
3910 BITSIZETYPE, /* Normal representation of sizes in bits. */
3911 SBITSIZETYPE, /* Signed representation of sizes in bits. */
3914 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
3916 #define sizetype sizetype_tab[(int) SIZETYPE]
3917 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
3918 #define ssizetype sizetype_tab[(int) SSIZETYPE]
3919 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
3921 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
3922 extern tree size_binop (enum tree_code, tree, tree);
3923 extern tree size_diffop (tree, tree);
3925 #define size_int(L) size_int_kind (L, SIZETYPE)
3926 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
3927 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
3928 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
3930 extern tree round_up (tree, int);
3931 extern tree round_down (tree, int);
3932 extern tree get_pending_sizes (void);
3933 extern void put_pending_size (tree);
3934 extern void put_pending_sizes (tree);
3936 /* Type for sizes of data-type. */
3938 #define BITS_PER_UNIT_LOG \
3939 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3940 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3941 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3943 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
3944 extern unsigned int maximum_field_alignment;
3945 /* and its original value in bytes, specified via -fpack-struct=<value>. */
3946 extern unsigned int initial_max_fld_align;
3948 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3949 by making the last node in X point to Y.
3950 Returns X, except if X is 0 returns Y. */
3952 extern tree chainon (tree, tree);
3954 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3956 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3957 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3959 /* Return the last tree node in a chain. */
3961 extern tree tree_last (tree);
3963 /* Reverse the order of elements in a chain, and return the new head. */
3965 extern tree nreverse (tree);
3967 /* Returns the length of a chain of nodes
3968 (number of chain pointers to follow before reaching a null pointer). */
3970 extern int list_length (tree);
3972 /* Returns the number of FIELD_DECLs in a type. */
3974 extern int fields_length (tree);
3976 /* Given an initializer INIT, return TRUE if INIT is zero or some
3977 aggregate of zeros. Otherwise return FALSE. */
3979 extern bool initializer_zerop (tree);
3981 /* Examine CTOR to discover:
3982 * how many scalar fields are set to nonzero values,
3983 and place it in *P_NZ_ELTS;
3984 * how many scalar fields in total are in CTOR,
3985 and place it in *P_ELT_COUNT.
3986 * if a type is a union, and the initializer from the constructor
3987 is not the largest element in the union, then set *p_must_clear.
3989 Return whether or not CTOR is a valid static constant initializer, the same
3990 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
3992 extern bool categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3995 extern HOST_WIDE_INT count_type_elements (tree, bool);
3997 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3999 extern int integer_zerop (tree);
4001 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4003 extern int integer_onep (tree);
4005 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4006 all of whose significant bits are 1. */
4008 extern int integer_all_onesp (tree);
4010 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4011 exactly one bit 1. */
4013 extern int integer_pow2p (tree);
4015 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4016 with a nonzero value. */
4018 extern int integer_nonzerop (tree);
4020 extern bool zero_p (tree);
4021 extern bool cst_and_fits_in_hwi (tree);
4022 extern tree num_ending_zeros (tree);
4024 /* staticp (tree x) is nonzero if X is a reference to data allocated
4025 at a fixed address in memory. Returns the outermost data. */
4027 extern tree staticp (tree);
4029 /* save_expr (EXP) returns an expression equivalent to EXP
4030 but it can be used multiple times within context CTX
4031 and only evaluate EXP once. */
4033 extern tree save_expr (tree);
4035 /* Look inside EXPR and into any simple arithmetic operations. Return
4036 the innermost non-arithmetic node. */
4038 extern tree skip_simple_arithmetic (tree);
4040 /* Return which tree structure is used by T. */
4042 enum tree_node_structure_enum tree_node_structure (tree);
4044 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4045 or offset that depends on a field within a record.
4047 Note that we only allow such expressions within simple arithmetic
4050 extern bool contains_placeholder_p (tree);
4052 /* This macro calls the above function but short-circuits the common
4053 case of a constant to save time. Also check for null. */
4055 #define CONTAINS_PLACEHOLDER_P(EXP) \
4056 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4058 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4059 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4062 extern bool type_contains_placeholder_p (tree);
4064 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4065 return a tree with all occurrences of references to F in a
4066 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4067 contains only arithmetic expressions. */
4069 extern tree substitute_in_expr (tree, tree, tree);
4071 /* This macro calls the above function but short-circuits the common
4072 case of a constant to save time and also checks for NULL. */
4074 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4075 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4077 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4078 for it within OBJ, a tree that is an object or a chain of references. */
4080 extern tree substitute_placeholder_in_expr (tree, tree);
4082 /* This macro calls the above function but short-circuits the common
4083 case of a constant to save time and also checks for NULL. */
4085 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4086 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4087 : substitute_placeholder_in_expr (EXP, OBJ))
4089 /* variable_size (EXP) is like save_expr (EXP) except that it
4090 is for the special case of something that is part of a
4091 variable size for a data type. It makes special arrangements
4092 to compute the value at the right time when the data type
4093 belongs to a function parameter. */
4095 extern tree variable_size (tree);
4097 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4098 but it can be used multiple times
4099 and only evaluate the subexpressions once. */
4101 extern tree stabilize_reference (tree);
4103 /* Subroutine of stabilize_reference; this is called for subtrees of
4104 references. Any expression with side-effects must be put in a SAVE_EXPR
4105 to ensure that it is only evaluated once. */
4107 extern tree stabilize_reference_1 (tree);
4109 /* Return EXP, stripped of any conversions to wider types
4110 in such a way that the result of converting to type FOR_TYPE
4111 is the same as if EXP were converted to FOR_TYPE.
4112 If FOR_TYPE is 0, it signifies EXP's type. */
4114 extern tree get_unwidened (tree, tree);
4116 /* Return OP or a simpler expression for a narrower value
4117 which can be sign-extended or zero-extended to give back OP.
4118 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4119 or 0 if the value should be sign-extended. */
4121 extern tree get_narrower (tree, int *);
4123 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4124 look for nested component-refs or array-refs at constant positions
4125 and find the ultimate containing object, which is returned. */
4127 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4128 tree *, enum machine_mode *, int *, int *,
4131 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4132 look for whether EXP or any nested component-refs within EXP is marked
4135 extern bool contains_packed_reference (tree exp);
4137 /* Return 1 if T is an expression that get_inner_reference handles. */
4139 extern int handled_component_p (tree);
4141 /* Return a tree of sizetype representing the size, in bytes, of the element
4142 of EXP, an ARRAY_REF. */
4144 extern tree array_ref_element_size (tree);
4146 /* Return a tree representing the lower bound of the array mentioned in
4147 EXP, an ARRAY_REF. */
4149 extern tree array_ref_low_bound (tree);
4151 /* Return a tree representing the upper bound of the array mentioned in
4152 EXP, an ARRAY_REF. */
4154 extern tree array_ref_up_bound (tree);
4156 /* Return a tree representing the offset, in bytes, of the field referenced
4157 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4159 extern tree component_ref_field_offset (tree);
4161 /* Given a DECL or TYPE, return the scope in which it was declared, or
4162 NUL_TREE if there is no containing scope. */
4164 extern tree get_containing_scope (tree);
4166 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4168 extern tree decl_function_context (tree);
4170 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4171 this _DECL with its context, or zero if none. */
4172 extern tree decl_type_context (tree);
4174 /* Return 1 if EXPR is the real constant zero. */
4175 extern int real_zerop (tree);
4177 /* Declare commonly used variables for tree structure. */
4179 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4180 Zero means allow extended lvalues. */
4182 extern int pedantic_lvalues;
4184 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4186 extern GTY(()) tree current_function_decl;
4188 /* Nonzero means a FUNC_BEGIN label was emitted. */
4189 extern GTY(()) const char * current_function_func_begin_label;
4192 extern unsigned crc32_string (unsigned, const char *);
4193 extern void clean_symbol_name (char *);
4194 extern tree get_file_function_name (const char *);
4195 extern tree get_callee_fndecl (tree);
4196 extern void change_decl_assembler_name (tree, tree);
4197 extern int type_num_arguments (tree);
4198 extern bool associative_tree_code (enum tree_code);
4199 extern bool commutative_tree_code (enum tree_code);
4200 extern tree upper_bound_in_type (tree, tree);
4201 extern tree lower_bound_in_type (tree, tree);
4202 extern int operand_equal_for_phi_arg_p (tree, tree);
4203 extern bool empty_body_p (tree);
4207 extern void expand_expr_stmt (tree);
4208 extern int warn_if_unused_value (tree, location_t);
4209 extern void expand_label (tree);
4210 extern void expand_goto (tree);
4212 extern rtx expand_stack_save (void);
4213 extern void expand_stack_restore (tree);
4214 extern void expand_return (tree);
4215 extern int is_body_block (tree);
4218 extern void using_eh_for_cleanups (void);
4220 /* In fold-const.c */
4222 /* Non-zero if we are folding constants inside an initializer; zero
4224 extern int folding_initializer;
4226 /* Fold constants as much as possible in an expression.
4227 Returns the simplified expression.
4228 Acts only on the top level of the expression;
4229 if the argument itself cannot be simplified, its
4230 subexpressions are not changed. */
4232 extern tree fold (tree);
4233 extern tree fold_unary (enum tree_code, tree, tree);
4234 extern tree fold_binary (enum tree_code, tree, tree, tree);
4235 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4236 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4237 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4238 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4239 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4240 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4241 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4242 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4243 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4244 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4245 extern tree fold_convert (tree, tree);
4246 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4247 extern tree fold_ignored_result (tree);
4248 extern tree fold_abs_const (tree, tree);
4249 extern tree fold_indirect_ref_1 (tree, tree);
4250 extern void fold_defer_overflow_warnings (void);
4251 extern void fold_undefer_overflow_warnings (bool, tree, int);
4252 extern void fold_undefer_and_ignore_overflow_warnings (void);
4253 extern bool fold_deferring_overflow_warnings_p (void);
4255 extern tree force_fit_type (tree, int, bool, bool);
4257 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4258 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4259 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4261 #define add_double(l1,h1,l2,h2,lv,hv) \
4262 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4263 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4264 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4265 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4266 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4267 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4269 #define mul_double(l1,h1,l2,h2,lv,hv) \
4270 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4271 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4272 HOST_WIDE_INT, unsigned int,
4273 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4274 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4275 HOST_WIDE_INT, unsigned int,
4276 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4277 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4278 HOST_WIDE_INT, unsigned int,
4279 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4280 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4281 HOST_WIDE_INT, unsigned int,
4282 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4284 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4285 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4286 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4287 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4290 enum operand_equal_flag
4296 extern int operand_equal_p (tree, tree, unsigned int);
4298 extern tree omit_one_operand (tree, tree, tree);
4299 extern tree omit_two_operands (tree, tree, tree, tree);
4300 extern tree invert_truthvalue (tree);
4301 extern tree fold_truth_not_expr (tree);
4302 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4303 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4304 extern tree fold_read_from_constant_string (tree);
4305 extern tree int_const_binop (enum tree_code, tree, tree, int);
4306 extern tree build_fold_addr_expr (tree);
4307 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4308 extern tree fold_strip_sign_ops (tree);
4309 extern tree build_fold_addr_expr_with_type (tree, tree);
4310 extern tree build_fold_indirect_ref (tree);
4311 extern tree fold_indirect_ref (tree);
4312 extern tree constant_boolean_node (int, tree);
4313 extern tree build_low_bits_mask (tree, unsigned);
4315 extern bool tree_swap_operands_p (tree, tree, bool);
4316 extern void swap_tree_operands (tree, tree *, tree *);
4317 extern enum tree_code swap_tree_comparison (enum tree_code);
4319 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4320 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4322 extern bool tree_expr_nonzero_p (tree);
4323 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4326 extern tree fold_builtin (tree, tree, bool);
4327 extern tree fold_builtin_fputs (tree, bool, bool, tree);
4328 extern tree fold_builtin_strcpy (tree, tree, tree);
4329 extern tree fold_builtin_strncpy (tree, tree, tree);
4330 extern tree fold_builtin_memory_chk (tree, tree, tree, bool,
4331 enum built_in_function);
4332 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, bool,
4333 enum built_in_function);
4334 extern tree fold_builtin_strncpy_chk (tree, tree);
4335 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4336 extern bool fold_builtin_next_arg (tree);
4337 extern enum built_in_function builtin_mathfn_code (tree);
4338 extern tree build_function_call_expr (tree, tree);
4339 extern tree mathfn_built_in (tree, enum built_in_function fn);
4340 extern tree strip_float_extensions (tree);
4341 extern tree c_strlen (tree, int);
4342 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4343 extern tree build_va_arg_indirect_ref (tree);
4344 tree build_string_literal (int, const char *);
4347 extern tree strip_float_extensions (tree);
4350 extern void record_component_aliases (tree);
4351 extern HOST_WIDE_INT get_alias_set (tree);
4352 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4353 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4354 extern int objects_must_conflict_p (tree, tree);
4357 extern int really_constant_p (tree);
4358 extern int int_fits_type_p (tree, tree);
4359 extern bool variably_modified_type_p (tree, tree);
4360 extern int tree_log2 (tree);
4361 extern int tree_floor_log2 (tree);
4362 extern int simple_cst_equal (tree, tree);
4363 extern hashval_t iterative_hash_expr (tree, hashval_t);
4364 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
4365 extern int type_list_equal (tree, tree);
4366 extern int chain_member (tree, tree);
4367 extern tree type_hash_lookup (unsigned int, tree);
4368 extern void type_hash_add (unsigned int, tree);
4369 extern int simple_cst_list_equal (tree, tree);
4370 extern void dump_tree_statistics (void);
4371 extern void expand_function_end (void);
4372 extern void expand_function_start (tree);
4373 extern void stack_protect_prologue (void);
4374 extern void stack_protect_epilogue (void);
4375 extern void recompute_tree_invariant_for_addr_expr (tree);
4376 extern bool is_global_var (tree t);
4377 extern bool needs_to_live_in_memory (tree);
4378 extern tree reconstruct_complex_type (tree, tree);
4380 extern int real_onep (tree);
4381 extern int real_twop (tree);
4382 extern int real_minus_onep (tree);
4383 extern void init_ttree (void);
4384 extern void build_common_tree_nodes (bool, bool);
4385 extern void build_common_tree_nodes_2 (int);
4386 extern void build_common_builtin_nodes (void);
4387 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4388 extern tree build_range_type (tree, tree, tree);
4389 extern HOST_WIDE_INT int_cst_value (tree);
4390 extern tree tree_fold_gcd (tree, tree);
4391 extern tree build_addr (tree, tree);
4393 extern bool fields_compatible_p (tree, tree);
4394 extern tree find_compatible_field (tree, tree);
4397 extern void expand_main_function (void);
4398 extern void init_dummy_function_start (void);
4399 extern void expand_dummy_function_end (void);
4400 extern unsigned int init_function_for_compilation (void);
4401 extern void allocate_struct_function (tree);
4402 extern void init_function_start (tree);
4403 extern bool use_register_for_decl (tree);
4404 extern void setjmp_vars_warning (tree);
4405 extern void setjmp_args_warning (void);
4406 extern void init_temp_slots (void);
4407 extern void free_temp_slots (void);
4408 extern void pop_temp_slots (void);
4409 extern void push_temp_slots (void);
4410 extern void preserve_temp_slots (rtx);
4411 extern int aggregate_value_p (tree, tree);
4412 extern void push_function_context (void);
4413 extern void pop_function_context (void);
4414 extern void push_function_context_to (tree);
4415 extern void pop_function_context_from (tree);
4416 extern tree gimplify_parameters (void);
4418 /* In print-rtl.c */
4420 extern void print_rtl (FILE *, rtx);
4423 /* In print-tree.c */
4424 extern void debug_tree (tree);
4426 extern void dump_addr (FILE*, const char *, void *);
4427 extern void print_node (FILE *, const char *, tree, int);
4428 extern void print_node_brief (FILE *, const char *, tree, int);
4429 extern void indent_to (FILE *, int);
4432 /* In tree-inline.c: */
4433 extern bool debug_find_tree (tree, tree);
4434 /* This is in tree-inline.c since the routine uses
4435 data structures from the inliner. */
4436 extern tree unsave_expr_now (tree);
4437 extern tree build_duplicate_type (tree);
4440 extern rtx emit_line_note (location_t);
4444 /* Nonzero if this is a call to a function whose return value depends
4445 solely on its arguments, has no side effects, and does not read
4448 /* Nonzero if this call will never return. */
4449 #define ECF_NORETURN 2
4450 /* Nonzero if this is a call to malloc or a related function. */
4451 #define ECF_MALLOC 4
4452 /* Nonzero if it is plausible that this is a call to alloca. */
4453 #define ECF_MAY_BE_ALLOCA 8
4454 /* Nonzero if this is a call to a function that won't throw an exception. */
4455 #define ECF_NOTHROW 16
4456 /* Nonzero if this is a call to setjmp or a related function. */
4457 #define ECF_RETURNS_TWICE 32
4458 /* Nonzero if this call replaces the current stack frame. */
4459 #define ECF_SIBCALL 64
4460 /* Nonzero if this is a call to "pure" function (like const function,
4461 but may read memory. */
4462 #define ECF_PURE 128
4463 /* Nonzero if this is a call to a function that returns with the stack
4464 pointer depressed. */
4465 #define ECF_SP_DEPRESSED 256
4466 /* Create libcall block around the call. */
4467 #define ECF_LIBCALL_BLOCK 512
4468 /* Function does not read or write memory (but may have side effects, so
4469 it does not necessarily fit ECF_CONST). */
4470 #define ECF_NOVOPS 1024
4472 extern int flags_from_decl_or_type (tree);
4473 extern int call_expr_flags (tree);
4475 extern int setjmp_call_p (tree);
4476 extern bool alloca_call_p (tree);
4477 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
4478 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
4482 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4483 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4484 it should be modified in place; if a TYPE, a copy should be created
4485 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4486 information, in the form of a bitwise OR of flags in enum attribute_flags
4487 from tree.h. Depending on these flags, some attributes may be
4488 returned to be applied at a later stage (for example, to apply
4489 a decl attribute to the declaration rather than to its type). */
4490 extern tree decl_attributes (tree *, tree, int);
4492 /* In integrate.c */
4493 extern void set_decl_abstract_flags (tree, int);
4494 extern void set_decl_origin_self (tree);
4496 /* In stor-layout.c */
4497 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
4498 extern void fixup_signed_type (tree);
4499 extern void internal_reference_types (void);
4500 extern unsigned int update_alignment_for_field (record_layout_info, tree,
4503 extern void make_decl_rtl (tree);
4504 extern void make_decl_one_only (tree);
4505 extern int supports_one_only (void);
4506 extern void resolve_unique_section (tree, int, int);
4507 extern void mark_referenced (tree);
4508 extern void mark_decl_referenced (tree);
4509 extern void notice_global_symbol (tree);
4510 extern void set_user_assembler_name (tree, const char *);
4511 extern void process_pending_assemble_externals (void);
4512 extern void finish_aliases_1 (void);
4513 extern void finish_aliases_2 (void);
4516 extern void expand_computed_goto (tree);
4517 extern bool parse_output_constraint (const char **, int, int, int,
4518 bool *, bool *, bool *);
4519 extern bool parse_input_constraint (const char **, int, int, int, int,
4520 const char * const *, bool *, bool *);
4521 extern void expand_asm_expr (tree);
4522 extern tree resolve_asm_operand_names (tree, tree, tree);
4523 extern void expand_case (tree);
4524 extern void expand_decl (tree);
4525 extern void expand_anon_union_decl (tree, tree, tree);
4527 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4528 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
4531 /* In gimplify.c. */
4532 extern tree create_artificial_label (void);
4533 extern void gimplify_function_tree (tree);
4534 extern const char *get_name (tree);
4535 extern tree unshare_expr (tree);
4536 extern void sort_case_labels (tree);
4538 /* Interface of the DWARF2 unwind info support. */
4540 /* Generate a new label for the CFI info to refer to. */
4542 extern char *dwarf2out_cfi_label (void);
4544 /* Entry point to update the canonical frame address (CFA). */
4546 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
4548 /* Add the CFI for saving a register window. */
4550 extern void dwarf2out_window_save (const char *);
4552 /* Add a CFI to update the running total of the size of arguments pushed
4555 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
4557 /* Entry point for saving a register to the stack. */
4559 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
4561 /* Entry point for saving the return address in the stack. */
4563 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
4565 /* Entry point for saving the return address in a register. */
4567 extern void dwarf2out_return_reg (const char *, unsigned);
4569 /* Entry point for saving the first register into the second. */
4571 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
4573 /* In tree-inline.c */
4575 /* The type of a set of already-visited pointers. Functions for creating
4576 and manipulating it are declared in pointer-set.h */
4577 struct pointer_set_t;
4579 /* The type of a callback function for walking over tree structure. */
4581 typedef tree (*walk_tree_fn) (tree *, int *, void *);
4582 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
4583 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
4585 /* Assign the RTX to declaration. */
4587 extern void set_decl_rtl (tree, rtx);
4588 extern void set_decl_incoming_rtl (tree, rtx);
4590 /* Enum and arrays used for tree allocation stats.
4591 Keep in sync with tree.c:tree_node_kind_names. */
4616 extern int tree_node_counts[];
4617 extern int tree_node_sizes[];
4619 /* True if we are in gimple form and the actions of the folders need to
4620 be restricted. False if we are not in gimple form and folding is not
4621 restricted to creating gimple expressions. */
4622 extern bool in_gimple_form;
4624 /* In tree-gimple.c. */
4625 extern tree get_base_address (tree t);
4627 /* In tree-vectorizer.c. */
4628 extern void vect_set_verbosity_level (const char *);
4630 struct tree_map GTY(())
4637 extern unsigned int tree_map_hash (const void *);
4638 extern int tree_map_marked_p (const void *);
4639 extern int tree_map_eq (const void *, const void *);
4641 /* In tree-ssa-address.c. */
4642 extern tree tree_mem_ref_addr (tree, tree);
4643 extern void copy_mem_ref_info (tree, tree);
4646 extern bool ssa_name_nonzero_p (tree);
4647 extern bool ssa_name_nonnegative_p (tree);
4649 /* In tree-object-size.c. */
4650 extern void init_object_sizes (void);
4651 extern void fini_object_sizes (void);
4652 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
4655 extern unsigned HOST_WIDE_INT highest_pow2_factor (tree);
4657 #endif /* GCC_TREE_H */