1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
27 #include "statistics.h"
30 /* Codes of tree nodes */
32 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
37 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
43 /* Number of language-independent tree codes. */
44 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
46 /* Indexed by enum tree_code, contains a character which is
47 `<' for a comparison expression, `1', for a unary arithmetic
48 expression, `2' for a binary arithmetic expression, `e' for
49 other types of expressions, `r' for a reference, `c' for a
50 constant, `d' for a decl, `t' for a type, `s' for a statement,
51 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
53 #define MAX_TREE_CODES 256
54 extern const char tree_code_type[];
55 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
57 /* Returns nonzero iff CLASS is not the tree code of a type. */
59 #define IS_NON_TYPE_CODE_CLASS(CLASS) ((CLASS) != 't')
61 /* Returns nonzero iff CLASS is the tree-code class of an
64 #define IS_EXPR_CODE_CLASS(CLASS) (strchr ("<12ers", (CLASS)) != 0)
66 /* Returns nonzero iff NODE is an expression of some kind. */
68 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
70 /* Number of argument-words in each kind of tree-node. */
72 extern const unsigned char tree_code_length[];
73 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
75 /* Names of tree components. */
77 extern const char *const tree_code_name[];
79 /* A garbage collected vector of trees. */
83 /* Classify which part of the compiler has defined a given builtin function.
84 Note that we assume below that this is no more than two bits. */
93 /* Names for the above. */
94 extern const char *const built_in_class_names[4];
96 /* Codes that identify the various built in functions
97 so that expand_call can identify them quickly. */
99 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
100 enum built_in_function
102 #include "builtins.def"
104 /* Upper bound on non-language-specific builtins. */
109 /* Names for the above. */
110 extern const char *const built_in_names[(int) END_BUILTINS];
112 /* Helper macros for math builtins. */
114 #define BUILTIN_EXP10_P(FN) \
115 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
116 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
118 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
119 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
120 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
122 #define BUILTIN_SQRT_P(FN) \
123 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
125 #define BUILTIN_CBRT_P(FN) \
126 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
128 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
130 /* An array of _DECL trees for the above. */
131 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
132 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
134 /* The definition of tree nodes fills the next several pages. */
136 /* A tree node can represent a data type, a variable, an expression
137 or a statement. Each node has a TREE_CODE which says what kind of
138 thing it represents. Some common codes are:
139 INTEGER_TYPE -- represents a type of integers.
140 ARRAY_TYPE -- represents a type of pointer.
141 VAR_DECL -- represents a declared variable.
142 INTEGER_CST -- represents a constant integer value.
143 PLUS_EXPR -- represents a sum (an expression).
145 As for the contents of a tree node: there are some fields
146 that all nodes share. Each TREE_CODE has various special-purpose
147 fields as well. The fields of a node are never accessed directly,
148 always through accessor macros. */
150 /* Every kind of tree node starts with this structure,
151 so all nodes have these fields.
153 See the accessor macros, defined below, for documentation of the
157 struct tree_common GTY(())
161 union tree_ann_d *ann;
163 ENUM_BITFIELD(tree_code) code : 8;
165 unsigned side_effects_flag : 1;
166 unsigned constant_flag : 1;
167 unsigned addressable_flag : 1;
168 unsigned volatile_flag : 1;
169 unsigned readonly_flag : 1;
170 unsigned unsigned_flag : 1;
171 unsigned asm_written_flag: 1;
172 unsigned nowarning_flag : 1;
174 unsigned used_flag : 1;
175 unsigned nothrow_flag : 1;
176 unsigned static_flag : 1;
177 unsigned public_flag : 1;
178 unsigned private_flag : 1;
179 unsigned protected_flag : 1;
180 unsigned deprecated_flag : 1;
181 unsigned invariant_flag : 1;
183 unsigned lang_flag_0 : 1;
184 unsigned lang_flag_1 : 1;
185 unsigned lang_flag_2 : 1;
186 unsigned lang_flag_3 : 1;
187 unsigned lang_flag_4 : 1;
188 unsigned lang_flag_5 : 1;
189 unsigned lang_flag_6 : 1;
190 unsigned visited : 1;
193 /* The following table lists the uses of each of the above flags and
194 for which types of nodes they are defined. Note that expressions
200 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
201 ..._TYPE, IDENTIFIER_NODE.
202 In a STMT_EXPR, it means we want the result of the enclosed
204 CALL_EXPR_TAILCALL in CALL_EXPR
209 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
212 TREE_CONSTANT_OVERFLOW in
213 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
214 TREE_SYMBOL_REFERENCED in
217 TARGET_EXPR, WITH_CLEANUP_EXPR
220 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
221 TYPE_REF_CAN_ALIAS_ALL in
222 POINTER_TYPE, REFERENCE_TYPE
227 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
228 ??? and other expressions?
230 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
233 TYPE_CACHED_VALUES_P in
235 SAVE_EXPR_RESOLVED_P in
242 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
245 PARM_DECL, RESULT_DECL
267 TREE_THIS_VOLATILE in
292 BIT_FIELD_REF_UNSIGNED in
298 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
304 expressions, IDENTIFIER_NODE
309 CALL_EXPR, FUNCTION_DECL
315 INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
324 Used in tree traversals to mark visited nodes.
334 ... any expr or decl node
337 /* Define accessors for the fields that all tree nodes have
338 (though some fields are not used for all kinds of nodes). */
340 /* The tree-code says what kind of node it is.
341 Codes are defined in tree.def. */
342 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
343 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
345 /* When checking is enabled, errors will be generated if a tree node
346 is accessed incorrectly. The macros abort with a fatal error. */
347 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
349 #define TREE_CHECK(T, CODE) __extension__ \
350 ({ const tree __t = (T); \
351 if (TREE_CODE (__t) != (CODE)) \
352 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
356 #define TREE_NOT_CHECK(T, CODE) __extension__ \
357 ({ const tree __t = (T); \
358 if (TREE_CODE (__t) == (CODE)) \
359 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
363 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
364 ({ const tree __t = (T); \
365 if (TREE_CODE (__t) != (CODE1) \
366 && TREE_CODE (__t) != (CODE2)) \
367 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
368 (CODE1), (CODE2), 0); \
371 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
372 ({ const tree __t = (T); \
373 if (TREE_CODE (__t) == (CODE1) \
374 || TREE_CODE (__t) == (CODE2)) \
375 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
376 (CODE1), (CODE2), 0); \
379 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
380 ({ const tree __t = (T); \
381 if (TREE_CODE (__t) != (CODE1) \
382 && TREE_CODE (__t) != (CODE2) \
383 && TREE_CODE (__t) != (CODE3)) \
384 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
385 (CODE1), (CODE2), (CODE3), 0); \
388 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
389 ({ const tree __t = (T); \
390 if (TREE_CODE (__t) == (CODE1) \
391 || TREE_CODE (__t) == (CODE2) \
392 || TREE_CODE (__t) == (CODE3)) \
393 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
394 (CODE1), (CODE2), (CODE3), 0); \
397 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
398 ({ const tree __t = (T); \
399 if (TREE_CODE (__t) != (CODE1) \
400 && TREE_CODE (__t) != (CODE2) \
401 && TREE_CODE (__t) != (CODE3) \
402 && TREE_CODE (__t) != (CODE4)) \
403 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
404 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
407 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
408 ({ const tree __t = (T); \
409 if (TREE_CODE (__t) == (CODE1) \
410 || TREE_CODE (__t) == (CODE2) \
411 || TREE_CODE (__t) == (CODE3) \
412 || TREE_CODE (__t) == (CODE4)) \
413 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
414 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
417 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
418 ({ const tree __t = (T); \
419 if (TREE_CODE (__t) != (CODE1) \
420 && TREE_CODE (__t) != (CODE2) \
421 && TREE_CODE (__t) != (CODE3) \
422 && TREE_CODE (__t) != (CODE4) \
423 && TREE_CODE (__t) != (CODE5)) \
424 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
425 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
428 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
429 ({ const tree __t = (T); \
430 if (TREE_CODE (__t) == (CODE1) \
431 || TREE_CODE (__t) == (CODE2) \
432 || TREE_CODE (__t) == (CODE3) \
433 || TREE_CODE (__t) == (CODE4) \
434 || TREE_CODE (__t) == (CODE5)) \
435 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
436 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
439 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
440 ({ const tree __t = (T); \
441 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
442 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
446 /* These checks have to be special cased. */
447 #define EXPR_CHECK(T) __extension__ \
448 ({ const tree __t = (T); \
449 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
450 if (!IS_EXPR_CODE_CLASS (__c)) \
451 tree_class_check_failed (__t, 'E', __FILE__, __LINE__, \
455 /* These checks have to be special cased. */
456 #define NON_TYPE_CHECK(T) __extension__ \
457 ({ const tree __t = (T); \
458 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
459 if (!IS_NON_TYPE_CODE_CLASS (__c)) \
460 tree_class_check_failed (__t, 'T', __FILE__, __LINE__, \
464 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
465 (*({const tree __t = (T); \
466 const int __i = (I); \
467 if (TREE_CODE (__t) != TREE_VEC) \
468 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
470 if (__i < 0 || __i >= __t->vec.length) \
471 tree_vec_elt_check_failed (__i, __t->vec.length, \
472 __FILE__, __LINE__, __FUNCTION__); \
473 &__t->vec.a[__i]; }))
475 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
476 (*({const tree __t = t; \
477 const int __i = (i); \
478 if (TREE_CODE (__t) != PHI_NODE) \
479 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
481 if (__i < 0 || __i >= __t->phi.capacity) \
482 phi_node_elt_check_failed (__i, __t->phi.num_args, \
483 __FILE__, __LINE__, __FUNCTION__); \
484 &__t->phi.a[__i]; }))
486 /* Special checks for TREE_OPERANDs. */
487 #define TREE_OPERAND_CHECK(T, I) __extension__ \
488 (*({const tree __t = EXPR_CHECK (T); \
489 const int __i = (I); \
490 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
491 tree_operand_check_failed (__i, TREE_CODE (__t), \
492 __FILE__, __LINE__, __FUNCTION__); \
493 &__t->exp.operands[__i]; }))
495 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
496 (*({const tree __t = (T); \
497 const int __i = (I); \
498 if (TREE_CODE (__t) != CODE) \
499 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
500 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
501 tree_operand_check_failed (__i, (CODE), \
502 __FILE__, __LINE__, __FUNCTION__); \
503 &__t->exp.operands[__i]; }))
505 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
507 ({const tree __t = (T); \
508 const int __i = (I); \
509 if (TREE_CODE (__t) != (CODE)) \
510 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
511 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
512 tree_operand_check_failed (__i, (CODE), \
513 __FILE__, __LINE__, __FUNCTION__); \
514 &__t->exp.operands[__i]; }))
516 extern void tree_check_failed (const tree, const char *, int, const char *,
517 ...) ATTRIBUTE_NORETURN;
518 extern void tree_not_check_failed (const tree, const char *, int, const char *,
519 ...) ATTRIBUTE_NORETURN;
520 extern void tree_class_check_failed (const tree, int,
521 const char *, int, const char *)
523 extern void tree_vec_elt_check_failed (int, int, const char *,
526 extern void phi_node_elt_check_failed (int, int, const char *,
529 extern void tree_operand_check_failed (int, enum tree_code,
530 const char *, int, const char *)
533 #else /* not ENABLE_TREE_CHECKING, or not gcc */
535 #define TREE_CHECK(T, CODE) (T)
536 #define TREE_NOT_CHECK(T, CODE) (T)
537 #define TREE_CHECK2(T, CODE1, CODE2) (T)
538 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
539 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
540 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
541 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
542 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
543 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
544 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
545 #define TREE_CLASS_CHECK(T, CODE) (T)
546 #define EXPR_CHECK(T) (T)
547 #define NON_TYPE_CHECK(T) (T)
548 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
549 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
550 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
551 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
552 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
556 #define TREE_BLOCK(NODE) ((NODE)->exp.block)
558 #include "tree-check.h"
560 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't')
561 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd')
562 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c')
563 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's')
564 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
565 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
567 #define SET_OR_ARRAY_CHECK(T) \
568 TREE_CHECK2 (T, ARRAY_TYPE, SET_TYPE)
570 #define RECORD_OR_UNION_CHECK(T) \
571 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
572 #define NOT_RECORD_OR_UNION_CHECK(T) \
573 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
575 #define NUMERICAL_TYPE_CHECK(T) \
576 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \
577 CHAR_TYPE, REAL_TYPE)
579 /* In all nodes that are expressions, this is the data type of the expression.
580 In POINTER_TYPE nodes, this is the type that the pointer points to.
581 In ARRAY_TYPE nodes, this is the type of the elements.
582 In VECTOR_TYPE nodes, this is the type of the elements. */
583 #define TREE_TYPE(NODE) ((NODE)->common.type)
585 /* Here is how primitive or already-canonicalized types' hash codes
587 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
589 /* A simple hash function for an arbitrary tree node. This must not be
590 used in hash tables which are saved to a PCH. */
591 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
593 /* Nodes are chained together for many purposes.
594 Types are chained together to record them for being output to the debugger
595 (see the function `chain_type').
596 Decls in the same scope are chained together to record the contents
598 Statement nodes for successive statements used to be chained together.
599 Often lists of things are represented by TREE_LIST nodes that
600 are chained together. */
602 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
604 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
605 that don't change the machine mode. */
607 #define STRIP_NOPS(EXP) \
608 while ((TREE_CODE (EXP) == NOP_EXPR \
609 || TREE_CODE (EXP) == CONVERT_EXPR \
610 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
611 && TREE_OPERAND (EXP, 0) != error_mark_node \
612 && (TYPE_MODE (TREE_TYPE (EXP)) \
613 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
614 (EXP) = TREE_OPERAND (EXP, 0)
616 /* Like STRIP_NOPS, but don't let the signedness change either. */
618 #define STRIP_SIGN_NOPS(EXP) \
619 while ((TREE_CODE (EXP) == NOP_EXPR \
620 || TREE_CODE (EXP) == CONVERT_EXPR \
621 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
622 && TREE_OPERAND (EXP, 0) != error_mark_node \
623 && (TYPE_MODE (TREE_TYPE (EXP)) \
624 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
625 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
626 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
627 (EXP) = TREE_OPERAND (EXP, 0)
629 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
631 #define STRIP_MAIN_TYPE_NOPS(EXP) \
632 while ((TREE_CODE (EXP) == NOP_EXPR \
633 || TREE_CODE (EXP) == CONVERT_EXPR \
634 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
635 && TREE_OPERAND (EXP, 0) != error_mark_node \
636 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
637 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
638 (EXP) = TREE_OPERAND (EXP, 0)
640 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
642 #define STRIP_TYPE_NOPS(EXP) \
643 while ((TREE_CODE (EXP) == NOP_EXPR \
644 || TREE_CODE (EXP) == CONVERT_EXPR \
645 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
646 && TREE_OPERAND (EXP, 0) != error_mark_node \
647 && (TREE_TYPE (EXP) \
648 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
649 (EXP) = TREE_OPERAND (EXP, 0)
651 /* Remove unnecessary type conversions according to
652 tree_ssa_useless_type_conversion. */
654 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
655 while (tree_ssa_useless_type_conversion (EXP)) \
656 EXP = TREE_OPERAND (EXP, 0)
658 /* Nonzero if TYPE represents an integral type. Note that we do not
659 include COMPLEX types here. */
661 #define INTEGRAL_TYPE_P(TYPE) \
662 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
663 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
665 /* Nonzero if TYPE represents a scalar floating-point type. */
667 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
669 /* Nonzero if TYPE represents a complex floating-point type. */
671 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
672 (TREE_CODE (TYPE) == COMPLEX_TYPE \
673 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
675 /* Nonzero if TYPE represents a vector floating-point type. */
677 #define VECTOR_FLOAT_TYPE_P(TYPE) \
678 (TREE_CODE (TYPE) == VECTOR_TYPE \
679 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
681 /* Nonzero if TYPE represents a floating-point type, including complex
682 and vector floating-point types. */
684 #define FLOAT_TYPE_P(TYPE) \
685 (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE) \
686 || VECTOR_FLOAT_TYPE_P (TYPE))
688 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
690 #define AGGREGATE_TYPE_P(TYPE) \
691 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
692 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
693 || TREE_CODE (TYPE) == SET_TYPE)
695 /* Nonzero if TYPE represents a pointer or reference type.
696 (It should be renamed to INDIRECT_TYPE_P.) */
698 #define POINTER_TYPE_P(TYPE) \
699 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
701 /* Nonzero if this type is a complete type. */
702 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
704 /* Nonzero if this type is the (possibly qualified) void type. */
705 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
707 /* Nonzero if this type is complete or is cv void. */
708 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
709 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
711 /* Nonzero if this type is complete or is an array with unspecified bound. */
712 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
713 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
715 /* Nonzero if TYPE represents a type. */
717 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
719 /* Define many boolean fields that all tree nodes have. */
721 /* In VAR_DECL nodes, nonzero means address of this is needed.
722 So it cannot be in a register.
723 In a FUNCTION_DECL, nonzero means its address is needed.
724 So it must be compiled even if it is an inline function.
725 In a FIELD_DECL node, it means that the programmer is permitted to
726 construct the address of this field. This is used for aliasing
727 purposes: see record_component_aliases.
728 In CONSTRUCTOR nodes, it means object constructed must be in memory.
729 In LABEL_DECL nodes, it means a goto for this label has been seen
730 from a place outside all binding contours that restore stack levels.
731 In ..._TYPE nodes, it means that objects of this type must
732 be fully addressable. This means that pieces of this
733 object cannot go into register parameters, for example.
734 In IDENTIFIER_NODEs, this means that some extern decl for this name
735 had its address taken. That matters for inline functions. */
736 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
738 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
740 /* In a VAR_DECL, nonzero means allocate static storage.
741 In a FUNCTION_DECL, nonzero if function has been defined.
742 In a CONSTRUCTOR, nonzero means allocate static storage.
744 ??? This is also used in lots of other nodes in unclear ways which
745 should be cleaned up some day. */
746 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
748 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
749 should only be executed if an exception is thrown, not on normal exit
751 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
753 /* In an expr node (usually a conversion) this means the node was made
754 implicitly and should not lead to any sort of warning. In a decl node,
755 warnings concerning the decl should be suppressed. This is used at
756 least for used-before-set warnings, and it set after one warning is
758 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
760 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
761 there was an overflow in folding. This is distinct from
762 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
763 occur in constant expressions. */
764 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
766 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
767 this string as an argument. */
768 #define TREE_SYMBOL_REFERENCED(NODE) \
769 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
771 /* Nonzero in a pointer or reference type means the data pointed to
772 by this type can alias anything. */
773 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
774 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
776 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
777 there was an overflow in folding, and no warning has been issued
778 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
781 ??? Apparently, lots of code assumes this is defined in all
783 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
785 /* In a VAR_DECL or FUNCTION_DECL,
786 nonzero means name is to be accessible from outside this module.
787 In an IDENTIFIER_NODE, nonzero means an external declaration
788 accessible from outside this module was previously seen
789 for this name in an inner scope. */
790 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
792 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
793 of cached values, or is something else. */
794 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->common.public_flag)
796 /* In a SAVE_EXPR, indicates that the original expression has already
797 been substituted with a VAR_DECL that contains the value. */
798 #define SAVE_EXPR_RESOLVED_P(NODE) \
799 (TREE_CHECK (NODE, SAVE_EXPR)->common.public_flag)
801 /* In any expression, decl, or constant, nonzero means it has side effects or
802 reevaluation of the whole expression could produce a different value.
803 This is set if any subexpression is a function call, a side effect or a
804 reference to a volatile variable. In a ..._DECL, this is set only if the
805 declaration said `volatile'. This will never be set for a constant. */
806 #define TREE_SIDE_EFFECTS(NODE) \
807 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
809 /* In a LABEL_DECL, nonzero means this label had its address taken
810 and therefore can never be deleted and is a jump target for
812 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
814 /* Nonzero means this expression is volatile in the C sense:
815 its address should be of type `volatile WHATEVER *'.
816 In other words, the declared item is volatile qualified.
817 This is used in _DECL nodes and _REF nodes.
819 In a ..._TYPE node, means this type is volatile-qualified.
820 But use TYPE_VOLATILE instead of this macro when the node is a type,
821 because eventually we may make that a different bit.
823 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
824 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
826 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
827 accessing the memory pointed to won't generate a trap. However,
828 this only applies to an object when used appropriately: it doesn't
829 mean that writing a READONLY mem won't trap.
831 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
832 (or slice of the array) always belongs to the range of the array.
833 I.e. that the access will not trap, provided that the access to
834 the base to the array will not trap. */
835 #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag)
837 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
838 nonzero means it may not be the lhs of an assignment. */
839 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
841 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
842 #define TREE_READONLY_DECL_P(NODE) (DECL_P (NODE) && TREE_READONLY (NODE))
844 /* Value of expression is constant. Always on in all ..._CST nodes. May
845 also appear in an expression or decl where the value is constant. */
846 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
848 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
849 #define DECL_UNSIGNED(NODE) (DECL_CHECK (NODE)->common.unsigned_flag)
851 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
852 #define BIT_FIELD_REF_UNSIGNED(NODE) \
853 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
855 /* In integral and pointer types, means an unsigned type. */
856 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
858 #define TYPE_TRAP_SIGNED(NODE) \
859 (flag_trapv && ! TYPE_UNSIGNED (NODE))
861 /* Nonzero in a VAR_DECL means assembler code has been written.
862 Nonzero in a FUNCTION_DECL means that the function has been compiled.
863 This is interesting in an inline function, since it might not need
864 to be compiled separately.
865 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
866 if the sdb debugging info for the type has been written.
867 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
868 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
870 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
872 /* Nonzero in a _DECL if the name is used in its scope.
873 Nonzero in an expr node means inhibit warning if value is unused.
874 In IDENTIFIER_NODEs, this means that some extern decl for this name
876 #define TREE_USED(NODE) ((NODE)->common.used_flag)
878 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
879 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
880 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
882 /* In a CALL_EXPR, means that the address of the return slot is part of the
884 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
886 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
887 reference (and the TREE_TYPE is a pointer to the true type). */
888 #define DECL_BY_REFERENCE(NODE) (DECL_CHECK (NODE)->common.private_flag)
890 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
891 thunked-to function. */
892 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag)
894 /* In a type, nonzero means that all objects of the type are guaranteed by the
895 language or front-end to be properly aligned, so we can indicate that a MEM
896 of this type is aligned at least to the alignment of the type, even if it
897 doesn't appear that it is. We see this, for example, in object-oriented
898 languages where a tag field may show this is an object of a more-aligned
899 variant of the more generic type.
901 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
903 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
905 /* Used in classes in C++. */
906 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
907 /* Used in classes in C++.
908 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
909 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
911 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
912 deprecated feature by __attribute__((deprecated)). */
913 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
915 /* Value of expression is function invariant. A strict subset of
916 TREE_CONSTANT, such an expression is constant over any one function
917 invocation, though not across different invocations. May appear in
918 any expression node. */
919 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
921 /* These flags are available for each language front end to use internally. */
922 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
923 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
924 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
925 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
926 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
927 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
928 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
930 /* Define additional fields and accessors for nodes representing constants. */
932 /* In an INTEGER_CST node. These two together make a 2-word integer.
933 If the data type is signed, the value is sign-extended to 2 words
934 even though not all of them may really be in use.
935 In an unsigned constant shorter than 2 words, the extra bits are 0. */
936 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
937 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
938 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
940 #define INT_CST_LT(A, B) \
941 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
942 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
943 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
945 #define INT_CST_LT_UNSIGNED(A, B) \
946 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
947 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
948 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
949 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
950 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
952 struct tree_int_cst GTY(())
954 struct tree_common common;
955 /* A sub-struct is necessary here because the function `const_hash'
956 wants to scan both words as a unit and taking the address of the
957 sub-struct yields the properly inclusive bounded pointer. */
958 struct tree_int_cst_lowhi {
959 unsigned HOST_WIDE_INT low;
964 /* In a REAL_CST node. struct real_value is an opaque entity, with
965 manipulators defined in real.h. We don't want tree.h depending on
966 real.h and transitively on tm.h. */
969 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
970 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
972 struct tree_real_cst GTY(())
974 struct tree_common common;
975 struct real_value * real_cst_ptr;
978 /* In a STRING_CST */
979 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
980 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
982 struct tree_string GTY(())
984 struct tree_common common;
989 /* In a COMPLEX_CST node. */
990 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
991 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
993 struct tree_complex GTY(())
995 struct tree_common common;
1000 /* In a VECTOR_CST node. */
1001 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1003 struct tree_vector GTY(())
1005 struct tree_common common;
1011 /* Define fields and accessors for some special-purpose tree nodes. */
1013 #define IDENTIFIER_LENGTH(NODE) \
1014 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1015 #define IDENTIFIER_POINTER(NODE) \
1016 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1017 #define IDENTIFIER_HASH_VALUE(NODE) \
1018 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1020 /* Translate a hash table identifier pointer to a tree_identifier
1021 pointer, and vice versa. */
1023 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1024 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1025 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1027 struct tree_identifier GTY(())
1029 struct tree_common common;
1030 struct ht_identifier id;
1033 /* In a TREE_LIST node. */
1034 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1035 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1037 struct tree_list GTY(())
1039 struct tree_common common;
1044 /* In a TREE_VEC node. */
1045 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1046 #define TREE_VEC_END(NODE) \
1047 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1049 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1051 struct tree_vec GTY(())
1053 struct tree_common common;
1055 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1058 /* Define fields and accessors for some nodes that represent expressions. */
1060 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1061 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1062 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1063 && integer_zerop (TREE_OPERAND (NODE, 0)))
1065 /* In a CONSTRUCTOR node. */
1066 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
1068 /* In ordinary expression nodes. */
1069 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1070 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1072 /* In INDIRECT_REF. */
1073 #define REF_ORIGINAL(NODE) TREE_CHAIN (TREE_CHECK (NODE, INDIRECT_REF))
1075 /* In a LABELED_BLOCK_EXPR node. */
1076 #define LABELED_BLOCK_LABEL(NODE) \
1077 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
1078 #define LABELED_BLOCK_BODY(NODE) \
1079 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
1081 /* In an EXIT_BLOCK_EXPR node. */
1082 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
1083 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
1084 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
1086 /* In a LOOP_EXPR node. */
1087 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1089 #ifdef USE_MAPPED_LOCATION
1090 /* The source location of this expression. Non-tree_exp nodes such as
1091 decls and constants can be shared among multiple locations, so
1093 #define EXPR_LOCATION(NODE) \
1094 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1095 ? (NODE)->exp.locus \
1097 #define SET_EXPR_LOCATION(NODE, FROM) \
1098 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1099 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1100 /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */
1101 #define EXPR_LOCUS(NODE) \
1102 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1103 ? &(NODE)->exp.locus \
1104 : (location_t *)NULL)
1105 #define SET_EXPR_LOCUS(NODE, FROM) \
1106 do { source_location *loc_tmp = FROM; \
1107 EXPR_CHECK (NODE)->exp.locus \
1108 = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0)
1109 #define EXPR_FILENAME(NODE) \
1110 LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus)
1111 #define EXPR_LINENO(NODE) \
1112 LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1114 /* The source location of this expression. Non-tree_exp nodes such as
1115 decls and constants can be shared among multiple locations, so
1117 #define EXPR_LOCUS(NODE) \
1118 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1119 ? (NODE)->exp.locus \
1120 : (location_t *)NULL)
1121 #define SET_EXPR_LOCUS(NODE, FROM) \
1122 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1123 #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM)
1124 #define EXPR_FILENAME(NODE) \
1125 (EXPR_CHECK (NODE)->exp.locus->file)
1126 #define EXPR_LINENO(NODE) \
1127 (EXPR_CHECK (NODE)->exp.locus->line)
1128 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1129 #define EXPR_LOCATION(NODE) \
1130 (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION)
1133 /* In a TARGET_EXPR node. */
1134 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1135 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1136 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1138 /* DECL_EXPR accessor. This gives access to the DECL associated with
1139 the given declaration statement. */
1140 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1142 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1144 /* SWITCH_EXPR accessors. These give access to the condition, body and
1145 original condition type (before any compiler conversions)
1146 of the switch statement, respectively. */
1147 #define SWITCH_COND(NODE) TREE_OPERAND ((NODE), 0)
1148 #define SWITCH_BODY(NODE) TREE_OPERAND ((NODE), 1)
1149 #define SWITCH_LABELS(NODE) TREE_OPERAND ((NODE), 2)
1151 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1152 of a case label, respectively. */
1153 #define CASE_LOW(NODE) TREE_OPERAND ((NODE), 0)
1154 #define CASE_HIGH(NODE) TREE_OPERAND ((NODE), 1)
1155 #define CASE_LABEL(NODE) TREE_OPERAND ((NODE), 2)
1157 /* The operands of a BIND_EXPR. */
1158 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1159 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1160 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1162 /* GOTO_EXPR accessor. This gives access to the label associated with
1163 a goto statement. */
1164 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1166 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1167 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1168 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1170 #define ASM_STRING(NODE) TREE_OPERAND ((NODE), 0)
1171 #define ASM_OUTPUTS(NODE) TREE_OPERAND ((NODE), 1)
1172 #define ASM_INPUTS(NODE) TREE_OPERAND ((NODE), 2)
1173 #define ASM_CLOBBERS(NODE) TREE_OPERAND ((NODE), 3)
1174 /* Nonzero if we want to create an ASM_INPUT instead of an
1175 ASM_OPERAND with no operands. */
1176 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1177 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1179 /* COND_EXPR accessors. */
1180 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1181 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1182 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1184 /* LABEL_EXPR accessor. This gives access to the label associated with
1185 the given label expression. */
1186 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1188 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1189 accessors for SSA operands. */
1191 /* CATCH_EXPR accessors. */
1192 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1193 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1195 /* EH_FILTER_EXPR accessors. */
1196 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1197 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1198 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1200 /* OBJ_TYPE_REF accessors. */
1201 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1202 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1203 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1205 struct tree_exp GTY(())
1207 struct tree_common common;
1211 tree GTY ((special ("tree_exp"),
1212 desc ("TREE_CODE ((tree) &%0)")))
1216 /* SSA_NAME accessors. */
1218 /* Returns the variable being referenced. Once released, this is the
1219 only field that can be relied upon. */
1220 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1222 /* Returns the statement which defines this reference. Note that
1223 we use the same field when chaining SSA_NAME nodes together on
1224 the SSA_NAME freelist. */
1225 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1227 /* Returns the SSA version number of this SSA name. Note that in
1228 tree SSA, version numbers are not per variable and may be recycled. */
1229 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1231 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1232 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1234 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1235 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1237 /* Nonzero if this SSA_NAME expression is currently on the free list of
1238 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1239 has no meaning for an SSA_NAME. */
1240 #define SSA_NAME_IN_FREE_LIST(NODE) \
1241 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1243 /* Attributes for SSA_NAMEs for pointer-type variables. */
1244 #define SSA_NAME_PTR_INFO(N) \
1245 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1247 /* Get the value of this SSA_NAME, if available. */
1248 #define SSA_NAME_VALUE(N) \
1249 SSA_NAME_CHECK (N)->ssa_name.value_handle
1251 /* Auxiliary pass-specific data. */
1252 #define SSA_NAME_AUX(N) \
1253 SSA_NAME_CHECK (N)->ssa_name.aux
1255 #ifndef _TREE_FLOW_H
1256 struct ptr_info_def;
1259 struct tree_ssa_name GTY(())
1261 struct tree_common common;
1263 /* _DECL wrapped by this SSA name. */
1266 /* SSA version number. */
1267 unsigned int version;
1269 /* Pointer attributes used for alias analysis. */
1270 struct ptr_info_def *ptr_info;
1272 /* Value for SSA name used by GVN. */
1273 tree GTY((skip)) value_handle;
1275 /* Auxiliary information stored with the ssa name. */
1276 PTR GTY((skip)) aux;
1279 /* In a PHI_NODE node. */
1280 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1281 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1283 /* PHI_NODEs for each basic block are chained together in a single linked
1284 list. The head of the list is linked from the block annotation, and
1285 the link to the next PHI is in PHI_CHAIN. */
1286 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1288 /* Nonzero if the PHI node was rewritten by a previous pass through the
1290 #define PHI_REWRITTEN(NODE) PHI_NODE_CHECK (NODE)->phi.rewritten
1291 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1292 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1293 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1294 #define PHI_ARG_EDGE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).e
1295 #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero
1296 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1297 #define PHI_DF(NODE) PHI_NODE_CHECK (NODE)->phi.df
1301 struct phi_arg_d GTY(())
1304 struct edge_def * GTY((skip (""))) e;
1308 struct tree_phi_node GTY(())
1310 struct tree_common common;
1315 /* Nonzero if the PHI node was rewritten by a previous pass through the
1319 /* Basic block to that the phi node belongs. */
1320 struct basic_block_def *bb;
1322 /* Dataflow information. */
1323 struct dataflow_d *df;
1325 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.capacity"))) a[1];
1329 struct varray_head_tag;
1331 /* In a BLOCK node. */
1332 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1333 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1334 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1335 /* Note: when changing this, make sure to find the places
1336 that use chainon or nreverse. */
1337 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1338 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1339 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1341 /* Nonzero means that this block is prepared to handle exceptions
1342 listed in the BLOCK_VARS slot. */
1343 #define BLOCK_HANDLER_BLOCK(NODE) \
1344 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1346 /* An index number for this block. These values are not guaranteed to
1347 be unique across functions -- whether or not they are depends on
1348 the debugging output format in use. */
1349 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1351 /* If block reordering splits a lexical block into discontiguous
1352 address ranges, we'll make a copy of the original block.
1354 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1355 In that case, we have one source block that has been replicated
1356 (through inlining or unrolling) into many logical blocks, and that
1357 these logical blocks have different physical variables in them.
1359 In this case, we have one logical block split into several
1360 non-contiguous address ranges. Most debug formats can't actually
1361 represent this idea directly, so we fake it by creating multiple
1362 logical blocks with the same variables in them. However, for those
1363 that do support non-contiguous regions, these allow the original
1364 logical block to be reconstructed, along with the set of address
1367 One of the logical block fragments is arbitrarily chosen to be
1368 the ORIGIN. The other fragments will point to the origin via
1369 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1370 be null. The list of fragments will be chained through
1371 BLOCK_FRAGMENT_CHAIN from the origin. */
1373 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1374 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1376 struct tree_block GTY(())
1378 struct tree_common common;
1380 unsigned handler_block_flag : 1;
1381 unsigned abstract_flag : 1;
1382 unsigned block_num : 30;
1387 tree abstract_origin;
1388 tree fragment_origin;
1389 tree fragment_chain;
1392 /* Define fields and accessors for nodes representing data types. */
1394 /* See tree.def for documentation of the use of these fields.
1395 Look at the documentation of the various ..._TYPE tree codes.
1397 Note that the type.values, type.minval, and type.maxval fields are
1398 overloaded and used for different macros in different kinds of types.
1399 Each macro must check to ensure the tree node is of the proper kind of
1400 type. Note also that some of the front-ends also overload these fields,
1401 so they must be checked as well. */
1403 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1404 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1405 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1406 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1407 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1408 #define TYPE_DOMAIN(NODE) (SET_OR_ARRAY_CHECK (NODE)->type.values)
1409 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
1410 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
1411 #define TYPE_ORIG_SIZE_TYPE(NODE) \
1412 (INTEGER_TYPE_CHECK (NODE)->type.values \
1413 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
1414 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
1415 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
1416 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1417 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1418 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1419 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1420 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1421 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1422 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1423 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1424 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1425 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1426 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1427 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1428 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1429 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1430 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1431 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1432 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1433 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1435 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1436 in the debugging output. We use this to describe a vector as a
1437 structure containing an array. */
1438 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1440 /* For record and union types, information about this type, as a base type
1442 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1444 /* For non record and union types, used in a language-dependent way. */
1445 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1447 /* The (language-specific) typed-based alias set for this type.
1448 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1449 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1450 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1451 type can alias objects of any type. */
1452 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1454 /* Nonzero iff the typed-based alias set for this type has been
1456 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1458 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1460 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1462 /* The alignment necessary for objects of this type.
1463 The value is an int, measured in bits. */
1464 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1466 /* 1 if the alignment for this type was requested by "aligned" attribute,
1467 0 if it is the default for this type. */
1468 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1470 /* The alignment for NODE, in bytes. */
1471 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1473 /* If your language allows you to declare types, and you want debug info
1474 for them, then you need to generate corresponding TYPE_DECL nodes.
1475 These "stub" TYPE_DECL nodes have no name, and simply point at the
1476 type node. You then set the TYPE_STUB_DECL field of the type node
1477 to point back at the TYPE_DECL node. This allows the debug routines
1478 to know that the two nodes represent the same type, so that we only
1479 get one debug info record for them. */
1480 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1482 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1483 has BLKmode only because it lacks the alignment requirement for
1485 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1487 /* In an INTEGER_TYPE, it means the type represents a size. We use
1488 this both for validity checking and to permit optimizations that
1489 are unsafe for other types. Note that the C `size_t' type should
1490 *not* have this flag set. The `size_t' type is simply a typedef
1491 for an ordinary integer type that happens to be the type of an
1492 expression returned by `sizeof'; `size_t' has no special
1493 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1494 always actual sizes. */
1495 #define TYPE_IS_SIZETYPE(NODE) \
1496 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1498 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1499 pointer depressed. */
1500 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1501 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1503 /* Nonzero in a type considered volatile as a whole. */
1504 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1506 /* Means this type is const-qualified. */
1507 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1509 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1511 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1513 /* There is a TYPE_QUAL value for each type qualifier. They can be
1514 combined by bitwise-or to form the complete set of qualifiers for a
1517 #define TYPE_UNQUALIFIED 0x0
1518 #define TYPE_QUAL_CONST 0x1
1519 #define TYPE_QUAL_VOLATILE 0x2
1520 #define TYPE_QUAL_RESTRICT 0x4
1522 /* The set of type qualifiers for this type. */
1523 #define TYPE_QUALS(NODE) \
1524 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1525 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1526 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1528 /* These flags are available for each language front end to use internally. */
1529 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1530 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1531 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1532 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1533 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1534 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1535 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1537 /* Used to keep track of visited nodes in tree traversals. This is set to
1538 0 by copy_node and make_node. */
1539 #define TREE_VISITED(NODE) ((NODE)->common.visited)
1541 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1542 that distinguish string from array of char).
1543 If set in a SET_TYPE, indicates a bitstring type. */
1544 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1546 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1547 object of the given ARRAY_TYPE. This allows temporaries to be
1549 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1550 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
1552 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1553 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1554 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
1556 /* Indicates that objects of this type must be initialized by calling a
1557 function when they are created. */
1558 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1559 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1561 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1562 the same way that the first union alternative would be passed. */
1563 #define TYPE_TRANSPARENT_UNION(NODE) \
1564 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1566 /* For an ARRAY_TYPE, indicates that it is not permitted to
1567 take the address of a component of the type. */
1568 #define TYPE_NONALIASED_COMPONENT(NODE) \
1569 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1571 /* Indicated that objects of this type should be laid out in as
1572 compact a way as possible. */
1573 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1575 /* Used by type_contains_placeholder_p to avoid recomputation.
1576 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1577 this field directly. */
1578 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1579 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
1583 struct tree_type GTY(())
1585 struct tree_common common;
1592 unsigned int precision : 9;
1593 ENUM_BITFIELD(machine_mode) mode : 7;
1595 unsigned string_flag : 1;
1596 unsigned no_force_blk_flag : 1;
1597 unsigned needs_constructing_flag : 1;
1598 unsigned transparent_union_flag : 1;
1599 unsigned packed_flag : 1;
1600 unsigned restrict_flag : 1;
1601 unsigned contains_placeholder_bits : 2;
1603 unsigned lang_flag_0 : 1;
1604 unsigned lang_flag_1 : 1;
1605 unsigned lang_flag_2 : 1;
1606 unsigned lang_flag_3 : 1;
1607 unsigned lang_flag_4 : 1;
1608 unsigned lang_flag_5 : 1;
1609 unsigned lang_flag_6 : 1;
1610 unsigned user_align : 1;
1615 union tree_type_symtab {
1616 int GTY ((tag ("0"))) address;
1617 char * GTY ((tag ("1"))) pointer;
1618 struct die_struct * GTY ((tag ("2"))) die;
1619 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1620 descbits ("2"))) symtab;
1628 HOST_WIDE_INT alias_set;
1629 /* Points to a structure whose details depend on the language in use. */
1630 struct lang_type *lang_specific;
1633 /* Define accessor macros for information about type inheritance
1636 A "basetype" means a particular usage of a data type for inheritance
1637 in another type. Each such basetype usage has its own "binfo"
1638 object to describe it. The binfo object is a TREE_VEC node.
1640 Inheritance is represented by the binfo nodes allocated for a
1641 given type. For example, given types C and D, such that D is
1642 inherited by C, 3 binfo nodes will be allocated: one for describing
1643 the binfo properties of C, similarly one for D, and one for
1644 describing the binfo properties of D as a base type for C.
1645 Thus, given a pointer to class C, one can get a pointer to the binfo
1646 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1648 /* BINFO specific flags. */
1650 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1651 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag)
1653 /* Flags for language dependent use. */
1654 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
1655 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
1656 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
1657 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
1658 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
1659 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
1660 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
1662 /* The actual data type node being inherited in this basetype. */
1663 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
1665 /* The offset where this basetype appears in its containing type.
1666 BINFO_OFFSET slot holds the offset (in bytes)
1667 from the base of the complete object to the base of the part of the
1668 object that is allocated on behalf of this `type'.
1669 This is always 0 except when there is multiple inheritance. */
1671 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
1672 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1674 /* The virtual function table belonging to this basetype. Virtual
1675 function tables provide a mechanism for run-time method dispatching.
1676 The entries of a virtual function table are language-dependent. */
1678 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
1680 /* The virtual functions in the virtual function table. This is
1681 a TREE_LIST that is used as an initial approximation for building
1682 a virtual function table for this basetype. */
1683 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
1685 /* A vector of binfos for the direct basetypes inherited by this
1688 If this basetype describes type D as inherited in C, and if the
1689 basetypes of D are E and F, then this vector contains binfos for
1690 inheritance of E and F by C. */
1691 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
1693 /* The number of basetypes for NODE. */
1694 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
1696 /* Accessor macro to get to the Nth base binfo of this binfo. */
1697 #define BINFO_BASE_BINFO(NODE,N) \
1698 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
1699 #define BINFO_BASE_ITERATE(NODE,N,B) \
1700 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
1701 #define BINFO_BASE_APPEND(NODE,T) \
1702 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
1704 /* For a BINFO record describing a virtual base class, i.e., one where
1705 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1706 base. The actual contents are language-dependent. In the C++
1707 front-end this field is an INTEGER_CST giving an offset into the
1708 vtable where the offset to the virtual base can be found. */
1709 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
1711 /* Indicates the accesses this binfo has to its bases. The values are
1712 access_public_node, access_protected_node or access_private_node.
1713 If this array is not present, public access is implied. */
1714 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
1716 #define BINFO_BASE_ACCESS(NODE,N) \
1717 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
1718 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1719 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
1721 /* The index in the VTT where this subobject's sub-VTT can be found.
1722 NULL_TREE if there is no sub-VTT. */
1723 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
1725 /* The index in the VTT where the vptr for this subobject can be
1726 found. NULL_TREE if there is no secondary vptr in the VTT. */
1727 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
1729 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1730 inheriting this base for non-virtual bases. For virtual bases it
1731 points either to the binfo for which this is a primary binfo, or to
1732 the binfo of the most derived type. */
1733 #define BINFO_INHERITANCE_CHAIN(NODE) \
1734 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
1736 struct tree_binfo GTY (())
1738 struct tree_common common;
1744 VEC(tree) *base_accesses;
1750 VEC(tree) base_binfos;
1754 /* Define fields and accessors for nodes representing declared names. */
1756 /* Nonzero if DECL represents a decl. */
1757 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1759 /* Nonzero if DECL represents a variable for the SSA passes. */
1760 #define SSA_VAR_P(DECL) \
1761 (TREE_CODE (DECL) == VAR_DECL \
1762 || TREE_CODE (DECL) == PARM_DECL \
1763 || TREE_CODE (DECL) == RESULT_DECL \
1764 || (TREE_CODE (DECL) == SSA_NAME \
1765 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
1766 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
1767 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
1769 /* This is the name of the object as written by the user.
1770 It is an IDENTIFIER_NODE. */
1771 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1773 /* The name of the object as the assembler will see it (but before any
1774 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1775 as DECL_NAME. It is an IDENTIFIER_NODE. */
1776 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1778 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1779 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1781 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1782 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1784 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1785 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1786 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1788 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1789 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1790 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1791 semantics of using this macro, are different than saying:
1793 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1795 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1797 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1798 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1799 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1800 DECL_ASSEMBLER_NAME (DECL1)) \
1803 /* Records the section name in a section attribute. Used to pass
1804 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1805 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1807 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1808 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1809 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1810 points to either the FUNCTION_DECL for the containing function,
1811 the RECORD_TYPE or UNION_TYPE for the containing type, or
1812 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1814 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1815 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1816 /* In a DECL this is the field where attributes are stored. */
1817 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1818 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1819 byte containing the bit closest to the beginning of the structure. */
1820 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1821 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1822 field from DECL_FIELD_OFFSET. */
1823 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1824 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1825 if so, the type that was originally specified for it.
1826 TREE_TYPE may have been modified (in finish_struct). */
1827 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1828 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1829 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1831 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1832 /* This field is used to reference anything in decl.result and is meant only
1833 for use by the garbage collector. */
1834 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1835 /* In FUNCTION_DECL, holds the decl for the return value. */
1836 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1837 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1838 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1839 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1840 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1841 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1842 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1843 For a VAR_DECL, holds the initial value.
1844 For a PARM_DECL, not used--default
1845 values for parameters are encoded in the type of the function,
1846 not in the PARM_DECL slot.
1848 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1849 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1850 /* For a PARM_DECL, records the data type used to pass the argument,
1851 which may be different from the type seen in the program. */
1852 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1853 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1854 if nonzero, indicates that the field occupies the type. */
1855 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1856 /* These two fields describe where in the source code the declaration
1857 was. If the declaration appears in several places (as for a C
1858 function that is declared first and then defined later), this
1859 information should refer to the definition. */
1860 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1861 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1862 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1863 #ifdef USE_MAPPED_LOCATION
1864 #define DECL_IS_BUILTIN(DECL) \
1865 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
1867 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
1869 /* Holds the size of the datum, in bits, as a tree expression.
1870 Need not be constant. */
1871 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1872 /* Likewise for the size in bytes. */
1873 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1874 /* Holds the alignment required for the datum, in bits. */
1875 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1876 /* The alignment of NODE, in bytes. */
1877 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1878 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1879 DECL_FIELD_OFFSET which are known to be always zero.
1880 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1882 #define DECL_OFFSET_ALIGN(NODE) \
1883 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1884 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1885 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1886 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1887 /* 1 if the alignment for this type was requested by "aligned" attribute,
1888 0 if it is the default for this type. */
1889 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1890 /* Holds the machine mode corresponding to the declaration of a variable or
1891 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1893 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1894 /* Holds the RTL expression for the value of a variable or function.
1895 This value can be evaluated lazily for functions, variables with
1896 static storage duration, and labels. */
1897 #define DECL_RTL(NODE) \
1898 (DECL_CHECK (NODE)->decl.rtl \
1899 ? (NODE)->decl.rtl \
1900 : (make_decl_rtl (NODE), (NODE)->decl.rtl))
1901 /* Set the DECL_RTL for NODE to RTL. */
1902 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1903 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1904 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1905 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1906 NODE1, it will not be set for NODE2; this is a lazy copy. */
1907 #define COPY_DECL_RTL(NODE1, NODE2) \
1908 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1909 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1910 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1912 /* For PARM_DECL, holds an RTL for the stack slot or register
1913 where the data was actually passed. */
1914 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1916 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
1917 that describes the status of this function. */
1918 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1920 /* For FUNCTION_DECL, if it is built-in,
1921 this identifies which built-in operation it is. */
1922 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1924 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1925 Before the struct containing the FUNCTION_DECL is laid out,
1926 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1927 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1928 function. When the class is laid out, this pointer is changed
1929 to an INTEGER_CST node which is suitable for use as an index
1930 into the virtual function table. */
1931 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1933 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1934 which this FIELD_DECL is defined. This information is needed when
1935 writing debugging information about vfield and vbase decls for C++. */
1936 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1938 /* Every ..._DECL node gets a unique number. */
1939 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1941 /* For any sort of a ..._DECL node, this points to the original (abstract)
1942 decl node which this decl is an instance of, or else it is NULL indicating
1943 that this decl is not an instance of some other decl. For example,
1944 in a nested declaration of an inline function, this points back to the
1946 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1948 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1949 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1950 #define DECL_ORIGIN(NODE) \
1951 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1953 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1954 inline instance of some original (abstract) decl from an inline function;
1955 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1956 nodes can also have their abstract origin set to themselves. */
1957 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1958 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1960 /* Nonzero if a _DECL means that the name of this decl should be ignored
1961 for symbolic debug purposes. */
1962 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1964 /* Nonzero for a given ..._DECL node means that this node represents an
1965 "abstract instance" of the given declaration (e.g. in the original
1966 declaration of an inline function). When generating symbolic debugging
1967 information, we mustn't try to generate any address information for nodes
1968 marked as "abstract instances" because we don't actually generate
1969 any code or allocate any data space for such instances. */
1970 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1972 /* Nonzero if a _DECL means that no warnings should be generated just
1973 because this decl is unused. */
1974 #define DECL_IN_SYSTEM_HEADER(NODE) \
1975 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1977 /* Nonzero for a given ..._DECL node means that this node should be
1978 put in .common, if possible. If a DECL_INITIAL is given, and it
1979 is not error_mark_node, then the decl cannot be put in .common. */
1980 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1982 /* Language-specific decl information. */
1983 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1985 /* In a VAR_DECL or FUNCTION_DECL,
1986 nonzero means external reference:
1987 do not allocate storage, and refer to a definition elsewhere. */
1988 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1990 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1992 #define DEFAULT_INIT_PRIORITY 65535
1993 #define MAX_INIT_PRIORITY 65535
1994 #define MAX_RESERVED_INIT_PRIORITY 100
1997 nonzero means the detail info about this type is not dumped into stabs.
1998 Instead it will generate cross reference ('x') of names.
1999 This uses the same flag as DECL_EXTERNAL. */
2000 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2001 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
2003 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2004 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
2006 /* In LABEL_DECL nodes, nonzero means that an error message about
2007 jumping into such a binding contour has been printed for this label. */
2008 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
2010 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2011 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
2013 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
2014 static chain is not needed. */
2015 #define DECL_NO_STATIC_CHAIN(NODE) \
2016 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
2018 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2019 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2021 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2023 Also set in some languages for variables, etc., outside the normal
2024 lexical scope, such as class instance variables. */
2025 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
2027 /* Nonzero in a FUNCTION_DECL means this function can be substituted
2028 where it is called. */
2029 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
2031 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2032 such as via the `inline' keyword in C/C++. This flag controls the linkage
2033 semantics of 'inline'; whether or not the function is inlined is
2034 controlled by DECL_INLINE. */
2035 #define DECL_DECLARED_INLINE_P(NODE) \
2036 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
2038 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2039 this variable in a BIND_EXPR. */
2040 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2041 (DECL_CHECK (NODE)->decl.seen_in_bind_expr)
2043 /* In a VAR_DECL, nonzero if the decl is a register variable with
2044 an explicit asm specification. */
2045 #define DECL_HARD_REGISTER(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
2047 /* Value of the decls's visibility attribute */
2048 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility)
2050 /* Nonzero means that the decl had its visibility specified rather than
2052 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_CHECK (NODE)->decl.visibility_specified)
2054 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2055 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
2057 /* In a VAR_DECL, nonzero if the data should be allocated from
2058 thread-local storage. */
2059 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
2061 /* In a FUNCTION_DECL, the saved representation of the body of the
2063 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
2065 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2066 if transformations have made this more complicated than evaluating the
2067 decl itself. This should only be used for debugging; once this field has
2068 been set, the decl itself may not legitimately appear in the function. */
2069 #define DECL_VALUE_EXPR(NODE) \
2070 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl.saved_tree)
2072 /* List of FUNCTION_DECLs inlined into this function's body. */
2073 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
2075 /* Nonzero in a FUNCTION_DECL means this function should be treated
2076 as if it were a malloc, meaning it returns a pointer that is
2078 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
2080 /* Nonzero in a FUNCTION_DECL means this function should be treated
2081 as "pure" function (like const function, but may read global memory). */
2082 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
2084 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2086 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
2088 /* Unused in FUNCTION_DECL. */
2090 /* In a VAR_DECL that's static,
2091 nonzero if the space is in the text section. */
2092 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
2094 /* In a FUNCTION_DECL, nonzero means a built in function. */
2095 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2097 /* For a builtin function, identify which part of the compiler defined it. */
2098 #define DECL_BUILT_IN_CLASS(NODE) \
2099 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
2101 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2102 Used in FIELD_DECLs for vtable pointers.
2103 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2104 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
2106 /* Used to indicate that the linkage status of this DECL is not yet known,
2107 so it should not be output now. */
2108 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
2110 /* Used in PARM_DECLs whose type are unions to indicate that the
2111 argument should be passed in the same way that the first union
2112 alternative would be passed. */
2113 #define DECL_TRANSPARENT_UNION(NODE) \
2114 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
2116 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2117 at the beginning or end of execution. */
2118 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2119 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
2121 #define DECL_STATIC_DESTRUCTOR(NODE) \
2122 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
2124 /* Used to indicate that this DECL represents a compiler-generated entity. */
2125 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
2127 /* Used to indicate that this DECL has weak linkage. */
2128 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
2130 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2131 multiple translation units should be merged. */
2132 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
2134 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2135 not be put out unless it is needed in this translation unit.
2136 Entities like this are shared across translation units (like weak
2137 entities), but are guaranteed to be generated by any translation
2138 unit that needs them, and therefore need not be put out anywhere
2139 where they are not needed. DECL_COMDAT is just a hint to the
2140 back-end; it is up to front-ends which set this flag to ensure
2141 that there will never be any harm, other than bloat, in putting out
2142 something which is DECL_COMDAT. */
2143 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
2145 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2146 be instrumented with calls to support routines. */
2147 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2148 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
2150 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2151 disabled in this function. */
2152 #define DECL_NO_LIMIT_STACK(NODE) \
2153 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
2155 /* Additional flags for language-specific uses. */
2156 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
2157 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
2158 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
2159 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
2160 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
2161 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
2162 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
2163 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
2165 /* Used to indicate that the pointer to this DECL cannot be treated as
2166 an address constant. */
2167 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
2169 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2171 #define DECL_NONADDRESSABLE_P(NODE) \
2172 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
2174 /* Used to indicate an alias set for the memory pointed to by this
2175 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2176 pointer (or reference) type. */
2177 #define DECL_POINTER_ALIAS_SET(NODE) \
2178 (DECL_CHECK (NODE)->decl.pointer_alias_set)
2180 /* Used to store the alias_var for a DECL node. */
2181 #define DECL_PTA_ALIASVAR(NODE) \
2182 (DECL_CHECK (NODE)->decl.alias_var)
2184 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2185 dense, unique within any one function, and may be used to index arrays.
2186 If the value is -1, then no UID has been assigned. */
2187 #define LABEL_DECL_UID(NODE) \
2188 (LABEL_DECL_CHECK (NODE)->decl.pointer_alias_set)
2190 /* Nonzero if an alias set has been assigned to this declaration. */
2191 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2192 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2194 /* Nonzero for a decl which is at file scope. */
2195 #define DECL_FILE_SCOPE_P(EXP) \
2196 (! DECL_CONTEXT (EXP) \
2197 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2199 /* Nonzero for a decl that cgraph has decided should be inlined into
2200 at least one call site. It is not meaningful to look at this
2201 directly; always use cgraph_function_possibly_inlined_p. */
2202 #define DECL_POSSIBLY_INLINED(DECL) \
2203 FUNCTION_DECL_CHECK (DECL)->decl.possibly_inlined
2205 /* Nonzero for a decl that is decorated using attribute used.
2206 This indicates compiler tools that this decl needs to be preserved. */
2207 #define DECL_PRESERVE_P(DECL) \
2208 DECL_CHECK (DECL)->decl.preserve_flag
2210 /* Internal to the gimplifier. Indicates that the value is a formal
2211 temporary controlled by the gimplifier. */
2212 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2213 DECL_CHECK (DECL)->decl.gimple_formal_temp
2215 /* Enumerate visibility settings. */
2216 #ifndef SYMBOL_VISIBILITY_DEFINED
2217 #define SYMBOL_VISIBILITY_DEFINED
2218 enum symbol_visibility
2221 VISIBILITY_INTERNAL,
2223 VISIBILITY_PROTECTED
2228 union alias_var_def;
2229 struct tree_decl GTY(())
2231 struct tree_common common;
2235 ENUM_BITFIELD(machine_mode) mode : 8;
2237 unsigned external_flag : 1;
2238 unsigned nonlocal_flag : 1;
2239 unsigned regdecl_flag : 1;
2240 unsigned inline_flag : 1;
2241 unsigned bit_field_flag : 1;
2242 unsigned virtual_flag : 1;
2243 unsigned ignored_flag : 1;
2244 unsigned abstract_flag : 1;
2246 unsigned in_system_header_flag : 1;
2247 unsigned common_flag : 1;
2248 unsigned defer_output : 1;
2249 unsigned transparent_union : 1;
2250 unsigned static_ctor_flag : 1;
2251 unsigned static_dtor_flag : 1;
2252 unsigned artificial_flag : 1;
2253 unsigned weak_flag : 1;
2255 unsigned non_addr_const_p : 1;
2256 unsigned no_instrument_function_entry_exit : 1;
2257 unsigned comdat_flag : 1;
2258 unsigned malloc_flag : 1;
2259 unsigned no_limit_stack : 1;
2260 ENUM_BITFIELD(built_in_class) built_in_class : 2;
2261 unsigned pure_flag : 1;
2263 unsigned non_addressable : 1;
2264 unsigned user_align : 1;
2265 unsigned uninlinable : 1;
2266 unsigned thread_local_flag : 1;
2267 unsigned declared_inline_flag : 1;
2268 unsigned seen_in_bind_expr : 1;
2269 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2270 unsigned visibility_specified : 1;
2272 unsigned lang_flag_0 : 1;
2273 unsigned lang_flag_1 : 1;
2274 unsigned lang_flag_2 : 1;
2275 unsigned lang_flag_3 : 1;
2276 unsigned lang_flag_4 : 1;
2277 unsigned lang_flag_5 : 1;
2278 unsigned lang_flag_6 : 1;
2279 unsigned lang_flag_7 : 1;
2281 unsigned possibly_inlined : 1;
2282 unsigned preserve_flag: 1;
2283 unsigned gimple_formal_temp : 1;
2284 /* 13 unused bits. */
2286 union tree_decl_u1 {
2287 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2288 DECL_FUNCTION_CODE. */
2289 enum built_in_function f;
2290 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2291 is used by language-dependent code. */
2293 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2295 struct tree_decl_u1_a {
2296 unsigned int align : 24;
2297 unsigned int off_align : 8;
2304 tree arguments; /* Also used for DECL_FIELD_OFFSET */
2305 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
2306 tree initial; /* Also used for DECL_QUALIFIER */
2307 tree abstract_origin;
2308 tree assembler_name;
2311 rtx rtl; /* RTL representation for object. */
2313 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
2314 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
2315 In PARM_DECL, holds an RTL for the stack slot
2316 of register where the data was actually passed.
2317 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
2318 union tree_decl_u2 {
2319 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
2320 rtx GTY ((tag ("PARM_DECL"))) r;
2321 tree GTY ((tag ("FIELD_DECL"))) t;
2322 int GTY ((tag ("VAR_DECL"))) i;
2323 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
2325 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE.
2326 In a VAR_DECL or PARM_DECL, this is DECL_VALUE_EXPR. */
2329 /* In a FUNCTION_DECL, these are function data which is to be kept
2330 as long as FUNCTION_DECL is kept. */
2334 HOST_WIDE_INT pointer_alias_set;
2335 union alias_var_def *GTY ((skip(""))) alias_var;
2336 /* Points to a structure whose details depend on the language in use. */
2337 struct lang_decl *lang_specific;
2341 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2342 To reduce overhead, the nodes containing the statements are not trees.
2343 This avoids the overhead of tree_common on all linked list elements.
2345 Use the interface in tree-iterator.h to access this node. */
2347 #define STATEMENT_LIST_HEAD(NODE) \
2348 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2349 #define STATEMENT_LIST_TAIL(NODE) \
2350 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2352 struct tree_statement_list_node
2353 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
2355 struct tree_statement_list_node *prev;
2356 struct tree_statement_list_node *next;
2360 struct tree_statement_list
2363 struct tree_common common;
2364 struct tree_statement_list_node *head;
2365 struct tree_statement_list_node *tail;
2368 #define VALUE_HANDLE_ID(NODE) \
2369 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
2371 #define VALUE_HANDLE_EXPR_SET(NODE) \
2372 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
2374 /* Defined and used in tree-ssa-pre.c. */
2377 struct tree_value_handle GTY(())
2379 struct tree_common common;
2381 /* The set of expressions represented by this handle. */
2382 struct value_set * GTY ((skip)) expr_set;
2384 /* Unique ID for this value handle. IDs are handed out in a
2385 conveniently dense form starting at 0, so that we can make
2386 bitmaps of value handles. */
2390 enum tree_node_structure_enum {
2412 /* Define the overall contents of a tree node.
2413 It may be any of the structures declared above
2414 for various types of node. */
2416 union tree_node GTY ((ptr_alias (union lang_tree_node),
2417 desc ("tree_node_structure (&%h)")))
2419 struct tree_common GTY ((tag ("TS_COMMON"))) common;
2420 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
2421 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
2422 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
2423 struct tree_string GTY ((tag ("TS_STRING"))) string;
2424 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
2425 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
2426 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
2427 struct tree_type GTY ((tag ("TS_TYPE"))) type;
2428 struct tree_list GTY ((tag ("TS_LIST"))) list;
2429 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
2430 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
2431 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
2432 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
2433 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
2434 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
2435 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
2436 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
2439 /* Standard named or nameless data types of the C compiler. */
2458 TI_INTEGER_MINUS_ONE,
2475 TI_COMPLEX_INTEGER_TYPE,
2476 TI_COMPLEX_FLOAT_TYPE,
2477 TI_COMPLEX_DOUBLE_TYPE,
2478 TI_COMPLEX_LONG_DOUBLE_TYPE,
2482 TI_LONG_DOUBLE_TYPE,
2486 TI_LONG_DOUBLE_PTR_TYPE,
2487 TI_INTEGER_PTR_TYPE,
2506 extern GTY(()) tree global_trees[TI_MAX];
2508 #define error_mark_node global_trees[TI_ERROR_MARK]
2510 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2511 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2512 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2513 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2514 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2516 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2517 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2518 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2519 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2520 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2522 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2523 #define integer_one_node global_trees[TI_INTEGER_ONE]
2524 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2525 #define size_zero_node global_trees[TI_SIZE_ZERO]
2526 #define size_one_node global_trees[TI_SIZE_ONE]
2527 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2528 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2529 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2531 /* Base access nodes. */
2532 #define access_public_node global_trees[TI_PUBLIC]
2533 #define access_protected_node global_trees[TI_PROTECTED]
2534 #define access_private_node global_trees[TI_PRIVATE]
2536 #define null_pointer_node global_trees[TI_NULL_POINTER]
2538 #define float_type_node global_trees[TI_FLOAT_TYPE]
2539 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2540 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2542 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
2543 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
2544 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
2545 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
2547 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2548 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2549 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2550 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2552 #define void_type_node global_trees[TI_VOID_TYPE]
2553 /* The C type `void *'. */
2554 #define ptr_type_node global_trees[TI_PTR_TYPE]
2555 /* The C type `const void *'. */
2556 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2557 /* The C type `size_t'. */
2558 #define size_type_node global_trees[TI_SIZE_TYPE]
2559 #define pid_type_node global_trees[TI_PID_TYPE]
2560 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2561 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2562 /* The C type `FILE *'. */
2563 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
2565 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
2566 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
2567 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
2569 /* The node that should be placed at the end of a parameter list to
2570 indicate that the function does not take a variable number of
2571 arguments. The TREE_VALUE will be void_type_node and there will be
2572 no TREE_CHAIN. Language-independent code should not assume
2573 anything else about this node. */
2574 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2576 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2577 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2579 /* An enumeration of the standard C integer types. These must be
2580 ordered so that shorter types appear before longer ones, and so
2581 that signed types appear before unsigned ones, for the correct
2582 functioning of interpret_integer() in c-lex.c. */
2583 enum integer_type_kind
2595 itk_unsigned_long_long,
2599 typedef enum integer_type_kind integer_type_kind;
2601 /* The standard C integer types. Use integer_type_kind to index into
2603 extern GTY(()) tree integer_types[itk_none];
2605 #define char_type_node integer_types[itk_char]
2606 #define signed_char_type_node integer_types[itk_signed_char]
2607 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2608 #define short_integer_type_node integer_types[itk_short]
2609 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2610 #define integer_type_node integer_types[itk_int]
2611 #define unsigned_type_node integer_types[itk_unsigned_int]
2612 #define long_integer_type_node integer_types[itk_long]
2613 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2614 #define long_long_integer_type_node integer_types[itk_long_long]
2615 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2617 /* Set to the default thread-local storage (tls) model to use. */
2619 extern enum tls_model flag_tls_default;
2622 /* A pointer-to-function member type looks like:
2629 If __pfn is NULL, it is a NULL pointer-to-member-function.
2631 (Because the vtable is always the first thing in the object, we
2632 don't need its offset.) If the function is virtual, then PFN is
2633 one plus twice the index into the vtable; otherwise, it is just a
2634 pointer to the function.
2636 Unfortunately, using the lowest bit of PFN doesn't work in
2637 architectures that don't impose alignment requirements on function
2638 addresses, or that use the lowest bit to tell one ISA from another,
2639 for example. For such architectures, we use the lowest bit of
2640 DELTA instead of the lowest bit of the PFN, and DELTA will be
2643 enum ptrmemfunc_vbit_where_t
2645 ptrmemfunc_vbit_in_pfn,
2646 ptrmemfunc_vbit_in_delta
2649 #define NULL_TREE (tree) NULL
2651 extern GTY(()) tree frame_base_decl;
2652 extern tree decl_assembler_name (tree);
2654 /* Compute the number of bytes occupied by 'node'. This routine only
2655 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2657 extern size_t tree_size (tree);
2659 /* Compute the number of bytes occupied by a tree with code CODE. This
2660 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
2662 extern size_t tree_code_size (enum tree_code);
2664 /* Lowest level primitive for allocating a node.
2665 The TREE_CODE is the only argument. Contents are initialized
2666 to zero except for a few of the common fields. */
2668 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
2669 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
2671 /* Make a copy of a node, with all the same contents. */
2673 extern tree copy_node_stat (tree MEM_STAT_DECL);
2674 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
2676 /* Make a copy of a chain of TREE_LIST nodes. */
2678 extern tree copy_list (tree);
2681 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
2682 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
2684 /* Make a TREE_VEC. */
2686 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
2687 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
2689 /* Tree nodes for SSA analysis. */
2691 extern tree make_phi_node (tree, int);
2692 extern void init_phinodes (void);
2693 extern void fini_phinodes (void);
2694 extern void release_phi_node (tree);
2695 #ifdef GATHER_STATISTICS
2696 extern void phinodes_print_statistics (void);
2699 extern void init_ssanames (void);
2700 extern void fini_ssanames (void);
2701 extern tree make_ssa_name (tree, tree);
2702 extern tree duplicate_ssa_name (tree, tree);
2703 extern void release_ssa_name (tree);
2704 extern void release_defs (tree);
2705 extern void replace_ssa_name_symbol (tree, tree);
2707 #ifdef GATHER_STATISTICS
2708 extern void ssanames_print_statistics (void);
2711 extern void mark_for_rewrite (tree);
2712 extern void unmark_all_for_rewrite (void);
2713 extern bool marked_for_rewrite_p (tree);
2714 extern bool any_marked_for_rewrite_p (void);
2715 extern struct bitmap_head_def *marked_ssa_names (void);
2718 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2719 The name is supplied as a char *. */
2721 extern tree get_identifier (const char *);
2723 #if GCC_VERSION >= 3000
2724 #define get_identifier(str) \
2725 (__builtin_constant_p (str) \
2726 ? get_identifier_with_length ((str), strlen (str)) \
2727 : get_identifier (str))
2731 /* Identical to get_identifier, except that the length is assumed
2734 extern tree get_identifier_with_length (const char *, size_t);
2736 /* If an identifier with the name TEXT (a null-terminated string) has
2737 previously been referred to, return that node; otherwise return
2740 extern tree maybe_get_identifier (const char *);
2742 /* Construct various types of nodes. */
2744 extern tree build (enum tree_code, tree, ...);
2745 extern tree build_nt (enum tree_code, ...);
2747 #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L
2748 /* Use preprocessor trickery to map "build" to "buildN" where N is the
2749 expected number of arguments. This is used for both efficiency (no
2750 varargs), and checking (verifying number of passed arguments). */
2751 #define build(code, ...) \
2752 _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__)
2753 #define _buildN1(BASE, X) _buildN2(BASE, X)
2754 #define _buildN2(BASE, X) BASE##X
2755 #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0)
2756 #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c
2759 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
2760 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
2761 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2762 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
2763 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
2764 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
2765 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
2766 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
2767 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
2768 tree MEM_STAT_DECL);
2769 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
2771 extern tree build_int_cst (tree, HOST_WIDE_INT);
2772 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
2773 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
2774 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2775 extern tree build_vector (tree, tree);
2776 extern tree build_constructor (tree, tree);
2777 extern tree build_real_from_int_cst (tree, tree);
2778 extern tree build_complex (tree, tree, tree);
2779 extern tree build_string (int, const char *);
2780 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
2781 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
2782 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2783 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
2784 extern tree build_block (tree, tree, tree, tree, tree);
2785 #ifndef USE_MAPPED_LOCATION
2786 extern void annotate_with_file_line (tree, const char *, int);
2787 extern void annotate_with_locus (tree, location_t);
2789 extern tree build_empty_stmt (void);
2791 /* Construct various nodes representing data types. */
2793 extern tree make_signed_type (int);
2794 extern tree make_unsigned_type (int);
2795 extern tree unsigned_type_for (tree);
2796 extern void initialize_sizetypes (bool);
2797 extern void set_sizetype (tree);
2798 extern void fixup_unsigned_type (tree);
2799 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
2800 extern tree build_pointer_type (tree);
2801 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
2802 extern tree build_reference_type (tree);
2803 extern tree build_vector_type_for_mode (tree, enum machine_mode);
2804 extern tree build_vector_type (tree innertype, int nunits);
2805 extern tree build_type_no_quals (tree);
2806 extern tree build_index_type (tree);
2807 extern tree build_index_2_type (tree, tree);
2808 extern tree build_array_type (tree, tree);
2809 extern tree build_function_type (tree, tree);
2810 extern tree build_function_type_list (tree, ...);
2811 extern tree build_method_type_directly (tree, tree, tree);
2812 extern tree build_method_type (tree, tree);
2813 extern tree build_offset_type (tree, tree);
2814 extern tree build_complex_type (tree);
2815 extern tree array_type_nelts (tree);
2816 extern bool in_array_bounds_p (tree);
2818 extern tree value_member (tree, tree);
2819 extern tree purpose_member (tree, tree);
2821 extern int attribute_list_equal (tree, tree);
2822 extern int attribute_list_contained (tree, tree);
2823 extern int tree_int_cst_equal (tree, tree);
2824 extern int tree_int_cst_lt (tree, tree);
2825 extern int tree_int_cst_compare (tree, tree);
2826 extern int host_integerp (tree, int);
2827 extern HOST_WIDE_INT tree_low_cst (tree, int);
2828 extern int tree_int_cst_msb (tree);
2829 extern int tree_int_cst_sgn (tree);
2830 extern int tree_expr_nonnegative_p (tree);
2831 extern bool may_negate_without_overflow_p (tree);
2832 extern tree get_inner_array_type (tree);
2834 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2835 put the prototype here. Rtl.h does declare the prototype if
2836 tree.h had been included. */
2838 extern tree make_tree (tree, rtx);
2840 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2843 Such modified types already made are recorded so that duplicates
2846 extern tree build_type_attribute_variant (tree, tree);
2847 extern tree build_decl_attribute_variant (tree, tree);
2849 /* Structure describing an attribute and a function to handle it. */
2850 struct attribute_spec
2852 /* The name of the attribute (without any leading or trailing __),
2853 or NULL to mark the end of a table of attributes. */
2854 const char *const name;
2855 /* The minimum length of the list of arguments of the attribute. */
2856 const int min_length;
2857 /* The maximum length of the list of arguments of the attribute
2858 (-1 for no maximum). */
2859 const int max_length;
2860 /* Whether this attribute requires a DECL. If it does, it will be passed
2861 from types of DECLs, function return types and array element types to
2862 the DECLs, function types and array types respectively; but when
2863 applied to a type in any other circumstances, it will be ignored with
2864 a warning. (If greater control is desired for a given attribute,
2865 this should be false, and the flags argument to the handler may be
2866 used to gain greater control in that case.) */
2867 const bool decl_required;
2868 /* Whether this attribute requires a type. If it does, it will be passed
2869 from a DECL to the type of that DECL. */
2870 const bool type_required;
2871 /* Whether this attribute requires a function (or method) type. If it does,
2872 it will be passed from a function pointer type to the target type,
2873 and from a function return type (which is not itself a function
2874 pointer type) to the function type. */
2875 const bool function_type_required;
2876 /* Function to handle this attribute. NODE points to the node to which
2877 the attribute is to be applied. If a DECL, it should be modified in
2878 place; if a TYPE, a copy should be created. NAME is the name of the
2879 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2880 of the arguments (which may be NULL). FLAGS gives further information
2881 about the context of the attribute. Afterwards, the attributes will
2882 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2883 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2884 as well as in any other cases when the attributes should not be added
2885 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2886 applied to another type or DECL later may be returned;
2887 otherwise the return value should be NULL_TREE. This pointer may be
2888 NULL if no special handling is required beyond the checks implied
2889 by the rest of this structure. */
2890 tree (*const handler) (tree *node, tree name, tree args,
2891 int flags, bool *no_add_attrs);
2894 /* Flags that may be passed in the third argument of decl_attributes, and
2895 to handler functions for attributes. */
2896 enum attribute_flags
2898 /* The type passed in is the type of a DECL, and any attributes that
2899 should be passed in again to be applied to the DECL rather than the
2900 type should be returned. */
2901 ATTR_FLAG_DECL_NEXT = 1,
2902 /* The type passed in is a function return type, and any attributes that
2903 should be passed in again to be applied to the function type rather
2904 than the return type should be returned. */
2905 ATTR_FLAG_FUNCTION_NEXT = 2,
2906 /* The type passed in is an array element type, and any attributes that
2907 should be passed in again to be applied to the array type rather
2908 than the element type should be returned. */
2909 ATTR_FLAG_ARRAY_NEXT = 4,
2910 /* The type passed in is a structure, union or enumeration type being
2911 created, and should be modified in place. */
2912 ATTR_FLAG_TYPE_IN_PLACE = 8,
2913 /* The attributes are being applied by default to a library function whose
2914 name indicates known behavior, and should be silently ignored if they
2915 are not in fact compatible with the function type. */
2916 ATTR_FLAG_BUILT_IN = 16
2919 /* Default versions of target-overridable functions. */
2921 extern tree merge_decl_attributes (tree, tree);
2922 extern tree merge_type_attributes (tree, tree);
2923 extern void default_register_cpp_builtins (struct cpp_reader *);
2925 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2927 extern int valid_machine_attribute (tree, tree, tree, tree);
2929 /* Given a tree node and a string, return nonzero if the tree node is
2930 a valid attribute name for the string. */
2932 extern int is_attribute_p (const char *, tree);
2934 /* Given an attribute name and a list of attributes, return the list element
2935 of the attribute or NULL_TREE if not found. */
2937 extern tree lookup_attribute (const char *, tree);
2939 /* Given two attributes lists, return a list of their union. */
2941 extern tree merge_attributes (tree, tree);
2943 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
2944 /* Given two Windows decl attributes lists, possibly including
2945 dllimport, return a list of their union . */
2946 extern tree merge_dllimport_decl_attributes (tree, tree);
2948 /* Handle a "dllimport" or "dllexport" attribute. */
2949 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
2952 /* Check whether CAND is suitable to be returned from get_qualified_type
2953 (BASE, TYPE_QUALS). */
2955 extern bool check_qualified_type (tree, tree, int);
2957 /* Return a version of the TYPE, qualified as indicated by the
2958 TYPE_QUALS, if one exists. If no qualified version exists yet,
2959 return NULL_TREE. */
2961 extern tree get_qualified_type (tree, int);
2963 /* Like get_qualified_type, but creates the type if it does not
2964 exist. This function never returns NULL_TREE. */
2966 extern tree build_qualified_type (tree, int);
2968 /* Like build_qualified_type, but only deals with the `const' and
2969 `volatile' qualifiers. This interface is retained for backwards
2970 compatibility with the various front-ends; new code should use
2971 build_qualified_type instead. */
2973 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2974 build_qualified_type ((TYPE), \
2975 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2976 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2978 /* Make a copy of a type node. */
2980 extern tree build_distinct_type_copy (tree);
2981 extern tree build_variant_type_copy (tree);
2983 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2984 fields. Optionally specify an alignment, and then lay it out. */
2986 extern void finish_builtin_struct (tree, const char *,
2989 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2990 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2991 node, does nothing except for the first time. */
2993 extern void layout_type (tree);
2995 /* These functions allow a front-end to perform a manual layout of a
2996 RECORD_TYPE. (For instance, if the placement of subsequent fields
2997 depends on the placement of fields so far.) Begin by calling
2998 start_record_layout. Then, call place_field for each of the
2999 fields. Then, call finish_record_layout. See layout_type for the
3000 default way in which these functions are used. */
3002 typedef struct record_layout_info_s
3004 /* The RECORD_TYPE that we are laying out. */
3006 /* The offset into the record so far, in bytes, not including bits in
3009 /* The last known alignment of SIZE. */
3010 unsigned int offset_align;
3011 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3013 /* The alignment of the record so far, in bits. */
3014 unsigned int record_align;
3015 /* The alignment of the record so far, ignoring #pragma pack and
3016 __attribute__ ((packed)), in bits. */
3017 unsigned int unpacked_align;
3018 /* The previous field layed out. */
3020 /* The static variables (i.e., class variables, as opposed to
3021 instance variables) encountered in T. */
3022 tree pending_statics;
3023 /* Bits remaining in the current alignment group */
3024 int remaining_in_alignment;
3025 /* True if we've seen a packed field that didn't have normal
3026 alignment anyway. */
3027 int packed_maybe_necessary;
3028 } *record_layout_info;
3030 extern void set_lang_adjust_rli (void (*) (record_layout_info));
3031 extern record_layout_info start_record_layout (tree);
3032 extern tree bit_from_pos (tree, tree);
3033 extern tree byte_from_pos (tree, tree);
3034 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
3035 extern void normalize_offset (tree *, tree *, unsigned int);
3036 extern tree rli_size_unit_so_far (record_layout_info);
3037 extern tree rli_size_so_far (record_layout_info);
3038 extern void normalize_rli (record_layout_info);
3039 extern void place_field (record_layout_info, tree);
3040 extern void compute_record_mode (tree);
3041 extern void finish_record_layout (record_layout_info, int);
3043 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3044 return a canonicalized ..._TYPE node, so that duplicates are not made.
3045 How the hash code is computed is up to the caller, as long as any two
3046 callers that could hash identical-looking type nodes agree. */
3048 extern tree type_hash_canon (unsigned int, tree);
3050 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3051 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3052 fields. Call this only once for any given decl node.
3054 Second argument is the boundary that this field can be assumed to
3055 be starting at (in bits). Zero means it can be assumed aligned
3056 on any boundary that may be needed. */
3058 extern void layout_decl (tree, unsigned);
3060 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3061 a previous call to layout_decl and calls it again. */
3063 extern void relayout_decl (tree);
3065 /* Return the mode for data of a given size SIZE and mode class CLASS.
3066 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3067 The value is BLKmode if no other mode is found. This is like
3068 mode_for_size, but is passed a tree. */
3070 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
3072 /* Return an expr equal to X but certainly not valid as an lvalue. */
3074 extern tree non_lvalue (tree);
3075 extern tree pedantic_non_lvalue (tree);
3077 extern tree convert (tree, tree);
3078 extern unsigned int expr_align (tree);
3079 extern tree expr_first (tree);
3080 extern tree expr_last (tree);
3081 extern tree expr_only (tree);
3082 extern tree size_in_bytes (tree);
3083 extern HOST_WIDE_INT int_size_in_bytes (tree);
3084 extern tree bit_position (tree);
3085 extern HOST_WIDE_INT int_bit_position (tree);
3086 extern tree byte_position (tree);
3087 extern HOST_WIDE_INT int_byte_position (tree);
3089 /* Define data structures, macros, and functions for handling sizes
3090 and the various types used to represent sizes. */
3094 SIZETYPE, /* Normal representation of sizes in bytes. */
3095 SSIZETYPE, /* Signed representation of sizes in bytes. */
3096 BITSIZETYPE, /* Normal representation of sizes in bits. */
3097 SBITSIZETYPE, /* Signed representation of sizes in bits. */
3100 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
3102 #define sizetype sizetype_tab[(int) SIZETYPE]
3103 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
3104 #define ssizetype sizetype_tab[(int) SSIZETYPE]
3105 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
3107 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
3108 extern tree size_binop (enum tree_code, tree, tree);
3109 extern tree size_diffop (tree, tree);
3111 #define size_int(L) size_int_kind (L, SIZETYPE)
3112 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
3113 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
3114 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
3116 extern tree round_up (tree, int);
3117 extern tree round_down (tree, int);
3118 extern tree get_pending_sizes (void);
3119 extern void put_pending_size (tree);
3120 extern void put_pending_sizes (tree);
3122 /* Type for sizes of data-type. */
3124 #define BITS_PER_UNIT_LOG \
3125 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3126 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3127 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3129 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
3130 extern unsigned int maximum_field_alignment;
3131 /* and its original value in bytes, specified via -fpack-struct=<value>. */
3132 extern unsigned int initial_max_fld_align;
3134 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
3135 extern unsigned int set_alignment;
3137 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3138 by making the last node in X point to Y.
3139 Returns X, except if X is 0 returns Y. */
3141 extern tree chainon (tree, tree);
3143 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3145 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3146 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3148 /* Return the last tree node in a chain. */
3150 extern tree tree_last (tree);
3152 /* Reverse the order of elements in a chain, and return the new head. */
3154 extern tree nreverse (tree);
3156 /* Returns the length of a chain of nodes
3157 (number of chain pointers to follow before reaching a null pointer). */
3159 extern int list_length (tree);
3161 /* Returns the number of FIELD_DECLs in a type. */
3163 extern int fields_length (tree);
3165 /* Given an initializer INIT, return TRUE if INIT is zero or some
3166 aggregate of zeros. Otherwise return FALSE. */
3168 extern bool initializer_zerop (tree);
3170 extern void categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *);
3171 extern HOST_WIDE_INT count_type_elements (tree);
3172 extern int mostly_zeros_p (tree);
3174 /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */
3176 extern void add_var_to_bind_expr (tree, tree);
3178 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
3180 extern int integer_zerop (tree);
3182 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
3184 extern int integer_onep (tree);
3186 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3187 all of whose significant bits are 1. */
3189 extern int integer_all_onesp (tree);
3191 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3192 exactly one bit 1. */
3194 extern int integer_pow2p (tree);
3196 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3197 with a nonzero value. */
3199 extern int integer_nonzerop (tree);
3201 extern bool zero_p (tree);
3202 extern bool cst_and_fits_in_hwi (tree);
3204 /* staticp (tree x) is nonzero if X is a reference to data allocated
3205 at a fixed address in memory. Returns the outermost data. */
3207 extern tree staticp (tree);
3209 /* save_expr (EXP) returns an expression equivalent to EXP
3210 but it can be used multiple times within context CTX
3211 and only evaluate EXP once. */
3213 extern tree save_expr (tree);
3215 /* Look inside EXPR and into any simple arithmetic operations. Return
3216 the innermost non-arithmetic node. */
3218 extern tree skip_simple_arithmetic (tree);
3220 /* Returns the index of the first non-tree operand for CODE, or the number
3221 of operands if all are trees. */
3223 extern int first_rtl_op (enum tree_code);
3225 /* Return which tree structure is used by T. */
3227 enum tree_node_structure_enum tree_node_structure (tree);
3229 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
3230 or offset that depends on a field within a record.
3232 Note that we only allow such expressions within simple arithmetic
3235 extern bool contains_placeholder_p (tree);
3237 /* This macro calls the above function but short-circuits the common
3238 case of a constant to save time. Also check for null. */
3240 #define CONTAINS_PLACEHOLDER_P(EXP) \
3241 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
3243 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
3244 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
3247 extern bool type_contains_placeholder_p (tree);
3249 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3250 return a tree with all occurrences of references to F in a
3251 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
3252 contains only arithmetic expressions. */
3254 extern tree substitute_in_expr (tree, tree, tree);
3256 /* This macro calls the above function but short-circuits the common
3257 case of a constant to save time and also checks for NULL. */
3259 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
3260 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
3262 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3263 for it within OBJ, a tree that is an object or a chain of references. */
3265 extern tree substitute_placeholder_in_expr (tree, tree);
3267 /* This macro calls the above function but short-circuits the common
3268 case of a constant to save time and also checks for NULL. */
3270 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
3271 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
3272 : substitute_placeholder_in_expr (EXP, OBJ))
3274 /* variable_size (EXP) is like save_expr (EXP) except that it
3275 is for the special case of something that is part of a
3276 variable size for a data type. It makes special arrangements
3277 to compute the value at the right time when the data type
3278 belongs to a function parameter. */
3280 extern tree variable_size (tree);
3282 /* stabilize_reference (EXP) returns a reference equivalent to EXP
3283 but it can be used multiple times
3284 and only evaluate the subexpressions once. */
3286 extern tree stabilize_reference (tree);
3288 /* Subroutine of stabilize_reference; this is called for subtrees of
3289 references. Any expression with side-effects must be put in a SAVE_EXPR
3290 to ensure that it is only evaluated once. */
3292 extern tree stabilize_reference_1 (tree);
3294 /* Return EXP, stripped of any conversions to wider types
3295 in such a way that the result of converting to type FOR_TYPE
3296 is the same as if EXP were converted to FOR_TYPE.
3297 If FOR_TYPE is 0, it signifies EXP's type. */
3299 extern tree get_unwidened (tree, tree);
3301 /* Return OP or a simpler expression for a narrower value
3302 which can be sign-extended or zero-extended to give back OP.
3303 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3304 or 0 if the value should be sign-extended. */
3306 extern tree get_narrower (tree, int *);
3308 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
3309 look for nested component-refs or array-refs at constant positions
3310 and find the ultimate containing object, which is returned. */
3312 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3313 tree *, enum machine_mode *, int *, int *);
3315 /* Return 1 if T is an expression that get_inner_reference handles. */
3317 extern int handled_component_p (tree);
3319 /* Return a tree of sizetype representing the size, in bytes, of the element
3320 of EXP, an ARRAY_REF. */
3322 extern tree array_ref_element_size (tree);
3324 /* Return a tree representing the lower bound of the array mentioned in
3325 EXP, an ARRAY_REF. */
3327 extern tree array_ref_low_bound (tree);
3329 /* Return a tree representing the upper bound of the array mentioned in
3330 EXP, an ARRAY_REF. */
3332 extern tree array_ref_up_bound (tree);
3334 /* Return a tree representing the offset, in bytes, of the field referenced
3335 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
3337 extern tree component_ref_field_offset (tree);
3339 /* Given a DECL or TYPE, return the scope in which it was declared, or
3340 NUL_TREE if there is no containing scope. */
3342 extern tree get_containing_scope (tree);
3344 /* Return the FUNCTION_DECL which provides this _DECL with its context,
3346 extern tree decl_function_context (tree);
3348 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
3349 this _DECL with its context, or zero if none. */
3350 extern tree decl_type_context (tree);
3352 /* Return 1 if EXPR is the real constant zero. */
3353 extern int real_zerop (tree);
3355 /* Declare commonly used variables for tree structure. */
3357 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
3358 Zero means allow extended lvalues. */
3360 extern int pedantic_lvalues;
3362 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
3364 extern GTY(()) tree current_function_decl;
3366 /* Nonzero means a FUNC_BEGIN label was emitted. */
3367 extern GTY(()) const char * current_function_func_begin_label;
3370 extern unsigned crc32_string (unsigned, const char *);
3371 extern void clean_symbol_name (char *);
3372 extern tree get_file_function_name_long (const char *);
3373 extern tree get_set_constructor_bits (tree, char *, int);
3374 extern tree get_set_constructor_bytes (tree, unsigned char *, int);
3375 extern tree get_callee_fndecl (tree);
3376 extern void change_decl_assembler_name (tree, tree);
3377 extern int type_num_arguments (tree);
3378 extern bool associative_tree_code (enum tree_code);
3379 extern bool commutative_tree_code (enum tree_code);
3384 extern void expand_expr_stmt (tree);
3385 extern void expand_expr_stmt_value (tree, int, int);
3386 extern int warn_if_unused_value (tree, location_t);
3387 extern void expand_decl_init (tree);
3388 extern void expand_label (tree);
3389 extern void expand_goto (tree);
3390 extern void expand_asm (tree, int);
3392 extern rtx expand_stack_save (void);
3393 extern void expand_stack_restore (tree);
3394 extern void expand_return (tree);
3395 extern int is_body_block (tree);
3398 extern void using_eh_for_cleanups (void);
3400 /* In fold-const.c */
3402 /* Fold constants as much as possible in an expression.
3403 Returns the simplified expression.
3404 Acts only on the top level of the expression;
3405 if the argument itself cannot be simplified, its
3406 subexpressions are not changed. */
3408 extern tree fold (tree);
3409 extern tree fold_initializer (tree);
3410 extern tree fold_convert (tree, tree);
3411 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
3412 extern tree fold_ignored_result (tree);
3413 extern tree fold_abs_const (tree, tree);
3415 extern tree force_fit_type (tree, int, bool, bool);
3417 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3418 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3419 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3420 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3421 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3422 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3423 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3424 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3425 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3426 HOST_WIDE_INT, unsigned int,
3427 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3428 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3429 HOST_WIDE_INT, unsigned int,
3430 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3431 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3432 HOST_WIDE_INT, unsigned int,
3433 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3434 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3435 HOST_WIDE_INT, unsigned int,
3436 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3438 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
3439 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
3440 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
3441 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
3444 enum operand_equal_flag
3450 extern int operand_equal_p (tree, tree, unsigned int);
3452 extern tree omit_one_operand (tree, tree, tree);
3453 extern tree omit_two_operands (tree, tree, tree, tree);
3454 extern tree invert_truthvalue (tree);
3455 extern tree nondestructive_fold_unary_to_constant (enum tree_code, tree, tree);
3456 extern tree nondestructive_fold_binary_to_constant (enum tree_code, tree, tree, tree);
3457 extern tree fold_read_from_constant_string (tree);
3458 extern tree int_const_binop (enum tree_code, tree, tree, int);
3459 extern tree build_fold_addr_expr (tree);
3460 extern tree build_fold_addr_expr_with_type (tree, tree);
3461 extern tree build_fold_indirect_ref (tree);
3462 extern tree constant_boolean_node (int, tree);
3464 extern bool tree_swap_operands_p (tree, tree, bool);
3465 extern enum tree_code swap_tree_comparison (enum tree_code);
3468 extern tree fold_builtin (tree, bool);
3469 extern tree fold_builtin_fputs (tree, bool, bool, tree);
3470 extern tree fold_builtin_strcpy (tree, tree);
3471 extern tree fold_builtin_strncpy (tree, tree);
3472 extern enum built_in_function builtin_mathfn_code (tree);
3473 extern tree build_function_call_expr (tree, tree);
3474 extern tree mathfn_built_in (tree, enum built_in_function fn);
3475 extern tree strip_float_extensions (tree);
3476 extern tree simplify_builtin (tree, int);
3477 extern tree c_strlen (tree, int);
3478 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
3479 extern tree build_va_arg_indirect_ref (tree);
3482 extern tree strip_float_extensions (tree);
3485 extern void record_component_aliases (tree);
3486 extern HOST_WIDE_INT get_alias_set (tree);
3487 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3488 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3489 extern int objects_must_conflict_p (tree, tree);
3492 extern int really_constant_p (tree);
3493 extern int int_fits_type_p (tree, tree);
3494 extern bool variably_modified_type_p (tree, tree);
3495 extern int tree_log2 (tree);
3496 extern int tree_floor_log2 (tree);
3497 extern int simple_cst_equal (tree, tree);
3498 extern unsigned int iterative_hash_expr (tree, unsigned int);
3499 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
3500 extern int type_list_equal (tree, tree);
3501 extern int chain_member (tree, tree);
3502 extern tree type_hash_lookup (unsigned int, tree);
3503 extern void type_hash_add (unsigned int, tree);
3504 extern int simple_cst_list_equal (tree, tree);
3505 extern void dump_tree_statistics (void);
3506 extern void expand_function_end (void);
3507 extern void expand_function_start (tree);
3508 extern void expand_pending_sizes (tree);
3509 extern void recompute_tree_invarant_for_addr_expr (tree);
3510 extern bool is_global_var (tree t);
3511 extern bool needs_to_live_in_memory (tree);
3512 extern tree reconstruct_complex_type (tree, tree);
3514 extern int real_onep (tree);
3515 extern int real_twop (tree);
3516 extern int real_minus_onep (tree);
3517 extern void init_ttree (void);
3518 extern void build_common_tree_nodes (bool, bool);
3519 extern void build_common_tree_nodes_2 (int);
3520 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
3521 extern tree build_range_type (tree, tree, tree);
3522 extern HOST_WIDE_INT int_cst_value (tree);
3523 extern tree tree_fold_gcd (tree, tree);
3524 extern tree build_addr (tree);
3526 extern bool fields_compatible_p (tree, tree);
3527 extern tree find_compatible_field (tree, tree);
3530 extern void expand_main_function (void);
3531 extern void init_dummy_function_start (void);
3532 extern void expand_dummy_function_end (void);
3533 extern void init_function_for_compilation (void);
3534 extern void allocate_struct_function (tree);
3535 extern void init_function_start (tree);
3536 extern bool use_register_for_decl (tree);
3537 extern void assign_parms (tree);
3538 extern void setjmp_vars_warning (tree);
3539 extern void setjmp_args_warning (void);
3540 extern void init_temp_slots (void);
3541 extern void combine_temp_slots (void);
3542 extern void free_temp_slots (void);
3543 extern void pop_temp_slots (void);
3544 extern void push_temp_slots (void);
3545 extern void preserve_temp_slots (rtx);
3546 extern void preserve_rtl_expr_temps (tree);
3547 extern int aggregate_value_p (tree, tree);
3548 extern void push_function_context (void);
3549 extern void pop_function_context (void);
3550 extern void push_function_context_to (tree);
3551 extern void pop_function_context_from (tree);
3553 /* In print-rtl.c */
3555 extern void print_rtl (FILE *, rtx);
3558 /* In print-tree.c */
3559 extern void debug_tree (tree);
3561 extern void print_node (FILE *, const char *, tree, int);
3562 extern void print_node_brief (FILE *, const char *, tree, int);
3563 extern void indent_to (FILE *, int);
3566 /* In tree-inline.c: */
3567 extern bool debug_find_tree (tree, tree);
3568 /* This is in tree-inline.c since the routine uses
3569 data structures from the inliner. */
3570 extern tree unsave_expr_now (tree);
3573 extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx);
3574 extern void check_max_integer_computation_mode (tree);
3577 extern rtx emit_line_note (location_t);
3581 /* Nonzero if this is a call to a `const' function. */
3583 /* Nonzero if this is a call to a `volatile' function. */
3584 #define ECF_NORETURN 2
3585 /* Nonzero if this is a call to malloc or a related function. */
3586 #define ECF_MALLOC 4
3587 /* Nonzero if it is plausible that this is a call to alloca. */
3588 #define ECF_MAY_BE_ALLOCA 8
3589 /* Nonzero if this is a call to a function that won't throw an exception. */
3590 #define ECF_NOTHROW 16
3591 /* Nonzero if this is a call to setjmp or a related function. */
3592 #define ECF_RETURNS_TWICE 32
3593 /* Nonzero if this is a call to `longjmp'. */
3594 #define ECF_LONGJMP 64
3595 /* Nonzero if this is a syscall that makes a new process in the image of
3597 #define ECF_SIBCALL 128
3598 /* Nonzero if this is a call to "pure" function (like const function,
3599 but may read memory. */
3600 #define ECF_PURE 256
3601 /* Nonzero if this is a call to a function that returns with the stack
3602 pointer depressed. */
3603 #define ECF_SP_DEPRESSED 512
3604 /* Nonzero if this call is known to always return. */
3605 #define ECF_ALWAYS_RETURN 1024
3606 /* Create libcall block around the call. */
3607 #define ECF_LIBCALL_BLOCK 2048
3609 extern int flags_from_decl_or_type (tree);
3610 extern int call_expr_flags (tree);
3612 extern int setjmp_call_p (tree);
3613 extern bool alloca_call_p (tree);
3614 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
3615 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
3619 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3620 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3621 it should be modified in place; if a TYPE, a copy should be created
3622 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3623 information, in the form of a bitwise OR of flags in enum attribute_flags
3624 from tree.h. Depending on these flags, some attributes may be
3625 returned to be applied at a later stage (for example, to apply
3626 a decl attribute to the declaration rather than to its type). */
3627 extern tree decl_attributes (tree *, tree, int);
3629 /* In integrate.c */
3630 extern void set_decl_abstract_flags (tree, int);
3631 extern void set_decl_origin_self (tree);
3633 /* In stor-layout.c */
3634 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
3635 extern void fixup_signed_type (tree);
3636 extern void internal_reference_types (void);
3637 extern unsigned int update_alignment_for_field (record_layout_info, tree,
3640 extern void make_decl_rtl (tree);
3641 extern void make_decl_one_only (tree);
3642 extern int supports_one_only (void);
3643 extern void variable_section (tree, int);
3644 enum tls_model decl_tls_model (tree);
3645 extern void resolve_unique_section (tree, int, int);
3646 extern void mark_referenced (tree);
3647 extern void mark_decl_referenced (tree);
3648 extern void notice_global_symbol (tree);
3649 extern void set_user_assembler_name (tree, const char *);
3652 extern void expand_computed_goto (tree);
3653 extern bool parse_output_constraint (const char **, int, int, int,
3654 bool *, bool *, bool *);
3655 extern bool parse_input_constraint (const char **, int, int, int, int,
3656 const char * const *, bool *, bool *);
3657 extern void expand_asm_operands (tree, tree, tree, tree, int, location_t);
3658 extern void expand_asm_expr (tree);
3659 extern bool asm_op_is_mem_input (tree, tree);
3660 extern tree resolve_asm_operand_names (tree, tree, tree);
3661 extern void expand_case (tree);
3662 extern void expand_decl (tree);
3663 extern void expand_anon_union_decl (tree, tree, tree);
3665 /* In gimplify.c. */
3666 extern tree create_artificial_label (void);
3667 extern void gimplify_function_tree (tree);
3668 extern const char *get_name (tree);
3669 extern tree unshare_expr (tree);
3670 extern void sort_case_labels (tree);
3672 /* If KIND=='I', return a suitable global initializer (constructor) name.
3673 If KIND=='D', return a suitable global clean-up (destructor) name. */
3674 extern tree get_file_function_name (int);
3676 /* Interface of the DWARF2 unwind info support. */
3678 /* Generate a new label for the CFI info to refer to. */
3680 extern char *dwarf2out_cfi_label (void);
3682 /* Entry point to update the canonical frame address (CFA). */
3684 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
3686 /* Add the CFI for saving a register window. */
3688 extern void dwarf2out_window_save (const char *);
3690 /* Add a CFI to update the running total of the size of arguments pushed
3693 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
3695 /* Entry point for saving a register to the stack. */
3697 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
3699 /* Entry point for saving the return address in the stack. */
3701 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
3703 /* Entry point for saving the return address in a register. */
3705 extern void dwarf2out_return_reg (const char *, unsigned);
3707 /* In tree-inline.c */
3709 /* The type of a callback function for walking over tree structure. */
3711 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3712 extern tree walk_tree (tree*, walk_tree_fn, void*, void*);
3713 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
3715 /* In tree-dump.c */
3717 /* Different tree dump places. When you add new tree dump places,
3718 extend the DUMP_FILES array in tree-dump.c. */
3719 enum tree_dump_index
3721 TDI_none, /* No dump */
3722 TDI_tu, /* dump the whole translation unit. */
3723 TDI_class, /* dump class hierarchy. */
3724 TDI_original, /* dump each function before optimizing it */
3725 TDI_generic, /* dump each function after genericizing it */
3726 TDI_nested, /* dump each function after unnesting it */
3727 TDI_inlined, /* dump each function after inlining
3729 TDI_vcg, /* create a VCG graph file for each
3730 function's flowgraph. */
3731 TDI_tree_all, /* enable all the GENERIC/GIMPLE dumps. */
3732 TDI_rtl_all, /* enable all the RTL dumps. */
3733 TDI_ipa_all, /* enable all the IPA dumps. */
3735 TDI_cgraph, /* dump function call graph. */
3737 DFI_MIN, /* For now, RTL dumps are placed here. */
3738 DFI_sibling = DFI_MIN,
3768 DFI_branch_target_load,
3778 /* Bit masks to control dumping. Not all values are applicable to
3779 all dumps. Add new ones at the end. When you define new
3780 values, extend the DUMP_OPTIONS array in tree-dump.c */
3781 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3782 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3783 #define TDF_RAW (1 << 2) /* don't unparse the function */
3784 #define TDF_DETAILS (1 << 3) /* show more detailed info about
3786 #define TDF_STATS (1 << 4) /* dump various statistics about
3788 #define TDF_BLOCKS (1 << 5) /* display basic block boundaries */
3789 #define TDF_VOPS (1 << 6) /* display virtual operands */
3790 #define TDF_LINENO (1 << 7) /* display statement line numbers */
3791 #define TDF_UID (1 << 8) /* display decl UIDs */
3793 #define TDF_TREE (1 << 9) /* is a tree dump */
3794 #define TDF_RTL (1 << 10) /* is a RTL dump */
3795 #define TDF_IPA (1 << 11) /* is an IPA dump */
3797 typedef struct dump_info *dump_info_p;
3799 extern char *get_dump_file_name (enum tree_dump_index);
3800 extern int dump_flag (dump_info_p, int, tree);
3801 extern int dump_enabled_p (enum tree_dump_index);
3802 extern int dump_initialized_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 /* Enum and arrays used for tree allocation stats.
3814 Keep in sync with tree.c:tree_node_kind_names. */
3837 extern int tree_node_counts[];
3838 extern int tree_node_sizes[];
3840 /* True if we are in gimple form and the actions of the folders need to
3841 be restricted. False if we are not in gimple form and folding is not
3842 restricted to creating gimple expressions. */
3843 extern bool in_gimple_form;
3845 /* In tree-ssa-loop-niter.c. */
3846 tree lower_bound_in_type (tree, tree);
3847 tree upper_bound_in_type (tree, tree);
3849 /* In tree-ssa-threadupdate.c. */
3850 extern bool thread_through_all_blocks (void);
3852 /* In tree-gimple.c. */
3853 extern tree get_base_address (tree t);
3855 #endif /* GCC_TREE_H */
OSDN Git Service
