1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 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
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 LAST_AND_UNUSED_TREE_CODE
/* A convenient way to get a value for
42 /* Number of language-independent tree codes. */
43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern const char tree_code_type
[];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns nonzero iff CLASS is the tree-code class of an
59 #define IS_EXPR_CODE_CLASS(CLASS) \
60 ((CLASS) == '<' || (CLASS) == '1' || (CLASS) == '2' || (CLASS) == 'e')
62 /* Number of argument-words in each kind of tree-node. */
64 extern const unsigned char tree_code_length
[];
65 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
67 /* Names of tree components. */
69 extern const char *const tree_code_name
[];
71 /* Classify which part of the compiler has defined a given builtin function.
72 Note that we assume below that this is no more than two bits. */
81 /* Names for the above. */
82 extern const char *const built_in_class_names
[4];
84 /* Codes that identify the various built in functions
85 so that expand_call can identify them quickly. */
87 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
88 enum built_in_function
90 #include "builtins.def"
92 /* Upper bound on non-language-specific builtins. */
97 /* Names for the above. */
98 extern const char *const built_in_names
[(int) END_BUILTINS
];
100 /* An array of _DECL trees for the above. */
101 extern GTY(()) tree built_in_decls
[(int) END_BUILTINS
];
102 extern GTY(()) tree implicit_built_in_decls
[(int) END_BUILTINS
];
104 /* The definition of tree nodes fills the next several pages. */
106 /* A tree node can represent a data type, a variable, an expression
107 or a statement. Each node has a TREE_CODE which says what kind of
108 thing it represents. Some common codes are:
109 INTEGER_TYPE -- represents a type of integers.
110 ARRAY_TYPE -- represents a type of pointer.
111 VAR_DECL -- represents a declared variable.
112 INTEGER_CST -- represents a constant integer value.
113 PLUS_EXPR -- represents a sum (an expression).
115 As for the contents of a tree node: there are some fields
116 that all nodes share. Each TREE_CODE has various special-purpose
117 fields as well. The fields of a node are never accessed directly,
118 always through accessor macros. */
120 /* Every kind of tree node starts with this structure,
121 so all nodes have these fields.
123 See the accessor macros, defined below, for documentation of the
126 struct tree_common
GTY(())
131 ENUM_BITFIELD(tree_code
) code
: 8;
133 unsigned side_effects_flag
: 1;
134 unsigned constant_flag
: 1;
135 unsigned addressable_flag
: 1;
136 unsigned volatile_flag
: 1;
137 unsigned readonly_flag
: 1;
138 unsigned unsigned_flag
: 1;
139 unsigned asm_written_flag
: 1;
140 unsigned unused_0
: 1;
142 unsigned used_flag
: 1;
143 unsigned nothrow_flag
: 1;
144 unsigned static_flag
: 1;
145 unsigned public_flag
: 1;
146 unsigned private_flag
: 1;
147 unsigned protected_flag
: 1;
148 unsigned bounded_flag
: 1;
149 unsigned deprecated_flag
: 1;
151 unsigned lang_flag_0
: 1;
152 unsigned lang_flag_1
: 1;
153 unsigned lang_flag_2
: 1;
154 unsigned lang_flag_3
: 1;
155 unsigned lang_flag_4
: 1;
156 unsigned lang_flag_5
: 1;
157 unsigned lang_flag_6
: 1;
158 unsigned unused_1
: 1;
161 /* The following table lists the uses of each of the above flags and
162 for which types of nodes they are defined. Note that expressions
168 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
169 ..._TYPE, IDENTIFIER_NODE.
170 In a STMT_EXPR, it means we want the result of the enclosed
176 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
177 TREE_NO_UNUSED_WARNING in
178 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
180 TREE_LIST or TREE_VEC
181 TREE_CONSTANT_OVERFLOW in
182 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
183 TREE_SYMBOL_REFERENCED in
186 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
187 TREE_LIST elements of a block's cleanup list.
192 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
194 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
195 EXPR_WFL_EMIT_LINE_NOTE in
196 EXPR_WITH_FILE_LOCATION
202 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
218 TREE_THIS_VOLATILE in
238 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
239 SAVE_EXPR_NOPLACEHOLDER in
245 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
251 expressions, IDENTIFIER_NODE
256 CALL_EXPR, FUNCTION_DECL
261 expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL,
272 /* Define accessors for the fields that all tree nodes have
273 (though some fields are not used for all kinds of nodes). */
275 /* The tree-code says what kind of node it is.
276 Codes are defined in tree.def. */
277 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
278 #define TREE_SET_CODE(NODE, VALUE) \
279 ((NODE)->common.code = (ENUM_BITFIELD (tree_code)) (VALUE))
281 /* When checking is enabled, errors will be generated if a tree node
282 is accessed incorrectly. The macros abort with a fatal error. */
283 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
285 #define TREE_CHECK(t, code) __extension__ \
286 ({ const tree __t = (t); \
287 if (TREE_CODE(__t) != (code)) \
288 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
290 #define TREE_CLASS_CHECK(t, class) __extension__ \
291 ({ const tree __t = (t); \
292 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
293 tree_class_check_failed (__t, class, __FILE__, __LINE__, \
297 /* These checks have to be special cased. */
298 #define EXPR_CHECK(t) __extension__ \
299 ({ const tree __t = (t); \
300 char const __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
301 if (__c != 'r' && __c != 's' && __c != '<' \
302 && __c != '1' && __c != '2' && __c != 'e') \
303 tree_class_check_failed (__t, 'e', __FILE__, __LINE__, \
307 #define TREE_VEC_ELT_CHECK(t, i) __extension__ \
308 (*({const tree __t = t; \
309 const int __i = (i); \
310 if (TREE_CODE (__t) != TREE_VEC) \
311 tree_check_failed (__t, TREE_VEC, \
312 __FILE__, __LINE__, __FUNCTION__); \
313 if (__i < 0 || __i >= __t->vec.length) \
314 tree_vec_elt_check_failed (__i, __t->vec.length, \
315 __FILE__, __LINE__, __FUNCTION__); \
316 &__t->vec.a[__i]; }))
318 /* Special checks for TREE_OPERANDs. */
319 #define TREE_OPERAND_CHECK(t, i) __extension__ \
320 (*({const tree __t = EXPR_CHECK(t); \
321 const int __i = (i); \
322 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
323 tree_operand_check_failed (__i, TREE_CODE (__t), \
324 __FILE__, __LINE__, __FUNCTION__); \
325 &__t->exp.operands[__i]; }))
327 #define TREE_OPERAND_CHECK_CODE(t, code, i) __extension__ \
328 (*({const tree __t = t; \
329 const int __i = (i); \
330 const enum tree_code __code = code; \
331 if (TREE_CODE (__t) != __code) \
332 tree_check_failed (__t, __code, \
333 __FILE__, __LINE__, __FUNCTION__); \
334 if (__i < 0 || __i >= TREE_CODE_LENGTH (__code)) \
335 tree_operand_check_failed (__i, __code, \
336 __FILE__, __LINE__, __FUNCTION__); \
337 &__t->exp.operands[__i]; }))
339 #define TREE_RTL_OPERAND_CHECK(t, code, i) __extension__ \
341 ({const tree __t = t; \
342 const int __i = (i); \
343 const enum tree_code __code = code; \
344 if (TREE_CODE (__t) != __code) \
345 tree_check_failed (__t, __code, \
346 __FILE__, __LINE__, __FUNCTION__); \
347 if (__i < 0 || __i >= TREE_CODE_LENGTH (__code)) \
348 tree_operand_check_failed (__i, __code, \
349 __FILE__, __LINE__, __FUNCTION__); \
350 &__t->exp.operands[__i]; }))
352 extern void tree_check_failed
PARAMS ((const tree
, enum tree_code
,
353 const char *, int, const char *))
355 extern void tree_class_check_failed
PARAMS ((const tree
, int,
356 const char *, int, const char *))
358 extern void tree_vec_elt_check_failed
PARAMS ((int, int, const char *,
362 extern void tree_operand_check_failed
PARAMS ((int, enum tree_code
,
363 const char *, int, const char *))
366 #else /* not ENABLE_TREE_CHECKING, or not gcc */
368 #define TREE_CHECK(t, code) (t)
369 #define TREE_CLASS_CHECK(t, code) (t)
370 #define EXPR_CHECK(t) (t)
371 #define TREE_VEC_ELT_CHECK(t, i) ((t)->vec.a[i])
372 #define TREE_OPERAND_CHECK(t, i) ((t)->exp.operands[i])
373 #define TREE_OPERAND_CHECK_CODE(t, code, i) ((t)->exp.operands[i])
374 #define TREE_RTL_OPERAND_CHECK(t, code, i) (*(rtx *) &((t)->exp.operands[i]))
378 #include "tree-check.h"
380 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
381 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
382 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
384 /* In all nodes that are expressions, this is the data type of the expression.
385 In POINTER_TYPE nodes, this is the type that the pointer points to.
386 In ARRAY_TYPE nodes, this is the type of the elements.
387 In VECTOR_TYPE nodes, this is the type of the elements. */
388 #define TREE_TYPE(NODE) ((NODE)->common.type)
390 /* Here is how primitive or already-canonicalized types' hash codes
392 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777)
394 /* Nodes are chained together for many purposes.
395 Types are chained together to record them for being output to the debugger
396 (see the function `chain_type').
397 Decls in the same scope are chained together to record the contents
399 Statement nodes for successive statements used to be chained together.
400 Often lists of things are represented by TREE_LIST nodes that
401 are chained together. */
403 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
405 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
406 that don't change the machine mode. */
408 #define STRIP_NOPS(EXP) \
409 while ((TREE_CODE (EXP) == NOP_EXPR \
410 || TREE_CODE (EXP) == CONVERT_EXPR \
411 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
412 && TREE_OPERAND (EXP, 0) != error_mark_node \
413 && (TYPE_MODE (TREE_TYPE (EXP)) \
414 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
415 (EXP) = TREE_OPERAND (EXP, 0)
417 /* Like STRIP_NOPS, but don't let the signedness change either. */
419 #define STRIP_SIGN_NOPS(EXP) \
420 while ((TREE_CODE (EXP) == NOP_EXPR \
421 || TREE_CODE (EXP) == CONVERT_EXPR \
422 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
423 && TREE_OPERAND (EXP, 0) != error_mark_node \
424 && (TYPE_MODE (TREE_TYPE (EXP)) \
425 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
426 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
427 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
428 (EXP) = TREE_OPERAND (EXP, 0)
430 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
432 #define STRIP_MAIN_TYPE_NOPS(EXP) \
433 while ((TREE_CODE (EXP) == NOP_EXPR \
434 || TREE_CODE (EXP) == CONVERT_EXPR \
435 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
436 && TREE_OPERAND (EXP, 0) != error_mark_node \
437 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
438 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
439 (EXP) = TREE_OPERAND (EXP, 0)
441 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
443 #define STRIP_TYPE_NOPS(EXP) \
444 while ((TREE_CODE (EXP) == NOP_EXPR \
445 || TREE_CODE (EXP) == CONVERT_EXPR \
446 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
447 && TREE_OPERAND (EXP, 0) != error_mark_node \
448 && (TREE_TYPE (EXP) \
449 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
450 (EXP) = TREE_OPERAND (EXP, 0)
452 /* Nonzero if TYPE represents an integral type. Note that we do not
453 include COMPLEX types here. */
455 #define INTEGRAL_TYPE_P(TYPE) \
456 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
457 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
459 /* Nonzero if TYPE represents a floating-point type, including complex
460 floating-point types. */
462 #define FLOAT_TYPE_P(TYPE) \
463 (TREE_CODE (TYPE) == REAL_TYPE \
464 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
465 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
467 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
469 #define AGGREGATE_TYPE_P(TYPE) \
470 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
471 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
472 || TREE_CODE (TYPE) == SET_TYPE)
474 /* Nonzero if TYPE represents an unbounded pointer or unbounded
475 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
477 #define POINTER_TYPE_P(TYPE) \
478 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
480 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
482 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
483 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
485 /* Nonzero if TYPE represents a bounded pointer type. */
487 #define BOUNDED_POINTER_TYPE_P(TYPE) \
488 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
489 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
491 /* Nonzero if TYPE represents a bounded reference type. Bounded
492 reference types have two specific uses: (1) When a reference is
493 seated to a variable-length RECORD_TYPE that has an array of
494 indeterminate length as its final field. For all other objects, it
495 is sufficient to check bounds at the time the reference is seated,
496 and assume that all future uses of the reference are safe, since
497 the address of references cannot change. (2) When a reference
498 supertype is seated to a subtype object. The bounds "remember"
499 the true size of the complete object, so that subsequent upcasts of
500 the address of the reference will be checked properly (is such a
501 thing valid C++?). */
503 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
504 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
505 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
507 /* Nonzero if TYPE represents a pointer or reference type, either
508 bounded or unbounded. */
510 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
511 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
513 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
515 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
516 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
518 /* Nonzero if TYPE represents a reference type, either bounded or
521 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
522 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
524 /* Nonzero if this type is a complete type. */
525 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
527 /* Nonzero if this type is the (possibly qualified) void type. */
528 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
530 /* Nonzero if this type is complete or is cv void. */
531 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
532 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
534 /* Nonzero if this type is complete or is an array with unspecified bound. */
535 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
536 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
538 /* Nonzero if TYPE represents a type. */
540 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
542 /* Define many boolean fields that all tree nodes have. */
544 /* In VAR_DECL nodes, nonzero means address of this is needed.
545 So it cannot be in a register.
546 In a FUNCTION_DECL, nonzero means its address is needed.
547 So it must be compiled even if it is an inline function.
548 In a FIELD_DECL node, it means that the programmer is permitted to
549 construct the address of this field. This is used for aliasing
550 purposes: see record_component_aliases.
551 In CONSTRUCTOR nodes, it means object constructed must be in memory.
552 In LABEL_DECL nodes, it means a goto for this label has been seen
553 from a place outside all binding contours that restore stack levels.
554 In ..._TYPE nodes, it means that objects of this type must
555 be fully addressable. This means that pieces of this
556 object cannot go into register parameters, for example.
557 In IDENTIFIER_NODEs, this means that some extern decl for this name
558 had its address taken. That matters for inline functions. */
559 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
561 /* In a VAR_DECL, nonzero means allocate static storage.
562 In a FUNCTION_DECL, nonzero if function has been defined.
563 In a CONSTRUCTOR, nonzero means allocate static storage. */
564 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
566 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
567 block's cleanup list, means that the pertinent cleanup should only be
568 executed if an exception is thrown, not on normal exit of its scope. */
569 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
571 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
572 made implicitly and should not lead to an "unused value" warning. */
573 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
575 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
576 chain is via a `virtual' declaration. */
577 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
579 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
580 there was an overflow in folding. This is distinct from
581 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
582 occur in constant expressions. */
583 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
585 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
586 this string as an argument. */
587 #define TREE_SYMBOL_REFERENCED(NODE) \
588 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
590 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
591 there was an overflow in folding, and no warning has been issued
592 for this subexpression. TREE_OVERFLOW implies
593 TREE_CONSTANT_OVERFLOW, but not vice versa. */
594 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
596 /* In a VAR_DECL or FUNCTION_DECL,
597 nonzero means name is to be accessible from outside this module.
598 In an IDENTIFIER_NODE, nonzero means an external declaration
599 accessible from outside this module was previously seen
600 for this name in an inner scope. */
601 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
603 /* In any expression, nonzero means it has side effects or reevaluation
604 of the whole expression could produce a different value.
605 This is set if any subexpression is a function call, a side effect
606 or a reference to a volatile variable.
607 In a ..._DECL, this is set only if the declaration said `volatile'. */
608 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
610 /* Nonzero means this expression is volatile in the C sense:
611 its address should be of type `volatile WHATEVER *'.
612 In other words, the declared item is volatile qualified.
613 This is used in _DECL nodes and _REF nodes.
615 In a ..._TYPE node, means this type is volatile-qualified.
616 But use TYPE_VOLATILE instead of this macro when the node is a type,
617 because eventually we may make that a different bit.
619 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
620 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
622 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
623 nonzero means it may not be the lhs of an assignment.
624 In a ..._TYPE node, means this type is const-qualified
625 (but the macro TYPE_READONLY should be used instead of this macro
626 when the node is a type). */
627 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
629 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
630 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE))
632 /* Value of expression is constant.
633 Always appears in all ..._CST nodes.
634 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
635 if the value is constant. */
636 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
638 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
639 In FIELD_DECL nodes, means an unsigned bit field. */
640 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
642 #define TYPE_TRAP_SIGNED(NODE) \
643 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE)))
645 /* Nonzero in a VAR_DECL means assembler code has been written.
646 Nonzero in a FUNCTION_DECL means that the function has been compiled.
647 This is interesting in an inline function, since it might not need
648 to be compiled separately.
649 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
650 if the sdb debugging info for the type has been written.
651 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
652 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
654 /* Nonzero in a _DECL if the name is used in its scope.
655 Nonzero in an expr node means inhibit warning if value is unused.
656 In IDENTIFIER_NODEs, this means that some extern decl for this name
658 #define TREE_USED(NODE) ((NODE)->common.used_flag)
660 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
661 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
662 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
664 /* In a CALL_EXPR, means that the address of the return slot is part of the
666 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
668 /* In a type, nonzero means that all objects of the type are guaranteed by the
669 language or front-end to be properly aligned, so we can indicate that a MEM
670 of this type is aligned at least to the alignment of the type, even if it
671 doesn't appear that it is. We see this, for example, in object-oriented
672 languages where a tag field may show this is an object of a more-aligned
673 variant of the more generic type. */
674 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
676 /* Used in classes in C++. */
677 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
678 /* Used in classes in C++.
679 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
680 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
682 /* In a ..._TYPE node, nonzero means that the type's size and layout,
683 (or the size and layout of its arguments and/or return value in the
684 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
685 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
686 node is a type, because eventually we may make that a different
687 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
688 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
689 BOUNDED_INDIRECT_TYPE_P to test for that.
691 In a FUNCTION_DECL, nonzero means that the size and layout of one
692 of its arguments and/or return value was changed by the presence of
693 pointer bounds. This value can differ from the value of
694 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
695 declared, then later called with pointer args, or was declared with
696 a variable argument list and is later called with pointer values in
697 the variable argument list.
699 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
700 of the decl's type's BOUNDED_POINTER_TYPE_P.
702 In a CONSTRUCTOR or other expression, nonzero means the value is a
703 bounded pointer. It is insufficient to determine the boundedness
704 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
705 since we allow pointer to be temporarily cast to integer for
706 rounding up to an alignment boundary in a way that preserves the
709 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
710 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
711 of a function that has bounded pointer(s) for its return type and/or
714 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
716 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
717 deprecated feature by __attribute__((deprecated)). */
718 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
720 /* These flags are available for each language front end to use internally. */
721 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
722 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
723 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
724 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
725 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
726 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
727 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
729 /* Define additional fields and accessors for nodes representing constants. */
731 /* In an INTEGER_CST node. These two together make a 2-word integer.
732 If the data type is signed, the value is sign-extended to 2 words
733 even though not all of them may really be in use.
734 In an unsigned constant shorter than 2 words, the extra bits are 0. */
735 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
736 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
737 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
739 #define INT_CST_LT(A, B) \
740 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
741 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
742 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
744 #define INT_CST_LT_UNSIGNED(A, B) \
745 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
746 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
747 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
748 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
749 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
751 struct tree_int_cst
GTY(())
753 struct tree_common common
;
754 /* A sub-struct is necessary here because the function `const_hash'
755 wants to scan both words as a unit and taking the address of the
756 sub-struct yields the properly inclusive bounded pointer. */
757 struct tree_int_cst_lowhi
{
758 unsigned HOST_WIDE_INT low
;
763 /* In a REAL_CST node. struct real_value is an opaque entity, with
764 manipulators defined in real.h. We don't want tree.h depending on
765 real.h and transitively on tm.h. */
768 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
769 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
771 struct tree_real_cst
GTY(())
773 struct tree_common common
;
774 struct real_value
* real_cst_ptr
;
777 /* In a STRING_CST */
778 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
779 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
781 struct tree_string
GTY(())
783 struct tree_common common
;
788 /* In a COMPLEX_CST node. */
789 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
790 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
792 struct tree_complex
GTY(())
794 struct tree_common common
;
799 /* In a VECTOR_CST node. */
800 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
802 struct tree_vector
GTY(())
804 struct tree_common common
;
808 #include "hashtable.h"
810 /* Define fields and accessors for some special-purpose tree nodes. */
812 #define IDENTIFIER_LENGTH(NODE) \
813 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
814 #define IDENTIFIER_POINTER(NODE) \
815 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
817 /* Translate a hash table identifier pointer to a tree_identifier
818 pointer, and vice versa. */
820 #define HT_IDENT_TO_GCC_IDENT(NODE) \
821 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
822 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
824 struct tree_identifier
GTY(())
826 struct tree_common common
;
827 struct ht_identifier id
;
830 /* In a TREE_LIST node. */
831 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
832 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
834 struct tree_list
GTY(())
836 struct tree_common common
;
841 /* In a TREE_VEC node. */
842 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
843 #define TREE_VEC_END(NODE) \
844 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
846 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
848 struct tree_vec
GTY(())
850 struct tree_common common
;
852 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
855 /* Define fields and accessors for some nodes that represent expressions. */
857 /* In a SAVE_EXPR node. */
858 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1)
859 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2)
861 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE))
862 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
863 both in normal code and in a handler. (Normally, in a handler, all
864 SAVE_EXPRs are unsaved, meaning that their values are
866 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
868 /* In a RTL_EXPR node. */
869 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0)
870 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1)
872 /* In a WITH_CLEANUP_EXPR node. */
873 #define WITH_CLEANUP_EXPR_RTL(NODE) \
874 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2)
876 /* In a CONSTRUCTOR node. */
877 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
879 /* In ordinary expression nodes. */
880 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
881 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
883 /* In a LABELED_BLOCK_EXPR node. */
884 #define LABELED_BLOCK_LABEL(NODE) \
885 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
886 #define LABELED_BLOCK_BODY(NODE) \
887 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
889 /* In an EXIT_BLOCK_EXPR node. */
890 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
891 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
892 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
894 /* In a LOOP_EXPR node. */
895 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
897 /* In an EXPR_WITH_FILE_LOCATION node. */
898 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
899 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
900 #define EXPR_WFL_NODE(NODE) \
901 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 0)
902 #define EXPR_WFL_FILENAME_NODE(NODE) \
903 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 1)
904 #define EXPR_WFL_FILENAME(NODE) \
905 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE))
906 /* ??? Java uses this in all expressions. */
907 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
908 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
909 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
910 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
911 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
913 /* In a TARGET_EXPR node. */
914 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
915 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
916 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
918 struct tree_exp
GTY(())
920 struct tree_common common
;
922 tree
GTY ((special ("tree_exp"),
923 desc ("TREE_CODE ((tree) &%0)")))
927 /* In a BLOCK node. */
928 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
929 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
930 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
931 /* Note: when changing this, make sure to find the places
932 that use chainon or nreverse. */
933 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
934 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
935 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
937 /* Nonzero means that this block is prepared to handle exceptions
938 listed in the BLOCK_VARS slot. */
939 #define BLOCK_HANDLER_BLOCK(NODE) \
940 (BLOCK_CHECK (NODE)->block.handler_block_flag)
942 /* An index number for this block. These values are not guaranteed to
943 be unique across functions -- whether or not they are depends on
944 the debugging output format in use. */
945 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
947 /* If block reordering splits a lexical block into discontiguous
948 address ranges, we'll make a copy of the original block.
950 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
951 In that case, we have one source block that has been replicated
952 (through inlining or unrolling) into many logical blocks, and that
953 these logical blocks have different physical variables in them.
955 In this case, we have one logical block split into several
956 non-contiguous address ranges. Most debug formats can't actually
957 represent this idea directly, so we fake it by creating multiple
958 logical blocks with the same variables in them. However, for those
959 that do support non-contiguous regions, these allow the original
960 logical block to be reconstructed, along with the set of address
963 One of the logical block fragments is arbitrarily chosen to be
964 the ORIGIN. The other fragments will point to the origin via
965 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
966 be null. The list of fragments will be chained through
967 BLOCK_FRAGMENT_CHAIN from the origin. */
969 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
970 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
972 struct tree_block
GTY(())
974 struct tree_common common
;
976 unsigned handler_block_flag
: 1;
977 unsigned abstract_flag
: 1;
978 unsigned block_num
: 30;
983 tree abstract_origin
;
984 tree fragment_origin
;
988 /* Define fields and accessors for nodes representing data types. */
990 /* See tree.def for documentation of the use of these fields.
991 Look at the documentation of the various ..._TYPE tree codes. */
993 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
994 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
995 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
996 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
997 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
998 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
999 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
1000 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
1001 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
1002 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
1003 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
1004 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
1005 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1006 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1007 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
1008 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
1009 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1010 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1011 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1012 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1013 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1014 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1015 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1016 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1017 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1019 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1020 in the debugging output. We use this to describe a vector as a
1021 structure containing an array. */
1022 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
1024 /* Indirect types present difficulties because they may be represented
1025 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
1026 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
1027 be logically equivalent, but physically different. Simple
1028 comparison of the main variant only tells if the types are
1029 logically equivalent. Use this predicate to compare for physical
1032 /* Types have the same main variant, and have the same boundedness. */
1033 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
1034 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
1035 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
1037 /* Return the type variant that has no qualifiers (i.e., the main variant),
1038 except that the boundedness qualifier is preserved. */
1039 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
1040 (BOUNDED_POINTER_TYPE_P (TYPE) \
1041 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
1042 : TYPE_MAIN_VARIANT (TYPE))
1044 /* For aggregate types, information about this type, as a base type
1045 for itself. Used in a language-dependent way for types that are
1046 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
1047 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
1049 /* The (language-specific) typed-based alias set for this type.
1050 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1051 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1052 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1053 type can alias objects of any type. */
1054 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1056 /* Nonzero iff the typed-based alias set for this type has been
1058 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1060 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1062 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1064 /* The alignment necessary for objects of this type.
1065 The value is an int, measured in bits. */
1066 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1068 /* 1 if the alignment for this type was requested by "aligned" attribute,
1069 0 if it is the default for this type. */
1070 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1072 /* The alignment for NODE, in bytes. */
1073 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1075 /* If your language allows you to declare types, and you want debug info
1076 for them, then you need to generate corresponding TYPE_DECL nodes.
1077 These "stub" TYPE_DECL nodes have no name, and simply point at the
1078 type node. You then set the TYPE_STUB_DECL field of the type node
1079 to point back at the TYPE_DECL node. This allows the debug routines
1080 to know that the two nodes represent the same type, so that we only
1081 get one debug info record for them. */
1082 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1084 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1085 has BLKmode only because it lacks the alignment requirement for
1087 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1089 /* In an INTEGER_TYPE, it means the type represents a size. We use
1090 this both for validity checking and to permit optimizations that
1091 are unsafe for other types. Note that the C `size_t' type should
1092 *not* have this flag set. The `size_t' type is simply a typedef
1093 for an ordinary integer type that happens to be the type of an
1094 expression returned by `sizeof'; `size_t' has no special
1095 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1096 always actual sizes. */
1097 #define TYPE_IS_SIZETYPE(NODE) \
1098 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1100 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1101 pointer depressed. */
1102 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1103 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1105 /* Nonzero in a type considered volatile as a whole. */
1106 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1108 /* Means this type is const-qualified. */
1109 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1111 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1113 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1115 /* If nonzero, this type's size and layout, (or the size and layout of
1116 its arguments and/or return value in the case of a FUNCTION_TYPE or
1117 METHOD_TYPE) was changed by the presence of pointer bounds. */
1118 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
1120 /* There is a TYPE_QUAL value for each type qualifier. They can be
1121 combined by bitwise-or to form the complete set of qualifiers for a
1124 #define TYPE_UNQUALIFIED 0x0
1125 #define TYPE_QUAL_CONST 0x1
1126 #define TYPE_QUAL_VOLATILE 0x2
1127 #define TYPE_QUAL_RESTRICT 0x4
1128 #define TYPE_QUAL_BOUNDED 0x8
1130 /* The set of type qualifiers for this type. */
1131 #define TYPE_QUALS(NODE) \
1132 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1133 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1134 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1135 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1137 /* The set of qualifiers pertinent to an expression node. */
1138 #define TREE_EXPR_QUALS(NODE) \
1139 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1140 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1141 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1143 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1144 #define TREE_FUNC_QUALS(NODE) \
1145 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1146 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1148 /* These flags are available for each language front end to use internally. */
1149 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1150 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1151 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1152 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1153 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1154 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1155 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1157 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1158 that distinguish string from array of char).
1159 If set in a SET_TYPE, indicates a bitstring type. */
1160 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1162 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1163 object of the given ARRAY_TYPE. This allows temporaries to be
1165 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1166 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE))
1168 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1169 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1170 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1172 /* Indicates that objects of this type must be initialized by calling a
1173 function when they are created. */
1174 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1175 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1177 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1178 the same way that the first union alternative would be passed. */
1179 #define TYPE_TRANSPARENT_UNION(NODE) \
1180 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1182 /* For an ARRAY_TYPE, indicates that it is not permitted to
1183 take the address of a component of the type. */
1184 #define TYPE_NONALIASED_COMPONENT(NODE) \
1185 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1187 /* Indicated that objects of this type should be laid out in as
1188 compact a way as possible. */
1189 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1191 /* A bounded pointer or bounded reference type (collectively called
1192 indirect types) is represented as a RECORD_TYPE node containing
1193 three pointer fields whose type is the corresponding unbounded
1194 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1195 a bounded indirect type differs from a normal RECORD_TYPE node in
1196 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1197 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1198 nodes are stored on the same type variant chain alongside the
1199 variants of the underlaying indirect types nodes. The main variant
1200 of such chains is always the unbounded type. */
1202 /* Access the field decls of a bounded-pointer type. */
1203 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1204 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1205 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1207 /* Access the simple-pointer subtype of a bounded-pointer type. */
1208 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1210 /* Find the unbounded counterpart to a type, or return TYPE if it is
1211 already unbounded. */
1212 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1213 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1215 /* This field comprises two bits, for values in the range 0..3:
1217 depth=0 means that type is a scalar, or an aggregate that contains
1218 only depth=0 types, or a function that has only depth=0 types for
1219 its return value and argument types.
1221 depth=1 means that type is a pointer to a depth=0 type, or an
1222 aggregate that contains only depth=0 and depth=1 types, or a
1223 function that has only depth=0 and depth=1 types for its return
1224 value and argument types.
1226 The meanings of depth=2 and depth=3 are obvious by induction.
1227 Varargs functions are depth=3. The type `va_list' is depth=3.
1229 The purpose of measuring pointer depth of a type is to determine
1230 the eligibility of a function for an automatically-generated
1231 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1232 depth=1 function is eligible for an automatic thunk. Functions
1233 with depth 2 or more are too complex to get automatic thunks.
1235 Function decls also have a pointer_depth field, since we also
1236 consider the actual argument types for functions. */
1238 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1240 /* In a FUNCTION_TYPE node, this bit stores the value of
1241 default_pointer_boundedness at the time TYPE was created. It is
1242 useful for choosing default boundedness of function arguments for
1243 non-prototype function decls and for varargs/stdarg lists. */
1244 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1245 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1247 #define MAX_POINTER_DEPTH 2
1248 #define VA_LIST_POINTER_DEPTH 3
1252 struct tree_type
GTY(())
1254 struct tree_common common
;
1261 unsigned int precision
: 9;
1262 ENUM_BITFIELD(machine_mode
) mode
: 7;
1264 unsigned string_flag
: 1;
1265 unsigned no_force_blk_flag
: 1;
1266 unsigned needs_constructing_flag
: 1;
1267 unsigned transparent_union_flag
: 1;
1268 unsigned packed_flag
: 1;
1269 unsigned restrict_flag
: 1;
1270 unsigned pointer_depth
: 2;
1272 unsigned lang_flag_0
: 1;
1273 unsigned lang_flag_1
: 1;
1274 unsigned lang_flag_2
: 1;
1275 unsigned lang_flag_3
: 1;
1276 unsigned lang_flag_4
: 1;
1277 unsigned lang_flag_5
: 1;
1278 unsigned lang_flag_6
: 1;
1279 unsigned user_align
: 1;
1284 union tree_type_symtab
{
1285 int GTY ((tag ("0"))) address
;
1286 char * GTY ((tag ("1"))) pointer
;
1287 struct die_struct
* GTY ((tag ("2"))) die
;
1288 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1289 descbits ("2"))) symtab
;
1297 HOST_WIDE_INT alias_set
;
1298 /* Points to a structure whose details depend on the language in use. */
1299 struct lang_type
*lang_specific
;
1302 /* Define accessor macros for information about type inheritance
1305 A "basetype" means a particular usage of a data type for inheritance
1306 in another type. Each such basetype usage has its own "binfo"
1307 object to describe it. The binfo object is a TREE_VEC node.
1309 Inheritance is represented by the binfo nodes allocated for a
1310 given type. For example, given types C and D, such that D is
1311 inherited by C, 3 binfo nodes will be allocated: one for describing
1312 the binfo properties of C, similarly one for D, and one for
1313 describing the binfo properties of D as a base type for C.
1314 Thus, given a pointer to class C, one can get a pointer to the binfo
1315 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1317 /* The actual data type node being inherited in this basetype. */
1318 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1320 /* The offset where this basetype appears in its containing type.
1321 BINFO_OFFSET slot holds the offset (in bytes)
1322 from the base of the complete object to the base of the part of the
1323 object that is allocated on behalf of this `type'.
1324 This is always 0 except when there is multiple inheritance. */
1326 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1327 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1328 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1330 /* The virtual function table belonging to this basetype. Virtual
1331 function tables provide a mechanism for run-time method dispatching.
1332 The entries of a virtual function table are language-dependent. */
1334 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1335 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1337 /* The virtual functions in the virtual function table. This is
1338 a TREE_LIST that is used as an initial approximation for building
1339 a virtual function table for this basetype. */
1340 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1341 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1343 /* A vector of binfos for the direct basetypes inherited by this
1346 If this basetype describes type D as inherited in C, and if the
1347 basetypes of D are E and F, then this vector contains binfos for
1348 inheritance of E and F by C.
1350 ??? This could probably be done by just allocating the
1351 base types at the end of this TREE_VEC (instead of using
1352 another TREE_VEC). This would simplify the calculation
1353 of how many basetypes a given type had. */
1354 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1355 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1357 /* The number of basetypes for NODE. */
1358 #define BINFO_N_BASETYPES(NODE) \
1359 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1361 /* Accessor macro to get to the Nth basetype of this basetype. */
1362 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1363 #define TYPE_BINFO_BASETYPE(NODE,N) \
1364 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1366 /* For a BINFO record describing a virtual base class, i.e., one where
1367 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1368 base. The actual contents are language-dependent. In the C++
1369 front-end this field is an INTEGER_CST giving an offset into the
1370 vtable where the offset to the virtual base can be found. */
1371 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1373 /* Indicates the accesses this binfo has to its bases. The values are
1374 access_public_node, access_protected_node or access_private_node.
1375 If this array is not present, public access is implied. */
1376 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1377 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1379 /* Number of language independent elements in a binfo. Languages may
1380 add additional trailing elements. */
1382 #define BINFO_ELTS 7
1384 /* Slot used to build a chain that represents a use of inheritance.
1385 For example, if X is derived from Y, and Y is derived from Z,
1386 then this field can be used to link the binfo node for X to
1387 the binfo node for X's Y to represent the use of inheritance
1388 from X to Y. Similarly, this slot of the binfo node for X's Y
1389 can point to the Z from which Y is inherited (in X's inheritance
1390 hierarchy). In this fashion, one can represent and traverse specific
1391 uses of inheritance using the binfo nodes themselves (instead of
1392 consing new space pointing to binfo nodes).
1393 It is up to the language-dependent front-ends to maintain
1394 this information as necessary. */
1395 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1397 /* Define fields and accessors for nodes representing declared names. */
1399 /* Nonzero if DECL represents a decl. */
1400 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1402 /* This is the name of the object as written by the user.
1403 It is an IDENTIFIER_NODE. */
1404 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1406 /* The name of the object as the assembler will see it (but before any
1407 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1408 as DECL_NAME. It is an IDENTIFIER_NODE. */
1409 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1411 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1412 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1414 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1415 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1417 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1418 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1419 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1421 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1422 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1423 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1424 semantics of using this macro, are different than saying:
1426 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1428 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1430 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1431 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1432 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1433 DECL_ASSEMBLER_NAME (DECL1)) \
1436 /* Records the section name in a section attribute. Used to pass
1437 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1438 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1440 /* For FIELD_DECLs, this is the
1441 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1442 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1443 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1444 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1445 type, or NULL_TREE if the given decl has "file scope". */
1446 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1447 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1448 /* In a DECL this is the field where attributes are stored. */
1449 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1450 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1451 byte containing the bit closest to the beginning of the structure. */
1452 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1453 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1454 field from DECL_FIELD_OFFSET. */
1455 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1456 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1457 if so, the type that was originally specified for it.
1458 TREE_TYPE may have been modified (in finish_struct). */
1459 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1460 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1461 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1463 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1464 /* This field is used to reference anything in decl.result and is meant only
1465 for use by the garbage collector. */
1466 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1467 /* In FUNCTION_DECL, holds the decl for the return value. */
1468 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1469 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1470 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1471 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1472 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1473 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1474 For a VAR_DECL, holds the initial value.
1475 For a PARM_DECL, not used--default
1476 values for parameters are encoded in the type of the function,
1477 not in the PARM_DECL slot. */
1478 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1479 /* For a PARM_DECL, records the data type used to pass the argument,
1480 which may be different from the type seen in the program. */
1481 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1482 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1483 if nonzero, indicates that the field occupies the type. */
1484 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1485 /* These two fields describe where in the source code the declaration
1486 was. If the declaration appears in several places (as for a C
1487 function that is declared first and then defined later), this
1488 information should refer to the definition. */
1489 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1490 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1491 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1492 /* Holds the size of the datum, in bits, as a tree expression.
1493 Need not be constant. */
1494 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1495 /* Likewise for the size in bytes. */
1496 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1497 /* Holds the alignment required for the datum, in bits. */
1498 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1499 /* The alignment of NODE, in bytes. */
1500 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1501 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1502 DECL_FIELD_OFFSET which are known to be always zero.
1503 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1505 #define DECL_OFFSET_ALIGN(NODE) \
1506 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1507 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1508 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1509 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1510 /* 1 if the alignment for this type was requested by "aligned" attribute,
1511 0 if it is the default for this type. */
1512 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1513 /* Holds the machine mode corresponding to the declaration of a variable or
1514 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1516 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1517 /* Holds the RTL expression for the value of a variable or function. If
1518 PROMOTED_MODE is defined, the mode of this expression may not be same
1519 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1520 to the variable's data type, while the mode
1521 of DECL_RTL is the mode actually used to contain the data.
1523 This value can be evaluated lazily for functions, variables with
1524 static storage duration, and labels. */
1525 #define DECL_RTL(NODE) \
1526 (DECL_CHECK (NODE)->decl.rtl \
1527 ? (NODE)->decl.rtl \
1528 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1529 /* Set the DECL_RTL for NODE to RTL. */
1530 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1531 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1532 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1533 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1534 NODE1, it will not be set for NODE2; this is a lazy copy. */
1535 #define COPY_DECL_RTL(NODE1, NODE2) \
1536 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1537 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1538 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1540 /* For PARM_DECL, holds an RTL for the stack slot or register
1541 where the data was actually passed. */
1542 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1544 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1545 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1547 /* For FUNCTION_DECL, if it is built-in,
1548 this identifies which built-in operation it is. */
1549 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1551 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1552 Before the struct containing the FUNCTION_DECL is laid out,
1553 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1554 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1555 function. When the class is laid out, this pointer is changed
1556 to an INTEGER_CST node which is suitable for use as an index
1557 into the virtual function table. */
1558 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1560 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1561 which this FIELD_DECL is defined. This information is needed when
1562 writing debugging information about vfield and vbase decls for C++. */
1563 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1565 /* Every ..._DECL node gets a unique number. */
1566 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1568 /* For any sort of a ..._DECL node, this points to the original (abstract)
1569 decl node which this decl is an instance of, or else it is NULL indicating
1570 that this decl is not an instance of some other decl. For example,
1571 in a nested declaration of an inline function, this points back to the
1573 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1575 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1576 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1577 #define DECL_ORIGIN(NODE) \
1578 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1580 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1581 inline instance of some original (abstract) decl from an inline function;
1582 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1583 nodes can also have their abstract origin set to themselves. */
1584 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1585 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1587 /* Nonzero if a _DECL means that the name of this decl should be ignored
1588 for symbolic debug purposes. */
1589 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1591 /* Nonzero for a given ..._DECL node means that this node represents an
1592 "abstract instance" of the given declaration (e.g. in the original
1593 declaration of an inline function). When generating symbolic debugging
1594 information, we mustn't try to generate any address information for nodes
1595 marked as "abstract instances" because we don't actually generate
1596 any code or allocate any data space for such instances. */
1597 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1599 /* Nonzero if a _DECL means that no warnings should be generated just
1600 because this decl is unused. */
1601 #define DECL_IN_SYSTEM_HEADER(NODE) \
1602 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1604 /* Nonzero for a given ..._DECL node means that this node should be
1605 put in .common, if possible. If a DECL_INITIAL is given, and it
1606 is not error_mark_node, then the decl cannot be put in .common. */
1607 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1609 /* Language-specific decl information. */
1610 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1612 /* In a VAR_DECL or FUNCTION_DECL,
1613 nonzero means external reference:
1614 do not allocate storage, and refer to a definition elsewhere. */
1615 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1617 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1619 #define DEFAULT_INIT_PRIORITY 65535
1620 #define MAX_INIT_PRIORITY 65535
1621 #define MAX_RESERVED_INIT_PRIORITY 100
1624 nonzero means the detail info about this type is not dumped into stabs.
1625 Instead it will generate cross reference ('x') of names.
1626 This uses the same flag as DECL_EXTERNAL. */
1627 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1628 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1630 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1631 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1633 /* In LABEL_DECL nodes, nonzero means that an error message about
1634 jumping into such a binding contour has been printed for this label. */
1635 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1637 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1638 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1640 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1641 static chain is not needed. */
1642 #define DECL_NO_STATIC_CHAIN(NODE) \
1643 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1645 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1646 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1648 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1650 Also set in some languages for variables, etc., outside the normal
1651 lexical scope, such as class instance variables. */
1652 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1654 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1655 where it is called. */
1656 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1658 /* Nonzero in a FUNCTION_DECL means this function has been found inlinable
1659 only by virtue of -finline-functions */
1660 #define DID_INLINE_FUNC(NODE) \
1661 (FUNCTION_DECL_CHECK (NODE)->decl.inlined_function_flag)
1663 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1664 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1666 /* In a VAR_DECL, nonzero if the data should be allocated from
1667 thread-local storage. */
1668 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1670 /* In a FUNCTION_DECL, the saved representation of the body of the
1671 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1672 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1673 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1675 /* List of FUNCTION_DECLs inlined into this function's body. */
1676 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1678 /* Nonzero in a FUNCTION_DECL means this function should be treated
1679 as if it were a malloc, meaning it returns a pointer that is
1681 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1683 /* Nonzero in a FUNCTION_DECL means this function should be treated
1684 as "pure" function (like const function, but may read global memory). */
1685 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1687 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1689 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1691 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1692 contour that restored a stack level and which is now exited. */
1693 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1695 /* Unused in FUNCTION_DECL. */
1697 /* In a VAR_DECL that's static,
1698 nonzero if the space is in the text section. */
1699 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1701 /* In a FUNCTION_DECL, nonzero means a built in function. */
1702 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1704 /* For a builtin function, identify which part of the compiler defined it. */
1705 #define DECL_BUILT_IN_CLASS(NODE) \
1706 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1708 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1709 Used in FIELD_DECLs for vtable pointers.
1710 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1711 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1713 /* Used to indicate that the linkage status of this DECL is not yet known,
1714 so it should not be output now. */
1715 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1717 /* Used in PARM_DECLs whose type are unions to indicate that the
1718 argument should be passed in the same way that the first union
1719 alternative would be passed. */
1720 #define DECL_TRANSPARENT_UNION(NODE) \
1721 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1723 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1724 at the beginning or end of execution. */
1725 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1726 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1728 #define DECL_STATIC_DESTRUCTOR(NODE) \
1729 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1731 /* Used to indicate that this DECL represents a compiler-generated entity. */
1732 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1734 /* Used to indicate that this DECL has weak linkage. */
1735 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1737 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1738 multiple translation units should be merged. */
1739 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1741 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1742 not be put out unless it is needed in this translation unit.
1743 Entities like this are shared across translation units (like weak
1744 entities), but are guaranteed to be generated by any translation
1745 unit that needs them, and therefore need not be put out anywhere
1746 where they are not needed. DECL_COMDAT is just a hint to the
1747 back-end; it is up to front-ends which set this flag to ensure
1748 that there will never be any harm, other than bloat, in putting out
1749 something which is DECL_COMDAT. */
1750 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1752 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1753 be instrumented with calls to support routines. */
1754 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1755 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1757 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1758 disabled in this function. */
1759 #define DECL_NO_LIMIT_STACK(NODE) \
1760 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1762 /* Additional flags for language-specific uses. */
1763 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1764 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1765 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1766 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1767 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1768 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1769 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1770 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1772 /* Used to indicate that the pointer to this DECL cannot be treated as
1773 an address constant. */
1774 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1776 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1778 #define DECL_NONADDRESSABLE_P(NODE) \
1779 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1781 /* Used to indicate an alias set for the memory pointed to by this
1782 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1783 pointer (or reference) type. */
1784 #define DECL_POINTER_ALIAS_SET(NODE) \
1785 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1787 /* Nonzero if an alias set has been assigned to this declaration. */
1788 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1789 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1793 struct tree_decl
GTY(())
1795 struct tree_common common
;
1799 ENUM_BITFIELD(machine_mode
) mode
: 8;
1801 unsigned external_flag
: 1;
1802 unsigned nonlocal_flag
: 1;
1803 unsigned regdecl_flag
: 1;
1804 unsigned inline_flag
: 1;
1805 unsigned bit_field_flag
: 1;
1806 unsigned virtual_flag
: 1;
1807 unsigned ignored_flag
: 1;
1808 unsigned abstract_flag
: 1;
1810 unsigned in_system_header_flag
: 1;
1811 unsigned common_flag
: 1;
1812 unsigned defer_output
: 1;
1813 unsigned transparent_union
: 1;
1814 unsigned static_ctor_flag
: 1;
1815 unsigned static_dtor_flag
: 1;
1816 unsigned artificial_flag
: 1;
1817 unsigned weak_flag
: 1;
1819 unsigned non_addr_const_p
: 1;
1820 unsigned no_instrument_function_entry_exit
: 1;
1821 unsigned comdat_flag
: 1;
1822 unsigned malloc_flag
: 1;
1823 unsigned no_limit_stack
: 1;
1824 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
1825 unsigned pure_flag
: 1;
1827 unsigned non_addressable
: 1;
1828 unsigned user_align
: 1;
1829 unsigned uninlinable
: 1;
1830 unsigned thread_local_flag
: 1;
1831 unsigned inlined_function_flag
: 1;
1832 unsigned unused
: 3;
1833 /* three unused bits. */
1835 unsigned lang_flag_0
: 1;
1836 unsigned lang_flag_1
: 1;
1837 unsigned lang_flag_2
: 1;
1838 unsigned lang_flag_3
: 1;
1839 unsigned lang_flag_4
: 1;
1840 unsigned lang_flag_5
: 1;
1841 unsigned lang_flag_6
: 1;
1842 unsigned lang_flag_7
: 1;
1844 union tree_decl_u1
{
1845 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1846 DECL_FUNCTION_CODE. */
1847 enum built_in_function f
;
1848 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
1849 is used by language-dependent code. */
1851 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1853 struct tree_decl_u1_a
{
1854 unsigned int align
: 24;
1855 unsigned int off_align
: 8;
1857 } GTY ((skip (""))) u1
;
1862 tree arguments
; /* Also used for DECL_FIELD_OFFSET */
1863 tree result
; /* Also used for DECL_BIT_FIELD_TYPE */
1864 tree initial
; /* Also used for DECL_QUALIFIER */
1865 tree abstract_origin
;
1866 tree assembler_name
;
1869 rtx rtl
; /* RTL representation for object. */
1871 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1872 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1873 In PARM_DECL, holds an RTL for the stack slot
1874 of register where the data was actually passed.
1875 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1876 union tree_decl_u2
{
1877 struct function
* GTY ((tag ("FUNCTION_DECL"))) f
;
1878 rtx
GTY ((tag ("PARM_DECL"))) r
;
1879 tree
GTY ((tag ("FIELD_DECL"))) t
;
1880 int GTY ((tag ("VAR_DECL"))) i
;
1881 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2
;
1883 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1886 /* In a FUNCTION_DECL, these are function data which is to be kept
1887 as long as FUNCTION_DECL is kept. */
1891 HOST_WIDE_INT pointer_alias_set
;
1892 /* Points to a structure whose details depend on the language in use. */
1893 struct lang_decl
*lang_specific
;
1896 enum tree_node_structure_enum
{
1913 /* Define the overall contents of a tree node.
1914 It may be any of the structures declared above
1915 for various types of node. */
1917 union tree_node
GTY ((ptr_alias (union lang_tree_node
),
1918 desc ("tree_node_structure (&%h)")))
1920 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
1921 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
1922 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
1923 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
1924 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
1925 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
1926 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
1927 struct tree_decl
GTY ((tag ("TS_DECL"))) decl
;
1928 struct tree_type
GTY ((tag ("TS_TYPE"))) type
;
1929 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
1930 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
1931 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
1932 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
1935 /* Standard named or nameless data types of the C compiler. */
1954 TI_INTEGER_MINUS_ONE
,
1964 TI_COMPLEX_INTEGER_TYPE
,
1965 TI_COMPLEX_FLOAT_TYPE
,
1966 TI_COMPLEX_DOUBLE_TYPE
,
1967 TI_COMPLEX_LONG_DOUBLE_TYPE
,
1971 TI_LONG_DOUBLE_TYPE
,
2013 extern GTY(()) tree global_trees
[TI_MAX
];
2015 #define error_mark_node global_trees[TI_ERROR_MARK]
2017 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2018 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2019 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2020 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2021 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2023 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2024 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2025 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2026 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2027 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2029 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2030 #define integer_one_node global_trees[TI_INTEGER_ONE]
2031 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2032 #define size_zero_node global_trees[TI_SIZE_ZERO]
2033 #define size_one_node global_trees[TI_SIZE_ONE]
2034 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2035 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2036 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2038 /* Base access nodes. */
2039 #define access_public_node NULL_TREE
2040 #define access_protected_node size_zero_node
2041 #define access_private_node size_one_node
2043 #define null_pointer_node global_trees[TI_NULL_POINTER]
2045 #define float_type_node global_trees[TI_FLOAT_TYPE]
2046 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2047 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2049 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2050 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2051 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2052 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2054 #define void_type_node global_trees[TI_VOID_TYPE]
2055 /* The C type `void *'. */
2056 #define ptr_type_node global_trees[TI_PTR_TYPE]
2057 /* The C type `const void *'. */
2058 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2059 /* The C type `size_t'. */
2060 #define size_type_node global_trees[TI_SIZE_TYPE]
2061 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2062 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2064 /* The node that should be placed at the end of a parameter list to
2065 indicate that the function does not take a variable number of
2066 arguments. The TREE_VALUE will be void_type_node and there will be
2067 no TREE_CHAIN. Language-independent code should not assume
2068 anything else about this node. */
2069 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2071 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2072 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2074 #define unsigned_V16QI_type_node global_trees[TI_UV16QI_TYPE]
2075 #define unsigned_V4SI_type_node global_trees[TI_UV4SI_TYPE]
2076 #define unsigned_V8QI_type_node global_trees[TI_UV8QI_TYPE]
2077 #define unsigned_V8HI_type_node global_trees[TI_UV8HI_TYPE]
2078 #define unsigned_V4HI_type_node global_trees[TI_UV4HI_TYPE]
2079 #define unsigned_V2HI_type_node global_trees[TI_UV2HI_TYPE]
2080 #define unsigned_V2SI_type_node global_trees[TI_UV2SI_TYPE]
2081 #define unsigned_V2DI_type_node global_trees[TI_UV2DI_TYPE]
2082 #define unsigned_V1DI_type_node global_trees[TI_UV1DI_TYPE]
2084 #define V16QI_type_node global_trees[TI_V16QI_TYPE]
2085 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
2086 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
2087 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
2088 #define V8HI_type_node global_trees[TI_V8HI_TYPE]
2089 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
2090 #define V2HI_type_node global_trees[TI_V2HI_TYPE]
2091 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
2092 #define V2SF_type_node global_trees[TI_V2SF_TYPE]
2093 #define V2DI_type_node global_trees[TI_V2DI_TYPE]
2094 #define V2DF_type_node global_trees[TI_V2DF_TYPE]
2095 #define V16SF_type_node global_trees[TI_V16SF_TYPE]
2096 #define V1DI_type_node global_trees[TI_V1DI_TYPE]
2098 /* An enumeration of the standard C integer types. These must be
2099 ordered so that shorter types appear before longer ones, and so
2100 that signed types appear before unsigned ones, for the correct
2101 functioning of interpret_integer() in c-lex.c. */
2102 enum integer_type_kind
2114 itk_unsigned_long_long
,
2118 typedef enum integer_type_kind integer_type_kind
;
2120 /* The standard C integer types. Use integer_type_kind to index into
2122 extern GTY(()) tree integer_types
[itk_none
];
2124 #define char_type_node integer_types[itk_char]
2125 #define signed_char_type_node integer_types[itk_signed_char]
2126 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2127 #define short_integer_type_node integer_types[itk_short]
2128 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2129 #define integer_type_node integer_types[itk_int]
2130 #define unsigned_type_node integer_types[itk_unsigned_int]
2131 #define long_integer_type_node integer_types[itk_long]
2132 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2133 #define long_long_integer_type_node integer_types[itk_long_long]
2134 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2136 /* Set to the default thread-local storage (tls) model to use. */
2139 TLS_MODEL_GLOBAL_DYNAMIC
= 1,
2140 TLS_MODEL_LOCAL_DYNAMIC
,
2141 TLS_MODEL_INITIAL_EXEC
,
2142 TLS_MODEL_LOCAL_EXEC
2145 extern enum tls_model flag_tls_default
;
2147 /* Enumerate visibility settings. */
2149 enum symbol_visibility
2152 VISIBILITY_INTERNAL
,
2154 VISIBILITY_PROTECTED
2157 /* A pointer-to-function member type looks like:
2164 If __pfn is NULL, it is a NULL pointer-to-member-function.
2166 (Because the vtable is always the first thing in the object, we
2167 don't need its offset.) If the function is virtual, then PFN is
2168 one plus twice the index into the vtable; otherwise, it is just a
2169 pointer to the function.
2171 Unfortunately, using the lowest bit of PFN doesn't work in
2172 architectures that don't impose alignment requirements on function
2173 addresses, or that use the lowest bit to tell one ISA from another,
2174 for example. For such architectures, we use the lowest bit of
2175 DELTA instead of the lowest bit of the PFN, and DELTA will be
2178 enum ptrmemfunc_vbit_where_t
2180 ptrmemfunc_vbit_in_pfn
,
2181 ptrmemfunc_vbit_in_delta
2184 #define NULL_TREE (tree) NULL
2186 /* Approximate positive square root of a host double. This is for
2187 statistical reports, not code generation. */
2188 extern double approx_sqrt
PARAMS ((double));
2190 extern tree decl_assembler_name
PARAMS ((tree
));
2192 /* Compute the number of bytes occupied by 'node'. This routine only
2193 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2195 extern size_t tree_size
PARAMS ((tree
));
2197 /* Lowest level primitive for allocating a node.
2198 The TREE_CODE is the only argument. Contents are initialized
2199 to zero except for a few of the common fields. */
2201 extern tree make_node
PARAMS ((enum tree_code
));
2203 /* Make a copy of a node, with all the same contents. */
2205 extern tree copy_node
PARAMS ((tree
));
2207 /* Make a copy of a chain of TREE_LIST nodes. */
2209 extern tree copy_list
PARAMS ((tree
));
2211 /* Make a TREE_VEC. */
2213 extern tree make_tree_vec
PARAMS ((int));
2215 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2216 The name is supplied as a char *. */
2218 extern tree get_identifier
PARAMS ((const char *));
2220 /* Identical to get_identifier, except that the length is assumed
2223 extern tree get_identifier_with_length
PARAMS ((const char *, unsigned int));
2225 /* If an identifier with the name TEXT (a null-terminated string) has
2226 previously been referred to, return that node; otherwise return
2229 extern tree maybe_get_identifier
PARAMS ((const char *));
2231 /* Construct various types of nodes. */
2233 #define build_int_2(LO, HI) \
2234 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2236 extern tree build
PARAMS ((enum tree_code
, tree
, ...));
2237 extern tree build_nt
PARAMS ((enum tree_code
, ...));
2239 extern tree build_int_2_wide
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
));
2240 extern tree build_vector
PARAMS ((tree
, tree
));
2241 extern tree build_constructor
PARAMS ((tree
, tree
));
2242 extern tree build_real_from_int_cst
PARAMS ((tree
, tree
));
2243 extern tree build_complex
PARAMS ((tree
, tree
, tree
));
2244 extern tree build_string
PARAMS ((int, const char *));
2245 extern tree build1
PARAMS ((enum tree_code
, tree
, tree
));
2246 extern tree build_tree_list
PARAMS ((tree
, tree
));
2247 extern tree build_decl
PARAMS ((enum tree_code
, tree
, tree
));
2248 extern tree build_block
PARAMS ((tree
, tree
, tree
, tree
, tree
));
2249 extern tree build_expr_wfl
PARAMS ((tree
, const char *, int, int));
2251 /* Construct various nodes representing data types. */
2253 extern tree make_signed_type
PARAMS ((int));
2254 extern tree make_unsigned_type
PARAMS ((int));
2255 extern void initialize_sizetypes
PARAMS ((void));
2256 extern void set_sizetype
PARAMS ((tree
));
2257 extern void fixup_unsigned_type
PARAMS ((tree
));
2258 extern tree build_pointer_type_for_mode
PARAMS ((tree
, enum machine_mode
));
2259 extern tree build_pointer_type
PARAMS ((tree
));
2260 extern tree build_reference_type_for_mode
PARAMS ((tree
, enum machine_mode
));
2261 extern tree build_reference_type
PARAMS ((tree
));
2262 extern tree build_type_no_quals
PARAMS ((tree
));
2263 extern tree build_index_type
PARAMS ((tree
));
2264 extern tree build_index_2_type
PARAMS ((tree
, tree
));
2265 extern tree build_array_type
PARAMS ((tree
, tree
));
2266 extern tree build_function_type
PARAMS ((tree
, tree
));
2267 extern tree build_function_type_list
PARAMS ((tree
, ...));
2268 extern tree build_method_type
PARAMS ((tree
, tree
));
2269 extern tree build_offset_type
PARAMS ((tree
, tree
));
2270 extern tree build_complex_type
PARAMS ((tree
));
2271 extern tree array_type_nelts
PARAMS ((tree
));
2273 extern tree value_member
PARAMS ((tree
, tree
));
2274 extern tree purpose_member
PARAMS ((tree
, tree
));
2275 extern tree binfo_member
PARAMS ((tree
, tree
));
2276 extern unsigned int attribute_hash_list
PARAMS ((tree
));
2277 extern int attribute_list_equal
PARAMS ((tree
, tree
));
2278 extern int attribute_list_contained
PARAMS ((tree
, tree
));
2279 extern int tree_int_cst_equal
PARAMS ((tree
, tree
));
2280 extern int tree_int_cst_lt
PARAMS ((tree
, tree
));
2281 extern int tree_int_cst_compare
PARAMS ((tree
, tree
));
2282 extern int host_integerp
PARAMS ((tree
, int));
2283 extern HOST_WIDE_INT tree_low_cst
PARAMS ((tree
, int));
2284 extern int tree_int_cst_msb
PARAMS ((tree
));
2285 extern int tree_int_cst_sgn
PARAMS ((tree
));
2286 extern int tree_expr_nonnegative_p
PARAMS ((tree
));
2287 extern int rtl_expr_nonnegative_p
PARAMS ((rtx
));
2288 extern tree get_inner_array_type
PARAMS ((tree
));
2290 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2291 put the prototype here. Rtl.h does declare the prototype if
2292 tree.h had been included. */
2294 extern tree make_tree
PARAMS ((tree
, rtx
));
2296 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2299 Such modified types already made are recorded so that duplicates
2302 extern tree build_type_attribute_variant
PARAMS ((tree
, tree
));
2303 extern tree build_decl_attribute_variant
PARAMS ((tree
, tree
));
2305 /* Structure describing an attribute and a function to handle it. */
2306 struct attribute_spec
2308 /* The name of the attribute (without any leading or trailing __),
2309 or NULL to mark the end of a table of attributes. */
2310 const char *const name
;
2311 /* The minimum length of the list of arguments of the attribute. */
2312 const int min_length
;
2313 /* The maximum length of the list of arguments of the attribute
2314 (-1 for no maximum). */
2315 const int max_length
;
2316 /* Whether this attribute requires a DECL. If it does, it will be passed
2317 from types of DECLs, function return types and array element types to
2318 the DECLs, function types and array types respectively; but when
2319 applied to a type in any other circumstances, it will be ignored with
2320 a warning. (If greater control is desired for a given attribute,
2321 this should be false, and the flags argument to the handler may be
2322 used to gain greater control in that case.) */
2323 const bool decl_required
;
2324 /* Whether this attribute requires a type. If it does, it will be passed
2325 from a DECL to the type of that DECL. */
2326 const bool type_required
;
2327 /* Whether this attribute requires a function (or method) type. If it does,
2328 it will be passed from a function pointer type to the target type,
2329 and from a function return type (which is not itself a function
2330 pointer type) to the function type. */
2331 const bool function_type_required
;
2332 /* Function to handle this attribute. NODE points to the node to which
2333 the attribute is to be applied. If a DECL, it should be modified in
2334 place; if a TYPE, a copy should be created. NAME is the name of the
2335 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2336 of the arguments (which may be NULL). FLAGS gives further information
2337 about the context of the attribute. Afterwards, the attributes will
2338 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2339 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2340 as well as in any other cases when the attributes should not be added
2341 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2342 applied to another type or DECL later may be returned;
2343 otherwise the return value should be NULL_TREE. This pointer may be
2344 NULL if no special handling is required beyond the checks implied
2345 by the rest of this structure. */
2346 tree (*const handler
) PARAMS ((tree
*node
, tree name
, tree args
,
2347 int flags
, bool *no_add_attrs
));
2350 /* Flags that may be passed in the third argument of decl_attributes, and
2351 to handler functions for attributes. */
2352 enum attribute_flags
2354 /* The type passed in is the type of a DECL, and any attributes that
2355 should be passed in again to be applied to the DECL rather than the
2356 type should be returned. */
2357 ATTR_FLAG_DECL_NEXT
= 1,
2358 /* The type passed in is a function return type, and any attributes that
2359 should be passed in again to be applied to the function type rather
2360 than the return type should be returned. */
2361 ATTR_FLAG_FUNCTION_NEXT
= 2,
2362 /* The type passed in is an array element type, and any attributes that
2363 should be passed in again to be applied to the array type rather
2364 than the element type should be returned. */
2365 ATTR_FLAG_ARRAY_NEXT
= 4,
2366 /* The type passed in is a structure, union or enumeration type being
2367 created, and should be modified in place. */
2368 ATTR_FLAG_TYPE_IN_PLACE
= 8,
2369 /* The attributes are being applied by default to a library function whose
2370 name indicates known behavior, and should be silently ignored if they
2371 are not in fact compatible with the function type. */
2372 ATTR_FLAG_BUILT_IN
= 16
2375 /* Default versions of target-overridable functions. */
2377 extern tree merge_decl_attributes
PARAMS ((tree
, tree
));
2378 extern tree merge_type_attributes
PARAMS ((tree
, tree
));
2379 extern void default_register_cpp_builtins
PARAMS ((struct cpp_reader
*));
2381 /* Split a list of declspecs and attributes into two. */
2383 extern void split_specs_attrs
PARAMS ((tree
, tree
*, tree
*));
2385 /* Strip attributes from a list of combined specs and attrs. */
2387 extern tree strip_attrs
PARAMS ((tree
));
2389 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2391 extern int valid_machine_attribute
PARAMS ((tree
, tree
, tree
, tree
));
2393 /* Given a tree node and a string, return nonzero if the tree node is
2394 a valid attribute name for the string. */
2396 extern int is_attribute_p
PARAMS ((const char *, tree
));
2398 /* Given an attribute name and a list of attributes, return the list element
2399 of the attribute or NULL_TREE if not found. */
2401 extern tree lookup_attribute
PARAMS ((const char *, tree
));
2403 /* Given two attributes lists, return a list of their union. */
2405 extern tree merge_attributes
PARAMS ((tree
, tree
));
2407 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2408 /* Given two Windows decl attributes lists, possibly including
2409 dllimport, return a list of their union . */
2410 extern tree merge_dllimport_decl_attributes
PARAMS ((tree
, tree
));
2413 /* Return a version of the TYPE, qualified as indicated by the
2414 TYPE_QUALS, if one exists. If no qualified version exists yet,
2415 return NULL_TREE. */
2417 extern tree get_qualified_type
PARAMS ((tree
, int));
2419 /* Like get_qualified_type, but creates the type if it does not
2420 exist. This function never returns NULL_TREE. */
2422 extern tree build_qualified_type
PARAMS ((tree
, int));
2424 /* Like build_qualified_type, but only deals with the `const' and
2425 `volatile' qualifiers. This interface is retained for backwards
2426 compatibility with the various front-ends; new code should use
2427 build_qualified_type instead. */
2429 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2430 build_qualified_type ((TYPE), \
2431 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2432 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2434 /* Make a copy of a type node. */
2436 extern tree build_type_copy
PARAMS ((tree
));
2438 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2439 fields. Optionally specify an alignment, and then lsy it out. */
2441 extern void finish_builtin_struct
PARAMS ((tree
, const char *,
2444 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2445 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2446 node, does nothing except for the first time. */
2448 extern void layout_type
PARAMS ((tree
));
2450 /* These functions allow a front-end to perform a manual layout of a
2451 RECORD_TYPE. (For instance, if the placement of subsequent fields
2452 depends on the placement of fields so far.) Begin by calling
2453 start_record_layout. Then, call place_field for each of the
2454 fields. Then, call finish_record_layout. See layout_type for the
2455 default way in which these functions are used. */
2457 typedef struct record_layout_info_s
2459 /* The RECORD_TYPE that we are laying out. */
2461 /* The offset into the record so far, in bytes, not including bits in
2464 /* The last known alignment of SIZE. */
2465 unsigned int offset_align
;
2466 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2468 /* The alignment of the record so far, in bits. */
2469 unsigned int record_align
;
2470 /* The alignment of the record so far, ignoring #pragma pack and
2471 __attribute__ ((packed)), in bits. */
2472 unsigned int unpacked_align
;
2473 /* The previous field layed out. */
2475 /* The static variables (i.e., class variables, as opposed to
2476 instance variables) encountered in T. */
2477 tree pending_statics
;
2478 /* Bits remaining in the current alignment group */
2479 int remaining_in_alignment
;
2480 /* True if we've seen a packed field that didn't have normal
2481 alignment anyway. */
2482 int packed_maybe_necessary
;
2483 } *record_layout_info
;
2485 extern void set_lang_adjust_rli
PARAMS ((void (*) PARAMS
2486 ((record_layout_info
))));
2487 extern record_layout_info start_record_layout
PARAMS ((tree
));
2488 extern tree bit_from_pos
PARAMS ((tree
, tree
));
2489 extern tree byte_from_pos
PARAMS ((tree
, tree
));
2490 extern void pos_from_bit
PARAMS ((tree
*, tree
*, unsigned int,
2492 extern void normalize_offset
PARAMS ((tree
*, tree
*,
2494 extern tree rli_size_unit_so_far
PARAMS ((record_layout_info
));
2495 extern tree rli_size_so_far
PARAMS ((record_layout_info
));
2496 extern void normalize_rli
PARAMS ((record_layout_info
));
2497 extern void place_field
PARAMS ((record_layout_info
, tree
));
2498 extern void compute_record_mode
PARAMS ((tree
));
2499 extern void finish_record_layout
PARAMS ((record_layout_info
, int));
2501 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2502 return a canonicalized ..._TYPE node, so that duplicates are not made.
2503 How the hash code is computed is up to the caller, as long as any two
2504 callers that could hash identical-looking type nodes agree. */
2506 extern tree type_hash_canon
PARAMS ((unsigned int, tree
));
2508 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2509 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2510 fields. Call this only once for any given decl node.
2512 Second argument is the boundary that this field can be assumed to
2513 be starting at (in bits). Zero means it can be assumed aligned
2514 on any boundary that may be needed. */
2516 extern void layout_decl
PARAMS ((tree
, unsigned));
2518 /* Return the mode for data of a given size SIZE and mode class CLASS.
2519 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2520 The value is BLKmode if no other mode is found. This is like
2521 mode_for_size, but is passed a tree. */
2523 extern enum machine_mode mode_for_size_tree
PARAMS ((tree
, enum mode_class
,
2526 /* Return an expr equal to X but certainly not valid as an lvalue. */
2528 extern tree non_lvalue
PARAMS ((tree
));
2529 extern tree pedantic_non_lvalue
PARAMS ((tree
));
2531 extern tree convert
PARAMS ((tree
, tree
));
2532 extern unsigned int expr_align
PARAMS ((tree
));
2533 extern tree size_in_bytes
PARAMS ((tree
));
2534 extern HOST_WIDE_INT int_size_in_bytes
PARAMS ((tree
));
2535 extern tree bit_position
PARAMS ((tree
));
2536 extern HOST_WIDE_INT int_bit_position
PARAMS ((tree
));
2537 extern tree byte_position
PARAMS ((tree
));
2538 extern HOST_WIDE_INT int_byte_position
PARAMS ((tree
));
2540 /* Define data structures, macros, and functions for handling sizes
2541 and the various types used to represent sizes. */
2545 SIZETYPE
, /* Normal representation of sizes in bytes. */
2546 SSIZETYPE
, /* Signed representation of sizes in bytes. */
2547 USIZETYPE
, /* Unsigned representation of sizes in bytes. */
2548 BITSIZETYPE
, /* Normal representation of sizes in bits. */
2549 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
2550 UBITSIZETYPE
, /* Unsifgned representation of sizes in bits. */
2553 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
2555 #define sizetype sizetype_tab[(int) SIZETYPE]
2556 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2557 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2558 #define usizetype sizetype_tab[(int) USIZETYPE]
2559 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2560 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2562 extern tree size_binop
PARAMS ((enum tree_code
, tree
, tree
));
2563 extern tree size_diffop
PARAMS ((tree
, tree
));
2564 extern tree size_int_wide
PARAMS ((HOST_WIDE_INT
,
2565 enum size_type_kind
));
2566 extern tree size_int_type_wide
PARAMS ((HOST_WIDE_INT
, tree
));
2568 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2569 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2570 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2571 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2572 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2574 extern tree round_up
PARAMS ((tree
, int));
2575 extern tree round_down
PARAMS ((tree
, int));
2576 extern tree get_pending_sizes
PARAMS ((void));
2577 extern int is_pending_size
PARAMS ((tree
));
2578 extern void put_pending_size
PARAMS ((tree
));
2579 extern void put_pending_sizes
PARAMS ((tree
));
2581 /* Type for sizes of data-type. */
2583 #define BITS_PER_UNIT_LOG \
2584 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2585 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2586 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2588 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2589 extern unsigned int maximum_field_alignment
;
2591 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2592 extern unsigned int set_alignment
;
2594 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2595 by making the last node in X point to Y.
2596 Returns X, except if X is 0 returns Y. */
2598 extern tree chainon
PARAMS ((tree
, tree
));
2600 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2602 extern tree tree_cons
PARAMS ((tree
, tree
, tree
));
2604 /* Return the last tree node in a chain. */
2606 extern tree tree_last
PARAMS ((tree
));
2608 /* Reverse the order of elements in a chain, and return the new head. */
2610 extern tree nreverse
PARAMS ((tree
));
2612 /* Returns the length of a chain of nodes
2613 (number of chain pointers to follow before reaching a null pointer). */
2615 extern int list_length
PARAMS ((tree
));
2617 /* Returns the number of FIELD_DECLs in a type. */
2619 extern int fields_length
PARAMS ((tree
));
2621 /* Given an initializer INIT, return TRUE if INIT is zero or some
2622 aggregate of zeros. Otherwise return FALSE. */
2624 extern bool initializer_zerop
PARAMS ((tree
));
2626 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2628 extern int integer_zerop
PARAMS ((tree
));
2630 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2632 extern int integer_onep
PARAMS ((tree
));
2634 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2635 all of whose significant bits are 1. */
2637 extern int integer_all_onesp
PARAMS ((tree
));
2639 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2640 exactly one bit 1. */
2642 extern int integer_pow2p
PARAMS ((tree
));
2644 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
2645 with a nonzero value. */
2647 extern int integer_nonzerop
PARAMS ((tree
));
2649 /* staticp (tree x) is nonzero if X is a reference to data allocated
2650 at a fixed address in memory. */
2652 extern int staticp
PARAMS ((tree
));
2654 /* Gets an error if argument X is not an lvalue.
2655 Also returns 1 if X is an lvalue, 0 if not. */
2657 extern int lvalue_or_else
PARAMS ((tree
, const char *));
2659 /* save_expr (EXP) returns an expression equivalent to EXP
2660 but it can be used multiple times within context CTX
2661 and only evaluate EXP once. */
2663 extern tree save_expr
PARAMS ((tree
));
2665 /* Look inside EXPR and into any simple arithmetic operations. Return
2666 the innermost non-arithmetic node. */
2668 extern tree skip_simple_arithmetic
PARAMS ((tree
));
2670 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
2671 SAVE_EXPR. Return FALSE otherwise. */
2673 extern bool saved_expr_p
PARAMS ((tree
));
2675 /* Returns the index of the first non-tree operand for CODE, or the number
2676 of operands if all are trees. */
2678 extern int first_rtl_op
PARAMS ((enum tree_code
));
2680 /* Return which tree structure is used by T. */
2682 enum tree_node_structure_enum tree_node_structure
PARAMS ((tree
));
2684 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2685 can be used multiple times and will evaluate EXP in its entirety
2688 extern tree unsave_expr
PARAMS ((tree
));
2690 /* Reset EXP in place so that it can be expanded again. Does not
2691 recurse into subtrees. */
2693 extern void unsave_expr_1
PARAMS ((tree
));
2695 /* Return 0 if it is safe to evaluate EXPR multiple times,
2696 return 1 if it is safe if EXPR is unsaved afterward, or
2697 return 2 if it is completely unsafe. */
2698 extern int unsafe_for_reeval
PARAMS ((tree
));
2700 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2701 or offset that depends on a field within a record.
2703 Note that we only allow such expressions within simple arithmetic
2706 extern int contains_placeholder_p
PARAMS ((tree
));
2708 /* Return 1 if EXP contains any expressions that produce cleanups for an
2709 outer scope to deal with. Used by fold. */
2711 extern int has_cleanups
PARAMS ((tree
));
2713 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2714 return a tree with all occurrences of references to F in a
2715 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2716 contains only arithmetic expressions. */
2718 extern tree substitute_in_expr
PARAMS ((tree
, tree
, tree
));
2720 /* variable_size (EXP) is like save_expr (EXP) except that it
2721 is for the special case of something that is part of a
2722 variable size for a data type. It makes special arrangements
2723 to compute the value at the right time when the data type
2724 belongs to a function parameter. */
2726 extern tree variable_size
PARAMS ((tree
));
2728 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2729 but it can be used multiple times
2730 and only evaluate the subexpressions once. */
2732 extern tree stabilize_reference
PARAMS ((tree
));
2734 /* Subroutine of stabilize_reference; this is called for subtrees of
2735 references. Any expression with side-effects must be put in a SAVE_EXPR
2736 to ensure that it is only evaluated once. */
2738 extern tree stabilize_reference_1
PARAMS ((tree
));
2740 /* Return EXP, stripped of any conversions to wider types
2741 in such a way that the result of converting to type FOR_TYPE
2742 is the same as if EXP were converted to FOR_TYPE.
2743 If FOR_TYPE is 0, it signifies EXP's type. */
2745 extern tree get_unwidened
PARAMS ((tree
, tree
));
2747 /* Return OP or a simpler expression for a narrower value
2748 which can be sign-extended or zero-extended to give back OP.
2749 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2750 or 0 if the value should be sign-extended. */
2752 extern tree get_narrower
PARAMS ((tree
, int *));
2754 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2755 look for nested component-refs or array-refs at constant positions
2756 and find the ultimate containing object, which is returned. */
2758 extern tree get_inner_reference
PARAMS ((tree
, HOST_WIDE_INT
*,
2759 HOST_WIDE_INT
*, tree
*,
2760 enum machine_mode
*, int *,
2763 /* Return 1 if T is an expression that get_inner_reference handles. */
2765 extern int handled_component_p
PARAMS ((tree
));
2767 /* Given a DECL or TYPE, return the scope in which it was declared, or
2768 NUL_TREE if there is no containing scope. */
2770 extern tree get_containing_scope
PARAMS ((tree
));
2772 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2774 extern tree decl_function_context
PARAMS ((tree
));
2776 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2777 this _DECL with its context, or zero if none. */
2778 extern tree decl_type_context
PARAMS ((tree
));
2780 /* Given the FUNCTION_DECL for the current function,
2781 return zero if it is ok for this function to be inline.
2782 Otherwise return a warning message with a single %s
2783 for the function's name. */
2785 extern const char *function_cannot_inline_p
PARAMS ((tree
));
2787 /* Return 1 if EXPR is the real constant zero. */
2788 extern int real_zerop
PARAMS ((tree
));
2790 /* Declare commonly used variables for tree structure. */
2792 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2793 Zero means allow extended lvalues. */
2795 extern int pedantic_lvalues
;
2797 /* Nonzero means can safely call expand_expr now;
2798 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2800 extern int immediate_size_expand
;
2802 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2804 extern GTY(()) tree current_function_decl
;
2806 /* Nonzero means a FUNC_BEGIN label was emitted. */
2807 extern GTY(()) tree current_function_func_begin_label
;
2809 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2811 extern int all_types_permanent
;
2813 /* Declare a predefined function. Return the declaration. This function is
2814 provided by each language frontend. */
2815 extern tree builtin_function
PARAMS ((const char *, tree
, int,
2816 enum built_in_class
,
2817 const char *, tree
));
2820 extern void clean_symbol_name
PARAMS ((char *));
2821 extern tree get_file_function_name_long
PARAMS ((const char *));
2822 extern tree get_set_constructor_bits
PARAMS ((tree
, char *, int));
2823 extern tree get_set_constructor_bytes
PARAMS ((tree
,
2824 unsigned char *, int));
2825 extern tree get_callee_fndecl
PARAMS ((tree
));
2826 extern void set_decl_assembler_name
PARAMS ((tree
));
2827 extern int type_num_arguments
PARAMS ((tree
));
2828 extern tree lhd_unsave_expr_now
PARAMS ((tree
));
2833 extern void expand_fixups
PARAMS ((rtx
));
2834 extern tree expand_start_stmt_expr
PARAMS ((int));
2835 extern tree expand_end_stmt_expr
PARAMS ((tree
));
2836 extern void expand_expr_stmt
PARAMS ((tree
));
2837 extern void expand_expr_stmt_value
PARAMS ((tree
, int, int));
2838 extern int warn_if_unused_value
PARAMS ((tree
));
2839 extern void expand_decl_init
PARAMS ((tree
));
2840 extern void clear_last_expr
PARAMS ((void));
2841 extern void expand_label
PARAMS ((tree
));
2842 extern void expand_goto
PARAMS ((tree
));
2843 extern void expand_asm
PARAMS ((tree
, int));
2844 extern void expand_start_cond
PARAMS ((tree
, int));
2845 extern void expand_end_cond
PARAMS ((void));
2846 extern void expand_start_else
PARAMS ((void));
2847 extern void expand_start_elseif
PARAMS ((tree
));
2848 extern struct nesting
*expand_start_loop
PARAMS ((int));
2849 extern struct nesting
*expand_start_loop_continue_elsewhere
PARAMS ((int));
2850 extern struct nesting
*expand_start_null_loop
PARAMS ((void));
2851 extern void expand_loop_continue_here
PARAMS ((void));
2852 extern void expand_end_loop
PARAMS ((void));
2853 extern void expand_end_null_loop
PARAMS ((void));
2854 extern int expand_continue_loop
PARAMS ((struct nesting
*));
2855 extern int expand_exit_loop
PARAMS ((struct nesting
*));
2856 extern int expand_exit_loop_if_false
PARAMS ((struct nesting
*,
2858 extern int expand_exit_loop_top_cond
PARAMS ((struct nesting
*,
2860 extern int expand_exit_something
PARAMS ((void));
2862 extern void expand_return
PARAMS ((tree
));
2863 extern int optimize_tail_recursion
PARAMS ((tree
, rtx
));
2864 extern void expand_start_bindings_and_block
PARAMS ((int, tree
));
2865 #define expand_start_bindings(flags) \
2866 expand_start_bindings_and_block(flags, NULL_TREE)
2867 extern void expand_end_bindings
PARAMS ((tree
, int, int));
2868 extern void warn_about_unused_variables
PARAMS ((tree
));
2869 extern void start_cleanup_deferral
PARAMS ((void));
2870 extern void end_cleanup_deferral
PARAMS ((void));
2871 extern int is_body_block
PARAMS ((tree
));
2873 extern int conditional_context
PARAMS ((void));
2874 extern struct nesting
* current_nesting_level
PARAMS ((void));
2875 extern tree last_cleanup_this_contour
PARAMS ((void));
2876 extern void expand_start_case
PARAMS ((int, tree
, tree
,
2878 extern void expand_end_case_type
PARAMS ((tree
, tree
));
2879 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
2880 extern int add_case_node
PARAMS ((tree
, tree
,
2882 extern int pushcase
PARAMS ((tree
,
2883 tree (*) (tree
, tree
),
2885 extern int pushcase_range
PARAMS ((tree
, tree
,
2886 tree (*) (tree
, tree
),
2888 extern void using_eh_for_cleanups
PARAMS ((void));
2890 /* In fold-const.c */
2892 /* Fold constants as much as possible in an expression.
2893 Returns the simplified expression.
2894 Acts only on the top level of the expression;
2895 if the argument itself cannot be simplified, its
2896 subexpressions are not changed. */
2898 extern tree fold
PARAMS ((tree
));
2900 extern int force_fit_type
PARAMS ((tree
, int));
2901 extern int add_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2902 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2903 unsigned HOST_WIDE_INT
*,
2905 extern int neg_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2906 unsigned HOST_WIDE_INT
*,
2908 extern int mul_double
PARAMS ((unsigned HOST_WIDE_INT
,
2910 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2911 unsigned HOST_WIDE_INT
*,
2913 extern void lshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2914 HOST_WIDE_INT
, unsigned int,
2915 unsigned HOST_WIDE_INT
*,
2916 HOST_WIDE_INT
*, int));
2917 extern void rshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2918 HOST_WIDE_INT
, unsigned int,
2919 unsigned HOST_WIDE_INT
*,
2920 HOST_WIDE_INT
*, int));
2921 extern void lrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2922 HOST_WIDE_INT
, unsigned int,
2923 unsigned HOST_WIDE_INT
*,
2925 extern void rrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2926 HOST_WIDE_INT
, unsigned int,
2927 unsigned HOST_WIDE_INT
*,
2930 extern int div_and_round_double
PARAMS ((enum tree_code
, int,
2931 unsigned HOST_WIDE_INT
,
2933 unsigned HOST_WIDE_INT
,
2935 unsigned HOST_WIDE_INT
*,
2937 unsigned HOST_WIDE_INT
*,
2940 extern int operand_equal_p
PARAMS ((tree
, tree
, int));
2941 extern tree omit_one_operand
PARAMS ((tree
, tree
, tree
));
2942 extern tree invert_truthvalue
PARAMS ((tree
));
2945 extern tree fold_builtin
PARAMS ((tree
));
2946 extern enum built_in_function builtin_mathfn_code
PARAMS ((tree
));
2947 extern tree build_function_call_expr
PARAMS ((tree
, tree
));
2948 extern tree mathfn_built_in
PARAMS ((tree
, enum built_in_function fn
));
2949 extern tree strip_float_extensions
PARAMS ((tree
));
2952 extern tree strip_float_extensions
PARAMS ((tree
));
2955 extern void record_component_aliases
PARAMS ((tree
));
2956 extern HOST_WIDE_INT get_alias_set
PARAMS ((tree
));
2957 extern int alias_sets_conflict_p
PARAMS ((HOST_WIDE_INT
,
2959 extern int readonly_fields_p
PARAMS ((tree
));
2960 extern int objects_must_conflict_p
PARAMS ((tree
, tree
));
2963 extern int really_constant_p
PARAMS ((tree
));
2964 extern int int_fits_type_p
PARAMS ((tree
, tree
));
2965 extern bool variably_modified_type_p
PARAMS ((tree
));
2966 extern int tree_log2
PARAMS ((tree
));
2967 extern int tree_floor_log2
PARAMS ((tree
));
2968 extern int simple_cst_equal
PARAMS ((tree
, tree
));
2969 extern unsigned int iterative_hash_expr
PARAMS ((tree
, unsigned int));
2970 extern int compare_tree_int
PARAMS ((tree
,
2971 unsigned HOST_WIDE_INT
));
2972 extern int type_list_equal
PARAMS ((tree
, tree
));
2973 extern int chain_member
PARAMS ((tree
, tree
));
2974 extern tree type_hash_lookup
PARAMS ((unsigned int, tree
));
2975 extern void type_hash_add
PARAMS ((unsigned int, tree
));
2976 extern unsigned int type_hash_list
PARAMS ((tree
));
2977 extern int simple_cst_list_equal
PARAMS ((tree
, tree
));
2978 extern void dump_tree_statistics
PARAMS ((void));
2979 extern void expand_function_end
PARAMS ((const char *, int, int));
2980 extern void expand_function_start
PARAMS ((tree
, int));
2981 extern void expand_pending_sizes
PARAMS ((tree
));
2983 extern int real_onep
PARAMS ((tree
));
2984 extern int real_twop
PARAMS ((tree
));
2985 extern int real_minus_onep
PARAMS ((tree
));
2986 extern void init_ttree
PARAMS ((void));
2987 extern void build_common_tree_nodes
PARAMS ((int));
2988 extern void build_common_tree_nodes_2
PARAMS ((int));
2989 extern tree build_range_type
PARAMS ((tree
, tree
, tree
));
2992 extern void setjmp_protect_args
PARAMS ((void));
2993 extern void setjmp_protect
PARAMS ((tree
));
2994 extern void expand_main_function
PARAMS ((void));
2995 extern void init_dummy_function_start
PARAMS ((void));
2996 extern void expand_dummy_function_end
PARAMS ((void));
2997 extern void init_function_for_compilation
PARAMS ((void));
2998 extern void init_function_start
PARAMS ((tree
, const char *, int));
2999 extern void assign_parms
PARAMS ((tree
));
3000 extern void put_var_into_stack
PARAMS ((tree
, int));
3001 extern void flush_addressof
PARAMS ((tree
));
3002 extern void uninitialized_vars_warning
PARAMS ((tree
));
3003 extern void setjmp_args_warning
PARAMS ((void));
3004 extern void mark_all_temps_used
PARAMS ((void));
3005 extern void init_temp_slots
PARAMS ((void));
3006 extern void combine_temp_slots
PARAMS ((void));
3007 extern void free_temp_slots
PARAMS ((void));
3008 extern void pop_temp_slots
PARAMS ((void));
3009 extern void push_temp_slots
PARAMS ((void));
3010 extern void preserve_temp_slots
PARAMS ((rtx
));
3011 extern void preserve_rtl_expr_temps
PARAMS ((tree
));
3012 extern int aggregate_value_p
PARAMS ((tree
));
3013 extern void free_temps_for_rtl_expr
PARAMS ((tree
));
3014 extern void instantiate_virtual_regs
PARAMS ((tree
, rtx
));
3015 extern void unshare_all_rtl
PARAMS ((tree
, rtx
));
3016 extern void push_function_context
PARAMS ((void));
3017 extern void pop_function_context
PARAMS ((void));
3018 extern void push_function_context_to
PARAMS ((tree
));
3019 extern void pop_function_context_from
PARAMS ((tree
));
3021 /* In print-rtl.c */
3023 extern void print_rtl
PARAMS ((FILE *, rtx
));
3026 /* In print-tree.c */
3027 extern void debug_tree
PARAMS ((tree
));
3029 extern void print_node
PARAMS ((FILE *, const char *, tree
,
3031 extern void print_node_brief
PARAMS ((FILE *, const char *, tree
,
3033 extern void indent_to
PARAMS ((FILE *, int));
3037 extern int apply_args_register_offset
PARAMS ((int));
3038 extern rtx expand_builtin_return_addr
3039 PARAMS ((enum built_in_function
, int, rtx
));
3040 extern void check_max_integer_computation_mode
PARAMS ((tree
));
3043 extern void start_sequence_for_rtl_expr
PARAMS ((tree
));
3044 extern rtx emit_line_note
PARAMS ((const char *, int));
3048 extern int setjmp_call_p
PARAMS ((tree
));
3049 extern bool alloca_call_p
PARAMS ((tree
));
3053 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3054 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3055 it should be modified in place; if a TYPE, a copy should be created
3056 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3057 information, in the form of a bitwise OR of flags in enum attribute_flags
3058 from tree.h. Depending on these flags, some attributes may be
3059 returned to be applied at a later stage (for example, to apply
3060 a decl attribute to the declaration rather than to its type). */
3061 extern tree decl_attributes
PARAMS ((tree
*, tree
, int));
3063 /* In integrate.c */
3064 extern void save_for_inline
PARAMS ((tree
));
3065 extern void set_decl_abstract_flags
PARAMS ((tree
, int));
3066 extern void output_inline_function
PARAMS ((tree
));
3067 extern void set_decl_origin_self
PARAMS ((tree
));
3069 /* In stor-layout.c */
3070 extern void fixup_signed_type
PARAMS ((tree
));
3071 extern void internal_reference_types
PARAMS ((void));
3074 extern void make_decl_rtl
PARAMS ((tree
, const char *));
3075 extern void make_decl_one_only
PARAMS ((tree
));
3076 extern int supports_one_only
PARAMS ((void));
3077 extern void variable_section
PARAMS ((tree
, int));
3078 enum tls_model decl_tls_model
PARAMS ((tree
));
3079 enum symbol_visibility decl_visibility
PARAMS ((tree
));
3082 extern void emit_nop
PARAMS ((void));
3083 extern void expand_computed_goto
PARAMS ((tree
));
3084 extern bool parse_output_constraint
PARAMS ((const char **,
3086 bool *, bool *, bool *));
3087 extern void expand_asm_operands
PARAMS ((tree
, tree
, tree
, tree
, int,
3088 const char *, int));
3089 extern int any_pending_cleanups
PARAMS ((int));
3090 extern void init_stmt_for_function
PARAMS ((void));
3091 extern void expand_start_target_temps
PARAMS ((void));
3092 extern void expand_end_target_temps
PARAMS ((void));
3093 extern void expand_elseif
PARAMS ((tree
));
3094 extern void save_stack_pointer
PARAMS ((void));
3095 extern void expand_decl
PARAMS ((tree
));
3096 extern int expand_decl_cleanup
PARAMS ((tree
, tree
));
3097 extern int expand_decl_cleanup_eh
PARAMS ((tree
, tree
, int));
3098 extern void expand_anon_union_decl
PARAMS ((tree
, tree
, tree
));
3099 extern void expand_start_case_dummy
PARAMS ((void));
3100 extern HOST_WIDE_INT all_cases_count
PARAMS ((tree
, int *));
3101 extern void check_for_full_enumeration_handling
PARAMS ((tree
));
3102 extern void declare_nonlocal_label
PARAMS ((tree
));
3103 extern void default_flag_random_seed
PARAMS ((void));
3105 /* If KIND=='I', return a suitable global initializer (constructor) name.
3106 If KIND=='D', return a suitable global clean-up (destructor) name. */
3107 extern tree get_file_function_name
PARAMS ((int));
3109 /* Interface of the DWARF2 unwind info support. */
3111 /* Generate a new label for the CFI info to refer to. */
3113 extern char *dwarf2out_cfi_label
PARAMS ((void));
3115 /* Entry point to update the canonical frame address (CFA). */
3117 extern void dwarf2out_def_cfa
PARAMS ((const char *, unsigned, long));
3119 /* Add the CFI for saving a register window. */
3121 extern void dwarf2out_window_save
PARAMS ((const char *));
3123 /* Add a CFI to update the running total of the size of arguments pushed
3126 extern void dwarf2out_args_size
PARAMS ((const char *, long));
3128 /* Entry point for saving a register to the stack. */
3130 extern void dwarf2out_reg_save
PARAMS ((const char *, unsigned, long));
3132 /* Entry point for saving the return address in the stack. */
3134 extern void dwarf2out_return_save
PARAMS ((const char *, long));
3136 /* Entry point for saving the return address in a register. */
3138 extern void dwarf2out_return_reg
PARAMS ((const char *, unsigned));
3140 /* The type of a function that walks over tree structure. */
3142 typedef tree (*walk_tree_fn
) PARAMS ((tree
*, int *, void *));
3144 /* In tree-dump.c */
3146 /* Different tree dump places. When you add new tree dump places,
3147 extend the DUMP_FILES array in tree-dump.c */
3148 enum tree_dump_index
3150 TDI_all
, /* dump the whole translation unit */
3151 TDI_class
, /* dump class hierarchy */
3152 TDI_original
, /* dump each function before optimizing it */
3153 TDI_optimized
, /* dump each function after optimizing it */
3154 TDI_inlined
, /* dump each function after inlining
3159 /* Bit masks to control tree dumping. Not all values are applicable to
3160 all tree dumps. Add new ones at the end. When you define new
3161 values, extend the DUMP_OPTIONS array in tree-dump.c */
3162 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3163 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3165 typedef struct dump_info
*dump_info_p
;
3167 extern int dump_flag
PARAMS ((dump_info_p
, int, tree
));
3168 extern int dump_enabled_p
PARAMS ((enum tree_dump_index
));
3169 extern FILE *dump_begin
PARAMS ((enum tree_dump_index
, int *));
3170 extern void dump_end
PARAMS ((enum tree_dump_index
, FILE *));
3171 extern void dump_node
PARAMS ((tree
, int, FILE *));
3172 extern int dump_switch_p
PARAMS ((const char *));
3173 extern const char *dump_flag_name
PARAMS ((enum tree_dump_index
));
3174 /* Assign the RTX to declaration. */
3176 extern void set_decl_rtl
PARAMS ((tree
, rtx
));
3178 /* Redefine abort to report an internal error w/o coredump, and
3179 reporting the location of the error in the source file. This logic
3180 is duplicated in rtl.h and tree.h because every file that needs the
3181 special abort includes one or both. toplev.h gets too few files,
3182 system.h gets too many. */
3184 extern void fancy_abort
PARAMS ((const char *, int, const char *))
3186 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3188 #endif /* GCC_TREE_H */