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;
386 /* The following table lists the uses of each of the above flags and
387 for which types of nodes they are defined. Note that expressions
393 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
394 ..._TYPE, IDENTIFIER_NODE.
395 In a STMT_EXPR, it means we want the result of the enclosed
397 CALL_EXPR_TAILCALL in CALL_EXPR
398 CASE_LOW_SEEN in CASE_LABEL_EXPR
403 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
406 TREE_CONSTANT_OVERFLOW in
407 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
408 TREE_SYMBOL_REFERENCED in
411 TARGET_EXPR, WITH_CLEANUP_EXPR
414 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
415 TYPE_REF_CAN_ALIAS_ALL in
416 POINTER_TYPE, REFERENCE_TYPE
417 CASE_HIGH_SEEN in CASE_LABEL_EXPR
422 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
424 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
427 TYPE_CACHED_VALUES_P in
429 SAVE_EXPR_RESOLVED_P in
431 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
432 OMP_CLAUSE_LASTPRIVATE
433 OMP_CLAUSE_PRIVATE_DEBUG in
440 CALL_EXPR_RETURN_SLOT_OPT in
443 PARM_DECL, RESULT_DECL
448 OMP_PARALLEL_COMBINED in
471 TREE_THIS_VOLATILE in
489 TYPE_SIZES_GIMPLIFIED
498 BIT_FIELD_REF_UNSIGNED in
504 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
510 expressions, IDENTIFIER_NODE
515 CALL_EXPR, FUNCTION_DECL
521 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
528 IDENTIFIER_TRANSPARENT_ALIAS in
533 Used in tree traversals to mark visited nodes.
543 ... any expr or decl node
546 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
547 enum tree_node_structure_enum {
548 #include "treestruct.def"
553 /* Define accessors for the fields that all tree nodes have
554 (though some fields are not used for all kinds of nodes). */
556 /* The tree-code says what kind of node it is.
557 Codes are defined in tree.def. */
558 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
559 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
561 /* When checking is enabled, errors will be generated if a tree node
562 is accessed incorrectly. The macros die with a fatal error. */
563 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
565 #define TREE_CHECK(T, CODE) __extension__ \
566 ({ const tree __t = (T); \
567 if (TREE_CODE (__t) != (CODE)) \
568 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
572 #define TREE_NOT_CHECK(T, CODE) __extension__ \
573 ({ const tree __t = (T); \
574 if (TREE_CODE (__t) == (CODE)) \
575 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
579 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
580 ({ const tree __t = (T); \
581 if (TREE_CODE (__t) != (CODE1) \
582 && TREE_CODE (__t) != (CODE2)) \
583 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
584 (CODE1), (CODE2), 0); \
587 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
588 ({ const tree __t = (T); \
589 if (TREE_CODE (__t) == (CODE1) \
590 || TREE_CODE (__t) == (CODE2)) \
591 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
592 (CODE1), (CODE2), 0); \
595 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
596 ({ const tree __t = (T); \
597 if (TREE_CODE (__t) != (CODE1) \
598 && TREE_CODE (__t) != (CODE2) \
599 && TREE_CODE (__t) != (CODE3)) \
600 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
601 (CODE1), (CODE2), (CODE3), 0); \
604 #define TREE_NOT_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_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
610 (CODE1), (CODE2), (CODE3), 0); \
613 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
614 ({ const tree __t = (T); \
615 if (TREE_CODE (__t) != (CODE1) \
616 && TREE_CODE (__t) != (CODE2) \
617 && TREE_CODE (__t) != (CODE3) \
618 && TREE_CODE (__t) != (CODE4)) \
619 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
620 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
623 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
624 ({ const tree __t = (T); \
625 if (TREE_CODE (__t) == (CODE1) \
626 || TREE_CODE (__t) == (CODE2) \
627 || TREE_CODE (__t) == (CODE3) \
628 || TREE_CODE (__t) == (CODE4)) \
629 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
630 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
633 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
634 ({ const tree __t = (T); \
635 if (TREE_CODE (__t) != (CODE1) \
636 && TREE_CODE (__t) != (CODE2) \
637 && TREE_CODE (__t) != (CODE3) \
638 && TREE_CODE (__t) != (CODE4) \
639 && TREE_CODE (__t) != (CODE5)) \
640 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
641 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
644 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
645 ({ const tree __t = (T); \
646 if (TREE_CODE (__t) == (CODE1) \
647 || TREE_CODE (__t) == (CODE2) \
648 || TREE_CODE (__t) == (CODE3) \
649 || TREE_CODE (__t) == (CODE4) \
650 || TREE_CODE (__t) == (CODE5)) \
651 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
652 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
655 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
656 ({ const tree __t = (T); \
657 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
658 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
662 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
663 ({ const tree __t = (T); \
664 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
665 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
669 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
670 ({ const tree __t = (T); \
671 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
672 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
676 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
677 ({ const tree __t = (T); \
678 if (TREE_CODE (__t) != OMP_CLAUSE) \
679 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
681 if (__t->omp_clause.code != (CODE)) \
682 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
686 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
687 ({ const tree __t = (T); \
688 if (TREE_CODE (__t) != OMP_CLAUSE) \
689 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
691 if ((int) __t->omp_clause.code < (int) (CODE1) \
692 || (int) __t->omp_clause.code > (int) (CODE2)) \
693 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
694 __FUNCTION__, (CODE1), (CODE2)); \
697 /* These checks have to be special cased. */
698 #define EXPR_CHECK(T) __extension__ \
699 ({ const tree __t = (T); \
700 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
701 if (!IS_EXPR_CODE_CLASS (__c)) \
702 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
706 /* These checks have to be special cased. */
707 #define NON_TYPE_CHECK(T) __extension__ \
708 ({ const tree __t = (T); \
710 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
714 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
715 (*({const tree __t = (T); \
716 const int __i = (I); \
717 if (TREE_CODE (__t) != TREE_VEC) \
718 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
720 if (__i < 0 || __i >= __t->vec.length) \
721 tree_vec_elt_check_failed (__i, __t->vec.length, \
722 __FILE__, __LINE__, __FUNCTION__); \
723 &__t->vec.a[__i]; }))
725 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
726 (*({const tree __t = t; \
727 const int __i = (i); \
728 if (TREE_CODE (__t) != PHI_NODE) \
729 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
731 if (__i < 0 || __i >= __t->phi.capacity) \
732 phi_node_elt_check_failed (__i, __t->phi.num_args, \
733 __FILE__, __LINE__, __FUNCTION__); \
734 &__t->phi.a[__i]; }))
736 #define OMP_CLAUSE_ELT_CHECK(t, i) __extension__ \
737 (*({const tree __t = t; \
738 const int __i = (i); \
739 if (TREE_CODE (__t) != OMP_CLAUSE) \
740 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
742 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
743 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
745 &__t->omp_clause.ops[__i]; }))
747 /* Special checks for TREE_OPERANDs. */
748 #define TREE_OPERAND_CHECK(T, I) __extension__ \
749 (*({const tree __t = EXPR_CHECK (T); \
750 const int __i = (I); \
751 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
752 tree_operand_check_failed (__i, TREE_CODE (__t), \
753 __FILE__, __LINE__, __FUNCTION__); \
754 &__t->exp.operands[__i]; }))
756 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
757 (*({const tree __t = (T); \
758 const int __i = (I); \
759 if (TREE_CODE (__t) != CODE) \
760 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
761 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
762 tree_operand_check_failed (__i, (CODE), \
763 __FILE__, __LINE__, __FUNCTION__); \
764 &__t->exp.operands[__i]; }))
766 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
768 ({const tree __t = (T); \
769 const int __i = (I); \
770 if (TREE_CODE (__t) != (CODE)) \
771 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
772 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
773 tree_operand_check_failed (__i, (CODE), \
774 __FILE__, __LINE__, __FUNCTION__); \
775 &__t->exp.operands[__i]; }))
777 extern void tree_contains_struct_check_failed (const tree,
778 const enum tree_node_structure_enum,
779 const char *, int, const char *)
782 extern void tree_check_failed (const tree, const char *, int, const char *,
783 ...) ATTRIBUTE_NORETURN;
784 extern void tree_not_check_failed (const tree, const char *, int, const char *,
785 ...) ATTRIBUTE_NORETURN;
786 extern void tree_class_check_failed (const tree, const enum tree_code_class,
787 const char *, int, const char *)
789 extern void tree_range_check_failed (const tree, const char *, int,
790 const char *, enum tree_code,
792 extern void tree_not_class_check_failed (const tree,
793 const enum tree_code_class,
794 const char *, int, const char *)
796 extern void tree_vec_elt_check_failed (int, int, const char *,
799 extern void phi_node_elt_check_failed (int, int, const char *,
802 extern void tree_operand_check_failed (int, enum tree_code,
803 const char *, int, const char *)
805 extern void omp_clause_check_failed (const tree, const char *, int,
806 const char *, enum omp_clause_code)
808 extern void omp_clause_operand_check_failed (int, tree, const char *,
811 extern void omp_clause_range_check_failed (const tree, const char *, int,
812 const char *, enum omp_clause_code,
813 enum omp_clause_code)
816 #else /* not ENABLE_TREE_CHECKING, or not gcc */
818 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
819 #define TREE_CHECK(T, CODE) (T)
820 #define TREE_NOT_CHECK(T, CODE) (T)
821 #define TREE_CHECK2(T, CODE1, CODE2) (T)
822 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
823 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
824 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
825 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
826 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
827 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
828 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
829 #define TREE_CLASS_CHECK(T, CODE) (T)
830 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
831 #define EXPR_CHECK(T) (T)
832 #define NON_TYPE_CHECK(T) (T)
833 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
834 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
835 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
836 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
837 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
838 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
839 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
840 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
844 #define TREE_BLOCK(NODE) (EXPR_CHECK (NODE)->exp.block)
846 #include "tree-check.h"
848 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
849 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
850 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
851 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
852 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
853 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
854 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
855 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
856 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
857 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
858 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
860 #define RECORD_OR_UNION_CHECK(T) \
861 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
862 #define NOT_RECORD_OR_UNION_CHECK(T) \
863 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
865 #define NUMERICAL_TYPE_CHECK(T) \
866 TREE_CHECK4 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE)
868 /* In all nodes that are expressions, this is the data type of the expression.
869 In POINTER_TYPE nodes, this is the type that the pointer points to.
870 In ARRAY_TYPE nodes, this is the type of the elements.
871 In VECTOR_TYPE nodes, this is the type of the elements. */
872 #define TREE_TYPE(NODE) ((NODE)->common.type)
874 /* Here is how primitive or already-canonicalized types' hash codes
876 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
878 /* A simple hash function for an arbitrary tree node. This must not be
879 used in hash tables which are saved to a PCH. */
880 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
882 /* Nodes are chained together for many purposes.
883 Types are chained together to record them for being output to the debugger
884 (see the function `chain_type').
885 Decls in the same scope are chained together to record the contents
887 Statement nodes for successive statements used to be chained together.
888 Often lists of things are represented by TREE_LIST nodes that
889 are chained together. */
891 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
893 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
894 that don't change the machine mode. */
896 #define STRIP_NOPS(EXP) \
897 while ((TREE_CODE (EXP) == NOP_EXPR \
898 || TREE_CODE (EXP) == CONVERT_EXPR \
899 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
900 && TREE_OPERAND (EXP, 0) != error_mark_node \
901 && (TYPE_MODE (TREE_TYPE (EXP)) \
902 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
903 (EXP) = TREE_OPERAND (EXP, 0)
905 /* Like STRIP_NOPS, but don't let the signedness change either. */
907 #define STRIP_SIGN_NOPS(EXP) \
908 while ((TREE_CODE (EXP) == NOP_EXPR \
909 || TREE_CODE (EXP) == CONVERT_EXPR \
910 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
911 && TREE_OPERAND (EXP, 0) != error_mark_node \
912 && (TYPE_MODE (TREE_TYPE (EXP)) \
913 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
914 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
915 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
916 (EXP) = TREE_OPERAND (EXP, 0)
918 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
920 #define STRIP_TYPE_NOPS(EXP) \
921 while ((TREE_CODE (EXP) == NOP_EXPR \
922 || TREE_CODE (EXP) == CONVERT_EXPR \
923 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
924 && TREE_OPERAND (EXP, 0) != error_mark_node \
925 && (TREE_TYPE (EXP) \
926 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
927 (EXP) = TREE_OPERAND (EXP, 0)
929 /* Remove unnecessary type conversions according to
930 tree_ssa_useless_type_conversion. */
932 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
933 while (tree_ssa_useless_type_conversion (EXP)) \
934 EXP = TREE_OPERAND (EXP, 0)
936 /* Nonzero if TYPE represents an integral type. Note that we do not
937 include COMPLEX types here. Keep these checks in ascending code
940 #define INTEGRAL_TYPE_P(TYPE) \
941 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
942 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
943 || TREE_CODE (TYPE) == INTEGER_TYPE)
945 /* Nonzero if TYPE represents a scalar floating-point type. */
947 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
949 /* Nonzero if TYPE represents a complex floating-point type. */
951 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
952 (TREE_CODE (TYPE) == COMPLEX_TYPE \
953 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
955 /* Nonzero if TYPE represents a vector floating-point type. */
957 #define VECTOR_FLOAT_TYPE_P(TYPE) \
958 (TREE_CODE (TYPE) == VECTOR_TYPE \
959 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
961 /* Nonzero if TYPE represents a floating-point type, including complex
962 and vector floating-point types. The vector and complex check does
963 not use the previous two macros to enable early folding. */
965 #define FLOAT_TYPE_P(TYPE) \
966 (SCALAR_FLOAT_TYPE_P (TYPE) \
967 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
968 || TREE_CODE (TYPE) == VECTOR_TYPE) \
969 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
971 /* Nonzero if TYPE represents a decimal floating-point type. */
972 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
973 (SCALAR_FLOAT_TYPE_P (TYPE) \
974 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
976 /* Nonzero if TYPE represents an aggregate (multi-component) type.
977 Keep these checks in ascending code order. */
979 #define AGGREGATE_TYPE_P(TYPE) \
980 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
981 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
983 /* Nonzero if TYPE represents a pointer or reference type.
984 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
985 ascending code order. */
987 #define POINTER_TYPE_P(TYPE) \
988 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
990 /* Nonzero if this type is a complete type. */
991 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
993 /* Nonzero if this type is the (possibly qualified) void type. */
994 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
996 /* Nonzero if this type is complete or is cv void. */
997 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
998 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1000 /* Nonzero if this type is complete or is an array with unspecified bound. */
1001 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1002 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1005 /* Define many boolean fields that all tree nodes have. */
1007 /* In VAR_DECL nodes, nonzero means address of this is needed.
1008 So it cannot be in a register.
1009 In a FUNCTION_DECL, nonzero means its address is needed.
1010 So it must be compiled even if it is an inline function.
1011 In a FIELD_DECL node, it means that the programmer is permitted to
1012 construct the address of this field. This is used for aliasing
1013 purposes: see record_component_aliases.
1014 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1015 In LABEL_DECL nodes, it means a goto for this label has been seen
1016 from a place outside all binding contours that restore stack levels.
1017 In ..._TYPE nodes, it means that objects of this type must
1018 be fully addressable. This means that pieces of this
1019 object cannot go into register parameters, for example.
1020 In IDENTIFIER_NODEs, this means that some extern decl for this name
1021 had its address taken. That matters for inline functions. */
1022 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
1024 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1025 exit of a function. Calls for which this is true are candidates for tail
1026 call optimizations. */
1027 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
1029 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1030 CASE_LOW operand has been processed. */
1031 #define CASE_LOW_SEEN(NODE) \
1032 (CASE_LABEL_EXPR_CHECK (NODE)->common.addressable_flag)
1034 /* In a VAR_DECL, nonzero means allocate static storage.
1035 In a FUNCTION_DECL, nonzero if function has been defined.
1036 In a CONSTRUCTOR, nonzero means allocate static storage.
1038 ??? This is also used in lots of other nodes in unclear ways which
1039 should be cleaned up some day. */
1040 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
1042 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
1043 should only be executed if an exception is thrown, not on normal exit
1045 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
1047 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1048 CASE_HIGH operand has been processed. */
1049 #define CASE_HIGH_SEEN(NODE) \
1050 (CASE_LABEL_EXPR_CHECK (NODE)->common.static_flag)
1052 /* In an expr node (usually a conversion) this means the node was made
1053 implicitly and should not lead to any sort of warning. In a decl node,
1054 warnings concerning the decl should be suppressed. This is used at
1055 least for used-before-set warnings, and it set after one warning is
1057 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
1059 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
1060 there was an overflow in folding. This is distinct from
1061 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
1062 occur in constant expressions. */
1063 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
1065 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1066 this string as an argument. */
1067 #define TREE_SYMBOL_REFERENCED(NODE) \
1068 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
1070 /* Nonzero in a pointer or reference type means the data pointed to
1071 by this type can alias anything. */
1072 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1073 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
1075 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1076 there was an overflow in folding, and no warning has been issued
1077 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
1078 but not vice versa. */
1080 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->common.public_flag)
1082 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1083 nonzero means name is to be accessible from outside this module.
1084 In an IDENTIFIER_NODE, nonzero means an external declaration
1085 accessible from outside this module was previously seen
1086 for this name in an inner scope. */
1087 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
1089 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1090 of cached values, or is something else. */
1091 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->common.public_flag)
1093 /* In a SAVE_EXPR, indicates that the original expression has already
1094 been substituted with a VAR_DECL that contains the value. */
1095 #define SAVE_EXPR_RESOLVED_P(NODE) \
1096 (TREE_CHECK (NODE, SAVE_EXPR)->common.public_flag)
1098 /* In any expression, decl, or constant, nonzero means it has side effects or
1099 reevaluation of the whole expression could produce a different value.
1100 This is set if any subexpression is a function call, a side effect or a
1101 reference to a volatile variable. In a ..._DECL, this is set only if the
1102 declaration said `volatile'. This will never be set for a constant. */
1103 #define TREE_SIDE_EFFECTS(NODE) \
1104 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
1106 /* In a LABEL_DECL, nonzero means this label had its address taken
1107 and therefore can never be deleted and is a jump target for
1109 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
1111 /* Nonzero means this expression is volatile in the C sense:
1112 its address should be of type `volatile WHATEVER *'.
1113 In other words, the declared item is volatile qualified.
1114 This is used in _DECL nodes and _REF nodes.
1115 On a FUNCTION_DECL node, this means the function does not
1116 return normally. This is the same effect as setting
1117 the attribute noreturn on the function in C.
1119 In a ..._TYPE node, means this type is volatile-qualified.
1120 But use TYPE_VOLATILE instead of this macro when the node is a type,
1121 because eventually we may make that a different bit.
1123 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1124 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
1126 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1127 accessing the memory pointed to won't generate a trap. However,
1128 this only applies to an object when used appropriately: it doesn't
1129 mean that writing a READONLY mem won't trap. Similarly for
1130 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1132 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1133 (or slice of the array) always belongs to the range of the array.
1134 I.e. that the access will not trap, provided that the access to
1135 the base to the array will not trap. */
1136 #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag)
1138 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1139 nonzero means it may not be the lhs of an assignment. */
1140 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
1142 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1143 #define TREE_READONLY_DECL_P(NODE)\
1144 (DECL_P (NODE) && TREE_READONLY (NODE))
1146 /* Value of expression is constant. Always on in all ..._CST nodes. May
1147 also appear in an expression or decl where the value is constant. */
1148 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
1150 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1151 #define TYPE_SIZES_GIMPLIFIED(NODE) (TYPE_CHECK (NODE)->common.constant_flag)
1153 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1154 #define DECL_UNSIGNED(NODE) (DECL_COMMON_CHECK (NODE)->common.unsigned_flag)
1156 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1157 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1158 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
1160 /* In integral and pointer types, means an unsigned type. */
1161 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
1163 /* Nonzero in a VAR_DECL means assembler code has been written.
1164 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1165 This is interesting in an inline function, since it might not need
1166 to be compiled separately.
1167 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1168 if the sdb debugging info for the type has been written.
1169 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1170 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1172 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
1174 /* Nonzero in a _DECL if the name is used in its scope.
1175 Nonzero in an expr node means inhibit warning if value is unused.
1176 In IDENTIFIER_NODEs, this means that some extern decl for this name
1178 In a BLOCK, this means that the block contains variables that are used. */
1179 #define TREE_USED(NODE) ((NODE)->common.used_flag)
1181 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1182 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1183 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
1185 /* In a CALL_EXPR, means that it's safe to use the target of the call
1186 expansion as the return slot for a call that returns in memory. */
1187 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->common.private_flag)
1189 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1190 reference (and the TREE_TYPE is a pointer to the true type). */
1191 #define DECL_BY_REFERENCE(NODE) (DECL_COMMON_CHECK (NODE)->common.private_flag)
1193 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1194 thunked-to function. */
1195 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->common.protected_flag)
1197 /* In a type, nonzero means that all objects of the type are guaranteed by the
1198 language or front-end to be properly aligned, so we can indicate that a MEM
1199 of this type is aligned at least to the alignment of the type, even if it
1200 doesn't appear that it is. We see this, for example, in object-oriented
1201 languages where a tag field may show this is an object of a more-aligned
1202 variant of the more generic type.
1204 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1206 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
1208 /* Used in classes in C++. */
1209 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
1210 /* Used in classes in C++.
1211 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1212 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
1214 /* Nonzero in a _DECL if the use of the name is defined as a
1215 deprecated feature by __attribute__((deprecated)). */
1216 #define TREE_DEPRECATED(NODE) \
1217 ((NODE)->common.deprecated_flag)
1219 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1220 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1221 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1222 (IDENTIFIER_NODE_CHECK (NODE)->common.deprecated_flag)
1224 /* Value of expression is function invariant. A strict subset of
1225 TREE_CONSTANT, such an expression is constant over any one function
1226 invocation, though not across different invocations. May appear in
1227 any expression node. */
1228 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
1230 /* These flags are available for each language front end to use internally. */
1231 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
1232 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
1233 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
1234 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
1235 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
1236 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
1237 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
1239 /* Define additional fields and accessors for nodes representing constants. */
1241 /* In an INTEGER_CST node. These two together make a 2-word integer.
1242 If the data type is signed, the value is sign-extended to 2 words
1243 even though not all of them may really be in use.
1244 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1245 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1246 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1247 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1249 #define INT_CST_LT(A, B) \
1250 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1251 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1252 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1254 #define INT_CST_LT_UNSIGNED(A, B) \
1255 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1256 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1257 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1258 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1259 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1261 struct tree_int_cst GTY(())
1263 struct tree_common common;
1267 /* In a REAL_CST node. struct real_value is an opaque entity, with
1268 manipulators defined in real.h. We don't want tree.h depending on
1269 real.h and transitively on tm.h. */
1272 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1273 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1275 struct tree_real_cst GTY(())
1277 struct tree_common common;
1278 struct real_value * real_cst_ptr;
1281 /* In a STRING_CST */
1282 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1283 #define TREE_STRING_POINTER(NODE) \
1284 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1286 struct tree_string GTY(())
1288 struct tree_common common;
1293 /* In a COMPLEX_CST node. */
1294 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1295 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1297 struct tree_complex GTY(())
1299 struct tree_common common;
1304 /* In a VECTOR_CST node. */
1305 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1307 struct tree_vector GTY(())
1309 struct tree_common common;
1315 /* Define fields and accessors for some special-purpose tree nodes. */
1317 #define IDENTIFIER_LENGTH(NODE) \
1318 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1319 #define IDENTIFIER_POINTER(NODE) \
1320 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1321 #define IDENTIFIER_HASH_VALUE(NODE) \
1322 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1324 /* Translate a hash table identifier pointer to a tree_identifier
1325 pointer, and vice versa. */
1327 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1328 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1329 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1331 struct tree_identifier GTY(())
1333 struct tree_common common;
1334 struct ht_identifier id;
1337 /* In a TREE_LIST node. */
1338 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1339 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1341 struct tree_list GTY(())
1343 struct tree_common common;
1348 /* In a TREE_VEC node. */
1349 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1350 #define TREE_VEC_END(NODE) \
1351 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1353 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1355 struct tree_vec GTY(())
1357 struct tree_common common;
1359 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1362 /* In a CONSTRUCTOR node. */
1363 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1365 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1366 value of each element (stored within VAL). IX must be a scratch variable
1367 of unsigned integer type. */
1368 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1369 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1371 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1375 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1376 the value of each element (stored within VAL) and its index (stored
1377 within INDEX). IX must be a scratch variable of unsigned integer type. */
1378 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1379 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1381 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1382 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1386 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1387 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1389 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1390 _ce___->index = INDEX; \
1391 _ce___->value = VALUE; \
1394 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1395 element. INDEX can optionally design the position of VALUE: in arrays,
1396 it is the index where VALUE has to be placed; in structures, it is the
1397 FIELD_DECL of the member. */
1398 typedef struct constructor_elt_d GTY(())
1404 DEF_VEC_O(constructor_elt);
1405 DEF_VEC_ALLOC_O(constructor_elt,gc);
1407 struct tree_constructor GTY(())
1409 struct tree_common common;
1410 VEC(constructor_elt,gc) *elts;
1413 /* Define fields and accessors for some nodes that represent expressions. */
1415 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1416 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1417 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1418 && integer_zerop (TREE_OPERAND (NODE, 0)))
1420 /* In ordinary expression nodes. */
1421 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1422 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1424 /* In a LOOP_EXPR node. */
1425 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1427 #ifdef USE_MAPPED_LOCATION
1428 /* The source location of this expression. Non-tree_exp nodes such as
1429 decls and constants can be shared among multiple locations, so
1431 #define EXPR_LOCATION(NODE) \
1432 (EXPR_P (NODE) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1433 #define SET_EXPR_LOCATION(NODE, FROM) \
1434 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1435 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1436 /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */
1437 #define EXPR_LOCUS(NODE) \
1438 (EXPR_P (NODE) ? &(NODE)->exp.locus : (location_t *)NULL)
1439 #define SET_EXPR_LOCUS(NODE, FROM) \
1440 do { source_location *loc_tmp = FROM; \
1441 EXPR_CHECK (NODE)->exp.locus \
1442 = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0)
1443 #define EXPR_FILENAME(NODE) \
1444 LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus)
1445 #define EXPR_LINENO(NODE) \
1446 LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
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_LOCUS(NODE) \
1452 (EXPR_P (NODE) ? (NODE)->exp.locus : (location_t *)NULL)
1453 #define SET_EXPR_LOCUS(NODE, FROM) \
1454 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1455 #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM)
1456 #define EXPR_FILENAME(NODE) \
1457 (EXPR_CHECK (NODE)->exp.locus->file)
1458 #define EXPR_LINENO(NODE) \
1459 (EXPR_CHECK (NODE)->exp.locus->line)
1460 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1461 #define EXPR_LOCATION(NODE) \
1462 (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION)
1465 /* In a TARGET_EXPR node. */
1466 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1467 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1468 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1470 /* DECL_EXPR accessor. This gives access to the DECL associated with
1471 the given declaration statement. */
1472 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1474 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1476 /* SWITCH_EXPR accessors. These give access to the condition, body and
1477 original condition type (before any compiler conversions)
1478 of the switch statement, respectively. */
1479 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1480 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1481 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1483 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1484 of a case label, respectively. */
1485 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1486 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1487 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1489 /* The operands of a TARGET_MEM_REF. */
1490 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1491 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1492 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1493 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1494 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1495 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1496 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1498 /* The operands of a BIND_EXPR. */
1499 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1500 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1501 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1503 /* GOTO_EXPR accessor. This gives access to the label associated with
1504 a goto statement. */
1505 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1507 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1508 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1509 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1511 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1512 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1513 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1514 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1515 /* Nonzero if we want to create an ASM_INPUT instead of an
1516 ASM_OPERAND with no operands. */
1517 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1518 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1520 /* COND_EXPR accessors. */
1521 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1522 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1523 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1525 /* LABEL_EXPR accessor. This gives access to the label associated with
1526 the given label expression. */
1527 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1529 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1530 accessors for SSA operands. */
1532 /* CATCH_EXPR accessors. */
1533 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1534 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1536 /* EH_FILTER_EXPR accessors. */
1537 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1538 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1539 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1541 /* OBJ_TYPE_REF accessors. */
1542 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1543 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1544 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1546 /* ASSERT_EXPR accessors. */
1547 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1548 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1550 /* OpenMP directive and clause accessors. */
1552 #define OMP_BODY(NODE) \
1553 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1554 #define OMP_CLAUSES(NODE) \
1555 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1557 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1558 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1559 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1560 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1562 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1563 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1564 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1565 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1566 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1567 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1569 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1570 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1572 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1574 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1575 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1577 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1579 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1581 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1582 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1584 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1585 #define OMP_CLAUSE_DECL(NODE) \
1586 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1587 OMP_CLAUSE_PRIVATE, \
1588 OMP_CLAUSE_COPYPRIVATE), 0)
1590 /* True on an OMP_SECTION statement that was the last lexical member.
1591 This status is meaningful in the implementation of lastprivate. */
1592 #define OMP_SECTION_LAST(NODE) \
1593 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1595 /* True on an OMP_RETURN statement if the return does not require a
1596 thread synchronization via some sort of barrier. The exact barrier
1597 that would otherwise be emitted is dependent on the OMP statement
1598 with which this return is associated. */
1599 #define OMP_RETURN_NOWAIT(NODE) \
1600 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1602 /* True on an OMP_PARALLEL statement if it represents an explicit
1603 combined parallel work-sharing constructs. */
1604 #define OMP_PARALLEL_COMBINED(NODE) \
1605 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1607 /* True on a PRIVATE clause if its decl is kept around for debugging
1608 information only and its DECL_VALUE_EXPR is supposed to point
1609 to what it has been remapped to. */
1610 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1611 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1613 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1614 decl is present in the chain. */
1615 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1616 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1618 #define OMP_CLAUSE_IF_EXPR(NODE) \
1619 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1620 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1621 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1622 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1623 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1625 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1626 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1627 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1628 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1629 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1630 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1631 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1632 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1634 enum omp_clause_schedule_kind
1636 OMP_CLAUSE_SCHEDULE_STATIC,
1637 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1638 OMP_CLAUSE_SCHEDULE_GUIDED,
1639 OMP_CLAUSE_SCHEDULE_RUNTIME
1642 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1643 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1645 enum omp_clause_default_kind
1647 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1648 OMP_CLAUSE_DEFAULT_SHARED,
1649 OMP_CLAUSE_DEFAULT_NONE,
1650 OMP_CLAUSE_DEFAULT_PRIVATE
1653 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1654 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1656 struct tree_exp GTY(())
1658 struct tree_common common;
1662 tree GTY ((special ("tree_exp"),
1663 desc ("TREE_CODE ((tree) &%0)")))
1667 /* SSA_NAME accessors. */
1669 /* Returns the variable being referenced. Once released, this is the
1670 only field that can be relied upon. */
1671 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1673 /* Returns the statement which defines this reference. Note that
1674 we use the same field when chaining SSA_NAME nodes together on
1675 the SSA_NAME freelist. */
1676 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1678 /* Returns the SSA version number of this SSA name. Note that in
1679 tree SSA, version numbers are not per variable and may be recycled. */
1680 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1682 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1683 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1685 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1686 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1688 /* Nonzero if this SSA_NAME expression is currently on the free list of
1689 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1690 has no meaning for an SSA_NAME. */
1691 #define SSA_NAME_IN_FREE_LIST(NODE) \
1692 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1694 /* Attributes for SSA_NAMEs for pointer-type variables. */
1695 #define SSA_NAME_PTR_INFO(N) \
1696 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1698 /* Get the value of this SSA_NAME, if available. */
1699 #define SSA_NAME_VALUE(N) \
1700 SSA_NAME_CHECK (N)->ssa_name.value_handle
1702 #ifndef _TREE_FLOW_H
1703 struct ptr_info_def;
1708 /* Immediate use linking structure. This structure is used for maintaining
1709 a doubly linked list of uses of an SSA_NAME. */
1710 typedef struct ssa_use_operand_d GTY(())
1712 struct ssa_use_operand_d* GTY((skip(""))) prev;
1713 struct ssa_use_operand_d* GTY((skip(""))) next;
1714 tree GTY((skip(""))) stmt;
1715 tree *GTY((skip(""))) use;
1716 } ssa_use_operand_t;
1718 /* Return the immediate_use information for an SSA_NAME. */
1719 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1721 struct tree_ssa_name GTY(())
1723 struct tree_common common;
1725 /* _DECL wrapped by this SSA name. */
1728 /* SSA version number. */
1729 unsigned int version;
1731 /* Pointer attributes used for alias analysis. */
1732 struct ptr_info_def *ptr_info;
1734 /* Value for SSA name used by various passes.
1736 Right now only invariants are allowed to persist beyond a pass in
1737 this field; in the future we will allow VALUE_HANDLEs to persist
1741 /* Immediate uses list for this SSA_NAME. */
1742 struct ssa_use_operand_d imm_uses;
1745 /* In a PHI_NODE node. */
1747 /* These 2 macros should be considered off limits for use by developers. If
1748 you wish to access the use or def fields of a PHI_NODE in the SSA
1749 optimizers, use the accessor macros found in tree-ssa-operands.h.
1750 These two macros are to be used only by those accessor macros, and other
1751 select places where we *absolutely* must take the address of the tree. */
1753 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1754 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1756 /* PHI_NODEs for each basic block are chained together in a single linked
1757 list. The head of the list is linked from the block annotation, and
1758 the link to the next PHI is in PHI_CHAIN. */
1759 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1761 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1762 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1763 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1764 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1765 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1766 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1768 struct phi_arg_d GTY(())
1770 /* imm_use MUST be the first element in struct because we do some
1771 pointer arithmetic with it. See phi_arg_index_from_use. */
1772 struct ssa_use_operand_d imm_use;
1776 struct tree_phi_node GTY(())
1778 struct tree_common common;
1783 /* Basic block to that the phi node belongs. */
1784 struct basic_block_def *bb;
1786 /* Arguments of the PHI node. These are maintained in the same
1787 order as predecessor edge vector BB->PREDS. */
1788 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1791 #define OMP_CLAUSE_CODE(NODE) \
1792 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1794 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1795 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1797 #define OMP_CLAUSE_CODE(NODE) \
1798 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1800 #define OMP_CLAUSE_OPERAND(NODE, I) \
1801 OMP_CLAUSE_ELT_CHECK (NODE, I)
1803 struct tree_omp_clause GTY(())
1805 struct tree_common common;
1806 enum omp_clause_code code;
1807 union omp_clause_subcode {
1808 enum omp_clause_default_kind default_kind;
1809 enum omp_clause_schedule_kind schedule_kind;
1810 enum tree_code reduction_code;
1811 } GTY ((skip)) subcode;
1812 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1816 struct varray_head_tag;
1818 /* In a BLOCK node. */
1819 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1820 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1821 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1822 /* Note: when changing this, make sure to find the places
1823 that use chainon or nreverse. */
1824 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1825 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1826 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1828 /* Nonzero means that this block is prepared to handle exceptions
1829 listed in the BLOCK_VARS slot. */
1830 #define BLOCK_HANDLER_BLOCK(NODE) \
1831 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1833 /* An index number for this block. These values are not guaranteed to
1834 be unique across functions -- whether or not they are depends on
1835 the debugging output format in use. */
1836 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1838 /* If block reordering splits a lexical block into discontiguous
1839 address ranges, we'll make a copy of the original block.
1841 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1842 In that case, we have one source block that has been replicated
1843 (through inlining or unrolling) into many logical blocks, and that
1844 these logical blocks have different physical variables in them.
1846 In this case, we have one logical block split into several
1847 non-contiguous address ranges. Most debug formats can't actually
1848 represent this idea directly, so we fake it by creating multiple
1849 logical blocks with the same variables in them. However, for those
1850 that do support non-contiguous regions, these allow the original
1851 logical block to be reconstructed, along with the set of address
1854 One of the logical block fragments is arbitrarily chosen to be
1855 the ORIGIN. The other fragments will point to the origin via
1856 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1857 be null. The list of fragments will be chained through
1858 BLOCK_FRAGMENT_CHAIN from the origin. */
1860 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1861 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1863 /* For an inlined function, this gives the location where it was called
1864 from. This is only set in the top level block, which corresponds to the
1865 inlined function scope. This is used in the debug output routines. */
1867 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1869 struct tree_block GTY(())
1871 struct tree_common common;
1873 unsigned handler_block_flag : 1;
1874 unsigned abstract_flag : 1;
1875 unsigned block_num : 30;
1880 tree abstract_origin;
1881 tree fragment_origin;
1882 tree fragment_chain;
1886 /* Define fields and accessors for nodes representing data types. */
1888 /* See tree.def for documentation of the use of these fields.
1889 Look at the documentation of the various ..._TYPE tree codes.
1891 Note that the type.values, type.minval, and type.maxval fields are
1892 overloaded and used for different macros in different kinds of types.
1893 Each macro must check to ensure the tree node is of the proper kind of
1894 type. Note also that some of the front-ends also overload these fields,
1895 so they must be checked as well. */
1897 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1898 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1899 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1900 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1901 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1902 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
1903 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
1904 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
1905 #define TYPE_ORIG_SIZE_TYPE(NODE) \
1906 (INTEGER_TYPE_CHECK (NODE)->type.values \
1907 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
1908 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
1909 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
1910 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1911 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1912 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1913 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1914 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1915 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1916 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1917 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1918 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1919 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1920 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1921 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1922 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1923 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1924 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1925 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1926 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1927 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1929 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1930 in the debugging output. We use this to describe a vector as a
1931 structure containing an array. */
1932 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1934 /* For record and union types, information about this type, as a base type
1936 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1938 /* For non record and union types, used in a language-dependent way. */
1939 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1941 /* The (language-specific) typed-based alias set for this type.
1942 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1943 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1944 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1945 type can alias objects of any type. */
1946 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1948 /* Nonzero iff the typed-based alias set for this type has been
1950 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1952 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1954 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1956 /* The alignment necessary for objects of this type.
1957 The value is an int, measured in bits. */
1958 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1960 /* 1 if the alignment for this type was requested by "aligned" attribute,
1961 0 if it is the default for this type. */
1962 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1964 /* The alignment for NODE, in bytes. */
1965 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1967 /* If your language allows you to declare types, and you want debug info
1968 for them, then you need to generate corresponding TYPE_DECL nodes.
1969 These "stub" TYPE_DECL nodes have no name, and simply point at the
1970 type node. You then set the TYPE_STUB_DECL field of the type node
1971 to point back at the TYPE_DECL node. This allows the debug routines
1972 to know that the two nodes represent the same type, so that we only
1973 get one debug info record for them. */
1974 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1976 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1977 has BLKmode only because it lacks the alignment requirement for
1979 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1981 /* In an INTEGER_TYPE, it means the type represents a size. We use
1982 this both for validity checking and to permit optimizations that
1983 are unsafe for other types. Note that the C `size_t' type should
1984 *not* have this flag set. The `size_t' type is simply a typedef
1985 for an ordinary integer type that happens to be the type of an
1986 expression returned by `sizeof'; `size_t' has no special
1987 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1988 always actual sizes. */
1989 #define TYPE_IS_SIZETYPE(NODE) \
1990 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1992 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1993 pointer depressed. */
1994 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1995 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1997 /* Nonzero in a type considered volatile as a whole. */
1998 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
2000 /* Means this type is const-qualified. */
2001 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
2003 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2005 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2007 /* There is a TYPE_QUAL value for each type qualifier. They can be
2008 combined by bitwise-or to form the complete set of qualifiers for a
2011 #define TYPE_UNQUALIFIED 0x0
2012 #define TYPE_QUAL_CONST 0x1
2013 #define TYPE_QUAL_VOLATILE 0x2
2014 #define TYPE_QUAL_RESTRICT 0x4
2016 /* The set of type qualifiers for this type. */
2017 #define TYPE_QUALS(NODE) \
2018 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2019 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2020 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2022 /* These flags are available for each language front end to use internally. */
2023 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2024 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2025 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2026 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2027 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2028 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2029 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2031 /* Used to keep track of visited nodes in tree traversals. This is set to
2032 0 by copy_node and make_node. */
2033 #define TREE_VISITED(NODE) ((NODE)->common.visited)
2035 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2036 that distinguish string from array of char).
2037 If set in a INTEGER_TYPE, indicates a character type. */
2038 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2040 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2041 object of the given ARRAY_TYPE. This allows temporaries to be
2043 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2044 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2046 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2047 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2048 (((unsigned HOST_WIDE_INT) 1) \
2049 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2051 /* Set precision to n when we have 2^n sub-parts of the vector. */
2052 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2053 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2055 /* Indicates that objects of this type must be initialized by calling a
2056 function when they are created. */
2057 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2058 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2060 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2061 the same way that the first union alternative would be passed. */
2062 #define TYPE_TRANSPARENT_UNION(NODE) \
2063 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2065 /* For an ARRAY_TYPE, indicates that it is not permitted to
2066 take the address of a component of the type. */
2067 #define TYPE_NONALIASED_COMPONENT(NODE) \
2068 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2070 /* Indicated that objects of this type should be laid out in as
2071 compact a way as possible. */
2072 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2074 /* Used by type_contains_placeholder_p to avoid recomputation.
2075 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2076 this field directly. */
2077 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2078 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2082 struct tree_type GTY(())
2084 struct tree_common common;
2091 unsigned int precision : 9;
2092 ENUM_BITFIELD(machine_mode) mode : 7;
2094 unsigned string_flag : 1;
2095 unsigned no_force_blk_flag : 1;
2096 unsigned needs_constructing_flag : 1;
2097 unsigned transparent_union_flag : 1;
2098 unsigned packed_flag : 1;
2099 unsigned restrict_flag : 1;
2100 unsigned contains_placeholder_bits : 2;
2102 unsigned lang_flag_0 : 1;
2103 unsigned lang_flag_1 : 1;
2104 unsigned lang_flag_2 : 1;
2105 unsigned lang_flag_3 : 1;
2106 unsigned lang_flag_4 : 1;
2107 unsigned lang_flag_5 : 1;
2108 unsigned lang_flag_6 : 1;
2109 unsigned user_align : 1;
2114 union tree_type_symtab {
2115 int GTY ((tag ("0"))) address;
2116 char * GTY ((tag ("1"))) pointer;
2117 struct die_struct * GTY ((tag ("2"))) die;
2118 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2119 descbits ("2"))) symtab;
2127 HOST_WIDE_INT alias_set;
2128 /* Points to a structure whose details depend on the language in use. */
2129 struct lang_type *lang_specific;
2132 /* Define accessor macros for information about type inheritance
2135 A "basetype" means a particular usage of a data type for inheritance
2136 in another type. Each such basetype usage has its own "binfo"
2137 object to describe it. The binfo object is a TREE_VEC node.
2139 Inheritance is represented by the binfo nodes allocated for a
2140 given type. For example, given types C and D, such that D is
2141 inherited by C, 3 binfo nodes will be allocated: one for describing
2142 the binfo properties of C, similarly one for D, and one for
2143 describing the binfo properties of D as a base type for C.
2144 Thus, given a pointer to class C, one can get a pointer to the binfo
2145 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2147 /* BINFO specific flags. */
2149 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2150 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag)
2152 /* Flags for language dependent use. */
2153 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2154 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2155 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2156 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2157 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2158 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2159 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2161 /* The actual data type node being inherited in this basetype. */
2162 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2164 /* The offset where this basetype appears in its containing type.
2165 BINFO_OFFSET slot holds the offset (in bytes)
2166 from the base of the complete object to the base of the part of the
2167 object that is allocated on behalf of this `type'.
2168 This is always 0 except when there is multiple inheritance. */
2170 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2171 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2173 /* The virtual function table belonging to this basetype. Virtual
2174 function tables provide a mechanism for run-time method dispatching.
2175 The entries of a virtual function table are language-dependent. */
2177 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2179 /* The virtual functions in the virtual function table. This is
2180 a TREE_LIST that is used as an initial approximation for building
2181 a virtual function table for this basetype. */
2182 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2184 /* A vector of binfos for the direct basetypes inherited by this
2187 If this basetype describes type D as inherited in C, and if the
2188 basetypes of D are E and F, then this vector contains binfos for
2189 inheritance of E and F by C. */
2190 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2192 /* The number of basetypes for NODE. */
2193 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2195 /* Accessor macro to get to the Nth base binfo of this binfo. */
2196 #define BINFO_BASE_BINFO(NODE,N) \
2197 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2198 #define BINFO_BASE_ITERATE(NODE,N,B) \
2199 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2200 #define BINFO_BASE_APPEND(NODE,T) \
2201 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2203 /* For a BINFO record describing a virtual base class, i.e., one where
2204 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2205 base. The actual contents are language-dependent. In the C++
2206 front-end this field is an INTEGER_CST giving an offset into the
2207 vtable where the offset to the virtual base can be found. */
2208 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2210 /* Indicates the accesses this binfo has to its bases. The values are
2211 access_public_node, access_protected_node or access_private_node.
2212 If this array is not present, public access is implied. */
2213 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2215 #define BINFO_BASE_ACCESS(NODE,N) \
2216 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2217 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2218 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2220 /* The index in the VTT where this subobject's sub-VTT can be found.
2221 NULL_TREE if there is no sub-VTT. */
2222 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2224 /* The index in the VTT where the vptr for this subobject can be
2225 found. NULL_TREE if there is no secondary vptr in the VTT. */
2226 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2228 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2229 inheriting this base for non-virtual bases. For virtual bases it
2230 points either to the binfo for which this is a primary binfo, or to
2231 the binfo of the most derived type. */
2232 #define BINFO_INHERITANCE_CHAIN(NODE) \
2233 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2235 struct tree_binfo GTY (())
2237 struct tree_common common;
2243 VEC(tree,gc) *base_accesses;
2249 VEC(tree,none) base_binfos;
2253 /* Define fields and accessors for nodes representing declared names. */
2255 /* Nonzero if DECL represents a variable for the SSA passes. */
2256 #define SSA_VAR_P(DECL) \
2257 (TREE_CODE (DECL) == VAR_DECL \
2258 || TREE_CODE (DECL) == PARM_DECL \
2259 || TREE_CODE (DECL) == RESULT_DECL \
2261 || (TREE_CODE (DECL) == SSA_NAME \
2262 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2263 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2264 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2265 || MTAG_P (SSA_NAME_VAR (DECL)))))
2270 /* Enumerate visibility settings. */
2271 #ifndef SYMBOL_VISIBILITY_DEFINED
2272 #define SYMBOL_VISIBILITY_DEFINED
2273 enum symbol_visibility
2276 VISIBILITY_PROTECTED,
2285 /* This is the name of the object as written by the user.
2286 It is an IDENTIFIER_NODE. */
2287 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2289 /* Every ..._DECL node gets a unique number. */
2290 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2292 /* These two fields describe where in the source code the declaration
2293 was. If the declaration appears in several places (as for a C
2294 function that is declared first and then defined later), this
2295 information should refer to the definition. */
2296 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2297 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2298 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2299 #ifdef USE_MAPPED_LOCATION
2300 #define DECL_IS_BUILTIN(DECL) \
2301 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2303 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2306 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2307 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2308 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2309 points to either the FUNCTION_DECL for the containing function,
2310 the RECORD_TYPE or UNION_TYPE for the containing type, or
2311 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2313 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2314 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2315 struct tree_decl_minimal GTY(())
2317 struct tree_common common;
2324 /* When computing aliasing information, we represent the memory pointed-to
2325 by pointers with artificial variables called "memory tags" (MT). There
2326 are two kinds of tags, namely symbol and name:
2328 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2329 represent all the pointed-to locations and variables pointed-to by
2330 the same pointer symbol. Usually, this set is computed using
2331 type-based analysis (i.e., alias set classes), but this may not
2334 Name tags (NMT) are used in flow-sensitive points-to alias
2335 analysis, they represent the variables and memory locations
2336 pointed-to by a specific SSA_NAME pointer.
2338 In general, given a pointer P with a symbol tag SMT, the alias set
2339 of SMT should be the union of all the alias sets of the NMTs of
2340 every SSA_NAME for P. */
2341 struct tree_memory_tag GTY(())
2343 struct tree_decl_minimal common;
2344 unsigned int is_global:1;
2345 unsigned int is_used_alone:1;
2346 unsigned int old_used_alone:1;
2349 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2351 /* This flag is true if a SMT is used as the V_MAY_DEF or VUSE operand
2352 directly, because the access had all of the SMT's aliases pruned
2354 #define SMT_USED_ALONE(NODE) (SYMBOL_MEMORY_TAG_CHECK (NODE)->mtag.is_used_alone)
2356 /* This flag is used to temporarily store the old value of the used alone
2357 flag when updating so we know whether to mark the symbol for
2359 #define SMT_OLD_USED_ALONE(NODE) (SYMBOL_MEMORY_TAG_CHECK (NODE)->mtag.old_used_alone)
2361 struct tree_struct_field_tag GTY(())
2363 struct tree_memory_tag common;
2365 /* Parent variable. */
2368 /* Offset inside structure. */
2369 unsigned HOST_WIDE_INT offset;
2371 /* Size of the field. */
2372 unsigned HOST_WIDE_INT size;
2375 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2376 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2377 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2379 /* For any sort of a ..._DECL node, this points to the original (abstract)
2380 decl node which this decl is an instance of, or else it is NULL indicating
2381 that this decl is not an instance of some other decl. For example,
2382 in a nested declaration of an inline function, this points back to the
2384 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2386 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2387 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2388 #define DECL_ORIGIN(NODE) \
2389 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2391 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2392 inline instance of some original (abstract) decl from an inline function;
2393 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2394 nodes can also have their abstract origin set to themselves. */
2395 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2396 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2398 /* In a DECL this is the field where attributes are stored. */
2399 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2401 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2402 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2403 For a VAR_DECL, holds the initial value.
2404 For a PARM_DECL, not used--default
2405 values for parameters are encoded in the type of the function,
2406 not in the PARM_DECL slot.
2407 For a FIELD_DECL, this is used for enumeration values and the C
2408 frontend uses it for temporarily storing bitwidth of bitfields.
2410 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2411 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2413 /* Holds the size of the datum, in bits, as a tree expression.
2414 Need not be constant. */
2415 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2416 /* Likewise for the size in bytes. */
2417 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2418 /* Holds the alignment required for the datum, in bits. */
2419 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.u1.a.align)
2420 /* The alignment of NODE, in bytes. */
2421 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2422 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2423 DECL_FIELD_OFFSET which are known to be always zero.
2424 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2426 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2427 /* Holds the machine mode corresponding to the declaration of a variable or
2428 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2430 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2432 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2433 operation it is. Note, however, that this field is overloaded, with
2434 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2435 checked before any access to the former. */
2436 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_common.u1.f)
2437 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2438 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2440 /* Nonzero for a given ..._DECL node means that the name of this node should
2441 be ignored for symbolic debug purposes. */
2442 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2444 /* Nonzero for a given ..._DECL node means that this node represents an
2445 "abstract instance" of the given declaration (e.g. in the original
2446 declaration of an inline function). When generating symbolic debugging
2447 information, we mustn't try to generate any address information for nodes
2448 marked as "abstract instances" because we don't actually generate
2449 any code or allocate any data space for such instances. */
2450 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2452 /* Language-specific decl information. */
2453 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2455 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2456 do not allocate storage, and refer to a definition elsewhere. Note that
2457 this does not necessarily imply the entity represented by NODE
2458 has no program source-level definition in this translation unit. For
2459 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2460 DECL_EXTERNAL may be true simultaneously; that can be the case for
2461 a C99 "extern inline" function. */
2462 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2464 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
2466 #define DEFAULT_INIT_PRIORITY 65535
2467 #define MAX_INIT_PRIORITY 65535
2468 #define MAX_RESERVED_INIT_PRIORITY 100
2471 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2472 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2474 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2476 Also set in some languages for variables, etc., outside the normal
2477 lexical scope, such as class instance variables. */
2478 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2480 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2481 Used in FIELD_DECLs for vtable pointers.
2482 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2483 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2485 /* Used to indicate that this DECL represents a compiler-generated entity. */
2486 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2488 /* Additional flags for language-specific uses. */
2489 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2490 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2491 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2492 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2493 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2494 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2495 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2496 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2498 /* Used to indicate an alias set for the memory pointed to by this
2499 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2500 pointer (or reference) type. */
2501 #define DECL_POINTER_ALIAS_SET(NODE) \
2502 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2504 /* Nonzero if an alias set has been assigned to this declaration. */
2505 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2506 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2508 /* Nonzero for a decl which is at file scope. */
2509 #define DECL_FILE_SCOPE_P(EXP) \
2510 (! DECL_CONTEXT (EXP) \
2511 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2513 /* Nonzero for a decl that is decorated using attribute used.
2514 This indicates compiler tools that this decl needs to be preserved. */
2515 #define DECL_PRESERVE_P(DECL) \
2516 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2518 /* For function local variables of COMPLEX type, indicates that the
2519 variable is not aliased, and that all modifications to the variable
2520 have been adjusted so that they are killing assignments. Thus the
2521 variable may now be treated as a GIMPLE register, and use real
2522 instead of virtual ops in SSA form. */
2523 #define DECL_COMPLEX_GIMPLE_REG_P(DECL) \
2524 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2526 /* This is true if DECL is call clobbered in the current function.
2527 The result of this flag should always be the same as
2528 bitmap_bit_p (call_clobbered_vars, DECL_UID (decl)). */
2529 #define DECL_CALL_CLOBBERED(DECL) \
2530 DECL_COMMON_CHECK (DECL)->decl_common.call_clobbered_flag
2532 struct tree_decl_common GTY(())
2534 struct tree_decl_minimal common;
2537 ENUM_BITFIELD(machine_mode) mode : 8;
2539 unsigned nonlocal_flag : 1;
2540 unsigned virtual_flag : 1;
2541 unsigned ignored_flag : 1;
2542 unsigned abstract_flag : 1;
2543 unsigned artificial_flag : 1;
2544 unsigned user_align : 1;
2545 unsigned preserve_flag: 1;
2546 unsigned debug_expr_is_from : 1;
2548 unsigned lang_flag_0 : 1;
2549 unsigned lang_flag_1 : 1;
2550 unsigned lang_flag_2 : 1;
2551 unsigned lang_flag_3 : 1;
2552 unsigned lang_flag_4 : 1;
2553 unsigned lang_flag_5 : 1;
2554 unsigned lang_flag_6 : 1;
2555 unsigned lang_flag_7 : 1;
2557 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2558 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2559 unsigned decl_flag_0 : 1;
2560 /* In FIELD_DECL, this is DECL_PACKED. */
2561 unsigned decl_flag_1 : 1;
2562 /* In FIELD_DECL, this is DECL_BIT_FIELD
2563 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2564 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2565 unsigned decl_flag_2 : 1;
2566 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2567 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2568 unsigned decl_flag_3 : 1;
2569 /* Logically, these two would go in a theoretical base shared by var and
2571 unsigned gimple_reg_flag : 1;
2572 unsigned call_clobbered_flag : 1;
2574 union tree_decl_u1 {
2575 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2576 DECL_FUNCTION_CODE. */
2577 enum built_in_function f;
2578 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2579 is used by language-dependent code. */
2581 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2583 struct tree_decl_u1_a {
2584 unsigned int align : 24;
2585 unsigned int off_align : 8;
2592 tree abstract_origin;
2594 HOST_WIDE_INT pointer_alias_set;
2595 /* Points to a structure whose details depend on the language in use. */
2596 struct lang_decl *lang_specific;
2599 extern tree decl_value_expr_lookup (tree);
2600 extern void decl_value_expr_insert (tree, tree);
2602 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2603 if transformations have made this more complicated than evaluating the
2604 decl itself. This should only be used for debugging; once this field has
2605 been set, the decl itself may not legitimately appear in the function. */
2606 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2607 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2608 #define DECL_VALUE_EXPR(NODE) \
2609 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2610 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2611 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2613 /* Holds the RTL expression for the value of a variable or function.
2614 This value can be evaluated lazily for functions, variables with
2615 static storage duration, and labels. */
2616 #define DECL_RTL(NODE) \
2617 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2618 ? (NODE)->decl_with_rtl.rtl \
2619 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2621 /* Set the DECL_RTL for NODE to RTL. */
2622 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2624 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2625 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2627 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2628 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2630 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2631 NODE1, it will not be set for NODE2; this is a lazy copy. */
2632 #define COPY_DECL_RTL(NODE1, NODE2) \
2633 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2635 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2636 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2638 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2639 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2641 struct tree_decl_with_rtl GTY(())
2643 struct tree_decl_common common;
2647 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2648 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2649 of the structure. */
2650 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2652 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2653 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2654 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2655 natural alignment of the field's type). */
2656 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2658 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2659 if so, the type that was originally specified for it.
2660 TREE_TYPE may have been modified (in finish_struct). */
2661 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2663 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2664 if nonzero, indicates that the field occupies the type. */
2665 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2667 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2668 DECL_FIELD_OFFSET which are known to be always zero.
2669 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2671 #define DECL_OFFSET_ALIGN(NODE) \
2672 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align)
2674 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2675 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2676 (FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align = exact_log2 ((X) & -(X)))
2677 /* 1 if the alignment for this type was requested by "aligned" attribute,
2678 0 if it is the default for this type. */
2680 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2681 which this FIELD_DECL is defined. This information is needed when
2682 writing debugging information about vfield and vbase decls for C++. */
2683 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2685 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2686 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2688 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2690 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2692 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2694 #define DECL_NONADDRESSABLE_P(NODE) \
2695 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2697 struct tree_field_decl GTY(())
2699 struct tree_decl_common common;
2702 tree bit_field_type;
2709 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2710 dense, unique within any one function, and may be used to index arrays.
2711 If the value is -1, then no UID has been assigned. */
2712 #define LABEL_DECL_UID(NODE) \
2713 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2715 /* In LABEL_DECL nodes, nonzero means that an error message about
2716 jumping into such a binding contour has been printed for this label. */
2717 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2719 struct tree_label_decl GTY(())
2721 struct tree_decl_with_rtl common;
2722 /* Java's verifier has some need to store information about labels,
2723 and was using fields that no longer exist on labels.
2724 Once the verifier doesn't need these anymore, they should be removed. */
2728 unsigned int java_field_4;
2732 struct tree_result_decl GTY(())
2734 struct tree_decl_with_rtl common;
2737 struct tree_const_decl GTY(())
2739 struct tree_decl_with_rtl common;
2742 /* For a PARM_DECL, records the data type used to pass the argument,
2743 which may be different from the type seen in the program. */
2744 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2746 /* For PARM_DECL, holds an RTL for the stack slot or register
2747 where the data was actually passed. */
2748 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2750 struct tree_parm_decl GTY(())
2752 struct tree_decl_with_rtl common;
2757 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2758 this variable in a BIND_EXPR. */
2759 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2760 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2762 /* Used to indicate that the linkage status of this DECL is not yet known,
2763 so it should not be output now. */
2764 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2766 /* Nonzero for a given ..._DECL node means that no warnings should be
2767 generated just because this node is unused. */
2768 #define DECL_IN_SYSTEM_HEADER(NODE) \
2769 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2771 /* Used to indicate that this DECL has weak linkage. */
2772 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2774 /* Internal to the gimplifier. Indicates that the value is a formal
2775 temporary controlled by the gimplifier. */
2776 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2777 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2779 /* Used to indicate that the DECL is a dllimport. */
2780 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2782 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2783 based on a variable with a restrict qualified type. If it is,
2784 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2787 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2788 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2789 #define DECL_GET_RESTRICT_BASE(NODE) \
2790 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2791 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2792 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2794 extern tree decl_restrict_base_lookup (tree);
2795 extern void decl_restrict_base_insert (tree, tree);
2797 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2798 not be put out unless it is needed in this translation unit.
2799 Entities like this are shared across translation units (like weak
2800 entities), but are guaranteed to be generated by any translation
2801 unit that needs them, and therefore need not be put out anywhere
2802 where they are not needed. DECL_COMDAT is just a hint to the
2803 back-end; it is up to front-ends which set this flag to ensure
2804 that there will never be any harm, other than bloat, in putting out
2805 something which is DECL_COMDAT. */
2806 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2808 /* A replaceable function is one which may be replaced at link-time
2809 with an entirely different definition, provided that the
2810 replacement has the same type. For example, functions declared
2811 with __attribute__((weak)) on most systems are replaceable.
2813 COMDAT functions are not replaceable, since all definitions of the
2814 function must be equivalent. It is important that COMDAT functions
2815 not be treated as replaceable so that use of C++ template
2816 instantiations is not penalized.
2818 For example, DECL_REPLACEABLE is used to determine whether or not a
2819 function (including a template instantiation) which is not
2820 explicitly declared "inline" can be inlined. If the function is
2821 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2822 implementation chosen at link-time may be different. However, a
2823 function that is not DECL_REPLACEABLE can be inlined, since all
2824 versions of the function will be functionally identical. */
2825 #define DECL_REPLACEABLE_P(NODE) \
2826 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2828 /* The name of the object as the assembler will see it (but before any
2829 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2830 as DECL_NAME. It is an IDENTIFIER_NODE. */
2831 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2833 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2834 This is true of all DECL nodes except FIELD_DECL. */
2835 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2836 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2838 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2839 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2841 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2842 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2844 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2845 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2846 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2848 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2849 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2850 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2851 semantics of using this macro, are different than saying:
2853 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2855 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2857 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2858 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2859 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2860 DECL_ASSEMBLER_NAME (DECL1)) \
2863 /* Records the section name in a section attribute. Used to pass
2864 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2865 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2867 /* Value of the decls's visibility attribute */
2868 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2870 /* Nonzero means that the decl had its visibility specified rather than
2872 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2874 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2875 multiple translation units should be merged. */
2876 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
2878 struct tree_decl_with_vis GTY(())
2880 struct tree_decl_with_rtl common;
2881 tree assembler_name;
2884 /* Belong to VAR_DECL exclusively. */
2885 unsigned defer_output:1;
2886 unsigned hard_register:1;
2887 unsigned thread_local:1;
2888 unsigned common_flag:1;
2889 unsigned in_text_section : 1;
2890 unsigned gimple_formal_temp : 1;
2891 unsigned dllimport_flag : 1;
2892 unsigned based_on_restrict_p : 1;
2893 /* Used by C++. Might become a generic decl flag. */
2894 unsigned shadowed_for_var_p : 1;
2896 /* Don't belong to VAR_DECL exclusively. */
2897 unsigned in_system_header_flag : 1;
2898 unsigned weak_flag:1;
2899 unsigned seen_in_bind_expr : 1;
2900 unsigned comdat_flag : 1;
2901 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2902 unsigned visibility_specified : 1;
2903 /* Belong to FUNCTION_DECL exclusively. */
2904 unsigned one_only : 1;
2905 unsigned init_priority_p:1;
2907 /* Belongs to VAR_DECL exclusively. */
2908 ENUM_BITFIELD(tls_model) tls_model : 3;
2909 /* 11 unused bits. */
2912 /* In a VAR_DECL that's static,
2913 nonzero if the space is in the text section. */
2914 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2916 /* Nonzero for a given ..._DECL node means that this node should be
2917 put in .common, if possible. If a DECL_INITIAL is given, and it
2918 is not error_mark_node, then the decl cannot be put in .common. */
2919 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2921 /* In a VAR_DECL, nonzero if the decl is a register variable with
2922 an explicit asm specification. */
2923 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2925 extern tree decl_debug_expr_lookup (tree);
2926 extern void decl_debug_expr_insert (tree, tree);
2927 /* For VAR_DECL, this is set to either an expression that it was split
2928 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
2929 subexpressions that it was split into. */
2930 #define DECL_DEBUG_EXPR(NODE) \
2931 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2933 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2934 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2937 extern unsigned short decl_init_priority_lookup (tree);
2938 extern void decl_init_priority_insert (tree, unsigned short);
2940 /* In a non-local VAR_DECL with static storage duration, this is the
2941 initialization priority. If this value is zero, the NODE will be
2942 initialized at the DEFAULT_INIT_PRIORITY. Only used by C++ FE*/
2944 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2945 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2946 #define DECL_INIT_PRIORITY(NODE) \
2947 (decl_init_priority_lookup (VAR_DECL_CHECK (NODE)))
2948 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2949 (decl_init_priority_insert (VAR_DECL_CHECK (NODE), VAL))
2951 /* In a VAR_DECL, the model to use if the data should be allocated from
2952 thread-local storage. */
2953 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2955 /* In a VAR_DECL, nonzero if the data should be allocated from
2956 thread-local storage. */
2957 #define DECL_THREAD_LOCAL_P(NODE) \
2958 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
2960 struct tree_var_decl GTY(())
2962 struct tree_decl_with_vis common;
2966 /* This field is used to reference anything in decl.result and is meant only
2967 for use by the garbage collector. */
2968 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2970 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2971 Before the struct containing the FUNCTION_DECL is laid out,
2972 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2973 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2974 function. When the class is laid out, this pointer is changed
2975 to an INTEGER_CST node which is suitable for use as an index
2976 into the virtual function table.
2977 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
2978 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2980 struct tree_decl_non_common GTY(())
2983 struct tree_decl_with_vis common;
2984 /* C++ uses this in namespaces. */
2986 /* C++ uses this in templates. */
2988 /* Almost all FE's use this. */
2990 /* C++ uses this in namespaces. */
2994 /* In FUNCTION_DECL, holds the decl for the return value. */
2995 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2997 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2998 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3000 /* In a FUNCTION_DECL, the saved representation of the body of the
3002 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3004 /* Nonzero in a FUNCTION_DECL means this function should be treated
3005 as if it were a malloc, meaning it returns a pointer that is
3007 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3009 /* Nonzero in a FUNCTION_DECL means this function may return more
3011 #define DECL_IS_RETURNS_TWICE(NODE) \
3012 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3014 /* Nonzero in a FUNCTION_DECL means this function should be treated
3015 as "pure" function (like const function, but may read global memory). */
3016 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3018 /* Nonzero in a FUNCTION_DECL means this function should be treated
3019 as "novops" function (function that does not read global memory,
3020 but may have arbitrary side effects). */
3021 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3023 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3024 at the beginning or end of execution. */
3025 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3026 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3028 #define DECL_STATIC_DESTRUCTOR(NODE) \
3029 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3031 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3032 be instrumented with calls to support routines. */
3033 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3034 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3036 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3037 disabled in this function. */
3038 #define DECL_NO_LIMIT_STACK(NODE) \
3039 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3041 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3042 static chain is not needed. */
3043 #define DECL_NO_STATIC_CHAIN(NODE) \
3044 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3046 /* Nonzero for a decl that cgraph has decided should be inlined into
3047 at least one call site. It is not meaningful to look at this
3048 directly; always use cgraph_function_possibly_inlined_p. */
3049 #define DECL_POSSIBLY_INLINED(DECL) \
3050 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3052 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3053 where it is called. */
3054 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3056 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3057 such as via the `inline' keyword in C/C++. This flag controls the linkage
3058 semantics of 'inline'; whether or not the function is inlined is
3059 controlled by DECL_INLINE. */
3060 #define DECL_DECLARED_INLINE_P(NODE) \
3061 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3063 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3064 that describes the status of this function. */
3065 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3067 /* In a FUNCTION_DECL, nonzero means a built in function. */
3068 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3070 /* For a builtin function, identify which part of the compiler defined it. */
3071 #define DECL_BUILT_IN_CLASS(NODE) \
3072 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3074 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3075 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3077 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3078 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3080 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3081 arguments/result/saved_tree fields by front ends. It was either inherit
3082 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3083 which seemed a bit strange. */
3085 struct tree_function_decl GTY(())
3087 struct tree_decl_non_common common;
3089 unsigned static_ctor_flag : 1;
3090 unsigned static_dtor_flag : 1;
3091 unsigned uninlinable : 1;
3092 unsigned possibly_inlined : 1;
3093 unsigned novops_flag : 1;
3094 unsigned returns_twice_flag : 1;
3095 unsigned malloc_flag : 1;
3096 unsigned pure_flag : 1;
3098 unsigned declared_inline_flag : 1;
3099 unsigned regdecl_flag : 1;
3100 unsigned inline_flag : 1;
3101 unsigned no_instrument_function_entry_exit : 1;
3102 unsigned no_limit_stack : 1;
3103 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3108 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3109 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3111 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3112 into stabs. Instead it will generate cross reference ('x') of names.
3113 This uses the same flag as DECL_EXTERNAL. */
3114 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3115 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3117 struct tree_type_decl GTY(())
3119 struct tree_decl_non_common common;
3123 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3124 To reduce overhead, the nodes containing the statements are not trees.
3125 This avoids the overhead of tree_common on all linked list elements.
3127 Use the interface in tree-iterator.h to access this node. */
3129 #define STATEMENT_LIST_HEAD(NODE) \
3130 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3131 #define STATEMENT_LIST_TAIL(NODE) \
3132 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3134 struct tree_statement_list_node
3135 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3137 struct tree_statement_list_node *prev;
3138 struct tree_statement_list_node *next;
3142 struct tree_statement_list
3145 struct tree_common common;
3146 struct tree_statement_list_node *head;
3147 struct tree_statement_list_node *tail;
3150 #define VALUE_HANDLE_ID(NODE) \
3151 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3153 #define VALUE_HANDLE_EXPR_SET(NODE) \
3154 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3156 #define VALUE_HANDLE_VUSES(NODE) \
3157 (VALUE_HANDLE_CHECK (NODE)->value_handle.vuses)
3159 /* Defined and used in tree-ssa-pre.c. */
3162 struct tree_value_handle GTY(())
3164 struct tree_common common;
3166 /* The set of expressions represented by this handle. */
3167 struct value_set * GTY ((skip)) expr_set;
3169 /* Unique ID for this value handle. IDs are handed out in a
3170 conveniently dense form starting at 0, so that we can make
3171 bitmaps of value handles. */
3174 /* Set of virtual uses represented by this handle. */
3175 VEC (tree, gc) *vuses;
3178 /* Define the overall contents of a tree node.
3179 It may be any of the structures declared above
3180 for various types of node. */
3182 union tree_node GTY ((ptr_alias (union lang_tree_node),
3183 desc ("tree_node_structure (&%h)")))
3185 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3186 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3187 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3188 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3189 struct tree_string GTY ((tag ("TS_STRING"))) string;
3190 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3191 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3192 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3193 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3194 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3195 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3196 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3197 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3198 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3199 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3200 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3201 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3202 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3203 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3204 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3205 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3206 struct tree_list GTY ((tag ("TS_LIST"))) list;
3207 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3208 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3209 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3210 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3211 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3212 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3213 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3214 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3215 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3216 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3217 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3218 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3221 /* Standard named or nameless data types of the C compiler. */
3240 TI_INTEGER_MINUS_ONE,
3257 TI_COMPLEX_INTEGER_TYPE,
3258 TI_COMPLEX_FLOAT_TYPE,
3259 TI_COMPLEX_DOUBLE_TYPE,
3260 TI_COMPLEX_LONG_DOUBLE_TYPE,
3264 TI_LONG_DOUBLE_TYPE,
3268 TI_LONG_DOUBLE_PTR_TYPE,
3269 TI_INTEGER_PTR_TYPE,
3278 TI_VA_LIST_GPR_COUNTER_FIELD,
3279 TI_VA_LIST_FPR_COUNTER_FIELD,
3286 TI_DFLOAT32_PTR_TYPE,
3287 TI_DFLOAT64_PTR_TYPE,
3288 TI_DFLOAT128_PTR_TYPE,
3297 extern GTY(()) tree global_trees[TI_MAX];
3299 #define error_mark_node global_trees[TI_ERROR_MARK]
3301 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3302 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3303 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3304 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3305 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3307 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3308 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3309 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3310 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3311 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3313 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3314 #define integer_one_node global_trees[TI_INTEGER_ONE]
3315 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3316 #define size_zero_node global_trees[TI_SIZE_ZERO]
3317 #define size_one_node global_trees[TI_SIZE_ONE]
3318 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3319 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3320 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3322 /* Base access nodes. */
3323 #define access_public_node global_trees[TI_PUBLIC]
3324 #define access_protected_node global_trees[TI_PROTECTED]
3325 #define access_private_node global_trees[TI_PRIVATE]
3327 #define null_pointer_node global_trees[TI_NULL_POINTER]
3329 #define float_type_node global_trees[TI_FLOAT_TYPE]
3330 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3331 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3333 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3334 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3335 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3336 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3338 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3339 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3340 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3341 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3343 #define void_type_node global_trees[TI_VOID_TYPE]
3344 /* The C type `void *'. */
3345 #define ptr_type_node global_trees[TI_PTR_TYPE]
3346 /* The C type `const void *'. */
3347 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3348 /* The C type `size_t'. */
3349 #define size_type_node global_trees[TI_SIZE_TYPE]
3350 #define pid_type_node global_trees[TI_PID_TYPE]
3351 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3352 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3353 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3354 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3355 /* The C type `FILE *'. */
3356 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3358 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3359 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3360 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3362 /* The decimal floating point types. */
3363 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3364 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3365 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3366 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3367 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3368 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3370 /* The node that should be placed at the end of a parameter list to
3371 indicate that the function does not take a variable number of
3372 arguments. The TREE_VALUE will be void_type_node and there will be
3373 no TREE_CHAIN. Language-independent code should not assume
3374 anything else about this node. */
3375 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3377 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3378 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3380 /* An enumeration of the standard C integer types. These must be
3381 ordered so that shorter types appear before longer ones, and so
3382 that signed types appear before unsigned ones, for the correct
3383 functioning of interpret_integer() in c-lex.c. */
3384 enum integer_type_kind
3396 itk_unsigned_long_long,
3400 typedef enum integer_type_kind integer_type_kind;
3402 /* The standard C integer types. Use integer_type_kind to index into
3404 extern GTY(()) tree integer_types[itk_none];
3406 #define char_type_node integer_types[itk_char]
3407 #define signed_char_type_node integer_types[itk_signed_char]
3408 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3409 #define short_integer_type_node integer_types[itk_short]
3410 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3411 #define integer_type_node integer_types[itk_int]
3412 #define unsigned_type_node integer_types[itk_unsigned_int]
3413 #define long_integer_type_node integer_types[itk_long]
3414 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3415 #define long_long_integer_type_node integer_types[itk_long_long]
3416 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3418 /* Set to the default thread-local storage (tls) model to use. */
3420 extern enum tls_model flag_tls_default;
3423 /* A pointer-to-function member type looks like:
3430 If __pfn is NULL, it is a NULL pointer-to-member-function.
3432 (Because the vtable is always the first thing in the object, we
3433 don't need its offset.) If the function is virtual, then PFN is
3434 one plus twice the index into the vtable; otherwise, it is just a
3435 pointer to the function.
3437 Unfortunately, using the lowest bit of PFN doesn't work in
3438 architectures that don't impose alignment requirements on function
3439 addresses, or that use the lowest bit to tell one ISA from another,
3440 for example. For such architectures, we use the lowest bit of
3441 DELTA instead of the lowest bit of the PFN, and DELTA will be
3444 enum ptrmemfunc_vbit_where_t
3446 ptrmemfunc_vbit_in_pfn,
3447 ptrmemfunc_vbit_in_delta
3450 #define NULL_TREE (tree) NULL
3452 extern tree decl_assembler_name (tree);
3454 /* Compute the number of bytes occupied by 'node'. This routine only
3455 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3457 extern size_t tree_size (tree);
3459 /* Compute the number of bytes occupied by a tree with code CODE. This
3460 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3462 extern size_t tree_code_size (enum tree_code);
3464 /* Lowest level primitive for allocating a node.
3465 The TREE_CODE is the only argument. Contents are initialized
3466 to zero except for a few of the common fields. */
3468 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3469 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3471 /* Make a copy of a node, with all the same contents. */
3473 extern tree copy_node_stat (tree MEM_STAT_DECL);
3474 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3476 /* Make a copy of a chain of TREE_LIST nodes. */
3478 extern tree copy_list (tree);
3481 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3482 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3484 /* Make a TREE_VEC. */
3486 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3487 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3489 /* Tree nodes for SSA analysis. */
3491 extern void init_phinodes (void);
3492 extern void fini_phinodes (void);
3493 extern void release_phi_node (tree);
3494 #ifdef GATHER_STATISTICS
3495 extern void phinodes_print_statistics (void);
3498 extern void init_ssanames (void);
3499 extern void fini_ssanames (void);
3500 extern tree make_ssa_name (tree, tree);
3501 extern tree duplicate_ssa_name (tree, tree);
3502 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3503 extern void release_ssa_name (tree);
3504 extern void release_defs (tree);
3505 extern void replace_ssa_name_symbol (tree, tree);
3507 #ifdef GATHER_STATISTICS
3508 extern void ssanames_print_statistics (void);
3511 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3512 The name is supplied as a char *. */
3514 extern tree get_identifier (const char *);
3516 #if GCC_VERSION >= 3000
3517 #define get_identifier(str) \
3518 (__builtin_constant_p (str) \
3519 ? get_identifier_with_length ((str), strlen (str)) \
3520 : get_identifier (str))
3524 /* Identical to get_identifier, except that the length is assumed
3527 extern tree get_identifier_with_length (const char *, size_t);
3529 /* If an identifier with the name TEXT (a null-terminated string) has
3530 previously been referred to, return that node; otherwise return
3533 extern tree maybe_get_identifier (const char *);
3535 /* Construct various types of nodes. */
3537 extern tree build_nt (enum tree_code, ...);
3539 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3540 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3541 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3542 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3543 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3544 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3545 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3546 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3547 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3548 tree MEM_STAT_DECL);
3549 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3550 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3551 tree MEM_STAT_DECL);
3552 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3553 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3554 tree, tree, tree MEM_STAT_DECL);
3555 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3556 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3558 extern tree build_int_cst (tree, HOST_WIDE_INT);
3559 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3560 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3561 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3562 extern tree build_vector (tree, tree);
3563 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3564 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3565 extern tree build_constructor_single (tree, tree, tree);
3566 extern tree build_constructor_from_list (tree, tree);
3567 extern tree build_real_from_int_cst (tree, tree);
3568 extern tree build_complex (tree, tree, tree);
3569 extern tree build_one_cst (tree);
3570 extern tree build_string (int, const char *);
3571 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3572 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3573 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3574 extern tree build_fn_decl (const char *, tree);
3575 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3576 extern tree build_block (tree, tree, tree, tree);
3577 #ifndef USE_MAPPED_LOCATION
3578 extern void annotate_with_file_line (tree, const char *, int);
3579 extern void annotate_with_locus (tree, location_t);
3581 extern tree build_empty_stmt (void);
3582 extern tree build_omp_clause (enum omp_clause_code);
3584 /* Construct various nodes representing data types. */
3586 extern tree make_signed_type (int);
3587 extern tree make_unsigned_type (int);
3588 extern tree signed_type_for (tree);
3589 extern tree unsigned_type_for (tree);
3590 extern void initialize_sizetypes (bool);
3591 extern void set_sizetype (tree);
3592 extern void fixup_unsigned_type (tree);
3593 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3594 extern tree build_pointer_type (tree);
3595 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3596 extern tree build_reference_type (tree);
3597 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3598 extern tree build_vector_type (tree innertype, int nunits);
3599 extern tree build_type_no_quals (tree);
3600 extern tree build_index_type (tree);
3601 extern tree build_index_2_type (tree, tree);
3602 extern tree build_array_type (tree, tree);
3603 extern tree build_function_type (tree, tree);
3604 extern tree build_function_type_list (tree, ...);
3605 extern tree build_method_type_directly (tree, tree, tree);
3606 extern tree build_method_type (tree, tree);
3607 extern tree build_offset_type (tree, tree);
3608 extern tree build_complex_type (tree);
3609 extern tree build_resx (int);
3610 extern tree array_type_nelts (tree);
3611 extern bool in_array_bounds_p (tree);
3612 extern bool range_in_array_bounds_p (tree);
3614 extern tree value_member (tree, tree);
3615 extern tree purpose_member (tree, tree);
3617 extern int attribute_list_equal (tree, tree);
3618 extern int attribute_list_contained (tree, tree);
3619 extern int tree_int_cst_equal (tree, tree);
3620 extern int tree_int_cst_lt (tree, tree);
3621 extern int tree_int_cst_compare (tree, tree);
3622 extern int host_integerp (tree, int);
3623 extern HOST_WIDE_INT tree_low_cst (tree, int);
3624 extern int tree_int_cst_msb (tree);
3625 extern int tree_int_cst_sgn (tree);
3626 extern int tree_int_cst_sign_bit (tree);
3627 extern int tree_expr_nonnegative_p (tree);
3628 extern int tree_expr_nonnegative_warnv_p (tree, bool *);
3629 extern bool may_negate_without_overflow_p (tree);
3630 extern tree get_inner_array_type (tree);
3632 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3633 put the prototype here. Rtl.h does declare the prototype if
3634 tree.h had been included. */
3636 extern tree make_tree (tree, rtx);
3638 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3641 Such modified types already made are recorded so that duplicates
3644 extern tree build_type_attribute_variant (tree, tree);
3645 extern tree build_decl_attribute_variant (tree, tree);
3647 /* Structure describing an attribute and a function to handle it. */
3648 struct attribute_spec
3650 /* The name of the attribute (without any leading or trailing __),
3651 or NULL to mark the end of a table of attributes. */
3652 const char *const name;
3653 /* The minimum length of the list of arguments of the attribute. */
3654 const int min_length;
3655 /* The maximum length of the list of arguments of the attribute
3656 (-1 for no maximum). */
3657 const int max_length;
3658 /* Whether this attribute requires a DECL. If it does, it will be passed
3659 from types of DECLs, function return types and array element types to
3660 the DECLs, function types and array types respectively; but when
3661 applied to a type in any other circumstances, it will be ignored with
3662 a warning. (If greater control is desired for a given attribute,
3663 this should be false, and the flags argument to the handler may be
3664 used to gain greater control in that case.) */
3665 const bool decl_required;
3666 /* Whether this attribute requires a type. If it does, it will be passed
3667 from a DECL to the type of that DECL. */
3668 const bool type_required;
3669 /* Whether this attribute requires a function (or method) type. If it does,
3670 it will be passed from a function pointer type to the target type,
3671 and from a function return type (which is not itself a function
3672 pointer type) to the function type. */
3673 const bool function_type_required;
3674 /* Function to handle this attribute. NODE points to the node to which
3675 the attribute is to be applied. If a DECL, it should be modified in
3676 place; if a TYPE, a copy should be created. NAME is the name of the
3677 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3678 of the arguments (which may be NULL). FLAGS gives further information
3679 about the context of the attribute. Afterwards, the attributes will
3680 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3681 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3682 as well as in any other cases when the attributes should not be added
3683 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3684 applied to another type or DECL later may be returned;
3685 otherwise the return value should be NULL_TREE. This pointer may be
3686 NULL if no special handling is required beyond the checks implied
3687 by the rest of this structure. */
3688 tree (*const handler) (tree *node, tree name, tree args,
3689 int flags, bool *no_add_attrs);
3692 /* Flags that may be passed in the third argument of decl_attributes, and
3693 to handler functions for attributes. */
3694 enum attribute_flags
3696 /* The type passed in is the type of a DECL, and any attributes that
3697 should be passed in again to be applied to the DECL rather than the
3698 type should be returned. */
3699 ATTR_FLAG_DECL_NEXT = 1,
3700 /* The type passed in is a function return type, and any attributes that
3701 should be passed in again to be applied to the function type rather
3702 than the return type should be returned. */
3703 ATTR_FLAG_FUNCTION_NEXT = 2,
3704 /* The type passed in is an array element type, and any attributes that
3705 should be passed in again to be applied to the array type rather
3706 than the element type should be returned. */
3707 ATTR_FLAG_ARRAY_NEXT = 4,
3708 /* The type passed in is a structure, union or enumeration type being
3709 created, and should be modified in place. */
3710 ATTR_FLAG_TYPE_IN_PLACE = 8,
3711 /* The attributes are being applied by default to a library function whose
3712 name indicates known behavior, and should be silently ignored if they
3713 are not in fact compatible with the function type. */
3714 ATTR_FLAG_BUILT_IN = 16
3717 /* Default versions of target-overridable functions. */
3719 extern tree merge_decl_attributes (tree, tree);
3720 extern tree merge_type_attributes (tree, tree);
3722 /* Given a tree node and a string, return nonzero if the tree node is
3723 a valid attribute name for the string. */
3725 extern int is_attribute_p (const char *, tree);
3727 /* Given an attribute name and a list of attributes, return the list element
3728 of the attribute or NULL_TREE if not found. */
3730 extern tree lookup_attribute (const char *, tree);
3732 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3735 extern tree remove_attribute (const char *, tree);
3737 /* Given two attributes lists, return a list of their union. */
3739 extern tree merge_attributes (tree, tree);
3741 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3742 /* Given two Windows decl attributes lists, possibly including
3743 dllimport, return a list of their union . */
3744 extern tree merge_dllimport_decl_attributes (tree, tree);
3746 /* Handle a "dllimport" or "dllexport" attribute. */
3747 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3750 /* Check whether CAND is suitable to be returned from get_qualified_type
3751 (BASE, TYPE_QUALS). */
3753 extern bool check_qualified_type (tree, tree, int);
3755 /* Return a version of the TYPE, qualified as indicated by the
3756 TYPE_QUALS, if one exists. If no qualified version exists yet,
3757 return NULL_TREE. */
3759 extern tree get_qualified_type (tree, int);
3761 /* Like get_qualified_type, but creates the type if it does not
3762 exist. This function never returns NULL_TREE. */
3764 extern tree build_qualified_type (tree, int);
3766 /* Like build_qualified_type, but only deals with the `const' and
3767 `volatile' qualifiers. This interface is retained for backwards
3768 compatibility with the various front-ends; new code should use
3769 build_qualified_type instead. */
3771 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3772 build_qualified_type ((TYPE), \
3773 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3774 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3776 /* Make a copy of a type node. */
3778 extern tree build_distinct_type_copy (tree);
3779 extern tree build_variant_type_copy (tree);
3781 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3782 fields. Optionally specify an alignment, and then lay it out. */
3784 extern void finish_builtin_struct (tree, const char *,
3787 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3788 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3789 node, does nothing except for the first time. */
3791 extern void layout_type (tree);
3793 /* These functions allow a front-end to perform a manual layout of a
3794 RECORD_TYPE. (For instance, if the placement of subsequent fields
3795 depends on the placement of fields so far.) Begin by calling
3796 start_record_layout. Then, call place_field for each of the
3797 fields. Then, call finish_record_layout. See layout_type for the
3798 default way in which these functions are used. */
3800 typedef struct record_layout_info_s
3802 /* The RECORD_TYPE that we are laying out. */
3804 /* The offset into the record so far, in bytes, not including bits in
3807 /* The last known alignment of SIZE. */
3808 unsigned int offset_align;
3809 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3811 /* The alignment of the record so far, in bits. */
3812 unsigned int record_align;
3813 /* The alignment of the record so far, ignoring #pragma pack and
3814 __attribute__ ((packed)), in bits. */
3815 unsigned int unpacked_align;
3816 /* The previous field layed out. */
3818 /* The static variables (i.e., class variables, as opposed to
3819 instance variables) encountered in T. */
3820 tree pending_statics;
3821 /* Bits remaining in the current alignment group */
3822 int remaining_in_alignment;
3823 /* True if we've seen a packed field that didn't have normal
3824 alignment anyway. */
3825 int packed_maybe_necessary;
3826 } *record_layout_info;
3828 extern void set_lang_adjust_rli (void (*) (record_layout_info));
3829 extern record_layout_info start_record_layout (tree);
3830 extern tree bit_from_pos (tree, tree);
3831 extern tree byte_from_pos (tree, tree);
3832 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
3833 extern void normalize_offset (tree *, tree *, unsigned int);
3834 extern tree rli_size_unit_so_far (record_layout_info);
3835 extern tree rli_size_so_far (record_layout_info);
3836 extern void normalize_rli (record_layout_info);
3837 extern void place_field (record_layout_info, tree);
3838 extern void compute_record_mode (tree);
3839 extern void finish_record_layout (record_layout_info, int);
3841 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3842 return a canonicalized ..._TYPE node, so that duplicates are not made.
3843 How the hash code is computed is up to the caller, as long as any two
3844 callers that could hash identical-looking type nodes agree. */
3846 extern tree type_hash_canon (unsigned int, tree);
3848 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3849 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3850 fields. Call this only once for any given decl node.
3852 Second argument is the boundary that this field can be assumed to
3853 be starting at (in bits). Zero means it can be assumed aligned
3854 on any boundary that may be needed. */
3856 extern void layout_decl (tree, unsigned);
3858 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3859 a previous call to layout_decl and calls it again. */
3861 extern void relayout_decl (tree);
3863 /* Return the mode for data of a given size SIZE and mode class CLASS.
3864 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3865 The value is BLKmode if no other mode is found. This is like
3866 mode_for_size, but is passed a tree. */
3868 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
3870 /* Return an expr equal to X but certainly not valid as an lvalue. */
3872 extern tree non_lvalue (tree);
3874 extern tree convert (tree, tree);
3875 extern unsigned int expr_align (tree);
3876 extern tree expr_first (tree);
3877 extern tree expr_last (tree);
3878 extern tree expr_only (tree);
3879 extern tree size_in_bytes (tree);
3880 extern HOST_WIDE_INT int_size_in_bytes (tree);
3881 extern HOST_WIDE_INT max_int_size_in_bytes (tree);
3882 extern tree bit_position (tree);
3883 extern HOST_WIDE_INT int_bit_position (tree);
3884 extern tree byte_position (tree);
3885 extern HOST_WIDE_INT int_byte_position (tree);
3887 /* Define data structures, macros, and functions for handling sizes
3888 and the various types used to represent sizes. */
3892 SIZETYPE, /* Normal representation of sizes in bytes. */
3893 SSIZETYPE, /* Signed representation of sizes in bytes. */
3894 BITSIZETYPE, /* Normal representation of sizes in bits. */
3895 SBITSIZETYPE, /* Signed representation of sizes in bits. */
3898 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
3900 #define sizetype sizetype_tab[(int) SIZETYPE]
3901 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
3902 #define ssizetype sizetype_tab[(int) SSIZETYPE]
3903 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
3905 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
3906 extern tree size_binop (enum tree_code, tree, tree);
3907 extern tree size_diffop (tree, tree);
3909 #define size_int(L) size_int_kind (L, SIZETYPE)
3910 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
3911 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
3912 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
3914 extern tree round_up (tree, int);
3915 extern tree round_down (tree, int);
3916 extern tree get_pending_sizes (void);
3917 extern void put_pending_size (tree);
3918 extern void put_pending_sizes (tree);
3920 /* Type for sizes of data-type. */
3922 #define BITS_PER_UNIT_LOG \
3923 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3924 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3925 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3927 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
3928 extern unsigned int maximum_field_alignment;
3929 /* and its original value in bytes, specified via -fpack-struct=<value>. */
3930 extern unsigned int initial_max_fld_align;
3932 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3933 by making the last node in X point to Y.
3934 Returns X, except if X is 0 returns Y. */
3936 extern tree chainon (tree, tree);
3938 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3940 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3941 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3943 /* Return the last tree node in a chain. */
3945 extern tree tree_last (tree);
3947 /* Reverse the order of elements in a chain, and return the new head. */
3949 extern tree nreverse (tree);
3951 /* Returns the length of a chain of nodes
3952 (number of chain pointers to follow before reaching a null pointer). */
3954 extern int list_length (tree);
3956 /* Returns the number of FIELD_DECLs in a type. */
3958 extern int fields_length (tree);
3960 /* Given an initializer INIT, return TRUE if INIT is zero or some
3961 aggregate of zeros. Otherwise return FALSE. */
3963 extern bool initializer_zerop (tree);
3965 /* Examine CTOR to discover:
3966 * how many scalar fields are set to nonzero values,
3967 and place it in *P_NZ_ELTS;
3968 * how many scalar fields in total are in CTOR,
3969 and place it in *P_ELT_COUNT.
3970 * if a type is a union, and the initializer from the constructor
3971 is not the largest element in the union, then set *p_must_clear.
3973 Return whether or not CTOR is a valid static constant initializer, the same
3974 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
3976 extern bool categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3979 extern HOST_WIDE_INT count_type_elements (tree, bool);
3981 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3983 extern int integer_zerop (tree);
3985 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
3987 extern int integer_onep (tree);
3989 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3990 all of whose significant bits are 1. */
3992 extern int integer_all_onesp (tree);
3994 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3995 exactly one bit 1. */
3997 extern int integer_pow2p (tree);
3999 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4000 with a nonzero value. */
4002 extern int integer_nonzerop (tree);
4004 extern bool zero_p (tree);
4005 extern bool cst_and_fits_in_hwi (tree);
4006 extern tree num_ending_zeros (tree);
4008 /* staticp (tree x) is nonzero if X is a reference to data allocated
4009 at a fixed address in memory. Returns the outermost data. */
4011 extern tree staticp (tree);
4013 /* save_expr (EXP) returns an expression equivalent to EXP
4014 but it can be used multiple times within context CTX
4015 and only evaluate EXP once. */
4017 extern tree save_expr (tree);
4019 /* Look inside EXPR and into any simple arithmetic operations. Return
4020 the innermost non-arithmetic node. */
4022 extern tree skip_simple_arithmetic (tree);
4024 /* Return which tree structure is used by T. */
4026 enum tree_node_structure_enum tree_node_structure (tree);
4028 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4029 or offset that depends on a field within a record.
4031 Note that we only allow such expressions within simple arithmetic
4034 extern bool contains_placeholder_p (tree);
4036 /* This macro calls the above function but short-circuits the common
4037 case of a constant to save time. Also check for null. */
4039 #define CONTAINS_PLACEHOLDER_P(EXP) \
4040 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4042 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4043 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4046 extern bool type_contains_placeholder_p (tree);
4048 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4049 return a tree with all occurrences of references to F in a
4050 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4051 contains only arithmetic expressions. */
4053 extern tree substitute_in_expr (tree, tree, tree);
4055 /* This macro calls the above function but short-circuits the common
4056 case of a constant to save time and also checks for NULL. */
4058 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4059 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4061 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4062 for it within OBJ, a tree that is an object or a chain of references. */
4064 extern tree substitute_placeholder_in_expr (tree, tree);
4066 /* This macro calls the above function but short-circuits the common
4067 case of a constant to save time and also checks for NULL. */
4069 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4070 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4071 : substitute_placeholder_in_expr (EXP, OBJ))
4073 /* variable_size (EXP) is like save_expr (EXP) except that it
4074 is for the special case of something that is part of a
4075 variable size for a data type. It makes special arrangements
4076 to compute the value at the right time when the data type
4077 belongs to a function parameter. */
4079 extern tree variable_size (tree);
4081 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4082 but it can be used multiple times
4083 and only evaluate the subexpressions once. */
4085 extern tree stabilize_reference (tree);
4087 /* Subroutine of stabilize_reference; this is called for subtrees of
4088 references. Any expression with side-effects must be put in a SAVE_EXPR
4089 to ensure that it is only evaluated once. */
4091 extern tree stabilize_reference_1 (tree);
4093 /* Return EXP, stripped of any conversions to wider types
4094 in such a way that the result of converting to type FOR_TYPE
4095 is the same as if EXP were converted to FOR_TYPE.
4096 If FOR_TYPE is 0, it signifies EXP's type. */
4098 extern tree get_unwidened (tree, tree);
4100 /* Return OP or a simpler expression for a narrower value
4101 which can be sign-extended or zero-extended to give back OP.
4102 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4103 or 0 if the value should be sign-extended. */
4105 extern tree get_narrower (tree, int *);
4107 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4108 look for nested component-refs or array-refs at constant positions
4109 and find the ultimate containing object, which is returned. */
4111 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4112 tree *, enum machine_mode *, int *, int *,
4115 /* Return 1 if T is an expression that get_inner_reference handles. */
4117 extern int handled_component_p (tree);
4119 /* Return a tree of sizetype representing the size, in bytes, of the element
4120 of EXP, an ARRAY_REF. */
4122 extern tree array_ref_element_size (tree);
4124 /* Return a tree representing the lower bound of the array mentioned in
4125 EXP, an ARRAY_REF. */
4127 extern tree array_ref_low_bound (tree);
4129 /* Return a tree representing the upper bound of the array mentioned in
4130 EXP, an ARRAY_REF. */
4132 extern tree array_ref_up_bound (tree);
4134 /* Return a tree representing the offset, in bytes, of the field referenced
4135 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4137 extern tree component_ref_field_offset (tree);
4139 /* Given a DECL or TYPE, return the scope in which it was declared, or
4140 NUL_TREE if there is no containing scope. */
4142 extern tree get_containing_scope (tree);
4144 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4146 extern tree decl_function_context (tree);
4148 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4149 this _DECL with its context, or zero if none. */
4150 extern tree decl_type_context (tree);
4152 /* Return 1 if EXPR is the real constant zero. */
4153 extern int real_zerop (tree);
4155 /* Declare commonly used variables for tree structure. */
4157 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4158 Zero means allow extended lvalues. */
4160 extern int pedantic_lvalues;
4162 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4164 extern GTY(()) tree current_function_decl;
4166 /* Nonzero means a FUNC_BEGIN label was emitted. */
4167 extern GTY(()) const char * current_function_func_begin_label;
4170 extern unsigned crc32_string (unsigned, const char *);
4171 extern void clean_symbol_name (char *);
4172 extern tree get_file_function_name_long (const char *);
4173 extern tree get_callee_fndecl (tree);
4174 extern void change_decl_assembler_name (tree, tree);
4175 extern int type_num_arguments (tree);
4176 extern bool associative_tree_code (enum tree_code);
4177 extern bool commutative_tree_code (enum tree_code);
4178 extern tree upper_bound_in_type (tree, tree);
4179 extern tree lower_bound_in_type (tree, tree);
4180 extern int operand_equal_for_phi_arg_p (tree, tree);
4181 extern bool empty_body_p (tree);
4185 extern void expand_expr_stmt (tree);
4186 extern int warn_if_unused_value (tree, location_t);
4187 extern void expand_label (tree);
4188 extern void expand_goto (tree);
4190 extern rtx expand_stack_save (void);
4191 extern void expand_stack_restore (tree);
4192 extern void expand_return (tree);
4193 extern int is_body_block (tree);
4196 extern void using_eh_for_cleanups (void);
4198 /* In fold-const.c */
4200 /* Non-zero if we are folding constants inside an initializer; zero
4202 extern int folding_initializer;
4204 /* Fold constants as much as possible in an expression.
4205 Returns the simplified expression.
4206 Acts only on the top level of the expression;
4207 if the argument itself cannot be simplified, its
4208 subexpressions are not changed. */
4210 extern tree fold (tree);
4211 extern tree fold_unary (enum tree_code, tree, tree);
4212 extern tree fold_binary (enum tree_code, tree, tree, tree);
4213 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4214 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4215 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4216 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4217 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4218 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4219 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4220 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4221 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4222 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4223 extern tree fold_convert (tree, tree);
4224 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4225 extern tree fold_ignored_result (tree);
4226 extern tree fold_abs_const (tree, tree);
4227 extern tree fold_indirect_ref_1 (tree, tree);
4228 extern void fold_defer_overflow_warnings (void);
4229 extern void fold_undefer_overflow_warnings (bool, tree, int);
4230 extern void fold_undefer_and_ignore_overflow_warnings (void);
4231 extern bool fold_deferring_overflow_warnings_p (void);
4233 extern tree force_fit_type (tree, int, bool, bool);
4235 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4236 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4237 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4239 #define add_double(l1,h1,l2,h2,lv,hv) \
4240 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4241 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4242 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4243 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4244 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4245 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4247 #define mul_double(l1,h1,l2,h2,lv,hv) \
4248 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4249 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4250 HOST_WIDE_INT, unsigned int,
4251 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4252 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4253 HOST_WIDE_INT, unsigned int,
4254 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4255 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4256 HOST_WIDE_INT, unsigned int,
4257 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4258 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4259 HOST_WIDE_INT, unsigned int,
4260 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4262 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4263 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4264 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4265 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4268 enum operand_equal_flag
4274 extern int operand_equal_p (tree, tree, unsigned int);
4276 extern tree omit_one_operand (tree, tree, tree);
4277 extern tree omit_two_operands (tree, tree, tree, tree);
4278 extern tree invert_truthvalue (tree);
4279 extern tree fold_truth_not_expr (tree);
4280 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4281 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4282 extern tree fold_read_from_constant_string (tree);
4283 extern tree int_const_binop (enum tree_code, tree, tree, int);
4284 extern tree build_fold_addr_expr (tree);
4285 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4286 extern tree fold_strip_sign_ops (tree);
4287 extern tree build_fold_addr_expr_with_type (tree, tree);
4288 extern tree build_fold_indirect_ref (tree);
4289 extern tree fold_indirect_ref (tree);
4290 extern tree constant_boolean_node (int, tree);
4291 extern tree build_low_bits_mask (tree, unsigned);
4293 extern bool tree_swap_operands_p (tree, tree, bool);
4294 extern void swap_tree_operands (tree, tree *, tree *);
4295 extern enum tree_code swap_tree_comparison (enum tree_code);
4297 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4298 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4300 extern bool tree_expr_nonzero_p (tree);
4301 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4304 extern tree fold_builtin (tree, tree, bool);
4305 extern tree fold_builtin_fputs (tree, bool, bool, tree);
4306 extern tree fold_builtin_strcpy (tree, tree, tree);
4307 extern tree fold_builtin_strncpy (tree, tree, tree);
4308 extern tree fold_builtin_memory_chk (tree, tree, tree, bool,
4309 enum built_in_function);
4310 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, bool,
4311 enum built_in_function);
4312 extern tree fold_builtin_strncpy_chk (tree, tree);
4313 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4314 extern bool fold_builtin_next_arg (tree);
4315 extern enum built_in_function builtin_mathfn_code (tree);
4316 extern tree build_function_call_expr (tree, tree);
4317 extern tree mathfn_built_in (tree, enum built_in_function fn);
4318 extern tree strip_float_extensions (tree);
4319 extern tree c_strlen (tree, int);
4320 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4321 extern tree build_va_arg_indirect_ref (tree);
4322 tree build_string_literal (int, const char *);
4325 extern tree strip_float_extensions (tree);
4328 extern void record_component_aliases (tree);
4329 extern HOST_WIDE_INT get_alias_set (tree);
4330 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4331 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4332 extern int objects_must_conflict_p (tree, tree);
4335 extern int really_constant_p (tree);
4336 extern int int_fits_type_p (tree, tree);
4337 extern bool variably_modified_type_p (tree, tree);
4338 extern int tree_log2 (tree);
4339 extern int tree_floor_log2 (tree);
4340 extern int simple_cst_equal (tree, tree);
4341 extern hashval_t iterative_hash_expr (tree, hashval_t);
4342 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
4343 extern int type_list_equal (tree, tree);
4344 extern int chain_member (tree, tree);
4345 extern tree type_hash_lookup (unsigned int, tree);
4346 extern void type_hash_add (unsigned int, tree);
4347 extern int simple_cst_list_equal (tree, tree);
4348 extern void dump_tree_statistics (void);
4349 extern void expand_function_end (void);
4350 extern void expand_function_start (tree);
4351 extern void stack_protect_prologue (void);
4352 extern void stack_protect_epilogue (void);
4353 extern void recompute_tree_invariant_for_addr_expr (tree);
4354 extern bool is_global_var (tree t);
4355 extern bool needs_to_live_in_memory (tree);
4356 extern tree reconstruct_complex_type (tree, tree);
4358 extern int real_onep (tree);
4359 extern int real_twop (tree);
4360 extern int real_minus_onep (tree);
4361 extern void init_ttree (void);
4362 extern void build_common_tree_nodes (bool, bool);
4363 extern void build_common_tree_nodes_2 (int);
4364 extern void build_common_builtin_nodes (void);
4365 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4366 extern tree build_range_type (tree, tree, tree);
4367 extern HOST_WIDE_INT int_cst_value (tree);
4368 extern tree tree_fold_gcd (tree, tree);
4369 extern tree build_addr (tree, tree);
4371 extern bool fields_compatible_p (tree, tree);
4372 extern tree find_compatible_field (tree, tree);
4375 extern void expand_main_function (void);
4376 extern void init_dummy_function_start (void);
4377 extern void expand_dummy_function_end (void);
4378 extern unsigned int init_function_for_compilation (void);
4379 extern void allocate_struct_function (tree);
4380 extern void init_function_start (tree);
4381 extern bool use_register_for_decl (tree);
4382 extern void setjmp_vars_warning (tree);
4383 extern void setjmp_args_warning (void);
4384 extern void init_temp_slots (void);
4385 extern void free_temp_slots (void);
4386 extern void pop_temp_slots (void);
4387 extern void push_temp_slots (void);
4388 extern void preserve_temp_slots (rtx);
4389 extern int aggregate_value_p (tree, tree);
4390 extern void push_function_context (void);
4391 extern void pop_function_context (void);
4392 extern void push_function_context_to (tree);
4393 extern void pop_function_context_from (tree);
4394 extern tree gimplify_parameters (void);
4396 /* In print-rtl.c */
4398 extern void print_rtl (FILE *, rtx);
4401 /* In print-tree.c */
4402 extern void debug_tree (tree);
4404 extern void dump_addr (FILE*, const char *, void *);
4405 extern void print_node (FILE *, const char *, tree, int);
4406 extern void print_node_brief (FILE *, const char *, tree, int);
4407 extern void indent_to (FILE *, int);
4410 /* In tree-inline.c: */
4411 extern bool debug_find_tree (tree, tree);
4412 /* This is in tree-inline.c since the routine uses
4413 data structures from the inliner. */
4414 extern tree unsave_expr_now (tree);
4415 extern tree build_duplicate_type (tree);
4418 extern rtx emit_line_note (location_t);
4422 /* Nonzero if this is a call to a function whose return value depends
4423 solely on its arguments, has no side effects, and does not read
4426 /* Nonzero if this call will never return. */
4427 #define ECF_NORETURN 2
4428 /* Nonzero if this is a call to malloc or a related function. */
4429 #define ECF_MALLOC 4
4430 /* Nonzero if it is plausible that this is a call to alloca. */
4431 #define ECF_MAY_BE_ALLOCA 8
4432 /* Nonzero if this is a call to a function that won't throw an exception. */
4433 #define ECF_NOTHROW 16
4434 /* Nonzero if this is a call to setjmp or a related function. */
4435 #define ECF_RETURNS_TWICE 32
4436 /* Nonzero if this call replaces the current stack frame. */
4437 #define ECF_SIBCALL 64
4438 /* Nonzero if this is a call to "pure" function (like const function,
4439 but may read memory. */
4440 #define ECF_PURE 128
4441 /* Nonzero if this is a call to a function that returns with the stack
4442 pointer depressed. */
4443 #define ECF_SP_DEPRESSED 256
4444 /* Create libcall block around the call. */
4445 #define ECF_LIBCALL_BLOCK 512
4446 /* Function does not read or write memory (but may have side effects, so
4447 it does not necessarily fit ECF_CONST). */
4448 #define ECF_NOVOPS 1024
4450 extern int flags_from_decl_or_type (tree);
4451 extern int call_expr_flags (tree);
4453 extern int setjmp_call_p (tree);
4454 extern bool alloca_call_p (tree);
4455 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
4456 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
4460 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4461 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4462 it should be modified in place; if a TYPE, a copy should be created
4463 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4464 information, in the form of a bitwise OR of flags in enum attribute_flags
4465 from tree.h. Depending on these flags, some attributes may be
4466 returned to be applied at a later stage (for example, to apply
4467 a decl attribute to the declaration rather than to its type). */
4468 extern tree decl_attributes (tree *, tree, int);
4470 /* In integrate.c */
4471 extern void set_decl_abstract_flags (tree, int);
4472 extern void set_decl_origin_self (tree);
4474 /* In stor-layout.c */
4475 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
4476 extern void fixup_signed_type (tree);
4477 extern void internal_reference_types (void);
4478 extern unsigned int update_alignment_for_field (record_layout_info, tree,
4481 extern void make_decl_rtl (tree);
4482 extern void make_decl_one_only (tree);
4483 extern int supports_one_only (void);
4484 extern void resolve_unique_section (tree, int, int);
4485 extern void mark_referenced (tree);
4486 extern void mark_decl_referenced (tree);
4487 extern void notice_global_symbol (tree);
4488 extern void set_user_assembler_name (tree, const char *);
4489 extern void process_pending_assemble_externals (void);
4490 extern void finish_aliases_1 (void);
4491 extern void finish_aliases_2 (void);
4494 extern void expand_computed_goto (tree);
4495 extern bool parse_output_constraint (const char **, int, int, int,
4496 bool *, bool *, bool *);
4497 extern bool parse_input_constraint (const char **, int, int, int, int,
4498 const char * const *, bool *, bool *);
4499 extern void expand_asm_expr (tree);
4500 extern tree resolve_asm_operand_names (tree, tree, tree);
4501 extern void expand_case (tree);
4502 extern void expand_decl (tree);
4503 extern void expand_anon_union_decl (tree, tree, tree);
4505 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4506 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
4509 /* In gimplify.c. */
4510 extern tree create_artificial_label (void);
4511 extern void gimplify_function_tree (tree);
4512 extern const char *get_name (tree);
4513 extern tree unshare_expr (tree);
4514 extern void sort_case_labels (tree);
4516 /* If KIND=='I', return a suitable global initializer (constructor) name.
4517 If KIND=='D', return a suitable global clean-up (destructor) name. */
4518 extern tree get_file_function_name (int);
4520 /* Interface of the DWARF2 unwind info support. */
4522 /* Generate a new label for the CFI info to refer to. */
4524 extern char *dwarf2out_cfi_label (void);
4526 /* Entry point to update the canonical frame address (CFA). */
4528 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
4530 /* Add the CFI for saving a register window. */
4532 extern void dwarf2out_window_save (const char *);
4534 /* Add a CFI to update the running total of the size of arguments pushed
4537 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
4539 /* Entry point for saving a register to the stack. */
4541 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
4543 /* Entry point for saving the return address in the stack. */
4545 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
4547 /* Entry point for saving the return address in a register. */
4549 extern void dwarf2out_return_reg (const char *, unsigned);
4551 /* Entry point for saving the first register into the second. */
4553 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
4555 /* In tree-inline.c */
4557 /* The type of a set of already-visited pointers. Functions for creating
4558 and manipulating it are declared in pointer-set.h */
4559 struct pointer_set_t;
4561 /* The type of a callback function for walking over tree structure. */
4563 typedef tree (*walk_tree_fn) (tree *, int *, void *);
4564 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
4565 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
4567 /* Assign the RTX to declaration. */
4569 extern void set_decl_rtl (tree, rtx);
4570 extern void set_decl_incoming_rtl (tree, rtx);
4572 /* Enum and arrays used for tree allocation stats.
4573 Keep in sync with tree.c:tree_node_kind_names. */
4598 extern int tree_node_counts[];
4599 extern int tree_node_sizes[];
4601 /* True if we are in gimple form and the actions of the folders need to
4602 be restricted. False if we are not in gimple form and folding is not
4603 restricted to creating gimple expressions. */
4604 extern bool in_gimple_form;
4606 /* In tree-gimple.c. */
4607 extern tree get_base_address (tree t);
4609 /* In tree-vectorizer.c. */
4610 extern void vect_set_verbosity_level (const char *);
4612 struct tree_map GTY(())
4619 extern unsigned int tree_map_hash (const void *);
4620 extern int tree_map_marked_p (const void *);
4621 extern int tree_map_eq (const void *, const void *);
4623 /* In tree-ssa-address.c. */
4624 extern tree tree_mem_ref_addr (tree, tree);
4625 extern void copy_mem_ref_info (tree, tree);
4628 extern bool ssa_name_nonzero_p (tree);
4629 extern bool ssa_name_nonnegative_p (tree);
4631 /* In tree-object-size.c. */
4632 extern void init_object_sizes (void);
4633 extern void fini_object_sizes (void);
4634 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
4637 extern unsigned HOST_WIDE_INT highest_pow2_factor (tree);
4639 #endif /* GCC_TREE_H */