1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
28 #include "statistics.h"
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 #define MAX_TREE_CODES 512
45 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
46 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
48 /* Number of language-independent tree codes. */
49 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
51 /* Tree code classes. */
53 /* Each tree_code has an associated code class represented by a
56 enum tree_code_class {
57 tcc_exceptional, /* An exceptional code (fits no category). */
58 tcc_constant, /* A constant. */
59 /* Order of tcc_type and tcc_declaration is important. */
60 tcc_type, /* A type object code. */
61 tcc_declaration, /* A declaration (also serving as variable refs). */
62 tcc_reference, /* A reference to storage. */
63 tcc_comparison, /* A comparison expression. */
64 tcc_unary, /* A unary arithmetic expression. */
65 tcc_binary, /* A binary arithmetic expression. */
66 tcc_statement, /* A statement expression, which have side effects
67 but usually no interesting value. */
68 tcc_vl_exp, /* A function call or other expression with a
69 variable-length operand vector. */
70 tcc_expression, /* Any other expression. */
71 tcc_gimple_stmt /* A GIMPLE statement. */
74 /* Each tree code class has an associated string representation.
75 These must correspond to the tree_code_class entries. */
77 extern const char *const tree_code_class_strings[];
79 /* Returns the string representing CLASS. */
81 #define TREE_CODE_CLASS_STRING(CLASS)\
82 tree_code_class_strings[(int) (CLASS)]
84 extern const enum tree_code_class tree_code_type[];
85 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
87 /* Nonzero if CODE represents an exceptional code. */
89 #define EXCEPTIONAL_CLASS_P(CODE)\
90 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
92 /* Nonzero if CODE represents a constant. */
94 #define CONSTANT_CLASS_P(CODE)\
95 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
97 /* Nonzero if CODE represents a type. */
100 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
102 /* Nonzero if CODE represents a declaration. */
104 #define DECL_P(CODE)\
105 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
107 /* Nonzero if CODE represents a memory tag. */
109 #define MTAG_P(CODE) \
110 (TREE_CODE (CODE) == STRUCT_FIELD_TAG \
111 || TREE_CODE (CODE) == NAME_MEMORY_TAG \
112 || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG \
113 || TREE_CODE (CODE) == MEMORY_PARTITION_TAG)
116 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
118 #define VAR_OR_FUNCTION_DECL_P(DECL)\
119 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
121 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
122 ascending code order. */
124 #define INDIRECT_REF_P(CODE)\
125 (TREE_CODE (CODE) == INDIRECT_REF \
126 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
127 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
129 /* Nonzero if CODE represents a reference. */
131 #define REFERENCE_CLASS_P(CODE)\
132 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
134 /* Nonzero if CODE represents a comparison. */
136 #define COMPARISON_CLASS_P(CODE)\
137 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
139 /* Nonzero if CODE represents a unary arithmetic expression. */
141 #define UNARY_CLASS_P(CODE)\
142 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
144 /* Nonzero if CODE represents a binary arithmetic expression. */
146 #define BINARY_CLASS_P(CODE)\
147 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
149 /* Nonzero if CODE represents a statement expression. */
151 #define STATEMENT_CLASS_P(CODE)\
152 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
154 /* Nonzero if CODE represents a function call-like expression with a
155 variable-length operand vector. */
157 #define VL_EXP_CLASS_P(CODE)\
158 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
160 /* Nonzero if CODE represents any other expression. */
162 #define EXPRESSION_CLASS_P(CODE)\
163 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
165 /* Returns nonzero iff CODE represents a type or declaration. */
167 #define IS_TYPE_OR_DECL_P(CODE)\
168 (TYPE_P (CODE) || DECL_P (CODE))
170 /* Returns nonzero iff CLASS is the tree-code class of an
173 #define IS_EXPR_CODE_CLASS(CLASS)\
174 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
176 /* Returns nonzer iff CLASS is a GIMPLE statement. */
178 #define IS_GIMPLE_STMT_CODE_CLASS(CLASS) ((CLASS) == tcc_gimple_stmt)
180 /* Returns nonzero iff NODE is an expression of some kind. */
182 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
184 /* Returns nonzero iff NODE is an OpenMP directive. */
186 #define OMP_DIRECTIVE_P(NODE) \
187 (TREE_CODE (NODE) == OMP_PARALLEL \
188 || TREE_CODE (NODE) == OMP_FOR \
189 || TREE_CODE (NODE) == OMP_SECTIONS \
190 || TREE_CODE (NODE) == OMP_SINGLE \
191 || TREE_CODE (NODE) == OMP_SECTION \
192 || TREE_CODE (NODE) == OMP_MASTER \
193 || TREE_CODE (NODE) == OMP_ORDERED \
194 || TREE_CODE (NODE) == OMP_CRITICAL \
195 || TREE_CODE (NODE) == OMP_RETURN \
196 || TREE_CODE (NODE) == OMP_CONTINUE)
198 /* Number of argument-words in each kind of tree-node. */
200 extern const unsigned char tree_code_length[];
201 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
203 /* Names of tree components. */
205 extern const char *const tree_code_name[];
207 /* A vectors of trees. */
209 DEF_VEC_ALLOC_P(tree,gc);
210 DEF_VEC_ALLOC_P(tree,heap);
213 /* Classify which part of the compiler has defined a given builtin function.
214 Note that we assume below that this is no more than two bits. */
223 /* Names for the above. */
224 extern const char *const built_in_class_names[4];
226 /* Codes that identify the various built in functions
227 so that expand_call can identify them quickly. */
229 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
230 enum built_in_function
232 #include "builtins.def"
234 /* Complex division routines in libgcc. These are done via builtins
235 because emit_library_call_value can't handle complex values. */
236 BUILT_IN_COMPLEX_MUL_MIN,
237 BUILT_IN_COMPLEX_MUL_MAX
238 = BUILT_IN_COMPLEX_MUL_MIN
239 + MAX_MODE_COMPLEX_FLOAT
240 - MIN_MODE_COMPLEX_FLOAT,
242 BUILT_IN_COMPLEX_DIV_MIN,
243 BUILT_IN_COMPLEX_DIV_MAX
244 = BUILT_IN_COMPLEX_DIV_MIN
245 + MAX_MODE_COMPLEX_FLOAT
246 - MIN_MODE_COMPLEX_FLOAT,
248 /* Upper bound on non-language-specific builtins. */
253 /* Names for the above. */
254 extern const char * built_in_names[(int) END_BUILTINS];
256 /* Helper macros for math builtins. */
258 #define BUILTIN_EXP10_P(FN) \
259 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
260 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
262 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
263 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
264 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
266 #define BUILTIN_SQRT_P(FN) \
267 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
269 #define BUILTIN_CBRT_P(FN) \
270 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
272 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
274 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
275 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
277 /* An array of _DECL trees for the above. */
278 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
279 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
281 /* In an OMP_CLAUSE node. */
283 /* Number of operands and names for each clause. */
284 extern unsigned const char omp_clause_num_ops[];
285 extern const char * const omp_clause_code_name[];
287 /* Clause codes. Do not reorder, as this is used to index into the tables
288 omp_clause_num_ops and omp_clause_code_name. */
291 /* Clause zero is special-cased inside the parser
292 (c_parser_omp_variable_list). */
293 OMP_CLAUSE_ERROR = 0,
295 /* OpenMP clause: private (variable_list). */
298 /* OpenMP clause: shared (variable_list). */
301 /* OpenMP clause: firstprivate (variable_list). */
302 OMP_CLAUSE_FIRSTPRIVATE,
304 /* OpenMP clause: lastprivate (variable_list). */
305 OMP_CLAUSE_LASTPRIVATE,
307 /* OpenMP clause: reduction (operator:variable_list).
308 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
309 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
310 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
312 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
313 placeholder used in OMP_CLAUSE_REDUCTION_MERGE. */
314 OMP_CLAUSE_REDUCTION,
316 /* OpenMP clause: copyin (variable_list). */
319 /* OpenMP clause: copyprivate (variable_list). */
320 OMP_CLAUSE_COPYPRIVATE,
322 /* OpenMP clause: if (scalar-expression). */
325 /* OpenMP clause: num_threads (integer-expression). */
326 OMP_CLAUSE_NUM_THREADS,
328 /* OpenMP clause: schedule. */
331 /* OpenMP clause: nowait. */
334 /* OpenMP clause: ordered. */
337 /* OpenMP clause: default. */
341 /* The definition of tree nodes fills the next several pages. */
343 /* A tree node can represent a data type, a variable, an expression
344 or a statement. Each node has a TREE_CODE which says what kind of
345 thing it represents. Some common codes are:
346 INTEGER_TYPE -- represents a type of integers.
347 ARRAY_TYPE -- represents a type of pointer.
348 VAR_DECL -- represents a declared variable.
349 INTEGER_CST -- represents a constant integer value.
350 PLUS_EXPR -- represents a sum (an expression).
352 As for the contents of a tree node: there are some fields
353 that all nodes share. Each TREE_CODE has various special-purpose
354 fields as well. The fields of a node are never accessed directly,
355 always through accessor macros. */
357 /* Every kind of tree node starts with this structure,
358 so all nodes have these fields.
360 See the accessor macros, defined below, for documentation of the
364 struct tree_base GTY(())
366 ENUM_BITFIELD(tree_code) code : 16;
368 unsigned side_effects_flag : 1;
369 unsigned constant_flag : 1;
370 unsigned addressable_flag : 1;
371 unsigned volatile_flag : 1;
372 unsigned readonly_flag : 1;
373 unsigned unsigned_flag : 1;
374 unsigned asm_written_flag: 1;
375 unsigned nowarning_flag : 1;
377 unsigned used_flag : 1;
378 unsigned nothrow_flag : 1;
379 unsigned static_flag : 1;
380 unsigned public_flag : 1;
381 unsigned private_flag : 1;
382 unsigned protected_flag : 1;
383 unsigned deprecated_flag : 1;
384 unsigned invariant_flag : 1;
386 unsigned lang_flag_0 : 1;
387 unsigned lang_flag_1 : 1;
388 unsigned lang_flag_2 : 1;
389 unsigned lang_flag_3 : 1;
390 unsigned lang_flag_4 : 1;
391 unsigned lang_flag_5 : 1;
392 unsigned lang_flag_6 : 1;
393 unsigned visited : 1;
397 /* FIXME tuples: Eventually, we need to move this somewhere external to
399 union tree_ann_d *ann;
402 struct tree_common GTY(())
404 struct tree_base base;
409 /* GIMPLE_MODIFY_STMT */
410 struct gimple_stmt GTY(())
412 struct tree_base base;
415 /* FIXME tuples: Eventually this should be of type ``struct gimple_expr''. */
416 tree GTY ((length ("TREE_CODE_LENGTH (TREE_CODE (&%h))"))) operands[1];
419 /* The following table lists the uses of each of the above flags and
420 for which types of nodes they are defined. Note that expressions
426 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
427 ..._TYPE, IDENTIFIER_NODE.
428 In a STMT_EXPR, it means we want the result of the enclosed
430 CALL_EXPR_TAILCALL in CALL_EXPR
431 CASE_LOW_SEEN in CASE_LABEL_EXPR
436 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
439 TREE_SYMBOL_REFERENCED in
442 TARGET_EXPR, WITH_CLEANUP_EXPR
445 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
446 TYPE_REF_CAN_ALIAS_ALL in
447 POINTER_TYPE, REFERENCE_TYPE
448 CASE_HIGH_SEEN in CASE_LABEL_EXPR
453 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
455 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
458 TYPE_CACHED_VALUES_P in
460 SAVE_EXPR_RESOLVED_P in
462 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
463 OMP_CLAUSE_LASTPRIVATE
464 OMP_CLAUSE_PRIVATE_DEBUG in
471 CALL_EXPR_RETURN_SLOT_OPT in
474 PARM_DECL, RESULT_DECL
479 OMP_PARALLEL_COMBINED in
502 TREE_THIS_VOLATILE in
520 TYPE_SIZES_GIMPLIFIED
529 BIT_FIELD_REF_UNSIGNED in
535 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
541 expressions, IDENTIFIER_NODE
546 CALL_EXPR, FUNCTION_DECL
552 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
559 IDENTIFIER_TRANSPARENT_ALIAS in
564 Used in tree traversals to mark visited nodes.
574 ... any expr or decl node
577 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
578 enum tree_node_structure_enum {
579 #include "treestruct.def"
584 /* Define accessors for the fields that all tree nodes have
585 (though some fields are not used for all kinds of nodes). */
587 /* The tree-code says what kind of node it is.
588 Codes are defined in tree.def. */
589 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
590 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
592 /* When checking is enabled, errors will be generated if a tree node
593 is accessed incorrectly. The macros die with a fatal error. */
594 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
596 #define TREE_CHECK(T, CODE) __extension__ \
597 ({ const tree __t = (T); \
598 if (TREE_CODE (__t) != (CODE)) \
599 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
603 #define TREE_NOT_CHECK(T, CODE) __extension__ \
604 ({ const tree __t = (T); \
605 if (TREE_CODE (__t) == (CODE)) \
606 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
610 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
611 ({ const tree __t = (T); \
612 if (TREE_CODE (__t) != (CODE1) \
613 && TREE_CODE (__t) != (CODE2)) \
614 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
615 (CODE1), (CODE2), 0); \
618 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
619 ({ const tree __t = (T); \
620 if (TREE_CODE (__t) == (CODE1) \
621 || TREE_CODE (__t) == (CODE2)) \
622 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
623 (CODE1), (CODE2), 0); \
626 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
627 ({ const tree __t = (T); \
628 if (TREE_CODE (__t) != (CODE1) \
629 && TREE_CODE (__t) != (CODE2) \
630 && TREE_CODE (__t) != (CODE3)) \
631 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
632 (CODE1), (CODE2), (CODE3), 0); \
635 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
636 ({ const tree __t = (T); \
637 if (TREE_CODE (__t) == (CODE1) \
638 || TREE_CODE (__t) == (CODE2) \
639 || TREE_CODE (__t) == (CODE3)) \
640 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
641 (CODE1), (CODE2), (CODE3), 0); \
644 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __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_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
651 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
654 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
655 ({ const tree __t = (T); \
656 if (TREE_CODE (__t) == (CODE1) \
657 || TREE_CODE (__t) == (CODE2) \
658 || TREE_CODE (__t) == (CODE3) \
659 || TREE_CODE (__t) == (CODE4)) \
660 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
661 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
664 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
665 ({ const tree __t = (T); \
666 if (TREE_CODE (__t) != (CODE1) \
667 && TREE_CODE (__t) != (CODE2) \
668 && TREE_CODE (__t) != (CODE3) \
669 && TREE_CODE (__t) != (CODE4) \
670 && TREE_CODE (__t) != (CODE5)) \
671 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
672 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
675 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
676 ({ const tree __t = (T); \
677 if (TREE_CODE (__t) == (CODE1) \
678 || TREE_CODE (__t) == (CODE2) \
679 || TREE_CODE (__t) == (CODE3) \
680 || TREE_CODE (__t) == (CODE4) \
681 || TREE_CODE (__t) == (CODE5)) \
682 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
683 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
686 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
687 ({ const tree __t = (T); \
688 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
689 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
693 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
694 ({ const tree __t = (T); \
695 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
696 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
700 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
701 ({ const tree __t = (T); \
702 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
703 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
707 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
708 ({ const tree __t = (T); \
709 if (TREE_CODE (__t) != OMP_CLAUSE) \
710 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
712 if (__t->omp_clause.code != (CODE)) \
713 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
717 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
718 ({ const tree __t = (T); \
719 if (TREE_CODE (__t) != OMP_CLAUSE) \
720 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
722 if ((int) __t->omp_clause.code < (int) (CODE1) \
723 || (int) __t->omp_clause.code > (int) (CODE2)) \
724 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
725 __FUNCTION__, (CODE1), (CODE2)); \
728 /* These checks have to be special cased. */
729 #define EXPR_CHECK(T) __extension__ \
730 ({ const tree __t = (T); \
731 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
732 if (!IS_EXPR_CODE_CLASS (__c)) \
733 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
737 #define GIMPLE_STMT_CHECK(T) __extension__ \
738 ({ const tree __t = (T); \
739 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
740 if (!IS_GIMPLE_STMT_CODE_CLASS (__c)) \
741 tree_class_check_failed (__t, tcc_gimple_stmt, __FILE__, __LINE__,\
745 /* These checks have to be special cased. */
746 #define NON_TYPE_CHECK(T) __extension__ \
747 ({ const tree __t = (T); \
749 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
753 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
754 (*({const tree __t = (T); \
755 const int __i = (I); \
756 if (TREE_CODE (__t) != TREE_VEC) \
757 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
759 if (__i < 0 || __i >= __t->vec.length) \
760 tree_vec_elt_check_failed (__i, __t->vec.length, \
761 __FILE__, __LINE__, __FUNCTION__); \
762 &__t->vec.a[__i]; }))
764 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
765 (*({const tree __t = t; \
766 const int __i = (i); \
767 if (TREE_CODE (__t) != PHI_NODE) \
768 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
770 if (__i < 0 || __i >= __t->phi.capacity) \
771 phi_node_elt_check_failed (__i, __t->phi.num_args, \
772 __FILE__, __LINE__, __FUNCTION__); \
773 &__t->phi.a[__i]; }))
775 #define OMP_CLAUSE_ELT_CHECK(t, i) __extension__ \
776 (*({const tree __t = t; \
777 const int __i = (i); \
778 if (TREE_CODE (__t) != OMP_CLAUSE) \
779 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
781 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
782 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
784 &__t->omp_clause.ops[__i]; }))
786 /* Special checks for TREE_OPERANDs. */
787 #define TREE_OPERAND_CHECK(T, I) __extension__ \
788 (*({const tree __t = EXPR_CHECK (T); \
789 const int __i = (I); \
790 if (GIMPLE_TUPLE_P (__t)) \
791 gcc_unreachable (); \
792 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
793 tree_operand_check_failed (__i, __t, \
794 __FILE__, __LINE__, __FUNCTION__); \
795 &__t->exp.operands[__i]; }))
797 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
798 (*({const tree __t = (T); \
799 const int __i = (I); \
800 if (TREE_CODE (__t) != CODE) \
801 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
802 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
803 tree_operand_check_failed (__i, __t, \
804 __FILE__, __LINE__, __FUNCTION__); \
805 &__t->exp.operands[__i]; }))
807 /* Special checks for GIMPLE_STMT_OPERANDs. */
808 #define GIMPLE_STMT_OPERAND_CHECK(T, I) __extension__ \
809 (*({const tree __t = GIMPLE_STMT_CHECK (T); \
810 const int __i = (I); \
811 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
812 tree_operand_check_failed (__i, __t, \
813 __FILE__, __LINE__, __FUNCTION__); \
814 &__t->gstmt.operands[__i]; }))
816 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
818 ({const tree __t = (T); \
819 const int __i = (I); \
820 if (TREE_CODE (__t) != (CODE)) \
821 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
822 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
823 tree_operand_check_failed (__i, __t, \
824 __FILE__, __LINE__, __FUNCTION__); \
825 &__t->exp.operands[__i]; }))
827 /* Nodes are chained together for many purposes.
828 Types are chained together to record them for being output to the debugger
829 (see the function `chain_type').
830 Decls in the same scope are chained together to record the contents
832 Statement nodes for successive statements used to be chained together.
833 Often lists of things are represented by TREE_LIST nodes that
834 are chained together. */
836 #define TREE_CHAIN(NODE) __extension__ \
837 (*({const tree __t = (NODE); \
838 if (GIMPLE_TUPLE_P (__t)) \
839 gcc_unreachable (); \
840 &__t->common.chain; }))
842 /* In all nodes that are expressions, this is the data type of the expression.
843 In POINTER_TYPE nodes, this is the type that the pointer points to.
844 In ARRAY_TYPE nodes, this is the type of the elements.
845 In VECTOR_TYPE nodes, this is the type of the elements. */
846 #define TREE_TYPE(NODE) __extension__ \
847 (*({const tree __t = (NODE); \
848 if (GIMPLE_TUPLE_P (__t)) \
849 gcc_unreachable (); \
850 &__t->common.type; }))
852 extern void tree_contains_struct_check_failed (const tree,
853 const enum tree_node_structure_enum,
854 const char *, int, const char *)
857 extern void tree_check_failed (const tree, const char *, int, const char *,
858 ...) ATTRIBUTE_NORETURN;
859 extern void tree_not_check_failed (const tree, const char *, int, const char *,
860 ...) ATTRIBUTE_NORETURN;
861 extern void tree_class_check_failed (const tree, const enum tree_code_class,
862 const char *, int, const char *)
864 extern void tree_range_check_failed (const tree, const char *, int,
865 const char *, enum tree_code,
867 extern void tree_not_class_check_failed (const tree,
868 const enum tree_code_class,
869 const char *, int, const char *)
871 extern void tree_vec_elt_check_failed (int, int, const char *,
874 extern void phi_node_elt_check_failed (int, int, const char *,
877 extern void tree_operand_check_failed (int, tree,
878 const char *, int, const char *)
880 extern void omp_clause_check_failed (const tree, const char *, int,
881 const char *, enum omp_clause_code)
883 extern void omp_clause_operand_check_failed (int, tree, const char *,
886 extern void omp_clause_range_check_failed (const tree, const char *, int,
887 const char *, enum omp_clause_code,
888 enum omp_clause_code)
891 #else /* not ENABLE_TREE_CHECKING, or not gcc */
893 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
894 #define TREE_CHECK(T, CODE) (T)
895 #define TREE_NOT_CHECK(T, CODE) (T)
896 #define TREE_CHECK2(T, CODE1, CODE2) (T)
897 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
898 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
899 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
900 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
901 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
902 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
903 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
904 #define TREE_CLASS_CHECK(T, CODE) (T)
905 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
906 #define EXPR_CHECK(T) (T)
907 #define GIMPLE_STMT_CHECK(T) (T)
908 #define NON_TYPE_CHECK(T) (T)
909 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
910 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
911 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
912 #define GIMPLE_STMT_OPERAND_CHECK(T, I) ((T)->gstmt.operands[I])
913 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
914 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
915 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
916 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
917 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
919 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
920 #define TREE_TYPE(NODE) ((NODE)->common.type)
924 #define TREE_BLOCK(NODE) *(tree_block (NODE))
926 #include "tree-check.h"
928 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
929 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
930 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
931 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
932 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
933 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
934 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
935 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
936 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
937 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
938 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
939 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
941 #define RECORD_OR_UNION_CHECK(T) \
942 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
943 #define NOT_RECORD_OR_UNION_CHECK(T) \
944 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
946 #define NUMERICAL_TYPE_CHECK(T) \
947 TREE_CHECK4 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE)
949 /* Nonzero if NODE is a GIMPLE statement. */
950 #define GIMPLE_STMT_P(NODE) \
951 (TREE_CODE_CLASS (TREE_CODE ((NODE))) == tcc_gimple_stmt)
953 /* Nonzero if NODE is a GIMPLE tuple. */
954 #define GIMPLE_TUPLE_P(NODE) (GIMPLE_STMT_P (NODE) || TREE_CODE (NODE) == PHI_NODE)
956 /* A GIMPLE tuple that has a ``locus'' field. */
957 #define GIMPLE_TUPLE_HAS_LOCUS_P(NODE) GIMPLE_STMT_P ((NODE))
959 /* Like TREE_OPERAND but works with GIMPLE stmt tuples as well.
961 If you know the NODE is a GIMPLE statement, use GIMPLE_STMT_OPERAND. If the
962 NODE code is unknown at compile time, use this macro. */
963 #define GENERIC_TREE_OPERAND(NODE, I) *(generic_tree_operand ((NODE), (I)))
965 /* Like TREE_TYPE but returns void_type_node for gimple tuples that have
968 #define GENERIC_TREE_TYPE(NODE) *(generic_tree_type ((NODE)))
970 /* Here is how primitive or already-canonicalized types' hash codes
972 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
974 /* A simple hash function for an arbitrary tree node. This must not be
975 used in hash tables which are saved to a PCH. */
976 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
978 /* The TREE_CHAIN but it is able to handle tuples. */
979 #define GENERIC_NEXT(NODE) \
980 (TREE_CODE (NODE) == PHI_NODE ? PHI_CHAIN (NODE) : \
981 GIMPLE_STMT_P (NODE) ? NULL_TREE : TREE_CHAIN (NODE))
983 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
984 that don't change the machine mode. */
986 #define STRIP_NOPS(EXP) \
987 while ((TREE_CODE (EXP) == NOP_EXPR \
988 || TREE_CODE (EXP) == CONVERT_EXPR \
989 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
990 && TREE_OPERAND (EXP, 0) != error_mark_node \
991 && (TYPE_MODE (TREE_TYPE (EXP)) \
992 == TYPE_MODE (GENERIC_TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
993 (EXP) = TREE_OPERAND (EXP, 0)
995 /* Like STRIP_NOPS, but don't let the signedness change either. */
997 #define STRIP_SIGN_NOPS(EXP) \
998 while ((TREE_CODE (EXP) == NOP_EXPR \
999 || TREE_CODE (EXP) == CONVERT_EXPR \
1000 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1001 && TREE_OPERAND (EXP, 0) != error_mark_node \
1002 && (TYPE_MODE (TREE_TYPE (EXP)) \
1003 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1004 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
1005 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1006 (EXP) = TREE_OPERAND (EXP, 0)
1008 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1010 #define STRIP_TYPE_NOPS(EXP) \
1011 while ((TREE_CODE (EXP) == NOP_EXPR \
1012 || TREE_CODE (EXP) == CONVERT_EXPR \
1013 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1014 && TREE_OPERAND (EXP, 0) != error_mark_node \
1015 && (TREE_TYPE (EXP) \
1016 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1017 (EXP) = TREE_OPERAND (EXP, 0)
1019 /* Remove unnecessary type conversions according to
1020 tree_ssa_useless_type_conversion. */
1022 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1023 while (tree_ssa_useless_type_conversion (EXP)) \
1024 EXP = TREE_OPERAND (EXP, 0)
1026 /* Nonzero if TYPE represents an integral type. Note that we do not
1027 include COMPLEX types here. Keep these checks in ascending code
1030 #define INTEGRAL_TYPE_P(TYPE) \
1031 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1032 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1033 || TREE_CODE (TYPE) == INTEGER_TYPE)
1035 /* Nonzero if TYPE represents a scalar floating-point type. */
1037 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1039 /* Nonzero if TYPE represents a complex floating-point type. */
1041 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1042 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1043 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1045 /* Nonzero if TYPE represents a vector floating-point type. */
1047 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1048 (TREE_CODE (TYPE) == VECTOR_TYPE \
1049 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1051 /* Nonzero if TYPE represents a floating-point type, including complex
1052 and vector floating-point types. The vector and complex check does
1053 not use the previous two macros to enable early folding. */
1055 #define FLOAT_TYPE_P(TYPE) \
1056 (SCALAR_FLOAT_TYPE_P (TYPE) \
1057 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1058 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1059 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1061 /* Nonzero if TYPE represents a decimal floating-point type. */
1062 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1063 (SCALAR_FLOAT_TYPE_P (TYPE) \
1064 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1066 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1067 Keep these checks in ascending code order. */
1069 #define AGGREGATE_TYPE_P(TYPE) \
1070 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1071 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1073 /* Nonzero if TYPE represents a pointer or reference type.
1074 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1075 ascending code order. */
1077 #define POINTER_TYPE_P(TYPE) \
1078 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1080 /* Nonzero if this type is a complete type. */
1081 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1083 /* Nonzero if this type is the (possibly qualified) void type. */
1084 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1086 /* Nonzero if this type is complete or is cv void. */
1087 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1088 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1090 /* Nonzero if this type is complete or is an array with unspecified bound. */
1091 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1092 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1095 /* Define many boolean fields that all tree nodes have. */
1097 /* In VAR_DECL nodes, nonzero means address of this is needed.
1098 So it cannot be in a register.
1099 In a FUNCTION_DECL, nonzero means its address is needed.
1100 So it must be compiled even if it is an inline function.
1101 In a FIELD_DECL node, it means that the programmer is permitted to
1102 construct the address of this field. This is used for aliasing
1103 purposes: see record_component_aliases.
1104 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1105 In LABEL_DECL nodes, it means a goto for this label has been seen
1106 from a place outside all binding contours that restore stack levels.
1107 In ..._TYPE nodes, it means that objects of this type must
1108 be fully addressable. This means that pieces of this
1109 object cannot go into register parameters, for example.
1110 In IDENTIFIER_NODEs, this means that some extern decl for this name
1111 had its address taken. That matters for inline functions. */
1112 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1114 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1115 exit of a function. Calls for which this is true are candidates for tail
1116 call optimizations. */
1117 #define CALL_EXPR_TAILCALL(NODE) \
1118 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1120 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1121 CASE_LOW operand has been processed. */
1122 #define CASE_LOW_SEEN(NODE) \
1123 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1125 /* In a VAR_DECL, nonzero means allocate static storage.
1126 In a FUNCTION_DECL, nonzero if function has been defined.
1127 In a CONSTRUCTOR, nonzero means allocate static storage.
1129 ??? This is also used in lots of other nodes in unclear ways which
1130 should be cleaned up some day. */
1131 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1133 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
1134 should only be executed if an exception is thrown, not on normal exit
1136 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1138 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1139 CASE_HIGH operand has been processed. */
1140 #define CASE_HIGH_SEEN(NODE) \
1141 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1143 /* In an expr node (usually a conversion) this means the node was made
1144 implicitly and should not lead to any sort of warning. In a decl node,
1145 warnings concerning the decl should be suppressed. This is used at
1146 least for used-before-set warnings, and it set after one warning is
1148 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1150 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1151 this string as an argument. */
1152 #define TREE_SYMBOL_REFERENCED(NODE) \
1153 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1155 /* Nonzero in a pointer or reference type means the data pointed to
1156 by this type can alias anything. */
1157 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1158 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1160 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1161 there was an overflow in folding. */
1163 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1165 /* ??? This is an obsolete synonym for TREE_OVERFLOW. */
1166 #define TREE_CONSTANT_OVERFLOW(NODE) TREE_OVERFLOW(NODE)
1168 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1170 #define TREE_OVERFLOW_P(EXPR) \
1171 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1173 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1174 nonzero means name is to be accessible from outside this module.
1175 In an IDENTIFIER_NODE, nonzero means an external declaration
1176 accessible from outside this module was previously seen
1177 for this name in an inner scope. */
1178 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1180 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1181 of cached values, or is something else. */
1182 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1184 /* In a SAVE_EXPR, indicates that the original expression has already
1185 been substituted with a VAR_DECL that contains the value. */
1186 #define SAVE_EXPR_RESOLVED_P(NODE) \
1187 (TREE_CHECK (NODE, SAVE_EXPR)->base.public_flag)
1189 /* In any expression, decl, or constant, nonzero means it has side effects or
1190 reevaluation of the whole expression could produce a different value.
1191 This is set if any subexpression is a function call, a side effect or a
1192 reference to a volatile variable. In a ..._DECL, this is set only if the
1193 declaration said `volatile'. This will never be set for a constant. */
1194 #define TREE_SIDE_EFFECTS(NODE) \
1195 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1197 /* In a LABEL_DECL, nonzero means this label had its address taken
1198 and therefore can never be deleted and is a jump target for
1200 #define FORCED_LABEL(NODE) ((NODE)->base.side_effects_flag)
1202 /* Nonzero means this expression is volatile in the C sense:
1203 its address should be of type `volatile WHATEVER *'.
1204 In other words, the declared item is volatile qualified.
1205 This is used in _DECL nodes and _REF nodes.
1206 On a FUNCTION_DECL node, this means the function does not
1207 return normally. This is the same effect as setting
1208 the attribute noreturn on the function in C.
1210 In a ..._TYPE node, means this type is volatile-qualified.
1211 But use TYPE_VOLATILE instead of this macro when the node is a type,
1212 because eventually we may make that a different bit.
1214 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1215 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1217 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1218 accessing the memory pointed to won't generate a trap. However,
1219 this only applies to an object when used appropriately: it doesn't
1220 mean that writing a READONLY mem won't trap. Similarly for
1221 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1223 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1224 (or slice of the array) always belongs to the range of the array.
1225 I.e. that the access will not trap, provided that the access to
1226 the base to the array will not trap. */
1227 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1229 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1230 nonzero means it may not be the lhs of an assignment. */
1231 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1233 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1234 #define TREE_READONLY_DECL_P(NODE)\
1235 (DECL_P (NODE) && TREE_READONLY (NODE))
1237 /* Value of expression is constant. Always on in all ..._CST nodes. May
1238 also appear in an expression or decl where the value is constant. */
1239 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1241 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1242 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1243 (TYPE_CHECK (NODE)->base.constant_flag)
1245 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1246 #define DECL_UNSIGNED(NODE) \
1247 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1249 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1250 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1251 (BIT_FIELD_REF_CHECK (NODE)->base.unsigned_flag)
1253 /* In integral and pointer types, means an unsigned type. */
1254 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1256 /* Nonzero in a VAR_DECL means assembler code has been written.
1257 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1258 This is interesting in an inline function, since it might not need
1259 to be compiled separately.
1260 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1261 if the sdb debugging info for the type has been written.
1262 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1263 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1265 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1267 /* Nonzero in a _DECL if the name is used in its scope.
1268 Nonzero in an expr node means inhibit warning if value is unused.
1269 In IDENTIFIER_NODEs, this means that some extern decl for this name
1271 In a BLOCK, this means that the block contains variables that are used. */
1272 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1274 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1275 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1276 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1278 /* In a CALL_EXPR, means that it's safe to use the target of the call
1279 expansion as the return slot for a call that returns in memory. */
1280 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->base.private_flag)
1282 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1283 reference (and the TREE_TYPE is a pointer to the true type). */
1284 #define DECL_BY_REFERENCE(NODE) \
1285 (DECL_COMMON_CHECK (NODE)->base.private_flag)
1287 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1288 thunked-to function. */
1289 #define CALL_FROM_THUNK_P(NODE) \
1290 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1292 /* In a type, nonzero means that all objects of the type are guaranteed by the
1293 language or front-end to be properly aligned, so we can indicate that a MEM
1294 of this type is aligned at least to the alignment of the type, even if it
1295 doesn't appear that it is. We see this, for example, in object-oriented
1296 languages where a tag field may show this is an object of a more-aligned
1297 variant of the more generic type.
1299 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1301 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1303 /* Used in classes in C++. */
1304 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1305 /* Used in classes in C++.
1306 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1307 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1309 /* Nonzero in a _DECL if the use of the name is defined as a
1310 deprecated feature by __attribute__((deprecated)). */
1311 #define TREE_DEPRECATED(NODE) \
1312 ((NODE)->base.deprecated_flag)
1314 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1315 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1316 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1317 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1319 /* Value of expression is function invariant. A strict subset of
1320 TREE_CONSTANT, such an expression is constant over any one function
1321 invocation, though not across different invocations. May appear in
1322 any expression node. */
1323 #define TREE_INVARIANT(NODE) ((NODE)->base.invariant_flag)
1325 /* These flags are available for each language front end to use internally. */
1326 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1327 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1328 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1329 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1330 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1331 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1332 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1334 /* Define additional fields and accessors for nodes representing constants. */
1336 /* In an INTEGER_CST node. These two together make a 2-word integer.
1337 If the data type is signed, the value is sign-extended to 2 words
1338 even though not all of them may really be in use.
1339 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1340 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1341 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1342 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1344 #define INT_CST_LT(A, B) \
1345 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1346 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1347 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1349 #define INT_CST_LT_UNSIGNED(A, B) \
1350 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1351 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1352 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1353 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1354 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1356 struct tree_int_cst GTY(())
1358 struct tree_common common;
1362 /* In a REAL_CST node. struct real_value is an opaque entity, with
1363 manipulators defined in real.h. We don't want tree.h depending on
1364 real.h and transitively on tm.h. */
1367 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1368 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1370 struct tree_real_cst GTY(())
1372 struct tree_common common;
1373 struct real_value * real_cst_ptr;
1376 /* In a STRING_CST */
1377 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1378 #define TREE_STRING_POINTER(NODE) \
1379 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1381 struct tree_string GTY(())
1383 struct tree_common common;
1388 /* In a COMPLEX_CST node. */
1389 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1390 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1392 struct tree_complex GTY(())
1394 struct tree_common common;
1399 /* In a VECTOR_CST node. */
1400 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1402 struct tree_vector GTY(())
1404 struct tree_common common;
1410 /* Define fields and accessors for some special-purpose tree nodes. */
1412 #define IDENTIFIER_LENGTH(NODE) \
1413 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1414 #define IDENTIFIER_POINTER(NODE) \
1415 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1416 #define IDENTIFIER_HASH_VALUE(NODE) \
1417 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1419 /* Translate a hash table identifier pointer to a tree_identifier
1420 pointer, and vice versa. */
1422 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1423 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1424 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1426 struct tree_identifier GTY(())
1428 struct tree_common common;
1429 struct ht_identifier id;
1432 /* In a TREE_LIST node. */
1433 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1434 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1436 struct tree_list GTY(())
1438 struct tree_common common;
1443 /* In a TREE_VEC node. */
1444 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1445 #define TREE_VEC_END(NODE) \
1446 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1448 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1450 struct tree_vec GTY(())
1452 struct tree_common common;
1454 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1457 /* In a CONSTRUCTOR node. */
1458 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1460 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1461 value of each element (stored within VAL). IX must be a scratch variable
1462 of unsigned integer type. */
1463 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1464 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1466 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1470 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1471 the value of each element (stored within VAL) and its index (stored
1472 within INDEX). IX must be a scratch variable of unsigned integer type. */
1473 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1474 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1476 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1477 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1481 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1482 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1484 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1485 _ce___->index = INDEX; \
1486 _ce___->value = VALUE; \
1489 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1490 element. INDEX can optionally design the position of VALUE: in arrays,
1491 it is the index where VALUE has to be placed; in structures, it is the
1492 FIELD_DECL of the member. */
1493 typedef struct constructor_elt_d GTY(())
1499 DEF_VEC_O(constructor_elt);
1500 DEF_VEC_ALLOC_O(constructor_elt,gc);
1502 struct tree_constructor GTY(())
1504 struct tree_common common;
1505 VEC(constructor_elt,gc) *elts;
1508 /* Define fields and accessors for some nodes that represent expressions. */
1510 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1511 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1512 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1513 && integer_zerop (TREE_OPERAND (NODE, 0)))
1515 /* In ordinary expression nodes. */
1516 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1517 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1519 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1520 length. Its value includes the length operand itself; that is,
1521 the minimum valid length is 1.
1522 Note that we have to bypass the use of TREE_OPERAND to access
1523 that field to avoid infinite recursion in expanding the macros. */
1524 #define VL_EXP_OPERAND_LENGTH(NODE) \
1525 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1527 /* In gimple statements. */
1528 #define GIMPLE_STMT_OPERAND(NODE, I) GIMPLE_STMT_OPERAND_CHECK (NODE, I)
1529 #define GIMPLE_STMT_LOCUS(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.locus)
1530 #define GIMPLE_STMT_BLOCK(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.block)
1532 /* In a LOOP_EXPR node. */
1533 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1535 /* The source location of this expression. Non-tree_exp nodes such as
1536 decls and constants can be shared among multiple locations, so
1538 #define EXPR_LOCATION(NODE) expr_location ((NODE))
1539 #define SET_EXPR_LOCATION(NODE, FROM) set_expr_location ((NODE), (FROM))
1540 #define EXPR_HAS_LOCATION(NODE) expr_has_location ((NODE))
1541 #define EXPR_LOCUS(NODE) expr_locus ((NODE))
1542 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1543 #define EXPR_FILENAME(NODE) *(expr_filename ((NODE)))
1544 #define EXPR_LINENO(NODE) *(expr_lineno ((NODE)))
1546 /* True if a tree is an expression or statement that can have a
1548 #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE) || GIMPLE_STMT_P (NODE))
1550 /* In a TARGET_EXPR node. */
1551 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1552 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1553 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1555 /* DECL_EXPR accessor. This gives access to the DECL associated with
1556 the given declaration statement. */
1557 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1559 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1561 /* SWITCH_EXPR accessors. These give access to the condition, body and
1562 original condition type (before any compiler conversions)
1563 of the switch statement, respectively. */
1564 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1565 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1566 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1568 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1569 of a case label, respectively. */
1570 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1571 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1572 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1574 /* The operands of a TARGET_MEM_REF. */
1575 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1576 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1577 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1578 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1579 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1580 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1581 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1583 /* The operands of a BIND_EXPR. */
1584 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1585 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1586 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1588 /* GOTO_EXPR accessor. This gives access to the label associated with
1589 a goto statement. */
1590 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1592 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1593 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1594 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1596 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1597 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1598 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1599 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1600 /* Nonzero if we want to create an ASM_INPUT instead of an
1601 ASM_OPERAND with no operands. */
1602 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1603 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1605 /* COND_EXPR accessors. */
1606 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1607 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1608 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1610 /* Accessors for the chains of recurrences. */
1611 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1612 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1613 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1614 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1616 /* LABEL_EXPR accessor. This gives access to the label associated with
1617 the given label expression. */
1618 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1620 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1621 accessors for SSA operands. */
1623 /* CATCH_EXPR accessors. */
1624 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1625 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1627 /* EH_FILTER_EXPR accessors. */
1628 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1629 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1630 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1632 /* OBJ_TYPE_REF accessors. */
1633 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1634 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1635 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1637 /* ASSERT_EXPR accessors. */
1638 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1639 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1641 /* CALL_EXPR accessors.
1643 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1644 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1645 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1646 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1647 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1649 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1650 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1651 the argument count is zero when checking is enabled. Instead, do
1652 the pointer arithmetic to advance past the 3 fixed operands in a
1653 CALL_EXPR. That produces a valid pointer to just past the end of the
1654 operand array, even if it's not valid to dereference it. */
1655 #define CALL_EXPR_ARGP(NODE) \
1656 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1658 /* OpenMP directive and clause accessors. */
1660 #define OMP_BODY(NODE) \
1661 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1662 #define OMP_CLAUSES(NODE) \
1663 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1665 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1666 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1667 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1668 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1670 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1671 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1672 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1673 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1674 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1675 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1677 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1678 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1680 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1682 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1683 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1685 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1687 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1689 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1690 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1692 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1693 #define OMP_CLAUSE_DECL(NODE) \
1694 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1695 OMP_CLAUSE_PRIVATE, \
1696 OMP_CLAUSE_COPYPRIVATE), 0)
1698 /* True on an OMP_SECTION statement that was the last lexical member.
1699 This status is meaningful in the implementation of lastprivate. */
1700 #define OMP_SECTION_LAST(NODE) \
1701 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1703 /* True on an OMP_RETURN statement if the return does not require a
1704 thread synchronization via some sort of barrier. The exact barrier
1705 that would otherwise be emitted is dependent on the OMP statement
1706 with which this return is associated. */
1707 #define OMP_RETURN_NOWAIT(NODE) \
1708 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1710 /* True on an OMP_PARALLEL statement if it represents an explicit
1711 combined parallel work-sharing constructs. */
1712 #define OMP_PARALLEL_COMBINED(NODE) \
1713 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1715 /* True on a PRIVATE clause if its decl is kept around for debugging
1716 information only and its DECL_VALUE_EXPR is supposed to point
1717 to what it has been remapped to. */
1718 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1719 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1721 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1722 decl is present in the chain. */
1723 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1724 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1726 #define OMP_CLAUSE_IF_EXPR(NODE) \
1727 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1728 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1729 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1730 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1731 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1733 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1734 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1735 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1736 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1737 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1738 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1739 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1740 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1742 enum omp_clause_schedule_kind
1744 OMP_CLAUSE_SCHEDULE_STATIC,
1745 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1746 OMP_CLAUSE_SCHEDULE_GUIDED,
1747 OMP_CLAUSE_SCHEDULE_RUNTIME
1750 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1751 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1753 enum omp_clause_default_kind
1755 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1756 OMP_CLAUSE_DEFAULT_SHARED,
1757 OMP_CLAUSE_DEFAULT_NONE,
1758 OMP_CLAUSE_DEFAULT_PRIVATE
1761 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1762 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1764 struct tree_exp GTY(())
1766 struct tree_common common;
1769 tree GTY ((special ("tree_exp"),
1770 desc ("TREE_CODE ((tree) &%0)")))
1774 /* SSA_NAME accessors. */
1776 /* Returns the variable being referenced. Once released, this is the
1777 only field that can be relied upon. */
1778 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1780 /* Returns the statement which defines this reference. Note that
1781 we use the same field when chaining SSA_NAME nodes together on
1782 the SSA_NAME freelist. */
1783 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1785 /* Returns the SSA version number of this SSA name. Note that in
1786 tree SSA, version numbers are not per variable and may be recycled. */
1787 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1789 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1790 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1792 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1793 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1795 /* Nonzero if this SSA_NAME expression is currently on the free list of
1796 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1797 has no meaning for an SSA_NAME. */
1798 #define SSA_NAME_IN_FREE_LIST(NODE) \
1799 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1801 /* Nonzero if this SSA_NAME is the default definition for the
1802 underlying symbol. A default SSA name is created for symbol S if
1803 the very first reference to S in the function is a read operation.
1804 Default definitions are always created by an empty statement and
1805 belong to no basic block. */
1806 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1807 SSA_NAME_CHECK (NODE)->base.volatile_flag
1809 /* Attributes for SSA_NAMEs for pointer-type variables. */
1810 #define SSA_NAME_PTR_INFO(N) \
1811 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1813 /* Get the value of this SSA_NAME, if available. */
1814 #define SSA_NAME_VALUE(N) \
1815 SSA_NAME_CHECK (N)->ssa_name.value_handle
1817 #ifndef _TREE_FLOW_H
1818 struct ptr_info_def;
1823 /* Immediate use linking structure. This structure is used for maintaining
1824 a doubly linked list of uses of an SSA_NAME. */
1825 typedef struct ssa_use_operand_d GTY(())
1827 struct ssa_use_operand_d* GTY((skip(""))) prev;
1828 struct ssa_use_operand_d* GTY((skip(""))) next;
1829 tree GTY((skip(""))) stmt;
1830 tree *GTY((skip(""))) use;
1831 } ssa_use_operand_t;
1833 /* Return the immediate_use information for an SSA_NAME. */
1834 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1836 struct tree_ssa_name GTY(())
1838 struct tree_common common;
1840 /* _DECL wrapped by this SSA name. */
1843 /* SSA version number. */
1844 unsigned int version;
1846 /* Pointer attributes used for alias analysis. */
1847 struct ptr_info_def *ptr_info;
1849 /* Value for SSA name used by various passes.
1851 Right now only invariants are allowed to persist beyond a pass in
1852 this field; in the future we will allow VALUE_HANDLEs to persist
1856 /* Immediate uses list for this SSA_NAME. */
1857 struct ssa_use_operand_d imm_uses;
1860 /* In a PHI_NODE node. */
1862 /* These 2 macros should be considered off limits for use by developers. If
1863 you wish to access the use or def fields of a PHI_NODE in the SSA
1864 optimizers, use the accessor macros found in tree-ssa-operands.h.
1865 These two macros are to be used only by those accessor macros, and other
1866 select places where we *absolutely* must take the address of the tree. */
1868 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1869 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1871 /* PHI_NODEs for each basic block are chained together in a single linked
1872 list. The head of the list is linked from the block annotation, and
1873 the link to the next PHI is in PHI_CHAIN. */
1874 #define PHI_CHAIN(NODE) PHI_NODE_CHECK (NODE)->phi.chain
1876 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1877 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1878 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1879 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1880 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1881 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1883 struct phi_arg_d GTY(())
1885 /* imm_use MUST be the first element in struct because we do some
1886 pointer arithmetic with it. See phi_arg_index_from_use. */
1887 struct ssa_use_operand_d imm_use;
1891 struct tree_phi_node GTY(())
1893 struct tree_base common;
1899 /* Basic block holding this PHI node. */
1900 struct basic_block_def *bb;
1902 /* Arguments of the PHI node. These are maintained in the same
1903 order as predecessor edge vector BB->PREDS. */
1904 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1908 #define OMP_CLAUSE_CODE(NODE) \
1909 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1911 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1912 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1914 #define OMP_CLAUSE_CODE(NODE) \
1915 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1917 #define OMP_CLAUSE_OPERAND(NODE, I) \
1918 OMP_CLAUSE_ELT_CHECK (NODE, I)
1920 struct tree_omp_clause GTY(())
1922 struct tree_common common;
1923 enum omp_clause_code code;
1924 union omp_clause_subcode {
1925 enum omp_clause_default_kind default_kind;
1926 enum omp_clause_schedule_kind schedule_kind;
1927 enum tree_code reduction_code;
1928 } GTY ((skip)) subcode;
1929 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1933 struct varray_head_tag;
1935 /* In a BLOCK node. */
1936 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1937 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1938 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1939 /* Note: when changing this, make sure to find the places
1940 that use chainon or nreverse. */
1941 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1942 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1943 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1945 /* Nonzero means that this block is prepared to handle exceptions
1946 listed in the BLOCK_VARS slot. */
1947 #define BLOCK_HANDLER_BLOCK(NODE) \
1948 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1950 /* An index number for this block. These values are not guaranteed to
1951 be unique across functions -- whether or not they are depends on
1952 the debugging output format in use. */
1953 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1955 /* If block reordering splits a lexical block into discontiguous
1956 address ranges, we'll make a copy of the original block.
1958 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1959 In that case, we have one source block that has been replicated
1960 (through inlining or unrolling) into many logical blocks, and that
1961 these logical blocks have different physical variables in them.
1963 In this case, we have one logical block split into several
1964 non-contiguous address ranges. Most debug formats can't actually
1965 represent this idea directly, so we fake it by creating multiple
1966 logical blocks with the same variables in them. However, for those
1967 that do support non-contiguous regions, these allow the original
1968 logical block to be reconstructed, along with the set of address
1971 One of the logical block fragments is arbitrarily chosen to be
1972 the ORIGIN. The other fragments will point to the origin via
1973 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1974 be null. The list of fragments will be chained through
1975 BLOCK_FRAGMENT_CHAIN from the origin. */
1977 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1978 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1980 /* For an inlined function, this gives the location where it was called
1981 from. This is only set in the top level block, which corresponds to the
1982 inlined function scope. This is used in the debug output routines. */
1984 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1986 struct tree_block GTY(())
1988 struct tree_common common;
1990 unsigned handler_block_flag : 1;
1991 unsigned abstract_flag : 1;
1992 unsigned block_num : 30;
1997 tree abstract_origin;
1998 tree fragment_origin;
1999 tree fragment_chain;
2003 /* Define fields and accessors for nodes representing data types. */
2005 /* See tree.def for documentation of the use of these fields.
2006 Look at the documentation of the various ..._TYPE tree codes.
2008 Note that the type.values, type.minval, and type.maxval fields are
2009 overloaded and used for different macros in different kinds of types.
2010 Each macro must check to ensure the tree node is of the proper kind of
2011 type. Note also that some of the front-ends also overload these fields,
2012 so they must be checked as well. */
2014 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2015 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2016 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2017 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
2018 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2019 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2020 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2021 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2022 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2023 (INTEGER_TYPE_CHECK (NODE)->type.values \
2024 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2025 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2026 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2027 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2028 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2029 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2030 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2031 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2032 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2033 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2034 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2035 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2036 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2037 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2038 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2039 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2040 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2041 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2042 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2043 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2045 /* The "canonical" type for this type node, which can be used to
2046 compare the type for equality with another type. If two types are
2047 equal (based on the semantics of the language), then they will have
2048 equivalent TYPE_CANONICAL entries.
2050 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2051 be used for comparison against other types. Instead, the type is
2052 said to require structural equality checks, described in
2053 TYPE_STRUCTURAL_EQUALITY_P. */
2054 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2055 /* Indicates that the type node requires structural equality
2056 checks. The compiler will need to look at the composition of the
2057 type to determine whether it is equal to another type, rather than
2058 just comparing canonical type pointers. For instance, we would need
2059 to look at the return and parameter types of a FUNCTION_TYPE
2061 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2062 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2063 type node requires structural equality. */
2064 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2065 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2067 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2068 in the debugging output. We use this to describe a vector as a
2069 structure containing an array. */
2070 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2072 /* For record and union types, information about this type, as a base type
2074 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2076 /* For non record and union types, used in a language-dependent way. */
2077 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2079 /* The (language-specific) typed-based alias set for this type.
2080 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2081 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2082 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2083 type can alias objects of any type. */
2084 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2086 /* Nonzero iff the typed-based alias set for this type has been
2088 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2090 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2092 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2094 /* The alignment necessary for objects of this type.
2095 The value is an int, measured in bits. */
2096 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2098 /* 1 if the alignment for this type was requested by "aligned" attribute,
2099 0 if it is the default for this type. */
2100 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2102 /* The alignment for NODE, in bytes. */
2103 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2105 /* If your language allows you to declare types, and you want debug info
2106 for them, then you need to generate corresponding TYPE_DECL nodes.
2107 These "stub" TYPE_DECL nodes have no name, and simply point at the
2108 type node. You then set the TYPE_STUB_DECL field of the type node
2109 to point back at the TYPE_DECL node. This allows the debug routines
2110 to know that the two nodes represent the same type, so that we only
2111 get one debug info record for them. */
2112 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2114 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2115 has BLKmode only because it lacks the alignment requirement for
2117 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2119 /* In an INTEGER_TYPE, it means the type represents a size. We use
2120 this both for validity checking and to permit optimizations that
2121 are unsafe for other types. Note that the C `size_t' type should
2122 *not* have this flag set. The `size_t' type is simply a typedef
2123 for an ordinary integer type that happens to be the type of an
2124 expression returned by `sizeof'; `size_t' has no special
2125 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2126 always actual sizes. */
2127 #define TYPE_IS_SIZETYPE(NODE) \
2128 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2130 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
2131 pointer depressed. */
2132 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
2133 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2135 /* Nonzero in a type considered volatile as a whole. */
2136 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2138 /* Means this type is const-qualified. */
2139 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2141 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2143 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2145 /* There is a TYPE_QUAL value for each type qualifier. They can be
2146 combined by bitwise-or to form the complete set of qualifiers for a
2149 #define TYPE_UNQUALIFIED 0x0
2150 #define TYPE_QUAL_CONST 0x1
2151 #define TYPE_QUAL_VOLATILE 0x2
2152 #define TYPE_QUAL_RESTRICT 0x4
2154 /* The set of type qualifiers for this type. */
2155 #define TYPE_QUALS(NODE) \
2156 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2157 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2158 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2160 /* These flags are available for each language front end to use internally. */
2161 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2162 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2163 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2164 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2165 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2166 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2167 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2169 /* Used to keep track of visited nodes in tree traversals. This is set to
2170 0 by copy_node and make_node. */
2171 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2173 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2174 that distinguish string from array of char).
2175 If set in a INTEGER_TYPE, indicates a character type. */
2176 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2178 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2179 object of the given ARRAY_TYPE. This allows temporaries to be
2181 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2182 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2184 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2185 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2186 (((unsigned HOST_WIDE_INT) 1) \
2187 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2189 /* Set precision to n when we have 2^n sub-parts of the vector. */
2190 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2191 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2193 /* Indicates that objects of this type must be initialized by calling a
2194 function when they are created. */
2195 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2196 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2198 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2199 the same way that the first union alternative would be passed. */
2200 #define TYPE_TRANSPARENT_UNION(NODE) \
2201 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2203 /* For an ARRAY_TYPE, indicates that it is not permitted to
2204 take the address of a component of the type. */
2205 #define TYPE_NONALIASED_COMPONENT(NODE) \
2206 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2208 /* Indicated that objects of this type should be laid out in as
2209 compact a way as possible. */
2210 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2212 /* Used by type_contains_placeholder_p to avoid recomputation.
2213 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2214 this field directly. */
2215 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2216 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2220 struct tree_type GTY(())
2222 struct tree_common common;
2229 unsigned int precision : 9;
2230 ENUM_BITFIELD(machine_mode) mode : 7;
2232 unsigned string_flag : 1;
2233 unsigned no_force_blk_flag : 1;
2234 unsigned needs_constructing_flag : 1;
2235 unsigned transparent_union_flag : 1;
2236 unsigned packed_flag : 1;
2237 unsigned restrict_flag : 1;
2238 unsigned contains_placeholder_bits : 2;
2240 unsigned lang_flag_0 : 1;
2241 unsigned lang_flag_1 : 1;
2242 unsigned lang_flag_2 : 1;
2243 unsigned lang_flag_3 : 1;
2244 unsigned lang_flag_4 : 1;
2245 unsigned lang_flag_5 : 1;
2246 unsigned lang_flag_6 : 1;
2247 unsigned user_align : 1;
2252 union tree_type_symtab {
2253 int GTY ((tag ("0"))) address;
2254 char * GTY ((tag ("1"))) pointer;
2255 struct die_struct * GTY ((tag ("2"))) die;
2256 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2257 descbits ("2"))) symtab;
2266 HOST_WIDE_INT alias_set;
2267 /* Points to a structure whose details depend on the language in use. */
2268 struct lang_type *lang_specific;
2271 /* Define accessor macros for information about type inheritance
2274 A "basetype" means a particular usage of a data type for inheritance
2275 in another type. Each such basetype usage has its own "binfo"
2276 object to describe it. The binfo object is a TREE_VEC node.
2278 Inheritance is represented by the binfo nodes allocated for a
2279 given type. For example, given types C and D, such that D is
2280 inherited by C, 3 binfo nodes will be allocated: one for describing
2281 the binfo properties of C, similarly one for D, and one for
2282 describing the binfo properties of D as a base type for C.
2283 Thus, given a pointer to class C, one can get a pointer to the binfo
2284 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2286 /* BINFO specific flags. */
2288 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2289 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2291 /* Flags for language dependent use. */
2292 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2293 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2294 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2295 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2296 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2297 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2298 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2300 /* The actual data type node being inherited in this basetype. */
2301 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2303 /* The offset where this basetype appears in its containing type.
2304 BINFO_OFFSET slot holds the offset (in bytes)
2305 from the base of the complete object to the base of the part of the
2306 object that is allocated on behalf of this `type'.
2307 This is always 0 except when there is multiple inheritance. */
2309 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2310 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2312 /* The virtual function table belonging to this basetype. Virtual
2313 function tables provide a mechanism for run-time method dispatching.
2314 The entries of a virtual function table are language-dependent. */
2316 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2318 /* The virtual functions in the virtual function table. This is
2319 a TREE_LIST that is used as an initial approximation for building
2320 a virtual function table for this basetype. */
2321 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2323 /* A vector of binfos for the direct basetypes inherited by this
2326 If this basetype describes type D as inherited in C, and if the
2327 basetypes of D are E and F, then this vector contains binfos for
2328 inheritance of E and F by C. */
2329 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2331 /* The number of basetypes for NODE. */
2332 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2334 /* Accessor macro to get to the Nth base binfo of this binfo. */
2335 #define BINFO_BASE_BINFO(NODE,N) \
2336 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2337 #define BINFO_BASE_ITERATE(NODE,N,B) \
2338 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2339 #define BINFO_BASE_APPEND(NODE,T) \
2340 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2342 /* For a BINFO record describing a virtual base class, i.e., one where
2343 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2344 base. The actual contents are language-dependent. In the C++
2345 front-end this field is an INTEGER_CST giving an offset into the
2346 vtable where the offset to the virtual base can be found. */
2347 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2349 /* Indicates the accesses this binfo has to its bases. The values are
2350 access_public_node, access_protected_node or access_private_node.
2351 If this array is not present, public access is implied. */
2352 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2354 #define BINFO_BASE_ACCESS(NODE,N) \
2355 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2356 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2357 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2359 /* The index in the VTT where this subobject's sub-VTT can be found.
2360 NULL_TREE if there is no sub-VTT. */
2361 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2363 /* The index in the VTT where the vptr for this subobject can be
2364 found. NULL_TREE if there is no secondary vptr in the VTT. */
2365 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2367 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2368 inheriting this base for non-virtual bases. For virtual bases it
2369 points either to the binfo for which this is a primary binfo, or to
2370 the binfo of the most derived type. */
2371 #define BINFO_INHERITANCE_CHAIN(NODE) \
2372 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2374 struct tree_binfo GTY (())
2376 struct tree_common common;
2382 VEC(tree,gc) *base_accesses;
2388 VEC(tree,none) base_binfos;
2392 /* Define fields and accessors for nodes representing declared names. */
2394 /* Nonzero if DECL represents a variable for the SSA passes. */
2395 #define SSA_VAR_P(DECL) \
2396 (TREE_CODE (DECL) == VAR_DECL \
2397 || TREE_CODE (DECL) == PARM_DECL \
2398 || TREE_CODE (DECL) == RESULT_DECL \
2400 || (TREE_CODE (DECL) == SSA_NAME \
2401 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2402 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2403 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2404 || MTAG_P (SSA_NAME_VAR (DECL)))))
2409 /* Enumerate visibility settings. */
2410 #ifndef SYMBOL_VISIBILITY_DEFINED
2411 #define SYMBOL_VISIBILITY_DEFINED
2412 enum symbol_visibility
2415 VISIBILITY_PROTECTED,
2424 /* This is the name of the object as written by the user.
2425 It is an IDENTIFIER_NODE. */
2426 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2428 /* Every ..._DECL node gets a unique number. */
2429 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2431 /* These two fields describe where in the source code the declaration
2432 was. If the declaration appears in several places (as for a C
2433 function that is declared first and then defined later), this
2434 information should refer to the definition. */
2435 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2436 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2437 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2438 #ifdef USE_MAPPED_LOCATION
2439 #define DECL_IS_BUILTIN(DECL) \
2440 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2442 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2445 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2446 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2447 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2448 points to either the FUNCTION_DECL for the containing function,
2449 the RECORD_TYPE or UNION_TYPE for the containing type, or
2450 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2452 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2453 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2454 struct tree_decl_minimal GTY(())
2456 struct tree_common common;
2463 /* When computing aliasing information, we represent the memory pointed-to
2464 by pointers with artificial variables called "memory tags" (MT). There
2465 are two kinds of tags, namely symbol and name:
2467 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2468 represent all the pointed-to locations and variables pointed-to by
2469 the same pointer symbol. Usually, this set is computed using
2470 type-based analysis (i.e., alias set classes), but this may not
2473 Name tags (NMT) are used in flow-sensitive points-to alias
2474 analysis, they represent the variables and memory locations
2475 pointed-to by a specific SSA_NAME pointer.
2477 In general, given a pointer P with a symbol tag SMT, the alias set
2478 of SMT should be the union of all the alias sets of the NMTs of
2479 every SSA_NAME for P. */
2480 struct tree_memory_tag GTY(())
2482 struct tree_decl_minimal common;
2484 bitmap GTY ((skip)) aliases;
2486 unsigned int is_global:1;
2489 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2490 #define MTAG_ALIASES(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.aliases)
2492 struct tree_struct_field_tag GTY(())
2494 struct tree_memory_tag common;
2496 /* Parent variable. */
2499 /* Offset inside structure. */
2500 unsigned HOST_WIDE_INT offset;
2502 /* Size of the field. */
2503 unsigned HOST_WIDE_INT size;
2506 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2507 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2508 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2510 /* Memory Partition Tags (MPTs) group memory symbols under one
2511 common name for the purposes of placing memory PHI nodes. */
2513 struct tree_memory_partition_tag GTY(())
2515 struct tree_memory_tag common;
2517 /* Set of symbols grouped under this MPT. */
2521 #define MPT_SYMBOLS(NODE) (MEMORY_PARTITION_TAG_CHECK (NODE)->mpt.symbols)
2524 /* For any sort of a ..._DECL node, this points to the original (abstract)
2525 decl node which this decl is an instance of, or else it is NULL indicating
2526 that this decl is not an instance of some other decl. For example,
2527 in a nested declaration of an inline function, this points back to the
2529 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2531 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2532 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2533 #define DECL_ORIGIN(NODE) \
2534 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2536 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2537 inline instance of some original (abstract) decl from an inline function;
2538 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2539 nodes can also have their abstract origin set to themselves. */
2540 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2541 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2543 /* In a DECL this is the field where attributes are stored. */
2544 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2546 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2547 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2548 For a VAR_DECL, holds the initial value.
2549 For a PARM_DECL, not used--default
2550 values for parameters are encoded in the type of the function,
2551 not in the PARM_DECL slot.
2552 For a FIELD_DECL, this is used for enumeration values and the C
2553 frontend uses it for temporarily storing bitwidth of bitfields.
2555 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2556 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2558 /* Holds the size of the datum, in bits, as a tree expression.
2559 Need not be constant. */
2560 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2561 /* Likewise for the size in bytes. */
2562 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2563 /* Holds the alignment required for the datum, in bits. */
2564 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.u1.a.align)
2565 /* The alignment of NODE, in bytes. */
2566 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2567 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2568 DECL_FIELD_OFFSET which are known to be always zero.
2569 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2571 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2572 /* Holds the machine mode corresponding to the declaration of a variable or
2573 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2575 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2577 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2578 operation it is. Note, however, that this field is overloaded, with
2579 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2580 checked before any access to the former. */
2581 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_common.u1.f)
2582 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2583 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2585 /* Nonzero for a given ..._DECL node means that the name of this node should
2586 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2587 the body of the function should also be ignored. */
2588 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2590 /* Nonzero for a given ..._DECL node means that this node represents an
2591 "abstract instance" of the given declaration (e.g. in the original
2592 declaration of an inline function). When generating symbolic debugging
2593 information, we mustn't try to generate any address information for nodes
2594 marked as "abstract instances" because we don't actually generate
2595 any code or allocate any data space for such instances. */
2596 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2598 /* Language-specific decl information. */
2599 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2601 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2602 do not allocate storage, and refer to a definition elsewhere. Note that
2603 this does not necessarily imply the entity represented by NODE
2604 has no program source-level definition in this translation unit. For
2605 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2606 DECL_EXTERNAL may be true simultaneously; that can be the case for
2607 a C99 "extern inline" function. */
2608 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2610 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2611 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2613 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2615 Also set in some languages for variables, etc., outside the normal
2616 lexical scope, such as class instance variables. */
2617 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2619 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2620 Used in FIELD_DECLs for vtable pointers.
2621 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2622 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2624 /* Used to indicate that this DECL represents a compiler-generated entity. */
2625 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2627 /* Additional flags for language-specific uses. */
2628 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2629 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2630 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2631 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2632 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2633 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2634 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2635 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2637 /* Used to indicate an alias set for the memory pointed to by this
2638 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2639 pointer (or reference) type. */
2640 #define DECL_POINTER_ALIAS_SET(NODE) \
2641 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2643 /* Nonzero if an alias set has been assigned to this declaration. */
2644 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2645 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2647 /* Nonzero for a decl which is at file scope. */
2648 #define DECL_FILE_SCOPE_P(EXP) \
2649 (! DECL_CONTEXT (EXP) \
2650 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2652 /* Nonzero for a decl that is decorated using attribute used.
2653 This indicates compiler tools that this decl needs to be preserved. */
2654 #define DECL_PRESERVE_P(DECL) \
2655 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2657 /* For function local variables of COMPLEX and VECTOR types,
2658 indicates that the variable is not aliased, and that all
2659 modifications to the variable have been adjusted so that
2660 they are killing assignments. Thus the variable may now
2661 be treated as a GIMPLE register, and use real instead of
2662 virtual ops in SSA form. */
2663 #define DECL_GIMPLE_REG_P(DECL) \
2664 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2666 struct tree_decl_common GTY(())
2668 struct tree_decl_minimal common;
2671 ENUM_BITFIELD(machine_mode) mode : 8;
2673 unsigned nonlocal_flag : 1;
2674 unsigned virtual_flag : 1;
2675 unsigned ignored_flag : 1;
2676 unsigned abstract_flag : 1;
2677 unsigned artificial_flag : 1;
2678 unsigned user_align : 1;
2679 unsigned preserve_flag: 1;
2680 unsigned debug_expr_is_from : 1;
2682 unsigned lang_flag_0 : 1;
2683 unsigned lang_flag_1 : 1;
2684 unsigned lang_flag_2 : 1;
2685 unsigned lang_flag_3 : 1;
2686 unsigned lang_flag_4 : 1;
2687 unsigned lang_flag_5 : 1;
2688 unsigned lang_flag_6 : 1;
2689 unsigned lang_flag_7 : 1;
2691 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2692 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2693 unsigned decl_flag_0 : 1;
2694 /* In FIELD_DECL, this is DECL_PACKED. */
2695 unsigned decl_flag_1 : 1;
2696 /* In FIELD_DECL, this is DECL_BIT_FIELD
2697 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2698 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2699 unsigned decl_flag_2 : 1;
2700 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2701 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2702 unsigned decl_flag_3 : 1;
2703 /* Logically, these two would go in a theoretical base shared by var and
2705 unsigned gimple_reg_flag : 1;
2707 union tree_decl_u1 {
2708 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2709 DECL_FUNCTION_CODE. */
2710 enum built_in_function f;
2711 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2712 is used by language-dependent code. */
2714 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2716 struct tree_decl_u1_a {
2717 unsigned int align : 24;
2718 unsigned int off_align : 8;
2725 tree abstract_origin;
2727 HOST_WIDE_INT pointer_alias_set;
2728 /* Points to a structure whose details depend on the language in use. */
2729 struct lang_decl *lang_specific;
2732 extern tree decl_value_expr_lookup (tree);
2733 extern void decl_value_expr_insert (tree, tree);
2735 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2736 if transformations have made this more complicated than evaluating the
2737 decl itself. This should only be used for debugging; once this field has
2738 been set, the decl itself may not legitimately appear in the function. */
2739 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2740 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2741 #define DECL_VALUE_EXPR(NODE) \
2742 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2743 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2744 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2746 /* Holds the RTL expression for the value of a variable or function.
2747 This value can be evaluated lazily for functions, variables with
2748 static storage duration, and labels. */
2749 #define DECL_RTL(NODE) \
2750 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2751 ? (NODE)->decl_with_rtl.rtl \
2752 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2754 /* Set the DECL_RTL for NODE to RTL. */
2755 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2757 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2758 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2760 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2761 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2763 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2764 NODE1, it will not be set for NODE2; this is a lazy copy. */
2765 #define COPY_DECL_RTL(NODE1, NODE2) \
2766 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2768 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2769 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2771 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2772 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2774 struct tree_decl_with_rtl GTY(())
2776 struct tree_decl_common common;
2780 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2781 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2782 of the structure. */
2783 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2785 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2786 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2787 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2788 natural alignment of the field's type). */
2789 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2791 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2792 if so, the type that was originally specified for it.
2793 TREE_TYPE may have been modified (in finish_struct). */
2794 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2796 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2797 if nonzero, indicates that the field occupies the type. */
2798 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2800 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2801 DECL_FIELD_OFFSET which are known to be always zero.
2802 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2804 #define DECL_OFFSET_ALIGN(NODE) \
2805 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align)
2807 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2808 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2809 (FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align = exact_log2 ((X) & -(X)))
2810 /* 1 if the alignment for this type was requested by "aligned" attribute,
2811 0 if it is the default for this type. */
2813 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2814 which this FIELD_DECL is defined. This information is needed when
2815 writing debugging information about vfield and vbase decls for C++. */
2816 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2818 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2819 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2821 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2823 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2825 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2827 #define DECL_NONADDRESSABLE_P(NODE) \
2828 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2830 struct tree_field_decl GTY(())
2832 struct tree_decl_common common;
2835 tree bit_field_type;
2842 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2843 dense, unique within any one function, and may be used to index arrays.
2844 If the value is -1, then no UID has been assigned. */
2845 #define LABEL_DECL_UID(NODE) \
2846 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2848 /* In LABEL_DECL nodes, nonzero means that an error message about
2849 jumping into such a binding contour has been printed for this label. */
2850 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2852 struct tree_label_decl GTY(())
2854 struct tree_decl_with_rtl common;
2855 /* Java's verifier has some need to store information about labels,
2856 and was using fields that no longer exist on labels.
2857 Once the verifier doesn't need these anymore, they should be removed. */
2861 unsigned int java_field_4;
2865 struct tree_result_decl GTY(())
2867 struct tree_decl_with_rtl common;
2870 struct tree_const_decl GTY(())
2872 struct tree_decl_with_rtl common;
2875 /* For a PARM_DECL, records the data type used to pass the argument,
2876 which may be different from the type seen in the program. */
2877 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2879 /* For PARM_DECL, holds an RTL for the stack slot or register
2880 where the data was actually passed. */
2881 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2883 struct tree_parm_decl GTY(())
2885 struct tree_decl_with_rtl common;
2890 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2891 this variable in a BIND_EXPR. */
2892 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2893 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2895 /* Used to indicate that the linkage status of this DECL is not yet known,
2896 so it should not be output now. */
2897 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2899 /* Nonzero for a given ..._DECL node means that no warnings should be
2900 generated just because this node is unused. */
2901 #define DECL_IN_SYSTEM_HEADER(NODE) \
2902 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2904 /* Used to indicate that this DECL has weak linkage. */
2905 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2907 /* Internal to the gimplifier. Indicates that the value is a formal
2908 temporary controlled by the gimplifier. */
2909 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2910 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2912 /* Used to indicate that the DECL is a dllimport. */
2913 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2915 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2916 based on a variable with a restrict qualified type. If it is,
2917 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2920 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2921 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2922 #define DECL_GET_RESTRICT_BASE(NODE) \
2923 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2924 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2925 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2927 extern tree decl_restrict_base_lookup (tree);
2928 extern void decl_restrict_base_insert (tree, tree);
2930 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2931 not be put out unless it is needed in this translation unit.
2932 Entities like this are shared across translation units (like weak
2933 entities), but are guaranteed to be generated by any translation
2934 unit that needs them, and therefore need not be put out anywhere
2935 where they are not needed. DECL_COMDAT is just a hint to the
2936 back-end; it is up to front-ends which set this flag to ensure
2937 that there will never be any harm, other than bloat, in putting out
2938 something which is DECL_COMDAT. */
2939 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2941 /* A replaceable function is one which may be replaced at link-time
2942 with an entirely different definition, provided that the
2943 replacement has the same type. For example, functions declared
2944 with __attribute__((weak)) on most systems are replaceable.
2946 COMDAT functions are not replaceable, since all definitions of the
2947 function must be equivalent. It is important that COMDAT functions
2948 not be treated as replaceable so that use of C++ template
2949 instantiations is not penalized.
2951 For example, DECL_REPLACEABLE is used to determine whether or not a
2952 function (including a template instantiation) which is not
2953 explicitly declared "inline" can be inlined. If the function is
2954 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2955 implementation chosen at link-time may be different. However, a
2956 function that is not DECL_REPLACEABLE can be inlined, since all
2957 versions of the function will be functionally identical. */
2958 #define DECL_REPLACEABLE_P(NODE) \
2959 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2961 /* The name of the object as the assembler will see it (but before any
2962 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2963 as DECL_NAME. It is an IDENTIFIER_NODE. */
2964 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2966 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2967 This is true of all DECL nodes except FIELD_DECL. */
2968 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2969 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2971 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2972 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2974 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2975 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2977 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2978 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2979 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2981 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2982 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2983 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2984 semantics of using this macro, are different than saying:
2986 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2988 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2990 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2991 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2992 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2993 DECL_ASSEMBLER_NAME (DECL1)) \
2996 /* Records the section name in a section attribute. Used to pass
2997 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2998 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3000 /* Value of the decls's visibility attribute */
3001 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3003 /* Nonzero means that the decl had its visibility specified rather than
3005 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3007 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3008 multiple translation units should be merged. */
3009 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
3011 struct tree_decl_with_vis GTY(())
3013 struct tree_decl_with_rtl common;
3014 tree assembler_name;
3017 /* Belong to VAR_DECL exclusively. */
3018 unsigned defer_output:1;
3019 unsigned hard_register:1;
3020 unsigned thread_local:1;
3021 unsigned common_flag:1;
3022 unsigned in_text_section : 1;
3023 unsigned gimple_formal_temp : 1;
3024 unsigned dllimport_flag : 1;
3025 unsigned based_on_restrict_p : 1;
3026 /* Used by C++. Might become a generic decl flag. */
3027 unsigned shadowed_for_var_p : 1;
3029 /* Don't belong to VAR_DECL exclusively. */
3030 unsigned in_system_header_flag : 1;
3031 unsigned weak_flag:1;
3032 unsigned seen_in_bind_expr : 1;
3033 unsigned comdat_flag : 1;
3034 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3035 unsigned visibility_specified : 1;
3036 /* Belong to FUNCTION_DECL exclusively. */
3037 unsigned one_only : 1;
3038 unsigned init_priority_p:1;
3040 /* Belongs to VAR_DECL exclusively. */
3041 ENUM_BITFIELD(tls_model) tls_model : 3;
3042 /* 11 unused bits. */
3045 /* In a VAR_DECL that's static,
3046 nonzero if the space is in the text section. */
3047 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3049 /* Nonzero for a given ..._DECL node means that this node should be
3050 put in .common, if possible. If a DECL_INITIAL is given, and it
3051 is not error_mark_node, then the decl cannot be put in .common. */
3052 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3054 /* In a VAR_DECL, nonzero if the decl is a register variable with
3055 an explicit asm specification. */
3056 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3058 extern tree decl_debug_expr_lookup (tree);
3059 extern void decl_debug_expr_insert (tree, tree);
3060 /* For VAR_DECL, this is set to either an expression that it was split
3061 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3062 subexpressions that it was split into. */
3063 #define DECL_DEBUG_EXPR(NODE) \
3064 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3066 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3067 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3069 /* An initializationp priority. */
3070 typedef unsigned short priority_type;
3072 extern priority_type decl_init_priority_lookup (tree);
3073 extern priority_type decl_fini_priority_lookup (tree);
3074 extern void decl_init_priority_insert (tree, priority_type);
3075 extern void decl_fini_priority_insert (tree, priority_type);
3077 /* In a non-local VAR_DECL with static storage duration, true if the
3078 variable has an initialization priority. If false, the variable
3079 will be initialized at the DEFAULT_INIT_PRIORITY. */
3080 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3081 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3083 /* For a VAR_DECL or FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set,
3084 the initialization priority of NODE. */
3085 #define DECL_INIT_PRIORITY(NODE) \
3086 (decl_init_priority_lookup (NODE))
3087 /* Set the initialization priority for NODE to VAL. */
3088 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3089 (decl_init_priority_insert (NODE, VAL))
3091 /* For a FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set, the
3092 finalization priority of NODE. */
3093 #define DECL_FINI_PRIORITY(NODE) \
3094 (decl_fini_priority_lookup (NODE))
3095 /* Set the finalization priority for NODE to VAL. */
3096 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3097 (decl_fini_priority_insert (NODE, VAL))
3099 /* The initialization priority for entities for which no explicit
3100 initialization priority has been specified. */
3101 #define DEFAULT_INIT_PRIORITY 65535
3103 /* The maximum allowed initialization priority. */
3104 #define MAX_INIT_PRIORITY 65535
3106 /* The largest priority value reserved for use by system runtime
3108 #define MAX_RESERVED_INIT_PRIORITY 100
3110 /* In a VAR_DECL, the model to use if the data should be allocated from
3111 thread-local storage. */
3112 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3114 /* In a VAR_DECL, nonzero if the data should be allocated from
3115 thread-local storage. */
3116 #define DECL_THREAD_LOCAL_P(NODE) \
3117 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
3119 struct tree_var_decl GTY(())
3121 struct tree_decl_with_vis common;
3125 /* This field is used to reference anything in decl.result and is meant only
3126 for use by the garbage collector. */
3127 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3129 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3130 Before the struct containing the FUNCTION_DECL is laid out,
3131 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3132 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3133 function. When the class is laid out, this pointer is changed
3134 to an INTEGER_CST node which is suitable for use as an index
3135 into the virtual function table.
3136 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3137 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3139 struct tree_decl_non_common GTY(())
3142 struct tree_decl_with_vis common;
3143 /* C++ uses this in namespaces. */
3145 /* C++ uses this in templates. */
3147 /* Almost all FE's use this. */
3149 /* C++ uses this in namespaces. */
3153 /* In FUNCTION_DECL, holds the decl for the return value. */
3154 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3156 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3157 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3159 /* In a FUNCTION_DECL, the saved representation of the body of the
3161 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3163 /* Nonzero in a FUNCTION_DECL means this function should be treated
3164 as if it were a malloc, meaning it returns a pointer that is
3166 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3168 /* Nonzero in a FUNCTION_DECL means this function may return more
3170 #define DECL_IS_RETURNS_TWICE(NODE) \
3171 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3173 /* Nonzero in a FUNCTION_DECL means this function should be treated
3174 as "pure" function (like const function, but may read global memory). */
3175 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3177 /* Nonzero in a FUNCTION_DECL means this function should be treated
3178 as "novops" function (function that does not read global memory,
3179 but may have arbitrary side effects). */
3180 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3182 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3183 at the beginning or end of execution. */
3184 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3185 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3187 #define DECL_STATIC_DESTRUCTOR(NODE) \
3188 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3190 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3191 be instrumented with calls to support routines. */
3192 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3193 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3195 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3196 disabled in this function. */
3197 #define DECL_NO_LIMIT_STACK(NODE) \
3198 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3200 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3201 static chain is not needed. */
3202 #define DECL_NO_STATIC_CHAIN(NODE) \
3203 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3205 /* Nonzero for a decl that cgraph has decided should be inlined into
3206 at least one call site. It is not meaningful to look at this
3207 directly; always use cgraph_function_possibly_inlined_p. */
3208 #define DECL_POSSIBLY_INLINED(DECL) \
3209 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3211 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3212 where it is called. */
3213 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3215 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3216 such as via the `inline' keyword in C/C++. This flag controls the linkage
3217 semantics of 'inline'; whether or not the function is inlined is
3218 controlled by DECL_INLINE. */
3219 #define DECL_DECLARED_INLINE_P(NODE) \
3220 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3222 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3223 that describes the status of this function. */
3224 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3226 /* In a FUNCTION_DECL, nonzero means a built in function. */
3227 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3229 /* For a builtin function, identify which part of the compiler defined it. */
3230 #define DECL_BUILT_IN_CLASS(NODE) \
3231 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3233 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3234 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3236 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3237 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3239 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3240 arguments/result/saved_tree fields by front ends. It was either inherit
3241 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3242 which seemed a bit strange. */
3244 struct tree_function_decl GTY(())
3246 struct tree_decl_non_common common;
3248 unsigned static_ctor_flag : 1;
3249 unsigned static_dtor_flag : 1;
3250 unsigned uninlinable : 1;
3251 unsigned possibly_inlined : 1;
3252 unsigned novops_flag : 1;
3253 unsigned returns_twice_flag : 1;
3254 unsigned malloc_flag : 1;
3255 unsigned pure_flag : 1;
3257 unsigned declared_inline_flag : 1;
3258 unsigned regdecl_flag : 1;
3259 unsigned inline_flag : 1;
3260 unsigned no_instrument_function_entry_exit : 1;
3261 unsigned no_limit_stack : 1;
3262 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3267 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3268 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3270 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3271 into stabs. Instead it will generate cross reference ('x') of names.
3272 This uses the same flag as DECL_EXTERNAL. */
3273 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3274 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3276 struct tree_type_decl GTY(())
3278 struct tree_decl_non_common common;
3282 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3283 To reduce overhead, the nodes containing the statements are not trees.
3284 This avoids the overhead of tree_common on all linked list elements.
3286 Use the interface in tree-iterator.h to access this node. */
3288 #define STATEMENT_LIST_HEAD(NODE) \
3289 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3290 #define STATEMENT_LIST_TAIL(NODE) \
3291 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3293 struct tree_statement_list_node
3294 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3296 struct tree_statement_list_node *prev;
3297 struct tree_statement_list_node *next;
3301 struct tree_statement_list
3304 struct tree_common common;
3305 struct tree_statement_list_node *head;
3306 struct tree_statement_list_node *tail;
3309 #define VALUE_HANDLE_ID(NODE) \
3310 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3312 #define VALUE_HANDLE_EXPR_SET(NODE) \
3313 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3315 #define VALUE_HANDLE_VUSES(NODE) \
3316 (VALUE_HANDLE_CHECK (NODE)->value_handle.vuses)
3318 /* Defined and used in tree-ssa-pre.c. */
3320 struct tree_value_handle GTY(())
3322 struct tree_common common;
3324 /* The set of expressions represented by this handle. */
3325 struct bitmap_set * GTY ((skip)) expr_set;
3327 /* Unique ID for this value handle. IDs are handed out in a
3328 conveniently dense form starting at 0, so that we can make
3329 bitmaps of value handles. */
3332 /* Set of virtual uses represented by this handle. */
3333 VEC (tree, gc) *vuses;
3336 /* Define the overall contents of a tree node.
3337 It may be any of the structures declared above
3338 for various types of node. */
3340 union tree_node GTY ((ptr_alias (union lang_tree_node),
3341 desc ("tree_node_structure (&%h)")))
3343 struct tree_base GTY ((tag ("TS_BASE"))) base;
3344 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3345 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3346 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3347 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3348 struct tree_string GTY ((tag ("TS_STRING"))) string;
3349 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3350 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3351 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3352 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3353 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3354 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3355 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3356 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3357 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3358 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3359 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3360 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3361 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3362 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3363 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3364 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3365 struct tree_list GTY ((tag ("TS_LIST"))) list;
3366 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3367 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3368 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3369 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3370 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3371 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3372 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3373 struct gimple_stmt GTY ((tag ("TS_GIMPLE_STATEMENT"))) gstmt;
3374 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3375 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3376 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3377 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3378 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3379 struct tree_memory_partition_tag GTY ((tag ("TS_MEMORY_PARTITION_TAG"))) mpt;
3382 /* Standard named or nameless data types of the C compiler. */
3404 TI_INTEGER_MINUS_ONE,
3421 TI_COMPLEX_INTEGER_TYPE,
3422 TI_COMPLEX_FLOAT_TYPE,
3423 TI_COMPLEX_DOUBLE_TYPE,
3424 TI_COMPLEX_LONG_DOUBLE_TYPE,
3428 TI_LONG_DOUBLE_TYPE,
3432 TI_LONG_DOUBLE_PTR_TYPE,
3433 TI_INTEGER_PTR_TYPE,
3442 TI_VA_LIST_GPR_COUNTER_FIELD,
3443 TI_VA_LIST_FPR_COUNTER_FIELD,
3450 TI_DFLOAT32_PTR_TYPE,
3451 TI_DFLOAT64_PTR_TYPE,
3452 TI_DFLOAT128_PTR_TYPE,
3461 extern GTY(()) tree global_trees[TI_MAX];
3463 #define error_mark_node global_trees[TI_ERROR_MARK]
3465 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3466 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3467 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3468 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3469 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3471 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3472 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3473 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3474 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3475 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3477 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3478 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3480 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3481 #define integer_one_node global_trees[TI_INTEGER_ONE]
3482 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3483 #define size_zero_node global_trees[TI_SIZE_ZERO]
3484 #define size_one_node global_trees[TI_SIZE_ONE]
3485 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3486 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3487 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3489 /* Base access nodes. */
3490 #define access_public_node global_trees[TI_PUBLIC]
3491 #define access_protected_node global_trees[TI_PROTECTED]
3492 #define access_private_node global_trees[TI_PRIVATE]
3494 #define null_pointer_node global_trees[TI_NULL_POINTER]
3496 #define float_type_node global_trees[TI_FLOAT_TYPE]
3497 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3498 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3500 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3501 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3502 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3503 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3505 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3506 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3507 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3508 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3510 #define void_type_node global_trees[TI_VOID_TYPE]
3511 /* The C type `void *'. */
3512 #define ptr_type_node global_trees[TI_PTR_TYPE]
3513 /* The C type `const void *'. */
3514 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3515 /* The C type `size_t'. */
3516 #define size_type_node global_trees[TI_SIZE_TYPE]
3517 #define pid_type_node global_trees[TI_PID_TYPE]
3518 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3519 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3520 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3521 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3522 /* The C type `FILE *'. */
3523 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3525 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3526 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3527 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3529 /* The decimal floating point types. */
3530 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3531 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3532 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3533 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3534 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3535 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3537 /* The node that should be placed at the end of a parameter list to
3538 indicate that the function does not take a variable number of
3539 arguments. The TREE_VALUE will be void_type_node and there will be
3540 no TREE_CHAIN. Language-independent code should not assume
3541 anything else about this node. */
3542 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3544 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3545 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3547 /* An enumeration of the standard C integer types. These must be
3548 ordered so that shorter types appear before longer ones, and so
3549 that signed types appear before unsigned ones, for the correct
3550 functioning of interpret_integer() in c-lex.c. */
3551 enum integer_type_kind
3563 itk_unsigned_long_long,
3567 typedef enum integer_type_kind integer_type_kind;
3569 /* The standard C integer types. Use integer_type_kind to index into
3571 extern GTY(()) tree integer_types[itk_none];
3573 #define char_type_node integer_types[itk_char]
3574 #define signed_char_type_node integer_types[itk_signed_char]
3575 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3576 #define short_integer_type_node integer_types[itk_short]
3577 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3578 #define integer_type_node integer_types[itk_int]
3579 #define unsigned_type_node integer_types[itk_unsigned_int]
3580 #define long_integer_type_node integer_types[itk_long]
3581 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3582 #define long_long_integer_type_node integer_types[itk_long_long]
3583 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3585 /* Set to the default thread-local storage (tls) model to use. */
3587 extern enum tls_model flag_tls_default;
3590 /* A pointer-to-function member type looks like:
3597 If __pfn is NULL, it is a NULL pointer-to-member-function.
3599 (Because the vtable is always the first thing in the object, we
3600 don't need its offset.) If the function is virtual, then PFN is
3601 one plus twice the index into the vtable; otherwise, it is just a
3602 pointer to the function.
3604 Unfortunately, using the lowest bit of PFN doesn't work in
3605 architectures that don't impose alignment requirements on function
3606 addresses, or that use the lowest bit to tell one ISA from another,
3607 for example. For such architectures, we use the lowest bit of
3608 DELTA instead of the lowest bit of the PFN, and DELTA will be
3611 enum ptrmemfunc_vbit_where_t
3613 ptrmemfunc_vbit_in_pfn,
3614 ptrmemfunc_vbit_in_delta
3617 #define NULL_TREE (tree) NULL
3619 extern tree decl_assembler_name (tree);
3620 extern bool decl_assembler_name_equal (tree decl, tree asmname);
3622 /* Compute the number of bytes occupied by 'node'. This routine only
3623 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3625 extern size_t tree_size (tree);
3627 /* Compute the number of bytes occupied by a tree with code CODE. This
3628 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3630 extern size_t tree_code_size (enum tree_code);
3632 /* Lowest level primitive for allocating a node.
3633 The TREE_CODE is the only argument. Contents are initialized
3634 to zero except for a few of the common fields. */
3636 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3637 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3639 /* Make a copy of a node, with all the same contents. */
3641 extern tree copy_node_stat (tree MEM_STAT_DECL);
3642 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3644 /* Make a copy of a chain of TREE_LIST nodes. */
3646 extern tree copy_list (tree);
3649 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3650 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3652 /* Make a TREE_VEC. */
3654 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3655 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3657 /* Tree nodes for SSA analysis. */
3659 extern void init_phinodes (void);
3660 extern void fini_phinodes (void);
3661 extern void release_phi_node (tree);
3662 #ifdef GATHER_STATISTICS
3663 extern void phinodes_print_statistics (void);
3666 extern void init_ssanames (void);
3667 extern void fini_ssanames (void);
3668 extern tree make_ssa_name (tree, tree);
3669 extern tree duplicate_ssa_name (tree, tree);
3670 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3671 extern void release_ssa_name (tree);
3672 extern void release_defs (tree);
3673 extern void replace_ssa_name_symbol (tree, tree);
3675 #ifdef GATHER_STATISTICS
3676 extern void ssanames_print_statistics (void);
3679 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3680 The name is supplied as a char *. */
3682 extern tree get_identifier (const char *);
3684 #if GCC_VERSION >= 3000
3685 #define get_identifier(str) \
3686 (__builtin_constant_p (str) \
3687 ? get_identifier_with_length ((str), strlen (str)) \
3688 : get_identifier (str))
3692 /* Identical to get_identifier, except that the length is assumed
3695 extern tree get_identifier_with_length (const char *, size_t);
3697 /* If an identifier with the name TEXT (a null-terminated string) has
3698 previously been referred to, return that node; otherwise return
3701 extern tree maybe_get_identifier (const char *);
3703 /* Construct various types of nodes. */
3705 extern tree build_nt (enum tree_code, ...);
3706 extern tree build_nt_call_list (tree, tree);
3708 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3709 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3710 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3711 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3712 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3713 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3714 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3715 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3716 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3717 tree MEM_STAT_DECL);
3718 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3719 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3720 tree MEM_STAT_DECL);
3721 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3722 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3723 tree, tree, tree MEM_STAT_DECL);
3724 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3725 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3727 extern tree build_gimple_modify_stmt_stat (tree, tree MEM_STAT_DECL);
3728 #define build_gimple_modify_stmt(t1,t2) \
3729 build_gimple_modify_stmt_stat (t1,t2 MEM_STAT_INFO)
3731 extern tree build_int_cst (tree, HOST_WIDE_INT);
3732 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3733 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3734 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3735 extern tree build_int_cst_wide_type (tree,
3736 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3737 extern tree build_vector (tree, tree);
3738 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3739 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3740 extern tree build_constructor_single (tree, tree, tree);
3741 extern tree build_constructor_from_list (tree, tree);
3742 extern tree build_real_from_int_cst (tree, tree);
3743 extern tree build_complex (tree, tree, tree);
3744 extern tree build_one_cst (tree);
3745 extern tree build_string (int, const char *);
3746 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3747 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3748 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3749 extern tree build_fn_decl (const char *, tree);
3750 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3751 extern tree build_block (tree, tree, tree, tree);
3752 #ifndef USE_MAPPED_LOCATION
3753 extern void annotate_with_file_line (tree, const char *, int);
3754 extern void annotate_with_locus (tree, location_t);
3756 extern tree build_empty_stmt (void);
3757 extern tree build_omp_clause (enum omp_clause_code);
3759 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3760 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3762 extern tree build_call_list (tree, tree, tree);
3763 extern tree build_call_nary (tree, tree, int, ...);
3764 extern tree build_call_valist (tree, tree, int, va_list);
3765 extern tree build_call_array (tree, tree, int, tree*);
3767 /* Construct various nodes representing data types. */
3769 extern tree make_signed_type (int);
3770 extern tree make_unsigned_type (int);
3771 extern tree signed_type_for (tree);
3772 extern tree unsigned_type_for (tree);
3773 extern void initialize_sizetypes (bool);
3774 extern void set_sizetype (tree);
3775 extern void fixup_unsigned_type (tree);
3776 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3777 extern tree build_pointer_type (tree);
3778 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3779 extern tree build_reference_type (tree);
3780 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3781 extern tree build_vector_type (tree innertype, int nunits);
3782 extern tree build_type_no_quals (tree);
3783 extern tree build_index_type (tree);
3784 extern tree build_index_2_type (tree, tree);
3785 extern tree build_array_type (tree, tree);
3786 extern tree build_function_type (tree, tree);
3787 extern tree build_function_type_list (tree, ...);
3788 extern tree build_method_type_directly (tree, tree, tree);
3789 extern tree build_method_type (tree, tree);
3790 extern tree build_offset_type (tree, tree);
3791 extern tree build_complex_type (tree);
3792 extern tree build_resx (int);
3793 extern tree array_type_nelts (tree);
3794 extern bool in_array_bounds_p (tree);
3795 extern bool range_in_array_bounds_p (tree);
3797 extern tree value_member (tree, tree);
3798 extern tree purpose_member (tree, tree);
3800 extern int attribute_list_equal (tree, tree);
3801 extern int attribute_list_contained (tree, tree);
3802 extern int tree_int_cst_equal (tree, tree);
3803 extern int tree_int_cst_lt (tree, tree);
3804 extern int tree_int_cst_compare (tree, tree);
3805 extern int host_integerp (tree, int);
3806 extern HOST_WIDE_INT tree_low_cst (tree, int);
3807 extern int tree_int_cst_msb (tree);
3808 extern int tree_int_cst_sgn (tree);
3809 extern int tree_int_cst_sign_bit (tree);
3810 extern bool tree_expr_nonnegative_p (tree);
3811 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
3812 extern bool may_negate_without_overflow_p (tree);
3813 extern tree get_inner_array_type (tree);
3815 extern tree get_signed_or_unsigned_type (int unsignedp, tree type);
3817 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3818 put the prototype here. Rtl.h does declare the prototype if
3819 tree.h had been included. */
3821 extern tree make_tree (tree, rtx);
3823 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3826 Such modified types already made are recorded so that duplicates
3829 extern tree build_type_attribute_variant (tree, tree);
3830 extern tree build_decl_attribute_variant (tree, tree);
3832 /* Structure describing an attribute and a function to handle it. */
3833 struct attribute_spec
3835 /* The name of the attribute (without any leading or trailing __),
3836 or NULL to mark the end of a table of attributes. */
3837 const char *const name;
3838 /* The minimum length of the list of arguments of the attribute. */
3839 const int min_length;
3840 /* The maximum length of the list of arguments of the attribute
3841 (-1 for no maximum). */
3842 const int max_length;
3843 /* Whether this attribute requires a DECL. If it does, it will be passed
3844 from types of DECLs, function return types and array element types to
3845 the DECLs, function types and array types respectively; but when
3846 applied to a type in any other circumstances, it will be ignored with
3847 a warning. (If greater control is desired for a given attribute,
3848 this should be false, and the flags argument to the handler may be
3849 used to gain greater control in that case.) */
3850 const bool decl_required;
3851 /* Whether this attribute requires a type. If it does, it will be passed
3852 from a DECL to the type of that DECL. */
3853 const bool type_required;
3854 /* Whether this attribute requires a function (or method) type. If it does,
3855 it will be passed from a function pointer type to the target type,
3856 and from a function return type (which is not itself a function
3857 pointer type) to the function type. */
3858 const bool function_type_required;
3859 /* Function to handle this attribute. NODE points to the node to which
3860 the attribute is to be applied. If a DECL, it should be modified in
3861 place; if a TYPE, a copy should be created. NAME is the name of the
3862 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3863 of the arguments (which may be NULL). FLAGS gives further information
3864 about the context of the attribute. Afterwards, the attributes will
3865 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3866 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3867 as well as in any other cases when the attributes should not be added
3868 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3869 applied to another type or DECL later may be returned;
3870 otherwise the return value should be NULL_TREE. This pointer may be
3871 NULL if no special handling is required beyond the checks implied
3872 by the rest of this structure. */
3873 tree (*const handler) (tree *node, tree name, tree args,
3874 int flags, bool *no_add_attrs);
3877 /* Flags that may be passed in the third argument of decl_attributes, and
3878 to handler functions for attributes. */
3879 enum attribute_flags
3881 /* The type passed in is the type of a DECL, and any attributes that
3882 should be passed in again to be applied to the DECL rather than the
3883 type should be returned. */
3884 ATTR_FLAG_DECL_NEXT = 1,
3885 /* The type passed in is a function return type, and any attributes that
3886 should be passed in again to be applied to the function type rather
3887 than the return type should be returned. */
3888 ATTR_FLAG_FUNCTION_NEXT = 2,
3889 /* The type passed in is an array element type, and any attributes that
3890 should be passed in again to be applied to the array type rather
3891 than the element type should be returned. */
3892 ATTR_FLAG_ARRAY_NEXT = 4,
3893 /* The type passed in is a structure, union or enumeration type being
3894 created, and should be modified in place. */
3895 ATTR_FLAG_TYPE_IN_PLACE = 8,
3896 /* The attributes are being applied by default to a library function whose
3897 name indicates known behavior, and should be silently ignored if they
3898 are not in fact compatible with the function type. */
3899 ATTR_FLAG_BUILT_IN = 16
3902 /* Default versions of target-overridable functions. */
3904 extern tree merge_decl_attributes (tree, tree);
3905 extern tree merge_type_attributes (tree, tree);
3907 /* Given a tree node and a string, return nonzero if the tree node is
3908 a valid attribute name for the string. */
3910 extern int is_attribute_p (const char *, tree);
3912 /* Given an attribute name and a list of attributes, return the list element
3913 of the attribute or NULL_TREE if not found. */
3915 extern tree lookup_attribute (const char *, tree);
3917 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3920 extern tree remove_attribute (const char *, tree);
3922 /* Given two attributes lists, return a list of their union. */
3924 extern tree merge_attributes (tree, tree);
3926 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3927 /* Given two Windows decl attributes lists, possibly including
3928 dllimport, return a list of their union . */
3929 extern tree merge_dllimport_decl_attributes (tree, tree);
3931 /* Handle a "dllimport" or "dllexport" attribute. */
3932 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3935 /* Check whether CAND is suitable to be returned from get_qualified_type
3936 (BASE, TYPE_QUALS). */
3938 extern bool check_qualified_type (tree, tree, int);
3940 /* Return a version of the TYPE, qualified as indicated by the
3941 TYPE_QUALS, if one exists. If no qualified version exists yet,
3942 return NULL_TREE. */
3944 extern tree get_qualified_type (tree, int);
3946 /* Like get_qualified_type, but creates the type if it does not
3947 exist. This function never returns NULL_TREE. */
3949 extern tree build_qualified_type (tree, int);
3951 /* Like build_qualified_type, but only deals with the `const' and
3952 `volatile' qualifiers. This interface is retained for backwards
3953 compatibility with the various front-ends; new code should use
3954 build_qualified_type instead. */
3956 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3957 build_qualified_type ((TYPE), \
3958 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3959 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3961 /* Make a copy of a type node. */
3963 extern tree build_distinct_type_copy (tree);
3964 extern tree build_variant_type_copy (tree);
3966 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3967 fields. Optionally specify an alignment, and then lay it out. */
3969 extern void finish_builtin_struct (tree, const char *,
3972 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3973 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3974 node, does nothing except for the first time. */
3976 extern void layout_type (tree);
3978 /* These functions allow a front-end to perform a manual layout of a
3979 RECORD_TYPE. (For instance, if the placement of subsequent fields
3980 depends on the placement of fields so far.) Begin by calling
3981 start_record_layout. Then, call place_field for each of the
3982 fields. Then, call finish_record_layout. See layout_type for the
3983 default way in which these functions are used. */
3985 typedef struct record_layout_info_s
3987 /* The RECORD_TYPE that we are laying out. */
3989 /* The offset into the record so far, in bytes, not including bits in
3992 /* The last known alignment of SIZE. */
3993 unsigned int offset_align;
3994 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3996 /* The alignment of the record so far, in bits. */
3997 unsigned int record_align;
3998 /* The alignment of the record so far, ignoring #pragma pack and
3999 __attribute__ ((packed)), in bits. */
4000 unsigned int unpacked_align;
4001 /* The previous field layed out. */
4003 /* The static variables (i.e., class variables, as opposed to
4004 instance variables) encountered in T. */
4005 tree pending_statics;
4006 /* Bits remaining in the current alignment group */
4007 int remaining_in_alignment;
4008 /* True if we've seen a packed field that didn't have normal
4009 alignment anyway. */
4010 int packed_maybe_necessary;
4011 } *record_layout_info;
4013 extern void set_lang_adjust_rli (void (*) (record_layout_info));
4014 extern record_layout_info start_record_layout (tree);
4015 extern tree bit_from_pos (tree, tree);
4016 extern tree byte_from_pos (tree, tree);
4017 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4018 extern void normalize_offset (tree *, tree *, unsigned int);
4019 extern tree rli_size_unit_so_far (record_layout_info);
4020 extern tree rli_size_so_far (record_layout_info);
4021 extern void normalize_rli (record_layout_info);
4022 extern void place_field (record_layout_info, tree);
4023 extern void compute_record_mode (tree);
4024 extern void finish_record_layout (record_layout_info, int);
4026 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4027 return a canonicalized ..._TYPE node, so that duplicates are not made.
4028 How the hash code is computed is up to the caller, as long as any two
4029 callers that could hash identical-looking type nodes agree. */
4031 extern tree type_hash_canon (unsigned int, tree);
4033 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4034 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4035 fields. Call this only once for any given decl node.
4037 Second argument is the boundary that this field can be assumed to
4038 be starting at (in bits). Zero means it can be assumed aligned
4039 on any boundary that may be needed. */
4041 extern void layout_decl (tree, unsigned);
4043 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4044 a previous call to layout_decl and calls it again. */
4046 extern void relayout_decl (tree);
4048 /* Return the mode for data of a given size SIZE and mode class CLASS.
4049 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4050 The value is BLKmode if no other mode is found. This is like
4051 mode_for_size, but is passed a tree. */
4053 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
4055 /* Return an expr equal to X but certainly not valid as an lvalue. */
4057 extern tree non_lvalue (tree);
4059 extern tree convert (tree, tree);
4060 extern unsigned int expr_align (tree);
4061 extern tree expr_first (tree);
4062 extern tree expr_last (tree);
4063 extern tree expr_only (tree);
4064 extern tree size_in_bytes (tree);
4065 extern HOST_WIDE_INT int_size_in_bytes (tree);
4066 extern HOST_WIDE_INT max_int_size_in_bytes (tree);
4067 extern tree bit_position (tree);
4068 extern HOST_WIDE_INT int_bit_position (tree);
4069 extern tree byte_position (tree);
4070 extern HOST_WIDE_INT int_byte_position (tree);
4072 /* Define data structures, macros, and functions for handling sizes
4073 and the various types used to represent sizes. */
4077 SIZETYPE, /* Normal representation of sizes in bytes. */
4078 SSIZETYPE, /* Signed representation of sizes in bytes. */
4079 BITSIZETYPE, /* Normal representation of sizes in bits. */
4080 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4083 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4085 #define sizetype sizetype_tab[(int) SIZETYPE]
4086 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4087 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4088 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4090 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4091 extern tree size_binop (enum tree_code, tree, tree);
4092 extern tree size_diffop (tree, tree);
4094 #define size_int(L) size_int_kind (L, SIZETYPE)
4095 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4096 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4097 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4099 extern tree round_up (tree, int);
4100 extern tree round_down (tree, int);
4101 extern tree get_pending_sizes (void);
4102 extern void put_pending_size (tree);
4103 extern void put_pending_sizes (tree);
4105 /* Type for sizes of data-type. */
4107 #define BITS_PER_UNIT_LOG \
4108 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4109 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4110 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4112 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4113 extern unsigned int maximum_field_alignment;
4114 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4115 extern unsigned int initial_max_fld_align;
4117 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4118 by making the last node in X point to Y.
4119 Returns X, except if X is 0 returns Y. */
4121 extern tree chainon (tree, tree);
4123 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4125 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4126 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4128 /* Return the last tree node in a chain. */
4130 extern tree tree_last (tree);
4132 /* Reverse the order of elements in a chain, and return the new head. */
4134 extern tree nreverse (tree);
4136 /* Returns the length of a chain of nodes
4137 (number of chain pointers to follow before reaching a null pointer). */
4139 extern int list_length (tree);
4141 /* Returns the number of FIELD_DECLs in a type. */
4143 extern int fields_length (tree);
4145 /* Given an initializer INIT, return TRUE if INIT is zero or some
4146 aggregate of zeros. Otherwise return FALSE. */
4148 extern bool initializer_zerop (tree);
4150 /* Examine CTOR to discover:
4151 * how many scalar fields are set to nonzero values,
4152 and place it in *P_NZ_ELTS;
4153 * how many scalar fields in total are in CTOR,
4154 and place it in *P_ELT_COUNT.
4155 * if a type is a union, and the initializer from the constructor
4156 is not the largest element in the union, then set *p_must_clear.
4158 Return whether or not CTOR is a valid static constant initializer, the same
4159 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4161 extern bool categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4164 extern HOST_WIDE_INT count_type_elements (tree, bool);
4166 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4168 extern int integer_zerop (tree);
4170 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4172 extern int integer_onep (tree);
4174 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4175 all of whose significant bits are 1. */
4177 extern int integer_all_onesp (tree);
4179 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4180 exactly one bit 1. */
4182 extern int integer_pow2p (tree);
4184 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4185 with a nonzero value. */
4187 extern int integer_nonzerop (tree);
4189 extern bool cst_and_fits_in_hwi (tree);
4190 extern tree num_ending_zeros (tree);
4192 /* staticp (tree x) is nonzero if X is a reference to data allocated
4193 at a fixed address in memory. Returns the outermost data. */
4195 extern tree staticp (tree);
4197 /* save_expr (EXP) returns an expression equivalent to EXP
4198 but it can be used multiple times within context CTX
4199 and only evaluate EXP once. */
4201 extern tree save_expr (tree);
4203 /* Look inside EXPR and into any simple arithmetic operations. Return
4204 the innermost non-arithmetic node. */
4206 extern tree skip_simple_arithmetic (tree);
4208 /* Return which tree structure is used by T. */
4210 enum tree_node_structure_enum tree_node_structure (tree);
4212 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4213 or offset that depends on a field within a record.
4215 Note that we only allow such expressions within simple arithmetic
4218 extern bool contains_placeholder_p (tree);
4220 /* This macro calls the above function but short-circuits the common
4221 case of a constant to save time. Also check for null. */
4223 #define CONTAINS_PLACEHOLDER_P(EXP) \
4224 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4226 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4227 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4230 extern bool type_contains_placeholder_p (tree);
4232 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4233 return a tree with all occurrences of references to F in a
4234 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4235 contains only arithmetic expressions. */
4237 extern tree substitute_in_expr (tree, tree, tree);
4239 /* This macro calls the above function but short-circuits the common
4240 case of a constant to save time and also checks for NULL. */
4242 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4243 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4245 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4246 for it within OBJ, a tree that is an object or a chain of references. */
4248 extern tree substitute_placeholder_in_expr (tree, tree);
4250 /* This macro calls the above function but short-circuits the common
4251 case of a constant to save time and also checks for NULL. */
4253 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4254 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4255 : substitute_placeholder_in_expr (EXP, OBJ))
4257 /* variable_size (EXP) is like save_expr (EXP) except that it
4258 is for the special case of something that is part of a
4259 variable size for a data type. It makes special arrangements
4260 to compute the value at the right time when the data type
4261 belongs to a function parameter. */
4263 extern tree variable_size (tree);
4265 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4266 but it can be used multiple times
4267 and only evaluate the subexpressions once. */
4269 extern tree stabilize_reference (tree);
4271 /* Subroutine of stabilize_reference; this is called for subtrees of
4272 references. Any expression with side-effects must be put in a SAVE_EXPR
4273 to ensure that it is only evaluated once. */
4275 extern tree stabilize_reference_1 (tree);
4277 /* Return EXP, stripped of any conversions to wider types
4278 in such a way that the result of converting to type FOR_TYPE
4279 is the same as if EXP were converted to FOR_TYPE.
4280 If FOR_TYPE is 0, it signifies EXP's type. */
4282 extern tree get_unwidened (tree, tree);
4284 /* Return OP or a simpler expression for a narrower value
4285 which can be sign-extended or zero-extended to give back OP.
4286 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4287 or 0 if the value should be sign-extended. */
4289 extern tree get_narrower (tree, int *);
4291 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4292 look for nested component-refs or array-refs at constant positions
4293 and find the ultimate containing object, which is returned. */
4295 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4296 tree *, enum machine_mode *, int *, int *,
4299 /* Return 1 if T is an expression that get_inner_reference handles. */
4301 extern int handled_component_p (tree);
4303 /* Return a tree of sizetype representing the size, in bytes, of the element
4304 of EXP, an ARRAY_REF. */
4306 extern tree array_ref_element_size (tree);
4308 /* Return a tree representing the lower bound of the array mentioned in
4309 EXP, an ARRAY_REF. */
4311 extern tree array_ref_low_bound (tree);
4313 /* Return a tree representing the upper bound of the array mentioned in
4314 EXP, an ARRAY_REF. */
4316 extern tree array_ref_up_bound (tree);
4318 /* Return a tree representing the offset, in bytes, of the field referenced
4319 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4321 extern tree component_ref_field_offset (tree);
4323 /* Given a DECL or TYPE, return the scope in which it was declared, or
4324 NUL_TREE if there is no containing scope. */
4326 extern tree get_containing_scope (tree);
4328 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4330 extern tree decl_function_context (tree);
4332 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4333 this _DECL with its context, or zero if none. */
4334 extern tree decl_type_context (tree);
4336 /* Return 1 if EXPR is the real constant zero. */
4337 extern int real_zerop (tree);
4339 /* Declare commonly used variables for tree structure. */
4341 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4342 Zero means allow extended lvalues. */
4344 extern int pedantic_lvalues;
4346 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4348 extern GTY(()) tree current_function_decl;
4350 /* Nonzero means a FUNC_BEGIN label was emitted. */
4351 extern GTY(()) const char * current_function_func_begin_label;
4354 extern unsigned crc32_string (unsigned, const char *);
4355 extern void clean_symbol_name (char *);
4356 extern tree get_file_function_name (const char *);
4357 extern tree get_callee_fndecl (tree);
4358 extern void change_decl_assembler_name (tree, tree);
4359 extern int type_num_arguments (tree);
4360 extern bool associative_tree_code (enum tree_code);
4361 extern bool commutative_tree_code (enum tree_code);
4362 extern tree upper_bound_in_type (tree, tree);
4363 extern tree lower_bound_in_type (tree, tree);
4364 extern int operand_equal_for_phi_arg_p (tree, tree);
4365 extern bool empty_body_p (tree);
4366 extern tree call_expr_arg (tree, int);
4367 extern tree *call_expr_argp (tree, int);
4368 extern tree call_expr_arglist (tree);
4372 extern void expand_expr_stmt (tree);
4373 extern int warn_if_unused_value (tree, location_t);
4374 extern void expand_label (tree);
4375 extern void expand_goto (tree);
4377 extern rtx expand_stack_save (void);
4378 extern void expand_stack_restore (tree);
4379 extern void expand_return (tree);
4380 extern int is_body_block (tree);
4383 extern void using_eh_for_cleanups (void);
4385 /* In fold-const.c */
4387 /* Non-zero if we are folding constants inside an initializer; zero
4389 extern int folding_initializer;
4391 /* Convert between trees and native memory representation. */
4392 extern int native_encode_expr (tree, unsigned char *, int);
4393 extern tree native_interpret_expr (tree, unsigned char *, int);
4395 /* Fold constants as much as possible in an expression.
4396 Returns the simplified expression.
4397 Acts only on the top level of the expression;
4398 if the argument itself cannot be simplified, its
4399 subexpressions are not changed. */
4401 extern tree fold (tree);
4402 extern tree fold_unary (enum tree_code, tree, tree);
4403 extern tree fold_binary (enum tree_code, tree, tree, tree);
4404 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4405 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4406 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4407 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4408 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4409 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4410 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4411 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4412 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4413 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4414 extern tree fold_build_call_array (tree, tree, int, tree *);
4415 extern tree fold_build_call_array_initializer (tree, tree, int, tree *);
4416 extern tree fold_convert (tree, tree);
4417 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4418 extern tree fold_ignored_result (tree);
4419 extern tree fold_abs_const (tree, tree);
4420 extern tree fold_indirect_ref_1 (tree, tree);
4421 extern void fold_defer_overflow_warnings (void);
4422 extern void fold_undefer_overflow_warnings (bool, tree, int);
4423 extern void fold_undefer_and_ignore_overflow_warnings (void);
4424 extern bool fold_deferring_overflow_warnings_p (void);
4425 extern tree maybe_fold_offset_to_component_ref (tree, tree, tree,
4428 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4431 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4432 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, tree);
4433 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4434 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4435 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4437 #define add_double(l1,h1,l2,h2,lv,hv) \
4438 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4439 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4440 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4441 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4442 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4443 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4445 #define mul_double(l1,h1,l2,h2,lv,hv) \
4446 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4447 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4448 HOST_WIDE_INT, unsigned int,
4449 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4450 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4451 HOST_WIDE_INT, unsigned int,
4452 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4453 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4454 HOST_WIDE_INT, unsigned int,
4455 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4456 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4457 HOST_WIDE_INT, unsigned int,
4458 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4460 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4461 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4462 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4463 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4466 enum operand_equal_flag
4472 extern int operand_equal_p (tree, tree, unsigned int);
4473 extern int multiple_of_p (tree, tree, tree);
4474 extern tree omit_one_operand (tree, tree, tree);
4475 extern tree omit_two_operands (tree, tree, tree, tree);
4476 extern tree invert_truthvalue (tree);
4477 extern tree fold_truth_not_expr (tree);
4478 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4479 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4480 extern tree fold_read_from_constant_string (tree);
4481 extern tree int_const_binop (enum tree_code, tree, tree, int);
4482 extern tree build_fold_addr_expr (tree);
4483 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4484 extern tree fold_strip_sign_ops (tree);
4485 extern tree build_fold_addr_expr_with_type (tree, tree);
4486 extern tree build_fold_indirect_ref (tree);
4487 extern tree fold_indirect_ref (tree);
4488 extern tree constant_boolean_node (int, tree);
4489 extern tree build_low_bits_mask (tree, unsigned);
4491 extern bool tree_swap_operands_p (tree, tree, bool);
4492 extern void swap_tree_operands (tree, tree *, tree *);
4493 extern enum tree_code swap_tree_comparison (enum tree_code);
4495 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4496 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4498 extern bool tree_expr_nonzero_p (tree);
4499 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4500 extern int multiple_of_p (tree, tree, tree);
4503 extern tree fold_call_expr (tree, bool);
4504 extern tree fold_builtin_fputs (tree, tree, bool, bool, tree);
4505 extern tree fold_builtin_strcpy (tree, tree, tree, tree);
4506 extern tree fold_builtin_strncpy (tree, tree, tree, tree, tree);
4507 extern tree fold_builtin_memory_chk (tree, tree, tree, tree, tree, tree, bool,
4508 enum built_in_function);
4509 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, tree, tree, bool,
4510 enum built_in_function);
4511 extern tree fold_builtin_strncpy_chk (tree, tree, tree, tree, tree);
4512 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4513 extern bool fold_builtin_next_arg (tree, bool);
4514 extern enum built_in_function builtin_mathfn_code (tree);
4515 extern tree build_function_call_expr (tree, tree);
4516 extern tree fold_build_call_expr (tree, tree, tree, tree);
4517 extern tree fold_builtin_call_array (tree, tree, int, tree *);
4518 extern tree build_call_expr (tree, int, ...);
4519 extern tree mathfn_built_in (tree, enum built_in_function fn);
4520 extern tree strip_float_extensions (tree);
4521 extern tree c_strlen (tree, int);
4522 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4523 extern tree build_va_arg_indirect_ref (tree);
4524 extern tree build_string_literal (int, const char *);
4525 extern bool validate_arglist (tree, ...);
4526 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4527 extern int get_pointer_alignment (tree, unsigned int);
4530 extern tree strip_float_extensions (tree);
4533 extern void record_component_aliases (tree);
4534 extern HOST_WIDE_INT get_alias_set (tree);
4535 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4536 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4537 extern int objects_must_conflict_p (tree, tree);
4540 extern int really_constant_p (tree);
4541 extern int int_fits_type_p (tree, tree);
4542 extern bool variably_modified_type_p (tree, tree);
4543 extern int tree_log2 (tree);
4544 extern int tree_floor_log2 (tree);
4545 extern int simple_cst_equal (tree, tree);
4546 extern hashval_t iterative_hash_expr (tree, hashval_t);
4547 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
4548 extern int type_list_equal (tree, tree);
4549 extern int chain_member (tree, tree);
4550 extern tree type_hash_lookup (unsigned int, tree);
4551 extern void type_hash_add (unsigned int, tree);
4552 extern int simple_cst_list_equal (tree, tree);
4553 extern void dump_tree_statistics (void);
4554 extern void expand_function_end (void);
4555 extern void expand_function_start (tree);
4556 extern void stack_protect_prologue (void);
4557 extern void stack_protect_epilogue (void);
4558 extern void recompute_tree_invariant_for_addr_expr (tree);
4559 extern bool needs_to_live_in_memory (tree);
4560 extern tree reconstruct_complex_type (tree, tree);
4562 extern int real_onep (tree);
4563 extern int real_twop (tree);
4564 extern int real_minus_onep (tree);
4565 extern void init_ttree (void);
4566 extern void build_common_tree_nodes (bool, bool);
4567 extern void build_common_tree_nodes_2 (int);
4568 extern void build_common_builtin_nodes (void);
4569 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4570 extern tree build_range_type (tree, tree, tree);
4571 extern HOST_WIDE_INT int_cst_value (tree);
4572 extern tree build_addr (tree, tree);
4574 extern bool fields_compatible_p (tree, tree);
4575 extern tree find_compatible_field (tree, tree);
4577 extern location_t expr_location (tree);
4578 extern void set_expr_location (tree, location_t);
4579 extern bool expr_has_location (tree);
4581 #ifdef USE_MAPPED_LOCATION
4587 extern void set_expr_locus (tree,
4588 #ifdef USE_MAPPED_LOCATION
4589 source_location *loc
4594 extern const char **expr_filename (tree);
4595 extern int *expr_lineno (tree);
4596 extern tree *tree_block (tree);
4597 extern tree *generic_tree_operand (tree, int);
4598 extern tree *generic_tree_type (tree);
4601 extern void expand_main_function (void);
4602 extern void init_dummy_function_start (void);
4603 extern void expand_dummy_function_end (void);
4604 extern unsigned int init_function_for_compilation (void);
4605 extern void allocate_struct_function (tree);
4606 extern void init_function_start (tree);
4607 extern bool use_register_for_decl (tree);
4608 extern void setjmp_vars_warning (tree);
4609 extern void setjmp_args_warning (void);
4610 extern void init_temp_slots (void);
4611 extern void free_temp_slots (void);
4612 extern void pop_temp_slots (void);
4613 extern void push_temp_slots (void);
4614 extern void preserve_temp_slots (rtx);
4615 extern int aggregate_value_p (tree, tree);
4616 extern void push_function_context (void);
4617 extern void pop_function_context (void);
4618 extern void push_function_context_to (tree);
4619 extern void pop_function_context_from (tree);
4620 extern tree gimplify_parameters (void);
4622 /* In print-rtl.c */
4624 extern void print_rtl (FILE *, rtx);
4627 /* In print-tree.c */
4628 extern void debug_tree (tree);
4630 extern void dump_addr (FILE*, const char *, void *);
4631 extern void print_node (FILE *, const char *, tree, int);
4632 extern void print_node_brief (FILE *, const char *, tree, int);
4633 extern void indent_to (FILE *, int);
4636 /* In tree-inline.c: */
4637 extern bool debug_find_tree (tree, tree);
4638 /* This is in tree-inline.c since the routine uses
4639 data structures from the inliner. */
4640 extern tree unsave_expr_now (tree);
4641 extern tree build_duplicate_type (tree);
4644 extern rtx emit_line_note (location_t);
4648 /* Nonzero if this is a call to a function whose return value depends
4649 solely on its arguments, has no side effects, and does not read
4652 /* Nonzero if this call will never return. */
4653 #define ECF_NORETURN 2
4654 /* Nonzero if this is a call to malloc or a related function. */
4655 #define ECF_MALLOC 4
4656 /* Nonzero if it is plausible that this is a call to alloca. */
4657 #define ECF_MAY_BE_ALLOCA 8
4658 /* Nonzero if this is a call to a function that won't throw an exception. */
4659 #define ECF_NOTHROW 16
4660 /* Nonzero if this is a call to setjmp or a related function. */
4661 #define ECF_RETURNS_TWICE 32
4662 /* Nonzero if this call replaces the current stack frame. */
4663 #define ECF_SIBCALL 64
4664 /* Nonzero if this is a call to "pure" function (like const function,
4665 but may read memory. */
4666 #define ECF_PURE 128
4667 /* Nonzero if this is a call to a function that returns with the stack
4668 pointer depressed. */
4669 #define ECF_SP_DEPRESSED 256
4670 /* Create libcall block around the call. */
4671 #define ECF_LIBCALL_BLOCK 512
4672 /* Function does not read or write memory (but may have side effects, so
4673 it does not necessarily fit ECF_CONST). */
4674 #define ECF_NOVOPS 1024
4676 extern int flags_from_decl_or_type (tree);
4677 extern int call_expr_flags (tree);
4679 extern int setjmp_call_p (tree);
4680 extern bool alloca_call_p (tree);
4681 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
4682 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
4686 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4687 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4688 it should be modified in place; if a TYPE, a copy should be created
4689 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4690 information, in the form of a bitwise OR of flags in enum attribute_flags
4691 from tree.h. Depending on these flags, some attributes may be
4692 returned to be applied at a later stage (for example, to apply
4693 a decl attribute to the declaration rather than to its type). */
4694 extern tree decl_attributes (tree *, tree, int);
4696 /* In integrate.c */
4697 extern void set_decl_abstract_flags (tree, int);
4698 extern void set_decl_origin_self (tree);
4700 /* In stor-layout.c */
4701 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
4702 extern void fixup_signed_type (tree);
4703 extern void internal_reference_types (void);
4704 extern unsigned int update_alignment_for_field (record_layout_info, tree,
4707 extern void make_decl_rtl (tree);
4708 extern void make_decl_one_only (tree);
4709 extern int supports_one_only (void);
4710 extern void resolve_unique_section (tree, int, int);
4711 extern void mark_referenced (tree);
4712 extern void mark_decl_referenced (tree);
4713 extern void notice_global_symbol (tree);
4714 extern void set_user_assembler_name (tree, const char *);
4715 extern void process_pending_assemble_externals (void);
4716 extern void finish_aliases_1 (void);
4717 extern void finish_aliases_2 (void);
4718 extern tree emutls_decl (tree);
4721 extern void expand_computed_goto (tree);
4722 extern bool parse_output_constraint (const char **, int, int, int,
4723 bool *, bool *, bool *);
4724 extern bool parse_input_constraint (const char **, int, int, int, int,
4725 const char * const *, bool *, bool *);
4726 extern void expand_asm_expr (tree);
4727 extern tree resolve_asm_operand_names (tree, tree, tree);
4728 extern void expand_case (tree);
4729 extern void expand_decl (tree);
4730 extern void expand_anon_union_decl (tree, tree, tree);
4732 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4733 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
4736 /* In gimplify.c. */
4737 extern tree create_artificial_label (void);
4738 extern void gimplify_function_tree (tree);
4739 extern const char *get_name (tree);
4740 extern tree unshare_expr (tree);
4741 extern void sort_case_labels (tree);
4743 /* Interface of the DWARF2 unwind info support. */
4745 /* Generate a new label for the CFI info to refer to. */
4747 extern char *dwarf2out_cfi_label (void);
4749 /* Entry point to update the canonical frame address (CFA). */
4751 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
4753 /* Add the CFI for saving a register window. */
4755 extern void dwarf2out_window_save (const char *);
4757 /* Add a CFI to update the running total of the size of arguments pushed
4760 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
4762 /* Entry point for saving a register to the stack. */
4764 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
4766 /* Entry point for saving the return address in the stack. */
4768 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
4770 /* Entry point for saving the return address in a register. */
4772 extern void dwarf2out_return_reg (const char *, unsigned);
4774 /* Entry point for saving the first register into the second. */
4776 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
4778 /* In tree-inline.c */
4780 /* The type of a set of already-visited pointers. Functions for creating
4781 and manipulating it are declared in pointer-set.h */
4782 struct pointer_set_t;
4784 /* The type of a callback function for walking over tree structure. */
4786 typedef tree (*walk_tree_fn) (tree *, int *, void *);
4787 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
4788 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
4790 /* Assign the RTX to declaration. */
4792 extern void set_decl_rtl (tree, rtx);
4793 extern void set_decl_incoming_rtl (tree, rtx);
4795 /* Enum and arrays used for tree allocation stats.
4796 Keep in sync with tree.c:tree_node_kind_names. */
4822 extern int tree_node_counts[];
4823 extern int tree_node_sizes[];
4825 /* True if we are in gimple form and the actions of the folders need to
4826 be restricted. False if we are not in gimple form and folding is not
4827 restricted to creating gimple expressions. */
4828 extern bool in_gimple_form;
4830 /* In tree-gimple.c. */
4831 extern tree get_base_address (tree t);
4833 /* In tree-vectorizer.c. */
4834 extern void vect_set_verbosity_level (const char *);
4838 struct tree_map_base GTY(())
4843 extern int tree_map_base_eq (const void *, const void *);
4844 extern unsigned int tree_map_base_hash (const void *);
4845 extern int tree_map_base_marked_p (const void *);
4847 /* Map from a tree to another tree. */
4849 struct tree_map GTY(())
4851 struct tree_map_base base;
4856 #define tree_map_eq tree_map_base_eq
4857 extern unsigned int tree_map_hash (const void *);
4858 #define tree_map_marked_p tree_map_base_marked_p
4860 /* Map from a tree to an int. */
4862 struct tree_int_map GTY(())
4864 struct tree_map_base base;
4868 #define tree_int_map_eq tree_map_base_eq
4869 #define tree_int_map_hash tree_map_base_hash
4870 #define tree_int_map_marked_p tree_map_base_marked_p
4872 /* Map from a tree to initialization/finalization priorities. */
4874 struct tree_priority_map GTY(())
4876 struct tree_map_base base;
4881 #define tree_priority_map_eq tree_map_base_eq
4882 #define tree_priority_map_hash tree_map_base_hash
4883 #define tree_priority_map_marked_p tree_map_base_marked_p
4885 /* In tree-ssa-address.c. */
4886 extern tree tree_mem_ref_addr (tree, tree);
4887 extern void copy_mem_ref_info (tree, tree);
4890 extern bool ssa_name_nonzero_p (tree);
4891 extern bool ssa_name_nonnegative_p (tree);
4893 /* In tree-object-size.c. */
4894 extern void init_object_sizes (void);
4895 extern void fini_object_sizes (void);
4896 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
4899 extern unsigned HOST_WIDE_INT highest_pow2_factor (tree);
4901 /* In tree-inline.c. */
4903 void init_inline_once (void);
4905 /* Compute the number of operands in an expression node NODE. For
4906 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4907 otherwise it is looked up from the node's code. */
4909 tree_operand_length (tree node)
4911 if (VL_EXP_CLASS_P (node))
4912 return VL_EXP_OPERAND_LENGTH (node);
4914 return TREE_CODE_LENGTH (TREE_CODE (node));
4917 /* Abstract iterators for CALL_EXPRs. These static inline definitions
4918 have to go towards the end of tree.h so that union tree_node is fully
4919 defined by this point. */
4921 /* Structure containing iterator state. */
4922 typedef struct call_expr_arg_iterator_d GTY (())
4924 tree t; /* the call_expr */
4925 int n; /* argument count */
4926 int i; /* next argument index */
4927 } call_expr_arg_iterator;
4929 /* Initialize the abstract argument list iterator object ITER with the
4930 arguments from CALL_EXPR node EXP. */
4932 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4935 iter->n = call_expr_nargs (exp);
4939 /* Return the next argument from abstract argument list iterator object ITER,
4940 and advance its state. Return NULL_TREE if there are no more arguments. */
4942 next_call_expr_arg (call_expr_arg_iterator *iter)
4945 if (iter->i >= iter->n)
4947 result = CALL_EXPR_ARG (iter->t, iter->i);
4952 /* Initialize the abstract argument list iterator object ITER, then advance
4953 past and return the first argument. Useful in for expressions, e.g.
4954 for (arg = first_call_expr_arg (exp, &iter); arg;
4955 arg = next_call_expr_arg (&iter)) */
4957 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4959 init_call_expr_arg_iterator (exp, iter);
4960 return next_call_expr_arg (iter);
4963 /* Test whether there are more arguments in abstract argument list iterator
4964 ITER, without changing its state. */
4966 more_call_expr_args_p (const call_expr_arg_iterator *iter)
4968 return (iter->i < iter->n);
4972 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4973 (of type call_expr_arg_iterator) to hold the iteration state. */
4974 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4975 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4976 (arg) = next_call_expr_arg (&(iter)))
4978 #endif /* GCC_TREE_H */