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
28 #include "statistics.h"
31 /* Codes of tree nodes */
33 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
38 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
44 extern unsigned char tree_contains_struct[256][64];
45 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
47 /* Number of language-independent tree codes. */
48 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
50 /* Tree code classes. */
52 /* Each tree_code has an associated code class represented by a
55 enum tree_code_class {
56 tcc_exceptional, /* An exceptional code (fits no category). */
57 tcc_constant, /* A constant. */
58 /* Order of tcc_type and tcc_declaration is important. */
59 tcc_type, /* A type object code. */
60 tcc_declaration, /* A declaration (also serving as variable refs). */
61 tcc_reference, /* A reference to storage. */
62 tcc_comparison, /* A comparison expression. */
63 tcc_unary, /* A unary arithmetic expression. */
64 tcc_binary, /* A binary arithmetic expression. */
65 tcc_statement, /* A statement expression, which have side effects
66 but usually no interesting value. */
67 tcc_expression /* Any other expression. */
70 /* Each tree code class has an associated string representation.
71 These must correspond to the tree_code_class entries. */
73 extern const char *const tree_code_class_strings[];
75 /* Returns the string representing CLASS. */
77 #define TREE_CODE_CLASS_STRING(CLASS)\
78 tree_code_class_strings[(int) (CLASS)]
80 #define MAX_TREE_CODES 256
81 extern const enum tree_code_class tree_code_type[];
82 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
84 /* Nonzero if CODE represents an exceptional code. */
86 #define EXCEPTIONAL_CLASS_P(CODE)\
87 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
89 /* Nonzero if CODE represents a constant. */
91 #define CONSTANT_CLASS_P(CODE)\
92 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
94 /* Nonzero if CODE represents a type. */
97 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
99 /* Nonzero if CODE represents a declaration. */
101 #define DECL_P(CODE)\
102 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
104 /* Nonzero if CODE represents a memory tag. */
106 #define MTAG_P(CODE) \
107 (TREE_CODE (CODE) == STRUCT_FIELD_TAG \
108 || TREE_CODE (CODE) == NAME_MEMORY_TAG \
109 || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG)
112 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
114 #define VAR_OR_FUNCTION_DECL_P(DECL)\
115 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
117 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
118 ascending code order. */
120 #define INDIRECT_REF_P(CODE)\
121 (TREE_CODE (CODE) == INDIRECT_REF \
122 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
123 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
125 /* Nonzero if CODE represents a reference. */
127 #define REFERENCE_CLASS_P(CODE)\
128 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
130 /* Nonzero if CODE represents a comparison. */
132 #define COMPARISON_CLASS_P(CODE)\
133 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
135 /* Nonzero if CODE represents a unary arithmetic expression. */
137 #define UNARY_CLASS_P(CODE)\
138 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
140 /* Nonzero if CODE represents a binary arithmetic expression. */
142 #define BINARY_CLASS_P(CODE)\
143 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
145 /* Nonzero if CODE represents a statement expression. */
147 #define STATEMENT_CLASS_P(CODE)\
148 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
150 /* Nonzero if CODE represents any other expression. */
152 #define EXPRESSION_CLASS_P(CODE)\
153 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
155 /* Returns nonzero iff CODE represents a type or declaration. */
157 #define IS_TYPE_OR_DECL_P(CODE)\
158 (TYPE_P (CODE) || DECL_P (CODE))
160 /* Returns nonzero iff CLASS is the tree-code class of an
163 #define IS_EXPR_CODE_CLASS(CLASS)\
164 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
166 /* Returns nonzero iff NODE is an expression of some kind. */
168 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
170 /* Returns nonzero iff NODE is an OpenMP directive. */
172 #define OMP_DIRECTIVE_P(NODE) \
173 (TREE_CODE (NODE) == OMP_PARALLEL \
174 || TREE_CODE (NODE) == OMP_FOR \
175 || TREE_CODE (NODE) == OMP_SECTIONS \
176 || TREE_CODE (NODE) == OMP_SINGLE \
177 || TREE_CODE (NODE) == OMP_SECTION \
178 || TREE_CODE (NODE) == OMP_MASTER \
179 || TREE_CODE (NODE) == OMP_ORDERED \
180 || TREE_CODE (NODE) == OMP_CRITICAL \
181 || TREE_CODE (NODE) == OMP_RETURN \
182 || TREE_CODE (NODE) == OMP_CONTINUE)
184 /* Number of argument-words in each kind of tree-node. */
186 extern const unsigned char tree_code_length[];
187 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
189 /* Names of tree components. */
191 extern const char *const tree_code_name[];
193 /* A vectors of trees. */
195 DEF_VEC_ALLOC_P(tree,gc);
196 DEF_VEC_ALLOC_P(tree,heap);
199 /* Classify which part of the compiler has defined a given builtin function.
200 Note that we assume below that this is no more than two bits. */
209 /* Names for the above. */
210 extern const char *const built_in_class_names[4];
212 /* Codes that identify the various built in functions
213 so that expand_call can identify them quickly. */
215 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
216 enum built_in_function
218 #include "builtins.def"
220 /* Complex division routines in libgcc. These are done via builtins
221 because emit_library_call_value can't handle complex values. */
222 BUILT_IN_COMPLEX_MUL_MIN,
223 BUILT_IN_COMPLEX_MUL_MAX
224 = BUILT_IN_COMPLEX_MUL_MIN
225 + MAX_MODE_COMPLEX_FLOAT
226 - MIN_MODE_COMPLEX_FLOAT,
228 BUILT_IN_COMPLEX_DIV_MIN,
229 BUILT_IN_COMPLEX_DIV_MAX
230 = BUILT_IN_COMPLEX_DIV_MIN
231 + MAX_MODE_COMPLEX_FLOAT
232 - MIN_MODE_COMPLEX_FLOAT,
234 /* Upper bound on non-language-specific builtins. */
239 /* Names for the above. */
240 extern const char * built_in_names[(int) END_BUILTINS];
242 /* Helper macros for math builtins. */
244 #define BUILTIN_EXP10_P(FN) \
245 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
246 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
248 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
249 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
250 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
252 #define BUILTIN_SQRT_P(FN) \
253 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
255 #define BUILTIN_CBRT_P(FN) \
256 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
258 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
260 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
261 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
263 /* An array of _DECL trees for the above. */
264 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
265 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
267 /* In an OMP_CLAUSE node. */
269 /* Number of operands and names for each clause. */
270 extern unsigned const char omp_clause_num_ops[];
271 extern const char * const omp_clause_code_name[];
273 /* Clause codes. Do not reorder, as this is used to index into the tables
274 omp_clause_num_ops and omp_clause_code_name. */
277 /* Clause zero is special-cased inside the parser
278 (c_parser_omp_variable_list). */
279 OMP_CLAUSE_ERROR = 0,
281 /* OpenMP clause: private (variable_list). */
284 /* OpenMP clause: shared (variable_list). */
287 /* OpenMP clause: firstprivate (variable_list). */
288 OMP_CLAUSE_FIRSTPRIVATE,
290 /* OpenMP clause: lastprivate (variable_list). */
291 OMP_CLAUSE_LASTPRIVATE,
293 /* OpenMP clause: reduction (operator:variable_list).
294 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
295 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
296 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
298 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
299 placeholder used in OMP_CLAUSE_REDUCTION_MERGE. */
300 OMP_CLAUSE_REDUCTION,
302 /* OpenMP clause: copyin (variable_list). */
305 /* OpenMP clause: copyprivate (variable_list). */
306 OMP_CLAUSE_COPYPRIVATE,
308 /* OpenMP clause: if (scalar-expression). */
311 /* OpenMP clause: num_threads (integer-expression). */
312 OMP_CLAUSE_NUM_THREADS,
314 /* OpenMP clause: schedule. */
317 /* OpenMP clause: nowait. */
320 /* OpenMP clause: ordered. */
323 /* OpenMP clause: default. */
327 /* The definition of tree nodes fills the next several pages. */
329 /* A tree node can represent a data type, a variable, an expression
330 or a statement. Each node has a TREE_CODE which says what kind of
331 thing it represents. Some common codes are:
332 INTEGER_TYPE -- represents a type of integers.
333 ARRAY_TYPE -- represents a type of pointer.
334 VAR_DECL -- represents a declared variable.
335 INTEGER_CST -- represents a constant integer value.
336 PLUS_EXPR -- represents a sum (an expression).
338 As for the contents of a tree node: there are some fields
339 that all nodes share. Each TREE_CODE has various special-purpose
340 fields as well. The fields of a node are never accessed directly,
341 always through accessor macros. */
343 /* Every kind of tree node starts with this structure,
344 so all nodes have these fields.
346 See the accessor macros, defined below, for documentation of the
350 struct tree_common GTY(())
354 union tree_ann_d *ann;
356 ENUM_BITFIELD(tree_code) code : 8;
358 unsigned side_effects_flag : 1;
359 unsigned constant_flag : 1;
360 unsigned addressable_flag : 1;
361 unsigned volatile_flag : 1;
362 unsigned readonly_flag : 1;
363 unsigned unsigned_flag : 1;
364 unsigned asm_written_flag: 1;
365 unsigned nowarning_flag : 1;
367 unsigned used_flag : 1;
368 unsigned nothrow_flag : 1;
369 unsigned static_flag : 1;
370 unsigned public_flag : 1;
371 unsigned private_flag : 1;
372 unsigned protected_flag : 1;
373 unsigned deprecated_flag : 1;
374 unsigned invariant_flag : 1;
376 unsigned lang_flag_0 : 1;
377 unsigned lang_flag_1 : 1;
378 unsigned lang_flag_2 : 1;
379 unsigned lang_flag_3 : 1;
380 unsigned lang_flag_4 : 1;
381 unsigned lang_flag_5 : 1;
382 unsigned lang_flag_6 : 1;
383 unsigned visited : 1;
384 /* APPLE LOCAL "unavailable" attribute (Radar 2809697) --ilr */
385 unsigned unavailable_flag : 1;
388 /* The following table lists the uses of each of the above flags and
389 for which types of nodes they are defined. Note that expressions
395 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
396 ..._TYPE, IDENTIFIER_NODE.
397 In a STMT_EXPR, it means we want the result of the enclosed
399 CALL_EXPR_TAILCALL in CALL_EXPR
400 CASE_LOW_SEEN in CASE_LABEL_EXPR
405 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
408 TREE_CONSTANT_OVERFLOW in
409 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
410 TREE_SYMBOL_REFERENCED in
413 TARGET_EXPR, WITH_CLEANUP_EXPR
416 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
417 TYPE_REF_CAN_ALIAS_ALL in
418 POINTER_TYPE, REFERENCE_TYPE
419 CASE_HIGH_SEEN in CASE_LABEL_EXPR
424 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
426 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
429 TYPE_CACHED_VALUES_P in
431 SAVE_EXPR_RESOLVED_P in
433 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
434 OMP_CLAUSE_LASTPRIVATE
435 OMP_CLAUSE_PRIVATE_DEBUG in
442 CALL_EXPR_RETURN_SLOT_OPT in
445 PARM_DECL, RESULT_DECL
450 OMP_PARALLEL_COMBINED in
473 TREE_THIS_VOLATILE in
491 TYPE_SIZES_GIMPLIFIED
500 BIT_FIELD_REF_UNSIGNED in
506 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
512 expressions, IDENTIFIER_NODE
517 CALL_EXPR, FUNCTION_DECL
523 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
530 IDENTIFIER_TRANSPARENT_ALIAS in
533 APPLE LOCAL begin "unavailable" attribute (Radar 2809697)
538 APPLE LOCAL end "unavailable" attribute (Radar 2809697)
542 Used in tree traversals to mark visited nodes.
552 ... any expr or decl node
555 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
556 enum tree_node_structure_enum {
557 #include "treestruct.def"
562 /* Define accessors for the fields that all tree nodes have
563 (though some fields are not used for all kinds of nodes). */
565 /* The tree-code says what kind of node it is.
566 Codes are defined in tree.def. */
567 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
568 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
570 /* When checking is enabled, errors will be generated if a tree node
571 is accessed incorrectly. The macros die with a fatal error. */
572 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
574 #define TREE_CHECK(T, CODE) __extension__ \
575 ({ const tree __t = (T); \
576 if (TREE_CODE (__t) != (CODE)) \
577 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
581 #define TREE_NOT_CHECK(T, CODE) __extension__ \
582 ({ const tree __t = (T); \
583 if (TREE_CODE (__t) == (CODE)) \
584 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
588 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
589 ({ const tree __t = (T); \
590 if (TREE_CODE (__t) != (CODE1) \
591 && TREE_CODE (__t) != (CODE2)) \
592 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
593 (CODE1), (CODE2), 0); \
596 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
597 ({ const tree __t = (T); \
598 if (TREE_CODE (__t) == (CODE1) \
599 || TREE_CODE (__t) == (CODE2)) \
600 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
601 (CODE1), (CODE2), 0); \
604 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
605 ({ const tree __t = (T); \
606 if (TREE_CODE (__t) != (CODE1) \
607 && TREE_CODE (__t) != (CODE2) \
608 && TREE_CODE (__t) != (CODE3)) \
609 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
610 (CODE1), (CODE2), (CODE3), 0); \
613 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
614 ({ const tree __t = (T); \
615 if (TREE_CODE (__t) == (CODE1) \
616 || TREE_CODE (__t) == (CODE2) \
617 || TREE_CODE (__t) == (CODE3)) \
618 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
619 (CODE1), (CODE2), (CODE3), 0); \
622 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
623 ({ const tree __t = (T); \
624 if (TREE_CODE (__t) != (CODE1) \
625 && TREE_CODE (__t) != (CODE2) \
626 && TREE_CODE (__t) != (CODE3) \
627 && TREE_CODE (__t) != (CODE4)) \
628 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
629 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
632 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
633 ({ const tree __t = (T); \
634 if (TREE_CODE (__t) == (CODE1) \
635 || TREE_CODE (__t) == (CODE2) \
636 || TREE_CODE (__t) == (CODE3) \
637 || TREE_CODE (__t) == (CODE4)) \
638 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
639 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
642 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
643 ({ const tree __t = (T); \
644 if (TREE_CODE (__t) != (CODE1) \
645 && TREE_CODE (__t) != (CODE2) \
646 && TREE_CODE (__t) != (CODE3) \
647 && TREE_CODE (__t) != (CODE4) \
648 && TREE_CODE (__t) != (CODE5)) \
649 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
650 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
653 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
654 ({ const tree __t = (T); \
655 if (TREE_CODE (__t) == (CODE1) \
656 || TREE_CODE (__t) == (CODE2) \
657 || TREE_CODE (__t) == (CODE3) \
658 || TREE_CODE (__t) == (CODE4) \
659 || TREE_CODE (__t) == (CODE5)) \
660 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
661 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
664 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
665 ({ const tree __t = (T); \
666 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
667 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
671 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
672 ({ const tree __t = (T); \
673 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
674 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
678 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
679 ({ const tree __t = (T); \
680 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
681 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
685 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
686 ({ const tree __t = (T); \
687 if (TREE_CODE (__t) != OMP_CLAUSE) \
688 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
690 if (__t->omp_clause.code != (CODE)) \
691 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
695 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
696 ({ const tree __t = (T); \
697 if (TREE_CODE (__t) != OMP_CLAUSE) \
698 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
700 if ((int) __t->omp_clause.code < (int) (CODE1) \
701 || (int) __t->omp_clause.code > (int) (CODE2)) \
702 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
703 __FUNCTION__, (CODE1), (CODE2)); \
706 /* These checks have to be special cased. */
707 #define EXPR_CHECK(T) __extension__ \
708 ({ const tree __t = (T); \
709 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
710 if (!IS_EXPR_CODE_CLASS (__c)) \
711 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
715 /* These checks have to be special cased. */
716 #define NON_TYPE_CHECK(T) __extension__ \
717 ({ const tree __t = (T); \
719 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
723 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
724 (*({const tree __t = (T); \
725 const int __i = (I); \
726 if (TREE_CODE (__t) != TREE_VEC) \
727 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
729 if (__i < 0 || __i >= __t->vec.length) \
730 tree_vec_elt_check_failed (__i, __t->vec.length, \
731 __FILE__, __LINE__, __FUNCTION__); \
732 &__t->vec.a[__i]; }))
734 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
735 (*({const tree __t = t; \
736 const int __i = (i); \
737 if (TREE_CODE (__t) != PHI_NODE) \
738 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
740 if (__i < 0 || __i >= __t->phi.capacity) \
741 phi_node_elt_check_failed (__i, __t->phi.num_args, \
742 __FILE__, __LINE__, __FUNCTION__); \
743 &__t->phi.a[__i]; }))
745 #define OMP_CLAUSE_ELT_CHECK(t, i) __extension__ \
746 (*({const tree __t = t; \
747 const int __i = (i); \
748 if (TREE_CODE (__t) != OMP_CLAUSE) \
749 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
751 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
752 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
754 &__t->omp_clause.ops[__i]; }))
756 /* Special checks for TREE_OPERANDs. */
757 #define TREE_OPERAND_CHECK(T, I) __extension__ \
758 (*({const tree __t = EXPR_CHECK (T); \
759 const int __i = (I); \
760 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
761 tree_operand_check_failed (__i, TREE_CODE (__t), \
762 __FILE__, __LINE__, __FUNCTION__); \
763 &__t->exp.operands[__i]; }))
765 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
766 (*({const tree __t = (T); \
767 const int __i = (I); \
768 if (TREE_CODE (__t) != CODE) \
769 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
770 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
771 tree_operand_check_failed (__i, (CODE), \
772 __FILE__, __LINE__, __FUNCTION__); \
773 &__t->exp.operands[__i]; }))
775 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
777 ({const tree __t = (T); \
778 const int __i = (I); \
779 if (TREE_CODE (__t) != (CODE)) \
780 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
781 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
782 tree_operand_check_failed (__i, (CODE), \
783 __FILE__, __LINE__, __FUNCTION__); \
784 &__t->exp.operands[__i]; }))
786 extern void tree_contains_struct_check_failed (const tree,
787 const enum tree_node_structure_enum,
788 const char *, int, const char *)
791 extern void tree_check_failed (const tree, const char *, int, const char *,
792 ...) ATTRIBUTE_NORETURN;
793 extern void tree_not_check_failed (const tree, const char *, int, const char *,
794 ...) ATTRIBUTE_NORETURN;
795 extern void tree_class_check_failed (const tree, const enum tree_code_class,
796 const char *, int, const char *)
798 extern void tree_range_check_failed (const tree, const char *, int,
799 const char *, enum tree_code,
801 extern void tree_not_class_check_failed (const tree,
802 const enum tree_code_class,
803 const char *, int, const char *)
805 extern void tree_vec_elt_check_failed (int, int, const char *,
808 extern void phi_node_elt_check_failed (int, int, const char *,
811 extern void tree_operand_check_failed (int, enum tree_code,
812 const char *, int, const char *)
814 extern void omp_clause_check_failed (const tree, const char *, int,
815 const char *, enum omp_clause_code)
817 extern void omp_clause_operand_check_failed (int, tree, const char *,
820 extern void omp_clause_range_check_failed (const tree, const char *, int,
821 const char *, enum omp_clause_code,
822 enum omp_clause_code)
825 #else /* not ENABLE_TREE_CHECKING, or not gcc */
827 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
828 #define TREE_CHECK(T, CODE) (T)
829 #define TREE_NOT_CHECK(T, CODE) (T)
830 #define TREE_CHECK2(T, CODE1, CODE2) (T)
831 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
832 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
833 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
834 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
835 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
836 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
837 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
838 #define TREE_CLASS_CHECK(T, CODE) (T)
839 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
840 #define EXPR_CHECK(T) (T)
841 #define NON_TYPE_CHECK(T) (T)
842 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
843 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
844 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
845 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
846 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
847 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
848 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
849 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
853 #define TREE_BLOCK(NODE) (EXPR_CHECK (NODE)->exp.block)
855 #include "tree-check.h"
857 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
858 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
859 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
860 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
861 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
862 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
863 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
864 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
865 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
866 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
867 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
869 #define RECORD_OR_UNION_CHECK(T) \
870 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
871 #define NOT_RECORD_OR_UNION_CHECK(T) \
872 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
874 #define NUMERICAL_TYPE_CHECK(T) \
875 TREE_CHECK4 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE)
877 /* In all nodes that are expressions, this is the data type of the expression.
878 In POINTER_TYPE nodes, this is the type that the pointer points to.
879 In ARRAY_TYPE nodes, this is the type of the elements.
880 In VECTOR_TYPE nodes, this is the type of the elements. */
881 #define TREE_TYPE(NODE) ((NODE)->common.type)
883 /* Here is how primitive or already-canonicalized types' hash codes
885 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
887 /* A simple hash function for an arbitrary tree node. This must not be
888 used in hash tables which are saved to a PCH. */
889 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
891 /* Nodes are chained together for many purposes.
892 Types are chained together to record them for being output to the debugger
893 (see the function `chain_type').
894 Decls in the same scope are chained together to record the contents
896 Statement nodes for successive statements used to be chained together.
897 Often lists of things are represented by TREE_LIST nodes that
898 are chained together. */
900 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
902 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
903 that don't change the machine mode. */
905 #define STRIP_NOPS(EXP) \
906 while ((TREE_CODE (EXP) == NOP_EXPR \
907 || TREE_CODE (EXP) == CONVERT_EXPR \
908 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
909 && TREE_OPERAND (EXP, 0) != error_mark_node \
910 && (TYPE_MODE (TREE_TYPE (EXP)) \
911 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
912 (EXP) = TREE_OPERAND (EXP, 0)
914 /* Like STRIP_NOPS, but don't let the signedness change either. */
916 #define STRIP_SIGN_NOPS(EXP) \
917 while ((TREE_CODE (EXP) == NOP_EXPR \
918 || TREE_CODE (EXP) == CONVERT_EXPR \
919 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
920 && TREE_OPERAND (EXP, 0) != error_mark_node \
921 && (TYPE_MODE (TREE_TYPE (EXP)) \
922 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
923 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
924 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
925 (EXP) = TREE_OPERAND (EXP, 0)
927 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
929 #define STRIP_TYPE_NOPS(EXP) \
930 while ((TREE_CODE (EXP) == NOP_EXPR \
931 || TREE_CODE (EXP) == CONVERT_EXPR \
932 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
933 && TREE_OPERAND (EXP, 0) != error_mark_node \
934 && (TREE_TYPE (EXP) \
935 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
936 (EXP) = TREE_OPERAND (EXP, 0)
938 /* Remove unnecessary type conversions according to
939 tree_ssa_useless_type_conversion. */
941 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
942 while (tree_ssa_useless_type_conversion (EXP)) \
943 EXP = TREE_OPERAND (EXP, 0)
945 /* Nonzero if TYPE represents an integral type. Note that we do not
946 include COMPLEX types here. Keep these checks in ascending code
949 #define INTEGRAL_TYPE_P(TYPE) \
950 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
951 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
952 || TREE_CODE (TYPE) == INTEGER_TYPE)
954 /* Nonzero if TYPE represents a scalar floating-point type. */
956 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
958 /* Nonzero if TYPE represents a complex floating-point type. */
960 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
961 (TREE_CODE (TYPE) == COMPLEX_TYPE \
962 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
964 /* Nonzero if TYPE represents a vector floating-point type. */
966 #define VECTOR_FLOAT_TYPE_P(TYPE) \
967 (TREE_CODE (TYPE) == VECTOR_TYPE \
968 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
970 /* Nonzero if TYPE represents a floating-point type, including complex
971 and vector floating-point types. The vector and complex check does
972 not use the previous two macros to enable early folding. */
974 #define FLOAT_TYPE_P(TYPE) \
975 (SCALAR_FLOAT_TYPE_P (TYPE) \
976 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
977 || TREE_CODE (TYPE) == VECTOR_TYPE) \
978 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
980 /* Nonzero if TYPE represents a decimal floating-point type. */
981 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
982 (SCALAR_FLOAT_TYPE_P (TYPE) \
983 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
985 /* Nonzero if TYPE represents an aggregate (multi-component) type.
986 Keep these checks in ascending code order. */
988 #define AGGREGATE_TYPE_P(TYPE) \
989 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
990 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
992 /* Nonzero if TYPE represents a pointer or reference type.
993 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
994 ascending code order. */
996 #define POINTER_TYPE_P(TYPE) \
997 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
999 /* Nonzero if this type is a complete type. */
1000 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1002 /* Nonzero if this type is the (possibly qualified) void type. */
1003 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1005 /* Nonzero if this type is complete or is cv void. */
1006 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1007 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1009 /* Nonzero if this type is complete or is an array with unspecified bound. */
1010 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1011 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1014 /* Define many boolean fields that all tree nodes have. */
1016 /* In VAR_DECL nodes, nonzero means address of this is needed.
1017 So it cannot be in a register.
1018 In a FUNCTION_DECL, nonzero means its address is needed.
1019 So it must be compiled even if it is an inline function.
1020 In a FIELD_DECL node, it means that the programmer is permitted to
1021 construct the address of this field. This is used for aliasing
1022 purposes: see record_component_aliases.
1023 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1024 In LABEL_DECL nodes, it means a goto for this label has been seen
1025 from a place outside all binding contours that restore stack levels.
1026 In ..._TYPE nodes, it means that objects of this type must
1027 be fully addressable. This means that pieces of this
1028 object cannot go into register parameters, for example.
1029 In IDENTIFIER_NODEs, this means that some extern decl for this name
1030 had its address taken. That matters for inline functions. */
1031 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
1033 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1034 exit of a function. Calls for which this is true are candidates for tail
1035 call optimizations. */
1036 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
1038 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1039 CASE_LOW operand has been processed. */
1040 #define CASE_LOW_SEEN(NODE) \
1041 (CASE_LABEL_EXPR_CHECK (NODE)->common.addressable_flag)
1043 /* In a VAR_DECL, nonzero means allocate static storage.
1044 In a FUNCTION_DECL, nonzero if function has been defined.
1045 In a CONSTRUCTOR, nonzero means allocate static storage.
1047 ??? This is also used in lots of other nodes in unclear ways which
1048 should be cleaned up some day. */
1049 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
1051 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
1052 should only be executed if an exception is thrown, not on normal exit
1054 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
1056 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1057 CASE_HIGH operand has been processed. */
1058 #define CASE_HIGH_SEEN(NODE) \
1059 (CASE_LABEL_EXPR_CHECK (NODE)->common.static_flag)
1061 /* In an expr node (usually a conversion) this means the node was made
1062 implicitly and should not lead to any sort of warning. In a decl node,
1063 warnings concerning the decl should be suppressed. This is used at
1064 least for used-before-set warnings, and it set after one warning is
1066 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
1068 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
1069 there was an overflow in folding. This is distinct from
1070 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
1071 occur in constant expressions. */
1072 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
1074 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1075 this string as an argument. */
1076 #define TREE_SYMBOL_REFERENCED(NODE) \
1077 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
1079 /* Nonzero in a pointer or reference type means the data pointed to
1080 by this type can alias anything. */
1081 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1082 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
1084 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1085 there was an overflow in folding, and no warning has been issued
1086 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
1087 but not vice versa. */
1089 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->common.public_flag)
1091 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1093 #define TREE_OVERFLOW_P(EXPR) \
1094 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1096 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1097 nonzero means name is to be accessible from outside this module.
1098 In an IDENTIFIER_NODE, nonzero means an external declaration
1099 accessible from outside this module was previously seen
1100 for this name in an inner scope. */
1101 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
1103 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1104 of cached values, or is something else. */
1105 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->common.public_flag)
1107 /* In a SAVE_EXPR, indicates that the original expression has already
1108 been substituted with a VAR_DECL that contains the value. */
1109 #define SAVE_EXPR_RESOLVED_P(NODE) \
1110 (TREE_CHECK (NODE, SAVE_EXPR)->common.public_flag)
1112 /* In any expression, decl, or constant, nonzero means it has side effects or
1113 reevaluation of the whole expression could produce a different value.
1114 This is set if any subexpression is a function call, a side effect or a
1115 reference to a volatile variable. In a ..._DECL, this is set only if the
1116 declaration said `volatile'. This will never be set for a constant. */
1117 #define TREE_SIDE_EFFECTS(NODE) \
1118 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
1120 /* In a LABEL_DECL, nonzero means this label had its address taken
1121 and therefore can never be deleted and is a jump target for
1123 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
1125 /* Nonzero means this expression is volatile in the C sense:
1126 its address should be of type `volatile WHATEVER *'.
1127 In other words, the declared item is volatile qualified.
1128 This is used in _DECL nodes and _REF nodes.
1129 On a FUNCTION_DECL node, this means the function does not
1130 return normally. This is the same effect as setting
1131 the attribute noreturn on the function in C.
1133 In a ..._TYPE node, means this type is volatile-qualified.
1134 But use TYPE_VOLATILE instead of this macro when the node is a type,
1135 because eventually we may make that a different bit.
1137 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1138 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
1140 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1141 accessing the memory pointed to won't generate a trap. However,
1142 this only applies to an object when used appropriately: it doesn't
1143 mean that writing a READONLY mem won't trap. Similarly for
1144 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1146 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1147 (or slice of the array) always belongs to the range of the array.
1148 I.e. that the access will not trap, provided that the access to
1149 the base to the array will not trap. */
1150 #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag)
1152 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1153 nonzero means it may not be the lhs of an assignment. */
1154 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
1156 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1157 #define TREE_READONLY_DECL_P(NODE)\
1158 (DECL_P (NODE) && TREE_READONLY (NODE))
1160 /* Value of expression is constant. Always on in all ..._CST nodes. May
1161 also appear in an expression or decl where the value is constant. */
1162 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
1164 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1165 #define TYPE_SIZES_GIMPLIFIED(NODE) (TYPE_CHECK (NODE)->common.constant_flag)
1167 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1168 #define DECL_UNSIGNED(NODE) (DECL_COMMON_CHECK (NODE)->common.unsigned_flag)
1170 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1171 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1172 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
1174 /* In integral and pointer types, means an unsigned type. */
1175 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
1177 /* Nonzero in a VAR_DECL means assembler code has been written.
1178 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1179 This is interesting in an inline function, since it might not need
1180 to be compiled separately.
1181 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1182 if the sdb debugging info for the type has been written.
1183 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1184 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1186 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
1188 /* Nonzero in a _DECL if the name is used in its scope.
1189 Nonzero in an expr node means inhibit warning if value is unused.
1190 In IDENTIFIER_NODEs, this means that some extern decl for this name
1192 In a BLOCK, this means that the block contains variables that are used. */
1193 #define TREE_USED(NODE) ((NODE)->common.used_flag)
1195 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1196 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1197 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
1199 /* In a CALL_EXPR, means that it's safe to use the target of the call
1200 expansion as the return slot for a call that returns in memory. */
1201 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->common.private_flag)
1203 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1204 reference (and the TREE_TYPE is a pointer to the true type). */
1205 #define DECL_BY_REFERENCE(NODE) (DECL_COMMON_CHECK (NODE)->common.private_flag)
1207 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1208 thunked-to function. */
1209 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->common.protected_flag)
1211 /* In a type, nonzero means that all objects of the type are guaranteed by the
1212 language or front-end to be properly aligned, so we can indicate that a MEM
1213 of this type is aligned at least to the alignment of the type, even if it
1214 doesn't appear that it is. We see this, for example, in object-oriented
1215 languages where a tag field may show this is an object of a more-aligned
1216 variant of the more generic type.
1218 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1220 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
1222 /* Used in classes in C++. */
1223 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
1224 /* Used in classes in C++.
1225 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1226 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
1228 /* Nonzero in a _DECL if the use of the name is defined as a
1229 deprecated feature by __attribute__((deprecated)). */
1230 #define TREE_DEPRECATED(NODE) \
1231 ((NODE)->common.deprecated_flag)
1233 /* APPLE LOCAL begin "unavailable" attribute (Radar 2809697) */
1234 /* Nonzero in a IDENTIFIER_NODE if the use of the name is defined as a
1235 unavailable feature by __attribute__((unavailable)). */
1236 #define TREE_UNAVAILABLE(NODE) ((NODE)->common.unavailable_flag)
1237 /* APPLE LOCAL end "unavailable" attribute (Radar 2809697) */
1239 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1240 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1241 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1242 (IDENTIFIER_NODE_CHECK (NODE)->common.deprecated_flag)
1244 /* Value of expression is function invariant. A strict subset of
1245 TREE_CONSTANT, such an expression is constant over any one function
1246 invocation, though not across different invocations. May appear in
1247 any expression node. */
1248 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
1250 /* These flags are available for each language front end to use internally. */
1251 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
1252 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
1253 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
1254 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
1255 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
1256 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
1257 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
1259 /* Define additional fields and accessors for nodes representing constants. */
1261 /* In an INTEGER_CST node. These two together make a 2-word integer.
1262 If the data type is signed, the value is sign-extended to 2 words
1263 even though not all of them may really be in use.
1264 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1265 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1266 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1267 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1269 #define INT_CST_LT(A, B) \
1270 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1271 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1272 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1274 #define INT_CST_LT_UNSIGNED(A, B) \
1275 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1276 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1277 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1278 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1279 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1281 struct tree_int_cst GTY(())
1283 struct tree_common common;
1287 /* In a REAL_CST node. struct real_value is an opaque entity, with
1288 manipulators defined in real.h. We don't want tree.h depending on
1289 real.h and transitively on tm.h. */
1292 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1293 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1295 struct tree_real_cst GTY(())
1297 struct tree_common common;
1298 struct real_value * real_cst_ptr;
1301 /* In a STRING_CST */
1302 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1303 #define TREE_STRING_POINTER(NODE) \
1304 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1306 struct tree_string GTY(())
1308 struct tree_common common;
1313 /* In a COMPLEX_CST node. */
1314 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1315 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1317 struct tree_complex GTY(())
1319 struct tree_common common;
1324 /* In a VECTOR_CST node. */
1325 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1327 struct tree_vector GTY(())
1329 struct tree_common common;
1335 /* Define fields and accessors for some special-purpose tree nodes. */
1337 #define IDENTIFIER_LENGTH(NODE) \
1338 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1339 #define IDENTIFIER_POINTER(NODE) \
1340 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1341 #define IDENTIFIER_HASH_VALUE(NODE) \
1342 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1344 /* Translate a hash table identifier pointer to a tree_identifier
1345 pointer, and vice versa. */
1347 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1348 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1349 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1351 struct tree_identifier GTY(())
1353 struct tree_common common;
1354 struct ht_identifier id;
1357 /* In a TREE_LIST node. */
1358 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1359 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1361 struct tree_list GTY(())
1363 struct tree_common common;
1368 /* In a TREE_VEC node. */
1369 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1370 #define TREE_VEC_END(NODE) \
1371 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1373 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1375 struct tree_vec GTY(())
1377 struct tree_common common;
1379 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1382 /* In a CONSTRUCTOR node. */
1383 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1385 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1386 value of each element (stored within VAL). IX must be a scratch variable
1387 of unsigned integer type. */
1388 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1389 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1391 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1395 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1396 the value of each element (stored within VAL) and its index (stored
1397 within INDEX). IX must be a scratch variable of unsigned integer type. */
1398 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1399 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1401 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1402 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1406 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1407 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1409 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1410 _ce___->index = INDEX; \
1411 _ce___->value = VALUE; \
1414 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1415 element. INDEX can optionally design the position of VALUE: in arrays,
1416 it is the index where VALUE has to be placed; in structures, it is the
1417 FIELD_DECL of the member. */
1418 typedef struct constructor_elt_d GTY(())
1424 DEF_VEC_O(constructor_elt);
1425 DEF_VEC_ALLOC_O(constructor_elt,gc);
1427 struct tree_constructor GTY(())
1429 struct tree_common common;
1430 VEC(constructor_elt,gc) *elts;
1433 /* Define fields and accessors for some nodes that represent expressions. */
1435 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1436 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1437 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1438 && integer_zerop (TREE_OPERAND (NODE, 0)))
1440 /* In ordinary expression nodes. */
1441 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1442 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1444 /* In a LOOP_EXPR node. */
1445 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1447 #ifdef USE_MAPPED_LOCATION
1448 /* The source location of this expression. Non-tree_exp nodes such as
1449 decls and constants can be shared among multiple locations, so
1451 #define EXPR_LOCATION(NODE) \
1452 (EXPR_P (NODE) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1453 #define SET_EXPR_LOCATION(NODE, FROM) \
1454 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1455 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1456 /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */
1457 #define EXPR_LOCUS(NODE) \
1458 (EXPR_P (NODE) ? &(NODE)->exp.locus : (location_t *)NULL)
1459 #define SET_EXPR_LOCUS(NODE, FROM) \
1460 do { source_location *loc_tmp = FROM; \
1461 EXPR_CHECK (NODE)->exp.locus \
1462 = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0)
1463 #define EXPR_FILENAME(NODE) \
1464 LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus)
1465 #define EXPR_LINENO(NODE) \
1466 LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1468 /* The source location of this expression. Non-tree_exp nodes such as
1469 decls and constants can be shared among multiple locations, so
1471 #define EXPR_LOCUS(NODE) \
1472 (EXPR_P (NODE) ? (NODE)->exp.locus : (location_t *)NULL)
1473 #define SET_EXPR_LOCUS(NODE, FROM) \
1474 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1475 #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM)
1476 #define EXPR_FILENAME(NODE) \
1477 (EXPR_CHECK (NODE)->exp.locus->file)
1478 #define EXPR_LINENO(NODE) \
1479 (EXPR_CHECK (NODE)->exp.locus->line)
1480 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1481 #define EXPR_LOCATION(NODE) \
1482 (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION)
1485 /* In a TARGET_EXPR node. */
1486 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1487 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1488 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1490 /* DECL_EXPR accessor. This gives access to the DECL associated with
1491 the given declaration statement. */
1492 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1494 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1496 /* SWITCH_EXPR accessors. These give access to the condition, body and
1497 original condition type (before any compiler conversions)
1498 of the switch statement, respectively. */
1499 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1500 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1501 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1503 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1504 of a case label, respectively. */
1505 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1506 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1507 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1509 /* The operands of a TARGET_MEM_REF. */
1510 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1511 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1512 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1513 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1514 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1515 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1516 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1518 /* The operands of a BIND_EXPR. */
1519 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1520 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1521 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1523 /* GOTO_EXPR accessor. This gives access to the label associated with
1524 a goto statement. */
1525 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1527 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1528 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1529 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1531 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1532 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1533 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1534 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1535 /* Nonzero if we want to create an ASM_INPUT instead of an
1536 ASM_OPERAND with no operands. */
1537 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1538 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1540 /* COND_EXPR accessors. */
1541 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1542 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1543 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1545 /* LABEL_EXPR accessor. This gives access to the label associated with
1546 the given label expression. */
1547 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1549 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1550 accessors for SSA operands. */
1552 /* CATCH_EXPR accessors. */
1553 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1554 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1556 /* EH_FILTER_EXPR accessors. */
1557 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1558 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1559 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1561 /* OBJ_TYPE_REF accessors. */
1562 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1563 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1564 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1566 /* ASSERT_EXPR accessors. */
1567 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1568 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1570 /* OpenMP directive and clause accessors. */
1572 #define OMP_BODY(NODE) \
1573 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1574 #define OMP_CLAUSES(NODE) \
1575 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1577 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1578 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1579 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1580 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1582 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1583 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1584 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1585 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1586 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1587 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1589 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1590 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1592 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1594 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1595 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1597 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1599 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1601 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1602 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1604 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1605 #define OMP_CLAUSE_DECL(NODE) \
1606 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1607 OMP_CLAUSE_PRIVATE, \
1608 OMP_CLAUSE_COPYPRIVATE), 0)
1610 /* True on an OMP_SECTION statement that was the last lexical member.
1611 This status is meaningful in the implementation of lastprivate. */
1612 #define OMP_SECTION_LAST(NODE) \
1613 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1615 /* True on an OMP_RETURN statement if the return does not require a
1616 thread synchronization via some sort of barrier. The exact barrier
1617 that would otherwise be emitted is dependent on the OMP statement
1618 with which this return is associated. */
1619 #define OMP_RETURN_NOWAIT(NODE) \
1620 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1622 /* True on an OMP_PARALLEL statement if it represents an explicit
1623 combined parallel work-sharing constructs. */
1624 #define OMP_PARALLEL_COMBINED(NODE) \
1625 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1627 /* True on a PRIVATE clause if its decl is kept around for debugging
1628 information only and its DECL_VALUE_EXPR is supposed to point
1629 to what it has been remapped to. */
1630 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1631 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1633 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1634 decl is present in the chain. */
1635 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1636 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1638 #define OMP_CLAUSE_IF_EXPR(NODE) \
1639 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1640 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1641 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1642 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1643 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1645 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1646 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1647 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1648 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1649 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1650 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1651 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1652 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1654 enum omp_clause_schedule_kind
1656 OMP_CLAUSE_SCHEDULE_STATIC,
1657 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1658 OMP_CLAUSE_SCHEDULE_GUIDED,
1659 OMP_CLAUSE_SCHEDULE_RUNTIME
1662 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1663 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1665 enum omp_clause_default_kind
1667 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1668 OMP_CLAUSE_DEFAULT_SHARED,
1669 OMP_CLAUSE_DEFAULT_NONE,
1670 OMP_CLAUSE_DEFAULT_PRIVATE
1673 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1674 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1676 struct tree_exp GTY(())
1678 struct tree_common common;
1682 tree GTY ((special ("tree_exp"),
1683 desc ("TREE_CODE ((tree) &%0)")))
1687 /* SSA_NAME accessors. */
1689 /* Returns the variable being referenced. Once released, this is the
1690 only field that can be relied upon. */
1691 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1693 /* Returns the statement which defines this reference. Note that
1694 we use the same field when chaining SSA_NAME nodes together on
1695 the SSA_NAME freelist. */
1696 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1698 /* Returns the SSA version number of this SSA name. Note that in
1699 tree SSA, version numbers are not per variable and may be recycled. */
1700 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1702 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1703 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1705 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1706 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1708 /* Nonzero if this SSA_NAME expression is currently on the free list of
1709 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1710 has no meaning for an SSA_NAME. */
1711 #define SSA_NAME_IN_FREE_LIST(NODE) \
1712 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1714 /* Attributes for SSA_NAMEs for pointer-type variables. */
1715 #define SSA_NAME_PTR_INFO(N) \
1716 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1718 /* Get the value of this SSA_NAME, if available. */
1719 #define SSA_NAME_VALUE(N) \
1720 SSA_NAME_CHECK (N)->ssa_name.value_handle
1722 #ifndef _TREE_FLOW_H
1723 struct ptr_info_def;
1728 /* Immediate use linking structure. This structure is used for maintaining
1729 a doubly linked list of uses of an SSA_NAME. */
1730 typedef struct ssa_use_operand_d GTY(())
1732 struct ssa_use_operand_d* GTY((skip(""))) prev;
1733 struct ssa_use_operand_d* GTY((skip(""))) next;
1734 tree GTY((skip(""))) stmt;
1735 tree *GTY((skip(""))) use;
1736 } ssa_use_operand_t;
1738 /* Return the immediate_use information for an SSA_NAME. */
1739 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1741 struct tree_ssa_name GTY(())
1743 struct tree_common common;
1745 /* _DECL wrapped by this SSA name. */
1748 /* SSA version number. */
1749 unsigned int version;
1751 /* Pointer attributes used for alias analysis. */
1752 struct ptr_info_def *ptr_info;
1754 /* Value for SSA name used by various passes.
1756 Right now only invariants are allowed to persist beyond a pass in
1757 this field; in the future we will allow VALUE_HANDLEs to persist
1761 /* Immediate uses list for this SSA_NAME. */
1762 struct ssa_use_operand_d imm_uses;
1765 /* In a PHI_NODE node. */
1767 /* These 2 macros should be considered off limits for use by developers. If
1768 you wish to access the use or def fields of a PHI_NODE in the SSA
1769 optimizers, use the accessor macros found in tree-ssa-operands.h.
1770 These two macros are to be used only by those accessor macros, and other
1771 select places where we *absolutely* must take the address of the tree. */
1773 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1774 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1776 /* PHI_NODEs for each basic block are chained together in a single linked
1777 list. The head of the list is linked from the block annotation, and
1778 the link to the next PHI is in PHI_CHAIN. */
1779 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1781 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1782 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1783 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1784 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1785 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1786 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1788 struct phi_arg_d GTY(())
1790 /* imm_use MUST be the first element in struct because we do some
1791 pointer arithmetic with it. See phi_arg_index_from_use. */
1792 struct ssa_use_operand_d imm_use;
1796 struct tree_phi_node GTY(())
1798 struct tree_common common;
1803 /* Basic block to that the phi node belongs. */
1804 struct basic_block_def *bb;
1806 /* Arguments of the PHI node. These are maintained in the same
1807 order as predecessor edge vector BB->PREDS. */
1808 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1811 #define OMP_CLAUSE_CODE(NODE) \
1812 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1814 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1815 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1817 #define OMP_CLAUSE_CODE(NODE) \
1818 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1820 #define OMP_CLAUSE_OPERAND(NODE, I) \
1821 OMP_CLAUSE_ELT_CHECK (NODE, I)
1823 struct tree_omp_clause GTY(())
1825 struct tree_common common;
1826 enum omp_clause_code code;
1827 union omp_clause_subcode {
1828 enum omp_clause_default_kind default_kind;
1829 enum omp_clause_schedule_kind schedule_kind;
1830 enum tree_code reduction_code;
1831 } GTY ((skip)) subcode;
1832 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1836 struct varray_head_tag;
1838 /* In a BLOCK node. */
1839 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1840 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1841 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1842 /* Note: when changing this, make sure to find the places
1843 that use chainon or nreverse. */
1844 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1845 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1846 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1848 /* Nonzero means that this block is prepared to handle exceptions
1849 listed in the BLOCK_VARS slot. */
1850 #define BLOCK_HANDLER_BLOCK(NODE) \
1851 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1853 /* An index number for this block. These values are not guaranteed to
1854 be unique across functions -- whether or not they are depends on
1855 the debugging output format in use. */
1856 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1858 /* If block reordering splits a lexical block into discontiguous
1859 address ranges, we'll make a copy of the original block.
1861 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1862 In that case, we have one source block that has been replicated
1863 (through inlining or unrolling) into many logical blocks, and that
1864 these logical blocks have different physical variables in them.
1866 In this case, we have one logical block split into several
1867 non-contiguous address ranges. Most debug formats can't actually
1868 represent this idea directly, so we fake it by creating multiple
1869 logical blocks with the same variables in them. However, for those
1870 that do support non-contiguous regions, these allow the original
1871 logical block to be reconstructed, along with the set of address
1874 One of the logical block fragments is arbitrarily chosen to be
1875 the ORIGIN. The other fragments will point to the origin via
1876 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1877 be null. The list of fragments will be chained through
1878 BLOCK_FRAGMENT_CHAIN from the origin. */
1880 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1881 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1883 /* For an inlined function, this gives the location where it was called
1884 from. This is only set in the top level block, which corresponds to the
1885 inlined function scope. This is used in the debug output routines. */
1887 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1889 struct tree_block GTY(())
1891 struct tree_common common;
1893 unsigned handler_block_flag : 1;
1894 unsigned abstract_flag : 1;
1895 unsigned block_num : 30;
1900 tree abstract_origin;
1901 tree fragment_origin;
1902 tree fragment_chain;
1906 /* Define fields and accessors for nodes representing data types. */
1908 /* See tree.def for documentation of the use of these fields.
1909 Look at the documentation of the various ..._TYPE tree codes.
1911 Note that the type.values, type.minval, and type.maxval fields are
1912 overloaded and used for different macros in different kinds of types.
1913 Each macro must check to ensure the tree node is of the proper kind of
1914 type. Note also that some of the front-ends also overload these fields,
1915 so they must be checked as well. */
1917 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1918 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1919 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1920 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1921 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1922 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
1923 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
1924 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
1925 #define TYPE_ORIG_SIZE_TYPE(NODE) \
1926 (INTEGER_TYPE_CHECK (NODE)->type.values \
1927 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
1928 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
1929 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
1930 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1931 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1932 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1933 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1934 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1935 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1936 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1937 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1938 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1939 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1940 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1941 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1942 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1943 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1944 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1945 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1946 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1947 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1949 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1950 in the debugging output. We use this to describe a vector as a
1951 structure containing an array. */
1952 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1954 /* For record and union types, information about this type, as a base type
1956 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1958 /* For non record and union types, used in a language-dependent way. */
1959 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1961 /* The (language-specific) typed-based alias set for this type.
1962 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1963 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1964 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1965 type can alias objects of any type. */
1966 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1968 /* Nonzero iff the typed-based alias set for this type has been
1970 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1972 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1974 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1976 /* The alignment necessary for objects of this type.
1977 The value is an int, measured in bits. */
1978 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1980 /* 1 if the alignment for this type was requested by "aligned" attribute,
1981 0 if it is the default for this type. */
1982 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1984 /* The alignment for NODE, in bytes. */
1985 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1987 /* If your language allows you to declare types, and you want debug info
1988 for them, then you need to generate corresponding TYPE_DECL nodes.
1989 These "stub" TYPE_DECL nodes have no name, and simply point at the
1990 type node. You then set the TYPE_STUB_DECL field of the type node
1991 to point back at the TYPE_DECL node. This allows the debug routines
1992 to know that the two nodes represent the same type, so that we only
1993 get one debug info record for them. */
1994 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1996 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1997 has BLKmode only because it lacks the alignment requirement for
1999 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2001 /* In an INTEGER_TYPE, it means the type represents a size. We use
2002 this both for validity checking and to permit optimizations that
2003 are unsafe for other types. Note that the C `size_t' type should
2004 *not* have this flag set. The `size_t' type is simply a typedef
2005 for an ordinary integer type that happens to be the type of an
2006 expression returned by `sizeof'; `size_t' has no special
2007 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2008 always actual sizes. */
2009 #define TYPE_IS_SIZETYPE(NODE) \
2010 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2012 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
2013 pointer depressed. */
2014 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
2015 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2017 /* Nonzero in a type considered volatile as a whole. */
2018 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
2020 /* Means this type is const-qualified. */
2021 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
2023 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2025 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2027 /* There is a TYPE_QUAL value for each type qualifier. They can be
2028 combined by bitwise-or to form the complete set of qualifiers for a
2031 #define TYPE_UNQUALIFIED 0x0
2032 #define TYPE_QUAL_CONST 0x1
2033 #define TYPE_QUAL_VOLATILE 0x2
2034 #define TYPE_QUAL_RESTRICT 0x4
2036 /* The set of type qualifiers for this type. */
2037 #define TYPE_QUALS(NODE) \
2038 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2039 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2040 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2042 /* These flags are available for each language front end to use internally. */
2043 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2044 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2045 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2046 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2047 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2048 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2049 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2051 /* Used to keep track of visited nodes in tree traversals. This is set to
2052 0 by copy_node and make_node. */
2053 #define TREE_VISITED(NODE) ((NODE)->common.visited)
2055 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2056 that distinguish string from array of char).
2057 If set in a INTEGER_TYPE, indicates a character type. */
2058 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2060 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2061 object of the given ARRAY_TYPE. This allows temporaries to be
2063 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2064 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2066 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2067 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2068 (((unsigned HOST_WIDE_INT) 1) \
2069 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2071 /* Set precision to n when we have 2^n sub-parts of the vector. */
2072 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2073 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2075 /* Indicates that objects of this type must be initialized by calling a
2076 function when they are created. */
2077 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2078 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2080 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2081 the same way that the first union alternative would be passed. */
2082 #define TYPE_TRANSPARENT_UNION(NODE) \
2083 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2085 /* For an ARRAY_TYPE, indicates that it is not permitted to
2086 take the address of a component of the type. */
2087 #define TYPE_NONALIASED_COMPONENT(NODE) \
2088 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2090 /* Indicated that objects of this type should be laid out in as
2091 compact a way as possible. */
2092 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2094 /* Used by type_contains_placeholder_p to avoid recomputation.
2095 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2096 this field directly. */
2097 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2098 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2102 struct tree_type GTY(())
2104 struct tree_common common;
2111 unsigned int precision : 9;
2112 ENUM_BITFIELD(machine_mode) mode : 7;
2114 unsigned string_flag : 1;
2115 unsigned no_force_blk_flag : 1;
2116 unsigned needs_constructing_flag : 1;
2117 unsigned transparent_union_flag : 1;
2118 unsigned packed_flag : 1;
2119 unsigned restrict_flag : 1;
2120 unsigned contains_placeholder_bits : 2;
2122 unsigned lang_flag_0 : 1;
2123 unsigned lang_flag_1 : 1;
2124 unsigned lang_flag_2 : 1;
2125 unsigned lang_flag_3 : 1;
2126 unsigned lang_flag_4 : 1;
2127 unsigned lang_flag_5 : 1;
2128 unsigned lang_flag_6 : 1;
2129 unsigned user_align : 1;
2134 union tree_type_symtab {
2135 int GTY ((tag ("0"))) address;
2136 char * GTY ((tag ("1"))) pointer;
2137 struct die_struct * GTY ((tag ("2"))) die;
2138 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2139 descbits ("2"))) symtab;
2147 HOST_WIDE_INT alias_set;
2148 /* Points to a structure whose details depend on the language in use. */
2149 struct lang_type *lang_specific;
2152 /* Define accessor macros for information about type inheritance
2155 A "basetype" means a particular usage of a data type for inheritance
2156 in another type. Each such basetype usage has its own "binfo"
2157 object to describe it. The binfo object is a TREE_VEC node.
2159 Inheritance is represented by the binfo nodes allocated for a
2160 given type. For example, given types C and D, such that D is
2161 inherited by C, 3 binfo nodes will be allocated: one for describing
2162 the binfo properties of C, similarly one for D, and one for
2163 describing the binfo properties of D as a base type for C.
2164 Thus, given a pointer to class C, one can get a pointer to the binfo
2165 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2167 /* BINFO specific flags. */
2169 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2170 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag)
2172 /* Flags for language dependent use. */
2173 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2174 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2175 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2176 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2177 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2178 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2179 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2181 /* The actual data type node being inherited in this basetype. */
2182 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2184 /* The offset where this basetype appears in its containing type.
2185 BINFO_OFFSET slot holds the offset (in bytes)
2186 from the base of the complete object to the base of the part of the
2187 object that is allocated on behalf of this `type'.
2188 This is always 0 except when there is multiple inheritance. */
2190 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2191 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2193 /* The virtual function table belonging to this basetype. Virtual
2194 function tables provide a mechanism for run-time method dispatching.
2195 The entries of a virtual function table are language-dependent. */
2197 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2199 /* The virtual functions in the virtual function table. This is
2200 a TREE_LIST that is used as an initial approximation for building
2201 a virtual function table for this basetype. */
2202 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2204 /* A vector of binfos for the direct basetypes inherited by this
2207 If this basetype describes type D as inherited in C, and if the
2208 basetypes of D are E and F, then this vector contains binfos for
2209 inheritance of E and F by C. */
2210 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2212 /* The number of basetypes for NODE. */
2213 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2215 /* Accessor macro to get to the Nth base binfo of this binfo. */
2216 #define BINFO_BASE_BINFO(NODE,N) \
2217 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2218 #define BINFO_BASE_ITERATE(NODE,N,B) \
2219 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2220 #define BINFO_BASE_APPEND(NODE,T) \
2221 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2223 /* For a BINFO record describing a virtual base class, i.e., one where
2224 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2225 base. The actual contents are language-dependent. In the C++
2226 front-end this field is an INTEGER_CST giving an offset into the
2227 vtable where the offset to the virtual base can be found. */
2228 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2230 /* Indicates the accesses this binfo has to its bases. The values are
2231 access_public_node, access_protected_node or access_private_node.
2232 If this array is not present, public access is implied. */
2233 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2235 #define BINFO_BASE_ACCESS(NODE,N) \
2236 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2237 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2238 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2240 /* The index in the VTT where this subobject's sub-VTT can be found.
2241 NULL_TREE if there is no sub-VTT. */
2242 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2244 /* The index in the VTT where the vptr for this subobject can be
2245 found. NULL_TREE if there is no secondary vptr in the VTT. */
2246 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2248 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2249 inheriting this base for non-virtual bases. For virtual bases it
2250 points either to the binfo for which this is a primary binfo, or to
2251 the binfo of the most derived type. */
2252 #define BINFO_INHERITANCE_CHAIN(NODE) \
2253 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2255 struct tree_binfo GTY (())
2257 struct tree_common common;
2263 VEC(tree,gc) *base_accesses;
2269 VEC(tree,none) base_binfos;
2273 /* Define fields and accessors for nodes representing declared names. */
2275 /* Nonzero if DECL represents a variable for the SSA passes. */
2276 #define SSA_VAR_P(DECL) \
2277 (TREE_CODE (DECL) == VAR_DECL \
2278 || TREE_CODE (DECL) == PARM_DECL \
2279 || TREE_CODE (DECL) == RESULT_DECL \
2281 || (TREE_CODE (DECL) == SSA_NAME \
2282 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2283 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2284 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2285 || MTAG_P (SSA_NAME_VAR (DECL)))))
2290 /* Enumerate visibility settings. */
2291 #ifndef SYMBOL_VISIBILITY_DEFINED
2292 #define SYMBOL_VISIBILITY_DEFINED
2293 enum symbol_visibility
2296 VISIBILITY_PROTECTED,
2305 /* This is the name of the object as written by the user.
2306 It is an IDENTIFIER_NODE. */
2307 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2309 /* Every ..._DECL node gets a unique number. */
2310 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2312 /* These two fields describe where in the source code the declaration
2313 was. If the declaration appears in several places (as for a C
2314 function that is declared first and then defined later), this
2315 information should refer to the definition. */
2316 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2317 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2318 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2319 #ifdef USE_MAPPED_LOCATION
2320 #define DECL_IS_BUILTIN(DECL) \
2321 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2323 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2326 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2327 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2328 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2329 points to either the FUNCTION_DECL for the containing function,
2330 the RECORD_TYPE or UNION_TYPE for the containing type, or
2331 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2333 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2334 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2335 struct tree_decl_minimal GTY(())
2337 struct tree_common common;
2344 /* When computing aliasing information, we represent the memory pointed-to
2345 by pointers with artificial variables called "memory tags" (MT). There
2346 are two kinds of tags, namely symbol and name:
2348 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2349 represent all the pointed-to locations and variables pointed-to by
2350 the same pointer symbol. Usually, this set is computed using
2351 type-based analysis (i.e., alias set classes), but this may not
2354 Name tags (NMT) are used in flow-sensitive points-to alias
2355 analysis, they represent the variables and memory locations
2356 pointed-to by a specific SSA_NAME pointer.
2358 In general, given a pointer P with a symbol tag SMT, the alias set
2359 of SMT should be the union of all the alias sets of the NMTs of
2360 every SSA_NAME for P. */
2361 struct tree_memory_tag GTY(())
2363 struct tree_decl_minimal common;
2364 unsigned int is_global:1;
2365 unsigned int is_used_alone:1;
2366 unsigned int old_used_alone:1;
2369 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2371 /* This flag is true if a SMT is used as the V_MAY_DEF or VUSE operand
2372 directly, because the access had all of the SMT's aliases pruned
2374 #define SMT_USED_ALONE(NODE) (SYMBOL_MEMORY_TAG_CHECK (NODE)->mtag.is_used_alone)
2376 /* This flag is used to temporarily store the old value of the used alone
2377 flag when updating so we know whether to mark the symbol for
2379 #define SMT_OLD_USED_ALONE(NODE) (SYMBOL_MEMORY_TAG_CHECK (NODE)->mtag.old_used_alone)
2381 struct tree_struct_field_tag GTY(())
2383 struct tree_memory_tag common;
2385 /* Parent variable. */
2388 /* Offset inside structure. */
2389 unsigned HOST_WIDE_INT offset;
2391 /* Size of the field. */
2392 unsigned HOST_WIDE_INT size;
2395 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2396 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2397 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2399 /* For any sort of a ..._DECL node, this points to the original (abstract)
2400 decl node which this decl is an instance of, or else it is NULL indicating
2401 that this decl is not an instance of some other decl. For example,
2402 in a nested declaration of an inline function, this points back to the
2404 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2406 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2407 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2408 #define DECL_ORIGIN(NODE) \
2409 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2411 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2412 inline instance of some original (abstract) decl from an inline function;
2413 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2414 nodes can also have their abstract origin set to themselves. */
2415 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2416 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2418 /* In a DECL this is the field where attributes are stored. */
2419 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2421 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2422 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2423 For a VAR_DECL, holds the initial value.
2424 For a PARM_DECL, not used--default
2425 values for parameters are encoded in the type of the function,
2426 not in the PARM_DECL slot.
2427 For a FIELD_DECL, this is used for enumeration values and the C
2428 frontend uses it for temporarily storing bitwidth of bitfields.
2430 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2431 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2433 /* Holds the size of the datum, in bits, as a tree expression.
2434 Need not be constant. */
2435 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2436 /* Likewise for the size in bytes. */
2437 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2438 /* Holds the alignment required for the datum, in bits. */
2439 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2440 /* The alignment of NODE, in bytes. */
2441 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2442 /* Set if the alignment of this DECL has been set by the user, for
2443 example with an 'aligned' attribute. */
2444 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2445 /* Holds the machine mode corresponding to the declaration of a variable or
2446 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2448 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2450 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2451 operation it is. Note, however, that this field is overloaded, with
2452 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2453 checked before any access to the former. */
2454 #define DECL_FUNCTION_CODE(NODE) \
2455 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2456 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2457 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2459 /* Nonzero for a given ..._DECL node means that the name of this node should
2460 be ignored for symbolic debug purposes. */
2461 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2463 /* Nonzero for a given ..._DECL node means that this node represents an
2464 "abstract instance" of the given declaration (e.g. in the original
2465 declaration of an inline function). When generating symbolic debugging
2466 information, we mustn't try to generate any address information for nodes
2467 marked as "abstract instances" because we don't actually generate
2468 any code or allocate any data space for such instances. */
2469 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2471 /* Language-specific decl information. */
2472 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2474 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2475 do not allocate storage, and refer to a definition elsewhere. Note that
2476 this does not necessarily imply the entity represented by NODE
2477 has no program source-level definition in this translation unit. For
2478 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2479 DECL_EXTERNAL may be true simultaneously; that can be the case for
2480 a C99 "extern inline" function. */
2481 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2483 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
2485 #define DEFAULT_INIT_PRIORITY 65535
2486 #define MAX_INIT_PRIORITY 65535
2487 #define MAX_RESERVED_INIT_PRIORITY 100
2490 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2491 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2493 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2495 Also set in some languages for variables, etc., outside the normal
2496 lexical scope, such as class instance variables. */
2497 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2499 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2500 Used in FIELD_DECLs for vtable pointers.
2501 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2502 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2504 /* Used to indicate that this DECL represents a compiler-generated entity. */
2505 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2507 /* Additional flags for language-specific uses. */
2508 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2509 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2510 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2511 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2512 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2513 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2514 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2515 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2517 /* Used to indicate an alias set for the memory pointed to by this
2518 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2519 pointer (or reference) type. */
2520 #define DECL_POINTER_ALIAS_SET(NODE) \
2521 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2523 /* Nonzero if an alias set has been assigned to this declaration. */
2524 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2525 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2527 /* Nonzero for a decl which is at file scope. */
2528 #define DECL_FILE_SCOPE_P(EXP) \
2529 (! DECL_CONTEXT (EXP) \
2530 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2532 /* Nonzero for a decl that is decorated using attribute used.
2533 This indicates compiler tools that this decl needs to be preserved. */
2534 #define DECL_PRESERVE_P(DECL) \
2535 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2537 /* For function local variables of COMPLEX type, indicates that the
2538 variable is not aliased, and that all modifications to the variable
2539 have been adjusted so that they are killing assignments. Thus the
2540 variable may now be treated as a GIMPLE register, and use real
2541 instead of virtual ops in SSA form. */
2542 #define DECL_COMPLEX_GIMPLE_REG_P(DECL) \
2543 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2545 /* This is true if DECL is call clobbered in the current function.
2546 The result of this flag should always be the same as
2547 bitmap_bit_p (call_clobbered_vars, DECL_UID (decl)). */
2548 #define DECL_CALL_CLOBBERED(DECL) \
2549 DECL_COMMON_CHECK (DECL)->decl_common.call_clobbered_flag
2551 struct tree_decl_common GTY(())
2553 struct tree_decl_minimal common;
2556 ENUM_BITFIELD(machine_mode) mode : 8;
2558 unsigned nonlocal_flag : 1;
2559 unsigned virtual_flag : 1;
2560 unsigned ignored_flag : 1;
2561 unsigned abstract_flag : 1;
2562 unsigned artificial_flag : 1;
2563 unsigned user_align : 1;
2564 unsigned preserve_flag: 1;
2565 unsigned debug_expr_is_from : 1;
2567 unsigned lang_flag_0 : 1;
2568 unsigned lang_flag_1 : 1;
2569 unsigned lang_flag_2 : 1;
2570 unsigned lang_flag_3 : 1;
2571 unsigned lang_flag_4 : 1;
2572 unsigned lang_flag_5 : 1;
2573 unsigned lang_flag_6 : 1;
2574 unsigned lang_flag_7 : 1;
2576 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2577 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2578 unsigned decl_flag_0 : 1;
2579 /* In FIELD_DECL, this is DECL_PACKED. */
2580 unsigned decl_flag_1 : 1;
2581 /* In FIELD_DECL, this is DECL_BIT_FIELD
2582 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2583 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2584 unsigned decl_flag_2 : 1;
2585 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2586 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2587 unsigned decl_flag_3 : 1;
2588 /* Logically, these two would go in a theoretical base shared by var and
2590 unsigned gimple_reg_flag : 1;
2591 unsigned call_clobbered_flag : 1;
2593 unsigned int align : 24;
2594 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2595 unsigned int off_align : 8;
2600 tree abstract_origin;
2602 HOST_WIDE_INT pointer_alias_set;
2603 /* Points to a structure whose details depend on the language in use. */
2604 struct lang_decl *lang_specific;
2607 extern tree decl_value_expr_lookup (tree);
2608 extern void decl_value_expr_insert (tree, tree);
2610 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2611 if transformations have made this more complicated than evaluating the
2612 decl itself. This should only be used for debugging; once this field has
2613 been set, the decl itself may not legitimately appear in the function. */
2614 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2615 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2616 #define DECL_VALUE_EXPR(NODE) \
2617 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2618 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2619 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2621 /* Holds the RTL expression for the value of a variable or function.
2622 This value can be evaluated lazily for functions, variables with
2623 static storage duration, and labels. */
2624 #define DECL_RTL(NODE) \
2625 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2626 ? (NODE)->decl_with_rtl.rtl \
2627 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2629 /* Set the DECL_RTL for NODE to RTL. */
2630 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2632 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2633 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2635 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2636 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2638 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2639 NODE1, it will not be set for NODE2; this is a lazy copy. */
2640 #define COPY_DECL_RTL(NODE1, NODE2) \
2641 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2643 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2644 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2646 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2647 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2649 struct tree_decl_with_rtl GTY(())
2651 struct tree_decl_common common;
2655 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2656 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2657 of the structure. */
2658 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2660 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2661 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2662 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2663 natural alignment of the field's type). */
2664 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2666 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2667 if so, the type that was originally specified for it.
2668 TREE_TYPE may have been modified (in finish_struct). */
2669 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2671 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2672 if nonzero, indicates that the field occupies the type. */
2673 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2675 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2676 DECL_FIELD_OFFSET which are known to be always zero.
2677 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2679 #define DECL_OFFSET_ALIGN(NODE) \
2680 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2682 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2683 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2684 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2685 /* 1 if the alignment for this type was requested by "aligned" attribute,
2686 0 if it is the default for this type. */
2688 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2689 which this FIELD_DECL is defined. This information is needed when
2690 writing debugging information about vfield and vbase decls for C++. */
2691 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2693 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2694 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2696 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2698 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2700 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2702 #define DECL_NONADDRESSABLE_P(NODE) \
2703 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2705 struct tree_field_decl GTY(())
2707 struct tree_decl_common common;
2710 tree bit_field_type;
2717 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2718 dense, unique within any one function, and may be used to index arrays.
2719 If the value is -1, then no UID has been assigned. */
2720 #define LABEL_DECL_UID(NODE) \
2721 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2723 /* In LABEL_DECL nodes, nonzero means that an error message about
2724 jumping into such a binding contour has been printed for this label. */
2725 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2727 struct tree_label_decl GTY(())
2729 struct tree_decl_with_rtl common;
2730 /* Java's verifier has some need to store information about labels,
2731 and was using fields that no longer exist on labels.
2732 Once the verifier doesn't need these anymore, they should be removed. */
2736 unsigned int java_field_4;
2740 struct tree_result_decl GTY(())
2742 struct tree_decl_with_rtl common;
2745 struct tree_const_decl GTY(())
2747 struct tree_decl_with_rtl common;
2750 /* For a PARM_DECL, records the data type used to pass the argument,
2751 which may be different from the type seen in the program. */
2752 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2754 /* For PARM_DECL, holds an RTL for the stack slot or register
2755 where the data was actually passed. */
2756 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2758 struct tree_parm_decl GTY(())
2760 struct tree_decl_with_rtl common;
2765 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2766 this variable in a BIND_EXPR. */
2767 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2768 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2770 /* Used to indicate that the linkage status of this DECL is not yet known,
2771 so it should not be output now. */
2772 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2774 /* Nonzero for a given ..._DECL node means that no warnings should be
2775 generated just because this node is unused. */
2776 #define DECL_IN_SYSTEM_HEADER(NODE) \
2777 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2779 /* Used to indicate that this DECL has weak linkage. */
2780 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2782 /* Internal to the gimplifier. Indicates that the value is a formal
2783 temporary controlled by the gimplifier. */
2784 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2785 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2787 /* Used to indicate that the DECL is a dllimport. */
2788 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2790 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2791 based on a variable with a restrict qualified type. If it is,
2792 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2795 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2796 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2797 #define DECL_GET_RESTRICT_BASE(NODE) \
2798 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2799 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2800 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2802 extern tree decl_restrict_base_lookup (tree);
2803 extern void decl_restrict_base_insert (tree, tree);
2805 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2806 not be put out unless it is needed in this translation unit.
2807 Entities like this are shared across translation units (like weak
2808 entities), but are guaranteed to be generated by any translation
2809 unit that needs them, and therefore need not be put out anywhere
2810 where they are not needed. DECL_COMDAT is just a hint to the
2811 back-end; it is up to front-ends which set this flag to ensure
2812 that there will never be any harm, other than bloat, in putting out
2813 something which is DECL_COMDAT. */
2814 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2816 /* A replaceable function is one which may be replaced at link-time
2817 with an entirely different definition, provided that the
2818 replacement has the same type. For example, functions declared
2819 with __attribute__((weak)) on most systems are replaceable.
2821 COMDAT functions are not replaceable, since all definitions of the
2822 function must be equivalent. It is important that COMDAT functions
2823 not be treated as replaceable so that use of C++ template
2824 instantiations is not penalized.
2826 For example, DECL_REPLACEABLE is used to determine whether or not a
2827 function (including a template instantiation) which is not
2828 explicitly declared "inline" can be inlined. If the function is
2829 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2830 implementation chosen at link-time may be different. However, a
2831 function that is not DECL_REPLACEABLE can be inlined, since all
2832 versions of the function will be functionally identical. */
2833 #define DECL_REPLACEABLE_P(NODE) \
2834 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2836 /* The name of the object as the assembler will see it (but before any
2837 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2838 as DECL_NAME. It is an IDENTIFIER_NODE. */
2839 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2841 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2842 This is true of all DECL nodes except FIELD_DECL. */
2843 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2844 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2846 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2847 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2849 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2850 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2852 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2853 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2854 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2856 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2857 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2858 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2859 semantics of using this macro, are different than saying:
2861 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2863 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2865 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2866 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2867 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2868 DECL_ASSEMBLER_NAME (DECL1)) \
2871 /* Records the section name in a section attribute. Used to pass
2872 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2873 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2875 /* Value of the decls's visibility attribute */
2876 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2878 /* Nonzero means that the decl had its visibility specified rather than
2880 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2882 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2883 multiple translation units should be merged. */
2884 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
2886 struct tree_decl_with_vis GTY(())
2888 struct tree_decl_with_rtl common;
2889 tree assembler_name;
2892 /* Belong to VAR_DECL exclusively. */
2893 unsigned defer_output:1;
2894 unsigned hard_register:1;
2895 unsigned thread_local:1;
2896 unsigned common_flag:1;
2897 unsigned in_text_section : 1;
2898 unsigned gimple_formal_temp : 1;
2899 unsigned dllimport_flag : 1;
2900 unsigned based_on_restrict_p : 1;
2901 /* Used by C++. Might become a generic decl flag. */
2902 unsigned shadowed_for_var_p : 1;
2904 /* Don't belong to VAR_DECL exclusively. */
2905 unsigned in_system_header_flag : 1;
2906 unsigned weak_flag:1;
2907 unsigned seen_in_bind_expr : 1;
2908 unsigned comdat_flag : 1;
2909 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2910 unsigned visibility_specified : 1;
2911 /* Belong to FUNCTION_DECL exclusively. */
2912 unsigned one_only : 1;
2913 unsigned init_priority_p:1;
2915 /* Belongs to VAR_DECL exclusively. */
2916 ENUM_BITFIELD(tls_model) tls_model : 3;
2917 /* 11 unused bits. */
2920 /* In a VAR_DECL that's static,
2921 nonzero if the space is in the text section. */
2922 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2924 /* Nonzero for a given ..._DECL node means that this node should be
2925 put in .common, if possible. If a DECL_INITIAL is given, and it
2926 is not error_mark_node, then the decl cannot be put in .common. */
2927 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2929 /* In a VAR_DECL, nonzero if the decl is a register variable with
2930 an explicit asm specification. */
2931 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2933 extern tree decl_debug_expr_lookup (tree);
2934 extern void decl_debug_expr_insert (tree, tree);
2935 /* For VAR_DECL, this is set to either an expression that it was split
2936 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
2937 subexpressions that it was split into. */
2938 #define DECL_DEBUG_EXPR(NODE) \
2939 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2941 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2942 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2945 extern unsigned short decl_init_priority_lookup (tree);
2946 extern void decl_init_priority_insert (tree, unsigned short);
2948 /* In a non-local VAR_DECL with static storage duration, this is the
2949 initialization priority. If this value is zero, the NODE will be
2950 initialized at the DEFAULT_INIT_PRIORITY. Only used by C++ FE*/
2952 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2953 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2954 #define DECL_INIT_PRIORITY(NODE) \
2955 (decl_init_priority_lookup (VAR_DECL_CHECK (NODE)))
2956 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2957 (decl_init_priority_insert (VAR_DECL_CHECK (NODE), VAL))
2959 /* In a VAR_DECL, the model to use if the data should be allocated from
2960 thread-local storage. */
2961 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2963 /* In a VAR_DECL, nonzero if the data should be allocated from
2964 thread-local storage. */
2965 #define DECL_THREAD_LOCAL_P(NODE) \
2966 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
2968 struct tree_var_decl GTY(())
2970 struct tree_decl_with_vis common;
2974 /* This field is used to reference anything in decl.result and is meant only
2975 for use by the garbage collector. */
2976 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2978 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2979 Before the struct containing the FUNCTION_DECL is laid out,
2980 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2981 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2982 function. When the class is laid out, this pointer is changed
2983 to an INTEGER_CST node which is suitable for use as an index
2984 into the virtual function table.
2985 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
2986 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2988 struct tree_decl_non_common GTY(())
2991 struct tree_decl_with_vis common;
2992 /* C++ uses this in namespaces. */
2994 /* C++ uses this in templates. */
2996 /* Almost all FE's use this. */
2998 /* C++ uses this in namespaces. */
3002 /* In FUNCTION_DECL, holds the decl for the return value. */
3003 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3005 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3006 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3008 /* In a FUNCTION_DECL, the saved representation of the body of the
3010 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3012 /* Nonzero in a FUNCTION_DECL means this function should be treated
3013 as if it were a malloc, meaning it returns a pointer that is
3015 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3017 /* Nonzero in a FUNCTION_DECL means this function may return more
3019 #define DECL_IS_RETURNS_TWICE(NODE) \
3020 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3022 /* Nonzero in a FUNCTION_DECL means this function should be treated
3023 as "pure" function (like const function, but may read global memory). */
3024 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3026 /* Nonzero in a FUNCTION_DECL means this function should be treated
3027 as "novops" function (function that does not read global memory,
3028 but may have arbitrary side effects). */
3029 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3031 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3032 at the beginning or end of execution. */
3033 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3034 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3036 #define DECL_STATIC_DESTRUCTOR(NODE) \
3037 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3039 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3040 be instrumented with calls to support routines. */
3041 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3042 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3044 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3045 disabled in this function. */
3046 #define DECL_NO_LIMIT_STACK(NODE) \
3047 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3049 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3050 static chain is not needed. */
3051 #define DECL_NO_STATIC_CHAIN(NODE) \
3052 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3054 /* Nonzero for a decl that cgraph has decided should be inlined into
3055 at least one call site. It is not meaningful to look at this
3056 directly; always use cgraph_function_possibly_inlined_p. */
3057 #define DECL_POSSIBLY_INLINED(DECL) \
3058 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3060 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3061 where it is called. */
3062 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3064 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3065 such as via the `inline' keyword in C/C++. This flag controls the linkage
3066 semantics of 'inline'; whether or not the function is inlined is
3067 controlled by DECL_INLINE. */
3068 #define DECL_DECLARED_INLINE_P(NODE) \
3069 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3071 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3072 that describes the status of this function. */
3073 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3075 /* In a FUNCTION_DECL, nonzero means a built in function. */
3076 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3078 /* For a builtin function, identify which part of the compiler defined it. */
3079 #define DECL_BUILT_IN_CLASS(NODE) \
3080 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3082 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3083 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3085 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3086 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3088 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3089 arguments/result/saved_tree fields by front ends. It was either inherit
3090 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3091 which seemed a bit strange. */
3093 struct tree_function_decl GTY(())
3095 struct tree_decl_non_common common;
3097 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3098 DECL_FUNCTION_CODE. Otherwise unused. */
3099 enum built_in_function function_code;
3101 unsigned static_ctor_flag : 1;
3102 unsigned static_dtor_flag : 1;
3103 unsigned uninlinable : 1;
3104 unsigned possibly_inlined : 1;
3105 unsigned novops_flag : 1;
3106 unsigned returns_twice_flag : 1;
3107 unsigned malloc_flag : 1;
3108 unsigned pure_flag : 1;
3110 unsigned declared_inline_flag : 1;
3111 unsigned regdecl_flag : 1;
3112 unsigned inline_flag : 1;
3113 unsigned no_instrument_function_entry_exit : 1;
3114 unsigned no_limit_stack : 1;
3115 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3120 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3121 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3123 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3124 into stabs. Instead it will generate cross reference ('x') of names.
3125 This uses the same flag as DECL_EXTERNAL. */
3126 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3127 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3129 struct tree_type_decl GTY(())
3131 struct tree_decl_non_common common;
3135 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3136 To reduce overhead, the nodes containing the statements are not trees.
3137 This avoids the overhead of tree_common on all linked list elements.
3139 Use the interface in tree-iterator.h to access this node. */
3141 #define STATEMENT_LIST_HEAD(NODE) \
3142 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3143 #define STATEMENT_LIST_TAIL(NODE) \
3144 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3146 struct tree_statement_list_node
3147 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3149 struct tree_statement_list_node *prev;
3150 struct tree_statement_list_node *next;
3154 struct tree_statement_list
3157 struct tree_common common;
3158 struct tree_statement_list_node *head;
3159 struct tree_statement_list_node *tail;
3162 #define VALUE_HANDLE_ID(NODE) \
3163 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3165 #define VALUE_HANDLE_EXPR_SET(NODE) \
3166 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3168 #define VALUE_HANDLE_VUSES(NODE) \
3169 (VALUE_HANDLE_CHECK (NODE)->value_handle.vuses)
3171 /* Defined and used in tree-ssa-pre.c. */
3174 struct tree_value_handle GTY(())
3176 struct tree_common common;
3178 /* The set of expressions represented by this handle. */
3179 struct value_set * GTY ((skip)) expr_set;
3181 /* Unique ID for this value handle. IDs are handed out in a
3182 conveniently dense form starting at 0, so that we can make
3183 bitmaps of value handles. */
3186 /* Set of virtual uses represented by this handle. */
3187 VEC (tree, gc) *vuses;
3190 /* Define the overall contents of a tree node.
3191 It may be any of the structures declared above
3192 for various types of node. */
3194 union tree_node GTY ((ptr_alias (union lang_tree_node),
3195 desc ("tree_node_structure (&%h)")))
3197 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3198 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3199 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3200 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3201 struct tree_string GTY ((tag ("TS_STRING"))) string;
3202 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3203 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3204 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3205 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3206 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3207 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3208 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3209 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3210 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3211 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3212 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3213 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3214 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3215 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3216 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3217 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3218 struct tree_list GTY ((tag ("TS_LIST"))) list;
3219 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3220 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3221 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3222 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3223 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3224 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3225 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3226 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3227 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3228 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3229 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3230 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3233 /* Standard named or nameless data types of the C compiler. */
3252 TI_INTEGER_MINUS_ONE,
3269 TI_COMPLEX_INTEGER_TYPE,
3270 TI_COMPLEX_FLOAT_TYPE,
3271 TI_COMPLEX_DOUBLE_TYPE,
3272 TI_COMPLEX_LONG_DOUBLE_TYPE,
3276 TI_LONG_DOUBLE_TYPE,
3280 TI_LONG_DOUBLE_PTR_TYPE,
3281 TI_INTEGER_PTR_TYPE,
3290 TI_VA_LIST_GPR_COUNTER_FIELD,
3291 TI_VA_LIST_FPR_COUNTER_FIELD,
3298 TI_DFLOAT32_PTR_TYPE,
3299 TI_DFLOAT64_PTR_TYPE,
3300 TI_DFLOAT128_PTR_TYPE,
3309 extern GTY(()) tree global_trees[TI_MAX];
3311 #define error_mark_node global_trees[TI_ERROR_MARK]
3313 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3314 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3315 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3316 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3317 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3319 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3320 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3321 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3322 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3323 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3325 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3326 #define integer_one_node global_trees[TI_INTEGER_ONE]
3327 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3328 #define size_zero_node global_trees[TI_SIZE_ZERO]
3329 #define size_one_node global_trees[TI_SIZE_ONE]
3330 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3331 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3332 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3334 /* Base access nodes. */
3335 #define access_public_node global_trees[TI_PUBLIC]
3336 #define access_protected_node global_trees[TI_PROTECTED]
3337 #define access_private_node global_trees[TI_PRIVATE]
3339 #define null_pointer_node global_trees[TI_NULL_POINTER]
3341 #define float_type_node global_trees[TI_FLOAT_TYPE]
3342 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3343 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3345 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3346 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3347 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3348 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3350 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3351 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3352 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3353 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3355 #define void_type_node global_trees[TI_VOID_TYPE]
3356 /* The C type `void *'. */
3357 #define ptr_type_node global_trees[TI_PTR_TYPE]
3358 /* The C type `const void *'. */
3359 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3360 /* The C type `size_t'. */
3361 #define size_type_node global_trees[TI_SIZE_TYPE]
3362 #define pid_type_node global_trees[TI_PID_TYPE]
3363 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3364 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3365 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3366 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3367 /* The C type `FILE *'. */
3368 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3370 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3371 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3372 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3374 /* The decimal floating point types. */
3375 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3376 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3377 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3378 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3379 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3380 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3382 /* The node that should be placed at the end of a parameter list to
3383 indicate that the function does not take a variable number of
3384 arguments. The TREE_VALUE will be void_type_node and there will be
3385 no TREE_CHAIN. Language-independent code should not assume
3386 anything else about this node. */
3387 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3389 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3390 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3392 /* An enumeration of the standard C integer types. These must be
3393 ordered so that shorter types appear before longer ones, and so
3394 that signed types appear before unsigned ones, for the correct
3395 functioning of interpret_integer() in c-lex.c. */
3396 enum integer_type_kind
3408 itk_unsigned_long_long,
3412 typedef enum integer_type_kind integer_type_kind;
3414 /* The standard C integer types. Use integer_type_kind to index into
3416 extern GTY(()) tree integer_types[itk_none];
3418 #define char_type_node integer_types[itk_char]
3419 #define signed_char_type_node integer_types[itk_signed_char]
3420 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3421 #define short_integer_type_node integer_types[itk_short]
3422 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3423 #define integer_type_node integer_types[itk_int]
3424 #define unsigned_type_node integer_types[itk_unsigned_int]
3425 #define long_integer_type_node integer_types[itk_long]
3426 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3427 #define long_long_integer_type_node integer_types[itk_long_long]
3428 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3430 /* Set to the default thread-local storage (tls) model to use. */
3432 extern enum tls_model flag_tls_default;
3435 /* A pointer-to-function member type looks like:
3442 If __pfn is NULL, it is a NULL pointer-to-member-function.
3444 (Because the vtable is always the first thing in the object, we
3445 don't need its offset.) If the function is virtual, then PFN is
3446 one plus twice the index into the vtable; otherwise, it is just a
3447 pointer to the function.
3449 Unfortunately, using the lowest bit of PFN doesn't work in
3450 architectures that don't impose alignment requirements on function
3451 addresses, or that use the lowest bit to tell one ISA from another,
3452 for example. For such architectures, we use the lowest bit of
3453 DELTA instead of the lowest bit of the PFN, and DELTA will be
3456 enum ptrmemfunc_vbit_where_t
3458 ptrmemfunc_vbit_in_pfn,
3459 ptrmemfunc_vbit_in_delta
3462 #define NULL_TREE (tree) NULL
3464 extern tree decl_assembler_name (tree);
3466 /* Compute the number of bytes occupied by 'node'. This routine only
3467 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3469 extern size_t tree_size (tree);
3471 /* Compute the number of bytes occupied by a tree with code CODE. This
3472 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3474 extern size_t tree_code_size (enum tree_code);
3476 /* Lowest level primitive for allocating a node.
3477 The TREE_CODE is the only argument. Contents are initialized
3478 to zero except for a few of the common fields. */
3480 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3481 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3483 /* Make a copy of a node, with all the same contents. */
3485 extern tree copy_node_stat (tree MEM_STAT_DECL);
3486 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3488 /* Make a copy of a chain of TREE_LIST nodes. */
3490 extern tree copy_list (tree);
3493 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3494 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3496 /* Make a TREE_VEC. */
3498 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3499 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3501 /* Tree nodes for SSA analysis. */
3503 extern void init_phinodes (void);
3504 extern void fini_phinodes (void);
3505 extern void release_phi_node (tree);
3506 #ifdef GATHER_STATISTICS
3507 extern void phinodes_print_statistics (void);
3510 extern void init_ssanames (void);
3511 extern void fini_ssanames (void);
3512 extern tree make_ssa_name (tree, tree);
3513 extern tree duplicate_ssa_name (tree, tree);
3514 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3515 extern void release_ssa_name (tree);
3516 extern void release_defs (tree);
3517 extern void replace_ssa_name_symbol (tree, tree);
3519 #ifdef GATHER_STATISTICS
3520 extern void ssanames_print_statistics (void);
3523 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3524 The name is supplied as a char *. */
3526 extern tree get_identifier (const char *);
3528 #if GCC_VERSION >= 3000
3529 #define get_identifier(str) \
3530 (__builtin_constant_p (str) \
3531 ? get_identifier_with_length ((str), strlen (str)) \
3532 : get_identifier (str))
3536 /* Identical to get_identifier, except that the length is assumed
3539 extern tree get_identifier_with_length (const char *, size_t);
3541 /* If an identifier with the name TEXT (a null-terminated string) has
3542 previously been referred to, return that node; otherwise return
3545 extern tree maybe_get_identifier (const char *);
3547 /* Construct various types of nodes. */
3549 extern tree build_nt (enum tree_code, ...);
3551 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3552 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3553 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3554 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3555 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3556 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3557 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3558 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3559 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3560 tree MEM_STAT_DECL);
3561 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3562 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3563 tree MEM_STAT_DECL);
3564 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3565 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3566 tree, tree, tree MEM_STAT_DECL);
3567 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3568 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3570 extern tree build_int_cst (tree, HOST_WIDE_INT);
3571 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3572 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3573 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3574 extern tree build_vector (tree, tree);
3575 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3576 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3577 extern tree build_constructor_single (tree, tree, tree);
3578 extern tree build_constructor_from_list (tree, tree);
3579 extern tree build_real_from_int_cst (tree, tree);
3580 extern tree build_complex (tree, tree, tree);
3581 extern tree build_one_cst (tree);
3582 extern tree build_string (int, const char *);
3583 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3584 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3585 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3586 extern tree build_fn_decl (const char *, tree);
3587 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3588 extern tree build_block (tree, tree, tree, tree);
3589 #ifndef USE_MAPPED_LOCATION
3590 extern void annotate_with_file_line (tree, const char *, int);
3591 extern void annotate_with_locus (tree, location_t);
3593 extern tree build_empty_stmt (void);
3594 extern tree build_omp_clause (enum omp_clause_code);
3596 /* Construct various nodes representing data types. */
3598 extern tree make_signed_type (int);
3599 extern tree make_unsigned_type (int);
3600 extern tree signed_type_for (tree);
3601 extern tree unsigned_type_for (tree);
3602 extern void initialize_sizetypes (bool);
3603 extern void set_sizetype (tree);
3604 extern void fixup_unsigned_type (tree);
3605 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3606 extern tree build_pointer_type (tree);
3607 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3608 extern tree build_reference_type (tree);
3609 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3610 extern tree build_vector_type (tree innertype, int nunits);
3611 extern tree build_type_no_quals (tree);
3612 extern tree build_index_type (tree);
3613 extern tree build_index_2_type (tree, tree);
3614 extern tree build_array_type (tree, tree);
3615 extern tree build_function_type (tree, tree);
3616 extern tree build_function_type_list (tree, ...);
3617 extern tree build_method_type_directly (tree, tree, tree);
3618 extern tree build_method_type (tree, tree);
3619 extern tree build_offset_type (tree, tree);
3620 extern tree build_complex_type (tree);
3621 extern tree build_resx (int);
3622 extern tree array_type_nelts (tree);
3623 extern bool in_array_bounds_p (tree);
3624 extern bool range_in_array_bounds_p (tree);
3626 extern tree value_member (tree, tree);
3627 extern tree purpose_member (tree, tree);
3629 extern int attribute_list_equal (tree, tree);
3630 extern int attribute_list_contained (tree, tree);
3631 extern int tree_int_cst_equal (tree, tree);
3632 extern int tree_int_cst_lt (tree, tree);
3633 extern int tree_int_cst_compare (tree, tree);
3634 extern int host_integerp (tree, int);
3635 extern HOST_WIDE_INT tree_low_cst (tree, int);
3636 extern int tree_int_cst_msb (tree);
3637 extern int tree_int_cst_sgn (tree);
3638 extern int tree_int_cst_sign_bit (tree);
3639 extern int tree_expr_nonnegative_p (tree);
3640 extern int tree_expr_nonnegative_warnv_p (tree, bool *);
3641 extern bool may_negate_without_overflow_p (tree);
3642 extern tree get_inner_array_type (tree);
3644 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3645 put the prototype here. Rtl.h does declare the prototype if
3646 tree.h had been included. */
3648 extern tree make_tree (tree, rtx);
3650 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3653 Such modified types already made are recorded so that duplicates
3656 extern tree build_type_attribute_variant (tree, tree);
3657 extern tree build_decl_attribute_variant (tree, tree);
3659 /* Structure describing an attribute and a function to handle it. */
3660 struct attribute_spec
3662 /* The name of the attribute (without any leading or trailing __),
3663 or NULL to mark the end of a table of attributes. */
3664 const char *const name;
3665 /* The minimum length of the list of arguments of the attribute. */
3666 const int min_length;
3667 /* The maximum length of the list of arguments of the attribute
3668 (-1 for no maximum). */
3669 const int max_length;
3670 /* Whether this attribute requires a DECL. If it does, it will be passed
3671 from types of DECLs, function return types and array element types to
3672 the DECLs, function types and array types respectively; but when
3673 applied to a type in any other circumstances, it will be ignored with
3674 a warning. (If greater control is desired for a given attribute,
3675 this should be false, and the flags argument to the handler may be
3676 used to gain greater control in that case.) */
3677 const bool decl_required;
3678 /* Whether this attribute requires a type. If it does, it will be passed
3679 from a DECL to the type of that DECL. */
3680 const bool type_required;
3681 /* Whether this attribute requires a function (or method) type. If it does,
3682 it will be passed from a function pointer type to the target type,
3683 and from a function return type (which is not itself a function
3684 pointer type) to the function type. */
3685 const bool function_type_required;
3686 /* Function to handle this attribute. NODE points to the node to which
3687 the attribute is to be applied. If a DECL, it should be modified in
3688 place; if a TYPE, a copy should be created. NAME is the name of the
3689 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3690 of the arguments (which may be NULL). FLAGS gives further information
3691 about the context of the attribute. Afterwards, the attributes will
3692 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3693 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3694 as well as in any other cases when the attributes should not be added
3695 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3696 applied to another type or DECL later may be returned;
3697 otherwise the return value should be NULL_TREE. This pointer may be
3698 NULL if no special handling is required beyond the checks implied
3699 by the rest of this structure. */
3700 tree (*const handler) (tree *node, tree name, tree args,
3701 int flags, bool *no_add_attrs);
3704 /* Flags that may be passed in the third argument of decl_attributes, and
3705 to handler functions for attributes. */
3706 enum attribute_flags
3708 /* The type passed in is the type of a DECL, and any attributes that
3709 should be passed in again to be applied to the DECL rather than the
3710 type should be returned. */
3711 ATTR_FLAG_DECL_NEXT = 1,
3712 /* The type passed in is a function return type, and any attributes that
3713 should be passed in again to be applied to the function type rather
3714 than the return type should be returned. */
3715 ATTR_FLAG_FUNCTION_NEXT = 2,
3716 /* The type passed in is an array element type, and any attributes that
3717 should be passed in again to be applied to the array type rather
3718 than the element type should be returned. */
3719 ATTR_FLAG_ARRAY_NEXT = 4,
3720 /* The type passed in is a structure, union or enumeration type being
3721 created, and should be modified in place. */
3722 ATTR_FLAG_TYPE_IN_PLACE = 8,
3723 /* The attributes are being applied by default to a library function whose
3724 name indicates known behavior, and should be silently ignored if they
3725 are not in fact compatible with the function type. */
3726 ATTR_FLAG_BUILT_IN = 16
3729 /* Default versions of target-overridable functions. */
3731 extern tree merge_decl_attributes (tree, tree);
3732 extern tree merge_type_attributes (tree, tree);
3734 /* Given a tree node and a string, return nonzero if the tree node is
3735 a valid attribute name for the string. */
3737 extern int is_attribute_p (const char *, tree);
3739 /* Given an attribute name and a list of attributes, return the list element
3740 of the attribute or NULL_TREE if not found. */
3742 extern tree lookup_attribute (const char *, tree);
3744 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3747 extern tree remove_attribute (const char *, tree);
3749 /* Given two attributes lists, return a list of their union. */
3751 extern tree merge_attributes (tree, tree);
3753 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3754 /* Given two Windows decl attributes lists, possibly including
3755 dllimport, return a list of their union . */
3756 extern tree merge_dllimport_decl_attributes (tree, tree);
3758 /* Handle a "dllimport" or "dllexport" attribute. */
3759 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3762 /* Check whether CAND is suitable to be returned from get_qualified_type
3763 (BASE, TYPE_QUALS). */
3765 extern bool check_qualified_type (tree, tree, int);
3767 /* Return a version of the TYPE, qualified as indicated by the
3768 TYPE_QUALS, if one exists. If no qualified version exists yet,
3769 return NULL_TREE. */
3771 extern tree get_qualified_type (tree, int);
3773 /* Like get_qualified_type, but creates the type if it does not
3774 exist. This function never returns NULL_TREE. */
3776 extern tree build_qualified_type (tree, int);
3778 /* Like build_qualified_type, but only deals with the `const' and
3779 `volatile' qualifiers. This interface is retained for backwards
3780 compatibility with the various front-ends; new code should use
3781 build_qualified_type instead. */
3783 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3784 build_qualified_type ((TYPE), \
3785 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3786 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3788 /* Make a copy of a type node. */
3790 extern tree build_distinct_type_copy (tree);
3791 extern tree build_variant_type_copy (tree);
3793 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3794 fields. Optionally specify an alignment, and then lay it out. */
3796 extern void finish_builtin_struct (tree, const char *,
3799 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3800 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3801 node, does nothing except for the first time. */
3803 extern void layout_type (tree);
3805 /* These functions allow a front-end to perform a manual layout of a
3806 RECORD_TYPE. (For instance, if the placement of subsequent fields
3807 depends on the placement of fields so far.) Begin by calling
3808 start_record_layout. Then, call place_field for each of the
3809 fields. Then, call finish_record_layout. See layout_type for the
3810 default way in which these functions are used. */
3812 typedef struct record_layout_info_s
3814 /* The RECORD_TYPE that we are laying out. */
3816 /* The offset into the record so far, in bytes, not including bits in
3819 /* The last known alignment of SIZE. */
3820 unsigned int offset_align;
3821 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3823 /* The alignment of the record so far, in bits. */
3824 unsigned int record_align;
3825 /* The alignment of the record so far, ignoring #pragma pack and
3826 __attribute__ ((packed)), in bits. */
3827 unsigned int unpacked_align;
3828 /* The previous field layed out. */
3830 /* The static variables (i.e., class variables, as opposed to
3831 instance variables) encountered in T. */
3832 tree pending_statics;
3833 /* Bits remaining in the current alignment group */
3834 int remaining_in_alignment;
3835 /* True if we've seen a packed field that didn't have normal
3836 alignment anyway. */
3837 int packed_maybe_necessary;
3838 } *record_layout_info;
3840 extern void set_lang_adjust_rli (void (*) (record_layout_info));
3841 extern record_layout_info start_record_layout (tree);
3842 extern tree bit_from_pos (tree, tree);
3843 extern tree byte_from_pos (tree, tree);
3844 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
3845 extern void normalize_offset (tree *, tree *, unsigned int);
3846 extern tree rli_size_unit_so_far (record_layout_info);
3847 extern tree rli_size_so_far (record_layout_info);
3848 extern void normalize_rli (record_layout_info);
3849 extern void place_field (record_layout_info, tree);
3850 extern void compute_record_mode (tree);
3851 extern void finish_record_layout (record_layout_info, int);
3853 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3854 return a canonicalized ..._TYPE node, so that duplicates are not made.
3855 How the hash code is computed is up to the caller, as long as any two
3856 callers that could hash identical-looking type nodes agree. */
3858 extern tree type_hash_canon (unsigned int, tree);
3860 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3861 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3862 fields. Call this only once for any given decl node.
3864 Second argument is the boundary that this field can be assumed to
3865 be starting at (in bits). Zero means it can be assumed aligned
3866 on any boundary that may be needed. */
3868 extern void layout_decl (tree, unsigned);
3870 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3871 a previous call to layout_decl and calls it again. */
3873 extern void relayout_decl (tree);
3875 /* Return the mode for data of a given size SIZE and mode class CLASS.
3876 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3877 The value is BLKmode if no other mode is found. This is like
3878 mode_for_size, but is passed a tree. */
3880 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
3882 /* Return an expr equal to X but certainly not valid as an lvalue. */
3884 extern tree non_lvalue (tree);
3886 extern tree convert (tree, tree);
3887 extern unsigned int expr_align (tree);
3888 extern tree expr_first (tree);
3889 extern tree expr_last (tree);
3890 extern tree expr_only (tree);
3891 extern tree size_in_bytes (tree);
3892 extern HOST_WIDE_INT int_size_in_bytes (tree);
3893 extern HOST_WIDE_INT max_int_size_in_bytes (tree);
3894 extern tree bit_position (tree);
3895 extern HOST_WIDE_INT int_bit_position (tree);
3896 extern tree byte_position (tree);
3897 extern HOST_WIDE_INT int_byte_position (tree);
3899 /* Define data structures, macros, and functions for handling sizes
3900 and the various types used to represent sizes. */
3904 SIZETYPE, /* Normal representation of sizes in bytes. */
3905 SSIZETYPE, /* Signed representation of sizes in bytes. */
3906 BITSIZETYPE, /* Normal representation of sizes in bits. */
3907 SBITSIZETYPE, /* Signed representation of sizes in bits. */
3910 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
3912 #define sizetype sizetype_tab[(int) SIZETYPE]
3913 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
3914 #define ssizetype sizetype_tab[(int) SSIZETYPE]
3915 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
3917 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
3918 extern tree size_binop (enum tree_code, tree, tree);
3919 extern tree size_diffop (tree, tree);
3921 #define size_int(L) size_int_kind (L, SIZETYPE)
3922 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
3923 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
3924 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
3926 extern tree round_up (tree, int);
3927 extern tree round_down (tree, int);
3928 extern tree get_pending_sizes (void);
3929 extern void put_pending_size (tree);
3930 extern void put_pending_sizes (tree);
3932 /* Type for sizes of data-type. */
3934 #define BITS_PER_UNIT_LOG \
3935 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3936 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3937 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3939 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
3940 extern unsigned int maximum_field_alignment;
3941 /* and its original value in bytes, specified via -fpack-struct=<value>. */
3942 extern unsigned int initial_max_fld_align;
3944 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3945 by making the last node in X point to Y.
3946 Returns X, except if X is 0 returns Y. */
3948 extern tree chainon (tree, tree);
3950 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3952 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3953 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3955 /* Return the last tree node in a chain. */
3957 extern tree tree_last (tree);
3959 /* Reverse the order of elements in a chain, and return the new head. */
3961 extern tree nreverse (tree);
3963 /* Returns the length of a chain of nodes
3964 (number of chain pointers to follow before reaching a null pointer). */
3966 extern int list_length (tree);
3968 /* Returns the number of FIELD_DECLs in a type. */
3970 extern int fields_length (tree);
3972 /* Given an initializer INIT, return TRUE if INIT is zero or some
3973 aggregate of zeros. Otherwise return FALSE. */
3975 extern bool initializer_zerop (tree);
3977 /* Examine CTOR to discover:
3978 * how many scalar fields are set to nonzero values,
3979 and place it in *P_NZ_ELTS;
3980 * how many scalar fields in total are in CTOR,
3981 and place it in *P_ELT_COUNT.
3982 * if a type is a union, and the initializer from the constructor
3983 is not the largest element in the union, then set *p_must_clear.
3985 Return whether or not CTOR is a valid static constant initializer, the same
3986 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
3988 extern bool categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3991 extern HOST_WIDE_INT count_type_elements (tree, bool);
3993 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3995 extern int integer_zerop (tree);
3997 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
3999 extern int integer_onep (tree);
4001 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4002 all of whose significant bits are 1. */
4004 extern int integer_all_onesp (tree);
4006 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4007 exactly one bit 1. */
4009 extern int integer_pow2p (tree);
4011 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4012 with a nonzero value. */
4014 extern int integer_nonzerop (tree);
4016 extern bool zero_p (tree);
4017 extern bool cst_and_fits_in_hwi (tree);
4018 extern tree num_ending_zeros (tree);
4020 /* staticp (tree x) is nonzero if X is a reference to data allocated
4021 at a fixed address in memory. Returns the outermost data. */
4023 extern tree staticp (tree);
4025 /* save_expr (EXP) returns an expression equivalent to EXP
4026 but it can be used multiple times within context CTX
4027 and only evaluate EXP once. */
4029 extern tree save_expr (tree);
4031 /* Look inside EXPR and into any simple arithmetic operations. Return
4032 the innermost non-arithmetic node. */
4034 extern tree skip_simple_arithmetic (tree);
4036 /* Return which tree structure is used by T. */
4038 enum tree_node_structure_enum tree_node_structure (tree);
4040 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4041 or offset that depends on a field within a record.
4043 Note that we only allow such expressions within simple arithmetic
4046 extern bool contains_placeholder_p (tree);
4048 /* This macro calls the above function but short-circuits the common
4049 case of a constant to save time. Also check for null. */
4051 #define CONTAINS_PLACEHOLDER_P(EXP) \
4052 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4054 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4055 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4058 extern bool type_contains_placeholder_p (tree);
4060 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4061 return a tree with all occurrences of references to F in a
4062 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4063 contains only arithmetic expressions. */
4065 extern tree substitute_in_expr (tree, tree, tree);
4067 /* This macro calls the above function but short-circuits the common
4068 case of a constant to save time and also checks for NULL. */
4070 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4071 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4073 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4074 for it within OBJ, a tree that is an object or a chain of references. */
4076 extern tree substitute_placeholder_in_expr (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_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4082 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4083 : substitute_placeholder_in_expr (EXP, OBJ))
4085 /* variable_size (EXP) is like save_expr (EXP) except that it
4086 is for the special case of something that is part of a
4087 variable size for a data type. It makes special arrangements
4088 to compute the value at the right time when the data type
4089 belongs to a function parameter. */
4091 extern tree variable_size (tree);
4093 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4094 but it can be used multiple times
4095 and only evaluate the subexpressions once. */
4097 extern tree stabilize_reference (tree);
4099 /* Subroutine of stabilize_reference; this is called for subtrees of
4100 references. Any expression with side-effects must be put in a SAVE_EXPR
4101 to ensure that it is only evaluated once. */
4103 extern tree stabilize_reference_1 (tree);
4105 /* Return EXP, stripped of any conversions to wider types
4106 in such a way that the result of converting to type FOR_TYPE
4107 is the same as if EXP were converted to FOR_TYPE.
4108 If FOR_TYPE is 0, it signifies EXP's type. */
4110 extern tree get_unwidened (tree, tree);
4112 /* Return OP or a simpler expression for a narrower value
4113 which can be sign-extended or zero-extended to give back OP.
4114 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4115 or 0 if the value should be sign-extended. */
4117 extern tree get_narrower (tree, int *);
4119 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4120 look for nested component-refs or array-refs at constant positions
4121 and find the ultimate containing object, which is returned. */
4123 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4124 tree *, enum machine_mode *, int *, int *,
4127 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4128 look for whether EXP or any nested component-refs within EXP is marked
4131 extern bool contains_packed_reference (tree exp);
4133 /* Return 1 if T is an expression that get_inner_reference handles. */
4135 extern int handled_component_p (tree);
4137 /* Return a tree of sizetype representing the size, in bytes, of the element
4138 of EXP, an ARRAY_REF. */
4140 extern tree array_ref_element_size (tree);
4142 /* Return a tree representing the lower bound of the array mentioned in
4143 EXP, an ARRAY_REF. */
4145 extern tree array_ref_low_bound (tree);
4147 /* Return a tree representing the upper bound of the array mentioned in
4148 EXP, an ARRAY_REF. */
4150 extern tree array_ref_up_bound (tree);
4152 /* Return a tree representing the offset, in bytes, of the field referenced
4153 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4155 extern tree component_ref_field_offset (tree);
4157 /* Given a DECL or TYPE, return the scope in which it was declared, or
4158 NUL_TREE if there is no containing scope. */
4160 extern tree get_containing_scope (tree);
4162 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4164 extern tree decl_function_context (tree);
4166 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4167 this _DECL with its context, or zero if none. */
4168 extern tree decl_type_context (tree);
4170 /* Return 1 if EXPR is the real constant zero. */
4171 extern int real_zerop (tree);
4173 /* Declare commonly used variables for tree structure. */
4175 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4176 Zero means allow extended lvalues. */
4178 extern int pedantic_lvalues;
4180 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4182 extern GTY(()) tree current_function_decl;
4184 /* Nonzero means a FUNC_BEGIN label was emitted. */
4185 extern GTY(()) const char * current_function_func_begin_label;
4188 extern unsigned crc32_string (unsigned, const char *);
4189 extern void clean_symbol_name (char *);
4190 extern tree get_file_function_name_long (const char *);
4191 extern tree get_callee_fndecl (tree);
4192 extern void change_decl_assembler_name (tree, tree);
4193 extern int type_num_arguments (tree);
4194 extern bool associative_tree_code (enum tree_code);
4195 extern bool commutative_tree_code (enum tree_code);
4196 extern tree upper_bound_in_type (tree, tree);
4197 extern tree lower_bound_in_type (tree, tree);
4198 extern int operand_equal_for_phi_arg_p (tree, tree);
4199 extern bool empty_body_p (tree);
4203 extern void expand_expr_stmt (tree);
4204 extern int warn_if_unused_value (tree, location_t);
4205 extern void expand_label (tree);
4206 extern void expand_goto (tree);
4208 extern rtx expand_stack_save (void);
4209 extern void expand_stack_restore (tree);
4210 extern void expand_return (tree);
4211 extern int is_body_block (tree);
4214 extern void using_eh_for_cleanups (void);
4216 /* In fold-const.c */
4218 /* Non-zero if we are folding constants inside an initializer; zero
4220 extern int folding_initializer;
4222 /* Fold constants as much as possible in an expression.
4223 Returns the simplified expression.
4224 Acts only on the top level of the expression;
4225 if the argument itself cannot be simplified, its
4226 subexpressions are not changed. */
4228 extern tree fold (tree);
4229 extern tree fold_unary (enum tree_code, tree, tree);
4230 extern tree fold_binary (enum tree_code, tree, tree, tree);
4231 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4232 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4233 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4234 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4235 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4236 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4237 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4238 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4239 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4240 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4241 extern tree fold_convert (tree, tree);
4242 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4243 extern tree fold_ignored_result (tree);
4244 extern tree fold_abs_const (tree, tree);
4245 extern tree fold_indirect_ref_1 (tree, tree);
4246 extern void fold_defer_overflow_warnings (void);
4247 extern void fold_undefer_overflow_warnings (bool, tree, int);
4248 extern void fold_undefer_and_ignore_overflow_warnings (void);
4249 extern bool fold_deferring_overflow_warnings_p (void);
4251 extern tree force_fit_type (tree, int, bool, bool);
4253 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4254 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4255 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4257 #define add_double(l1,h1,l2,h2,lv,hv) \
4258 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4259 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4260 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4261 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4262 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4263 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4265 #define mul_double(l1,h1,l2,h2,lv,hv) \
4266 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4267 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4268 HOST_WIDE_INT, unsigned int,
4269 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4270 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4271 HOST_WIDE_INT, unsigned int,
4272 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4273 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4274 HOST_WIDE_INT, unsigned int,
4275 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4276 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4277 HOST_WIDE_INT, unsigned int,
4278 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4280 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4281 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4282 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4283 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4286 enum operand_equal_flag
4292 extern int operand_equal_p (tree, tree, unsigned int);
4294 extern tree omit_one_operand (tree, tree, tree);
4295 extern tree omit_two_operands (tree, tree, tree, tree);
4296 extern tree invert_truthvalue (tree);
4297 extern tree fold_truth_not_expr (tree);
4298 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4299 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4300 extern tree fold_read_from_constant_string (tree);
4301 extern tree int_const_binop (enum tree_code, tree, tree, int);
4302 extern tree build_fold_addr_expr (tree);
4303 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4304 extern tree fold_strip_sign_ops (tree);
4305 extern tree build_fold_addr_expr_with_type (tree, tree);
4306 extern tree build_fold_indirect_ref (tree);
4307 extern tree fold_indirect_ref (tree);
4308 extern tree constant_boolean_node (int, tree);
4309 extern tree build_low_bits_mask (tree, unsigned);
4311 extern bool tree_swap_operands_p (tree, tree, bool);
4312 extern void swap_tree_operands (tree, tree *, tree *);
4313 extern enum tree_code swap_tree_comparison (enum tree_code);
4315 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4316 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4318 extern bool tree_expr_nonzero_p (tree);
4319 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4322 extern tree fold_builtin (tree, tree, bool);
4323 extern tree fold_builtin_fputs (tree, bool, bool, tree);
4324 extern tree fold_builtin_strcpy (tree, tree, tree);
4325 extern tree fold_builtin_strncpy (tree, tree, tree);
4326 extern tree fold_builtin_memory_chk (tree, tree, tree, bool,
4327 enum built_in_function);
4328 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, bool,
4329 enum built_in_function);
4330 extern tree fold_builtin_strncpy_chk (tree, tree);
4331 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4332 extern bool fold_builtin_next_arg (tree);
4333 extern enum built_in_function builtin_mathfn_code (tree);
4334 extern tree build_function_call_expr (tree, tree);
4335 extern tree mathfn_built_in (tree, enum built_in_function fn);
4336 extern tree strip_float_extensions (tree);
4337 extern tree c_strlen (tree, int);
4338 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4339 extern tree build_va_arg_indirect_ref (tree);
4340 tree build_string_literal (int, const char *);
4343 extern tree strip_float_extensions (tree);
4346 extern void record_component_aliases (tree);
4347 extern HOST_WIDE_INT get_alias_set (tree);
4348 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4349 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4350 extern int objects_must_conflict_p (tree, tree);
4353 extern int really_constant_p (tree);
4354 extern int int_fits_type_p (tree, tree);
4355 extern bool variably_modified_type_p (tree, tree);
4356 extern int tree_log2 (tree);
4357 extern int tree_floor_log2 (tree);
4358 extern int simple_cst_equal (tree, tree);
4359 extern hashval_t iterative_hash_expr (tree, hashval_t);
4360 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
4361 extern int type_list_equal (tree, tree);
4362 extern int chain_member (tree, tree);
4363 extern tree type_hash_lookup (unsigned int, tree);
4364 extern void type_hash_add (unsigned int, tree);
4365 extern int simple_cst_list_equal (tree, tree);
4366 extern void dump_tree_statistics (void);
4367 extern void expand_function_end (void);
4368 extern void expand_function_start (tree);
4369 extern void stack_protect_prologue (void);
4370 extern void stack_protect_epilogue (void);
4371 extern void recompute_tree_invariant_for_addr_expr (tree);
4372 extern bool is_global_var (tree t);
4373 extern bool needs_to_live_in_memory (tree);
4374 extern tree reconstruct_complex_type (tree, tree);
4376 extern int real_onep (tree);
4377 extern int real_twop (tree);
4378 extern int real_minus_onep (tree);
4379 extern void init_ttree (void);
4380 extern void build_common_tree_nodes (bool, bool);
4381 extern void build_common_tree_nodes_2 (int);
4382 extern void build_common_builtin_nodes (void);
4383 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4384 extern tree build_range_type (tree, tree, tree);
4385 extern HOST_WIDE_INT int_cst_value (tree);
4386 extern tree tree_fold_gcd (tree, tree);
4387 extern tree build_addr (tree, tree);
4389 extern bool fields_compatible_p (tree, tree);
4390 extern tree find_compatible_field (tree, tree);
4393 extern void expand_main_function (void);
4394 extern void init_dummy_function_start (void);
4395 extern void expand_dummy_function_end (void);
4396 extern unsigned int init_function_for_compilation (void);
4397 extern void allocate_struct_function (tree);
4398 extern void init_function_start (tree);
4399 extern bool use_register_for_decl (tree);
4400 extern void setjmp_vars_warning (tree);
4401 extern void setjmp_args_warning (void);
4402 extern void init_temp_slots (void);
4403 extern void free_temp_slots (void);
4404 extern void pop_temp_slots (void);
4405 extern void push_temp_slots (void);
4406 extern void preserve_temp_slots (rtx);
4407 extern int aggregate_value_p (tree, tree);
4408 extern void push_function_context (void);
4409 extern void pop_function_context (void);
4410 extern void push_function_context_to (tree);
4411 extern void pop_function_context_from (tree);
4412 extern tree gimplify_parameters (void);
4414 /* In print-rtl.c */
4416 extern void print_rtl (FILE *, rtx);
4419 /* In print-tree.c */
4420 extern void debug_tree (tree);
4422 extern void dump_addr (FILE*, const char *, void *);
4423 extern void print_node (FILE *, const char *, tree, int);
4424 extern void print_node_brief (FILE *, const char *, tree, int);
4425 extern void indent_to (FILE *, int);
4428 /* In tree-inline.c: */
4429 extern bool debug_find_tree (tree, tree);
4430 /* This is in tree-inline.c since the routine uses
4431 data structures from the inliner. */
4432 extern tree unsave_expr_now (tree);
4433 extern tree build_duplicate_type (tree);
4436 extern rtx emit_line_note (location_t);
4440 /* Nonzero if this is a call to a function whose return value depends
4441 solely on its arguments, has no side effects, and does not read
4444 /* Nonzero if this call will never return. */
4445 #define ECF_NORETURN 2
4446 /* Nonzero if this is a call to malloc or a related function. */
4447 #define ECF_MALLOC 4
4448 /* Nonzero if it is plausible that this is a call to alloca. */
4449 #define ECF_MAY_BE_ALLOCA 8
4450 /* Nonzero if this is a call to a function that won't throw an exception. */
4451 #define ECF_NOTHROW 16
4452 /* Nonzero if this is a call to setjmp or a related function. */
4453 #define ECF_RETURNS_TWICE 32
4454 /* Nonzero if this call replaces the current stack frame. */
4455 #define ECF_SIBCALL 64
4456 /* Nonzero if this is a call to "pure" function (like const function,
4457 but may read memory. */
4458 #define ECF_PURE 128
4459 /* Nonzero if this is a call to a function that returns with the stack
4460 pointer depressed. */
4461 #define ECF_SP_DEPRESSED 256
4462 /* Create libcall block around the call. */
4463 #define ECF_LIBCALL_BLOCK 512
4464 /* Function does not read or write memory (but may have side effects, so
4465 it does not necessarily fit ECF_CONST). */
4466 #define ECF_NOVOPS 1024
4468 extern int flags_from_decl_or_type (tree);
4469 extern int call_expr_flags (tree);
4471 extern int setjmp_call_p (tree);
4472 extern bool alloca_call_p (tree);
4473 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
4474 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
4478 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4479 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4480 it should be modified in place; if a TYPE, a copy should be created
4481 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4482 information, in the form of a bitwise OR of flags in enum attribute_flags
4483 from tree.h. Depending on these flags, some attributes may be
4484 returned to be applied at a later stage (for example, to apply
4485 a decl attribute to the declaration rather than to its type). */
4486 extern tree decl_attributes (tree *, tree, int);
4488 /* In integrate.c */
4489 extern void set_decl_abstract_flags (tree, int);
4490 extern void set_decl_origin_self (tree);
4492 /* In stor-layout.c */
4493 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
4494 extern void fixup_signed_type (tree);
4495 extern void internal_reference_types (void);
4496 extern unsigned int update_alignment_for_field (record_layout_info, tree,
4499 extern void make_decl_rtl (tree);
4500 extern void make_decl_one_only (tree);
4501 extern int supports_one_only (void);
4502 extern void resolve_unique_section (tree, int, int);
4503 extern void mark_referenced (tree);
4504 extern void mark_decl_referenced (tree);
4505 extern void notice_global_symbol (tree);
4506 extern void set_user_assembler_name (tree, const char *);
4507 extern void process_pending_assemble_externals (void);
4508 extern void finish_aliases_1 (void);
4509 extern void finish_aliases_2 (void);
4512 extern void expand_computed_goto (tree);
4513 extern bool parse_output_constraint (const char **, int, int, int,
4514 bool *, bool *, bool *);
4515 extern bool parse_input_constraint (const char **, int, int, int, int,
4516 const char * const *, bool *, bool *);
4517 extern void expand_asm_expr (tree);
4518 extern tree resolve_asm_operand_names (tree, tree, tree);
4519 extern void expand_case (tree);
4520 extern void expand_decl (tree);
4521 extern void expand_anon_union_decl (tree, tree, tree);
4523 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4524 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
4527 /* In gimplify.c. */
4528 extern tree create_artificial_label (void);
4529 extern void gimplify_function_tree (tree);
4530 extern const char *get_name (tree);
4531 extern tree unshare_expr (tree);
4532 extern void sort_case_labels (tree);
4534 /* If KIND=='I', return a suitable global initializer (constructor) name.
4535 If KIND=='D', return a suitable global clean-up (destructor) name. */
4536 extern tree get_file_function_name (int);
4538 /* Interface of the DWARF2 unwind info support. */
4540 /* Generate a new label for the CFI info to refer to. */
4542 extern char *dwarf2out_cfi_label (void);
4544 /* Entry point to update the canonical frame address (CFA). */
4546 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
4548 /* Add the CFI for saving a register window. */
4550 extern void dwarf2out_window_save (const char *);
4552 /* Add a CFI to update the running total of the size of arguments pushed
4555 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
4557 /* Entry point for saving a register to the stack. */
4559 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
4561 /* Entry point for saving the return address in the stack. */
4563 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
4565 /* Entry point for saving the return address in a register. */
4567 extern void dwarf2out_return_reg (const char *, unsigned);
4569 /* Entry point for saving the first register into the second. */
4571 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
4573 /* In tree-inline.c */
4575 /* The type of a set of already-visited pointers. Functions for creating
4576 and manipulating it are declared in pointer-set.h */
4577 struct pointer_set_t;
4579 /* The type of a callback function for walking over tree structure. */
4581 typedef tree (*walk_tree_fn) (tree *, int *, void *);
4582 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
4583 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
4585 /* Assign the RTX to declaration. */
4587 extern void set_decl_rtl (tree, rtx);
4588 extern void set_decl_incoming_rtl (tree, rtx);
4590 /* Enum and arrays used for tree allocation stats.
4591 Keep in sync with tree.c:tree_node_kind_names. */
4616 extern int tree_node_counts[];
4617 extern int tree_node_sizes[];
4619 /* True if we are in gimple form and the actions of the folders need to
4620 be restricted. False if we are not in gimple form and folding is not
4621 restricted to creating gimple expressions. */
4622 extern bool in_gimple_form;
4624 /* In tree-gimple.c. */
4625 extern tree get_base_address (tree t);
4627 /* In tree-vectorizer.c. */
4628 extern void vect_set_verbosity_level (const char *);
4630 struct tree_map GTY(())
4637 extern unsigned int tree_map_hash (const void *);
4638 extern int tree_map_marked_p (const void *);
4639 extern int tree_map_eq (const void *, const void *);
4641 /* In tree-ssa-address.c. */
4642 extern tree tree_mem_ref_addr (tree, tree);
4643 extern void copy_mem_ref_info (tree, tree);
4646 extern bool ssa_name_nonzero_p (tree);
4647 extern bool ssa_name_nonnegative_p (tree);
4649 /* In tree-object-size.c. */
4650 extern void init_object_sizes (void);
4651 extern void fini_object_sizes (void);
4652 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
4655 extern unsigned HOST_WIDE_INT highest_pow2_factor (tree);
4657 #endif /* GCC_TREE_H */