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;
389 /* APPLE LOCAL "unavailable" attribute (Radar 2809697) --ilr */
390 unsigned unavailable_flag : 1;
393 /* The following table lists the uses of each of the above flags and
394 for which types of nodes they are defined. Note that expressions
400 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
401 ..._TYPE, IDENTIFIER_NODE.
402 In a STMT_EXPR, it means we want the result of the enclosed
404 CALL_EXPR_TAILCALL in CALL_EXPR
405 CASE_LOW_SEEN in CASE_LABEL_EXPR
410 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
413 TREE_CONSTANT_OVERFLOW in
414 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
415 TREE_SYMBOL_REFERENCED in
418 TARGET_EXPR, WITH_CLEANUP_EXPR
421 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
422 TYPE_REF_CAN_ALIAS_ALL in
423 POINTER_TYPE, REFERENCE_TYPE
424 CASE_HIGH_SEEN in CASE_LABEL_EXPR
429 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
431 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
434 TYPE_CACHED_VALUES_P in
436 SAVE_EXPR_RESOLVED_P in
438 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
439 OMP_CLAUSE_LASTPRIVATE
440 OMP_CLAUSE_PRIVATE_DEBUG in
447 CALL_EXPR_RETURN_SLOT_OPT in
450 PARM_DECL, RESULT_DECL
455 OMP_PARALLEL_COMBINED in
478 TREE_THIS_VOLATILE in
496 TYPE_SIZES_GIMPLIFIED
505 BIT_FIELD_REF_UNSIGNED in
511 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
517 expressions, IDENTIFIER_NODE
522 CALL_EXPR, FUNCTION_DECL
528 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
535 IDENTIFIER_TRANSPARENT_ALIAS in
538 APPLE LOCAL begin "unavailable" attribute (Radar 2809697)
543 APPLE LOCAL end "unavailable" attribute (Radar 2809697)
547 Used in tree traversals to mark visited nodes.
557 ... any expr or decl node
560 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
561 enum tree_node_structure_enum {
562 #include "treestruct.def"
567 /* Define accessors for the fields that all tree nodes have
568 (though some fields are not used for all kinds of nodes). */
570 /* The tree-code says what kind of node it is.
571 Codes are defined in tree.def. */
572 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
573 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
575 /* When checking is enabled, errors will be generated if a tree node
576 is accessed incorrectly. The macros die with a fatal error. */
577 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
579 #define TREE_CHECK(T, CODE) __extension__ \
580 ({ const tree __t = (T); \
581 if (TREE_CODE (__t) != (CODE)) \
582 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
586 #define TREE_NOT_CHECK(T, CODE) __extension__ \
587 ({ const tree __t = (T); \
588 if (TREE_CODE (__t) == (CODE)) \
589 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
593 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
594 ({ const tree __t = (T); \
595 if (TREE_CODE (__t) != (CODE1) \
596 && TREE_CODE (__t) != (CODE2)) \
597 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
598 (CODE1), (CODE2), 0); \
601 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
602 ({ const tree __t = (T); \
603 if (TREE_CODE (__t) == (CODE1) \
604 || TREE_CODE (__t) == (CODE2)) \
605 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
606 (CODE1), (CODE2), 0); \
609 #define TREE_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_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
615 (CODE1), (CODE2), (CODE3), 0); \
618 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
619 ({ const tree __t = (T); \
620 if (TREE_CODE (__t) == (CODE1) \
621 || TREE_CODE (__t) == (CODE2) \
622 || TREE_CODE (__t) == (CODE3)) \
623 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
624 (CODE1), (CODE2), (CODE3), 0); \
627 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
628 ({ const tree __t = (T); \
629 if (TREE_CODE (__t) != (CODE1) \
630 && TREE_CODE (__t) != (CODE2) \
631 && TREE_CODE (__t) != (CODE3) \
632 && TREE_CODE (__t) != (CODE4)) \
633 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
634 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
637 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
638 ({ const tree __t = (T); \
639 if (TREE_CODE (__t) == (CODE1) \
640 || TREE_CODE (__t) == (CODE2) \
641 || TREE_CODE (__t) == (CODE3) \
642 || TREE_CODE (__t) == (CODE4)) \
643 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
644 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
647 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
648 ({ const tree __t = (T); \
649 if (TREE_CODE (__t) != (CODE1) \
650 && TREE_CODE (__t) != (CODE2) \
651 && TREE_CODE (__t) != (CODE3) \
652 && TREE_CODE (__t) != (CODE4) \
653 && TREE_CODE (__t) != (CODE5)) \
654 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
655 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
658 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
659 ({ const tree __t = (T); \
660 if (TREE_CODE (__t) == (CODE1) \
661 || TREE_CODE (__t) == (CODE2) \
662 || TREE_CODE (__t) == (CODE3) \
663 || TREE_CODE (__t) == (CODE4) \
664 || TREE_CODE (__t) == (CODE5)) \
665 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
666 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
669 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
670 ({ const tree __t = (T); \
671 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
672 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
676 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
677 ({ const tree __t = (T); \
678 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
679 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
683 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
684 ({ const tree __t = (T); \
685 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
686 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
690 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
691 ({ const tree __t = (T); \
692 if (TREE_CODE (__t) != OMP_CLAUSE) \
693 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
695 if (__t->omp_clause.code != (CODE)) \
696 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
700 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
701 ({ const tree __t = (T); \
702 if (TREE_CODE (__t) != OMP_CLAUSE) \
703 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
705 if ((int) __t->omp_clause.code < (int) (CODE1) \
706 || (int) __t->omp_clause.code > (int) (CODE2)) \
707 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
708 __FUNCTION__, (CODE1), (CODE2)); \
711 /* These checks have to be special cased. */
712 #define EXPR_CHECK(T) __extension__ \
713 ({ const tree __t = (T); \
714 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
715 if (!IS_EXPR_CODE_CLASS (__c)) \
716 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
720 /* These checks have to be special cased. */
721 #define NON_TYPE_CHECK(T) __extension__ \
722 ({ const tree __t = (T); \
724 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
728 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
729 (*({const tree __t = (T); \
730 const int __i = (I); \
731 if (TREE_CODE (__t) != TREE_VEC) \
732 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
734 if (__i < 0 || __i >= __t->vec.length) \
735 tree_vec_elt_check_failed (__i, __t->vec.length, \
736 __FILE__, __LINE__, __FUNCTION__); \
737 &__t->vec.a[__i]; }))
739 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
740 (*({const tree __t = t; \
741 const int __i = (i); \
742 if (TREE_CODE (__t) != PHI_NODE) \
743 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
745 if (__i < 0 || __i >= __t->phi.capacity) \
746 phi_node_elt_check_failed (__i, __t->phi.num_args, \
747 __FILE__, __LINE__, __FUNCTION__); \
748 &__t->phi.a[__i]; }))
750 #define OMP_CLAUSE_ELT_CHECK(t, i) __extension__ \
751 (*({const tree __t = t; \
752 const int __i = (i); \
753 if (TREE_CODE (__t) != OMP_CLAUSE) \
754 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
756 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
757 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
759 &__t->omp_clause.ops[__i]; }))
761 /* Special checks for TREE_OPERANDs. */
762 #define TREE_OPERAND_CHECK(T, I) __extension__ \
763 (*({const tree __t = EXPR_CHECK (T); \
764 const int __i = (I); \
765 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
766 tree_operand_check_failed (__i, TREE_CODE (__t), \
767 __FILE__, __LINE__, __FUNCTION__); \
768 &__t->exp.operands[__i]; }))
770 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
771 (*({const tree __t = (T); \
772 const int __i = (I); \
773 if (TREE_CODE (__t) != CODE) \
774 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
775 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
776 tree_operand_check_failed (__i, (CODE), \
777 __FILE__, __LINE__, __FUNCTION__); \
778 &__t->exp.operands[__i]; }))
780 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
782 ({const tree __t = (T); \
783 const int __i = (I); \
784 if (TREE_CODE (__t) != (CODE)) \
785 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
786 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
787 tree_operand_check_failed (__i, (CODE), \
788 __FILE__, __LINE__, __FUNCTION__); \
789 &__t->exp.operands[__i]; }))
791 extern void tree_contains_struct_check_failed (const tree,
792 const enum tree_node_structure_enum,
793 const char *, int, const char *)
796 extern void tree_check_failed (const tree, const char *, int, const char *,
797 ...) ATTRIBUTE_NORETURN;
798 extern void tree_not_check_failed (const tree, const char *, int, const char *,
799 ...) ATTRIBUTE_NORETURN;
800 extern void tree_class_check_failed (const tree, const enum tree_code_class,
801 const char *, int, const char *)
803 extern void tree_range_check_failed (const tree, const char *, int,
804 const char *, enum tree_code,
806 extern void tree_not_class_check_failed (const tree,
807 const enum tree_code_class,
808 const char *, int, const char *)
810 extern void tree_vec_elt_check_failed (int, int, const char *,
813 extern void phi_node_elt_check_failed (int, int, const char *,
816 extern void tree_operand_check_failed (int, enum tree_code,
817 const char *, int, const char *)
819 extern void omp_clause_check_failed (const tree, const char *, int,
820 const char *, enum omp_clause_code)
822 extern void omp_clause_operand_check_failed (int, tree, const char *,
825 extern void omp_clause_range_check_failed (const tree, const char *, int,
826 const char *, enum omp_clause_code,
827 enum omp_clause_code)
830 #else /* not ENABLE_TREE_CHECKING, or not gcc */
832 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
833 #define TREE_CHECK(T, CODE) (T)
834 #define TREE_NOT_CHECK(T, CODE) (T)
835 #define TREE_CHECK2(T, CODE1, CODE2) (T)
836 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
837 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
838 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
839 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
840 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
841 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
842 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
843 #define TREE_CLASS_CHECK(T, CODE) (T)
844 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
845 #define EXPR_CHECK(T) (T)
846 #define NON_TYPE_CHECK(T) (T)
847 #define TREE_VEC_ELT_CHECK(T, I) __PAST_END((T)->vec.a, I)
848 #define TREE_OPERAND_CHECK(T, I) __PAST_END((T)->exp.operands, I)
849 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __PAST_END((T)->exp.operands, I)
850 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
851 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
852 #define OMP_CLAUSE_ELT_CHECK(T, i) __PAST_END((T)->omp_clause.ops, i)
853 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
854 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
858 #define TREE_BLOCK(NODE) (EXPR_CHECK (NODE)->exp.block)
860 #include "tree-check.h"
862 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
863 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
864 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
865 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
866 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
867 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
868 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
869 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
870 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
871 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
872 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
874 #define RECORD_OR_UNION_CHECK(T) \
875 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
876 #define NOT_RECORD_OR_UNION_CHECK(T) \
877 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
879 #define NUMERICAL_TYPE_CHECK(T) \
880 TREE_CHECK4 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE)
882 /* In all nodes that are expressions, this is the data type of the expression.
883 In POINTER_TYPE nodes, this is the type that the pointer points to.
884 In ARRAY_TYPE nodes, this is the type of the elements.
885 In VECTOR_TYPE nodes, this is the type of the elements. */
886 #define TREE_TYPE(NODE) ((NODE)->common.type)
888 /* Here is how primitive or already-canonicalized types' hash codes
890 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
892 /* A simple hash function for an arbitrary tree node. This must not be
893 used in hash tables which are saved to a PCH. */
894 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
896 /* Nodes are chained together for many purposes.
897 Types are chained together to record them for being output to the debugger
898 (see the function `chain_type').
899 Decls in the same scope are chained together to record the contents
901 Statement nodes for successive statements used to be chained together.
902 Often lists of things are represented by TREE_LIST nodes that
903 are chained together. */
905 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
907 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
908 that don't change the machine mode. */
910 #define STRIP_NOPS(EXP) \
911 while ((TREE_CODE (EXP) == NOP_EXPR \
912 || TREE_CODE (EXP) == CONVERT_EXPR \
913 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
914 && TREE_OPERAND (EXP, 0) != error_mark_node \
915 && (TYPE_MODE (TREE_TYPE (EXP)) \
916 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
917 (EXP) = TREE_OPERAND (EXP, 0)
919 /* Like STRIP_NOPS, but don't let the signedness change either. */
921 #define STRIP_SIGN_NOPS(EXP) \
922 while ((TREE_CODE (EXP) == NOP_EXPR \
923 || TREE_CODE (EXP) == CONVERT_EXPR \
924 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
925 && TREE_OPERAND (EXP, 0) != error_mark_node \
926 && (TYPE_MODE (TREE_TYPE (EXP)) \
927 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
928 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
929 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
930 (EXP) = TREE_OPERAND (EXP, 0)
932 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
934 #define STRIP_TYPE_NOPS(EXP) \
935 while ((TREE_CODE (EXP) == NOP_EXPR \
936 || TREE_CODE (EXP) == CONVERT_EXPR \
937 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
938 && TREE_OPERAND (EXP, 0) != error_mark_node \
939 && (TREE_TYPE (EXP) \
940 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
941 (EXP) = TREE_OPERAND (EXP, 0)
943 /* Remove unnecessary type conversions according to
944 tree_ssa_useless_type_conversion. */
946 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
947 while (tree_ssa_useless_type_conversion (EXP)) \
948 EXP = TREE_OPERAND (EXP, 0)
950 /* Nonzero if TYPE represents an integral type. Note that we do not
951 include COMPLEX types here. Keep these checks in ascending code
954 #define INTEGRAL_TYPE_P(TYPE) \
955 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
956 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
957 || TREE_CODE (TYPE) == INTEGER_TYPE)
959 /* Nonzero if TYPE represents a scalar floating-point type. */
961 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
963 /* Nonzero if TYPE represents a complex floating-point type. */
965 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
966 (TREE_CODE (TYPE) == COMPLEX_TYPE \
967 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
969 /* Nonzero if TYPE represents a vector floating-point type. */
971 #define VECTOR_FLOAT_TYPE_P(TYPE) \
972 (TREE_CODE (TYPE) == VECTOR_TYPE \
973 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
975 /* Nonzero if TYPE represents a floating-point type, including complex
976 and vector floating-point types. The vector and complex check does
977 not use the previous two macros to enable early folding. */
979 #define FLOAT_TYPE_P(TYPE) \
980 (SCALAR_FLOAT_TYPE_P (TYPE) \
981 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
982 || TREE_CODE (TYPE) == VECTOR_TYPE) \
983 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
985 /* Nonzero if TYPE represents a decimal floating-point type. */
986 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
987 (SCALAR_FLOAT_TYPE_P (TYPE) \
988 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
990 /* Nonzero if TYPE represents an aggregate (multi-component) type.
991 Keep these checks in ascending code order. */
993 #define AGGREGATE_TYPE_P(TYPE) \
994 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
995 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
997 /* Nonzero if TYPE represents a pointer or reference type.
998 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
999 ascending code order. */
1001 #define POINTER_TYPE_P(TYPE) \
1002 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1004 /* Nonzero if this type is a complete type. */
1005 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1007 /* Nonzero if this type is the (possibly qualified) void type. */
1008 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1010 /* Nonzero if this type is complete or is cv void. */
1011 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1012 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1014 /* Nonzero if this type is complete or is an array with unspecified bound. */
1015 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1016 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1019 /* Define many boolean fields that all tree nodes have. */
1021 /* In VAR_DECL nodes, nonzero means address of this is needed.
1022 So it cannot be in a register.
1023 In a FUNCTION_DECL, nonzero means its address is needed.
1024 So it must be compiled even if it is an inline function.
1025 In a FIELD_DECL node, it means that the programmer is permitted to
1026 construct the address of this field. This is used for aliasing
1027 purposes: see record_component_aliases.
1028 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1029 In LABEL_DECL nodes, it means a goto for this label has been seen
1030 from a place outside all binding contours that restore stack levels.
1031 In ..._TYPE nodes, it means that objects of this type must
1032 be fully addressable. This means that pieces of this
1033 object cannot go into register parameters, for example.
1034 In IDENTIFIER_NODEs, this means that some extern decl for this name
1035 had its address taken. That matters for inline functions. */
1036 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
1038 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1039 exit of a function. Calls for which this is true are candidates for tail
1040 call optimizations. */
1041 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
1043 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1044 CASE_LOW operand has been processed. */
1045 #define CASE_LOW_SEEN(NODE) \
1046 (CASE_LABEL_EXPR_CHECK (NODE)->common.addressable_flag)
1048 /* In a VAR_DECL, nonzero means allocate static storage.
1049 In a FUNCTION_DECL, nonzero if function has been defined.
1050 In a CONSTRUCTOR, nonzero means allocate static storage.
1052 ??? This is also used in lots of other nodes in unclear ways which
1053 should be cleaned up some day. */
1054 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
1056 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
1057 should only be executed if an exception is thrown, not on normal exit
1059 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
1061 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1062 CASE_HIGH operand has been processed. */
1063 #define CASE_HIGH_SEEN(NODE) \
1064 (CASE_LABEL_EXPR_CHECK (NODE)->common.static_flag)
1066 /* In an expr node (usually a conversion) this means the node was made
1067 implicitly and should not lead to any sort of warning. In a decl node,
1068 warnings concerning the decl should be suppressed. This is used at
1069 least for used-before-set warnings, and it set after one warning is
1071 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
1073 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
1074 there was an overflow in folding. This is distinct from
1075 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
1076 occur in constant expressions. */
1077 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
1079 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1080 this string as an argument. */
1081 #define TREE_SYMBOL_REFERENCED(NODE) \
1082 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
1084 /* Nonzero in a pointer or reference type means the data pointed to
1085 by this type can alias anything. */
1086 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1087 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
1089 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1090 there was an overflow in folding, and no warning has been issued
1091 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
1092 but not vice versa. */
1094 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->common.public_flag)
1096 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1098 #define TREE_OVERFLOW_P(EXPR) \
1099 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1101 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1102 nonzero means name is to be accessible from outside this module.
1103 In an IDENTIFIER_NODE, nonzero means an external declaration
1104 accessible from outside this module was previously seen
1105 for this name in an inner scope. */
1106 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
1108 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1109 of cached values, or is something else. */
1110 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->common.public_flag)
1112 /* In a SAVE_EXPR, indicates that the original expression has already
1113 been substituted with a VAR_DECL that contains the value. */
1114 #define SAVE_EXPR_RESOLVED_P(NODE) \
1115 (TREE_CHECK (NODE, SAVE_EXPR)->common.public_flag)
1117 /* In any expression, decl, or constant, nonzero means it has side effects or
1118 reevaluation of the whole expression could produce a different value.
1119 This is set if any subexpression is a function call, a side effect or a
1120 reference to a volatile variable. In a ..._DECL, this is set only if the
1121 declaration said `volatile'. This will never be set for a constant. */
1122 #define TREE_SIDE_EFFECTS(NODE) \
1123 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
1125 /* In a LABEL_DECL, nonzero means this label had its address taken
1126 and therefore can never be deleted and is a jump target for
1128 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
1130 /* Nonzero means this expression is volatile in the C sense:
1131 its address should be of type `volatile WHATEVER *'.
1132 In other words, the declared item is volatile qualified.
1133 This is used in _DECL nodes and _REF nodes.
1134 On a FUNCTION_DECL node, this means the function does not
1135 return normally. This is the same effect as setting
1136 the attribute noreturn on the function in C.
1138 In a ..._TYPE node, means this type is volatile-qualified.
1139 But use TYPE_VOLATILE instead of this macro when the node is a type,
1140 because eventually we may make that a different bit.
1142 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1143 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
1145 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1146 accessing the memory pointed to won't generate a trap. However,
1147 this only applies to an object when used appropriately: it doesn't
1148 mean that writing a READONLY mem won't trap. Similarly for
1149 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1151 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1152 (or slice of the array) always belongs to the range of the array.
1153 I.e. that the access will not trap, provided that the access to
1154 the base to the array will not trap. */
1155 #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag)
1157 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1158 nonzero means it may not be the lhs of an assignment. */
1159 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
1161 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1162 #define TREE_READONLY_DECL_P(NODE)\
1163 (DECL_P (NODE) && TREE_READONLY (NODE))
1165 /* Value of expression is constant. Always on in all ..._CST nodes. May
1166 also appear in an expression or decl where the value is constant. */
1167 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
1169 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1170 #define TYPE_SIZES_GIMPLIFIED(NODE) (TYPE_CHECK (NODE)->common.constant_flag)
1172 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1173 #define DECL_UNSIGNED(NODE) (DECL_COMMON_CHECK (NODE)->common.unsigned_flag)
1175 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1176 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1177 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
1179 /* In integral and pointer types, means an unsigned type. */
1180 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
1182 /* Nonzero in a VAR_DECL means assembler code has been written.
1183 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1184 This is interesting in an inline function, since it might not need
1185 to be compiled separately.
1186 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1187 if the sdb debugging info for the type has been written.
1188 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1189 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1191 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
1193 /* Nonzero in a _DECL if the name is used in its scope.
1194 Nonzero in an expr node means inhibit warning if value is unused.
1195 In IDENTIFIER_NODEs, this means that some extern decl for this name
1197 In a BLOCK, this means that the block contains variables that are used. */
1198 #define TREE_USED(NODE) ((NODE)->common.used_flag)
1200 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1201 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1202 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
1204 /* In a CALL_EXPR, means that it's safe to use the target of the call
1205 expansion as the return slot for a call that returns in memory. */
1206 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->common.private_flag)
1208 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1209 reference (and the TREE_TYPE is a pointer to the true type). */
1210 #define DECL_BY_REFERENCE(NODE) (DECL_COMMON_CHECK (NODE)->common.private_flag)
1212 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1213 thunked-to function. */
1214 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->common.protected_flag)
1216 /* In a type, nonzero means that all objects of the type are guaranteed by the
1217 language or front-end to be properly aligned, so we can indicate that a MEM
1218 of this type is aligned at least to the alignment of the type, even if it
1219 doesn't appear that it is. We see this, for example, in object-oriented
1220 languages where a tag field may show this is an object of a more-aligned
1221 variant of the more generic type.
1223 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1225 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
1227 /* Used in classes in C++. */
1228 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
1229 /* Used in classes in C++.
1230 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1231 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
1233 /* Nonzero in a _DECL if the use of the name is defined as a
1234 deprecated feature by __attribute__((deprecated)). */
1235 #define TREE_DEPRECATED(NODE) \
1236 ((NODE)->common.deprecated_flag)
1238 /* APPLE LOCAL begin "unavailable" attribute (Radar 2809697) */
1239 /* Nonzero in a IDENTIFIER_NODE if the use of the name is defined as a
1240 unavailable feature by __attribute__((unavailable)). */
1241 #define TREE_UNAVAILABLE(NODE) ((NODE)->common.unavailable_flag)
1242 /* APPLE LOCAL end "unavailable" attribute (Radar 2809697) */
1244 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1245 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1246 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1247 (IDENTIFIER_NODE_CHECK (NODE)->common.deprecated_flag)
1249 /* Value of expression is function invariant. A strict subset of
1250 TREE_CONSTANT, such an expression is constant over any one function
1251 invocation, though not across different invocations. May appear in
1252 any expression node. */
1253 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
1255 /* These flags are available for each language front end to use internally. */
1256 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
1257 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
1258 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
1259 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
1260 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
1261 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
1262 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
1264 /* Define additional fields and accessors for nodes representing constants. */
1266 /* In an INTEGER_CST node. These two together make a 2-word integer.
1267 If the data type is signed, the value is sign-extended to 2 words
1268 even though not all of them may really be in use.
1269 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1270 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1271 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1272 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1274 #define INT_CST_LT(A, B) \
1275 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1276 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1277 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1279 #define INT_CST_LT_UNSIGNED(A, B) \
1280 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1281 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1282 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1283 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1284 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1286 struct tree_int_cst GTY(())
1288 struct tree_common common;
1292 /* In a REAL_CST node. struct real_value is an opaque entity, with
1293 manipulators defined in real.h. We don't want tree.h depending on
1294 real.h and transitively on tm.h. */
1297 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1298 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1300 struct tree_real_cst GTY(())
1302 struct tree_common common;
1303 struct real_value * real_cst_ptr;
1306 /* In a STRING_CST */
1307 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1308 #define TREE_STRING_POINTER(NODE) \
1309 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1311 struct tree_string GTY(())
1313 struct tree_common common;
1318 /* In a COMPLEX_CST node. */
1319 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1320 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1322 struct tree_complex GTY(())
1324 struct tree_common common;
1329 /* In a VECTOR_CST node. */
1330 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1332 struct tree_vector GTY(())
1334 struct tree_common common;
1340 /* Define fields and accessors for some special-purpose tree nodes. */
1342 #define IDENTIFIER_LENGTH(NODE) \
1343 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1344 #define IDENTIFIER_POINTER(NODE) \
1345 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1346 #define IDENTIFIER_HASH_VALUE(NODE) \
1347 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1349 /* Translate a hash table identifier pointer to a tree_identifier
1350 pointer, and vice versa. */
1352 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1353 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1354 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1356 struct tree_identifier GTY(())
1358 struct tree_common common;
1359 struct ht_identifier id;
1362 /* In a TREE_LIST node. */
1363 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1364 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1366 struct tree_list GTY(())
1368 struct tree_common common;
1373 /* In a TREE_VEC node. */
1374 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1375 #define TREE_VEC_END(NODE) \
1376 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1378 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1380 struct tree_vec GTY(())
1382 struct tree_common common;
1384 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1387 /* In a CONSTRUCTOR node. */
1388 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1390 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1391 value of each element (stored within VAL). IX must be a scratch variable
1392 of unsigned integer type. */
1393 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1394 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1396 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1400 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1401 the value of each element (stored within VAL) and its index (stored
1402 within INDEX). IX must be a scratch variable of unsigned integer type. */
1403 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1404 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1406 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1407 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1411 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1412 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1414 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1415 _ce___->index = INDEX; \
1416 _ce___->value = VALUE; \
1419 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1420 element. INDEX can optionally design the position of VALUE: in arrays,
1421 it is the index where VALUE has to be placed; in structures, it is the
1422 FIELD_DECL of the member. */
1423 typedef struct constructor_elt_d GTY(())
1429 DEF_VEC_O(constructor_elt);
1430 DEF_VEC_ALLOC_O(constructor_elt,gc);
1432 struct tree_constructor GTY(())
1434 struct tree_common common;
1435 VEC(constructor_elt,gc) *elts;
1438 /* Define fields and accessors for some nodes that represent expressions. */
1440 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1441 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1442 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1443 && integer_zerop (TREE_OPERAND (NODE, 0)))
1445 /* In ordinary expression nodes. */
1446 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1447 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1449 /* In a LOOP_EXPR node. */
1450 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1452 #ifdef USE_MAPPED_LOCATION
1453 /* The source location of this expression. Non-tree_exp nodes such as
1454 decls and constants can be shared among multiple locations, so
1456 #define EXPR_LOCATION(NODE) \
1457 (EXPR_P (NODE) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1458 #define SET_EXPR_LOCATION(NODE, FROM) \
1459 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1460 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1461 /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */
1462 #define EXPR_LOCUS(NODE) \
1463 (EXPR_P (NODE) ? &(NODE)->exp.locus : (location_t *)NULL)
1464 #define SET_EXPR_LOCUS(NODE, FROM) \
1465 do { source_location *loc_tmp = FROM; \
1466 EXPR_CHECK (NODE)->exp.locus \
1467 = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0)
1468 #define EXPR_FILENAME(NODE) \
1469 LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus)
1470 #define EXPR_LINENO(NODE) \
1471 LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1473 /* The source location of this expression. Non-tree_exp nodes such as
1474 decls and constants can be shared among multiple locations, so
1476 #define EXPR_LOCUS(NODE) \
1477 (EXPR_P (NODE) ? (NODE)->exp.locus : (location_t *)NULL)
1478 #define SET_EXPR_LOCUS(NODE, FROM) \
1479 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1480 #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM)
1481 #define EXPR_FILENAME(NODE) \
1482 (EXPR_CHECK (NODE)->exp.locus->file)
1483 #define EXPR_LINENO(NODE) \
1484 (EXPR_CHECK (NODE)->exp.locus->line)
1485 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1486 #define EXPR_LOCATION(NODE) \
1487 (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION)
1490 /* In a TARGET_EXPR node. */
1491 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1492 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1493 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1495 /* DECL_EXPR accessor. This gives access to the DECL associated with
1496 the given declaration statement. */
1497 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1499 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1501 /* SWITCH_EXPR accessors. These give access to the condition, body and
1502 original condition type (before any compiler conversions)
1503 of the switch statement, respectively. */
1504 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1505 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1506 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1508 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1509 of a case label, respectively. */
1510 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1511 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1512 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1514 /* The operands of a TARGET_MEM_REF. */
1515 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1516 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1517 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1518 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1519 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1520 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1521 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1523 /* The operands of a BIND_EXPR. */
1524 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1525 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1526 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1528 /* GOTO_EXPR accessor. This gives access to the label associated with
1529 a goto statement. */
1530 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1532 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1533 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1534 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1536 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1537 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1538 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1539 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1540 /* Nonzero if we want to create an ASM_INPUT instead of an
1541 ASM_OPERAND with no operands. */
1542 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1543 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1545 /* COND_EXPR accessors. */
1546 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1547 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1548 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1550 /* LABEL_EXPR accessor. This gives access to the label associated with
1551 the given label expression. */
1552 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1554 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1555 accessors for SSA operands. */
1557 /* CATCH_EXPR accessors. */
1558 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1559 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1561 /* EH_FILTER_EXPR accessors. */
1562 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1563 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1564 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1566 /* OBJ_TYPE_REF accessors. */
1567 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1568 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1569 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1571 /* ASSERT_EXPR accessors. */
1572 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1573 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1575 /* OpenMP directive and clause accessors. */
1577 #define OMP_BODY(NODE) \
1578 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1579 #define OMP_CLAUSES(NODE) \
1580 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1582 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1583 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1584 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1585 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1587 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1588 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1589 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1590 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1591 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1592 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1594 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1595 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1597 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1599 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1600 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1602 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1604 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1606 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1607 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1609 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1610 #define OMP_CLAUSE_DECL(NODE) \
1611 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1612 OMP_CLAUSE_PRIVATE, \
1613 OMP_CLAUSE_COPYPRIVATE), 0)
1615 /* True on an OMP_SECTION statement that was the last lexical member.
1616 This status is meaningful in the implementation of lastprivate. */
1617 #define OMP_SECTION_LAST(NODE) \
1618 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1620 /* True on an OMP_RETURN statement if the return does not require a
1621 thread synchronization via some sort of barrier. The exact barrier
1622 that would otherwise be emitted is dependent on the OMP statement
1623 with which this return is associated. */
1624 #define OMP_RETURN_NOWAIT(NODE) \
1625 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1627 /* True on an OMP_PARALLEL statement if it represents an explicit
1628 combined parallel work-sharing constructs. */
1629 #define OMP_PARALLEL_COMBINED(NODE) \
1630 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1632 /* True on a PRIVATE clause if its decl is kept around for debugging
1633 information only and its DECL_VALUE_EXPR is supposed to point
1634 to what it has been remapped to. */
1635 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1636 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1638 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1639 decl is present in the chain. */
1640 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1641 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1643 #define OMP_CLAUSE_IF_EXPR(NODE) \
1644 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1645 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1646 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1647 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1648 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1650 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1651 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1652 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1653 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1654 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1655 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1656 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1657 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1659 enum omp_clause_schedule_kind
1661 OMP_CLAUSE_SCHEDULE_STATIC,
1662 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1663 OMP_CLAUSE_SCHEDULE_GUIDED,
1664 OMP_CLAUSE_SCHEDULE_RUNTIME
1667 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1668 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1670 enum omp_clause_default_kind
1672 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1673 OMP_CLAUSE_DEFAULT_SHARED,
1674 OMP_CLAUSE_DEFAULT_NONE,
1675 OMP_CLAUSE_DEFAULT_PRIVATE
1678 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1679 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1681 struct tree_exp GTY(())
1683 struct tree_common common;
1687 tree GTY ((special ("tree_exp"),
1688 desc ("TREE_CODE ((tree) &%0)")))
1692 /* SSA_NAME accessors. */
1694 /* Returns the variable being referenced. Once released, this is the
1695 only field that can be relied upon. */
1696 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1698 /* Returns the statement which defines this reference. Note that
1699 we use the same field when chaining SSA_NAME nodes together on
1700 the SSA_NAME freelist. */
1701 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1703 /* Returns the SSA version number of this SSA name. Note that in
1704 tree SSA, version numbers are not per variable and may be recycled. */
1705 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1707 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1708 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1710 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1711 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1713 /* Nonzero if this SSA_NAME expression is currently on the free list of
1714 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1715 has no meaning for an SSA_NAME. */
1716 #define SSA_NAME_IN_FREE_LIST(NODE) \
1717 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1719 /* Attributes for SSA_NAMEs for pointer-type variables. */
1720 #define SSA_NAME_PTR_INFO(N) \
1721 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1723 /* Get the value of this SSA_NAME, if available. */
1724 #define SSA_NAME_VALUE(N) \
1725 SSA_NAME_CHECK (N)->ssa_name.value_handle
1727 #ifndef _TREE_FLOW_H
1728 struct ptr_info_def;
1733 /* Immediate use linking structure. This structure is used for maintaining
1734 a doubly linked list of uses of an SSA_NAME. */
1735 typedef struct ssa_use_operand_d GTY(())
1737 struct ssa_use_operand_d* GTY((skip(""))) prev;
1738 struct ssa_use_operand_d* GTY((skip(""))) next;
1739 tree GTY((skip(""))) stmt;
1740 tree *GTY((skip(""))) use;
1741 } ssa_use_operand_t;
1743 /* Return the immediate_use information for an SSA_NAME. */
1744 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1746 struct tree_ssa_name GTY(())
1748 struct tree_common common;
1750 /* _DECL wrapped by this SSA name. */
1753 /* SSA version number. */
1754 unsigned int version;
1756 /* Pointer attributes used for alias analysis. */
1757 struct ptr_info_def *ptr_info;
1759 /* Value for SSA name used by various passes.
1761 Right now only invariants are allowed to persist beyond a pass in
1762 this field; in the future we will allow VALUE_HANDLEs to persist
1766 /* Immediate uses list for this SSA_NAME. */
1767 struct ssa_use_operand_d imm_uses;
1770 /* In a PHI_NODE node. */
1772 /* These 2 macros should be considered off limits for use by developers. If
1773 you wish to access the use or def fields of a PHI_NODE in the SSA
1774 optimizers, use the accessor macros found in tree-ssa-operands.h.
1775 These two macros are to be used only by those accessor macros, and other
1776 select places where we *absolutely* must take the address of the tree. */
1778 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1779 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1781 /* PHI_NODEs for each basic block are chained together in a single linked
1782 list. The head of the list is linked from the block annotation, and
1783 the link to the next PHI is in PHI_CHAIN. */
1784 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1786 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1787 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1788 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1789 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1790 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1791 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1793 struct phi_arg_d GTY(())
1795 /* imm_use MUST be the first element in struct because we do some
1796 pointer arithmetic with it. See phi_arg_index_from_use. */
1797 struct ssa_use_operand_d imm_use;
1801 struct tree_phi_node GTY(())
1803 struct tree_common common;
1808 /* Basic block to that the phi node belongs. */
1809 struct basic_block_def *bb;
1811 /* Arguments of the PHI node. These are maintained in the same
1812 order as predecessor edge vector BB->PREDS. */
1813 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1816 #define OMP_CLAUSE_CODE(NODE) \
1817 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1819 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1820 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1822 #define OMP_CLAUSE_CODE(NODE) \
1823 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1825 #define OMP_CLAUSE_OPERAND(NODE, I) \
1826 OMP_CLAUSE_ELT_CHECK (NODE, I)
1828 struct tree_omp_clause GTY(())
1830 struct tree_common common;
1831 enum omp_clause_code code;
1832 union omp_clause_subcode {
1833 enum omp_clause_default_kind default_kind;
1834 enum omp_clause_schedule_kind schedule_kind;
1835 enum tree_code reduction_code;
1836 } GTY ((skip)) subcode;
1837 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1841 struct varray_head_tag;
1843 /* In a BLOCK node. */
1844 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1845 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1846 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1847 /* Note: when changing this, make sure to find the places
1848 that use chainon or nreverse. */
1849 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1850 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1851 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1853 /* Nonzero means that this block is prepared to handle exceptions
1854 listed in the BLOCK_VARS slot. */
1855 #define BLOCK_HANDLER_BLOCK(NODE) \
1856 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1858 /* An index number for this block. These values are not guaranteed to
1859 be unique across functions -- whether or not they are depends on
1860 the debugging output format in use. */
1861 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1863 /* If block reordering splits a lexical block into discontiguous
1864 address ranges, we'll make a copy of the original block.
1866 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1867 In that case, we have one source block that has been replicated
1868 (through inlining or unrolling) into many logical blocks, and that
1869 these logical blocks have different physical variables in them.
1871 In this case, we have one logical block split into several
1872 non-contiguous address ranges. Most debug formats can't actually
1873 represent this idea directly, so we fake it by creating multiple
1874 logical blocks with the same variables in them. However, for those
1875 that do support non-contiguous regions, these allow the original
1876 logical block to be reconstructed, along with the set of address
1879 One of the logical block fragments is arbitrarily chosen to be
1880 the ORIGIN. The other fragments will point to the origin via
1881 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1882 be null. The list of fragments will be chained through
1883 BLOCK_FRAGMENT_CHAIN from the origin. */
1885 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1886 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1888 /* For an inlined function, this gives the location where it was called
1889 from. This is only set in the top level block, which corresponds to the
1890 inlined function scope. This is used in the debug output routines. */
1892 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1894 struct tree_block GTY(())
1896 struct tree_common common;
1898 unsigned handler_block_flag : 1;
1899 unsigned abstract_flag : 1;
1900 unsigned block_num : 30;
1905 tree abstract_origin;
1906 tree fragment_origin;
1907 tree fragment_chain;
1911 /* Define fields and accessors for nodes representing data types. */
1913 /* See tree.def for documentation of the use of these fields.
1914 Look at the documentation of the various ..._TYPE tree codes.
1916 Note that the type.values, type.minval, and type.maxval fields are
1917 overloaded and used for different macros in different kinds of types.
1918 Each macro must check to ensure the tree node is of the proper kind of
1919 type. Note also that some of the front-ends also overload these fields,
1920 so they must be checked as well. */
1922 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1923 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1924 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1925 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1926 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1927 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
1928 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
1929 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
1930 #define TYPE_ORIG_SIZE_TYPE(NODE) \
1931 (INTEGER_TYPE_CHECK (NODE)->type.values \
1932 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
1933 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
1934 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
1935 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1936 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1937 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1938 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1939 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1940 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1941 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1942 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1943 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1944 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1945 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1946 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1947 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1948 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1949 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1950 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1951 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1952 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1954 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1955 in the debugging output. We use this to describe a vector as a
1956 structure containing an array. */
1957 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1959 /* For record and union types, information about this type, as a base type
1961 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1963 /* For non record and union types, used in a language-dependent way. */
1964 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1966 /* The (language-specific) typed-based alias set for this type.
1967 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1968 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1969 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1970 type can alias objects of any type. */
1971 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1973 /* Nonzero iff the typed-based alias set for this type has been
1975 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1977 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1979 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1981 /* The alignment necessary for objects of this type.
1982 The value is an int, measured in bits. */
1983 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1985 /* 1 if the alignment for this type was requested by "aligned" attribute,
1986 0 if it is the default for this type. */
1987 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1989 /* The alignment for NODE, in bytes. */
1990 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1992 /* If your language allows you to declare types, and you want debug info
1993 for them, then you need to generate corresponding TYPE_DECL nodes.
1994 These "stub" TYPE_DECL nodes have no name, and simply point at the
1995 type node. You then set the TYPE_STUB_DECL field of the type node
1996 to point back at the TYPE_DECL node. This allows the debug routines
1997 to know that the two nodes represent the same type, so that we only
1998 get one debug info record for them. */
1999 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2001 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2002 has BLKmode only because it lacks the alignment requirement for
2004 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2006 /* In an INTEGER_TYPE, it means the type represents a size. We use
2007 this both for validity checking and to permit optimizations that
2008 are unsafe for other types. Note that the C `size_t' type should
2009 *not* have this flag set. The `size_t' type is simply a typedef
2010 for an ordinary integer type that happens to be the type of an
2011 expression returned by `sizeof'; `size_t' has no special
2012 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2013 always actual sizes. */
2014 #define TYPE_IS_SIZETYPE(NODE) \
2015 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2017 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
2018 pointer depressed. */
2019 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
2020 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2022 /* Nonzero in a type considered volatile as a whole. */
2023 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
2025 /* Means this type is const-qualified. */
2026 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
2028 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2030 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2032 /* There is a TYPE_QUAL value for each type qualifier. They can be
2033 combined by bitwise-or to form the complete set of qualifiers for a
2036 #define TYPE_UNQUALIFIED 0x0
2037 #define TYPE_QUAL_CONST 0x1
2038 #define TYPE_QUAL_VOLATILE 0x2
2039 #define TYPE_QUAL_RESTRICT 0x4
2041 /* The set of type qualifiers for this type. */
2042 #define TYPE_QUALS(NODE) \
2043 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2044 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2045 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2047 /* These flags are available for each language front end to use internally. */
2048 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2049 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2050 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2051 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2052 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2053 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2054 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2056 /* Used to keep track of visited nodes in tree traversals. This is set to
2057 0 by copy_node and make_node. */
2058 #define TREE_VISITED(NODE) ((NODE)->common.visited)
2060 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2061 that distinguish string from array of char).
2062 If set in a INTEGER_TYPE, indicates a character type. */
2063 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2065 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2066 object of the given ARRAY_TYPE. This allows temporaries to be
2068 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2069 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2071 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2072 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2073 (((unsigned HOST_WIDE_INT) 1) \
2074 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2076 /* Set precision to n when we have 2^n sub-parts of the vector. */
2077 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2078 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2080 /* Indicates that objects of this type must be initialized by calling a
2081 function when they are created. */
2082 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2083 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2085 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2086 the same way that the first union alternative would be passed. */
2087 #define TYPE_TRANSPARENT_UNION(NODE) \
2088 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2090 /* For an ARRAY_TYPE, indicates that it is not permitted to
2091 take the address of a component of the type. */
2092 #define TYPE_NONALIASED_COMPONENT(NODE) \
2093 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2095 /* Indicated that objects of this type should be laid out in as
2096 compact a way as possible. */
2097 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2099 /* Used by type_contains_placeholder_p to avoid recomputation.
2100 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2101 this field directly. */
2102 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2103 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2107 struct tree_type GTY(())
2109 struct tree_common common;
2116 unsigned int precision : 9;
2117 ENUM_BITFIELD(machine_mode) mode : 7;
2119 unsigned string_flag : 1;
2120 unsigned no_force_blk_flag : 1;
2121 unsigned needs_constructing_flag : 1;
2122 unsigned transparent_union_flag : 1;
2123 unsigned packed_flag : 1;
2124 unsigned restrict_flag : 1;
2125 unsigned contains_placeholder_bits : 2;
2127 unsigned lang_flag_0 : 1;
2128 unsigned lang_flag_1 : 1;
2129 unsigned lang_flag_2 : 1;
2130 unsigned lang_flag_3 : 1;
2131 unsigned lang_flag_4 : 1;
2132 unsigned lang_flag_5 : 1;
2133 unsigned lang_flag_6 : 1;
2134 unsigned user_align : 1;
2139 union tree_type_symtab {
2140 int GTY ((tag ("0"))) address;
2141 char * GTY ((tag ("1"))) pointer;
2142 struct die_struct * GTY ((tag ("2"))) die;
2143 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2144 descbits ("2"))) symtab;
2152 HOST_WIDE_INT alias_set;
2153 /* Points to a structure whose details depend on the language in use. */
2154 struct lang_type *lang_specific;
2157 /* Define accessor macros for information about type inheritance
2160 A "basetype" means a particular usage of a data type for inheritance
2161 in another type. Each such basetype usage has its own "binfo"
2162 object to describe it. The binfo object is a TREE_VEC node.
2164 Inheritance is represented by the binfo nodes allocated for a
2165 given type. For example, given types C and D, such that D is
2166 inherited by C, 3 binfo nodes will be allocated: one for describing
2167 the binfo properties of C, similarly one for D, and one for
2168 describing the binfo properties of D as a base type for C.
2169 Thus, given a pointer to class C, one can get a pointer to the binfo
2170 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2172 /* BINFO specific flags. */
2174 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2175 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag)
2177 /* Flags for language dependent use. */
2178 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2179 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2180 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2181 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2182 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2183 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2184 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2186 /* The actual data type node being inherited in this basetype. */
2187 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2189 /* The offset where this basetype appears in its containing type.
2190 BINFO_OFFSET slot holds the offset (in bytes)
2191 from the base of the complete object to the base of the part of the
2192 object that is allocated on behalf of this `type'.
2193 This is always 0 except when there is multiple inheritance. */
2195 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2196 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2198 /* The virtual function table belonging to this basetype. Virtual
2199 function tables provide a mechanism for run-time method dispatching.
2200 The entries of a virtual function table are language-dependent. */
2202 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2204 /* The virtual functions in the virtual function table. This is
2205 a TREE_LIST that is used as an initial approximation for building
2206 a virtual function table for this basetype. */
2207 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2209 /* A vector of binfos for the direct basetypes inherited by this
2212 If this basetype describes type D as inherited in C, and if the
2213 basetypes of D are E and F, then this vector contains binfos for
2214 inheritance of E and F by C. */
2215 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2217 /* The number of basetypes for NODE. */
2218 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2220 /* Accessor macro to get to the Nth base binfo of this binfo. */
2221 #define BINFO_BASE_BINFO(NODE,N) \
2222 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2223 #define BINFO_BASE_ITERATE(NODE,N,B) \
2224 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2225 #define BINFO_BASE_APPEND(NODE,T) \
2226 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2228 /* For a BINFO record describing a virtual base class, i.e., one where
2229 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2230 base. The actual contents are language-dependent. In the C++
2231 front-end this field is an INTEGER_CST giving an offset into the
2232 vtable where the offset to the virtual base can be found. */
2233 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2235 /* Indicates the accesses this binfo has to its bases. The values are
2236 access_public_node, access_protected_node or access_private_node.
2237 If this array is not present, public access is implied. */
2238 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2240 #define BINFO_BASE_ACCESS(NODE,N) \
2241 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2242 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2243 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2245 /* The index in the VTT where this subobject's sub-VTT can be found.
2246 NULL_TREE if there is no sub-VTT. */
2247 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2249 /* The index in the VTT where the vptr for this subobject can be
2250 found. NULL_TREE if there is no secondary vptr in the VTT. */
2251 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2253 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2254 inheriting this base for non-virtual bases. For virtual bases it
2255 points either to the binfo for which this is a primary binfo, or to
2256 the binfo of the most derived type. */
2257 #define BINFO_INHERITANCE_CHAIN(NODE) \
2258 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2260 struct tree_binfo GTY (())
2262 struct tree_common common;
2268 VEC(tree,gc) *base_accesses;
2274 VEC(tree,none) base_binfos;
2278 /* Define fields and accessors for nodes representing declared names. */
2280 /* Nonzero if DECL represents a variable for the SSA passes. */
2281 #define SSA_VAR_P(DECL) \
2282 (TREE_CODE (DECL) == VAR_DECL \
2283 || TREE_CODE (DECL) == PARM_DECL \
2284 || TREE_CODE (DECL) == RESULT_DECL \
2286 || (TREE_CODE (DECL) == SSA_NAME \
2287 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2288 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2289 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2290 || MTAG_P (SSA_NAME_VAR (DECL)))))
2295 /* Enumerate visibility settings. */
2296 #ifndef SYMBOL_VISIBILITY_DEFINED
2297 #define SYMBOL_VISIBILITY_DEFINED
2298 enum symbol_visibility
2301 VISIBILITY_PROTECTED,
2310 /* This is the name of the object as written by the user.
2311 It is an IDENTIFIER_NODE. */
2312 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2314 /* Every ..._DECL node gets a unique number. */
2315 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2317 /* These two fields describe where in the source code the declaration
2318 was. If the declaration appears in several places (as for a C
2319 function that is declared first and then defined later), this
2320 information should refer to the definition. */
2321 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2322 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2323 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2324 #ifdef USE_MAPPED_LOCATION
2325 #define DECL_IS_BUILTIN(DECL) \
2326 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2328 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2331 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2332 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2333 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2334 points to either the FUNCTION_DECL for the containing function,
2335 the RECORD_TYPE or UNION_TYPE for the containing type, or
2336 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2338 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2339 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2340 struct tree_decl_minimal GTY(())
2342 struct tree_common common;
2349 /* When computing aliasing information, we represent the memory pointed-to
2350 by pointers with artificial variables called "memory tags" (MT). There
2351 are two kinds of tags, namely symbol and name:
2353 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2354 represent all the pointed-to locations and variables pointed-to by
2355 the same pointer symbol. Usually, this set is computed using
2356 type-based analysis (i.e., alias set classes), but this may not
2359 Name tags (NMT) are used in flow-sensitive points-to alias
2360 analysis, they represent the variables and memory locations
2361 pointed-to by a specific SSA_NAME pointer.
2363 In general, given a pointer P with a symbol tag SMT, the alias set
2364 of SMT should be the union of all the alias sets of the NMTs of
2365 every SSA_NAME for P. */
2366 struct tree_memory_tag GTY(())
2368 struct tree_decl_minimal common;
2369 unsigned int is_global:1;
2370 unsigned int is_used_alone:1;
2371 unsigned int old_used_alone:1;
2374 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2376 /* This flag is true if a SMT is used as the V_MAY_DEF or VUSE operand
2377 directly, because the access had all of the SMT's aliases pruned
2379 #define SMT_USED_ALONE(NODE) (SYMBOL_MEMORY_TAG_CHECK (NODE)->mtag.is_used_alone)
2381 /* This flag is used to temporarily store the old value of the used alone
2382 flag when updating so we know whether to mark the symbol for
2384 #define SMT_OLD_USED_ALONE(NODE) (SYMBOL_MEMORY_TAG_CHECK (NODE)->mtag.old_used_alone)
2386 struct tree_struct_field_tag GTY(())
2388 struct tree_memory_tag common;
2390 /* Parent variable. */
2393 /* Offset inside structure. */
2394 unsigned HOST_WIDE_INT offset;
2396 /* Size of the field. */
2397 unsigned HOST_WIDE_INT size;
2400 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2401 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2402 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2404 /* For any sort of a ..._DECL node, this points to the original (abstract)
2405 decl node which this decl is an instance of, or else it is NULL indicating
2406 that this decl is not an instance of some other decl. For example,
2407 in a nested declaration of an inline function, this points back to the
2409 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2411 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2412 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2413 #define DECL_ORIGIN(NODE) \
2414 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2416 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2417 inline instance of some original (abstract) decl from an inline function;
2418 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2419 nodes can also have their abstract origin set to themselves. */
2420 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2421 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2423 /* In a DECL this is the field where attributes are stored. */
2424 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2426 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2427 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2428 For a VAR_DECL, holds the initial value.
2429 For a PARM_DECL, not used--default
2430 values for parameters are encoded in the type of the function,
2431 not in the PARM_DECL slot.
2432 For a FIELD_DECL, this is used for enumeration values and the C
2433 frontend uses it for temporarily storing bitwidth of bitfields.
2435 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2436 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2438 /* Holds the size of the datum, in bits, as a tree expression.
2439 Need not be constant. */
2440 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2441 /* Likewise for the size in bytes. */
2442 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2443 /* Holds the alignment required for the datum, in bits. */
2444 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2445 /* The alignment of NODE, in bytes. */
2446 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2447 /* Set if the alignment of this DECL has been set by the user, for
2448 example with an 'aligned' attribute. */
2449 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2450 /* Holds the machine mode corresponding to the declaration of a variable or
2451 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2453 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2455 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2456 operation it is. Note, however, that this field is overloaded, with
2457 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2458 checked before any access to the former. */
2459 #define DECL_FUNCTION_CODE(NODE) \
2460 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2461 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2462 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2464 /* Nonzero for a given ..._DECL node means that the name of this node should
2465 be ignored for symbolic debug purposes. */
2466 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2468 /* Nonzero for a given ..._DECL node means that this node represents an
2469 "abstract instance" of the given declaration (e.g. in the original
2470 declaration of an inline function). When generating symbolic debugging
2471 information, we mustn't try to generate any address information for nodes
2472 marked as "abstract instances" because we don't actually generate
2473 any code or allocate any data space for such instances. */
2474 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2476 /* Language-specific decl information. */
2477 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2479 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2480 do not allocate storage, and refer to a definition elsewhere. Note that
2481 this does not necessarily imply the entity represented by NODE
2482 has no program source-level definition in this translation unit. For
2483 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2484 DECL_EXTERNAL may be true simultaneously; that can be the case for
2485 a C99 "extern inline" function. */
2486 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2488 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
2490 #define DEFAULT_INIT_PRIORITY 65535
2491 #define MAX_INIT_PRIORITY 65535
2492 #define MAX_RESERVED_INIT_PRIORITY 100
2495 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2496 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2498 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2500 Also set in some languages for variables, etc., outside the normal
2501 lexical scope, such as class instance variables. */
2502 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2504 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2505 Used in FIELD_DECLs for vtable pointers.
2506 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2507 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2509 /* Used to indicate that this DECL represents a compiler-generated entity. */
2510 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2512 /* Additional flags for language-specific uses. */
2513 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2514 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2515 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2516 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2517 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2518 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2519 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2520 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2522 /* Used to indicate an alias set for the memory pointed to by this
2523 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2524 pointer (or reference) type. */
2525 #define DECL_POINTER_ALIAS_SET(NODE) \
2526 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2528 /* Nonzero if an alias set has been assigned to this declaration. */
2529 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2530 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2532 /* Nonzero for a decl which is at file scope. */
2533 #define DECL_FILE_SCOPE_P(EXP) \
2534 (! DECL_CONTEXT (EXP) \
2535 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2537 /* Nonzero for a decl that is decorated using attribute used.
2538 This indicates compiler tools that this decl needs to be preserved. */
2539 #define DECL_PRESERVE_P(DECL) \
2540 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2542 /* For function local variables of COMPLEX type, indicates that the
2543 variable is not aliased, and that all modifications to the variable
2544 have been adjusted so that they are killing assignments. Thus the
2545 variable may now be treated as a GIMPLE register, and use real
2546 instead of virtual ops in SSA form. */
2547 #define DECL_COMPLEX_GIMPLE_REG_P(DECL) \
2548 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2550 /* This is true if DECL is call clobbered in the current function.
2551 The result of this flag should always be the same as
2552 bitmap_bit_p (call_clobbered_vars, DECL_UID (decl)). */
2553 #define DECL_CALL_CLOBBERED(DECL) \
2554 DECL_COMMON_CHECK (DECL)->decl_common.call_clobbered_flag
2556 struct tree_decl_common GTY(())
2558 struct tree_decl_minimal common;
2561 ENUM_BITFIELD(machine_mode) mode : 8;
2563 unsigned nonlocal_flag : 1;
2564 unsigned virtual_flag : 1;
2565 unsigned ignored_flag : 1;
2566 unsigned abstract_flag : 1;
2567 unsigned artificial_flag : 1;
2568 unsigned user_align : 1;
2569 unsigned preserve_flag: 1;
2570 unsigned debug_expr_is_from : 1;
2572 unsigned lang_flag_0 : 1;
2573 unsigned lang_flag_1 : 1;
2574 unsigned lang_flag_2 : 1;
2575 unsigned lang_flag_3 : 1;
2576 unsigned lang_flag_4 : 1;
2577 unsigned lang_flag_5 : 1;
2578 unsigned lang_flag_6 : 1;
2579 unsigned lang_flag_7 : 1;
2581 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2582 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2583 unsigned decl_flag_0 : 1;
2584 /* In FIELD_DECL, this is DECL_PACKED. */
2585 unsigned decl_flag_1 : 1;
2586 /* In FIELD_DECL, this is DECL_BIT_FIELD
2587 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2588 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2589 unsigned decl_flag_2 : 1;
2590 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2591 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2592 unsigned decl_flag_3 : 1;
2593 /* Logically, these two would go in a theoretical base shared by var and
2595 unsigned gimple_reg_flag : 1;
2596 unsigned call_clobbered_flag : 1;
2598 unsigned int align : 24;
2599 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2600 unsigned int off_align : 8;
2605 tree abstract_origin;
2607 HOST_WIDE_INT pointer_alias_set;
2608 /* Points to a structure whose details depend on the language in use. */
2609 struct lang_decl *lang_specific;
2612 extern tree decl_value_expr_lookup (tree);
2613 extern void decl_value_expr_insert (tree, tree);
2615 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2616 if transformations have made this more complicated than evaluating the
2617 decl itself. This should only be used for debugging; once this field has
2618 been set, the decl itself may not legitimately appear in the function. */
2619 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2620 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2621 #define DECL_VALUE_EXPR(NODE) \
2622 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2623 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2624 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2626 /* Holds the RTL expression for the value of a variable or function.
2627 This value can be evaluated lazily for functions, variables with
2628 static storage duration, and labels. */
2629 #define DECL_RTL(NODE) \
2630 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2631 ? (NODE)->decl_with_rtl.rtl \
2632 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2634 /* Set the DECL_RTL for NODE to RTL. */
2635 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2637 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2638 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2640 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2641 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2643 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2644 NODE1, it will not be set for NODE2; this is a lazy copy. */
2645 #define COPY_DECL_RTL(NODE1, NODE2) \
2646 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2648 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2649 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2651 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2652 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2654 struct tree_decl_with_rtl GTY(())
2656 struct tree_decl_common common;
2660 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2661 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2662 of the structure. */
2663 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2665 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2666 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2667 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2668 natural alignment of the field's type). */
2669 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2671 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2672 if so, the type that was originally specified for it.
2673 TREE_TYPE may have been modified (in finish_struct). */
2674 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2676 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2677 if nonzero, indicates that the field occupies the type. */
2678 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2680 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2681 DECL_FIELD_OFFSET which are known to be always zero.
2682 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2684 #define DECL_OFFSET_ALIGN(NODE) \
2685 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2687 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2688 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2689 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2690 /* 1 if the alignment for this type was requested by "aligned" attribute,
2691 0 if it is the default for this type. */
2693 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2694 which this FIELD_DECL is defined. This information is needed when
2695 writing debugging information about vfield and vbase decls for C++. */
2696 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2698 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2699 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2701 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2703 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2705 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2707 #define DECL_NONADDRESSABLE_P(NODE) \
2708 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2710 struct tree_field_decl GTY(())
2712 struct tree_decl_common common;
2715 tree bit_field_type;
2722 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2723 dense, unique within any one function, and may be used to index arrays.
2724 If the value is -1, then no UID has been assigned. */
2725 #define LABEL_DECL_UID(NODE) \
2726 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2728 /* In LABEL_DECL nodes, nonzero means that an error message about
2729 jumping into such a binding contour has been printed for this label. */
2730 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2732 struct tree_label_decl GTY(())
2734 struct tree_decl_with_rtl common;
2735 /* Java's verifier has some need to store information about labels,
2736 and was using fields that no longer exist on labels.
2737 Once the verifier doesn't need these anymore, they should be removed. */
2741 unsigned int java_field_4;
2745 struct tree_result_decl GTY(())
2747 struct tree_decl_with_rtl common;
2750 struct tree_const_decl GTY(())
2752 struct tree_decl_with_rtl common;
2755 /* For a PARM_DECL, records the data type used to pass the argument,
2756 which may be different from the type seen in the program. */
2757 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2759 /* For PARM_DECL, holds an RTL for the stack slot or register
2760 where the data was actually passed. */
2761 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2763 struct tree_parm_decl GTY(())
2765 struct tree_decl_with_rtl common;
2770 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2771 this variable in a BIND_EXPR. */
2772 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2773 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2775 /* Used to indicate that the linkage status of this DECL is not yet known,
2776 so it should not be output now. */
2777 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2779 /* Nonzero for a given ..._DECL node means that no warnings should be
2780 generated just because this node is unused. */
2781 #define DECL_IN_SYSTEM_HEADER(NODE) \
2782 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2784 /* Used to indicate that this DECL has weak linkage. */
2785 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2787 /* Internal to the gimplifier. Indicates that the value is a formal
2788 temporary controlled by the gimplifier. */
2789 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2790 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2792 /* Used to indicate that the DECL is a dllimport. */
2793 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2795 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2796 based on a variable with a restrict qualified type. If it is,
2797 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2800 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2801 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2802 #define DECL_GET_RESTRICT_BASE(NODE) \
2803 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2804 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2805 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2807 extern tree decl_restrict_base_lookup (tree);
2808 extern void decl_restrict_base_insert (tree, tree);
2810 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2811 not be put out unless it is needed in this translation unit.
2812 Entities like this are shared across translation units (like weak
2813 entities), but are guaranteed to be generated by any translation
2814 unit that needs them, and therefore need not be put out anywhere
2815 where they are not needed. DECL_COMDAT is just a hint to the
2816 back-end; it is up to front-ends which set this flag to ensure
2817 that there will never be any harm, other than bloat, in putting out
2818 something which is DECL_COMDAT. */
2819 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2821 /* A replaceable function is one which may be replaced at link-time
2822 with an entirely different definition, provided that the
2823 replacement has the same type. For example, functions declared
2824 with __attribute__((weak)) on most systems are replaceable.
2826 COMDAT functions are not replaceable, since all definitions of the
2827 function must be equivalent. It is important that COMDAT functions
2828 not be treated as replaceable so that use of C++ template
2829 instantiations is not penalized.
2831 For example, DECL_REPLACEABLE is used to determine whether or not a
2832 function (including a template instantiation) which is not
2833 explicitly declared "inline" can be inlined. If the function is
2834 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2835 implementation chosen at link-time may be different. However, a
2836 function that is not DECL_REPLACEABLE can be inlined, since all
2837 versions of the function will be functionally identical. */
2838 #define DECL_REPLACEABLE_P(NODE) \
2839 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2841 /* The name of the object as the assembler will see it (but before any
2842 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2843 as DECL_NAME. It is an IDENTIFIER_NODE. */
2844 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2846 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2847 This is true of all DECL nodes except FIELD_DECL. */
2848 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2849 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2851 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2852 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2854 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2855 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2857 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2858 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2859 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2861 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2862 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2863 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2864 semantics of using this macro, are different than saying:
2866 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2868 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2870 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2871 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2872 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2873 DECL_ASSEMBLER_NAME (DECL1)) \
2876 /* Records the section name in a section attribute. Used to pass
2877 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2878 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2880 /* Value of the decls's visibility attribute */
2881 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2883 /* Nonzero means that the decl had its visibility specified rather than
2885 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2887 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2888 multiple translation units should be merged. */
2889 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
2891 struct tree_decl_with_vis GTY(())
2893 struct tree_decl_with_rtl common;
2894 tree assembler_name;
2897 /* Belong to VAR_DECL exclusively. */
2898 unsigned defer_output:1;
2899 unsigned hard_register:1;
2900 unsigned thread_local:1;
2901 unsigned common_flag:1;
2902 unsigned in_text_section : 1;
2903 unsigned gimple_formal_temp : 1;
2904 unsigned dllimport_flag : 1;
2905 unsigned based_on_restrict_p : 1;
2906 /* Used by C++. Might become a generic decl flag. */
2907 unsigned shadowed_for_var_p : 1;
2909 /* Don't belong to VAR_DECL exclusively. */
2910 unsigned in_system_header_flag : 1;
2911 unsigned weak_flag:1;
2912 unsigned seen_in_bind_expr : 1;
2913 unsigned comdat_flag : 1;
2914 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2915 unsigned visibility_specified : 1;
2916 /* Belong to FUNCTION_DECL exclusively. */
2917 unsigned one_only : 1;
2918 unsigned init_priority_p:1;
2920 /* Belongs to VAR_DECL exclusively. */
2921 ENUM_BITFIELD(tls_model) tls_model : 3;
2922 /* 11 unused bits. */
2925 /* In a VAR_DECL that's static,
2926 nonzero if the space is in the text section. */
2927 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2929 /* Nonzero for a given ..._DECL node means that this node should be
2930 put in .common, if possible. If a DECL_INITIAL is given, and it
2931 is not error_mark_node, then the decl cannot be put in .common. */
2932 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2934 /* In a VAR_DECL, nonzero if the decl is a register variable with
2935 an explicit asm specification. */
2936 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2938 extern tree decl_debug_expr_lookup (tree);
2939 extern void decl_debug_expr_insert (tree, tree);
2940 /* For VAR_DECL, this is set to either an expression that it was split
2941 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
2942 subexpressions that it was split into. */
2943 #define DECL_DEBUG_EXPR(NODE) \
2944 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2946 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2947 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2950 extern unsigned short decl_init_priority_lookup (tree);
2951 extern void decl_init_priority_insert (tree, unsigned short);
2953 /* In a non-local VAR_DECL with static storage duration, this is the
2954 initialization priority. If this value is zero, the NODE will be
2955 initialized at the DEFAULT_INIT_PRIORITY. Only used by C++ FE*/
2957 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2958 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2959 #define DECL_INIT_PRIORITY(NODE) \
2960 (decl_init_priority_lookup (VAR_DECL_CHECK (NODE)))
2961 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2962 (decl_init_priority_insert (VAR_DECL_CHECK (NODE), VAL))
2964 /* In a VAR_DECL, the model to use if the data should be allocated from
2965 thread-local storage. */
2966 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2968 /* In a VAR_DECL, nonzero if the data should be allocated from
2969 thread-local storage. */
2970 #define DECL_THREAD_LOCAL_P(NODE) \
2971 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
2973 struct tree_var_decl GTY(())
2975 struct tree_decl_with_vis common;
2979 /* This field is used to reference anything in decl.result and is meant only
2980 for use by the garbage collector. */
2981 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2983 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2984 Before the struct containing the FUNCTION_DECL is laid out,
2985 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2986 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2987 function. When the class is laid out, this pointer is changed
2988 to an INTEGER_CST node which is suitable for use as an index
2989 into the virtual function table.
2990 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
2991 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2993 struct tree_decl_non_common GTY(())
2996 struct tree_decl_with_vis common;
2997 /* C++ uses this in namespaces. */
2999 /* C++ uses this in templates. */
3001 /* Almost all FE's use this. */
3003 /* C++ uses this in namespaces. */
3007 /* In FUNCTION_DECL, holds the decl for the return value. */
3008 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3010 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3011 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3013 /* In a FUNCTION_DECL, the saved representation of the body of the
3015 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3017 /* Nonzero in a FUNCTION_DECL means this function should be treated
3018 as if it were a malloc, meaning it returns a pointer that is
3020 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3022 /* Nonzero in a FUNCTION_DECL means this function may return more
3024 #define DECL_IS_RETURNS_TWICE(NODE) \
3025 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3027 /* Nonzero in a FUNCTION_DECL means this function should be treated
3028 as "pure" function (like const function, but may read global memory). */
3029 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3031 /* Nonzero in a FUNCTION_DECL means this function should be treated
3032 as "novops" function (function that does not read global memory,
3033 but may have arbitrary side effects). */
3034 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3036 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3037 at the beginning or end of execution. */
3038 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3039 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3041 #define DECL_STATIC_DESTRUCTOR(NODE) \
3042 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3044 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3045 be instrumented with calls to support routines. */
3046 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3047 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3049 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3050 disabled in this function. */
3051 #define DECL_NO_LIMIT_STACK(NODE) \
3052 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3054 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3055 static chain is not needed. */
3056 #define DECL_NO_STATIC_CHAIN(NODE) \
3057 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3059 /* Nonzero for a decl that cgraph has decided should be inlined into
3060 at least one call site. It is not meaningful to look at this
3061 directly; always use cgraph_function_possibly_inlined_p. */
3062 #define DECL_POSSIBLY_INLINED(DECL) \
3063 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3065 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3066 where it is called. */
3067 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3069 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3070 such as via the `inline' keyword in C/C++. This flag controls the linkage
3071 semantics of 'inline'; whether or not the function is inlined is
3072 controlled by DECL_INLINE. */
3073 #define DECL_DECLARED_INLINE_P(NODE) \
3074 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3076 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3077 that describes the status of this function. */
3078 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3080 /* In a FUNCTION_DECL, nonzero means a built in function. */
3081 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3083 /* For a builtin function, identify which part of the compiler defined it. */
3084 #define DECL_BUILT_IN_CLASS(NODE) \
3085 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3087 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3088 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3090 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3091 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3093 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3094 arguments/result/saved_tree fields by front ends. It was either inherit
3095 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3096 which seemed a bit strange. */
3098 struct tree_function_decl GTY(())
3100 struct tree_decl_non_common common;
3102 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3103 DECL_FUNCTION_CODE. Otherwise unused. */
3104 enum built_in_function function_code;
3106 unsigned static_ctor_flag : 1;
3107 unsigned static_dtor_flag : 1;
3108 unsigned uninlinable : 1;
3109 unsigned possibly_inlined : 1;
3110 unsigned novops_flag : 1;
3111 unsigned returns_twice_flag : 1;
3112 unsigned malloc_flag : 1;
3113 unsigned pure_flag : 1;
3115 unsigned declared_inline_flag : 1;
3116 unsigned regdecl_flag : 1;
3117 unsigned inline_flag : 1;
3118 unsigned no_instrument_function_entry_exit : 1;
3119 unsigned no_limit_stack : 1;
3120 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3125 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3126 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3128 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3129 into stabs. Instead it will generate cross reference ('x') of names.
3130 This uses the same flag as DECL_EXTERNAL. */
3131 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3132 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3134 struct tree_type_decl GTY(())
3136 struct tree_decl_non_common common;
3140 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3141 To reduce overhead, the nodes containing the statements are not trees.
3142 This avoids the overhead of tree_common on all linked list elements.
3144 Use the interface in tree-iterator.h to access this node. */
3146 #define STATEMENT_LIST_HEAD(NODE) \
3147 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3148 #define STATEMENT_LIST_TAIL(NODE) \
3149 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3151 struct tree_statement_list_node
3152 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3154 struct tree_statement_list_node *prev;
3155 struct tree_statement_list_node *next;
3159 struct tree_statement_list
3162 struct tree_common common;
3163 struct tree_statement_list_node *head;
3164 struct tree_statement_list_node *tail;
3167 #define VALUE_HANDLE_ID(NODE) \
3168 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3170 #define VALUE_HANDLE_EXPR_SET(NODE) \
3171 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3173 #define VALUE_HANDLE_VUSES(NODE) \
3174 (VALUE_HANDLE_CHECK (NODE)->value_handle.vuses)
3176 /* Defined and used in tree-ssa-pre.c. */
3179 struct tree_value_handle GTY(())
3181 struct tree_common common;
3183 /* The set of expressions represented by this handle. */
3184 struct value_set * GTY ((skip)) expr_set;
3186 /* Unique ID for this value handle. IDs are handed out in a
3187 conveniently dense form starting at 0, so that we can make
3188 bitmaps of value handles. */
3191 /* Set of virtual uses represented by this handle. */
3192 VEC (tree, gc) *vuses;
3195 /* Define the overall contents of a tree node.
3196 It may be any of the structures declared above
3197 for various types of node. */
3199 union tree_node GTY ((ptr_alias (union lang_tree_node),
3200 desc ("tree_node_structure (&%h)")))
3202 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3203 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3204 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3205 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3206 struct tree_string GTY ((tag ("TS_STRING"))) string;
3207 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3208 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3209 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3210 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3211 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3212 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3213 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3214 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3215 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3216 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3217 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3218 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3219 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3220 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3221 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3222 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3223 struct tree_list GTY ((tag ("TS_LIST"))) list;
3224 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3225 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3226 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3227 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3228 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3229 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3230 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3231 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3232 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3233 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3234 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3235 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3238 /* Standard named or nameless data types of the C compiler. */
3260 TI_INTEGER_MINUS_ONE,
3277 TI_COMPLEX_INTEGER_TYPE,
3278 TI_COMPLEX_FLOAT_TYPE,
3279 TI_COMPLEX_DOUBLE_TYPE,
3280 TI_COMPLEX_LONG_DOUBLE_TYPE,
3284 TI_LONG_DOUBLE_TYPE,
3288 TI_LONG_DOUBLE_PTR_TYPE,
3289 TI_INTEGER_PTR_TYPE,
3298 TI_VA_LIST_GPR_COUNTER_FIELD,
3299 TI_VA_LIST_FPR_COUNTER_FIELD,
3306 TI_DFLOAT32_PTR_TYPE,
3307 TI_DFLOAT64_PTR_TYPE,
3308 TI_DFLOAT128_PTR_TYPE,
3317 extern GTY(()) tree global_trees[TI_MAX];
3319 #define error_mark_node global_trees[TI_ERROR_MARK]
3321 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3322 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3323 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3324 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3325 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3327 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3328 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3329 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3330 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3331 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3333 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3334 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3336 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3337 #define integer_one_node global_trees[TI_INTEGER_ONE]
3338 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3339 #define size_zero_node global_trees[TI_SIZE_ZERO]
3340 #define size_one_node global_trees[TI_SIZE_ONE]
3341 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3342 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3343 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3345 /* Base access nodes. */
3346 #define access_public_node global_trees[TI_PUBLIC]
3347 #define access_protected_node global_trees[TI_PROTECTED]
3348 #define access_private_node global_trees[TI_PRIVATE]
3350 #define null_pointer_node global_trees[TI_NULL_POINTER]
3352 #define float_type_node global_trees[TI_FLOAT_TYPE]
3353 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3354 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3356 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3357 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3358 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3359 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3361 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3362 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3363 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3364 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3366 #define void_type_node global_trees[TI_VOID_TYPE]
3367 /* The C type `void *'. */
3368 #define ptr_type_node global_trees[TI_PTR_TYPE]
3369 /* The C type `const void *'. */
3370 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3371 /* The C type `size_t'. */
3372 #define size_type_node global_trees[TI_SIZE_TYPE]
3373 #define pid_type_node global_trees[TI_PID_TYPE]
3374 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3375 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3376 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3377 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3378 /* The C type `FILE *'. */
3379 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3381 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3382 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3383 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3385 /* The decimal floating point types. */
3386 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3387 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3388 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3389 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3390 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3391 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3393 /* The node that should be placed at the end of a parameter list to
3394 indicate that the function does not take a variable number of
3395 arguments. The TREE_VALUE will be void_type_node and there will be
3396 no TREE_CHAIN. Language-independent code should not assume
3397 anything else about this node. */
3398 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3400 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3401 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3403 /* An enumeration of the standard C integer types. These must be
3404 ordered so that shorter types appear before longer ones, and so
3405 that signed types appear before unsigned ones, for the correct
3406 functioning of interpret_integer() in c-lex.c. */
3407 enum integer_type_kind
3419 itk_unsigned_long_long,
3423 typedef enum integer_type_kind integer_type_kind;
3425 /* The standard C integer types. Use integer_type_kind to index into
3427 extern GTY(()) tree integer_types[itk_none];
3429 #define char_type_node integer_types[itk_char]
3430 #define signed_char_type_node integer_types[itk_signed_char]
3431 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3432 #define short_integer_type_node integer_types[itk_short]
3433 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3434 #define integer_type_node integer_types[itk_int]
3435 #define unsigned_type_node integer_types[itk_unsigned_int]
3436 #define long_integer_type_node integer_types[itk_long]
3437 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3438 #define long_long_integer_type_node integer_types[itk_long_long]
3439 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3441 /* Set to the default thread-local storage (tls) model to use. */
3443 extern enum tls_model flag_tls_default;
3446 /* A pointer-to-function member type looks like:
3453 If __pfn is NULL, it is a NULL pointer-to-member-function.
3455 (Because the vtable is always the first thing in the object, we
3456 don't need its offset.) If the function is virtual, then PFN is
3457 one plus twice the index into the vtable; otherwise, it is just a
3458 pointer to the function.
3460 Unfortunately, using the lowest bit of PFN doesn't work in
3461 architectures that don't impose alignment requirements on function
3462 addresses, or that use the lowest bit to tell one ISA from another,
3463 for example. For such architectures, we use the lowest bit of
3464 DELTA instead of the lowest bit of the PFN, and DELTA will be
3467 enum ptrmemfunc_vbit_where_t
3469 ptrmemfunc_vbit_in_pfn,
3470 ptrmemfunc_vbit_in_delta
3473 #define NULL_TREE (tree) NULL
3475 extern tree decl_assembler_name (tree);
3477 /* Compute the number of bytes occupied by 'node'. This routine only
3478 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3480 extern size_t tree_size (tree);
3482 /* Compute the number of bytes occupied by a tree with code CODE. This
3483 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3485 extern size_t tree_code_size (enum tree_code);
3487 /* Lowest level primitive for allocating a node.
3488 The TREE_CODE is the only argument. Contents are initialized
3489 to zero except for a few of the common fields. */
3491 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3492 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3494 /* Make a copy of a node, with all the same contents. */
3496 extern tree copy_node_stat (tree MEM_STAT_DECL);
3497 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3499 /* Make a copy of a chain of TREE_LIST nodes. */
3501 extern tree copy_list (tree);
3504 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3505 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3507 /* Make a TREE_VEC. */
3509 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3510 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3512 /* Tree nodes for SSA analysis. */
3514 extern void init_phinodes (void);
3515 extern void fini_phinodes (void);
3516 extern void release_phi_node (tree);
3517 #ifdef GATHER_STATISTICS
3518 extern void phinodes_print_statistics (void);
3521 extern void init_ssanames (void);
3522 extern void fini_ssanames (void);
3523 extern tree make_ssa_name (tree, tree);
3524 extern tree duplicate_ssa_name (tree, tree);
3525 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3526 extern void release_ssa_name (tree);
3527 extern void release_defs (tree);
3528 extern void replace_ssa_name_symbol (tree, tree);
3530 #ifdef GATHER_STATISTICS
3531 extern void ssanames_print_statistics (void);
3534 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3535 The name is supplied as a char *. */
3537 extern tree get_identifier (const char *);
3539 #if GCC_VERSION >= 3000
3540 #define get_identifier(str) \
3541 (__builtin_constant_p (str) \
3542 ? get_identifier_with_length ((str), strlen (str)) \
3543 : get_identifier (str))
3547 /* Identical to get_identifier, except that the length is assumed
3550 extern tree get_identifier_with_length (const char *, size_t);
3552 /* If an identifier with the name TEXT (a null-terminated string) has
3553 previously been referred to, return that node; otherwise return
3556 extern tree maybe_get_identifier (const char *);
3558 /* Construct various types of nodes. */
3560 extern tree build_nt (enum tree_code, ...);
3562 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3563 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3564 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3565 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3566 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3567 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3568 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3569 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3570 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3571 tree MEM_STAT_DECL);
3572 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3573 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3574 tree MEM_STAT_DECL);
3575 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3576 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3577 tree, tree, tree MEM_STAT_DECL);
3578 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3579 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3581 extern tree build_int_cst (tree, HOST_WIDE_INT);
3582 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3583 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3584 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3585 extern tree build_vector (tree, tree);
3586 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3587 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3588 extern tree build_constructor_single (tree, tree, tree);
3589 extern tree build_constructor_from_list (tree, tree);
3590 extern tree build_real_from_int_cst (tree, tree);
3591 extern tree build_complex (tree, tree, tree);
3592 extern tree build_one_cst (tree);
3593 extern tree build_string (int, const char *);
3594 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3595 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3596 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3597 extern tree build_fn_decl (const char *, tree);
3598 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3599 extern tree build_block (tree, tree, tree, tree);
3600 #ifndef USE_MAPPED_LOCATION
3601 extern void annotate_with_file_line (tree, const char *, int);
3602 extern void annotate_with_locus (tree, location_t);
3604 extern tree build_empty_stmt (void);
3605 extern tree build_omp_clause (enum omp_clause_code);
3607 /* Construct various nodes representing data types. */
3609 extern tree make_signed_type (int);
3610 extern tree make_unsigned_type (int);
3611 extern tree signed_type_for (tree);
3612 extern tree unsigned_type_for (tree);
3613 extern void initialize_sizetypes (bool);
3614 extern void set_sizetype (tree);
3615 extern void fixup_unsigned_type (tree);
3616 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3617 extern tree build_pointer_type (tree);
3618 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3619 extern tree build_reference_type (tree);
3620 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3621 extern tree build_vector_type (tree innertype, int nunits);
3622 extern tree build_type_no_quals (tree);
3623 extern tree build_index_type (tree);
3624 extern tree build_index_2_type (tree, tree);
3625 extern tree build_array_type (tree, tree);
3626 extern tree build_function_type (tree, tree);
3627 extern tree build_function_type_list (tree, ...);
3628 extern tree build_method_type_directly (tree, tree, tree);
3629 extern tree build_method_type (tree, tree);
3630 extern tree build_offset_type (tree, tree);
3631 extern tree build_complex_type (tree);
3632 extern tree build_resx (int);
3633 extern tree array_type_nelts (tree);
3634 extern bool in_array_bounds_p (tree);
3635 extern bool range_in_array_bounds_p (tree);
3637 extern tree value_member (tree, tree);
3638 extern tree purpose_member (tree, tree);
3640 extern int attribute_list_equal (tree, tree);
3641 extern int attribute_list_contained (tree, tree);
3642 extern int tree_int_cst_equal (tree, tree);
3643 extern int tree_int_cst_lt (tree, tree);
3644 extern int tree_int_cst_compare (tree, tree);
3645 extern int host_integerp (tree, int);
3646 extern HOST_WIDE_INT tree_low_cst (tree, int);
3647 extern int tree_int_cst_msb (tree);
3648 extern int tree_int_cst_sgn (tree);
3649 extern int tree_int_cst_sign_bit (tree);
3650 extern int tree_expr_nonnegative_p (tree);
3651 extern int tree_expr_nonnegative_warnv_p (tree, bool *);
3652 extern bool may_negate_without_overflow_p (tree);
3653 extern tree get_inner_array_type (tree);
3655 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3656 put the prototype here. Rtl.h does declare the prototype if
3657 tree.h had been included. */
3659 extern tree make_tree (tree, rtx);
3661 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3664 Such modified types already made are recorded so that duplicates
3667 extern tree build_type_attribute_variant (tree, tree);
3668 extern tree build_decl_attribute_variant (tree, tree);
3670 /* Structure describing an attribute and a function to handle it. */
3671 struct attribute_spec
3673 /* The name of the attribute (without any leading or trailing __),
3674 or NULL to mark the end of a table of attributes. */
3675 const char *const name;
3676 /* The minimum length of the list of arguments of the attribute. */
3677 const int min_length;
3678 /* The maximum length of the list of arguments of the attribute
3679 (-1 for no maximum). */
3680 const int max_length;
3681 /* Whether this attribute requires a DECL. If it does, it will be passed
3682 from types of DECLs, function return types and array element types to
3683 the DECLs, function types and array types respectively; but when
3684 applied to a type in any other circumstances, it will be ignored with
3685 a warning. (If greater control is desired for a given attribute,
3686 this should be false, and the flags argument to the handler may be
3687 used to gain greater control in that case.) */
3688 const bool decl_required;
3689 /* Whether this attribute requires a type. If it does, it will be passed
3690 from a DECL to the type of that DECL. */
3691 const bool type_required;
3692 /* Whether this attribute requires a function (or method) type. If it does,
3693 it will be passed from a function pointer type to the target type,
3694 and from a function return type (which is not itself a function
3695 pointer type) to the function type. */
3696 const bool function_type_required;
3697 /* Function to handle this attribute. NODE points to the node to which
3698 the attribute is to be applied. If a DECL, it should be modified in
3699 place; if a TYPE, a copy should be created. NAME is the name of the
3700 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3701 of the arguments (which may be NULL). FLAGS gives further information
3702 about the context of the attribute. Afterwards, the attributes will
3703 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3704 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3705 as well as in any other cases when the attributes should not be added
3706 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3707 applied to another type or DECL later may be returned;
3708 otherwise the return value should be NULL_TREE. This pointer may be
3709 NULL if no special handling is required beyond the checks implied
3710 by the rest of this structure. */
3711 tree (*const handler) (tree *node, tree name, tree args,
3712 int flags, bool *no_add_attrs);
3715 /* Flags that may be passed in the third argument of decl_attributes, and
3716 to handler functions for attributes. */
3717 enum attribute_flags
3719 /* The type passed in is the type of a DECL, and any attributes that
3720 should be passed in again to be applied to the DECL rather than the
3721 type should be returned. */
3722 ATTR_FLAG_DECL_NEXT = 1,
3723 /* The type passed in is a function return type, and any attributes that
3724 should be passed in again to be applied to the function type rather
3725 than the return type should be returned. */
3726 ATTR_FLAG_FUNCTION_NEXT = 2,
3727 /* The type passed in is an array element type, and any attributes that
3728 should be passed in again to be applied to the array type rather
3729 than the element type should be returned. */
3730 ATTR_FLAG_ARRAY_NEXT = 4,
3731 /* The type passed in is a structure, union or enumeration type being
3732 created, and should be modified in place. */
3733 ATTR_FLAG_TYPE_IN_PLACE = 8,
3734 /* The attributes are being applied by default to a library function whose
3735 name indicates known behavior, and should be silently ignored if they
3736 are not in fact compatible with the function type. */
3737 ATTR_FLAG_BUILT_IN = 16
3740 /* Default versions of target-overridable functions. */
3742 extern tree merge_decl_attributes (tree, tree);
3743 extern tree merge_type_attributes (tree, tree);
3745 /* Given a tree node and a string, return nonzero if the tree node is
3746 a valid attribute name for the string. */
3748 extern int is_attribute_p (const char *, tree);
3750 /* Given an attribute name and a list of attributes, return the list element
3751 of the attribute or NULL_TREE if not found. */
3753 extern tree lookup_attribute (const char *, tree);
3755 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3758 extern tree remove_attribute (const char *, tree);
3760 /* Given two attributes lists, return a list of their union. */
3762 extern tree merge_attributes (tree, tree);
3764 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3765 /* Given two Windows decl attributes lists, possibly including
3766 dllimport, return a list of their union . */
3767 extern tree merge_dllimport_decl_attributes (tree, tree);
3769 /* Handle a "dllimport" or "dllexport" attribute. */
3770 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3773 /* Check whether CAND is suitable to be returned from get_qualified_type
3774 (BASE, TYPE_QUALS). */
3776 extern bool check_qualified_type (tree, tree, int);
3778 /* Return a version of the TYPE, qualified as indicated by the
3779 TYPE_QUALS, if one exists. If no qualified version exists yet,
3780 return NULL_TREE. */
3782 extern tree get_qualified_type (tree, int);
3784 /* Like get_qualified_type, but creates the type if it does not
3785 exist. This function never returns NULL_TREE. */
3787 extern tree build_qualified_type (tree, int);
3789 /* Like build_qualified_type, but only deals with the `const' and
3790 `volatile' qualifiers. This interface is retained for backwards
3791 compatibility with the various front-ends; new code should use
3792 build_qualified_type instead. */
3794 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3795 build_qualified_type ((TYPE), \
3796 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3797 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3799 /* Make a copy of a type node. */
3801 extern tree build_distinct_type_copy (tree);
3802 extern tree build_variant_type_copy (tree);
3804 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3805 fields. Optionally specify an alignment, and then lay it out. */
3807 extern void finish_builtin_struct (tree, const char *,
3810 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3811 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3812 node, does nothing except for the first time. */
3814 extern void layout_type (tree);
3816 /* These functions allow a front-end to perform a manual layout of a
3817 RECORD_TYPE. (For instance, if the placement of subsequent fields
3818 depends on the placement of fields so far.) Begin by calling
3819 start_record_layout. Then, call place_field for each of the
3820 fields. Then, call finish_record_layout. See layout_type for the
3821 default way in which these functions are used. */
3823 typedef struct record_layout_info_s
3825 /* The RECORD_TYPE that we are laying out. */
3827 /* The offset into the record so far, in bytes, not including bits in
3830 /* The last known alignment of SIZE. */
3831 unsigned int offset_align;
3832 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3834 /* The alignment of the record so far, in bits. */
3835 unsigned int record_align;
3836 /* The alignment of the record so far, ignoring #pragma pack and
3837 __attribute__ ((packed)), in bits. */
3838 unsigned int unpacked_align;
3839 /* The previous field layed out. */
3841 /* The static variables (i.e., class variables, as opposed to
3842 instance variables) encountered in T. */
3843 tree pending_statics;
3844 /* Bits remaining in the current alignment group */
3845 int remaining_in_alignment;
3846 /* True if we've seen a packed field that didn't have normal
3847 alignment anyway. */
3848 int packed_maybe_necessary;
3849 } *record_layout_info;
3851 extern void set_lang_adjust_rli (void (*) (record_layout_info));
3852 extern record_layout_info start_record_layout (tree);
3853 extern tree bit_from_pos (tree, tree);
3854 extern tree byte_from_pos (tree, tree);
3855 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
3856 extern void normalize_offset (tree *, tree *, unsigned int);
3857 extern tree rli_size_unit_so_far (record_layout_info);
3858 extern tree rli_size_so_far (record_layout_info);
3859 extern void normalize_rli (record_layout_info);
3860 extern void place_field (record_layout_info, tree);
3861 extern void compute_record_mode (tree);
3862 extern void finish_record_layout (record_layout_info, int);
3864 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3865 return a canonicalized ..._TYPE node, so that duplicates are not made.
3866 How the hash code is computed is up to the caller, as long as any two
3867 callers that could hash identical-looking type nodes agree. */
3869 extern tree type_hash_canon (unsigned int, tree);
3871 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3872 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3873 fields. Call this only once for any given decl node.
3875 Second argument is the boundary that this field can be assumed to
3876 be starting at (in bits). Zero means it can be assumed aligned
3877 on any boundary that may be needed. */
3879 extern void layout_decl (tree, unsigned);
3881 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3882 a previous call to layout_decl and calls it again. */
3884 extern void relayout_decl (tree);
3886 /* Return the mode for data of a given size SIZE and mode class CLASS.
3887 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3888 The value is BLKmode if no other mode is found. This is like
3889 mode_for_size, but is passed a tree. */
3891 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
3893 /* Return an expr equal to X but certainly not valid as an lvalue. */
3895 extern tree non_lvalue (tree);
3897 extern tree convert (tree, tree);
3898 extern unsigned int expr_align (tree);
3899 extern tree expr_first (tree);
3900 extern tree expr_last (tree);
3901 extern tree expr_only (tree);
3902 extern tree size_in_bytes (tree);
3903 extern HOST_WIDE_INT int_size_in_bytes (tree);
3904 extern HOST_WIDE_INT max_int_size_in_bytes (tree);
3905 extern tree bit_position (tree);
3906 extern HOST_WIDE_INT int_bit_position (tree);
3907 extern tree byte_position (tree);
3908 extern HOST_WIDE_INT int_byte_position (tree);
3910 /* Define data structures, macros, and functions for handling sizes
3911 and the various types used to represent sizes. */
3915 SIZETYPE, /* Normal representation of sizes in bytes. */
3916 SSIZETYPE, /* Signed representation of sizes in bytes. */
3917 BITSIZETYPE, /* Normal representation of sizes in bits. */
3918 SBITSIZETYPE, /* Signed representation of sizes in bits. */
3921 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
3923 #define sizetype sizetype_tab[(int) SIZETYPE]
3924 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
3925 #define ssizetype sizetype_tab[(int) SSIZETYPE]
3926 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
3928 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
3929 extern tree size_binop (enum tree_code, tree, tree);
3930 extern tree size_diffop (tree, tree);
3932 #define size_int(L) size_int_kind (L, SIZETYPE)
3933 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
3934 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
3935 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
3937 extern tree round_up (tree, int);
3938 extern tree round_down (tree, int);
3939 extern tree get_pending_sizes (void);
3940 extern void put_pending_size (tree);
3941 extern void put_pending_sizes (tree);
3943 /* Type for sizes of data-type. */
3945 #define BITS_PER_UNIT_LOG \
3946 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3947 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3948 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3950 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
3951 extern unsigned int maximum_field_alignment;
3952 /* and its original value in bytes, specified via -fpack-struct=<value>. */
3953 extern unsigned int initial_max_fld_align;
3955 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3956 by making the last node in X point to Y.
3957 Returns X, except if X is 0 returns Y. */
3959 extern tree chainon (tree, tree);
3961 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3963 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3964 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3966 /* Return the last tree node in a chain. */
3968 extern tree tree_last (tree);
3970 /* Reverse the order of elements in a chain, and return the new head. */
3972 extern tree nreverse (tree);
3974 /* Returns the length of a chain of nodes
3975 (number of chain pointers to follow before reaching a null pointer). */
3977 extern int list_length (tree);
3979 /* Returns the number of FIELD_DECLs in a type. */
3981 extern int fields_length (tree);
3983 /* Given an initializer INIT, return TRUE if INIT is zero or some
3984 aggregate of zeros. Otherwise return FALSE. */
3986 extern bool initializer_zerop (tree);
3988 /* Examine CTOR to discover:
3989 * how many scalar fields are set to nonzero values,
3990 and place it in *P_NZ_ELTS;
3991 * how many scalar fields in total are in CTOR,
3992 and place it in *P_ELT_COUNT.
3993 * if a type is a union, and the initializer from the constructor
3994 is not the largest element in the union, then set *p_must_clear.
3996 Return whether or not CTOR is a valid static constant initializer, the same
3997 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
3999 extern bool categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4002 extern HOST_WIDE_INT count_type_elements (tree, bool);
4004 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4006 extern int integer_zerop (tree);
4008 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4010 extern int integer_onep (tree);
4012 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4013 all of whose significant bits are 1. */
4015 extern int integer_all_onesp (tree);
4017 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4018 exactly one bit 1. */
4020 extern int integer_pow2p (tree);
4022 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4023 with a nonzero value. */
4025 extern int integer_nonzerop (tree);
4027 extern bool zero_p (tree);
4028 extern bool cst_and_fits_in_hwi (tree);
4029 extern tree num_ending_zeros (tree);
4031 /* staticp (tree x) is nonzero if X is a reference to data allocated
4032 at a fixed address in memory. Returns the outermost data. */
4034 extern tree staticp (tree);
4036 /* save_expr (EXP) returns an expression equivalent to EXP
4037 but it can be used multiple times within context CTX
4038 and only evaluate EXP once. */
4040 extern tree save_expr (tree);
4042 /* Look inside EXPR and into any simple arithmetic operations. Return
4043 the innermost non-arithmetic node. */
4045 extern tree skip_simple_arithmetic (tree);
4047 /* Return which tree structure is used by T. */
4049 enum tree_node_structure_enum tree_node_structure (tree);
4051 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4052 or offset that depends on a field within a record.
4054 Note that we only allow such expressions within simple arithmetic
4057 extern bool contains_placeholder_p (tree);
4059 /* This macro calls the above function but short-circuits the common
4060 case of a constant to save time. Also check for null. */
4062 #define CONTAINS_PLACEHOLDER_P(EXP) \
4063 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4065 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4066 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4069 extern bool type_contains_placeholder_p (tree);
4071 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4072 return a tree with all occurrences of references to F in a
4073 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4074 contains only arithmetic expressions. */
4076 extern tree substitute_in_expr (tree, tree, tree);
4078 /* This macro calls the above function but short-circuits the common
4079 case of a constant to save time and also checks for NULL. */
4081 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4082 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4084 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4085 for it within OBJ, a tree that is an object or a chain of references. */
4087 extern tree substitute_placeholder_in_expr (tree, tree);
4089 /* This macro calls the above function but short-circuits the common
4090 case of a constant to save time and also checks for NULL. */
4092 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4093 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4094 : substitute_placeholder_in_expr (EXP, OBJ))
4096 /* variable_size (EXP) is like save_expr (EXP) except that it
4097 is for the special case of something that is part of a
4098 variable size for a data type. It makes special arrangements
4099 to compute the value at the right time when the data type
4100 belongs to a function parameter. */
4102 extern tree variable_size (tree);
4104 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4105 but it can be used multiple times
4106 and only evaluate the subexpressions once. */
4108 extern tree stabilize_reference (tree);
4110 /* Subroutine of stabilize_reference; this is called for subtrees of
4111 references. Any expression with side-effects must be put in a SAVE_EXPR
4112 to ensure that it is only evaluated once. */
4114 extern tree stabilize_reference_1 (tree);
4116 /* Return EXP, stripped of any conversions to wider types
4117 in such a way that the result of converting to type FOR_TYPE
4118 is the same as if EXP were converted to FOR_TYPE.
4119 If FOR_TYPE is 0, it signifies EXP's type. */
4121 extern tree get_unwidened (tree, tree);
4123 /* Return OP or a simpler expression for a narrower value
4124 which can be sign-extended or zero-extended to give back OP.
4125 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4126 or 0 if the value should be sign-extended. */
4128 extern tree get_narrower (tree, int *);
4130 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4131 look for nested component-refs or array-refs at constant positions
4132 and find the ultimate containing object, which is returned. */
4134 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4135 tree *, enum machine_mode *, int *, int *,
4138 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4139 look for whether EXP or any nested component-refs within EXP is marked
4142 extern bool contains_packed_reference (tree exp);
4144 /* Return 1 if T is an expression that get_inner_reference handles. */
4146 extern int handled_component_p (tree);
4148 /* Return a tree of sizetype representing the size, in bytes, of the element
4149 of EXP, an ARRAY_REF. */
4151 extern tree array_ref_element_size (tree);
4153 /* Return a tree representing the lower bound of the array mentioned in
4154 EXP, an ARRAY_REF. */
4156 extern tree array_ref_low_bound (tree);
4158 /* Return a tree representing the upper bound of the array mentioned in
4159 EXP, an ARRAY_REF. */
4161 extern tree array_ref_up_bound (tree);
4163 /* Return a tree representing the offset, in bytes, of the field referenced
4164 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4166 extern tree component_ref_field_offset (tree);
4168 /* Given a DECL or TYPE, return the scope in which it was declared, or
4169 NUL_TREE if there is no containing scope. */
4171 extern tree get_containing_scope (tree);
4173 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4175 extern tree decl_function_context (tree);
4177 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4178 this _DECL with its context, or zero if none. */
4179 extern tree decl_type_context (tree);
4181 /* Return 1 if EXPR is the real constant zero. */
4182 extern int real_zerop (tree);
4184 /* Declare commonly used variables for tree structure. */
4186 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4187 Zero means allow extended lvalues. */
4189 extern int pedantic_lvalues;
4191 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4193 extern GTY(()) tree current_function_decl;
4195 /* Nonzero means a FUNC_BEGIN label was emitted. */
4196 extern GTY(()) const char * current_function_func_begin_label;
4199 extern unsigned crc32_string (unsigned, const char *);
4200 extern void clean_symbol_name (char *);
4201 extern tree get_file_function_name (const char *);
4202 extern tree get_callee_fndecl (tree);
4203 extern void change_decl_assembler_name (tree, tree);
4204 extern int type_num_arguments (tree);
4205 extern bool associative_tree_code (enum tree_code);
4206 extern bool commutative_tree_code (enum tree_code);
4207 extern tree upper_bound_in_type (tree, tree);
4208 extern tree lower_bound_in_type (tree, tree);
4209 extern int operand_equal_for_phi_arg_p (tree, tree);
4210 extern bool empty_body_p (tree);
4214 extern void expand_expr_stmt (tree);
4215 extern int warn_if_unused_value (tree, location_t);
4216 extern void expand_label (tree);
4217 extern void expand_goto (tree);
4219 extern rtx expand_stack_save (void);
4220 extern void expand_stack_restore (tree);
4221 extern void expand_return (tree);
4222 extern int is_body_block (tree);
4225 extern void using_eh_for_cleanups (void);
4227 /* In fold-const.c */
4229 /* Non-zero if we are folding constants inside an initializer; zero
4231 extern int folding_initializer;
4233 /* Fold constants as much as possible in an expression.
4234 Returns the simplified expression.
4235 Acts only on the top level of the expression;
4236 if the argument itself cannot be simplified, its
4237 subexpressions are not changed. */
4239 extern tree fold (tree);
4240 extern tree fold_unary (enum tree_code, tree, tree);
4241 extern tree fold_binary (enum tree_code, tree, tree, tree);
4242 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4243 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4244 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4245 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4246 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4247 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4248 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4249 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4250 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4251 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4252 extern tree fold_convert (tree, tree);
4253 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4254 extern tree fold_ignored_result (tree);
4255 extern tree fold_abs_const (tree, tree);
4256 extern tree fold_indirect_ref_1 (tree, tree);
4257 extern void fold_defer_overflow_warnings (void);
4258 extern void fold_undefer_overflow_warnings (bool, tree, int);
4259 extern void fold_undefer_and_ignore_overflow_warnings (void);
4260 extern bool fold_deferring_overflow_warnings_p (void);
4262 extern tree force_fit_type (tree, int, bool, bool);
4264 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4265 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4266 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4268 #define add_double(l1,h1,l2,h2,lv,hv) \
4269 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4270 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4271 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4272 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4273 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4274 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4276 #define mul_double(l1,h1,l2,h2,lv,hv) \
4277 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4278 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4279 HOST_WIDE_INT, unsigned int,
4280 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4281 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4282 HOST_WIDE_INT, unsigned int,
4283 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4284 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4285 HOST_WIDE_INT, unsigned int,
4286 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4287 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4288 HOST_WIDE_INT, unsigned int,
4289 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4291 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4292 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4293 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4294 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4297 enum operand_equal_flag
4303 extern int operand_equal_p (tree, tree, unsigned int);
4305 extern tree omit_one_operand (tree, tree, tree);
4306 extern tree omit_two_operands (tree, tree, tree, tree);
4307 extern tree invert_truthvalue (tree);
4308 extern tree fold_truth_not_expr (tree);
4309 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4310 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4311 extern tree fold_read_from_constant_string (tree);
4312 extern tree int_const_binop (enum tree_code, tree, tree, int);
4313 extern tree build_fold_addr_expr (tree);
4314 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4315 extern tree fold_strip_sign_ops (tree);
4316 extern tree build_fold_addr_expr_with_type (tree, tree);
4317 extern tree build_fold_indirect_ref (tree);
4318 extern tree fold_indirect_ref (tree);
4319 extern tree constant_boolean_node (int, tree);
4320 extern tree build_low_bits_mask (tree, unsigned);
4322 extern bool tree_swap_operands_p (tree, tree, bool);
4323 extern void swap_tree_operands (tree, tree *, tree *);
4324 extern enum tree_code swap_tree_comparison (enum tree_code);
4326 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4327 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4329 extern bool tree_expr_nonzero_p (tree);
4330 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4333 extern tree fold_builtin (tree, tree, bool);
4334 extern tree fold_builtin_fputs (tree, bool, bool, tree);
4335 extern tree fold_builtin_strcpy (tree, tree, tree);
4336 extern tree fold_builtin_strncpy (tree, tree, tree);
4337 extern tree fold_builtin_memory_chk (tree, tree, tree, bool,
4338 enum built_in_function);
4339 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, bool,
4340 enum built_in_function);
4341 extern tree fold_builtin_strncpy_chk (tree, tree);
4342 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4343 extern bool fold_builtin_next_arg (tree);
4344 extern enum built_in_function builtin_mathfn_code (tree);
4345 extern tree build_function_call_expr (tree, tree);
4346 extern tree mathfn_built_in (tree, enum built_in_function fn);
4347 extern tree strip_float_extensions (tree);
4348 extern tree c_strlen (tree, int);
4349 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4350 extern tree build_va_arg_indirect_ref (tree);
4351 tree build_string_literal (int, const char *);
4354 extern tree strip_float_extensions (tree);
4357 extern void record_component_aliases (tree);
4358 extern HOST_WIDE_INT get_alias_set (tree);
4359 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4360 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4361 extern int objects_must_conflict_p (tree, tree);
4364 extern int really_constant_p (tree);
4365 extern int int_fits_type_p (tree, tree);
4366 extern bool variably_modified_type_p (tree, tree);
4367 extern int tree_log2 (tree);
4368 extern int tree_floor_log2 (tree);
4369 extern int simple_cst_equal (tree, tree);
4370 extern hashval_t iterative_hash_expr (tree, hashval_t);
4371 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
4372 extern int type_list_equal (tree, tree);
4373 extern int chain_member (tree, tree);
4374 extern tree type_hash_lookup (unsigned int, tree);
4375 extern void type_hash_add (unsigned int, tree);
4376 extern int simple_cst_list_equal (tree, tree);
4377 extern void dump_tree_statistics (void);
4378 extern void expand_function_end (void);
4379 extern void expand_function_start (tree);
4380 extern void stack_protect_prologue (void);
4381 extern void stack_protect_epilogue (void);
4382 extern void recompute_tree_invariant_for_addr_expr (tree);
4383 extern bool is_global_var (tree t);
4384 extern bool needs_to_live_in_memory (tree);
4385 extern tree reconstruct_complex_type (tree, tree);
4387 extern int real_onep (tree);
4388 extern int real_twop (tree);
4389 extern int real_minus_onep (tree);
4390 extern void init_ttree (void);
4391 extern void build_common_tree_nodes (bool, bool);
4392 extern void build_common_tree_nodes_2 (int);
4393 extern void build_common_builtin_nodes (void);
4394 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4395 extern tree build_range_type (tree, tree, tree);
4396 extern HOST_WIDE_INT int_cst_value (tree);
4397 extern tree tree_fold_gcd (tree, tree);
4398 extern tree build_addr (tree, tree);
4400 extern bool fields_compatible_p (tree, tree);
4401 extern tree find_compatible_field (tree, tree);
4404 extern void expand_main_function (void);
4405 extern void init_dummy_function_start (void);
4406 extern void expand_dummy_function_end (void);
4407 extern unsigned int init_function_for_compilation (void);
4408 extern void allocate_struct_function (tree);
4409 extern void init_function_start (tree);
4410 extern bool use_register_for_decl (tree);
4411 extern void setjmp_vars_warning (tree);
4412 extern void setjmp_args_warning (void);
4413 extern void init_temp_slots (void);
4414 extern void free_temp_slots (void);
4415 extern void pop_temp_slots (void);
4416 extern void push_temp_slots (void);
4417 extern void preserve_temp_slots (rtx);
4418 extern int aggregate_value_p (tree, tree);
4419 extern void push_function_context (void);
4420 extern void pop_function_context (void);
4421 extern void push_function_context_to (tree);
4422 extern void pop_function_context_from (tree);
4423 extern tree gimplify_parameters (void);
4425 /* In print-rtl.c */
4427 extern void print_rtl (FILE *, rtx);
4430 /* In print-tree.c */
4431 extern void debug_tree (tree);
4433 extern void dump_addr (FILE*, const char *, void *);
4434 extern void print_node (FILE *, const char *, tree, int);
4435 extern void print_node_brief (FILE *, const char *, tree, int);
4436 extern void indent_to (FILE *, int);
4439 /* In tree-inline.c: */
4440 extern bool debug_find_tree (tree, tree);
4441 /* This is in tree-inline.c since the routine uses
4442 data structures from the inliner. */
4443 extern tree unsave_expr_now (tree);
4444 extern tree build_duplicate_type (tree);
4447 extern rtx emit_line_note (location_t);
4451 /* Nonzero if this is a call to a function whose return value depends
4452 solely on its arguments, has no side effects, and does not read
4455 /* Nonzero if this call will never return. */
4456 #define ECF_NORETURN 2
4457 /* Nonzero if this is a call to malloc or a related function. */
4458 #define ECF_MALLOC 4
4459 /* Nonzero if it is plausible that this is a call to alloca. */
4460 #define ECF_MAY_BE_ALLOCA 8
4461 /* Nonzero if this is a call to a function that won't throw an exception. */
4462 #define ECF_NOTHROW 16
4463 /* Nonzero if this is a call to setjmp or a related function. */
4464 #define ECF_RETURNS_TWICE 32
4465 /* Nonzero if this call replaces the current stack frame. */
4466 #define ECF_SIBCALL 64
4467 /* Nonzero if this is a call to "pure" function (like const function,
4468 but may read memory. */
4469 #define ECF_PURE 128
4470 /* Nonzero if this is a call to a function that returns with the stack
4471 pointer depressed. */
4472 #define ECF_SP_DEPRESSED 256
4473 /* Create libcall block around the call. */
4474 #define ECF_LIBCALL_BLOCK 512
4475 /* Function does not read or write memory (but may have side effects, so
4476 it does not necessarily fit ECF_CONST). */
4477 #define ECF_NOVOPS 1024
4479 extern int flags_from_decl_or_type (tree);
4480 extern int call_expr_flags (tree);
4482 extern int setjmp_call_p (tree);
4483 extern bool alloca_call_p (tree);
4484 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
4485 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
4489 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4490 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4491 it should be modified in place; if a TYPE, a copy should be created
4492 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4493 information, in the form of a bitwise OR of flags in enum attribute_flags
4494 from tree.h. Depending on these flags, some attributes may be
4495 returned to be applied at a later stage (for example, to apply
4496 a decl attribute to the declaration rather than to its type). */
4497 extern tree decl_attributes (tree *, tree, int);
4499 /* In integrate.c */
4500 extern void set_decl_abstract_flags (tree, int);
4501 extern void set_decl_origin_self (tree);
4503 /* In stor-layout.c */
4504 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
4505 extern void fixup_signed_type (tree);
4506 extern void internal_reference_types (void);
4507 extern unsigned int update_alignment_for_field (record_layout_info, tree,
4510 extern void make_decl_rtl (tree);
4511 extern void make_decl_one_only (tree);
4512 extern int supports_one_only (void);
4513 extern void resolve_unique_section (tree, int, int);
4514 extern void mark_referenced (tree);
4515 extern void mark_decl_referenced (tree);
4516 extern void notice_global_symbol (tree);
4517 extern void set_user_assembler_name (tree, const char *);
4518 extern void process_pending_assemble_externals (void);
4519 extern void finish_aliases_1 (void);
4520 extern void finish_aliases_2 (void);
4523 extern void expand_computed_goto (tree);
4524 extern bool parse_output_constraint (const char **, int, int, int,
4525 bool *, bool *, bool *);
4526 extern bool parse_input_constraint (const char **, int, int, int, int,
4527 const char * const *, bool *, bool *);
4528 extern void expand_asm_expr (tree);
4529 extern tree resolve_asm_operand_names (tree, tree, tree);
4530 extern void expand_case (tree);
4531 extern void expand_decl (tree);
4532 extern void expand_anon_union_decl (tree, tree, tree);
4534 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4535 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
4538 /* In gimplify.c. */
4539 extern tree create_artificial_label (void);
4540 extern void gimplify_function_tree (tree);
4541 extern const char *get_name (tree);
4542 extern tree unshare_expr (tree);
4543 extern void sort_case_labels (tree);
4545 /* Interface of the DWARF2 unwind info support. */
4547 /* Generate a new label for the CFI info to refer to. */
4549 extern char *dwarf2out_cfi_label (void);
4551 /* Entry point to update the canonical frame address (CFA). */
4553 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
4555 /* Add the CFI for saving a register window. */
4557 extern void dwarf2out_window_save (const char *);
4559 /* Add a CFI to update the running total of the size of arguments pushed
4562 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
4564 /* Entry point for saving a register to the stack. */
4566 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
4568 /* Entry point for saving the return address in the stack. */
4570 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
4572 /* Entry point for saving the return address in a register. */
4574 extern void dwarf2out_return_reg (const char *, unsigned);
4576 /* Entry point for saving the first register into the second. */
4578 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
4580 /* In tree-inline.c */
4582 /* The type of a set of already-visited pointers. Functions for creating
4583 and manipulating it are declared in pointer-set.h */
4584 struct pointer_set_t;
4586 /* The type of a callback function for walking over tree structure. */
4588 typedef tree (*walk_tree_fn) (tree *, int *, void *);
4589 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
4590 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
4592 /* Assign the RTX to declaration. */
4594 extern void set_decl_rtl (tree, rtx);
4595 extern void set_decl_incoming_rtl (tree, rtx);
4597 /* Enum and arrays used for tree allocation stats.
4598 Keep in sync with tree.c:tree_node_kind_names. */
4623 extern int tree_node_counts[];
4624 extern int tree_node_sizes[];
4626 /* True if we are in gimple form and the actions of the folders need to
4627 be restricted. False if we are not in gimple form and folding is not
4628 restricted to creating gimple expressions. */
4629 extern bool in_gimple_form;
4631 /* In tree-gimple.c. */
4632 extern tree get_base_address (tree t);
4634 /* In tree-vectorizer.c. */
4635 extern void vect_set_verbosity_level (const char *);
4637 struct tree_map GTY(())
4644 extern unsigned int tree_map_hash (const void *);
4645 extern int tree_map_marked_p (const void *);
4646 extern int tree_map_eq (const void *, const void *);
4648 /* In tree-ssa-address.c. */
4649 extern tree tree_mem_ref_addr (tree, tree);
4650 extern void copy_mem_ref_info (tree, tree);
4653 extern bool ssa_name_nonzero_p (tree);
4654 extern bool ssa_name_nonnegative_p (tree);
4656 /* In tree-object-size.c. */
4657 extern void init_object_sizes (void);
4658 extern void fini_object_sizes (void);
4659 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
4662 extern unsigned HOST_WIDE_INT highest_pow2_factor (tree);
4664 #endif /* GCC_TREE_H */