1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002 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) 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 tree built_in_decls
[(int) END_BUILTINS
];
103 /* The definition of tree nodes fills the next several pages. */
105 /* A tree node can represent a data type, a variable, an expression
106 or a statement. Each node has a TREE_CODE which says what kind of
107 thing it represents. Some common codes are:
108 INTEGER_TYPE -- represents a type of integers.
109 ARRAY_TYPE -- represents a type of pointer.
110 VAR_DECL -- represents a declared variable.
111 INTEGER_CST -- represents a constant integer value.
112 PLUS_EXPR -- represents a sum (an expression).
114 As for the contents of a tree node: there are some fields
115 that all nodes share. Each TREE_CODE has various special-purpose
116 fields as well. The fields of a node are never accessed directly,
117 always through accessor macros. */
119 /* Every kind of tree node starts with this structure,
120 so all nodes have these fields.
122 See the accessor macros, defined below, for documentation of the
125 struct tree_common
GTY(())
130 ENUM_BITFIELD(tree_code
) code
: 8;
132 unsigned side_effects_flag
: 1;
133 unsigned constant_flag
: 1;
134 unsigned addressable_flag
: 1;
135 unsigned volatile_flag
: 1;
136 unsigned readonly_flag
: 1;
137 unsigned unsigned_flag
: 1;
138 unsigned asm_written_flag
: 1;
139 unsigned unused_0
: 1;
141 unsigned used_flag
: 1;
142 unsigned nothrow_flag
: 1;
143 unsigned static_flag
: 1;
144 unsigned public_flag
: 1;
145 unsigned private_flag
: 1;
146 unsigned protected_flag
: 1;
147 unsigned bounded_flag
: 1;
148 unsigned deprecated_flag
: 1;
150 unsigned lang_flag_0
: 1;
151 unsigned lang_flag_1
: 1;
152 unsigned lang_flag_2
: 1;
153 unsigned lang_flag_3
: 1;
154 unsigned lang_flag_4
: 1;
155 unsigned lang_flag_5
: 1;
156 unsigned lang_flag_6
: 1;
157 unsigned unused_1
: 1;
160 /* The following table lists the uses of each of the above flags and
161 for which types of nodes they are defined. Note that expressions
167 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
168 ..._TYPE, IDENTIFIER_NODE.
169 In a STMT_EXPR, it means we want the result of the enclosed
175 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
176 TREE_NO_UNUSED_WARNING in
177 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
179 TREE_LIST or TREE_VEC
180 TREE_CONSTANT_OVERFLOW in
181 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
182 TREE_SYMBOL_REFERENCED in
185 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
186 TREE_LIST elements of a block's cleanup list.
191 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
193 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
195 TREE_LIST or TREE_VEC
196 EXPR_WFL_EMIT_LINE_NOTE in
197 EXPR_WITH_FILE_LOCATION
202 TREE_LIST or TREE_VEC
208 TREE_VIA_PROTECTED in
222 TREE_THIS_VOLATILE in
242 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
243 DECL_BUILT_IN_NONANSI in
245 SAVE_EXPR_NOPLACEHOLDER in
251 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
257 expressions, IDENTIFIER_NODE
262 CALL_EXPR, FUNCTION_DECL
267 expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL,
278 /* Define accessors for the fields that all tree nodes have
279 (though some fields are not used for all kinds of nodes). */
281 /* The tree-code says what kind of node it is.
282 Codes are defined in tree.def. */
283 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
284 #define TREE_SET_CODE(NODE, VALUE) \
285 ((NODE)->common.code = (ENUM_BITFIELD (tree_code)) (VALUE))
287 /* When checking is enabled, errors will be generated if a tree node
288 is accessed incorrectly. The macros abort with a fatal error. */
289 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
291 #define TREE_CHECK(t, code) __extension__ \
292 ({ const tree __t = (t); \
293 if (TREE_CODE(__t) != (code)) \
294 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
296 #define TREE_CLASS_CHECK(t, class) __extension__ \
297 ({ const tree __t = (t); \
298 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
299 tree_class_check_failed (__t, class, __FILE__, __LINE__, \
303 /* These checks have to be special cased. */
304 #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
305 ({ const tree __t = (t); \
306 enum tree_code const __c = TREE_CODE(__t); \
307 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
308 tree_check_failed (__t, CONSTRUCTOR, __FILE__, __LINE__, \
311 #define EXPR_CHECK(t) __extension__ \
312 ({ const tree __t = (t); \
313 char const __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
314 if (__c != 'r' && __c != 's' && __c != '<' \
315 && __c != '1' && __c != '2' && __c != 'e') \
316 tree_class_check_failed (__t, 'e', __FILE__, __LINE__, \
320 extern void tree_check_failed
PARAMS ((const tree
, enum tree_code
,
321 const char *, int, const char *))
323 extern void tree_class_check_failed
PARAMS ((const tree
, int,
324 const char *, int, const char *))
327 #else /* not ENABLE_TREE_CHECKING, or not gcc */
329 #define TREE_CHECK(t, code) (t)
330 #define TREE_CLASS_CHECK(t, code) (t)
331 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
332 #define EXPR_CHECK(t) (t)
336 #include "tree-check.h"
338 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
339 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
340 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
342 /* In all nodes that are expressions, this is the data type of the expression.
343 In POINTER_TYPE nodes, this is the type that the pointer points to.
344 In ARRAY_TYPE nodes, this is the type of the elements.
345 In VECTOR_TYPE nodes, this is the type of the elements. */
346 #define TREE_TYPE(NODE) ((NODE)->common.type)
348 /* Here is how primitive or already-canonicalized types' hash codes
350 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777)
352 /* Nodes are chained together for many purposes.
353 Types are chained together to record them for being output to the debugger
354 (see the function `chain_type').
355 Decls in the same scope are chained together to record the contents
357 Statement nodes for successive statements used to be chained together.
358 Often lists of things are represented by TREE_LIST nodes that
359 are chained together. */
361 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
363 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
364 that don't change the machine mode. */
366 #define STRIP_NOPS(EXP) \
367 while ((TREE_CODE (EXP) == NOP_EXPR \
368 || TREE_CODE (EXP) == CONVERT_EXPR \
369 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
370 && TREE_OPERAND (EXP, 0) != error_mark_node \
371 && (TYPE_MODE (TREE_TYPE (EXP)) \
372 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
373 (EXP) = TREE_OPERAND (EXP, 0)
375 /* Like STRIP_NOPS, but don't let the signedness change either. */
377 #define STRIP_SIGN_NOPS(EXP) \
378 while ((TREE_CODE (EXP) == NOP_EXPR \
379 || TREE_CODE (EXP) == CONVERT_EXPR \
380 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
381 && TREE_OPERAND (EXP, 0) != error_mark_node \
382 && (TYPE_MODE (TREE_TYPE (EXP)) \
383 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
384 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
385 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
386 (EXP) = TREE_OPERAND (EXP, 0)
388 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
390 #define STRIP_TYPE_NOPS(EXP) \
391 while ((TREE_CODE (EXP) == NOP_EXPR \
392 || TREE_CODE (EXP) == CONVERT_EXPR \
393 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
394 && TREE_OPERAND (EXP, 0) != error_mark_node \
395 && (TREE_TYPE (EXP) \
396 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
397 (EXP) = TREE_OPERAND (EXP, 0)
399 /* Nonzero if TYPE represents an integral type. Note that we do not
400 include COMPLEX types here. */
402 #define INTEGRAL_TYPE_P(TYPE) \
403 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
404 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
406 /* Nonzero if TYPE represents a floating-point type, including complex
407 floating-point types. */
409 #define FLOAT_TYPE_P(TYPE) \
410 (TREE_CODE (TYPE) == REAL_TYPE \
411 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
412 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
414 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
416 #define AGGREGATE_TYPE_P(TYPE) \
417 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
418 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
419 || TREE_CODE (TYPE) == SET_TYPE)
421 /* Nonzero if TYPE represents an unbounded pointer or unbounded
422 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
424 #define POINTER_TYPE_P(TYPE) \
425 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
427 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
429 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
430 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
432 /* Nonzero if TYPE represents a bounded pointer type. */
434 #define BOUNDED_POINTER_TYPE_P(TYPE) \
435 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
436 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
438 /* Nonzero if TYPE represents a bounded reference type. Bounded
439 reference types have two specific uses: (1) When a reference is
440 seated to a variable-length RECORD_TYPE that has an array of
441 indeterminate length as its final field. For all other objects, it
442 is sufficient to check bounds at the time the reference is seated,
443 and assume that all future uses of the reference are safe, since
444 the address of references cannot change. (2) When a reference
445 supertype is seated to an subtype object. The bounds "remember"
446 the true size of the complete object, so that subsequent upcasts of
447 the address of the reference will be checked properly (is such a
448 thing valid C++?). */
450 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
451 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
452 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
454 /* Nonzero if TYPE represents a pointer or reference type, either
455 bounded or unbounded. */
457 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
458 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
460 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
462 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
463 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
465 /* Nonzero if TYPE represents a reference type, either bounded or
468 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
469 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
471 /* Nonzero if this type is a complete type. */
472 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
474 /* Nonzero if this type is the (possibly qualified) void type. */
475 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
477 /* Nonzero if this type is complete or is cv void. */
478 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
479 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
481 /* Nonzero if this type is complete or is an array with unspecified bound. */
482 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
483 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
485 /* Nonzero if TYPE represents a type. */
487 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
489 /* Define many boolean fields that all tree nodes have. */
491 /* In VAR_DECL nodes, nonzero means address of this is needed.
492 So it cannot be in a register.
493 In a FUNCTION_DECL, nonzero means its address is needed.
494 So it must be compiled even if it is an inline function.
495 In a FIELD_DECL node, it means that the programmer is permitted to
496 construct the address of this field. This is used for aliasing
497 purposes: see record_component_aliases.
498 In CONSTRUCTOR nodes, it means object constructed must be in memory.
499 In LABEL_DECL nodes, it means a goto for this label has been seen
500 from a place outside all binding contours that restore stack levels.
501 In ..._TYPE nodes, it means that objects of this type must
502 be fully addressable. This means that pieces of this
503 object cannot go into register parameters, for example.
504 In IDENTIFIER_NODEs, this means that some extern decl for this name
505 had its address taken. That matters for inline functions. */
506 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
508 /* In a VAR_DECL, nonzero means allocate static storage.
509 In a FUNCTION_DECL, nonzero if function has been defined.
510 In a CONSTRUCTOR, nonzero means allocate static storage. */
511 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
513 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
514 block's cleanup list, means that the pertinent cleanup should only be
515 executed if an exception is thrown, not on normal exit of its scope. */
516 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
518 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
519 made implicitly and should not lead to an "unused value" warning. */
520 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
522 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
523 chain is via a `virtual' declaration. */
524 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
526 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
527 there was an overflow in folding. This is distinct from
528 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
529 occur in constant expressions. */
530 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
532 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
533 this string as an argument. */
534 #define TREE_SYMBOL_REFERENCED(NODE) \
535 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
537 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
538 there was an overflow in folding, and no warning has been issued
539 for this subexpression. TREE_OVERFLOW implies
540 TREE_CONSTANT_OVERFLOW, but not vice versa. */
541 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
543 /* In a VAR_DECL or FUNCTION_DECL,
544 nonzero means name is to be accessible from outside this module.
545 In an IDENTIFIER_NODE, nonzero means an external declaration
546 accessible from outside this module was previously seen
547 for this name in an inner scope. */
548 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
550 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
551 base class is via a `public' declaration, which preserves public
552 fields from the base class as public. */
553 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
555 /* Ditto, for `private' declarations. */
556 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
558 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
559 base class is via a `protected' declaration, which preserves
560 protected fields from the base class as protected.
562 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
564 /* In any expression, nonzero means it has side effects or reevaluation
565 of the whole expression could produce a different value.
566 This is set if any subexpression is a function call, a side effect
567 or a reference to a volatile variable.
568 In a ..._DECL, this is set only if the declaration said `volatile'. */
569 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
571 /* Nonzero means this expression is volatile in the C sense:
572 its address should be of type `volatile WHATEVER *'.
573 In other words, the declared item is volatile qualified.
574 This is used in _DECL nodes and _REF nodes.
576 In a ..._TYPE node, means this type is volatile-qualified.
577 But use TYPE_VOLATILE instead of this macro when the node is a type,
578 because eventually we may make that a different bit.
580 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
581 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
583 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
584 nonzero means it may not be the lhs of an assignment.
585 In a ..._TYPE node, means this type is const-qualified
586 (but the macro TYPE_READONLY should be used instead of this macro
587 when the node is a type). */
588 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
590 /* Non-zero if NODE is a _DECL with TREE_READONLY set. */
591 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE))
593 /* Value of expression is constant.
594 Always appears in all ..._CST nodes.
595 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
596 if the value is constant. */
597 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
599 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
600 In FIELD_DECL nodes, means an unsigned bit field.
601 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
602 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
604 #define TYPE_TRAP_SIGNED(NODE) \
605 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE)))
607 /* Nonzero in a VAR_DECL means assembler code has been written.
608 Nonzero in a FUNCTION_DECL means that the function has been compiled.
609 This is interesting in an inline function, since it might not need
610 to be compiled separately.
611 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
612 if the sdb debugging info for the type has been written.
613 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
614 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
616 /* Nonzero in a _DECL if the name is used in its scope.
617 Nonzero in an expr node means inhibit warning if value is unused.
618 In IDENTIFIER_NODEs, this means that some extern decl for this name
620 #define TREE_USED(NODE) ((NODE)->common.used_flag)
622 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
623 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
624 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
626 /* In a type, nonzero means that all objects of the type are guaranteed by the
627 language or front-end to be properly aligned, so we can indicate that a MEM
628 of this type is aligned at least to the alignment of the type, even if it
629 doesn't appear that it is. We see this, for example, in object-oriented
630 languages where a tag field may show this is an object of a more-aligned
631 variant of the more generic type. */
632 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
634 /* Used in classes in C++. */
635 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
636 /* Used in classes in C++.
637 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
638 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
640 /* In a ..._TYPE node, nonzero means that the type's size and layout,
641 (or the size and layout of its arguments and/or return value in the
642 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
643 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
644 node is a type, because eventually we may make that a different
645 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
646 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
647 BOUNDED_INDIRECT_TYPE_P to test for that.
649 In a FUNCTION_DECL, nonzero means that the size and layout of one
650 of its arguments and/or return value was changed by the presence of
651 pointer bounds. This value can differ from the value of
652 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
653 declared, then later called with pointer args, or was declared with
654 a variable argument list and is later called with pointer values in
655 the variable argument list.
657 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
658 of the decl's type's BOUNDED_POINTER_TYPE_P.
660 In a CONSTRUCTOR or other expression, nonzero means the value is a
661 bounded pointer. It is insufficient to determine the boundedness
662 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
663 since we allow pointer to be temporarily cast to integer for
664 rounding up to an alignment boudary in a way that preserves the
667 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
668 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
669 of a function that has bounded pointer(s) for its return type and/or
672 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
674 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
675 deprecated feature by __attribute__((deprecated)). */
676 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
678 /* These flags are available for each language front end to use internally. */
679 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
680 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
681 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
682 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
683 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
684 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
685 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
687 /* Define additional fields and accessors for nodes representing constants. */
689 /* In an INTEGER_CST node. These two together make a 2-word integer.
690 If the data type is signed, the value is sign-extended to 2 words
691 even though not all of them may really be in use.
692 In an unsigned constant shorter than 2 words, the extra bits are 0. */
693 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
694 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
695 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
697 #define INT_CST_LT(A, B) \
698 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
699 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
700 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
702 #define INT_CST_LT_UNSIGNED(A, B) \
703 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
704 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
705 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
706 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
707 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
709 struct tree_int_cst
GTY(())
711 struct tree_common common
;
712 rtx rtl
; /* acts as link to register transfer language
714 /* A sub-struct is necessary here because the function `const_hash'
715 wants to scan both words as a unit and taking the address of the
716 sub-struct yields the properly inclusive bounded pointer. */
717 struct tree_int_cst_lowhi
{
718 unsigned HOST_WIDE_INT low
;
723 /* In REAL_CST, STRING_CST, COMPLEX_CST, VECTOR_CST nodes, and
724 CONSTRUCTOR nodes, and generally in all kinds of constants that
725 could be given labels (rather than being immediate). */
727 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
729 /* In a REAL_CST node. struct real_value is an opaque entity, with
730 manipulators defined in real.h. We don't want tree.h depending on
731 real.h and transitively on tm.h. */
734 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
735 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
737 struct tree_real_cst
GTY(())
739 struct tree_common common
;
740 rtx rtl
; /* acts as link to register transfer language (rtl) info */
741 struct real_value
* real_cst_ptr
;
744 /* In a STRING_CST */
745 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
746 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
748 struct tree_string
GTY(())
750 struct tree_common common
;
751 rtx rtl
; /* acts as link to register transfer language (rtl) info */
756 /* In a COMPLEX_CST node. */
757 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
758 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
760 struct tree_complex
GTY(())
762 struct tree_common common
;
763 rtx rtl
; /* acts as link to register transfer language (rtl) info */
768 /* In a VECTOR_CST node. */
769 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
771 struct tree_vector
GTY(())
773 struct tree_common common
;
778 #include "hashtable.h"
780 /* Define fields and accessors for some special-purpose tree nodes. */
782 #define IDENTIFIER_LENGTH(NODE) \
783 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
784 #define IDENTIFIER_POINTER(NODE) \
785 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
787 /* Translate a hash table identifier pointer to a tree_identifier
788 pointer, and vice versa. */
790 #define HT_IDENT_TO_GCC_IDENT(NODE) \
791 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
792 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
794 struct tree_identifier
GTY(())
796 struct tree_common common
;
797 struct ht_identifier id
;
800 /* In a TREE_LIST node. */
801 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
802 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
804 struct tree_list
GTY(())
806 struct tree_common common
;
811 /* In a TREE_VEC node. */
812 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
813 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
814 #define TREE_VEC_END(NODE) \
815 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
817 struct tree_vec
GTY(())
819 struct tree_common common
;
821 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
824 /* Define fields and accessors for some nodes that represent expressions. */
826 /* In a SAVE_EXPR node. */
827 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND (SAVE_EXPR_CHECK (NODE), 1)
828 #define SAVE_EXPR_RTL(NODE) (*(rtx *) &SAVE_EXPR_CHECK (NODE)->exp.operands[2])
829 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE))
830 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
831 both in normal code and in a handler. (Normally, in a handler, all
832 SAVE_EXPRs are unsaved, meaning that there values are
834 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
836 /* In a RTL_EXPR node. */
837 #define RTL_EXPR_SEQUENCE(NODE) \
838 (*(rtx *) &RTL_EXPR_CHECK (NODE)->exp.operands[0])
839 #define RTL_EXPR_RTL(NODE) (*(rtx *) &RTL_EXPR_CHECK (NODE)->exp.operands[1])
841 /* In a WITH_CLEANUP_EXPR node. */
842 #define WITH_CLEANUP_EXPR_RTL(NODE) \
843 (*(rtx *) &WITH_CLEANUP_EXPR_CHECK (NODE)->exp.operands[2])
845 /* In a CONSTRUCTOR node. */
846 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (CONSTRUCTOR_CHECK (NODE), 1)
848 /* In ordinary expression nodes. */
849 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
850 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
852 /* In a LABELED_BLOCK_EXPR node. */
853 #define LABELED_BLOCK_LABEL(NODE) \
854 TREE_OPERAND (LABELED_BLOCK_EXPR_CHECK (NODE), 0)
855 #define LABELED_BLOCK_BODY(NODE) \
856 TREE_OPERAND (LABELED_BLOCK_EXPR_CHECK (NODE), 1)
858 /* In an EXIT_BLOCK_EXPR node. */
859 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
860 TREE_OPERAND (EXIT_BLOCK_EXPR_CHECK (NODE), 0)
861 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (EXIT_BLOCK_EXPR_CHECK (NODE), 1)
863 /* In a LOOP_EXPR node. */
864 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (LOOP_EXPR_CHECK (NODE), 0)
866 /* In an EXPR_WITH_FILE_LOCATION node. */
867 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
868 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
869 #define EXPR_WFL_NODE(NODE) \
870 TREE_OPERAND (EXPR_WITH_FILE_LOCATION_CHECK (NODE), 0)
871 #define EXPR_WFL_FILENAME_NODE(NODE) \
872 TREE_OPERAND (EXPR_WITH_FILE_LOCATION_CHECK (NODE), 1)
873 #define EXPR_WFL_FILENAME(NODE) \
874 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE))
875 /* ??? Java uses this in all expressions. */
876 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
877 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
878 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
879 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
880 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
882 /* In a TARGET_EXPR node. */
883 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND (TARGET_EXPR_CHECK (NODE), 0)
884 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND (TARGET_EXPR_CHECK (NODE), 1)
885 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND (TARGET_EXPR_CHECK (NODE), 2)
887 struct tree_exp
GTY(())
889 struct tree_common common
;
891 tree
GTY ((special ("tree_exp"),
892 desc ("TREE_CODE ((tree) &%0)")))
896 /* In a BLOCK node. */
897 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
898 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
899 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
900 /* Note: when changing this, make sure to find the places
901 that use chainon or nreverse. */
902 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
903 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
904 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
906 /* Nonzero means that this block is prepared to handle exceptions
907 listed in the BLOCK_VARS slot. */
908 #define BLOCK_HANDLER_BLOCK(NODE) \
909 (BLOCK_CHECK (NODE)->block.handler_block_flag)
911 /* An index number for this block. These values are not guaranteed to
912 be unique across functions -- whether or not they are depends on
913 the debugging output format in use. */
914 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
916 /* If block reordering splits a lexical block into discontiguous
917 address ranges, we'll make a copy of the original block.
919 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
920 In that case, we have one source block that has been replicated
921 (through inlining or unrolling) into many logical blocks, and that
922 these logical blocks have different physical variables in them.
924 In this case, we have one logical block split into several
925 non-contiguous address ranges. Most debug formats can't actually
926 represent this idea directly, so we fake it by creating multiple
927 logical blocks with the same variables in them. However, for those
928 that do support non-contiguous regions, these allow the original
929 logical block to be reconstructed, along with the set of address
932 One of the logical block fragments is arbitrarily chosen to be
933 the ORIGIN. The other fragments will point to the origin via
934 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
935 be null. The list of fragments will be chained through
936 BLOCK_FRAGMENT_CHAIN from the origin. */
938 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
939 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
941 struct tree_block
GTY(())
943 struct tree_common common
;
945 unsigned handler_block_flag
: 1;
946 unsigned abstract_flag
: 1;
947 unsigned block_num
: 30;
952 tree abstract_origin
;
953 tree fragment_origin
;
957 /* Define fields and accessors for nodes representing data types. */
959 /* See tree.def for documentation of the use of these fields.
960 Look at the documentation of the various ..._TYPE tree codes. */
962 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
963 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
964 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
965 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
966 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
967 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
968 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
969 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
970 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
971 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
972 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
973 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
974 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
975 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
976 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
977 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
978 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
979 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
980 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
981 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
982 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
983 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
984 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
985 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
986 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
988 /* For a VECTOR_TYPE node, this describes a different type which is emitted
989 in the debugging output. We use this to describe a vector as a
990 structure containing an array. */
991 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
993 /* Indirect types present difficulties because they may be represented
994 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
995 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
996 be logically equivalent, but physically different. Simple
997 comparison of the main variant only tells if the types are
998 logically equivalent. Use this predicate to compare for physical
1001 /* Types have the same main variant, and have the same boundedness. */
1002 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
1003 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
1004 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
1006 /* Return the type variant that has no qualifiers (i.e., the main variant),
1007 except that the boundedness qualifier is preserved. */
1008 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
1009 (BOUNDED_POINTER_TYPE_P (TYPE) \
1010 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
1011 : TYPE_MAIN_VARIANT (TYPE))
1013 /* For aggregate types, information about this type, as a base type
1014 for itself. Used in a language-dependent way for types that are
1015 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
1016 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
1018 /* The (language-specific) typed-based alias set for this type.
1019 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1020 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1021 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1022 type can alias objects of any type. */
1023 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1025 /* Nonzero iff the typed-based alias set for this type has been
1027 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1029 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1031 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1033 /* The alignment necessary for objects of this type.
1034 The value is an int, measured in bits. */
1035 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1037 /* 1 if the alignment for this type was requested by "aligned" attribute,
1038 0 if it is the default for this type. */
1039 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1041 /* The alignment for NODE, in bytes. */
1042 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1044 /* If your language allows you to declare types, and you want debug info
1045 for them, then you need to generate corresponding TYPE_DECL nodes.
1046 These "stub" TYPE_DECL nodes have no name, and simply point at the
1047 type node. You then set the TYPE_STUB_DECL field of the type node
1048 to point back at the TYPE_DECL node. This allows the debug routines
1049 to know that the two nodes represent the same type, so that we only
1050 get one debug info record for them. */
1051 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1053 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1054 has BLKmode only because it lacks the alignment requirement for
1056 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1058 /* In an INTEGER_TYPE, it means the type represents a size. We use
1059 this both for validity checking and to permit optimizations that
1060 are unsafe for other types. Note that the C `size_t' type should
1061 *not* have this flag set. The `size_t' type is simply a typedef
1062 for an ordinary integer type that happens to be the type of an
1063 expression returned by `sizeof'; `size_t' has no special
1064 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1065 always actual sizes. */
1066 #define TYPE_IS_SIZETYPE(NODE) \
1067 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1069 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1070 pointer depressed. */
1071 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1072 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1074 /* Nonzero in a type considered volatile as a whole. */
1075 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1077 /* Means this type is const-qualified. */
1078 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1080 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1082 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1084 /* If nonzero, this type's size and layout, (or the size and layout of
1085 its arguments and/or return value in the case of a FUNCTION_TYPE or
1086 METHOD_TYPE) was changed by the presence of pointer bounds. */
1087 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
1089 /* There is a TYPE_QUAL value for each type qualifier. They can be
1090 combined by bitwise-or to form the complete set of qualifiers for a
1093 #define TYPE_UNQUALIFIED 0x0
1094 #define TYPE_QUAL_CONST 0x1
1095 #define TYPE_QUAL_VOLATILE 0x2
1096 #define TYPE_QUAL_RESTRICT 0x4
1097 #define TYPE_QUAL_BOUNDED 0x8
1099 /* The set of type qualifiers for this type. */
1100 #define TYPE_QUALS(NODE) \
1101 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1102 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1103 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1104 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1106 /* The set of qualifiers pertinent to an expression node. */
1107 #define TREE_EXPR_QUALS(NODE) \
1108 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1109 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1110 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1112 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1113 #define TREE_FUNC_QUALS(NODE) \
1114 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1115 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1117 /* These flags are available for each language front end to use internally. */
1118 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1119 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1120 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1121 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1122 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1123 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1124 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1126 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1127 that distinguish string from array of char).
1128 If set in a SET_TYPE, indicates a bitstring type. */
1129 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1131 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1132 object of the given ARRAY_TYPE. This allows temporaries to be
1134 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1135 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE))
1137 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1138 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1139 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1141 /* Indicates that objects of this type must be initialized by calling a
1142 function when they are created. */
1143 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1144 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1146 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1147 the same way that the first union alternative would be passed. */
1148 #define TYPE_TRANSPARENT_UNION(NODE) \
1149 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1151 /* For an ARRAY_TYPE, indicates that it is not permitted to
1152 take the address of a component of the type. */
1153 #define TYPE_NONALIASED_COMPONENT(NODE) \
1154 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1156 /* Indicated that objects of this type should be laid out in as
1157 compact a way as possible. */
1158 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1160 /* A bounded pointer or bounded reference type (collectively called
1161 indirect types) is represented as a RECORD_TYPE node containing
1162 three pointer fields whose type is the corresponding unbounded
1163 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1164 a bounded indirect type differs from a normal RECORD_TYPE node in
1165 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1166 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1167 nodes are stored on the same type variant chain alongside the
1168 variants of the underlaying indirect types nodes. The main variant
1169 of such chains is always the unbounded type. */
1171 /* Access the field decls of a bounded-pointer type. */
1172 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1173 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1174 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1176 /* Access the simple-pointer subtype of a bounded-pointer type. */
1177 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1179 /* Find the unbounded counterpart to a type, or return TYPE if it is
1180 already unbounded. */
1181 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1182 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1184 /* This field comprises two bits, for values in the range 0..3:
1186 depth=0 means that type is a scalar, or an aggregate that contains
1187 only depth=0 types, or a function that has only depth=0 types for
1188 its return value and argument types.
1190 depth=1 means that type is a pointer to a depth=0 type, or an
1191 aggregate that contains only depth=0 and depth=1 types, or a
1192 function that has only depth=0 and depth=1 types for its return
1193 value and argument types.
1195 The meanings of depth=2 and depth=3 are obvious by induction.
1196 Varargs functions are depth=3. The type `va_list' is depth=3.
1198 The purpose of measuring pointer depth of a type is to determine
1199 the eligibility of a function for an automatically-generated
1200 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1201 depth=1 function is eligible for an automatic thunk. Functions
1202 with depth 2 or more are too complex to get automatic thunks.
1204 Function decls also have a pointer_depth field, since we also
1205 consider the actual argument types for functions. */
1207 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1209 /* In a FUNCTION_TYPE node, this bit stores the value of
1210 default_pointer_boundedness at the time TYPE was created. It is
1211 useful for choosing default boundedness of function arguments for
1212 non-prototype function decls and for varargs/stdarg lists. */
1213 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1214 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1216 #define MAX_POINTER_DEPTH 2
1217 #define VA_LIST_POINTER_DEPTH 3
1221 struct tree_type
GTY(())
1223 struct tree_common common
;
1230 unsigned int precision
: 9;
1231 ENUM_BITFIELD(machine_mode
) mode
: 7;
1233 unsigned string_flag
: 1;
1234 unsigned no_force_blk_flag
: 1;
1235 unsigned needs_constructing_flag
: 1;
1236 unsigned transparent_union_flag
: 1;
1237 unsigned packed_flag
: 1;
1238 unsigned restrict_flag
: 1;
1239 unsigned pointer_depth
: 2;
1241 unsigned lang_flag_0
: 1;
1242 unsigned lang_flag_1
: 1;
1243 unsigned lang_flag_2
: 1;
1244 unsigned lang_flag_3
: 1;
1245 unsigned lang_flag_4
: 1;
1246 unsigned lang_flag_5
: 1;
1247 unsigned lang_flag_6
: 1;
1248 unsigned user_align
: 1;
1253 union tree_type_symtab
{
1255 char * GTY ((tag ("1"))) pointer
;
1256 struct die_struct
* GTY ((tag ("2"), skip (""))) die
;
1257 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1258 descbits ("2"))) symtab
;
1266 HOST_WIDE_INT alias_set
;
1267 /* Points to a structure whose details depend on the language in use. */
1268 struct lang_type
*lang_specific
;
1271 /* Define accessor macros for information about type inheritance
1274 A "basetype" means a particular usage of a data type for inheritance
1275 in another type. Each such basetype usage has its own "binfo"
1276 object to describe it. The binfo object is a TREE_VEC node.
1278 Inheritance is represented by the binfo nodes allocated for a
1279 given type. For example, given types C and D, such that D is
1280 inherited by C, 3 binfo nodes will be allocated: one for describing
1281 the binfo properties of C, similarly one for D, and one for
1282 describing the binfo properties of D as a base type for C.
1283 Thus, given a pointer to class C, one can get a pointer to the binfo
1284 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1286 /* The actual data type node being inherited in this basetype. */
1287 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1289 /* The offset where this basetype appears in its containing type.
1290 BINFO_OFFSET slot holds the offset (in bytes)
1291 from the base of the complete object to the base of the part of the
1292 object that is allocated on behalf of this `type'.
1293 This is always 0 except when there is multiple inheritance. */
1295 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1296 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1297 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1299 /* The virtual function table belonging to this basetype. Virtual
1300 function tables provide a mechanism for run-time method dispatching.
1301 The entries of a virtual function table are language-dependent. */
1303 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1304 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1306 /* The virtual functions in the virtual function table. This is
1307 a TREE_LIST that is used as an initial approximation for building
1308 a virtual function table for this basetype. */
1309 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1310 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1312 /* A vector of binfos for the direct basetypes inherited by this
1315 If this basetype describes type D as inherited in C, and if the
1316 basetypes of D are E and F, then this vector contains binfos for
1317 inheritance of E and F by C.
1319 ??? This could probably be done by just allocating the
1320 base types at the end of this TREE_VEC (instead of using
1321 another TREE_VEC). This would simplify the calculation
1322 of how many basetypes a given type had. */
1323 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1324 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1326 /* The number of basetypes for NODE. */
1327 #define BINFO_N_BASETYPES(NODE) \
1328 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1330 /* Accessor macro to get to the Nth basetype of this basetype. */
1331 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1332 #define TYPE_BINFO_BASETYPE(NODE,N) \
1333 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1335 /* For a BINFO record describing a virtual base class, i.e., one where
1336 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1337 base. The actual contents are language-dependent. Under the old
1338 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1339 pointer to the virtual base; under the new ABI this field is
1340 instead an INTEGER_CST giving an offset into the vtable where the
1341 offset to the virtual base can be found. */
1342 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1344 /* The size of a base class subobject of this type. Not all frontends
1345 currently allocate the space for these fields. */
1346 #define BINFO_SIZE(NODE) TREE_VEC_ELT (NODE, 6)
1347 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT (NODE, 7)
1348 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1349 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1351 /* Slot used to build a chain that represents a use of inheritance.
1352 For example, if X is derived from Y, and Y is derived from Z,
1353 then this field can be used to link the binfo node for X to
1354 the binfo node for X's Y to represent the use of inheritance
1355 from X to Y. Similarly, this slot of the binfo node for X's Y
1356 can point to the Z from which Y is inherited (in X's inheritance
1357 hierarchy). In this fashion, one can represent and traverse specific
1358 uses of inheritance using the binfo nodes themselves (instead of
1359 consing new space pointing to binfo nodes).
1360 It is up to the language-dependent front-ends to maintain
1361 this information as necessary. */
1362 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1364 /* Define fields and accessors for nodes representing declared names. */
1366 /* Nonzero if DECL represents a decl. */
1367 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1369 /* This is the name of the object as written by the user.
1370 It is an IDENTIFIER_NODE. */
1371 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1373 /* The name of the object as the assembler will see it (but before any
1374 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1375 as DECL_NAME. It is an IDENTIFIER_NODE. */
1376 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1378 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1379 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1381 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1382 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1384 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1385 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1386 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1388 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1389 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1390 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1391 semantics of using this macro, are different than saying:
1393 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1395 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1397 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1398 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1399 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1400 DECL_ASSEMBLER_NAME (DECL1)) \
1403 /* Records the section name in a section attribute. Used to pass
1404 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1405 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1407 /* For FIELD_DECLs, this is the
1408 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1409 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1410 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1411 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1412 type, or NULL_TREE if the given decl has "file scope". */
1413 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1414 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1415 /* In a DECL this is the field where attributes are stored. */
1416 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1417 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1418 byte containing the bit closest to the beginning of the structure. */
1419 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1420 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1421 field from DECL_FIELD_OFFSET. */
1422 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1423 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1424 if so, the type that was originally specified for it.
1425 TREE_TYPE may have been modified (in finish_struct). */
1426 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1427 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1428 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1430 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1431 /* This field is used to reference anything in decl.result and is meant only
1432 for use by the garbage collector. */
1433 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1434 /* In FUNCTION_DECL, holds the decl for the return value. */
1435 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1436 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1437 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1438 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1439 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1440 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1441 For a VAR_DECL, holds the initial value.
1442 For a PARM_DECL, not used--default
1443 values for parameters are encoded in the type of the function,
1444 not in the PARM_DECL slot. */
1445 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1446 /* For a PARM_DECL, records the data type used to pass the argument,
1447 which may be different from the type seen in the program. */
1448 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1449 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1450 if nonzero, indicates that the field occupies the type. */
1451 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1452 /* These two fields describe where in the source code the declaration
1453 was. If the declaration appears in several places (as for a C
1454 function that is declared first and then defined later), this
1455 information should refer to the definition. */
1456 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1457 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1458 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1459 /* Holds the size of the datum, in bits, as a tree expression.
1460 Need not be constant. */
1461 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1462 /* Likewise for the size in bytes. */
1463 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1464 /* Holds the alignment required for the datum, in bits. */
1465 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1466 /* The alignment of NODE, in bytes. */
1467 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1468 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1469 DECL_FIELD_OFFSET which are known to be always zero.
1470 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1472 #define DECL_OFFSET_ALIGN(NODE) \
1473 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1474 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1475 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1476 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1477 /* 1 if the alignment for this type was requested by "aligned" attribute,
1478 0 if it is the default for this type. */
1479 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1480 /* Holds the machine mode corresponding to the declaration of a variable or
1481 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1483 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1484 /* Holds the RTL expression for the value of a variable or function. If
1485 PROMOTED_MODE is defined, the mode of this expression may not be same
1486 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1487 to the variable's data type, while the mode
1488 of DECL_RTL is the mode actually used to contain the data.
1490 This value can be evaluated lazily for functions, variables with
1491 static storage duration, and labels. */
1492 #define DECL_RTL(NODE) \
1493 (DECL_CHECK (NODE)->decl.rtl \
1494 ? (NODE)->decl.rtl \
1495 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1496 /* Set the DECL_RTL for NODE to RTL. */
1497 #define SET_DECL_RTL(NODE, RTL) (DECL_CHECK (NODE)->decl.rtl = (RTL))
1498 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1499 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1500 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1501 NODE1, it will not be set for NODE2; this is a lazy copy. */
1502 #define COPY_DECL_RTL(NODE1, NODE2) \
1503 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1504 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1505 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1507 /* Holds an INSN_LIST of all of the live ranges in which the variable
1508 has been moved to a possibly different register. */
1509 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1511 /* For PARM_DECL, holds an RTL for the stack slot or register
1512 where the data was actually passed. */
1513 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1515 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1516 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1518 /* For FUNCTION_DECL, if it is built-in,
1519 this identifies which built-in operation it is. */
1520 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1522 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1523 Before the struct containing the FUNCTION_DECL is laid out,
1524 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1525 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1526 function. When the class is laid out, this pointer is changed
1527 to an INTEGER_CST node which is suitable for use as an index
1528 into the virtual function table. */
1529 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1531 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1532 which this FIELD_DECL is defined. This information is needed when
1533 writing debugging information about vfield and vbase decls for C++. */
1534 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1536 /* Every ..._DECL node gets a unique number. */
1537 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1539 /* For any sort of a ..._DECL node, this points to the original (abstract)
1540 decl node which this decl is an instance of, or else it is NULL indicating
1541 that this decl is not an instance of some other decl. For example,
1542 in a nested declaration of an inline function, this points back to the
1544 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1546 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1547 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1548 #define DECL_ORIGIN(NODE) \
1549 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1551 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1552 inline instance of some original (abstract) decl from an inline function;
1553 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1554 nodes can also have their abstract origin set to themselves. */
1555 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1556 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1558 /* Nonzero if a _DECL means that the name of this decl should be ignored
1559 for symbolic debug purposes. */
1560 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1562 /* Nonzero for a given ..._DECL node means that this node represents an
1563 "abstract instance" of the given declaration (e.g. in the original
1564 declaration of an inline function). When generating symbolic debugging
1565 information, we mustn't try to generate any address information for nodes
1566 marked as "abstract instances" because we don't actually generate
1567 any code or allocate any data space for such instances. */
1568 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1570 /* Nonzero if a _DECL means that no warnings should be generated just
1571 because this decl is unused. */
1572 #define DECL_IN_SYSTEM_HEADER(NODE) \
1573 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1575 /* Nonzero for a given ..._DECL node means that this node should be
1576 put in .common, if possible. If a DECL_INITIAL is given, and it
1577 is not error_mark_node, then the decl cannot be put in .common. */
1578 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1580 /* Language-specific decl information. */
1581 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1583 /* In a VAR_DECL or FUNCTION_DECL,
1584 nonzero means external reference:
1585 do not allocate storage, and refer to a definition elsewhere. */
1586 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1588 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1590 #define DEFAULT_INIT_PRIORITY 65535
1591 #define MAX_INIT_PRIORITY 65535
1592 #define MAX_RESERVED_INIT_PRIORITY 100
1595 nonzero means the detail info about this type is not dumped into stabs.
1596 Instead it will generate cross reference ('x') of names.
1597 This uses the same flag as DECL_EXTERNAL. */
1598 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1599 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1601 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1602 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1604 /* In LABEL_DECL nodes, nonzero means that an error message about
1605 jumping into such a binding contour has been printed for this label. */
1606 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1608 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1609 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1611 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1612 static chain is not needed. */
1613 #define DECL_NO_STATIC_CHAIN(NODE) \
1614 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1616 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1617 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1619 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1621 Also set in some languages for variables, etc., outside the normal
1622 lexical scope, such as class instance variables. */
1623 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1625 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1626 where it is called. */
1627 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1629 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1630 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1632 /* In a VAR_DECL, nonzero if the data should be allocated from
1633 thread-local storage. */
1634 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1636 /* In a FUNCTION_DECL, the saved representation of the body of the
1637 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1638 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1639 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1641 /* List of FUNCTION_DECLs inlined into this function's body. */
1642 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1644 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1645 that is not specified by ansi C and that users are supposed to be allowed
1646 to redefine for any purpose whatever. */
1647 #define DECL_BUILT_IN_NONANSI(NODE) \
1648 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1650 /* Nonzero in a FUNCTION_DECL means this function should be treated
1651 as if it were a malloc, meaning it returns a pointer that is
1653 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1655 /* Nonzero in a FUNCTION_DECL means this function should be treated
1656 as "pure" function (like const function, but may read global memory). */
1657 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1659 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1661 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1663 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1664 contour that restored a stack level and which is now exited. */
1665 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1667 /* Unused in FUNCTION_DECL. */
1669 /* In a VAR_DECL that's static,
1670 nonzero if the space is in the text section. */
1671 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1673 /* In a FUNCTION_DECL, nonzero means a built in function. */
1674 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1676 /* For a builtin function, identify which part of the compiler defined it. */
1677 #define DECL_BUILT_IN_CLASS(NODE) \
1678 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1680 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1681 Used in FIELD_DECLs for vtable pointers.
1682 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1683 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1685 /* Used to indicate that the linkage status of this DECL is not yet known,
1686 so it should not be output now. */
1687 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1689 /* Used in PARM_DECLs whose type are unions to indicate that the
1690 argument should be passed in the same way that the first union
1691 alternative would be passed. */
1692 #define DECL_TRANSPARENT_UNION(NODE) \
1693 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1695 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1696 at the beginning or end of execution. */
1697 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1698 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1700 #define DECL_STATIC_DESTRUCTOR(NODE) \
1701 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1703 /* Used to indicate that this DECL represents a compiler-generated entity. */
1704 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1706 /* Used to indicate that this DECL has weak linkage. */
1707 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1709 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1710 multiple translation units should be merged. */
1711 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1713 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1714 not be put out unless it is needed in this translation unit.
1715 Entities like this are shared across translation units (like weak
1716 entities), but are guaranteed to be generated by any translation
1717 unit that needs them, and therefore need not be put out anywhere
1718 where they are not needed. DECL_COMDAT is just a hint to the
1719 back-end; it is up to front-ends which set this flag to ensure
1720 that there will never be any harm, other than bloat, in putting out
1721 something which is DECL_COMDAT. */
1722 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1724 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1725 be instrumented with calls to support routines. */
1726 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1727 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1729 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1730 disabled in this function. */
1731 #define DECL_NO_LIMIT_STACK(NODE) \
1732 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1734 /* Additional flags for language-specific uses. */
1735 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1736 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1737 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1738 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1739 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1740 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1741 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1742 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1744 /* Used to indicate that the pointer to this DECL cannot be treated as
1745 an address constant. */
1746 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1748 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1750 #define DECL_NONADDRESSABLE_P(NODE) \
1751 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1753 /* Used to indicate an alias set for the memory pointed to by this
1754 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1755 pointer (or reference) type. */
1756 #define DECL_POINTER_ALIAS_SET(NODE) \
1757 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1759 /* Nonzero if an alias set has been assigned to this declaration. */
1760 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1761 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1763 /* The pointer_depth field comprises two bits for values in the range
1764 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1765 type node, but for functions it migth be greater. For example,
1766 this can happen when the function is declared to accept a parameter
1767 of type void* (depth=1), but is actually called with an argument of
1768 type foo** (depth=2). The function type will get the formal
1769 parameter's depth, but the function decl will get the actual
1770 argument's depth. */
1771 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1775 struct tree_decl
GTY(())
1777 struct tree_common common
;
1781 ENUM_BITFIELD(machine_mode
) mode
: 8;
1783 unsigned external_flag
: 1;
1784 unsigned nonlocal_flag
: 1;
1785 unsigned regdecl_flag
: 1;
1786 unsigned inline_flag
: 1;
1787 unsigned bit_field_flag
: 1;
1788 unsigned virtual_flag
: 1;
1789 unsigned ignored_flag
: 1;
1790 unsigned abstract_flag
: 1;
1792 unsigned in_system_header_flag
: 1;
1793 unsigned common_flag
: 1;
1794 unsigned defer_output
: 1;
1795 unsigned transparent_union
: 1;
1796 unsigned static_ctor_flag
: 1;
1797 unsigned static_dtor_flag
: 1;
1798 unsigned artificial_flag
: 1;
1799 unsigned weak_flag
: 1;
1801 unsigned non_addr_const_p
: 1;
1802 unsigned no_instrument_function_entry_exit
: 1;
1803 unsigned comdat_flag
: 1;
1804 unsigned malloc_flag
: 1;
1805 unsigned no_limit_stack
: 1;
1806 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
1807 unsigned pure_flag
: 1;
1809 unsigned pointer_depth
: 2;
1810 unsigned non_addressable
: 1;
1811 unsigned user_align
: 1;
1812 unsigned uninlinable
: 1;
1813 unsigned thread_local_flag
: 1;
1814 /* Two unused bits. */
1816 unsigned lang_flag_0
: 1;
1817 unsigned lang_flag_1
: 1;
1818 unsigned lang_flag_2
: 1;
1819 unsigned lang_flag_3
: 1;
1820 unsigned lang_flag_4
: 1;
1821 unsigned lang_flag_5
: 1;
1822 unsigned lang_flag_6
: 1;
1823 unsigned lang_flag_7
: 1;
1825 union tree_decl_u1
{
1826 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1827 DECL_FUNCTION_CODE. */
1828 enum built_in_function f
;
1829 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
1830 is used by language-dependent code. */
1832 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1834 struct tree_decl_u1_a
{
1835 unsigned int align
: 24;
1836 unsigned int off_align
: 8;
1838 } GTY ((skip (""))) u1
;
1843 tree arguments
; /* Also used for DECL_FIELD_OFFSET */
1844 tree result
; /* Also used for DECL_BIT_FIELD_TYPE */
1845 tree initial
; /* Also used for DECL_QUALIFIER */
1846 tree abstract_origin
;
1847 tree assembler_name
;
1850 rtx rtl
; /* RTL representation for object. */
1853 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1854 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1855 In PARM_DECL, holds an RTL for the stack slot
1856 of register where the data was actually passed.
1857 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1858 union tree_decl_u2
{
1859 struct function
* GTY ((tag ("FUNCTION_DECL"))) f
;
1860 rtx
GTY ((tag ("PARM_DECL"))) r
;
1861 tree
GTY ((tag ("FIELD_DECL"))) t
;
1863 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2
;
1865 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1868 /* In a FUNCTION_DECL, these are function data which is to be kept
1869 as long as FUNCTION_DECL is kept. */
1873 HOST_WIDE_INT pointer_alias_set
;
1874 /* Points to a structure whose details depend on the language in use. */
1875 struct lang_decl
*lang_specific
;
1878 enum tree_node_structure_enum
{
1895 /* Define the overall contents of a tree node.
1896 It may be any of the structures declared above
1897 for various types of node. */
1899 union tree_node
GTY ((ptr_alias (union lang_tree_node
),
1900 desc ("tree_node_structure (&%h)")))
1902 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
1903 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
1904 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
1905 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
1906 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
1907 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
1908 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
1909 struct tree_decl
GTY ((tag ("TS_DECL"))) decl
;
1910 struct tree_type
GTY ((tag ("TS_TYPE"))) type
;
1911 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
1912 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
1913 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
1914 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
1917 /* Standard named or nameless data types of the C compiler. */
1936 TI_INTEGER_MINUS_ONE
,
1946 TI_COMPLEX_INTEGER_TYPE
,
1947 TI_COMPLEX_FLOAT_TYPE
,
1948 TI_COMPLEX_DOUBLE_TYPE
,
1949 TI_COMPLEX_LONG_DOUBLE_TYPE
,
1953 TI_LONG_DOUBLE_TYPE
,
1994 extern GTY(()) tree global_trees
[TI_MAX
];
1996 #define error_mark_node global_trees[TI_ERROR_MARK]
1998 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1999 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2000 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2001 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2002 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2004 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2005 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2006 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2007 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2008 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2010 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2011 #define integer_one_node global_trees[TI_INTEGER_ONE]
2012 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2013 #define size_zero_node global_trees[TI_SIZE_ZERO]
2014 #define size_one_node global_trees[TI_SIZE_ONE]
2015 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2016 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2017 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2019 #define null_pointer_node global_trees[TI_NULL_POINTER]
2021 #define float_type_node global_trees[TI_FLOAT_TYPE]
2022 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2023 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2025 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2026 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2027 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2028 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2030 #define void_type_node global_trees[TI_VOID_TYPE]
2031 /* The C type `void *'. */
2032 #define ptr_type_node global_trees[TI_PTR_TYPE]
2033 /* The C type `const void *'. */
2034 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2035 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2036 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2038 /* The node that should be placed at the end of a parameter list to
2039 indicate that the function does not take a variable number of
2040 arguments. The TREE_VALUE will be void_type_node and there will be
2041 no TREE_CHAIN. Language-independent code should not assume
2042 anything else about this node. */
2043 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2045 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2046 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2048 #define unsigned_V16QI_type_node global_trees[TI_UV16QI_TYPE]
2049 #define unsigned_V4SI_type_node global_trees[TI_UV4SI_TYPE]
2050 #define unsigned_V8QI_type_node global_trees[TI_UV8QI_TYPE]
2051 #define unsigned_V8HI_type_node global_trees[TI_UV8HI_TYPE]
2052 #define unsigned_V4HI_type_node global_trees[TI_UV4HI_TYPE]
2053 #define unsigned_V2HI_type_node global_trees[TI_UV2HI_TYPE]
2054 #define unsigned_V2SI_type_node global_trees[TI_UV2SI_TYPE]
2055 #define unsigned_V2DI_type_node global_trees[TI_UV2DI_TYPE]
2056 #define unsigned_V1DI_type_node global_trees[TI_UV1DI_TYPE]
2058 #define V16QI_type_node global_trees[TI_V16QI_TYPE]
2059 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
2060 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
2061 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
2062 #define V8HI_type_node global_trees[TI_V8HI_TYPE]
2063 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
2064 #define V2HI_type_node global_trees[TI_V2HI_TYPE]
2065 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
2066 #define V2SF_type_node global_trees[TI_V2SF_TYPE]
2067 #define V2DI_type_node global_trees[TI_V2DI_TYPE]
2068 #define V2DF_type_node global_trees[TI_V2DF_TYPE]
2069 #define V16SF_type_node global_trees[TI_V16SF_TYPE]
2070 #define V1DI_type_node global_trees[TI_V1DI_TYPE]
2072 /* An enumeration of the standard C integer types. These must be
2073 ordered so that shorter types appear before longer ones, and so
2074 that signed types appear before unsigned ones, for the correct
2075 functioning of interpret_integer() in c-lex.c. */
2076 enum integer_type_kind
2088 itk_unsigned_long_long
,
2092 typedef enum integer_type_kind integer_type_kind
;
2094 /* The standard C integer types. Use integer_type_kind to index into
2096 extern GTY(()) tree integer_types
[itk_none
];
2098 #define char_type_node integer_types[itk_char]
2099 #define signed_char_type_node integer_types[itk_signed_char]
2100 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2101 #define short_integer_type_node integer_types[itk_short]
2102 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2103 #define integer_type_node integer_types[itk_int]
2104 #define unsigned_type_node integer_types[itk_unsigned_int]
2105 #define long_integer_type_node integer_types[itk_long]
2106 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2107 #define long_long_integer_type_node integer_types[itk_long_long]
2108 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2110 /* Set to the default thread-local storage (tls) model to use. */
2113 TLS_MODEL_GLOBAL_DYNAMIC
= 1,
2114 TLS_MODEL_LOCAL_DYNAMIC
,
2115 TLS_MODEL_INITIAL_EXEC
,
2116 TLS_MODEL_LOCAL_EXEC
2119 extern enum tls_model flag_tls_default
;
2121 /* A pointer-to-function member type looks like:
2128 If __pfn is NULL, it is a NULL pointer-to-member-function.
2130 (Because the vtable is always the first thing in the object, we
2131 don't need its offset.) If the function is virtual, then PFN is
2132 one plus twice the index into the vtable; otherwise, it is just a
2133 pointer to the function.
2135 Unfortunately, using the lowest bit of PFN doesn't work in
2136 architectures that don't impose alignment requirements on function
2137 addresses, or that use the lowest bit to tell one ISA from another,
2138 for example. For such architectures, we use the lowest bit of
2139 DELTA instead of the lowest bit of the PFN, and DELTA will be
2142 enum ptrmemfunc_vbit_where_t
2144 ptrmemfunc_vbit_in_pfn
,
2145 ptrmemfunc_vbit_in_delta
2148 #define NULL_TREE (tree) NULL
2150 /* Approximate positive square root of a host double. This is for
2151 statistical reports, not code generation. */
2152 extern double approx_sqrt
PARAMS ((double));
2154 extern tree decl_assembler_name
PARAMS ((tree
));
2156 /* Compute the number of bytes occupied by 'node'. This routine only
2157 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2159 extern size_t tree_size
PARAMS ((tree
));
2161 /* Lowest level primitive for allocating a node.
2162 The TREE_CODE is the only argument. Contents are initialized
2163 to zero except for a few of the common fields. */
2165 extern tree make_node
PARAMS ((enum tree_code
));
2167 /* Make a copy of a node, with all the same contents. */
2169 extern tree copy_node
PARAMS ((tree
));
2171 /* Make a copy of a chain of TREE_LIST nodes. */
2173 extern tree copy_list
PARAMS ((tree
));
2175 /* Make a TREE_VEC. */
2177 extern tree make_tree_vec
PARAMS ((int));
2179 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2180 The name is supplied as a char *. */
2182 extern tree get_identifier
PARAMS ((const char *));
2184 /* Identical to get_identifier, except that the length is assumed
2187 extern tree get_identifier_with_length
PARAMS ((const char *, unsigned int));
2189 /* If an identifier with the name TEXT (a null-terminated string) has
2190 previously been referred to, return that node; otherwise return
2193 extern tree maybe_get_identifier
PARAMS ((const char *));
2195 /* Construct various types of nodes. */
2197 #define build_int_2(LO, HI) \
2198 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2200 extern tree build
PARAMS ((enum tree_code
, tree
, ...));
2201 extern tree build_nt
PARAMS ((enum tree_code
, ...));
2203 extern tree build_int_2_wide
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
));
2204 extern tree build_vector
PARAMS ((tree
, tree
));
2205 extern tree build_real_from_int_cst
PARAMS ((tree
, tree
));
2206 extern tree build_complex
PARAMS ((tree
, tree
, tree
));
2207 extern tree build_string
PARAMS ((int, const char *));
2208 extern tree build1
PARAMS ((enum tree_code
, tree
, tree
));
2209 extern tree build_tree_list
PARAMS ((tree
, tree
));
2210 extern tree build_decl
PARAMS ((enum tree_code
, tree
, tree
));
2211 extern tree build_block
PARAMS ((tree
, tree
, tree
, tree
, tree
));
2212 extern tree build_expr_wfl
PARAMS ((tree
, const char *, int, int));
2214 /* Construct various nodes representing data types. */
2216 extern tree make_signed_type
PARAMS ((int));
2217 extern tree make_unsigned_type
PARAMS ((int));
2218 extern void initialize_sizetypes
PARAMS ((void));
2219 extern void set_sizetype
PARAMS ((tree
));
2220 extern void fixup_unsigned_type
PARAMS ((tree
));
2221 extern tree build_pointer_type
PARAMS ((tree
));
2222 extern tree build_reference_type
PARAMS ((tree
));
2223 extern tree build_type_no_quals
PARAMS ((tree
));
2224 extern tree build_index_type
PARAMS ((tree
));
2225 extern tree build_index_2_type
PARAMS ((tree
, tree
));
2226 extern tree build_array_type
PARAMS ((tree
, tree
));
2227 extern tree build_function_type
PARAMS ((tree
, tree
));
2228 extern tree build_function_type_list
PARAMS ((tree
, ...));
2229 extern tree build_method_type
PARAMS ((tree
, tree
));
2230 extern tree build_offset_type
PARAMS ((tree
, tree
));
2231 extern tree build_complex_type
PARAMS ((tree
));
2232 extern tree array_type_nelts
PARAMS ((tree
));
2234 extern tree value_member
PARAMS ((tree
, tree
));
2235 extern tree purpose_member
PARAMS ((tree
, tree
));
2236 extern tree binfo_member
PARAMS ((tree
, tree
));
2237 extern unsigned int attribute_hash_list
PARAMS ((tree
));
2238 extern int attribute_list_equal
PARAMS ((tree
, tree
));
2239 extern int attribute_list_contained
PARAMS ((tree
, tree
));
2240 extern int tree_int_cst_equal
PARAMS ((tree
, tree
));
2241 extern int tree_int_cst_lt
PARAMS ((tree
, tree
));
2242 extern int tree_int_cst_compare
PARAMS ((tree
, tree
));
2243 extern int host_integerp
PARAMS ((tree
, int));
2244 extern HOST_WIDE_INT tree_low_cst
PARAMS ((tree
, int));
2245 extern int tree_int_cst_msb
PARAMS ((tree
));
2246 extern int tree_int_cst_sgn
PARAMS ((tree
));
2247 extern int tree_expr_nonnegative_p
PARAMS ((tree
));
2248 extern int rtl_expr_nonnegative_p
PARAMS ((rtx
));
2249 extern int index_type_equal
PARAMS ((tree
, tree
));
2250 extern tree get_inner_array_type
PARAMS ((tree
));
2252 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2253 put the prototype here. Rtl.h does declare the prototype if
2254 tree.h had been included. */
2256 extern tree make_tree
PARAMS ((tree
, rtx
));
2258 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2261 Such modified types already made are recorded so that duplicates
2264 extern tree build_type_attribute_variant
PARAMS ((tree
, tree
));
2265 extern tree build_decl_attribute_variant
PARAMS ((tree
, tree
));
2267 /* Structure describing an attribute and a function to handle it. */
2268 struct attribute_spec
2270 /* The name of the attribute (without any leading or trailing __),
2271 or NULL to mark the end of a table of attributes. */
2272 const char *const name
;
2273 /* The minimum length of the list of arguments of the attribute. */
2274 const int min_length
;
2275 /* The maximum length of the list of arguments of the attribute
2276 (-1 for no maximum). */
2277 const int max_length
;
2278 /* Whether this attribute requires a DECL. If it does, it will be passed
2279 from types of DECLs, function return types and array element types to
2280 the DECLs, function types and array types respectively; but when
2281 applied to a type in any other circumstances, it will be ignored with
2282 a warning. (If greater control is desired for a given attribute,
2283 this should be false, and the flags argument to the handler may be
2284 used to gain greater control in that case.) */
2285 const bool decl_required
;
2286 /* Whether this attribute requires a type. If it does, it will be passed
2287 from a DECL to the type of that DECL. */
2288 const bool type_required
;
2289 /* Whether this attribute requires a function (or method) type. If it does,
2290 it will be passed from a function pointer type to the target type,
2291 and from a function return type (which is not itself a function
2292 pointer type) to the function type. */
2293 const bool function_type_required
;
2294 /* Function to handle this attribute. NODE points to the node to which
2295 the attribute is to be applied. If a DECL, it should be modified in
2296 place; if a TYPE, a copy should be created. NAME is the name of the
2297 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2298 of the arguments (which may be NULL). FLAGS gives further information
2299 about the context of the attribute. Afterwards, the attributes will
2300 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2301 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2302 as well as in any other cases when the attributes should not be added
2303 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2304 applied to another type or DECL later may be returned;
2305 otherwise the return value should be NULL_TREE. This pointer may be
2306 NULL if no special handling is required beyond the checks implied
2307 by the rest of this structure. */
2308 tree (*const handler
) PARAMS ((tree
*node
, tree name
, tree args
,
2309 int flags
, bool *no_add_attrs
));
2312 /* Flags that may be passed in the third argument of decl_attributes, and
2313 to handler functions for attributes. */
2314 enum attribute_flags
2316 /* The type passed in is the type of a DECL, and any attributes that
2317 should be passed in again to be applied to the DECL rather than the
2318 type should be returned. */
2319 ATTR_FLAG_DECL_NEXT
= 1,
2320 /* The type passed in is a function return type, and any attributes that
2321 should be passed in again to be applied to the function type rather
2322 than the return type should be returned. */
2323 ATTR_FLAG_FUNCTION_NEXT
= 2,
2324 /* The type passed in is an array element type, and any attributes that
2325 should be passed in again to be applied to the array type rather
2326 than the element type should be returned. */
2327 ATTR_FLAG_ARRAY_NEXT
= 4,
2328 /* The type passed in is a structure, union or enumeration type being
2329 created, and should be modified in place. */
2330 ATTR_FLAG_TYPE_IN_PLACE
= 8,
2331 /* The attributes are being applied by default to a library function whose
2332 name indicates known behavior, and should be silently ignored if they
2333 are not in fact compatible with the function type. */
2334 ATTR_FLAG_BUILT_IN
= 16
2337 /* Default versions of target-overridable functions. */
2339 extern tree merge_decl_attributes
PARAMS ((tree
, tree
));
2340 extern tree merge_type_attributes
PARAMS ((tree
, tree
));
2341 extern int default_comp_type_attributes
PARAMS ((tree
, tree
));
2342 extern void default_set_default_type_attributes
PARAMS ((tree
));
2343 extern void default_insert_attributes
PARAMS ((tree
, tree
*));
2344 extern bool default_function_attribute_inlinable_p
PARAMS ((tree
));
2345 extern bool default_ms_bitfield_layout_p
PARAMS ((tree
));
2347 extern void default_register_cpp_builtins
PARAMS ((struct cpp_reader
*));
2349 /* Split a list of declspecs and attributes into two. */
2351 extern void split_specs_attrs
PARAMS ((tree
, tree
*, tree
*));
2353 /* Strip attributes from a list of combined specs and attrs. */
2355 extern tree strip_attrs
PARAMS ((tree
));
2357 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2359 extern int valid_machine_attribute
PARAMS ((tree
, tree
, tree
, tree
));
2361 /* Given a tree node and a string, return nonzero if the tree node is
2362 a valid attribute name for the string. */
2364 extern int is_attribute_p
PARAMS ((const char *, tree
));
2366 /* Given an attribute name and a list of attributes, return the list element
2367 of the attribute or NULL_TREE if not found. */
2369 extern tree lookup_attribute
PARAMS ((const char *, tree
));
2371 /* Given two attributes lists, return a list of their union. */
2373 extern tree merge_attributes
PARAMS ((tree
, tree
));
2375 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2376 /* Given two Windows decl attributes lists, possibly including
2377 dllimport, return a list of their union . */
2378 extern tree merge_dllimport_decl_attributes
PARAMS ((tree
, tree
));
2381 /* Return true if DECL will be always resolved to a symbol defined in the
2382 same module (shared library or program). */
2383 #define MODULE_LOCAL_P(DECL) \
2384 (lookup_attribute ("visibility", DECL_ATTRIBUTES (DECL)) != NULL)
2386 /* Return a version of the TYPE, qualified as indicated by the
2387 TYPE_QUALS, if one exists. If no qualified version exists yet,
2388 return NULL_TREE. */
2390 extern tree get_qualified_type
PARAMS ((tree
, int));
2392 /* Like get_qualified_type, but creates the type if it does not
2393 exist. This function never returns NULL_TREE. */
2395 extern tree build_qualified_type
PARAMS ((tree
, int));
2397 /* Like build_qualified_type, but only deals with the `const' and
2398 `volatile' qualifiers. This interface is retained for backwards
2399 compatiblity with the various front-ends; new code should use
2400 build_qualified_type instead. */
2402 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2403 build_qualified_type ((TYPE), \
2404 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2405 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2407 /* Make a copy of a type node. */
2409 extern tree build_type_copy
PARAMS ((tree
));
2411 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2412 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2413 node, does nothing except for the first time. */
2415 extern void layout_type
PARAMS ((tree
));
2417 /* These functions allow a front-end to perform a manual layout of a
2418 RECORD_TYPE. (For instance, if the placement of subsequent fields
2419 depends on the placement of fields so far.) Begin by calling
2420 start_record_layout. Then, call place_field for each of the
2421 fields. Then, call finish_record_layout. See layout_type for the
2422 default way in which these functions are used. */
2424 typedef struct record_layout_info_s
2426 /* The RECORD_TYPE that we are laying out. */
2428 /* The offset into the record so far, in bytes, not including bits in
2431 /* The last known alignment of SIZE. */
2432 unsigned int offset_align
;
2433 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2435 /* The alignment of the record so far, in bits. */
2436 unsigned int record_align
;
2437 /* The alignment of the record so far, not including padding, in bits. */
2438 unsigned int unpacked_align
;
2439 /* The alignment of the record so far, allowing for the record to be
2440 padded only at the end, in bits. */
2441 unsigned int unpadded_align
;
2442 /* The previous field layed out. */
2444 /* The static variables (i.e., class variables, as opposed to
2445 instance variables) encountered in T. */
2446 tree pending_statics
;
2447 /* Bits remaining in the current alignment group */
2448 int remaining_in_alignment
;
2449 int packed_maybe_necessary
;
2450 } *record_layout_info
;
2452 extern void set_lang_adjust_rli
PARAMS ((void (*) PARAMS
2453 ((record_layout_info
))));
2454 extern record_layout_info start_record_layout
PARAMS ((tree
));
2455 extern tree bit_from_pos
PARAMS ((tree
, tree
));
2456 extern tree byte_from_pos
PARAMS ((tree
, tree
));
2457 extern void pos_from_byte
PARAMS ((tree
*, tree
*, unsigned int,
2459 extern void pos_from_bit
PARAMS ((tree
*, tree
*, unsigned int,
2461 extern void normalize_offset
PARAMS ((tree
*, tree
*,
2463 extern tree rli_size_unit_so_far
PARAMS ((record_layout_info
));
2464 extern tree rli_size_so_far
PARAMS ((record_layout_info
));
2465 extern void normalize_rli
PARAMS ((record_layout_info
));
2466 extern void place_field
PARAMS ((record_layout_info
, tree
));
2467 extern void compute_record_mode
PARAMS ((tree
));
2468 extern void finish_record_layout
PARAMS ((record_layout_info
, int));
2470 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2471 return a canonicalized ..._TYPE node, so that duplicates are not made.
2472 How the hash code is computed is up to the caller, as long as any two
2473 callers that could hash identical-looking type nodes agree. */
2475 extern tree type_hash_canon
PARAMS ((unsigned int, tree
));
2477 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2478 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2479 fields. Call this only once for any given decl node.
2481 Second argument is the boundary that this field can be assumed to
2482 be starting at (in bits). Zero means it can be assumed aligned
2483 on any boundary that may be needed. */
2485 extern void layout_decl
PARAMS ((tree
, unsigned));
2487 /* Return the mode for data of a given size SIZE and mode class CLASS.
2488 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2489 The value is BLKmode if no other mode is found. This is like
2490 mode_for_size, but is passed a tree. */
2492 extern enum machine_mode mode_for_size_tree
PARAMS ((tree
, enum mode_class
,
2495 /* Return an expr equal to X but certainly not valid as an lvalue. */
2497 extern tree non_lvalue
PARAMS ((tree
));
2498 extern tree pedantic_non_lvalue
PARAMS ((tree
));
2500 extern tree convert
PARAMS ((tree
, tree
));
2501 extern unsigned int expr_align
PARAMS ((tree
));
2502 extern tree size_in_bytes
PARAMS ((tree
));
2503 extern HOST_WIDE_INT int_size_in_bytes
PARAMS ((tree
));
2504 extern tree bit_position
PARAMS ((tree
));
2505 extern HOST_WIDE_INT int_bit_position
PARAMS ((tree
));
2506 extern tree byte_position
PARAMS ((tree
));
2507 extern HOST_WIDE_INT int_byte_position
PARAMS ((tree
));
2509 /* Define data structures, macros, and functions for handling sizes
2510 and the various types used to represent sizes. */
2514 SIZETYPE
, /* Normal representation of sizes in bytes. */
2515 SSIZETYPE
, /* Signed representation of sizes in bytes. */
2516 USIZETYPE
, /* Unsigned representation of sizes in bytes. */
2517 BITSIZETYPE
, /* Normal representation of sizes in bits. */
2518 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
2519 UBITSIZETYPE
, /* Unsifgned representation of sizes in bits. */
2522 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
2524 #define sizetype sizetype_tab[(int) SIZETYPE]
2525 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2526 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2527 #define usizetype sizetype_tab[(int) USIZETYPE]
2528 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2529 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2531 extern tree size_binop
PARAMS ((enum tree_code
, tree
, tree
));
2532 extern tree size_diffop
PARAMS ((tree
, tree
));
2533 extern tree size_int_wide
PARAMS ((HOST_WIDE_INT
,
2534 enum size_type_kind
));
2535 extern tree size_int_type_wide
PARAMS ((HOST_WIDE_INT
, tree
));
2537 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2538 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2539 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2540 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2541 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2543 extern tree round_up
PARAMS ((tree
, int));
2544 extern tree round_down
PARAMS ((tree
, int));
2545 extern tree get_pending_sizes
PARAMS ((void));
2546 extern int is_pending_size
PARAMS ((tree
));
2547 extern void put_pending_size
PARAMS ((tree
));
2548 extern void put_pending_sizes
PARAMS ((tree
));
2550 /* Type for sizes of data-type. */
2552 #define BITS_PER_UNIT_LOG \
2553 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2554 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2555 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2557 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2558 extern unsigned int maximum_field_alignment
;
2560 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2561 extern unsigned int set_alignment
;
2563 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2564 by making the last node in X point to Y.
2565 Returns X, except if X is 0 returns Y. */
2567 extern tree chainon
PARAMS ((tree
, tree
));
2569 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2571 extern tree tree_cons
PARAMS ((tree
, tree
, tree
));
2573 /* Return the last tree node in a chain. */
2575 extern tree tree_last
PARAMS ((tree
));
2577 /* Reverse the order of elements in a chain, and return the new head. */
2579 extern tree nreverse
PARAMS ((tree
));
2581 /* Returns the length of a chain of nodes
2582 (number of chain pointers to follow before reaching a null pointer). */
2584 extern int list_length
PARAMS ((tree
));
2586 /* Returns the number of FIELD_DECLs in a type. */
2588 extern int fields_length
PARAMS ((tree
));
2590 /* Given an initializer INIT, return TRUE if INIT is zero or some
2591 aggregate of zeros. Otherwise return FALSE. */
2593 extern bool initializer_zerop
PARAMS ((tree
));
2595 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2597 extern int integer_zerop
PARAMS ((tree
));
2599 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2601 extern int integer_onep
PARAMS ((tree
));
2603 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2604 all of whose significant bits are 1. */
2606 extern int integer_all_onesp
PARAMS ((tree
));
2608 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2609 exactly one bit 1. */
2611 extern int integer_pow2p
PARAMS ((tree
));
2613 /* staticp (tree x) is nonzero if X is a reference to data allocated
2614 at a fixed address in memory. */
2616 extern int staticp
PARAMS ((tree
));
2618 /* Gets an error if argument X is not an lvalue.
2619 Also returns 1 if X is an lvalue, 0 if not. */
2621 extern int lvalue_or_else
PARAMS ((tree
, const char *));
2623 /* save_expr (EXP) returns an expression equivalent to EXP
2624 but it can be used multiple times within context CTX
2625 and only evaluate EXP once. */
2627 extern tree save_expr
PARAMS ((tree
));
2629 /* Returns the index of the first non-tree operand for CODE, or the number
2630 of operands if all are trees. */
2632 extern int first_rtl_op
PARAMS ((enum tree_code
));
2634 /* Return which tree structure is used by T. */
2636 enum tree_node_structure_enum tree_node_structure
PARAMS ((tree
));
2638 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2639 can be used multiple times and will evaluate EXP in its entirety
2642 extern tree unsave_expr
PARAMS ((tree
));
2644 /* Reset EXP in place so that it can be expaned again. Does not
2645 recurse into subtrees. */
2647 extern void unsave_expr_1
PARAMS ((tree
));
2649 /* Return 0 if it is safe to evaluate EXPR multiple times,
2650 return 1 if it is safe if EXPR is unsaved afterward, or
2651 return 2 if it is completely unsafe. */
2652 extern int unsafe_for_reeval
PARAMS ((tree
));
2654 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2655 or offset that depends on a field within a record.
2657 Note that we only allow such expressions within simple arithmetic
2660 extern int contains_placeholder_p
PARAMS ((tree
));
2662 /* Return 1 if EXP contains any expressions that produce cleanups for an
2663 outer scope to deal with. Used by fold. */
2665 extern int has_cleanups
PARAMS ((tree
));
2667 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2668 return a tree with all occurrences of references to F in a
2669 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2670 contains only arithmetic expressions. */
2672 extern tree substitute_in_expr
PARAMS ((tree
, tree
, tree
));
2674 /* variable_size (EXP) is like save_expr (EXP) except that it
2675 is for the special case of something that is part of a
2676 variable size for a data type. It makes special arrangements
2677 to compute the value at the right time when the data type
2678 belongs to a function parameter. */
2680 extern tree variable_size
PARAMS ((tree
));
2682 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2683 but it can be used multiple times
2684 and only evaluate the subexpressions once. */
2686 extern tree stabilize_reference
PARAMS ((tree
));
2688 /* Subroutine of stabilize_reference; this is called for subtrees of
2689 references. Any expression with side-effects must be put in a SAVE_EXPR
2690 to ensure that it is only evaluated once. */
2692 extern tree stabilize_reference_1
PARAMS ((tree
));
2694 /* Return EXP, stripped of any conversions to wider types
2695 in such a way that the result of converting to type FOR_TYPE
2696 is the same as if EXP were converted to FOR_TYPE.
2697 If FOR_TYPE is 0, it signifies EXP's type. */
2699 extern tree get_unwidened
PARAMS ((tree
, tree
));
2701 /* Return OP or a simpler expression for a narrower value
2702 which can be sign-extended or zero-extended to give back OP.
2703 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2704 or 0 if the value should be sign-extended. */
2706 extern tree get_narrower
PARAMS ((tree
, int *));
2708 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2709 look for nested component-refs or array-refs at constant positions
2710 and find the ultimate containing object, which is returned. */
2712 extern tree get_inner_reference
PARAMS ((tree
, HOST_WIDE_INT
*,
2713 HOST_WIDE_INT
*, tree
*,
2714 enum machine_mode
*, int *,
2717 /* Return 1 if T is an expression that get_inner_reference handles. */
2719 extern int handled_component_p
PARAMS ((tree
));
2721 /* Given a DECL or TYPE, return the scope in which it was declared, or
2722 NUL_TREE if there is no containing scope. */
2724 extern tree get_containing_scope
PARAMS ((tree
));
2726 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2728 extern tree decl_function_context
PARAMS ((tree
));
2730 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2731 this _DECL with its context, or zero if none. */
2732 extern tree decl_type_context
PARAMS ((tree
));
2734 /* Given the FUNCTION_DECL for the current function,
2735 return zero if it is ok for this function to be inline.
2736 Otherwise return a warning message with a single %s
2737 for the function's name. */
2739 extern const char *function_cannot_inline_p
PARAMS ((tree
));
2741 /* Return 1 if EXPR is the real constant zero. */
2742 extern int real_zerop
PARAMS ((tree
));
2744 /* Declare commonly used variables for tree structure. */
2746 /* Points to the name of the input file from which the current input
2747 being parsed originally came (before it went into cpp). */
2748 extern const char *input_filename
;
2750 /* Current line number in input file. */
2753 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2754 Zero means allow extended lvalues. */
2756 extern int pedantic_lvalues
;
2758 /* Nonzero means can safely call expand_expr now;
2759 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2761 extern int immediate_size_expand
;
2763 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2765 extern GTY(()) tree current_function_decl
;
2767 /* Nonzero means a FUNC_BEGIN label was emitted. */
2768 extern GTY(()) tree current_function_func_begin_label
;
2770 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2772 extern int all_types_permanent
;
2774 /* Declare a predefined function. Return the declaration. This function is
2775 provided by each language frontend. */
2776 extern tree builtin_function
PARAMS ((const char *, tree
, int,
2777 enum built_in_class
,
2778 const char *, tree
));
2781 extern void clean_symbol_name
PARAMS ((char *));
2782 extern tree get_file_function_name_long
PARAMS ((const char *));
2783 extern tree get_set_constructor_bits
PARAMS ((tree
, char *, int));
2784 extern tree get_set_constructor_bytes
PARAMS ((tree
,
2785 unsigned char *, int));
2786 extern tree get_callee_fndecl
PARAMS ((tree
));
2787 extern void set_decl_assembler_name
PARAMS ((tree
));
2788 extern int type_num_arguments
PARAMS ((tree
));
2789 extern tree lhd_unsave_expr_now
PARAMS ((tree
));
2794 extern int in_control_zone_p
PARAMS ((void));
2795 extern void expand_fixups
PARAMS ((rtx
));
2796 extern tree expand_start_stmt_expr
PARAMS ((int));
2797 extern tree expand_end_stmt_expr
PARAMS ((tree
));
2798 extern void expand_expr_stmt
PARAMS ((tree
));
2799 extern void expand_expr_stmt_value
PARAMS ((tree
, int, int));
2800 extern int warn_if_unused_value
PARAMS ((tree
));
2801 extern void expand_decl_init
PARAMS ((tree
));
2802 extern void clear_last_expr
PARAMS ((void));
2803 extern void expand_label
PARAMS ((tree
));
2804 extern void expand_goto
PARAMS ((tree
));
2805 extern void expand_asm
PARAMS ((tree
));
2806 extern void expand_start_cond
PARAMS ((tree
, int));
2807 extern void expand_end_cond
PARAMS ((void));
2808 extern void expand_start_else
PARAMS ((void));
2809 extern void expand_start_elseif
PARAMS ((tree
));
2810 extern struct nesting
*expand_start_loop
PARAMS ((int));
2811 extern struct nesting
*expand_start_loop_continue_elsewhere
PARAMS ((int));
2812 extern struct nesting
*expand_start_null_loop
PARAMS ((void));
2813 extern void expand_loop_continue_here
PARAMS ((void));
2814 extern void expand_end_loop
PARAMS ((void));
2815 extern void expand_end_null_loop
PARAMS ((void));
2816 extern int expand_continue_loop
PARAMS ((struct nesting
*));
2817 extern int expand_exit_loop
PARAMS ((struct nesting
*));
2818 extern int expand_exit_loop_if_false
PARAMS ((struct nesting
*,
2820 extern int expand_exit_loop_top_cond
PARAMS ((struct nesting
*,
2822 extern int expand_exit_something
PARAMS ((void));
2824 extern void expand_return
PARAMS ((tree
));
2825 extern int optimize_tail_recursion
PARAMS ((tree
, rtx
));
2826 extern void expand_start_bindings_and_block
PARAMS ((int, tree
));
2827 #define expand_start_bindings(flags) \
2828 expand_start_bindings_and_block(flags, NULL_TREE)
2829 extern void expand_end_bindings
PARAMS ((tree
, int, int));
2830 extern void warn_about_unused_variables
PARAMS ((tree
));
2831 extern void start_cleanup_deferral
PARAMS ((void));
2832 extern void end_cleanup_deferral
PARAMS ((void));
2833 extern int is_body_block
PARAMS ((tree
));
2835 extern int conditional_context
PARAMS ((void));
2836 extern struct nesting
* current_nesting_level
PARAMS ((void));
2837 extern tree last_cleanup_this_contour
PARAMS ((void));
2838 extern void expand_start_case
PARAMS ((int, tree
, tree
,
2840 extern void expand_end_case_type
PARAMS ((tree
, tree
));
2841 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
2842 extern int add_case_node
PARAMS ((tree
, tree
,
2844 extern int pushcase
PARAMS ((tree
,
2845 tree (*) (tree
, tree
),
2847 extern int pushcase_range
PARAMS ((tree
, tree
,
2848 tree (*) (tree
, tree
),
2850 extern void using_eh_for_cleanups
PARAMS ((void));
2851 extern int stmt_loop_nest_empty
PARAMS ((void));
2853 /* In fold-const.c */
2855 /* Fold constants as much as possible in an expression.
2856 Returns the simplified expression.
2857 Acts only on the top level of the expression;
2858 if the argument itself cannot be simplified, its
2859 subexpressions are not changed. */
2861 extern tree fold
PARAMS ((tree
));
2863 extern int force_fit_type
PARAMS ((tree
, int));
2864 extern int add_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2865 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2866 unsigned HOST_WIDE_INT
*,
2868 extern int neg_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2869 unsigned HOST_WIDE_INT
*,
2871 extern int mul_double
PARAMS ((unsigned HOST_WIDE_INT
,
2873 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2874 unsigned HOST_WIDE_INT
*,
2876 extern void lshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2877 HOST_WIDE_INT
, unsigned int,
2878 unsigned HOST_WIDE_INT
*,
2879 HOST_WIDE_INT
*, int));
2880 extern void rshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2881 HOST_WIDE_INT
, unsigned int,
2882 unsigned HOST_WIDE_INT
*,
2883 HOST_WIDE_INT
*, int));
2884 extern void lrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2885 HOST_WIDE_INT
, unsigned int,
2886 unsigned HOST_WIDE_INT
*,
2888 extern void rrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2889 HOST_WIDE_INT
, unsigned int,
2890 unsigned HOST_WIDE_INT
*,
2892 extern int operand_equal_p
PARAMS ((tree
, tree
, int));
2893 extern tree invert_truthvalue
PARAMS ((tree
));
2895 extern tree fold_builtin
PARAMS ((tree
));
2897 extern tree build_range_type
PARAMS ((tree
, tree
, tree
));
2900 extern void record_component_aliases
PARAMS ((tree
));
2901 extern HOST_WIDE_INT get_alias_set
PARAMS ((tree
));
2902 extern int alias_sets_conflict_p
PARAMS ((HOST_WIDE_INT
,
2904 extern int readonly_fields_p
PARAMS ((tree
));
2905 extern int objects_must_conflict_p
PARAMS ((tree
, tree
));
2910 extern int really_constant_p
PARAMS ((tree
));
2911 extern int int_fits_type_p
PARAMS ((tree
, tree
));
2912 extern int tree_log2
PARAMS ((tree
));
2913 extern int tree_floor_log2
PARAMS ((tree
));
2914 extern int simple_cst_equal
PARAMS ((tree
, tree
));
2915 extern int compare_tree_int
PARAMS ((tree
,
2916 unsigned HOST_WIDE_INT
));
2917 extern int type_list_equal
PARAMS ((tree
, tree
));
2918 extern int chain_member
PARAMS ((tree
, tree
));
2919 extern int chain_member_purpose
PARAMS ((tree
, tree
));
2920 extern int chain_member_value
PARAMS ((tree
, tree
));
2921 extern tree listify
PARAMS ((tree
));
2922 extern tree type_hash_lookup
PARAMS ((unsigned int, tree
));
2923 extern void type_hash_add
PARAMS ((unsigned int, tree
));
2924 extern unsigned int type_hash_list
PARAMS ((tree
));
2925 extern int simple_cst_list_equal
PARAMS ((tree
, tree
));
2926 extern void dump_tree_statistics
PARAMS ((void));
2927 extern void print_obstack_statistics
PARAMS ((const char *,
2930 extern void print_obstack_name
PARAMS ((char *, FILE *,
2933 extern void expand_function_end
PARAMS ((const char *, int, int));
2934 extern void expand_function_start
PARAMS ((tree
, int));
2935 extern void expand_pending_sizes
PARAMS ((tree
));
2937 extern int real_onep
PARAMS ((tree
));
2938 extern int real_twop
PARAMS ((tree
));
2939 extern int real_minus_onep
PARAMS ((tree
));
2940 extern void gcc_obstack_init
PARAMS ((struct obstack
*));
2941 extern void init_ttree
PARAMS ((void));
2942 extern void build_common_tree_nodes
PARAMS ((int));
2943 extern void build_common_tree_nodes_2
PARAMS ((int));
2946 extern void setjmp_protect_args
PARAMS ((void));
2947 extern void setjmp_protect
PARAMS ((tree
));
2948 extern void expand_main_function
PARAMS ((void));
2949 extern void init_dummy_function_start
PARAMS ((void));
2950 extern void expand_dummy_function_end
PARAMS ((void));
2951 extern void init_function_for_compilation
PARAMS ((void));
2952 extern void init_function_start
PARAMS ((tree
, const char *, int));
2953 extern void assign_parms
PARAMS ((tree
));
2954 extern void put_var_into_stack
PARAMS ((tree
));
2955 extern void flush_addressof
PARAMS ((tree
));
2956 extern void uninitialized_vars_warning
PARAMS ((tree
));
2957 extern void setjmp_args_warning
PARAMS ((void));
2958 extern void mark_all_temps_used
PARAMS ((void));
2959 extern void init_temp_slots
PARAMS ((void));
2960 extern void combine_temp_slots
PARAMS ((void));
2961 extern void free_temp_slots
PARAMS ((void));
2962 extern void pop_temp_slots
PARAMS ((void));
2963 extern void push_temp_slots
PARAMS ((void));
2964 extern void preserve_temp_slots
PARAMS ((rtx
));
2965 extern void preserve_rtl_expr_temps
PARAMS ((tree
));
2966 extern int aggregate_value_p
PARAMS ((tree
));
2967 extern void free_temps_for_rtl_expr
PARAMS ((tree
));
2968 extern void instantiate_virtual_regs
PARAMS ((tree
, rtx
));
2969 extern void unshare_all_rtl
PARAMS ((tree
, rtx
));
2970 extern int max_parm_reg_num
PARAMS ((void));
2971 extern void push_function_context
PARAMS ((void));
2972 extern void pop_function_context
PARAMS ((void));
2973 extern void push_function_context_to
PARAMS ((tree
));
2974 extern void pop_function_context_from
PARAMS ((tree
));
2976 /* In print-rtl.c */
2978 extern void print_rtl
PARAMS ((FILE *, rtx
));
2981 /* In print-tree.c */
2982 extern void debug_tree
PARAMS ((tree
));
2984 extern void print_node
PARAMS ((FILE *, const char *, tree
,
2986 extern void print_node_brief
PARAMS ((FILE *, const char *, tree
,
2988 extern void indent_to
PARAMS ((FILE *, int));
2992 extern int apply_args_register_offset
PARAMS ((int));
2993 extern rtx expand_builtin_return_addr
2994 PARAMS ((enum built_in_function
, int, rtx
));
2995 extern void check_max_integer_computation_mode
PARAMS ((tree
));
2998 extern void start_sequence_for_rtl_expr
PARAMS ((tree
));
2999 extern rtx emit_line_note
PARAMS ((const char *, int));
3003 extern int setjmp_call_p
PARAMS ((tree
));
3007 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3008 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3009 it should be modified in place; if a TYPE, a copy should be created
3010 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3011 information, in the form of a bitwise OR of flags in enum attribute_flags
3012 from tree.h. Depending on these flags, some attributes may be
3013 returned to be applied at a later stage (for example, to apply
3014 a decl attribute to the declaration rather than to its type). */
3015 extern tree decl_attributes
PARAMS ((tree
*, tree
, int));
3017 /* In integrate.c */
3018 extern void save_for_inline
PARAMS ((tree
));
3019 extern void set_decl_abstract_flags
PARAMS ((tree
, int));
3020 extern void output_inline_function
PARAMS ((tree
));
3021 extern void set_decl_origin_self
PARAMS ((tree
));
3023 /* In stor-layout.c */
3024 extern void fixup_signed_type
PARAMS ((tree
));
3025 extern void internal_reference_types
PARAMS ((void));
3028 extern void make_decl_rtl
PARAMS ((tree
, const char *));
3029 extern void make_decl_one_only
PARAMS ((tree
));
3030 extern int supports_one_only
PARAMS ((void));
3031 extern void variable_section
PARAMS ((tree
, int));
3032 enum tls_model decl_tls_model
PARAMS ((tree
));
3034 /* In fold-const.c */
3035 extern int div_and_round_double
PARAMS ((enum tree_code
, int,
3036 unsigned HOST_WIDE_INT
,
3038 unsigned HOST_WIDE_INT
,
3040 unsigned HOST_WIDE_INT
*,
3042 unsigned HOST_WIDE_INT
*,
3046 extern void emit_nop
PARAMS ((void));
3047 extern void expand_computed_goto
PARAMS ((tree
));
3048 extern bool parse_output_constraint
PARAMS ((const char **,
3050 bool *, bool *, bool *));
3051 extern void expand_asm_operands
PARAMS ((tree
, tree
, tree
, tree
, int,
3052 const char *, int));
3053 extern int any_pending_cleanups
PARAMS ((int));
3054 extern void init_stmt_for_function
PARAMS ((void));
3055 extern int drop_through_at_end_p
PARAMS ((void));
3056 extern void expand_start_target_temps
PARAMS ((void));
3057 extern void expand_end_target_temps
PARAMS ((void));
3058 extern void expand_elseif
PARAMS ((tree
));
3059 extern void save_stack_pointer
PARAMS ((void));
3060 extern void expand_decl
PARAMS ((tree
));
3061 extern int expand_decl_cleanup
PARAMS ((tree
, tree
));
3062 extern int expand_decl_cleanup_eh
PARAMS ((tree
, tree
, int));
3063 extern void expand_anon_union_decl
PARAMS ((tree
, tree
, tree
));
3064 extern void move_cleanups_up
PARAMS ((void));
3065 extern void expand_start_case_dummy
PARAMS ((void));
3066 extern void expand_end_case_dummy
PARAMS ((void));
3067 extern tree case_index_expr_type
PARAMS ((void));
3068 extern HOST_WIDE_INT all_cases_count
PARAMS ((tree
, int *));
3069 extern void check_for_full_enumeration_handling
PARAMS ((tree
));
3070 extern void declare_nonlocal_label
PARAMS ((tree
));
3072 /* If KIND=='I', return a suitable global initializer (constructor) name.
3073 If KIND=='D', return a suitable global clean-up (destructor) name. */
3074 extern tree get_file_function_name
PARAMS ((int));
3076 /* Interface of the DWARF2 unwind info support. */
3078 /* Generate a new label for the CFI info to refer to. */
3080 extern char *dwarf2out_cfi_label
PARAMS ((void));
3082 /* Entry point to update the canonical frame address (CFA). */
3084 extern void dwarf2out_def_cfa
PARAMS ((const char *, unsigned, long));
3086 /* Add the CFI for saving a register window. */
3088 extern void dwarf2out_window_save
PARAMS ((const char *));
3090 /* Add a CFI to update the running total of the size of arguments pushed
3093 extern void dwarf2out_args_size
PARAMS ((const char *, long));
3095 /* Entry point for saving a register to the stack. */
3097 extern void dwarf2out_reg_save
PARAMS ((const char *, unsigned, long));
3099 /* Entry point for saving the return address in the stack. */
3101 extern void dwarf2out_return_save
PARAMS ((const char *, long));
3103 /* Entry point for saving the return address in a register. */
3105 extern void dwarf2out_return_reg
PARAMS ((const char *, unsigned));
3107 /* The type of a function that walks over tree structure. */
3109 typedef tree (*walk_tree_fn
) PARAMS ((tree
*, int *, void *));
3111 /* In tree-dump.c */
3113 /* Different tree dump places. When you add new tree dump places,
3114 extend the DUMP_FILES array in tree-dump.c */
3115 enum tree_dump_index
3117 TDI_all
, /* dump the whole translation unit */
3118 TDI_class
, /* dump class hierarchy */
3119 TDI_original
, /* dump each function before optimizing it */
3120 TDI_optimized
, /* dump each function after optimizing it */
3121 TDI_inlined
, /* dump each function after inlining
3126 /* Bit masks to control tree dumping. Not all values are applicable to
3127 all tree dumps. Add new ones at the end. When you define new
3128 values, extend the DUMP_OPTIONS array in tree-dump.c */
3129 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3130 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3132 typedef struct dump_info
*dump_info_p
;
3134 extern int dump_flag
PARAMS ((dump_info_p
, int, tree
));
3135 extern int dump_enabled_p
PARAMS ((enum tree_dump_index
));
3136 extern FILE *dump_begin
PARAMS ((enum tree_dump_index
, int *));
3137 extern void dump_end
PARAMS ((enum tree_dump_index
, FILE *));
3138 extern void dump_node
PARAMS ((tree
, int, FILE *));
3139 extern int dump_switch_p
PARAMS ((const char *));
3140 extern const char *dump_flag_name
PARAMS ((enum tree_dump_index
));
3143 /* Redefine abort to report an internal error w/o coredump, and
3144 reporting the location of the error in the source file. This logic
3145 is duplicated in rtl.h and tree.h because every file that needs the
3146 special abort includes one or both. toplev.h gets too few files,
3147 system.h gets too many. */
3149 extern void fancy_abort
PARAMS ((const char *, int, const char *))
3151 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3153 #endif /* GCC_TREE_H */