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"
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
42 /* Number of language-independent tree codes. */
43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern const char tree_code_type[];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns nonzero iff CLASS is not the tree code of a type. */
58 #define IS_NON_TYPE_CODE_CLASS(CLASS) (strchr ("xbcdr<12se", (CLASS)) != 0)
60 /* Returns nonzero iff CLASS is the tree-code class of an
63 #define IS_EXPR_CODE_CLASS(CLASS) (strchr ("<12ers", (CLASS)) != 0)
65 /* Returns nonzero iff NODE is an expression of some kind. */
67 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
69 /* Number of argument-words in each kind of tree-node. */
71 extern const unsigned char tree_code_length[];
72 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
74 /* Names of tree components. */
76 extern const char *const tree_code_name[];
78 /* Classify which part of the compiler has defined a given builtin function.
79 Note that we assume below that this is no more than two bits. */
88 /* Names for the above. */
89 extern const char *const built_in_class_names[4];
91 /* Codes that identify the various built in functions
92 so that expand_call can identify them quickly. */
94 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
95 enum built_in_function
97 #include "builtins.def"
99 /* Upper bound on non-language-specific builtins. */
104 /* Names for the above. */
105 extern const char *const built_in_names[(int) END_BUILTINS];
107 /* Helper macros for math builtins. */
109 #define BUILTIN_EXP10_P(FN) \
110 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
111 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
113 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
114 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
115 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
117 #define BUILTIN_SQRT_P(FN) \
118 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
120 #define BUILTIN_CBRT_P(FN) \
121 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
123 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
125 /* An array of _DECL trees for the above. */
126 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
127 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
129 /* The definition of tree nodes fills the next several pages. */
131 /* A tree node can represent a data type, a variable, an expression
132 or a statement. Each node has a TREE_CODE which says what kind of
133 thing it represents. Some common codes are:
134 INTEGER_TYPE -- represents a type of integers.
135 ARRAY_TYPE -- represents a type of pointer.
136 VAR_DECL -- represents a declared variable.
137 INTEGER_CST -- represents a constant integer value.
138 PLUS_EXPR -- represents a sum (an expression).
140 As for the contents of a tree node: there are some fields
141 that all nodes share. Each TREE_CODE has various special-purpose
142 fields as well. The fields of a node are never accessed directly,
143 always through accessor macros. */
145 /* Every kind of tree node starts with this structure,
146 so all nodes have these fields.
148 See the accessor macros, defined below, for documentation of the
152 struct tree_common GTY(())
156 union tree_ann_d *ann;
158 ENUM_BITFIELD(tree_code) code : 8;
160 unsigned side_effects_flag : 1;
161 unsigned constant_flag : 1;
162 unsigned addressable_flag : 1;
163 unsigned volatile_flag : 1;
164 unsigned readonly_flag : 1;
165 unsigned unsigned_flag : 1;
166 unsigned asm_written_flag: 1;
167 unsigned nowarning_flag : 1;
169 unsigned used_flag : 1;
170 unsigned nothrow_flag : 1;
171 unsigned static_flag : 1;
172 unsigned public_flag : 1;
173 unsigned private_flag : 1;
174 unsigned protected_flag : 1;
175 unsigned deprecated_flag : 1;
176 unsigned invariant_flag : 1;
178 unsigned lang_flag_0 : 1;
179 unsigned lang_flag_1 : 1;
180 unsigned lang_flag_2 : 1;
181 unsigned lang_flag_3 : 1;
182 unsigned lang_flag_4 : 1;
183 unsigned lang_flag_5 : 1;
184 unsigned lang_flag_6 : 1;
185 unsigned visited : 1;
188 /* The following table lists the uses of each of the above flags and
189 for which types of nodes they are defined. Note that expressions
195 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
196 ..._TYPE, IDENTIFIER_NODE.
197 In a STMT_EXPR, it means we want the result of the enclosed
199 CALL_EXPR_TAILCALL in CALL_EXPR
204 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
206 TREE_LIST or TREE_VEC
207 TREE_CONSTANT_OVERFLOW in
208 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
209 TREE_SYMBOL_REFERENCED in
212 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
213 TREE_LIST elements of a block's cleanup list.
216 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
217 TYPE_REF_CAN_ALIAS_ALL in
218 POINTER_TYPE, REFERENCE_TYPE
223 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
224 ??? and other expressions?
226 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
228 TREE_LIST or TREE_VEC
236 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
259 TREE_THIS_VOLATILE in
284 BIT_FIELD_REF_UNSIGNED in
286 SAVE_EXPR_NOPLACEHOLDER in
292 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
298 expressions, IDENTIFIER_NODE
303 CALL_EXPR, FUNCTION_DECL
315 Used in tree traversals to mark visited nodes.
328 /* Define accessors for the fields that all tree nodes have
329 (though some fields are not used for all kinds of nodes). */
331 /* The tree-code says what kind of node it is.
332 Codes are defined in tree.def. */
333 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
334 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
336 /* When checking is enabled, errors will be generated if a tree node
337 is accessed incorrectly. The macros abort with a fatal error. */
338 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
340 #define TREE_CHECK(T, CODE) __extension__ \
341 ({ const tree __t = (T); \
342 if (TREE_CODE (__t) != (CODE)) \
343 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
346 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
347 ({ const tree __t = (T); \
348 if (TREE_CODE (__t) != (CODE1) \
349 && TREE_CODE (__t) != (CODE2)) \
350 tree_check2_failed (__t, (CODE1), (CODE2), __FILE__, __LINE__, \
354 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
355 ({ const tree __t = (T); \
356 if (TREE_CODE (__t) != (CODE1) \
357 && TREE_CODE (__t) != (CODE2) \
358 && TREE_CODE (__t) != (CODE3)) \
359 tree_check3_failed (__t, (CODE1), (CODE2), (CODE3), __FILE__, \
360 __LINE__, __FUNCTION__); \
363 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
364 ({ const tree __t = (T); \
365 if (TREE_CODE (__t) != (CODE1) \
366 && TREE_CODE (__t) != (CODE2) \
367 && TREE_CODE (__t) != (CODE3) \
368 && TREE_CODE (__t) != (CODE4)) \
369 tree_check4_failed (__t, (CODE1), (CODE2), (CODE3), (CODE4), \
370 __FILE__, __LINE__, __FUNCTION__); \
373 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
374 ({ const tree __t = (T); \
375 if (TREE_CODE (__t) != (CODE1) \
376 && TREE_CODE (__t) != (CODE2) \
377 && TREE_CODE (__t) != (CODE3) \
378 && TREE_CODE (__t) != (CODE4) \
379 && TREE_CODE (__t) != (CODE5)) \
380 tree_check5_failed (__t, (CODE1), (CODE2), (CODE3), (CODE4), \
381 (CODE5), __FILE__, __LINE__, __FUNCTION__); \
384 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
385 ({ const tree __t = (T); \
386 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
387 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
391 /* These checks have to be special cased. */
392 #define EXPR_CHECK(T) __extension__ \
393 ({ const tree __t = (T); \
394 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
395 if (!IS_EXPR_CODE_CLASS (__c)) \
396 tree_class_check_failed (__t, 'E', __FILE__, __LINE__, \
400 /* These checks have to be special cased. */
401 #define NON_TYPE_CHECK(T) __extension__ \
402 ({ const tree __t = (T); \
403 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
404 if (!IS_NON_TYPE_CODE_CLASS (__c)) \
405 tree_class_check_failed (__t, 'T', __FILE__, __LINE__, \
409 #define EREF_NODE_CHECK(t) __extension__ \
410 ({ const tree __t = t; \
411 if (TREE_CODE (__t) != EPHI_NODE \
412 && TREE_CODE (__t) != EKILL_NODE \
413 && TREE_CODE (__t) != EUSE_NODE \
414 && TREE_CODE (__t) != EEXIT_NODE) \
415 tree_check_failed (__t, TREE_CODE (t), \
416 __FILE__, __LINE__, __FUNCTION__); \
419 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
420 (*({const tree __t = (T); \
421 const int __i = (I); \
422 if (TREE_CODE (__t) != TREE_VEC) \
423 tree_check_failed (__t, TREE_VEC, \
424 __FILE__, __LINE__, __FUNCTION__); \
425 if (__i < 0 || __i >= __t->vec.length) \
426 tree_vec_elt_check_failed (__i, __t->vec.length, \
427 __FILE__, __LINE__, __FUNCTION__); \
428 &__t->vec.a[__i]; }))
430 #define EPHI_NODE_ELT_CHECK(t, i) __extension__ \
431 (*({const tree __t = t; \
432 const int __i = (i); \
433 if (TREE_CODE (__t) != EPHI_NODE) \
434 tree_check_failed (__t, EPHI_NODE, \
435 __FILE__, __LINE__, __FUNCTION__); \
436 if (__i < 0 || __i >= __t->ephi.capacity) \
437 ephi_node_elt_check_failed (__i, __t->ephi.num_args, \
438 __FILE__, __LINE__, __FUNCTION__); \
439 &__t->ephi.a[__i]; }))
441 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
442 (*({const tree __t = t; \
443 const int __i = (i); \
444 if (TREE_CODE (__t) != PHI_NODE) \
445 tree_check_failed (__t, PHI_NODE, \
446 __FILE__, __LINE__, __FUNCTION__); \
447 if (__i < 0 || __i >= __t->phi.capacity) \
448 phi_node_elt_check_failed (__i, __t->phi.num_args, \
449 __FILE__, __LINE__, __FUNCTION__); \
450 &__t->phi.a[__i]; }))
452 /* Special checks for TREE_OPERANDs. */
453 #define TREE_OPERAND_CHECK(T, I) __extension__ \
454 (*({const tree __t = EXPR_CHECK (T); \
455 const int __i = (I); \
456 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
457 tree_operand_check_failed (__i, TREE_CODE (__t), \
458 __FILE__, __LINE__, __FUNCTION__); \
459 &__t->exp.operands[__i]; }))
461 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
462 (*({const tree __t = (T); \
463 const int __i = (I); \
464 if (TREE_CODE (__t) != CODE) \
465 tree_check_failed (__t, CODE, __FILE__, __LINE__, __FUNCTION__); \
466 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
467 tree_operand_check_failed (__i, (CODE), \
468 __FILE__, __LINE__, __FUNCTION__); \
469 &__t->exp.operands[__i]; }))
471 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
473 ({const tree __t = (T); \
474 const int __i = (I); \
475 if (TREE_CODE (__t) != (CODE)) \
476 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
477 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
478 tree_operand_check_failed (__i, (CODE), \
479 __FILE__, __LINE__, __FUNCTION__); \
480 &__t->exp.operands[__i]; }))
482 extern void tree_check_failed (const tree, enum tree_code,
483 const char *, int, const char *)
485 extern void tree_check2_failed (const tree, enum tree_code, enum tree_code,
486 const char *, int, const char *)
488 extern void tree_check3_failed (const tree, enum tree_code, enum tree_code,
489 enum tree_code, const char *, int,
492 extern void tree_check4_failed (const tree, enum tree_code, enum tree_code,
493 enum tree_code, enum tree_code,
494 const char *, int, const char *)
496 extern void tree_check5_failed (const tree, enum tree_code, enum tree_code,
497 enum tree_code, enum tree_code, enum tree_code,
498 const char *, int, const char *)
500 extern void tree_class_check_failed (const tree, int,
501 const char *, int, const char *)
503 extern void tree_vec_elt_check_failed (int, int, const char *,
506 extern void phi_node_elt_check_failed (int, int, const char *,
509 extern void ephi_node_elt_check_failed (int, int, const char *,
513 extern void tree_operand_check_failed (int, enum tree_code,
514 const char *, int, const char *)
517 #else /* not ENABLE_TREE_CHECKING, or not gcc */
519 #define TREE_CHECK(T, CODE) (T)
520 #define TREE_CHECK2(T, CODE1, CODE2) (T)
521 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
522 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
523 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
524 #define TREE_CLASS_CHECK(T, CODE) (T)
525 #define EXPR_CHECK(T) (T)
526 #define NON_TYPE_CHECK(T) (T)
527 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
528 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
529 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
530 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
531 #define EREF_NODE_CHECK(T) (T)
532 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
533 #define EPHI_NODE_ELT_CHECK(T, i) ((T)->ephi.a[i])
537 #define TREE_BLOCK(NODE) ((NODE)->exp.block)
539 #include "tree-check.h"
541 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't')
542 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd')
543 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c')
544 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's')
545 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
546 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
548 #define SET_OR_ARRAY_CHECK(T) \
549 TREE_CHECK2 (T, ARRAY_TYPE, SET_TYPE)
551 #define REC_OR_UNION_CHECK(T) \
552 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
554 #define NUMERICAL_TYPE_CHECK(T) \
555 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \
556 CHAR_TYPE, REAL_TYPE)
558 /* In all nodes that are expressions, this is the data type of the expression.
559 In POINTER_TYPE nodes, this is the type that the pointer points to.
560 In ARRAY_TYPE nodes, this is the type of the elements.
561 In VECTOR_TYPE nodes, this is the type of the elements. */
562 #define TREE_TYPE(NODE) ((NODE)->common.type)
564 /* Here is how primitive or already-canonicalized types' hash codes
566 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
568 /* A simple hash function for an arbitrary tree node. This must not be
569 used in hash tables which are saved to a PCH. */
570 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
572 /* Nodes are chained together for many purposes.
573 Types are chained together to record them for being output to the debugger
574 (see the function `chain_type').
575 Decls in the same scope are chained together to record the contents
577 Statement nodes for successive statements used to be chained together.
578 Often lists of things are represented by TREE_LIST nodes that
579 are chained together. */
581 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
583 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
584 that don't change the machine mode. */
586 #define STRIP_NOPS(EXP) \
587 while ((TREE_CODE (EXP) == NOP_EXPR \
588 || TREE_CODE (EXP) == CONVERT_EXPR \
589 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
590 && TREE_OPERAND (EXP, 0) != error_mark_node \
591 && (TYPE_MODE (TREE_TYPE (EXP)) \
592 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
593 (EXP) = TREE_OPERAND (EXP, 0)
595 /* Like STRIP_NOPS, but don't let the signedness change either. */
597 #define STRIP_SIGN_NOPS(EXP) \
598 while ((TREE_CODE (EXP) == NOP_EXPR \
599 || TREE_CODE (EXP) == CONVERT_EXPR \
600 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
601 && TREE_OPERAND (EXP, 0) != error_mark_node \
602 && (TYPE_MODE (TREE_TYPE (EXP)) \
603 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
604 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
605 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
606 (EXP) = TREE_OPERAND (EXP, 0)
608 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
610 #define STRIP_MAIN_TYPE_NOPS(EXP) \
611 while ((TREE_CODE (EXP) == NOP_EXPR \
612 || TREE_CODE (EXP) == CONVERT_EXPR \
613 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
614 && TREE_OPERAND (EXP, 0) != error_mark_node \
615 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
616 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
617 (EXP) = TREE_OPERAND (EXP, 0)
619 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
621 #define STRIP_TYPE_NOPS(EXP) \
622 while ((TREE_CODE (EXP) == NOP_EXPR \
623 || TREE_CODE (EXP) == CONVERT_EXPR \
624 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
625 && TREE_OPERAND (EXP, 0) != error_mark_node \
626 && (TREE_TYPE (EXP) \
627 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
628 (EXP) = TREE_OPERAND (EXP, 0)
630 /* Remove unnecessary type conversions according to
631 tree_ssa_useless_type_conversion. */
633 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
634 while (tree_ssa_useless_type_conversion (EXP)) \
635 EXP = TREE_OPERAND (EXP, 0)
637 /* Nonzero if TYPE represents an integral type. Note that we do not
638 include COMPLEX types here. */
640 #define INTEGRAL_TYPE_P(TYPE) \
641 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
642 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
644 /* Nonzero if TYPE represents a scalar floating-point type. */
646 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
648 /* Nonzero if TYPE represents a complex floating-point type. */
650 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
651 (TREE_CODE (TYPE) == COMPLEX_TYPE \
652 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
654 /* Nonzero if TYPE represents a floating-point type, including complex
655 floating-point types. */
657 #define FLOAT_TYPE_P(TYPE) \
658 (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE))
660 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
662 #define AGGREGATE_TYPE_P(TYPE) \
663 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
664 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
665 || TREE_CODE (TYPE) == SET_TYPE)
667 /* Nonzero if TYPE represents a pointer or reference type.
668 (It should be renamed to INDIRECT_TYPE_P.) */
670 #define POINTER_TYPE_P(TYPE) \
671 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
673 /* Nonzero if this type is a complete type. */
674 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
676 /* Nonzero if this type is the (possibly qualified) void type. */
677 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
679 /* Nonzero if this type is complete or is cv void. */
680 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
681 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
683 /* Nonzero if this type is complete or is an array with unspecified bound. */
684 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
685 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
687 /* Nonzero if TYPE represents a type. */
689 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
691 /* Define many boolean fields that all tree nodes have. */
693 /* In VAR_DECL nodes, nonzero means address of this is needed.
694 So it cannot be in a register.
695 In a FUNCTION_DECL, nonzero means its address is needed.
696 So it must be compiled even if it is an inline function.
697 In a FIELD_DECL node, it means that the programmer is permitted to
698 construct the address of this field. This is used for aliasing
699 purposes: see record_component_aliases.
700 In CONSTRUCTOR nodes, it means object constructed must be in memory.
701 In LABEL_DECL nodes, it means a goto for this label has been seen
702 from a place outside all binding contours that restore stack levels.
703 In ..._TYPE nodes, it means that objects of this type must
704 be fully addressable. This means that pieces of this
705 object cannot go into register parameters, for example.
706 In IDENTIFIER_NODEs, this means that some extern decl for this name
707 had its address taken. That matters for inline functions. */
708 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
710 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
712 /* In a VAR_DECL, nonzero means allocate static storage.
713 In a FUNCTION_DECL, nonzero if function has been defined.
714 In a CONSTRUCTOR, nonzero means allocate static storage.
716 ??? This is also used in lots of other nodes in unclear ways which
717 should be cleaned up some day. */
718 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
720 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
721 block's cleanup list, means that the pertinent cleanup should only be
722 executed if an exception is thrown, not on normal exit of its scope. */
723 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
725 /* In an expr node (usually a conversion) this means the node was made
726 implicitly and should not lead to any sort of warning. */
727 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
729 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
730 chain is via a `virtual' declaration. */
731 #define TREE_VIA_VIRTUAL(NODE) \
732 (TREE_CHECK2 (NODE, TREE_LIST, TREE_VEC)->common.static_flag)
734 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
735 there was an overflow in folding. This is distinct from
736 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
737 occur in constant expressions. */
738 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
740 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
741 this string as an argument. */
742 #define TREE_SYMBOL_REFERENCED(NODE) \
743 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
745 /* Nonzero in a pointer or reference type means the data pointed to
746 by this type can alias anything. */
747 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
748 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
750 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
751 there was an overflow in folding, and no warning has been issued
752 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
755 ??? Apparently, lots of code assumes this is defined in all
757 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
759 /* In a VAR_DECL or FUNCTION_DECL,
760 nonzero means name is to be accessible from outside this module.
761 In an IDENTIFIER_NODE, nonzero means an external declaration
762 accessible from outside this module was previously seen
763 for this name in an inner scope. */
764 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
766 /* In any expression, decl, or constant, nonzero means it has side effects or
767 reevaluation of the whole expression could produce a different value.
768 This is set if any subexpression is a function call, a side effect or a
769 reference to a volatile variable. In a ..._DECL, this is set only if the
770 declaration said `volatile'. This will never be set for a constant. */
771 #define TREE_SIDE_EFFECTS(NODE) \
772 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
774 /* In a LABEL_DECL, nonzero means this label had its address taken
775 and therefore can never be deleted and is a jump target for
777 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
779 /* Nonzero means this expression is volatile in the C sense:
780 its address should be of type `volatile WHATEVER *'.
781 In other words, the declared item is volatile qualified.
782 This is used in _DECL nodes and _REF nodes.
784 In a ..._TYPE node, means this type is volatile-qualified.
785 But use TYPE_VOLATILE instead of this macro when the node is a type,
786 because eventually we may make that a different bit.
788 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
789 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
791 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
792 nonzero means it may not be the lhs of an assignment. */
793 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
795 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
796 #define TREE_READONLY_DECL_P(NODE) (DECL_P (NODE) && TREE_READONLY (NODE))
798 /* Value of expression is constant. Always on in all ..._CST nodes. May
799 also appear in an expression or decl where the value is constant. */
800 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
802 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
803 #define DECL_UNSIGNED(NODE) (DECL_CHECK (NODE)->common.unsigned_flag)
805 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
806 #define BIT_FIELD_REF_UNSIGNED(NODE) \
807 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
809 /* In integral and pointer types, means an unsigned type. */
810 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
812 #define TYPE_TRAP_SIGNED(NODE) \
813 (flag_trapv && ! TYPE_UNSIGNED (NODE))
815 /* Nonzero in a VAR_DECL means assembler code has been written.
816 Nonzero in a FUNCTION_DECL means that the function has been compiled.
817 This is interesting in an inline function, since it might not need
818 to be compiled separately.
819 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
820 if the sdb debugging info for the type has been written.
821 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
822 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
824 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
826 /* Nonzero in a _DECL if the name is used in its scope.
827 Nonzero in an expr node means inhibit warning if value is unused.
828 In IDENTIFIER_NODEs, this means that some extern decl for this name
830 #define TREE_USED(NODE) ((NODE)->common.used_flag)
832 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
833 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
834 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
836 /* In a CALL_EXPR, means that the address of the return slot is part of the
838 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
840 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
841 thunked-to function. */
842 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag)
844 /* In a type, nonzero means that all objects of the type are guaranteed by the
845 language or front-end to be properly aligned, so we can indicate that a MEM
846 of this type is aligned at least to the alignment of the type, even if it
847 doesn't appear that it is. We see this, for example, in object-oriented
848 languages where a tag field may show this is an object of a more-aligned
849 variant of the more generic type.
851 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
853 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
855 /* Used in classes in C++. */
856 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
857 /* Used in classes in C++.
858 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
859 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
861 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
862 deprecated feature by __attribute__((deprecated)). */
863 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
865 /* Value of expression is function invariant. A strict subset of
866 TREE_CONSTANT, such an expression is constant over any one function
867 invocation, though not across different invocations. May appear in
868 any expression node. */
869 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
871 /* These flags are available for each language front end to use internally. */
872 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
873 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
874 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
875 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
876 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
877 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
878 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
880 /* Define additional fields and accessors for nodes representing constants. */
882 /* In an INTEGER_CST node. These two together make a 2-word integer.
883 If the data type is signed, the value is sign-extended to 2 words
884 even though not all of them may really be in use.
885 In an unsigned constant shorter than 2 words, the extra bits are 0. */
886 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
887 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
888 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
890 #define INT_CST_LT(A, B) \
891 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
892 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
893 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
895 #define INT_CST_LT_UNSIGNED(A, B) \
896 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
897 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
898 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
899 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
900 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
902 struct tree_int_cst GTY(())
904 struct tree_common common;
905 /* A sub-struct is necessary here because the function `const_hash'
906 wants to scan both words as a unit and taking the address of the
907 sub-struct yields the properly inclusive bounded pointer. */
908 struct tree_int_cst_lowhi {
909 unsigned HOST_WIDE_INT low;
914 /* In a REAL_CST node. struct real_value is an opaque entity, with
915 manipulators defined in real.h. We don't want tree.h depending on
916 real.h and transitively on tm.h. */
919 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
920 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
922 struct tree_real_cst GTY(())
924 struct tree_common common;
925 struct real_value * real_cst_ptr;
928 /* In a STRING_CST */
929 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
930 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
932 struct tree_string GTY(())
934 struct tree_common common;
939 /* In a COMPLEX_CST node. */
940 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
941 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
943 struct tree_complex GTY(())
945 struct tree_common common;
950 /* In a VECTOR_CST node. */
951 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
953 struct tree_vector GTY(())
955 struct tree_common common;
961 /* Define fields and accessors for some special-purpose tree nodes. */
963 #define IDENTIFIER_LENGTH(NODE) \
964 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
965 #define IDENTIFIER_POINTER(NODE) \
966 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
967 #define IDENTIFIER_HASH_VALUE(NODE) \
968 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
970 /* Translate a hash table identifier pointer to a tree_identifier
971 pointer, and vice versa. */
973 #define HT_IDENT_TO_GCC_IDENT(NODE) \
974 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
975 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
977 struct tree_identifier GTY(())
979 struct tree_common common;
980 struct ht_identifier id;
983 /* In a TREE_LIST node. */
984 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
985 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
987 struct tree_list GTY(())
989 struct tree_common common;
994 /* In a TREE_VEC node. */
995 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
996 #define TREE_VEC_END(NODE) \
997 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
999 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1001 struct tree_vec GTY(())
1003 struct tree_common common;
1005 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1008 /* Define fields and accessors for some nodes that represent expressions. */
1010 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1011 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1012 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1013 && integer_zerop (TREE_OPERAND (NODE, 0)))
1015 /* In a SAVE_EXPR node. */
1016 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1)
1017 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2)
1019 #define SAVE_EXPR_NOPLACEHOLDER(NODE) \
1020 (SAVE_EXPR_CHECK (NODE)->common.unsigned_flag)
1022 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
1023 both in normal code and in a handler. (Normally, in a handler, all
1024 SAVE_EXPRs are unsaved, meaning that their values are
1026 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
1028 /* In a RTL_EXPR node. */
1029 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0)
1030 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1)
1031 #define RTL_EXPR_ALT_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 2)
1033 /* In a WITH_CLEANUP_EXPR node. */
1034 #define WITH_CLEANUP_EXPR_RTL(NODE) \
1035 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2)
1037 /* In a CONSTRUCTOR node. */
1038 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
1040 /* In ordinary expression nodes. */
1041 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1042 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1044 /* In a LABELED_BLOCK_EXPR node. */
1045 #define LABELED_BLOCK_LABEL(NODE) \
1046 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
1047 #define LABELED_BLOCK_BODY(NODE) \
1048 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
1050 /* In an EXIT_BLOCK_EXPR node. */
1051 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
1052 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
1053 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
1055 /* In a LOOP_EXPR node. */
1056 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1058 /* The source location of this expression. Non-tree_exp nodes such as
1059 decls and constants can be shared among multiple locations, so
1061 #define EXPR_LOCUS(NODE) \
1062 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1063 ? (NODE)->exp.locus \
1064 : (location_t *)NULL)
1065 #define SET_EXPR_LOCUS(NODE, FROM) \
1066 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1067 #define EXPR_FILENAME(NODE) \
1068 (EXPR_CHECK (NODE)->exp.locus->file)
1069 #define EXPR_LINENO(NODE) \
1070 (EXPR_CHECK (NODE)->exp.locus->line)
1071 #ifdef USE_MAPPED_LOCATION
1072 #define EXPR_LOCATION(NODE) \
1073 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1074 ? (NODE)->exp.locus \
1076 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1078 #define EXPR_LOCATION(NODE) (*EXPR_LOCUS (NODE))
1079 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1082 /* In a TARGET_EXPR node. */
1083 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1084 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1085 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1087 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1089 /* SWITCH_EXPR accessors. These give access to the condition, body and
1090 original condition type (before any compiler conversions)
1091 of the switch statement, respectively. */
1092 #define SWITCH_COND(NODE) TREE_OPERAND ((NODE), 0)
1093 #define SWITCH_BODY(NODE) TREE_OPERAND ((NODE), 1)
1094 #define SWITCH_LABELS(NODE) TREE_OPERAND ((NODE), 2)
1096 /* CASE_LABEL accessors. These give access to the high and low values
1097 of a case label, respectively. */
1098 #define CASE_LOW(NODE) TREE_OPERAND ((NODE), 0)
1099 #define CASE_HIGH(NODE) TREE_OPERAND ((NODE), 1)
1100 #define CASE_LABEL(NODE) TREE_OPERAND ((NODE), 2)
1102 /* The operands of a BIND_EXPR. */
1103 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1104 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1105 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1107 /* GOTO_EXPR accessor. This gives access to the label associated with
1108 a goto statement. */
1109 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1111 /* ASM_STMT accessors. ASM_STRING returns a STRING_CST for the
1112 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1113 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1115 #define ASM_STRING(NODE) TREE_OPERAND ((NODE), 0)
1116 #define ASM_OUTPUTS(NODE) TREE_OPERAND ((NODE), 1)
1117 #define ASM_INPUTS(NODE) TREE_OPERAND ((NODE), 2)
1118 #define ASM_CLOBBERS(NODE) TREE_OPERAND ((NODE), 3)
1119 /* Nonzero if we want to create an ASM_INPUT instead of an
1120 ASM_OPERAND with no operands. */
1121 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1122 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1124 /* COND_EXPR accessors. */
1125 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1126 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1127 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1129 /* LABEL_EXPR accessor. This gives access to the label associated with
1130 the given label expression. */
1131 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1133 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1134 accessors for SSA operands. */
1136 /* CATCH_EXPR accessors. */
1137 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1138 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1140 /* EH_FILTER_EXPR accessors. */
1141 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1142 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1143 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1145 struct tree_exp GTY(())
1147 struct tree_common common;
1151 tree GTY ((special ("tree_exp"),
1152 desc ("TREE_CODE ((tree) &%0)")))
1156 /* SSA_NAME accessors. */
1158 /* Returns the variable being referenced. Once released, this is the
1159 only field that can be relied upon. */
1160 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1162 /* Returns the statement which defines this reference. Note that
1163 we use the same field when chaining SSA_NAME nodes together on
1164 the SSA_NAME freelist. */
1165 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1167 /* Returns the SSA version number of this SSA name. Note that in
1168 tree SSA, version numbers are not per variable and may be recycled. */
1169 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1171 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1172 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1174 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1175 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1177 /* Nonzero if this SSA_NAME expression is currently on the free list of
1178 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1179 has no meaning for an SSA_NAME. */
1180 #define SSA_NAME_IN_FREE_LIST(NODE) \
1181 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1183 /* Attributes for SSA_NAMEs for pointer-type variables. */
1184 #define SSA_NAME_PTR_INFO(N) \
1185 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1187 /* Get the value of this SSA_NAME, if available. */
1188 #define SSA_NAME_VALUE(N) \
1189 SSA_NAME_CHECK (N)->ssa_name.value_handle
1191 #ifndef GCC_BITMAP_H
1192 struct bitmap_head_def;
1195 /* Aliasing information for SSA_NAMEs representing pointer variables. */
1196 struct ptr_info_def GTY(())
1198 /* Nonzero if points-to analysis couldn't determine where this pointer
1200 unsigned int pt_anything : 1;
1202 /* Nonzero if this pointer is the result of a call to malloc. */
1203 unsigned int pt_malloc : 1;
1205 /* Nonzero if the value of this pointer escapes the current function. */
1206 unsigned int value_escapes_p : 1;
1208 /* Set of variables that this pointer may point to. */
1209 struct bitmap_head_def *pt_vars;
1211 /* If this pointer has been dereferenced, and points-to information is
1212 more precise than type-based aliasing, indirect references to this
1213 pointer will be represented by this memory tag, instead of the type
1214 tag computed by TBAA. */
1218 struct tree_ssa_name GTY(())
1220 struct tree_common common;
1222 /* _DECL wrapped by this SSA name. */
1225 /* SSA version number. */
1226 unsigned int version;
1228 /* Pointer attributes used for alias analysis. */
1229 struct ptr_info_def *ptr_info;
1231 /* Value for SSA name used by GVN. */
1232 tree GTY((skip)) value_handle;
1235 /* In a PHI_NODE node. */
1236 #define PHI_RESULT(NODE) PHI_NODE_CHECK (NODE)->phi.result
1238 /* Nonzero if the PHI node was rewritten by a previous pass through the
1240 #define PHI_REWRITTEN(NODE) PHI_NODE_CHECK (NODE)->phi.rewritten
1241 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1242 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1243 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1244 #define PHI_ARG_EDGE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).e
1245 #define PHI_ARG_DEF(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1246 #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero
1250 struct phi_arg_d GTY(())
1253 struct edge_def * GTY((skip (""))) e;
1257 struct tree_phi_node GTY(())
1259 struct tree_common common;
1264 /* Nonzero if the PHI node was rewritten by a previous pass through the
1268 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.capacity"))) a[1];
1272 struct varray_head_tag;
1274 struct tree_eref_common GTY(())
1276 struct tree_common common;
1278 /* SSAPRE: ID for the EREF. Used only for sorting erefs inside a
1282 /* SSAPRE: Name for the EREF. Used only for printing.*/
1285 /* SSAPRE: The statement associated with this expression reference. */
1288 /* SSAPRE: True if expression needs to be saved to a temporary. */
1289 unsigned int save:1;
1291 /* SSAPRE: True if expression needs to be reloaded from a temporary. */
1292 unsigned int reload:1;
1294 /* SSAPRE: Redundancy class of expression. */
1297 /* SSAPRE: Processed flag 1. */
1298 unsigned int processed:1;
1300 /* SSAPRE: True if expression is injured. */
1301 unsigned int injured:1;
1303 /* SSAPRE: Temporary assigned to this reference. */
1308 struct tree_euse_node GTY(())
1310 struct tree_eref_common common;
1312 /* SSAPRE: Definition for this use. */
1315 /* SSAPRE: True if this is an EPHI operand occurrence. */
1316 unsigned int op_occurrence:1;
1318 /* SSAPRE: True if expression was inserted as a PHI operand occurrence. */
1319 unsigned int inserted:1;
1321 /* SSAPRE: True if expression occurs as a lvalue. */
1322 unsigned int lval:1;
1324 struct ephi_arg_d GTY(())
1327 /* SSAPRE: True if this phi argument is injured. */
1328 unsigned int injured:1;
1330 /* SSAPRE: True if there is a real occurrence for this phi argument. */
1331 unsigned int has_real_use:1;
1333 /* SSAPRE: True if delayed renaming is required on this phi argument. */
1334 unsigned int delayed_rename:1;
1336 /* SSAPRE: Processed 2 flag for this phi argument. */
1337 unsigned int processed2:1;
1339 /* SSAPRE: True if this operand stops forward movement. */
1340 unsigned int stops:1;
1342 /* SSAPRE: Definition of this phi operand. */
1345 /* SSAPRE: Phi predecessor for this phi operand. */
1348 struct edge_def * GTY((skip (""))) e;
1350 struct tree_ephi_node GTY(())
1352 struct tree_eref_common common;
1354 /* SSAPRE: True if PHI is downsafe. */
1355 unsigned int downsafe:1;
1357 /* SSAPRE: True if PHI is cant_be_avail. */
1358 unsigned int cant_be_avail:1;
1360 /* SSAPRE: True if PHI is dead. */
1361 unsigned int dead:1;
1363 /* SSAPRE: True if PHI is pointless or identical to some value. */
1364 unsigned int identity:1;
1366 /* SSAPRE: True if replacing occurrence known for ESSA minimization. */
1367 unsigned int rep_occur_known:1;
1369 /* SSAPRE: True if PHI is pointless, but is also injured. */
1370 unsigned int ident_injured:1;
1372 /* SSAPRE: True if this PHI stops forward movement. */
1373 unsigned int stops:1;
1375 /* SSAPRE: If PHI's replacing occurrence is known, this is it. */
1378 /* SSAPRE: Uses of this ephi. */
1379 struct varray_head_tag *uses;
1383 struct ephi_arg_d GTY ((length ("((tree)&%h)->ephi.capacity"))) a[1];
1386 /* In both EPHI's and EUSES */
1387 #define EREF_PROCESSED(NODE) EREF_NODE_CHECK (NODE)->eref.processed
1388 #define EREF_ID(NODE) EREF_NODE_CHECK (NODE)->eref.id
1389 #define EREF_NAME(NODE) EREF_NODE_CHECK (NODE)->eref.name
1390 #define EREF_STMT(NODE) EREF_NODE_CHECK (NODE)->eref.stmt
1391 #define EREF_RELOAD(NODE) EREF_NODE_CHECK (NODE)->eref.reload
1392 #define EREF_SAVE(NODE) EREF_NODE_CHECK (NODE)->eref.save
1393 #define EREF_CLASS(NODE) EREF_NODE_CHECK (NODE)->eref.class
1394 #define EREF_INJURED(NODE) EREF_NODE_CHECK (NODE)->eref.injured
1395 #define EREF_TEMP(NODE) EREF_NODE_CHECK (NODE)->eref.temp
1397 /* In a EUSE_NODE node. */
1398 #define EUSE_DEF(NODE) EUSE_NODE_CHECK (NODE)->euse.def
1399 #define EUSE_PHIOP(NODE) EUSE_NODE_CHECK (NODE)->euse.op_occurrence
1400 #define EUSE_INSERTED(NODE) EUSE_NODE_CHECK (NODE)->euse.inserted
1401 #define EUSE_LVAL(NODE) EUSE_NODE_CHECK (NODE)->euse.lval
1403 /* In a EPHI_NODE node. */
1404 #define EPHI_NUM_ARGS(NODE) EPHI_NODE_CHECK (NODE)->ephi.num_args
1405 #define EPHI_ARG_CAPACITY(NODE) EPHI_NODE_CHECK (NODE)->ephi.capacity
1406 #define EPHI_ARG_ELT(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I)
1407 #define EPHI_ARG_EDGE(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).e
1408 #define EPHI_ARG_PRED(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).pred
1409 #define EPHI_ARG_DEF(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).def
1410 #define EPHI_ARG_INJURED(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).injured
1411 #define EPHI_ARG_DELAYED_RENAME(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).delayed_rename
1412 #define EPHI_ARG_HAS_REAL_USE(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).has_real_use
1413 #define EPHI_ARG_STOPS(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).stops
1414 #define EPHI_ARG_PROCESSED2(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).processed2
1415 #define EPHI_IDENTITY(NODE) EPHI_NODE_CHECK (NODE)->ephi.identity
1416 #define EPHI_IDENT_INJURED(NODE) EPHI_NODE_CHECK (NODE)->ephi.ident_injured
1418 #define EPHI_REP_OCCUR_KNOWN(NODE) EPHI_NODE_CHECK (NODE)->ephi.rep_occur_known
1419 #define EPHI_IDENTICAL_TO(NODE) EPHI_NODE_CHECK (NODE)->ephi.identical_to
1420 #define EPHI_DOWNSAFE(NODE) EPHI_NODE_CHECK (NODE)->ephi.downsafe
1421 #define EPHI_CANT_BE_AVAIL(NODE) EPHI_NODE_CHECK (NODE)->ephi.cant_be_avail
1422 #define EPHI_DEAD(NODE) EPHI_NODE_CHECK (NODE)->ephi.dead
1423 #define EPHI_USES(NODE) EPHI_NODE_CHECK (NODE)->ephi.uses
1424 #define EPHI_STOPS(NODE) EPHI_NODE_CHECK (NODE)->ephi.stops
1426 /* In a BLOCK node. */
1427 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1428 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1429 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1430 /* Note: when changing this, make sure to find the places
1431 that use chainon or nreverse. */
1432 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1433 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1434 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1436 /* Nonzero means that this block is prepared to handle exceptions
1437 listed in the BLOCK_VARS slot. */
1438 #define BLOCK_HANDLER_BLOCK(NODE) \
1439 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1441 /* An index number for this block. These values are not guaranteed to
1442 be unique across functions -- whether or not they are depends on
1443 the debugging output format in use. */
1444 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1446 /* If block reordering splits a lexical block into discontiguous
1447 address ranges, we'll make a copy of the original block.
1449 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1450 In that case, we have one source block that has been replicated
1451 (through inlining or unrolling) into many logical blocks, and that
1452 these logical blocks have different physical variables in them.
1454 In this case, we have one logical block split into several
1455 non-contiguous address ranges. Most debug formats can't actually
1456 represent this idea directly, so we fake it by creating multiple
1457 logical blocks with the same variables in them. However, for those
1458 that do support non-contiguous regions, these allow the original
1459 logical block to be reconstructed, along with the set of address
1462 One of the logical block fragments is arbitrarily chosen to be
1463 the ORIGIN. The other fragments will point to the origin via
1464 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1465 be null. The list of fragments will be chained through
1466 BLOCK_FRAGMENT_CHAIN from the origin. */
1468 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1469 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1471 struct tree_block GTY(())
1473 struct tree_common common;
1475 unsigned handler_block_flag : 1;
1476 unsigned abstract_flag : 1;
1477 unsigned block_num : 30;
1482 tree abstract_origin;
1483 tree fragment_origin;
1484 tree fragment_chain;
1487 /* Define fields and accessors for nodes representing data types. */
1489 /* See tree.def for documentation of the use of these fields.
1490 Look at the documentation of the various ..._TYPE tree codes.
1492 Note that the type.values, type.minval, and type.maxval fields are
1493 overloaded and used for different macros in different kinds of types.
1494 Each macro must check to ensure the tree node is of the proper kind of
1495 type. Note also that some of the front-ends also overload these fields,
1496 so they must be checked as well. */
1498 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1499 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1500 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1501 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1502 #define TYPE_ORIG_SIZE_TYPE(NODE) (INTEGER_TYPE_CHECK (NODE)->type.values)
1503 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1504 #define TYPE_DOMAIN(NODE) (SET_OR_ARRAY_CHECK (NODE)->type.values)
1505 #define TYPE_FIELDS(NODE) (REC_OR_UNION_CHECK (NODE)->type.values)
1506 #define TYPE_METHODS(NODE) (REC_OR_UNION_CHECK (NODE)->type.maxval)
1507 #define TYPE_VFIELD(NODE) (REC_OR_UNION_CHECK (NODE)->type.minval)
1508 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1509 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1510 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1511 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1512 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1513 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1514 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1515 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1516 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1517 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1518 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1519 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1520 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1521 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1522 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1523 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1524 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1525 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1527 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1528 in the debugging output. We use this to describe a vector as a
1529 structure containing an array. */
1530 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1532 /* For aggregate types, information about this type, as a base type
1533 for itself. Used in a language-dependent way for types that are
1534 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
1535 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
1537 /* The (language-specific) typed-based alias set for this type.
1538 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1539 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1540 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1541 type can alias objects of any type. */
1542 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1544 /* Nonzero iff the typed-based alias set for this type has been
1546 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1548 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1550 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1552 /* The alignment necessary for objects of this type.
1553 The value is an int, measured in bits. */
1554 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1556 /* 1 if the alignment for this type was requested by "aligned" attribute,
1557 0 if it is the default for this type. */
1558 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1560 /* The alignment for NODE, in bytes. */
1561 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1563 /* If your language allows you to declare types, and you want debug info
1564 for them, then you need to generate corresponding TYPE_DECL nodes.
1565 These "stub" TYPE_DECL nodes have no name, and simply point at the
1566 type node. You then set the TYPE_STUB_DECL field of the type node
1567 to point back at the TYPE_DECL node. This allows the debug routines
1568 to know that the two nodes represent the same type, so that we only
1569 get one debug info record for them. */
1570 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1572 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1573 has BLKmode only because it lacks the alignment requirement for
1575 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1577 /* In an INTEGER_TYPE, it means the type represents a size. We use
1578 this both for validity checking and to permit optimizations that
1579 are unsafe for other types. Note that the C `size_t' type should
1580 *not* have this flag set. The `size_t' type is simply a typedef
1581 for an ordinary integer type that happens to be the type of an
1582 expression returned by `sizeof'; `size_t' has no special
1583 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1584 always actual sizes. */
1585 #define TYPE_IS_SIZETYPE(NODE) \
1586 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1588 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1589 pointer depressed. */
1590 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1591 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1593 /* Nonzero in a type considered volatile as a whole. */
1594 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1596 /* Means this type is const-qualified. */
1597 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1599 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1601 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1603 /* There is a TYPE_QUAL value for each type qualifier. They can be
1604 combined by bitwise-or to form the complete set of qualifiers for a
1607 #define TYPE_UNQUALIFIED 0x0
1608 #define TYPE_QUAL_CONST 0x1
1609 #define TYPE_QUAL_VOLATILE 0x2
1610 #define TYPE_QUAL_RESTRICT 0x4
1612 /* The set of type qualifiers for this type. */
1613 #define TYPE_QUALS(NODE) \
1614 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1615 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1616 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1618 /* These flags are available for each language front end to use internally. */
1619 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1620 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1621 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1622 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1623 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1624 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1625 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1627 /* Used to keep track of visited nodes in tree traversals. This is set to
1628 0 by copy_node and make_node. */
1629 #define TREE_VISITED(NODE) ((NODE)->common.visited)
1631 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1632 that distinguish string from array of char).
1633 If set in a SET_TYPE, indicates a bitstring type. */
1634 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1636 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1637 object of the given ARRAY_TYPE. This allows temporaries to be
1639 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1640 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
1642 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1643 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1644 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1646 /* Indicates that objects of this type must be initialized by calling a
1647 function when they are created. */
1648 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1649 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1651 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1652 the same way that the first union alternative would be passed. */
1653 #define TYPE_TRANSPARENT_UNION(NODE) \
1654 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1656 /* For an ARRAY_TYPE, indicates that it is not permitted to
1657 take the address of a component of the type. */
1658 #define TYPE_NONALIASED_COMPONENT(NODE) \
1659 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1661 /* Indicated that objects of this type should be laid out in as
1662 compact a way as possible. */
1663 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1667 struct tree_type GTY(())
1669 struct tree_common common;
1676 unsigned int precision : 9;
1677 ENUM_BITFIELD(machine_mode) mode : 7;
1679 unsigned string_flag : 1;
1680 unsigned no_force_blk_flag : 1;
1681 unsigned needs_constructing_flag : 1;
1682 unsigned transparent_union_flag : 1;
1683 unsigned packed_flag : 1;
1684 unsigned restrict_flag : 1;
1687 unsigned lang_flag_0 : 1;
1688 unsigned lang_flag_1 : 1;
1689 unsigned lang_flag_2 : 1;
1690 unsigned lang_flag_3 : 1;
1691 unsigned lang_flag_4 : 1;
1692 unsigned lang_flag_5 : 1;
1693 unsigned lang_flag_6 : 1;
1694 unsigned user_align : 1;
1699 union tree_type_symtab {
1700 int GTY ((tag ("0"))) address;
1701 char * GTY ((tag ("1"))) pointer;
1702 struct die_struct * GTY ((tag ("2"))) die;
1703 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1704 descbits ("2"))) symtab;
1712 HOST_WIDE_INT alias_set;
1713 /* Points to a structure whose details depend on the language in use. */
1714 struct lang_type *lang_specific;
1717 /* Define accessor macros for information about type inheritance
1720 A "basetype" means a particular usage of a data type for inheritance
1721 in another type. Each such basetype usage has its own "binfo"
1722 object to describe it. The binfo object is a TREE_VEC node.
1724 Inheritance is represented by the binfo nodes allocated for a
1725 given type. For example, given types C and D, such that D is
1726 inherited by C, 3 binfo nodes will be allocated: one for describing
1727 the binfo properties of C, similarly one for D, and one for
1728 describing the binfo properties of D as a base type for C.
1729 Thus, given a pointer to class C, one can get a pointer to the binfo
1730 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1732 /* The actual data type node being inherited in this basetype. */
1733 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1735 /* The offset where this basetype appears in its containing type.
1736 BINFO_OFFSET slot holds the offset (in bytes)
1737 from the base of the complete object to the base of the part of the
1738 object that is allocated on behalf of this `type'.
1739 This is always 0 except when there is multiple inheritance. */
1741 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1742 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1743 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1745 /* The virtual function table belonging to this basetype. Virtual
1746 function tables provide a mechanism for run-time method dispatching.
1747 The entries of a virtual function table are language-dependent. */
1749 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1750 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1752 /* The virtual functions in the virtual function table. This is
1753 a TREE_LIST that is used as an initial approximation for building
1754 a virtual function table for this basetype. */
1755 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1756 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1758 /* A vector of binfos for the direct basetypes inherited by this
1761 If this basetype describes type D as inherited in C, and if the
1762 basetypes of D are E and F, then this vector contains binfos for
1763 inheritance of E and F by C.
1765 ??? This could probably be done by just allocating the
1766 base types at the end of this TREE_VEC (instead of using
1767 another TREE_VEC). This would simplify the calculation
1768 of how many basetypes a given type had. */
1769 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1770 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1772 /* The number of basetypes for NODE. */
1773 #define BINFO_N_BASETYPES(NODE) \
1774 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1776 /* Accessor macro to get to the Nth basetype of this basetype. */
1777 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1778 #define TYPE_BINFO_BASETYPE(NODE,N) \
1779 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1781 /* For a BINFO record describing a virtual base class, i.e., one where
1782 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1783 base. The actual contents are language-dependent. In the C++
1784 front-end this field is an INTEGER_CST giving an offset into the
1785 vtable where the offset to the virtual base can be found. */
1786 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1788 /* Indicates the accesses this binfo has to its bases. The values are
1789 access_public_node, access_protected_node or access_private_node.
1790 If this array is not present, public access is implied. */
1791 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1792 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1794 /* Number of language independent elements in a binfo. Languages may
1795 add additional trailing elements. */
1797 #define BINFO_ELTS 7
1799 /* Slot used to build a chain that represents a use of inheritance.
1800 For example, if X is derived from Y, and Y is derived from Z,
1801 then this field can be used to link the binfo node for X to
1802 the binfo node for X's Y to represent the use of inheritance
1803 from X to Y. Similarly, this slot of the binfo node for X's Y
1804 can point to the Z from which Y is inherited (in X's inheritance
1805 hierarchy). In this fashion, one can represent and traverse specific
1806 uses of inheritance using the binfo nodes themselves (instead of
1807 consing new space pointing to binfo nodes).
1808 It is up to the language-dependent front-ends to maintain
1809 this information as necessary. */
1810 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1812 /* Define fields and accessors for nodes representing declared names. */
1814 /* Nonzero if DECL represents a decl. */
1815 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1817 /* Nonzero if DECL represents a variable for the SSA passes. */
1818 #define SSA_VAR_P(DECL) \
1819 (TREE_CODE (DECL) == VAR_DECL \
1820 || TREE_CODE (DECL) == PARM_DECL \
1821 || TREE_CODE (DECL) == RESULT_DECL \
1822 || (TREE_CODE (DECL) == SSA_NAME \
1823 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
1824 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
1825 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
1827 /* This is the name of the object as written by the user.
1828 It is an IDENTIFIER_NODE. */
1829 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1831 /* The name of the object as the assembler will see it (but before any
1832 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1833 as DECL_NAME. It is an IDENTIFIER_NODE. */
1834 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1836 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1837 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1839 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1840 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1842 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1843 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1844 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1846 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1847 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1848 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1849 semantics of using this macro, are different than saying:
1851 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1853 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1855 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1856 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1857 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1858 DECL_ASSEMBLER_NAME (DECL1)) \
1861 /* Records the section name in a section attribute. Used to pass
1862 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1863 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1865 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1866 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1867 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1868 points to either the FUNCTION_DECL for the containing function,
1869 the RECORD_TYPE or UNION_TYPE for the containing type, or
1870 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1872 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1873 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1874 /* In a DECL this is the field where attributes are stored. */
1875 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1876 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1877 byte containing the bit closest to the beginning of the structure. */
1878 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1879 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1880 field from DECL_FIELD_OFFSET. */
1881 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1882 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1883 if so, the type that was originally specified for it.
1884 TREE_TYPE may have been modified (in finish_struct). */
1885 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1886 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1887 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1889 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1890 /* This field is used to reference anything in decl.result and is meant only
1891 for use by the garbage collector. */
1892 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1893 /* In FUNCTION_DECL, holds the decl for the return value. */
1894 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1895 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1896 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1897 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1898 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1899 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1900 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1901 For a VAR_DECL, holds the initial value.
1902 For a PARM_DECL, not used--default
1903 values for parameters are encoded in the type of the function,
1904 not in the PARM_DECL slot.
1906 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1907 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1908 /* For a PARM_DECL, records the data type used to pass the argument,
1909 which may be different from the type seen in the program. */
1910 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1911 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1912 if nonzero, indicates that the field occupies the type. */
1913 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1914 /* These two fields describe where in the source code the declaration
1915 was. If the declaration appears in several places (as for a C
1916 function that is declared first and then defined later), this
1917 information should refer to the definition. */
1918 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1919 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1920 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1921 /* Holds the size of the datum, in bits, as a tree expression.
1922 Need not be constant. */
1923 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1924 /* Likewise for the size in bytes. */
1925 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1926 /* Holds the alignment required for the datum, in bits. */
1927 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1928 /* The alignment of NODE, in bytes. */
1929 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1930 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1931 DECL_FIELD_OFFSET which are known to be always zero.
1932 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1934 #define DECL_OFFSET_ALIGN(NODE) \
1935 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1936 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1937 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1938 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1939 /* 1 if the alignment for this type was requested by "aligned" attribute,
1940 0 if it is the default for this type. */
1941 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1942 /* Holds the machine mode corresponding to the declaration of a variable or
1943 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1945 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1946 /* Holds the RTL expression for the value of a variable or function.
1947 This value can be evaluated lazily for functions, variables with
1948 static storage duration, and labels. */
1949 #define DECL_RTL(NODE) \
1950 (DECL_CHECK (NODE)->decl.rtl \
1951 ? (NODE)->decl.rtl \
1952 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1953 /* Set the DECL_RTL for NODE to RTL. */
1954 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1955 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1956 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1957 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1958 NODE1, it will not be set for NODE2; this is a lazy copy. */
1959 #define COPY_DECL_RTL(NODE1, NODE2) \
1960 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1961 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1962 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1964 /* For PARM_DECL, holds an RTL for the stack slot or register
1965 where the data was actually passed. */
1966 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1968 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
1969 that describes the status of this function. */
1970 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1972 /* For FUNCTION_DECL, if it is built-in,
1973 this identifies which built-in operation it is. */
1974 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1976 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this is
1977 the approximate number of statements in this function. There is
1978 no need for this number to be exact; it is only used in various
1979 heuristics regarding optimization. */
1980 #define DECL_NUM_STMTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.i)
1982 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1983 Before the struct containing the FUNCTION_DECL is laid out,
1984 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1985 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1986 function. When the class is laid out, this pointer is changed
1987 to an INTEGER_CST node which is suitable for use as an index
1988 into the virtual function table. */
1989 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1991 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1992 which this FIELD_DECL is defined. This information is needed when
1993 writing debugging information about vfield and vbase decls for C++. */
1994 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1996 /* Every ..._DECL node gets a unique number. */
1997 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1999 /* For any sort of a ..._DECL node, this points to the original (abstract)
2000 decl node which this decl is an instance of, or else it is NULL indicating
2001 that this decl is not an instance of some other decl. For example,
2002 in a nested declaration of an inline function, this points back to the
2004 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
2006 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2007 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2008 #define DECL_ORIGIN(NODE) \
2009 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2011 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2012 inline instance of some original (abstract) decl from an inline function;
2013 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2014 nodes can also have their abstract origin set to themselves. */
2015 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2016 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2018 /* Nonzero if a _DECL means that the name of this decl should be ignored
2019 for symbolic debug purposes. */
2020 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
2022 /* Nonzero for a given ..._DECL node means that this node represents an
2023 "abstract instance" of the given declaration (e.g. in the original
2024 declaration of an inline function). When generating symbolic debugging
2025 information, we mustn't try to generate any address information for nodes
2026 marked as "abstract instances" because we don't actually generate
2027 any code or allocate any data space for such instances. */
2028 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
2030 /* Nonzero if a _DECL means that no warnings should be generated just
2031 because this decl is unused. */
2032 #define DECL_IN_SYSTEM_HEADER(NODE) \
2033 (DECL_CHECK (NODE)->decl.in_system_header_flag)
2035 /* Nonzero for a given ..._DECL node means that this node should be
2036 put in .common, if possible. If a DECL_INITIAL is given, and it
2037 is not error_mark_node, then the decl cannot be put in .common. */
2038 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
2040 /* Language-specific decl information. */
2041 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
2043 /* In a VAR_DECL or FUNCTION_DECL,
2044 nonzero means external reference:
2045 do not allocate storage, and refer to a definition elsewhere. */
2046 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
2048 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
2050 #define DEFAULT_INIT_PRIORITY 65535
2051 #define MAX_INIT_PRIORITY 65535
2052 #define MAX_RESERVED_INIT_PRIORITY 100
2055 nonzero means the detail info about this type is not dumped into stabs.
2056 Instead it will generate cross reference ('x') of names.
2057 This uses the same flag as DECL_EXTERNAL. */
2058 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2059 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
2061 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2062 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
2064 /* In LABEL_DECL nodes, nonzero means that an error message about
2065 jumping into such a binding contour has been printed for this label. */
2066 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
2068 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2069 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
2071 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
2072 static chain is not needed. */
2073 #define DECL_NO_STATIC_CHAIN(NODE) \
2074 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
2076 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2077 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2079 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2081 Also set in some languages for variables, etc., outside the normal
2082 lexical scope, such as class instance variables. */
2083 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
2085 /* Nonzero in a FUNCTION_DECL means this function can be substituted
2086 where it is called. */
2087 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
2089 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2090 such as via the `inline' keyword in C/C++. This flag controls the linkage
2091 semantics of 'inline'; whether or not the function is inlined is
2092 controlled by DECL_INLINE. */
2093 #define DECL_DECLARED_INLINE_P(NODE) \
2094 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
2096 /* In a VAR_DECL, nonzero if the decl is a register variable with
2097 an explicit asm specification. */
2098 #define DECL_HARD_REGISTER(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
2100 /* Value of the decls's visibility attribute */
2101 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility)
2103 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2104 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
2106 /* In a VAR_DECL, nonzero if the data should be allocated from
2107 thread-local storage. */
2108 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
2110 /* In a FUNCTION_DECL, the saved representation of the body of the
2111 entire function. Usually a COMPOUND_STMT, but in C++ this may also
2112 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
2113 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
2115 /* List of FUNCTION_DECLs inlined into this function's body. */
2116 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
2118 /* Nonzero in a FUNCTION_DECL means this function should be treated
2119 as if it were a malloc, meaning it returns a pointer that is
2121 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
2123 /* Nonzero in a FUNCTION_DECL means this function should be treated
2124 as "pure" function (like const function, but may read global memory). */
2125 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
2127 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2129 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
2131 /* In a LABEL_DECL, nonzero means label was defined inside a binding
2132 contour that restored a stack level and which is now exited. */
2133 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
2135 /* Unused in FUNCTION_DECL. */
2137 /* In a VAR_DECL that's static,
2138 nonzero if the space is in the text section. */
2139 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
2141 /* In a FUNCTION_DECL, nonzero means a built in function. */
2142 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2144 /* For a builtin function, identify which part of the compiler defined it. */
2145 #define DECL_BUILT_IN_CLASS(NODE) \
2146 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
2148 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2149 Used in FIELD_DECLs for vtable pointers.
2150 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2151 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
2153 /* Used to indicate that the linkage status of this DECL is not yet known,
2154 so it should not be output now. */
2155 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
2157 /* Used in PARM_DECLs whose type are unions to indicate that the
2158 argument should be passed in the same way that the first union
2159 alternative would be passed. */
2160 #define DECL_TRANSPARENT_UNION(NODE) \
2161 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
2163 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2164 at the beginning or end of execution. */
2165 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2166 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
2168 #define DECL_STATIC_DESTRUCTOR(NODE) \
2169 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
2171 /* Used to indicate that this DECL represents a compiler-generated entity. */
2172 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
2174 /* Used to indicate that this DECL has weak linkage. */
2175 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
2177 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2178 multiple translation units should be merged. */
2179 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
2181 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2182 not be put out unless it is needed in this translation unit.
2183 Entities like this are shared across translation units (like weak
2184 entities), but are guaranteed to be generated by any translation
2185 unit that needs them, and therefore need not be put out anywhere
2186 where they are not needed. DECL_COMDAT is just a hint to the
2187 back-end; it is up to front-ends which set this flag to ensure
2188 that there will never be any harm, other than bloat, in putting out
2189 something which is DECL_COMDAT. */
2190 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
2192 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2193 be instrumented with calls to support routines. */
2194 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2195 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
2197 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2198 disabled in this function. */
2199 #define DECL_NO_LIMIT_STACK(NODE) \
2200 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
2202 /* Additional flags for language-specific uses. */
2203 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
2204 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
2205 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
2206 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
2207 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
2208 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
2209 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
2210 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
2212 /* Used to indicate that the pointer to this DECL cannot be treated as
2213 an address constant. */
2214 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
2216 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2218 #define DECL_NONADDRESSABLE_P(NODE) \
2219 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
2221 /* Used to indicate an alias set for the memory pointed to by this
2222 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2223 pointer (or reference) type. */
2224 #define DECL_POINTER_ALIAS_SET(NODE) \
2225 (DECL_CHECK (NODE)->decl.pointer_alias_set)
2227 /* Used to store the alias_var for a DECL node. */
2228 #define DECL_PTA_ALIASVAR(NODE) \
2229 (DECL_CHECK (NODE)->decl.alias_var)
2231 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2232 dense, unique within any one function, and may be used to index arrays.
2233 If the value is -1, then no UID has been assigned. */
2234 #define LABEL_DECL_UID(NODE) \
2235 (LABEL_DECL_CHECK (NODE)->decl.pointer_alias_set)
2237 /* Nonzero if an alias set has been assigned to this declaration. */
2238 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2239 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2241 /* Nonzero for a decl which is at file scope. */
2242 #define DECL_FILE_SCOPE_P(EXP) \
2243 (! DECL_CONTEXT (EXP) \
2244 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2246 /* Nonzero for a decl that has been marked as needing a memory slot.
2247 NOTE: Never use this macro directly. It will give you incomplete
2248 information. Most of the time this bit will only be set after alias
2249 analysis in the tree optimizers. It's always better to call
2250 needs_to_live_in_memory instead. To mark memory variables use
2251 mark_call_clobbered. */
2252 #define DECL_NEEDS_TO_LIVE_IN_MEMORY_INTERNAL(DECL) \
2253 DECL_CHECK (DECL)->decl.needs_to_live_in_memory
2255 /* Nonzero for a decl that cgraph has decided should be inlined into
2256 at least one call site. It is not meaningful to look at this
2257 directly; always use cgraph_function_possibly_inlined_p. */
2258 #define DECL_POSSIBLY_INLINED(DECL) \
2259 FUNCTION_DECL_CHECK (DECL)->decl.possibly_inlined
2261 /* Enumerate visibility settings. */
2263 enum symbol_visibility
2266 VISIBILITY_INTERNAL,
2268 VISIBILITY_PROTECTED
2272 union alias_var_def;
2273 struct tree_decl GTY(())
2275 struct tree_common common;
2279 ENUM_BITFIELD(machine_mode) mode : 8;
2281 unsigned external_flag : 1;
2282 unsigned nonlocal_flag : 1;
2283 unsigned regdecl_flag : 1;
2284 unsigned inline_flag : 1;
2285 unsigned bit_field_flag : 1;
2286 unsigned virtual_flag : 1;
2287 unsigned ignored_flag : 1;
2288 unsigned abstract_flag : 1;
2290 unsigned in_system_header_flag : 1;
2291 unsigned common_flag : 1;
2292 unsigned defer_output : 1;
2293 unsigned transparent_union : 1;
2294 unsigned static_ctor_flag : 1;
2295 unsigned static_dtor_flag : 1;
2296 unsigned artificial_flag : 1;
2297 unsigned weak_flag : 1;
2299 unsigned non_addr_const_p : 1;
2300 unsigned no_instrument_function_entry_exit : 1;
2301 unsigned comdat_flag : 1;
2302 unsigned malloc_flag : 1;
2303 unsigned no_limit_stack : 1;
2304 ENUM_BITFIELD(built_in_class) built_in_class : 2;
2305 unsigned pure_flag : 1;
2307 unsigned non_addressable : 1;
2308 unsigned user_align : 1;
2309 unsigned uninlinable : 1;
2310 unsigned thread_local_flag : 1;
2311 unsigned declared_inline_flag : 1;
2312 unsigned seen_in_bind_expr : 1;
2313 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2315 unsigned lang_flag_0 : 1;
2316 unsigned lang_flag_1 : 1;
2317 unsigned lang_flag_2 : 1;
2318 unsigned lang_flag_3 : 1;
2319 unsigned lang_flag_4 : 1;
2320 unsigned lang_flag_5 : 1;
2321 unsigned lang_flag_6 : 1;
2322 unsigned lang_flag_7 : 1;
2324 unsigned needs_to_live_in_memory : 1;
2325 unsigned possibly_inlined : 1;
2326 /* 14 unused bits. */
2328 union tree_decl_u1 {
2329 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2330 DECL_FUNCTION_CODE. */
2331 enum built_in_function f;
2332 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2333 is used by language-dependent code. */
2335 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2337 struct tree_decl_u1_a {
2338 unsigned int align : 24;
2339 unsigned int off_align : 8;
2346 tree arguments; /* Also used for DECL_FIELD_OFFSET */
2347 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
2348 tree initial; /* Also used for DECL_QUALIFIER */
2349 tree abstract_origin;
2350 tree assembler_name;
2353 rtx rtl; /* RTL representation for object. */
2355 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
2356 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
2357 In PARM_DECL, holds an RTL for the stack slot
2358 of register where the data was actually passed.
2359 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
2360 union tree_decl_u2 {
2361 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
2362 rtx GTY ((tag ("PARM_DECL"))) r;
2363 tree GTY ((tag ("FIELD_DECL"))) t;
2364 int GTY ((tag ("VAR_DECL"))) i;
2365 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
2367 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
2370 /* In a FUNCTION_DECL, these are function data which is to be kept
2371 as long as FUNCTION_DECL is kept. */
2375 HOST_WIDE_INT pointer_alias_set;
2376 union alias_var_def *GTY ((skip(""))) alias_var;
2377 /* Points to a structure whose details depend on the language in use. */
2378 struct lang_decl *lang_specific;
2382 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2383 To reduce overhead, the nodes containing the statements are not trees.
2384 This avoids the overhead of tree_common on all linked list elements.
2386 Use the interface in tree-iterator.h to access this node. */
2388 #define STATEMENT_LIST_HEAD(NODE) \
2389 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2390 #define STATEMENT_LIST_TAIL(NODE) \
2391 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2393 struct tree_statement_list_node
2394 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
2396 struct tree_statement_list_node *prev;
2397 struct tree_statement_list_node *next;
2401 struct tree_statement_list
2404 struct tree_common common;
2405 struct tree_statement_list_node *head;
2406 struct tree_statement_list_node *tail;
2409 enum tree_node_structure_enum {
2432 /* Define the overall contents of a tree node.
2433 It may be any of the structures declared above
2434 for various types of node. */
2436 union tree_node GTY ((ptr_alias (union lang_tree_node),
2437 desc ("tree_node_structure (&%h)")))
2439 struct tree_common GTY ((tag ("TS_COMMON"))) common;
2440 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
2441 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
2442 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
2443 struct tree_string GTY ((tag ("TS_STRING"))) string;
2444 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
2445 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
2446 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
2447 struct tree_type GTY ((tag ("TS_TYPE"))) type;
2448 struct tree_list GTY ((tag ("TS_LIST"))) list;
2449 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
2450 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
2451 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
2452 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
2453 struct tree_eref_common GTY ((tag ("TS_EREF_NODE"))) eref;
2454 struct tree_ephi_node GTY ((tag ("TS_EPHI_NODE"))) ephi;
2455 struct tree_euse_node GTY ((tag ("TS_EUSE_NODE"))) euse;
2456 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
2457 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
2460 /* Standard named or nameless data types of the C compiler. */
2479 TI_INTEGER_MINUS_ONE,
2496 TI_COMPLEX_INTEGER_TYPE,
2497 TI_COMPLEX_FLOAT_TYPE,
2498 TI_COMPLEX_DOUBLE_TYPE,
2499 TI_COMPLEX_LONG_DOUBLE_TYPE,
2503 TI_LONG_DOUBLE_TYPE,
2507 TI_LONG_DOUBLE_PTR_TYPE,
2508 TI_INTEGER_PTR_TYPE,
2527 extern GTY(()) tree global_trees[TI_MAX];
2529 #define error_mark_node global_trees[TI_ERROR_MARK]
2531 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2532 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2533 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2534 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2535 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2537 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2538 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2539 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2540 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2541 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2543 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2544 #define integer_one_node global_trees[TI_INTEGER_ONE]
2545 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2546 #define size_zero_node global_trees[TI_SIZE_ZERO]
2547 #define size_one_node global_trees[TI_SIZE_ONE]
2548 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2549 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2550 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2552 /* Base access nodes. */
2553 #define access_public_node global_trees[TI_PUBLIC]
2554 #define access_protected_node global_trees[TI_PROTECTED]
2555 #define access_private_node global_trees[TI_PRIVATE]
2557 #define null_pointer_node global_trees[TI_NULL_POINTER]
2559 #define float_type_node global_trees[TI_FLOAT_TYPE]
2560 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2561 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2563 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
2564 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
2565 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
2566 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
2568 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2569 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2570 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2571 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2573 #define void_type_node global_trees[TI_VOID_TYPE]
2574 /* The C type `void *'. */
2575 #define ptr_type_node global_trees[TI_PTR_TYPE]
2576 /* The C type `const void *'. */
2577 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2578 /* The C type `size_t'. */
2579 #define size_type_node global_trees[TI_SIZE_TYPE]
2580 #define pid_type_node global_trees[TI_PID_TYPE]
2581 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2582 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2583 /* The C type `FILE *'. */
2584 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
2586 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
2587 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
2588 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
2590 /* The node that should be placed at the end of a parameter list to
2591 indicate that the function does not take a variable number of
2592 arguments. The TREE_VALUE will be void_type_node and there will be
2593 no TREE_CHAIN. Language-independent code should not assume
2594 anything else about this node. */
2595 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2597 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2598 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2600 /* An enumeration of the standard C integer types. These must be
2601 ordered so that shorter types appear before longer ones, and so
2602 that signed types appear before unsigned ones, for the correct
2603 functioning of interpret_integer() in c-lex.c. */
2604 enum integer_type_kind
2616 itk_unsigned_long_long,
2620 typedef enum integer_type_kind integer_type_kind;
2622 /* The standard C integer types. Use integer_type_kind to index into
2624 extern GTY(()) tree integer_types[itk_none];
2626 #define char_type_node integer_types[itk_char]
2627 #define signed_char_type_node integer_types[itk_signed_char]
2628 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2629 #define short_integer_type_node integer_types[itk_short]
2630 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2631 #define integer_type_node integer_types[itk_int]
2632 #define unsigned_type_node integer_types[itk_unsigned_int]
2633 #define long_integer_type_node integer_types[itk_long]
2634 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2635 #define long_long_integer_type_node integer_types[itk_long_long]
2636 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2638 /* Set to the default thread-local storage (tls) model to use. */
2641 TLS_MODEL_GLOBAL_DYNAMIC = 1,
2642 TLS_MODEL_LOCAL_DYNAMIC,
2643 TLS_MODEL_INITIAL_EXEC,
2644 TLS_MODEL_LOCAL_EXEC
2647 extern enum tls_model flag_tls_default;
2650 /* A pointer-to-function member type looks like:
2657 If __pfn is NULL, it is a NULL pointer-to-member-function.
2659 (Because the vtable is always the first thing in the object, we
2660 don't need its offset.) If the function is virtual, then PFN is
2661 one plus twice the index into the vtable; otherwise, it is just a
2662 pointer to the function.
2664 Unfortunately, using the lowest bit of PFN doesn't work in
2665 architectures that don't impose alignment requirements on function
2666 addresses, or that use the lowest bit to tell one ISA from another,
2667 for example. For such architectures, we use the lowest bit of
2668 DELTA instead of the lowest bit of the PFN, and DELTA will be
2671 enum ptrmemfunc_vbit_where_t
2673 ptrmemfunc_vbit_in_pfn,
2674 ptrmemfunc_vbit_in_delta
2677 #define NULL_TREE (tree) NULL
2679 extern GTY(()) tree frame_base_decl;
2680 extern tree decl_assembler_name (tree);
2682 /* Compute the number of bytes occupied by 'node'. This routine only
2683 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2685 extern size_t tree_size (tree);
2687 /* Lowest level primitive for allocating a node.
2688 The TREE_CODE is the only argument. Contents are initialized
2689 to zero except for a few of the common fields. */
2691 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
2692 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
2694 /* Make a copy of a node, with all the same contents. */
2696 extern tree copy_node_stat (tree MEM_STAT_DECL);
2697 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
2699 /* Make a copy of a chain of TREE_LIST nodes. */
2701 extern tree copy_list (tree);
2703 /* Make a TREE_VEC. */
2705 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
2706 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
2708 /* Tree nodes for SSA analysis. */
2710 extern tree make_phi_node (tree, int);
2711 extern void init_phinodes (void);
2712 extern void fini_phinodes (void);
2713 extern void release_phi_node (tree);
2714 #ifdef GATHER_STATISTICS
2715 extern void phinodes_print_statistics (void);
2718 extern void init_ssanames (void);
2719 extern void fini_ssanames (void);
2720 extern tree make_ssa_name (tree, tree);
2721 extern void release_ssa_name (tree);
2722 #ifdef GATHER_STATISTICS
2723 extern void ssanames_print_statistics (void);
2726 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2727 The name is supplied as a char *. */
2729 extern tree get_identifier (const char *);
2731 #if GCC_VERSION >= 3000
2732 #define get_identifier(str) \
2733 (__builtin_constant_p (str) \
2734 ? get_identifier_with_length ((str), strlen (str)) \
2735 : get_identifier (str))
2739 /* Identical to get_identifier, except that the length is assumed
2742 extern tree get_identifier_with_length (const char *, size_t);
2744 /* If an identifier with the name TEXT (a null-terminated string) has
2745 previously been referred to, return that node; otherwise return
2748 extern tree maybe_get_identifier (const char *);
2750 /* Construct various types of nodes. */
2752 #define build_int_2(LO, HI) \
2753 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2755 extern tree build (enum tree_code, tree, ...);
2756 extern tree build_nt (enum tree_code, ...);
2758 #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L
2759 /* Use preprocessor trickery to map "build" to "buildN" where N is the
2760 expected number of arguments. This is used for both efficiency (no
2761 varargs), and checking (verifying number of passed arguments). */
2762 #define build(code, ...) \
2763 _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__)
2764 #define _buildN1(BASE, X) _buildN2(BASE, X)
2765 #define _buildN2(BASE, X) BASE##X
2766 #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0)
2767 #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c
2770 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
2771 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
2772 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2773 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
2774 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
2775 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
2776 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
2777 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
2778 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
2779 tree MEM_STAT_DECL);
2780 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
2782 extern tree build_int_2_wide (unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2783 extern tree build_vector (tree, tree);
2784 extern tree build_constructor (tree, tree);
2785 extern tree build_real_from_int_cst (tree, tree);
2786 extern tree build_complex (tree, tree, tree);
2787 extern tree build_string (int, const char *);
2788 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
2789 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
2790 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2791 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
2792 extern tree build_block (tree, tree, tree, tree, tree);
2793 extern void annotate_with_file_line (tree, const char *, int);
2794 extern void annotate_with_locus (tree, location_t);
2795 extern tree build_empty_stmt (void);
2797 /* Construct various nodes representing data types. */
2799 extern tree make_signed_type (int);
2800 extern tree make_unsigned_type (int);
2801 extern void initialize_sizetypes (void);
2802 extern void set_sizetype (tree);
2803 extern void fixup_unsigned_type (tree);
2804 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
2805 extern tree build_pointer_type (tree);
2806 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
2807 extern tree build_reference_type (tree);
2808 extern tree build_vector_type_for_mode (tree, enum machine_mode);
2809 extern tree build_vector_type (tree innertype, int nunits);
2810 extern tree build_type_no_quals (tree);
2811 extern tree build_index_type (tree);
2812 extern tree build_index_2_type (tree, tree);
2813 extern tree build_array_type (tree, tree);
2814 extern tree build_function_type (tree, tree);
2815 extern tree build_function_type_list (tree, ...);
2816 extern tree build_method_type_directly (tree, tree, tree);
2817 extern tree build_method_type (tree, tree);
2818 extern tree build_offset_type (tree, tree);
2819 extern tree build_complex_type (tree);
2820 extern tree array_type_nelts (tree);
2822 extern tree value_member (tree, tree);
2823 extern tree purpose_member (tree, tree);
2824 extern tree binfo_member (tree, tree);
2826 extern int attribute_list_equal (tree, tree);
2827 extern int attribute_list_contained (tree, tree);
2828 extern int tree_int_cst_equal (tree, tree);
2829 extern int tree_int_cst_lt (tree, tree);
2830 extern int tree_int_cst_compare (tree, tree);
2831 extern int host_integerp (tree, int);
2832 extern HOST_WIDE_INT tree_low_cst (tree, int);
2833 extern int tree_int_cst_msb (tree);
2834 extern int tree_int_cst_sgn (tree);
2835 extern int tree_expr_nonnegative_p (tree);
2836 extern int rtl_expr_nonnegative_p (rtx);
2837 extern tree get_inner_array_type (tree);
2839 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2840 put the prototype here. Rtl.h does declare the prototype if
2841 tree.h had been included. */
2843 extern tree make_tree (tree, rtx);
2845 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2848 Such modified types already made are recorded so that duplicates
2851 extern tree build_type_attribute_variant (tree, tree);
2852 extern tree build_decl_attribute_variant (tree, tree);
2854 /* Structure describing an attribute and a function to handle it. */
2855 struct attribute_spec
2857 /* The name of the attribute (without any leading or trailing __),
2858 or NULL to mark the end of a table of attributes. */
2859 const char *const name;
2860 /* The minimum length of the list of arguments of the attribute. */
2861 const int min_length;
2862 /* The maximum length of the list of arguments of the attribute
2863 (-1 for no maximum). */
2864 const int max_length;
2865 /* Whether this attribute requires a DECL. If it does, it will be passed
2866 from types of DECLs, function return types and array element types to
2867 the DECLs, function types and array types respectively; but when
2868 applied to a type in any other circumstances, it will be ignored with
2869 a warning. (If greater control is desired for a given attribute,
2870 this should be false, and the flags argument to the handler may be
2871 used to gain greater control in that case.) */
2872 const bool decl_required;
2873 /* Whether this attribute requires a type. If it does, it will be passed
2874 from a DECL to the type of that DECL. */
2875 const bool type_required;
2876 /* Whether this attribute requires a function (or method) type. If it does,
2877 it will be passed from a function pointer type to the target type,
2878 and from a function return type (which is not itself a function
2879 pointer type) to the function type. */
2880 const bool function_type_required;
2881 /* Function to handle this attribute. NODE points to the node to which
2882 the attribute is to be applied. If a DECL, it should be modified in
2883 place; if a TYPE, a copy should be created. NAME is the name of the
2884 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2885 of the arguments (which may be NULL). FLAGS gives further information
2886 about the context of the attribute. Afterwards, the attributes will
2887 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2888 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2889 as well as in any other cases when the attributes should not be added
2890 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2891 applied to another type or DECL later may be returned;
2892 otherwise the return value should be NULL_TREE. This pointer may be
2893 NULL if no special handling is required beyond the checks implied
2894 by the rest of this structure. */
2895 tree (*const handler) (tree *node, tree name, tree args,
2896 int flags, bool *no_add_attrs);
2899 /* Flags that may be passed in the third argument of decl_attributes, and
2900 to handler functions for attributes. */
2901 enum attribute_flags
2903 /* The type passed in is the type of a DECL, and any attributes that
2904 should be passed in again to be applied to the DECL rather than the
2905 type should be returned. */
2906 ATTR_FLAG_DECL_NEXT = 1,
2907 /* The type passed in is a function return type, and any attributes that
2908 should be passed in again to be applied to the function type rather
2909 than the return type should be returned. */
2910 ATTR_FLAG_FUNCTION_NEXT = 2,
2911 /* The type passed in is an array element type, and any attributes that
2912 should be passed in again to be applied to the array type rather
2913 than the element type should be returned. */
2914 ATTR_FLAG_ARRAY_NEXT = 4,
2915 /* The type passed in is a structure, union or enumeration type being
2916 created, and should be modified in place. */
2917 ATTR_FLAG_TYPE_IN_PLACE = 8,
2918 /* The attributes are being applied by default to a library function whose
2919 name indicates known behavior, and should be silently ignored if they
2920 are not in fact compatible with the function type. */
2921 ATTR_FLAG_BUILT_IN = 16
2924 /* Default versions of target-overridable functions. */
2926 extern tree merge_decl_attributes (tree, tree);
2927 extern tree merge_type_attributes (tree, tree);
2928 extern void default_register_cpp_builtins (struct cpp_reader *);
2930 /* Split a list of declspecs and attributes into two. */
2932 extern void split_specs_attrs (tree, tree *, tree *);
2934 /* Strip attributes from a list of combined specs and attrs. */
2936 extern tree strip_attrs (tree);
2938 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2940 extern int valid_machine_attribute (tree, tree, tree, tree);
2942 /* Given a tree node and a string, return nonzero if the tree node is
2943 a valid attribute name for the string. */
2945 extern int is_attribute_p (const char *, tree);
2947 /* Given an attribute name and a list of attributes, return the list element
2948 of the attribute or NULL_TREE if not found. */
2950 extern tree lookup_attribute (const char *, tree);
2952 /* Given two attributes lists, return a list of their union. */
2954 extern tree merge_attributes (tree, tree);
2956 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2957 /* Given two Windows decl attributes lists, possibly including
2958 dllimport, return a list of their union . */
2959 extern tree merge_dllimport_decl_attributes (tree, tree);
2962 /* Check whether CAND is suitable to be returned from get_qualified_type
2963 (BASE, TYPE_QUALS). */
2965 extern bool check_qualified_type (tree, tree, int);
2967 /* Return a version of the TYPE, qualified as indicated by the
2968 TYPE_QUALS, if one exists. If no qualified version exists yet,
2969 return NULL_TREE. */
2971 extern tree get_qualified_type (tree, int);
2973 /* Like get_qualified_type, but creates the type if it does not
2974 exist. This function never returns NULL_TREE. */
2976 extern tree build_qualified_type (tree, int);
2978 /* Like build_qualified_type, but only deals with the `const' and
2979 `volatile' qualifiers. This interface is retained for backwards
2980 compatibility with the various front-ends; new code should use
2981 build_qualified_type instead. */
2983 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2984 build_qualified_type ((TYPE), \
2985 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2986 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2988 /* Make a copy of a type node. */
2990 extern tree build_type_copy (tree);
2992 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2993 fields. Optionally specify an alignment, and then lsy it out. */
2995 extern void finish_builtin_struct (tree, const char *,
2998 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2999 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3000 node, does nothing except for the first time. */
3002 extern void layout_type (tree);
3004 /* These functions allow a front-end to perform a manual layout of a
3005 RECORD_TYPE. (For instance, if the placement of subsequent fields
3006 depends on the placement of fields so far.) Begin by calling
3007 start_record_layout. Then, call place_field for each of the
3008 fields. Then, call finish_record_layout. See layout_type for the
3009 default way in which these functions are used. */
3011 typedef struct record_layout_info_s
3013 /* The RECORD_TYPE that we are laying out. */
3015 /* The offset into the record so far, in bytes, not including bits in
3018 /* The last known alignment of SIZE. */
3019 unsigned int offset_align;
3020 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3022 /* The alignment of the record so far, in bits. */
3023 unsigned int record_align;
3024 /* The alignment of the record so far, ignoring #pragma pack and
3025 __attribute__ ((packed)), in bits. */
3026 unsigned int unpacked_align;
3027 /* The previous field layed out. */
3029 /* The static variables (i.e., class variables, as opposed to
3030 instance variables) encountered in T. */
3031 tree pending_statics;
3032 /* Bits remaining in the current alignment group */
3033 int remaining_in_alignment;
3034 /* True if we've seen a packed field that didn't have normal
3035 alignment anyway. */
3036 int packed_maybe_necessary;
3037 } *record_layout_info;
3039 extern void set_lang_adjust_rli (void (*) (record_layout_info));
3040 extern record_layout_info start_record_layout (tree);
3041 extern tree bit_from_pos (tree, tree);
3042 extern tree byte_from_pos (tree, tree);
3043 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
3044 extern void normalize_offset (tree *, tree *, unsigned int);
3045 extern tree rli_size_unit_so_far (record_layout_info);
3046 extern tree rli_size_so_far (record_layout_info);
3047 extern void normalize_rli (record_layout_info);
3048 extern void place_field (record_layout_info, tree);
3049 extern void compute_record_mode (tree);
3050 extern void finish_record_layout (record_layout_info, int);
3052 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3053 return a canonicalized ..._TYPE node, so that duplicates are not made.
3054 How the hash code is computed is up to the caller, as long as any two
3055 callers that could hash identical-looking type nodes agree. */
3057 extern tree type_hash_canon (unsigned int, tree);
3059 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3060 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3061 fields. Call this only once for any given decl node.
3063 Second argument is the boundary that this field can be assumed to
3064 be starting at (in bits). Zero means it can be assumed aligned
3065 on any boundary that may be needed. */
3067 extern void layout_decl (tree, unsigned);
3069 /* Return the mode for data of a given size SIZE and mode class CLASS.
3070 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3071 The value is BLKmode if no other mode is found. This is like
3072 mode_for_size, but is passed a tree. */
3074 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
3076 /* Return an expr equal to X but certainly not valid as an lvalue. */
3078 extern tree non_lvalue (tree);
3079 extern tree pedantic_non_lvalue (tree);
3081 extern tree convert (tree, tree);
3082 extern unsigned int expr_align (tree);
3083 extern tree expr_first (tree);
3084 extern tree expr_last (tree);
3085 extern tree expr_only (tree);
3086 extern tree size_in_bytes (tree);
3087 extern HOST_WIDE_INT int_size_in_bytes (tree);
3088 extern tree bit_position (tree);
3089 extern HOST_WIDE_INT int_bit_position (tree);
3090 extern tree byte_position (tree);
3091 extern HOST_WIDE_INT int_byte_position (tree);
3093 /* Define data structures, macros, and functions for handling sizes
3094 and the various types used to represent sizes. */
3098 SIZETYPE, /* Normal representation of sizes in bytes. */
3099 SSIZETYPE, /* Signed representation of sizes in bytes. */
3100 USIZETYPE, /* Unsigned representation of sizes in bytes. */
3101 BITSIZETYPE, /* Normal representation of sizes in bits. */
3102 SBITSIZETYPE, /* Signed representation of sizes in bits. */
3103 UBITSIZETYPE, /* Unsigned representation of sizes in bits. */
3106 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
3108 #define sizetype sizetype_tab[(int) SIZETYPE]
3109 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
3110 #define ssizetype sizetype_tab[(int) SSIZETYPE]
3111 #define usizetype sizetype_tab[(int) USIZETYPE]
3112 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
3113 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
3115 extern tree size_binop (enum tree_code, tree, tree);
3116 extern tree size_diffop (tree, tree);
3117 extern tree size_int_wide (HOST_WIDE_INT, enum size_type_kind);
3118 extern tree size_int_type_wide (HOST_WIDE_INT, tree);
3120 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
3121 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
3122 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
3123 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
3124 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
3126 extern tree round_up (tree, int);
3127 extern tree round_down (tree, int);
3128 extern tree get_pending_sizes (void);
3129 extern void put_pending_size (tree);
3130 extern void put_pending_sizes (tree);
3132 /* Type for sizes of data-type. */
3134 #define BITS_PER_UNIT_LOG \
3135 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3136 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3137 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3139 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
3140 extern unsigned int maximum_field_alignment;
3142 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
3143 extern unsigned int set_alignment;
3145 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3146 by making the last node in X point to Y.
3147 Returns X, except if X is 0 returns Y. */
3149 extern tree chainon (tree, tree);
3151 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3153 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3154 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3156 /* Return the last tree node in a chain. */
3158 extern tree tree_last (tree);
3160 /* Reverse the order of elements in a chain, and return the new head. */
3162 extern tree nreverse (tree);
3164 /* Returns the length of a chain of nodes
3165 (number of chain pointers to follow before reaching a null pointer). */
3167 extern int list_length (tree);
3169 /* Returns the number of FIELD_DECLs in a type. */
3171 extern int fields_length (tree);
3173 /* Given an initializer INIT, return TRUE if INIT is zero or some
3174 aggregate of zeros. Otherwise return FALSE. */
3176 extern bool initializer_zerop (tree);
3178 extern void categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *);
3179 extern HOST_WIDE_INT count_type_elements (tree);
3180 extern int mostly_zeros_p (tree);
3182 /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */
3184 extern void add_var_to_bind_expr (tree, tree);
3186 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
3188 extern int integer_zerop (tree);
3190 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
3192 extern int integer_onep (tree);
3194 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3195 all of whose significant bits are 1. */
3197 extern int integer_all_onesp (tree);
3199 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3200 exactly one bit 1. */
3202 extern int integer_pow2p (tree);
3204 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3205 with a nonzero value. */
3207 extern int integer_nonzerop (tree);
3209 /* staticp (tree x) is nonzero if X is a reference to data allocated
3210 at a fixed address in memory. */
3212 extern int staticp (tree);
3214 /* save_expr (EXP) returns an expression equivalent to EXP
3215 but it can be used multiple times within context CTX
3216 and only evaluate EXP once. */
3218 extern tree save_expr (tree);
3220 /* Look inside EXPR and into any simple arithmetic operations. Return
3221 the innermost non-arithmetic node. */
3223 extern tree skip_simple_arithmetic (tree);
3225 /* Returns the index of the first non-tree operand for CODE, or the number
3226 of operands if all are trees. */
3228 extern int first_rtl_op (enum tree_code);
3230 /* Return which tree structure is used by T. */
3232 enum tree_node_structure_enum tree_node_structure (tree);
3234 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
3235 can be used multiple times and will evaluate EXP in its entirety
3238 extern tree unsave_expr (tree);
3240 /* Reset EXP in place so that it can be expanded again. Does not
3241 recurse into subtrees. */
3243 extern void unsave_expr_1 (tree);
3245 /* Return 0 if it is safe to evaluate EXPR multiple times,
3246 return 1 if it is safe if EXPR is unsaved afterward, or
3247 return 2 if it is completely unsafe. */
3248 extern int unsafe_for_reeval (tree);
3250 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
3251 or offset that depends on a field within a record.
3253 Note that we only allow such expressions within simple arithmetic
3256 extern bool contains_placeholder_p (tree);
3258 /* This macro calls the above function but short-circuits the common
3259 case of a constant to save time. Also check for null. */
3261 #define CONTAINS_PLACEHOLDER_P(EXP) \
3262 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
3264 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
3265 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
3268 extern bool type_contains_placeholder_p (tree);
3270 /* Return 1 if EXP contains any expressions that produce cleanups for an
3271 outer scope to deal with. Used by fold. */
3273 extern int has_cleanups (tree);
3275 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3276 return a tree with all occurrences of references to F in a
3277 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
3278 contains only arithmetic expressions. */
3280 extern tree substitute_in_expr (tree, tree, tree);
3282 /* This macro calls the above function but short-circuits the common
3283 case of a constant to save time and also checks for NULL. */
3285 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
3286 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
3288 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3289 for it within OBJ, a tree that is an object or a chain of references. */
3291 extern tree substitute_placeholder_in_expr (tree, tree);
3293 /* This macro calls the above function but short-circuits the common
3294 case of a constant to save time and also checks for NULL. */
3296 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
3297 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
3298 : substitute_placeholder_in_expr (EXP, OBJ))
3300 /* variable_size (EXP) is like save_expr (EXP) except that it
3301 is for the special case of something that is part of a
3302 variable size for a data type. It makes special arrangements
3303 to compute the value at the right time when the data type
3304 belongs to a function parameter. */
3306 extern tree variable_size (tree);
3308 /* Given a type T, force elaboration of any SAVE_EXPRs used in the definition
3311 extern void force_type_save_exprs (tree);
3313 /* stabilize_reference (EXP) returns a reference equivalent to EXP
3314 but it can be used multiple times
3315 and only evaluate the subexpressions once. */
3317 extern tree stabilize_reference (tree);
3319 /* Subroutine of stabilize_reference; this is called for subtrees of
3320 references. Any expression with side-effects must be put in a SAVE_EXPR
3321 to ensure that it is only evaluated once. */
3323 extern tree stabilize_reference_1 (tree);
3325 /* Return EXP, stripped of any conversions to wider types
3326 in such a way that the result of converting to type FOR_TYPE
3327 is the same as if EXP were converted to FOR_TYPE.
3328 If FOR_TYPE is 0, it signifies EXP's type. */
3330 extern tree get_unwidened (tree, tree);
3332 /* Return OP or a simpler expression for a narrower value
3333 which can be sign-extended or zero-extended to give back OP.
3334 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3335 or 0 if the value should be sign-extended. */
3337 extern tree get_narrower (tree, int *);
3339 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
3340 look for nested component-refs or array-refs at constant positions
3341 and find the ultimate containing object, which is returned. */
3343 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3344 tree *, enum machine_mode *, int *, int *);
3346 /* Return 1 if T is an expression that get_inner_reference handles. */
3348 extern int handled_component_p (tree);
3350 /* Given a DECL or TYPE, return the scope in which it was declared, or
3351 NUL_TREE if there is no containing scope. */
3353 extern tree get_containing_scope (tree);
3355 /* Return the FUNCTION_DECL which provides this _DECL with its context,
3357 extern tree decl_function_context (tree);
3359 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
3360 this _DECL with its context, or zero if none. */
3361 extern tree decl_type_context (tree);
3363 /* Return 1 if EXPR is the real constant zero. */
3364 extern int real_zerop (tree);
3366 /* Declare commonly used variables for tree structure. */
3368 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
3369 Zero means allow extended lvalues. */
3371 extern int pedantic_lvalues;
3373 /* Nonzero means can safely call expand_expr now;
3374 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
3376 extern int immediate_size_expand;
3378 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
3380 extern GTY(()) tree current_function_decl;
3382 /* Nonzero means a FUNC_BEGIN label was emitted. */
3383 extern GTY(()) tree current_function_func_begin_label;
3385 /* A DECL for the current file-scope context. When using IMA, this heads a
3386 chain of FILE_DECLs; currently only C uses it. */
3388 extern GTY(()) tree current_file_decl;
3390 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
3392 extern int all_types_permanent;
3394 /* Exit a binding level. This function is provided by each language
3396 extern tree poplevel (int, int, int);
3398 /* Declare a predefined function. Return the declaration. This function is
3399 provided by each language frontend. */
3400 extern tree builtin_function (const char *, tree, int, enum built_in_class,
3401 const char *, tree);
3404 extern unsigned crc32_string (unsigned, const char *);
3405 extern void clean_symbol_name (char *);
3406 extern tree get_file_function_name_long (const char *);
3407 extern tree get_set_constructor_bits (tree, char *, int);
3408 extern tree get_set_constructor_bytes (tree, unsigned char *, int);
3409 extern tree get_callee_fndecl (tree);
3410 extern void change_decl_assembler_name (tree, tree);
3411 extern int type_num_arguments (tree);
3412 extern tree lhd_unsave_expr_now (tree);
3413 extern bool is_essa_node (tree);
3414 extern bool associative_tree_code (enum tree_code);
3415 extern bool commutative_tree_code (enum tree_code);
3420 extern void expand_fixups (rtx);
3421 extern tree expand_start_stmt_expr (int);
3422 extern tree expand_end_stmt_expr (tree);
3423 extern void expand_expr_stmt (tree);
3424 extern void expand_expr_stmt_value (tree, int, int);
3425 extern int warn_if_unused_value (tree);
3426 extern void expand_decl_init (tree);
3427 extern void clear_last_expr (void);
3428 extern void expand_label (tree);
3429 extern void expand_goto (tree);
3430 extern void expand_asm (tree, int);
3431 extern void expand_start_cond (tree, int);
3432 extern void expand_end_cond (void);
3433 extern void expand_start_else (void);
3434 extern void expand_start_elseif (tree);
3436 extern void expand_stack_alloc (tree, tree);
3437 extern rtx expand_stack_save (void);
3438 extern void expand_stack_restore (tree);
3439 extern void expand_return (tree);
3440 extern void expand_start_bindings_and_block (int, tree);
3441 #define expand_start_bindings(flags) \
3442 expand_start_bindings_and_block(flags, NULL_TREE)
3443 extern void expand_end_bindings (tree, int, int);
3444 extern void warn_about_unused_variables (tree);
3445 extern void start_cleanup_deferral (void);
3446 extern void end_cleanup_deferral (void);
3447 extern int is_body_block (tree);
3449 extern int conditional_context (void);
3450 extern struct nesting * current_nesting_level (void);
3451 extern tree last_cleanup_this_contour (void);
3452 extern void expand_start_case (int, tree, tree, const char *);
3453 extern void expand_end_case_type (tree, tree);
3454 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
3455 extern int add_case_node (tree, tree, tree, tree *, bool);
3456 extern int pushcase (tree, tree (*) (tree, tree), tree, tree *);
3457 extern int pushcase_range (tree, tree, tree (*) (tree, tree), tree, tree *);
3458 extern void using_eh_for_cleanups (void);
3460 /* In fold-const.c */
3462 /* Fold constants as much as possible in an expression.
3463 Returns the simplified expression.
3464 Acts only on the top level of the expression;
3465 if the argument itself cannot be simplified, its
3466 subexpressions are not changed. */
3468 extern tree fold (tree);
3469 extern tree fold_initializer (tree);
3470 extern tree fold_convert (tree, tree);
3471 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
3472 extern tree fold_abs_const (tree, tree);
3474 extern int force_fit_type (tree, int);
3475 extern int add_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 int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3479 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3480 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3481 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3482 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3483 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3484 HOST_WIDE_INT, unsigned int,
3485 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3486 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3487 HOST_WIDE_INT, unsigned int,
3488 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3489 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3490 HOST_WIDE_INT, unsigned int,
3491 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3492 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3493 HOST_WIDE_INT, unsigned int,
3494 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3496 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
3497 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
3498 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
3499 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
3502 enum operand_equal_flag
3508 extern int operand_equal_p (tree, tree, unsigned int);
3510 extern tree omit_one_operand (tree, tree, tree);
3511 extern tree invert_truthvalue (tree);
3512 extern tree nondestructive_fold_unary_to_constant (enum tree_code, tree, tree);
3513 extern tree nondestructive_fold_binary_to_constant (enum tree_code, tree, tree, tree);
3514 extern tree fold_read_from_constant_string (tree);
3515 extern tree int_const_binop (enum tree_code, tree, tree, int);
3516 extern tree build_fold_addr_expr (tree);
3517 extern tree build_fold_addr_expr_with_type (tree, tree);
3518 extern tree build_fold_indirect_ref (tree);
3521 extern tree fold_builtin (tree);
3522 extern enum built_in_function builtin_mathfn_code (tree);
3523 extern tree build_function_call_expr (tree, tree);
3524 extern tree mathfn_built_in (tree, enum built_in_function fn);
3525 extern tree strip_float_extensions (tree);
3526 extern tree simplify_builtin (tree, int);
3527 extern tree c_strlen (tree, int);
3530 extern tree strip_float_extensions (tree);
3533 extern void record_component_aliases (tree);
3534 extern HOST_WIDE_INT get_alias_set (tree);
3535 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3536 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3537 extern int readonly_fields_p (tree);
3538 extern int objects_must_conflict_p (tree, tree);
3541 extern int really_constant_p (tree);
3542 extern int int_fits_type_p (tree, tree);
3543 extern bool variably_modified_type_p (tree);
3544 extern int tree_log2 (tree);
3545 extern int tree_floor_log2 (tree);
3546 extern int simple_cst_equal (tree, tree);
3547 extern unsigned int iterative_hash_expr (tree, unsigned int);
3548 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
3549 extern int type_list_equal (tree, tree);
3550 extern int chain_member (tree, tree);
3551 extern tree type_hash_lookup (unsigned int, tree);
3552 extern void type_hash_add (unsigned int, tree);
3553 extern int simple_cst_list_equal (tree, tree);
3554 extern void dump_tree_statistics (void);
3555 extern void expand_function_end (void);
3556 extern void expand_function_start (tree, int);
3557 extern void expand_pending_sizes (tree);
3558 extern void recompute_tree_invarant_for_addr_expr (tree);
3559 extern bool needs_to_live_in_memory (tree);
3560 extern tree make_vector (enum machine_mode, tree, int);
3561 extern tree reconstruct_complex_type (tree, tree);
3563 extern int real_onep (tree);
3564 extern int real_twop (tree);
3565 extern int real_minus_onep (tree);
3566 extern void init_ttree (void);
3567 extern void build_common_tree_nodes (int);
3568 extern void build_common_tree_nodes_2 (int);
3569 extern tree build_range_type (tree, tree, tree);
3572 extern void setjmp_protect_args (void);
3573 extern void setjmp_protect (tree);
3574 extern void expand_main_function (void);
3575 extern void init_dummy_function_start (void);
3576 extern void expand_dummy_function_end (void);
3577 extern void init_function_for_compilation (void);
3578 extern void allocate_struct_function (tree);
3579 extern void init_function_start (tree);
3580 extern void assign_parms (tree);
3581 extern void put_var_into_stack (tree, int);
3582 extern void flush_addressof (tree);
3583 extern void setjmp_vars_warning (tree);
3584 extern void setjmp_args_warning (void);
3585 extern void init_temp_slots (void);
3586 extern void combine_temp_slots (void);
3587 extern void free_temp_slots (void);
3588 extern void pop_temp_slots (void);
3589 extern void push_temp_slots (void);
3590 extern void preserve_temp_slots (rtx);
3591 extern void preserve_rtl_expr_temps (tree);
3592 extern int aggregate_value_p (tree, tree);
3593 extern void free_temps_for_rtl_expr (tree);
3594 extern void instantiate_virtual_regs (tree, rtx);
3595 extern void unshare_all_rtl (tree, rtx);
3596 extern void push_function_context (void);
3597 extern void pop_function_context (void);
3598 extern void push_function_context_to (tree);
3599 extern void pop_function_context_from (tree);
3601 /* In print-rtl.c */
3603 extern void print_rtl (FILE *, rtx);
3606 /* In print-tree.c */
3607 extern void debug_tree (tree);
3609 extern void print_node (FILE *, const char *, tree, int);
3610 extern void print_node_brief (FILE *, const char *, tree, int);
3611 extern void indent_to (FILE *, int);
3615 extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx);
3616 extern void check_max_integer_computation_mode (tree);
3619 extern void start_sequence_for_rtl_expr (tree);
3620 extern rtx emit_line_note (location_t);
3624 /* Nonzero if this is a call to a `const' function. */
3626 /* Nonzero if this is a call to a `volatile' function. */
3627 #define ECF_NORETURN 2
3628 /* Nonzero if this is a call to malloc or a related function. */
3629 #define ECF_MALLOC 4
3630 /* Nonzero if it is plausible that this is a call to alloca. */
3631 #define ECF_MAY_BE_ALLOCA 8
3632 /* Nonzero if this is a call to a function that won't throw an exception. */
3633 #define ECF_NOTHROW 16
3634 /* Nonzero if this is a call to setjmp or a related function. */
3635 #define ECF_RETURNS_TWICE 32
3636 /* Nonzero if this is a call to `longjmp'. */
3637 #define ECF_LONGJMP 64
3638 /* Nonzero if this is a syscall that makes a new process in the image of
3640 #define ECF_SIBCALL 128
3641 /* Nonzero if this is a call to "pure" function (like const function,
3642 but may read memory. */
3643 #define ECF_PURE 256
3644 /* Nonzero if this is a call to a function that returns with the stack
3645 pointer depressed. */
3646 #define ECF_SP_DEPRESSED 512
3647 /* Nonzero if this call is known to always return. */
3648 #define ECF_ALWAYS_RETURN 1024
3649 /* Create libcall block around the call. */
3650 #define ECF_LIBCALL_BLOCK 2048
3652 extern int flags_from_decl_or_type (tree);
3653 extern int call_expr_flags (tree);
3655 extern int setjmp_call_p (tree);
3656 extern bool alloca_call_p (tree);
3660 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3661 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3662 it should be modified in place; if a TYPE, a copy should be created
3663 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3664 information, in the form of a bitwise OR of flags in enum attribute_flags
3665 from tree.h. Depending on these flags, some attributes may be
3666 returned to be applied at a later stage (for example, to apply
3667 a decl attribute to the declaration rather than to its type). */
3668 extern tree decl_attributes (tree *, tree, int);
3670 /* In integrate.c */
3671 extern void set_decl_abstract_flags (tree, int);
3672 extern void set_decl_origin_self (tree);
3674 /* In stor-layout.c */
3675 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
3676 extern void fixup_signed_type (tree);
3677 extern void internal_reference_types (void);
3678 extern unsigned int update_alignment_for_field (record_layout_info, tree,
3681 extern void make_decl_rtl (tree, const char *);
3682 extern void make_decl_one_only (tree);
3683 extern int supports_one_only (void);
3684 extern void variable_section (tree, int);
3685 enum tls_model decl_tls_model (tree);
3686 extern void resolve_unique_section (tree, int, int);
3687 extern void mark_referenced (tree);
3688 extern void mark_decl_referenced (tree);
3689 extern void notice_global_symbol (tree);
3692 extern void emit_nop (void);
3693 extern void expand_computed_goto (tree);
3694 extern bool parse_output_constraint (const char **, int, int, int,
3695 bool *, bool *, bool *);
3696 extern bool parse_input_constraint (const char **, int, int, int, int,
3697 const char * const *, bool *, bool *);
3698 extern void expand_asm_operands (tree, tree, tree, tree, int, location_t);
3699 extern void expand_asm_expr (tree);
3700 extern bool asm_op_is_mem_input (tree, tree);
3701 extern tree resolve_asm_operand_names (tree, tree, tree);
3702 extern int any_pending_cleanups (void);
3703 extern void init_stmt_for_function (void);
3704 extern void expand_start_target_temps (void);
3705 extern void expand_end_target_temps (void);
3706 extern void expand_elseif (tree);
3707 extern void save_stack_pointer (void);
3708 extern void expand_decl (tree);
3709 extern int expand_decl_cleanup (tree, tree);
3710 extern int expand_decl_cleanup_eh (tree, tree, int);
3711 extern void expand_anon_union_decl (tree, tree, tree);
3712 extern int containing_blocks_have_cleanups_or_stack_level (void);
3714 /* In gimplify.c. */
3715 extern tree create_artificial_label (void);
3716 extern void gimplify_function_tree (tree);
3717 extern const char *get_name (tree);
3718 extern tree unshare_expr (tree);
3719 extern void sort_case_labels (tree);
3721 /* If KIND=='I', return a suitable global initializer (constructor) name.
3722 If KIND=='D', return a suitable global clean-up (destructor) name. */
3723 extern tree get_file_function_name (int);
3725 /* Interface of the DWARF2 unwind info support. */
3727 /* Generate a new label for the CFI info to refer to. */
3729 extern char *dwarf2out_cfi_label (void);
3731 /* Entry point to update the canonical frame address (CFA). */
3733 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
3735 /* Add the CFI for saving a register window. */
3737 extern void dwarf2out_window_save (const char *);
3739 /* Add a CFI to update the running total of the size of arguments pushed
3742 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
3744 /* Entry point for saving a register to the stack. */
3746 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
3748 /* Entry point for saving the return address in the stack. */
3750 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
3752 /* Entry point for saving the return address in a register. */
3754 extern void dwarf2out_return_reg (const char *, unsigned);
3756 /* The type of a callback function for walking over tree structure. */
3758 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3759 tree walk_tree (tree*, walk_tree_fn, void*, void*);
3760 tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
3762 /* In tree-dump.c */
3764 /* Different tree dump places. When you add new tree dump places,
3765 extend the DUMP_FILES array in tree-dump.c. */
3766 enum tree_dump_index
3768 TDI_none, /* No dump */
3769 TDI_tu, /* dump the whole translation unit. */
3770 TDI_class, /* dump class hierarchy. */
3771 TDI_original, /* dump each function before optimizing it */
3772 TDI_generic, /* dump each function after genericizing it */
3773 TDI_nested, /* dump each function after unnesting it */
3774 TDI_inlined, /* dump each function after inlining
3776 TDI_vcg, /* create a VCG graph file for each
3777 function's flowgraph. */
3778 TDI_xml, /* dump function call graph. */
3779 TDI_all, /* enable all the dumps. */
3783 /* Bit masks to control tree dumping. Not all values are applicable to
3784 all tree dumps. Add new ones at the end. When you define new
3785 values, extend the DUMP_OPTIONS array in tree-dump.c */
3786 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3787 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3788 #define TDF_RAW (1 << 2) /* don't unparse the function */
3789 #define TDF_DETAILS (1 << 3) /* show more detailed info about
3791 #define TDF_STATS (1 << 4) /* dump various statistics about
3793 #define TDF_BLOCKS (1 << 5) /* display basic block boundaries */
3794 #define TDF_VOPS (1 << 6) /* display virtual operands */
3795 #define TDF_LINENO (1 << 7) /* display statement line numbers */
3796 #define TDF_UID (1 << 8) /* display decl UIDs */
3799 typedef struct dump_info *dump_info_p;
3801 extern int dump_flag (dump_info_p, int, tree);
3802 extern int dump_enabled_p (enum tree_dump_index);
3803 extern FILE *dump_begin (enum tree_dump_index, int *);
3804 extern void dump_end (enum tree_dump_index, FILE *);
3805 extern void dump_node (tree, int, FILE *);
3806 extern int dump_switch_p (const char *);
3807 extern const char *dump_flag_name (enum tree_dump_index);
3808 /* Assign the RTX to declaration. */
3810 extern void set_decl_rtl (tree, rtx);
3811 extern void set_decl_incoming_rtl (tree, rtx);
3813 /* Redefine abort to report an internal error w/o coredump, and
3814 reporting the location of the error in the source file. This logic
3815 is duplicated in rtl.h and tree.h because every file that needs the
3816 special abort includes one or both. toplev.h gets too few files,
3817 system.h gets too many. */
3819 extern void fancy_abort (const char *, int, const char *)
3821 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3823 /* Enum and arrays used for tree allocation stats.
3824 Keep in sync with tree.c:tree_node_kind_names. */
3846 extern int tree_node_counts[];
3847 extern int tree_node_sizes[];
3849 /* True if we are in gimple form and the actions of the folders need to
3850 be restricted. False if we are not in gimple form and folding is not
3851 restricted to creating gimple expressions. */
3852 extern bool in_gimple_form;
3854 #endif /* GCC_TREE_H */