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
28 #include "statistics.h"
30 /* Codes of tree nodes */
32 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
37 LAST_AND_UNUSED_TREE_CODE
/* A convenient way to get a value for
43 /* Number of language-independent tree codes. */
44 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
46 /* Indexed by enum tree_code, contains a character which is
47 `<' for a comparison expression, `1', for a unary arithmetic
48 expression, `2' for a binary arithmetic expression, `e' for
49 other types of expressions, `r' for a reference, `c' for a
50 constant, `d' for a decl, `t' for a type, `s' for a statement,
51 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
53 #define MAX_TREE_CODES 256
54 extern const char tree_code_type
[];
55 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
57 /* Returns nonzero iff CLASS is not the tree code of a type. */
59 #define IS_NON_TYPE_CODE_CLASS(CLASS) (strchr ("xbcdr<12se", (CLASS)) != 0)
61 /* Returns nonzero iff CLASS is the tree-code class of an
64 #define IS_EXPR_CODE_CLASS(CLASS) (strchr ("<12ers", (CLASS)) != 0)
66 /* Returns nonzero iff NODE is an expression of some kind. */
68 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
70 /* Number of argument-words in each kind of tree-node. */
72 extern const unsigned char tree_code_length
[];
73 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
75 /* Names of tree components. */
77 extern const char *const tree_code_name
[];
79 /* Classify which part of the compiler has defined a given builtin function.
80 Note that we assume below that this is no more than two bits. */
89 /* Names for the above. */
90 extern const char *const built_in_class_names
[4];
92 /* Codes that identify the various built in functions
93 so that expand_call can identify them quickly. */
95 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
96 enum built_in_function
98 #include "builtins.def"
100 /* Upper bound on non-language-specific builtins. */
105 /* Names for the above. */
106 extern const char *const built_in_names
[(int) END_BUILTINS
];
108 /* Helper macros for math builtins. */
110 #define BUILTIN_EXP10_P(FN) \
111 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
112 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
114 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
115 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
116 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
118 #define BUILTIN_SQRT_P(FN) \
119 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
121 #define BUILTIN_CBRT_P(FN) \
122 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
124 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
126 /* An array of _DECL trees for the above. */
127 extern GTY(()) tree built_in_decls
[(int) END_BUILTINS
];
128 extern GTY(()) tree implicit_built_in_decls
[(int) END_BUILTINS
];
130 /* The definition of tree nodes fills the next several pages. */
132 /* A tree node can represent a data type, a variable, an expression
133 or a statement. Each node has a TREE_CODE which says what kind of
134 thing it represents. Some common codes are:
135 INTEGER_TYPE -- represents a type of integers.
136 ARRAY_TYPE -- represents a type of pointer.
137 VAR_DECL -- represents a declared variable.
138 INTEGER_CST -- represents a constant integer value.
139 PLUS_EXPR -- represents a sum (an expression).
141 As for the contents of a tree node: there are some fields
142 that all nodes share. Each TREE_CODE has various special-purpose
143 fields as well. The fields of a node are never accessed directly,
144 always through accessor macros. */
146 /* Every kind of tree node starts with this structure,
147 so all nodes have these fields.
149 See the accessor macros, defined below, for documentation of the
152 struct tree_common
GTY(())
157 ENUM_BITFIELD(tree_code
) code
: 8;
159 unsigned side_effects_flag
: 1;
160 unsigned constant_flag
: 1;
161 unsigned addressable_flag
: 1;
162 unsigned volatile_flag
: 1;
163 unsigned readonly_flag
: 1;
164 unsigned unsigned_flag
: 1;
165 unsigned asm_written_flag
: 1;
166 unsigned used_flag
: 1;
168 unsigned nothrow_flag
: 1;
169 unsigned static_flag
: 1;
170 unsigned public_flag
: 1;
171 unsigned private_flag
: 1;
172 unsigned protected_flag
: 1;
173 unsigned deprecated_flag
: 1;
175 unsigned unused_0
: 1;
176 unsigned unused_1
: 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 unused_2
: 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
203 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
204 TREE_NO_UNUSED_WARNING in
205 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR, NON_LVALUE_EXPR
206 ??? plus other expressions, apparently (e.g. MODIFY_EXPR).
208 TREE_LIST or TREE_VEC
209 TREE_CONSTANT_OVERFLOW in
210 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
211 TREE_SYMBOL_REFERENCED in
214 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
215 TREE_LIST elements of a block's cleanup list.
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
226 EXPR_WFL_EMIT_LINE_NOTE in
227 EXPR_WITH_FILE_LOCATION
233 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
253 TREE_THIS_VOLATILE in
278 BIT_FIELD_REF_UNSIGNED in
280 SAVE_EXPR_NOPLACEHOLDER in
286 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
292 expressions, IDENTIFIER_NODE
297 CALL_EXPR, FUNCTION_DECL
309 /* Define accessors for the fields that all tree nodes have
310 (though some fields are not used for all kinds of nodes). */
312 /* The tree-code says what kind of node it is.
313 Codes are defined in tree.def. */
314 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
315 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
317 /* When checking is enabled, errors will be generated if a tree node
318 is accessed incorrectly. The macros abort with a fatal error. */
319 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
321 #define TREE_CHECK(T, CODE) __extension__ \
322 ({ const tree __t = (T); \
323 if (TREE_CODE (__t) != (CODE)) \
324 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
327 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
328 ({ const tree __t = (T); \
329 if (TREE_CODE (__t) != (CODE1) \
330 && TREE_CODE (__t) != (CODE2)) \
331 tree_check2_failed (__t, (CODE1), (CODE2), __FILE__, __LINE__, \
335 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
336 ({ const tree __t = (T); \
337 if (TREE_CODE (__t) != (CODE1) \
338 && TREE_CODE (__t) != (CODE2) \
339 && TREE_CODE (__t) != (CODE3)) \
340 tree_check3_failed (__t, (CODE1), (CODE2), (CODE3), __FILE__, \
341 __LINE__, __FUNCTION__); \
344 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
345 ({ const tree __t = (T); \
346 if (TREE_CODE (__t) != (CODE1) \
347 && TREE_CODE (__t) != (CODE2) \
348 && TREE_CODE (__t) != (CODE3) \
349 && TREE_CODE (__t) != (CODE4)) \
350 tree_check4_failed (__t, (CODE1), (CODE2), (CODE3), (CODE4), \
351 __FILE__, __LINE__, __FUNCTION__); \
354 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
355 ({ const tree __t = (T); \
356 if (TREE_CODE (__t) != (CODE1) \
357 && TREE_CODE (__t) != (CODE2) \
358 && TREE_CODE (__t) != (CODE3) \
359 && TREE_CODE (__t) != (CODE4) \
360 && TREE_CODE (__t) != (CODE5)) \
361 tree_check5_failed (__t, (CODE1), (CODE2), (CODE3), (CODE4), \
362 (CODE5), __FILE__, __LINE__, __FUNCTION__); \
365 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
366 ({ const tree __t = (T); \
367 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
368 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
372 /* These checks have to be special cased. */
373 #define EXPR_CHECK(T) __extension__ \
374 ({ const tree __t = (T); \
375 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
376 if (!IS_EXPR_CODE_CLASS (__c)) \
377 tree_class_check_failed (__t, 'E', __FILE__, __LINE__, \
381 /* These checks have to be special cased. */
382 #define NON_TYPE_CHECK(T) __extension__ \
383 ({ const tree __t = (T); \
384 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
385 if (!IS_NON_TYPE_CODE_CLASS (__c)) \
386 tree_class_check_failed (__t, 'T', __FILE__, __LINE__, \
390 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
391 (*({const tree __t = (T); \
392 const int __i = (I); \
393 if (TREE_CODE (__t) != TREE_VEC) \
394 tree_check_failed (__t, TREE_VEC, \
395 __FILE__, __LINE__, __FUNCTION__); \
396 if (__i < 0 || __i >= __t->vec.length) \
397 tree_vec_elt_check_failed (__i, __t->vec.length, \
398 __FILE__, __LINE__, __FUNCTION__); \
399 &__t->vec.a[__i]; }))
401 /* Special checks for TREE_OPERANDs. */
402 #define TREE_OPERAND_CHECK(T, I) __extension__ \
403 (*({const tree __t = EXPR_CHECK (T); \
404 const int __i = (I); \
405 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
406 tree_operand_check_failed (__i, TREE_CODE (__t), \
407 __FILE__, __LINE__, __FUNCTION__); \
408 &__t->exp.operands[__i]; }))
410 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
411 (*({const tree __t = (T); \
412 const int __i = (I); \
413 if (TREE_CODE (__t) != CODE) \
414 tree_check_failed (__t, CODE, __FILE__, __LINE__, __FUNCTION__); \
415 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
416 tree_operand_check_failed (__i, (CODE), \
417 __FILE__, __LINE__, __FUNCTION__); \
418 &__t->exp.operands[__i]; }))
420 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
422 ({const tree __t = (T); \
423 const int __i = (I); \
424 if (TREE_CODE (__t) != (CODE)) \
425 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
426 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
427 tree_operand_check_failed (__i, (CODE), \
428 __FILE__, __LINE__, __FUNCTION__); \
429 &__t->exp.operands[__i]; }))
431 extern void tree_check_failed (const tree
, enum tree_code
,
432 const char *, int, const char *)
434 extern void tree_check2_failed (const tree
, enum tree_code
, enum tree_code
,
435 const char *, int, const char *)
437 extern void tree_check3_failed (const tree
, enum tree_code
, enum tree_code
,
438 enum tree_code
, const char *, int,
441 extern void tree_check4_failed (const tree
, enum tree_code
, enum tree_code
,
442 enum tree_code
, enum tree_code
,
443 const char *, int, const char *)
445 extern void tree_check5_failed (const tree
, enum tree_code
, enum tree_code
,
446 enum tree_code
, enum tree_code
, enum tree_code
,
447 const char *, int, const char *)
449 extern void tree_class_check_failed (const tree
, int,
450 const char *, int, const char *)
452 extern void tree_vec_elt_check_failed (int, int, const char *,
456 extern void tree_operand_check_failed (int, enum tree_code
,
457 const char *, int, const char *)
460 #else /* not ENABLE_TREE_CHECKING, or not gcc */
462 #define TREE_CHECK(T, CODE) (T)
463 #define TREE_CHECK2(T, CODE1, CODE2) (T)
464 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
465 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
466 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
467 #define TREE_CLASS_CHECK(T, CODE) (T)
468 #define EXPR_CHECK(T) (T)
469 #define NON_TYPE_CHECK(T) (T)
470 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
471 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
472 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
473 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
477 #include "tree-check.h"
479 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't')
480 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd')
481 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c')
482 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's')
483 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
484 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
486 #define SET_ARRAY_OR_VECTOR_CHECK(T) \
487 TREE_CHECK3 (T, ARRAY_TYPE, SET_TYPE, VECTOR_TYPE)
489 #define REC_OR_UNION_CHECK(T) \
490 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
492 #define NUMERICAL_TYPE_CHECK(T) \
493 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \
494 CHAR_TYPE, REAL_TYPE)
496 /* In all nodes that are expressions, this is the data type of the expression.
497 In POINTER_TYPE nodes, this is the type that the pointer points to.
498 In ARRAY_TYPE nodes, this is the type of the elements.
499 In VECTOR_TYPE nodes, this is the type of the elements. */
500 #define TREE_TYPE(NODE) ((NODE)->common.type)
502 /* Here is how primitive or already-canonicalized types' hash codes
504 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
506 /* A simple hash function for an arbitrary tree node. This must not be
507 used in hash tables which are saved to a PCH. */
508 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
510 /* Nodes are chained together for many purposes.
511 Types are chained together to record them for being output to the debugger
512 (see the function `chain_type').
513 Decls in the same scope are chained together to record the contents
515 Statement nodes for successive statements used to be chained together.
516 Often lists of things are represented by TREE_LIST nodes that
517 are chained together. */
519 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
521 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
522 that don't change the machine mode. */
524 #define STRIP_NOPS(EXP) \
525 while ((TREE_CODE (EXP) == NOP_EXPR \
526 || TREE_CODE (EXP) == CONVERT_EXPR \
527 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
528 && TREE_OPERAND (EXP, 0) != error_mark_node \
529 && (TYPE_MODE (TREE_TYPE (EXP)) \
530 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
531 (EXP) = TREE_OPERAND (EXP, 0)
533 /* Like STRIP_NOPS, but don't let the signedness change either. */
535 #define STRIP_SIGN_NOPS(EXP) \
536 while ((TREE_CODE (EXP) == NOP_EXPR \
537 || TREE_CODE (EXP) == CONVERT_EXPR \
538 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
539 && TREE_OPERAND (EXP, 0) != error_mark_node \
540 && (TYPE_MODE (TREE_TYPE (EXP)) \
541 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
542 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
543 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
544 (EXP) = TREE_OPERAND (EXP, 0)
546 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
548 #define STRIP_MAIN_TYPE_NOPS(EXP) \
549 while ((TREE_CODE (EXP) == NOP_EXPR \
550 || TREE_CODE (EXP) == CONVERT_EXPR \
551 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
552 && TREE_OPERAND (EXP, 0) != error_mark_node \
553 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
554 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
555 (EXP) = TREE_OPERAND (EXP, 0)
557 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
559 #define STRIP_TYPE_NOPS(EXP) \
560 while ((TREE_CODE (EXP) == NOP_EXPR \
561 || TREE_CODE (EXP) == CONVERT_EXPR \
562 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
563 && TREE_OPERAND (EXP, 0) != error_mark_node \
564 && (TREE_TYPE (EXP) \
565 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
566 (EXP) = TREE_OPERAND (EXP, 0)
568 /* Nonzero if TYPE represents an integral type. Note that we do not
569 include COMPLEX types here. */
571 #define INTEGRAL_TYPE_P(TYPE) \
572 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
573 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
575 /* Nonzero if TYPE represents a scalar floating-point type. */
577 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
579 /* Nonzero if TYPE represents a complex floating-point type. */
581 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
582 (TREE_CODE (TYPE) == COMPLEX_TYPE \
583 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
585 /* Nonzero if TYPE represents a floating-point type, including complex
586 floating-point types. */
588 #define FLOAT_TYPE_P(TYPE) \
589 (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE))
591 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
593 #define AGGREGATE_TYPE_P(TYPE) \
594 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
595 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
596 || TREE_CODE (TYPE) == SET_TYPE)
598 /* Nonzero if TYPE represents a pointer or reference type.
599 (It should be renamed to INDIRECT_TYPE_P.) */
601 #define POINTER_TYPE_P(TYPE) \
602 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
604 /* Nonzero if this type is a complete type. */
605 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
607 /* Nonzero if this type is the (possibly qualified) void type. */
608 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
610 /* Nonzero if this type is complete or is cv void. */
611 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
612 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
614 /* Nonzero if this type is complete or is an array with unspecified bound. */
615 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
616 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
618 /* Nonzero if TYPE represents a type. */
620 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
622 /* Define many boolean fields that all tree nodes have. */
624 /* In VAR_DECL nodes, nonzero means address of this is needed.
625 So it cannot be in a register.
626 In a FUNCTION_DECL, nonzero means its address is needed.
627 So it must be compiled even if it is an inline function.
628 In a FIELD_DECL node, it means that the programmer is permitted to
629 construct the address of this field. This is used for aliasing
630 purposes: see record_component_aliases.
631 In CONSTRUCTOR nodes, it means object constructed must be in memory.
632 In LABEL_DECL nodes, it means a goto for this label has been seen
633 from a place outside all binding contours that restore stack levels.
634 In ..._TYPE nodes, it means that objects of this type must
635 be fully addressable. This means that pieces of this
636 object cannot go into register parameters, for example.
637 In IDENTIFIER_NODEs, this means that some extern decl for this name
638 had its address taken. That matters for inline functions. */
639 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
641 /* In a VAR_DECL, nonzero means allocate static storage.
642 In a FUNCTION_DECL, nonzero if function has been defined.
643 In a CONSTRUCTOR, nonzero means allocate static storage.
645 ??? This is also used in lots of other nodes in unclear ways which
646 should be cleaned up some day. */
647 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
649 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
650 block's cleanup list, means that the pertinent cleanup should only be
651 executed if an exception is thrown, not on normal exit of its scope. */
652 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
654 /* In a CONVERT_EXPR, NOP_EXPR, NON_LVALUE_EXPR or COMPOUND_EXPR, this means
655 the node was made implicitly and should not lead to an "unused value"
658 ??? Apparently this is also used on other expression types (such as
659 MODIFY_EXPR. This needs to be cleaned up sometime. */
660 #define TREE_NO_UNUSED_WARNING(NODE) (EXPR_CHECK (NODE)->common.static_flag)
662 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
663 chain is via a `virtual' declaration. */
664 #define TREE_VIA_VIRTUAL(NODE) \
665 (TREE_CHECK2 (NODE, TREE_LIST, TREE_VEC)->common.static_flag)
667 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
668 there was an overflow in folding. This is distinct from
669 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
670 occur in constant expressions. */
671 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
673 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
674 this string as an argument. */
675 #define TREE_SYMBOL_REFERENCED(NODE) \
676 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
678 /* Nonzero in a pointer or reference type means the data pointed to
679 by this type can alias anything. */
680 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
681 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
683 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
684 there was an overflow in folding, and no warning has been issued
685 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
688 ??? Apparently, lots of code assumes this is defined in all
690 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
692 /* In a VAR_DECL or FUNCTION_DECL,
693 nonzero means name is to be accessible from outside this module.
694 In an IDENTIFIER_NODE, nonzero means an external declaration
695 accessible from outside this module was previously seen
696 for this name in an inner scope. */
697 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
699 /* In any expression, decl, or constant, nonzero means it has side effects or
700 reevaluation of the whole expression could produce a different value.
701 This is set if any subexpression is a function call, a side effect or a
702 reference to a volatile variable. In a ..._DECL, this is set only if the
703 declaration said `volatile'. This will never be set for a constant. */
704 #define TREE_SIDE_EFFECTS(NODE) \
705 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
707 /* Nonzero means this expression is volatile in the C sense:
708 its address should be of type `volatile WHATEVER *'.
709 In other words, the declared item is volatile qualified.
710 This is used in _DECL nodes and _REF nodes.
712 In a ..._TYPE node, means this type is volatile-qualified.
713 But use TYPE_VOLATILE instead of this macro when the node is a type,
714 because eventually we may make that a different bit.
716 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
717 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
719 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
720 nonzero means it may not be the lhs of an assignment. */
721 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
723 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
724 #define TREE_READONLY_DECL_P(NODE) (DECL_P (NODE) && TREE_READONLY (NODE))
726 /* Value of expression is constant. Always on in all ..._CST nodes. May
727 also appear in an expression or decl where the value is constant. */
728 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
730 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
731 #define DECL_UNSIGNED(NODE) (DECL_CHECK (NODE)->common.unsigned_flag)
733 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
734 #define BIT_FIELD_REF_UNSIGNED(NODE) \
735 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
737 /* In integral and pointer types, means an unsigned type. */
738 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
740 #define TYPE_TRAP_SIGNED(NODE) \
741 (flag_trapv && ! TYPE_UNSIGNED (NODE))
743 /* Nonzero in a VAR_DECL means assembler code has been written.
744 Nonzero in a FUNCTION_DECL means that the function has been compiled.
745 This is interesting in an inline function, since it might not need
746 to be compiled separately.
747 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
748 if the sdb debugging info for the type has been written.
749 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
750 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
752 /* Nonzero in a _DECL if the name is used in its scope.
753 Nonzero in an expr node means inhibit warning if value is unused.
754 In IDENTIFIER_NODEs, this means that some extern decl for this name
756 #define TREE_USED(NODE) ((NODE)->common.used_flag)
758 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
759 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
760 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
762 /* In a CALL_EXPR, means that the address of the return slot is part of the
764 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
766 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
767 thunked-to function. */
768 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag)
770 /* In a type, nonzero means that all objects of the type are guaranteed by the
771 language or front-end to be properly aligned, so we can indicate that a MEM
772 of this type is aligned at least to the alignment of the type, even if it
773 doesn't appear that it is. We see this, for example, in object-oriented
774 languages where a tag field may show this is an object of a more-aligned
775 variant of the more generic type. */
776 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
778 /* Used in classes in C++. */
779 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
780 /* Used in classes in C++.
781 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
782 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
784 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
785 deprecated feature by __attribute__((deprecated)). */
786 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
788 /* These flags are available for each language front end to use internally. */
789 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
790 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
791 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
792 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
793 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
794 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
795 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
797 /* Define additional fields and accessors for nodes representing constants. */
799 /* In an INTEGER_CST node. These two together make a 2-word integer.
800 If the data type is signed, the value is sign-extended to 2 words
801 even though not all of them may really be in use.
802 In an unsigned constant shorter than 2 words, the extra bits are 0. */
803 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
804 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
805 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
807 #define INT_CST_LT(A, B) \
808 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
809 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
810 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
812 #define INT_CST_LT_UNSIGNED(A, B) \
813 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
814 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
815 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
816 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
817 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
819 struct tree_int_cst
GTY(())
821 struct tree_common common
;
822 /* A sub-struct is necessary here because the function `const_hash'
823 wants to scan both words as a unit and taking the address of the
824 sub-struct yields the properly inclusive bounded pointer. */
825 struct tree_int_cst_lowhi
{
826 unsigned HOST_WIDE_INT low
;
831 /* In a REAL_CST node. struct real_value is an opaque entity, with
832 manipulators defined in real.h. We don't want tree.h depending on
833 real.h and transitively on tm.h. */
836 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
837 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
839 struct tree_real_cst
GTY(())
841 struct tree_common common
;
842 struct real_value
* real_cst_ptr
;
845 /* In a STRING_CST */
846 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
847 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
849 struct tree_string
GTY(())
851 struct tree_common common
;
856 /* In a COMPLEX_CST node. */
857 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
858 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
860 struct tree_complex
GTY(())
862 struct tree_common common
;
867 /* In a VECTOR_CST node. */
868 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
870 struct tree_vector
GTY(())
872 struct tree_common common
;
876 #include "hashtable.h"
878 /* Define fields and accessors for some special-purpose tree nodes. */
880 #define IDENTIFIER_LENGTH(NODE) \
881 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
882 #define IDENTIFIER_POINTER(NODE) \
883 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
884 #define IDENTIFIER_HASH_VALUE(NODE) \
885 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
887 /* Translate a hash table identifier pointer to a tree_identifier
888 pointer, and vice versa. */
890 #define HT_IDENT_TO_GCC_IDENT(NODE) \
891 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
892 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
894 struct tree_identifier
GTY(())
896 struct tree_common common
;
897 struct ht_identifier id
;
900 /* In a TREE_LIST node. */
901 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
902 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
904 struct tree_list
GTY(())
906 struct tree_common common
;
911 /* In a TREE_VEC node. */
912 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
913 #define TREE_VEC_END(NODE) \
914 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
916 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
918 struct tree_vec
GTY(())
920 struct tree_common common
;
922 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
925 /* Define fields and accessors for some nodes that represent expressions. */
927 /* In a SAVE_EXPR node. */
928 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1)
929 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2)
931 #define SAVE_EXPR_NOPLACEHOLDER(NODE) \
932 (SAVE_EXPR_CHECK (NODE)->common.unsigned_flag)
934 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
935 both in normal code and in a handler. (Normally, in a handler, all
936 SAVE_EXPRs are unsaved, meaning that their values are
938 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
940 /* In a RTL_EXPR node. */
941 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0)
942 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1)
943 #define RTL_EXPR_ALT_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 2)
945 /* In a WITH_CLEANUP_EXPR node. */
946 #define WITH_CLEANUP_EXPR_RTL(NODE) \
947 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2)
949 /* In a CONSTRUCTOR node. */
950 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
952 /* In ordinary expression nodes. */
953 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
954 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
956 /* In a LABELED_BLOCK_EXPR node. */
957 #define LABELED_BLOCK_LABEL(NODE) \
958 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
959 #define LABELED_BLOCK_BODY(NODE) \
960 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
962 /* In an EXIT_BLOCK_EXPR node. */
963 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
964 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
965 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
967 /* In a LOOP_EXPR node. */
968 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
970 /* In an EXPR_WITH_FILE_LOCATION node. */
971 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
972 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
973 #define EXPR_WFL_NODE(NODE) \
974 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 0)
975 #define EXPR_WFL_FILENAME_NODE(NODE) \
976 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 1)
977 #define EXPR_WFL_FILENAME(NODE) \
978 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE))
979 /* ??? Java uses this in all expressions. */
980 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
981 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
982 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
983 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
984 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
986 /* In a TARGET_EXPR node. */
987 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
988 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
989 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
991 struct tree_exp
GTY(())
993 struct tree_common common
;
995 tree
GTY ((special ("tree_exp"),
996 desc ("TREE_CODE ((tree) &%0)")))
1000 /* In a BLOCK node. */
1001 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1002 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1003 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1004 /* Note: when changing this, make sure to find the places
1005 that use chainon or nreverse. */
1006 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1007 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1008 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1010 /* Nonzero means that this block is prepared to handle exceptions
1011 listed in the BLOCK_VARS slot. */
1012 #define BLOCK_HANDLER_BLOCK(NODE) \
1013 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1015 /* An index number for this block. These values are not guaranteed to
1016 be unique across functions -- whether or not they are depends on
1017 the debugging output format in use. */
1018 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1020 /* If block reordering splits a lexical block into discontiguous
1021 address ranges, we'll make a copy of the original block.
1023 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1024 In that case, we have one source block that has been replicated
1025 (through inlining or unrolling) into many logical blocks, and that
1026 these logical blocks have different physical variables in them.
1028 In this case, we have one logical block split into several
1029 non-contiguous address ranges. Most debug formats can't actually
1030 represent this idea directly, so we fake it by creating multiple
1031 logical blocks with the same variables in them. However, for those
1032 that do support non-contiguous regions, these allow the original
1033 logical block to be reconstructed, along with the set of address
1036 One of the logical block fragments is arbitrarily chosen to be
1037 the ORIGIN. The other fragments will point to the origin via
1038 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1039 be null. The list of fragments will be chained through
1040 BLOCK_FRAGMENT_CHAIN from the origin. */
1042 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1043 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1045 struct tree_block
GTY(())
1047 struct tree_common common
;
1049 unsigned handler_block_flag
: 1;
1050 unsigned abstract_flag
: 1;
1051 unsigned block_num
: 30;
1056 tree abstract_origin
;
1057 tree fragment_origin
;
1058 tree fragment_chain
;
1061 /* Define fields and accessors for nodes representing data types. */
1063 /* See tree.def for documentation of the use of these fields.
1064 Look at the documentation of the various ..._TYPE tree codes.
1066 Note that the type.values, type.minval, and type.maxval fields are
1067 overloaded and used for different macros in different kinds of types.
1068 Each macro must check to ensure the tree node is of the proper kind of
1069 type. Note also that some of the front-ends also overload these fields,
1070 so they must be checked as well. */
1072 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1073 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1074 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1075 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1076 #define TYPE_ORIG_SIZE_TYPE(NODE) (INTEGER_TYPE_CHECK (NODE)->type.values)
1077 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1078 #define TYPE_DOMAIN(NODE) (SET_ARRAY_OR_VECTOR_CHECK (NODE)->type.values)
1079 #define TYPE_FIELDS(NODE) (REC_OR_UNION_CHECK (NODE)->type.values)
1080 #define TYPE_METHODS(NODE) (REC_OR_UNION_CHECK (NODE)->type.maxval)
1081 #define TYPE_VFIELD(NODE) (REC_OR_UNION_CHECK (NODE)->type.minval)
1082 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1083 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1084 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1085 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1086 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1087 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1088 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1089 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1090 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1091 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1092 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1093 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1094 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1095 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1096 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1097 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1098 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1099 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1101 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1102 in the debugging output. We use this to describe a vector as a
1103 structure containing an array. */
1104 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
1106 /* For aggregate types, information about this type, as a base type
1107 for itself. Used in a language-dependent way for types that are
1108 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
1109 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
1111 /* The (language-specific) typed-based alias set for this type.
1112 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1113 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1114 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1115 type can alias objects of any type. */
1116 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1118 /* Nonzero iff the typed-based alias set for this type has been
1120 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1122 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1124 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1126 /* The alignment necessary for objects of this type.
1127 The value is an int, measured in bits. */
1128 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1130 /* 1 if the alignment for this type was requested by "aligned" attribute,
1131 0 if it is the default for this type. */
1132 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1134 /* The alignment for NODE, in bytes. */
1135 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1137 /* If your language allows you to declare types, and you want debug info
1138 for them, then you need to generate corresponding TYPE_DECL nodes.
1139 These "stub" TYPE_DECL nodes have no name, and simply point at the
1140 type node. You then set the TYPE_STUB_DECL field of the type node
1141 to point back at the TYPE_DECL node. This allows the debug routines
1142 to know that the two nodes represent the same type, so that we only
1143 get one debug info record for them. */
1144 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1146 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1147 has BLKmode only because it lacks the alignment requirement for
1149 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1151 /* In an INTEGER_TYPE, it means the type represents a size. We use
1152 this both for validity checking and to permit optimizations that
1153 are unsafe for other types. Note that the C `size_t' type should
1154 *not* have this flag set. The `size_t' type is simply a typedef
1155 for an ordinary integer type that happens to be the type of an
1156 expression returned by `sizeof'; `size_t' has no special
1157 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1158 always actual sizes. */
1159 #define TYPE_IS_SIZETYPE(NODE) \
1160 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1162 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1163 pointer depressed. */
1164 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1165 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1167 /* Nonzero in a type considered volatile as a whole. */
1168 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1170 /* Means this type is const-qualified. */
1171 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1173 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1175 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1177 /* There is a TYPE_QUAL value for each type qualifier. They can be
1178 combined by bitwise-or to form the complete set of qualifiers for a
1181 #define TYPE_UNQUALIFIED 0x0
1182 #define TYPE_QUAL_CONST 0x1
1183 #define TYPE_QUAL_VOLATILE 0x2
1184 #define TYPE_QUAL_RESTRICT 0x4
1186 /* The set of type qualifiers for this type. */
1187 #define TYPE_QUALS(NODE) \
1188 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1189 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1190 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1192 /* These flags are available for each language front end to use internally. */
1193 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1194 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1195 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1196 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1197 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1198 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1199 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1201 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1202 that distinguish string from array of char).
1203 If set in a SET_TYPE, indicates a bitstring type. */
1204 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1206 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1207 object of the given ARRAY_TYPE. This allows temporaries to be
1209 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1210 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
1212 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1213 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1214 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1216 /* Indicates that objects of this type must be initialized by calling a
1217 function when they are created. */
1218 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1219 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1221 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1222 the same way that the first union alternative would be passed. */
1223 #define TYPE_TRANSPARENT_UNION(NODE) \
1224 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1226 /* For an ARRAY_TYPE, indicates that it is not permitted to
1227 take the address of a component of the type. */
1228 #define TYPE_NONALIASED_COMPONENT(NODE) \
1229 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1231 /* Indicated that objects of this type should be laid out in as
1232 compact a way as possible. */
1233 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1237 struct tree_type
GTY(())
1239 struct tree_common common
;
1246 unsigned int precision
: 9;
1247 ENUM_BITFIELD(machine_mode
) mode
: 7;
1249 unsigned string_flag
: 1;
1250 unsigned no_force_blk_flag
: 1;
1251 unsigned needs_constructing_flag
: 1;
1252 unsigned transparent_union_flag
: 1;
1253 unsigned packed_flag
: 1;
1254 unsigned restrict_flag
: 1;
1257 unsigned lang_flag_0
: 1;
1258 unsigned lang_flag_1
: 1;
1259 unsigned lang_flag_2
: 1;
1260 unsigned lang_flag_3
: 1;
1261 unsigned lang_flag_4
: 1;
1262 unsigned lang_flag_5
: 1;
1263 unsigned lang_flag_6
: 1;
1264 unsigned user_align
: 1;
1269 union tree_type_symtab
{
1270 int GTY ((tag ("0"))) address
;
1271 char * GTY ((tag ("1"))) pointer
;
1272 struct die_struct
* GTY ((tag ("2"))) die
;
1273 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1274 descbits ("2"))) symtab
;
1282 HOST_WIDE_INT alias_set
;
1283 /* Points to a structure whose details depend on the language in use. */
1284 struct lang_type
*lang_specific
;
1287 /* Define accessor macros for information about type inheritance
1290 A "basetype" means a particular usage of a data type for inheritance
1291 in another type. Each such basetype usage has its own "binfo"
1292 object to describe it. The binfo object is a TREE_VEC node.
1294 Inheritance is represented by the binfo nodes allocated for a
1295 given type. For example, given types C and D, such that D is
1296 inherited by C, 3 binfo nodes will be allocated: one for describing
1297 the binfo properties of C, similarly one for D, and one for
1298 describing the binfo properties of D as a base type for C.
1299 Thus, given a pointer to class C, one can get a pointer to the binfo
1300 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1302 /* The actual data type node being inherited in this basetype. */
1303 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1305 /* The offset where this basetype appears in its containing type.
1306 BINFO_OFFSET slot holds the offset (in bytes)
1307 from the base of the complete object to the base of the part of the
1308 object that is allocated on behalf of this `type'.
1309 This is always 0 except when there is multiple inheritance. */
1311 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1312 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1313 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1315 /* The virtual function table belonging to this basetype. Virtual
1316 function tables provide a mechanism for run-time method dispatching.
1317 The entries of a virtual function table are language-dependent. */
1319 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1320 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1322 /* The virtual functions in the virtual function table. This is
1323 a TREE_LIST that is used as an initial approximation for building
1324 a virtual function table for this basetype. */
1325 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1326 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1328 /* A vector of binfos for the direct basetypes inherited by this
1331 If this basetype describes type D as inherited in C, and if the
1332 basetypes of D are E and F, then this vector contains binfos for
1333 inheritance of E and F by C.
1335 ??? This could probably be done by just allocating the
1336 base types at the end of this TREE_VEC (instead of using
1337 another TREE_VEC). This would simplify the calculation
1338 of how many basetypes a given type had. */
1339 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1340 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1342 /* The number of basetypes for NODE. */
1343 #define BINFO_N_BASETYPES(NODE) \
1344 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1346 /* Accessor macro to get to the Nth basetype of this basetype. */
1347 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1348 #define TYPE_BINFO_BASETYPE(NODE,N) \
1349 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1351 /* For a BINFO record describing a virtual base class, i.e., one where
1352 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1353 base. The actual contents are language-dependent. In the C++
1354 front-end this field is an INTEGER_CST giving an offset into the
1355 vtable where the offset to the virtual base can be found. */
1356 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1358 /* Indicates the accesses this binfo has to its bases. The values are
1359 access_public_node, access_protected_node or access_private_node.
1360 If this array is not present, public access is implied. */
1361 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1362 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1364 /* Number of language independent elements in a binfo. Languages may
1365 add additional trailing elements. */
1367 #define BINFO_ELTS 7
1369 /* Slot used to build a chain that represents a use of inheritance.
1370 For example, if X is derived from Y, and Y is derived from Z,
1371 then this field can be used to link the binfo node for X to
1372 the binfo node for X's Y to represent the use of inheritance
1373 from X to Y. Similarly, this slot of the binfo node for X's Y
1374 can point to the Z from which Y is inherited (in X's inheritance
1375 hierarchy). In this fashion, one can represent and traverse specific
1376 uses of inheritance using the binfo nodes themselves (instead of
1377 consing new space pointing to binfo nodes).
1378 It is up to the language-dependent front-ends to maintain
1379 this information as necessary. */
1380 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1382 /* Define fields and accessors for nodes representing declared names. */
1384 /* Nonzero if DECL represents a decl. */
1385 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1387 /* This is the name of the object as written by the user.
1388 It is an IDENTIFIER_NODE. */
1389 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1391 /* The name of the object as the assembler will see it (but before any
1392 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1393 as DECL_NAME. It is an IDENTIFIER_NODE. */
1394 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1396 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1397 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1399 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1400 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1402 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1403 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1404 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1406 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1407 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1408 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1409 semantics of using this macro, are different than saying:
1411 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1413 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1415 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1416 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1417 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1418 DECL_ASSEMBLER_NAME (DECL1)) \
1421 /* Records the section name in a section attribute. Used to pass
1422 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1423 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1425 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1426 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1427 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1428 points to either the FUNCTION_DECL for the containing function,
1429 the RECORD_TYPE or UNION_TYPE for the containing type, or
1430 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1432 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1433 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1434 /* In a DECL this is the field where attributes are stored. */
1435 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1436 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1437 byte containing the bit closest to the beginning of the structure. */
1438 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1439 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1440 field from DECL_FIELD_OFFSET. */
1441 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1442 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1443 if so, the type that was originally specified for it.
1444 TREE_TYPE may have been modified (in finish_struct). */
1445 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1446 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1447 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1449 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1450 /* This field is used to reference anything in decl.result and is meant only
1451 for use by the garbage collector. */
1452 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1453 /* In FUNCTION_DECL, holds the decl for the return value. */
1454 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1455 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1456 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1457 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1458 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1459 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1460 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1461 For a VAR_DECL, holds the initial value.
1462 For a PARM_DECL, not used--default
1463 values for parameters are encoded in the type of the function,
1464 not in the PARM_DECL slot.
1466 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1467 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1468 /* For a PARM_DECL, records the data type used to pass the argument,
1469 which may be different from the type seen in the program. */
1470 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1471 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1472 if nonzero, indicates that the field occupies the type. */
1473 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1474 /* These two fields describe where in the source code the declaration
1475 was. If the declaration appears in several places (as for a C
1476 function that is declared first and then defined later), this
1477 information should refer to the definition. */
1478 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1479 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1480 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1481 /* Holds the size of the datum, in bits, as a tree expression.
1482 Need not be constant. */
1483 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1484 /* Likewise for the size in bytes. */
1485 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1486 /* Holds the alignment required for the datum, in bits. */
1487 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1488 /* The alignment of NODE, in bytes. */
1489 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1490 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1491 DECL_FIELD_OFFSET which are known to be always zero.
1492 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1494 #define DECL_OFFSET_ALIGN(NODE) \
1495 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1496 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1497 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1498 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1499 /* 1 if the alignment for this type was requested by "aligned" attribute,
1500 0 if it is the default for this type. */
1501 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1502 /* Holds the machine mode corresponding to the declaration of a variable or
1503 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1505 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1506 /* Holds the RTL expression for the value of a variable or function.
1507 This value can be evaluated lazily for functions, variables with
1508 static storage duration, and labels. */
1509 #define DECL_RTL(NODE) \
1510 (DECL_CHECK (NODE)->decl.rtl \
1511 ? (NODE)->decl.rtl \
1512 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1513 /* Set the DECL_RTL for NODE to RTL. */
1514 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1515 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1516 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1517 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1518 NODE1, it will not be set for NODE2; this is a lazy copy. */
1519 #define COPY_DECL_RTL(NODE1, NODE2) \
1520 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1521 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1522 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1524 /* For PARM_DECL, holds an RTL for the stack slot or register
1525 where the data was actually passed. */
1526 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1528 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
1529 that describes the status of this function. */
1530 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1532 /* For FUNCTION_DECL, if it is built-in,
1533 this identifies which built-in operation it is. */
1534 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1536 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1537 Before the struct containing the FUNCTION_DECL is laid out,
1538 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1539 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1540 function. When the class is laid out, this pointer is changed
1541 to an INTEGER_CST node which is suitable for use as an index
1542 into the virtual function table. */
1543 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1545 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1546 which this FIELD_DECL is defined. This information is needed when
1547 writing debugging information about vfield and vbase decls for C++. */
1548 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1550 /* Every ..._DECL node gets a unique number. */
1551 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1553 /* For any sort of a ..._DECL node, this points to the original (abstract)
1554 decl node which this decl is an instance of, or else it is NULL indicating
1555 that this decl is not an instance of some other decl. For example,
1556 in a nested declaration of an inline function, this points back to the
1558 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1560 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1561 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1562 #define DECL_ORIGIN(NODE) \
1563 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1565 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1566 inline instance of some original (abstract) decl from an inline function;
1567 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1568 nodes can also have their abstract origin set to themselves. */
1569 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1570 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1572 /* Nonzero if a _DECL means that the name of this decl should be ignored
1573 for symbolic debug purposes. */
1574 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1576 /* Nonzero for a given ..._DECL node means that this node represents an
1577 "abstract instance" of the given declaration (e.g. in the original
1578 declaration of an inline function). When generating symbolic debugging
1579 information, we mustn't try to generate any address information for nodes
1580 marked as "abstract instances" because we don't actually generate
1581 any code or allocate any data space for such instances. */
1582 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1584 /* Nonzero if a _DECL means that no warnings should be generated just
1585 because this decl is unused. */
1586 #define DECL_IN_SYSTEM_HEADER(NODE) \
1587 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1589 /* Nonzero for a given ..._DECL node means that this node should be
1590 put in .common, if possible. If a DECL_INITIAL is given, and it
1591 is not error_mark_node, then the decl cannot be put in .common. */
1592 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1594 /* Language-specific decl information. */
1595 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1597 /* In a VAR_DECL or FUNCTION_DECL,
1598 nonzero means external reference:
1599 do not allocate storage, and refer to a definition elsewhere. */
1600 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1602 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1604 #define DEFAULT_INIT_PRIORITY 65535
1605 #define MAX_INIT_PRIORITY 65535
1606 #define MAX_RESERVED_INIT_PRIORITY 100
1609 nonzero means the detail info about this type is not dumped into stabs.
1610 Instead it will generate cross reference ('x') of names.
1611 This uses the same flag as DECL_EXTERNAL. */
1612 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1613 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1615 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1616 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1618 /* In LABEL_DECL nodes, nonzero means that an error message about
1619 jumping into such a binding contour has been printed for this label. */
1620 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1622 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1623 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1625 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1626 static chain is not needed. */
1627 #define DECL_NO_STATIC_CHAIN(NODE) \
1628 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1630 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1631 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1633 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1635 Also set in some languages for variables, etc., outside the normal
1636 lexical scope, such as class instance variables. */
1637 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1639 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1640 where it is called. */
1641 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1643 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
1644 such as via the `inline' keyword in C/C++. This flag controls the linkage
1645 semantics of 'inline'; whether or not the function is inlined is
1646 controlled by DECL_INLINE. */
1647 #define DECL_DECLARED_INLINE_P(NODE) \
1648 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
1650 /* Value of the decls's visibility attribute */
1651 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility)
1653 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1654 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1656 /* In a VAR_DECL, nonzero if the data should be allocated from
1657 thread-local storage. */
1658 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1660 /* In a FUNCTION_DECL, the saved representation of the body of the
1661 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1662 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1663 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1665 /* List of FUNCTION_DECLs inlined into this function's body. */
1666 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1668 /* Nonzero in a FUNCTION_DECL means this function should be treated
1669 as if it were a malloc, meaning it returns a pointer that is
1671 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1673 /* Nonzero in a FUNCTION_DECL means this function should be treated
1674 as "pure" function (like const function, but may read global memory). */
1675 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1677 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1679 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1681 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1682 contour that restored a stack level and which is now exited. */
1683 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1685 /* Unused in FUNCTION_DECL. */
1687 /* In a VAR_DECL that's static,
1688 nonzero if the space is in the text section. */
1689 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1691 /* In a FUNCTION_DECL, nonzero means a built in function. */
1692 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1694 /* For a builtin function, identify which part of the compiler defined it. */
1695 #define DECL_BUILT_IN_CLASS(NODE) \
1696 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1698 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1699 Used in FIELD_DECLs for vtable pointers.
1700 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1701 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1703 /* Used to indicate that the linkage status of this DECL is not yet known,
1704 so it should not be output now. */
1705 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1707 /* Used in PARM_DECLs whose type are unions to indicate that the
1708 argument should be passed in the same way that the first union
1709 alternative would be passed. */
1710 #define DECL_TRANSPARENT_UNION(NODE) \
1711 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1713 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1714 at the beginning or end of execution. */
1715 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1716 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1718 #define DECL_STATIC_DESTRUCTOR(NODE) \
1719 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1721 /* Used to indicate that this DECL represents a compiler-generated entity. */
1722 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1724 /* Used to indicate that this DECL has weak linkage. */
1725 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1727 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1728 multiple translation units should be merged. */
1729 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1731 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1732 not be put out unless it is needed in this translation unit.
1733 Entities like this are shared across translation units (like weak
1734 entities), but are guaranteed to be generated by any translation
1735 unit that needs them, and therefore need not be put out anywhere
1736 where they are not needed. DECL_COMDAT is just a hint to the
1737 back-end; it is up to front-ends which set this flag to ensure
1738 that there will never be any harm, other than bloat, in putting out
1739 something which is DECL_COMDAT. */
1740 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1742 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1743 be instrumented with calls to support routines. */
1744 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1745 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1747 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1748 disabled in this function. */
1749 #define DECL_NO_LIMIT_STACK(NODE) \
1750 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1752 /* Additional flags for language-specific uses. */
1753 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1754 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1755 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1756 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1757 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1758 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1759 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1760 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1762 /* Used to indicate that the pointer to this DECL cannot be treated as
1763 an address constant. */
1764 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1766 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1768 #define DECL_NONADDRESSABLE_P(NODE) \
1769 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1771 /* Used to indicate an alias set for the memory pointed to by this
1772 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1773 pointer (or reference) type. */
1774 #define DECL_POINTER_ALIAS_SET(NODE) \
1775 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1777 /* Nonzero if an alias set has been assigned to this declaration. */
1778 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1779 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1781 /* Nonzero for a decl which is at file scope. */
1782 #define DECL_FILE_SCOPE_P(EXP) \
1783 (! DECL_CONTEXT (EXP) \
1784 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
1786 /* Enumerate visibility settings. */
1788 enum symbol_visibility
1791 VISIBILITY_INTERNAL
,
1793 VISIBILITY_PROTECTED
1798 struct tree_decl
GTY(())
1800 struct tree_common common
;
1804 ENUM_BITFIELD(machine_mode
) mode
: 8;
1806 unsigned external_flag
: 1;
1807 unsigned nonlocal_flag
: 1;
1808 unsigned regdecl_flag
: 1;
1809 unsigned inline_flag
: 1;
1810 unsigned bit_field_flag
: 1;
1811 unsigned virtual_flag
: 1;
1812 unsigned ignored_flag
: 1;
1813 unsigned abstract_flag
: 1;
1815 unsigned in_system_header_flag
: 1;
1816 unsigned common_flag
: 1;
1817 unsigned defer_output
: 1;
1818 unsigned transparent_union
: 1;
1819 unsigned static_ctor_flag
: 1;
1820 unsigned static_dtor_flag
: 1;
1821 unsigned artificial_flag
: 1;
1822 unsigned weak_flag
: 1;
1824 unsigned non_addr_const_p
: 1;
1825 unsigned no_instrument_function_entry_exit
: 1;
1826 unsigned comdat_flag
: 1;
1827 unsigned malloc_flag
: 1;
1828 unsigned no_limit_stack
: 1;
1829 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
1830 unsigned pure_flag
: 1;
1832 unsigned non_addressable
: 1;
1833 unsigned user_align
: 1;
1834 unsigned uninlinable
: 1;
1835 unsigned thread_local_flag
: 1;
1836 unsigned declared_inline_flag
: 1;
1837 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
1838 unsigned unused
: 1;
1839 /* one unused bit. */
1841 unsigned lang_flag_0
: 1;
1842 unsigned lang_flag_1
: 1;
1843 unsigned lang_flag_2
: 1;
1844 unsigned lang_flag_3
: 1;
1845 unsigned lang_flag_4
: 1;
1846 unsigned lang_flag_5
: 1;
1847 unsigned lang_flag_6
: 1;
1848 unsigned lang_flag_7
: 1;
1850 union tree_decl_u1
{
1851 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1852 DECL_FUNCTION_CODE. */
1853 enum built_in_function f
;
1854 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
1855 is used by language-dependent code. */
1857 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1859 struct tree_decl_u1_a
{
1860 unsigned int align
: 24;
1861 unsigned int off_align
: 8;
1868 tree arguments
; /* Also used for DECL_FIELD_OFFSET */
1869 tree result
; /* Also used for DECL_BIT_FIELD_TYPE */
1870 tree initial
; /* Also used for DECL_QUALIFIER */
1871 tree abstract_origin
;
1872 tree assembler_name
;
1875 rtx rtl
; /* RTL representation for object. */
1877 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1878 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1879 In PARM_DECL, holds an RTL for the stack slot
1880 of register where the data was actually passed.
1881 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1882 union tree_decl_u2
{
1883 struct function
* GTY ((tag ("FUNCTION_DECL"))) f
;
1884 rtx
GTY ((tag ("PARM_DECL"))) r
;
1885 tree
GTY ((tag ("FIELD_DECL"))) t
;
1886 int GTY ((tag ("VAR_DECL"))) i
;
1887 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2
;
1889 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1892 /* In a FUNCTION_DECL, these are function data which is to be kept
1893 as long as FUNCTION_DECL is kept. */
1897 HOST_WIDE_INT pointer_alias_set
;
1898 /* Points to a structure whose details depend on the language in use. */
1899 struct lang_decl
*lang_specific
;
1902 enum tree_node_structure_enum
{
1919 /* Define the overall contents of a tree node.
1920 It may be any of the structures declared above
1921 for various types of node. */
1923 union tree_node
GTY ((ptr_alias (union lang_tree_node
),
1924 desc ("tree_node_structure (&%h)")))
1926 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
1927 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
1928 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
1929 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
1930 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
1931 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
1932 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
1933 struct tree_decl
GTY ((tag ("TS_DECL"))) decl
;
1934 struct tree_type
GTY ((tag ("TS_TYPE"))) type
;
1935 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
1936 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
1937 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
1938 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
1941 /* Standard named or nameless data types of the C compiler. */
1960 TI_INTEGER_MINUS_ONE
,
1977 TI_COMPLEX_INTEGER_TYPE
,
1978 TI_COMPLEX_FLOAT_TYPE
,
1979 TI_COMPLEX_DOUBLE_TYPE
,
1980 TI_COMPLEX_LONG_DOUBLE_TYPE
,
1984 TI_LONG_DOUBLE_TYPE
,
1988 TI_LONG_DOUBLE_PTR_TYPE
,
1989 TI_INTEGER_PTR_TYPE
,
2006 extern GTY(()) tree global_trees
[TI_MAX
];
2008 #define error_mark_node global_trees[TI_ERROR_MARK]
2010 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2011 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2012 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2013 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2014 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2016 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2017 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2018 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2019 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2020 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2022 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2023 #define integer_one_node global_trees[TI_INTEGER_ONE]
2024 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2025 #define size_zero_node global_trees[TI_SIZE_ZERO]
2026 #define size_one_node global_trees[TI_SIZE_ONE]
2027 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2028 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2029 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2031 /* Base access nodes. */
2032 #define access_public_node global_trees[TI_PUBLIC]
2033 #define access_protected_node global_trees[TI_PROTECTED]
2034 #define access_private_node global_trees[TI_PRIVATE]
2036 #define null_pointer_node global_trees[TI_NULL_POINTER]
2038 #define float_type_node global_trees[TI_FLOAT_TYPE]
2039 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2040 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2042 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
2043 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
2044 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
2045 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
2047 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2048 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2049 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2050 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2052 #define void_type_node global_trees[TI_VOID_TYPE]
2053 /* The C type `void *'. */
2054 #define ptr_type_node global_trees[TI_PTR_TYPE]
2055 /* The C type `const void *'. */
2056 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2057 /* The C type `size_t'. */
2058 #define size_type_node global_trees[TI_SIZE_TYPE]
2059 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2060 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2062 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
2063 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
2064 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
2066 /* The node that should be placed at the end of a parameter list to
2067 indicate that the function does not take a variable number of
2068 arguments. The TREE_VALUE will be void_type_node and there will be
2069 no TREE_CHAIN. Language-independent code should not assume
2070 anything else about this node. */
2071 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2073 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2074 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2076 /* An enumeration of the standard C integer types. These must be
2077 ordered so that shorter types appear before longer ones, and so
2078 that signed types appear before unsigned ones, for the correct
2079 functioning of interpret_integer() in c-lex.c. */
2080 enum integer_type_kind
2092 itk_unsigned_long_long
,
2096 typedef enum integer_type_kind integer_type_kind
;
2098 /* The standard C integer types. Use integer_type_kind to index into
2100 extern GTY(()) tree integer_types
[itk_none
];
2102 #define char_type_node integer_types[itk_char]
2103 #define signed_char_type_node integer_types[itk_signed_char]
2104 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2105 #define short_integer_type_node integer_types[itk_short]
2106 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2107 #define integer_type_node integer_types[itk_int]
2108 #define unsigned_type_node integer_types[itk_unsigned_int]
2109 #define long_integer_type_node integer_types[itk_long]
2110 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2111 #define long_long_integer_type_node integer_types[itk_long_long]
2112 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2114 /* Set to the default thread-local storage (tls) model to use. */
2117 TLS_MODEL_GLOBAL_DYNAMIC
= 1,
2118 TLS_MODEL_LOCAL_DYNAMIC
,
2119 TLS_MODEL_INITIAL_EXEC
,
2120 TLS_MODEL_LOCAL_EXEC
2123 extern enum tls_model flag_tls_default
;
2126 /* A pointer-to-function member type looks like:
2133 If __pfn is NULL, it is a NULL pointer-to-member-function.
2135 (Because the vtable is always the first thing in the object, we
2136 don't need its offset.) If the function is virtual, then PFN is
2137 one plus twice the index into the vtable; otherwise, it is just a
2138 pointer to the function.
2140 Unfortunately, using the lowest bit of PFN doesn't work in
2141 architectures that don't impose alignment requirements on function
2142 addresses, or that use the lowest bit to tell one ISA from another,
2143 for example. For such architectures, we use the lowest bit of
2144 DELTA instead of the lowest bit of the PFN, and DELTA will be
2147 enum ptrmemfunc_vbit_where_t
2149 ptrmemfunc_vbit_in_pfn
,
2150 ptrmemfunc_vbit_in_delta
2153 #define NULL_TREE (tree) NULL
2155 extern GTY(()) tree frame_base_decl
;
2156 extern tree
decl_assembler_name (tree
);
2158 /* Compute the number of bytes occupied by 'node'. This routine only
2159 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2161 extern size_t tree_size (tree
);
2163 /* Lowest level primitive for allocating a node.
2164 The TREE_CODE is the only argument. Contents are initialized
2165 to zero except for a few of the common fields. */
2167 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
2168 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
2170 /* Make a copy of a node, with all the same contents. */
2172 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
2173 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
2175 /* Make a copy of a chain of TREE_LIST nodes. */
2177 extern tree
copy_list (tree
);
2179 /* Make a TREE_VEC. */
2181 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
2182 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
2184 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2185 The name is supplied as a char *. */
2187 extern tree
get_identifier (const char *);
2189 #if GCC_VERSION >= 3000
2190 #define get_identifier(str) \
2191 (__builtin_constant_p (str) \
2192 ? get_identifier_with_length ((str), strlen (str)) \
2193 : get_identifier (str))
2197 /* Identical to get_identifier, except that the length is assumed
2200 extern tree
get_identifier_with_length (const char *, size_t);
2202 /* If an identifier with the name TEXT (a null-terminated string) has
2203 previously been referred to, return that node; otherwise return
2206 extern tree
maybe_get_identifier (const char *);
2208 /* Construct various types of nodes. */
2210 #define build_int_2(LO, HI) \
2211 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2213 extern tree
build (enum tree_code
, tree
, ...);
2214 extern tree
build_nt (enum tree_code
, ...);
2216 #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L
2217 /* Use preprocessor trickery to map "build" to "buildN" where N is the
2218 expected number of arguments. This is used for both efficiency (no
2219 varargs), and checking (verifying number of passed arguments). */
2220 #define build(code, ...) \
2221 _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__)
2222 #define _buildN1(BASE, X) _buildN2(BASE, X)
2223 #define _buildN2(BASE, X) BASE##X
2224 #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0)
2225 #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c
2228 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
2229 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
2230 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
2231 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
2232 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
2233 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
2234 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
2235 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
2236 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
2237 tree MEM_STAT_DECL
);
2238 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
2240 extern tree
build_int_2_wide (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
2241 extern tree
build_vector (tree
, tree
);
2242 extern tree
build_constructor (tree
, tree
);
2243 extern tree
build_real_from_int_cst (tree
, tree
);
2244 extern tree
build_complex (tree
, tree
, tree
);
2245 extern tree
build_string (int, const char *);
2246 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
2247 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
2248 extern tree
build_decl_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
2249 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
2250 extern tree
build_block (tree
, tree
, tree
, tree
, tree
);
2251 extern tree
build_expr_wfl (tree
, const char *, int, int);
2253 /* Construct various nodes representing data types. */
2255 extern tree
make_signed_type (int);
2256 extern tree
make_unsigned_type (int);
2257 extern void initialize_sizetypes (void);
2258 extern void set_sizetype (tree
);
2259 extern void fixup_unsigned_type (tree
);
2260 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
2261 extern tree
build_pointer_type (tree
);
2262 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
2263 extern tree
build_reference_type (tree
);
2264 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
2265 extern tree
build_vector_type (tree innertype
, int nunits
);
2266 extern tree
build_type_no_quals (tree
);
2267 extern tree
build_index_type (tree
);
2268 extern tree
build_index_2_type (tree
, tree
);
2269 extern tree
build_array_type (tree
, tree
);
2270 extern tree
build_function_type (tree
, tree
);
2271 extern tree
build_function_type_list (tree
, ...);
2272 extern tree
build_method_type_directly (tree
, tree
, tree
);
2273 extern tree
build_method_type (tree
, tree
);
2274 extern tree
build_offset_type (tree
, tree
);
2275 extern tree
build_complex_type (tree
);
2276 extern tree
array_type_nelts (tree
);
2278 extern tree
value_member (tree
, tree
);
2279 extern tree
purpose_member (tree
, tree
);
2280 extern tree
binfo_member (tree
, tree
);
2282 extern int attribute_list_equal (tree
, tree
);
2283 extern int attribute_list_contained (tree
, tree
);
2284 extern int tree_int_cst_equal (tree
, tree
);
2285 extern int tree_int_cst_lt (tree
, tree
);
2286 extern int tree_int_cst_compare (tree
, tree
);
2287 extern int host_integerp (tree
, int);
2288 extern HOST_WIDE_INT
tree_low_cst (tree
, int);
2289 extern int tree_int_cst_msb (tree
);
2290 extern int tree_int_cst_sgn (tree
);
2291 extern int tree_expr_nonnegative_p (tree
);
2292 extern int rtl_expr_nonnegative_p (rtx
);
2293 extern tree
get_inner_array_type (tree
);
2295 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2296 put the prototype here. Rtl.h does declare the prototype if
2297 tree.h had been included. */
2299 extern tree
make_tree (tree
, rtx
);
2301 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2304 Such modified types already made are recorded so that duplicates
2307 extern tree
build_type_attribute_variant (tree
, tree
);
2308 extern tree
build_decl_attribute_variant (tree
, tree
);
2310 /* Structure describing an attribute and a function to handle it. */
2311 struct attribute_spec
2313 /* The name of the attribute (without any leading or trailing __),
2314 or NULL to mark the end of a table of attributes. */
2315 const char *const name
;
2316 /* The minimum length of the list of arguments of the attribute. */
2317 const int min_length
;
2318 /* The maximum length of the list of arguments of the attribute
2319 (-1 for no maximum). */
2320 const int max_length
;
2321 /* Whether this attribute requires a DECL. If it does, it will be passed
2322 from types of DECLs, function return types and array element types to
2323 the DECLs, function types and array types respectively; but when
2324 applied to a type in any other circumstances, it will be ignored with
2325 a warning. (If greater control is desired for a given attribute,
2326 this should be false, and the flags argument to the handler may be
2327 used to gain greater control in that case.) */
2328 const bool decl_required
;
2329 /* Whether this attribute requires a type. If it does, it will be passed
2330 from a DECL to the type of that DECL. */
2331 const bool type_required
;
2332 /* Whether this attribute requires a function (or method) type. If it does,
2333 it will be passed from a function pointer type to the target type,
2334 and from a function return type (which is not itself a function
2335 pointer type) to the function type. */
2336 const bool function_type_required
;
2337 /* Function to handle this attribute. NODE points to the node to which
2338 the attribute is to be applied. If a DECL, it should be modified in
2339 place; if a TYPE, a copy should be created. NAME is the name of the
2340 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2341 of the arguments (which may be NULL). FLAGS gives further information
2342 about the context of the attribute. Afterwards, the attributes will
2343 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2344 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2345 as well as in any other cases when the attributes should not be added
2346 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2347 applied to another type or DECL later may be returned;
2348 otherwise the return value should be NULL_TREE. This pointer may be
2349 NULL if no special handling is required beyond the checks implied
2350 by the rest of this structure. */
2351 tree (*const handler
) (tree
*node
, tree name
, tree args
,
2352 int flags
, bool *no_add_attrs
);
2355 /* Flags that may be passed in the third argument of decl_attributes, and
2356 to handler functions for attributes. */
2357 enum attribute_flags
2359 /* The type passed in is the type of a DECL, and any attributes that
2360 should be passed in again to be applied to the DECL rather than the
2361 type should be returned. */
2362 ATTR_FLAG_DECL_NEXT
= 1,
2363 /* The type passed in is a function return type, and any attributes that
2364 should be passed in again to be applied to the function type rather
2365 than the return type should be returned. */
2366 ATTR_FLAG_FUNCTION_NEXT
= 2,
2367 /* The type passed in is an array element type, and any attributes that
2368 should be passed in again to be applied to the array type rather
2369 than the element type should be returned. */
2370 ATTR_FLAG_ARRAY_NEXT
= 4,
2371 /* The type passed in is a structure, union or enumeration type being
2372 created, and should be modified in place. */
2373 ATTR_FLAG_TYPE_IN_PLACE
= 8,
2374 /* The attributes are being applied by default to a library function whose
2375 name indicates known behavior, and should be silently ignored if they
2376 are not in fact compatible with the function type. */
2377 ATTR_FLAG_BUILT_IN
= 16
2380 /* Default versions of target-overridable functions. */
2382 extern tree
merge_decl_attributes (tree
, tree
);
2383 extern tree
merge_type_attributes (tree
, tree
);
2384 extern void default_register_cpp_builtins (struct cpp_reader
*);
2386 /* Split a list of declspecs and attributes into two. */
2388 extern void split_specs_attrs (tree
, tree
*, tree
*);
2390 /* Strip attributes from a list of combined specs and attrs. */
2392 extern tree
strip_attrs (tree
);
2394 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2396 extern int valid_machine_attribute (tree
, tree
, tree
, tree
);
2398 /* Given a tree node and a string, return nonzero if the tree node is
2399 a valid attribute name for the string. */
2401 extern int is_attribute_p (const char *, tree
);
2403 /* Given an attribute name and a list of attributes, return the list element
2404 of the attribute or NULL_TREE if not found. */
2406 extern tree
lookup_attribute (const char *, tree
);
2408 /* Given two attributes lists, return a list of their union. */
2410 extern tree
merge_attributes (tree
, tree
);
2412 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2413 /* Given two Windows decl attributes lists, possibly including
2414 dllimport, return a list of their union . */
2415 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
2418 /* Check whether CAND is suitable to be returned from get_qualified_type
2419 (BASE, TYPE_QUALS). */
2421 extern bool check_qualified_type (tree
, tree
, int);
2423 /* Return a version of the TYPE, qualified as indicated by the
2424 TYPE_QUALS, if one exists. If no qualified version exists yet,
2425 return NULL_TREE. */
2427 extern tree
get_qualified_type (tree
, int);
2429 /* Like get_qualified_type, but creates the type if it does not
2430 exist. This function never returns NULL_TREE. */
2432 extern tree
build_qualified_type (tree
, int);
2434 /* Like build_qualified_type, but only deals with the `const' and
2435 `volatile' qualifiers. This interface is retained for backwards
2436 compatibility with the various front-ends; new code should use
2437 build_qualified_type instead. */
2439 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2440 build_qualified_type ((TYPE), \
2441 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2442 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2444 /* Make a copy of a type node. */
2446 extern tree
build_type_copy (tree
);
2448 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2449 fields. Optionally specify an alignment, and then lsy it out. */
2451 extern void finish_builtin_struct (tree
, const char *,
2454 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2455 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2456 node, does nothing except for the first time. */
2458 extern void layout_type (tree
);
2460 /* These functions allow a front-end to perform a manual layout of a
2461 RECORD_TYPE. (For instance, if the placement of subsequent fields
2462 depends on the placement of fields so far.) Begin by calling
2463 start_record_layout. Then, call place_field for each of the
2464 fields. Then, call finish_record_layout. See layout_type for the
2465 default way in which these functions are used. */
2467 typedef struct record_layout_info_s
2469 /* The RECORD_TYPE that we are laying out. */
2471 /* The offset into the record so far, in bytes, not including bits in
2474 /* The last known alignment of SIZE. */
2475 unsigned int offset_align
;
2476 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2478 /* The alignment of the record so far, in bits. */
2479 unsigned int record_align
;
2480 /* The alignment of the record so far, ignoring #pragma pack and
2481 __attribute__ ((packed)), in bits. */
2482 unsigned int unpacked_align
;
2483 /* The previous field layed out. */
2485 /* The static variables (i.e., class variables, as opposed to
2486 instance variables) encountered in T. */
2487 tree pending_statics
;
2488 /* Bits remaining in the current alignment group */
2489 int remaining_in_alignment
;
2490 /* True if we've seen a packed field that didn't have normal
2491 alignment anyway. */
2492 int packed_maybe_necessary
;
2493 } *record_layout_info
;
2495 extern void set_lang_adjust_rli (void (*) (record_layout_info
));
2496 extern record_layout_info
start_record_layout (tree
);
2497 extern tree
bit_from_pos (tree
, tree
);
2498 extern tree
byte_from_pos (tree
, tree
);
2499 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
2500 extern void normalize_offset (tree
*, tree
*, unsigned int);
2501 extern tree
rli_size_unit_so_far (record_layout_info
);
2502 extern tree
rli_size_so_far (record_layout_info
);
2503 extern void normalize_rli (record_layout_info
);
2504 extern void place_field (record_layout_info
, tree
);
2505 extern void compute_record_mode (tree
);
2506 extern void finish_record_layout (record_layout_info
, int);
2508 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2509 return a canonicalized ..._TYPE node, so that duplicates are not made.
2510 How the hash code is computed is up to the caller, as long as any two
2511 callers that could hash identical-looking type nodes agree. */
2513 extern tree
type_hash_canon (unsigned int, tree
);
2515 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2516 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2517 fields. Call this only once for any given decl node.
2519 Second argument is the boundary that this field can be assumed to
2520 be starting at (in bits). Zero means it can be assumed aligned
2521 on any boundary that may be needed. */
2523 extern void layout_decl (tree
, unsigned);
2525 /* Return the mode for data of a given size SIZE and mode class CLASS.
2526 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2527 The value is BLKmode if no other mode is found. This is like
2528 mode_for_size, but is passed a tree. */
2530 extern enum machine_mode
mode_for_size_tree (tree
, enum mode_class
, int);
2532 /* Return an expr equal to X but certainly not valid as an lvalue. */
2534 extern tree
non_lvalue (tree
);
2535 extern tree
pedantic_non_lvalue (tree
);
2537 extern tree
convert (tree
, tree
);
2538 extern unsigned int expr_align (tree
);
2539 extern tree
expr_first (tree
);
2540 extern tree
expr_last (tree
);
2541 extern int expr_length (tree
);
2542 extern tree
size_in_bytes (tree
);
2543 extern HOST_WIDE_INT
int_size_in_bytes (tree
);
2544 extern tree
bit_position (tree
);
2545 extern HOST_WIDE_INT
int_bit_position (tree
);
2546 extern tree
byte_position (tree
);
2547 extern HOST_WIDE_INT
int_byte_position (tree
);
2549 /* Define data structures, macros, and functions for handling sizes
2550 and the various types used to represent sizes. */
2554 SIZETYPE
, /* Normal representation of sizes in bytes. */
2555 SSIZETYPE
, /* Signed representation of sizes in bytes. */
2556 USIZETYPE
, /* Unsigned representation of sizes in bytes. */
2557 BITSIZETYPE
, /* Normal representation of sizes in bits. */
2558 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
2559 UBITSIZETYPE
, /* Unsigned representation of sizes in bits. */
2562 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
2564 #define sizetype sizetype_tab[(int) SIZETYPE]
2565 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2566 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2567 #define usizetype sizetype_tab[(int) USIZETYPE]
2568 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2569 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2571 extern tree
size_binop (enum tree_code
, tree
, tree
);
2572 extern tree
size_diffop (tree
, tree
);
2573 extern tree
size_int_wide (HOST_WIDE_INT
, enum size_type_kind
);
2574 extern tree
size_int_type_wide (HOST_WIDE_INT
, tree
);
2576 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2577 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2578 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2579 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2580 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2582 extern tree
round_up (tree
, int);
2583 extern tree
round_down (tree
, int);
2584 extern tree
get_pending_sizes (void);
2585 extern void put_pending_size (tree
);
2586 extern void put_pending_sizes (tree
);
2588 /* Type for sizes of data-type. */
2590 #define BITS_PER_UNIT_LOG \
2591 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2592 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2593 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2595 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2596 extern unsigned int maximum_field_alignment
;
2598 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2599 extern unsigned int set_alignment
;
2601 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2602 by making the last node in X point to Y.
2603 Returns X, except if X is 0 returns Y. */
2605 extern tree
chainon (tree
, tree
);
2607 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2609 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
2610 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
2612 /* Return the last tree node in a chain. */
2614 extern tree
tree_last (tree
);
2616 /* Reverse the order of elements in a chain, and return the new head. */
2618 extern tree
nreverse (tree
);
2620 /* Returns the length of a chain of nodes
2621 (number of chain pointers to follow before reaching a null pointer). */
2623 extern int list_length (tree
);
2625 /* Returns the number of FIELD_DECLs in a type. */
2627 extern int fields_length (tree
);
2629 /* Given an initializer INIT, return TRUE if INIT is zero or some
2630 aggregate of zeros. Otherwise return FALSE. */
2632 extern bool initializer_zerop (tree
);
2634 /* Given an initializer INIT, return TRUE if INIT is at least 3/4 zeros.
2635 Otherwise return FALSE. */
2637 extern int mostly_zeros_p (tree
);
2639 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2641 extern int integer_zerop (tree
);
2643 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2645 extern int integer_onep (tree
);
2647 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2648 all of whose significant bits are 1. */
2650 extern int integer_all_onesp (tree
);
2652 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2653 exactly one bit 1. */
2655 extern int integer_pow2p (tree
);
2657 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
2658 with a nonzero value. */
2660 extern int integer_nonzerop (tree
);
2662 /* staticp (tree x) is nonzero if X is a reference to data allocated
2663 at a fixed address in memory. */
2665 extern int staticp (tree
);
2667 /* Gets an error if argument X is not an lvalue.
2668 Also returns 1 if X is an lvalue, 0 if not. */
2670 extern int lvalue_or_else (tree
, const char *);
2672 /* save_expr (EXP) returns an expression equivalent to EXP
2673 but it can be used multiple times within context CTX
2674 and only evaluate EXP once. */
2676 extern tree
save_expr (tree
);
2678 /* Look inside EXPR and into any simple arithmetic operations. Return
2679 the innermost non-arithmetic node. */
2681 extern tree
skip_simple_arithmetic (tree
);
2683 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
2684 SAVE_EXPR. Return FALSE otherwise. */
2686 extern bool saved_expr_p (tree
);
2688 /* Returns the index of the first non-tree operand for CODE, or the number
2689 of operands if all are trees. */
2691 extern int first_rtl_op (enum tree_code
);
2693 /* Return which tree structure is used by T. */
2695 enum tree_node_structure_enum
tree_node_structure (tree
);
2697 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2698 can be used multiple times and will evaluate EXP in its entirety
2701 extern tree
unsave_expr (tree
);
2703 /* Reset EXP in place so that it can be expanded again. Does not
2704 recurse into subtrees. */
2706 extern void unsave_expr_1 (tree
);
2708 /* Return 0 if it is safe to evaluate EXPR multiple times,
2709 return 1 if it is safe if EXPR is unsaved afterward, or
2710 return 2 if it is completely unsafe. */
2711 extern int unsafe_for_reeval (tree
);
2713 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2714 or offset that depends on a field within a record.
2716 Note that we only allow such expressions within simple arithmetic
2719 extern bool contains_placeholder_p (tree
);
2721 /* This macro calls the above function but short-circuits the common
2722 case of a constant to save time. Also check for null. */
2724 #define CONTAINS_PLACEHOLDER_P(EXP) \
2725 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
2727 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
2728 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
2731 extern bool type_contains_placeholder_p (tree
);
2733 /* Return 1 if EXP contains any expressions that produce cleanups for an
2734 outer scope to deal with. Used by fold. */
2736 extern int has_cleanups (tree
);
2738 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2739 return a tree with all occurrences of references to F in a
2740 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2741 contains only arithmetic expressions. */
2743 extern tree
substitute_in_expr (tree
, tree
, tree
);
2745 /* This macro calls the above function but short-circuits the common
2746 case of a constant to save time and also checks for NULL. */
2748 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
2749 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
2751 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2752 for it within OBJ, a tree that is an object or a chain of references. */
2754 extern tree
substitute_placeholder_in_expr (tree
, tree
);
2756 /* This macro calls the above function but short-circuits the common
2757 case of a constant to save time and also checks for NULL. */
2759 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
2760 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
2761 : substitute_placeholder_in_expr (EXP, OBJ))
2763 /* variable_size (EXP) is like save_expr (EXP) except that it
2764 is for the special case of something that is part of a
2765 variable size for a data type. It makes special arrangements
2766 to compute the value at the right time when the data type
2767 belongs to a function parameter. */
2769 extern tree
variable_size (tree
);
2771 /* Given a type T, force elaboration of any SAVE_EXPRs used in the definition
2774 extern void force_type_save_exprs (tree
);
2776 /* stabilize_reference (EXP) returns a reference equivalent to EXP
2777 but it can be used multiple times
2778 and only evaluate the subexpressions once. */
2780 extern tree
stabilize_reference (tree
);
2782 /* Subroutine of stabilize_reference; this is called for subtrees of
2783 references. Any expression with side-effects must be put in a SAVE_EXPR
2784 to ensure that it is only evaluated once. */
2786 extern tree
stabilize_reference_1 (tree
);
2788 /* Return EXP, stripped of any conversions to wider types
2789 in such a way that the result of converting to type FOR_TYPE
2790 is the same as if EXP were converted to FOR_TYPE.
2791 If FOR_TYPE is 0, it signifies EXP's type. */
2793 extern tree
get_unwidened (tree
, tree
);
2795 /* Return OP or a simpler expression for a narrower value
2796 which can be sign-extended or zero-extended to give back OP.
2797 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2798 or 0 if the value should be sign-extended. */
2800 extern tree
get_narrower (tree
, int *);
2802 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2803 look for nested component-refs or array-refs at constant positions
2804 and find the ultimate containing object, which is returned. */
2806 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
2807 tree
*, enum machine_mode
*, int *, int *);
2809 /* Return 1 if T is an expression that get_inner_reference handles. */
2811 extern int handled_component_p (tree
);
2813 /* Given a DECL or TYPE, return the scope in which it was declared, or
2814 NUL_TREE if there is no containing scope. */
2816 extern tree
get_containing_scope (tree
);
2818 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2820 extern tree
decl_function_context (tree
);
2822 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2823 this _DECL with its context, or zero if none. */
2824 extern tree
decl_type_context (tree
);
2826 /* Given the FUNCTION_DECL for the current function,
2827 return zero if it is ok for this function to be inline.
2828 Otherwise return a warning message with a single %s
2829 for the function's name. */
2831 extern const char *function_cannot_inline_p (tree
);
2833 /* Return 1 if EXPR is the real constant zero. */
2834 extern int real_zerop (tree
);
2836 /* Declare commonly used variables for tree structure. */
2838 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2839 Zero means allow extended lvalues. */
2841 extern int pedantic_lvalues
;
2843 /* Nonzero means can safely call expand_expr now;
2844 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2846 extern int immediate_size_expand
;
2848 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2850 extern GTY(()) tree current_function_decl
;
2852 /* Nonzero means a FUNC_BEGIN label was emitted. */
2853 extern GTY(()) tree current_function_func_begin_label
;
2855 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2857 extern int all_types_permanent
;
2859 /* Exit a binding level. This function is provided by each language
2861 extern tree
poplevel (int, int, int);
2863 /* Declare a predefined function. Return the declaration. This function is
2864 provided by each language frontend. */
2865 extern tree
builtin_function (const char *, tree
, int, enum built_in_class
,
2866 const char *, tree
);
2869 extern unsigned crc32_string (unsigned, const char *);
2870 extern void clean_symbol_name (char *);
2871 extern tree
get_file_function_name_long (const char *);
2872 extern tree
get_set_constructor_bits (tree
, char *, int);
2873 extern tree
get_set_constructor_bytes (tree
, unsigned char *, int);
2874 extern tree
get_callee_fndecl (tree
);
2875 extern void change_decl_assembler_name (tree
, tree
);
2876 extern int type_num_arguments (tree
);
2877 extern tree
lhd_unsave_expr_now (tree
);
2878 extern bool associative_tree_code (enum tree_code
);
2879 extern bool commutative_tree_code (enum tree_code
);
2884 extern void expand_fixups (rtx
);
2885 extern tree
expand_start_stmt_expr (int);
2886 extern tree
expand_end_stmt_expr (tree
);
2887 extern void expand_expr_stmt (tree
);
2888 extern void expand_expr_stmt_value (tree
, int, int);
2889 extern int warn_if_unused_value (tree
);
2890 extern void expand_decl_init (tree
);
2891 extern void clear_last_expr (void);
2892 extern void expand_label (tree
);
2893 extern void expand_goto (tree
);
2894 extern void expand_asm (tree
, int);
2895 extern void expand_start_cond (tree
, int);
2896 extern void expand_end_cond (void);
2897 extern void expand_start_else (void);
2898 extern void expand_start_elseif (tree
);
2899 extern struct nesting
*expand_start_loop (int);
2900 extern struct nesting
*expand_start_loop_continue_elsewhere (int);
2901 extern struct nesting
*expand_start_null_loop (void);
2902 extern void expand_loop_continue_here (void);
2903 extern void expand_end_loop (void);
2904 extern void expand_end_null_loop (void);
2905 extern int expand_continue_loop (struct nesting
*);
2906 extern int expand_exit_loop (struct nesting
*);
2907 extern int expand_exit_loop_if_false (struct nesting
*,tree
);
2908 extern int expand_exit_loop_top_cond (struct nesting
*, tree
);
2909 extern int expand_exit_something (void);
2911 extern void expand_return (tree
);
2912 extern int optimize_tail_recursion (tree
, rtx
);
2913 extern void expand_start_bindings_and_block (int, tree
);
2914 #define expand_start_bindings(flags) \
2915 expand_start_bindings_and_block(flags, NULL_TREE)
2916 extern void expand_end_bindings (tree
, int, int);
2917 extern void warn_about_unused_variables (tree
);
2918 extern void start_cleanup_deferral (void);
2919 extern void end_cleanup_deferral (void);
2920 extern int is_body_block (tree
);
2922 extern int conditional_context (void);
2923 extern struct nesting
* current_nesting_level (void);
2924 extern tree
last_cleanup_this_contour (void);
2925 extern void expand_start_case (int, tree
, tree
, const char *);
2926 extern void expand_end_case_type (tree
, tree
);
2927 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
2928 extern int add_case_node (tree
, tree
, tree
, tree
*);
2929 extern int pushcase (tree
, tree (*) (tree
, tree
), tree
, tree
*);
2930 extern int pushcase_range (tree
, tree
, tree (*) (tree
, tree
), tree
, tree
*);
2931 extern void using_eh_for_cleanups (void);
2933 /* In fold-const.c */
2935 /* Fold constants as much as possible in an expression.
2936 Returns the simplified expression.
2937 Acts only on the top level of the expression;
2938 if the argument itself cannot be simplified, its
2939 subexpressions are not changed. */
2941 extern tree
fold (tree
);
2942 extern tree
fold_initializer (tree
);
2943 extern tree
fold_single_bit_test (enum tree_code
, tree
, tree
, tree
);
2945 extern int force_fit_type (tree
, int);
2946 extern int add_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2947 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2948 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
2949 extern int neg_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2950 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
2951 extern int mul_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2952 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2953 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
2954 extern void lshift_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2955 HOST_WIDE_INT
, unsigned int,
2956 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, int);
2957 extern void rshift_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2958 HOST_WIDE_INT
, unsigned int,
2959 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, int);
2960 extern void lrotate_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2961 HOST_WIDE_INT
, unsigned int,
2962 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
2963 extern void rrotate_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2964 HOST_WIDE_INT
, unsigned int,
2965 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
2967 extern int div_and_round_double (enum tree_code
, int, unsigned HOST_WIDE_INT
,
2968 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
,
2969 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
*,
2970 HOST_WIDE_INT
*, unsigned HOST_WIDE_INT
*,
2973 extern int operand_equal_p (tree
, tree
, int);
2974 extern tree
omit_one_operand (tree
, tree
, tree
);
2975 extern tree
invert_truthvalue (tree
);
2978 extern tree
fold_builtin (tree
);
2979 extern enum built_in_function
builtin_mathfn_code (tree
);
2980 extern tree
build_function_call_expr (tree
, tree
);
2981 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
2984 extern tree
strip_float_extensions (tree
);
2987 extern void record_component_aliases (tree
);
2988 extern HOST_WIDE_INT
get_alias_set (tree
);
2989 extern int alias_sets_conflict_p (HOST_WIDE_INT
, HOST_WIDE_INT
);
2990 extern int alias_sets_might_conflict_p (HOST_WIDE_INT
, HOST_WIDE_INT
);
2991 extern int readonly_fields_p (tree
);
2992 extern int objects_must_conflict_p (tree
, tree
);
2995 extern int really_constant_p (tree
);
2996 extern int int_fits_type_p (tree
, tree
);
2997 extern bool variably_modified_type_p (tree
);
2998 extern int tree_log2 (tree
);
2999 extern int tree_floor_log2 (tree
);
3000 extern int simple_cst_equal (tree
, tree
);
3001 extern unsigned int iterative_hash_expr (tree
, unsigned int);
3002 extern int compare_tree_int (tree
, unsigned HOST_WIDE_INT
);
3003 extern int type_list_equal (tree
, tree
);
3004 extern int chain_member (tree
, tree
);
3005 extern tree
type_hash_lookup (unsigned int, tree
);
3006 extern void type_hash_add (unsigned int, tree
);
3007 extern int simple_cst_list_equal (tree
, tree
);
3008 extern void dump_tree_statistics (void);
3009 extern void expand_function_end (void);
3010 extern void expand_function_start (tree
, int);
3011 extern void expand_pending_sizes (tree
);
3012 extern tree
reconstruct_complex_type (tree
, tree
);
3014 extern int real_onep (tree
);
3015 extern int real_twop (tree
);
3016 extern int real_minus_onep (tree
);
3017 extern void init_ttree (void);
3018 extern void build_common_tree_nodes (int);
3019 extern void build_common_tree_nodes_2 (int);
3020 extern tree
build_range_type (tree
, tree
, tree
);
3023 extern void setjmp_protect_args (void);
3024 extern void setjmp_protect (tree
);
3025 extern void expand_main_function (void);
3026 extern void init_dummy_function_start (void);
3027 extern void expand_dummy_function_end (void);
3028 extern void init_function_for_compilation (void);
3029 extern void allocate_struct_function (tree
);
3030 extern void init_function_start (tree
);
3031 extern void assign_parms (tree
);
3032 extern void put_var_into_stack (tree
, int);
3033 extern void flush_addressof (tree
);
3034 extern void uninitialized_vars_warning (tree
);
3035 extern void setjmp_args_warning (void);
3036 extern void mark_all_temps_used (void);
3037 extern void init_temp_slots (void);
3038 extern void combine_temp_slots (void);
3039 extern void free_temp_slots (void);
3040 extern void pop_temp_slots (void);
3041 extern void push_temp_slots (void);
3042 extern void preserve_temp_slots (rtx
);
3043 extern void preserve_rtl_expr_temps (tree
);
3044 extern int aggregate_value_p (tree
, tree
);
3045 extern void free_temps_for_rtl_expr (tree
);
3046 extern void instantiate_virtual_regs (tree
, rtx
);
3047 extern void unshare_all_rtl (tree
, rtx
);
3048 extern void push_function_context (void);
3049 extern void pop_function_context (void);
3050 extern void push_function_context_to (tree
);
3051 extern void pop_function_context_from (tree
);
3053 /* In print-rtl.c */
3055 extern void print_rtl (FILE *, rtx
);
3058 /* In print-tree.c */
3059 extern void debug_tree (tree
);
3061 extern void print_node (FILE *, const char *, tree
, int);
3062 extern void print_node_brief (FILE *, const char *, tree
, int);
3063 extern void indent_to (FILE *, int);
3067 extern rtx
expand_builtin_return_addr (enum built_in_function
, int, rtx
);
3068 extern void check_max_integer_computation_mode (tree
);
3071 extern void start_sequence_for_rtl_expr (tree
);
3072 extern rtx
emit_line_note (location_t
);
3076 /* Nonzero if this is a call to a `const' function. */
3078 /* Nonzero if this is a call to a `volatile' function. */
3079 #define ECF_NORETURN 2
3080 /* Nonzero if this is a call to malloc or a related function. */
3081 #define ECF_MALLOC 4
3082 /* Nonzero if it is plausible that this is a call to alloca. */
3083 #define ECF_MAY_BE_ALLOCA 8
3084 /* Nonzero if this is a call to a function that won't throw an exception. */
3085 #define ECF_NOTHROW 16
3086 /* Nonzero if this is a call to setjmp or a related function. */
3087 #define ECF_RETURNS_TWICE 32
3088 /* Nonzero if this is a call to `longjmp'. */
3089 #define ECF_LONGJMP 64
3090 /* Nonzero if this is a syscall that makes a new process in the image of
3092 #define ECF_FORK_OR_EXEC 128
3093 #define ECF_SIBCALL 256
3094 /* Nonzero if this is a call to "pure" function (like const function,
3095 but may read memory. */
3096 #define ECF_PURE 512
3097 /* Nonzero if this is a call to a function that returns with the stack
3098 pointer depressed. */
3099 #define ECF_SP_DEPRESSED 1024
3100 /* Nonzero if this call is known to always return. */
3101 #define ECF_ALWAYS_RETURN 2048
3102 /* Create libcall block around the call. */
3103 #define ECF_LIBCALL_BLOCK 4096
3105 extern int flags_from_decl_or_type (tree
);
3106 extern int call_expr_flags (tree
);
3108 extern int setjmp_call_p (tree
);
3109 extern bool alloca_call_p (tree
);
3113 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3114 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3115 it should be modified in place; if a TYPE, a copy should be created
3116 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3117 information, in the form of a bitwise OR of flags in enum attribute_flags
3118 from tree.h. Depending on these flags, some attributes may be
3119 returned to be applied at a later stage (for example, to apply
3120 a decl attribute to the declaration rather than to its type). */
3121 extern tree
decl_attributes (tree
*, tree
, int);
3123 /* In integrate.c */
3124 extern void save_for_inline (tree
);
3125 extern void set_decl_abstract_flags (tree
, int);
3126 extern void output_inline_function (tree
);
3127 extern void set_decl_origin_self (tree
);
3129 /* In stor-layout.c */
3130 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
3131 extern void fixup_signed_type (tree
);
3132 extern void internal_reference_types (void);
3135 extern void make_decl_rtl (tree
, const char *);
3136 extern void make_decl_one_only (tree
);
3137 extern int supports_one_only (void);
3138 extern void variable_section (tree
, int);
3139 enum tls_model
decl_tls_model (tree
);
3140 extern void resolve_unique_section (tree
, int, int);
3141 extern void mark_referenced (tree
);
3142 extern void notice_global_symbol (tree
);
3145 extern void emit_nop (void);
3146 extern void expand_computed_goto (tree
);
3147 extern bool parse_output_constraint (const char **, int, int, int,
3148 bool *, bool *, bool *);
3149 extern bool parse_input_constraint (const char **, int, int, int, int,
3150 const char * const *, bool *, bool *);
3151 extern void expand_asm_operands (tree
, tree
, tree
, tree
, int, location_t
);
3152 extern tree
resolve_asm_operand_names (tree
, tree
, tree
);
3153 extern int any_pending_cleanups (void);
3154 extern void init_stmt_for_function (void);
3155 extern void expand_start_target_temps (void);
3156 extern void expand_end_target_temps (void);
3157 extern void expand_elseif (tree
);
3158 extern void save_stack_pointer (void);
3159 extern void expand_decl (tree
);
3160 extern int expand_decl_cleanup (tree
, tree
);
3161 extern int expand_decl_cleanup_eh (tree
, tree
, int);
3162 extern void expand_anon_union_decl (tree
, tree
, tree
);
3163 extern HOST_WIDE_INT
all_cases_count (tree
, int *);
3164 extern void check_for_full_enumeration_handling (tree
);
3165 extern void declare_nonlocal_label (tree
);
3167 /* If KIND=='I', return a suitable global initializer (constructor) name.
3168 If KIND=='D', return a suitable global clean-up (destructor) name. */
3169 extern tree
get_file_function_name (int);
3171 /* Interface of the DWARF2 unwind info support. */
3173 /* Generate a new label for the CFI info to refer to. */
3175 extern char *dwarf2out_cfi_label (void);
3177 /* Entry point to update the canonical frame address (CFA). */
3179 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT
);
3181 /* Add the CFI for saving a register window. */
3183 extern void dwarf2out_window_save (const char *);
3185 /* Add a CFI to update the running total of the size of arguments pushed
3188 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT
);
3190 /* Entry point for saving a register to the stack. */
3192 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT
);
3194 /* Entry point for saving the return address in the stack. */
3196 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT
);
3198 /* Entry point for saving the return address in a register. */
3200 extern void dwarf2out_return_reg (const char *, unsigned);
3202 /* The type of a function that walks over tree structure. */
3204 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
3206 /* In tree-dump.c */
3208 /* Different tree dump places. When you add new tree dump places,
3209 extend the DUMP_FILES array in tree-dump.c */
3210 enum tree_dump_index
3212 TDI_all
, /* dump the whole translation unit */
3213 TDI_class
, /* dump class hierarchy */
3214 TDI_original
, /* dump each function before optimizing it */
3215 TDI_optimized
, /* dump each function after optimizing it */
3216 TDI_inlined
, /* dump each function after inlining
3221 /* Bit masks to control tree dumping. Not all values are applicable to
3222 all tree dumps. Add new ones at the end. When you define new
3223 values, extend the DUMP_OPTIONS array in tree-dump.c */
3224 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3225 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3227 typedef struct dump_info
*dump_info_p
;
3229 extern int dump_flag (dump_info_p
, int, tree
);
3230 extern int dump_enabled_p (enum tree_dump_index
);
3231 extern FILE *dump_begin (enum tree_dump_index
, int *);
3232 extern void dump_end (enum tree_dump_index
, FILE *);
3233 extern void dump_node (tree
, int, FILE *);
3234 extern int dump_switch_p (const char *);
3235 extern const char *dump_flag_name (enum tree_dump_index
);
3236 /* Assign the RTX to declaration. */
3238 extern void set_decl_rtl (tree
, rtx
);
3239 extern void set_decl_incoming_rtl (tree
, rtx
);
3241 /* Redefine abort to report an internal error w/o coredump, and
3242 reporting the location of the error in the source file. This logic
3243 is duplicated in rtl.h and tree.h because every file that needs the
3244 special abort includes one or both. toplev.h gets too few files,
3245 system.h gets too many. */
3247 extern void fancy_abort (const char *, int, const char *)
3249 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3251 /* Enum and arrays used for tree allocation stats.
3252 Keep in sync with tree.c:tree_node_kind_names. */
3272 extern int tree_node_counts
[];
3273 extern int tree_node_sizes
[];
3275 #endif /* GCC_TREE_H */