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 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 tcc_type, /* A type object code. */
55 tcc_declaration, /* A declaration (also serving as variable refs). */
56 tcc_reference, /* A reference to storage. */
57 tcc_comparison, /* A comparison expression. */
58 tcc_unary, /* A unary arithmetic expression. */
59 tcc_binary, /* A binary arithmetic expression. */
60 tcc_statement, /* A statement expression, which have side effects
61 but usually no interesting value. */
62 tcc_expression /* Any other expression. */
65 /* Each tree code class has an associated string representation.
66 These must correspond to the tree_code_class entries. */
68 extern const char *const tree_code_class_strings[];
70 /* Returns the string representing CLASS. */
72 #define TREE_CODE_CLASS_STRING(CLASS)\
73 tree_code_class_strings[(int) (CLASS)]
75 #define MAX_TREE_CODES 256
76 extern const enum tree_code_class tree_code_type[];
77 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
79 /* Nonzero if CODE represents an exceptional code. */
81 #define EXCEPTIONAL_CLASS_P(CODE)\
82 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
84 /* Nonzero if CODE represents a constant. */
86 #define CONSTANT_CLASS_P(CODE)\
87 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
89 /* Nonzero if CODE represents a type. */
92 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
94 /* Nonzero if CODE represents a declaration. */
97 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
99 /* Nonzero if CODE represents a INDIRECT_REF. */
100 #define INDIRECT_REF_P(CODE)\
101 (TREE_CODE (CODE) == INDIRECT_REF \
102 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF \
103 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF)
105 /* Nonzero if CODE represents a reference. */
107 #define REFERENCE_CLASS_P(CODE)\
108 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
110 /* Nonzero if CODE represents a comparison. */
112 #define COMPARISON_CLASS_P(CODE)\
113 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
115 /* Nonzero if CODE represents a unary arithmetic expression. */
117 #define UNARY_CLASS_P(CODE)\
118 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
120 /* Nonzero if CODE represents a binary arithmetic expression. */
122 #define BINARY_CLASS_P(CODE)\
123 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
125 /* Nonzero if CODE represents a statement expression. */
127 #define STATEMENT_CLASS_P(CODE)\
128 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
130 /* Nonzero if CODE represents any other expression. */
132 #define EXPRESSION_CLASS_P(CODE)\
133 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
135 /* Returns nonzero iff CLASS is not the tree code of a type. */
137 #define IS_NON_TYPE_CODE_CLASS(CLASS) ((CLASS) != tcc_type)
139 /* Returns nonzero iff CODE represents a type or declaration. */
141 #define IS_TYPE_OR_DECL_P(CODE)\
142 (TYPE_P (CODE) || DECL_P (CODE))
144 /* Returns nonzero iff CLASS is the tree-code class of an
147 #define IS_EXPR_CODE_CLASS(CLASS)\
148 (((CLASS) >= tcc_reference) && ((CLASS) <= tcc_expression))
150 /* Returns nonzero iff NODE is an expression of some kind. */
152 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
154 /* Number of argument-words in each kind of tree-node. */
156 extern const unsigned char tree_code_length[];
157 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
159 /* Names of tree components. */
161 extern const char *const tree_code_name[];
163 /* A garbage collected vector of trees. */
167 /* Classify which part of the compiler has defined a given builtin function.
168 Note that we assume below that this is no more than two bits. */
177 /* Names for the above. */
178 extern const char *const built_in_class_names[4];
180 /* Codes that identify the various built in functions
181 so that expand_call can identify them quickly. */
183 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
184 enum built_in_function
186 #include "builtins.def"
188 /* Upper bound on non-language-specific builtins. */
193 /* Names for the above. */
194 extern const char *const built_in_names[(int) END_BUILTINS];
196 /* Helper macros for math builtins. */
198 #define BUILTIN_EXP10_P(FN) \
199 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
200 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
202 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
203 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
204 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
206 #define BUILTIN_SQRT_P(FN) \
207 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
209 #define BUILTIN_CBRT_P(FN) \
210 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
212 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
214 /* An array of _DECL trees for the above. */
215 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
216 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
218 /* The definition of tree nodes fills the next several pages. */
220 /* A tree node can represent a data type, a variable, an expression
221 or a statement. Each node has a TREE_CODE which says what kind of
222 thing it represents. Some common codes are:
223 INTEGER_TYPE -- represents a type of integers.
224 ARRAY_TYPE -- represents a type of pointer.
225 VAR_DECL -- represents a declared variable.
226 INTEGER_CST -- represents a constant integer value.
227 PLUS_EXPR -- represents a sum (an expression).
229 As for the contents of a tree node: there are some fields
230 that all nodes share. Each TREE_CODE has various special-purpose
231 fields as well. The fields of a node are never accessed directly,
232 always through accessor macros. */
234 /* Every kind of tree node starts with this structure,
235 so all nodes have these fields.
237 See the accessor macros, defined below, for documentation of the
241 struct tree_common GTY(())
245 union tree_ann_d *ann;
247 ENUM_BITFIELD(tree_code) code : 8;
249 unsigned side_effects_flag : 1;
250 unsigned constant_flag : 1;
251 unsigned addressable_flag : 1;
252 unsigned volatile_flag : 1;
253 unsigned readonly_flag : 1;
254 unsigned unsigned_flag : 1;
255 unsigned asm_written_flag: 1;
256 unsigned nowarning_flag : 1;
258 unsigned used_flag : 1;
259 unsigned nothrow_flag : 1;
260 unsigned static_flag : 1;
261 unsigned public_flag : 1;
262 unsigned private_flag : 1;
263 unsigned protected_flag : 1;
264 unsigned deprecated_flag : 1;
265 unsigned invariant_flag : 1;
267 unsigned lang_flag_0 : 1;
268 unsigned lang_flag_1 : 1;
269 unsigned lang_flag_2 : 1;
270 unsigned lang_flag_3 : 1;
271 unsigned lang_flag_4 : 1;
272 unsigned lang_flag_5 : 1;
273 unsigned lang_flag_6 : 1;
274 unsigned visited : 1;
277 /* The following table lists the uses of each of the above flags and
278 for which types of nodes they are defined. Note that expressions
284 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
285 ..._TYPE, IDENTIFIER_NODE.
286 In a STMT_EXPR, it means we want the result of the enclosed
288 CALL_EXPR_TAILCALL in CALL_EXPR
293 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
296 TREE_CONSTANT_OVERFLOW in
297 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
298 TREE_SYMBOL_REFERENCED in
301 TARGET_EXPR, WITH_CLEANUP_EXPR
304 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
305 TYPE_REF_CAN_ALIAS_ALL in
306 POINTER_TYPE, REFERENCE_TYPE
311 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
312 ??? and other expressions?
314 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
317 TYPE_CACHED_VALUES_P in
319 SAVE_EXPR_RESOLVED_P in
326 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
329 PARM_DECL, RESULT_DECL
351 TREE_THIS_VOLATILE in
376 BIT_FIELD_REF_UNSIGNED in
382 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
388 expressions, IDENTIFIER_NODE
393 CALL_EXPR, FUNCTION_DECL
399 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
408 Used in tree traversals to mark visited nodes.
418 ... any expr or decl node
421 /* Define accessors for the fields that all tree nodes have
422 (though some fields are not used for all kinds of nodes). */
424 /* The tree-code says what kind of node it is.
425 Codes are defined in tree.def. */
426 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
427 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
429 /* When checking is enabled, errors will be generated if a tree node
430 is accessed incorrectly. The macros abort with a fatal error. */
431 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
433 #define TREE_CHECK(T, CODE) __extension__ \
434 ({ const tree __t = (T); \
435 if (TREE_CODE (__t) != (CODE)) \
436 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
440 #define TREE_NOT_CHECK(T, CODE) __extension__ \
441 ({ const tree __t = (T); \
442 if (TREE_CODE (__t) == (CODE)) \
443 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
447 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
448 ({ const tree __t = (T); \
449 if (TREE_CODE (__t) != (CODE1) \
450 && TREE_CODE (__t) != (CODE2)) \
451 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
452 (CODE1), (CODE2), 0); \
455 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
456 ({ const tree __t = (T); \
457 if (TREE_CODE (__t) == (CODE1) \
458 || TREE_CODE (__t) == (CODE2)) \
459 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
460 (CODE1), (CODE2), 0); \
463 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
464 ({ const tree __t = (T); \
465 if (TREE_CODE (__t) != (CODE1) \
466 && TREE_CODE (__t) != (CODE2) \
467 && TREE_CODE (__t) != (CODE3)) \
468 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
469 (CODE1), (CODE2), (CODE3), 0); \
472 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
473 ({ const tree __t = (T); \
474 if (TREE_CODE (__t) == (CODE1) \
475 || TREE_CODE (__t) == (CODE2) \
476 || TREE_CODE (__t) == (CODE3)) \
477 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
478 (CODE1), (CODE2), (CODE3), 0); \
481 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
482 ({ const tree __t = (T); \
483 if (TREE_CODE (__t) != (CODE1) \
484 && TREE_CODE (__t) != (CODE2) \
485 && TREE_CODE (__t) != (CODE3) \
486 && TREE_CODE (__t) != (CODE4)) \
487 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
488 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
491 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
492 ({ const tree __t = (T); \
493 if (TREE_CODE (__t) == (CODE1) \
494 || TREE_CODE (__t) == (CODE2) \
495 || TREE_CODE (__t) == (CODE3) \
496 || TREE_CODE (__t) == (CODE4)) \
497 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
498 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
501 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
502 ({ const tree __t = (T); \
503 if (TREE_CODE (__t) != (CODE1) \
504 && TREE_CODE (__t) != (CODE2) \
505 && TREE_CODE (__t) != (CODE3) \
506 && TREE_CODE (__t) != (CODE4) \
507 && TREE_CODE (__t) != (CODE5)) \
508 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
509 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
512 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
513 ({ const tree __t = (T); \
514 if (TREE_CODE (__t) == (CODE1) \
515 || TREE_CODE (__t) == (CODE2) \
516 || TREE_CODE (__t) == (CODE3) \
517 || TREE_CODE (__t) == (CODE4) \
518 || TREE_CODE (__t) == (CODE5)) \
519 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
520 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
523 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
524 ({ const tree __t = (T); \
525 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
526 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
530 /* These checks have to be special cased. */
531 #define EXPR_CHECK(T) __extension__ \
532 ({ const tree __t = (T); \
533 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
534 if (!IS_EXPR_CODE_CLASS (__c)) \
535 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
539 /* These checks have to be special cased. */
540 #define NON_TYPE_CHECK(T) __extension__ \
541 ({ const tree __t = (T); \
542 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
543 if (!IS_NON_TYPE_CODE_CLASS (__c)) \
544 tree_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
548 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
549 (*({const tree __t = (T); \
550 const int __i = (I); \
551 if (TREE_CODE (__t) != TREE_VEC) \
552 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
554 if (__i < 0 || __i >= __t->vec.length) \
555 tree_vec_elt_check_failed (__i, __t->vec.length, \
556 __FILE__, __LINE__, __FUNCTION__); \
557 &__t->vec.a[__i]; }))
559 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
560 (*({const tree __t = t; \
561 const int __i = (i); \
562 if (TREE_CODE (__t) != PHI_NODE) \
563 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
565 if (__i < 0 || __i >= __t->phi.capacity) \
566 phi_node_elt_check_failed (__i, __t->phi.num_args, \
567 __FILE__, __LINE__, __FUNCTION__); \
568 &__t->phi.a[__i]; }))
570 /* Special checks for TREE_OPERANDs. */
571 #define TREE_OPERAND_CHECK(T, I) __extension__ \
572 (*({const tree __t = EXPR_CHECK (T); \
573 const int __i = (I); \
574 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
575 tree_operand_check_failed (__i, TREE_CODE (__t), \
576 __FILE__, __LINE__, __FUNCTION__); \
577 &__t->exp.operands[__i]; }))
579 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
580 (*({const tree __t = (T); \
581 const int __i = (I); \
582 if (TREE_CODE (__t) != CODE) \
583 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
584 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
585 tree_operand_check_failed (__i, (CODE), \
586 __FILE__, __LINE__, __FUNCTION__); \
587 &__t->exp.operands[__i]; }))
589 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
591 ({const tree __t = (T); \
592 const int __i = (I); \
593 if (TREE_CODE (__t) != (CODE)) \
594 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
595 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
596 tree_operand_check_failed (__i, (CODE), \
597 __FILE__, __LINE__, __FUNCTION__); \
598 &__t->exp.operands[__i]; }))
600 extern void tree_check_failed (const tree, const char *, int, const char *,
601 ...) ATTRIBUTE_NORETURN;
602 extern void tree_not_check_failed (const tree, const char *, int, const char *,
603 ...) ATTRIBUTE_NORETURN;
604 extern void tree_class_check_failed (const tree, const enum tree_code_class,
605 const char *, int, const char *)
607 extern void tree_vec_elt_check_failed (int, int, const char *,
610 extern void phi_node_elt_check_failed (int, int, const char *,
613 extern void tree_operand_check_failed (int, enum tree_code,
614 const char *, int, const char *)
617 #else /* not ENABLE_TREE_CHECKING, or not gcc */
619 #define TREE_CHECK(T, CODE) (T)
620 #define TREE_NOT_CHECK(T, CODE) (T)
621 #define TREE_CHECK2(T, CODE1, CODE2) (T)
622 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
623 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
624 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
625 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
626 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
627 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
628 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
629 #define TREE_CLASS_CHECK(T, CODE) (T)
630 #define EXPR_CHECK(T) (T)
631 #define NON_TYPE_CHECK(T) (T)
632 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
633 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
634 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
635 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
636 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
640 #define TREE_BLOCK(NODE) ((NODE)->exp.block)
642 #include "tree-check.h"
644 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
645 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, tcc_declaration)
646 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
647 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
648 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
649 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
651 #define RECORD_OR_UNION_CHECK(T) \
652 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
653 #define NOT_RECORD_OR_UNION_CHECK(T) \
654 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
656 #define NUMERICAL_TYPE_CHECK(T) \
657 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \
658 CHAR_TYPE, REAL_TYPE)
660 /* In all nodes that are expressions, this is the data type of the expression.
661 In POINTER_TYPE nodes, this is the type that the pointer points to.
662 In ARRAY_TYPE nodes, this is the type of the elements.
663 In VECTOR_TYPE nodes, this is the type of the elements. */
664 #define TREE_TYPE(NODE) ((NODE)->common.type)
666 /* Here is how primitive or already-canonicalized types' hash codes
668 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
670 /* A simple hash function for an arbitrary tree node. This must not be
671 used in hash tables which are saved to a PCH. */
672 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
674 /* Nodes are chained together for many purposes.
675 Types are chained together to record them for being output to the debugger
676 (see the function `chain_type').
677 Decls in the same scope are chained together to record the contents
679 Statement nodes for successive statements used to be chained together.
680 Often lists of things are represented by TREE_LIST nodes that
681 are chained together. */
683 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
685 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
686 that don't change the machine mode. */
688 #define STRIP_NOPS(EXP) \
689 while ((TREE_CODE (EXP) == NOP_EXPR \
690 || TREE_CODE (EXP) == CONVERT_EXPR \
691 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
692 && TREE_OPERAND (EXP, 0) != error_mark_node \
693 && (TYPE_MODE (TREE_TYPE (EXP)) \
694 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
695 (EXP) = TREE_OPERAND (EXP, 0)
697 /* Like STRIP_NOPS, but don't let the signedness change either. */
699 #define STRIP_SIGN_NOPS(EXP) \
700 while ((TREE_CODE (EXP) == NOP_EXPR \
701 || TREE_CODE (EXP) == CONVERT_EXPR \
702 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
703 && TREE_OPERAND (EXP, 0) != error_mark_node \
704 && (TYPE_MODE (TREE_TYPE (EXP)) \
705 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
706 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
707 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
708 (EXP) = TREE_OPERAND (EXP, 0)
710 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
712 #define STRIP_MAIN_TYPE_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_MAIN_VARIANT (TREE_TYPE (EXP)) \
718 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
719 (EXP) = TREE_OPERAND (EXP, 0)
721 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
723 #define STRIP_TYPE_NOPS(EXP) \
724 while ((TREE_CODE (EXP) == NOP_EXPR \
725 || TREE_CODE (EXP) == CONVERT_EXPR \
726 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
727 && TREE_OPERAND (EXP, 0) != error_mark_node \
728 && (TREE_TYPE (EXP) \
729 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
730 (EXP) = TREE_OPERAND (EXP, 0)
732 /* Remove unnecessary type conversions according to
733 tree_ssa_useless_type_conversion. */
735 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
736 while (tree_ssa_useless_type_conversion (EXP)) \
737 EXP = TREE_OPERAND (EXP, 0)
739 /* Nonzero if TYPE represents an integral type. Note that we do not
740 include COMPLEX types here. */
742 #define INTEGRAL_TYPE_P(TYPE) \
743 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
744 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
746 /* Nonzero if TYPE represents a scalar floating-point type. */
748 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
750 /* Nonzero if TYPE represents a complex floating-point type. */
752 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
753 (TREE_CODE (TYPE) == COMPLEX_TYPE \
754 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
756 /* Nonzero if TYPE represents a vector floating-point type. */
758 #define VECTOR_FLOAT_TYPE_P(TYPE) \
759 (TREE_CODE (TYPE) == VECTOR_TYPE \
760 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
762 /* Nonzero if TYPE represents a floating-point type, including complex
763 and vector floating-point types. */
765 #define FLOAT_TYPE_P(TYPE) \
766 (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE) \
767 || VECTOR_FLOAT_TYPE_P (TYPE))
769 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
771 #define AGGREGATE_TYPE_P(TYPE) \
772 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
773 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
775 /* Nonzero if TYPE represents a pointer or reference type.
776 (It should be renamed to INDIRECT_TYPE_P.) */
778 #define POINTER_TYPE_P(TYPE) \
779 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
781 /* Nonzero if this type is a complete type. */
782 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
784 /* Nonzero if this type is the (possibly qualified) void type. */
785 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
787 /* Nonzero if this type is complete or is cv void. */
788 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
789 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
791 /* Nonzero if this type is complete or is an array with unspecified bound. */
792 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
793 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
796 /* Define many boolean fields that all tree nodes have. */
798 /* In VAR_DECL nodes, nonzero means address of this is needed.
799 So it cannot be in a register.
800 In a FUNCTION_DECL, nonzero means its address is needed.
801 So it must be compiled even if it is an inline function.
802 In a FIELD_DECL node, it means that the programmer is permitted to
803 construct the address of this field. This is used for aliasing
804 purposes: see record_component_aliases.
805 In CONSTRUCTOR nodes, it means object constructed must be in memory.
806 In LABEL_DECL nodes, it means a goto for this label has been seen
807 from a place outside all binding contours that restore stack levels.
808 In ..._TYPE nodes, it means that objects of this type must
809 be fully addressable. This means that pieces of this
810 object cannot go into register parameters, for example.
811 In IDENTIFIER_NODEs, this means that some extern decl for this name
812 had its address taken. That matters for inline functions. */
813 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
815 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
817 /* In a VAR_DECL, nonzero means allocate static storage.
818 In a FUNCTION_DECL, nonzero if function has been defined.
819 In a CONSTRUCTOR, nonzero means allocate static storage.
821 ??? This is also used in lots of other nodes in unclear ways which
822 should be cleaned up some day. */
823 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
825 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
826 should only be executed if an exception is thrown, not on normal exit
828 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
830 /* In an expr node (usually a conversion) this means the node was made
831 implicitly and should not lead to any sort of warning. In a decl node,
832 warnings concerning the decl should be suppressed. This is used at
833 least for used-before-set warnings, and it set after one warning is
835 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
837 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
838 there was an overflow in folding. This is distinct from
839 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
840 occur in constant expressions. */
841 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
843 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
844 this string as an argument. */
845 #define TREE_SYMBOL_REFERENCED(NODE) \
846 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
848 /* Nonzero in a pointer or reference type means the data pointed to
849 by this type can alias anything. */
850 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
851 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
853 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
854 there was an overflow in folding, and no warning has been issued
855 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
858 ??? Apparently, lots of code assumes this is defined in all
860 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
862 /* In a VAR_DECL or FUNCTION_DECL,
863 nonzero means name is to be accessible from outside this module.
864 In an IDENTIFIER_NODE, nonzero means an external declaration
865 accessible from outside this module was previously seen
866 for this name in an inner scope. */
867 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
869 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
870 of cached values, or is something else. */
871 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->common.public_flag)
873 /* In a SAVE_EXPR, indicates that the original expression has already
874 been substituted with a VAR_DECL that contains the value. */
875 #define SAVE_EXPR_RESOLVED_P(NODE) \
876 (TREE_CHECK (NODE, SAVE_EXPR)->common.public_flag)
878 /* In any expression, decl, or constant, nonzero means it has side effects or
879 reevaluation of the whole expression could produce a different value.
880 This is set if any subexpression is a function call, a side effect or a
881 reference to a volatile variable. In a ..._DECL, this is set only if the
882 declaration said `volatile'. This will never be set for a constant. */
883 #define TREE_SIDE_EFFECTS(NODE) \
884 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
886 /* In a LABEL_DECL, nonzero means this label had its address taken
887 and therefore can never be deleted and is a jump target for
889 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
891 /* Nonzero means this expression is volatile in the C sense:
892 its address should be of type `volatile WHATEVER *'.
893 In other words, the declared item is volatile qualified.
894 This is used in _DECL nodes and _REF nodes.
896 In a ..._TYPE node, means this type is volatile-qualified.
897 But use TYPE_VOLATILE instead of this macro when the node is a type,
898 because eventually we may make that a different bit.
900 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
901 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
903 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
904 accessing the memory pointed to won't generate a trap. However,
905 this only applies to an object when used appropriately: it doesn't
906 mean that writing a READONLY mem won't trap. Similarly for
907 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
909 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
910 (or slice of the array) always belongs to the range of the array.
911 I.e. that the access will not trap, provided that the access to
912 the base to the array will not trap. */
913 #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag)
915 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
916 nonzero means it may not be the lhs of an assignment. */
917 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
919 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
920 #define TREE_READONLY_DECL_P(NODE)\
921 (DECL_P (NODE) && TREE_READONLY (NODE))
923 /* Value of expression is constant. Always on in all ..._CST nodes. May
924 also appear in an expression or decl where the value is constant. */
925 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
927 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
928 #define DECL_UNSIGNED(NODE) (DECL_CHECK (NODE)->common.unsigned_flag)
930 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
931 #define BIT_FIELD_REF_UNSIGNED(NODE) \
932 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
934 /* In integral and pointer types, means an unsigned type. */
935 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
937 #define TYPE_TRAP_SIGNED(NODE) \
938 (flag_trapv && ! TYPE_UNSIGNED (NODE))
940 /* Nonzero in a VAR_DECL means assembler code has been written.
941 Nonzero in a FUNCTION_DECL means that the function has been compiled.
942 This is interesting in an inline function, since it might not need
943 to be compiled separately.
944 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
945 if the sdb debugging info for the type has been written.
946 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
947 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
949 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
951 /* Nonzero in a _DECL if the name is used in its scope.
952 Nonzero in an expr node means inhibit warning if value is unused.
953 In IDENTIFIER_NODEs, this means that some extern decl for this name
955 #define TREE_USED(NODE) ((NODE)->common.used_flag)
957 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
958 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
959 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
961 /* In a CALL_EXPR, means that the address of the return slot is part of the
963 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
965 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
966 reference (and the TREE_TYPE is a pointer to the true type). */
967 #define DECL_BY_REFERENCE(NODE) (DECL_CHECK (NODE)->common.private_flag)
969 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
970 thunked-to function. */
971 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag)
973 /* In a type, nonzero means that all objects of the type are guaranteed by the
974 language or front-end to be properly aligned, so we can indicate that a MEM
975 of this type is aligned at least to the alignment of the type, even if it
976 doesn't appear that it is. We see this, for example, in object-oriented
977 languages where a tag field may show this is an object of a more-aligned
978 variant of the more generic type.
980 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
982 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
984 /* Used in classes in C++. */
985 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
986 /* Used in classes in C++.
987 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
988 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
990 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
991 deprecated feature by __attribute__((deprecated)). */
992 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
994 /* Value of expression is function invariant. A strict subset of
995 TREE_CONSTANT, such an expression is constant over any one function
996 invocation, though not across different invocations. May appear in
997 any expression node. */
998 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
1000 /* These flags are available for each language front end to use internally. */
1001 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
1002 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
1003 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
1004 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
1005 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
1006 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
1007 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
1009 /* Define additional fields and accessors for nodes representing constants. */
1011 /* In an INTEGER_CST node. These two together make a 2-word integer.
1012 If the data type is signed, the value is sign-extended to 2 words
1013 even though not all of them may really be in use.
1014 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1015 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1016 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1017 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1019 #define INT_CST_LT(A, B) \
1020 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1021 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1022 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1024 #define INT_CST_LT_UNSIGNED(A, B) \
1025 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1026 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1027 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1028 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1029 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1031 struct tree_int_cst GTY(())
1033 struct tree_common common;
1034 /* A sub-struct is necessary here because the function `const_hash'
1035 wants to scan both words as a unit and taking the address of the
1036 sub-struct yields the properly inclusive bounded pointer. */
1037 struct tree_int_cst_lowhi {
1038 unsigned HOST_WIDE_INT low;
1043 /* In a REAL_CST node. struct real_value is an opaque entity, with
1044 manipulators defined in real.h. We don't want tree.h depending on
1045 real.h and transitively on tm.h. */
1048 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1049 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1051 struct tree_real_cst GTY(())
1053 struct tree_common common;
1054 struct real_value * real_cst_ptr;
1057 /* In a STRING_CST */
1058 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1059 #define TREE_STRING_POINTER(NODE) \
1060 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1062 struct tree_string GTY(())
1064 struct tree_common common;
1069 /* In a COMPLEX_CST node. */
1070 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1071 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1073 struct tree_complex GTY(())
1075 struct tree_common common;
1080 /* In a VECTOR_CST node. */
1081 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1083 struct tree_vector GTY(())
1085 struct tree_common common;
1091 /* Define fields and accessors for some special-purpose tree nodes. */
1093 #define IDENTIFIER_LENGTH(NODE) \
1094 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1095 #define IDENTIFIER_POINTER(NODE) \
1096 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1097 #define IDENTIFIER_HASH_VALUE(NODE) \
1098 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1100 /* Translate a hash table identifier pointer to a tree_identifier
1101 pointer, and vice versa. */
1103 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1104 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1105 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1107 struct tree_identifier GTY(())
1109 struct tree_common common;
1110 struct ht_identifier id;
1113 /* In a TREE_LIST node. */
1114 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1115 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1117 struct tree_list GTY(())
1119 struct tree_common common;
1124 /* In a TREE_VEC node. */
1125 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1126 #define TREE_VEC_END(NODE) \
1127 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1129 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1131 struct tree_vec GTY(())
1133 struct tree_common common;
1135 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1138 /* Define fields and accessors for some nodes that represent expressions. */
1140 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1141 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1142 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1143 && integer_zerop (TREE_OPERAND (NODE, 0)))
1145 /* In a CONSTRUCTOR node. */
1146 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
1148 /* In ordinary expression nodes. */
1149 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1150 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1152 /* In INDIRECT_REF, ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF. */
1153 #define REF_ORIGINAL(NODE) TREE_CHAIN (TREE_CHECK3 (NODE, \
1154 INDIRECT_REF, ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF))
1156 /* In a LOOP_EXPR node. */
1157 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1159 #ifdef USE_MAPPED_LOCATION
1160 /* The source location of this expression. Non-tree_exp nodes such as
1161 decls and constants can be shared among multiple locations, so
1163 #define EXPR_LOCATION(NODE) \
1164 (EXPR_P (NODE) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1165 #define SET_EXPR_LOCATION(NODE, FROM) \
1166 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1167 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1168 /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */
1169 #define EXPR_LOCUS(NODE) \
1170 (EXPR_P (NODE) ? &(NODE)->exp.locus : (location_t *)NULL)
1171 #define SET_EXPR_LOCUS(NODE, FROM) \
1172 do { source_location *loc_tmp = FROM; \
1173 EXPR_CHECK (NODE)->exp.locus \
1174 = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0)
1175 #define EXPR_FILENAME(NODE) \
1176 LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus)
1177 #define EXPR_LINENO(NODE) \
1178 LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1180 /* The source location of this expression. Non-tree_exp nodes such as
1181 decls and constants can be shared among multiple locations, so
1183 #define EXPR_LOCUS(NODE) \
1184 (EXPR_P (NODE) ? (NODE)->exp.locus : (location_t *)NULL)
1185 #define SET_EXPR_LOCUS(NODE, FROM) \
1186 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1187 #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM)
1188 #define EXPR_FILENAME(NODE) \
1189 (EXPR_CHECK (NODE)->exp.locus->file)
1190 #define EXPR_LINENO(NODE) \
1191 (EXPR_CHECK (NODE)->exp.locus->line)
1192 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1193 #define EXPR_LOCATION(NODE) \
1194 (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION)
1197 /* In a TARGET_EXPR node. */
1198 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1199 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1200 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1202 /* DECL_EXPR accessor. This gives access to the DECL associated with
1203 the given declaration statement. */
1204 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1206 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1208 /* SWITCH_EXPR accessors. These give access to the condition, body and
1209 original condition type (before any compiler conversions)
1210 of the switch statement, respectively. */
1211 #define SWITCH_COND(NODE) TREE_OPERAND ((NODE), 0)
1212 #define SWITCH_BODY(NODE) TREE_OPERAND ((NODE), 1)
1213 #define SWITCH_LABELS(NODE) TREE_OPERAND ((NODE), 2)
1215 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1216 of a case label, respectively. */
1217 #define CASE_LOW(NODE) TREE_OPERAND ((NODE), 0)
1218 #define CASE_HIGH(NODE) TREE_OPERAND ((NODE), 1)
1219 #define CASE_LABEL(NODE) TREE_OPERAND ((NODE), 2)
1221 /* The operands of a BIND_EXPR. */
1222 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1223 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1224 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1226 /* GOTO_EXPR accessor. This gives access to the label associated with
1227 a goto statement. */
1228 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1230 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1231 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1232 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1234 #define ASM_STRING(NODE) TREE_OPERAND ((NODE), 0)
1235 #define ASM_OUTPUTS(NODE) TREE_OPERAND ((NODE), 1)
1236 #define ASM_INPUTS(NODE) TREE_OPERAND ((NODE), 2)
1237 #define ASM_CLOBBERS(NODE) TREE_OPERAND ((NODE), 3)
1238 /* Nonzero if we want to create an ASM_INPUT instead of an
1239 ASM_OPERAND with no operands. */
1240 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1241 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1243 /* COND_EXPR accessors. */
1244 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1245 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1246 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1248 /* LABEL_EXPR accessor. This gives access to the label associated with
1249 the given label expression. */
1250 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1252 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1253 accessors for SSA operands. */
1255 /* CATCH_EXPR accessors. */
1256 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1257 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1259 /* EH_FILTER_EXPR accessors. */
1260 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1261 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1262 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1264 /* OBJ_TYPE_REF accessors. */
1265 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1266 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1267 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1269 struct tree_exp GTY(())
1271 struct tree_common common;
1275 tree GTY ((special ("tree_exp"),
1276 desc ("TREE_CODE ((tree) &%0)")))
1280 /* SSA_NAME accessors. */
1282 /* Returns the variable being referenced. Once released, this is the
1283 only field that can be relied upon. */
1284 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1286 /* Returns the statement which defines this reference. Note that
1287 we use the same field when chaining SSA_NAME nodes together on
1288 the SSA_NAME freelist. */
1289 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1291 /* Returns the SSA version number of this SSA name. Note that in
1292 tree SSA, version numbers are not per variable and may be recycled. */
1293 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1295 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1296 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1298 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1299 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1301 /* Nonzero if this SSA_NAME expression is currently on the free list of
1302 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1303 has no meaning for an SSA_NAME. */
1304 #define SSA_NAME_IN_FREE_LIST(NODE) \
1305 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1307 /* Attributes for SSA_NAMEs for pointer-type variables. */
1308 #define SSA_NAME_PTR_INFO(N) \
1309 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1311 /* Get the value of this SSA_NAME, if available. */
1312 #define SSA_NAME_VALUE(N) \
1313 SSA_NAME_CHECK (N)->ssa_name.value_handle
1315 /* Auxiliary pass-specific data. */
1316 #define SSA_NAME_AUX(N) \
1317 SSA_NAME_CHECK (N)->ssa_name.aux
1319 #ifndef _TREE_FLOW_H
1320 struct ptr_info_def;
1323 struct tree_ssa_name GTY(())
1325 struct tree_common common;
1327 /* _DECL wrapped by this SSA name. */
1330 /* SSA version number. */
1331 unsigned int version;
1333 /* Pointer attributes used for alias analysis. */
1334 struct ptr_info_def *ptr_info;
1336 /* Value for SSA name used by various passes.
1338 Right now only invariants are allowed to persist beyond a pass in
1339 this field; in the future we will allow VALUE_HANDLEs to persist
1343 /* Auxiliary information stored with the ssa name. */
1344 PTR GTY((skip)) aux;
1347 /* In a PHI_NODE node. */
1348 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1349 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1351 /* PHI_NODEs for each basic block are chained together in a single linked
1352 list. The head of the list is linked from the block annotation, and
1353 the link to the next PHI is in PHI_CHAIN. */
1354 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1356 /* Nonzero if the PHI node was rewritten by a previous pass through the
1358 #define PHI_REWRITTEN(NODE) PHI_NODE_CHECK (NODE)->phi.rewritten
1359 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1360 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1361 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1362 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1363 #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero
1364 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1365 #define PHI_DF(NODE) PHI_NODE_CHECK (NODE)->phi.df
1369 struct phi_arg_d GTY(())
1375 struct tree_phi_node GTY(())
1377 struct tree_common common;
1382 /* Nonzero if the PHI node was rewritten by a previous pass through the
1386 /* Basic block to that the phi node belongs. */
1387 struct basic_block_def *bb;
1389 /* Dataflow information. */
1390 struct dataflow_d *df;
1392 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1396 struct varray_head_tag;
1398 /* In a BLOCK node. */
1399 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1400 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1401 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1402 /* Note: when changing this, make sure to find the places
1403 that use chainon or nreverse. */
1404 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1405 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1406 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1408 /* Nonzero means that this block is prepared to handle exceptions
1409 listed in the BLOCK_VARS slot. */
1410 #define BLOCK_HANDLER_BLOCK(NODE) \
1411 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1413 /* An index number for this block. These values are not guaranteed to
1414 be unique across functions -- whether or not they are depends on
1415 the debugging output format in use. */
1416 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1418 /* If block reordering splits a lexical block into discontiguous
1419 address ranges, we'll make a copy of the original block.
1421 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1422 In that case, we have one source block that has been replicated
1423 (through inlining or unrolling) into many logical blocks, and that
1424 these logical blocks have different physical variables in them.
1426 In this case, we have one logical block split into several
1427 non-contiguous address ranges. Most debug formats can't actually
1428 represent this idea directly, so we fake it by creating multiple
1429 logical blocks with the same variables in them. However, for those
1430 that do support non-contiguous regions, these allow the original
1431 logical block to be reconstructed, along with the set of address
1434 One of the logical block fragments is arbitrarily chosen to be
1435 the ORIGIN. The other fragments will point to the origin via
1436 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1437 be null. The list of fragments will be chained through
1438 BLOCK_FRAGMENT_CHAIN from the origin. */
1440 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1441 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1443 struct tree_block GTY(())
1445 struct tree_common common;
1447 unsigned handler_block_flag : 1;
1448 unsigned abstract_flag : 1;
1449 unsigned block_num : 30;
1454 tree abstract_origin;
1455 tree fragment_origin;
1456 tree fragment_chain;
1459 /* Define fields and accessors for nodes representing data types. */
1461 /* See tree.def for documentation of the use of these fields.
1462 Look at the documentation of the various ..._TYPE tree codes.
1464 Note that the type.values, type.minval, and type.maxval fields are
1465 overloaded and used for different macros in different kinds of types.
1466 Each macro must check to ensure the tree node is of the proper kind of
1467 type. Note also that some of the front-ends also overload these fields,
1468 so they must be checked as well. */
1470 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1471 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1472 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1473 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1474 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1475 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
1476 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
1477 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
1478 #define TYPE_ORIG_SIZE_TYPE(NODE) \
1479 (INTEGER_TYPE_CHECK (NODE)->type.values \
1480 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
1481 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
1482 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
1483 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1484 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1485 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1486 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1487 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1488 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1489 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1490 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1491 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1492 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1493 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1494 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1495 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1496 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1497 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1498 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1499 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1500 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1502 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1503 in the debugging output. We use this to describe a vector as a
1504 structure containing an array. */
1505 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1507 /* For record and union types, information about this type, as a base type
1509 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1511 /* For non record and union types, used in a language-dependent way. */
1512 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1514 /* The (language-specific) typed-based alias set for this type.
1515 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1516 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1517 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1518 type can alias objects of any type. */
1519 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1521 /* Nonzero iff the typed-based alias set for this type has been
1523 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1525 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1527 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1529 /* The alignment necessary for objects of this type.
1530 The value is an int, measured in bits. */
1531 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1533 /* 1 if the alignment for this type was requested by "aligned" attribute,
1534 0 if it is the default for this type. */
1535 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1537 /* The alignment for NODE, in bytes. */
1538 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1540 /* If your language allows you to declare types, and you want debug info
1541 for them, then you need to generate corresponding TYPE_DECL nodes.
1542 These "stub" TYPE_DECL nodes have no name, and simply point at the
1543 type node. You then set the TYPE_STUB_DECL field of the type node
1544 to point back at the TYPE_DECL node. This allows the debug routines
1545 to know that the two nodes represent the same type, so that we only
1546 get one debug info record for them. */
1547 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1549 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1550 has BLKmode only because it lacks the alignment requirement for
1552 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1554 /* In an INTEGER_TYPE, it means the type represents a size. We use
1555 this both for validity checking and to permit optimizations that
1556 are unsafe for other types. Note that the C `size_t' type should
1557 *not* have this flag set. The `size_t' type is simply a typedef
1558 for an ordinary integer type that happens to be the type of an
1559 expression returned by `sizeof'; `size_t' has no special
1560 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1561 always actual sizes. */
1562 #define TYPE_IS_SIZETYPE(NODE) \
1563 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1565 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1566 pointer depressed. */
1567 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1568 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1570 /* Nonzero in a type considered volatile as a whole. */
1571 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1573 /* Means this type is const-qualified. */
1574 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1576 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1578 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1580 /* There is a TYPE_QUAL value for each type qualifier. They can be
1581 combined by bitwise-or to form the complete set of qualifiers for a
1584 #define TYPE_UNQUALIFIED 0x0
1585 #define TYPE_QUAL_CONST 0x1
1586 #define TYPE_QUAL_VOLATILE 0x2
1587 #define TYPE_QUAL_RESTRICT 0x4
1589 /* The set of type qualifiers for this type. */
1590 #define TYPE_QUALS(NODE) \
1591 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1592 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1593 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1595 /* These flags are available for each language front end to use internally. */
1596 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1597 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1598 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1599 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1600 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1601 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1602 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1604 /* Used to keep track of visited nodes in tree traversals. This is set to
1605 0 by copy_node and make_node. */
1606 #define TREE_VISITED(NODE) ((NODE)->common.visited)
1608 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1609 that distinguish string from array of char).
1610 If set in a SET_TYPE, indicates a bitstring type. */
1611 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1613 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1614 object of the given ARRAY_TYPE. This allows temporaries to be
1616 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1617 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
1619 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1620 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1621 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
1623 /* Indicates that objects of this type must be initialized by calling a
1624 function when they are created. */
1625 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1626 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1628 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1629 the same way that the first union alternative would be passed. */
1630 #define TYPE_TRANSPARENT_UNION(NODE) \
1631 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1633 /* For an ARRAY_TYPE, indicates that it is not permitted to
1634 take the address of a component of the type. */
1635 #define TYPE_NONALIASED_COMPONENT(NODE) \
1636 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1638 /* Indicated that objects of this type should be laid out in as
1639 compact a way as possible. */
1640 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1642 /* Used by type_contains_placeholder_p to avoid recomputation.
1643 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1644 this field directly. */
1645 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1646 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
1650 struct tree_type GTY(())
1652 struct tree_common common;
1659 unsigned int precision : 9;
1660 ENUM_BITFIELD(machine_mode) mode : 7;
1662 unsigned string_flag : 1;
1663 unsigned no_force_blk_flag : 1;
1664 unsigned needs_constructing_flag : 1;
1665 unsigned transparent_union_flag : 1;
1666 unsigned packed_flag : 1;
1667 unsigned restrict_flag : 1;
1668 unsigned contains_placeholder_bits : 2;
1670 unsigned lang_flag_0 : 1;
1671 unsigned lang_flag_1 : 1;
1672 unsigned lang_flag_2 : 1;
1673 unsigned lang_flag_3 : 1;
1674 unsigned lang_flag_4 : 1;
1675 unsigned lang_flag_5 : 1;
1676 unsigned lang_flag_6 : 1;
1677 unsigned user_align : 1;
1682 union tree_type_symtab {
1683 int GTY ((tag ("0"))) address;
1684 char * GTY ((tag ("1"))) pointer;
1685 struct die_struct * GTY ((tag ("2"))) die;
1686 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1687 descbits ("2"))) symtab;
1695 HOST_WIDE_INT alias_set;
1696 /* Points to a structure whose details depend on the language in use. */
1697 struct lang_type *lang_specific;
1700 /* Define accessor macros for information about type inheritance
1703 A "basetype" means a particular usage of a data type for inheritance
1704 in another type. Each such basetype usage has its own "binfo"
1705 object to describe it. The binfo object is a TREE_VEC node.
1707 Inheritance is represented by the binfo nodes allocated for a
1708 given type. For example, given types C and D, such that D is
1709 inherited by C, 3 binfo nodes will be allocated: one for describing
1710 the binfo properties of C, similarly one for D, and one for
1711 describing the binfo properties of D as a base type for C.
1712 Thus, given a pointer to class C, one can get a pointer to the binfo
1713 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1715 /* BINFO specific flags. */
1717 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1718 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag)
1720 /* Flags for language dependent use. */
1721 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
1722 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
1723 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
1724 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
1725 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
1726 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
1727 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
1729 /* The actual data type node being inherited in this basetype. */
1730 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
1732 /* The offset where this basetype appears in its containing type.
1733 BINFO_OFFSET slot holds the offset (in bytes)
1734 from the base of the complete object to the base of the part of the
1735 object that is allocated on behalf of this `type'.
1736 This is always 0 except when there is multiple inheritance. */
1738 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
1739 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1741 /* The virtual function table belonging to this basetype. Virtual
1742 function tables provide a mechanism for run-time method dispatching.
1743 The entries of a virtual function table are language-dependent. */
1745 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
1747 /* The virtual functions in the virtual function table. This is
1748 a TREE_LIST that is used as an initial approximation for building
1749 a virtual function table for this basetype. */
1750 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
1752 /* A vector of binfos for the direct basetypes inherited by this
1755 If this basetype describes type D as inherited in C, and if the
1756 basetypes of D are E and F, then this vector contains binfos for
1757 inheritance of E and F by C. */
1758 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
1760 /* The number of basetypes for NODE. */
1761 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
1763 /* Accessor macro to get to the Nth base binfo of this binfo. */
1764 #define BINFO_BASE_BINFO(NODE,N) \
1765 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
1766 #define BINFO_BASE_ITERATE(NODE,N,B) \
1767 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
1768 #define BINFO_BASE_APPEND(NODE,T) \
1769 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
1771 /* For a BINFO record describing a virtual base class, i.e., one where
1772 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1773 base. The actual contents are language-dependent. In the C++
1774 front-end this field is an INTEGER_CST giving an offset into the
1775 vtable where the offset to the virtual base can be found. */
1776 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
1778 /* Indicates the accesses this binfo has to its bases. The values are
1779 access_public_node, access_protected_node or access_private_node.
1780 If this array is not present, public access is implied. */
1781 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
1783 #define BINFO_BASE_ACCESS(NODE,N) \
1784 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
1785 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1786 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
1788 /* The index in the VTT where this subobject's sub-VTT can be found.
1789 NULL_TREE if there is no sub-VTT. */
1790 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
1792 /* The index in the VTT where the vptr for this subobject can be
1793 found. NULL_TREE if there is no secondary vptr in the VTT. */
1794 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
1796 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1797 inheriting this base for non-virtual bases. For virtual bases it
1798 points either to the binfo for which this is a primary binfo, or to
1799 the binfo of the most derived type. */
1800 #define BINFO_INHERITANCE_CHAIN(NODE) \
1801 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
1803 struct tree_binfo GTY (())
1805 struct tree_common common;
1811 VEC(tree) *base_accesses;
1817 VEC(tree) base_binfos;
1821 /* Define fields and accessors for nodes representing declared names. */
1823 /* Nonzero if DECL represents a variable for the SSA passes. */
1824 #define SSA_VAR_P(DECL) \
1825 (TREE_CODE (DECL) == VAR_DECL \
1826 || TREE_CODE (DECL) == PARM_DECL \
1827 || TREE_CODE (DECL) == RESULT_DECL \
1828 || (TREE_CODE (DECL) == SSA_NAME \
1829 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
1830 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
1831 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
1833 /* This is the name of the object as written by the user.
1834 It is an IDENTIFIER_NODE. */
1835 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1837 /* The name of the object as the assembler will see it (but before any
1838 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1839 as DECL_NAME. It is an IDENTIFIER_NODE. */
1840 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1842 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1843 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1845 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1846 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1848 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1849 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1850 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1852 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1853 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1854 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1855 semantics of using this macro, are different than saying:
1857 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1859 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1861 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1862 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1863 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1864 DECL_ASSEMBLER_NAME (DECL1)) \
1867 /* Records the section name in a section attribute. Used to pass
1868 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1869 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1871 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1872 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1873 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1874 points to either the FUNCTION_DECL for the containing function,
1875 the RECORD_TYPE or UNION_TYPE for the containing type, or
1876 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1878 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1879 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1880 /* In a DECL this is the field where attributes are stored. */
1881 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1882 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1883 byte containing the bit closest to the beginning of the structure. */
1884 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1885 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1886 field from DECL_FIELD_OFFSET. */
1887 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1888 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1889 if so, the type that was originally specified for it.
1890 TREE_TYPE may have been modified (in finish_struct). */
1891 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1892 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1893 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1895 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1896 /* This field is used to reference anything in decl.result and is meant only
1897 for use by the garbage collector. */
1898 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1899 /* In FUNCTION_DECL, holds the decl for the return value. */
1900 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1901 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1902 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1903 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1904 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1905 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1906 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1907 For a VAR_DECL, holds the initial value.
1908 For a PARM_DECL, not used--default
1909 values for parameters are encoded in the type of the function,
1910 not in the PARM_DECL slot.
1912 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1913 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1914 /* For a PARM_DECL, records the data type used to pass the argument,
1915 which may be different from the type seen in the program. */
1916 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1917 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1918 if nonzero, indicates that the field occupies the type. */
1919 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1920 /* These two fields describe where in the source code the declaration
1921 was. If the declaration appears in several places (as for a C
1922 function that is declared first and then defined later), this
1923 information should refer to the definition. */
1924 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1925 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1926 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1927 #ifdef USE_MAPPED_LOCATION
1928 #define DECL_IS_BUILTIN(DECL) \
1929 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
1931 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
1933 /* Holds the size of the datum, in bits, as a tree expression.
1934 Need not be constant. */
1935 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1936 /* Likewise for the size in bytes. */
1937 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1938 /* Holds the alignment required for the datum, in bits. */
1939 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1940 /* The alignment of NODE, in bytes. */
1941 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1942 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1943 DECL_FIELD_OFFSET which are known to be always zero.
1944 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1946 #define DECL_OFFSET_ALIGN(NODE) \
1947 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1948 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1949 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1950 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1951 /* 1 if the alignment for this type was requested by "aligned" attribute,
1952 0 if it is the default for this type. */
1953 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1954 /* Holds the machine mode corresponding to the declaration of a variable or
1955 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1957 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1958 /* Holds the RTL expression for the value of a variable or function.
1959 This value can be evaluated lazily for functions, variables with
1960 static storage duration, and labels. */
1961 #define DECL_RTL(NODE) \
1962 (DECL_CHECK (NODE)->decl.rtl \
1963 ? (NODE)->decl.rtl \
1964 : (make_decl_rtl (NODE), (NODE)->decl.rtl))
1965 /* Set the DECL_RTL for NODE to RTL. */
1966 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1967 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1968 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1969 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1970 NODE1, it will not be set for NODE2; this is a lazy copy. */
1971 #define COPY_DECL_RTL(NODE1, NODE2) \
1972 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1973 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1974 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1976 /* For PARM_DECL, holds an RTL for the stack slot or register
1977 where the data was actually passed. */
1978 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1980 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
1981 that describes the status of this function. */
1982 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1984 /* For FUNCTION_DECL, if it is built-in,
1985 this identifies which built-in operation it is. */
1986 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1988 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1989 Before the struct containing the FUNCTION_DECL is laid out,
1990 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1991 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1992 function. When the class is laid out, this pointer is changed
1993 to an INTEGER_CST node which is suitable for use as an index
1994 into the virtual function table. */
1995 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1997 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1998 which this FIELD_DECL is defined. This information is needed when
1999 writing debugging information about vfield and vbase decls for C++. */
2000 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
2002 /* Every ..._DECL node gets a unique number. */
2003 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
2005 /* For any sort of a ..._DECL node, this points to the original (abstract)
2006 decl node which this decl is an instance of, or else it is NULL indicating
2007 that this decl is not an instance of some other decl. For example,
2008 in a nested declaration of an inline function, this points back to the
2010 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
2012 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2013 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2014 #define DECL_ORIGIN(NODE) \
2015 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2017 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2018 inline instance of some original (abstract) decl from an inline function;
2019 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2020 nodes can also have their abstract origin set to themselves. */
2021 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2022 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2024 /* Nonzero if a _DECL means that the name of this decl should be ignored
2025 for symbolic debug purposes. */
2026 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
2028 /* Nonzero for a given ..._DECL node means that this node represents an
2029 "abstract instance" of the given declaration (e.g. in the original
2030 declaration of an inline function). When generating symbolic debugging
2031 information, we mustn't try to generate any address information for nodes
2032 marked as "abstract instances" because we don't actually generate
2033 any code or allocate any data space for such instances. */
2034 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
2036 /* Nonzero if a _DECL means that no warnings should be generated just
2037 because this decl is unused. */
2038 #define DECL_IN_SYSTEM_HEADER(NODE) \
2039 (DECL_CHECK (NODE)->decl.in_system_header_flag)
2041 /* Nonzero for a given ..._DECL node means that this node should be
2042 put in .common, if possible. If a DECL_INITIAL is given, and it
2043 is not error_mark_node, then the decl cannot be put in .common. */
2044 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
2046 /* Language-specific decl information. */
2047 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
2049 /* In a VAR_DECL or FUNCTION_DECL,
2050 nonzero means external reference:
2051 do not allocate storage, and refer to a definition elsewhere. */
2052 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
2054 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
2056 #define DEFAULT_INIT_PRIORITY 65535
2057 #define MAX_INIT_PRIORITY 65535
2058 #define MAX_RESERVED_INIT_PRIORITY 100
2061 nonzero means the detail info about this type is not dumped into stabs.
2062 Instead it will generate cross reference ('x') of names.
2063 This uses the same flag as DECL_EXTERNAL. */
2064 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2065 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
2067 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2068 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
2070 /* In LABEL_DECL nodes, nonzero means that an error message about
2071 jumping into such a binding contour has been printed for this label. */
2072 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
2074 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2075 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
2077 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
2078 static chain is not needed. */
2079 #define DECL_NO_STATIC_CHAIN(NODE) \
2080 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
2082 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2083 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2085 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2087 Also set in some languages for variables, etc., outside the normal
2088 lexical scope, such as class instance variables. */
2089 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
2091 /* Nonzero in a FUNCTION_DECL means this function can be substituted
2092 where it is called. */
2093 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
2095 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2096 such as via the `inline' keyword in C/C++. This flag controls the linkage
2097 semantics of 'inline'; whether or not the function is inlined is
2098 controlled by DECL_INLINE. */
2099 #define DECL_DECLARED_INLINE_P(NODE) \
2100 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
2102 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2103 this variable in a BIND_EXPR. */
2104 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2105 (DECL_CHECK (NODE)->decl.seen_in_bind_expr)
2107 /* In a VAR_DECL, nonzero if the decl is a register variable with
2108 an explicit asm specification. */
2109 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl.inline_flag)
2111 /* Value of the decls's visibility attribute */
2112 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility)
2114 /* Nonzero means that the decl had its visibility specified rather than
2116 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_CHECK (NODE)->decl.visibility_specified)
2118 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2119 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
2121 /* In a VAR_DECL, nonzero if the data should be allocated from
2122 thread-local storage. */
2123 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
2125 /* In a FUNCTION_DECL, the saved representation of the body of the
2127 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
2129 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2130 if transformations have made this more complicated than evaluating the
2131 decl itself. This should only be used for debugging; once this field has
2132 been set, the decl itself may not legitimately appear in the function. */
2133 #define DECL_VALUE_EXPR(NODE) \
2134 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl.saved_tree)
2136 /* List of FUNCTION_DECLs inlined into this function's body. */
2137 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
2139 /* Nonzero in a FUNCTION_DECL means this function should be treated
2140 as if it were a malloc, meaning it returns a pointer that is
2142 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
2144 /* Nonzero in a FUNCTION_DECL means this function should be treated
2145 as "pure" function (like const function, but may read global memory). */
2146 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
2148 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2150 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
2152 /* Unused in FUNCTION_DECL. */
2154 /* In a VAR_DECL that's static,
2155 nonzero if the space is in the text section. */
2156 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
2158 /* In a FUNCTION_DECL, nonzero means a built in function. */
2159 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2161 /* For a builtin function, identify which part of the compiler defined it. */
2162 #define DECL_BUILT_IN_CLASS(NODE) \
2163 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
2165 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2166 Used in FIELD_DECLs for vtable pointers.
2167 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2168 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
2170 /* Used to indicate that the linkage status of this DECL is not yet known,
2171 so it should not be output now. */
2172 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
2174 /* Used in PARM_DECLs whose type are unions to indicate that the
2175 argument should be passed in the same way that the first union
2176 alternative would be passed. */
2177 #define DECL_TRANSPARENT_UNION(NODE) \
2178 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
2180 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2181 at the beginning or end of execution. */
2182 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2183 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
2185 #define DECL_STATIC_DESTRUCTOR(NODE) \
2186 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
2188 /* Used to indicate that this DECL represents a compiler-generated entity. */
2189 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
2191 /* Used to indicate that this DECL has weak linkage. */
2192 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
2194 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2195 multiple translation units should be merged. */
2196 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
2198 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2199 not be put out unless it is needed in this translation unit.
2200 Entities like this are shared across translation units (like weak
2201 entities), but are guaranteed to be generated by any translation
2202 unit that needs them, and therefore need not be put out anywhere
2203 where they are not needed. DECL_COMDAT is just a hint to the
2204 back-end; it is up to front-ends which set this flag to ensure
2205 that there will never be any harm, other than bloat, in putting out
2206 something which is DECL_COMDAT. */
2207 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
2209 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2210 be instrumented with calls to support routines. */
2211 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2212 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
2214 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2215 disabled in this function. */
2216 #define DECL_NO_LIMIT_STACK(NODE) \
2217 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
2219 /* Additional flags for language-specific uses. */
2220 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
2221 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
2222 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
2223 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
2224 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
2225 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
2226 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
2227 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
2229 /* Used to indicate that the pointer to this DECL cannot be treated as
2230 an address constant. */
2231 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
2233 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2235 #define DECL_NONADDRESSABLE_P(NODE) \
2236 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
2238 /* Used to indicate an alias set for the memory pointed to by this
2239 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2240 pointer (or reference) type. */
2241 #define DECL_POINTER_ALIAS_SET(NODE) \
2242 (DECL_CHECK (NODE)->decl.pointer_alias_set)
2244 /* Used to store the alias_var for a DECL node. */
2245 #define DECL_PTA_ALIASVAR(NODE) \
2246 (DECL_CHECK (NODE)->decl.alias_var)
2248 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2249 dense, unique within any one function, and may be used to index arrays.
2250 If the value is -1, then no UID has been assigned. */
2251 #define LABEL_DECL_UID(NODE) \
2252 (LABEL_DECL_CHECK (NODE)->decl.pointer_alias_set)
2254 /* Nonzero if an alias set has been assigned to this declaration. */
2255 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2256 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2258 /* Nonzero for a decl which is at file scope. */
2259 #define DECL_FILE_SCOPE_P(EXP) \
2260 (! DECL_CONTEXT (EXP) \
2261 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2263 /* Nonzero for a decl that cgraph has decided should be inlined into
2264 at least one call site. It is not meaningful to look at this
2265 directly; always use cgraph_function_possibly_inlined_p. */
2266 #define DECL_POSSIBLY_INLINED(DECL) \
2267 FUNCTION_DECL_CHECK (DECL)->decl.possibly_inlined
2269 /* Nonzero for a decl that is decorated using attribute used.
2270 This indicates compiler tools that this decl needs to be preserved. */
2271 #define DECL_PRESERVE_P(DECL) \
2272 DECL_CHECK (DECL)->decl.preserve_flag
2274 /* Internal to the gimplifier. Indicates that the value is a formal
2275 temporary controlled by the gimplifier. */
2276 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2277 DECL_CHECK (DECL)->decl.gimple_formal_temp
2279 /* Enumerate visibility settings. */
2280 #ifndef SYMBOL_VISIBILITY_DEFINED
2281 #define SYMBOL_VISIBILITY_DEFINED
2282 enum symbol_visibility
2285 VISIBILITY_INTERNAL,
2287 VISIBILITY_PROTECTED
2292 union alias_var_def;
2293 struct tree_decl GTY(())
2295 struct tree_common common;
2299 ENUM_BITFIELD(machine_mode) mode : 8;
2301 unsigned external_flag : 1;
2302 unsigned nonlocal_flag : 1;
2303 unsigned regdecl_flag : 1;
2304 unsigned inline_flag : 1;
2305 unsigned bit_field_flag : 1;
2306 unsigned virtual_flag : 1;
2307 unsigned ignored_flag : 1;
2308 unsigned abstract_flag : 1;
2310 unsigned in_system_header_flag : 1;
2311 unsigned common_flag : 1;
2312 unsigned defer_output : 1;
2313 unsigned transparent_union : 1;
2314 unsigned static_ctor_flag : 1;
2315 unsigned static_dtor_flag : 1;
2316 unsigned artificial_flag : 1;
2317 unsigned weak_flag : 1;
2319 unsigned non_addr_const_p : 1;
2320 unsigned no_instrument_function_entry_exit : 1;
2321 unsigned comdat_flag : 1;
2322 unsigned malloc_flag : 1;
2323 unsigned no_limit_stack : 1;
2324 ENUM_BITFIELD(built_in_class) built_in_class : 2;
2325 unsigned pure_flag : 1;
2327 unsigned non_addressable : 1;
2328 unsigned user_align : 1;
2329 unsigned uninlinable : 1;
2330 unsigned thread_local_flag : 1;
2331 unsigned declared_inline_flag : 1;
2332 unsigned seen_in_bind_expr : 1;
2333 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2334 unsigned visibility_specified : 1;
2336 unsigned lang_flag_0 : 1;
2337 unsigned lang_flag_1 : 1;
2338 unsigned lang_flag_2 : 1;
2339 unsigned lang_flag_3 : 1;
2340 unsigned lang_flag_4 : 1;
2341 unsigned lang_flag_5 : 1;
2342 unsigned lang_flag_6 : 1;
2343 unsigned lang_flag_7 : 1;
2345 unsigned possibly_inlined : 1;
2346 unsigned preserve_flag: 1;
2347 unsigned gimple_formal_temp : 1;
2348 /* 13 unused bits. */
2350 union tree_decl_u1 {
2351 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2352 DECL_FUNCTION_CODE. */
2353 enum built_in_function f;
2354 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2355 is used by language-dependent code. */
2357 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2359 struct tree_decl_u1_a {
2360 unsigned int align : 24;
2361 unsigned int off_align : 8;
2368 tree arguments; /* Also used for DECL_FIELD_OFFSET */
2369 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
2370 tree initial; /* Also used for DECL_QUALIFIER */
2371 tree abstract_origin;
2372 tree assembler_name;
2375 rtx rtl; /* RTL representation for object. */
2377 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
2378 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
2379 In PARM_DECL, holds an RTL for the stack slot
2380 of register where the data was actually passed.
2381 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
2382 union tree_decl_u2 {
2383 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
2384 rtx GTY ((tag ("PARM_DECL"))) r;
2385 tree GTY ((tag ("FIELD_DECL"))) t;
2386 int GTY ((tag ("VAR_DECL"))) i;
2387 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
2389 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE.
2390 In a VAR_DECL or PARM_DECL, this is DECL_VALUE_EXPR. */
2393 /* In a FUNCTION_DECL, these are function data which is to be kept
2394 as long as FUNCTION_DECL is kept. */
2398 HOST_WIDE_INT pointer_alias_set;
2399 union alias_var_def *GTY ((skip(""))) alias_var;
2400 /* Points to a structure whose details depend on the language in use. */
2401 struct lang_decl *lang_specific;
2405 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2406 To reduce overhead, the nodes containing the statements are not trees.
2407 This avoids the overhead of tree_common on all linked list elements.
2409 Use the interface in tree-iterator.h to access this node. */
2411 #define STATEMENT_LIST_HEAD(NODE) \
2412 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2413 #define STATEMENT_LIST_TAIL(NODE) \
2414 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2416 struct tree_statement_list_node
2417 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
2419 struct tree_statement_list_node *prev;
2420 struct tree_statement_list_node *next;
2424 struct tree_statement_list
2427 struct tree_common common;
2428 struct tree_statement_list_node *head;
2429 struct tree_statement_list_node *tail;
2432 #define VALUE_HANDLE_ID(NODE) \
2433 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
2435 #define VALUE_HANDLE_EXPR_SET(NODE) \
2436 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
2438 /* Defined and used in tree-ssa-pre.c. */
2441 struct tree_value_handle GTY(())
2443 struct tree_common common;
2445 /* The set of expressions represented by this handle. */
2446 struct value_set * GTY ((skip)) expr_set;
2448 /* Unique ID for this value handle. IDs are handed out in a
2449 conveniently dense form starting at 0, so that we can make
2450 bitmaps of value handles. */
2454 enum tree_node_structure_enum {
2476 /* Define the overall contents of a tree node.
2477 It may be any of the structures declared above
2478 for various types of node. */
2480 union tree_node GTY ((ptr_alias (union lang_tree_node),
2481 desc ("tree_node_structure (&%h)")))
2483 struct tree_common GTY ((tag ("TS_COMMON"))) common;
2484 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
2485 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
2486 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
2487 struct tree_string GTY ((tag ("TS_STRING"))) string;
2488 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
2489 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
2490 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
2491 struct tree_type GTY ((tag ("TS_TYPE"))) type;
2492 struct tree_list GTY ((tag ("TS_LIST"))) list;
2493 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
2494 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
2495 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
2496 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
2497 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
2498 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
2499 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
2500 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
2503 /* Standard named or nameless data types of the C compiler. */
2522 TI_INTEGER_MINUS_ONE,
2539 TI_COMPLEX_INTEGER_TYPE,
2540 TI_COMPLEX_FLOAT_TYPE,
2541 TI_COMPLEX_DOUBLE_TYPE,
2542 TI_COMPLEX_LONG_DOUBLE_TYPE,
2546 TI_LONG_DOUBLE_TYPE,
2550 TI_LONG_DOUBLE_PTR_TYPE,
2551 TI_INTEGER_PTR_TYPE,
2570 extern GTY(()) tree global_trees[TI_MAX];
2572 #define error_mark_node global_trees[TI_ERROR_MARK]
2574 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2575 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2576 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2577 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2578 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2580 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2581 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2582 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2583 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2584 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2586 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2587 #define integer_one_node global_trees[TI_INTEGER_ONE]
2588 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2589 #define size_zero_node global_trees[TI_SIZE_ZERO]
2590 #define size_one_node global_trees[TI_SIZE_ONE]
2591 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2592 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2593 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2595 /* Base access nodes. */
2596 #define access_public_node global_trees[TI_PUBLIC]
2597 #define access_protected_node global_trees[TI_PROTECTED]
2598 #define access_private_node global_trees[TI_PRIVATE]
2600 #define null_pointer_node global_trees[TI_NULL_POINTER]
2602 #define float_type_node global_trees[TI_FLOAT_TYPE]
2603 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2604 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2606 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
2607 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
2608 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
2609 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
2611 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2612 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2613 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2614 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2616 #define void_type_node global_trees[TI_VOID_TYPE]
2617 /* The C type `void *'. */
2618 #define ptr_type_node global_trees[TI_PTR_TYPE]
2619 /* The C type `const void *'. */
2620 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2621 /* The C type `size_t'. */
2622 #define size_type_node global_trees[TI_SIZE_TYPE]
2623 #define pid_type_node global_trees[TI_PID_TYPE]
2624 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2625 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2626 /* The C type `FILE *'. */
2627 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
2629 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
2630 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
2631 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
2633 /* The node that should be placed at the end of a parameter list to
2634 indicate that the function does not take a variable number of
2635 arguments. The TREE_VALUE will be void_type_node and there will be
2636 no TREE_CHAIN. Language-independent code should not assume
2637 anything else about this node. */
2638 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2640 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2641 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2643 /* An enumeration of the standard C integer types. These must be
2644 ordered so that shorter types appear before longer ones, and so
2645 that signed types appear before unsigned ones, for the correct
2646 functioning of interpret_integer() in c-lex.c. */
2647 enum integer_type_kind
2659 itk_unsigned_long_long,
2663 typedef enum integer_type_kind integer_type_kind;
2665 /* The standard C integer types. Use integer_type_kind to index into
2667 extern GTY(()) tree integer_types[itk_none];
2669 #define char_type_node integer_types[itk_char]
2670 #define signed_char_type_node integer_types[itk_signed_char]
2671 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2672 #define short_integer_type_node integer_types[itk_short]
2673 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2674 #define integer_type_node integer_types[itk_int]
2675 #define unsigned_type_node integer_types[itk_unsigned_int]
2676 #define long_integer_type_node integer_types[itk_long]
2677 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2678 #define long_long_integer_type_node integer_types[itk_long_long]
2679 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2681 /* Set to the default thread-local storage (tls) model to use. */
2683 extern enum tls_model flag_tls_default;
2686 /* A pointer-to-function member type looks like:
2693 If __pfn is NULL, it is a NULL pointer-to-member-function.
2695 (Because the vtable is always the first thing in the object, we
2696 don't need its offset.) If the function is virtual, then PFN is
2697 one plus twice the index into the vtable; otherwise, it is just a
2698 pointer to the function.
2700 Unfortunately, using the lowest bit of PFN doesn't work in
2701 architectures that don't impose alignment requirements on function
2702 addresses, or that use the lowest bit to tell one ISA from another,
2703 for example. For such architectures, we use the lowest bit of
2704 DELTA instead of the lowest bit of the PFN, and DELTA will be
2707 enum ptrmemfunc_vbit_where_t
2709 ptrmemfunc_vbit_in_pfn,
2710 ptrmemfunc_vbit_in_delta
2713 #define NULL_TREE (tree) NULL
2715 extern GTY(()) tree frame_base_decl;
2716 extern tree decl_assembler_name (tree);
2718 /* Compute the number of bytes occupied by 'node'. This routine only
2719 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2721 extern size_t tree_size (tree);
2723 /* Compute the number of bytes occupied by a tree with code CODE. This
2724 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
2726 extern size_t tree_code_size (enum tree_code);
2728 /* Lowest level primitive for allocating a node.
2729 The TREE_CODE is the only argument. Contents are initialized
2730 to zero except for a few of the common fields. */
2732 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
2733 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
2735 /* Make a copy of a node, with all the same contents. */
2737 extern tree copy_node_stat (tree MEM_STAT_DECL);
2738 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
2740 /* Make a copy of a chain of TREE_LIST nodes. */
2742 extern tree copy_list (tree);
2745 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
2746 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
2748 /* Make a TREE_VEC. */
2750 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
2751 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
2753 /* Tree nodes for SSA analysis. */
2755 extern void init_phinodes (void);
2756 extern void fini_phinodes (void);
2757 extern void release_phi_node (tree);
2758 #ifdef GATHER_STATISTICS
2759 extern void phinodes_print_statistics (void);
2762 extern void init_ssanames (void);
2763 extern void fini_ssanames (void);
2764 extern tree make_ssa_name (tree, tree);
2765 extern tree duplicate_ssa_name (tree, tree);
2766 extern void release_ssa_name (tree);
2767 extern void release_defs (tree);
2768 extern void replace_ssa_name_symbol (tree, tree);
2770 #ifdef GATHER_STATISTICS
2771 extern void ssanames_print_statistics (void);
2774 extern void mark_for_rewrite (tree);
2775 extern void unmark_all_for_rewrite (void);
2776 extern bool marked_for_rewrite_p (tree);
2777 extern bool any_marked_for_rewrite_p (void);
2778 extern struct bitmap_head_def *marked_ssa_names (void);
2781 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2782 The name is supplied as a char *. */
2784 extern tree get_identifier (const char *);
2786 #if GCC_VERSION >= 3000
2787 #define get_identifier(str) \
2788 (__builtin_constant_p (str) \
2789 ? get_identifier_with_length ((str), strlen (str)) \
2790 : get_identifier (str))
2794 /* Identical to get_identifier, except that the length is assumed
2797 extern tree get_identifier_with_length (const char *, size_t);
2799 /* If an identifier with the name TEXT (a null-terminated string) has
2800 previously been referred to, return that node; otherwise return
2803 extern tree maybe_get_identifier (const char *);
2805 /* Construct various types of nodes. */
2807 extern tree build (enum tree_code, tree, ...);
2808 extern tree build_nt (enum tree_code, ...);
2810 #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L
2811 /* Use preprocessor trickery to map "build" to "buildN" where N is the
2812 expected number of arguments. This is used for both efficiency (no
2813 varargs), and checking (verifying number of passed arguments). */
2814 #define build(code, ...) \
2815 _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__)
2816 #define _buildN1(BASE, X) _buildN2(BASE, X)
2817 #define _buildN2(BASE, X) BASE##X
2818 #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0)
2819 #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c
2822 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
2823 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
2824 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2825 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
2826 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
2827 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
2828 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
2829 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
2830 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
2831 tree MEM_STAT_DECL);
2832 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
2834 extern tree build_int_cst (tree, HOST_WIDE_INT);
2835 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
2836 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
2837 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2838 extern tree build_vector (tree, tree);
2839 extern tree build_constructor (tree, tree);
2840 extern tree build_real_from_int_cst (tree, tree);
2841 extern tree build_complex (tree, tree, tree);
2842 extern tree build_string (int, const char *);
2843 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
2844 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
2845 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2846 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
2847 extern tree build_block (tree, tree, tree, tree, tree);
2848 #ifndef USE_MAPPED_LOCATION
2849 extern void annotate_with_file_line (tree, const char *, int);
2850 extern void annotate_with_locus (tree, location_t);
2852 extern tree build_empty_stmt (void);
2854 /* Construct various nodes representing data types. */
2856 extern tree make_signed_type (int);
2857 extern tree make_unsigned_type (int);
2858 extern tree signed_type_for (tree);
2859 extern tree unsigned_type_for (tree);
2860 extern void initialize_sizetypes (bool);
2861 extern void set_sizetype (tree);
2862 extern void fixup_unsigned_type (tree);
2863 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
2864 extern tree build_pointer_type (tree);
2865 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
2866 extern tree build_reference_type (tree);
2867 extern tree build_vector_type_for_mode (tree, enum machine_mode);
2868 extern tree build_vector_type (tree innertype, int nunits);
2869 extern tree build_type_no_quals (tree);
2870 extern tree build_index_type (tree);
2871 extern tree build_index_2_type (tree, tree);
2872 extern tree build_array_type (tree, tree);
2873 extern tree build_function_type (tree, tree);
2874 extern tree build_function_type_list (tree, ...);
2875 extern tree build_method_type_directly (tree, tree, tree);
2876 extern tree build_method_type (tree, tree);
2877 extern tree build_offset_type (tree, tree);
2878 extern tree build_complex_type (tree);
2879 extern tree array_type_nelts (tree);
2880 extern bool in_array_bounds_p (tree);
2882 extern tree value_member (tree, tree);
2883 extern tree purpose_member (tree, tree);
2885 extern int attribute_list_equal (tree, tree);
2886 extern int attribute_list_contained (tree, tree);
2887 extern int tree_int_cst_equal (tree, tree);
2888 extern int tree_int_cst_lt (tree, tree);
2889 extern int tree_int_cst_compare (tree, tree);
2890 extern int host_integerp (tree, int);
2891 extern HOST_WIDE_INT tree_low_cst (tree, int);
2892 extern int tree_int_cst_msb (tree);
2893 extern int tree_int_cst_sgn (tree);
2894 extern int tree_expr_nonnegative_p (tree);
2895 extern bool may_negate_without_overflow_p (tree);
2896 extern tree get_inner_array_type (tree);
2898 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2899 put the prototype here. Rtl.h does declare the prototype if
2900 tree.h had been included. */
2902 extern tree make_tree (tree, rtx);
2904 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2907 Such modified types already made are recorded so that duplicates
2910 extern tree build_type_attribute_variant (tree, tree);
2911 extern tree build_decl_attribute_variant (tree, tree);
2913 /* Structure describing an attribute and a function to handle it. */
2914 struct attribute_spec
2916 /* The name of the attribute (without any leading or trailing __),
2917 or NULL to mark the end of a table of attributes. */
2918 const char *const name;
2919 /* The minimum length of the list of arguments of the attribute. */
2920 const int min_length;
2921 /* The maximum length of the list of arguments of the attribute
2922 (-1 for no maximum). */
2923 const int max_length;
2924 /* Whether this attribute requires a DECL. If it does, it will be passed
2925 from types of DECLs, function return types and array element types to
2926 the DECLs, function types and array types respectively; but when
2927 applied to a type in any other circumstances, it will be ignored with
2928 a warning. (If greater control is desired for a given attribute,
2929 this should be false, and the flags argument to the handler may be
2930 used to gain greater control in that case.) */
2931 const bool decl_required;
2932 /* Whether this attribute requires a type. If it does, it will be passed
2933 from a DECL to the type of that DECL. */
2934 const bool type_required;
2935 /* Whether this attribute requires a function (or method) type. If it does,
2936 it will be passed from a function pointer type to the target type,
2937 and from a function return type (which is not itself a function
2938 pointer type) to the function type. */
2939 const bool function_type_required;
2940 /* Function to handle this attribute. NODE points to the node to which
2941 the attribute is to be applied. If a DECL, it should be modified in
2942 place; if a TYPE, a copy should be created. NAME is the name of the
2943 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2944 of the arguments (which may be NULL). FLAGS gives further information
2945 about the context of the attribute. Afterwards, the attributes will
2946 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2947 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2948 as well as in any other cases when the attributes should not be added
2949 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2950 applied to another type or DECL later may be returned;
2951 otherwise the return value should be NULL_TREE. This pointer may be
2952 NULL if no special handling is required beyond the checks implied
2953 by the rest of this structure. */
2954 tree (*const handler) (tree *node, tree name, tree args,
2955 int flags, bool *no_add_attrs);
2958 /* Flags that may be passed in the third argument of decl_attributes, and
2959 to handler functions for attributes. */
2960 enum attribute_flags
2962 /* The type passed in is the type of a DECL, and any attributes that
2963 should be passed in again to be applied to the DECL rather than the
2964 type should be returned. */
2965 ATTR_FLAG_DECL_NEXT = 1,
2966 /* The type passed in is a function return type, and any attributes that
2967 should be passed in again to be applied to the function type rather
2968 than the return type should be returned. */
2969 ATTR_FLAG_FUNCTION_NEXT = 2,
2970 /* The type passed in is an array element type, and any attributes that
2971 should be passed in again to be applied to the array type rather
2972 than the element type should be returned. */
2973 ATTR_FLAG_ARRAY_NEXT = 4,
2974 /* The type passed in is a structure, union or enumeration type being
2975 created, and should be modified in place. */
2976 ATTR_FLAG_TYPE_IN_PLACE = 8,
2977 /* The attributes are being applied by default to a library function whose
2978 name indicates known behavior, and should be silently ignored if they
2979 are not in fact compatible with the function type. */
2980 ATTR_FLAG_BUILT_IN = 16
2983 /* Default versions of target-overridable functions. */
2985 extern tree merge_decl_attributes (tree, tree);
2986 extern tree merge_type_attributes (tree, tree);
2987 extern void default_register_cpp_builtins (struct cpp_reader *);
2989 /* Given a tree node and a string, return nonzero if the tree node is
2990 a valid attribute name for the string. */
2992 extern int is_attribute_p (const char *, tree);
2994 /* Given an attribute name and a list of attributes, return the list element
2995 of the attribute or NULL_TREE if not found. */
2997 extern tree lookup_attribute (const char *, tree);
2999 /* Given two attributes lists, return a list of their union. */
3001 extern tree merge_attributes (tree, tree);
3003 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3004 /* Given two Windows decl attributes lists, possibly including
3005 dllimport, return a list of their union . */
3006 extern tree merge_dllimport_decl_attributes (tree, tree);
3008 /* Handle a "dllimport" or "dllexport" attribute. */
3009 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3012 /* Check whether CAND is suitable to be returned from get_qualified_type
3013 (BASE, TYPE_QUALS). */
3015 extern bool check_qualified_type (tree, tree, int);
3017 /* Return a version of the TYPE, qualified as indicated by the
3018 TYPE_QUALS, if one exists. If no qualified version exists yet,
3019 return NULL_TREE. */
3021 extern tree get_qualified_type (tree, int);
3023 /* Like get_qualified_type, but creates the type if it does not
3024 exist. This function never returns NULL_TREE. */
3026 extern tree build_qualified_type (tree, int);
3028 /* Like build_qualified_type, but only deals with the `const' and
3029 `volatile' qualifiers. This interface is retained for backwards
3030 compatibility with the various front-ends; new code should use
3031 build_qualified_type instead. */
3033 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3034 build_qualified_type ((TYPE), \
3035 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3036 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3038 /* Make a copy of a type node. */
3040 extern tree build_distinct_type_copy (tree);
3041 extern tree build_variant_type_copy (tree);
3043 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3044 fields. Optionally specify an alignment, and then lay it out. */
3046 extern void finish_builtin_struct (tree, const char *,
3049 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3050 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3051 node, does nothing except for the first time. */
3053 extern void layout_type (tree);
3055 /* These functions allow a front-end to perform a manual layout of a
3056 RECORD_TYPE. (For instance, if the placement of subsequent fields
3057 depends on the placement of fields so far.) Begin by calling
3058 start_record_layout. Then, call place_field for each of the
3059 fields. Then, call finish_record_layout. See layout_type for the
3060 default way in which these functions are used. */
3062 typedef struct record_layout_info_s
3064 /* The RECORD_TYPE that we are laying out. */
3066 /* The offset into the record so far, in bytes, not including bits in
3069 /* The last known alignment of SIZE. */
3070 unsigned int offset_align;
3071 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3073 /* The alignment of the record so far, in bits. */
3074 unsigned int record_align;
3075 /* The alignment of the record so far, ignoring #pragma pack and
3076 __attribute__ ((packed)), in bits. */
3077 unsigned int unpacked_align;
3078 /* The previous field layed out. */
3080 /* The static variables (i.e., class variables, as opposed to
3081 instance variables) encountered in T. */
3082 tree pending_statics;
3083 /* Bits remaining in the current alignment group */
3084 int remaining_in_alignment;
3085 /* True if we've seen a packed field that didn't have normal
3086 alignment anyway. */
3087 int packed_maybe_necessary;
3088 } *record_layout_info;
3090 extern void set_lang_adjust_rli (void (*) (record_layout_info));
3091 extern record_layout_info start_record_layout (tree);
3092 extern tree bit_from_pos (tree, tree);
3093 extern tree byte_from_pos (tree, tree);
3094 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
3095 extern void normalize_offset (tree *, tree *, unsigned int);
3096 extern tree rli_size_unit_so_far (record_layout_info);
3097 extern tree rli_size_so_far (record_layout_info);
3098 extern void normalize_rli (record_layout_info);
3099 extern void place_field (record_layout_info, tree);
3100 extern void compute_record_mode (tree);
3101 extern void finish_record_layout (record_layout_info, int);
3103 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3104 return a canonicalized ..._TYPE node, so that duplicates are not made.
3105 How the hash code is computed is up to the caller, as long as any two
3106 callers that could hash identical-looking type nodes agree. */
3108 extern tree type_hash_canon (unsigned int, tree);
3110 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3111 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3112 fields. Call this only once for any given decl node.
3114 Second argument is the boundary that this field can be assumed to
3115 be starting at (in bits). Zero means it can be assumed aligned
3116 on any boundary that may be needed. */
3118 extern void layout_decl (tree, unsigned);
3120 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3121 a previous call to layout_decl and calls it again. */
3123 extern void relayout_decl (tree);
3125 /* Return the mode for data of a given size SIZE and mode class CLASS.
3126 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3127 The value is BLKmode if no other mode is found. This is like
3128 mode_for_size, but is passed a tree. */
3130 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
3132 /* Return an expr equal to X but certainly not valid as an lvalue. */
3134 extern tree non_lvalue (tree);
3136 extern tree convert (tree, tree);
3137 extern unsigned int expr_align (tree);
3138 extern tree expr_first (tree);
3139 extern tree expr_last (tree);
3140 extern tree expr_only (tree);
3141 extern tree size_in_bytes (tree);
3142 extern HOST_WIDE_INT int_size_in_bytes (tree);
3143 extern tree bit_position (tree);
3144 extern HOST_WIDE_INT int_bit_position (tree);
3145 extern tree byte_position (tree);
3146 extern HOST_WIDE_INT int_byte_position (tree);
3148 /* Define data structures, macros, and functions for handling sizes
3149 and the various types used to represent sizes. */
3153 SIZETYPE, /* Normal representation of sizes in bytes. */
3154 SSIZETYPE, /* Signed representation of sizes in bytes. */
3155 BITSIZETYPE, /* Normal representation of sizes in bits. */
3156 SBITSIZETYPE, /* Signed representation of sizes in bits. */
3159 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
3161 #define sizetype sizetype_tab[(int) SIZETYPE]
3162 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
3163 #define ssizetype sizetype_tab[(int) SSIZETYPE]
3164 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
3166 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
3167 extern tree size_binop (enum tree_code, tree, tree);
3168 extern tree size_diffop (tree, tree);
3170 #define size_int(L) size_int_kind (L, SIZETYPE)
3171 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
3172 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
3173 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
3175 extern tree round_up (tree, int);
3176 extern tree round_down (tree, int);
3177 extern tree get_pending_sizes (void);
3178 extern void put_pending_size (tree);
3179 extern void put_pending_sizes (tree);
3181 /* Type for sizes of data-type. */
3183 #define BITS_PER_UNIT_LOG \
3184 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3185 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3186 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3188 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
3189 extern unsigned int maximum_field_alignment;
3190 /* and its original value in bytes, specified via -fpack-struct=<value>. */
3191 extern unsigned int initial_max_fld_align;
3193 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
3194 extern unsigned int set_alignment;
3196 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3197 by making the last node in X point to Y.
3198 Returns X, except if X is 0 returns Y. */
3200 extern tree chainon (tree, tree);
3202 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3204 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3205 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3207 /* Return the last tree node in a chain. */
3209 extern tree tree_last (tree);
3211 /* Reverse the order of elements in a chain, and return the new head. */
3213 extern tree nreverse (tree);
3215 /* Returns the length of a chain of nodes
3216 (number of chain pointers to follow before reaching a null pointer). */
3218 extern int list_length (tree);
3220 /* Returns the number of FIELD_DECLs in a type. */
3222 extern int fields_length (tree);
3224 /* Given an initializer INIT, return TRUE if INIT is zero or some
3225 aggregate of zeros. Otherwise return FALSE. */
3227 extern bool initializer_zerop (tree);
3229 extern void categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *);
3230 extern HOST_WIDE_INT count_type_elements (tree);
3232 /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */
3234 extern void add_var_to_bind_expr (tree, tree);
3236 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3238 extern int integer_zerop (tree);
3240 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
3242 extern int integer_onep (tree);
3244 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3245 all of whose significant bits are 1. */
3247 extern int integer_all_onesp (tree);
3249 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3250 exactly one bit 1. */
3252 extern int integer_pow2p (tree);
3254 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3255 with a nonzero value. */
3257 extern int integer_nonzerop (tree);
3259 extern bool zero_p (tree);
3260 extern bool cst_and_fits_in_hwi (tree);
3262 /* staticp (tree x) is nonzero if X is a reference to data allocated
3263 at a fixed address in memory. Returns the outermost data. */
3265 extern tree staticp (tree);
3267 /* save_expr (EXP) returns an expression equivalent to EXP
3268 but it can be used multiple times within context CTX
3269 and only evaluate EXP once. */
3271 extern tree save_expr (tree);
3273 /* Look inside EXPR and into any simple arithmetic operations. Return
3274 the innermost non-arithmetic node. */
3276 extern tree skip_simple_arithmetic (tree);
3278 /* Return which tree structure is used by T. */
3280 enum tree_node_structure_enum tree_node_structure (tree);
3282 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
3283 or offset that depends on a field within a record.
3285 Note that we only allow such expressions within simple arithmetic
3288 extern bool contains_placeholder_p (tree);
3290 /* This macro calls the above function but short-circuits the common
3291 case of a constant to save time. Also check for null. */
3293 #define CONTAINS_PLACEHOLDER_P(EXP) \
3294 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
3296 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
3297 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
3300 extern bool type_contains_placeholder_p (tree);
3302 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3303 return a tree with all occurrences of references to F in a
3304 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
3305 contains only arithmetic expressions. */
3307 extern tree substitute_in_expr (tree, tree, tree);
3309 /* This macro calls the above function but short-circuits the common
3310 case of a constant to save time and also checks for NULL. */
3312 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
3313 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
3315 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3316 for it within OBJ, a tree that is an object or a chain of references. */
3318 extern tree substitute_placeholder_in_expr (tree, tree);
3320 /* This macro calls the above function but short-circuits the common
3321 case of a constant to save time and also checks for NULL. */
3323 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
3324 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
3325 : substitute_placeholder_in_expr (EXP, OBJ))
3327 /* variable_size (EXP) is like save_expr (EXP) except that it
3328 is for the special case of something that is part of a
3329 variable size for a data type. It makes special arrangements
3330 to compute the value at the right time when the data type
3331 belongs to a function parameter. */
3333 extern tree variable_size (tree);
3335 /* stabilize_reference (EXP) returns a reference equivalent to EXP
3336 but it can be used multiple times
3337 and only evaluate the subexpressions once. */
3339 extern tree stabilize_reference (tree);
3341 /* Subroutine of stabilize_reference; this is called for subtrees of
3342 references. Any expression with side-effects must be put in a SAVE_EXPR
3343 to ensure that it is only evaluated once. */
3345 extern tree stabilize_reference_1 (tree);
3347 /* Return EXP, stripped of any conversions to wider types
3348 in such a way that the result of converting to type FOR_TYPE
3349 is the same as if EXP were converted to FOR_TYPE.
3350 If FOR_TYPE is 0, it signifies EXP's type. */
3352 extern tree get_unwidened (tree, tree);
3354 /* Return OP or a simpler expression for a narrower value
3355 which can be sign-extended or zero-extended to give back OP.
3356 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3357 or 0 if the value should be sign-extended. */
3359 extern tree get_narrower (tree, int *);
3361 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
3362 look for nested component-refs or array-refs at constant positions
3363 and find the ultimate containing object, which is returned. */
3365 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3366 tree *, enum machine_mode *, int *, int *);
3368 /* Return 1 if T is an expression that get_inner_reference handles. */
3370 extern int handled_component_p (tree);
3372 /* Return a tree of sizetype representing the size, in bytes, of the element
3373 of EXP, an ARRAY_REF. */
3375 extern tree array_ref_element_size (tree);
3377 /* Return a tree representing the lower bound of the array mentioned in
3378 EXP, an ARRAY_REF. */
3380 extern tree array_ref_low_bound (tree);
3382 /* Return a tree representing the upper bound of the array mentioned in
3383 EXP, an ARRAY_REF. */
3385 extern tree array_ref_up_bound (tree);
3387 /* Return a tree representing the offset, in bytes, of the field referenced
3388 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
3390 extern tree component_ref_field_offset (tree);
3392 /* Given a DECL or TYPE, return the scope in which it was declared, or
3393 NUL_TREE if there is no containing scope. */
3395 extern tree get_containing_scope (tree);
3397 /* Return the FUNCTION_DECL which provides this _DECL with its context,
3399 extern tree decl_function_context (tree);
3401 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
3402 this _DECL with its context, or zero if none. */
3403 extern tree decl_type_context (tree);
3405 /* Return 1 if EXPR is the real constant zero. */
3406 extern int real_zerop (tree);
3408 /* Declare commonly used variables for tree structure. */
3410 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
3411 Zero means allow extended lvalues. */
3413 extern int pedantic_lvalues;
3415 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
3417 extern GTY(()) tree current_function_decl;
3419 /* Nonzero means a FUNC_BEGIN label was emitted. */
3420 extern GTY(()) const char * current_function_func_begin_label;
3423 extern unsigned crc32_string (unsigned, const char *);
3424 extern void clean_symbol_name (char *);
3425 extern tree get_file_function_name_long (const char *);
3426 extern tree get_set_constructor_bits (tree, char *, int);
3427 extern tree get_set_constructor_bytes (tree, unsigned char *, int);
3428 extern tree get_callee_fndecl (tree);
3429 extern void change_decl_assembler_name (tree, tree);
3430 extern int type_num_arguments (tree);
3431 extern bool associative_tree_code (enum tree_code);
3432 extern bool commutative_tree_code (enum tree_code);
3433 extern tree get_case_label (tree);
3434 extern tree upper_bound_in_type (tree, tree);
3435 extern tree lower_bound_in_type (tree, tree);
3436 extern int operand_equal_for_phi_arg_p (tree, tree);
3440 extern void expand_expr_stmt (tree);
3441 extern int warn_if_unused_value (tree, location_t);
3442 extern void expand_label (tree);
3443 extern void expand_goto (tree);
3445 extern rtx expand_stack_save (void);
3446 extern void expand_stack_restore (tree);
3447 extern void expand_return (tree);
3448 extern int is_body_block (tree);
3451 extern void using_eh_for_cleanups (void);
3453 /* In fold-const.c */
3455 /* Fold constants as much as possible in an expression.
3456 Returns the simplified expression.
3457 Acts only on the top level of the expression;
3458 if the argument itself cannot be simplified, its
3459 subexpressions are not changed. */
3461 extern tree fold (tree);
3462 extern tree fold_initializer (tree);
3463 extern tree fold_convert (tree, tree);
3464 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
3465 extern tree fold_ignored_result (tree);
3466 extern tree fold_abs_const (tree, tree);
3468 extern tree force_fit_type (tree, int, bool, bool);
3470 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3471 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3472 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3473 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3474 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3475 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3476 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3477 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3478 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3479 HOST_WIDE_INT, unsigned int,
3480 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3481 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3482 HOST_WIDE_INT, unsigned int,
3483 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3484 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3485 HOST_WIDE_INT, unsigned int,
3486 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3487 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3488 HOST_WIDE_INT, unsigned int,
3489 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3491 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
3492 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
3493 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
3494 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
3497 enum operand_equal_flag
3503 extern int operand_equal_p (tree, tree, unsigned int);
3505 extern tree omit_one_operand (tree, tree, tree);
3506 extern tree omit_two_operands (tree, tree, tree, tree);
3507 extern tree invert_truthvalue (tree);
3508 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
3509 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
3510 extern tree fold_read_from_constant_string (tree);
3511 extern tree int_const_binop (enum tree_code, tree, tree, int);
3512 extern tree build_fold_addr_expr (tree);
3513 tree fold_build_cleanup_point_expr (tree type, tree expr);
3514 extern tree build_fold_addr_expr_with_type (tree, tree);
3515 extern tree build_fold_indirect_ref (tree);
3516 extern tree constant_boolean_node (int, tree);
3517 extern tree build_low_bits_mask (tree, unsigned);
3519 extern bool tree_swap_operands_p (tree, tree, bool);
3520 extern enum tree_code swap_tree_comparison (enum tree_code);
3522 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
3525 extern tree fold_builtin (tree, bool);
3526 extern tree fold_builtin_fputs (tree, bool, bool, tree);
3527 extern tree fold_builtin_strcpy (tree, tree);
3528 extern tree fold_builtin_strncpy (tree, tree);
3529 extern bool fold_builtin_next_arg (tree);
3530 extern enum built_in_function builtin_mathfn_code (tree);
3531 extern tree build_function_call_expr (tree, tree);
3532 extern tree mathfn_built_in (tree, enum built_in_function fn);
3533 extern tree strip_float_extensions (tree);
3534 extern tree c_strlen (tree, int);
3535 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
3536 extern tree build_va_arg_indirect_ref (tree);
3539 extern tree strip_float_extensions (tree);
3542 extern void record_component_aliases (tree);
3543 extern HOST_WIDE_INT get_alias_set (tree);
3544 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3545 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3546 extern int objects_must_conflict_p (tree, tree);
3549 extern int really_constant_p (tree);
3550 extern int int_fits_type_p (tree, tree);
3551 extern bool variably_modified_type_p (tree, tree);
3552 extern int tree_log2 (tree);
3553 extern int tree_floor_log2 (tree);
3554 extern int simple_cst_equal (tree, tree);
3555 extern unsigned int iterative_hash_expr (tree, unsigned int);
3556 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
3557 extern int type_list_equal (tree, tree);
3558 extern int chain_member (tree, tree);
3559 extern tree type_hash_lookup (unsigned int, tree);
3560 extern void type_hash_add (unsigned int, tree);
3561 extern int simple_cst_list_equal (tree, tree);
3562 extern void dump_tree_statistics (void);
3563 extern void expand_function_end (void);
3564 extern void expand_function_start (tree);
3565 extern void recompute_tree_invarant_for_addr_expr (tree);
3566 extern bool is_global_var (tree t);
3567 extern bool needs_to_live_in_memory (tree);
3568 extern tree reconstruct_complex_type (tree, tree);
3570 extern int real_onep (tree);
3571 extern int real_twop (tree);
3572 extern int real_minus_onep (tree);
3573 extern void init_ttree (void);
3574 extern void build_common_tree_nodes (bool, bool);
3575 extern void build_common_tree_nodes_2 (int);
3576 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
3577 extern tree build_range_type (tree, tree, tree);
3578 extern HOST_WIDE_INT int_cst_value (tree);
3579 extern tree tree_fold_gcd (tree, tree);
3580 extern tree build_addr (tree);
3582 extern bool fields_compatible_p (tree, tree);
3583 extern tree find_compatible_field (tree, tree);
3586 extern void expand_main_function (void);
3587 extern void init_dummy_function_start (void);
3588 extern void expand_dummy_function_end (void);
3589 extern void init_function_for_compilation (void);
3590 extern void allocate_struct_function (tree);
3591 extern void init_function_start (tree);
3592 extern bool use_register_for_decl (tree);
3593 extern void setjmp_vars_warning (tree);
3594 extern void setjmp_args_warning (void);
3595 extern void init_temp_slots (void);
3596 extern void free_temp_slots (void);
3597 extern void pop_temp_slots (void);
3598 extern void push_temp_slots (void);
3599 extern void preserve_temp_slots (rtx);
3600 extern int aggregate_value_p (tree, tree);
3601 extern void push_function_context (void);
3602 extern void pop_function_context (void);
3603 extern void push_function_context_to (tree);
3604 extern void pop_function_context_from (tree);
3605 extern tree gimplify_parameters (void);
3607 /* In print-rtl.c */
3609 extern void print_rtl (FILE *, rtx);
3612 /* In print-tree.c */
3613 extern void debug_tree (tree);
3615 extern void print_node (FILE *, const char *, tree, int);
3616 extern void print_node_brief (FILE *, const char *, tree, int);
3617 extern void indent_to (FILE *, int);
3620 /* In tree-inline.c: */
3621 extern bool debug_find_tree (tree, tree);
3622 /* This is in tree-inline.c since the routine uses
3623 data structures from the inliner. */
3624 extern tree unsave_expr_now (tree);
3627 extern void check_max_integer_computation_mode (tree);
3630 extern rtx emit_line_note (location_t);
3634 /* Nonzero if this is a call to a function whose return value depends
3635 solely on its arguments, has no side effects, and does not read
3638 /* Nonzero if this call will never return. */
3639 #define ECF_NORETURN 2
3640 /* Nonzero if this is a call to malloc or a related function. */
3641 #define ECF_MALLOC 4
3642 /* Nonzero if it is plausible that this is a call to alloca. */
3643 #define ECF_MAY_BE_ALLOCA 8
3644 /* Nonzero if this is a call to a function that won't throw an exception. */
3645 #define ECF_NOTHROW 16
3646 /* Nonzero if this is a call to setjmp or a related function. */
3647 #define ECF_RETURNS_TWICE 32
3648 /* Nonzero if this call replaces the current stack frame. */
3649 #define ECF_SIBCALL 64
3650 /* Nonzero if this is a call to "pure" function (like const function,
3651 but may read memory. */
3652 #define ECF_PURE 128
3653 /* Nonzero if this is a call to a function that returns with the stack
3654 pointer depressed. */
3655 #define ECF_SP_DEPRESSED 256
3656 /* Nonzero if this call is known to always return. */
3657 #define ECF_ALWAYS_RETURN 512
3658 /* Create libcall block around the call. */
3659 #define ECF_LIBCALL_BLOCK 1024
3661 extern int flags_from_decl_or_type (tree);
3662 extern int call_expr_flags (tree);
3664 extern int setjmp_call_p (tree);
3665 extern bool alloca_call_p (tree);
3666 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
3667 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
3671 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3672 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3673 it should be modified in place; if a TYPE, a copy should be created
3674 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3675 information, in the form of a bitwise OR of flags in enum attribute_flags
3676 from tree.h. Depending on these flags, some attributes may be
3677 returned to be applied at a later stage (for example, to apply
3678 a decl attribute to the declaration rather than to its type). */
3679 extern tree decl_attributes (tree *, tree, int);
3681 /* In integrate.c */
3682 extern void set_decl_abstract_flags (tree, int);
3683 extern void set_decl_origin_self (tree);
3685 /* In stor-layout.c */
3686 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
3687 extern void fixup_signed_type (tree);
3688 extern void internal_reference_types (void);
3689 extern unsigned int update_alignment_for_field (record_layout_info, tree,
3692 extern void make_decl_rtl (tree);
3693 extern void make_decl_one_only (tree);
3694 extern int supports_one_only (void);
3695 extern void variable_section (tree, int);
3696 extern void resolve_unique_section (tree, int, int);
3697 extern void mark_referenced (tree);
3698 extern void mark_decl_referenced (tree);
3699 extern void notice_global_symbol (tree);
3700 extern void set_user_assembler_name (tree, const char *);
3701 extern void process_pending_assemble_externals (void);
3704 extern void expand_computed_goto (tree);
3705 extern bool parse_output_constraint (const char **, int, int, int,
3706 bool *, bool *, bool *);
3707 extern bool parse_input_constraint (const char **, int, int, int, int,
3708 const char * const *, bool *, bool *);
3709 extern void expand_asm_expr (tree);
3710 extern tree resolve_asm_operand_names (tree, tree, tree);
3711 extern void expand_case (tree);
3712 extern void expand_decl (tree);
3713 extern void expand_anon_union_decl (tree, tree, tree);
3715 /* In gimplify.c. */
3716 extern tree create_artificial_label (void);
3717 extern void gimplify_function_tree (tree);
3718 extern const char *get_name (tree);
3719 extern tree unshare_expr (tree);
3720 extern void sort_case_labels (tree);
3722 /* If KIND=='I', return a suitable global initializer (constructor) name.
3723 If KIND=='D', return a suitable global clean-up (destructor) name. */
3724 extern tree get_file_function_name (int);
3726 /* Interface of the DWARF2 unwind info support. */
3728 /* Generate a new label for the CFI info to refer to. */
3730 extern char *dwarf2out_cfi_label (void);
3732 /* Entry point to update the canonical frame address (CFA). */
3734 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
3736 /* Add the CFI for saving a register window. */
3738 extern void dwarf2out_window_save (const char *);
3740 /* Add a CFI to update the running total of the size of arguments pushed
3743 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
3745 /* Entry point for saving a register to the stack. */
3747 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
3749 /* Entry point for saving the return address in the stack. */
3751 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
3753 /* Entry point for saving the return address in a register. */
3755 extern void dwarf2out_return_reg (const char *, unsigned);
3757 /* In tree-inline.c */
3759 /* The type of a set of already-visited pointers. Functions for creating
3760 and manipulating it are declared in pointer-set.h */
3761 struct pointer_set_t;
3763 /* The type of a callback function for walking over tree structure. */
3765 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3766 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
3767 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
3769 /* In tree-dump.c */
3771 /* Different tree dump places. When you add new tree dump places,
3772 extend the DUMP_FILES array in tree-dump.c. */
3773 enum tree_dump_index
3775 TDI_none, /* No dump */
3776 TDI_tu, /* dump the whole translation unit. */
3777 TDI_class, /* dump class hierarchy. */
3778 TDI_original, /* dump each function before optimizing it */
3779 TDI_generic, /* dump each function after genericizing it */
3780 TDI_nested, /* dump each function after unnesting it */
3781 TDI_inlined, /* dump each function after inlining
3783 TDI_vcg, /* create a VCG graph file for each
3784 function's flowgraph. */
3785 TDI_tree_all, /* enable all the GENERIC/GIMPLE dumps. */
3786 TDI_rtl_all, /* enable all the RTL dumps. */
3787 TDI_ipa_all, /* enable all the IPA dumps. */
3789 TDI_cgraph, /* dump function call graph. */
3791 DFI_MIN, /* For now, RTL dumps are placed here. */
3792 DFI_sibling = DFI_MIN,
3822 DFI_branch_target_load,
3832 /* Bit masks to control dumping. Not all values are applicable to
3833 all dumps. Add new ones at the end. When you define new
3834 values, extend the DUMP_OPTIONS array in tree-dump.c */
3835 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3836 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3837 #define TDF_RAW (1 << 2) /* don't unparse the function */
3838 #define TDF_DETAILS (1 << 3) /* show more detailed info about
3840 #define TDF_STATS (1 << 4) /* dump various statistics about
3842 #define TDF_BLOCKS (1 << 5) /* display basic block boundaries */
3843 #define TDF_VOPS (1 << 6) /* display virtual operands */
3844 #define TDF_LINENO (1 << 7) /* display statement line numbers */
3845 #define TDF_UID (1 << 8) /* display decl UIDs */
3847 #define TDF_TREE (1 << 9) /* is a tree dump */
3848 #define TDF_RTL (1 << 10) /* is a RTL dump */
3849 #define TDF_IPA (1 << 11) /* is an IPA dump */
3851 typedef struct dump_info *dump_info_p;
3853 extern char *get_dump_file_name (enum tree_dump_index);
3854 extern int dump_flag (dump_info_p, int, tree);
3855 extern int dump_enabled_p (enum tree_dump_index);
3856 extern int dump_initialized_p (enum tree_dump_index);
3857 extern FILE *dump_begin (enum tree_dump_index, int *);
3858 extern void dump_end (enum tree_dump_index, FILE *);
3859 extern void dump_node (tree, int, FILE *);
3860 extern int dump_switch_p (const char *);
3861 extern const char *dump_flag_name (enum tree_dump_index);
3862 /* Assign the RTX to declaration. */
3864 extern void set_decl_rtl (tree, rtx);
3865 extern void set_decl_incoming_rtl (tree, rtx);
3867 /* Enum and arrays used for tree allocation stats.
3868 Keep in sync with tree.c:tree_node_kind_names. */
3891 extern int tree_node_counts[];
3892 extern int tree_node_sizes[];
3894 /* True if we are in gimple form and the actions of the folders need to
3895 be restricted. False if we are not in gimple form and folding is not
3896 restricted to creating gimple expressions. */
3897 extern bool in_gimple_form;
3899 /* In tree-ssa-threadupdate.c. */
3900 extern bool thread_through_all_blocks (void);
3902 /* In tree-gimple.c. */
3903 extern tree get_base_address (tree t);
3905 #endif /* GCC_TREE_H */
OSDN Git Service
