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 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, 59 Temple Place - Suite 330, Boston, MA
27 #include "statistics.h"
30 /* Codes of tree nodes */
32 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
37 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
43 /* Number of language-independent tree codes. */
44 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
46 /* Tree code classes. */
48 /* Each tree_code has an associated code class represented by a
51 enum tree_code_class {
52 tcc_exceptional, /* An exceptional code (fits no category). */
53 tcc_constant, /* A constant. */
54 /* Order of tcc_type and tcc_declaration is important. */
55 tcc_type, /* A type object code. */
56 tcc_declaration, /* A declaration (also serving as variable refs). */
57 tcc_reference, /* A reference to storage. */
58 tcc_comparison, /* A comparison expression. */
59 tcc_unary, /* A unary arithmetic expression. */
60 tcc_binary, /* A binary arithmetic expression. */
61 tcc_statement, /* A statement expression, which have side effects
62 but usually no interesting value. */
63 tcc_expression /* Any other expression. */
66 /* Each tree code class has an associated string representation.
67 These must correspond to the tree_code_class entries. */
69 extern const char *const tree_code_class_strings[];
71 /* Returns the string representing CLASS. */
73 #define TREE_CODE_CLASS_STRING(CLASS)\
74 tree_code_class_strings[(int) (CLASS)]
76 #define MAX_TREE_CODES 256
77 extern const enum tree_code_class tree_code_type[];
78 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
80 /* Nonzero if CODE represents an exceptional code. */
82 #define EXCEPTIONAL_CLASS_P(CODE)\
83 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
85 /* Nonzero if CODE represents a constant. */
87 #define CONSTANT_CLASS_P(CODE)\
88 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
90 /* Nonzero if CODE represents a type. */
93 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
95 /* Nonzero if CODE represents a declaration. */
98 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
100 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
101 ascending code order. */
102 #define INDIRECT_REF_P(CODE)\
103 (TREE_CODE (CODE) == INDIRECT_REF \
104 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
105 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
107 /* Nonzero if CODE represents a reference. */
109 #define REFERENCE_CLASS_P(CODE)\
110 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
112 /* Nonzero if CODE represents a comparison. */
114 #define COMPARISON_CLASS_P(CODE)\
115 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
117 /* Nonzero if CODE represents a unary arithmetic expression. */
119 #define UNARY_CLASS_P(CODE)\
120 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
122 /* Nonzero if CODE represents a binary arithmetic expression. */
124 #define BINARY_CLASS_P(CODE)\
125 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
127 /* Nonzero if CODE represents a statement expression. */
129 #define STATEMENT_CLASS_P(CODE)\
130 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
132 /* Nonzero if CODE represents any other expression. */
134 #define EXPRESSION_CLASS_P(CODE)\
135 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
137 /* Returns nonzero iff CODE represents a type or declaration. */
139 #define IS_TYPE_OR_DECL_P(CODE)\
140 (TYPE_P (CODE) || DECL_P (CODE))
142 /* Returns nonzero iff CLASS is the tree-code class of an
145 #define IS_EXPR_CODE_CLASS(CLASS)\
146 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
148 /* Returns nonzero iff NODE is an expression of some kind. */
150 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
152 /* Number of argument-words in each kind of tree-node. */
154 extern const unsigned char tree_code_length[];
155 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
157 /* Names of tree components. */
159 extern const char *const tree_code_name[];
161 /* A garbage collected vector of trees. */
165 /* Classify which part of the compiler has defined a given builtin function.
166 Note that we assume below that this is no more than two bits. */
175 /* Names for the above. */
176 extern const char *const built_in_class_names[4];
178 /* Codes that identify the various built in functions
179 so that expand_call can identify them quickly. */
181 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
182 enum built_in_function
184 #include "builtins.def"
186 /* Complex division routines in libgcc. These are done via builtins
187 because emit_library_call_value can't handle complex values. */
188 BUILT_IN_COMPLEX_MUL_MIN,
189 BUILT_IN_COMPLEX_MUL_MAX
190 = BUILT_IN_COMPLEX_MUL_MIN
191 + MAX_MODE_COMPLEX_FLOAT
192 - MIN_MODE_COMPLEX_FLOAT,
194 BUILT_IN_COMPLEX_DIV_MIN,
195 BUILT_IN_COMPLEX_DIV_MAX
196 = BUILT_IN_COMPLEX_DIV_MIN
197 + MAX_MODE_COMPLEX_FLOAT
198 - MIN_MODE_COMPLEX_FLOAT,
200 /* Upper bound on non-language-specific builtins. */
205 /* Names for the above. */
206 extern const char * built_in_names[(int) END_BUILTINS];
208 /* Helper macros for math builtins. */
210 #define BUILTIN_EXP10_P(FN) \
211 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
212 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
214 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
215 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
216 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
218 #define BUILTIN_SQRT_P(FN) \
219 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
221 #define BUILTIN_CBRT_P(FN) \
222 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
224 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
226 /* An array of _DECL trees for the above. */
227 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
228 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
230 /* The definition of tree nodes fills the next several pages. */
232 /* A tree node can represent a data type, a variable, an expression
233 or a statement. Each node has a TREE_CODE which says what kind of
234 thing it represents. Some common codes are:
235 INTEGER_TYPE -- represents a type of integers.
236 ARRAY_TYPE -- represents a type of pointer.
237 VAR_DECL -- represents a declared variable.
238 INTEGER_CST -- represents a constant integer value.
239 PLUS_EXPR -- represents a sum (an expression).
241 As for the contents of a tree node: there are some fields
242 that all nodes share. Each TREE_CODE has various special-purpose
243 fields as well. The fields of a node are never accessed directly,
244 always through accessor macros. */
246 /* Every kind of tree node starts with this structure,
247 so all nodes have these fields.
249 See the accessor macros, defined below, for documentation of the
253 struct tree_common GTY(())
257 union tree_ann_d *ann;
259 ENUM_BITFIELD(tree_code) code : 8;
261 unsigned side_effects_flag : 1;
262 unsigned constant_flag : 1;
263 unsigned addressable_flag : 1;
264 unsigned volatile_flag : 1;
265 unsigned readonly_flag : 1;
266 unsigned unsigned_flag : 1;
267 unsigned asm_written_flag: 1;
268 unsigned nowarning_flag : 1;
270 unsigned used_flag : 1;
271 unsigned nothrow_flag : 1;
272 unsigned static_flag : 1;
273 unsigned public_flag : 1;
274 unsigned private_flag : 1;
275 unsigned protected_flag : 1;
276 unsigned deprecated_flag : 1;
277 unsigned invariant_flag : 1;
279 unsigned lang_flag_0 : 1;
280 unsigned lang_flag_1 : 1;
281 unsigned lang_flag_2 : 1;
282 unsigned lang_flag_3 : 1;
283 unsigned lang_flag_4 : 1;
284 unsigned lang_flag_5 : 1;
285 unsigned lang_flag_6 : 1;
286 unsigned visited : 1;
289 /* The following table lists the uses of each of the above flags and
290 for which types of nodes they are defined. Note that expressions
296 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
297 ..._TYPE, IDENTIFIER_NODE.
298 In a STMT_EXPR, it means we want the result of the enclosed
300 CALL_EXPR_TAILCALL in CALL_EXPR
305 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
308 TREE_CONSTANT_OVERFLOW in
309 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
310 TREE_SYMBOL_REFERENCED in
313 TARGET_EXPR, WITH_CLEANUP_EXPR
316 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
317 TYPE_REF_CAN_ALIAS_ALL in
318 POINTER_TYPE, REFERENCE_TYPE
323 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
324 ??? and other expressions?
326 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
329 TYPE_CACHED_VALUES_P in
331 SAVE_EXPR_RESOLVED_P in
338 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
341 PARM_DECL, RESULT_DECL
363 TREE_THIS_VOLATILE in
381 TYPE_SIZES_GIMPLIFIED
390 BIT_FIELD_REF_UNSIGNED in
396 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
402 expressions, IDENTIFIER_NODE
407 CALL_EXPR, FUNCTION_DECL
413 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
422 Used in tree traversals to mark visited nodes.
432 ... any expr or decl node
435 /* Define accessors for the fields that all tree nodes have
436 (though some fields are not used for all kinds of nodes). */
438 /* The tree-code says what kind of node it is.
439 Codes are defined in tree.def. */
440 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
441 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
443 /* When checking is enabled, errors will be generated if a tree node
444 is accessed incorrectly. The macros abort with a fatal error. */
445 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
447 #define TREE_CHECK(T, CODE) __extension__ \
448 ({ const tree __t = (T); \
449 if (TREE_CODE (__t) != (CODE)) \
450 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
454 #define TREE_NOT_CHECK(T, CODE) __extension__ \
455 ({ const tree __t = (T); \
456 if (TREE_CODE (__t) == (CODE)) \
457 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
461 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
462 ({ const tree __t = (T); \
463 if (TREE_CODE (__t) != (CODE1) \
464 && TREE_CODE (__t) != (CODE2)) \
465 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
466 (CODE1), (CODE2), 0); \
469 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
470 ({ const tree __t = (T); \
471 if (TREE_CODE (__t) == (CODE1) \
472 || TREE_CODE (__t) == (CODE2)) \
473 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
474 (CODE1), (CODE2), 0); \
477 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
478 ({ const tree __t = (T); \
479 if (TREE_CODE (__t) != (CODE1) \
480 && TREE_CODE (__t) != (CODE2) \
481 && TREE_CODE (__t) != (CODE3)) \
482 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
483 (CODE1), (CODE2), (CODE3), 0); \
486 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
487 ({ const tree __t = (T); \
488 if (TREE_CODE (__t) == (CODE1) \
489 || TREE_CODE (__t) == (CODE2) \
490 || TREE_CODE (__t) == (CODE3)) \
491 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
492 (CODE1), (CODE2), (CODE3), 0); \
495 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
496 ({ const tree __t = (T); \
497 if (TREE_CODE (__t) != (CODE1) \
498 && TREE_CODE (__t) != (CODE2) \
499 && TREE_CODE (__t) != (CODE3) \
500 && TREE_CODE (__t) != (CODE4)) \
501 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
502 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
505 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
506 ({ const tree __t = (T); \
507 if (TREE_CODE (__t) == (CODE1) \
508 || TREE_CODE (__t) == (CODE2) \
509 || TREE_CODE (__t) == (CODE3) \
510 || TREE_CODE (__t) == (CODE4)) \
511 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
512 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
515 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
516 ({ const tree __t = (T); \
517 if (TREE_CODE (__t) != (CODE1) \
518 && TREE_CODE (__t) != (CODE2) \
519 && TREE_CODE (__t) != (CODE3) \
520 && TREE_CODE (__t) != (CODE4) \
521 && TREE_CODE (__t) != (CODE5)) \
522 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
523 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
526 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
527 ({ const tree __t = (T); \
528 if (TREE_CODE (__t) == (CODE1) \
529 || TREE_CODE (__t) == (CODE2) \
530 || TREE_CODE (__t) == (CODE3) \
531 || TREE_CODE (__t) == (CODE4) \
532 || TREE_CODE (__t) == (CODE5)) \
533 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
534 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
537 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
538 ({ const tree __t = (T); \
539 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
540 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
544 /* These checks have to be special cased. */
545 #define EXPR_CHECK(T) __extension__ \
546 ({ const tree __t = (T); \
547 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
548 if (!IS_EXPR_CODE_CLASS (__c)) \
549 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
553 /* These checks have to be special cased. */
554 #define NON_TYPE_CHECK(T) __extension__ \
555 ({ const tree __t = (T); \
557 tree_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
561 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
562 (*({const tree __t = (T); \
563 const int __i = (I); \
564 if (TREE_CODE (__t) != TREE_VEC) \
565 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
567 if (__i < 0 || __i >= __t->vec.length) \
568 tree_vec_elt_check_failed (__i, __t->vec.length, \
569 __FILE__, __LINE__, __FUNCTION__); \
570 &__t->vec.a[__i]; }))
572 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
573 (*({const tree __t = t; \
574 const int __i = (i); \
575 if (TREE_CODE (__t) != PHI_NODE) \
576 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
578 if (__i < 0 || __i >= __t->phi.capacity) \
579 phi_node_elt_check_failed (__i, __t->phi.num_args, \
580 __FILE__, __LINE__, __FUNCTION__); \
581 &__t->phi.a[__i]; }))
583 /* Special checks for TREE_OPERANDs. */
584 #define TREE_OPERAND_CHECK(T, I) __extension__ \
585 (*({const tree __t = EXPR_CHECK (T); \
586 const int __i = (I); \
587 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
588 tree_operand_check_failed (__i, TREE_CODE (__t), \
589 __FILE__, __LINE__, __FUNCTION__); \
590 &__t->exp.operands[__i]; }))
592 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
593 (*({const tree __t = (T); \
594 const int __i = (I); \
595 if (TREE_CODE (__t) != CODE) \
596 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
597 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
598 tree_operand_check_failed (__i, (CODE), \
599 __FILE__, __LINE__, __FUNCTION__); \
600 &__t->exp.operands[__i]; }))
602 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
604 ({const tree __t = (T); \
605 const int __i = (I); \
606 if (TREE_CODE (__t) != (CODE)) \
607 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
608 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
609 tree_operand_check_failed (__i, (CODE), \
610 __FILE__, __LINE__, __FUNCTION__); \
611 &__t->exp.operands[__i]; }))
613 extern void tree_check_failed (const tree, const char *, int, const char *,
614 ...) ATTRIBUTE_NORETURN;
615 extern void tree_not_check_failed (const tree, const char *, int, const char *,
616 ...) ATTRIBUTE_NORETURN;
617 extern void tree_class_check_failed (const tree, const enum tree_code_class,
618 const char *, int, const char *)
620 extern void tree_vec_elt_check_failed (int, int, const char *,
623 extern void phi_node_elt_check_failed (int, int, const char *,
626 extern void tree_operand_check_failed (int, enum tree_code,
627 const char *, int, const char *)
630 #else /* not ENABLE_TREE_CHECKING, or not gcc */
632 #define TREE_CHECK(T, CODE) (T)
633 #define TREE_NOT_CHECK(T, CODE) (T)
634 #define TREE_CHECK2(T, CODE1, CODE2) (T)
635 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
636 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
637 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
638 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
639 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
640 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
641 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
642 #define TREE_CLASS_CHECK(T, CODE) (T)
643 #define EXPR_CHECK(T) (T)
644 #define NON_TYPE_CHECK(T) (T)
645 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
646 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
647 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
648 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
649 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
653 #define TREE_BLOCK(NODE) ((NODE)->exp.block)
655 #include "tree-check.h"
657 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
658 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, tcc_declaration)
659 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
660 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
661 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
662 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
664 #define RECORD_OR_UNION_CHECK(T) \
665 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
666 #define NOT_RECORD_OR_UNION_CHECK(T) \
667 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
669 #define NUMERICAL_TYPE_CHECK(T) \
670 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \
671 CHAR_TYPE, REAL_TYPE)
673 /* In all nodes that are expressions, this is the data type of the expression.
674 In POINTER_TYPE nodes, this is the type that the pointer points to.
675 In ARRAY_TYPE nodes, this is the type of the elements.
676 In VECTOR_TYPE nodes, this is the type of the elements. */
677 #define TREE_TYPE(NODE) ((NODE)->common.type)
679 /* Here is how primitive or already-canonicalized types' hash codes
681 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
683 /* A simple hash function for an arbitrary tree node. This must not be
684 used in hash tables which are saved to a PCH. */
685 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
687 /* Nodes are chained together for many purposes.
688 Types are chained together to record them for being output to the debugger
689 (see the function `chain_type').
690 Decls in the same scope are chained together to record the contents
692 Statement nodes for successive statements used to be chained together.
693 Often lists of things are represented by TREE_LIST nodes that
694 are chained together. */
696 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
698 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
699 that don't change the machine mode. */
701 #define STRIP_NOPS(EXP) \
702 while ((TREE_CODE (EXP) == NOP_EXPR \
703 || TREE_CODE (EXP) == CONVERT_EXPR \
704 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
705 && TREE_OPERAND (EXP, 0) != error_mark_node \
706 && (TYPE_MODE (TREE_TYPE (EXP)) \
707 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
708 (EXP) = TREE_OPERAND (EXP, 0)
710 /* Like STRIP_NOPS, but don't let the signedness change either. */
712 #define STRIP_SIGN_NOPS(EXP) \
713 while ((TREE_CODE (EXP) == NOP_EXPR \
714 || TREE_CODE (EXP) == CONVERT_EXPR \
715 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
716 && TREE_OPERAND (EXP, 0) != error_mark_node \
717 && (TYPE_MODE (TREE_TYPE (EXP)) \
718 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
719 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
720 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
721 (EXP) = TREE_OPERAND (EXP, 0)
723 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
725 #define STRIP_MAIN_TYPE_NOPS(EXP) \
726 while ((TREE_CODE (EXP) == NOP_EXPR \
727 || TREE_CODE (EXP) == CONVERT_EXPR \
728 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
729 && TREE_OPERAND (EXP, 0) != error_mark_node \
730 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
731 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
732 (EXP) = TREE_OPERAND (EXP, 0)
734 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
736 #define STRIP_TYPE_NOPS(EXP) \
737 while ((TREE_CODE (EXP) == NOP_EXPR \
738 || TREE_CODE (EXP) == CONVERT_EXPR \
739 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
740 && TREE_OPERAND (EXP, 0) != error_mark_node \
741 && (TREE_TYPE (EXP) \
742 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
743 (EXP) = TREE_OPERAND (EXP, 0)
745 /* Remove unnecessary type conversions according to
746 tree_ssa_useless_type_conversion. */
748 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
749 while (tree_ssa_useless_type_conversion (EXP)) \
750 EXP = TREE_OPERAND (EXP, 0)
752 /* Nonzero if TYPE represents an integral type. Note that we do not
753 include COMPLEX types here. Keep these checks in ascending code
756 #define INTEGRAL_TYPE_P(TYPE) \
757 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
758 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
759 || TREE_CODE (TYPE) == CHAR_TYPE \
760 || TREE_CODE (TYPE) == INTEGER_TYPE)
762 /* Nonzero if TYPE represents a scalar floating-point type. */
764 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
766 /* Nonzero if TYPE represents a complex floating-point type. */
768 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
769 (TREE_CODE (TYPE) == COMPLEX_TYPE \
770 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
772 /* Nonzero if TYPE represents a vector floating-point type. */
774 #define VECTOR_FLOAT_TYPE_P(TYPE) \
775 (TREE_CODE (TYPE) == VECTOR_TYPE \
776 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
778 /* Nonzero if TYPE represents a floating-point type, including complex
779 and vector floating-point types. The vector and complex check does
780 not use the previous two macros to enable early folding. */
782 #define FLOAT_TYPE_P(TYPE) \
783 (SCALAR_FLOAT_TYPE_P (TYPE) \
784 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
785 || TREE_CODE (TYPE) == VECTOR_TYPE) \
786 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
788 /* Nonzero if TYPE represents an aggregate (multi-component) type.
789 Keep these checks in ascending code order. */
791 #define AGGREGATE_TYPE_P(TYPE) \
792 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
793 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
795 /* Nonzero if TYPE represents a pointer or reference type.
796 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
797 ascending code order. */
799 #define POINTER_TYPE_P(TYPE) \
800 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
802 /* Nonzero if this type is a complete type. */
803 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
805 /* Nonzero if this type is the (possibly qualified) void type. */
806 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
808 /* Nonzero if this type is complete or is cv void. */
809 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
810 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
812 /* Nonzero if this type is complete or is an array with unspecified bound. */
813 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
814 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
817 /* Define many boolean fields that all tree nodes have. */
819 /* In VAR_DECL nodes, nonzero means address of this is needed.
820 So it cannot be in a register.
821 In a FUNCTION_DECL, nonzero means its address is needed.
822 So it must be compiled even if it is an inline function.
823 In a FIELD_DECL node, it means that the programmer is permitted to
824 construct the address of this field. This is used for aliasing
825 purposes: see record_component_aliases.
826 In CONSTRUCTOR nodes, it means object constructed must be in memory.
827 In LABEL_DECL nodes, it means a goto for this label has been seen
828 from a place outside all binding contours that restore stack levels.
829 In ..._TYPE nodes, it means that objects of this type must
830 be fully addressable. This means that pieces of this
831 object cannot go into register parameters, for example.
832 In IDENTIFIER_NODEs, this means that some extern decl for this name
833 had its address taken. That matters for inline functions. */
834 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
836 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
837 exit of a function. Calls for which this is true are candidates for tail
838 call optimizations. */
839 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
841 /* In a VAR_DECL, nonzero means allocate static storage.
842 In a FUNCTION_DECL, nonzero if function has been defined.
843 In a CONSTRUCTOR, nonzero means allocate static storage.
845 ??? This is also used in lots of other nodes in unclear ways which
846 should be cleaned up some day. */
847 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
849 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
850 should only be executed if an exception is thrown, not on normal exit
852 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
854 /* In an expr node (usually a conversion) this means the node was made
855 implicitly and should not lead to any sort of warning. In a decl node,
856 warnings concerning the decl should be suppressed. This is used at
857 least for used-before-set warnings, and it set after one warning is
859 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
861 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
862 there was an overflow in folding. This is distinct from
863 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
864 occur in constant expressions. */
865 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
867 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
868 this string as an argument. */
869 #define TREE_SYMBOL_REFERENCED(NODE) \
870 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
872 /* Nonzero in a pointer or reference type means the data pointed to
873 by this type can alias anything. */
874 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
875 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
877 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
878 there was an overflow in folding, and no warning has been issued
879 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
882 ??? Apparently, lots of code assumes this is defined in all
884 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
886 /* In a VAR_DECL or FUNCTION_DECL,
887 nonzero means name is to be accessible from outside this module.
888 In an IDENTIFIER_NODE, nonzero means an external declaration
889 accessible from outside this module was previously seen
890 for this name in an inner scope. */
891 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
893 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
894 of cached values, or is something else. */
895 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->common.public_flag)
897 /* In a SAVE_EXPR, indicates that the original expression has already
898 been substituted with a VAR_DECL that contains the value. */
899 #define SAVE_EXPR_RESOLVED_P(NODE) \
900 (TREE_CHECK (NODE, SAVE_EXPR)->common.public_flag)
902 /* In any expression, decl, or constant, nonzero means it has side effects or
903 reevaluation of the whole expression could produce a different value.
904 This is set if any subexpression is a function call, a side effect or a
905 reference to a volatile variable. In a ..._DECL, this is set only if the
906 declaration said `volatile'. This will never be set for a constant. */
907 #define TREE_SIDE_EFFECTS(NODE) \
908 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
910 /* In a LABEL_DECL, nonzero means this label had its address taken
911 and therefore can never be deleted and is a jump target for
913 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
915 /* Nonzero means this expression is volatile in the C sense:
916 its address should be of type `volatile WHATEVER *'.
917 In other words, the declared item is volatile qualified.
918 This is used in _DECL nodes and _REF nodes.
920 In a ..._TYPE node, means this type is volatile-qualified.
921 But use TYPE_VOLATILE instead of this macro when the node is a type,
922 because eventually we may make that a different bit.
924 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
925 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
927 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
928 accessing the memory pointed to won't generate a trap. However,
929 this only applies to an object when used appropriately: it doesn't
930 mean that writing a READONLY mem won't trap. Similarly for
931 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
933 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
934 (or slice of the array) always belongs to the range of the array.
935 I.e. that the access will not trap, provided that the access to
936 the base to the array will not trap. */
937 #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag)
939 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
940 nonzero means it may not be the lhs of an assignment. */
941 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
943 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
944 #define TREE_READONLY_DECL_P(NODE)\
945 (DECL_P (NODE) && TREE_READONLY (NODE))
947 /* Value of expression is constant. Always on in all ..._CST nodes. May
948 also appear in an expression or decl where the value is constant. */
949 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
951 /* Nonzero if NODE, a type, has had its sizes gimplified. */
952 #define TYPE_SIZES_GIMPLIFIED(NODE) (TYPE_CHECK (NODE)->common.constant_flag)
954 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
955 #define DECL_UNSIGNED(NODE) (DECL_CHECK (NODE)->common.unsigned_flag)
957 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
958 #define BIT_FIELD_REF_UNSIGNED(NODE) \
959 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
961 /* In integral and pointer types, means an unsigned type. */
962 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
964 #define TYPE_TRAP_SIGNED(NODE) \
965 (flag_trapv && ! TYPE_UNSIGNED (NODE))
967 /* Nonzero in a VAR_DECL means assembler code has been written.
968 Nonzero in a FUNCTION_DECL means that the function has been compiled.
969 This is interesting in an inline function, since it might not need
970 to be compiled separately.
971 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
972 if the sdb debugging info for the type has been written.
973 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
974 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
976 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
978 /* Nonzero in a _DECL if the name is used in its scope.
979 Nonzero in an expr node means inhibit warning if value is unused.
980 In IDENTIFIER_NODEs, this means that some extern decl for this name
982 In a BLOCK, this means that the block contains variables that are used. */
983 #define TREE_USED(NODE) ((NODE)->common.used_flag)
985 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
986 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
987 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
989 /* In a CALL_EXPR, means that the address of the return slot is part of the
991 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
993 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
994 reference (and the TREE_TYPE is a pointer to the true type). */
995 #define DECL_BY_REFERENCE(NODE) (DECL_CHECK (NODE)->common.private_flag)
997 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
998 thunked-to function. */
999 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag)
1001 /* In a type, nonzero means that all objects of the type are guaranteed by the
1002 language or front-end to be properly aligned, so we can indicate that a MEM
1003 of this type is aligned at least to the alignment of the type, even if it
1004 doesn't appear that it is. We see this, for example, in object-oriented
1005 languages where a tag field may show this is an object of a more-aligned
1006 variant of the more generic type.
1008 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1010 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
1012 /* Used in classes in C++. */
1013 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
1014 /* Used in classes in C++.
1015 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1016 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
1018 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
1019 deprecated feature by __attribute__((deprecated)). */
1020 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
1022 /* Value of expression is function invariant. A strict subset of
1023 TREE_CONSTANT, such an expression is constant over any one function
1024 invocation, though not across different invocations. May appear in
1025 any expression node. */
1026 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
1028 /* These flags are available for each language front end to use internally. */
1029 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
1030 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
1031 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
1032 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
1033 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
1034 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
1035 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
1037 /* Define additional fields and accessors for nodes representing constants. */
1039 /* In an INTEGER_CST node. These two together make a 2-word integer.
1040 If the data type is signed, the value is sign-extended to 2 words
1041 even though not all of them may really be in use.
1042 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1043 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1044 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1045 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1047 #define INT_CST_LT(A, B) \
1048 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1049 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1050 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1052 #define INT_CST_LT_UNSIGNED(A, B) \
1053 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1054 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1055 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1056 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1057 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1059 struct tree_int_cst GTY(())
1061 struct tree_common common;
1062 /* A sub-struct is necessary here because the function `const_hash'
1063 wants to scan both words as a unit and taking the address of the
1064 sub-struct yields the properly inclusive bounded pointer. */
1065 struct tree_int_cst_lowhi {
1066 unsigned HOST_WIDE_INT low;
1071 /* In a REAL_CST node. struct real_value is an opaque entity, with
1072 manipulators defined in real.h. We don't want tree.h depending on
1073 real.h and transitively on tm.h. */
1076 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1077 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1079 struct tree_real_cst GTY(())
1081 struct tree_common common;
1082 struct real_value * real_cst_ptr;
1085 /* In a STRING_CST */
1086 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1087 #define TREE_STRING_POINTER(NODE) \
1088 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1090 struct tree_string GTY(())
1092 struct tree_common common;
1097 /* In a COMPLEX_CST node. */
1098 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1099 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1101 struct tree_complex GTY(())
1103 struct tree_common common;
1108 /* In a VECTOR_CST node. */
1109 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1111 struct tree_vector GTY(())
1113 struct tree_common common;
1119 /* Define fields and accessors for some special-purpose tree nodes. */
1121 #define IDENTIFIER_LENGTH(NODE) \
1122 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1123 #define IDENTIFIER_POINTER(NODE) \
1124 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1125 #define IDENTIFIER_HASH_VALUE(NODE) \
1126 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1128 /* Translate a hash table identifier pointer to a tree_identifier
1129 pointer, and vice versa. */
1131 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1132 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1133 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1135 struct tree_identifier GTY(())
1137 struct tree_common common;
1138 struct ht_identifier id;
1141 /* In a TREE_LIST node. */
1142 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1143 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1145 struct tree_list GTY(())
1147 struct tree_common common;
1152 /* In a TREE_VEC node. */
1153 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1154 #define TREE_VEC_END(NODE) \
1155 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1157 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1159 struct tree_vec GTY(())
1161 struct tree_common common;
1163 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1166 /* Define fields and accessors for some nodes that represent expressions. */
1168 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1169 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1170 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1171 && integer_zerop (TREE_OPERAND (NODE, 0)))
1173 /* In a CONSTRUCTOR node. */
1174 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
1176 /* In ordinary expression nodes. */
1177 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1178 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1180 /* In INDIRECT_REF, ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF. */
1181 #define REF_ORIGINAL(NODE) TREE_CHAIN (TREE_CHECK3 (NODE, \
1182 INDIRECT_REF, ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF))
1184 /* In a LOOP_EXPR node. */
1185 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1187 #ifdef USE_MAPPED_LOCATION
1188 /* The source location of this expression. Non-tree_exp nodes such as
1189 decls and constants can be shared among multiple locations, so
1191 #define EXPR_LOCATION(NODE) \
1192 (EXPR_P (NODE) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1193 #define SET_EXPR_LOCATION(NODE, FROM) \
1194 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1195 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1196 /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */
1197 #define EXPR_LOCUS(NODE) \
1198 (EXPR_P (NODE) ? &(NODE)->exp.locus : (location_t *)NULL)
1199 #define SET_EXPR_LOCUS(NODE, FROM) \
1200 do { source_location *loc_tmp = FROM; \
1201 EXPR_CHECK (NODE)->exp.locus \
1202 = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0)
1203 #define EXPR_FILENAME(NODE) \
1204 LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus)
1205 #define EXPR_LINENO(NODE) \
1206 LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1208 /* The source location of this expression. Non-tree_exp nodes such as
1209 decls and constants can be shared among multiple locations, so
1211 #define EXPR_LOCUS(NODE) \
1212 (EXPR_P (NODE) ? (NODE)->exp.locus : (location_t *)NULL)
1213 #define SET_EXPR_LOCUS(NODE, FROM) \
1214 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1215 #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM)
1216 #define EXPR_FILENAME(NODE) \
1217 (EXPR_CHECK (NODE)->exp.locus->file)
1218 #define EXPR_LINENO(NODE) \
1219 (EXPR_CHECK (NODE)->exp.locus->line)
1220 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1221 #define EXPR_LOCATION(NODE) \
1222 (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION)
1225 /* In a TARGET_EXPR node. */
1226 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1227 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1228 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1230 /* DECL_EXPR accessor. This gives access to the DECL associated with
1231 the given declaration statement. */
1232 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1234 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1236 /* SWITCH_EXPR accessors. These give access to the condition, body and
1237 original condition type (before any compiler conversions)
1238 of the switch statement, respectively. */
1239 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1240 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1241 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1243 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1244 of a case label, respectively. */
1245 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1246 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1247 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1249 /* The operands of a BIND_EXPR. */
1250 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1251 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1252 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1254 /* GOTO_EXPR accessor. This gives access to the label associated with
1255 a goto statement. */
1256 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1258 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1259 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1260 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1262 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1263 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1264 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1265 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1266 /* Nonzero if we want to create an ASM_INPUT instead of an
1267 ASM_OPERAND with no operands. */
1268 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1269 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1271 /* COND_EXPR accessors. */
1272 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1273 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1274 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1276 /* LABEL_EXPR accessor. This gives access to the label associated with
1277 the given label expression. */
1278 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1280 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1281 accessors for SSA operands. */
1283 /* CATCH_EXPR accessors. */
1284 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1285 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1287 /* EH_FILTER_EXPR accessors. */
1288 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1289 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1290 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1292 /* OBJ_TYPE_REF accessors. */
1293 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1294 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1295 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1297 struct tree_exp GTY(())
1299 struct tree_common common;
1303 tree GTY ((special ("tree_exp"),
1304 desc ("TREE_CODE ((tree) &%0)")))
1308 /* SSA_NAME accessors. */
1310 /* Returns the variable being referenced. Once released, this is the
1311 only field that can be relied upon. */
1312 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1314 /* Returns the statement which defines this reference. Note that
1315 we use the same field when chaining SSA_NAME nodes together on
1316 the SSA_NAME freelist. */
1317 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1319 /* Returns the SSA version number of this SSA name. Note that in
1320 tree SSA, version numbers are not per variable and may be recycled. */
1321 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1323 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1324 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1326 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1327 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1329 /* Nonzero if this SSA_NAME expression is currently on the free list of
1330 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1331 has no meaning for an SSA_NAME. */
1332 #define SSA_NAME_IN_FREE_LIST(NODE) \
1333 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1335 /* Attributes for SSA_NAMEs for pointer-type variables. */
1336 #define SSA_NAME_PTR_INFO(N) \
1337 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1339 /* Get the value of this SSA_NAME, if available. */
1340 #define SSA_NAME_VALUE(N) \
1341 SSA_NAME_CHECK (N)->ssa_name.value_handle
1343 /* Auxiliary pass-specific data. */
1344 #define SSA_NAME_AUX(N) \
1345 SSA_NAME_CHECK (N)->ssa_name.aux
1347 #ifndef _TREE_FLOW_H
1348 struct ptr_info_def;
1353 /* Immediate use linking structure. This structure is used for maintaining
1354 a doubly linked list of uses of an SSA_NAME. */
1355 typedef struct ssa_imm_use_d GTY(())
1357 struct ssa_imm_use_d* GTY((skip(""))) prev;
1358 struct ssa_imm_use_d* GTY((skip(""))) next;
1359 tree GTY((skip(""))) stmt;
1360 tree *GTY((skip(""))) use;
1363 /* Return the immediate_use information for an SSA_NAME. */
1364 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1366 struct tree_ssa_name GTY(())
1368 struct tree_common common;
1370 /* _DECL wrapped by this SSA name. */
1373 /* SSA version number. */
1374 unsigned int version;
1376 /* Pointer attributes used for alias analysis. */
1377 struct ptr_info_def *ptr_info;
1379 /* Value for SSA name used by various passes.
1381 Right now only invariants are allowed to persist beyond a pass in
1382 this field; in the future we will allow VALUE_HANDLEs to persist
1386 /* Auxiliary information stored with the ssa name. */
1387 PTR GTY((skip)) aux;
1389 /* Immediate uses list for this SSA_NAME. */
1390 struct ssa_imm_use_d imm_uses;
1393 /* In a PHI_NODE node. */
1395 /* These 2 macros should be considered off limits for use by developers. If
1396 you wish to access the use or def fields of a PHI_NODE in the SSA
1397 optimizers, use the accessor macros found in tree-ssa-operands.h.
1398 These two macros are to be used only by those accessor macros, and other
1399 select places where we *absolutely* must take the address of the tree. */
1401 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1402 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1404 /* PHI_NODEs for each basic block are chained together in a single linked
1405 list. The head of the list is linked from the block annotation, and
1406 the link to the next PHI is in PHI_CHAIN. */
1407 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1409 /* Nonzero if the PHI node was rewritten by a previous pass through the
1411 #define PHI_REWRITTEN(NODE) PHI_NODE_CHECK (NODE)->phi.rewritten
1412 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1413 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1414 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1415 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1416 #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero
1417 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1418 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1422 struct phi_arg_d GTY(())
1424 struct ssa_imm_use_d imm_use; /* imm_use MUST be first element in struct. */
1429 struct tree_phi_node GTY(())
1431 struct tree_common common;
1436 /* Nonzero if the PHI node was rewritten by a previous pass through the
1440 /* Basic block to that the phi node belongs. */
1441 struct basic_block_def *bb;
1443 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1447 struct varray_head_tag;
1449 /* In a BLOCK node. */
1450 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1451 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1452 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1453 /* Note: when changing this, make sure to find the places
1454 that use chainon or nreverse. */
1455 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1456 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1457 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1459 /* Nonzero means that this block is prepared to handle exceptions
1460 listed in the BLOCK_VARS slot. */
1461 #define BLOCK_HANDLER_BLOCK(NODE) \
1462 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1464 /* An index number for this block. These values are not guaranteed to
1465 be unique across functions -- whether or not they are depends on
1466 the debugging output format in use. */
1467 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1469 /* If block reordering splits a lexical block into discontiguous
1470 address ranges, we'll make a copy of the original block.
1472 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1473 In that case, we have one source block that has been replicated
1474 (through inlining or unrolling) into many logical blocks, and that
1475 these logical blocks have different physical variables in them.
1477 In this case, we have one logical block split into several
1478 non-contiguous address ranges. Most debug formats can't actually
1479 represent this idea directly, so we fake it by creating multiple
1480 logical blocks with the same variables in them. However, for those
1481 that do support non-contiguous regions, these allow the original
1482 logical block to be reconstructed, along with the set of address
1485 One of the logical block fragments is arbitrarily chosen to be
1486 the ORIGIN. The other fragments will point to the origin via
1487 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1488 be null. The list of fragments will be chained through
1489 BLOCK_FRAGMENT_CHAIN from the origin. */
1491 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1492 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1494 struct tree_block GTY(())
1496 struct tree_common common;
1498 unsigned handler_block_flag : 1;
1499 unsigned abstract_flag : 1;
1500 unsigned block_num : 30;
1505 tree abstract_origin;
1506 tree fragment_origin;
1507 tree fragment_chain;
1510 /* Define fields and accessors for nodes representing data types. */
1512 /* See tree.def for documentation of the use of these fields.
1513 Look at the documentation of the various ..._TYPE tree codes.
1515 Note that the type.values, type.minval, and type.maxval fields are
1516 overloaded and used for different macros in different kinds of types.
1517 Each macro must check to ensure the tree node is of the proper kind of
1518 type. Note also that some of the front-ends also overload these fields,
1519 so they must be checked as well. */
1521 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1522 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1523 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1524 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1525 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1526 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
1527 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
1528 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
1529 #define TYPE_ORIG_SIZE_TYPE(NODE) \
1530 (INTEGER_TYPE_CHECK (NODE)->type.values \
1531 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
1532 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
1533 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
1534 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1535 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1536 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1537 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1538 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1539 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1540 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1541 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1542 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1543 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1544 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1545 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1546 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1547 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1548 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1549 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1550 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1551 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1553 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1554 in the debugging output. We use this to describe a vector as a
1555 structure containing an array. */
1556 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1558 /* For record and union types, information about this type, as a base type
1560 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1562 /* For non record and union types, used in a language-dependent way. */
1563 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1565 /* The (language-specific) typed-based alias set for this type.
1566 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1567 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1568 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1569 type can alias objects of any type. */
1570 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1572 /* Nonzero iff the typed-based alias set for this type has been
1574 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1576 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1578 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1580 /* The alignment necessary for objects of this type.
1581 The value is an int, measured in bits. */
1582 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1584 /* 1 if the alignment for this type was requested by "aligned" attribute,
1585 0 if it is the default for this type. */
1586 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1588 /* The alignment for NODE, in bytes. */
1589 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1591 /* If your language allows you to declare types, and you want debug info
1592 for them, then you need to generate corresponding TYPE_DECL nodes.
1593 These "stub" TYPE_DECL nodes have no name, and simply point at the
1594 type node. You then set the TYPE_STUB_DECL field of the type node
1595 to point back at the TYPE_DECL node. This allows the debug routines
1596 to know that the two nodes represent the same type, so that we only
1597 get one debug info record for them. */
1598 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1600 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1601 has BLKmode only because it lacks the alignment requirement for
1603 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1605 /* In an INTEGER_TYPE, it means the type represents a size. We use
1606 this both for validity checking and to permit optimizations that
1607 are unsafe for other types. Note that the C `size_t' type should
1608 *not* have this flag set. The `size_t' type is simply a typedef
1609 for an ordinary integer type that happens to be the type of an
1610 expression returned by `sizeof'; `size_t' has no special
1611 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1612 always actual sizes. */
1613 #define TYPE_IS_SIZETYPE(NODE) \
1614 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1616 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1617 pointer depressed. */
1618 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1619 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1621 /* Nonzero in a type considered volatile as a whole. */
1622 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1624 /* Means this type is const-qualified. */
1625 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1627 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1629 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1631 /* There is a TYPE_QUAL value for each type qualifier. They can be
1632 combined by bitwise-or to form the complete set of qualifiers for a
1635 #define TYPE_UNQUALIFIED 0x0
1636 #define TYPE_QUAL_CONST 0x1
1637 #define TYPE_QUAL_VOLATILE 0x2
1638 #define TYPE_QUAL_RESTRICT 0x4
1640 /* The set of type qualifiers for this type. */
1641 #define TYPE_QUALS(NODE) \
1642 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1643 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1644 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1646 /* These flags are available for each language front end to use internally. */
1647 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1648 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1649 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1650 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1651 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1652 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1653 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1655 /* Used to keep track of visited nodes in tree traversals. This is set to
1656 0 by copy_node and make_node. */
1657 #define TREE_VISITED(NODE) ((NODE)->common.visited)
1659 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1660 that distinguish string from array of char).
1661 If set in a SET_TYPE, indicates a bitstring type. */
1662 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1664 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1665 object of the given ARRAY_TYPE. This allows temporaries to be
1667 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1668 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
1670 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1671 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1672 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
1674 /* Indicates that objects of this type must be initialized by calling a
1675 function when they are created. */
1676 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1677 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1679 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1680 the same way that the first union alternative would be passed. */
1681 #define TYPE_TRANSPARENT_UNION(NODE) \
1682 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1684 /* For an ARRAY_TYPE, indicates that it is not permitted to
1685 take the address of a component of the type. */
1686 #define TYPE_NONALIASED_COMPONENT(NODE) \
1687 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1689 /* Indicated that objects of this type should be laid out in as
1690 compact a way as possible. */
1691 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1693 /* Used by type_contains_placeholder_p to avoid recomputation.
1694 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1695 this field directly. */
1696 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1697 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
1701 struct tree_type GTY(())
1703 struct tree_common common;
1710 unsigned int precision : 9;
1711 ENUM_BITFIELD(machine_mode) mode : 7;
1713 unsigned string_flag : 1;
1714 unsigned no_force_blk_flag : 1;
1715 unsigned needs_constructing_flag : 1;
1716 unsigned transparent_union_flag : 1;
1717 unsigned packed_flag : 1;
1718 unsigned restrict_flag : 1;
1719 unsigned contains_placeholder_bits : 2;
1721 unsigned lang_flag_0 : 1;
1722 unsigned lang_flag_1 : 1;
1723 unsigned lang_flag_2 : 1;
1724 unsigned lang_flag_3 : 1;
1725 unsigned lang_flag_4 : 1;
1726 unsigned lang_flag_5 : 1;
1727 unsigned lang_flag_6 : 1;
1728 unsigned user_align : 1;
1733 union tree_type_symtab {
1734 int GTY ((tag ("0"))) address;
1735 char * GTY ((tag ("1"))) pointer;
1736 struct die_struct * GTY ((tag ("2"))) die;
1737 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1738 descbits ("2"))) symtab;
1746 HOST_WIDE_INT alias_set;
1747 /* Points to a structure whose details depend on the language in use. */
1748 struct lang_type *lang_specific;
1751 /* Define accessor macros for information about type inheritance
1754 A "basetype" means a particular usage of a data type for inheritance
1755 in another type. Each such basetype usage has its own "binfo"
1756 object to describe it. The binfo object is a TREE_VEC node.
1758 Inheritance is represented by the binfo nodes allocated for a
1759 given type. For example, given types C and D, such that D is
1760 inherited by C, 3 binfo nodes will be allocated: one for describing
1761 the binfo properties of C, similarly one for D, and one for
1762 describing the binfo properties of D as a base type for C.
1763 Thus, given a pointer to class C, one can get a pointer to the binfo
1764 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1766 /* BINFO specific flags. */
1768 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1769 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag)
1771 /* Flags for language dependent use. */
1772 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
1773 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
1774 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
1775 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
1776 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
1777 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
1778 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
1780 /* The actual data type node being inherited in this basetype. */
1781 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
1783 /* The offset where this basetype appears in its containing type.
1784 BINFO_OFFSET slot holds the offset (in bytes)
1785 from the base of the complete object to the base of the part of the
1786 object that is allocated on behalf of this `type'.
1787 This is always 0 except when there is multiple inheritance. */
1789 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
1790 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1792 /* The virtual function table belonging to this basetype. Virtual
1793 function tables provide a mechanism for run-time method dispatching.
1794 The entries of a virtual function table are language-dependent. */
1796 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
1798 /* The virtual functions in the virtual function table. This is
1799 a TREE_LIST that is used as an initial approximation for building
1800 a virtual function table for this basetype. */
1801 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
1803 /* A vector of binfos for the direct basetypes inherited by this
1806 If this basetype describes type D as inherited in C, and if the
1807 basetypes of D are E and F, then this vector contains binfos for
1808 inheritance of E and F by C. */
1809 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
1811 /* The number of basetypes for NODE. */
1812 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
1814 /* Accessor macro to get to the Nth base binfo of this binfo. */
1815 #define BINFO_BASE_BINFO(NODE,N) \
1816 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
1817 #define BINFO_BASE_ITERATE(NODE,N,B) \
1818 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
1819 #define BINFO_BASE_APPEND(NODE,T) \
1820 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
1822 /* For a BINFO record describing a virtual base class, i.e., one where
1823 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1824 base. The actual contents are language-dependent. In the C++
1825 front-end this field is an INTEGER_CST giving an offset into the
1826 vtable where the offset to the virtual base can be found. */
1827 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
1829 /* Indicates the accesses this binfo has to its bases. The values are
1830 access_public_node, access_protected_node or access_private_node.
1831 If this array is not present, public access is implied. */
1832 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
1834 #define BINFO_BASE_ACCESS(NODE,N) \
1835 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
1836 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1837 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
1839 /* The index in the VTT where this subobject's sub-VTT can be found.
1840 NULL_TREE if there is no sub-VTT. */
1841 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
1843 /* The index in the VTT where the vptr for this subobject can be
1844 found. NULL_TREE if there is no secondary vptr in the VTT. */
1845 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
1847 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1848 inheriting this base for non-virtual bases. For virtual bases it
1849 points either to the binfo for which this is a primary binfo, or to
1850 the binfo of the most derived type. */
1851 #define BINFO_INHERITANCE_CHAIN(NODE) \
1852 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
1854 struct tree_binfo GTY (())
1856 struct tree_common common;
1862 VEC(tree) *base_accesses;
1868 VEC(tree) base_binfos;
1872 /* Define fields and accessors for nodes representing declared names. */
1874 /* Nonzero if DECL represents a variable for the SSA passes. */
1875 #define SSA_VAR_P(DECL) \
1876 (TREE_CODE (DECL) == VAR_DECL \
1877 || TREE_CODE (DECL) == PARM_DECL \
1878 || TREE_CODE (DECL) == RESULT_DECL \
1879 || (TREE_CODE (DECL) == SSA_NAME \
1880 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
1881 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
1882 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
1884 /* This is the name of the object as written by the user.
1885 It is an IDENTIFIER_NODE. */
1886 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1888 /* The name of the object as the assembler will see it (but before any
1889 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1890 as DECL_NAME. It is an IDENTIFIER_NODE. */
1891 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1893 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1894 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1896 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1897 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1899 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1900 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1901 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1903 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1904 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1905 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1906 semantics of using this macro, are different than saying:
1908 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1910 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1912 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1913 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1914 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1915 DECL_ASSEMBLER_NAME (DECL1)) \
1918 /* Records the section name in a section attribute. Used to pass
1919 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1920 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1922 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1923 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1924 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1925 points to either the FUNCTION_DECL for the containing function,
1926 the RECORD_TYPE or UNION_TYPE for the containing type, or
1927 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1929 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1930 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1931 /* In a DECL this is the field where attributes are stored. */
1932 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1933 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1934 byte containing the bit closest to the beginning of the structure. */
1935 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1936 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1937 field from DECL_FIELD_OFFSET. */
1938 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1939 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1940 if so, the type that was originally specified for it.
1941 TREE_TYPE may have been modified (in finish_struct). */
1942 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1943 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1944 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1946 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1947 /* This field is used to reference anything in decl.result and is meant only
1948 for use by the garbage collector. */
1949 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1950 /* In FUNCTION_DECL, holds the decl for the return value. */
1951 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1952 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1953 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1954 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1955 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1956 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1957 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1958 For a VAR_DECL, holds the initial value.
1959 For a PARM_DECL, not used--default
1960 values for parameters are encoded in the type of the function,
1961 not in the PARM_DECL slot.
1963 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1964 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1965 /* For a PARM_DECL, records the data type used to pass the argument,
1966 which may be different from the type seen in the program. */
1967 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1968 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1969 if nonzero, indicates that the field occupies the type. */
1970 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1971 /* These two fields describe where in the source code the declaration
1972 was. If the declaration appears in several places (as for a C
1973 function that is declared first and then defined later), this
1974 information should refer to the definition. */
1975 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1976 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1977 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1978 #ifdef USE_MAPPED_LOCATION
1979 #define DECL_IS_BUILTIN(DECL) \
1980 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
1982 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
1984 /* Holds the size of the datum, in bits, as a tree expression.
1985 Need not be constant. */
1986 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1987 /* Likewise for the size in bytes. */
1988 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1989 /* Holds the alignment required for the datum, in bits. */
1990 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1991 /* The alignment of NODE, in bytes. */
1992 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1993 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1994 DECL_FIELD_OFFSET which are known to be always zero.
1995 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1997 #define DECL_OFFSET_ALIGN(NODE) \
1998 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1999 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2000 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2001 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
2002 /* 1 if the alignment for this type was requested by "aligned" attribute,
2003 0 if it is the default for this type. */
2004 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
2005 /* Holds the machine mode corresponding to the declaration of a variable or
2006 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2008 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
2009 /* Holds the RTL expression for the value of a variable or function.
2010 This value can be evaluated lazily for functions, variables with
2011 static storage duration, and labels. */
2012 #define DECL_RTL(NODE) \
2013 (DECL_CHECK (NODE)->decl.rtl \
2014 ? (NODE)->decl.rtl \
2015 : (make_decl_rtl (NODE), (NODE)->decl.rtl))
2016 /* Set the DECL_RTL for NODE to RTL. */
2017 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2018 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2019 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
2020 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2021 NODE1, it will not be set for NODE2; this is a lazy copy. */
2022 #define COPY_DECL_RTL(NODE1, NODE2) \
2023 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
2024 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2025 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2027 /* For PARM_DECL, holds an RTL for the stack slot or register
2028 where the data was actually passed. */
2029 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
2031 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2032 that describes the status of this function. */
2033 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
2035 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2036 operation it is. Note, however, that this field is overloaded, with
2037 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2038 checked before any access to the former. */
2039 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
2041 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2042 Before the struct containing the FUNCTION_DECL is laid out,
2043 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2044 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2045 function. When the class is laid out, this pointer is changed
2046 to an INTEGER_CST node which is suitable for use as an index
2047 into the virtual function table. */
2048 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
2050 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2051 which this FIELD_DECL is defined. This information is needed when
2052 writing debugging information about vfield and vbase decls for C++. */
2053 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
2055 /* For VAR_DECL, this is set to either an expression that it was split
2056 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
2057 subexpressions that it was split into. */
2058 #define DECL_DEBUG_EXPR(NODE) (DECL_CHECK (NODE)->decl.vindex)
2060 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2061 (DECL_CHECK (NODE)->decl.debug_expr_is_from)
2063 /* Every ..._DECL node gets a unique number. */
2064 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
2066 /* For any sort of a ..._DECL node, this points to the original (abstract)
2067 decl node which this decl is an instance of, or else it is NULL indicating
2068 that this decl is not an instance of some other decl. For example,
2069 in a nested declaration of an inline function, this points back to the
2071 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
2073 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2074 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2075 #define DECL_ORIGIN(NODE) \
2076 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2078 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2079 inline instance of some original (abstract) decl from an inline function;
2080 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2081 nodes can also have their abstract origin set to themselves. */
2082 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2083 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2085 /* Nonzero for a given ..._DECL node means that the name of this node should
2086 be ignored for symbolic debug purposes. */
2087 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
2089 /* Nonzero for a given ..._DECL node means that this node represents an
2090 "abstract instance" of the given declaration (e.g. in the original
2091 declaration of an inline function). When generating symbolic debugging
2092 information, we mustn't try to generate any address information for nodes
2093 marked as "abstract instances" because we don't actually generate
2094 any code or allocate any data space for such instances. */
2095 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
2097 /* Nonzero for a given ..._DECL node means that no warnings should be
2098 generated just because this node is unused. */
2099 #define DECL_IN_SYSTEM_HEADER(NODE) \
2100 (DECL_CHECK (NODE)->decl.in_system_header_flag)
2102 /* Nonzero for a given ..._DECL node means that this node should be
2103 put in .common, if possible. If a DECL_INITIAL is given, and it
2104 is not error_mark_node, then the decl cannot be put in .common. */
2105 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
2107 /* Language-specific decl information. */
2108 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
2110 /* In a VAR_DECL or FUNCTION_DECL,
2111 nonzero means external reference:
2112 do not allocate storage, and refer to a definition elsewhere. */
2113 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
2115 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
2117 #define DEFAULT_INIT_PRIORITY 65535
2118 #define MAX_INIT_PRIORITY 65535
2119 #define MAX_RESERVED_INIT_PRIORITY 100
2122 nonzero means the detail info about this type is not dumped into stabs.
2123 Instead it will generate cross reference ('x') of names.
2124 This uses the same flag as DECL_EXTERNAL. */
2125 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2126 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
2128 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2129 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
2131 /* In LABEL_DECL nodes, nonzero means that an error message about
2132 jumping into such a binding contour has been printed for this label. */
2133 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
2135 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2136 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
2138 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
2139 static chain is not needed. */
2140 #define DECL_NO_STATIC_CHAIN(NODE) \
2141 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
2143 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2144 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2146 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2148 Also set in some languages for variables, etc., outside the normal
2149 lexical scope, such as class instance variables. */
2150 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
2152 /* Nonzero in a FUNCTION_DECL means this function can be substituted
2153 where it is called. */
2154 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
2156 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2157 such as via the `inline' keyword in C/C++. This flag controls the linkage
2158 semantics of 'inline'; whether or not the function is inlined is
2159 controlled by DECL_INLINE. */
2160 #define DECL_DECLARED_INLINE_P(NODE) \
2161 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
2163 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2164 this variable in a BIND_EXPR. */
2165 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2166 (DECL_CHECK (NODE)->decl.seen_in_bind_expr)
2168 /* In a VAR_DECL, nonzero if the decl is a register variable with
2169 an explicit asm specification. */
2170 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl.inline_flag)
2172 /* Value of the decls's visibility attribute */
2173 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility)
2175 /* Nonzero means that the decl had its visibility specified rather than
2177 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_CHECK (NODE)->decl.visibility_specified)
2179 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2180 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
2182 /* In a VAR_DECL, nonzero if the data should be allocated from
2183 thread-local storage. */
2184 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
2186 /* In a FUNCTION_DECL, the saved representation of the body of the
2188 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
2190 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2191 if transformations have made this more complicated than evaluating the
2192 decl itself. This should only be used for debugging; once this field has
2193 been set, the decl itself may not legitimately appear in the function. */
2194 #define DECL_VALUE_EXPR(NODE) \
2195 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl.saved_tree)
2197 /* Nonzero in a FUNCTION_DECL means this function should be treated
2198 as if it were a malloc, meaning it returns a pointer that is
2200 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
2202 /* Nonzero in a FUNCTION_DECL means this function may return more
2204 #define DECL_IS_RETURNS_TWICE(NODE) \
2205 (FUNCTION_DECL_CHECK (NODE)->decl.returns_twice_flag)
2207 /* Nonzero in a FUNCTION_DECL means this function should be treated
2208 as "pure" function (like const function, but may read global memory). */
2209 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
2211 /* Nonzero in a FUNCTION_DECL means this function should be treated
2212 as "novops" function (function that does not read global memory,
2213 but may have arbitrary side effects). */
2214 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.novops_flag)
2216 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2218 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
2220 /* Unused in FUNCTION_DECL. */
2222 /* In a VAR_DECL that's static,
2223 nonzero if the space is in the text section. */
2224 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
2226 /* In a FUNCTION_DECL, nonzero means a built in function. */
2227 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2229 /* For a builtin function, identify which part of the compiler defined it. */
2230 #define DECL_BUILT_IN_CLASS(NODE) \
2231 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
2233 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2234 Used in FIELD_DECLs for vtable pointers.
2235 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2236 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
2238 /* Used to indicate that the linkage status of this DECL is not yet known,
2239 so it should not be output now. */
2240 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
2242 /* Used in PARM_DECLs whose type are unions to indicate that the
2243 argument should be passed in the same way that the first union
2244 alternative would be passed. */
2245 #define DECL_TRANSPARENT_UNION(NODE) \
2246 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
2248 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2249 at the beginning or end of execution. */
2250 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2251 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
2253 #define DECL_STATIC_DESTRUCTOR(NODE) \
2254 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
2256 /* Used to indicate that this DECL represents a compiler-generated entity. */
2257 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
2259 /* Used to indicate that this DECL has weak linkage. */
2260 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
2262 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2263 multiple translation units should be merged. */
2264 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
2266 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2267 not be put out unless it is needed in this translation unit.
2268 Entities like this are shared across translation units (like weak
2269 entities), but are guaranteed to be generated by any translation
2270 unit that needs them, and therefore need not be put out anywhere
2271 where they are not needed. DECL_COMDAT is just a hint to the
2272 back-end; it is up to front-ends which set this flag to ensure
2273 that there will never be any harm, other than bloat, in putting out
2274 something which is DECL_COMDAT. */
2275 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
2277 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2278 be instrumented with calls to support routines. */
2279 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2280 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
2282 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2283 disabled in this function. */
2284 #define DECL_NO_LIMIT_STACK(NODE) \
2285 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
2287 /* Additional flags for language-specific uses. */
2288 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
2289 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
2290 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
2291 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
2292 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
2293 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
2294 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
2295 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
2297 /* Used to indicate that the pointer to this DECL cannot be treated as
2298 an address constant. */
2299 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
2301 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2303 #define DECL_NONADDRESSABLE_P(NODE) \
2304 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
2306 /* Used to indicate an alias set for the memory pointed to by this
2307 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2308 pointer (or reference) type. */
2309 #define DECL_POINTER_ALIAS_SET(NODE) \
2310 (DECL_CHECK (NODE)->decl.pointer_alias_set)
2313 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2314 dense, unique within any one function, and may be used to index arrays.
2315 If the value is -1, then no UID has been assigned. */
2316 #define LABEL_DECL_UID(NODE) \
2317 (LABEL_DECL_CHECK (NODE)->decl.pointer_alias_set)
2319 /* Nonzero if an alias set has been assigned to this declaration. */
2320 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2321 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2323 /* Nonzero for a decl which is at file scope. */
2324 #define DECL_FILE_SCOPE_P(EXP) \
2325 (! DECL_CONTEXT (EXP) \
2326 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2328 /* Nonzero for a decl that cgraph has decided should be inlined into
2329 at least one call site. It is not meaningful to look at this
2330 directly; always use cgraph_function_possibly_inlined_p. */
2331 #define DECL_POSSIBLY_INLINED(DECL) \
2332 FUNCTION_DECL_CHECK (DECL)->decl.possibly_inlined
2334 /* Nonzero for a decl that is decorated using attribute used.
2335 This indicates compiler tools that this decl needs to be preserved. */
2336 #define DECL_PRESERVE_P(DECL) \
2337 DECL_CHECK (DECL)->decl.preserve_flag
2339 /* Internal to the gimplifier. Indicates that the value is a formal
2340 temporary controlled by the gimplifier. */
2341 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2342 DECL_CHECK (DECL)->decl.gimple_formal_temp
2344 /* Enumerate visibility settings. */
2345 #ifndef SYMBOL_VISIBILITY_DEFINED
2346 #define SYMBOL_VISIBILITY_DEFINED
2347 enum symbol_visibility
2350 VISIBILITY_INTERNAL,
2352 VISIBILITY_PROTECTED
2357 struct tree_decl GTY(())
2359 struct tree_common common;
2363 ENUM_BITFIELD(machine_mode) mode : 8;
2365 unsigned external_flag : 1;
2366 unsigned nonlocal_flag : 1;
2367 unsigned regdecl_flag : 1;
2368 unsigned inline_flag : 1;
2369 unsigned bit_field_flag : 1;
2370 unsigned virtual_flag : 1;
2371 unsigned ignored_flag : 1;
2372 unsigned abstract_flag : 1;
2374 unsigned in_system_header_flag : 1;
2375 unsigned common_flag : 1;
2376 unsigned defer_output : 1;
2377 unsigned transparent_union : 1;
2378 unsigned static_ctor_flag : 1;
2379 unsigned static_dtor_flag : 1;
2380 unsigned artificial_flag : 1;
2381 unsigned weak_flag : 1;
2383 unsigned non_addr_const_p : 1;
2384 unsigned no_instrument_function_entry_exit : 1;
2385 unsigned comdat_flag : 1;
2386 unsigned malloc_flag : 1;
2387 unsigned no_limit_stack : 1;
2388 ENUM_BITFIELD(built_in_class) built_in_class : 2;
2389 unsigned pure_flag : 1;
2391 unsigned non_addressable : 1;
2392 unsigned user_align : 1;
2393 unsigned uninlinable : 1;
2394 unsigned thread_local_flag : 1;
2395 unsigned declared_inline_flag : 1;
2396 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2397 unsigned visibility_specified : 1;
2399 unsigned lang_flag_0 : 1;
2400 unsigned lang_flag_1 : 1;
2401 unsigned lang_flag_2 : 1;
2402 unsigned lang_flag_3 : 1;
2403 unsigned lang_flag_4 : 1;
2404 unsigned lang_flag_5 : 1;
2405 unsigned lang_flag_6 : 1;
2406 unsigned lang_flag_7 : 1;
2408 unsigned possibly_inlined : 1;
2409 unsigned preserve_flag: 1;
2410 unsigned gimple_formal_temp : 1;
2411 unsigned debug_expr_is_from : 1;
2412 unsigned returns_twice_flag : 1;
2413 unsigned seen_in_bind_expr : 1;
2414 unsigned novops_flag : 1;
2415 /* 9 unused bits. */
2417 union tree_decl_u1 {
2418 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2419 DECL_FUNCTION_CODE. */
2420 enum built_in_function f;
2421 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2422 is used by language-dependent code. */
2424 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2426 struct tree_decl_u1_a {
2427 unsigned int align : 24;
2428 unsigned int off_align : 8;
2435 tree arguments; /* Also used for DECL_FIELD_OFFSET */
2436 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
2437 tree initial; /* Also used for DECL_QUALIFIER */
2438 tree abstract_origin;
2439 tree assembler_name;
2442 rtx rtl; /* RTL representation for object. */
2444 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
2445 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
2446 In PARM_DECL, holds an RTL for the stack slot
2447 of register where the data was actually passed.
2448 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
2449 union tree_decl_u2 {
2450 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
2451 rtx GTY ((tag ("PARM_DECL"))) r;
2452 tree GTY ((tag ("FIELD_DECL"))) t;
2453 int GTY ((tag ("VAR_DECL"))) i;
2454 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
2456 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE.
2457 In a VAR_DECL or PARM_DECL, this is DECL_VALUE_EXPR. */
2460 HOST_WIDE_INT pointer_alias_set;
2461 /* Points to a structure whose details depend on the language in use. */
2462 struct lang_decl *lang_specific;
2466 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2467 To reduce overhead, the nodes containing the statements are not trees.
2468 This avoids the overhead of tree_common on all linked list elements.
2470 Use the interface in tree-iterator.h to access this node. */
2472 #define STATEMENT_LIST_HEAD(NODE) \
2473 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2474 #define STATEMENT_LIST_TAIL(NODE) \
2475 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2477 struct tree_statement_list_node
2478 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
2480 struct tree_statement_list_node *prev;
2481 struct tree_statement_list_node *next;
2485 struct tree_statement_list
2488 struct tree_common common;
2489 struct tree_statement_list_node *head;
2490 struct tree_statement_list_node *tail;
2493 #define VALUE_HANDLE_ID(NODE) \
2494 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
2496 #define VALUE_HANDLE_EXPR_SET(NODE) \
2497 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
2499 /* Defined and used in tree-ssa-pre.c. */
2502 struct tree_value_handle GTY(())
2504 struct tree_common common;
2506 /* The set of expressions represented by this handle. */
2507 struct value_set * GTY ((skip)) expr_set;
2509 /* Unique ID for this value handle. IDs are handed out in a
2510 conveniently dense form starting at 0, so that we can make
2511 bitmaps of value handles. */
2515 enum tree_node_structure_enum {
2537 /* Define the overall contents of a tree node.
2538 It may be any of the structures declared above
2539 for various types of node. */
2541 union tree_node GTY ((ptr_alias (union lang_tree_node),
2542 desc ("tree_node_structure (&%h)")))
2544 struct tree_common GTY ((tag ("TS_COMMON"))) common;
2545 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
2546 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
2547 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
2548 struct tree_string GTY ((tag ("TS_STRING"))) string;
2549 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
2550 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
2551 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
2552 struct tree_type GTY ((tag ("TS_TYPE"))) type;
2553 struct tree_list GTY ((tag ("TS_LIST"))) list;
2554 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
2555 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
2556 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
2557 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
2558 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
2559 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
2560 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
2561 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
2564 /* Standard named or nameless data types of the C compiler. */
2583 TI_INTEGER_MINUS_ONE,
2600 TI_COMPLEX_INTEGER_TYPE,
2601 TI_COMPLEX_FLOAT_TYPE,
2602 TI_COMPLEX_DOUBLE_TYPE,
2603 TI_COMPLEX_LONG_DOUBLE_TYPE,
2607 TI_LONG_DOUBLE_TYPE,
2611 TI_LONG_DOUBLE_PTR_TYPE,
2612 TI_INTEGER_PTR_TYPE,
2631 extern GTY(()) tree global_trees[TI_MAX];
2633 #define error_mark_node global_trees[TI_ERROR_MARK]
2635 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2636 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2637 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2638 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2639 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2641 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2642 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2643 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2644 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2645 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2647 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2648 #define integer_one_node global_trees[TI_INTEGER_ONE]
2649 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2650 #define size_zero_node global_trees[TI_SIZE_ZERO]
2651 #define size_one_node global_trees[TI_SIZE_ONE]
2652 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2653 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2654 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2656 /* Base access nodes. */
2657 #define access_public_node global_trees[TI_PUBLIC]
2658 #define access_protected_node global_trees[TI_PROTECTED]
2659 #define access_private_node global_trees[TI_PRIVATE]
2661 #define null_pointer_node global_trees[TI_NULL_POINTER]
2663 #define float_type_node global_trees[TI_FLOAT_TYPE]
2664 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2665 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2667 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
2668 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
2669 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
2670 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
2672 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2673 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2674 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2675 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2677 #define void_type_node global_trees[TI_VOID_TYPE]
2678 /* The C type `void *'. */
2679 #define ptr_type_node global_trees[TI_PTR_TYPE]
2680 /* The C type `const void *'. */
2681 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2682 /* The C type `size_t'. */
2683 #define size_type_node global_trees[TI_SIZE_TYPE]
2684 #define pid_type_node global_trees[TI_PID_TYPE]
2685 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2686 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2687 /* The C type `FILE *'. */
2688 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
2690 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
2691 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
2692 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
2694 /* The node that should be placed at the end of a parameter list to
2695 indicate that the function does not take a variable number of
2696 arguments. The TREE_VALUE will be void_type_node and there will be
2697 no TREE_CHAIN. Language-independent code should not assume
2698 anything else about this node. */
2699 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2701 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2702 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2704 /* An enumeration of the standard C integer types. These must be
2705 ordered so that shorter types appear before longer ones, and so
2706 that signed types appear before unsigned ones, for the correct
2707 functioning of interpret_integer() in c-lex.c. */
2708 enum integer_type_kind
2720 itk_unsigned_long_long,
2724 typedef enum integer_type_kind integer_type_kind;
2726 /* The standard C integer types. Use integer_type_kind to index into
2728 extern GTY(()) tree integer_types[itk_none];
2730 #define char_type_node integer_types[itk_char]
2731 #define signed_char_type_node integer_types[itk_signed_char]
2732 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2733 #define short_integer_type_node integer_types[itk_short]
2734 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2735 #define integer_type_node integer_types[itk_int]
2736 #define unsigned_type_node integer_types[itk_unsigned_int]
2737 #define long_integer_type_node integer_types[itk_long]
2738 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2739 #define long_long_integer_type_node integer_types[itk_long_long]
2740 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2742 /* Set to the default thread-local storage (tls) model to use. */
2744 extern enum tls_model flag_tls_default;
2747 /* A pointer-to-function member type looks like:
2754 If __pfn is NULL, it is a NULL pointer-to-member-function.
2756 (Because the vtable is always the first thing in the object, we
2757 don't need its offset.) If the function is virtual, then PFN is
2758 one plus twice the index into the vtable; otherwise, it is just a
2759 pointer to the function.
2761 Unfortunately, using the lowest bit of PFN doesn't work in
2762 architectures that don't impose alignment requirements on function
2763 addresses, or that use the lowest bit to tell one ISA from another,
2764 for example. For such architectures, we use the lowest bit of
2765 DELTA instead of the lowest bit of the PFN, and DELTA will be
2768 enum ptrmemfunc_vbit_where_t
2770 ptrmemfunc_vbit_in_pfn,
2771 ptrmemfunc_vbit_in_delta
2774 #define NULL_TREE (tree) NULL
2776 extern GTY(()) tree frame_base_decl;
2777 extern tree decl_assembler_name (tree);
2779 /* Compute the number of bytes occupied by 'node'. This routine only
2780 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2782 extern size_t tree_size (tree);
2784 /* Compute the number of bytes occupied by a tree with code CODE. This
2785 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
2787 extern size_t tree_code_size (enum tree_code);
2789 /* Lowest level primitive for allocating a node.
2790 The TREE_CODE is the only argument. Contents are initialized
2791 to zero except for a few of the common fields. */
2793 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
2794 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
2796 /* Make a copy of a node, with all the same contents. */
2798 extern tree copy_node_stat (tree MEM_STAT_DECL);
2799 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
2801 /* Make a copy of a chain of TREE_LIST nodes. */
2803 extern tree copy_list (tree);
2806 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
2807 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
2809 /* Make a TREE_VEC. */
2811 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
2812 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
2814 /* Tree nodes for SSA analysis. */
2816 extern void init_phinodes (void);
2817 extern void fini_phinodes (void);
2818 extern void release_phi_node (tree);
2819 #ifdef GATHER_STATISTICS
2820 extern void phinodes_print_statistics (void);
2823 extern void init_ssanames (void);
2824 extern void fini_ssanames (void);
2825 extern tree make_ssa_name (tree, tree);
2826 extern tree duplicate_ssa_name (tree, tree);
2827 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
2828 extern void release_ssa_name (tree);
2829 extern void release_defs (tree);
2830 extern void replace_ssa_name_symbol (tree, tree);
2832 #ifdef GATHER_STATISTICS
2833 extern void ssanames_print_statistics (void);
2836 extern void mark_for_rewrite (tree);
2837 extern void unmark_all_for_rewrite (void);
2838 extern bool marked_for_rewrite_p (tree);
2839 extern bool any_marked_for_rewrite_p (void);
2840 extern struct bitmap_head_def *marked_ssa_names (void);
2843 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2844 The name is supplied as a char *. */
2846 extern tree get_identifier (const char *);
2848 #if GCC_VERSION >= 3000
2849 #define get_identifier(str) \
2850 (__builtin_constant_p (str) \
2851 ? get_identifier_with_length ((str), strlen (str)) \
2852 : get_identifier (str))
2856 /* Identical to get_identifier, except that the length is assumed
2859 extern tree get_identifier_with_length (const char *, size_t);
2861 /* If an identifier with the name TEXT (a null-terminated string) has
2862 previously been referred to, return that node; otherwise return
2865 extern tree maybe_get_identifier (const char *);
2867 /* Construct various types of nodes. */
2869 extern tree build (enum tree_code, tree, ...);
2870 extern tree build_nt (enum tree_code, ...);
2872 #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L
2873 /* Use preprocessor trickery to map "build" to "buildN" where N is the
2874 expected number of arguments. This is used for both efficiency (no
2875 varargs), and checking (verifying number of passed arguments). */
2876 #define build(code, ...) \
2877 _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__)
2878 #define _buildN1(BASE, X) _buildN2(BASE, X)
2879 #define _buildN2(BASE, X) BASE##X
2880 #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0)
2881 #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c
2884 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
2885 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
2886 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2887 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
2888 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
2889 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
2890 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
2891 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
2892 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
2893 tree MEM_STAT_DECL);
2894 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
2896 extern tree build_int_cst (tree, HOST_WIDE_INT);
2897 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
2898 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
2899 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2900 extern tree build_vector (tree, tree);
2901 extern tree build_constructor (tree, tree);
2902 extern tree build_real_from_int_cst (tree, tree);
2903 extern tree build_complex (tree, tree, tree);
2904 extern tree build_string (int, const char *);
2905 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
2906 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
2907 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2908 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
2909 extern tree build_block (tree, tree, tree, tree, tree);
2910 #ifndef USE_MAPPED_LOCATION
2911 extern void annotate_with_file_line (tree, const char *, int);
2912 extern void annotate_with_locus (tree, location_t);
2914 extern tree build_empty_stmt (void);
2916 /* Construct various nodes representing data types. */
2918 extern tree make_signed_type (int);
2919 extern tree make_unsigned_type (int);
2920 extern tree signed_type_for (tree);
2921 extern tree unsigned_type_for (tree);
2922 extern void initialize_sizetypes (bool);
2923 extern void set_sizetype (tree);
2924 extern void fixup_unsigned_type (tree);
2925 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
2926 extern tree build_pointer_type (tree);
2927 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
2928 extern tree build_reference_type (tree);
2929 extern tree build_vector_type_for_mode (tree, enum machine_mode);
2930 extern tree build_vector_type (tree innertype, int nunits);
2931 extern tree build_type_no_quals (tree);
2932 extern tree build_index_type (tree);
2933 extern tree build_index_2_type (tree, tree);
2934 extern tree build_array_type (tree, tree);
2935 extern tree build_function_type (tree, tree);
2936 extern tree build_function_type_list (tree, ...);
2937 extern tree build_method_type_directly (tree, tree, tree);
2938 extern tree build_method_type (tree, tree);
2939 extern tree build_offset_type (tree, tree);
2940 extern tree build_complex_type (tree);
2941 extern tree array_type_nelts (tree);
2942 extern bool in_array_bounds_p (tree);
2944 extern tree value_member (tree, tree);
2945 extern tree purpose_member (tree, tree);
2947 extern int attribute_list_equal (tree, tree);
2948 extern int attribute_list_contained (tree, tree);
2949 extern int tree_int_cst_equal (tree, tree);
2950 extern int tree_int_cst_lt (tree, tree);
2951 extern int tree_int_cst_compare (tree, tree);
2952 extern int host_integerp (tree, int);
2953 extern HOST_WIDE_INT tree_low_cst (tree, int);
2954 extern int tree_int_cst_msb (tree);
2955 extern int tree_int_cst_sgn (tree);
2956 extern int tree_expr_nonnegative_p (tree);
2957 extern bool may_negate_without_overflow_p (tree);
2958 extern tree get_inner_array_type (tree);
2960 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2961 put the prototype here. Rtl.h does declare the prototype if
2962 tree.h had been included. */
2964 extern tree make_tree (tree, rtx);
2966 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2969 Such modified types already made are recorded so that duplicates
2972 extern tree build_type_attribute_variant (tree, tree);
2973 extern tree build_decl_attribute_variant (tree, tree);
2975 /* Structure describing an attribute and a function to handle it. */
2976 struct attribute_spec
2978 /* The name of the attribute (without any leading or trailing __),
2979 or NULL to mark the end of a table of attributes. */
2980 const char *const name;
2981 /* The minimum length of the list of arguments of the attribute. */
2982 const int min_length;
2983 /* The maximum length of the list of arguments of the attribute
2984 (-1 for no maximum). */
2985 const int max_length;
2986 /* Whether this attribute requires a DECL. If it does, it will be passed
2987 from types of DECLs, function return types and array element types to
2988 the DECLs, function types and array types respectively; but when
2989 applied to a type in any other circumstances, it will be ignored with
2990 a warning. (If greater control is desired for a given attribute,
2991 this should be false, and the flags argument to the handler may be
2992 used to gain greater control in that case.) */
2993 const bool decl_required;
2994 /* Whether this attribute requires a type. If it does, it will be passed
2995 from a DECL to the type of that DECL. */
2996 const bool type_required;
2997 /* Whether this attribute requires a function (or method) type. If it does,
2998 it will be passed from a function pointer type to the target type,
2999 and from a function return type (which is not itself a function
3000 pointer type) to the function type. */
3001 const bool function_type_required;
3002 /* Function to handle this attribute. NODE points to the node to which
3003 the attribute is to be applied. If a DECL, it should be modified in
3004 place; if a TYPE, a copy should be created. NAME is the name of the
3005 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3006 of the arguments (which may be NULL). FLAGS gives further information
3007 about the context of the attribute. Afterwards, the attributes will
3008 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3009 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3010 as well as in any other cases when the attributes should not be added
3011 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3012 applied to another type or DECL later may be returned;
3013 otherwise the return value should be NULL_TREE. This pointer may be
3014 NULL if no special handling is required beyond the checks implied
3015 by the rest of this structure. */
3016 tree (*const handler) (tree *node, tree name, tree args,
3017 int flags, bool *no_add_attrs);
3020 /* Flags that may be passed in the third argument of decl_attributes, and
3021 to handler functions for attributes. */
3022 enum attribute_flags
3024 /* The type passed in is the type of a DECL, and any attributes that
3025 should be passed in again to be applied to the DECL rather than the
3026 type should be returned. */
3027 ATTR_FLAG_DECL_NEXT = 1,
3028 /* The type passed in is a function return type, and any attributes that
3029 should be passed in again to be applied to the function type rather
3030 than the return type should be returned. */
3031 ATTR_FLAG_FUNCTION_NEXT = 2,
3032 /* The type passed in is an array element type, and any attributes that
3033 should be passed in again to be applied to the array type rather
3034 than the element type should be returned. */
3035 ATTR_FLAG_ARRAY_NEXT = 4,
3036 /* The type passed in is a structure, union or enumeration type being
3037 created, and should be modified in place. */
3038 ATTR_FLAG_TYPE_IN_PLACE = 8,
3039 /* The attributes are being applied by default to a library function whose
3040 name indicates known behavior, and should be silently ignored if they
3041 are not in fact compatible with the function type. */
3042 ATTR_FLAG_BUILT_IN = 16
3045 /* Default versions of target-overridable functions. */
3047 extern tree merge_decl_attributes (tree, tree);
3048 extern tree merge_type_attributes (tree, tree);
3050 /* Given a tree node and a string, return nonzero if the tree node is
3051 a valid attribute name for the string. */
3053 extern int is_attribute_p (const char *, tree);
3055 /* Given an attribute name and a list of attributes, return the list element
3056 of the attribute or NULL_TREE if not found. */
3058 extern tree lookup_attribute (const char *, tree);
3060 /* Given two attributes lists, return a list of their union. */
3062 extern tree merge_attributes (tree, tree);
3064 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3065 /* Given two Windows decl attributes lists, possibly including
3066 dllimport, return a list of their union . */
3067 extern tree merge_dllimport_decl_attributes (tree, tree);
3069 /* Handle a "dllimport" or "dllexport" attribute. */
3070 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3073 /* Check whether CAND is suitable to be returned from get_qualified_type
3074 (BASE, TYPE_QUALS). */
3076 extern bool check_qualified_type (tree, tree, int);
3078 /* Return a version of the TYPE, qualified as indicated by the
3079 TYPE_QUALS, if one exists. If no qualified version exists yet,
3080 return NULL_TREE. */
3082 extern tree get_qualified_type (tree, int);
3084 /* Like get_qualified_type, but creates the type if it does not
3085 exist. This function never returns NULL_TREE. */
3087 extern tree build_qualified_type (tree, int);
3089 /* Like build_qualified_type, but only deals with the `const' and
3090 `volatile' qualifiers. This interface is retained for backwards
3091 compatibility with the various front-ends; new code should use
3092 build_qualified_type instead. */
3094 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3095 build_qualified_type ((TYPE), \
3096 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3097 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3099 /* Make a copy of a type node. */
3101 extern tree build_distinct_type_copy (tree);
3102 extern tree build_variant_type_copy (tree);
3104 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3105 fields. Optionally specify an alignment, and then lay it out. */
3107 extern void finish_builtin_struct (tree, const char *,
3110 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3111 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3112 node, does nothing except for the first time. */
3114 extern void layout_type (tree);
3116 /* These functions allow a front-end to perform a manual layout of a
3117 RECORD_TYPE. (For instance, if the placement of subsequent fields
3118 depends on the placement of fields so far.) Begin by calling
3119 start_record_layout. Then, call place_field for each of the
3120 fields. Then, call finish_record_layout. See layout_type for the
3121 default way in which these functions are used. */
3123 typedef struct record_layout_info_s
3125 /* The RECORD_TYPE that we are laying out. */
3127 /* The offset into the record so far, in bytes, not including bits in
3130 /* The last known alignment of SIZE. */
3131 unsigned int offset_align;
3132 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3134 /* The alignment of the record so far, in bits. */
3135 unsigned int record_align;
3136 /* The alignment of the record so far, ignoring #pragma pack and
3137 __attribute__ ((packed)), in bits. */
3138 unsigned int unpacked_align;
3139 /* The previous field layed out. */
3141 /* The static variables (i.e., class variables, as opposed to
3142 instance variables) encountered in T. */
3143 tree pending_statics;
3144 /* Bits remaining in the current alignment group */
3145 int remaining_in_alignment;
3146 /* True if we've seen a packed field that didn't have normal
3147 alignment anyway. */
3148 int packed_maybe_necessary;
3149 } *record_layout_info;
3151 extern void set_lang_adjust_rli (void (*) (record_layout_info));
3152 extern record_layout_info start_record_layout (tree);
3153 extern tree bit_from_pos (tree, tree);
3154 extern tree byte_from_pos (tree, tree);
3155 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
3156 extern void normalize_offset (tree *, tree *, unsigned int);
3157 extern tree rli_size_unit_so_far (record_layout_info);
3158 extern tree rli_size_so_far (record_layout_info);
3159 extern void normalize_rli (record_layout_info);
3160 extern void place_field (record_layout_info, tree);
3161 extern void compute_record_mode (tree);
3162 extern void finish_record_layout (record_layout_info, int);
3164 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3165 return a canonicalized ..._TYPE node, so that duplicates are not made.
3166 How the hash code is computed is up to the caller, as long as any two
3167 callers that could hash identical-looking type nodes agree. */
3169 extern tree type_hash_canon (unsigned int, tree);
3171 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3172 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3173 fields. Call this only once for any given decl node.
3175 Second argument is the boundary that this field can be assumed to
3176 be starting at (in bits). Zero means it can be assumed aligned
3177 on any boundary that may be needed. */
3179 extern void layout_decl (tree, unsigned);
3181 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3182 a previous call to layout_decl and calls it again. */
3184 extern void relayout_decl (tree);
3186 /* Return the mode for data of a given size SIZE and mode class CLASS.
3187 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3188 The value is BLKmode if no other mode is found. This is like
3189 mode_for_size, but is passed a tree. */
3191 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
3193 /* Return an expr equal to X but certainly not valid as an lvalue. */
3195 extern tree non_lvalue (tree);
3197 extern tree convert (tree, tree);
3198 extern unsigned int expr_align (tree);
3199 extern tree expr_first (tree);
3200 extern tree expr_last (tree);
3201 extern tree expr_only (tree);
3202 extern tree size_in_bytes (tree);
3203 extern HOST_WIDE_INT int_size_in_bytes (tree);
3204 extern tree bit_position (tree);
3205 extern HOST_WIDE_INT int_bit_position (tree);
3206 extern tree byte_position (tree);
3207 extern HOST_WIDE_INT int_byte_position (tree);
3209 /* Define data structures, macros, and functions for handling sizes
3210 and the various types used to represent sizes. */
3214 SIZETYPE, /* Normal representation of sizes in bytes. */
3215 SSIZETYPE, /* Signed representation of sizes in bytes. */
3216 BITSIZETYPE, /* Normal representation of sizes in bits. */
3217 SBITSIZETYPE, /* Signed representation of sizes in bits. */
3220 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
3222 #define sizetype sizetype_tab[(int) SIZETYPE]
3223 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
3224 #define ssizetype sizetype_tab[(int) SSIZETYPE]
3225 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
3227 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
3228 extern tree size_binop (enum tree_code, tree, tree);
3229 extern tree size_diffop (tree, tree);
3231 #define size_int(L) size_int_kind (L, SIZETYPE)
3232 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
3233 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
3234 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
3236 extern tree round_up (tree, int);
3237 extern tree round_down (tree, int);
3238 extern tree get_pending_sizes (void);
3239 extern void put_pending_size (tree);
3240 extern void put_pending_sizes (tree);
3242 /* Type for sizes of data-type. */
3244 #define BITS_PER_UNIT_LOG \
3245 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3246 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3247 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3249 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
3250 extern unsigned int maximum_field_alignment;
3251 /* and its original value in bytes, specified via -fpack-struct=<value>. */
3252 extern unsigned int initial_max_fld_align;
3254 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3255 by making the last node in X point to Y.
3256 Returns X, except if X is 0 returns Y. */
3258 extern tree chainon (tree, tree);
3260 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3262 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3263 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3265 /* Return the last tree node in a chain. */
3267 extern tree tree_last (tree);
3269 /* Reverse the order of elements in a chain, and return the new head. */
3271 extern tree nreverse (tree);
3273 /* Returns the length of a chain of nodes
3274 (number of chain pointers to follow before reaching a null pointer). */
3276 extern int list_length (tree);
3278 /* Returns the number of FIELD_DECLs in a type. */
3280 extern int fields_length (tree);
3282 /* Given an initializer INIT, return TRUE if INIT is zero or some
3283 aggregate of zeros. Otherwise return FALSE. */
3285 extern bool initializer_zerop (tree);
3287 extern void categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3288 HOST_WIDE_INT *, bool *);
3289 extern HOST_WIDE_INT count_type_elements (tree);
3291 /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */
3293 extern void add_var_to_bind_expr (tree, tree);
3295 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3297 extern int integer_zerop (tree);
3299 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
3301 extern int integer_onep (tree);
3303 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3304 all of whose significant bits are 1. */
3306 extern int integer_all_onesp (tree);
3308 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3309 exactly one bit 1. */
3311 extern int integer_pow2p (tree);
3313 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3314 with a nonzero value. */
3316 extern int integer_nonzerop (tree);
3318 extern bool zero_p (tree);
3319 extern bool cst_and_fits_in_hwi (tree);
3320 extern tree num_ending_zeros (tree);
3322 /* staticp (tree x) is nonzero if X is a reference to data allocated
3323 at a fixed address in memory. Returns the outermost data. */
3325 extern tree staticp (tree);
3327 /* save_expr (EXP) returns an expression equivalent to EXP
3328 but it can be used multiple times within context CTX
3329 and only evaluate EXP once. */
3331 extern tree save_expr (tree);
3333 /* Look inside EXPR and into any simple arithmetic operations. Return
3334 the innermost non-arithmetic node. */
3336 extern tree skip_simple_arithmetic (tree);
3338 /* Return which tree structure is used by T. */
3340 enum tree_node_structure_enum tree_node_structure (tree);
3342 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
3343 or offset that depends on a field within a record.
3345 Note that we only allow such expressions within simple arithmetic
3348 extern bool contains_placeholder_p (tree);
3350 /* This macro calls the above function but short-circuits the common
3351 case of a constant to save time. Also check for null. */
3353 #define CONTAINS_PLACEHOLDER_P(EXP) \
3354 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
3356 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
3357 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
3360 extern bool type_contains_placeholder_p (tree);
3362 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3363 return a tree with all occurrences of references to F in a
3364 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
3365 contains only arithmetic expressions. */
3367 extern tree substitute_in_expr (tree, tree, tree);
3369 /* This macro calls the above function but short-circuits the common
3370 case of a constant to save time and also checks for NULL. */
3372 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
3373 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
3375 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3376 for it within OBJ, a tree that is an object or a chain of references. */
3378 extern tree substitute_placeholder_in_expr (tree, tree);
3380 /* This macro calls the above function but short-circuits the common
3381 case of a constant to save time and also checks for NULL. */
3383 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
3384 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
3385 : substitute_placeholder_in_expr (EXP, OBJ))
3387 /* variable_size (EXP) is like save_expr (EXP) except that it
3388 is for the special case of something that is part of a
3389 variable size for a data type. It makes special arrangements
3390 to compute the value at the right time when the data type
3391 belongs to a function parameter. */
3393 extern tree variable_size (tree);
3395 /* stabilize_reference (EXP) returns a reference equivalent to EXP
3396 but it can be used multiple times
3397 and only evaluate the subexpressions once. */
3399 extern tree stabilize_reference (tree);
3401 /* Subroutine of stabilize_reference; this is called for subtrees of
3402 references. Any expression with side-effects must be put in a SAVE_EXPR
3403 to ensure that it is only evaluated once. */
3405 extern tree stabilize_reference_1 (tree);
3407 /* Return EXP, stripped of any conversions to wider types
3408 in such a way that the result of converting to type FOR_TYPE
3409 is the same as if EXP were converted to FOR_TYPE.
3410 If FOR_TYPE is 0, it signifies EXP's type. */
3412 extern tree get_unwidened (tree, tree);
3414 /* Return OP or a simpler expression for a narrower value
3415 which can be sign-extended or zero-extended to give back OP.
3416 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3417 or 0 if the value should be sign-extended. */
3419 extern tree get_narrower (tree, int *);
3421 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
3422 look for nested component-refs or array-refs at constant positions
3423 and find the ultimate containing object, which is returned. */
3425 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3426 tree *, enum machine_mode *, int *, int *,
3429 /* Return 1 if T is an expression that get_inner_reference handles. */
3431 extern int handled_component_p (tree);
3433 /* Return a tree of sizetype representing the size, in bytes, of the element
3434 of EXP, an ARRAY_REF. */
3436 extern tree array_ref_element_size (tree);
3438 /* Return a tree representing the lower bound of the array mentioned in
3439 EXP, an ARRAY_REF. */
3441 extern tree array_ref_low_bound (tree);
3443 /* Return a tree representing the upper bound of the array mentioned in
3444 EXP, an ARRAY_REF. */
3446 extern tree array_ref_up_bound (tree);
3448 /* Return a tree representing the offset, in bytes, of the field referenced
3449 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
3451 extern tree component_ref_field_offset (tree);
3453 /* Given a DECL or TYPE, return the scope in which it was declared, or
3454 NUL_TREE if there is no containing scope. */
3456 extern tree get_containing_scope (tree);
3458 /* Return the FUNCTION_DECL which provides this _DECL with its context,
3460 extern tree decl_function_context (tree);
3462 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
3463 this _DECL with its context, or zero if none. */
3464 extern tree decl_type_context (tree);
3466 /* Return 1 if EXPR is the real constant zero. */
3467 extern int real_zerop (tree);
3469 /* Declare commonly used variables for tree structure. */
3471 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
3472 Zero means allow extended lvalues. */
3474 extern int pedantic_lvalues;
3476 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
3478 extern GTY(()) tree current_function_decl;
3480 /* Nonzero means a FUNC_BEGIN label was emitted. */
3481 extern GTY(()) const char * current_function_func_begin_label;
3484 extern unsigned crc32_string (unsigned, const char *);
3485 extern void clean_symbol_name (char *);
3486 extern tree get_file_function_name_long (const char *);
3487 extern tree get_callee_fndecl (tree);
3488 extern void change_decl_assembler_name (tree, tree);
3489 extern int type_num_arguments (tree);
3490 extern bool associative_tree_code (enum tree_code);
3491 extern bool commutative_tree_code (enum tree_code);
3492 extern tree upper_bound_in_type (tree, tree);
3493 extern tree lower_bound_in_type (tree, tree);
3494 extern int operand_equal_for_phi_arg_p (tree, tree);
3498 extern void expand_expr_stmt (tree);
3499 extern int warn_if_unused_value (tree, location_t);
3500 extern void expand_label (tree);
3501 extern void expand_goto (tree);
3503 extern rtx expand_stack_save (void);
3504 extern void expand_stack_restore (tree);
3505 extern void expand_return (tree);
3506 extern int is_body_block (tree);
3509 extern void using_eh_for_cleanups (void);
3511 /* In fold-const.c */
3513 /* Fold constants as much as possible in an expression.
3514 Returns the simplified expression.
3515 Acts only on the top level of the expression;
3516 if the argument itself cannot be simplified, its
3517 subexpressions are not changed. */
3519 extern tree fold (tree);
3520 extern tree fold_build1 (enum tree_code, tree, tree);
3521 extern tree fold_build2 (enum tree_code, tree, tree, tree);
3522 extern tree fold_build3 (enum tree_code, tree, tree, tree, tree);
3523 extern tree fold_initializer (tree);
3524 extern tree fold_convert (tree, tree);
3525 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
3526 extern tree fold_ignored_result (tree);
3527 extern tree fold_abs_const (tree, tree);
3529 extern tree force_fit_type (tree, int, bool, bool);
3531 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3532 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3533 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3534 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3535 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3536 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3537 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3538 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3539 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3540 HOST_WIDE_INT, unsigned int,
3541 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3542 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3543 HOST_WIDE_INT, unsigned int,
3544 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3545 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3546 HOST_WIDE_INT, unsigned int,
3547 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3548 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3549 HOST_WIDE_INT, unsigned int,
3550 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3552 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
3553 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
3554 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
3555 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
3558 enum operand_equal_flag
3564 extern int operand_equal_p (tree, tree, unsigned int);
3566 extern tree omit_one_operand (tree, tree, tree);
3567 extern tree omit_two_operands (tree, tree, tree, tree);
3568 extern tree invert_truthvalue (tree);
3569 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
3570 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
3571 extern tree fold_read_from_constant_string (tree);
3572 extern tree int_const_binop (enum tree_code, tree, tree, int);
3573 extern tree build_fold_addr_expr (tree);
3574 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
3575 extern tree fold_strip_sign_ops (tree);
3576 extern tree build_fold_addr_expr_with_type (tree, tree);
3577 extern tree build_fold_indirect_ref (tree);
3578 extern tree fold_indirect_ref (tree);
3579 extern tree constant_boolean_node (int, tree);
3580 extern tree build_low_bits_mask (tree, unsigned);
3581 extern tree fold_complex_mult_parts (tree, tree, tree, tree, tree);
3582 extern tree fold_complex_div_parts (tree, tree, tree, tree, tree,
3585 extern bool tree_swap_operands_p (tree, tree, bool);
3586 extern enum tree_code swap_tree_comparison (enum tree_code);
3588 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
3591 extern tree fold_builtin (tree, tree, bool);
3592 extern tree fold_builtin_fputs (tree, bool, bool, tree);
3593 extern tree fold_builtin_strcpy (tree, tree, tree);
3594 extern tree fold_builtin_strncpy (tree, tree, tree);
3595 extern bool fold_builtin_next_arg (tree);
3596 extern enum built_in_function builtin_mathfn_code (tree);
3597 extern tree build_function_call_expr (tree, tree);
3598 extern tree mathfn_built_in (tree, enum built_in_function fn);
3599 extern tree strip_float_extensions (tree);
3600 extern tree c_strlen (tree, int);
3601 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
3602 extern tree build_va_arg_indirect_ref (tree);
3605 extern tree strip_float_extensions (tree);
3608 extern void record_component_aliases (tree);
3609 extern HOST_WIDE_INT get_alias_set (tree);
3610 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3611 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3612 extern int objects_must_conflict_p (tree, tree);
3615 extern int really_constant_p (tree);
3616 extern int int_fits_type_p (tree, tree);
3617 extern bool variably_modified_type_p (tree, tree);
3618 extern int tree_log2 (tree);
3619 extern int tree_floor_log2 (tree);
3620 extern int simple_cst_equal (tree, tree);
3621 extern unsigned int iterative_hash_expr (tree, unsigned int);
3622 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
3623 extern int type_list_equal (tree, tree);
3624 extern int chain_member (tree, tree);
3625 extern tree type_hash_lookup (unsigned int, tree);
3626 extern void type_hash_add (unsigned int, tree);
3627 extern int simple_cst_list_equal (tree, tree);
3628 extern void dump_tree_statistics (void);
3629 extern void expand_function_end (void);
3630 extern void expand_function_start (tree);
3631 extern void recompute_tree_invarant_for_addr_expr (tree);
3632 extern bool is_global_var (tree t);
3633 extern bool needs_to_live_in_memory (tree);
3634 extern tree reconstruct_complex_type (tree, tree);
3636 extern int real_onep (tree);
3637 extern int real_twop (tree);
3638 extern int real_minus_onep (tree);
3639 extern void init_ttree (void);
3640 extern void build_common_tree_nodes (bool, bool);
3641 extern void build_common_tree_nodes_2 (int);
3642 extern void build_common_builtin_nodes (void);
3643 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
3644 extern tree build_range_type (tree, tree, tree);
3645 extern HOST_WIDE_INT int_cst_value (tree);
3646 extern tree tree_fold_gcd (tree, tree);
3647 extern tree build_addr (tree);
3649 extern bool fields_compatible_p (tree, tree);
3650 extern tree find_compatible_field (tree, tree);
3653 extern void expand_main_function (void);
3654 extern void init_dummy_function_start (void);
3655 extern void expand_dummy_function_end (void);
3656 extern void init_function_for_compilation (void);
3657 extern void allocate_struct_function (tree);
3658 extern void init_function_start (tree);
3659 extern bool use_register_for_decl (tree);
3660 extern void setjmp_vars_warning (tree);
3661 extern void setjmp_args_warning (void);
3662 extern void init_temp_slots (void);
3663 extern void free_temp_slots (void);
3664 extern void pop_temp_slots (void);
3665 extern void push_temp_slots (void);
3666 extern void preserve_temp_slots (rtx);
3667 extern int aggregate_value_p (tree, tree);
3668 extern void push_function_context (void);
3669 extern void pop_function_context (void);
3670 extern void push_function_context_to (tree);
3671 extern void pop_function_context_from (tree);
3672 extern tree gimplify_parameters (void);
3674 /* In print-rtl.c */
3676 extern void print_rtl (FILE *, rtx);
3679 /* In print-tree.c */
3680 extern void debug_tree (tree);
3682 extern void print_node (FILE *, const char *, tree, int);
3683 extern void print_node_brief (FILE *, const char *, tree, int);
3684 extern void indent_to (FILE *, int);
3687 /* In tree-inline.c: */
3688 extern bool debug_find_tree (tree, tree);
3689 /* This is in tree-inline.c since the routine uses
3690 data structures from the inliner. */
3691 extern tree unsave_expr_now (tree);
3694 extern rtx emit_line_note (location_t);
3698 /* Nonzero if this is a call to a function whose return value depends
3699 solely on its arguments, has no side effects, and does not read
3702 /* Nonzero if this call will never return. */
3703 #define ECF_NORETURN 2
3704 /* Nonzero if this is a call to malloc or a related function. */
3705 #define ECF_MALLOC 4
3706 /* Nonzero if it is plausible that this is a call to alloca. */
3707 #define ECF_MAY_BE_ALLOCA 8
3708 /* Nonzero if this is a call to a function that won't throw an exception. */
3709 #define ECF_NOTHROW 16
3710 /* Nonzero if this is a call to setjmp or a related function. */
3711 #define ECF_RETURNS_TWICE 32
3712 /* Nonzero if this call replaces the current stack frame. */
3713 #define ECF_SIBCALL 64
3714 /* Nonzero if this is a call to "pure" function (like const function,
3715 but may read memory. */
3716 #define ECF_PURE 128
3717 /* Nonzero if this is a call to a function that returns with the stack
3718 pointer depressed. */
3719 #define ECF_SP_DEPRESSED 256
3720 /* Create libcall block around the call. */
3721 #define ECF_LIBCALL_BLOCK 512
3722 /* Function does not read or write memory (but may have side effects, so
3723 it does not necessarily fit ECF_CONST). */
3724 #define ECF_NOVOPS 1024
3726 extern int flags_from_decl_or_type (tree);
3727 extern int call_expr_flags (tree);
3729 extern int setjmp_call_p (tree);
3730 extern bool alloca_call_p (tree);
3731 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
3732 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
3736 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3737 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3738 it should be modified in place; if a TYPE, a copy should be created
3739 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3740 information, in the form of a bitwise OR of flags in enum attribute_flags
3741 from tree.h. Depending on these flags, some attributes may be
3742 returned to be applied at a later stage (for example, to apply
3743 a decl attribute to the declaration rather than to its type). */
3744 extern tree decl_attributes (tree *, tree, int);
3746 /* In integrate.c */
3747 extern void set_decl_abstract_flags (tree, int);
3748 extern void set_decl_origin_self (tree);
3750 /* In stor-layout.c */
3751 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
3752 extern void fixup_signed_type (tree);
3753 extern void internal_reference_types (void);
3754 extern unsigned int update_alignment_for_field (record_layout_info, tree,
3757 extern void make_decl_rtl (tree);
3758 extern void make_decl_one_only (tree);
3759 extern int supports_one_only (void);
3760 extern void variable_section (tree, int);
3761 extern void resolve_unique_section (tree, int, int);
3762 extern void mark_referenced (tree);
3763 extern void mark_decl_referenced (tree);
3764 extern void notice_global_symbol (tree);
3765 extern void set_user_assembler_name (tree, const char *);
3766 extern void process_pending_assemble_externals (void);
3767 extern void finish_aliases_1 (void);
3768 extern void finish_aliases_2 (void);
3771 extern void expand_computed_goto (tree);
3772 extern bool parse_output_constraint (const char **, int, int, int,
3773 bool *, bool *, bool *);
3774 extern bool parse_input_constraint (const char **, int, int, int, int,
3775 const char * const *, bool *, bool *);
3776 extern void expand_asm_expr (tree);
3777 extern tree resolve_asm_operand_names (tree, tree, tree);
3778 extern void expand_case (tree);
3779 extern void expand_decl (tree);
3780 extern void expand_anon_union_decl (tree, tree, tree);
3782 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
3783 extern bool decl_overlaps_hard_reg_set_p (tree, const HARD_REG_SET);
3786 /* In gimplify.c. */
3787 extern tree create_artificial_label (void);
3788 extern void gimplify_function_tree (tree);
3789 extern const char *get_name (tree);
3790 extern tree unshare_expr (tree);
3791 extern void sort_case_labels (tree);
3793 /* If KIND=='I', return a suitable global initializer (constructor) name.
3794 If KIND=='D', return a suitable global clean-up (destructor) name. */
3795 extern tree get_file_function_name (int);
3797 /* Interface of the DWARF2 unwind info support. */
3799 /* Generate a new label for the CFI info to refer to. */
3801 extern char *dwarf2out_cfi_label (void);
3803 /* Entry point to update the canonical frame address (CFA). */
3805 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
3807 /* Add the CFI for saving a register window. */
3809 extern void dwarf2out_window_save (const char *);
3811 /* Add a CFI to update the running total of the size of arguments pushed
3814 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
3816 /* Entry point for saving a register to the stack. */
3818 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
3820 /* Entry point for saving the return address in the stack. */
3822 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
3824 /* Entry point for saving the return address in a register. */
3826 extern void dwarf2out_return_reg (const char *, unsigned);
3828 /* In tree-inline.c */
3830 /* The type of a set of already-visited pointers. Functions for creating
3831 and manipulating it are declared in pointer-set.h */
3832 struct pointer_set_t;
3834 /* The type of a callback function for walking over tree structure. */
3836 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3837 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
3838 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
3840 /* In tree-dump.c */
3842 /* Different tree dump places. When you add new tree dump places,
3843 extend the DUMP_FILES array in tree-dump.c. */
3844 enum tree_dump_index
3846 TDI_none, /* No dump */
3847 TDI_tu, /* dump the whole translation unit. */
3848 TDI_class, /* dump class hierarchy. */
3849 TDI_original, /* dump each function before optimizing it */
3850 TDI_generic, /* dump each function after genericizing it */
3851 TDI_nested, /* dump each function after unnesting it */
3852 TDI_inlined, /* dump each function after inlining
3854 TDI_vcg, /* create a VCG graph file for each
3855 function's flowgraph. */
3856 TDI_tree_all, /* enable all the GENERIC/GIMPLE dumps. */
3857 TDI_rtl_all, /* enable all the RTL dumps. */
3858 TDI_ipa_all, /* enable all the IPA dumps. */
3860 TDI_cgraph, /* dump function call graph. */
3862 DFI_MIN, /* For now, RTL dumps are placed here. */
3863 DFI_sibling = DFI_MIN,
3893 DFI_branch_target_load,
3903 /* Bit masks to control dumping. Not all values are applicable to
3904 all dumps. Add new ones at the end. When you define new
3905 values, extend the DUMP_OPTIONS array in tree-dump.c */
3906 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3907 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3908 #define TDF_RAW (1 << 2) /* don't unparse the function */
3909 #define TDF_DETAILS (1 << 3) /* show more detailed info about
3911 #define TDF_STATS (1 << 4) /* dump various statistics about
3913 #define TDF_BLOCKS (1 << 5) /* display basic block boundaries */
3914 #define TDF_VOPS (1 << 6) /* display virtual operands */
3915 #define TDF_LINENO (1 << 7) /* display statement line numbers */
3916 #define TDF_UID (1 << 8) /* display decl UIDs */
3918 #define TDF_TREE (1 << 9) /* is a tree dump */
3919 #define TDF_RTL (1 << 10) /* is a RTL dump */
3920 #define TDF_IPA (1 << 11) /* is an IPA dump */
3921 #define TDF_STMTADDR (1 << 12) /* Address of stmt. */
3923 typedef struct dump_info *dump_info_p;
3925 extern char *get_dump_file_name (enum tree_dump_index);
3926 extern int dump_flag (dump_info_p, int, tree);
3927 extern int dump_enabled_p (enum tree_dump_index);
3928 extern int dump_initialized_p (enum tree_dump_index);
3929 extern FILE *dump_begin (enum tree_dump_index, int *);
3930 extern void dump_end (enum tree_dump_index, FILE *);
3931 extern void dump_node (tree, int, FILE *);
3932 extern int dump_switch_p (const char *);
3933 extern const char *dump_flag_name (enum tree_dump_index);
3934 /* Assign the RTX to declaration. */
3936 extern void set_decl_rtl (tree, rtx);
3937 extern void set_decl_incoming_rtl (tree, rtx);
3939 /* Enum and arrays used for tree allocation stats.
3940 Keep in sync with tree.c:tree_node_kind_names. */
3963 extern int tree_node_counts[];
3964 extern int tree_node_sizes[];
3966 /* True if we are in gimple form and the actions of the folders need to
3967 be restricted. False if we are not in gimple form and folding is not
3968 restricted to creating gimple expressions. */
3969 extern bool in_gimple_form;
3971 /* In tree-ssa-threadupdate.c. */
3972 extern bool thread_through_all_blocks (void);
3974 /* In tree-gimple.c. */
3975 extern tree get_base_address (tree t);
3977 /* In tree-vectorizer.c. */
3978 extern void vect_set_verbosity_level (const char *);
3980 #endif /* GCC_TREE_H */
OSDN Git Service
