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 the tree-code class of an
60 #define IS_EXPR_CODE_CLASS(CLASS) (strchr ("<12ers", (CLASS)) != 0)
62 /* Returns nonzero iff NODE is an expression of some kind. */
64 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
66 /* Number of argument-words in each kind of tree-node. */
68 extern const unsigned char tree_code_length[];
69 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
71 /* Names of tree components. */
73 extern const char *const tree_code_name[];
75 /* Classify which part of the compiler has defined a given builtin function.
76 Note that we assume below that this is no more than two bits. */
85 /* Names for the above. */
86 extern const char *const built_in_class_names[4];
88 /* Codes that identify the various built in functions
89 so that expand_call can identify them quickly. */
91 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
92 enum built_in_function
94 #include "builtins.def"
96 /* Upper bound on non-language-specific builtins. */
101 /* Names for the above. */
102 extern const char *const built_in_names[(int) END_BUILTINS];
104 /* Helper macros for math builtins. */
106 #define BUILTIN_EXP10_P(FN) \
107 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
108 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
110 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
111 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
112 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
114 #define BUILTIN_SQRT_P(FN) \
115 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
117 #define BUILTIN_CBRT_P(FN) \
118 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
120 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
122 /* An array of _DECL trees for the above. */
123 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
124 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
126 /* The definition of tree nodes fills the next several pages. */
128 /* A tree node can represent a data type, a variable, an expression
129 or a statement. Each node has a TREE_CODE which says what kind of
130 thing it represents. Some common codes are:
131 INTEGER_TYPE -- represents a type of integers.
132 ARRAY_TYPE -- represents a type of pointer.
133 VAR_DECL -- represents a declared variable.
134 INTEGER_CST -- represents a constant integer value.
135 PLUS_EXPR -- represents a sum (an expression).
137 As for the contents of a tree node: there are some fields
138 that all nodes share. Each TREE_CODE has various special-purpose
139 fields as well. The fields of a node are never accessed directly,
140 always through accessor macros. */
142 /* Every kind of tree node starts with this structure,
143 so all nodes have these fields.
145 See the accessor macros, defined below, for documentation of the
148 struct tree_common GTY(())
153 ENUM_BITFIELD(tree_code) code : 8;
155 unsigned side_effects_flag : 1;
156 unsigned constant_flag : 1;
157 unsigned addressable_flag : 1;
158 unsigned volatile_flag : 1;
159 unsigned readonly_flag : 1;
160 unsigned unsigned_flag : 1;
161 unsigned asm_written_flag: 1;
162 unsigned unused_0 : 1;
164 unsigned used_flag : 1;
165 unsigned nothrow_flag : 1;
166 unsigned static_flag : 1;
167 unsigned public_flag : 1;
168 unsigned private_flag : 1;
169 unsigned protected_flag : 1;
170 unsigned deprecated_flag : 1;
171 unsigned unused_1 : 1;
173 unsigned lang_flag_0 : 1;
174 unsigned lang_flag_1 : 1;
175 unsigned lang_flag_2 : 1;
176 unsigned lang_flag_3 : 1;
177 unsigned lang_flag_4 : 1;
178 unsigned lang_flag_5 : 1;
179 unsigned lang_flag_6 : 1;
180 unsigned unused_2 : 1;
183 /* The following table lists the uses of each of the above flags and
184 for which types of nodes they are defined. Note that expressions
190 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
191 ..._TYPE, IDENTIFIER_NODE.
192 In a STMT_EXPR, it means we want the result of the enclosed
198 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
199 TREE_NO_UNUSED_WARNING in
200 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
202 TREE_LIST or TREE_VEC
203 TREE_CONSTANT_OVERFLOW in
204 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
205 TREE_SYMBOL_REFERENCED in
208 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
209 TREE_LIST elements of a block's cleanup list.
214 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
216 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
217 EXPR_WFL_EMIT_LINE_NOTE in
218 EXPR_WITH_FILE_LOCATION
224 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
242 TREE_THIS_VOLATILE in
262 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
263 SAVE_EXPR_NOPLACEHOLDER in
269 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
275 expressions, IDENTIFIER_NODE
280 CALL_EXPR, FUNCTION_DECL
292 /* Define accessors for the fields that all tree nodes have
293 (though some fields are not used for all kinds of nodes). */
295 /* The tree-code says what kind of node it is.
296 Codes are defined in tree.def. */
297 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
298 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
300 /* When checking is enabled, errors will be generated if a tree node
301 is accessed incorrectly. The macros abort with a fatal error. */
302 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
304 #define TREE_CHECK(T, CODE) __extension__ \
305 ({ const tree __t = (T); \
306 if (TREE_CODE (__t) != (CODE)) \
307 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
310 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
311 ({ const tree __t = (T); \
312 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
313 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
317 /* These checks have to be special cased. */
318 #define EXPR_CHECK(T) __extension__ \
319 ({ const tree __t = (T); \
320 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
321 if (!IS_EXPR_CODE_CLASS (__c)) \
322 tree_class_check_failed (__t, 'e', __FILE__, __LINE__, \
326 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
327 (*({const tree __t = (T); \
328 const int __i = (I); \
329 if (TREE_CODE (__t) != TREE_VEC) \
330 tree_check_failed (__t, TREE_VEC, \
331 __FILE__, __LINE__, __FUNCTION__); \
332 if (__i < 0 || __i >= __t->vec.length) \
333 tree_vec_elt_check_failed (__i, __t->vec.length, \
334 __FILE__, __LINE__, __FUNCTION__); \
335 &__t->vec.a[__i]; }))
337 /* Special checks for TREE_OPERANDs. */
338 #define TREE_OPERAND_CHECK(T, I) __extension__ \
339 (*({const tree __t = EXPR_CHECK (T); \
340 const int __i = (I); \
341 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
342 tree_operand_check_failed (__i, TREE_CODE (__t), \
343 __FILE__, __LINE__, __FUNCTION__); \
344 &__t->exp.operands[__i]; }))
346 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
347 (*({const tree __t = (T); \
348 const int __i = (I); \
349 if (TREE_CODE (__t) != CODE) \
350 tree_check_failed (__t, CODE, __FILE__, __LINE__, __FUNCTION__); \
351 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
352 tree_operand_check_failed (__i, (CODE), \
353 __FILE__, __LINE__, __FUNCTION__); \
354 &__t->exp.operands[__i]; }))
356 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
358 ({const tree __t = (T); \
359 const int __i = (I); \
360 if (TREE_CODE (__t) != (CODE)) \
361 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
362 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
363 tree_operand_check_failed (__i, (CODE), \
364 __FILE__, __LINE__, __FUNCTION__); \
365 &__t->exp.operands[__i]; }))
367 extern void tree_check_failed (const tree, enum tree_code,
368 const char *, int, const char *)
370 extern void tree_class_check_failed (const tree, int,
371 const char *, int, const char *)
373 extern void tree_vec_elt_check_failed (int, int, const char *,
377 extern void tree_operand_check_failed (int, enum tree_code,
378 const char *, int, const char *)
381 #else /* not ENABLE_TREE_CHECKING, or not gcc */
383 #define TREE_CHECK(T, CODE) (T)
384 #define TREE_CLASS_CHECK(T, CODE) (T)
385 #define EXPR_CHECK(T) (T)
386 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
387 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
388 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
389 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
393 #include "tree-check.h"
395 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't')
396 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd')
397 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c')
398 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's')
400 /* In all nodes that are expressions, this is the data type of the expression.
401 In POINTER_TYPE nodes, this is the type that the pointer points to.
402 In ARRAY_TYPE nodes, this is the type of the elements.
403 In VECTOR_TYPE nodes, this is the type of the elements. */
404 #define TREE_TYPE(NODE) ((NODE)->common.type)
406 /* Here is how primitive or already-canonicalized types' hash codes
408 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
410 /* A simple hash function for an arbitrary tree node. This must not be
411 used in hash tables which are saved to a PCH. */
412 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
414 /* Nodes are chained together for many purposes.
415 Types are chained together to record them for being output to the debugger
416 (see the function `chain_type').
417 Decls in the same scope are chained together to record the contents
419 Statement nodes for successive statements used to be chained together.
420 Often lists of things are represented by TREE_LIST nodes that
421 are chained together. */
423 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
425 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
426 that don't change the machine mode. */
428 #define STRIP_NOPS(EXP) \
429 while ((TREE_CODE (EXP) == NOP_EXPR \
430 || TREE_CODE (EXP) == CONVERT_EXPR \
431 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
432 && TREE_OPERAND (EXP, 0) != error_mark_node \
433 && (TYPE_MODE (TREE_TYPE (EXP)) \
434 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
435 (EXP) = TREE_OPERAND (EXP, 0)
437 /* Like STRIP_NOPS, but don't let the signedness change either. */
439 #define STRIP_SIGN_NOPS(EXP) \
440 while ((TREE_CODE (EXP) == NOP_EXPR \
441 || TREE_CODE (EXP) == CONVERT_EXPR \
442 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
443 && TREE_OPERAND (EXP, 0) != error_mark_node \
444 && (TYPE_MODE (TREE_TYPE (EXP)) \
445 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
446 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
447 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
448 (EXP) = TREE_OPERAND (EXP, 0)
450 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
452 #define STRIP_MAIN_TYPE_NOPS(EXP) \
453 while ((TREE_CODE (EXP) == NOP_EXPR \
454 || TREE_CODE (EXP) == CONVERT_EXPR \
455 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
456 && TREE_OPERAND (EXP, 0) != error_mark_node \
457 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
458 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
459 (EXP) = TREE_OPERAND (EXP, 0)
461 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
463 #define STRIP_TYPE_NOPS(EXP) \
464 while ((TREE_CODE (EXP) == NOP_EXPR \
465 || TREE_CODE (EXP) == CONVERT_EXPR \
466 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
467 && TREE_OPERAND (EXP, 0) != error_mark_node \
468 && (TREE_TYPE (EXP) \
469 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
470 (EXP) = TREE_OPERAND (EXP, 0)
472 /* Nonzero if TYPE represents an integral type. Note that we do not
473 include COMPLEX types here. */
475 #define INTEGRAL_TYPE_P(TYPE) \
476 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
477 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
479 /* Nonzero if TYPE represents a scalar floating-point type. */
481 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
483 /* Nonzero if TYPE represents a complex floating-point type. */
485 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
486 (TREE_CODE (TYPE) == COMPLEX_TYPE \
487 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
489 /* Nonzero if TYPE represents a floating-point type, including complex
490 floating-point types. */
492 #define FLOAT_TYPE_P(TYPE) \
493 (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE))
495 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
497 #define AGGREGATE_TYPE_P(TYPE) \
498 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
499 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
500 || TREE_CODE (TYPE) == SET_TYPE)
502 /* Nonzero if TYPE represents a pointer or reference type.
503 (It should be renamed to INDIRECT_TYPE_P.) */
505 #define POINTER_TYPE_P(TYPE) \
506 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
508 /* Nonzero if this type is a complete type. */
509 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
511 /* Nonzero if this type is the (possibly qualified) void type. */
512 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
514 /* Nonzero if this type is complete or is cv void. */
515 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
516 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
518 /* Nonzero if this type is complete or is an array with unspecified bound. */
519 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
520 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
522 /* Nonzero if TYPE represents a type. */
524 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
526 /* Define many boolean fields that all tree nodes have. */
528 /* In VAR_DECL nodes, nonzero means address of this is needed.
529 So it cannot be in a register.
530 In a FUNCTION_DECL, nonzero means its address is needed.
531 So it must be compiled even if it is an inline function.
532 In a FIELD_DECL node, it means that the programmer is permitted to
533 construct the address of this field. This is used for aliasing
534 purposes: see record_component_aliases.
535 In CONSTRUCTOR nodes, it means object constructed must be in memory.
536 In LABEL_DECL nodes, it means a goto for this label has been seen
537 from a place outside all binding contours that restore stack levels.
538 In ..._TYPE nodes, it means that objects of this type must
539 be fully addressable. This means that pieces of this
540 object cannot go into register parameters, for example.
541 In IDENTIFIER_NODEs, this means that some extern decl for this name
542 had its address taken. That matters for inline functions. */
543 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
545 /* In a VAR_DECL, nonzero means allocate static storage.
546 In a FUNCTION_DECL, nonzero if function has been defined.
547 In a CONSTRUCTOR, nonzero means allocate static storage. */
548 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
550 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
551 block's cleanup list, means that the pertinent cleanup should only be
552 executed if an exception is thrown, not on normal exit of its scope. */
553 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
555 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
556 made implicitly and should not lead to an "unused value" warning. */
557 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
559 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
560 chain is via a `virtual' declaration. */
561 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
563 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
564 there was an overflow in folding. This is distinct from
565 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
566 occur in constant expressions. */
567 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
569 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
570 this string as an argument. */
571 #define TREE_SYMBOL_REFERENCED(NODE) \
572 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
574 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
575 there was an overflow in folding, and no warning has been issued
576 for this subexpression. TREE_OVERFLOW implies
577 TREE_CONSTANT_OVERFLOW, but not vice versa. */
578 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
580 /* In a VAR_DECL or FUNCTION_DECL,
581 nonzero means name is to be accessible from outside this module.
582 In an IDENTIFIER_NODE, nonzero means an external declaration
583 accessible from outside this module was previously seen
584 for this name in an inner scope. */
585 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
587 /* In any expression, nonzero means it has side effects or reevaluation
588 of the whole expression could produce a different value.
589 This is set if any subexpression is a function call, a side effect
590 or a reference to a volatile variable.
591 In a ..._DECL, this is set only if the declaration said `volatile'. */
592 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
594 /* Nonzero means this expression is volatile in the C sense:
595 its address should be of type `volatile WHATEVER *'.
596 In other words, the declared item is volatile qualified.
597 This is used in _DECL nodes and _REF nodes.
599 In a ..._TYPE node, means this type is volatile-qualified.
600 But use TYPE_VOLATILE instead of this macro when the node is a type,
601 because eventually we may make that a different bit.
603 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
604 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
606 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
607 nonzero means it may not be the lhs of an assignment.
608 In a ..._TYPE node, means this type is const-qualified
609 (but the macro TYPE_READONLY should be used instead of this macro
610 when the node is a type). */
611 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
613 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
614 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE))
616 /* Value of expression is constant.
617 Always appears in all ..._CST nodes.
618 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
619 if the value is constant. */
620 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
622 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
623 In FIELD_DECL nodes, means an unsigned bit field. */
624 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
626 #define TYPE_TRAP_SIGNED(NODE) \
627 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE)))
629 /* Nonzero in a VAR_DECL means assembler code has been written.
630 Nonzero in a FUNCTION_DECL means that the function has been compiled.
631 This is interesting in an inline function, since it might not need
632 to be compiled separately.
633 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
634 if the sdb debugging info for the type has been written.
635 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
636 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
638 /* Nonzero in a _DECL if the name is used in its scope.
639 Nonzero in an expr node means inhibit warning if value is unused.
640 In IDENTIFIER_NODEs, this means that some extern decl for this name
642 #define TREE_USED(NODE) ((NODE)->common.used_flag)
644 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
645 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
646 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
648 /* In a CALL_EXPR, means that the address of the return slot is part of the
650 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
652 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
653 thunked-to function. */
654 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag)
656 /* In a type, nonzero means that all objects of the type are guaranteed by the
657 language or front-end to be properly aligned, so we can indicate that a MEM
658 of this type is aligned at least to the alignment of the type, even if it
659 doesn't appear that it is. We see this, for example, in object-oriented
660 languages where a tag field may show this is an object of a more-aligned
661 variant of the more generic type. */
662 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
664 /* Used in classes in C++. */
665 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
666 /* Used in classes in C++.
667 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
668 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
670 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
671 deprecated feature by __attribute__((deprecated)). */
672 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
674 /* These flags are available for each language front end to use internally. */
675 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
676 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
677 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
678 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
679 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
680 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
681 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
683 /* Define additional fields and accessors for nodes representing constants. */
685 /* In an INTEGER_CST node. These two together make a 2-word integer.
686 If the data type is signed, the value is sign-extended to 2 words
687 even though not all of them may really be in use.
688 In an unsigned constant shorter than 2 words, the extra bits are 0. */
689 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
690 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
691 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
693 #define INT_CST_LT(A, B) \
694 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
695 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
696 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
698 #define INT_CST_LT_UNSIGNED(A, B) \
699 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
700 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
701 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
702 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
703 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
705 struct tree_int_cst GTY(())
707 struct tree_common common;
708 /* A sub-struct is necessary here because the function `const_hash'
709 wants to scan both words as a unit and taking the address of the
710 sub-struct yields the properly inclusive bounded pointer. */
711 struct tree_int_cst_lowhi {
712 unsigned HOST_WIDE_INT low;
717 /* In a REAL_CST node. struct real_value is an opaque entity, with
718 manipulators defined in real.h. We don't want tree.h depending on
719 real.h and transitively on tm.h. */
722 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
723 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
725 struct tree_real_cst GTY(())
727 struct tree_common common;
728 struct real_value * real_cst_ptr;
731 /* In a STRING_CST */
732 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
733 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
735 struct tree_string GTY(())
737 struct tree_common common;
742 /* In a COMPLEX_CST node. */
743 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
744 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
746 struct tree_complex GTY(())
748 struct tree_common common;
753 /* In a VECTOR_CST node. */
754 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
756 struct tree_vector GTY(())
758 struct tree_common common;
762 #include "hashtable.h"
764 /* Define fields and accessors for some special-purpose tree nodes. */
766 #define IDENTIFIER_LENGTH(NODE) \
767 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
768 #define IDENTIFIER_POINTER(NODE) \
769 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
770 #define IDENTIFIER_HASH_VALUE(NODE) \
771 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
773 /* Translate a hash table identifier pointer to a tree_identifier
774 pointer, and vice versa. */
776 #define HT_IDENT_TO_GCC_IDENT(NODE) \
777 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
778 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
780 struct tree_identifier GTY(())
782 struct tree_common common;
783 struct ht_identifier id;
786 /* In a TREE_LIST node. */
787 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
788 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
790 struct tree_list GTY(())
792 struct tree_common common;
797 /* In a TREE_VEC node. */
798 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
799 #define TREE_VEC_END(NODE) \
800 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
802 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
804 struct tree_vec GTY(())
806 struct tree_common common;
808 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
811 /* Define fields and accessors for some nodes that represent expressions. */
813 /* In a SAVE_EXPR node. */
814 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1)
815 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2)
817 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE))
818 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
819 both in normal code and in a handler. (Normally, in a handler, all
820 SAVE_EXPRs are unsaved, meaning that their values are
822 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
824 /* In a RTL_EXPR node. */
825 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0)
826 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1)
827 #define RTL_EXPR_ALT_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 2)
829 /* In a WITH_CLEANUP_EXPR node. */
830 #define WITH_CLEANUP_EXPR_RTL(NODE) \
831 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2)
833 /* In a CONSTRUCTOR node. */
834 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
836 /* In ordinary expression nodes. */
837 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
838 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
840 /* In a LABELED_BLOCK_EXPR node. */
841 #define LABELED_BLOCK_LABEL(NODE) \
842 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
843 #define LABELED_BLOCK_BODY(NODE) \
844 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
846 /* In an EXIT_BLOCK_EXPR node. */
847 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
848 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
849 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
851 /* In a LOOP_EXPR node. */
852 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
854 /* In an EXPR_WITH_FILE_LOCATION node. */
855 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
856 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
857 #define EXPR_WFL_NODE(NODE) \
858 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 0)
859 #define EXPR_WFL_FILENAME_NODE(NODE) \
860 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 1)
861 #define EXPR_WFL_FILENAME(NODE) \
862 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE))
863 /* ??? Java uses this in all expressions. */
864 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
865 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
866 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
867 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
868 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
870 /* In a TARGET_EXPR node. */
871 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
872 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
873 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
875 struct tree_exp GTY(())
877 struct tree_common common;
879 tree GTY ((special ("tree_exp"),
880 desc ("TREE_CODE ((tree) &%0)")))
884 /* In a BLOCK node. */
885 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
886 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
887 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
888 /* Note: when changing this, make sure to find the places
889 that use chainon or nreverse. */
890 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
891 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
892 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
894 /* Nonzero means that this block is prepared to handle exceptions
895 listed in the BLOCK_VARS slot. */
896 #define BLOCK_HANDLER_BLOCK(NODE) \
897 (BLOCK_CHECK (NODE)->block.handler_block_flag)
899 /* An index number for this block. These values are not guaranteed to
900 be unique across functions -- whether or not they are depends on
901 the debugging output format in use. */
902 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
904 /* If block reordering splits a lexical block into discontiguous
905 address ranges, we'll make a copy of the original block.
907 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
908 In that case, we have one source block that has been replicated
909 (through inlining or unrolling) into many logical blocks, and that
910 these logical blocks have different physical variables in them.
912 In this case, we have one logical block split into several
913 non-contiguous address ranges. Most debug formats can't actually
914 represent this idea directly, so we fake it by creating multiple
915 logical blocks with the same variables in them. However, for those
916 that do support non-contiguous regions, these allow the original
917 logical block to be reconstructed, along with the set of address
920 One of the logical block fragments is arbitrarily chosen to be
921 the ORIGIN. The other fragments will point to the origin via
922 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
923 be null. The list of fragments will be chained through
924 BLOCK_FRAGMENT_CHAIN from the origin. */
926 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
927 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
929 struct tree_block GTY(())
931 struct tree_common common;
933 unsigned handler_block_flag : 1;
934 unsigned abstract_flag : 1;
935 unsigned block_num : 30;
940 tree abstract_origin;
941 tree fragment_origin;
945 /* Define fields and accessors for nodes representing data types. */
947 /* See tree.def for documentation of the use of these fields.
948 Look at the documentation of the various ..._TYPE tree codes. */
950 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
951 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
952 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
953 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
954 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
955 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
956 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
957 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
958 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
959 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
960 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
961 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
962 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
963 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
964 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
965 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
966 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
967 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
968 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
969 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
970 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
971 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
972 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
973 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
974 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
976 /* For a VECTOR_TYPE node, this describes a different type which is emitted
977 in the debugging output. We use this to describe a vector as a
978 structure containing an array. */
979 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
981 /* For aggregate types, information about this type, as a base type
982 for itself. Used in a language-dependent way for types that are
983 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
984 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
986 /* The (language-specific) typed-based alias set for this type.
987 Objects whose TYPE_ALIAS_SETs are different cannot alias each
988 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
989 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
990 type can alias objects of any type. */
991 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
993 /* Nonzero iff the typed-based alias set for this type has been
995 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
997 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
999 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1001 /* The alignment necessary for objects of this type.
1002 The value is an int, measured in bits. */
1003 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1005 /* 1 if the alignment for this type was requested by "aligned" attribute,
1006 0 if it is the default for this type. */
1007 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1009 /* The alignment for NODE, in bytes. */
1010 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1012 /* If your language allows you to declare types, and you want debug info
1013 for them, then you need to generate corresponding TYPE_DECL nodes.
1014 These "stub" TYPE_DECL nodes have no name, and simply point at the
1015 type node. You then set the TYPE_STUB_DECL field of the type node
1016 to point back at the TYPE_DECL node. This allows the debug routines
1017 to know that the two nodes represent the same type, so that we only
1018 get one debug info record for them. */
1019 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1021 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1022 has BLKmode only because it lacks the alignment requirement for
1024 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1026 /* In an INTEGER_TYPE, it means the type represents a size. We use
1027 this both for validity checking and to permit optimizations that
1028 are unsafe for other types. Note that the C `size_t' type should
1029 *not* have this flag set. The `size_t' type is simply a typedef
1030 for an ordinary integer type that happens to be the type of an
1031 expression returned by `sizeof'; `size_t' has no special
1032 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1033 always actual sizes. */
1034 #define TYPE_IS_SIZETYPE(NODE) \
1035 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1037 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1038 pointer depressed. */
1039 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1040 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1042 /* Nonzero in a type considered volatile as a whole. */
1043 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1045 /* Means this type is const-qualified. */
1046 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1048 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1050 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1052 /* There is a TYPE_QUAL value for each type qualifier. They can be
1053 combined by bitwise-or to form the complete set of qualifiers for a
1056 #define TYPE_UNQUALIFIED 0x0
1057 #define TYPE_QUAL_CONST 0x1
1058 #define TYPE_QUAL_VOLATILE 0x2
1059 #define TYPE_QUAL_RESTRICT 0x4
1061 /* The set of type qualifiers for this type. */
1062 #define TYPE_QUALS(NODE) \
1063 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1064 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1065 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1067 /* These flags are available for each language front end to use internally. */
1068 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1069 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1070 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1071 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1072 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1073 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1074 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1076 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1077 that distinguish string from array of char).
1078 If set in a SET_TYPE, indicates a bitstring type. */
1079 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1081 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1082 object of the given ARRAY_TYPE. This allows temporaries to be
1084 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1085 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE))
1087 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1088 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1089 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1091 /* Indicates that objects of this type must be initialized by calling a
1092 function when they are created. */
1093 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1094 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1096 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1097 the same way that the first union alternative would be passed. */
1098 #define TYPE_TRANSPARENT_UNION(NODE) \
1099 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1101 /* For an ARRAY_TYPE, indicates that it is not permitted to
1102 take the address of a component of the type. */
1103 #define TYPE_NONALIASED_COMPONENT(NODE) \
1104 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1106 /* Indicated that objects of this type should be laid out in as
1107 compact a way as possible. */
1108 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1112 struct tree_type GTY(())
1114 struct tree_common common;
1121 unsigned int precision : 9;
1122 ENUM_BITFIELD(machine_mode) mode : 7;
1124 unsigned string_flag : 1;
1125 unsigned no_force_blk_flag : 1;
1126 unsigned needs_constructing_flag : 1;
1127 unsigned transparent_union_flag : 1;
1128 unsigned packed_flag : 1;
1129 unsigned restrict_flag : 1;
1132 unsigned lang_flag_0 : 1;
1133 unsigned lang_flag_1 : 1;
1134 unsigned lang_flag_2 : 1;
1135 unsigned lang_flag_3 : 1;
1136 unsigned lang_flag_4 : 1;
1137 unsigned lang_flag_5 : 1;
1138 unsigned lang_flag_6 : 1;
1139 unsigned user_align : 1;
1144 union tree_type_symtab {
1145 int GTY ((tag ("0"))) address;
1146 char * GTY ((tag ("1"))) pointer;
1147 struct die_struct * GTY ((tag ("2"))) die;
1148 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1149 descbits ("2"))) symtab;
1157 HOST_WIDE_INT alias_set;
1158 /* Points to a structure whose details depend on the language in use. */
1159 struct lang_type *lang_specific;
1162 /* Define accessor macros for information about type inheritance
1165 A "basetype" means a particular usage of a data type for inheritance
1166 in another type. Each such basetype usage has its own "binfo"
1167 object to describe it. The binfo object is a TREE_VEC node.
1169 Inheritance is represented by the binfo nodes allocated for a
1170 given type. For example, given types C and D, such that D is
1171 inherited by C, 3 binfo nodes will be allocated: one for describing
1172 the binfo properties of C, similarly one for D, and one for
1173 describing the binfo properties of D as a base type for C.
1174 Thus, given a pointer to class C, one can get a pointer to the binfo
1175 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1177 /* The actual data type node being inherited in this basetype. */
1178 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1180 /* The offset where this basetype appears in its containing type.
1181 BINFO_OFFSET slot holds the offset (in bytes)
1182 from the base of the complete object to the base of the part of the
1183 object that is allocated on behalf of this `type'.
1184 This is always 0 except when there is multiple inheritance. */
1186 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1187 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1188 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1190 /* The virtual function table belonging to this basetype. Virtual
1191 function tables provide a mechanism for run-time method dispatching.
1192 The entries of a virtual function table are language-dependent. */
1194 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1195 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1197 /* The virtual functions in the virtual function table. This is
1198 a TREE_LIST that is used as an initial approximation for building
1199 a virtual function table for this basetype. */
1200 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1201 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1203 /* A vector of binfos for the direct basetypes inherited by this
1206 If this basetype describes type D as inherited in C, and if the
1207 basetypes of D are E and F, then this vector contains binfos for
1208 inheritance of E and F by C.
1210 ??? This could probably be done by just allocating the
1211 base types at the end of this TREE_VEC (instead of using
1212 another TREE_VEC). This would simplify the calculation
1213 of how many basetypes a given type had. */
1214 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1215 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1217 /* The number of basetypes for NODE. */
1218 #define BINFO_N_BASETYPES(NODE) \
1219 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1221 /* Accessor macro to get to the Nth basetype of this basetype. */
1222 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1223 #define TYPE_BINFO_BASETYPE(NODE,N) \
1224 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1226 /* For a BINFO record describing a virtual base class, i.e., one where
1227 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1228 base. The actual contents are language-dependent. In the C++
1229 front-end this field is an INTEGER_CST giving an offset into the
1230 vtable where the offset to the virtual base can be found. */
1231 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1233 /* Indicates the accesses this binfo has to its bases. The values are
1234 access_public_node, access_protected_node or access_private_node.
1235 If this array is not present, public access is implied. */
1236 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1237 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1239 /* Number of language independent elements in a binfo. Languages may
1240 add additional trailing elements. */
1242 #define BINFO_ELTS 7
1244 /* Slot used to build a chain that represents a use of inheritance.
1245 For example, if X is derived from Y, and Y is derived from Z,
1246 then this field can be used to link the binfo node for X to
1247 the binfo node for X's Y to represent the use of inheritance
1248 from X to Y. Similarly, this slot of the binfo node for X's Y
1249 can point to the Z from which Y is inherited (in X's inheritance
1250 hierarchy). In this fashion, one can represent and traverse specific
1251 uses of inheritance using the binfo nodes themselves (instead of
1252 consing new space pointing to binfo nodes).
1253 It is up to the language-dependent front-ends to maintain
1254 this information as necessary. */
1255 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1257 /* Define fields and accessors for nodes representing declared names. */
1259 /* Nonzero if DECL represents a decl. */
1260 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1262 /* This is the name of the object as written by the user.
1263 It is an IDENTIFIER_NODE. */
1264 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1266 /* The name of the object as the assembler will see it (but before any
1267 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1268 as DECL_NAME. It is an IDENTIFIER_NODE. */
1269 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1271 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1272 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1274 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1275 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1277 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1278 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1279 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1281 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1282 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1283 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1284 semantics of using this macro, are different than saying:
1286 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1288 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1290 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1291 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1292 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1293 DECL_ASSEMBLER_NAME (DECL1)) \
1296 /* Records the section name in a section attribute. Used to pass
1297 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1298 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1300 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1301 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1302 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1303 points to either the FUNCTION_DECL for the containing function,
1304 the RECORD_TYPE or UNION_TYPE for the containing type, or
1305 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1307 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1308 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1309 /* In a DECL this is the field where attributes are stored. */
1310 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1311 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1312 byte containing the bit closest to the beginning of the structure. */
1313 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1314 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1315 field from DECL_FIELD_OFFSET. */
1316 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1317 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1318 if so, the type that was originally specified for it.
1319 TREE_TYPE may have been modified (in finish_struct). */
1320 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1321 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1322 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1324 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1325 /* This field is used to reference anything in decl.result and is meant only
1326 for use by the garbage collector. */
1327 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1328 /* In FUNCTION_DECL, holds the decl for the return value. */
1329 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1330 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1331 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1332 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1333 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1334 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1335 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1336 For a VAR_DECL, holds the initial value.
1337 For a PARM_DECL, not used--default
1338 values for parameters are encoded in the type of the function,
1339 not in the PARM_DECL slot. */
1340 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1341 /* For a PARM_DECL, records the data type used to pass the argument,
1342 which may be different from the type seen in the program. */
1343 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1344 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1345 if nonzero, indicates that the field occupies the type. */
1346 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1347 /* These two fields describe where in the source code the declaration
1348 was. If the declaration appears in several places (as for a C
1349 function that is declared first and then defined later), this
1350 information should refer to the definition. */
1351 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1352 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1353 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1354 /* Holds the size of the datum, in bits, as a tree expression.
1355 Need not be constant. */
1356 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1357 /* Likewise for the size in bytes. */
1358 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1359 /* Holds the alignment required for the datum, in bits. */
1360 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1361 /* The alignment of NODE, in bytes. */
1362 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1363 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1364 DECL_FIELD_OFFSET which are known to be always zero.
1365 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1367 #define DECL_OFFSET_ALIGN(NODE) \
1368 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1369 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1370 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1371 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1372 /* 1 if the alignment for this type was requested by "aligned" attribute,
1373 0 if it is the default for this type. */
1374 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1375 /* Holds the machine mode corresponding to the declaration of a variable or
1376 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1378 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1379 /* Holds the RTL expression for the value of a variable or function.
1380 This value can be evaluated lazily for functions, variables with
1381 static storage duration, and labels. */
1382 #define DECL_RTL(NODE) \
1383 (DECL_CHECK (NODE)->decl.rtl \
1384 ? (NODE)->decl.rtl \
1385 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1386 /* Set the DECL_RTL for NODE to RTL. */
1387 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1388 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1389 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1390 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1391 NODE1, it will not be set for NODE2; this is a lazy copy. */
1392 #define COPY_DECL_RTL(NODE1, NODE2) \
1393 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1394 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1395 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1397 /* For PARM_DECL, holds an RTL for the stack slot or register
1398 where the data was actually passed. */
1399 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1401 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
1402 that describes the status of this function. */
1403 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1405 /* For FUNCTION_DECL, if it is built-in,
1406 this identifies which built-in operation it is. */
1407 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1409 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1410 Before the struct containing the FUNCTION_DECL is laid out,
1411 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1412 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1413 function. When the class is laid out, this pointer is changed
1414 to an INTEGER_CST node which is suitable for use as an index
1415 into the virtual function table. */
1416 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1418 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1419 which this FIELD_DECL is defined. This information is needed when
1420 writing debugging information about vfield and vbase decls for C++. */
1421 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1423 /* Every ..._DECL node gets a unique number. */
1424 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1426 /* For any sort of a ..._DECL node, this points to the original (abstract)
1427 decl node which this decl is an instance of, or else it is NULL indicating
1428 that this decl is not an instance of some other decl. For example,
1429 in a nested declaration of an inline function, this points back to the
1431 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1433 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1434 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1435 #define DECL_ORIGIN(NODE) \
1436 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1438 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1439 inline instance of some original (abstract) decl from an inline function;
1440 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1441 nodes can also have their abstract origin set to themselves. */
1442 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1443 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1445 /* Nonzero if a _DECL means that the name of this decl should be ignored
1446 for symbolic debug purposes. */
1447 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1449 /* Nonzero for a given ..._DECL node means that this node represents an
1450 "abstract instance" of the given declaration (e.g. in the original
1451 declaration of an inline function). When generating symbolic debugging
1452 information, we mustn't try to generate any address information for nodes
1453 marked as "abstract instances" because we don't actually generate
1454 any code or allocate any data space for such instances. */
1455 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1457 /* Nonzero if a _DECL means that no warnings should be generated just
1458 because this decl is unused. */
1459 #define DECL_IN_SYSTEM_HEADER(NODE) \
1460 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1462 /* Nonzero for a given ..._DECL node means that this node should be
1463 put in .common, if possible. If a DECL_INITIAL is given, and it
1464 is not error_mark_node, then the decl cannot be put in .common. */
1465 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1467 /* Language-specific decl information. */
1468 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1470 /* In a VAR_DECL or FUNCTION_DECL,
1471 nonzero means external reference:
1472 do not allocate storage, and refer to a definition elsewhere. */
1473 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1475 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1477 #define DEFAULT_INIT_PRIORITY 65535
1478 #define MAX_INIT_PRIORITY 65535
1479 #define MAX_RESERVED_INIT_PRIORITY 100
1482 nonzero means the detail info about this type is not dumped into stabs.
1483 Instead it will generate cross reference ('x') of names.
1484 This uses the same flag as DECL_EXTERNAL. */
1485 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1486 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1488 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1489 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1491 /* In LABEL_DECL nodes, nonzero means that an error message about
1492 jumping into such a binding contour has been printed for this label. */
1493 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1495 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1496 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1498 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1499 static chain is not needed. */
1500 #define DECL_NO_STATIC_CHAIN(NODE) \
1501 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1503 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1504 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1506 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1508 Also set in some languages for variables, etc., outside the normal
1509 lexical scope, such as class instance variables. */
1510 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1512 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1513 where it is called. */
1514 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1516 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
1517 such as via the `inline' keyword in C/C++. This flag controls the linkage
1518 semantics of 'inline'; whether or not the function is inlined is
1519 controlled by DECL_INLINE. */
1520 #define DECL_DECLARED_INLINE_P(NODE) \
1521 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
1523 /* Value of the decls's visibility attribute */
1524 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility)
1526 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1527 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1529 /* In a VAR_DECL, nonzero if the data should be allocated from
1530 thread-local storage. */
1531 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1533 /* In a FUNCTION_DECL, the saved representation of the body of the
1534 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1535 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1536 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1538 /* List of FUNCTION_DECLs inlined into this function's body. */
1539 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1541 /* Nonzero in a FUNCTION_DECL means this function should be treated
1542 as if it were a malloc, meaning it returns a pointer that is
1544 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1546 /* Nonzero in a FUNCTION_DECL means this function should be treated
1547 as "pure" function (like const function, but may read global memory). */
1548 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1550 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1552 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1554 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1555 contour that restored a stack level and which is now exited. */
1556 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1558 /* Unused in FUNCTION_DECL. */
1560 /* In a VAR_DECL that's static,
1561 nonzero if the space is in the text section. */
1562 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1564 /* In a FUNCTION_DECL, nonzero means a built in function. */
1565 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1567 /* For a builtin function, identify which part of the compiler defined it. */
1568 #define DECL_BUILT_IN_CLASS(NODE) \
1569 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1571 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1572 Used in FIELD_DECLs for vtable pointers.
1573 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1574 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1576 /* Used to indicate that the linkage status of this DECL is not yet known,
1577 so it should not be output now. */
1578 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1580 /* Used in PARM_DECLs whose type are unions to indicate that the
1581 argument should be passed in the same way that the first union
1582 alternative would be passed. */
1583 #define DECL_TRANSPARENT_UNION(NODE) \
1584 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1586 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1587 at the beginning or end of execution. */
1588 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1589 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1591 #define DECL_STATIC_DESTRUCTOR(NODE) \
1592 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1594 /* Used to indicate that this DECL represents a compiler-generated entity. */
1595 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1597 /* Used to indicate that this DECL has weak linkage. */
1598 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1600 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1601 multiple translation units should be merged. */
1602 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1604 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1605 not be put out unless it is needed in this translation unit.
1606 Entities like this are shared across translation units (like weak
1607 entities), but are guaranteed to be generated by any translation
1608 unit that needs them, and therefore need not be put out anywhere
1609 where they are not needed. DECL_COMDAT is just a hint to the
1610 back-end; it is up to front-ends which set this flag to ensure
1611 that there will never be any harm, other than bloat, in putting out
1612 something which is DECL_COMDAT. */
1613 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1615 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1616 be instrumented with calls to support routines. */
1617 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1618 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1620 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1621 disabled in this function. */
1622 #define DECL_NO_LIMIT_STACK(NODE) \
1623 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1625 /* Additional flags for language-specific uses. */
1626 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1627 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1628 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1629 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1630 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1631 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1632 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1633 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1635 /* Used to indicate that the pointer to this DECL cannot be treated as
1636 an address constant. */
1637 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1639 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1641 #define DECL_NONADDRESSABLE_P(NODE) \
1642 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1644 /* Used to indicate an alias set for the memory pointed to by this
1645 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1646 pointer (or reference) type. */
1647 #define DECL_POINTER_ALIAS_SET(NODE) \
1648 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1650 /* Nonzero if an alias set has been assigned to this declaration. */
1651 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1652 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1654 /* Nonzero for a decl which is at file scope. */
1655 #define DECL_FILE_SCOPE_P(EXP) \
1656 (! DECL_CONTEXT (EXP) \
1657 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
1659 /* Enumerate visibility settings. */
1661 enum symbol_visibility
1664 VISIBILITY_INTERNAL,
1666 VISIBILITY_PROTECTED
1671 struct tree_decl GTY(())
1673 struct tree_common common;
1677 ENUM_BITFIELD(machine_mode) mode : 8;
1679 unsigned external_flag : 1;
1680 unsigned nonlocal_flag : 1;
1681 unsigned regdecl_flag : 1;
1682 unsigned inline_flag : 1;
1683 unsigned bit_field_flag : 1;
1684 unsigned virtual_flag : 1;
1685 unsigned ignored_flag : 1;
1686 unsigned abstract_flag : 1;
1688 unsigned in_system_header_flag : 1;
1689 unsigned common_flag : 1;
1690 unsigned defer_output : 1;
1691 unsigned transparent_union : 1;
1692 unsigned static_ctor_flag : 1;
1693 unsigned static_dtor_flag : 1;
1694 unsigned artificial_flag : 1;
1695 unsigned weak_flag : 1;
1697 unsigned non_addr_const_p : 1;
1698 unsigned no_instrument_function_entry_exit : 1;
1699 unsigned comdat_flag : 1;
1700 unsigned malloc_flag : 1;
1701 unsigned no_limit_stack : 1;
1702 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1703 unsigned pure_flag : 1;
1705 unsigned non_addressable : 1;
1706 unsigned user_align : 1;
1707 unsigned uninlinable : 1;
1708 unsigned thread_local_flag : 1;
1709 unsigned declared_inline_flag : 1;
1710 ENUM_BITFIELD(symbol_visibility) visibility : 2;
1711 unsigned unused : 1;
1712 /* one unused bit. */
1714 unsigned lang_flag_0 : 1;
1715 unsigned lang_flag_1 : 1;
1716 unsigned lang_flag_2 : 1;
1717 unsigned lang_flag_3 : 1;
1718 unsigned lang_flag_4 : 1;
1719 unsigned lang_flag_5 : 1;
1720 unsigned lang_flag_6 : 1;
1721 unsigned lang_flag_7 : 1;
1723 union tree_decl_u1 {
1724 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1725 DECL_FUNCTION_CODE. */
1726 enum built_in_function f;
1727 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
1728 is used by language-dependent code. */
1730 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1732 struct tree_decl_u1_a {
1733 unsigned int align : 24;
1734 unsigned int off_align : 8;
1736 } GTY ((skip (""))) u1;
1741 tree arguments; /* Also used for DECL_FIELD_OFFSET */
1742 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
1743 tree initial; /* Also used for DECL_QUALIFIER */
1744 tree abstract_origin;
1745 tree assembler_name;
1748 rtx rtl; /* RTL representation for object. */
1750 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1751 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1752 In PARM_DECL, holds an RTL for the stack slot
1753 of register where the data was actually passed.
1754 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1755 union tree_decl_u2 {
1756 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
1757 rtx GTY ((tag ("PARM_DECL"))) r;
1758 tree GTY ((tag ("FIELD_DECL"))) t;
1759 int GTY ((tag ("VAR_DECL"))) i;
1760 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
1762 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1765 /* In a FUNCTION_DECL, these are function data which is to be kept
1766 as long as FUNCTION_DECL is kept. */
1770 HOST_WIDE_INT pointer_alias_set;
1771 /* Points to a structure whose details depend on the language in use. */
1772 struct lang_decl *lang_specific;
1775 enum tree_node_structure_enum {
1792 /* Define the overall contents of a tree node.
1793 It may be any of the structures declared above
1794 for various types of node. */
1796 union tree_node GTY ((ptr_alias (union lang_tree_node),
1797 desc ("tree_node_structure (&%h)")))
1799 struct tree_common GTY ((tag ("TS_COMMON"))) common;
1800 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
1801 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
1802 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
1803 struct tree_string GTY ((tag ("TS_STRING"))) string;
1804 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
1805 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
1806 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
1807 struct tree_type GTY ((tag ("TS_TYPE"))) type;
1808 struct tree_list GTY ((tag ("TS_LIST"))) list;
1809 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
1810 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
1811 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
1814 /* Standard named or nameless data types of the C compiler. */
1833 TI_INTEGER_MINUS_ONE,
1850 TI_COMPLEX_INTEGER_TYPE,
1851 TI_COMPLEX_FLOAT_TYPE,
1852 TI_COMPLEX_DOUBLE_TYPE,
1853 TI_COMPLEX_LONG_DOUBLE_TYPE,
1857 TI_LONG_DOUBLE_TYPE,
1861 TI_LONG_DOUBLE_PTR_TYPE,
1862 TI_INTEGER_PTR_TYPE,
1906 extern GTY(()) tree global_trees[TI_MAX];
1908 #define error_mark_node global_trees[TI_ERROR_MARK]
1910 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1911 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1912 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1913 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1914 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1916 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1917 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1918 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1919 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1920 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1922 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1923 #define integer_one_node global_trees[TI_INTEGER_ONE]
1924 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
1925 #define size_zero_node global_trees[TI_SIZE_ZERO]
1926 #define size_one_node global_trees[TI_SIZE_ONE]
1927 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1928 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1929 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1931 /* Base access nodes. */
1932 #define access_public_node global_trees[TI_PUBLIC]
1933 #define access_protected_node global_trees[TI_PROTECTED]
1934 #define access_private_node global_trees[TI_PRIVATE]
1936 #define null_pointer_node global_trees[TI_NULL_POINTER]
1938 #define float_type_node global_trees[TI_FLOAT_TYPE]
1939 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1940 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1942 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
1943 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
1944 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
1945 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
1947 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1948 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1949 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1950 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1952 #define void_type_node global_trees[TI_VOID_TYPE]
1953 /* The C type `void *'. */
1954 #define ptr_type_node global_trees[TI_PTR_TYPE]
1955 /* The C type `const void *'. */
1956 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1957 /* The C type `size_t'. */
1958 #define size_type_node global_trees[TI_SIZE_TYPE]
1959 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1960 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1962 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
1963 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
1964 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
1966 /* The node that should be placed at the end of a parameter list to
1967 indicate that the function does not take a variable number of
1968 arguments. The TREE_VALUE will be void_type_node and there will be
1969 no TREE_CHAIN. Language-independent code should not assume
1970 anything else about this node. */
1971 #define void_list_node global_trees[TI_VOID_LIST_NODE]
1973 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
1974 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
1976 #define unsigned_V16QI_type_node global_trees[TI_UV16QI_TYPE]
1977 #define unsigned_V4SI_type_node global_trees[TI_UV4SI_TYPE]
1978 #define unsigned_V8QI_type_node global_trees[TI_UV8QI_TYPE]
1979 #define unsigned_V8HI_type_node global_trees[TI_UV8HI_TYPE]
1980 #define unsigned_V4HI_type_node global_trees[TI_UV4HI_TYPE]
1981 #define unsigned_V2HI_type_node global_trees[TI_UV2HI_TYPE]
1982 #define unsigned_V2SI_type_node global_trees[TI_UV2SI_TYPE]
1983 #define unsigned_V2DI_type_node global_trees[TI_UV2DI_TYPE]
1984 #define unsigned_V1DI_type_node global_trees[TI_UV1DI_TYPE]
1986 #define V16QI_type_node global_trees[TI_V16QI_TYPE]
1987 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
1988 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
1989 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
1990 #define V8HI_type_node global_trees[TI_V8HI_TYPE]
1991 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
1992 #define V2HI_type_node global_trees[TI_V2HI_TYPE]
1993 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
1994 #define V2SF_type_node global_trees[TI_V2SF_TYPE]
1995 #define V2DI_type_node global_trees[TI_V2DI_TYPE]
1996 #define V2DF_type_node global_trees[TI_V2DF_TYPE]
1997 #define V16SF_type_node global_trees[TI_V16SF_TYPE]
1998 #define V1DI_type_node global_trees[TI_V1DI_TYPE]
1999 #define V4DF_type_node global_trees[TI_V4DF_TYPE]
2001 /* An enumeration of the standard C integer types. These must be
2002 ordered so that shorter types appear before longer ones, and so
2003 that signed types appear before unsigned ones, for the correct
2004 functioning of interpret_integer() in c-lex.c. */
2005 enum integer_type_kind
2017 itk_unsigned_long_long,
2021 typedef enum integer_type_kind integer_type_kind;
2023 /* The standard C integer types. Use integer_type_kind to index into
2025 extern GTY(()) tree integer_types[itk_none];
2027 #define char_type_node integer_types[itk_char]
2028 #define signed_char_type_node integer_types[itk_signed_char]
2029 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2030 #define short_integer_type_node integer_types[itk_short]
2031 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2032 #define integer_type_node integer_types[itk_int]
2033 #define unsigned_type_node integer_types[itk_unsigned_int]
2034 #define long_integer_type_node integer_types[itk_long]
2035 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2036 #define long_long_integer_type_node integer_types[itk_long_long]
2037 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2039 /* Set to the default thread-local storage (tls) model to use. */
2042 TLS_MODEL_GLOBAL_DYNAMIC = 1,
2043 TLS_MODEL_LOCAL_DYNAMIC,
2044 TLS_MODEL_INITIAL_EXEC,
2045 TLS_MODEL_LOCAL_EXEC
2048 extern enum tls_model flag_tls_default;
2051 /* A pointer-to-function member type looks like:
2058 If __pfn is NULL, it is a NULL pointer-to-member-function.
2060 (Because the vtable is always the first thing in the object, we
2061 don't need its offset.) If the function is virtual, then PFN is
2062 one plus twice the index into the vtable; otherwise, it is just a
2063 pointer to the function.
2065 Unfortunately, using the lowest bit of PFN doesn't work in
2066 architectures that don't impose alignment requirements on function
2067 addresses, or that use the lowest bit to tell one ISA from another,
2068 for example. For such architectures, we use the lowest bit of
2069 DELTA instead of the lowest bit of the PFN, and DELTA will be
2072 enum ptrmemfunc_vbit_where_t
2074 ptrmemfunc_vbit_in_pfn,
2075 ptrmemfunc_vbit_in_delta
2078 #define NULL_TREE (tree) NULL
2080 extern GTY(()) tree frame_base_decl;
2081 extern tree decl_assembler_name (tree);
2083 /* Compute the number of bytes occupied by 'node'. This routine only
2084 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2086 extern size_t tree_size (tree);
2088 /* Lowest level primitive for allocating a node.
2089 The TREE_CODE is the only argument. Contents are initialized
2090 to zero except for a few of the common fields. */
2092 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
2093 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
2095 /* Make a copy of a node, with all the same contents. */
2097 extern tree copy_node_stat (tree MEM_STAT_DECL);
2098 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
2100 /* Make a copy of a chain of TREE_LIST nodes. */
2102 extern tree copy_list (tree);
2104 /* Make a TREE_VEC. */
2106 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
2107 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
2109 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2110 The name is supplied as a char *. */
2112 extern tree get_identifier (const char *);
2114 #if GCC_VERSION >= 3000
2115 #define get_identifier(str) \
2116 (__builtin_constant_p (str) \
2117 ? get_identifier_with_length ((str), strlen (str)) \
2118 : get_identifier (str))
2122 /* Identical to get_identifier, except that the length is assumed
2125 extern tree get_identifier_with_length (const char *, size_t);
2127 /* If an identifier with the name TEXT (a null-terminated string) has
2128 previously been referred to, return that node; otherwise return
2131 extern tree maybe_get_identifier (const char *);
2133 /* Construct various types of nodes. */
2135 #define build_int_2(LO, HI) \
2136 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2138 extern tree build (enum tree_code, tree, ...);
2139 extern tree build_nt (enum tree_code, ...);
2141 #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L
2142 /* Use preprocessor trickery to map "build" to "buildN" where N is the
2143 expected number of arguments. This is used for both efficiency (no
2144 varargs), and checking (verifying number of passed arguments). */
2145 #define build(code, ...) \
2146 _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__)
2147 #define _buildN1(BASE, X) _buildN2(BASE, X)
2148 #define _buildN2(BASE, X) BASE##X
2149 #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0)
2150 #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c
2153 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
2154 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
2155 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2156 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
2157 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
2158 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
2159 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
2160 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
2161 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
2162 tree MEM_STAT_DECL);
2163 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
2165 extern tree build_int_2_wide (unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2166 extern tree build_vector (tree, tree);
2167 extern tree build_constructor (tree, tree);
2168 extern tree build_real_from_int_cst (tree, tree);
2169 extern tree build_complex (tree, tree, tree);
2170 extern tree build_string (int, const char *);
2171 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
2172 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
2173 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2174 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
2175 extern tree build_block (tree, tree, tree, tree, tree);
2176 extern tree build_expr_wfl (tree, const char *, int, int);
2178 /* Construct various nodes representing data types. */
2180 extern tree make_signed_type (int);
2181 extern tree make_unsigned_type (int);
2182 extern void initialize_sizetypes (void);
2183 extern void set_sizetype (tree);
2184 extern void fixup_unsigned_type (tree);
2185 extern tree build_pointer_type_for_mode (tree, enum machine_mode);
2186 extern tree build_pointer_type (tree);
2187 extern tree build_reference_type_for_mode (tree, enum machine_mode);
2188 extern tree build_reference_type (tree);
2189 extern tree build_type_no_quals (tree);
2190 extern tree build_index_type (tree);
2191 extern tree build_index_2_type (tree, tree);
2192 extern tree build_array_type (tree, tree);
2193 extern tree build_function_type (tree, tree);
2194 extern tree build_function_type_list (tree, ...);
2195 extern tree build_method_type_directly (tree, tree, tree);
2196 extern tree build_method_type (tree, tree);
2197 extern tree build_offset_type (tree, tree);
2198 extern tree build_complex_type (tree);
2199 extern tree array_type_nelts (tree);
2201 extern tree value_member (tree, tree);
2202 extern tree purpose_member (tree, tree);
2203 extern tree binfo_member (tree, tree);
2205 extern int attribute_list_equal (tree, tree);
2206 extern int attribute_list_contained (tree, tree);
2207 extern int tree_int_cst_equal (tree, tree);
2208 extern int tree_int_cst_lt (tree, tree);
2209 extern int tree_int_cst_compare (tree, tree);
2210 extern int host_integerp (tree, int);
2211 extern HOST_WIDE_INT tree_low_cst (tree, int);
2212 extern int tree_int_cst_msb (tree);
2213 extern int tree_int_cst_sgn (tree);
2214 extern int tree_expr_nonnegative_p (tree);
2215 extern int rtl_expr_nonnegative_p (rtx);
2216 extern tree get_inner_array_type (tree);
2218 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2219 put the prototype here. Rtl.h does declare the prototype if
2220 tree.h had been included. */
2222 extern tree make_tree (tree, rtx);
2224 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2227 Such modified types already made are recorded so that duplicates
2230 extern tree build_type_attribute_variant (tree, tree);
2231 extern tree build_decl_attribute_variant (tree, tree);
2233 /* Structure describing an attribute and a function to handle it. */
2234 struct attribute_spec
2236 /* The name of the attribute (without any leading or trailing __),
2237 or NULL to mark the end of a table of attributes. */
2238 const char *const name;
2239 /* The minimum length of the list of arguments of the attribute. */
2240 const int min_length;
2241 /* The maximum length of the list of arguments of the attribute
2242 (-1 for no maximum). */
2243 const int max_length;
2244 /* Whether this attribute requires a DECL. If it does, it will be passed
2245 from types of DECLs, function return types and array element types to
2246 the DECLs, function types and array types respectively; but when
2247 applied to a type in any other circumstances, it will be ignored with
2248 a warning. (If greater control is desired for a given attribute,
2249 this should be false, and the flags argument to the handler may be
2250 used to gain greater control in that case.) */
2251 const bool decl_required;
2252 /* Whether this attribute requires a type. If it does, it will be passed
2253 from a DECL to the type of that DECL. */
2254 const bool type_required;
2255 /* Whether this attribute requires a function (or method) type. If it does,
2256 it will be passed from a function pointer type to the target type,
2257 and from a function return type (which is not itself a function
2258 pointer type) to the function type. */
2259 const bool function_type_required;
2260 /* Function to handle this attribute. NODE points to the node to which
2261 the attribute is to be applied. If a DECL, it should be modified in
2262 place; if a TYPE, a copy should be created. NAME is the name of the
2263 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2264 of the arguments (which may be NULL). FLAGS gives further information
2265 about the context of the attribute. Afterwards, the attributes will
2266 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2267 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2268 as well as in any other cases when the attributes should not be added
2269 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2270 applied to another type or DECL later may be returned;
2271 otherwise the return value should be NULL_TREE. This pointer may be
2272 NULL if no special handling is required beyond the checks implied
2273 by the rest of this structure. */
2274 tree (*const handler) (tree *node, tree name, tree args,
2275 int flags, bool *no_add_attrs);
2278 /* Flags that may be passed in the third argument of decl_attributes, and
2279 to handler functions for attributes. */
2280 enum attribute_flags
2282 /* The type passed in is the type of a DECL, and any attributes that
2283 should be passed in again to be applied to the DECL rather than the
2284 type should be returned. */
2285 ATTR_FLAG_DECL_NEXT = 1,
2286 /* The type passed in is a function return type, and any attributes that
2287 should be passed in again to be applied to the function type rather
2288 than the return type should be returned. */
2289 ATTR_FLAG_FUNCTION_NEXT = 2,
2290 /* The type passed in is an array element type, and any attributes that
2291 should be passed in again to be applied to the array type rather
2292 than the element type should be returned. */
2293 ATTR_FLAG_ARRAY_NEXT = 4,
2294 /* The type passed in is a structure, union or enumeration type being
2295 created, and should be modified in place. */
2296 ATTR_FLAG_TYPE_IN_PLACE = 8,
2297 /* The attributes are being applied by default to a library function whose
2298 name indicates known behavior, and should be silently ignored if they
2299 are not in fact compatible with the function type. */
2300 ATTR_FLAG_BUILT_IN = 16
2303 /* Default versions of target-overridable functions. */
2305 extern tree merge_decl_attributes (tree, tree);
2306 extern tree merge_type_attributes (tree, tree);
2307 extern void default_register_cpp_builtins (struct cpp_reader *);
2309 /* Split a list of declspecs and attributes into two. */
2311 extern void split_specs_attrs (tree, tree *, tree *);
2313 /* Strip attributes from a list of combined specs and attrs. */
2315 extern tree strip_attrs (tree);
2317 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2319 extern int valid_machine_attribute (tree, tree, tree, tree);
2321 /* Given a tree node and a string, return nonzero if the tree node is
2322 a valid attribute name for the string. */
2324 extern int is_attribute_p (const char *, tree);
2326 /* Given an attribute name and a list of attributes, return the list element
2327 of the attribute or NULL_TREE if not found. */
2329 extern tree lookup_attribute (const char *, tree);
2331 /* Given two attributes lists, return a list of their union. */
2333 extern tree merge_attributes (tree, tree);
2335 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2336 /* Given two Windows decl attributes lists, possibly including
2337 dllimport, return a list of their union . */
2338 extern tree merge_dllimport_decl_attributes (tree, tree);
2341 /* Check whether CAND is suitable to be returned from get_qualified_type
2342 (BASE, TYPE_QUALS). */
2344 extern bool check_qualified_type (tree, tree, int);
2346 /* Return a version of the TYPE, qualified as indicated by the
2347 TYPE_QUALS, if one exists. If no qualified version exists yet,
2348 return NULL_TREE. */
2350 extern tree get_qualified_type (tree, int);
2352 /* Like get_qualified_type, but creates the type if it does not
2353 exist. This function never returns NULL_TREE. */
2355 extern tree build_qualified_type (tree, int);
2357 /* Like build_qualified_type, but only deals with the `const' and
2358 `volatile' qualifiers. This interface is retained for backwards
2359 compatibility with the various front-ends; new code should use
2360 build_qualified_type instead. */
2362 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2363 build_qualified_type ((TYPE), \
2364 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2365 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2367 /* Make a copy of a type node. */
2369 extern tree build_type_copy (tree);
2371 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2372 fields. Optionally specify an alignment, and then lsy it out. */
2374 extern void finish_builtin_struct (tree, const char *,
2377 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2378 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2379 node, does nothing except for the first time. */
2381 extern void layout_type (tree);
2383 /* These functions allow a front-end to perform a manual layout of a
2384 RECORD_TYPE. (For instance, if the placement of subsequent fields
2385 depends on the placement of fields so far.) Begin by calling
2386 start_record_layout. Then, call place_field for each of the
2387 fields. Then, call finish_record_layout. See layout_type for the
2388 default way in which these functions are used. */
2390 typedef struct record_layout_info_s
2392 /* The RECORD_TYPE that we are laying out. */
2394 /* The offset into the record so far, in bytes, not including bits in
2397 /* The last known alignment of SIZE. */
2398 unsigned int offset_align;
2399 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2401 /* The alignment of the record so far, in bits. */
2402 unsigned int record_align;
2403 /* The alignment of the record so far, ignoring #pragma pack and
2404 __attribute__ ((packed)), in bits. */
2405 unsigned int unpacked_align;
2406 /* The previous field layed out. */
2408 /* The static variables (i.e., class variables, as opposed to
2409 instance variables) encountered in T. */
2410 tree pending_statics;
2411 /* Bits remaining in the current alignment group */
2412 int remaining_in_alignment;
2413 /* True if we've seen a packed field that didn't have normal
2414 alignment anyway. */
2415 int packed_maybe_necessary;
2416 } *record_layout_info;
2418 extern void set_lang_adjust_rli (void (*) (record_layout_info));
2419 extern record_layout_info start_record_layout (tree);
2420 extern tree bit_from_pos (tree, tree);
2421 extern tree byte_from_pos (tree, tree);
2422 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
2423 extern void normalize_offset (tree *, tree *, unsigned int);
2424 extern tree rli_size_unit_so_far (record_layout_info);
2425 extern tree rli_size_so_far (record_layout_info);
2426 extern void normalize_rli (record_layout_info);
2427 extern void place_field (record_layout_info, tree);
2428 extern void compute_record_mode (tree);
2429 extern void finish_record_layout (record_layout_info, int);
2431 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2432 return a canonicalized ..._TYPE node, so that duplicates are not made.
2433 How the hash code is computed is up to the caller, as long as any two
2434 callers that could hash identical-looking type nodes agree. */
2436 extern tree type_hash_canon (unsigned int, tree);
2438 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2439 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2440 fields. Call this only once for any given decl node.
2442 Second argument is the boundary that this field can be assumed to
2443 be starting at (in bits). Zero means it can be assumed aligned
2444 on any boundary that may be needed. */
2446 extern void layout_decl (tree, unsigned);
2448 /* Return the mode for data of a given size SIZE and mode class CLASS.
2449 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2450 The value is BLKmode if no other mode is found. This is like
2451 mode_for_size, but is passed a tree. */
2453 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
2455 /* Return an expr equal to X but certainly not valid as an lvalue. */
2457 extern tree non_lvalue (tree);
2458 extern tree pedantic_non_lvalue (tree);
2460 extern tree convert (tree, tree);
2461 extern unsigned int expr_align (tree);
2462 extern tree expr_first (tree);
2463 extern tree expr_last (tree);
2464 extern int expr_length (tree);
2465 extern tree size_in_bytes (tree);
2466 extern HOST_WIDE_INT int_size_in_bytes (tree);
2467 extern tree bit_position (tree);
2468 extern HOST_WIDE_INT int_bit_position (tree);
2469 extern tree byte_position (tree);
2470 extern HOST_WIDE_INT int_byte_position (tree);
2472 /* Define data structures, macros, and functions for handling sizes
2473 and the various types used to represent sizes. */
2477 SIZETYPE, /* Normal representation of sizes in bytes. */
2478 SSIZETYPE, /* Signed representation of sizes in bytes. */
2479 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2480 BITSIZETYPE, /* Normal representation of sizes in bits. */
2481 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2482 UBITSIZETYPE, /* Unsigned representation of sizes in bits. */
2485 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
2487 #define sizetype sizetype_tab[(int) SIZETYPE]
2488 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2489 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2490 #define usizetype sizetype_tab[(int) USIZETYPE]
2491 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2492 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2494 extern tree size_binop (enum tree_code, tree, tree);
2495 extern tree size_diffop (tree, tree);
2496 extern tree size_int_wide (HOST_WIDE_INT, enum size_type_kind);
2497 extern tree size_int_type_wide (HOST_WIDE_INT, tree);
2499 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2500 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2501 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2502 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2503 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2505 extern tree round_up (tree, int);
2506 extern tree round_down (tree, int);
2507 extern tree get_pending_sizes (void);
2508 extern void put_pending_size (tree);
2509 extern void put_pending_sizes (tree);
2511 /* Type for sizes of data-type. */
2513 #define BITS_PER_UNIT_LOG \
2514 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2515 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2516 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2518 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2519 extern unsigned int maximum_field_alignment;
2521 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2522 extern unsigned int set_alignment;
2524 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2525 by making the last node in X point to Y.
2526 Returns X, except if X is 0 returns Y. */
2528 extern tree chainon (tree, tree);
2530 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2532 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
2533 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
2535 /* Return the last tree node in a chain. */
2537 extern tree tree_last (tree);
2539 /* Reverse the order of elements in a chain, and return the new head. */
2541 extern tree nreverse (tree);
2543 /* Returns the length of a chain of nodes
2544 (number of chain pointers to follow before reaching a null pointer). */
2546 extern int list_length (tree);
2548 /* Returns the number of FIELD_DECLs in a type. */
2550 extern int fields_length (tree);
2552 /* Given an initializer INIT, return TRUE if INIT is zero or some
2553 aggregate of zeros. Otherwise return FALSE. */
2555 extern bool initializer_zerop (tree);
2557 /* Given an initializer INIT, return TRUE if INIT is at least 3/4 zeros.
2558 Otherwise return FALSE. */
2560 extern int mostly_zeros_p (tree);
2562 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2564 extern int integer_zerop (tree);
2566 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2568 extern int integer_onep (tree);
2570 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2571 all of whose significant bits are 1. */
2573 extern int integer_all_onesp (tree);
2575 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2576 exactly one bit 1. */
2578 extern int integer_pow2p (tree);
2580 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
2581 with a nonzero value. */
2583 extern int integer_nonzerop (tree);
2585 /* staticp (tree x) is nonzero if X is a reference to data allocated
2586 at a fixed address in memory. */
2588 extern int staticp (tree);
2590 /* Gets an error if argument X is not an lvalue.
2591 Also returns 1 if X is an lvalue, 0 if not. */
2593 extern int lvalue_or_else (tree, const char *);
2595 /* save_expr (EXP) returns an expression equivalent to EXP
2596 but it can be used multiple times within context CTX
2597 and only evaluate EXP once. */
2599 extern tree save_expr (tree);
2601 /* Look inside EXPR and into any simple arithmetic operations. Return
2602 the innermost non-arithmetic node. */
2604 extern tree skip_simple_arithmetic (tree);
2606 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
2607 SAVE_EXPR. Return FALSE otherwise. */
2609 extern bool saved_expr_p (tree);
2611 /* Returns the index of the first non-tree operand for CODE, or the number
2612 of operands if all are trees. */
2614 extern int first_rtl_op (enum tree_code);
2616 /* Return which tree structure is used by T. */
2618 enum tree_node_structure_enum tree_node_structure (tree);
2620 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2621 can be used multiple times and will evaluate EXP in its entirety
2624 extern tree unsave_expr (tree);
2626 /* Reset EXP in place so that it can be expanded again. Does not
2627 recurse into subtrees. */
2629 extern void unsave_expr_1 (tree);
2631 /* Return 0 if it is safe to evaluate EXPR multiple times,
2632 return 1 if it is safe if EXPR is unsaved afterward, or
2633 return 2 if it is completely unsafe. */
2634 extern int unsafe_for_reeval (tree);
2636 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2637 or offset that depends on a field within a record.
2639 Note that we only allow such expressions within simple arithmetic
2642 extern bool contains_placeholder_p (tree);
2644 /* This macro calls the above function but short-circuits the common
2645 case of a constant to save time. Also check for null. */
2647 #define CONTAINS_PLACEHOLDER_P(EXP) \
2648 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
2650 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
2651 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
2654 extern bool type_contains_placeholder_p (tree);
2656 /* Return 1 if EXP contains any expressions that produce cleanups for an
2657 outer scope to deal with. Used by fold. */
2659 extern int has_cleanups (tree);
2661 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2662 return a tree with all occurrences of references to F in a
2663 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2664 contains only arithmetic expressions. */
2666 extern tree substitute_in_expr (tree, tree, tree);
2668 /* variable_size (EXP) is like save_expr (EXP) except that it
2669 is for the special case of something that is part of a
2670 variable size for a data type. It makes special arrangements
2671 to compute the value at the right time when the data type
2672 belongs to a function parameter. */
2674 extern tree variable_size (tree);
2676 /* stabilize_reference (EXP) returns a reference equivalent to EXP
2677 but it can be used multiple times
2678 and only evaluate the subexpressions once. */
2680 extern tree stabilize_reference (tree);
2682 /* Subroutine of stabilize_reference; this is called for subtrees of
2683 references. Any expression with side-effects must be put in a SAVE_EXPR
2684 to ensure that it is only evaluated once. */
2686 extern tree stabilize_reference_1 (tree);
2688 /* Return EXP, stripped of any conversions to wider types
2689 in such a way that the result of converting to type FOR_TYPE
2690 is the same as if EXP were converted to FOR_TYPE.
2691 If FOR_TYPE is 0, it signifies EXP's type. */
2693 extern tree get_unwidened (tree, tree);
2695 /* Return OP or a simpler expression for a narrower value
2696 which can be sign-extended or zero-extended to give back OP.
2697 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2698 or 0 if the value should be sign-extended. */
2700 extern tree get_narrower (tree, int *);
2702 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2703 look for nested component-refs or array-refs at constant positions
2704 and find the ultimate containing object, which is returned. */
2706 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
2707 tree *, enum machine_mode *, int *, int *);
2709 /* Return 1 if T is an expression that get_inner_reference handles. */
2711 extern int handled_component_p (tree);
2713 /* Given a DECL or TYPE, return the scope in which it was declared, or
2714 NUL_TREE if there is no containing scope. */
2716 extern tree get_containing_scope (tree);
2718 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2720 extern tree decl_function_context (tree);
2722 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2723 this _DECL with its context, or zero if none. */
2724 extern tree decl_type_context (tree);
2726 /* Given the FUNCTION_DECL for the current function,
2727 return zero if it is ok for this function to be inline.
2728 Otherwise return a warning message with a single %s
2729 for the function's name. */
2731 extern const char *function_cannot_inline_p (tree);
2733 /* Return 1 if EXPR is the real constant zero. */
2734 extern int real_zerop (tree);
2736 /* Declare commonly used variables for tree structure. */
2738 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2739 Zero means allow extended lvalues. */
2741 extern int pedantic_lvalues;
2743 /* Nonzero means can safely call expand_expr now;
2744 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2746 extern int immediate_size_expand;
2748 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2750 extern GTY(()) tree current_function_decl;
2752 /* Nonzero means a FUNC_BEGIN label was emitted. */
2753 extern GTY(()) tree current_function_func_begin_label;
2755 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2757 extern int all_types_permanent;
2759 /* Exit a binding level. This function is provided by each language
2761 extern tree poplevel (int, int, int);
2763 /* Declare a predefined function. Return the declaration. This function is
2764 provided by each language frontend. */
2765 extern tree builtin_function (const char *, tree, int, enum built_in_class,
2766 const char *, tree);
2769 extern unsigned crc32_string (unsigned, const char *);
2770 extern void clean_symbol_name (char *);
2771 extern tree get_file_function_name_long (const char *);
2772 extern tree get_set_constructor_bits (tree, char *, int);
2773 extern tree get_set_constructor_bytes (tree, unsigned char *, int);
2774 extern tree get_callee_fndecl (tree);
2775 extern void change_decl_assembler_name (tree, tree);
2776 extern int type_num_arguments (tree);
2777 extern tree lhd_unsave_expr_now (tree);
2778 extern bool associative_tree_code (enum tree_code);
2779 extern bool commutative_tree_code (enum tree_code);
2784 extern void expand_fixups (rtx);
2785 extern tree expand_start_stmt_expr (int);
2786 extern tree expand_end_stmt_expr (tree);
2787 extern void expand_expr_stmt (tree);
2788 extern void expand_expr_stmt_value (tree, int, int);
2789 extern int warn_if_unused_value (tree);
2790 extern void expand_decl_init (tree);
2791 extern void clear_last_expr (void);
2792 extern void expand_label (tree);
2793 extern void expand_goto (tree);
2794 extern void expand_asm (tree, int);
2795 extern void expand_start_cond (tree, int);
2796 extern void expand_end_cond (void);
2797 extern void expand_start_else (void);
2798 extern void expand_start_elseif (tree);
2799 extern struct nesting *expand_start_loop (int);
2800 extern struct nesting *expand_start_loop_continue_elsewhere (int);
2801 extern struct nesting *expand_start_null_loop (void);
2802 extern void expand_loop_continue_here (void);
2803 extern void expand_end_loop (void);
2804 extern void expand_end_null_loop (void);
2805 extern int expand_continue_loop (struct nesting *);
2806 extern int expand_exit_loop (struct nesting *);
2807 extern int expand_exit_loop_if_false (struct nesting *,tree);
2808 extern int expand_exit_loop_top_cond (struct nesting *, tree);
2809 extern int expand_exit_something (void);
2811 extern void expand_return (tree);
2812 extern int optimize_tail_recursion (tree, rtx);
2813 extern void expand_start_bindings_and_block (int, tree);
2814 #define expand_start_bindings(flags) \
2815 expand_start_bindings_and_block(flags, NULL_TREE)
2816 extern void expand_end_bindings (tree, int, int);
2817 extern void warn_about_unused_variables (tree);
2818 extern void start_cleanup_deferral (void);
2819 extern void end_cleanup_deferral (void);
2820 extern int is_body_block (tree);
2822 extern int conditional_context (void);
2823 extern struct nesting * current_nesting_level (void);
2824 extern tree last_cleanup_this_contour (void);
2825 extern void expand_start_case (int, tree, tree, const char *);
2826 extern void expand_end_case_type (tree, tree);
2827 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
2828 extern int add_case_node (tree, tree, tree, tree *);
2829 extern int pushcase (tree, tree (*) (tree, tree), tree, tree *);
2830 extern int pushcase_range (tree, tree, tree (*) (tree, tree), tree, tree *);
2831 extern void using_eh_for_cleanups (void);
2833 /* In fold-const.c */
2835 /* Fold constants as much as possible in an expression.
2836 Returns the simplified expression.
2837 Acts only on the top level of the expression;
2838 if the argument itself cannot be simplified, its
2839 subexpressions are not changed. */
2841 extern tree fold (tree);
2842 extern tree fold_initializer (tree);
2843 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
2845 extern int force_fit_type (tree, int);
2846 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2847 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2848 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2849 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2850 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2851 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2852 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2853 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2854 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2855 HOST_WIDE_INT, unsigned int,
2856 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
2857 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2858 HOST_WIDE_INT, unsigned int,
2859 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
2860 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2861 HOST_WIDE_INT, unsigned int,
2862 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2863 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2864 HOST_WIDE_INT, unsigned int,
2865 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2867 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
2868 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
2869 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
2870 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
2873 extern int operand_equal_p (tree, tree, int);
2874 extern tree omit_one_operand (tree, tree, tree);
2875 extern tree invert_truthvalue (tree);
2878 extern tree fold_builtin (tree);
2879 extern enum built_in_function builtin_mathfn_code (tree);
2880 extern tree build_function_call_expr (tree, tree);
2881 extern tree mathfn_built_in (tree, enum built_in_function fn);
2884 extern tree strip_float_extensions (tree);
2887 extern void record_component_aliases (tree);
2888 extern HOST_WIDE_INT get_alias_set (tree);
2889 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
2890 extern int readonly_fields_p (tree);
2891 extern int objects_must_conflict_p (tree, tree);
2894 extern int really_constant_p (tree);
2895 extern int int_fits_type_p (tree, tree);
2896 extern bool variably_modified_type_p (tree);
2897 extern int tree_log2 (tree);
2898 extern int tree_floor_log2 (tree);
2899 extern int simple_cst_equal (tree, tree);
2900 extern unsigned int iterative_hash_expr (tree, unsigned int);
2901 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
2902 extern int type_list_equal (tree, tree);
2903 extern int chain_member (tree, tree);
2904 extern tree type_hash_lookup (unsigned int, tree);
2905 extern void type_hash_add (unsigned int, tree);
2906 extern int simple_cst_list_equal (tree, tree);
2907 extern void dump_tree_statistics (void);
2908 extern void expand_function_end (void);
2909 extern void expand_function_start (tree, int);
2910 extern void expand_pending_sizes (tree);
2911 extern tree make_vector (enum machine_mode, tree, int);
2912 extern tree reconstruct_complex_type (tree, tree);
2914 extern int real_onep (tree);
2915 extern int real_twop (tree);
2916 extern int real_minus_onep (tree);
2917 extern void init_ttree (void);
2918 extern void build_common_tree_nodes (int);
2919 extern void build_common_tree_nodes_2 (int);
2920 extern tree build_range_type (tree, tree, tree);
2923 extern void setjmp_protect_args (void);
2924 extern void setjmp_protect (tree);
2925 extern void expand_main_function (void);
2926 extern void init_dummy_function_start (void);
2927 extern void expand_dummy_function_end (void);
2928 extern void init_function_for_compilation (void);
2929 extern void allocate_struct_function (tree);
2930 extern void init_function_start (tree);
2931 extern void assign_parms (tree);
2932 extern void put_var_into_stack (tree, int);
2933 extern void flush_addressof (tree);
2934 extern void uninitialized_vars_warning (tree);
2935 extern void setjmp_args_warning (void);
2936 extern void mark_all_temps_used (void);
2937 extern void init_temp_slots (void);
2938 extern void combine_temp_slots (void);
2939 extern void free_temp_slots (void);
2940 extern void pop_temp_slots (void);
2941 extern void push_temp_slots (void);
2942 extern void preserve_temp_slots (rtx);
2943 extern void preserve_rtl_expr_temps (tree);
2944 extern int aggregate_value_p (tree, tree);
2945 extern void free_temps_for_rtl_expr (tree);
2946 extern void instantiate_virtual_regs (tree, rtx);
2947 extern void unshare_all_rtl (tree, rtx);
2948 extern void push_function_context (void);
2949 extern void pop_function_context (void);
2950 extern void push_function_context_to (tree);
2951 extern void pop_function_context_from (tree);
2953 /* In print-rtl.c */
2955 extern void print_rtl (FILE *, rtx);
2958 /* In print-tree.c */
2959 extern void debug_tree (tree);
2961 extern void print_node (FILE *, const char *, tree, int);
2962 extern void print_node_brief (FILE *, const char *, tree, int);
2963 extern void indent_to (FILE *, int);
2967 extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx);
2968 extern void check_max_integer_computation_mode (tree);
2971 extern void start_sequence_for_rtl_expr (tree);
2972 extern rtx emit_line_note (location_t);
2976 /* Nonzero if this is a call to a `const' function. */
2978 /* Nonzero if this is a call to a `volatile' function. */
2979 #define ECF_NORETURN 2
2980 /* Nonzero if this is a call to malloc or a related function. */
2981 #define ECF_MALLOC 4
2982 /* Nonzero if it is plausible that this is a call to alloca. */
2983 #define ECF_MAY_BE_ALLOCA 8
2984 /* Nonzero if this is a call to a function that won't throw an exception. */
2985 #define ECF_NOTHROW 16
2986 /* Nonzero if this is a call to setjmp or a related function. */
2987 #define ECF_RETURNS_TWICE 32
2988 /* Nonzero if this is a call to `longjmp'. */
2989 #define ECF_LONGJMP 64
2990 /* Nonzero if this is a syscall that makes a new process in the image of
2992 #define ECF_FORK_OR_EXEC 128
2993 #define ECF_SIBCALL 256
2994 /* Nonzero if this is a call to "pure" function (like const function,
2995 but may read memory. */
2996 #define ECF_PURE 512
2997 /* Nonzero if this is a call to a function that returns with the stack
2998 pointer depressed. */
2999 #define ECF_SP_DEPRESSED 1024
3000 /* Nonzero if this call is known to always return. */
3001 #define ECF_ALWAYS_RETURN 2048
3002 /* Create libcall block around the call. */
3003 #define ECF_LIBCALL_BLOCK 4096
3005 extern int flags_from_decl_or_type (tree);
3006 extern int call_expr_flags (tree);
3008 extern int setjmp_call_p (tree);
3009 extern bool alloca_call_p (tree);
3013 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3014 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3015 it should be modified in place; if a TYPE, a copy should be created
3016 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3017 information, in the form of a bitwise OR of flags in enum attribute_flags
3018 from tree.h. Depending on these flags, some attributes may be
3019 returned to be applied at a later stage (for example, to apply
3020 a decl attribute to the declaration rather than to its type). */
3021 extern tree decl_attributes (tree *, tree, int);
3023 /* In integrate.c */
3024 extern void save_for_inline (tree);
3025 extern void set_decl_abstract_flags (tree, int);
3026 extern void output_inline_function (tree);
3027 extern void set_decl_origin_self (tree);
3029 /* In stor-layout.c */
3030 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
3031 extern void fixup_signed_type (tree);
3032 extern void internal_reference_types (void);
3035 extern void make_decl_rtl (tree, const char *);
3036 extern void make_decl_one_only (tree);
3037 extern int supports_one_only (void);
3038 extern void variable_section (tree, int);
3039 enum tls_model decl_tls_model (tree);
3040 extern void resolve_unique_section (tree, int, int);
3041 extern void mark_referenced (tree);
3042 extern void notice_global_symbol (tree);
3045 extern void emit_nop (void);
3046 extern void expand_computed_goto (tree);
3047 extern bool parse_output_constraint (const char **, int, int, int,
3048 bool *, bool *, bool *);
3049 extern bool parse_input_constraint (const char **, int, int, int, int,
3050 const char * const *, bool *, bool *);
3051 extern void expand_asm_operands (tree, tree, tree, tree, int, location_t);
3052 extern tree resolve_asm_operand_names (tree, tree, tree);
3053 extern int any_pending_cleanups (void);
3054 extern void init_stmt_for_function (void);
3055 extern void expand_start_target_temps (void);
3056 extern void expand_end_target_temps (void);
3057 extern void expand_elseif (tree);
3058 extern void save_stack_pointer (void);
3059 extern void expand_decl (tree);
3060 extern int expand_decl_cleanup (tree, tree);
3061 extern int expand_decl_cleanup_eh (tree, tree, int);
3062 extern void expand_anon_union_decl (tree, tree, tree);
3063 extern HOST_WIDE_INT all_cases_count (tree, int *);
3064 extern void check_for_full_enumeration_handling (tree);
3065 extern void declare_nonlocal_label (tree);
3067 /* If KIND=='I', return a suitable global initializer (constructor) name.
3068 If KIND=='D', return a suitable global clean-up (destructor) name. */
3069 extern tree get_file_function_name (int);
3071 /* Interface of the DWARF2 unwind info support. */
3073 /* Generate a new label for the CFI info to refer to. */
3075 extern char *dwarf2out_cfi_label (void);
3077 /* Entry point to update the canonical frame address (CFA). */
3079 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
3081 /* Add the CFI for saving a register window. */
3083 extern void dwarf2out_window_save (const char *);
3085 /* Add a CFI to update the running total of the size of arguments pushed
3088 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
3090 /* Entry point for saving a register to the stack. */
3092 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
3094 /* Entry point for saving the return address in the stack. */
3096 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
3098 /* Entry point for saving the return address in a register. */
3100 extern void dwarf2out_return_reg (const char *, unsigned);
3102 /* The type of a function that walks over tree structure. */
3104 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3106 /* In tree-dump.c */
3108 /* Different tree dump places. When you add new tree dump places,
3109 extend the DUMP_FILES array in tree-dump.c */
3110 enum tree_dump_index
3112 TDI_all, /* dump the whole translation unit */
3113 TDI_class, /* dump class hierarchy */
3114 TDI_original, /* dump each function before optimizing it */
3115 TDI_optimized, /* dump each function after optimizing it */
3116 TDI_inlined, /* dump each function after inlining
3121 /* Bit masks to control tree dumping. Not all values are applicable to
3122 all tree dumps. Add new ones at the end. When you define new
3123 values, extend the DUMP_OPTIONS array in tree-dump.c */
3124 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3125 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3127 typedef struct dump_info *dump_info_p;
3129 extern int dump_flag (dump_info_p, int, tree);
3130 extern int dump_enabled_p (enum tree_dump_index);
3131 extern FILE *dump_begin (enum tree_dump_index, int *);
3132 extern void dump_end (enum tree_dump_index, FILE *);
3133 extern void dump_node (tree, int, FILE *);
3134 extern int dump_switch_p (const char *);
3135 extern const char *dump_flag_name (enum tree_dump_index);
3136 /* Assign the RTX to declaration. */
3138 extern void set_decl_rtl (tree, rtx);
3139 extern void set_decl_incoming_rtl (tree, rtx);
3141 /* Redefine abort to report an internal error w/o coredump, and
3142 reporting the location of the error in the source file. This logic
3143 is duplicated in rtl.h and tree.h because every file that needs the
3144 special abort includes one or both. toplev.h gets too few files,
3145 system.h gets too many. */
3147 extern void fancy_abort (const char *, int, const char *)
3149 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3151 /* Enum and arrays used for tree allocation stats.
3152 Keep in sync with tree.c:tree_node_kind_names. */
3172 extern int tree_node_counts[];
3173 extern int tree_node_sizes[];
3175 #endif /* GCC_TREE_H */