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
215 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
216 TYPE_REF_CAN_ALIAS_ALL in
217 POINTER_TYPE, REFERENCE_TYPE
222 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
223 ??? and other expressions?
225 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
227 TREE_LIST or TREE_VEC
235 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
258 TREE_THIS_VOLATILE in
283 BIT_FIELD_REF_UNSIGNED in
285 SAVE_EXPR_NOPLACEHOLDER in
291 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
297 expressions, IDENTIFIER_NODE
302 CALL_EXPR, FUNCTION_DECL
317 Used in tree traversals to mark visited nodes.
330 /* Define accessors for the fields that all tree nodes have
331 (though some fields are not used for all kinds of nodes). */
333 /* The tree-code says what kind of node it is.
334 Codes are defined in tree.def. */
335 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
336 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
338 /* When checking is enabled, errors will be generated if a tree node
339 is accessed incorrectly. The macros abort with a fatal error. */
340 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
342 #define TREE_CHECK(T, CODE) __extension__ \
343 ({ const tree __t = (T); \
344 if (TREE_CODE (__t) != (CODE)) \
345 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
348 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
349 ({ const tree __t = (T); \
350 if (TREE_CODE (__t) != (CODE1) \
351 && TREE_CODE (__t) != (CODE2)) \
352 tree_check2_failed (__t, (CODE1), (CODE2), __FILE__, __LINE__, \
356 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
357 ({ const tree __t = (T); \
358 if (TREE_CODE (__t) != (CODE1) \
359 && TREE_CODE (__t) != (CODE2) \
360 && TREE_CODE (__t) != (CODE3)) \
361 tree_check3_failed (__t, (CODE1), (CODE2), (CODE3), __FILE__, \
362 __LINE__, __FUNCTION__); \
365 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
366 ({ const tree __t = (T); \
367 if (TREE_CODE (__t) != (CODE1) \
368 && TREE_CODE (__t) != (CODE2) \
369 && TREE_CODE (__t) != (CODE3) \
370 && TREE_CODE (__t) != (CODE4)) \
371 tree_check4_failed (__t, (CODE1), (CODE2), (CODE3), (CODE4), \
372 __FILE__, __LINE__, __FUNCTION__); \
375 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
376 ({ const tree __t = (T); \
377 if (TREE_CODE (__t) != (CODE1) \
378 && TREE_CODE (__t) != (CODE2) \
379 && TREE_CODE (__t) != (CODE3) \
380 && TREE_CODE (__t) != (CODE4) \
381 && TREE_CODE (__t) != (CODE5)) \
382 tree_check5_failed (__t, (CODE1), (CODE2), (CODE3), (CODE4), \
383 (CODE5), __FILE__, __LINE__, __FUNCTION__); \
386 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
387 ({ const tree __t = (T); \
388 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
389 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
393 /* These checks have to be special cased. */
394 #define EXPR_CHECK(T) __extension__ \
395 ({ const tree __t = (T); \
396 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
397 if (!IS_EXPR_CODE_CLASS (__c)) \
398 tree_class_check_failed (__t, 'E', __FILE__, __LINE__, \
402 /* These checks have to be special cased. */
403 #define NON_TYPE_CHECK(T) __extension__ \
404 ({ const tree __t = (T); \
405 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
406 if (!IS_NON_TYPE_CODE_CLASS (__c)) \
407 tree_class_check_failed (__t, 'T', __FILE__, __LINE__, \
411 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
412 (*({const tree __t = (T); \
413 const int __i = (I); \
414 if (TREE_CODE (__t) != TREE_VEC) \
415 tree_check_failed (__t, TREE_VEC, \
416 __FILE__, __LINE__, __FUNCTION__); \
417 if (__i < 0 || __i >= __t->vec.length) \
418 tree_vec_elt_check_failed (__i, __t->vec.length, \
419 __FILE__, __LINE__, __FUNCTION__); \
420 &__t->vec.a[__i]; }))
422 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
423 (*({const tree __t = t; \
424 const int __i = (i); \
425 if (TREE_CODE (__t) != PHI_NODE) \
426 tree_check_failed (__t, PHI_NODE, \
427 __FILE__, __LINE__, __FUNCTION__); \
428 if (__i < 0 || __i >= __t->phi.capacity) \
429 phi_node_elt_check_failed (__i, __t->phi.num_args, \
430 __FILE__, __LINE__, __FUNCTION__); \
431 &__t->phi.a[__i]; }))
433 /* Special checks for TREE_OPERANDs. */
434 #define TREE_OPERAND_CHECK(T, I) __extension__ \
435 (*({const tree __t = EXPR_CHECK (T); \
436 const int __i = (I); \
437 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
438 tree_operand_check_failed (__i, TREE_CODE (__t), \
439 __FILE__, __LINE__, __FUNCTION__); \
440 &__t->exp.operands[__i]; }))
442 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
443 (*({const tree __t = (T); \
444 const int __i = (I); \
445 if (TREE_CODE (__t) != CODE) \
446 tree_check_failed (__t, CODE, __FILE__, __LINE__, __FUNCTION__); \
447 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
448 tree_operand_check_failed (__i, (CODE), \
449 __FILE__, __LINE__, __FUNCTION__); \
450 &__t->exp.operands[__i]; }))
452 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
454 ({const tree __t = (T); \
455 const int __i = (I); \
456 if (TREE_CODE (__t) != (CODE)) \
457 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
458 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
459 tree_operand_check_failed (__i, (CODE), \
460 __FILE__, __LINE__, __FUNCTION__); \
461 &__t->exp.operands[__i]; }))
463 extern void tree_check_failed (const tree, enum tree_code,
464 const char *, int, const char *)
466 extern void tree_check2_failed (const tree, enum tree_code, enum tree_code,
467 const char *, int, const char *)
469 extern void tree_check3_failed (const tree, enum tree_code, enum tree_code,
470 enum tree_code, const char *, int,
473 extern void tree_check4_failed (const tree, enum tree_code, enum tree_code,
474 enum tree_code, enum tree_code,
475 const char *, int, const char *)
477 extern void tree_check5_failed (const tree, enum tree_code, enum tree_code,
478 enum tree_code, enum tree_code, enum tree_code,
479 const char *, int, const char *)
481 extern void tree_class_check_failed (const tree, int,
482 const char *, int, const char *)
484 extern void tree_vec_elt_check_failed (int, int, const char *,
487 extern void phi_node_elt_check_failed (int, int, const char *,
490 extern void tree_operand_check_failed (int, enum tree_code,
491 const char *, int, const char *)
494 #else /* not ENABLE_TREE_CHECKING, or not gcc */
496 #define TREE_CHECK(T, CODE) (T)
497 #define TREE_CHECK2(T, CODE1, CODE2) (T)
498 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
499 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
500 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
501 #define TREE_CLASS_CHECK(T, CODE) (T)
502 #define EXPR_CHECK(T) (T)
503 #define NON_TYPE_CHECK(T) (T)
504 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
505 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
506 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
507 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
508 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
512 #define TREE_BLOCK(NODE) ((NODE)->exp.block)
514 #include "tree-check.h"
516 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't')
517 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd')
518 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c')
519 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's')
520 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
521 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
523 #define SET_OR_ARRAY_CHECK(T) \
524 TREE_CHECK2 (T, ARRAY_TYPE, SET_TYPE)
526 #define REC_OR_UNION_CHECK(T) \
527 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
529 #define NUMERICAL_TYPE_CHECK(T) \
530 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \
531 CHAR_TYPE, REAL_TYPE)
533 /* In all nodes that are expressions, this is the data type of the expression.
534 In POINTER_TYPE nodes, this is the type that the pointer points to.
535 In ARRAY_TYPE nodes, this is the type of the elements.
536 In VECTOR_TYPE nodes, this is the type of the elements. */
537 #define TREE_TYPE(NODE) ((NODE)->common.type)
539 /* Here is how primitive or already-canonicalized types' hash codes
541 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
543 /* A simple hash function for an arbitrary tree node. This must not be
544 used in hash tables which are saved to a PCH. */
545 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
547 /* Nodes are chained together for many purposes.
548 Types are chained together to record them for being output to the debugger
549 (see the function `chain_type').
550 Decls in the same scope are chained together to record the contents
552 Statement nodes for successive statements used to be chained together.
553 Often lists of things are represented by TREE_LIST nodes that
554 are chained together. */
556 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
558 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
559 that don't change the machine mode. */
561 #define STRIP_NOPS(EXP) \
562 while ((TREE_CODE (EXP) == NOP_EXPR \
563 || TREE_CODE (EXP) == CONVERT_EXPR \
564 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
565 && TREE_OPERAND (EXP, 0) != error_mark_node \
566 && (TYPE_MODE (TREE_TYPE (EXP)) \
567 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
568 (EXP) = TREE_OPERAND (EXP, 0)
570 /* Like STRIP_NOPS, but don't let the signedness change either. */
572 #define STRIP_SIGN_NOPS(EXP) \
573 while ((TREE_CODE (EXP) == NOP_EXPR \
574 || TREE_CODE (EXP) == CONVERT_EXPR \
575 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
576 && TREE_OPERAND (EXP, 0) != error_mark_node \
577 && (TYPE_MODE (TREE_TYPE (EXP)) \
578 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
579 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
580 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
581 (EXP) = TREE_OPERAND (EXP, 0)
583 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
585 #define STRIP_MAIN_TYPE_NOPS(EXP) \
586 while ((TREE_CODE (EXP) == NOP_EXPR \
587 || TREE_CODE (EXP) == CONVERT_EXPR \
588 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
589 && TREE_OPERAND (EXP, 0) != error_mark_node \
590 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
591 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
592 (EXP) = TREE_OPERAND (EXP, 0)
594 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
596 #define STRIP_TYPE_NOPS(EXP) \
597 while ((TREE_CODE (EXP) == NOP_EXPR \
598 || TREE_CODE (EXP) == CONVERT_EXPR \
599 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
600 && TREE_OPERAND (EXP, 0) != error_mark_node \
601 && (TREE_TYPE (EXP) \
602 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
603 (EXP) = TREE_OPERAND (EXP, 0)
605 /* Remove unnecessary type conversions according to
606 tree_ssa_useless_type_conversion. */
608 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
609 while (tree_ssa_useless_type_conversion (EXP)) \
610 EXP = TREE_OPERAND (EXP, 0)
612 /* Nonzero if TYPE represents an integral type. Note that we do not
613 include COMPLEX types here. */
615 #define INTEGRAL_TYPE_P(TYPE) \
616 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
617 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
619 /* Nonzero if TYPE represents a scalar floating-point type. */
621 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
623 /* Nonzero if TYPE represents a complex floating-point type. */
625 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
626 (TREE_CODE (TYPE) == COMPLEX_TYPE \
627 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
629 /* Nonzero if TYPE represents a floating-point type, including complex
630 floating-point types. */
632 #define FLOAT_TYPE_P(TYPE) \
633 (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE))
635 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
637 #define AGGREGATE_TYPE_P(TYPE) \
638 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
639 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
640 || TREE_CODE (TYPE) == SET_TYPE)
642 /* Nonzero if TYPE represents a pointer or reference type.
643 (It should be renamed to INDIRECT_TYPE_P.) */
645 #define POINTER_TYPE_P(TYPE) \
646 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
648 /* Nonzero if this type is a complete type. */
649 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
651 /* Nonzero if this type is the (possibly qualified) void type. */
652 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
654 /* Nonzero if this type is complete or is cv void. */
655 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
656 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
658 /* Nonzero if this type is complete or is an array with unspecified bound. */
659 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
660 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
662 /* Nonzero if TYPE represents a type. */
664 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
666 /* Define many boolean fields that all tree nodes have. */
668 /* In VAR_DECL nodes, nonzero means address of this is needed.
669 So it cannot be in a register.
670 In a FUNCTION_DECL, nonzero means its address is needed.
671 So it must be compiled even if it is an inline function.
672 In a FIELD_DECL node, it means that the programmer is permitted to
673 construct the address of this field. This is used for aliasing
674 purposes: see record_component_aliases.
675 In CONSTRUCTOR nodes, it means object constructed must be in memory.
676 In LABEL_DECL nodes, it means a goto for this label has been seen
677 from a place outside all binding contours that restore stack levels.
678 In ..._TYPE nodes, it means that objects of this type must
679 be fully addressable. This means that pieces of this
680 object cannot go into register parameters, for example.
681 In IDENTIFIER_NODEs, this means that some extern decl for this name
682 had its address taken. That matters for inline functions. */
683 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
685 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
687 /* In a VAR_DECL, nonzero means allocate static storage.
688 In a FUNCTION_DECL, nonzero if function has been defined.
689 In a CONSTRUCTOR, nonzero means allocate static storage.
691 ??? This is also used in lots of other nodes in unclear ways which
692 should be cleaned up some day. */
693 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
695 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
696 should only be executed if an exception is thrown, not on normal exit
698 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
700 /* In an expr node (usually a conversion) this means the node was made
701 implicitly and should not lead to any sort of warning. */
702 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
704 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
705 chain is via a `virtual' declaration. */
706 #define TREE_VIA_VIRTUAL(NODE) \
707 (TREE_CHECK2 (NODE, TREE_LIST, TREE_VEC)->common.static_flag)
709 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
710 there was an overflow in folding. This is distinct from
711 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
712 occur in constant expressions. */
713 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
715 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
716 this string as an argument. */
717 #define TREE_SYMBOL_REFERENCED(NODE) \
718 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
720 /* Nonzero in a pointer or reference type means the data pointed to
721 by this type can alias anything. */
722 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
723 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
725 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
726 there was an overflow in folding, and no warning has been issued
727 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
730 ??? Apparently, lots of code assumes this is defined in all
732 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
734 /* In a VAR_DECL or FUNCTION_DECL,
735 nonzero means name is to be accessible from outside this module.
736 In an IDENTIFIER_NODE, nonzero means an external declaration
737 accessible from outside this module was previously seen
738 for this name in an inner scope. */
739 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
741 /* In any expression, decl, or constant, nonzero means it has side effects or
742 reevaluation of the whole expression could produce a different value.
743 This is set if any subexpression is a function call, a side effect or a
744 reference to a volatile variable. In a ..._DECL, this is set only if the
745 declaration said `volatile'. This will never be set for a constant. */
746 #define TREE_SIDE_EFFECTS(NODE) \
747 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
749 /* In a LABEL_DECL, nonzero means this label had its address taken
750 and therefore can never be deleted and is a jump target for
752 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
754 /* Nonzero means this expression is volatile in the C sense:
755 its address should be of type `volatile WHATEVER *'.
756 In other words, the declared item is volatile qualified.
757 This is used in _DECL nodes and _REF nodes.
759 In a ..._TYPE node, means this type is volatile-qualified.
760 But use TYPE_VOLATILE instead of this macro when the node is a type,
761 because eventually we may make that a different bit.
763 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
764 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
766 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
767 accessing the memory pointed to won't generate a trap. However,
768 this only applies to an object when used appropriately: it doesn't
769 mean that writing a READONLY mem won't trap. */
770 #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag)
772 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
773 nonzero means it may not be the lhs of an assignment. */
774 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
776 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
777 #define TREE_READONLY_DECL_P(NODE) (DECL_P (NODE) && TREE_READONLY (NODE))
779 /* Value of expression is constant. Always on in all ..._CST nodes. May
780 also appear in an expression or decl where the value is constant. */
781 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
783 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
784 #define DECL_UNSIGNED(NODE) (DECL_CHECK (NODE)->common.unsigned_flag)
786 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
787 #define BIT_FIELD_REF_UNSIGNED(NODE) \
788 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
790 /* In integral and pointer types, means an unsigned type. */
791 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
793 #define TYPE_TRAP_SIGNED(NODE) \
794 (flag_trapv && ! TYPE_UNSIGNED (NODE))
796 /* Nonzero in a VAR_DECL means assembler code has been written.
797 Nonzero in a FUNCTION_DECL means that the function has been compiled.
798 This is interesting in an inline function, since it might not need
799 to be compiled separately.
800 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
801 if the sdb debugging info for the type has been written.
802 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
803 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
805 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
807 /* Nonzero in a _DECL if the name is used in its scope.
808 Nonzero in an expr node means inhibit warning if value is unused.
809 In IDENTIFIER_NODEs, this means that some extern decl for this name
811 #define TREE_USED(NODE) ((NODE)->common.used_flag)
813 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
814 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
815 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
817 /* In a CALL_EXPR, means that the address of the return slot is part of the
819 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
821 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
822 thunked-to function. */
823 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag)
825 /* In a type, nonzero means that all objects of the type are guaranteed by the
826 language or front-end to be properly aligned, so we can indicate that a MEM
827 of this type is aligned at least to the alignment of the type, even if it
828 doesn't appear that it is. We see this, for example, in object-oriented
829 languages where a tag field may show this is an object of a more-aligned
830 variant of the more generic type.
832 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
834 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
836 /* Used in classes in C++. */
837 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
838 /* Used in classes in C++.
839 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
840 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
842 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
843 deprecated feature by __attribute__((deprecated)). */
844 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
846 /* Value of expression is function invariant. A strict subset of
847 TREE_CONSTANT, such an expression is constant over any one function
848 invocation, though not across different invocations. May appear in
849 any expression node. */
850 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
852 /* These flags are available for each language front end to use internally. */
853 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
854 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
855 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
856 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
857 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
858 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
859 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
861 /* Define additional fields and accessors for nodes representing constants. */
863 /* In an INTEGER_CST node. These two together make a 2-word integer.
864 If the data type is signed, the value is sign-extended to 2 words
865 even though not all of them may really be in use.
866 In an unsigned constant shorter than 2 words, the extra bits are 0. */
867 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
868 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
869 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
871 #define INT_CST_LT(A, B) \
872 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
873 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
874 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
876 #define INT_CST_LT_UNSIGNED(A, B) \
877 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
878 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
879 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
880 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
881 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
883 struct tree_int_cst GTY(())
885 struct tree_common common;
886 /* A sub-struct is necessary here because the function `const_hash'
887 wants to scan both words as a unit and taking the address of the
888 sub-struct yields the properly inclusive bounded pointer. */
889 struct tree_int_cst_lowhi {
890 unsigned HOST_WIDE_INT low;
895 /* In a REAL_CST node. struct real_value is an opaque entity, with
896 manipulators defined in real.h. We don't want tree.h depending on
897 real.h and transitively on tm.h. */
900 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
901 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
903 struct tree_real_cst GTY(())
905 struct tree_common common;
906 struct real_value * real_cst_ptr;
909 /* In a STRING_CST */
910 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
911 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
913 struct tree_string GTY(())
915 struct tree_common common;
920 /* In a COMPLEX_CST node. */
921 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
922 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
924 struct tree_complex GTY(())
926 struct tree_common common;
931 /* In a VECTOR_CST node. */
932 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
934 struct tree_vector GTY(())
936 struct tree_common common;
942 /* Define fields and accessors for some special-purpose tree nodes. */
944 #define IDENTIFIER_LENGTH(NODE) \
945 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
946 #define IDENTIFIER_POINTER(NODE) \
947 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
948 #define IDENTIFIER_HASH_VALUE(NODE) \
949 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
951 /* Translate a hash table identifier pointer to a tree_identifier
952 pointer, and vice versa. */
954 #define HT_IDENT_TO_GCC_IDENT(NODE) \
955 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
956 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
958 struct tree_identifier GTY(())
960 struct tree_common common;
961 struct ht_identifier id;
964 /* In a TREE_LIST node. */
965 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
966 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
968 struct tree_list GTY(())
970 struct tree_common common;
975 /* In a TREE_VEC node. */
976 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
977 #define TREE_VEC_END(NODE) \
978 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
980 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
982 struct tree_vec GTY(())
984 struct tree_common common;
986 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
989 /* Define fields and accessors for some nodes that represent expressions. */
991 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
992 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
993 && VOID_TYPE_P (TREE_TYPE (NODE)) \
994 && integer_zerop (TREE_OPERAND (NODE, 0)))
996 /* In a SAVE_EXPR node. */
997 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1)
998 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2)
1000 #define SAVE_EXPR_NOPLACEHOLDER(NODE) \
1001 (SAVE_EXPR_CHECK (NODE)->common.unsigned_flag)
1003 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
1004 both in normal code and in a handler. (Normally, in a handler, all
1005 SAVE_EXPRs are unsaved, meaning that their values are
1007 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
1009 /* In a RTL_EXPR node. */
1010 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0)
1011 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1)
1012 #define RTL_EXPR_ALT_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 2)
1014 /* In a WITH_CLEANUP_EXPR node. */
1015 #define WITH_CLEANUP_EXPR_RTL(NODE) \
1016 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2)
1018 /* In a CONSTRUCTOR node. */
1019 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
1021 /* In ordinary expression nodes. */
1022 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1023 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1025 /* In a LABELED_BLOCK_EXPR node. */
1026 #define LABELED_BLOCK_LABEL(NODE) \
1027 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
1028 #define LABELED_BLOCK_BODY(NODE) \
1029 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
1031 /* In an EXIT_BLOCK_EXPR node. */
1032 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
1033 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
1034 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
1036 /* In a LOOP_EXPR node. */
1037 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1039 /* The source location of this expression. Non-tree_exp nodes such as
1040 decls and constants can be shared among multiple locations, so
1042 #define EXPR_LOCUS(NODE) \
1043 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1044 ? (NODE)->exp.locus \
1045 : (location_t *)NULL)
1046 #define SET_EXPR_LOCUS(NODE, FROM) \
1047 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1048 #define EXPR_FILENAME(NODE) \
1049 (EXPR_CHECK (NODE)->exp.locus->file)
1050 #define EXPR_LINENO(NODE) \
1051 (EXPR_CHECK (NODE)->exp.locus->line)
1052 #ifdef USE_MAPPED_LOCATION
1053 #define EXPR_LOCATION(NODE) \
1054 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1055 ? (NODE)->exp.locus \
1057 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1059 #define EXPR_LOCATION(NODE) (*EXPR_LOCUS (NODE))
1060 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1063 /* In a TARGET_EXPR node. */
1064 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1065 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1066 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1068 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1070 /* SWITCH_EXPR accessors. These give access to the condition, body and
1071 original condition type (before any compiler conversions)
1072 of the switch statement, respectively. */
1073 #define SWITCH_COND(NODE) TREE_OPERAND ((NODE), 0)
1074 #define SWITCH_BODY(NODE) TREE_OPERAND ((NODE), 1)
1075 #define SWITCH_LABELS(NODE) TREE_OPERAND ((NODE), 2)
1077 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1078 of a case label, respectively. */
1079 #define CASE_LOW(NODE) TREE_OPERAND ((NODE), 0)
1080 #define CASE_HIGH(NODE) TREE_OPERAND ((NODE), 1)
1081 #define CASE_LABEL(NODE) TREE_OPERAND ((NODE), 2)
1083 /* The operands of a BIND_EXPR. */
1084 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1085 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1086 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1088 /* GOTO_EXPR accessor. This gives access to the label associated with
1089 a goto statement. */
1090 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1092 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1093 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1094 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1096 #define ASM_STRING(NODE) TREE_OPERAND ((NODE), 0)
1097 #define ASM_OUTPUTS(NODE) TREE_OPERAND ((NODE), 1)
1098 #define ASM_INPUTS(NODE) TREE_OPERAND ((NODE), 2)
1099 #define ASM_CLOBBERS(NODE) TREE_OPERAND ((NODE), 3)
1100 /* Nonzero if we want to create an ASM_INPUT instead of an
1101 ASM_OPERAND with no operands. */
1102 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1103 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1105 /* COND_EXPR accessors. */
1106 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1107 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1108 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1110 /* LABEL_EXPR accessor. This gives access to the label associated with
1111 the given label expression. */
1112 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1114 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1115 accessors for SSA operands. */
1117 /* CATCH_EXPR accessors. */
1118 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1119 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1121 /* EH_FILTER_EXPR accessors. */
1122 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1123 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1124 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1126 /* OBJ_TYPE_REF accessors. */
1127 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1128 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1129 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1131 struct tree_exp GTY(())
1133 struct tree_common common;
1137 tree GTY ((special ("tree_exp"),
1138 desc ("TREE_CODE ((tree) &%0)")))
1142 /* SSA_NAME accessors. */
1144 /* Returns the variable being referenced. Once released, this is the
1145 only field that can be relied upon. */
1146 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1148 /* Returns the statement which defines this reference. Note that
1149 we use the same field when chaining SSA_NAME nodes together on
1150 the SSA_NAME freelist. */
1151 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1153 /* Returns the SSA version number of this SSA name. Note that in
1154 tree SSA, version numbers are not per variable and may be recycled. */
1155 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1157 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1158 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1160 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1161 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1163 /* Nonzero if this SSA_NAME expression is currently on the free list of
1164 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1165 has no meaning for an SSA_NAME. */
1166 #define SSA_NAME_IN_FREE_LIST(NODE) \
1167 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1169 /* Attributes for SSA_NAMEs for pointer-type variables. */
1170 #define SSA_NAME_PTR_INFO(N) \
1171 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1173 /* Get the value of this SSA_NAME, if available. */
1174 #define SSA_NAME_VALUE(N) \
1175 SSA_NAME_CHECK (N)->ssa_name.value_handle
1177 #ifndef GCC_BITMAP_H
1178 struct bitmap_head_def;
1181 /* Aliasing information for SSA_NAMEs representing pointer variables. */
1182 struct ptr_info_def GTY(())
1184 /* Nonzero if points-to analysis couldn't determine where this pointer
1186 unsigned int pt_anything : 1;
1188 /* Nonzero if this pointer is the result of a call to malloc. */
1189 unsigned int pt_malloc : 1;
1191 /* Nonzero if the value of this pointer escapes the current function. */
1192 unsigned int value_escapes_p : 1;
1194 /* Set of variables that this pointer may point to. */
1195 struct bitmap_head_def *pt_vars;
1197 /* If this pointer has been dereferenced, and points-to information is
1198 more precise than type-based aliasing, indirect references to this
1199 pointer will be represented by this memory tag, instead of the type
1200 tag computed by TBAA. */
1204 struct tree_ssa_name GTY(())
1206 struct tree_common common;
1208 /* _DECL wrapped by this SSA name. */
1211 /* SSA version number. */
1212 unsigned int version;
1214 /* Pointer attributes used for alias analysis. */
1215 struct ptr_info_def *ptr_info;
1217 /* Value for SSA name used by GVN. */
1218 tree GTY((skip)) value_handle;
1221 /* In a PHI_NODE node. */
1222 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1223 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1225 /* PHI_NODEs for each basic block are chained together in a single linked
1226 list. The head of the list is linked from the block annotation, and
1227 the link to the next PHI is in PHI_CHAIN. */
1228 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1230 /* Nonzero if the PHI node was rewritten by a previous pass through the
1232 #define PHI_REWRITTEN(NODE) PHI_NODE_CHECK (NODE)->phi.rewritten
1233 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1234 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1235 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1236 #define PHI_ARG_EDGE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).e
1237 #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero
1241 struct phi_arg_d GTY(())
1244 struct edge_def * GTY((skip (""))) e;
1248 struct tree_phi_node GTY(())
1250 struct tree_common common;
1255 /* Nonzero if the PHI node was rewritten by a previous pass through the
1259 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.capacity"))) a[1];
1263 struct varray_head_tag;
1265 /* In a BLOCK node. */
1266 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1267 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1268 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1269 /* Note: when changing this, make sure to find the places
1270 that use chainon or nreverse. */
1271 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1272 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1273 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1275 /* Nonzero means that this block is prepared to handle exceptions
1276 listed in the BLOCK_VARS slot. */
1277 #define BLOCK_HANDLER_BLOCK(NODE) \
1278 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1280 /* An index number for this block. These values are not guaranteed to
1281 be unique across functions -- whether or not they are depends on
1282 the debugging output format in use. */
1283 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1285 /* If block reordering splits a lexical block into discontiguous
1286 address ranges, we'll make a copy of the original block.
1288 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1289 In that case, we have one source block that has been replicated
1290 (through inlining or unrolling) into many logical blocks, and that
1291 these logical blocks have different physical variables in them.
1293 In this case, we have one logical block split into several
1294 non-contiguous address ranges. Most debug formats can't actually
1295 represent this idea directly, so we fake it by creating multiple
1296 logical blocks with the same variables in them. However, for those
1297 that do support non-contiguous regions, these allow the original
1298 logical block to be reconstructed, along with the set of address
1301 One of the logical block fragments is arbitrarily chosen to be
1302 the ORIGIN. The other fragments will point to the origin via
1303 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1304 be null. The list of fragments will be chained through
1305 BLOCK_FRAGMENT_CHAIN from the origin. */
1307 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1308 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1310 struct tree_block GTY(())
1312 struct tree_common common;
1314 unsigned handler_block_flag : 1;
1315 unsigned abstract_flag : 1;
1316 unsigned block_num : 30;
1321 tree abstract_origin;
1322 tree fragment_origin;
1323 tree fragment_chain;
1326 /* Define fields and accessors for nodes representing data types. */
1328 /* See tree.def for documentation of the use of these fields.
1329 Look at the documentation of the various ..._TYPE tree codes.
1331 Note that the type.values, type.minval, and type.maxval fields are
1332 overloaded and used for different macros in different kinds of types.
1333 Each macro must check to ensure the tree node is of the proper kind of
1334 type. Note also that some of the front-ends also overload these fields,
1335 so they must be checked as well. */
1337 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1338 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1339 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1340 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1341 #define TYPE_ORIG_SIZE_TYPE(NODE) (INTEGER_TYPE_CHECK (NODE)->type.values)
1342 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1343 #define TYPE_DOMAIN(NODE) (SET_OR_ARRAY_CHECK (NODE)->type.values)
1344 #define TYPE_FIELDS(NODE) (REC_OR_UNION_CHECK (NODE)->type.values)
1345 #define TYPE_METHODS(NODE) (REC_OR_UNION_CHECK (NODE)->type.maxval)
1346 #define TYPE_VFIELD(NODE) (REC_OR_UNION_CHECK (NODE)->type.minval)
1347 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1348 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1349 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1350 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1351 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1352 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1353 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1354 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1355 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1356 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1357 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1358 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1359 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1360 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1361 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1362 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1363 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1364 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1366 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1367 in the debugging output. We use this to describe a vector as a
1368 structure containing an array. */
1369 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1371 /* For aggregate types, information about this type, as a base type
1372 for itself. Used in a language-dependent way for types that are
1373 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
1374 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
1376 /* The (language-specific) typed-based alias set for this type.
1377 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1378 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1379 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1380 type can alias objects of any type. */
1381 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1383 /* Nonzero iff the typed-based alias set for this type has been
1385 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1387 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1389 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1391 /* The alignment necessary for objects of this type.
1392 The value is an int, measured in bits. */
1393 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1395 /* 1 if the alignment for this type was requested by "aligned" attribute,
1396 0 if it is the default for this type. */
1397 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1399 /* The alignment for NODE, in bytes. */
1400 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1402 /* If your language allows you to declare types, and you want debug info
1403 for them, then you need to generate corresponding TYPE_DECL nodes.
1404 These "stub" TYPE_DECL nodes have no name, and simply point at the
1405 type node. You then set the TYPE_STUB_DECL field of the type node
1406 to point back at the TYPE_DECL node. This allows the debug routines
1407 to know that the two nodes represent the same type, so that we only
1408 get one debug info record for them. */
1409 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1411 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1412 has BLKmode only because it lacks the alignment requirement for
1414 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1416 /* In an INTEGER_TYPE, it means the type represents a size. We use
1417 this both for validity checking and to permit optimizations that
1418 are unsafe for other types. Note that the C `size_t' type should
1419 *not* have this flag set. The `size_t' type is simply a typedef
1420 for an ordinary integer type that happens to be the type of an
1421 expression returned by `sizeof'; `size_t' has no special
1422 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1423 always actual sizes. */
1424 #define TYPE_IS_SIZETYPE(NODE) \
1425 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1427 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1428 pointer depressed. */
1429 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1430 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1432 /* Nonzero in a type considered volatile as a whole. */
1433 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1435 /* Means this type is const-qualified. */
1436 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1438 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1440 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1442 /* There is a TYPE_QUAL value for each type qualifier. They can be
1443 combined by bitwise-or to form the complete set of qualifiers for a
1446 #define TYPE_UNQUALIFIED 0x0
1447 #define TYPE_QUAL_CONST 0x1
1448 #define TYPE_QUAL_VOLATILE 0x2
1449 #define TYPE_QUAL_RESTRICT 0x4
1451 /* The set of type qualifiers for this type. */
1452 #define TYPE_QUALS(NODE) \
1453 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1454 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1455 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1457 /* These flags are available for each language front end to use internally. */
1458 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1459 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1460 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1461 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1462 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1463 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1464 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1466 /* Used to keep track of visited nodes in tree traversals. This is set to
1467 0 by copy_node and make_node. */
1468 #define TREE_VISITED(NODE) ((NODE)->common.visited)
1470 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1471 that distinguish string from array of char).
1472 If set in a SET_TYPE, indicates a bitstring type. */
1473 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1475 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1476 object of the given ARRAY_TYPE. This allows temporaries to be
1478 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1479 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
1481 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1482 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1483 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1485 /* Indicates that objects of this type must be initialized by calling a
1486 function when they are created. */
1487 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1488 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1490 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1491 the same way that the first union alternative would be passed. */
1492 #define TYPE_TRANSPARENT_UNION(NODE) \
1493 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1495 /* For an ARRAY_TYPE, indicates that it is not permitted to
1496 take the address of a component of the type. */
1497 #define TYPE_NONALIASED_COMPONENT(NODE) \
1498 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1500 /* Indicated that objects of this type should be laid out in as
1501 compact a way as possible. */
1502 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1506 struct tree_type GTY(())
1508 struct tree_common common;
1515 unsigned int precision : 9;
1516 ENUM_BITFIELD(machine_mode) mode : 7;
1518 unsigned string_flag : 1;
1519 unsigned no_force_blk_flag : 1;
1520 unsigned needs_constructing_flag : 1;
1521 unsigned transparent_union_flag : 1;
1522 unsigned packed_flag : 1;
1523 unsigned restrict_flag : 1;
1526 unsigned lang_flag_0 : 1;
1527 unsigned lang_flag_1 : 1;
1528 unsigned lang_flag_2 : 1;
1529 unsigned lang_flag_3 : 1;
1530 unsigned lang_flag_4 : 1;
1531 unsigned lang_flag_5 : 1;
1532 unsigned lang_flag_6 : 1;
1533 unsigned user_align : 1;
1538 union tree_type_symtab {
1539 int GTY ((tag ("0"))) address;
1540 char * GTY ((tag ("1"))) pointer;
1541 struct die_struct * GTY ((tag ("2"))) die;
1542 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1543 descbits ("2"))) symtab;
1551 HOST_WIDE_INT alias_set;
1552 /* Points to a structure whose details depend on the language in use. */
1553 struct lang_type *lang_specific;
1556 /* Define accessor macros for information about type inheritance
1559 A "basetype" means a particular usage of a data type for inheritance
1560 in another type. Each such basetype usage has its own "binfo"
1561 object to describe it. The binfo object is a TREE_VEC node.
1563 Inheritance is represented by the binfo nodes allocated for a
1564 given type. For example, given types C and D, such that D is
1565 inherited by C, 3 binfo nodes will be allocated: one for describing
1566 the binfo properties of C, similarly one for D, and one for
1567 describing the binfo properties of D as a base type for C.
1568 Thus, given a pointer to class C, one can get a pointer to the binfo
1569 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1571 /* The actual data type node being inherited in this basetype. */
1572 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1574 /* The offset where this basetype appears in its containing type.
1575 BINFO_OFFSET slot holds the offset (in bytes)
1576 from the base of the complete object to the base of the part of the
1577 object that is allocated on behalf of this `type'.
1578 This is always 0 except when there is multiple inheritance. */
1580 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1581 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1582 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1584 /* The virtual function table belonging to this basetype. Virtual
1585 function tables provide a mechanism for run-time method dispatching.
1586 The entries of a virtual function table are language-dependent. */
1588 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1589 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1591 /* The virtual functions in the virtual function table. This is
1592 a TREE_LIST that is used as an initial approximation for building
1593 a virtual function table for this basetype. */
1594 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1595 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1597 /* A vector of binfos for the direct basetypes inherited by this
1600 If this basetype describes type D as inherited in C, and if the
1601 basetypes of D are E and F, then this vector contains binfos for
1602 inheritance of E and F by C.
1604 ??? This could probably be done by just allocating the
1605 base types at the end of this TREE_VEC (instead of using
1606 another TREE_VEC). This would simplify the calculation
1607 of how many basetypes a given type had. */
1608 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1609 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1611 /* The number of basetypes for NODE. */
1612 #define BINFO_N_BASETYPES(NODE) \
1613 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1615 /* Accessor macro to get to the Nth basetype of this basetype. */
1616 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1617 #define TYPE_BINFO_BASETYPE(NODE,N) \
1618 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1620 /* For a BINFO record describing a virtual base class, i.e., one where
1621 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1622 base. The actual contents are language-dependent. In the C++
1623 front-end this field is an INTEGER_CST giving an offset into the
1624 vtable where the offset to the virtual base can be found. */
1625 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1627 /* Indicates the accesses this binfo has to its bases. The values are
1628 access_public_node, access_protected_node or access_private_node.
1629 If this array is not present, public access is implied. */
1630 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1631 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1633 /* Number of language independent elements in a binfo. Languages may
1634 add additional trailing elements. */
1636 #define BINFO_ELTS 7
1638 /* Slot used to build a chain that represents a use of inheritance.
1639 For example, if X is derived from Y, and Y is derived from Z,
1640 then this field can be used to link the binfo node for X to
1641 the binfo node for X's Y to represent the use of inheritance
1642 from X to Y. Similarly, this slot of the binfo node for X's Y
1643 can point to the Z from which Y is inherited (in X's inheritance
1644 hierarchy). In this fashion, one can represent and traverse specific
1645 uses of inheritance using the binfo nodes themselves (instead of
1646 consing new space pointing to binfo nodes).
1647 It is up to the language-dependent front-ends to maintain
1648 this information as necessary. */
1649 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1651 /* Define fields and accessors for nodes representing declared names. */
1653 /* Nonzero if DECL represents a decl. */
1654 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1656 /* Nonzero if DECL represents a variable for the SSA passes. */
1657 #define SSA_VAR_P(DECL) \
1658 (TREE_CODE (DECL) == VAR_DECL \
1659 || TREE_CODE (DECL) == PARM_DECL \
1660 || TREE_CODE (DECL) == RESULT_DECL \
1661 || (TREE_CODE (DECL) == SSA_NAME \
1662 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
1663 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
1664 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
1666 /* This is the name of the object as written by the user.
1667 It is an IDENTIFIER_NODE. */
1668 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1670 /* The name of the object as the assembler will see it (but before any
1671 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1672 as DECL_NAME. It is an IDENTIFIER_NODE. */
1673 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1675 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1676 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1678 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1679 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1681 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1682 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1683 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1685 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1686 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1687 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1688 semantics of using this macro, are different than saying:
1690 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1692 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1694 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1695 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1696 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1697 DECL_ASSEMBLER_NAME (DECL1)) \
1700 /* Records the section name in a section attribute. Used to pass
1701 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1702 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1704 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1705 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1706 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1707 points to either the FUNCTION_DECL for the containing function,
1708 the RECORD_TYPE or UNION_TYPE for the containing type, or
1709 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1711 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1712 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1713 /* In a DECL this is the field where attributes are stored. */
1714 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1715 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1716 byte containing the bit closest to the beginning of the structure. */
1717 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1718 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1719 field from DECL_FIELD_OFFSET. */
1720 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1721 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1722 if so, the type that was originally specified for it.
1723 TREE_TYPE may have been modified (in finish_struct). */
1724 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1725 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1726 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1728 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1729 /* This field is used to reference anything in decl.result and is meant only
1730 for use by the garbage collector. */
1731 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1732 /* In FUNCTION_DECL, holds the decl for the return value. */
1733 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1734 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1735 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1736 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1737 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1738 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1739 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1740 For a VAR_DECL, holds the initial value.
1741 For a PARM_DECL, not used--default
1742 values for parameters are encoded in the type of the function,
1743 not in the PARM_DECL slot.
1745 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1746 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1747 /* For a PARM_DECL, records the data type used to pass the argument,
1748 which may be different from the type seen in the program. */
1749 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1750 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1751 if nonzero, indicates that the field occupies the type. */
1752 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1753 /* These two fields describe where in the source code the declaration
1754 was. If the declaration appears in several places (as for a C
1755 function that is declared first and then defined later), this
1756 information should refer to the definition. */
1757 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1758 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1759 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1760 /* Holds the size of the datum, in bits, as a tree expression.
1761 Need not be constant. */
1762 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1763 /* Likewise for the size in bytes. */
1764 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1765 /* Holds the alignment required for the datum, in bits. */
1766 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1767 /* The alignment of NODE, in bytes. */
1768 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1769 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1770 DECL_FIELD_OFFSET which are known to be always zero.
1771 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1773 #define DECL_OFFSET_ALIGN(NODE) \
1774 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1775 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1776 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1777 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1778 /* 1 if the alignment for this type was requested by "aligned" attribute,
1779 0 if it is the default for this type. */
1780 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1781 /* Holds the machine mode corresponding to the declaration of a variable or
1782 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1784 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1785 /* Holds the RTL expression for the value of a variable or function.
1786 This value can be evaluated lazily for functions, variables with
1787 static storage duration, and labels. */
1788 #define DECL_RTL(NODE) \
1789 (DECL_CHECK (NODE)->decl.rtl \
1790 ? (NODE)->decl.rtl \
1791 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1792 /* Set the DECL_RTL for NODE to RTL. */
1793 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1794 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1795 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1796 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1797 NODE1, it will not be set for NODE2; this is a lazy copy. */
1798 #define COPY_DECL_RTL(NODE1, NODE2) \
1799 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1800 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1801 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1803 /* For PARM_DECL, holds an RTL for the stack slot or register
1804 where the data was actually passed. */
1805 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1807 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
1808 that describes the status of this function. */
1809 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1811 /* For FUNCTION_DECL, if it is built-in,
1812 this identifies which built-in operation it is. */
1813 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1815 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this is
1816 the approximate number of statements in this function. There is
1817 no need for this number to be exact; it is only used in various
1818 heuristics regarding optimization. */
1819 #define DECL_NUM_STMTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.i)
1821 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1822 Before the struct containing the FUNCTION_DECL is laid out,
1823 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1824 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1825 function. When the class is laid out, this pointer is changed
1826 to an INTEGER_CST node which is suitable for use as an index
1827 into the virtual function table. */
1828 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1830 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1831 which this FIELD_DECL is defined. This information is needed when
1832 writing debugging information about vfield and vbase decls for C++. */
1833 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1835 /* Every ..._DECL node gets a unique number. */
1836 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1838 /* For any sort of a ..._DECL node, this points to the original (abstract)
1839 decl node which this decl is an instance of, or else it is NULL indicating
1840 that this decl is not an instance of some other decl. For example,
1841 in a nested declaration of an inline function, this points back to the
1843 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1845 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1846 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1847 #define DECL_ORIGIN(NODE) \
1848 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1850 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1851 inline instance of some original (abstract) decl from an inline function;
1852 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1853 nodes can also have their abstract origin set to themselves. */
1854 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1855 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1857 /* Nonzero if a _DECL means that the name of this decl should be ignored
1858 for symbolic debug purposes. */
1859 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1861 /* Nonzero for a given ..._DECL node means that this node represents an
1862 "abstract instance" of the given declaration (e.g. in the original
1863 declaration of an inline function). When generating symbolic debugging
1864 information, we mustn't try to generate any address information for nodes
1865 marked as "abstract instances" because we don't actually generate
1866 any code or allocate any data space for such instances. */
1867 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1869 /* Nonzero if a _DECL means that no warnings should be generated just
1870 because this decl is unused. */
1871 #define DECL_IN_SYSTEM_HEADER(NODE) \
1872 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1874 /* Nonzero for a given ..._DECL node means that this node should be
1875 put in .common, if possible. If a DECL_INITIAL is given, and it
1876 is not error_mark_node, then the decl cannot be put in .common. */
1877 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1879 /* Language-specific decl information. */
1880 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1882 /* In a VAR_DECL or FUNCTION_DECL,
1883 nonzero means external reference:
1884 do not allocate storage, and refer to a definition elsewhere. */
1885 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1887 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1889 #define DEFAULT_INIT_PRIORITY 65535
1890 #define MAX_INIT_PRIORITY 65535
1891 #define MAX_RESERVED_INIT_PRIORITY 100
1894 nonzero means the detail info about this type is not dumped into stabs.
1895 Instead it will generate cross reference ('x') of names.
1896 This uses the same flag as DECL_EXTERNAL. */
1897 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1898 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1900 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1901 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1903 /* In LABEL_DECL nodes, nonzero means that an error message about
1904 jumping into such a binding contour has been printed for this label. */
1905 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1907 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1908 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1910 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1911 static chain is not needed. */
1912 #define DECL_NO_STATIC_CHAIN(NODE) \
1913 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1915 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1916 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1918 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1920 Also set in some languages for variables, etc., outside the normal
1921 lexical scope, such as class instance variables. */
1922 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1924 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1925 where it is called. */
1926 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1928 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
1929 such as via the `inline' keyword in C/C++. This flag controls the linkage
1930 semantics of 'inline'; whether or not the function is inlined is
1931 controlled by DECL_INLINE. */
1932 #define DECL_DECLARED_INLINE_P(NODE) \
1933 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
1935 /* In a VAR_DECL, nonzero if the decl is a register variable with
1936 an explicit asm specification. */
1937 #define DECL_HARD_REGISTER(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1939 /* Value of the decls's visibility attribute */
1940 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility)
1942 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1943 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1945 /* In a VAR_DECL, nonzero if the data should be allocated from
1946 thread-local storage. */
1947 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1949 /* In a FUNCTION_DECL, the saved representation of the body of the
1951 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1953 /* List of FUNCTION_DECLs inlined into this function's body. */
1954 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1956 /* Nonzero in a FUNCTION_DECL means this function should be treated
1957 as if it were a malloc, meaning it returns a pointer that is
1959 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1961 /* Nonzero in a FUNCTION_DECL means this function should be treated
1962 as "pure" function (like const function, but may read global memory). */
1963 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1965 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1967 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1969 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1970 contour that restored a stack level and which is now exited. */
1971 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1973 /* Unused in FUNCTION_DECL. */
1975 /* In a VAR_DECL that's static,
1976 nonzero if the space is in the text section. */
1977 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1979 /* In a FUNCTION_DECL, nonzero means a built in function. */
1980 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1982 /* For a builtin function, identify which part of the compiler defined it. */
1983 #define DECL_BUILT_IN_CLASS(NODE) \
1984 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1986 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1987 Used in FIELD_DECLs for vtable pointers.
1988 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1989 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1991 /* Used to indicate that the linkage status of this DECL is not yet known,
1992 so it should not be output now. */
1993 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1995 /* Used in PARM_DECLs whose type are unions to indicate that the
1996 argument should be passed in the same way that the first union
1997 alternative would be passed. */
1998 #define DECL_TRANSPARENT_UNION(NODE) \
1999 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
2001 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2002 at the beginning or end of execution. */
2003 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2004 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
2006 #define DECL_STATIC_DESTRUCTOR(NODE) \
2007 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
2009 /* Used to indicate that this DECL represents a compiler-generated entity. */
2010 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
2012 /* Used to indicate that this DECL has weak linkage. */
2013 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
2015 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2016 multiple translation units should be merged. */
2017 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
2019 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2020 not be put out unless it is needed in this translation unit.
2021 Entities like this are shared across translation units (like weak
2022 entities), but are guaranteed to be generated by any translation
2023 unit that needs them, and therefore need not be put out anywhere
2024 where they are not needed. DECL_COMDAT is just a hint to the
2025 back-end; it is up to front-ends which set this flag to ensure
2026 that there will never be any harm, other than bloat, in putting out
2027 something which is DECL_COMDAT. */
2028 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
2030 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2031 be instrumented with calls to support routines. */
2032 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2033 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
2035 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2036 disabled in this function. */
2037 #define DECL_NO_LIMIT_STACK(NODE) \
2038 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
2040 /* Additional flags for language-specific uses. */
2041 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
2042 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
2043 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
2044 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
2045 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
2046 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
2047 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
2048 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
2050 /* Used to indicate that the pointer to this DECL cannot be treated as
2051 an address constant. */
2052 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
2054 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2056 #define DECL_NONADDRESSABLE_P(NODE) \
2057 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
2059 /* Used to indicate an alias set for the memory pointed to by this
2060 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2061 pointer (or reference) type. */
2062 #define DECL_POINTER_ALIAS_SET(NODE) \
2063 (DECL_CHECK (NODE)->decl.pointer_alias_set)
2065 /* Used to store the alias_var for a DECL node. */
2066 #define DECL_PTA_ALIASVAR(NODE) \
2067 (DECL_CHECK (NODE)->decl.alias_var)
2069 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2070 dense, unique within any one function, and may be used to index arrays.
2071 If the value is -1, then no UID has been assigned. */
2072 #define LABEL_DECL_UID(NODE) \
2073 (LABEL_DECL_CHECK (NODE)->decl.pointer_alias_set)
2075 /* Nonzero if an alias set has been assigned to this declaration. */
2076 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2077 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2079 /* Nonzero for a decl which is at file scope. */
2080 #define DECL_FILE_SCOPE_P(EXP) \
2081 (! DECL_CONTEXT (EXP) \
2082 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2084 /* Nonzero for a decl that has been marked as needing a memory slot.
2085 NOTE: Never use this macro directly. It will give you incomplete
2086 information. Most of the time this bit will only be set after alias
2087 analysis in the tree optimizers. It's always better to call
2088 needs_to_live_in_memory instead. To mark memory variables use
2089 mark_call_clobbered. */
2090 #define DECL_NEEDS_TO_LIVE_IN_MEMORY_INTERNAL(DECL) \
2091 DECL_CHECK (DECL)->decl.needs_to_live_in_memory
2093 /* Nonzero for a decl that cgraph has decided should be inlined into
2094 at least one call site. It is not meaningful to look at this
2095 directly; always use cgraph_function_possibly_inlined_p. */
2096 #define DECL_POSSIBLY_INLINED(DECL) \
2097 FUNCTION_DECL_CHECK (DECL)->decl.possibly_inlined
2099 /* Enumerate visibility settings. */
2101 enum symbol_visibility
2104 VISIBILITY_INTERNAL,
2106 VISIBILITY_PROTECTED
2110 union alias_var_def;
2111 struct tree_decl GTY(())
2113 struct tree_common common;
2117 ENUM_BITFIELD(machine_mode) mode : 8;
2119 unsigned external_flag : 1;
2120 unsigned nonlocal_flag : 1;
2121 unsigned regdecl_flag : 1;
2122 unsigned inline_flag : 1;
2123 unsigned bit_field_flag : 1;
2124 unsigned virtual_flag : 1;
2125 unsigned ignored_flag : 1;
2126 unsigned abstract_flag : 1;
2128 unsigned in_system_header_flag : 1;
2129 unsigned common_flag : 1;
2130 unsigned defer_output : 1;
2131 unsigned transparent_union : 1;
2132 unsigned static_ctor_flag : 1;
2133 unsigned static_dtor_flag : 1;
2134 unsigned artificial_flag : 1;
2135 unsigned weak_flag : 1;
2137 unsigned non_addr_const_p : 1;
2138 unsigned no_instrument_function_entry_exit : 1;
2139 unsigned comdat_flag : 1;
2140 unsigned malloc_flag : 1;
2141 unsigned no_limit_stack : 1;
2142 ENUM_BITFIELD(built_in_class) built_in_class : 2;
2143 unsigned pure_flag : 1;
2145 unsigned non_addressable : 1;
2146 unsigned user_align : 1;
2147 unsigned uninlinable : 1;
2148 unsigned thread_local_flag : 1;
2149 unsigned declared_inline_flag : 1;
2150 unsigned seen_in_bind_expr : 1;
2151 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2153 unsigned lang_flag_0 : 1;
2154 unsigned lang_flag_1 : 1;
2155 unsigned lang_flag_2 : 1;
2156 unsigned lang_flag_3 : 1;
2157 unsigned lang_flag_4 : 1;
2158 unsigned lang_flag_5 : 1;
2159 unsigned lang_flag_6 : 1;
2160 unsigned lang_flag_7 : 1;
2162 unsigned needs_to_live_in_memory : 1;
2163 unsigned possibly_inlined : 1;
2164 /* 14 unused bits. */
2166 union tree_decl_u1 {
2167 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2168 DECL_FUNCTION_CODE. */
2169 enum built_in_function f;
2170 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2171 is used by language-dependent code. */
2173 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2175 struct tree_decl_u1_a {
2176 unsigned int align : 24;
2177 unsigned int off_align : 8;
2184 tree arguments; /* Also used for DECL_FIELD_OFFSET */
2185 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
2186 tree initial; /* Also used for DECL_QUALIFIER */
2187 tree abstract_origin;
2188 tree assembler_name;
2191 rtx rtl; /* RTL representation for object. */
2193 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
2194 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
2195 In PARM_DECL, holds an RTL for the stack slot
2196 of register where the data was actually passed.
2197 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
2198 union tree_decl_u2 {
2199 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
2200 rtx GTY ((tag ("PARM_DECL"))) r;
2201 tree GTY ((tag ("FIELD_DECL"))) t;
2202 int GTY ((tag ("VAR_DECL"))) i;
2203 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
2205 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
2208 /* In a FUNCTION_DECL, these are function data which is to be kept
2209 as long as FUNCTION_DECL is kept. */
2213 HOST_WIDE_INT pointer_alias_set;
2214 union alias_var_def *GTY ((skip(""))) alias_var;
2215 /* Points to a structure whose details depend on the language in use. */
2216 struct lang_decl *lang_specific;
2220 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2221 To reduce overhead, the nodes containing the statements are not trees.
2222 This avoids the overhead of tree_common on all linked list elements.
2224 Use the interface in tree-iterator.h to access this node. */
2226 #define STATEMENT_LIST_HEAD(NODE) \
2227 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2228 #define STATEMENT_LIST_TAIL(NODE) \
2229 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2231 struct tree_statement_list_node
2232 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
2234 struct tree_statement_list_node *prev;
2235 struct tree_statement_list_node *next;
2239 struct tree_statement_list
2242 struct tree_common common;
2243 struct tree_statement_list_node *head;
2244 struct tree_statement_list_node *tail;
2247 #define VALUE_HANDLE_ID(NODE) \
2248 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
2250 #define VALUE_HANDLE_EXPR_SET(NODE) \
2251 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
2253 /* Defined and used in tree-ssa-pre.c. */
2256 struct tree_value_handle GTY(())
2258 struct tree_common common;
2260 /* The set of expressions represented by this handle. */
2261 struct value_set * GTY ((skip)) expr_set;
2263 /* Unique ID for this value handle. IDs are handed out in a
2264 conveniently dense form starting at 0, so that we can make
2265 bitmaps of value handles. */
2269 enum tree_node_structure_enum {
2290 /* Define the overall contents of a tree node.
2291 It may be any of the structures declared above
2292 for various types of node. */
2294 union tree_node GTY ((ptr_alias (union lang_tree_node),
2295 desc ("tree_node_structure (&%h)")))
2297 struct tree_common GTY ((tag ("TS_COMMON"))) common;
2298 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
2299 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
2300 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
2301 struct tree_string GTY ((tag ("TS_STRING"))) string;
2302 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
2303 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
2304 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
2305 struct tree_type GTY ((tag ("TS_TYPE"))) type;
2306 struct tree_list GTY ((tag ("TS_LIST"))) list;
2307 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
2308 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
2309 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
2310 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
2311 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
2312 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
2313 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
2316 /* Standard named or nameless data types of the C compiler. */
2335 TI_INTEGER_MINUS_ONE,
2352 TI_COMPLEX_INTEGER_TYPE,
2353 TI_COMPLEX_FLOAT_TYPE,
2354 TI_COMPLEX_DOUBLE_TYPE,
2355 TI_COMPLEX_LONG_DOUBLE_TYPE,
2359 TI_LONG_DOUBLE_TYPE,
2363 TI_LONG_DOUBLE_PTR_TYPE,
2364 TI_INTEGER_PTR_TYPE,
2383 extern GTY(()) tree global_trees[TI_MAX];
2385 #define error_mark_node global_trees[TI_ERROR_MARK]
2387 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2388 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2389 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2390 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2391 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2393 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2394 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2395 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2396 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2397 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2399 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2400 #define integer_one_node global_trees[TI_INTEGER_ONE]
2401 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2402 #define size_zero_node global_trees[TI_SIZE_ZERO]
2403 #define size_one_node global_trees[TI_SIZE_ONE]
2404 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2405 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2406 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2408 /* Base access nodes. */
2409 #define access_public_node global_trees[TI_PUBLIC]
2410 #define access_protected_node global_trees[TI_PROTECTED]
2411 #define access_private_node global_trees[TI_PRIVATE]
2413 #define null_pointer_node global_trees[TI_NULL_POINTER]
2415 #define float_type_node global_trees[TI_FLOAT_TYPE]
2416 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2417 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2419 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
2420 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
2421 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
2422 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
2424 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2425 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2426 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2427 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2429 #define void_type_node global_trees[TI_VOID_TYPE]
2430 /* The C type `void *'. */
2431 #define ptr_type_node global_trees[TI_PTR_TYPE]
2432 /* The C type `const void *'. */
2433 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2434 /* The C type `size_t'. */
2435 #define size_type_node global_trees[TI_SIZE_TYPE]
2436 #define pid_type_node global_trees[TI_PID_TYPE]
2437 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2438 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2439 /* The C type `FILE *'. */
2440 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
2442 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
2443 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
2444 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
2446 /* The node that should be placed at the end of a parameter list to
2447 indicate that the function does not take a variable number of
2448 arguments. The TREE_VALUE will be void_type_node and there will be
2449 no TREE_CHAIN. Language-independent code should not assume
2450 anything else about this node. */
2451 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2453 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2454 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2456 /* An enumeration of the standard C integer types. These must be
2457 ordered so that shorter types appear before longer ones, and so
2458 that signed types appear before unsigned ones, for the correct
2459 functioning of interpret_integer() in c-lex.c. */
2460 enum integer_type_kind
2472 itk_unsigned_long_long,
2476 typedef enum integer_type_kind integer_type_kind;
2478 /* The standard C integer types. Use integer_type_kind to index into
2480 extern GTY(()) tree integer_types[itk_none];
2482 #define char_type_node integer_types[itk_char]
2483 #define signed_char_type_node integer_types[itk_signed_char]
2484 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2485 #define short_integer_type_node integer_types[itk_short]
2486 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2487 #define integer_type_node integer_types[itk_int]
2488 #define unsigned_type_node integer_types[itk_unsigned_int]
2489 #define long_integer_type_node integer_types[itk_long]
2490 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2491 #define long_long_integer_type_node integer_types[itk_long_long]
2492 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2494 /* Set to the default thread-local storage (tls) model to use. */
2497 TLS_MODEL_GLOBAL_DYNAMIC = 1,
2498 TLS_MODEL_LOCAL_DYNAMIC,
2499 TLS_MODEL_INITIAL_EXEC,
2500 TLS_MODEL_LOCAL_EXEC
2503 extern enum tls_model flag_tls_default;
2506 /* A pointer-to-function member type looks like:
2513 If __pfn is NULL, it is a NULL pointer-to-member-function.
2515 (Because the vtable is always the first thing in the object, we
2516 don't need its offset.) If the function is virtual, then PFN is
2517 one plus twice the index into the vtable; otherwise, it is just a
2518 pointer to the function.
2520 Unfortunately, using the lowest bit of PFN doesn't work in
2521 architectures that don't impose alignment requirements on function
2522 addresses, or that use the lowest bit to tell one ISA from another,
2523 for example. For such architectures, we use the lowest bit of
2524 DELTA instead of the lowest bit of the PFN, and DELTA will be
2527 enum ptrmemfunc_vbit_where_t
2529 ptrmemfunc_vbit_in_pfn,
2530 ptrmemfunc_vbit_in_delta
2533 #define NULL_TREE (tree) NULL
2535 extern GTY(()) tree frame_base_decl;
2536 extern tree decl_assembler_name (tree);
2538 /* Compute the number of bytes occupied by 'node'. This routine only
2539 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2541 extern size_t tree_size (tree);
2543 /* Lowest level primitive for allocating a node.
2544 The TREE_CODE is the only argument. Contents are initialized
2545 to zero except for a few of the common fields. */
2547 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
2548 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
2550 /* Make a copy of a node, with all the same contents. */
2552 extern tree copy_node_stat (tree MEM_STAT_DECL);
2553 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
2555 /* Make a copy of a chain of TREE_LIST nodes. */
2557 extern tree copy_list (tree);
2559 /* Make a TREE_VEC. */
2561 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
2562 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
2564 /* Tree nodes for SSA analysis. */
2566 extern tree make_phi_node (tree, int);
2567 extern void init_phinodes (void);
2568 extern void fini_phinodes (void);
2569 extern void release_phi_node (tree);
2570 #ifdef GATHER_STATISTICS
2571 extern void phinodes_print_statistics (void);
2574 extern void init_ssanames (void);
2575 extern void fini_ssanames (void);
2576 extern tree make_ssa_name (tree, tree);
2577 extern tree duplicate_ssa_name (tree, tree);
2578 extern void release_ssa_name (tree);
2579 #ifdef GATHER_STATISTICS
2580 extern void ssanames_print_statistics (void);
2583 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2584 The name is supplied as a char *. */
2586 extern tree get_identifier (const char *);
2588 #if GCC_VERSION >= 3000
2589 #define get_identifier(str) \
2590 (__builtin_constant_p (str) \
2591 ? get_identifier_with_length ((str), strlen (str)) \
2592 : get_identifier (str))
2596 /* Identical to get_identifier, except that the length is assumed
2599 extern tree get_identifier_with_length (const char *, size_t);
2601 /* If an identifier with the name TEXT (a null-terminated string) has
2602 previously been referred to, return that node; otherwise return
2605 extern tree maybe_get_identifier (const char *);
2607 /* Construct various types of nodes. */
2609 #define build_int_2(LO, HI) \
2610 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2612 extern tree build (enum tree_code, tree, ...);
2613 extern tree build_nt (enum tree_code, ...);
2615 #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L
2616 /* Use preprocessor trickery to map "build" to "buildN" where N is the
2617 expected number of arguments. This is used for both efficiency (no
2618 varargs), and checking (verifying number of passed arguments). */
2619 #define build(code, ...) \
2620 _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__)
2621 #define _buildN1(BASE, X) _buildN2(BASE, X)
2622 #define _buildN2(BASE, X) BASE##X
2623 #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0)
2624 #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c
2627 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
2628 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
2629 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2630 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
2631 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
2632 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
2633 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
2634 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
2635 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
2636 tree MEM_STAT_DECL);
2637 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
2639 extern tree build_int_2_wide (unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2640 extern tree build_vector (tree, tree);
2641 extern tree build_constructor (tree, tree);
2642 extern tree build_real_from_int_cst (tree, tree);
2643 extern tree build_complex (tree, tree, tree);
2644 extern tree build_string (int, const char *);
2645 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
2646 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
2647 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2648 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
2649 extern tree build_block (tree, tree, tree, tree, tree);
2650 extern void annotate_with_file_line (tree, const char *, int);
2651 extern void annotate_with_locus (tree, location_t);
2652 extern tree build_empty_stmt (void);
2654 /* Construct various nodes representing data types. */
2656 extern tree make_signed_type (int);
2657 extern tree make_unsigned_type (int);
2658 extern void initialize_sizetypes (void);
2659 extern void set_sizetype (tree);
2660 extern void fixup_unsigned_type (tree);
2661 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
2662 extern tree build_pointer_type (tree);
2663 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
2664 extern tree build_reference_type (tree);
2665 extern tree build_vector_type_for_mode (tree, enum machine_mode);
2666 extern tree build_vector_type (tree innertype, int nunits);
2667 extern tree build_type_no_quals (tree);
2668 extern tree build_index_type (tree);
2669 extern tree build_index_2_type (tree, tree);
2670 extern tree build_array_type (tree, tree);
2671 extern tree build_function_type (tree, tree);
2672 extern tree build_function_type_list (tree, ...);
2673 extern tree build_method_type_directly (tree, tree, tree);
2674 extern tree build_method_type (tree, tree);
2675 extern tree build_offset_type (tree, tree);
2676 extern tree build_complex_type (tree);
2677 extern tree array_type_nelts (tree);
2679 extern tree value_member (tree, tree);
2680 extern tree purpose_member (tree, tree);
2681 extern tree binfo_member (tree, tree);
2683 extern int attribute_list_equal (tree, tree);
2684 extern int attribute_list_contained (tree, tree);
2685 extern int tree_int_cst_equal (tree, tree);
2686 extern int tree_int_cst_lt (tree, tree);
2687 extern int tree_int_cst_compare (tree, tree);
2688 extern int host_integerp (tree, int);
2689 extern HOST_WIDE_INT tree_low_cst (tree, int);
2690 extern int tree_int_cst_msb (tree);
2691 extern int tree_int_cst_sgn (tree);
2692 extern int tree_expr_nonnegative_p (tree);
2693 extern int rtl_expr_nonnegative_p (rtx);
2694 extern tree get_inner_array_type (tree);
2696 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2697 put the prototype here. Rtl.h does declare the prototype if
2698 tree.h had been included. */
2700 extern tree make_tree (tree, rtx);
2702 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2705 Such modified types already made are recorded so that duplicates
2708 extern tree build_type_attribute_variant (tree, tree);
2709 extern tree build_decl_attribute_variant (tree, tree);
2711 /* Structure describing an attribute and a function to handle it. */
2712 struct attribute_spec
2714 /* The name of the attribute (without any leading or trailing __),
2715 or NULL to mark the end of a table of attributes. */
2716 const char *const name;
2717 /* The minimum length of the list of arguments of the attribute. */
2718 const int min_length;
2719 /* The maximum length of the list of arguments of the attribute
2720 (-1 for no maximum). */
2721 const int max_length;
2722 /* Whether this attribute requires a DECL. If it does, it will be passed
2723 from types of DECLs, function return types and array element types to
2724 the DECLs, function types and array types respectively; but when
2725 applied to a type in any other circumstances, it will be ignored with
2726 a warning. (If greater control is desired for a given attribute,
2727 this should be false, and the flags argument to the handler may be
2728 used to gain greater control in that case.) */
2729 const bool decl_required;
2730 /* Whether this attribute requires a type. If it does, it will be passed
2731 from a DECL to the type of that DECL. */
2732 const bool type_required;
2733 /* Whether this attribute requires a function (or method) type. If it does,
2734 it will be passed from a function pointer type to the target type,
2735 and from a function return type (which is not itself a function
2736 pointer type) to the function type. */
2737 const bool function_type_required;
2738 /* Function to handle this attribute. NODE points to the node to which
2739 the attribute is to be applied. If a DECL, it should be modified in
2740 place; if a TYPE, a copy should be created. NAME is the name of the
2741 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2742 of the arguments (which may be NULL). FLAGS gives further information
2743 about the context of the attribute. Afterwards, the attributes will
2744 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2745 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2746 as well as in any other cases when the attributes should not be added
2747 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2748 applied to another type or DECL later may be returned;
2749 otherwise the return value should be NULL_TREE. This pointer may be
2750 NULL if no special handling is required beyond the checks implied
2751 by the rest of this structure. */
2752 tree (*const handler) (tree *node, tree name, tree args,
2753 int flags, bool *no_add_attrs);
2756 /* Flags that may be passed in the third argument of decl_attributes, and
2757 to handler functions for attributes. */
2758 enum attribute_flags
2760 /* The type passed in is the type of a DECL, and any attributes that
2761 should be passed in again to be applied to the DECL rather than the
2762 type should be returned. */
2763 ATTR_FLAG_DECL_NEXT = 1,
2764 /* The type passed in is a function return type, and any attributes that
2765 should be passed in again to be applied to the function type rather
2766 than the return type should be returned. */
2767 ATTR_FLAG_FUNCTION_NEXT = 2,
2768 /* The type passed in is an array element type, and any attributes that
2769 should be passed in again to be applied to the array type rather
2770 than the element type should be returned. */
2771 ATTR_FLAG_ARRAY_NEXT = 4,
2772 /* The type passed in is a structure, union or enumeration type being
2773 created, and should be modified in place. */
2774 ATTR_FLAG_TYPE_IN_PLACE = 8,
2775 /* The attributes are being applied by default to a library function whose
2776 name indicates known behavior, and should be silently ignored if they
2777 are not in fact compatible with the function type. */
2778 ATTR_FLAG_BUILT_IN = 16
2781 /* Default versions of target-overridable functions. */
2783 extern tree merge_decl_attributes (tree, tree);
2784 extern tree merge_type_attributes (tree, tree);
2785 extern void default_register_cpp_builtins (struct cpp_reader *);
2787 /* Split a list of declspecs and attributes into two. */
2789 extern void split_specs_attrs (tree, tree *, tree *);
2791 /* Strip attributes from a list of combined specs and attrs. */
2793 extern tree strip_attrs (tree);
2795 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2797 extern int valid_machine_attribute (tree, tree, tree, tree);
2799 /* Given a tree node and a string, return nonzero if the tree node is
2800 a valid attribute name for the string. */
2802 extern int is_attribute_p (const char *, tree);
2804 /* Given an attribute name and a list of attributes, return the list element
2805 of the attribute or NULL_TREE if not found. */
2807 extern tree lookup_attribute (const char *, tree);
2809 /* Given two attributes lists, return a list of their union. */
2811 extern tree merge_attributes (tree, tree);
2813 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2814 /* Given two Windows decl attributes lists, possibly including
2815 dllimport, return a list of their union . */
2816 extern tree merge_dllimport_decl_attributes (tree, tree);
2819 /* Check whether CAND is suitable to be returned from get_qualified_type
2820 (BASE, TYPE_QUALS). */
2822 extern bool check_qualified_type (tree, tree, int);
2824 /* Return a version of the TYPE, qualified as indicated by the
2825 TYPE_QUALS, if one exists. If no qualified version exists yet,
2826 return NULL_TREE. */
2828 extern tree get_qualified_type (tree, int);
2830 /* Like get_qualified_type, but creates the type if it does not
2831 exist. This function never returns NULL_TREE. */
2833 extern tree build_qualified_type (tree, int);
2835 /* Like build_qualified_type, but only deals with the `const' and
2836 `volatile' qualifiers. This interface is retained for backwards
2837 compatibility with the various front-ends; new code should use
2838 build_qualified_type instead. */
2840 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2841 build_qualified_type ((TYPE), \
2842 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2843 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2845 /* Make a copy of a type node. */
2847 extern tree build_type_copy (tree);
2849 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2850 fields. Optionally specify an alignment, and then lsy it out. */
2852 extern void finish_builtin_struct (tree, const char *,
2855 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2856 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2857 node, does nothing except for the first time. */
2859 extern void layout_type (tree);
2861 /* These functions allow a front-end to perform a manual layout of a
2862 RECORD_TYPE. (For instance, if the placement of subsequent fields
2863 depends on the placement of fields so far.) Begin by calling
2864 start_record_layout. Then, call place_field for each of the
2865 fields. Then, call finish_record_layout. See layout_type for the
2866 default way in which these functions are used. */
2868 typedef struct record_layout_info_s
2870 /* The RECORD_TYPE that we are laying out. */
2872 /* The offset into the record so far, in bytes, not including bits in
2875 /* The last known alignment of SIZE. */
2876 unsigned int offset_align;
2877 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2879 /* The alignment of the record so far, in bits. */
2880 unsigned int record_align;
2881 /* The alignment of the record so far, ignoring #pragma pack and
2882 __attribute__ ((packed)), in bits. */
2883 unsigned int unpacked_align;
2884 /* The previous field layed out. */
2886 /* The static variables (i.e., class variables, as opposed to
2887 instance variables) encountered in T. */
2888 tree pending_statics;
2889 /* Bits remaining in the current alignment group */
2890 int remaining_in_alignment;
2891 /* True if we've seen a packed field that didn't have normal
2892 alignment anyway. */
2893 int packed_maybe_necessary;
2894 } *record_layout_info;
2896 extern void set_lang_adjust_rli (void (*) (record_layout_info));
2897 extern record_layout_info start_record_layout (tree);
2898 extern tree bit_from_pos (tree, tree);
2899 extern tree byte_from_pos (tree, tree);
2900 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
2901 extern void normalize_offset (tree *, tree *, unsigned int);
2902 extern tree rli_size_unit_so_far (record_layout_info);
2903 extern tree rli_size_so_far (record_layout_info);
2904 extern void normalize_rli (record_layout_info);
2905 extern void place_field (record_layout_info, tree);
2906 extern void compute_record_mode (tree);
2907 extern void finish_record_layout (record_layout_info, int);
2909 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2910 return a canonicalized ..._TYPE node, so that duplicates are not made.
2911 How the hash code is computed is up to the caller, as long as any two
2912 callers that could hash identical-looking type nodes agree. */
2914 extern tree type_hash_canon (unsigned int, tree);
2916 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2917 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2918 fields. Call this only once for any given decl node.
2920 Second argument is the boundary that this field can be assumed to
2921 be starting at (in bits). Zero means it can be assumed aligned
2922 on any boundary that may be needed. */
2924 extern void layout_decl (tree, unsigned);
2926 /* Return the mode for data of a given size SIZE and mode class CLASS.
2927 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2928 The value is BLKmode if no other mode is found. This is like
2929 mode_for_size, but is passed a tree. */
2931 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
2933 /* Return an expr equal to X but certainly not valid as an lvalue. */
2935 extern tree non_lvalue (tree);
2936 extern tree pedantic_non_lvalue (tree);
2938 extern tree convert (tree, tree);
2939 extern unsigned int expr_align (tree);
2940 extern tree expr_first (tree);
2941 extern tree expr_last (tree);
2942 extern tree expr_only (tree);
2943 extern tree size_in_bytes (tree);
2944 extern HOST_WIDE_INT int_size_in_bytes (tree);
2945 extern tree bit_position (tree);
2946 extern HOST_WIDE_INT int_bit_position (tree);
2947 extern tree byte_position (tree);
2948 extern HOST_WIDE_INT int_byte_position (tree);
2950 /* Define data structures, macros, and functions for handling sizes
2951 and the various types used to represent sizes. */
2955 SIZETYPE, /* Normal representation of sizes in bytes. */
2956 SSIZETYPE, /* Signed representation of sizes in bytes. */
2957 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2958 BITSIZETYPE, /* Normal representation of sizes in bits. */
2959 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2960 UBITSIZETYPE, /* Unsigned representation of sizes in bits. */
2963 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
2965 #define sizetype sizetype_tab[(int) SIZETYPE]
2966 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2967 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2968 #define usizetype sizetype_tab[(int) USIZETYPE]
2969 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2970 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2972 extern tree size_binop (enum tree_code, tree, tree);
2973 extern tree size_diffop (tree, tree);
2974 extern tree size_int_wide (HOST_WIDE_INT, enum size_type_kind);
2975 extern tree size_int_type_wide (HOST_WIDE_INT, tree);
2977 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2978 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2979 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2980 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2981 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2983 extern tree round_up (tree, int);
2984 extern tree round_down (tree, int);
2985 extern tree get_pending_sizes (void);
2986 extern void put_pending_size (tree);
2987 extern void put_pending_sizes (tree);
2989 /* Type for sizes of data-type. */
2991 #define BITS_PER_UNIT_LOG \
2992 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2993 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2994 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2996 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2997 extern unsigned int maximum_field_alignment;
2999 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
3000 extern unsigned int set_alignment;
3002 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3003 by making the last node in X point to Y.
3004 Returns X, except if X is 0 returns Y. */
3006 extern tree chainon (tree, tree);
3008 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3010 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3011 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3013 /* Return the last tree node in a chain. */
3015 extern tree tree_last (tree);
3017 /* Reverse the order of elements in a chain, and return the new head. */
3019 extern tree nreverse (tree);
3021 /* Returns the length of a chain of nodes
3022 (number of chain pointers to follow before reaching a null pointer). */
3024 extern int list_length (tree);
3026 /* Returns the number of FIELD_DECLs in a type. */
3028 extern int fields_length (tree);
3030 /* Given an initializer INIT, return TRUE if INIT is zero or some
3031 aggregate of zeros. Otherwise return FALSE. */
3033 extern bool initializer_zerop (tree);
3035 extern void categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *);
3036 extern HOST_WIDE_INT count_type_elements (tree);
3037 extern int mostly_zeros_p (tree);
3039 /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */
3041 extern void add_var_to_bind_expr (tree, tree);
3043 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
3045 extern int integer_zerop (tree);
3047 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
3049 extern int integer_onep (tree);
3051 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3052 all of whose significant bits are 1. */
3054 extern int integer_all_onesp (tree);
3056 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3057 exactly one bit 1. */
3059 extern int integer_pow2p (tree);
3061 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3062 with a nonzero value. */
3064 extern int integer_nonzerop (tree);
3066 /* staticp (tree x) is nonzero if X is a reference to data allocated
3067 at a fixed address in memory. */
3069 extern int staticp (tree);
3071 /* save_expr (EXP) returns an expression equivalent to EXP
3072 but it can be used multiple times within context CTX
3073 and only evaluate EXP once. */
3075 extern tree save_expr (tree);
3077 /* Look inside EXPR and into any simple arithmetic operations. Return
3078 the innermost non-arithmetic node. */
3080 extern tree skip_simple_arithmetic (tree);
3082 /* Returns the index of the first non-tree operand for CODE, or the number
3083 of operands if all are trees. */
3085 extern int first_rtl_op (enum tree_code);
3087 /* Return which tree structure is used by T. */
3089 enum tree_node_structure_enum tree_node_structure (tree);
3091 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
3092 can be used multiple times and will evaluate EXP in its entirety
3095 extern tree unsave_expr (tree);
3097 /* Reset EXP in place so that it can be expanded again. Does not
3098 recurse into subtrees. */
3100 extern void unsave_expr_1 (tree);
3102 /* Return 0 if it is safe to evaluate EXPR multiple times,
3103 return 1 if it is safe if EXPR is unsaved afterward, or
3104 return 2 if it is completely unsafe. */
3105 extern int unsafe_for_reeval (tree);
3107 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
3108 or offset that depends on a field within a record.
3110 Note that we only allow such expressions within simple arithmetic
3113 extern bool contains_placeholder_p (tree);
3115 /* This macro calls the above function but short-circuits the common
3116 case of a constant to save time. Also check for null. */
3118 #define CONTAINS_PLACEHOLDER_P(EXP) \
3119 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
3121 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
3122 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
3125 extern bool type_contains_placeholder_p (tree);
3127 /* Return 1 if EXP contains any expressions that produce cleanups for an
3128 outer scope to deal with. Used by fold. */
3130 extern int has_cleanups (tree);
3132 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3133 return a tree with all occurrences of references to F in a
3134 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
3135 contains only arithmetic expressions. */
3137 extern tree substitute_in_expr (tree, tree, tree);
3139 /* This macro calls the above function but short-circuits the common
3140 case of a constant to save time and also checks for NULL. */
3142 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
3143 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
3145 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3146 for it within OBJ, a tree that is an object or a chain of references. */
3148 extern tree substitute_placeholder_in_expr (tree, tree);
3150 /* This macro calls the above function but short-circuits the common
3151 case of a constant to save time and also checks for NULL. */
3153 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
3154 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
3155 : substitute_placeholder_in_expr (EXP, OBJ))
3157 /* variable_size (EXP) is like save_expr (EXP) except that it
3158 is for the special case of something that is part of a
3159 variable size for a data type. It makes special arrangements
3160 to compute the value at the right time when the data type
3161 belongs to a function parameter. */
3163 extern tree variable_size (tree);
3165 /* Given a type T, force elaboration of any SAVE_EXPRs used in the definition
3168 extern void force_type_save_exprs (tree);
3170 /* stabilize_reference (EXP) returns a reference equivalent to EXP
3171 but it can be used multiple times
3172 and only evaluate the subexpressions once. */
3174 extern tree stabilize_reference (tree);
3176 /* Subroutine of stabilize_reference; this is called for subtrees of
3177 references. Any expression with side-effects must be put in a SAVE_EXPR
3178 to ensure that it is only evaluated once. */
3180 extern tree stabilize_reference_1 (tree);
3182 /* Return EXP, stripped of any conversions to wider types
3183 in such a way that the result of converting to type FOR_TYPE
3184 is the same as if EXP were converted to FOR_TYPE.
3185 If FOR_TYPE is 0, it signifies EXP's type. */
3187 extern tree get_unwidened (tree, tree);
3189 /* Return OP or a simpler expression for a narrower value
3190 which can be sign-extended or zero-extended to give back OP.
3191 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3192 or 0 if the value should be sign-extended. */
3194 extern tree get_narrower (tree, int *);
3196 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
3197 look for nested component-refs or array-refs at constant positions
3198 and find the ultimate containing object, which is returned. */
3200 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3201 tree *, enum machine_mode *, int *, int *);
3203 /* Return 1 if T is an expression that get_inner_reference handles. */
3205 extern int handled_component_p (tree);
3207 /* Return a tree of sizetype representing the size, in bytes, of the element
3208 of EXP, an ARRAY_REF. */
3210 extern tree array_ref_element_size (tree);
3212 /* Return a tree representing the lower bound of the array mentioned in
3213 EXP, an ARRAY_REF. */
3215 extern tree array_ref_low_bound (tree);
3217 /* Return a tree representing the offset, in bytes, of the field referenced
3218 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
3220 extern tree component_ref_field_offset (tree);
3222 /* Given a DECL or TYPE, return the scope in which it was declared, or
3223 NUL_TREE if there is no containing scope. */
3225 extern tree get_containing_scope (tree);
3227 /* Return the FUNCTION_DECL which provides this _DECL with its context,
3229 extern tree decl_function_context (tree);
3231 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
3232 this _DECL with its context, or zero if none. */
3233 extern tree decl_type_context (tree);
3235 /* Return 1 if EXPR is the real constant zero. */
3236 extern int real_zerop (tree);
3238 /* Declare commonly used variables for tree structure. */
3240 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
3241 Zero means allow extended lvalues. */
3243 extern int pedantic_lvalues;
3245 /* Nonzero means can safely call expand_expr now;
3246 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
3248 extern int immediate_size_expand;
3250 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
3252 extern GTY(()) tree current_function_decl;
3254 /* Nonzero means a FUNC_BEGIN label was emitted. */
3255 extern GTY(()) tree current_function_func_begin_label;
3257 /* A DECL for the current file-scope context. When using IMA, this heads a
3258 chain of FILE_DECLs; currently only C uses it. */
3260 extern GTY(()) tree current_file_decl;
3262 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
3264 extern int all_types_permanent;
3266 /* Exit a binding level. This function is provided by each language
3268 extern tree poplevel (int, int, int);
3270 /* Declare a predefined function. Return the declaration. This function is
3271 provided by each language frontend. */
3272 extern tree builtin_function (const char *, tree, int, enum built_in_class,
3273 const char *, tree);
3276 extern unsigned crc32_string (unsigned, const char *);
3277 extern void clean_symbol_name (char *);
3278 extern tree get_file_function_name_long (const char *);
3279 extern tree get_set_constructor_bits (tree, char *, int);
3280 extern tree get_set_constructor_bytes (tree, unsigned char *, int);
3281 extern tree get_callee_fndecl (tree);
3282 extern void change_decl_assembler_name (tree, tree);
3283 extern int type_num_arguments (tree);
3284 extern tree lhd_unsave_expr_now (tree);
3285 extern bool associative_tree_code (enum tree_code);
3286 extern bool commutative_tree_code (enum tree_code);
3291 extern void expand_fixups (rtx);
3292 extern tree expand_start_stmt_expr (int);
3293 extern tree expand_end_stmt_expr (tree);
3294 extern void expand_expr_stmt (tree);
3295 extern void expand_expr_stmt_value (tree, int, int);
3296 extern int warn_if_unused_value (tree, location_t);
3297 extern void expand_decl_init (tree);
3298 extern void clear_last_expr (void);
3299 extern void expand_label (tree);
3300 extern void expand_goto (tree);
3301 extern void expand_asm (tree, int);
3302 extern void expand_start_cond (tree, int);
3303 extern void expand_end_cond (void);
3304 extern void expand_start_else (void);
3305 extern void expand_start_elseif (tree);
3307 extern void expand_stack_alloc (tree, tree);
3308 extern rtx expand_stack_save (void);
3309 extern void expand_stack_restore (tree);
3310 extern void expand_return (tree);
3311 extern void expand_start_bindings_and_block (int, tree);
3312 #define expand_start_bindings(flags) \
3313 expand_start_bindings_and_block(flags, NULL_TREE)
3314 extern void expand_end_bindings (tree, int, int);
3315 extern void warn_about_unused_variables (tree);
3316 extern void start_cleanup_deferral (void);
3317 extern void end_cleanup_deferral (void);
3318 extern int is_body_block (tree);
3320 extern int conditional_context (void);
3321 extern struct nesting * current_nesting_level (void);
3322 extern tree last_cleanup_this_contour (void);
3323 extern void expand_start_case (int, tree, tree, const char *);
3324 extern void expand_end_case_type (tree, tree);
3325 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
3326 extern int add_case_node (tree, tree, tree, tree *, bool);
3327 extern int pushcase (tree, tree (*) (tree, tree), tree, tree *);
3328 extern int pushcase_range (tree, tree, tree (*) (tree, tree), tree, tree *);
3329 extern void using_eh_for_cleanups (void);
3331 /* In fold-const.c */
3333 /* Fold constants as much as possible in an expression.
3334 Returns the simplified expression.
3335 Acts only on the top level of the expression;
3336 if the argument itself cannot be simplified, its
3337 subexpressions are not changed. */
3339 extern tree fold (tree);
3340 extern tree fold_initializer (tree);
3341 extern tree fold_convert (tree, tree);
3342 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
3343 extern tree fold_abs_const (tree, tree);
3345 extern int force_fit_type (tree, int);
3346 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3347 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3348 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3349 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3350 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3351 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3352 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3353 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3354 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3355 HOST_WIDE_INT, unsigned int,
3356 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3357 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3358 HOST_WIDE_INT, unsigned int,
3359 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3360 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3361 HOST_WIDE_INT, unsigned int,
3362 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3363 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3364 HOST_WIDE_INT, unsigned int,
3365 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3367 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
3368 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
3369 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
3370 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
3373 enum operand_equal_flag
3379 extern int operand_equal_p (tree, tree, unsigned int);
3381 extern tree omit_one_operand (tree, tree, tree);
3382 extern tree omit_two_operands (tree, tree, tree, tree);
3383 extern tree invert_truthvalue (tree);
3384 extern tree nondestructive_fold_unary_to_constant (enum tree_code, tree, tree);
3385 extern tree nondestructive_fold_binary_to_constant (enum tree_code, tree, tree, tree);
3386 extern tree fold_read_from_constant_string (tree);
3387 extern tree int_const_binop (enum tree_code, tree, tree, int);
3388 extern tree build_fold_addr_expr (tree);
3389 extern tree build_fold_addr_expr_with_type (tree, tree);
3390 extern tree build_fold_indirect_ref (tree);
3392 extern bool tree_swap_operands_p (tree, tree, bool);
3393 extern enum tree_code swap_tree_comparison (enum tree_code);
3396 extern tree fold_builtin (tree);
3397 extern enum built_in_function builtin_mathfn_code (tree);
3398 extern tree build_function_call_expr (tree, tree);
3399 extern tree mathfn_built_in (tree, enum built_in_function fn);
3400 extern tree strip_float_extensions (tree);
3401 extern tree simplify_builtin (tree, int);
3402 extern tree c_strlen (tree, int);
3403 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
3406 extern tree strip_float_extensions (tree);
3409 extern void record_component_aliases (tree);
3410 extern HOST_WIDE_INT get_alias_set (tree);
3411 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3412 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3413 extern int readonly_fields_p (tree);
3414 extern int objects_must_conflict_p (tree, tree);
3417 extern int really_constant_p (tree);
3418 extern int int_fits_type_p (tree, tree);
3419 extern bool variably_modified_type_p (tree);
3420 extern int tree_log2 (tree);
3421 extern int tree_floor_log2 (tree);
3422 extern int simple_cst_equal (tree, tree);
3423 extern unsigned int iterative_hash_expr (tree, unsigned int);
3424 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
3425 extern int type_list_equal (tree, tree);
3426 extern int chain_member (tree, tree);
3427 extern tree type_hash_lookup (unsigned int, tree);
3428 extern void type_hash_add (unsigned int, tree);
3429 extern int simple_cst_list_equal (tree, tree);
3430 extern void dump_tree_statistics (void);
3431 extern void expand_function_end (void);
3432 extern void expand_function_start (tree, int);
3433 extern void expand_pending_sizes (tree);
3434 extern void recompute_tree_invarant_for_addr_expr (tree);
3435 extern bool needs_to_live_in_memory (tree);
3436 extern tree make_vector (enum machine_mode, tree, int);
3437 extern tree reconstruct_complex_type (tree, tree);
3439 extern int real_onep (tree);
3440 extern int real_twop (tree);
3441 extern int real_minus_onep (tree);
3442 extern void init_ttree (void);
3443 extern void build_common_tree_nodes (int);
3444 extern void build_common_tree_nodes_2 (int);
3445 extern tree build_range_type (tree, tree, tree);
3448 extern void setjmp_protect_args (void);
3449 extern void setjmp_protect (tree);
3450 extern void expand_main_function (void);
3451 extern void init_dummy_function_start (void);
3452 extern void expand_dummy_function_end (void);
3453 extern void init_function_for_compilation (void);
3454 extern void allocate_struct_function (tree);
3455 extern void init_function_start (tree);
3456 extern void assign_parms (tree);
3457 extern void put_var_into_stack (tree, int);
3458 extern void flush_addressof (tree);
3459 extern void setjmp_vars_warning (tree);
3460 extern void setjmp_args_warning (void);
3461 extern void init_temp_slots (void);
3462 extern void combine_temp_slots (void);
3463 extern void free_temp_slots (void);
3464 extern void pop_temp_slots (void);
3465 extern void push_temp_slots (void);
3466 extern void preserve_temp_slots (rtx);
3467 extern void preserve_rtl_expr_temps (tree);
3468 extern int aggregate_value_p (tree, tree);
3469 extern void free_temps_for_rtl_expr (tree);
3470 extern void push_function_context (void);
3471 extern void pop_function_context (void);
3472 extern void push_function_context_to (tree);
3473 extern void pop_function_context_from (tree);
3475 /* In print-rtl.c */
3477 extern void print_rtl (FILE *, rtx);
3480 /* In print-tree.c */
3481 extern void debug_tree (tree);
3483 extern void print_node (FILE *, const char *, tree, int);
3484 extern void print_node_brief (FILE *, const char *, tree, int);
3485 extern void indent_to (FILE *, int);
3488 /* In tree-inline.c: */
3489 extern bool debug_find_tree (tree, tree);
3492 extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx);
3493 extern void check_max_integer_computation_mode (tree);
3496 extern void start_sequence_for_rtl_expr (tree);
3497 extern rtx emit_line_note (location_t);
3501 /* Nonzero if this is a call to a `const' function. */
3503 /* Nonzero if this is a call to a `volatile' function. */
3504 #define ECF_NORETURN 2
3505 /* Nonzero if this is a call to malloc or a related function. */
3506 #define ECF_MALLOC 4
3507 /* Nonzero if it is plausible that this is a call to alloca. */
3508 #define ECF_MAY_BE_ALLOCA 8
3509 /* Nonzero if this is a call to a function that won't throw an exception. */
3510 #define ECF_NOTHROW 16
3511 /* Nonzero if this is a call to setjmp or a related function. */
3512 #define ECF_RETURNS_TWICE 32
3513 /* Nonzero if this is a call to `longjmp'. */
3514 #define ECF_LONGJMP 64
3515 /* Nonzero if this is a syscall that makes a new process in the image of
3517 #define ECF_SIBCALL 128
3518 /* Nonzero if this is a call to "pure" function (like const function,
3519 but may read memory. */
3520 #define ECF_PURE 256
3521 /* Nonzero if this is a call to a function that returns with the stack
3522 pointer depressed. */
3523 #define ECF_SP_DEPRESSED 512
3524 /* Nonzero if this call is known to always return. */
3525 #define ECF_ALWAYS_RETURN 1024
3526 /* Create libcall block around the call. */
3527 #define ECF_LIBCALL_BLOCK 2048
3529 extern int flags_from_decl_or_type (tree);
3530 extern int call_expr_flags (tree);
3532 extern int setjmp_call_p (tree);
3533 extern bool alloca_call_p (tree);
3537 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3538 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3539 it should be modified in place; if a TYPE, a copy should be created
3540 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3541 information, in the form of a bitwise OR of flags in enum attribute_flags
3542 from tree.h. Depending on these flags, some attributes may be
3543 returned to be applied at a later stage (for example, to apply
3544 a decl attribute to the declaration rather than to its type). */
3545 extern tree decl_attributes (tree *, tree, int);
3547 /* In integrate.c */
3548 extern void set_decl_abstract_flags (tree, int);
3549 extern void set_decl_origin_self (tree);
3551 /* In stor-layout.c */
3552 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
3553 extern void fixup_signed_type (tree);
3554 extern void internal_reference_types (void);
3555 extern unsigned int update_alignment_for_field (record_layout_info, tree,
3558 extern void make_decl_rtl (tree, const char *);
3559 extern void make_decl_one_only (tree);
3560 extern int supports_one_only (void);
3561 extern void variable_section (tree, int);
3562 enum tls_model decl_tls_model (tree);
3563 extern void resolve_unique_section (tree, int, int);
3564 extern void mark_referenced (tree);
3565 extern void mark_decl_referenced (tree);
3566 extern void notice_global_symbol (tree);
3569 extern void emit_nop (void);
3570 extern void expand_computed_goto (tree);
3571 extern bool parse_output_constraint (const char **, int, int, int,
3572 bool *, bool *, bool *);
3573 extern bool parse_input_constraint (const char **, int, int, int, int,
3574 const char * const *, bool *, bool *);
3575 extern void expand_asm_operands (tree, tree, tree, tree, int, location_t);
3576 extern void expand_asm_expr (tree);
3577 extern bool asm_op_is_mem_input (tree, tree);
3578 extern tree resolve_asm_operand_names (tree, tree, tree);
3579 extern int any_pending_cleanups (void);
3580 extern void init_stmt_for_function (void);
3581 extern void expand_start_target_temps (void);
3582 extern void expand_end_target_temps (void);
3583 extern void expand_elseif (tree);
3584 extern void save_stack_pointer (void);
3585 extern void expand_decl (tree);
3586 extern int expand_decl_cleanup (tree, tree);
3587 extern int expand_decl_cleanup_eh (tree, tree, int);
3588 extern void expand_anon_union_decl (tree, tree, tree);
3589 extern int containing_blocks_have_cleanups_or_stack_level (void);
3591 /* In gimplify.c. */
3592 extern tree create_artificial_label (void);
3593 extern void gimplify_function_tree (tree);
3594 extern const char *get_name (tree);
3595 extern tree unshare_expr (tree);
3596 extern void sort_case_labels (tree);
3598 /* If KIND=='I', return a suitable global initializer (constructor) name.
3599 If KIND=='D', return a suitable global clean-up (destructor) name. */
3600 extern tree get_file_function_name (int);
3602 /* Interface of the DWARF2 unwind info support. */
3604 /* Generate a new label for the CFI info to refer to. */
3606 extern char *dwarf2out_cfi_label (void);
3608 /* Entry point to update the canonical frame address (CFA). */
3610 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
3612 /* Add the CFI for saving a register window. */
3614 extern void dwarf2out_window_save (const char *);
3616 /* Add a CFI to update the running total of the size of arguments pushed
3619 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
3621 /* Entry point for saving a register to the stack. */
3623 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
3625 /* Entry point for saving the return address in the stack. */
3627 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
3629 /* Entry point for saving the return address in a register. */
3631 extern void dwarf2out_return_reg (const char *, unsigned);
3633 /* The type of a callback function for walking over tree structure. */
3635 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3636 tree walk_tree (tree*, walk_tree_fn, void*, void*);
3637 tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
3639 /* In tree-dump.c */
3641 /* Different tree dump places. When you add new tree dump places,
3642 extend the DUMP_FILES array in tree-dump.c. */
3643 enum tree_dump_index
3645 TDI_none, /* No dump */
3646 TDI_tu, /* dump the whole translation unit. */
3647 TDI_class, /* dump class hierarchy. */
3648 TDI_original, /* dump each function before optimizing it */
3649 TDI_generic, /* dump each function after genericizing it */
3650 TDI_nested, /* dump each function after unnesting it */
3651 TDI_inlined, /* dump each function after inlining
3653 TDI_vcg, /* create a VCG graph file for each
3654 function's flowgraph. */
3655 TDI_xml, /* dump function call graph. */
3656 TDI_all, /* enable all the dumps. */
3660 /* Bit masks to control tree dumping. Not all values are applicable to
3661 all tree dumps. Add new ones at the end. When you define new
3662 values, extend the DUMP_OPTIONS array in tree-dump.c */
3663 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3664 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3665 #define TDF_RAW (1 << 2) /* don't unparse the function */
3666 #define TDF_DETAILS (1 << 3) /* show more detailed info about
3668 #define TDF_STATS (1 << 4) /* dump various statistics about
3670 #define TDF_BLOCKS (1 << 5) /* display basic block boundaries */
3671 #define TDF_VOPS (1 << 6) /* display virtual operands */
3672 #define TDF_LINENO (1 << 7) /* display statement line numbers */
3673 #define TDF_UID (1 << 8) /* display decl UIDs */
3676 typedef struct dump_info *dump_info_p;
3678 extern int dump_flag (dump_info_p, int, tree);
3679 extern int dump_enabled_p (enum tree_dump_index);
3680 extern FILE *dump_begin (enum tree_dump_index, int *);
3681 extern void dump_end (enum tree_dump_index, FILE *);
3682 extern void dump_node (tree, int, FILE *);
3683 extern int dump_switch_p (const char *);
3684 extern const char *dump_flag_name (enum tree_dump_index);
3685 /* Assign the RTX to declaration. */
3687 extern void set_decl_rtl (tree, rtx);
3688 extern void set_decl_incoming_rtl (tree, rtx);
3690 /* Redefine abort to report an internal error w/o coredump, and
3691 reporting the location of the error in the source file. This logic
3692 is duplicated in rtl.h and tree.h because every file that needs the
3693 special abort includes one or both. toplev.h gets too few files,
3694 system.h gets too many. */
3696 extern void fancy_abort (const char *, int, const char *)
3698 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3700 /* Enum and arrays used for tree allocation stats.
3701 Keep in sync with tree.c:tree_node_kind_names. */
3723 extern int tree_node_counts[];
3724 extern int tree_node_sizes[];
3726 /* True if we are in gimple form and the actions of the folders need to
3727 be restricted. False if we are not in gimple form and folding is not
3728 restricted to creating gimple expressions. */
3729 extern bool in_gimple_form;
3731 #endif /* GCC_TREE_H */