1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
27 #include "statistics.h"
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
42 /* Number of language-independent tree codes. */
43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern const char tree_code_type[];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns nonzero iff CLASS is not the tree code of a type. */
58 #define IS_NON_TYPE_CODE_CLASS(CLASS) (strchr ("xbcdr<12se", (CLASS)) != 0)
60 /* Returns nonzero iff CLASS is the tree-code class of an
63 #define IS_EXPR_CODE_CLASS(CLASS) (strchr ("<12ers", (CLASS)) != 0)
65 /* Returns nonzero iff NODE is an expression of some kind. */
67 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
69 /* Number of argument-words in each kind of tree-node. */
71 extern const unsigned char tree_code_length[];
72 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
74 /* Names of tree components. */
76 extern const char *const tree_code_name[];
78 /* Classify which part of the compiler has defined a given builtin function.
79 Note that we assume below that this is no more than two bits. */
88 /* Names for the above. */
89 extern const char *const built_in_class_names[4];
91 /* Codes that identify the various built in functions
92 so that expand_call can identify them quickly. */
94 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
95 enum built_in_function
97 #include "builtins.def"
99 /* Upper bound on non-language-specific builtins. */
104 /* Names for the above. */
105 extern const char *const built_in_names[(int) END_BUILTINS];
107 /* Helper macros for math builtins. */
109 #define BUILTIN_EXP10_P(FN) \
110 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
111 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
113 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
114 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
115 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
117 #define BUILTIN_SQRT_P(FN) \
118 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
120 #define BUILTIN_CBRT_P(FN) \
121 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
123 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
125 /* An array of _DECL trees for the above. */
126 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
127 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
129 /* The definition of tree nodes fills the next several pages. */
131 /* A tree node can represent a data type, a variable, an expression
132 or a statement. Each node has a TREE_CODE which says what kind of
133 thing it represents. Some common codes are:
134 INTEGER_TYPE -- represents a type of integers.
135 ARRAY_TYPE -- represents a type of pointer.
136 VAR_DECL -- represents a declared variable.
137 INTEGER_CST -- represents a constant integer value.
138 PLUS_EXPR -- represents a sum (an expression).
140 As for the contents of a tree node: there are some fields
141 that all nodes share. Each TREE_CODE has various special-purpose
142 fields as well. The fields of a node are never accessed directly,
143 always through accessor macros. */
145 /* Every kind of tree node starts with this structure,
146 so all nodes have these fields.
148 See the accessor macros, defined below, for documentation of the
152 struct tree_common GTY(())
156 union tree_ann_d *ann;
158 ENUM_BITFIELD(tree_code) code : 8;
160 unsigned side_effects_flag : 1;
161 unsigned constant_flag : 1;
162 unsigned addressable_flag : 1;
163 unsigned volatile_flag : 1;
164 unsigned readonly_flag : 1;
165 unsigned unsigned_flag : 1;
166 unsigned asm_written_flag: 1;
167 unsigned nowarning_flag : 1;
169 unsigned used_flag : 1;
170 unsigned nothrow_flag : 1;
171 unsigned static_flag : 1;
172 unsigned public_flag : 1;
173 unsigned private_flag : 1;
174 unsigned protected_flag : 1;
175 unsigned deprecated_flag : 1;
176 unsigned invariant_flag : 1;
178 unsigned lang_flag_0 : 1;
179 unsigned lang_flag_1 : 1;
180 unsigned lang_flag_2 : 1;
181 unsigned lang_flag_3 : 1;
182 unsigned lang_flag_4 : 1;
183 unsigned lang_flag_5 : 1;
184 unsigned lang_flag_6 : 1;
185 unsigned visited : 1;
188 /* The following table lists the uses of each of the above flags and
189 for which types of nodes they are defined. Note that expressions
195 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
196 ..._TYPE, IDENTIFIER_NODE.
197 In a STMT_EXPR, it means we want the result of the enclosed
199 CALL_EXPR_TAILCALL in CALL_EXPR
204 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
206 TREE_LIST or TREE_VEC
207 TREE_CONSTANT_OVERFLOW in
208 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
209 TREE_SYMBOL_REFERENCED in
212 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
213 TREE_LIST elements of a block's cleanup list.
216 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
217 TYPE_REF_CAN_ALIAS_ALL in
218 POINTER_TYPE, REFERENCE_TYPE
223 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
224 ??? and other expressions?
226 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
228 TREE_LIST or TREE_VEC
236 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
259 TREE_THIS_VOLATILE in
284 BIT_FIELD_REF_UNSIGNED in
286 SAVE_EXPR_NOPLACEHOLDER in
292 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
298 expressions, IDENTIFIER_NODE
303 CALL_EXPR, FUNCTION_DECL
315 Used in tree traversals to mark visited nodes.
328 /* Define accessors for the fields that all tree nodes have
329 (though some fields are not used for all kinds of nodes). */
331 /* The tree-code says what kind of node it is.
332 Codes are defined in tree.def. */
333 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
334 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
336 /* When checking is enabled, errors will be generated if a tree node
337 is accessed incorrectly. The macros abort with a fatal error. */
338 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
340 #define TREE_CHECK(T, CODE) __extension__ \
341 ({ const tree __t = (T); \
342 if (TREE_CODE (__t) != (CODE)) \
343 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
346 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
347 ({ const tree __t = (T); \
348 if (TREE_CODE (__t) != (CODE1) \
349 && TREE_CODE (__t) != (CODE2)) \
350 tree_check2_failed (__t, (CODE1), (CODE2), __FILE__, __LINE__, \
354 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
355 ({ const tree __t = (T); \
356 if (TREE_CODE (__t) != (CODE1) \
357 && TREE_CODE (__t) != (CODE2) \
358 && TREE_CODE (__t) != (CODE3)) \
359 tree_check3_failed (__t, (CODE1), (CODE2), (CODE3), __FILE__, \
360 __LINE__, __FUNCTION__); \
363 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
364 ({ const tree __t = (T); \
365 if (TREE_CODE (__t) != (CODE1) \
366 && TREE_CODE (__t) != (CODE2) \
367 && TREE_CODE (__t) != (CODE3) \
368 && TREE_CODE (__t) != (CODE4)) \
369 tree_check4_failed (__t, (CODE1), (CODE2), (CODE3), (CODE4), \
370 __FILE__, __LINE__, __FUNCTION__); \
373 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
374 ({ const tree __t = (T); \
375 if (TREE_CODE (__t) != (CODE1) \
376 && TREE_CODE (__t) != (CODE2) \
377 && TREE_CODE (__t) != (CODE3) \
378 && TREE_CODE (__t) != (CODE4) \
379 && TREE_CODE (__t) != (CODE5)) \
380 tree_check5_failed (__t, (CODE1), (CODE2), (CODE3), (CODE4), \
381 (CODE5), __FILE__, __LINE__, __FUNCTION__); \
384 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
385 ({ const tree __t = (T); \
386 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
387 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
391 /* These checks have to be special cased. */
392 #define EXPR_CHECK(T) __extension__ \
393 ({ const tree __t = (T); \
394 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
395 if (!IS_EXPR_CODE_CLASS (__c)) \
396 tree_class_check_failed (__t, 'E', __FILE__, __LINE__, \
400 /* These checks have to be special cased. */
401 #define NON_TYPE_CHECK(T) __extension__ \
402 ({ const tree __t = (T); \
403 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
404 if (!IS_NON_TYPE_CODE_CLASS (__c)) \
405 tree_class_check_failed (__t, 'T', __FILE__, __LINE__, \
409 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
410 (*({const tree __t = (T); \
411 const int __i = (I); \
412 if (TREE_CODE (__t) != TREE_VEC) \
413 tree_check_failed (__t, TREE_VEC, \
414 __FILE__, __LINE__, __FUNCTION__); \
415 if (__i < 0 || __i >= __t->vec.length) \
416 tree_vec_elt_check_failed (__i, __t->vec.length, \
417 __FILE__, __LINE__, __FUNCTION__); \
418 &__t->vec.a[__i]; }))
420 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
421 (*({const tree __t = t; \
422 const int __i = (i); \
423 if (TREE_CODE (__t) != PHI_NODE) \
424 tree_check_failed (__t, PHI_NODE, \
425 __FILE__, __LINE__, __FUNCTION__); \
426 if (__i < 0 || __i >= __t->phi.capacity) \
427 phi_node_elt_check_failed (__i, __t->phi.num_args, \
428 __FILE__, __LINE__, __FUNCTION__); \
429 &__t->phi.a[__i]; }))
431 /* Special checks for TREE_OPERANDs. */
432 #define TREE_OPERAND_CHECK(T, I) __extension__ \
433 (*({const tree __t = EXPR_CHECK (T); \
434 const int __i = (I); \
435 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
436 tree_operand_check_failed (__i, TREE_CODE (__t), \
437 __FILE__, __LINE__, __FUNCTION__); \
438 &__t->exp.operands[__i]; }))
440 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
441 (*({const tree __t = (T); \
442 const int __i = (I); \
443 if (TREE_CODE (__t) != CODE) \
444 tree_check_failed (__t, CODE, __FILE__, __LINE__, __FUNCTION__); \
445 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
446 tree_operand_check_failed (__i, (CODE), \
447 __FILE__, __LINE__, __FUNCTION__); \
448 &__t->exp.operands[__i]; }))
450 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
452 ({const tree __t = (T); \
453 const int __i = (I); \
454 if (TREE_CODE (__t) != (CODE)) \
455 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
456 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
457 tree_operand_check_failed (__i, (CODE), \
458 __FILE__, __LINE__, __FUNCTION__); \
459 &__t->exp.operands[__i]; }))
461 extern void tree_check_failed (const tree, enum tree_code,
462 const char *, int, const char *)
464 extern void tree_check2_failed (const tree, enum tree_code, enum tree_code,
465 const char *, int, const char *)
467 extern void tree_check3_failed (const tree, enum tree_code, enum tree_code,
468 enum tree_code, const char *, int,
471 extern void tree_check4_failed (const tree, enum tree_code, enum tree_code,
472 enum tree_code, enum tree_code,
473 const char *, int, const char *)
475 extern void tree_check5_failed (const tree, enum tree_code, enum tree_code,
476 enum tree_code, enum tree_code, enum tree_code,
477 const char *, int, const char *)
479 extern void tree_class_check_failed (const tree, int,
480 const char *, int, const char *)
482 extern void tree_vec_elt_check_failed (int, int, const char *,
485 extern void phi_node_elt_check_failed (int, int, const char *,
488 extern void tree_operand_check_failed (int, enum tree_code,
489 const char *, int, const char *)
492 #else /* not ENABLE_TREE_CHECKING, or not gcc */
494 #define TREE_CHECK(T, CODE) (T)
495 #define TREE_CHECK2(T, CODE1, CODE2) (T)
496 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
497 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
498 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
499 #define TREE_CLASS_CHECK(T, CODE) (T)
500 #define EXPR_CHECK(T) (T)
501 #define NON_TYPE_CHECK(T) (T)
502 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
503 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
504 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
505 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
506 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
510 #define TREE_BLOCK(NODE) ((NODE)->exp.block)
512 #include "tree-check.h"
514 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't')
515 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd')
516 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c')
517 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's')
518 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
519 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
521 #define SET_OR_ARRAY_CHECK(T) \
522 TREE_CHECK2 (T, ARRAY_TYPE, SET_TYPE)
524 #define REC_OR_UNION_CHECK(T) \
525 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
527 #define NUMERICAL_TYPE_CHECK(T) \
528 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \
529 CHAR_TYPE, REAL_TYPE)
531 /* In all nodes that are expressions, this is the data type of the expression.
532 In POINTER_TYPE nodes, this is the type that the pointer points to.
533 In ARRAY_TYPE nodes, this is the type of the elements.
534 In VECTOR_TYPE nodes, this is the type of the elements. */
535 #define TREE_TYPE(NODE) ((NODE)->common.type)
537 /* Here is how primitive or already-canonicalized types' hash codes
539 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
541 /* A simple hash function for an arbitrary tree node. This must not be
542 used in hash tables which are saved to a PCH. */
543 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
545 /* Nodes are chained together for many purposes.
546 Types are chained together to record them for being output to the debugger
547 (see the function `chain_type').
548 Decls in the same scope are chained together to record the contents
550 Statement nodes for successive statements used to be chained together.
551 Often lists of things are represented by TREE_LIST nodes that
552 are chained together. */
554 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
556 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
557 that don't change the machine mode. */
559 #define STRIP_NOPS(EXP) \
560 while ((TREE_CODE (EXP) == NOP_EXPR \
561 || TREE_CODE (EXP) == CONVERT_EXPR \
562 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
563 && TREE_OPERAND (EXP, 0) != error_mark_node \
564 && (TYPE_MODE (TREE_TYPE (EXP)) \
565 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
566 (EXP) = TREE_OPERAND (EXP, 0)
568 /* Like STRIP_NOPS, but don't let the signedness change either. */
570 #define STRIP_SIGN_NOPS(EXP) \
571 while ((TREE_CODE (EXP) == NOP_EXPR \
572 || TREE_CODE (EXP) == CONVERT_EXPR \
573 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
574 && TREE_OPERAND (EXP, 0) != error_mark_node \
575 && (TYPE_MODE (TREE_TYPE (EXP)) \
576 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
577 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
578 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
579 (EXP) = TREE_OPERAND (EXP, 0)
581 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
583 #define STRIP_MAIN_TYPE_NOPS(EXP) \
584 while ((TREE_CODE (EXP) == NOP_EXPR \
585 || TREE_CODE (EXP) == CONVERT_EXPR \
586 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
587 && TREE_OPERAND (EXP, 0) != error_mark_node \
588 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
589 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
590 (EXP) = TREE_OPERAND (EXP, 0)
592 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
594 #define STRIP_TYPE_NOPS(EXP) \
595 while ((TREE_CODE (EXP) == NOP_EXPR \
596 || TREE_CODE (EXP) == CONVERT_EXPR \
597 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
598 && TREE_OPERAND (EXP, 0) != error_mark_node \
599 && (TREE_TYPE (EXP) \
600 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
601 (EXP) = TREE_OPERAND (EXP, 0)
603 /* Remove unnecessary type conversions according to
604 tree_ssa_useless_type_conversion. */
606 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
607 while (tree_ssa_useless_type_conversion (EXP)) \
608 EXP = TREE_OPERAND (EXP, 0)
610 /* Nonzero if TYPE represents an integral type. Note that we do not
611 include COMPLEX types here. */
613 #define INTEGRAL_TYPE_P(TYPE) \
614 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
615 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
617 /* Nonzero if TYPE represents a scalar floating-point type. */
619 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
621 /* Nonzero if TYPE represents a complex floating-point type. */
623 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
624 (TREE_CODE (TYPE) == COMPLEX_TYPE \
625 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
627 /* Nonzero if TYPE represents a floating-point type, including complex
628 floating-point types. */
630 #define FLOAT_TYPE_P(TYPE) \
631 (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE))
633 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
635 #define AGGREGATE_TYPE_P(TYPE) \
636 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
637 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
638 || TREE_CODE (TYPE) == SET_TYPE)
640 /* Nonzero if TYPE represents a pointer or reference type.
641 (It should be renamed to INDIRECT_TYPE_P.) */
643 #define POINTER_TYPE_P(TYPE) \
644 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
646 /* Nonzero if this type is a complete type. */
647 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
649 /* Nonzero if this type is the (possibly qualified) void type. */
650 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
652 /* Nonzero if this type is complete or is cv void. */
653 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
654 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
656 /* Nonzero if this type is complete or is an array with unspecified bound. */
657 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
658 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
660 /* Nonzero if TYPE represents a type. */
662 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
664 /* Define many boolean fields that all tree nodes have. */
666 /* In VAR_DECL nodes, nonzero means address of this is needed.
667 So it cannot be in a register.
668 In a FUNCTION_DECL, nonzero means its address is needed.
669 So it must be compiled even if it is an inline function.
670 In a FIELD_DECL node, it means that the programmer is permitted to
671 construct the address of this field. This is used for aliasing
672 purposes: see record_component_aliases.
673 In CONSTRUCTOR nodes, it means object constructed must be in memory.
674 In LABEL_DECL nodes, it means a goto for this label has been seen
675 from a place outside all binding contours that restore stack levels.
676 In ..._TYPE nodes, it means that objects of this type must
677 be fully addressable. This means that pieces of this
678 object cannot go into register parameters, for example.
679 In IDENTIFIER_NODEs, this means that some extern decl for this name
680 had its address taken. That matters for inline functions. */
681 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
683 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
685 /* In a VAR_DECL, nonzero means allocate static storage.
686 In a FUNCTION_DECL, nonzero if function has been defined.
687 In a CONSTRUCTOR, nonzero means allocate static storage.
689 ??? This is also used in lots of other nodes in unclear ways which
690 should be cleaned up some day. */
691 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
693 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
694 block's cleanup list, means that the pertinent cleanup should only be
695 executed if an exception is thrown, not on normal exit of its scope. */
696 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
698 /* In an expr node (usually a conversion) this means the node was made
699 implicitly and should not lead to any sort of warning. */
700 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
702 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
703 chain is via a `virtual' declaration. */
704 #define TREE_VIA_VIRTUAL(NODE) \
705 (TREE_CHECK2 (NODE, TREE_LIST, TREE_VEC)->common.static_flag)
707 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
708 there was an overflow in folding. This is distinct from
709 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
710 occur in constant expressions. */
711 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
713 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
714 this string as an argument. */
715 #define TREE_SYMBOL_REFERENCED(NODE) \
716 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
718 /* Nonzero in a pointer or reference type means the data pointed to
719 by this type can alias anything. */
720 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
721 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
723 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
724 there was an overflow in folding, and no warning has been issued
725 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
728 ??? Apparently, lots of code assumes this is defined in all
730 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
732 /* In a VAR_DECL or FUNCTION_DECL,
733 nonzero means name is to be accessible from outside this module.
734 In an IDENTIFIER_NODE, nonzero means an external declaration
735 accessible from outside this module was previously seen
736 for this name in an inner scope. */
737 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
739 /* In any expression, decl, or constant, nonzero means it has side effects or
740 reevaluation of the whole expression could produce a different value.
741 This is set if any subexpression is a function call, a side effect or a
742 reference to a volatile variable. In a ..._DECL, this is set only if the
743 declaration said `volatile'. This will never be set for a constant. */
744 #define TREE_SIDE_EFFECTS(NODE) \
745 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
747 /* In a LABEL_DECL, nonzero means this label had its address taken
748 and therefore can never be deleted and is a jump target for
750 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
752 /* Nonzero means this expression is volatile in the C sense:
753 its address should be of type `volatile WHATEVER *'.
754 In other words, the declared item is volatile qualified.
755 This is used in _DECL nodes and _REF nodes.
757 In a ..._TYPE node, means this type is volatile-qualified.
758 But use TYPE_VOLATILE instead of this macro when the node is a type,
759 because eventually we may make that a different bit.
761 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
762 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
764 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
765 nonzero means it may not be the lhs of an assignment. */
766 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
768 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
769 #define TREE_READONLY_DECL_P(NODE) (DECL_P (NODE) && TREE_READONLY (NODE))
771 /* Value of expression is constant. Always on in all ..._CST nodes. May
772 also appear in an expression or decl where the value is constant. */
773 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
775 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
776 #define DECL_UNSIGNED(NODE) (DECL_CHECK (NODE)->common.unsigned_flag)
778 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
779 #define BIT_FIELD_REF_UNSIGNED(NODE) \
780 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
782 /* In integral and pointer types, means an unsigned type. */
783 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
785 #define TYPE_TRAP_SIGNED(NODE) \
786 (flag_trapv && ! TYPE_UNSIGNED (NODE))
788 /* Nonzero in a VAR_DECL means assembler code has been written.
789 Nonzero in a FUNCTION_DECL means that the function has been compiled.
790 This is interesting in an inline function, since it might not need
791 to be compiled separately.
792 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
793 if the sdb debugging info for the type has been written.
794 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
795 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
797 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
799 /* Nonzero in a _DECL if the name is used in its scope.
800 Nonzero in an expr node means inhibit warning if value is unused.
801 In IDENTIFIER_NODEs, this means that some extern decl for this name
803 #define TREE_USED(NODE) ((NODE)->common.used_flag)
805 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
806 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
807 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
809 /* In a CALL_EXPR, means that the address of the return slot is part of the
811 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
813 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
814 thunked-to function. */
815 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag)
817 /* In a type, nonzero means that all objects of the type are guaranteed by the
818 language or front-end to be properly aligned, so we can indicate that a MEM
819 of this type is aligned at least to the alignment of the type, even if it
820 doesn't appear that it is. We see this, for example, in object-oriented
821 languages where a tag field may show this is an object of a more-aligned
822 variant of the more generic type.
824 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
826 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
828 /* Used in classes in C++. */
829 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
830 /* Used in classes in C++.
831 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
832 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
834 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
835 deprecated feature by __attribute__((deprecated)). */
836 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
838 /* Value of expression is function invariant. A strict subset of
839 TREE_CONSTANT, such an expression is constant over any one function
840 invocation, though not across different invocations. May appear in
841 any expression node. */
842 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
844 /* These flags are available for each language front end to use internally. */
845 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
846 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
847 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
848 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
849 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
850 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
851 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
853 /* Define additional fields and accessors for nodes representing constants. */
855 /* In an INTEGER_CST node. These two together make a 2-word integer.
856 If the data type is signed, the value is sign-extended to 2 words
857 even though not all of them may really be in use.
858 In an unsigned constant shorter than 2 words, the extra bits are 0. */
859 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
860 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
861 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
863 #define INT_CST_LT(A, B) \
864 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
865 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
866 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
868 #define INT_CST_LT_UNSIGNED(A, B) \
869 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
870 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
871 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
872 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
873 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
875 struct tree_int_cst GTY(())
877 struct tree_common common;
878 /* A sub-struct is necessary here because the function `const_hash'
879 wants to scan both words as a unit and taking the address of the
880 sub-struct yields the properly inclusive bounded pointer. */
881 struct tree_int_cst_lowhi {
882 unsigned HOST_WIDE_INT low;
887 /* In a REAL_CST node. struct real_value is an opaque entity, with
888 manipulators defined in real.h. We don't want tree.h depending on
889 real.h and transitively on tm.h. */
892 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
893 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
895 struct tree_real_cst GTY(())
897 struct tree_common common;
898 struct real_value * real_cst_ptr;
901 /* In a STRING_CST */
902 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
903 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
905 struct tree_string GTY(())
907 struct tree_common common;
912 /* In a COMPLEX_CST node. */
913 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
914 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
916 struct tree_complex GTY(())
918 struct tree_common common;
923 /* In a VECTOR_CST node. */
924 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
926 struct tree_vector GTY(())
928 struct tree_common common;
934 /* Define fields and accessors for some special-purpose tree nodes. */
936 #define IDENTIFIER_LENGTH(NODE) \
937 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
938 #define IDENTIFIER_POINTER(NODE) \
939 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
940 #define IDENTIFIER_HASH_VALUE(NODE) \
941 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
943 /* Translate a hash table identifier pointer to a tree_identifier
944 pointer, and vice versa. */
946 #define HT_IDENT_TO_GCC_IDENT(NODE) \
947 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
948 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
950 struct tree_identifier GTY(())
952 struct tree_common common;
953 struct ht_identifier id;
956 /* In a TREE_LIST node. */
957 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
958 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
960 struct tree_list GTY(())
962 struct tree_common common;
967 /* In a TREE_VEC node. */
968 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
969 #define TREE_VEC_END(NODE) \
970 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
972 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
974 struct tree_vec GTY(())
976 struct tree_common common;
978 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
981 /* Define fields and accessors for some nodes that represent expressions. */
983 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
984 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
985 && VOID_TYPE_P (TREE_TYPE (NODE)) \
986 && integer_zerop (TREE_OPERAND (NODE, 0)))
988 /* In a SAVE_EXPR node. */
989 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1)
990 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2)
992 #define SAVE_EXPR_NOPLACEHOLDER(NODE) \
993 (SAVE_EXPR_CHECK (NODE)->common.unsigned_flag)
995 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
996 both in normal code and in a handler. (Normally, in a handler, all
997 SAVE_EXPRs are unsaved, meaning that their values are
999 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
1001 /* In a RTL_EXPR node. */
1002 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0)
1003 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1)
1004 #define RTL_EXPR_ALT_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 2)
1006 /* In a WITH_CLEANUP_EXPR node. */
1007 #define WITH_CLEANUP_EXPR_RTL(NODE) \
1008 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2)
1010 /* In a CONSTRUCTOR node. */
1011 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
1013 /* In ordinary expression nodes. */
1014 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1015 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1017 /* In a LABELED_BLOCK_EXPR node. */
1018 #define LABELED_BLOCK_LABEL(NODE) \
1019 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
1020 #define LABELED_BLOCK_BODY(NODE) \
1021 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
1023 /* In an EXIT_BLOCK_EXPR node. */
1024 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
1025 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
1026 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
1028 /* In a LOOP_EXPR node. */
1029 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1031 /* The source location of this expression. Non-tree_exp nodes such as
1032 decls and constants can be shared among multiple locations, so
1034 #define EXPR_LOCUS(NODE) \
1035 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1036 ? (NODE)->exp.locus \
1037 : (location_t *)NULL)
1038 #define SET_EXPR_LOCUS(NODE, FROM) \
1039 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1040 #define EXPR_FILENAME(NODE) \
1041 (EXPR_CHECK (NODE)->exp.locus->file)
1042 #define EXPR_LINENO(NODE) \
1043 (EXPR_CHECK (NODE)->exp.locus->line)
1044 #ifdef USE_MAPPED_LOCATION
1045 #define EXPR_LOCATION(NODE) \
1046 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1047 ? (NODE)->exp.locus \
1049 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1051 #define EXPR_LOCATION(NODE) (*EXPR_LOCUS (NODE))
1052 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1055 /* In a TARGET_EXPR node. */
1056 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1057 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1058 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1060 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1062 /* SWITCH_EXPR accessors. These give access to the condition, body and
1063 original condition type (before any compiler conversions)
1064 of the switch statement, respectively. */
1065 #define SWITCH_COND(NODE) TREE_OPERAND ((NODE), 0)
1066 #define SWITCH_BODY(NODE) TREE_OPERAND ((NODE), 1)
1067 #define SWITCH_LABELS(NODE) TREE_OPERAND ((NODE), 2)
1069 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1070 of a case label, respectively. */
1071 #define CASE_LOW(NODE) TREE_OPERAND ((NODE), 0)
1072 #define CASE_HIGH(NODE) TREE_OPERAND ((NODE), 1)
1073 #define CASE_LABEL(NODE) TREE_OPERAND ((NODE), 2)
1075 /* The operands of a BIND_EXPR. */
1076 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1077 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1078 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1080 /* GOTO_EXPR accessor. This gives access to the label associated with
1081 a goto statement. */
1082 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1084 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1085 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1086 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1088 #define ASM_STRING(NODE) TREE_OPERAND ((NODE), 0)
1089 #define ASM_OUTPUTS(NODE) TREE_OPERAND ((NODE), 1)
1090 #define ASM_INPUTS(NODE) TREE_OPERAND ((NODE), 2)
1091 #define ASM_CLOBBERS(NODE) TREE_OPERAND ((NODE), 3)
1092 /* Nonzero if we want to create an ASM_INPUT instead of an
1093 ASM_OPERAND with no operands. */
1094 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1095 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1097 /* COND_EXPR accessors. */
1098 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1099 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1100 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1102 /* LABEL_EXPR accessor. This gives access to the label associated with
1103 the given label expression. */
1104 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1106 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1107 accessors for SSA operands. */
1109 /* CATCH_EXPR accessors. */
1110 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1111 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1113 /* EH_FILTER_EXPR accessors. */
1114 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1115 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1116 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1118 struct tree_exp GTY(())
1120 struct tree_common common;
1124 tree GTY ((special ("tree_exp"),
1125 desc ("TREE_CODE ((tree) &%0)")))
1129 /* SSA_NAME accessors. */
1131 /* Returns the variable being referenced. Once released, this is the
1132 only field that can be relied upon. */
1133 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1135 /* Returns the statement which defines this reference. Note that
1136 we use the same field when chaining SSA_NAME nodes together on
1137 the SSA_NAME freelist. */
1138 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1140 /* Returns the SSA version number of this SSA name. Note that in
1141 tree SSA, version numbers are not per variable and may be recycled. */
1142 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1144 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1145 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1147 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1148 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1150 /* Nonzero if this SSA_NAME expression is currently on the free list of
1151 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1152 has no meaning for an SSA_NAME. */
1153 #define SSA_NAME_IN_FREE_LIST(NODE) \
1154 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1156 /* Attributes for SSA_NAMEs for pointer-type variables. */
1157 #define SSA_NAME_PTR_INFO(N) \
1158 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1160 /* Get the value of this SSA_NAME, if available. */
1161 #define SSA_NAME_VALUE(N) \
1162 SSA_NAME_CHECK (N)->ssa_name.value_handle
1164 #ifndef GCC_BITMAP_H
1165 struct bitmap_head_def;
1168 /* Aliasing information for SSA_NAMEs representing pointer variables. */
1169 struct ptr_info_def GTY(())
1171 /* Nonzero if points-to analysis couldn't determine where this pointer
1173 unsigned int pt_anything : 1;
1175 /* Nonzero if this pointer is the result of a call to malloc. */
1176 unsigned int pt_malloc : 1;
1178 /* Nonzero if the value of this pointer escapes the current function. */
1179 unsigned int value_escapes_p : 1;
1181 /* Set of variables that this pointer may point to. */
1182 struct bitmap_head_def *pt_vars;
1184 /* If this pointer has been dereferenced, and points-to information is
1185 more precise than type-based aliasing, indirect references to this
1186 pointer will be represented by this memory tag, instead of the type
1187 tag computed by TBAA. */
1191 struct tree_ssa_name GTY(())
1193 struct tree_common common;
1195 /* _DECL wrapped by this SSA name. */
1198 /* SSA version number. */
1199 unsigned int version;
1201 /* Pointer attributes used for alias analysis. */
1202 struct ptr_info_def *ptr_info;
1204 /* Value for SSA name used by GVN. */
1205 tree GTY((skip)) value_handle;
1208 /* In a PHI_NODE node. */
1209 #define PHI_RESULT(NODE) PHI_NODE_CHECK (NODE)->phi.result
1211 /* Nonzero if the PHI node was rewritten by a previous pass through the
1213 #define PHI_REWRITTEN(NODE) PHI_NODE_CHECK (NODE)->phi.rewritten
1214 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1215 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1216 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1217 #define PHI_ARG_EDGE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).e
1218 #define PHI_ARG_DEF(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1219 #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero
1223 struct phi_arg_d GTY(())
1226 struct edge_def * GTY((skip (""))) e;
1230 struct tree_phi_node GTY(())
1232 struct tree_common common;
1237 /* Nonzero if the PHI node was rewritten by a previous pass through the
1241 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.capacity"))) a[1];
1245 struct varray_head_tag;
1247 /* In a BLOCK node. */
1248 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1249 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1250 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1251 /* Note: when changing this, make sure to find the places
1252 that use chainon or nreverse. */
1253 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1254 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1255 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1257 /* Nonzero means that this block is prepared to handle exceptions
1258 listed in the BLOCK_VARS slot. */
1259 #define BLOCK_HANDLER_BLOCK(NODE) \
1260 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1262 /* An index number for this block. These values are not guaranteed to
1263 be unique across functions -- whether or not they are depends on
1264 the debugging output format in use. */
1265 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1267 /* If block reordering splits a lexical block into discontiguous
1268 address ranges, we'll make a copy of the original block.
1270 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1271 In that case, we have one source block that has been replicated
1272 (through inlining or unrolling) into many logical blocks, and that
1273 these logical blocks have different physical variables in them.
1275 In this case, we have one logical block split into several
1276 non-contiguous address ranges. Most debug formats can't actually
1277 represent this idea directly, so we fake it by creating multiple
1278 logical blocks with the same variables in them. However, for those
1279 that do support non-contiguous regions, these allow the original
1280 logical block to be reconstructed, along with the set of address
1283 One of the logical block fragments is arbitrarily chosen to be
1284 the ORIGIN. The other fragments will point to the origin via
1285 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1286 be null. The list of fragments will be chained through
1287 BLOCK_FRAGMENT_CHAIN from the origin. */
1289 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1290 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1292 struct tree_block GTY(())
1294 struct tree_common common;
1296 unsigned handler_block_flag : 1;
1297 unsigned abstract_flag : 1;
1298 unsigned block_num : 30;
1303 tree abstract_origin;
1304 tree fragment_origin;
1305 tree fragment_chain;
1308 /* Define fields and accessors for nodes representing data types. */
1310 /* See tree.def for documentation of the use of these fields.
1311 Look at the documentation of the various ..._TYPE tree codes.
1313 Note that the type.values, type.minval, and type.maxval fields are
1314 overloaded and used for different macros in different kinds of types.
1315 Each macro must check to ensure the tree node is of the proper kind of
1316 type. Note also that some of the front-ends also overload these fields,
1317 so they must be checked as well. */
1319 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1320 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1321 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1322 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1323 #define TYPE_ORIG_SIZE_TYPE(NODE) (INTEGER_TYPE_CHECK (NODE)->type.values)
1324 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1325 #define TYPE_DOMAIN(NODE) (SET_OR_ARRAY_CHECK (NODE)->type.values)
1326 #define TYPE_FIELDS(NODE) (REC_OR_UNION_CHECK (NODE)->type.values)
1327 #define TYPE_METHODS(NODE) (REC_OR_UNION_CHECK (NODE)->type.maxval)
1328 #define TYPE_VFIELD(NODE) (REC_OR_UNION_CHECK (NODE)->type.minval)
1329 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1330 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1331 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1332 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1333 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1334 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1335 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1336 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1337 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1338 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1339 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1340 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1341 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1342 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1343 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1344 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1345 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1346 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1348 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1349 in the debugging output. We use this to describe a vector as a
1350 structure containing an array. */
1351 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1353 /* For aggregate types, information about this type, as a base type
1354 for itself. Used in a language-dependent way for types that are
1355 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
1356 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
1358 /* The (language-specific) typed-based alias set for this type.
1359 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1360 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1361 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1362 type can alias objects of any type. */
1363 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1365 /* Nonzero iff the typed-based alias set for this type has been
1367 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1369 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1371 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1373 /* The alignment necessary for objects of this type.
1374 The value is an int, measured in bits. */
1375 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1377 /* 1 if the alignment for this type was requested by "aligned" attribute,
1378 0 if it is the default for this type. */
1379 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1381 /* The alignment for NODE, in bytes. */
1382 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1384 /* If your language allows you to declare types, and you want debug info
1385 for them, then you need to generate corresponding TYPE_DECL nodes.
1386 These "stub" TYPE_DECL nodes have no name, and simply point at the
1387 type node. You then set the TYPE_STUB_DECL field of the type node
1388 to point back at the TYPE_DECL node. This allows the debug routines
1389 to know that the two nodes represent the same type, so that we only
1390 get one debug info record for them. */
1391 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1393 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1394 has BLKmode only because it lacks the alignment requirement for
1396 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1398 /* In an INTEGER_TYPE, it means the type represents a size. We use
1399 this both for validity checking and to permit optimizations that
1400 are unsafe for other types. Note that the C `size_t' type should
1401 *not* have this flag set. The `size_t' type is simply a typedef
1402 for an ordinary integer type that happens to be the type of an
1403 expression returned by `sizeof'; `size_t' has no special
1404 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1405 always actual sizes. */
1406 #define TYPE_IS_SIZETYPE(NODE) \
1407 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1409 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1410 pointer depressed. */
1411 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1412 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1414 /* Nonzero in a type considered volatile as a whole. */
1415 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1417 /* Means this type is const-qualified. */
1418 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1420 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1422 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1424 /* There is a TYPE_QUAL value for each type qualifier. They can be
1425 combined by bitwise-or to form the complete set of qualifiers for a
1428 #define TYPE_UNQUALIFIED 0x0
1429 #define TYPE_QUAL_CONST 0x1
1430 #define TYPE_QUAL_VOLATILE 0x2
1431 #define TYPE_QUAL_RESTRICT 0x4
1433 /* The set of type qualifiers for this type. */
1434 #define TYPE_QUALS(NODE) \
1435 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1436 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1437 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1439 /* These flags are available for each language front end to use internally. */
1440 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1441 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1442 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1443 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1444 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1445 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1446 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1448 /* Used to keep track of visited nodes in tree traversals. This is set to
1449 0 by copy_node and make_node. */
1450 #define TREE_VISITED(NODE) ((NODE)->common.visited)
1452 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1453 that distinguish string from array of char).
1454 If set in a SET_TYPE, indicates a bitstring type. */
1455 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1457 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1458 object of the given ARRAY_TYPE. This allows temporaries to be
1460 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1461 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
1463 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1464 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1465 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1467 /* Indicates that objects of this type must be initialized by calling a
1468 function when they are created. */
1469 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1470 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1472 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1473 the same way that the first union alternative would be passed. */
1474 #define TYPE_TRANSPARENT_UNION(NODE) \
1475 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1477 /* For an ARRAY_TYPE, indicates that it is not permitted to
1478 take the address of a component of the type. */
1479 #define TYPE_NONALIASED_COMPONENT(NODE) \
1480 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1482 /* Indicated that objects of this type should be laid out in as
1483 compact a way as possible. */
1484 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1488 struct tree_type GTY(())
1490 struct tree_common common;
1497 unsigned int precision : 9;
1498 ENUM_BITFIELD(machine_mode) mode : 7;
1500 unsigned string_flag : 1;
1501 unsigned no_force_blk_flag : 1;
1502 unsigned needs_constructing_flag : 1;
1503 unsigned transparent_union_flag : 1;
1504 unsigned packed_flag : 1;
1505 unsigned restrict_flag : 1;
1508 unsigned lang_flag_0 : 1;
1509 unsigned lang_flag_1 : 1;
1510 unsigned lang_flag_2 : 1;
1511 unsigned lang_flag_3 : 1;
1512 unsigned lang_flag_4 : 1;
1513 unsigned lang_flag_5 : 1;
1514 unsigned lang_flag_6 : 1;
1515 unsigned user_align : 1;
1520 union tree_type_symtab {
1521 int GTY ((tag ("0"))) address;
1522 char * GTY ((tag ("1"))) pointer;
1523 struct die_struct * GTY ((tag ("2"))) die;
1524 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1525 descbits ("2"))) symtab;
1533 HOST_WIDE_INT alias_set;
1534 /* Points to a structure whose details depend on the language in use. */
1535 struct lang_type *lang_specific;
1538 /* Define accessor macros for information about type inheritance
1541 A "basetype" means a particular usage of a data type for inheritance
1542 in another type. Each such basetype usage has its own "binfo"
1543 object to describe it. The binfo object is a TREE_VEC node.
1545 Inheritance is represented by the binfo nodes allocated for a
1546 given type. For example, given types C and D, such that D is
1547 inherited by C, 3 binfo nodes will be allocated: one for describing
1548 the binfo properties of C, similarly one for D, and one for
1549 describing the binfo properties of D as a base type for C.
1550 Thus, given a pointer to class C, one can get a pointer to the binfo
1551 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1553 /* The actual data type node being inherited in this basetype. */
1554 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1556 /* The offset where this basetype appears in its containing type.
1557 BINFO_OFFSET slot holds the offset (in bytes)
1558 from the base of the complete object to the base of the part of the
1559 object that is allocated on behalf of this `type'.
1560 This is always 0 except when there is multiple inheritance. */
1562 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1563 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1564 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1566 /* The virtual function table belonging to this basetype. Virtual
1567 function tables provide a mechanism for run-time method dispatching.
1568 The entries of a virtual function table are language-dependent. */
1570 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1571 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1573 /* The virtual functions in the virtual function table. This is
1574 a TREE_LIST that is used as an initial approximation for building
1575 a virtual function table for this basetype. */
1576 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1577 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1579 /* A vector of binfos for the direct basetypes inherited by this
1582 If this basetype describes type D as inherited in C, and if the
1583 basetypes of D are E and F, then this vector contains binfos for
1584 inheritance of E and F by C.
1586 ??? This could probably be done by just allocating the
1587 base types at the end of this TREE_VEC (instead of using
1588 another TREE_VEC). This would simplify the calculation
1589 of how many basetypes a given type had. */
1590 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1591 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1593 /* The number of basetypes for NODE. */
1594 #define BINFO_N_BASETYPES(NODE) \
1595 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1597 /* Accessor macro to get to the Nth basetype of this basetype. */
1598 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1599 #define TYPE_BINFO_BASETYPE(NODE,N) \
1600 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1602 /* For a BINFO record describing a virtual base class, i.e., one where
1603 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1604 base. The actual contents are language-dependent. In the C++
1605 front-end this field is an INTEGER_CST giving an offset into the
1606 vtable where the offset to the virtual base can be found. */
1607 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1609 /* Indicates the accesses this binfo has to its bases. The values are
1610 access_public_node, access_protected_node or access_private_node.
1611 If this array is not present, public access is implied. */
1612 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1613 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1615 /* Number of language independent elements in a binfo. Languages may
1616 add additional trailing elements. */
1618 #define BINFO_ELTS 7
1620 /* Slot used to build a chain that represents a use of inheritance.
1621 For example, if X is derived from Y, and Y is derived from Z,
1622 then this field can be used to link the binfo node for X to
1623 the binfo node for X's Y to represent the use of inheritance
1624 from X to Y. Similarly, this slot of the binfo node for X's Y
1625 can point to the Z from which Y is inherited (in X's inheritance
1626 hierarchy). In this fashion, one can represent and traverse specific
1627 uses of inheritance using the binfo nodes themselves (instead of
1628 consing new space pointing to binfo nodes).
1629 It is up to the language-dependent front-ends to maintain
1630 this information as necessary. */
1631 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1633 /* Define fields and accessors for nodes representing declared names. */
1635 /* Nonzero if DECL represents a decl. */
1636 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1638 /* Nonzero if DECL represents a variable for the SSA passes. */
1639 #define SSA_VAR_P(DECL) \
1640 (TREE_CODE (DECL) == VAR_DECL \
1641 || TREE_CODE (DECL) == PARM_DECL \
1642 || TREE_CODE (DECL) == RESULT_DECL \
1643 || (TREE_CODE (DECL) == SSA_NAME \
1644 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
1645 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
1646 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
1648 /* This is the name of the object as written by the user.
1649 It is an IDENTIFIER_NODE. */
1650 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1652 /* The name of the object as the assembler will see it (but before any
1653 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1654 as DECL_NAME. It is an IDENTIFIER_NODE. */
1655 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1657 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1658 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1660 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1661 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1663 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1664 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1665 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1667 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1668 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1669 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1670 semantics of using this macro, are different than saying:
1672 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1674 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1676 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1677 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1678 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1679 DECL_ASSEMBLER_NAME (DECL1)) \
1682 /* Records the section name in a section attribute. Used to pass
1683 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1684 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1686 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1687 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1688 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1689 points to either the FUNCTION_DECL for the containing function,
1690 the RECORD_TYPE or UNION_TYPE for the containing type, or
1691 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1693 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1694 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1695 /* In a DECL this is the field where attributes are stored. */
1696 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1697 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1698 byte containing the bit closest to the beginning of the structure. */
1699 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1700 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1701 field from DECL_FIELD_OFFSET. */
1702 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1703 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1704 if so, the type that was originally specified for it.
1705 TREE_TYPE may have been modified (in finish_struct). */
1706 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1707 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1708 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1710 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1711 /* This field is used to reference anything in decl.result and is meant only
1712 for use by the garbage collector. */
1713 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1714 /* In FUNCTION_DECL, holds the decl for the return value. */
1715 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1716 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1717 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1718 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1719 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1720 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1721 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1722 For a VAR_DECL, holds the initial value.
1723 For a PARM_DECL, not used--default
1724 values for parameters are encoded in the type of the function,
1725 not in the PARM_DECL slot.
1727 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1728 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1729 /* For a PARM_DECL, records the data type used to pass the argument,
1730 which may be different from the type seen in the program. */
1731 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1732 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1733 if nonzero, indicates that the field occupies the type. */
1734 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1735 /* These two fields describe where in the source code the declaration
1736 was. If the declaration appears in several places (as for a C
1737 function that is declared first and then defined later), this
1738 information should refer to the definition. */
1739 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1740 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1741 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1742 /* Holds the size of the datum, in bits, as a tree expression.
1743 Need not be constant. */
1744 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1745 /* Likewise for the size in bytes. */
1746 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1747 /* Holds the alignment required for the datum, in bits. */
1748 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1749 /* The alignment of NODE, in bytes. */
1750 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1751 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1752 DECL_FIELD_OFFSET which are known to be always zero.
1753 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1755 #define DECL_OFFSET_ALIGN(NODE) \
1756 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1757 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1758 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1759 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1760 /* 1 if the alignment for this type was requested by "aligned" attribute,
1761 0 if it is the default for this type. */
1762 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1763 /* Holds the machine mode corresponding to the declaration of a variable or
1764 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1766 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1767 /* Holds the RTL expression for the value of a variable or function.
1768 This value can be evaluated lazily for functions, variables with
1769 static storage duration, and labels. */
1770 #define DECL_RTL(NODE) \
1771 (DECL_CHECK (NODE)->decl.rtl \
1772 ? (NODE)->decl.rtl \
1773 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1774 /* Set the DECL_RTL for NODE to RTL. */
1775 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1776 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1777 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1778 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1779 NODE1, it will not be set for NODE2; this is a lazy copy. */
1780 #define COPY_DECL_RTL(NODE1, NODE2) \
1781 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1782 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1783 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1785 /* For PARM_DECL, holds an RTL for the stack slot or register
1786 where the data was actually passed. */
1787 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1789 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
1790 that describes the status of this function. */
1791 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1793 /* For FUNCTION_DECL, if it is built-in,
1794 this identifies which built-in operation it is. */
1795 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1797 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this is
1798 the approximate number of statements in this function. There is
1799 no need for this number to be exact; it is only used in various
1800 heuristics regarding optimization. */
1801 #define DECL_NUM_STMTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.i)
1803 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1804 Before the struct containing the FUNCTION_DECL is laid out,
1805 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1806 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1807 function. When the class is laid out, this pointer is changed
1808 to an INTEGER_CST node which is suitable for use as an index
1809 into the virtual function table. */
1810 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1812 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1813 which this FIELD_DECL is defined. This information is needed when
1814 writing debugging information about vfield and vbase decls for C++. */
1815 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1817 /* Every ..._DECL node gets a unique number. */
1818 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1820 /* For any sort of a ..._DECL node, this points to the original (abstract)
1821 decl node which this decl is an instance of, or else it is NULL indicating
1822 that this decl is not an instance of some other decl. For example,
1823 in a nested declaration of an inline function, this points back to the
1825 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1827 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1828 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1829 #define DECL_ORIGIN(NODE) \
1830 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1832 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1833 inline instance of some original (abstract) decl from an inline function;
1834 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1835 nodes can also have their abstract origin set to themselves. */
1836 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1837 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1839 /* Nonzero if a _DECL means that the name of this decl should be ignored
1840 for symbolic debug purposes. */
1841 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1843 /* Nonzero for a given ..._DECL node means that this node represents an
1844 "abstract instance" of the given declaration (e.g. in the original
1845 declaration of an inline function). When generating symbolic debugging
1846 information, we mustn't try to generate any address information for nodes
1847 marked as "abstract instances" because we don't actually generate
1848 any code or allocate any data space for such instances. */
1849 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1851 /* Nonzero if a _DECL means that no warnings should be generated just
1852 because this decl is unused. */
1853 #define DECL_IN_SYSTEM_HEADER(NODE) \
1854 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1856 /* Nonzero for a given ..._DECL node means that this node should be
1857 put in .common, if possible. If a DECL_INITIAL is given, and it
1858 is not error_mark_node, then the decl cannot be put in .common. */
1859 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1861 /* Language-specific decl information. */
1862 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1864 /* In a VAR_DECL or FUNCTION_DECL,
1865 nonzero means external reference:
1866 do not allocate storage, and refer to a definition elsewhere. */
1867 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1869 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1871 #define DEFAULT_INIT_PRIORITY 65535
1872 #define MAX_INIT_PRIORITY 65535
1873 #define MAX_RESERVED_INIT_PRIORITY 100
1876 nonzero means the detail info about this type is not dumped into stabs.
1877 Instead it will generate cross reference ('x') of names.
1878 This uses the same flag as DECL_EXTERNAL. */
1879 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1880 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1882 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1883 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1885 /* In LABEL_DECL nodes, nonzero means that an error message about
1886 jumping into such a binding contour has been printed for this label. */
1887 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1889 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1890 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1892 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1893 static chain is not needed. */
1894 #define DECL_NO_STATIC_CHAIN(NODE) \
1895 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1897 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1898 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1900 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1902 Also set in some languages for variables, etc., outside the normal
1903 lexical scope, such as class instance variables. */
1904 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1906 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1907 where it is called. */
1908 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1910 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
1911 such as via the `inline' keyword in C/C++. This flag controls the linkage
1912 semantics of 'inline'; whether or not the function is inlined is
1913 controlled by DECL_INLINE. */
1914 #define DECL_DECLARED_INLINE_P(NODE) \
1915 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
1917 /* In a VAR_DECL, nonzero if the decl is a register variable with
1918 an explicit asm specification. */
1919 #define DECL_HARD_REGISTER(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1921 /* Value of the decls's visibility attribute */
1922 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility)
1924 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1925 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1927 /* In a VAR_DECL, nonzero if the data should be allocated from
1928 thread-local storage. */
1929 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1931 /* In a FUNCTION_DECL, the saved representation of the body of the
1932 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1933 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1934 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1936 /* List of FUNCTION_DECLs inlined into this function's body. */
1937 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1939 /* Nonzero in a FUNCTION_DECL means this function should be treated
1940 as if it were a malloc, meaning it returns a pointer that is
1942 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1944 /* Nonzero in a FUNCTION_DECL means this function should be treated
1945 as "pure" function (like const function, but may read global memory). */
1946 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1948 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1950 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1952 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1953 contour that restored a stack level and which is now exited. */
1954 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1956 /* Unused in FUNCTION_DECL. */
1958 /* In a VAR_DECL that's static,
1959 nonzero if the space is in the text section. */
1960 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1962 /* In a FUNCTION_DECL, nonzero means a built in function. */
1963 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1965 /* For a builtin function, identify which part of the compiler defined it. */
1966 #define DECL_BUILT_IN_CLASS(NODE) \
1967 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1969 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1970 Used in FIELD_DECLs for vtable pointers.
1971 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1972 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1974 /* Used to indicate that the linkage status of this DECL is not yet known,
1975 so it should not be output now. */
1976 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1978 /* Used in PARM_DECLs whose type are unions to indicate that the
1979 argument should be passed in the same way that the first union
1980 alternative would be passed. */
1981 #define DECL_TRANSPARENT_UNION(NODE) \
1982 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1984 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1985 at the beginning or end of execution. */
1986 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1987 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1989 #define DECL_STATIC_DESTRUCTOR(NODE) \
1990 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1992 /* Used to indicate that this DECL represents a compiler-generated entity. */
1993 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1995 /* Used to indicate that this DECL has weak linkage. */
1996 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1998 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1999 multiple translation units should be merged. */
2000 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
2002 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2003 not be put out unless it is needed in this translation unit.
2004 Entities like this are shared across translation units (like weak
2005 entities), but are guaranteed to be generated by any translation
2006 unit that needs them, and therefore need not be put out anywhere
2007 where they are not needed. DECL_COMDAT is just a hint to the
2008 back-end; it is up to front-ends which set this flag to ensure
2009 that there will never be any harm, other than bloat, in putting out
2010 something which is DECL_COMDAT. */
2011 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
2013 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2014 be instrumented with calls to support routines. */
2015 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2016 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
2018 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2019 disabled in this function. */
2020 #define DECL_NO_LIMIT_STACK(NODE) \
2021 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
2023 /* Additional flags for language-specific uses. */
2024 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
2025 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
2026 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
2027 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
2028 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
2029 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
2030 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
2031 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
2033 /* Used to indicate that the pointer to this DECL cannot be treated as
2034 an address constant. */
2035 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
2037 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2039 #define DECL_NONADDRESSABLE_P(NODE) \
2040 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
2042 /* Used to indicate an alias set for the memory pointed to by this
2043 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2044 pointer (or reference) type. */
2045 #define DECL_POINTER_ALIAS_SET(NODE) \
2046 (DECL_CHECK (NODE)->decl.pointer_alias_set)
2048 /* Used to store the alias_var for a DECL node. */
2049 #define DECL_PTA_ALIASVAR(NODE) \
2050 (DECL_CHECK (NODE)->decl.alias_var)
2052 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2053 dense, unique within any one function, and may be used to index arrays.
2054 If the value is -1, then no UID has been assigned. */
2055 #define LABEL_DECL_UID(NODE) \
2056 (LABEL_DECL_CHECK (NODE)->decl.pointer_alias_set)
2058 /* Nonzero if an alias set has been assigned to this declaration. */
2059 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2060 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2062 /* Nonzero for a decl which is at file scope. */
2063 #define DECL_FILE_SCOPE_P(EXP) \
2064 (! DECL_CONTEXT (EXP) \
2065 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2067 /* Nonzero for a decl that has been marked as needing a memory slot.
2068 NOTE: Never use this macro directly. It will give you incomplete
2069 information. Most of the time this bit will only be set after alias
2070 analysis in the tree optimizers. It's always better to call
2071 needs_to_live_in_memory instead. To mark memory variables use
2072 mark_call_clobbered. */
2073 #define DECL_NEEDS_TO_LIVE_IN_MEMORY_INTERNAL(DECL) \
2074 DECL_CHECK (DECL)->decl.needs_to_live_in_memory
2076 /* Nonzero for a decl that cgraph has decided should be inlined into
2077 at least one call site. It is not meaningful to look at this
2078 directly; always use cgraph_function_possibly_inlined_p. */
2079 #define DECL_POSSIBLY_INLINED(DECL) \
2080 FUNCTION_DECL_CHECK (DECL)->decl.possibly_inlined
2082 /* Enumerate visibility settings. */
2084 enum symbol_visibility
2087 VISIBILITY_INTERNAL,
2089 VISIBILITY_PROTECTED
2093 union alias_var_def;
2094 struct tree_decl GTY(())
2096 struct tree_common common;
2100 ENUM_BITFIELD(machine_mode) mode : 8;
2102 unsigned external_flag : 1;
2103 unsigned nonlocal_flag : 1;
2104 unsigned regdecl_flag : 1;
2105 unsigned inline_flag : 1;
2106 unsigned bit_field_flag : 1;
2107 unsigned virtual_flag : 1;
2108 unsigned ignored_flag : 1;
2109 unsigned abstract_flag : 1;
2111 unsigned in_system_header_flag : 1;
2112 unsigned common_flag : 1;
2113 unsigned defer_output : 1;
2114 unsigned transparent_union : 1;
2115 unsigned static_ctor_flag : 1;
2116 unsigned static_dtor_flag : 1;
2117 unsigned artificial_flag : 1;
2118 unsigned weak_flag : 1;
2120 unsigned non_addr_const_p : 1;
2121 unsigned no_instrument_function_entry_exit : 1;
2122 unsigned comdat_flag : 1;
2123 unsigned malloc_flag : 1;
2124 unsigned no_limit_stack : 1;
2125 ENUM_BITFIELD(built_in_class) built_in_class : 2;
2126 unsigned pure_flag : 1;
2128 unsigned non_addressable : 1;
2129 unsigned user_align : 1;
2130 unsigned uninlinable : 1;
2131 unsigned thread_local_flag : 1;
2132 unsigned declared_inline_flag : 1;
2133 unsigned seen_in_bind_expr : 1;
2134 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2136 unsigned lang_flag_0 : 1;
2137 unsigned lang_flag_1 : 1;
2138 unsigned lang_flag_2 : 1;
2139 unsigned lang_flag_3 : 1;
2140 unsigned lang_flag_4 : 1;
2141 unsigned lang_flag_5 : 1;
2142 unsigned lang_flag_6 : 1;
2143 unsigned lang_flag_7 : 1;
2145 unsigned needs_to_live_in_memory : 1;
2146 unsigned possibly_inlined : 1;
2147 /* 14 unused bits. */
2149 union tree_decl_u1 {
2150 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2151 DECL_FUNCTION_CODE. */
2152 enum built_in_function f;
2153 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2154 is used by language-dependent code. */
2156 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2158 struct tree_decl_u1_a {
2159 unsigned int align : 24;
2160 unsigned int off_align : 8;
2167 tree arguments; /* Also used for DECL_FIELD_OFFSET */
2168 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
2169 tree initial; /* Also used for DECL_QUALIFIER */
2170 tree abstract_origin;
2171 tree assembler_name;
2174 rtx rtl; /* RTL representation for object. */
2176 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
2177 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
2178 In PARM_DECL, holds an RTL for the stack slot
2179 of register where the data was actually passed.
2180 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
2181 union tree_decl_u2 {
2182 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
2183 rtx GTY ((tag ("PARM_DECL"))) r;
2184 tree GTY ((tag ("FIELD_DECL"))) t;
2185 int GTY ((tag ("VAR_DECL"))) i;
2186 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
2188 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
2191 /* In a FUNCTION_DECL, these are function data which is to be kept
2192 as long as FUNCTION_DECL is kept. */
2196 HOST_WIDE_INT pointer_alias_set;
2197 union alias_var_def *GTY ((skip(""))) alias_var;
2198 /* Points to a structure whose details depend on the language in use. */
2199 struct lang_decl *lang_specific;
2203 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2204 To reduce overhead, the nodes containing the statements are not trees.
2205 This avoids the overhead of tree_common on all linked list elements.
2207 Use the interface in tree-iterator.h to access this node. */
2209 #define STATEMENT_LIST_HEAD(NODE) \
2210 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2211 #define STATEMENT_LIST_TAIL(NODE) \
2212 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2214 struct tree_statement_list_node
2215 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
2217 struct tree_statement_list_node *prev;
2218 struct tree_statement_list_node *next;
2222 struct tree_statement_list
2225 struct tree_common common;
2226 struct tree_statement_list_node *head;
2227 struct tree_statement_list_node *tail;
2230 enum tree_node_structure_enum {
2250 /* Define the overall contents of a tree node.
2251 It may be any of the structures declared above
2252 for various types of node. */
2254 union tree_node GTY ((ptr_alias (union lang_tree_node),
2255 desc ("tree_node_structure (&%h)")))
2257 struct tree_common GTY ((tag ("TS_COMMON"))) common;
2258 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
2259 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
2260 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
2261 struct tree_string GTY ((tag ("TS_STRING"))) string;
2262 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
2263 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
2264 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
2265 struct tree_type GTY ((tag ("TS_TYPE"))) type;
2266 struct tree_list GTY ((tag ("TS_LIST"))) list;
2267 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
2268 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
2269 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
2270 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
2271 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
2272 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
2275 /* Standard named or nameless data types of the C compiler. */
2294 TI_INTEGER_MINUS_ONE,
2311 TI_COMPLEX_INTEGER_TYPE,
2312 TI_COMPLEX_FLOAT_TYPE,
2313 TI_COMPLEX_DOUBLE_TYPE,
2314 TI_COMPLEX_LONG_DOUBLE_TYPE,
2318 TI_LONG_DOUBLE_TYPE,
2322 TI_LONG_DOUBLE_PTR_TYPE,
2323 TI_INTEGER_PTR_TYPE,
2342 extern GTY(()) tree global_trees[TI_MAX];
2344 #define error_mark_node global_trees[TI_ERROR_MARK]
2346 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2347 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2348 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2349 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2350 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2352 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2353 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2354 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2355 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2356 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2358 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2359 #define integer_one_node global_trees[TI_INTEGER_ONE]
2360 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2361 #define size_zero_node global_trees[TI_SIZE_ZERO]
2362 #define size_one_node global_trees[TI_SIZE_ONE]
2363 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2364 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2365 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2367 /* Base access nodes. */
2368 #define access_public_node global_trees[TI_PUBLIC]
2369 #define access_protected_node global_trees[TI_PROTECTED]
2370 #define access_private_node global_trees[TI_PRIVATE]
2372 #define null_pointer_node global_trees[TI_NULL_POINTER]
2374 #define float_type_node global_trees[TI_FLOAT_TYPE]
2375 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2376 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2378 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
2379 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
2380 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
2381 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
2383 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2384 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2385 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2386 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2388 #define void_type_node global_trees[TI_VOID_TYPE]
2389 /* The C type `void *'. */
2390 #define ptr_type_node global_trees[TI_PTR_TYPE]
2391 /* The C type `const void *'. */
2392 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2393 /* The C type `size_t'. */
2394 #define size_type_node global_trees[TI_SIZE_TYPE]
2395 #define pid_type_node global_trees[TI_PID_TYPE]
2396 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2397 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2398 /* The C type `FILE *'. */
2399 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
2401 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
2402 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
2403 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
2405 /* The node that should be placed at the end of a parameter list to
2406 indicate that the function does not take a variable number of
2407 arguments. The TREE_VALUE will be void_type_node and there will be
2408 no TREE_CHAIN. Language-independent code should not assume
2409 anything else about this node. */
2410 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2412 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2413 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2415 /* An enumeration of the standard C integer types. These must be
2416 ordered so that shorter types appear before longer ones, and so
2417 that signed types appear before unsigned ones, for the correct
2418 functioning of interpret_integer() in c-lex.c. */
2419 enum integer_type_kind
2431 itk_unsigned_long_long,
2435 typedef enum integer_type_kind integer_type_kind;
2437 /* The standard C integer types. Use integer_type_kind to index into
2439 extern GTY(()) tree integer_types[itk_none];
2441 #define char_type_node integer_types[itk_char]
2442 #define signed_char_type_node integer_types[itk_signed_char]
2443 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2444 #define short_integer_type_node integer_types[itk_short]
2445 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2446 #define integer_type_node integer_types[itk_int]
2447 #define unsigned_type_node integer_types[itk_unsigned_int]
2448 #define long_integer_type_node integer_types[itk_long]
2449 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2450 #define long_long_integer_type_node integer_types[itk_long_long]
2451 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2453 /* Set to the default thread-local storage (tls) model to use. */
2456 TLS_MODEL_GLOBAL_DYNAMIC = 1,
2457 TLS_MODEL_LOCAL_DYNAMIC,
2458 TLS_MODEL_INITIAL_EXEC,
2459 TLS_MODEL_LOCAL_EXEC
2462 extern enum tls_model flag_tls_default;
2465 /* A pointer-to-function member type looks like:
2472 If __pfn is NULL, it is a NULL pointer-to-member-function.
2474 (Because the vtable is always the first thing in the object, we
2475 don't need its offset.) If the function is virtual, then PFN is
2476 one plus twice the index into the vtable; otherwise, it is just a
2477 pointer to the function.
2479 Unfortunately, using the lowest bit of PFN doesn't work in
2480 architectures that don't impose alignment requirements on function
2481 addresses, or that use the lowest bit to tell one ISA from another,
2482 for example. For such architectures, we use the lowest bit of
2483 DELTA instead of the lowest bit of the PFN, and DELTA will be
2486 enum ptrmemfunc_vbit_where_t
2488 ptrmemfunc_vbit_in_pfn,
2489 ptrmemfunc_vbit_in_delta
2492 #define NULL_TREE (tree) NULL
2494 extern GTY(()) tree frame_base_decl;
2495 extern tree decl_assembler_name (tree);
2497 /* Compute the number of bytes occupied by 'node'. This routine only
2498 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2500 extern size_t tree_size (tree);
2502 /* Lowest level primitive for allocating a node.
2503 The TREE_CODE is the only argument. Contents are initialized
2504 to zero except for a few of the common fields. */
2506 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
2507 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
2509 /* Make a copy of a node, with all the same contents. */
2511 extern tree copy_node_stat (tree MEM_STAT_DECL);
2512 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
2514 /* Make a copy of a chain of TREE_LIST nodes. */
2516 extern tree copy_list (tree);
2518 /* Make a TREE_VEC. */
2520 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
2521 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
2523 /* Tree nodes for SSA analysis. */
2525 extern tree make_phi_node (tree, int);
2526 extern void init_phinodes (void);
2527 extern void fini_phinodes (void);
2528 extern void release_phi_node (tree);
2529 #ifdef GATHER_STATISTICS
2530 extern void phinodes_print_statistics (void);
2533 extern void init_ssanames (void);
2534 extern void fini_ssanames (void);
2535 extern tree make_ssa_name (tree, tree);
2536 extern void release_ssa_name (tree);
2537 #ifdef GATHER_STATISTICS
2538 extern void ssanames_print_statistics (void);
2541 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2542 The name is supplied as a char *. */
2544 extern tree get_identifier (const char *);
2546 #if GCC_VERSION >= 3000
2547 #define get_identifier(str) \
2548 (__builtin_constant_p (str) \
2549 ? get_identifier_with_length ((str), strlen (str)) \
2550 : get_identifier (str))
2554 /* Identical to get_identifier, except that the length is assumed
2557 extern tree get_identifier_with_length (const char *, size_t);
2559 /* If an identifier with the name TEXT (a null-terminated string) has
2560 previously been referred to, return that node; otherwise return
2563 extern tree maybe_get_identifier (const char *);
2565 /* Construct various types of nodes. */
2567 #define build_int_2(LO, HI) \
2568 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2570 extern tree build (enum tree_code, tree, ...);
2571 extern tree build_nt (enum tree_code, ...);
2573 #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L
2574 /* Use preprocessor trickery to map "build" to "buildN" where N is the
2575 expected number of arguments. This is used for both efficiency (no
2576 varargs), and checking (verifying number of passed arguments). */
2577 #define build(code, ...) \
2578 _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__)
2579 #define _buildN1(BASE, X) _buildN2(BASE, X)
2580 #define _buildN2(BASE, X) BASE##X
2581 #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0)
2582 #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c
2585 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
2586 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
2587 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2588 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
2589 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
2590 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
2591 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
2592 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
2593 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
2594 tree MEM_STAT_DECL);
2595 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
2597 extern tree build_int_2_wide (unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2598 extern tree build_vector (tree, tree);
2599 extern tree build_constructor (tree, tree);
2600 extern tree build_real_from_int_cst (tree, tree);
2601 extern tree build_complex (tree, tree, tree);
2602 extern tree build_string (int, const char *);
2603 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
2604 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
2605 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2606 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
2607 extern tree build_block (tree, tree, tree, tree, tree);
2608 extern void annotate_with_file_line (tree, const char *, int);
2609 extern void annotate_with_locus (tree, location_t);
2610 extern tree build_empty_stmt (void);
2612 /* Construct various nodes representing data types. */
2614 extern tree make_signed_type (int);
2615 extern tree make_unsigned_type (int);
2616 extern void initialize_sizetypes (void);
2617 extern void set_sizetype (tree);
2618 extern void fixup_unsigned_type (tree);
2619 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
2620 extern tree build_pointer_type (tree);
2621 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
2622 extern tree build_reference_type (tree);
2623 extern tree build_vector_type_for_mode (tree, enum machine_mode);
2624 extern tree build_vector_type (tree innertype, int nunits);
2625 extern tree build_type_no_quals (tree);
2626 extern tree build_index_type (tree);
2627 extern tree build_index_2_type (tree, tree);
2628 extern tree build_array_type (tree, tree);
2629 extern tree build_function_type (tree, tree);
2630 extern tree build_function_type_list (tree, ...);
2631 extern tree build_method_type_directly (tree, tree, tree);
2632 extern tree build_method_type (tree, tree);
2633 extern tree build_offset_type (tree, tree);
2634 extern tree build_complex_type (tree);
2635 extern tree array_type_nelts (tree);
2637 extern tree value_member (tree, tree);
2638 extern tree purpose_member (tree, tree);
2639 extern tree binfo_member (tree, tree);
2641 extern int attribute_list_equal (tree, tree);
2642 extern int attribute_list_contained (tree, tree);
2643 extern int tree_int_cst_equal (tree, tree);
2644 extern int tree_int_cst_lt (tree, tree);
2645 extern int tree_int_cst_compare (tree, tree);
2646 extern int host_integerp (tree, int);
2647 extern HOST_WIDE_INT tree_low_cst (tree, int);
2648 extern int tree_int_cst_msb (tree);
2649 extern int tree_int_cst_sgn (tree);
2650 extern int tree_expr_nonnegative_p (tree);
2651 extern int rtl_expr_nonnegative_p (rtx);
2652 extern tree get_inner_array_type (tree);
2654 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2655 put the prototype here. Rtl.h does declare the prototype if
2656 tree.h had been included. */
2658 extern tree make_tree (tree, rtx);
2660 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2663 Such modified types already made are recorded so that duplicates
2666 extern tree build_type_attribute_variant (tree, tree);
2667 extern tree build_decl_attribute_variant (tree, tree);
2669 /* Structure describing an attribute and a function to handle it. */
2670 struct attribute_spec
2672 /* The name of the attribute (without any leading or trailing __),
2673 or NULL to mark the end of a table of attributes. */
2674 const char *const name;
2675 /* The minimum length of the list of arguments of the attribute. */
2676 const int min_length;
2677 /* The maximum length of the list of arguments of the attribute
2678 (-1 for no maximum). */
2679 const int max_length;
2680 /* Whether this attribute requires a DECL. If it does, it will be passed
2681 from types of DECLs, function return types and array element types to
2682 the DECLs, function types and array types respectively; but when
2683 applied to a type in any other circumstances, it will be ignored with
2684 a warning. (If greater control is desired for a given attribute,
2685 this should be false, and the flags argument to the handler may be
2686 used to gain greater control in that case.) */
2687 const bool decl_required;
2688 /* Whether this attribute requires a type. If it does, it will be passed
2689 from a DECL to the type of that DECL. */
2690 const bool type_required;
2691 /* Whether this attribute requires a function (or method) type. If it does,
2692 it will be passed from a function pointer type to the target type,
2693 and from a function return type (which is not itself a function
2694 pointer type) to the function type. */
2695 const bool function_type_required;
2696 /* Function to handle this attribute. NODE points to the node to which
2697 the attribute is to be applied. If a DECL, it should be modified in
2698 place; if a TYPE, a copy should be created. NAME is the name of the
2699 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2700 of the arguments (which may be NULL). FLAGS gives further information
2701 about the context of the attribute. Afterwards, the attributes will
2702 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2703 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2704 as well as in any other cases when the attributes should not be added
2705 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2706 applied to another type or DECL later may be returned;
2707 otherwise the return value should be NULL_TREE. This pointer may be
2708 NULL if no special handling is required beyond the checks implied
2709 by the rest of this structure. */
2710 tree (*const handler) (tree *node, tree name, tree args,
2711 int flags, bool *no_add_attrs);
2714 /* Flags that may be passed in the third argument of decl_attributes, and
2715 to handler functions for attributes. */
2716 enum attribute_flags
2718 /* The type passed in is the type of a DECL, and any attributes that
2719 should be passed in again to be applied to the DECL rather than the
2720 type should be returned. */
2721 ATTR_FLAG_DECL_NEXT = 1,
2722 /* The type passed in is a function return type, and any attributes that
2723 should be passed in again to be applied to the function type rather
2724 than the return type should be returned. */
2725 ATTR_FLAG_FUNCTION_NEXT = 2,
2726 /* The type passed in is an array element type, and any attributes that
2727 should be passed in again to be applied to the array type rather
2728 than the element type should be returned. */
2729 ATTR_FLAG_ARRAY_NEXT = 4,
2730 /* The type passed in is a structure, union or enumeration type being
2731 created, and should be modified in place. */
2732 ATTR_FLAG_TYPE_IN_PLACE = 8,
2733 /* The attributes are being applied by default to a library function whose
2734 name indicates known behavior, and should be silently ignored if they
2735 are not in fact compatible with the function type. */
2736 ATTR_FLAG_BUILT_IN = 16
2739 /* Default versions of target-overridable functions. */
2741 extern tree merge_decl_attributes (tree, tree);
2742 extern tree merge_type_attributes (tree, tree);
2743 extern void default_register_cpp_builtins (struct cpp_reader *);
2745 /* Split a list of declspecs and attributes into two. */
2747 extern void split_specs_attrs (tree, tree *, tree *);
2749 /* Strip attributes from a list of combined specs and attrs. */
2751 extern tree strip_attrs (tree);
2753 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2755 extern int valid_machine_attribute (tree, tree, tree, tree);
2757 /* Given a tree node and a string, return nonzero if the tree node is
2758 a valid attribute name for the string. */
2760 extern int is_attribute_p (const char *, tree);
2762 /* Given an attribute name and a list of attributes, return the list element
2763 of the attribute or NULL_TREE if not found. */
2765 extern tree lookup_attribute (const char *, tree);
2767 /* Given two attributes lists, return a list of their union. */
2769 extern tree merge_attributes (tree, tree);
2771 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2772 /* Given two Windows decl attributes lists, possibly including
2773 dllimport, return a list of their union . */
2774 extern tree merge_dllimport_decl_attributes (tree, tree);
2777 /* Check whether CAND is suitable to be returned from get_qualified_type
2778 (BASE, TYPE_QUALS). */
2780 extern bool check_qualified_type (tree, tree, int);
2782 /* Return a version of the TYPE, qualified as indicated by the
2783 TYPE_QUALS, if one exists. If no qualified version exists yet,
2784 return NULL_TREE. */
2786 extern tree get_qualified_type (tree, int);
2788 /* Like get_qualified_type, but creates the type if it does not
2789 exist. This function never returns NULL_TREE. */
2791 extern tree build_qualified_type (tree, int);
2793 /* Like build_qualified_type, but only deals with the `const' and
2794 `volatile' qualifiers. This interface is retained for backwards
2795 compatibility with the various front-ends; new code should use
2796 build_qualified_type instead. */
2798 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2799 build_qualified_type ((TYPE), \
2800 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2801 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2803 /* Make a copy of a type node. */
2805 extern tree build_type_copy (tree);
2807 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2808 fields. Optionally specify an alignment, and then lsy it out. */
2810 extern void finish_builtin_struct (tree, const char *,
2813 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2814 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2815 node, does nothing except for the first time. */
2817 extern void layout_type (tree);
2819 /* These functions allow a front-end to perform a manual layout of a
2820 RECORD_TYPE. (For instance, if the placement of subsequent fields
2821 depends on the placement of fields so far.) Begin by calling
2822 start_record_layout. Then, call place_field for each of the
2823 fields. Then, call finish_record_layout. See layout_type for the
2824 default way in which these functions are used. */
2826 typedef struct record_layout_info_s
2828 /* The RECORD_TYPE that we are laying out. */
2830 /* The offset into the record so far, in bytes, not including bits in
2833 /* The last known alignment of SIZE. */
2834 unsigned int offset_align;
2835 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2837 /* The alignment of the record so far, in bits. */
2838 unsigned int record_align;
2839 /* The alignment of the record so far, ignoring #pragma pack and
2840 __attribute__ ((packed)), in bits. */
2841 unsigned int unpacked_align;
2842 /* The previous field layed out. */
2844 /* The static variables (i.e., class variables, as opposed to
2845 instance variables) encountered in T. */
2846 tree pending_statics;
2847 /* Bits remaining in the current alignment group */
2848 int remaining_in_alignment;
2849 /* True if we've seen a packed field that didn't have normal
2850 alignment anyway. */
2851 int packed_maybe_necessary;
2852 } *record_layout_info;
2854 extern void set_lang_adjust_rli (void (*) (record_layout_info));
2855 extern record_layout_info start_record_layout (tree);
2856 extern tree bit_from_pos (tree, tree);
2857 extern tree byte_from_pos (tree, tree);
2858 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
2859 extern void normalize_offset (tree *, tree *, unsigned int);
2860 extern tree rli_size_unit_so_far (record_layout_info);
2861 extern tree rli_size_so_far (record_layout_info);
2862 extern void normalize_rli (record_layout_info);
2863 extern void place_field (record_layout_info, tree);
2864 extern void compute_record_mode (tree);
2865 extern void finish_record_layout (record_layout_info, int);
2867 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2868 return a canonicalized ..._TYPE node, so that duplicates are not made.
2869 How the hash code is computed is up to the caller, as long as any two
2870 callers that could hash identical-looking type nodes agree. */
2872 extern tree type_hash_canon (unsigned int, tree);
2874 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2875 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2876 fields. Call this only once for any given decl node.
2878 Second argument is the boundary that this field can be assumed to
2879 be starting at (in bits). Zero means it can be assumed aligned
2880 on any boundary that may be needed. */
2882 extern void layout_decl (tree, unsigned);
2884 /* Return the mode for data of a given size SIZE and mode class CLASS.
2885 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2886 The value is BLKmode if no other mode is found. This is like
2887 mode_for_size, but is passed a tree. */
2889 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
2891 /* Return an expr equal to X but certainly not valid as an lvalue. */
2893 extern tree non_lvalue (tree);
2894 extern tree pedantic_non_lvalue (tree);
2896 extern tree convert (tree, tree);
2897 extern unsigned int expr_align (tree);
2898 extern tree expr_first (tree);
2899 extern tree expr_last (tree);
2900 extern tree expr_only (tree);
2901 extern tree size_in_bytes (tree);
2902 extern HOST_WIDE_INT int_size_in_bytes (tree);
2903 extern tree bit_position (tree);
2904 extern HOST_WIDE_INT int_bit_position (tree);
2905 extern tree byte_position (tree);
2906 extern HOST_WIDE_INT int_byte_position (tree);
2908 /* Define data structures, macros, and functions for handling sizes
2909 and the various types used to represent sizes. */
2913 SIZETYPE, /* Normal representation of sizes in bytes. */
2914 SSIZETYPE, /* Signed representation of sizes in bytes. */
2915 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2916 BITSIZETYPE, /* Normal representation of sizes in bits. */
2917 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2918 UBITSIZETYPE, /* Unsigned representation of sizes in bits. */
2921 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
2923 #define sizetype sizetype_tab[(int) SIZETYPE]
2924 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2925 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2926 #define usizetype sizetype_tab[(int) USIZETYPE]
2927 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2928 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2930 extern tree size_binop (enum tree_code, tree, tree);
2931 extern tree size_diffop (tree, tree);
2932 extern tree size_int_wide (HOST_WIDE_INT, enum size_type_kind);
2933 extern tree size_int_type_wide (HOST_WIDE_INT, tree);
2935 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2936 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2937 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2938 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2939 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2941 extern tree round_up (tree, int);
2942 extern tree round_down (tree, int);
2943 extern tree get_pending_sizes (void);
2944 extern void put_pending_size (tree);
2945 extern void put_pending_sizes (tree);
2947 /* Type for sizes of data-type. */
2949 #define BITS_PER_UNIT_LOG \
2950 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2951 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2952 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2954 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2955 extern unsigned int maximum_field_alignment;
2957 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2958 extern unsigned int set_alignment;
2960 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2961 by making the last node in X point to Y.
2962 Returns X, except if X is 0 returns Y. */
2964 extern tree chainon (tree, tree);
2966 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2968 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
2969 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
2971 /* Return the last tree node in a chain. */
2973 extern tree tree_last (tree);
2975 /* Reverse the order of elements in a chain, and return the new head. */
2977 extern tree nreverse (tree);
2979 /* Returns the length of a chain of nodes
2980 (number of chain pointers to follow before reaching a null pointer). */
2982 extern int list_length (tree);
2984 /* Returns the number of FIELD_DECLs in a type. */
2986 extern int fields_length (tree);
2988 /* Given an initializer INIT, return TRUE if INIT is zero or some
2989 aggregate of zeros. Otherwise return FALSE. */
2991 extern bool initializer_zerop (tree);
2993 extern void categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *);
2994 extern HOST_WIDE_INT count_type_elements (tree);
2995 extern int mostly_zeros_p (tree);
2997 /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */
2999 extern void add_var_to_bind_expr (tree, tree);
3001 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
3003 extern int integer_zerop (tree);
3005 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
3007 extern int integer_onep (tree);
3009 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3010 all of whose significant bits are 1. */
3012 extern int integer_all_onesp (tree);
3014 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3015 exactly one bit 1. */
3017 extern int integer_pow2p (tree);
3019 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3020 with a nonzero value. */
3022 extern int integer_nonzerop (tree);
3024 /* staticp (tree x) is nonzero if X is a reference to data allocated
3025 at a fixed address in memory. */
3027 extern int staticp (tree);
3029 /* save_expr (EXP) returns an expression equivalent to EXP
3030 but it can be used multiple times within context CTX
3031 and only evaluate EXP once. */
3033 extern tree save_expr (tree);
3035 /* Look inside EXPR and into any simple arithmetic operations. Return
3036 the innermost non-arithmetic node. */
3038 extern tree skip_simple_arithmetic (tree);
3040 /* Returns the index of the first non-tree operand for CODE, or the number
3041 of operands if all are trees. */
3043 extern int first_rtl_op (enum tree_code);
3045 /* Return which tree structure is used by T. */
3047 enum tree_node_structure_enum tree_node_structure (tree);
3049 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
3050 can be used multiple times and will evaluate EXP in its entirety
3053 extern tree unsave_expr (tree);
3055 /* Reset EXP in place so that it can be expanded again. Does not
3056 recurse into subtrees. */
3058 extern void unsave_expr_1 (tree);
3060 /* Return 0 if it is safe to evaluate EXPR multiple times,
3061 return 1 if it is safe if EXPR is unsaved afterward, or
3062 return 2 if it is completely unsafe. */
3063 extern int unsafe_for_reeval (tree);
3065 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
3066 or offset that depends on a field within a record.
3068 Note that we only allow such expressions within simple arithmetic
3071 extern bool contains_placeholder_p (tree);
3073 /* This macro calls the above function but short-circuits the common
3074 case of a constant to save time. Also check for null. */
3076 #define CONTAINS_PLACEHOLDER_P(EXP) \
3077 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
3079 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
3080 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
3083 extern bool type_contains_placeholder_p (tree);
3085 /* Return 1 if EXP contains any expressions that produce cleanups for an
3086 outer scope to deal with. Used by fold. */
3088 extern int has_cleanups (tree);
3090 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3091 return a tree with all occurrences of references to F in a
3092 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
3093 contains only arithmetic expressions. */
3095 extern tree substitute_in_expr (tree, tree, tree);
3097 /* This macro calls the above function but short-circuits the common
3098 case of a constant to save time and also checks for NULL. */
3100 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
3101 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
3103 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3104 for it within OBJ, a tree that is an object or a chain of references. */
3106 extern tree substitute_placeholder_in_expr (tree, tree);
3108 /* This macro calls the above function but short-circuits the common
3109 case of a constant to save time and also checks for NULL. */
3111 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
3112 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
3113 : substitute_placeholder_in_expr (EXP, OBJ))
3115 /* variable_size (EXP) is like save_expr (EXP) except that it
3116 is for the special case of something that is part of a
3117 variable size for a data type. It makes special arrangements
3118 to compute the value at the right time when the data type
3119 belongs to a function parameter. */
3121 extern tree variable_size (tree);
3123 /* Given a type T, force elaboration of any SAVE_EXPRs used in the definition
3126 extern void force_type_save_exprs (tree);
3128 /* stabilize_reference (EXP) returns a reference equivalent to EXP
3129 but it can be used multiple times
3130 and only evaluate the subexpressions once. */
3132 extern tree stabilize_reference (tree);
3134 /* Subroutine of stabilize_reference; this is called for subtrees of
3135 references. Any expression with side-effects must be put in a SAVE_EXPR
3136 to ensure that it is only evaluated once. */
3138 extern tree stabilize_reference_1 (tree);
3140 /* Return EXP, stripped of any conversions to wider types
3141 in such a way that the result of converting to type FOR_TYPE
3142 is the same as if EXP were converted to FOR_TYPE.
3143 If FOR_TYPE is 0, it signifies EXP's type. */
3145 extern tree get_unwidened (tree, tree);
3147 /* Return OP or a simpler expression for a narrower value
3148 which can be sign-extended or zero-extended to give back OP.
3149 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3150 or 0 if the value should be sign-extended. */
3152 extern tree get_narrower (tree, int *);
3154 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
3155 look for nested component-refs or array-refs at constant positions
3156 and find the ultimate containing object, which is returned. */
3158 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3159 tree *, enum machine_mode *, int *, int *);
3161 /* Return 1 if T is an expression that get_inner_reference handles. */
3163 extern int handled_component_p (tree);
3165 /* Given a DECL or TYPE, return the scope in which it was declared, or
3166 NUL_TREE if there is no containing scope. */
3168 extern tree get_containing_scope (tree);
3170 /* Return the FUNCTION_DECL which provides this _DECL with its context,
3172 extern tree decl_function_context (tree);
3174 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
3175 this _DECL with its context, or zero if none. */
3176 extern tree decl_type_context (tree);
3178 /* Return 1 if EXPR is the real constant zero. */
3179 extern int real_zerop (tree);
3181 /* Declare commonly used variables for tree structure. */
3183 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
3184 Zero means allow extended lvalues. */
3186 extern int pedantic_lvalues;
3188 /* Nonzero means can safely call expand_expr now;
3189 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
3191 extern int immediate_size_expand;
3193 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
3195 extern GTY(()) tree current_function_decl;
3197 /* Nonzero means a FUNC_BEGIN label was emitted. */
3198 extern GTY(()) tree current_function_func_begin_label;
3200 /* A DECL for the current file-scope context. When using IMA, this heads a
3201 chain of FILE_DECLs; currently only C uses it. */
3203 extern GTY(()) tree current_file_decl;
3205 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
3207 extern int all_types_permanent;
3209 /* Exit a binding level. This function is provided by each language
3211 extern tree poplevel (int, int, int);
3213 /* Declare a predefined function. Return the declaration. This function is
3214 provided by each language frontend. */
3215 extern tree builtin_function (const char *, tree, int, enum built_in_class,
3216 const char *, tree);
3219 extern unsigned crc32_string (unsigned, const char *);
3220 extern void clean_symbol_name (char *);
3221 extern tree get_file_function_name_long (const char *);
3222 extern tree get_set_constructor_bits (tree, char *, int);
3223 extern tree get_set_constructor_bytes (tree, unsigned char *, int);
3224 extern tree get_callee_fndecl (tree);
3225 extern void change_decl_assembler_name (tree, tree);
3226 extern int type_num_arguments (tree);
3227 extern tree lhd_unsave_expr_now (tree);
3228 extern bool associative_tree_code (enum tree_code);
3229 extern bool commutative_tree_code (enum tree_code);
3234 extern void expand_fixups (rtx);
3235 extern tree expand_start_stmt_expr (int);
3236 extern tree expand_end_stmt_expr (tree);
3237 extern void expand_expr_stmt (tree);
3238 extern void expand_expr_stmt_value (tree, int, int);
3239 extern int warn_if_unused_value (tree);
3240 extern void expand_decl_init (tree);
3241 extern void clear_last_expr (void);
3242 extern void expand_label (tree);
3243 extern void expand_goto (tree);
3244 extern void expand_asm (tree, int);
3245 extern void expand_start_cond (tree, int);
3246 extern void expand_end_cond (void);
3247 extern void expand_start_else (void);
3248 extern void expand_start_elseif (tree);
3250 extern void expand_stack_alloc (tree, tree);
3251 extern rtx expand_stack_save (void);
3252 extern void expand_stack_restore (tree);
3253 extern void expand_return (tree);
3254 extern void expand_start_bindings_and_block (int, tree);
3255 #define expand_start_bindings(flags) \
3256 expand_start_bindings_and_block(flags, NULL_TREE)
3257 extern void expand_end_bindings (tree, int, int);
3258 extern void warn_about_unused_variables (tree);
3259 extern void start_cleanup_deferral (void);
3260 extern void end_cleanup_deferral (void);
3261 extern int is_body_block (tree);
3263 extern int conditional_context (void);
3264 extern struct nesting * current_nesting_level (void);
3265 extern tree last_cleanup_this_contour (void);
3266 extern void expand_start_case (int, tree, tree, const char *);
3267 extern void expand_end_case_type (tree, tree);
3268 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
3269 extern int add_case_node (tree, tree, tree, tree *, bool);
3270 extern int pushcase (tree, tree (*) (tree, tree), tree, tree *);
3271 extern int pushcase_range (tree, tree, tree (*) (tree, tree), tree, tree *);
3272 extern void using_eh_for_cleanups (void);
3274 /* In fold-const.c */
3276 /* Fold constants as much as possible in an expression.
3277 Returns the simplified expression.
3278 Acts only on the top level of the expression;
3279 if the argument itself cannot be simplified, its
3280 subexpressions are not changed. */
3282 extern tree fold (tree);
3283 extern tree fold_initializer (tree);
3284 extern tree fold_convert (tree, tree);
3285 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
3286 extern tree fold_abs_const (tree, tree);
3288 extern int force_fit_type (tree, int);
3289 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3290 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3291 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3292 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3293 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3294 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3295 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3296 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3297 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3298 HOST_WIDE_INT, unsigned int,
3299 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3300 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3301 HOST_WIDE_INT, unsigned int,
3302 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3303 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3304 HOST_WIDE_INT, unsigned int,
3305 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3306 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3307 HOST_WIDE_INT, unsigned int,
3308 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3310 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
3311 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
3312 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
3313 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
3316 enum operand_equal_flag
3322 extern int operand_equal_p (tree, tree, unsigned int);
3324 extern tree omit_one_operand (tree, tree, tree);
3325 extern tree omit_two_operands (tree, tree, tree, tree);
3326 extern tree invert_truthvalue (tree);
3327 extern tree nondestructive_fold_unary_to_constant (enum tree_code, tree, tree);
3328 extern tree nondestructive_fold_binary_to_constant (enum tree_code, tree, tree, tree);
3329 extern tree fold_read_from_constant_string (tree);
3330 extern tree int_const_binop (enum tree_code, tree, tree, int);
3331 extern tree build_fold_addr_expr (tree);
3332 extern tree build_fold_addr_expr_with_type (tree, tree);
3333 extern tree build_fold_indirect_ref (tree);
3335 extern bool tree_swap_operands_p (tree, tree, bool);
3336 extern enum tree_code swap_tree_comparison (enum tree_code);
3339 extern tree fold_builtin (tree);
3340 extern enum built_in_function builtin_mathfn_code (tree);
3341 extern tree build_function_call_expr (tree, tree);
3342 extern tree mathfn_built_in (tree, enum built_in_function fn);
3343 extern tree strip_float_extensions (tree);
3344 extern tree simplify_builtin (tree, int);
3345 extern tree c_strlen (tree, int);
3346 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
3349 extern tree strip_float_extensions (tree);
3352 extern void record_component_aliases (tree);
3353 extern HOST_WIDE_INT get_alias_set (tree);
3354 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3355 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3356 extern int readonly_fields_p (tree);
3357 extern int objects_must_conflict_p (tree, tree);
3360 extern int really_constant_p (tree);
3361 extern int int_fits_type_p (tree, tree);
3362 extern bool variably_modified_type_p (tree);
3363 extern int tree_log2 (tree);
3364 extern int tree_floor_log2 (tree);
3365 extern int simple_cst_equal (tree, tree);
3366 extern unsigned int iterative_hash_expr (tree, unsigned int);
3367 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
3368 extern int type_list_equal (tree, tree);
3369 extern int chain_member (tree, tree);
3370 extern tree type_hash_lookup (unsigned int, tree);
3371 extern void type_hash_add (unsigned int, tree);
3372 extern int simple_cst_list_equal (tree, tree);
3373 extern void dump_tree_statistics (void);
3374 extern void expand_function_end (void);
3375 extern void expand_function_start (tree, int);
3376 extern void expand_pending_sizes (tree);
3377 extern void recompute_tree_invarant_for_addr_expr (tree);
3378 extern bool needs_to_live_in_memory (tree);
3379 extern tree make_vector (enum machine_mode, tree, int);
3380 extern tree reconstruct_complex_type (tree, tree);
3382 extern int real_onep (tree);
3383 extern int real_twop (tree);
3384 extern int real_minus_onep (tree);
3385 extern void init_ttree (void);
3386 extern void build_common_tree_nodes (int);
3387 extern void build_common_tree_nodes_2 (int);
3388 extern tree build_range_type (tree, tree, tree);
3391 extern void setjmp_protect_args (void);
3392 extern void setjmp_protect (tree);
3393 extern void expand_main_function (void);
3394 extern void init_dummy_function_start (void);
3395 extern void expand_dummy_function_end (void);
3396 extern void init_function_for_compilation (void);
3397 extern void allocate_struct_function (tree);
3398 extern void init_function_start (tree);
3399 extern void assign_parms (tree);
3400 extern void put_var_into_stack (tree, int);
3401 extern void flush_addressof (tree);
3402 extern void setjmp_vars_warning (tree);
3403 extern void setjmp_args_warning (void);
3404 extern void init_temp_slots (void);
3405 extern void combine_temp_slots (void);
3406 extern void free_temp_slots (void);
3407 extern void pop_temp_slots (void);
3408 extern void push_temp_slots (void);
3409 extern void preserve_temp_slots (rtx);
3410 extern void preserve_rtl_expr_temps (tree);
3411 extern int aggregate_value_p (tree, tree);
3412 extern void free_temps_for_rtl_expr (tree);
3413 extern void instantiate_virtual_regs (tree, rtx);
3414 extern void unshare_all_rtl (tree, rtx);
3415 extern void push_function_context (void);
3416 extern void pop_function_context (void);
3417 extern void push_function_context_to (tree);
3418 extern void pop_function_context_from (tree);
3420 /* In print-rtl.c */
3422 extern void print_rtl (FILE *, rtx);
3425 /* In print-tree.c */
3426 extern void debug_tree (tree);
3428 extern void print_node (FILE *, const char *, tree, int);
3429 extern void print_node_brief (FILE *, const char *, tree, int);
3430 extern void indent_to (FILE *, int);
3434 extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx);
3435 extern void check_max_integer_computation_mode (tree);
3438 extern void start_sequence_for_rtl_expr (tree);
3439 extern rtx emit_line_note (location_t);
3443 /* Nonzero if this is a call to a `const' function. */
3445 /* Nonzero if this is a call to a `volatile' function. */
3446 #define ECF_NORETURN 2
3447 /* Nonzero if this is a call to malloc or a related function. */
3448 #define ECF_MALLOC 4
3449 /* Nonzero if it is plausible that this is a call to alloca. */
3450 #define ECF_MAY_BE_ALLOCA 8
3451 /* Nonzero if this is a call to a function that won't throw an exception. */
3452 #define ECF_NOTHROW 16
3453 /* Nonzero if this is a call to setjmp or a related function. */
3454 #define ECF_RETURNS_TWICE 32
3455 /* Nonzero if this is a call to `longjmp'. */
3456 #define ECF_LONGJMP 64
3457 /* Nonzero if this is a syscall that makes a new process in the image of
3459 #define ECF_SIBCALL 128
3460 /* Nonzero if this is a call to "pure" function (like const function,
3461 but may read memory. */
3462 #define ECF_PURE 256
3463 /* Nonzero if this is a call to a function that returns with the stack
3464 pointer depressed. */
3465 #define ECF_SP_DEPRESSED 512
3466 /* Nonzero if this call is known to always return. */
3467 #define ECF_ALWAYS_RETURN 1024
3468 /* Create libcall block around the call. */
3469 #define ECF_LIBCALL_BLOCK 2048
3471 extern int flags_from_decl_or_type (tree);
3472 extern int call_expr_flags (tree);
3474 extern int setjmp_call_p (tree);
3475 extern bool alloca_call_p (tree);
3479 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3480 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3481 it should be modified in place; if a TYPE, a copy should be created
3482 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3483 information, in the form of a bitwise OR of flags in enum attribute_flags
3484 from tree.h. Depending on these flags, some attributes may be
3485 returned to be applied at a later stage (for example, to apply
3486 a decl attribute to the declaration rather than to its type). */
3487 extern tree decl_attributes (tree *, tree, int);
3489 /* In integrate.c */
3490 extern void set_decl_abstract_flags (tree, int);
3491 extern void set_decl_origin_self (tree);
3493 /* In stor-layout.c */
3494 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
3495 extern void fixup_signed_type (tree);
3496 extern void internal_reference_types (void);
3497 extern unsigned int update_alignment_for_field (record_layout_info, tree,
3500 extern void make_decl_rtl (tree, const char *);
3501 extern void make_decl_one_only (tree);
3502 extern int supports_one_only (void);
3503 extern void variable_section (tree, int);
3504 enum tls_model decl_tls_model (tree);
3505 extern void resolve_unique_section (tree, int, int);
3506 extern void mark_referenced (tree);
3507 extern void mark_decl_referenced (tree);
3508 extern void notice_global_symbol (tree);
3511 extern void emit_nop (void);
3512 extern void expand_computed_goto (tree);
3513 extern bool parse_output_constraint (const char **, int, int, int,
3514 bool *, bool *, bool *);
3515 extern bool parse_input_constraint (const char **, int, int, int, int,
3516 const char * const *, bool *, bool *);
3517 extern void expand_asm_operands (tree, tree, tree, tree, int, location_t);
3518 extern void expand_asm_expr (tree);
3519 extern bool asm_op_is_mem_input (tree, tree);
3520 extern tree resolve_asm_operand_names (tree, tree, tree);
3521 extern int any_pending_cleanups (void);
3522 extern void init_stmt_for_function (void);
3523 extern void expand_start_target_temps (void);
3524 extern void expand_end_target_temps (void);
3525 extern void expand_elseif (tree);
3526 extern void save_stack_pointer (void);
3527 extern void expand_decl (tree);
3528 extern int expand_decl_cleanup (tree, tree);
3529 extern int expand_decl_cleanup_eh (tree, tree, int);
3530 extern void expand_anon_union_decl (tree, tree, tree);
3531 extern int containing_blocks_have_cleanups_or_stack_level (void);
3533 /* In gimplify.c. */
3534 extern tree create_artificial_label (void);
3535 extern void gimplify_function_tree (tree);
3536 extern const char *get_name (tree);
3537 extern tree unshare_expr (tree);
3538 extern void sort_case_labels (tree);
3540 /* If KIND=='I', return a suitable global initializer (constructor) name.
3541 If KIND=='D', return a suitable global clean-up (destructor) name. */
3542 extern tree get_file_function_name (int);
3544 /* Interface of the DWARF2 unwind info support. */
3546 /* Generate a new label for the CFI info to refer to. */
3548 extern char *dwarf2out_cfi_label (void);
3550 /* Entry point to update the canonical frame address (CFA). */
3552 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
3554 /* Add the CFI for saving a register window. */
3556 extern void dwarf2out_window_save (const char *);
3558 /* Add a CFI to update the running total of the size of arguments pushed
3561 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
3563 /* Entry point for saving a register to the stack. */
3565 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
3567 /* Entry point for saving the return address in the stack. */
3569 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
3571 /* Entry point for saving the return address in a register. */
3573 extern void dwarf2out_return_reg (const char *, unsigned);
3575 /* The type of a callback function for walking over tree structure. */
3577 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3578 tree walk_tree (tree*, walk_tree_fn, void*, void*);
3579 tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
3581 /* In tree-dump.c */
3583 /* Different tree dump places. When you add new tree dump places,
3584 extend the DUMP_FILES array in tree-dump.c. */
3585 enum tree_dump_index
3587 TDI_none, /* No dump */
3588 TDI_tu, /* dump the whole translation unit. */
3589 TDI_class, /* dump class hierarchy. */
3590 TDI_original, /* dump each function before optimizing it */
3591 TDI_generic, /* dump each function after genericizing it */
3592 TDI_nested, /* dump each function after unnesting it */
3593 TDI_inlined, /* dump each function after inlining
3595 TDI_vcg, /* create a VCG graph file for each
3596 function's flowgraph. */
3597 TDI_xml, /* dump function call graph. */
3598 TDI_all, /* enable all the dumps. */
3602 /* Bit masks to control tree dumping. Not all values are applicable to
3603 all tree dumps. Add new ones at the end. When you define new
3604 values, extend the DUMP_OPTIONS array in tree-dump.c */
3605 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3606 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3607 #define TDF_RAW (1 << 2) /* don't unparse the function */
3608 #define TDF_DETAILS (1 << 3) /* show more detailed info about
3610 #define TDF_STATS (1 << 4) /* dump various statistics about
3612 #define TDF_BLOCKS (1 << 5) /* display basic block boundaries */
3613 #define TDF_VOPS (1 << 6) /* display virtual operands */
3614 #define TDF_LINENO (1 << 7) /* display statement line numbers */
3615 #define TDF_UID (1 << 8) /* display decl UIDs */
3618 typedef struct dump_info *dump_info_p;
3620 extern int dump_flag (dump_info_p, int, tree);
3621 extern int dump_enabled_p (enum tree_dump_index);
3622 extern FILE *dump_begin (enum tree_dump_index, int *);
3623 extern void dump_end (enum tree_dump_index, FILE *);
3624 extern void dump_node (tree, int, FILE *);
3625 extern int dump_switch_p (const char *);
3626 extern const char *dump_flag_name (enum tree_dump_index);
3627 /* Assign the RTX to declaration. */
3629 extern void set_decl_rtl (tree, rtx);
3630 extern void set_decl_incoming_rtl (tree, rtx);
3632 /* Redefine abort to report an internal error w/o coredump, and
3633 reporting the location of the error in the source file. This logic
3634 is duplicated in rtl.h and tree.h because every file that needs the
3635 special abort includes one or both. toplev.h gets too few files,
3636 system.h gets too many. */
3638 extern void fancy_abort (const char *, int, const char *)
3640 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3642 /* Enum and arrays used for tree allocation stats.
3643 Keep in sync with tree.c:tree_node_kind_names. */
3665 extern int tree_node_counts[];
3666 extern int tree_node_sizes[];
3668 /* True if we are in gimple form and the actions of the folders need to
3669 be restricted. False if we are not in gimple form and folding is not
3670 restricted to creating gimple expressions. */
3671 extern bool in_gimple_form;
3673 #endif /* GCC_TREE_H */