1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
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 char tree_code_type
[MAX_TREE_CODES
];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns non-zero 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 int tree_code_length
[MAX_TREE_CODES
];
65 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
67 /* Names of tree components. */
69 extern const char *tree_code_name
[MAX_TREE_CODES
];
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(x) x,
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 /* The definition of tree nodes fills the next several pages. */
102 /* A tree node can represent a data type, a variable, an expression
103 or a statement. Each node has a TREE_CODE which says what kind of
104 thing it represents. Some common codes are:
105 INTEGER_TYPE -- represents a type of integers.
106 ARRAY_TYPE -- represents a type of pointer.
107 VAR_DECL -- represents a declared variable.
108 INTEGER_CST -- represents a constant integer value.
109 PLUS_EXPR -- represents a sum (an expression).
111 As for the contents of a tree node: there are some fields
112 that all nodes share. Each TREE_CODE has various special-purpose
113 fields as well. The fields of a node are never accessed directly,
114 always through accessor macros. */
116 /* This type is used everywhere to refer to a tree node. */
118 typedef union tree_node
*tree
;
120 /* Every kind of tree node starts with this structure,
121 so all nodes have these fields.
123 See the accessor macros, defined below, for documentation of the
128 union tree_node
*chain
;
129 union tree_node
*type
;
130 ENUM_BITFIELD(tree_code
) code
: 8;
131 unsigned side_effects_flag
: 1;
132 unsigned constant_flag
: 1;
133 unsigned permanent_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;
140 unsigned used_flag
: 1;
141 unsigned nothrow_flag
: 1;
142 unsigned static_flag
: 1;
143 unsigned public_flag
: 1;
144 unsigned private_flag
: 1;
145 unsigned protected_flag
: 1;
146 unsigned bounded_flag
: 1;
148 unsigned lang_flag_0
: 1;
149 unsigned lang_flag_1
: 1;
150 unsigned lang_flag_2
: 1;
151 unsigned lang_flag_3
: 1;
152 unsigned lang_flag_4
: 1;
153 unsigned lang_flag_5
: 1;
154 unsigned lang_flag_6
: 1;
157 /* The following table lists the uses of each of the above flags and
158 for which types of nodes they are defined. Note that expressions
164 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
165 ..._TYPE, IDENTIFIER_NODE
170 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
171 TREE_NO_UNUSED_WARNING in
172 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
174 TREE_LIST or TREE_VEC
175 TREE_CONSTANT_OVERFLOW in
176 INTEGER_CST, REAL_CST, COMPLEX_CST
177 TREE_SYMBOL_REFERENCED in
183 INTEGER_CST, REAL_CST, COMPLEX_CST
185 VAR_DECL or FUNCTION_DECL
187 TREE_LIST or TREE_VEC
188 EXPR_WFL_EMIT_LINE_NOTE in
189 EXPR_WITH_FILE_LOCATION
194 TREE_LIST or TREE_VEC
196 ??? unspecified nodes
200 TREE_VIA_PROTECTED in
204 ??? unspecified nodes
213 TREE_THIS_VOLATILE in
223 VAR_DECL if iterator (C)
232 permanent_flag: TREE_PERMANENT in all nodes
237 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
238 DECL_BUILT_IN_NONANSI in
242 SAVE_EXPR_NOPLACEHOLDER in
248 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
254 expressions, IDENTIFIER_NODE
259 CALL_EXPR, FUNCTION_DECL
264 expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL
269 /* Define accessors for the fields that all tree nodes have
270 (though some fields are not used for all kinds of nodes). */
272 /* The tree-code says what kind of node it is.
273 Codes are defined in tree.def. */
274 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
275 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
277 /* When checking is enabled, errors will be generated if a tree node
278 is accessed incorrectly. The macros abort with a fatal error. */
279 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
281 #define TREE_CHECK(t, code) __extension__ \
282 ({ const tree __t = t; \
283 if (TREE_CODE(__t) != (code)) \
284 tree_check_failed (__t, code, __FILE__, \
285 __LINE__, __PRETTY_FUNCTION__); \
287 #define TREE_CLASS_CHECK(t, class) __extension__ \
288 ({ const tree __t = t; \
289 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
290 tree_class_check_failed (__t, class, __FILE__, \
291 __LINE__, __PRETTY_FUNCTION__); \
294 /* These checks have to be special cased. */
295 #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
296 ({ const tree __t = t; \
297 enum tree_code __c = TREE_CODE(__t); \
298 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
299 tree_check_failed (__t, CONSTRUCTOR, __FILE__, \
300 __LINE__, __PRETTY_FUNCTION__); \
302 #define EXPR_CHECK(t) __extension__ \
303 ({ const tree __t = t; \
304 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
305 if (__c != 'r' && __c != 's' && __c != '<' \
306 && __c != '1' && __c != '2' && __c != 'e') \
307 tree_class_check_failed(__t, 'e', __FILE__, \
308 __LINE__, __PRETTY_FUNCTION__); \
311 extern void tree_check_failed
PARAMS ((const tree
, enum tree_code
,
312 const char *, int, const char *))
314 extern void tree_class_check_failed
PARAMS ((const tree
, int,
315 const char *, int, const char *))
318 #else /* not ENABLE_TREE_CHECKING, or not gcc */
320 #define TREE_CHECK(t, code) (t)
321 #define TREE_CLASS_CHECK(t, code) (t)
322 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
323 #define EXPR_CHECK(t) (t)
327 #include "tree-check.h"
329 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
330 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
331 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
333 /* In all nodes that are expressions, this is the data type of the expression.
334 In POINTER_TYPE nodes, this is the type that the pointer points to.
335 In ARRAY_TYPE nodes, this is the type of the elements. */
336 #define TREE_TYPE(NODE) ((NODE)->common.type)
338 /* Nodes are chained together for many purposes.
339 Types are chained together to record them for being output to the debugger
340 (see the function `chain_type').
341 Decls in the same scope are chained together to record the contents
343 Statement nodes for successive statements used to be chained together.
344 Often lists of things are represented by TREE_LIST nodes that
345 are chained together. */
347 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
349 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
350 that don't change the machine mode. */
352 #define STRIP_NOPS(EXP) \
353 while ((TREE_CODE (EXP) == NOP_EXPR \
354 || TREE_CODE (EXP) == CONVERT_EXPR \
355 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
356 && (TYPE_MODE (TREE_TYPE (EXP)) \
357 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
358 (EXP) = TREE_OPERAND (EXP, 0);
360 /* Like STRIP_NOPS, but don't let the signedness change either. */
362 #define STRIP_SIGN_NOPS(EXP) \
363 while ((TREE_CODE (EXP) == NOP_EXPR \
364 || TREE_CODE (EXP) == CONVERT_EXPR \
365 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
366 && (TYPE_MODE (TREE_TYPE (EXP)) \
367 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
368 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
369 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
370 (EXP) = TREE_OPERAND (EXP, 0);
372 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
374 #define STRIP_TYPE_NOPS(EXP) \
375 while ((TREE_CODE (EXP) == NOP_EXPR \
376 || TREE_CODE (EXP) == CONVERT_EXPR \
377 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
378 && (TREE_TYPE (EXP) \
379 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
380 (EXP) = TREE_OPERAND (EXP, 0);
382 /* Nonzero if TYPE represents an integral type. Note that we do not
383 include COMPLEX types here. */
385 #define INTEGRAL_TYPE_P(TYPE) \
386 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
387 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
389 /* Nonzero if TYPE represents a floating-point type, including complex
390 floating-point types. */
392 #define FLOAT_TYPE_P(TYPE) \
393 (TREE_CODE (TYPE) == REAL_TYPE \
394 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
395 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
397 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
399 #define AGGREGATE_TYPE_P(TYPE) \
400 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
401 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
402 || TREE_CODE (TYPE) == SET_TYPE)
404 /* Nonzero if TYPE represents an unbounded pointer or unbounded
405 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
407 #define POINTER_TYPE_P(TYPE) \
408 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
410 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
412 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
413 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
415 /* Nonzero if TYPE represents a bounded pointer type. */
417 #define BOUNDED_POINTER_TYPE_P(TYPE) \
418 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
419 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
421 /* Nonzero if TYPE represents a bounded reference type. Bounded
422 reference types have two specific uses: (1) When a reference is
423 seated to a variable-length RECORD_TYPE that has an array of
424 indeterminate length as its final field. For all other objects, it
425 is sufficient to check bounds at the time the reference is seated,
426 and assume that all future uses of the reference are safe, since
427 the address of references cannot change. (2) When a reference
428 supertype is seated to an subtype object. The bounds "remember"
429 the true size of the complete object, so that subsequent upcasts of
430 the address of the reference will be checked properly (is such a
431 thing valid C++?). */
433 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
434 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
435 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
437 /* Nonzero if TYPE represents a pointer or reference type, either
438 bounded or unbounded. */
440 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
441 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
443 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
445 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
446 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
448 /* Nonzero if TYPE represents a reference type, either bounded or unbounded. */
450 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
451 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
453 /* Nonzero if this type is a complete type. */
454 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
456 /* Nonzero if this type is the (possibly qualified) void type. */
457 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
459 /* Nonzero if this type is complete or is cv void. */
460 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
461 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
463 /* Nonzero if this type is complete or is an array with unspecified bound. */
464 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
465 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE))
467 /* Nonzero if TYPE represents a type. */
469 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
471 /* Define many boolean fields that all tree nodes have. */
473 /* In VAR_DECL nodes, nonzero means address of this is needed.
474 So it cannot be in a register.
475 In a FUNCTION_DECL, nonzero means its address is needed.
476 So it must be compiled even if it is an inline function.
477 In a FIELD_DECL node, it means that the programmer is permitted to
478 construct the address of this field. This is used for aliasing
479 purposes: see record_component_aliases.
480 In CONSTRUCTOR nodes, it means object constructed must be in memory.
481 In LABEL_DECL nodes, it means a goto for this label has been seen
482 from a place outside all binding contours that restore stack levels.
483 In ..._TYPE nodes, it means that objects of this type must
484 be fully addressable. This means that pieces of this
485 object cannot go into register parameters, for example.
486 In IDENTIFIER_NODEs, this means that some extern decl for this name
487 had its address taken. That matters for inline functions. */
488 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
490 /* In a VAR_DECL, nonzero means allocate static storage.
491 In a FUNCTION_DECL, nonzero if function has been defined.
492 In a CONSTRUCTOR, nonzero means allocate static storage. */
493 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
495 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
496 made implicitly and should not lead to an "unused value" warning. */
497 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
499 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
500 chain is via a `virtual' declaration. */
501 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
503 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
504 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
505 requires a diagnostic when overflows occur in constant expressions. */
506 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
508 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
509 this string as an argument. */
510 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
512 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
513 overflow in folding, and no warning has been issued for this subexpression.
514 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
515 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
517 /* In a VAR_DECL or FUNCTION_DECL,
518 nonzero means name is to be accessible from outside this module.
519 In an identifier node, nonzero means an external declaration
520 accessible from outside this module was previously seen
521 for this name in an inner scope. */
522 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
524 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
525 base class is via a `public' declaration, which preserves public
526 fields from the base class as public. */
527 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
529 /* Ditto, for `private' declarations. */
530 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
532 /* Nonzero for TREE_LIST node means that the path to the
533 base class is via a `protected' declaration, which preserves
534 protected fields from the base class as protected.
536 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
538 /* In any expression, nonzero means it has side effects or reevaluation
539 of the whole expression could produce a different value.
540 This is set if any subexpression is a function call, a side effect
541 or a reference to a volatile variable.
542 In a ..._DECL, this is set only if the declaration said `volatile'. */
543 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
545 /* Nonzero means this expression is volatile in the C sense:
546 its address should be of type `volatile WHATEVER *'.
547 In other words, the declared item is volatile qualified.
548 This is used in _DECL nodes and _REF nodes.
550 In a ..._TYPE node, means this type is volatile-qualified.
551 But use TYPE_VOLATILE instead of this macro when the node is a type,
552 because eventually we may make that a different bit.
554 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
555 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
557 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
558 nonzero means it may not be the lhs of an assignment.
559 In a ..._TYPE node, means this type is const-qualified
560 (but the macro TYPE_READONLY should be used instead of this macro
561 when the node is a type). */
562 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
564 /* Value of expression is constant.
565 Always appears in all ..._CST nodes.
566 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
567 if the value is constant. */
568 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
570 /* Nonzero means permanent node;
571 node will continue to exist for the entire compiler run.
572 Otherwise it will be recycled at the end of the function.
573 This flag is always zero if garbage collection is in use.
574 Try not to use this. Only set it with TREE_SET_PERMANENT. */
575 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
576 #define TREE_SET_PERMANENT(NODE) do { \
577 if (!ggc_p && current_obstack == &permanent_obstack) \
578 TREE_PERMANENT(NODE) = 1; \
581 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
582 In FIELD_DECL nodes, means an unsigned bit field.
583 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
584 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
586 /* Nonzero in a VAR_DECL means assembler code has been written.
587 Nonzero in a FUNCTION_DECL means that the function has been compiled.
588 This is interesting in an inline function, since it might not need
589 to be compiled separately.
590 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
591 if the sdb debugging info for the type has been written.
592 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
593 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
595 /* Nonzero in a _DECL if the name is used in its scope.
596 Nonzero in an expr node means inhibit warning if value is unused.
597 In IDENTIFIER_NODEs, this means that some extern decl for this name
599 #define TREE_USED(NODE) ((NODE)->common.used_flag)
601 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
602 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
603 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
605 /* Used in classes in C++. */
606 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
607 /* Used in classes in C++.
608 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
609 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
611 /* In a ..._TYPE node, nonzero means that the type's size and layout,
612 (or the size and layout of its arguments and/or return value in the
613 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
614 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
615 node is a type, because eventually we may make that a different
616 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
617 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
618 BOUNDED_INDIRECT_TYPE_P to test for that.
620 In a FUNCTION_DECL, nonzero means that the size and layout of one
621 of its arguments and/or return value was changed by the presence of
622 pointer bounds. This value can differ from the value of
623 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
624 declared, then later called with pointer args, or was declared with
625 a variable argument list and is later called with pointer values in
626 the variable argument list.
628 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
629 of the decl's type's BOUNDED_POINTER_TYPE_P.
631 In a CONSTRUCTOR or other expression, nonzero means the value is a
632 bounded pointer. It is insufficient to determine the boundedness
633 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
634 since we allow pointer to be temporarily cast to integer for
635 rounding up to an alignment boudary in a way that preserves the
638 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
639 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
640 of a function that has bounded pointer(s) for its return type and/or
643 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
645 /* These flags are available for each language front end to use internally. */
646 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
647 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
648 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
649 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
650 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
651 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
652 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
654 /* Define additional fields and accessors for nodes representing constants. */
656 /* In an INTEGER_CST node. These two together make a 2-word integer.
657 If the data type is signed, the value is sign-extended to 2 words
658 even though not all of them may really be in use.
659 In an unsigned constant shorter than 2 words, the extra bits are 0. */
660 #define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
661 #define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
663 #define INT_CST_LT(A, B) \
664 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
665 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
666 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
668 #define INT_CST_LT_UNSIGNED(A, B) \
669 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
670 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
671 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
672 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
673 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
677 struct tree_common common
;
678 struct rtx_def
*rtl
; /* acts as link to register transfer language
680 unsigned HOST_WIDE_INT int_cst_low
;
681 HOST_WIDE_INT int_cst_high
;
684 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
685 and generally in all kinds of constants that could
686 be given labels (rather than being immediate). */
688 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
690 /* In a REAL_CST node. */
691 /* We can represent a real value as either a `double' or a string.
692 Strings don't allow for any optimization, but they do allow
693 for cross-compilation. */
695 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
701 struct tree_common common
;
702 struct rtx_def
*rtl
; /* acts as link to register transfer language
704 REAL_VALUE_TYPE real_cst
;
707 /* In a STRING_CST */
708 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
709 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
713 struct tree_common common
;
714 struct rtx_def
*rtl
; /* acts as link to register transfer language
720 /* In a COMPLEX_CST node. */
721 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
722 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
726 struct tree_common common
;
727 struct rtx_def
*rtl
; /* acts as link to register transfer language
729 union tree_node
*real
;
730 union tree_node
*imag
;
733 /* Define fields and accessors for some special-purpose tree nodes. */
735 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
736 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
738 struct tree_identifier
740 struct tree_common common
;
745 /* In a TREE_LIST node. */
746 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
747 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
751 struct tree_common common
;
752 union tree_node
*purpose
;
753 union tree_node
*value
;
756 /* In a TREE_VEC node. */
757 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
758 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
759 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
763 struct tree_common common
;
765 union tree_node
*a
[1];
768 /* Define fields and accessors for some nodes that represent expressions. */
770 /* In a SAVE_EXPR node. */
771 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
772 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
773 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
774 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
775 both in normal code and in a handler. (Normally, in a handler, all
776 SAVE_EXPRs are unsaved, meaning that there values are
778 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
780 /* In a RTL_EXPR node. */
781 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
782 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
784 /* In a CALL_EXPR node. */
785 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
787 /* In a CONSTRUCTOR node. */
788 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
790 /* In ordinary expression nodes. */
791 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
792 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
794 /* In a LABELED_BLOCK_EXPR node. */
795 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
796 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
798 /* In a EXIT_BLOCK_EXPR node. */
799 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
800 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
802 /* In a LOOP_EXPR node. */
803 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
805 /* In a EXPR_WITH_FILE_LOCATION node. */
806 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
807 #define EXPR_WFL_FILENAME(NODE) \
808 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
809 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
810 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
811 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
812 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
813 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
814 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
815 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
819 struct tree_common common
;
821 union tree_node
*operands
[1];
824 /* In a BLOCK node. */
825 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
826 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
827 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
828 /* Note: when changing this, make sure to find the places
829 that use chainon or nreverse. */
830 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
831 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
832 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
834 /* Nonzero means that this block is prepared to handle exceptions
835 listed in the BLOCK_VARS slot. */
836 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
838 /* An index number for this block. These values are not guaranteed to
839 be unique across functions -- whether or not they are depends on
840 the debugging output format in use. */
841 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
845 struct tree_common common
;
847 unsigned handler_block_flag
: 1;
848 unsigned abstract_flag
: 1;
849 unsigned block_num
: 30;
851 union tree_node
*vars
;
852 union tree_node
*subblocks
;
853 union tree_node
*supercontext
;
854 union tree_node
*abstract_origin
;
857 /* Define fields and accessors for nodes representing data types. */
859 /* See tree.def for documentation of the use of these fields.
860 Look at the documentation of the various ..._TYPE tree codes. */
862 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
863 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
864 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
865 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
866 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
867 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
868 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
869 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
870 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
871 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
872 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
873 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
874 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
875 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
876 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
877 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
878 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
879 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
880 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
881 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
882 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
883 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
884 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
885 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
886 #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
887 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
889 /* Indirect types present difficulties because they may be represented
890 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
891 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
892 be logically equivalent, but physically different. Simple
893 comparison of the main variant only tells if the types are
894 logically equivalent. Use this predicate to compare for physical
897 /* Types have the same main variant, and have the same boundedness. */
898 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
899 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
900 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
902 /* Return the type variant that has no qualifiers (i.e., the main variant),
903 except that the boundedness qualifier is preserved. */
904 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
905 (BOUNDED_POINTER_TYPE_P (TYPE) \
906 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
907 : TYPE_MAIN_VARIANT (TYPE))
909 /* For aggregate types, information about this type, as a base type
910 for itself. Used in a language-dependent way for types that are
911 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
912 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
914 /* The (language-specific) typed-based alias set for this type.
915 Objects whose TYPE_ALIAS_SETs are different cannot alias each
916 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
917 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
918 type can alias objects of any type. */
919 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
921 /* Nonzero iff the typed-based alias set for this type has been
923 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
924 (TYPE_CHECK (NODE)->type.alias_set != -1)
926 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
928 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
930 /* The alignment necessary for objects of this type.
931 The value is an int, measured in bits. */
932 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
934 /* The alignment for NODE, in bytes. */
935 #define TYPE_ALIGN_UNIT(NODE) \
936 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
938 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
940 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
941 has BLKmode only because it lacks the alignment requirement for
943 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
945 /* In an INTEGER_TYPE, it means the type represents a size. We use this
946 both for validity checking and to permit optimziations that are unsafe
948 #define TYPE_IS_SIZETYPE(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
950 /* Nonzero in a type considered volatile as a whole. */
951 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
953 /* Means this type is const-qualified. */
954 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
956 /* If nonzero, this type is `restrict'-qualified, in the C sense of
958 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
960 /* If nonzero, this type's size and layout, (or the size and layout of
961 its arguments and/or return value in the case of a FUNCTION_TYPE or
962 METHOD_TYPE) was changed by the presence of pointer bounds. */
963 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
965 /* There is a TYPE_QUAL value for each type qualifier. They can be
966 combined by bitwise-or to form the complete set of qualifiers for a
969 #define TYPE_UNQUALIFIED 0x0
970 #define TYPE_QUAL_CONST 0x1
971 #define TYPE_QUAL_VOLATILE 0x2
972 #define TYPE_QUAL_RESTRICT 0x4
973 #define TYPE_QUAL_BOUNDED 0x8
975 /* The set of type qualifiers for this type. */
976 #define TYPE_QUALS(NODE) \
977 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
978 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
979 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
980 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
982 /* The set of qualifiers pertinent to an expression node. */
983 #define TREE_EXPR_QUALS(NODE) \
984 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
985 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
986 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
988 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
989 #define TREE_FUNC_QUALS(NODE) \
990 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
991 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
993 /* These flags are available for each language front end to use internally. */
994 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
995 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
996 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
997 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
998 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
999 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1000 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1002 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1003 that distinguish string from array of char).
1004 If set in a SET_TYPE, indicates a bitstring type. */
1005 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1007 /* If non-NULL, this is a upper bound of the size (in bytes) of an
1008 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
1009 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
1011 /* Indicates that objects of this type must be initialized by calling a
1012 function when they are created. */
1013 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1014 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1016 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1017 the same way that the first union alternative would be passed. */
1018 #define TYPE_TRANSPARENT_UNION(NODE) \
1019 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1021 /* For an ARRAY_TYPE, indicates that it is not permitted to
1022 take the address of a component of the type. */
1023 #define TYPE_NONALIASED_COMPONENT(NODE) \
1024 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1026 /* Indicated that objects of this type should be laid out in as
1027 compact a way as possible. */
1028 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1030 /* A bounded pointer or bounded reference type (collectively called
1031 indirect types) is represented as a RECORD_TYPE node containing
1032 three pointer fields whose type is the corresponding unbounded
1033 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1034 a bounded indirect type differs from a normal RECORD_TYPE node in
1035 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1036 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1037 nodes are stored on the same type variant chain alongside the
1038 variants of the underlaying indirect types nodes. The main variant
1039 of such chains is always the unbounded type. */
1041 /* Access the field decls of a bounded-pointer type. */
1042 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1043 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1044 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1046 /* Access the simple-pointer subtype of a bounded-pointer type. */
1047 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1049 /* Find the unbounded counterpart to a type, or return TYPE if it is
1050 already unbounded. */
1051 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1052 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1054 /* This field comprises two bits, for values in the range 0..3:
1056 depth=0 means that type is a scalar, or an aggregate that contains
1057 only depth=0 types, or a function that has only depth=0 types for
1058 its return value and argument types.
1060 depth=1 means that type is a pointer to a depth=0 type, or an
1061 aggregate that contains only depth=0 and depth=1 types, or a
1062 function that has only depth=0 and depth=1 types for its return
1063 value and argument types.
1065 The meanings of depth=2 and depth=3 are obvious by induction.
1066 Varargs functions are depth=3. The type `va_list' is depth=3.
1068 The purpose of measuring pointer depth of a type is to determine
1069 the eligibility of a function for an automatically-generated
1070 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1071 depth=1 function is eligible for an automatic thunk. Functions
1072 with depth 2 or more are too complex to get automatic thunks.
1074 Function decls also have a pointer_depth field, since we also
1075 consider the actual argument types for functions. */
1077 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1079 /* In a FUNCTION_TYPE node, this bit stores the value of
1080 default_pointer_boundedness at the time TYPE was created. It is
1081 useful for choosing default boundedness of function arguments for
1082 non-prototype function decls and for varargs/stdarg lists. */
1083 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1084 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1086 #define MAX_POINTER_DEPTH 2
1087 #define VA_LIST_POINTER_DEPTH 3
1091 struct tree_common common
;
1092 union tree_node
*values
;
1093 union tree_node
*size
;
1094 union tree_node
*size_unit
;
1095 union tree_node
*attributes
;
1098 unsigned int precision
: 9;
1099 ENUM_BITFIELD(machine_mode
) mode
: 7;
1101 unsigned string_flag
: 1;
1102 unsigned no_force_blk_flag
: 1;
1103 unsigned needs_constructing_flag
: 1;
1104 unsigned transparent_union_flag
: 1;
1105 unsigned packed_flag
: 1;
1106 unsigned restrict_flag
: 1;
1107 unsigned pointer_depth
: 2;
1109 unsigned lang_flag_0
: 1;
1110 unsigned lang_flag_1
: 1;
1111 unsigned lang_flag_2
: 1;
1112 unsigned lang_flag_3
: 1;
1113 unsigned lang_flag_4
: 1;
1114 unsigned lang_flag_5
: 1;
1115 unsigned lang_flag_6
: 1;
1118 union tree_node
*pointer_to
;
1119 union tree_node
*reference_to
;
1120 union {int address
; char *pointer
; } symtab
;
1121 union tree_node
*name
;
1122 union tree_node
*minval
;
1123 union tree_node
*maxval
;
1124 union tree_node
*next_variant
;
1125 union tree_node
*main_variant
;
1126 union tree_node
*binfo
;
1127 union tree_node
*noncopied_parts
;
1128 union tree_node
*context
;
1129 struct obstack
*obstack
;
1130 HOST_WIDE_INT alias_set
;
1131 /* Points to a structure whose details depend on the language in use. */
1132 struct lang_type
*lang_specific
;
1135 /* Define accessor macros for information about type inheritance
1138 A "basetype" means a particular usage of a data type for inheritance
1139 in another type. Each such basetype usage has its own "binfo"
1140 object to describe it. The binfo object is a TREE_VEC node.
1142 Inheritance is represented by the binfo nodes allocated for a
1143 given type. For example, given types C and D, such that D is
1144 inherited by C, 3 binfo nodes will be allocated: one for describing
1145 the binfo properties of C, similarly one for D, and one for
1146 describing the binfo properties of D as a base type for C.
1147 Thus, given a pointer to class C, one can get a pointer to the binfo
1148 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1150 /* The actual data type node being inherited in this basetype. */
1151 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1153 /* The offset where this basetype appears in its containing type.
1154 BINFO_OFFSET slot holds the offset (in bytes)
1155 from the base of the complete object to the base of the part of the
1156 object that is allocated on behalf of this `type'.
1157 This is always 0 except when there is multiple inheritance. */
1159 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1160 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1161 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1163 /* The virtual function table belonging to this basetype. Virtual
1164 function tables provide a mechanism for run-time method dispatching.
1165 The entries of a virtual function table are language-dependent. */
1167 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1168 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1170 /* The virtual functions in the virtual function table. This is
1171 a TREE_LIST that is used as an initial approximation for building
1172 a virtual function table for this basetype. */
1173 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1174 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1176 /* A vector of binfos for the direct basetypes inherited by this
1179 If this basetype describes type D as inherited in C, and if the
1180 basetypes of D are E and F, then this vector contains binfos for
1181 inheritance of E and F by C.
1183 ??? This could probably be done by just allocating the
1184 base types at the end of this TREE_VEC (instead of using
1185 another TREE_VEC). This would simplify the calculation
1186 of how many basetypes a given type had. */
1187 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1188 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1190 /* The number of basetypes for NODE. */
1191 #define BINFO_N_BASETYPES(NODE) \
1192 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1194 /* Accessor macro to get to the Nth basetype of this basetype. */
1195 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1196 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1198 /* For a BINFO record describing a virtual base class, i.e., one where
1199 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1200 base. The actual contents are language-dependent. Under the old
1201 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1202 pointer to the virtual base; under the new ABI this field is
1203 instead a INTEGER_CST giving an offset into the vtable where the
1204 offset to the virtual base can be found. */
1205 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1207 /* The size of a base class subobject of this type. Not all frontends
1208 currently allocate the space for these fields. */
1209 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1210 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1211 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1212 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1214 /* Slot used to build a chain that represents a use of inheritance.
1215 For example, if X is derived from Y, and Y is derived from Z,
1216 then this field can be used to link the binfo node for X to
1217 the binfo node for X's Y to represent the use of inheritance
1218 from X to Y. Similarly, this slot of the binfo node for X's Y
1219 can point to the Z from which Y is inherited (in X's inheritance
1220 hierarchy). In this fashion, one can represent and traverse specific
1221 uses of inheritance using the binfo nodes themselves (instead of
1222 consing new space pointing to binfo nodes).
1223 It is up to the language-dependent front-ends to maintain
1224 this information as necessary. */
1225 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1227 /* Define fields and accessors for nodes representing declared names. */
1229 /* Nonzero if DECL represents a decl. */
1230 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1231 /* This is the name of the object as written by the user.
1232 It is an IDENTIFIER_NODE. */
1233 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1234 /* This is the name of the object as the assembler will see it
1235 (but before any translations made by ASM_OUTPUT_LABELREF).
1236 Often this is the same as DECL_NAME.
1237 It is an IDENTIFIER_NODE. */
1238 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1239 /* Records the section name in a section attribute. Used to pass
1240 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1241 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1242 /* For FIELD_DECLs, this is the
1243 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1244 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1245 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1246 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1247 type, or NULL_TREE if the given decl has "file scope". */
1248 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1249 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1250 /* In a DECL this is the field where configuration dependent machine
1251 attributes are store */
1252 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1253 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1254 byte containing the bit closest to the beginning of the structure. */
1255 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1256 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1257 field from DECL_FIELD_OFFSET. */
1258 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1259 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1260 if so, the type that was originally specified for it.
1261 TREE_TYPE may have been modified (in finish_struct). */
1262 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1263 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1264 /* VAR_DECL and PARM_DECL reserve the arguments slot
1265 for language-specific uses. */
1266 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1267 /* This field is used to reference anything in decl.result and is meant only
1268 for use by the garbage collector. */
1269 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1270 /* In FUNCTION_DECL, holds the decl for the return value. */
1271 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1272 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1273 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1274 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1275 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1276 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1277 For a VAR_DECL, holds the initial value.
1278 For a PARM_DECL, not used--default
1279 values for parameters are encoded in the type of the function,
1280 not in the PARM_DECL slot. */
1281 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1282 /* For a PARM_DECL, records the data type used to pass the argument,
1283 which may be different from the type seen in the program. */
1284 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1285 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1286 if nonzero, indicates that the field occupies the type. */
1287 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1288 /* These two fields describe where in the source code the declaration was. */
1289 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1290 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1291 /* Holds the size of the datum, in bits, as a tree expression.
1292 Need not be constant. */
1293 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1294 /* Likewise for the size in bytes. */
1295 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1296 /* Holds the alignment required for the datum. */
1297 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1298 /* For FIELD_DECLs, holds the alignment that DECL_FIELD_OFFSET has. */
1299 #define DECL_OFFSET_ALIGN(NODE) (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1300 /* Holds the machine mode corresponding to the declaration of a variable or
1301 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1303 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1304 /* Holds the RTL expression for the value of a variable or function. If
1305 PROMOTED_MODE is defined, the mode of this expression may not be same
1306 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1307 to the variable's data type, while the mode
1308 of DECL_RTL is the mode actually used to contain the data. */
1309 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1310 /* Holds an INSN_LIST of all of the live ranges in which the variable
1311 has been moved to a possibly different register. */
1312 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1313 /* For PARM_DECL, holds an RTL for the stack slot or register
1314 where the data was actually passed. */
1315 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1316 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1317 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1318 /* For FUNCTION_DECL, if it is inline,
1319 holds the size of the stack frame, as an integer. */
1320 #define DECL_FRAME_SIZE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.i)
1321 /* For FUNCTION_DECL, if it is built-in,
1322 this identifies which built-in operation it is. */
1323 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1325 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1326 Before the struct containing the FUNCTION_DECL is laid out,
1327 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1328 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1329 function. When the class is laid out, this pointer is changed
1330 to an INTEGER_CST node which is suitable for use as an index
1331 into the virtual function table. */
1332 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1333 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1334 which this FIELD_DECL is defined. This information is needed when
1335 writing debugging information about vfield and vbase decls for C++. */
1336 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1338 /* Every ..._DECL node gets a unique number. */
1339 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1341 /* For any sort of a ..._DECL node, this points to the original (abstract)
1342 decl node which this decl is an instance of, or else it is NULL indicating
1343 that this decl is not an instance of some other decl. For example,
1344 in a nested declaration of an inline function, this points back to the
1346 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1348 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1349 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1350 #define DECL_ORIGIN(NODE) \
1351 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1353 /* Nonzero for any sort of ..._DECL node means this decl node represents
1354 an inline instance of some original (abstract) decl from an inline function;
1355 suppress any warnings about shadowing some other variable.
1356 FUNCTION_DECL nodes can also have their abstract origin set to themselves
1357 (see save_for_inline_copying). */
1358 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1359 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1361 /* Nonzero if a _DECL means that the name of this decl should be ignored
1362 for symbolic debug purposes. */
1363 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1365 /* Nonzero for a given ..._DECL node means that this node represents an
1366 "abstract instance" of the given declaration (e.g. in the original
1367 declaration of an inline function). When generating symbolic debugging
1368 information, we mustn't try to generate any address information for nodes
1369 marked as "abstract instances" because we don't actually generate
1370 any code or allocate any data space for such instances. */
1371 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1373 /* Nonzero if a _DECL means that no warnings should be generated just
1374 because this decl is unused. */
1375 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1377 /* Nonzero for a given ..._DECL node means that this node should be
1378 put in .common, if possible. If a DECL_INITIAL is given, and it
1379 is not error_mark_node, then the decl cannot be put in .common. */
1380 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1382 /* Language-specific decl information. */
1383 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1385 /* In a VAR_DECL or FUNCTION_DECL,
1386 nonzero means external reference:
1387 do not allocate storage, and refer to a definition elsewhere. */
1388 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1390 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1392 #define DEFAULT_INIT_PRIORITY 65535
1393 #define MAX_INIT_PRIORITY 65535
1394 #define MAX_RESERVED_INIT_PRIORITY 100
1397 nonzero means the detail info about this type is not dumped into stabs.
1398 Instead it will generate cross reference ('x') of names.
1399 This uses the same flag as DECL_EXTERNAL. */
1400 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1401 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1403 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1404 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1405 /* In LABEL_DECL nodes, nonzero means that an error message about
1406 jumping into such a binding contour has been printed for this label. */
1407 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1408 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1409 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1410 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1411 static chain is not needed. */
1412 #define DECL_NO_STATIC_CHAIN(NODE) \
1413 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1415 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1416 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1418 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1420 Also set in some languages for variables, etc., outside the normal
1421 lexical scope, such as class instance variables. */
1422 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1424 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1425 where it is called. */
1426 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1428 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1429 that is not specified by ansi C and that users are supposed to be allowed
1430 to redefine for any purpose whatever. */
1431 #define DECL_BUILT_IN_NONANSI(NODE) \
1432 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1434 /* Nonzero in a FUNCTION_DECL means this function should be treated
1435 as if it were a malloc, meaning it returns a pointer that is
1437 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1439 /* Nonzero in a FUNCTION_DECL means this function should be treated
1440 as "pure" function (like const function, but may read global memory). */
1441 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1443 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1445 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1446 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1447 contour that restored a stack level and which is now exited. */
1448 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1450 /* Unused in FUNCTION_DECL. */
1452 /* In a VAR_DECL that's static,
1453 nonzero if the space is in the text section. */
1454 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1456 /* In a FUNCTION_DECL, nonzero means a built in function. */
1457 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1458 /* For a builtin function, identify which part of the compiler defined it. */
1459 #define DECL_BUILT_IN_CLASS(NODE) \
1460 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1462 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1463 Used in FIELD_DECLs for vtable pointers.
1464 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1465 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1467 /* Used to indicate that the linkage status of this DECL is not yet known,
1468 so it should not be output now. */
1469 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1471 /* Used in PARM_DECLs whose type are unions to indicate that the
1472 argument should be passed in the same way that the first union
1473 alternative would be passed. */
1474 #define DECL_TRANSPARENT_UNION(NODE) \
1475 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1477 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1478 at the beginning or end of execution. */
1479 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1480 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1482 #define DECL_STATIC_DESTRUCTOR(NODE) \
1483 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1485 /* Used to indicate that this DECL represents a compiler-generated entity. */
1486 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1488 /* Used to indicate that this DECL has weak linkage. */
1489 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1491 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1492 multiple translation units should be merged. */
1493 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1495 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1496 not be put out unless it is needed in this translation unit.
1497 Entities like this are shared across translation units (like weak
1498 entities), but are guaranteed to be generated by any translation
1499 unit that needs them, and therefore need not be put out anywhere
1500 where they are not needed. DECL_COMDAT is just a hint to the
1501 back-end; it is up to front-ends which set this flag to ensure
1502 that there will never be any harm, other than bloat, in putting out
1503 something which is DECL_COMDAT. */
1504 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1506 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1507 be instrumented with calls to support routines. */
1508 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1509 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1511 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1512 disabled in this function. */
1513 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) \
1514 (FUNCTION_DECL_CHECK (NODE)->decl.no_check_memory_usage)
1516 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1517 disabled in this function. */
1518 #define DECL_NO_LIMIT_STACK(NODE) \
1519 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1521 /* Additional flags for language-specific uses. */
1522 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1523 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1524 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1525 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1526 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1527 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1528 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1529 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1531 /* Used to indicate that the pointer to this DECL cannot be treated as
1532 an address constant. */
1533 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1535 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1537 #define DECL_NONADDRESSABLE_P(NODE) \
1538 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1540 /* Used to indicate an alias set for the memory pointed to by this
1541 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1542 pointer (or reference) type. */
1543 #define DECL_POINTER_ALIAS_SET(NODE) \
1544 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1546 /* Nonzero if an alias set has been assigned to this declaration. */
1547 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1548 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1550 /* The pointer_depth field comprises two bits for values in the range
1551 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1552 type node, but for functions it migth be greater. For example,
1553 this can happen when the function is declared to accept a parameter
1554 of type void* (depth=1), but is actually called with an argument of
1555 type foo** (depth=2). The function type will get the formal
1556 parameter's depth, but the function decl will get the actual
1557 argument's depth. */
1558 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1562 struct tree_common common
;
1563 const char *filename
;
1566 union tree_node
*size
;
1567 ENUM_BITFIELD(machine_mode
) mode
: 8;
1569 unsigned external_flag
: 1;
1570 unsigned nonlocal_flag
: 1;
1571 unsigned regdecl_flag
: 1;
1572 unsigned inline_flag
: 1;
1573 unsigned bit_field_flag
: 1;
1574 unsigned virtual_flag
: 1;
1575 unsigned ignored_flag
: 1;
1576 unsigned abstract_flag
: 1;
1578 unsigned in_system_header_flag
: 1;
1579 unsigned common_flag
: 1;
1580 unsigned defer_output
: 1;
1581 unsigned transparent_union
: 1;
1582 unsigned static_ctor_flag
: 1;
1583 unsigned static_dtor_flag
: 1;
1584 unsigned artificial_flag
: 1;
1585 unsigned weak_flag
: 1;
1587 unsigned non_addr_const_p
: 1;
1588 unsigned no_instrument_function_entry_exit
: 1;
1589 unsigned no_check_memory_usage
: 1;
1590 unsigned comdat_flag
: 1;
1591 unsigned malloc_flag
: 1;
1592 unsigned no_limit_stack
: 1;
1593 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
1595 unsigned pure_flag
: 1;
1596 unsigned pointer_depth
: 2;
1597 unsigned non_addressable
: 1;
1598 /* Four unused bits. */
1600 unsigned lang_flag_0
: 1;
1601 unsigned lang_flag_1
: 1;
1602 unsigned lang_flag_2
: 1;
1603 unsigned lang_flag_3
: 1;
1604 unsigned lang_flag_4
: 1;
1605 unsigned lang_flag_5
: 1;
1606 unsigned lang_flag_6
: 1;
1607 unsigned lang_flag_7
: 1;
1609 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1610 If built-in, this is the code for which built-in function.
1611 For other kinds of decls, this is DECL_ALIGN and DECL_OFFSET_ALIGN. */
1614 enum built_in_function f
;
1615 struct {unsigned int align
: 24; unsigned int off_align
: 8;} a
;
1618 union tree_node
*size_unit
;
1619 union tree_node
*name
;
1620 union tree_node
*context
;
1621 union tree_node
*arguments
; /* Also used for DECL_FIELD_OFFSET */
1622 union tree_node
*result
; /* Also used for DECL_BIT_FIELD_TYPE */
1623 union tree_node
*initial
; /* Also used for DECL_QUALIFIER */
1624 union tree_node
*abstract_origin
;
1625 union tree_node
*assembler_name
;
1626 union tree_node
*section_name
;
1627 union tree_node
*machine_attributes
;
1628 struct rtx_def
*rtl
; /* RTL representation for object. */
1629 struct rtx_def
*live_range_rtl
;
1631 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1632 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1633 In PARM_DECL, holds an RTL for the stack slot
1634 of register where the data was actually passed.
1635 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1643 union tree_node
*vindex
;
1644 HOST_WIDE_INT pointer_alias_set
;
1645 /* Points to a structure whose details depend on the language in use. */
1646 struct lang_decl
*lang_specific
;
1649 /* Define the overall contents of a tree node.
1650 It may be any of the structures declared above
1651 for various types of node. */
1655 struct tree_common common
;
1656 struct tree_int_cst int_cst
;
1657 struct tree_real_cst real_cst
;
1658 struct tree_string string
;
1659 struct tree_complex
complex;
1660 struct tree_identifier identifier
;
1661 struct tree_decl decl
;
1662 struct tree_type type
;
1663 struct tree_list list
;
1664 struct tree_vec vec
;
1665 struct tree_exp exp
;
1666 struct tree_block block
;
1669 /* Standard named or nameless data types of the C compiler. */
1697 TI_COMPLEX_INTEGER_TYPE
,
1698 TI_COMPLEX_FLOAT_TYPE
,
1699 TI_COMPLEX_DOUBLE_TYPE
,
1700 TI_COMPLEX_LONG_DOUBLE_TYPE
,
1704 TI_LONG_DOUBLE_TYPE
,
1715 extern tree global_trees
[TI_MAX
];
1717 #define error_mark_node global_trees[TI_ERROR_MARK]
1719 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1720 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1721 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1722 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1723 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1725 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1726 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1727 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1728 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1729 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1731 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1732 #define integer_one_node global_trees[TI_INTEGER_ONE]
1733 #define size_zero_node global_trees[TI_SIZE_ZERO]
1734 #define size_one_node global_trees[TI_SIZE_ONE]
1735 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1736 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1737 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1739 #define null_pointer_node global_trees[TI_NULL_POINTER]
1741 #define float_type_node global_trees[TI_FLOAT_TYPE]
1742 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1743 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1745 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1746 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1747 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1748 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1750 #define void_type_node global_trees[TI_VOID_TYPE]
1751 /* The C type `void *'. */
1752 #define ptr_type_node global_trees[TI_PTR_TYPE]
1753 /* The C type `const void *'. */
1754 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1755 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1756 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1758 /* An enumeration of the standard C integer types. These must be
1759 ordered so that shorter types appear before longer ones. */
1760 enum integer_type_kind
1772 itk_unsigned_long_long
,
1776 typedef enum integer_type_kind integer_type_kind
;
1778 /* The standard C integer types. Use integer_type_kind to index into
1780 extern tree integer_types
[itk_none
];
1782 #define char_type_node integer_types[itk_char]
1783 #define signed_char_type_node integer_types[itk_signed_char]
1784 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1785 #define short_integer_type_node integer_types[itk_short]
1786 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1787 #define integer_type_node integer_types[itk_int]
1788 #define unsigned_type_node integer_types[itk_unsigned_int]
1789 #define long_integer_type_node integer_types[itk_long]
1790 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1791 #define long_long_integer_type_node integer_types[itk_long_long]
1792 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1795 #define NULL_TREE (tree) NULL
1797 /* The following functions accept a wide integer argument. Rather than
1798 having to cast on every function call, we use a macro instead, that is
1799 defined here and in rtl.h. */
1802 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1803 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1805 extern int exact_log2_wide
PARAMS ((unsigned HOST_WIDE_INT
));
1806 extern int floor_log2_wide
PARAMS ((unsigned HOST_WIDE_INT
));
1808 extern char *oballoc
PARAMS ((int));
1809 extern char *permalloc
PARAMS ((int));
1810 extern char *savealloc
PARAMS ((int));
1811 extern char *expralloc
PARAMS ((int));
1813 /* Lowest level primitive for allocating a node.
1814 The TREE_CODE is the only argument. Contents are initialized
1815 to zero except for a few of the common fields. */
1817 extern tree make_node
PARAMS ((enum tree_code
));
1818 extern tree make_lang_type
PARAMS ((enum tree_code
));
1819 extern tree (*make_lang_type_fn
) PARAMS ((enum tree_code
));
1821 /* Make a copy of a node, with all the same contents except
1822 for TREE_PERMANENT. (The copy is permanent
1823 iff nodes being made now are permanent.) */
1825 extern tree copy_node
PARAMS ((tree
));
1827 /* Make a copy of a chain of TREE_LIST nodes. */
1829 extern tree copy_list
PARAMS ((tree
));
1831 /* Make a TREE_VEC. */
1833 extern tree make_tree_vec
PARAMS ((int));
1835 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1836 The name is supplied as a char *. */
1838 extern tree get_identifier
PARAMS ((const char *));
1840 /* If an identifier with the name TEXT (a null-terminated string) has
1841 previously been referred to, return that node; otherwise return
1844 extern tree maybe_get_identifier
PARAMS ((const char *));
1846 /* Construct various types of nodes. */
1848 #define build_int_2(LO,HI) \
1849 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1851 extern tree build
PARAMS ((enum tree_code
, tree
, ...));
1852 extern tree build_nt
PARAMS ((enum tree_code
, ...));
1853 extern tree build_parse_node
PARAMS ((enum tree_code
, ...));
1855 extern tree build_int_2_wide
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
));
1856 extern tree build_real
PARAMS ((tree
, REAL_VALUE_TYPE
));
1857 extern tree build_real_from_int_cst
PARAMS ((tree
, tree
));
1858 extern tree build_complex
PARAMS ((tree
, tree
, tree
));
1859 extern tree build_string
PARAMS ((int, const char *));
1860 extern tree build1
PARAMS ((enum tree_code
, tree
, tree
));
1861 extern tree build_tree_list
PARAMS ((tree
, tree
));
1862 extern tree build_decl_list
PARAMS ((tree
, tree
));
1863 extern tree build_expr_list
PARAMS ((tree
, tree
));
1864 extern tree build_decl
PARAMS ((enum tree_code
, tree
, tree
));
1865 extern tree build_block
PARAMS ((tree
, tree
, tree
, tree
, tree
));
1866 extern tree build_expr_wfl
PARAMS ((tree
, const char *, int, int));
1868 /* Construct various nodes representing data types. */
1870 extern tree make_signed_type
PARAMS ((int));
1871 extern tree make_unsigned_type
PARAMS ((int));
1872 extern void initialize_sizetypes
PARAMS ((void));
1873 extern void set_sizetype
PARAMS ((tree
));
1874 extern tree signed_or_unsigned_type
PARAMS ((int, tree
));
1875 extern void fixup_unsigned_type
PARAMS ((tree
));
1876 extern tree build_pointer_type
PARAMS ((tree
));
1877 extern tree build_reference_type
PARAMS ((tree
));
1878 extern tree build_index_type
PARAMS ((tree
));
1879 extern tree build_index_2_type
PARAMS ((tree
, tree
));
1880 extern tree build_array_type
PARAMS ((tree
, tree
));
1881 extern tree build_function_type
PARAMS ((tree
, tree
));
1882 extern tree build_method_type
PARAMS ((tree
, tree
));
1883 extern tree build_offset_type
PARAMS ((tree
, tree
));
1884 extern tree build_complex_type
PARAMS ((tree
));
1885 extern tree array_type_nelts
PARAMS ((tree
));
1887 extern tree value_member
PARAMS ((tree
, tree
));
1888 extern tree purpose_member
PARAMS ((tree
, tree
));
1889 extern tree binfo_member
PARAMS ((tree
, tree
));
1890 extern unsigned int attribute_hash_list
PARAMS ((tree
));
1891 extern int attribute_list_equal
PARAMS ((tree
, tree
));
1892 extern int attribute_list_contained
PARAMS ((tree
, tree
));
1893 extern int tree_int_cst_equal
PARAMS ((tree
, tree
));
1894 extern int tree_int_cst_lt
PARAMS ((tree
, tree
));
1895 extern int host_integerp
PARAMS ((tree
, int));
1896 extern HOST_WIDE_INT tree_low_cst
PARAMS ((tree
, int));
1897 extern int tree_int_cst_msb
PARAMS ((tree
));
1898 extern int tree_int_cst_sgn
PARAMS ((tree
));
1899 extern int tree_expr_nonnegative_p
PARAMS ((tree
));
1900 extern int index_type_equal
PARAMS ((tree
, tree
));
1901 extern tree get_inner_array_type
PARAMS ((tree
));
1903 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1904 put the prototype here. Rtl.h does declare the prototype if
1905 tree.h had been included. */
1907 extern tree make_tree
PARAMS ((tree
, struct rtx_def
*));
1909 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1912 Such modified types already made are recorded so that duplicates
1915 extern tree build_type_attribute_variant
PARAMS ((tree
, tree
));
1916 extern tree build_decl_attribute_variant
PARAMS ((tree
, tree
));
1918 extern tree merge_machine_decl_attributes
PARAMS ((tree
, tree
));
1919 extern tree merge_machine_type_attributes
PARAMS ((tree
, tree
));
1921 /* Split a list of declspecs and attributes into two. */
1923 extern void split_specs_attrs
PARAMS ((tree
, tree
*, tree
*));
1925 /* Strip attributes from a list of combined specs and attrs. */
1927 extern tree strip_attrs
PARAMS ((tree
));
1929 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1931 extern int valid_machine_attribute
PARAMS ((tree
, tree
, tree
, tree
));
1933 /* Given a tree node and a string, return non-zero if the tree node is
1934 a valid attribute name for the string. */
1936 extern int is_attribute_p
PARAMS ((const char *, tree
));
1938 /* Given an attribute name and a list of attributes, return the list element
1939 of the attribute or NULL_TREE if not found. */
1941 extern tree lookup_attribute
PARAMS ((const char *, tree
));
1943 /* Given two attributes lists, return a list of their union. */
1945 extern tree merge_attributes
PARAMS ((tree
, tree
));
1947 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
1948 the same kind of data as TYPE describes. Variants point to the
1949 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
1950 and it points to a chain of other variants so that duplicate
1951 variants are never made. Only main variants should ever appear as
1952 types of expressions. */
1954 extern tree build_qualified_type
PARAMS ((tree
, int));
1956 /* Like build_qualified_type, but only deals with the `const' and
1957 `volatile' qualifiers. This interface is retained for backwards
1958 compatiblity with the various front-ends; new code should use
1959 build_qualified_type instead. */
1961 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
1962 build_qualified_type (TYPE, \
1963 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
1964 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
1966 /* Make a copy of a type node. */
1968 extern tree build_type_copy
PARAMS ((tree
));
1970 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1971 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
1972 node, does nothing except for the first time. */
1974 extern void layout_type
PARAMS ((tree
));
1976 /* These functions allow a front-end to perform a manual layout of a
1977 RECORD_TYPE. (For instance, if the placement of subsequent fields
1978 depends on the placement of fields so far.) Begin by calling
1979 start_record_layout. Then, call place_field for each of the
1980 fields. Then, call finish_record_layout. See layout_type for the
1981 default way in which these functions are used. */
1983 typedef struct record_layout_info_s
1985 /* The RECORD_TYPE that we are laying out. */
1987 /* The offset into the record so far, in bytes, not including bits in
1990 /* The last known alignment of SIZE. */
1991 unsigned int offset_align
;
1992 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
1994 /* The alignment of the record so far, in bits. */
1995 unsigned int record_align
;
1996 /* The alignment of the record so far, not including padding, in bits. */
1997 unsigned int unpacked_align
;
1998 /* The static variables (i.e., class variables, as opposed to
1999 instance variables) encountered in T. */
2000 tree pending_statics
;
2001 int packed_maybe_necessary
;
2002 } *record_layout_info
;
2004 extern record_layout_info start_record_layout
PARAMS ((tree
));
2005 extern tree bit_from_pos
PARAMS ((tree
, tree
));
2006 extern tree byte_from_pos
PARAMS ((tree
, tree
));
2007 extern void pos_from_byte
PARAMS ((tree
*, tree
*, unsigned int,
2009 extern void pos_from_bit
PARAMS ((tree
*, tree
*, unsigned int,
2011 extern void normalize_offset
PARAMS ((tree
*, tree
*,
2013 extern tree rli_size_unit_so_far
PARAMS ((record_layout_info
));
2014 extern tree rli_size_so_far
PARAMS ((record_layout_info
));
2015 extern void normalize_rli
PARAMS ((record_layout_info
));
2016 extern void place_field
PARAMS ((record_layout_info
, tree
));
2017 extern void compute_record_mode
PARAMS ((tree
));
2018 extern void finish_record_layout
PARAMS ((record_layout_info
));
2020 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2021 return a canonicalized ..._TYPE node, so that duplicates are not made.
2022 How the hash code is computed is up to the caller, as long as any two
2023 callers that could hash identical-looking type nodes agree. */
2025 extern tree type_hash_canon
PARAMS ((unsigned int, tree
));
2027 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2028 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2029 fields. Call this only once for any given decl node.
2031 Second argument is the boundary that this field can be assumed to
2032 be starting at (in bits). Zero means it can be assumed aligned
2033 on any boundary that may be needed. */
2035 extern void layout_decl
PARAMS ((tree
, unsigned));
2037 /* Return the mode for data of a given size SIZE and mode class CLASS.
2038 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2039 The value is BLKmode if no other mode is found. This is like
2040 mode_for_size, but is passed a tree. */
2042 extern enum machine_mode mode_for_size_tree
PARAMS ((tree
, enum mode_class
,
2045 /* Return an expr equal to X but certainly not valid as an lvalue. */
2047 extern tree non_lvalue
PARAMS ((tree
));
2048 extern tree pedantic_non_lvalue
PARAMS ((tree
));
2050 extern tree convert
PARAMS ((tree
, tree
));
2051 extern unsigned int expr_align
PARAMS ((tree
));
2052 extern tree size_in_bytes
PARAMS ((tree
));
2053 extern HOST_WIDE_INT int_size_in_bytes
PARAMS ((tree
));
2054 extern tree bit_position
PARAMS ((tree
));
2055 extern HOST_WIDE_INT int_bit_position
PARAMS ((tree
));
2056 extern tree byte_position
PARAMS ((tree
));
2057 extern HOST_WIDE_INT int_byte_position
PARAMS ((tree
));
2059 /* Define data structures, macros, and functions for handling sizes
2060 and the various types used to represent sizes. */
2064 SIZETYPE
, /* Normal representation of sizes in bytes. */
2065 SSIZETYPE
, /* Signed representation of sizes in bytes. */
2066 USIZETYPE
, /* Unsigned representation of sizes in bytes. */
2067 BITSIZETYPE
, /* Normal representation of sizes in bits. */
2068 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
2069 UBITSIZETYPE
, /* Unsifgned representation of sizes in bits. */
2072 extern tree sizetype_tab
[(int) TYPE_KIND_LAST
];
2074 #define sizetype sizetype_tab[(int) SIZETYPE]
2075 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2076 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2077 #define usizetype sizetype_tab[(int) USIZETYPE]
2078 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2079 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2081 extern tree size_binop
PARAMS ((enum tree_code
, tree
, tree
));
2082 extern tree size_diffop
PARAMS ((tree
, tree
));
2083 extern tree size_int_wide
PARAMS ((HOST_WIDE_INT
,
2084 enum size_type_kind
));
2085 extern tree size_int_type_wide
PARAMS ((HOST_WIDE_INT
, tree
));
2087 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2088 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2089 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2090 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2091 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2093 extern tree round_up
PARAMS ((tree
, int));
2094 extern tree round_down
PARAMS ((tree
, int));
2095 extern tree get_pending_sizes
PARAMS ((void));
2096 extern void put_pending_sizes
PARAMS ((tree
));
2098 /* Type for sizes of data-type. */
2100 #define BITS_PER_UNIT_LOG \
2101 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2102 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2103 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2105 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2106 extern unsigned int maximum_field_alignment
;
2108 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
2109 extern unsigned int set_alignment
;
2111 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2112 by making the last node in X point to Y.
2113 Returns X, except if X is 0 returns Y. */
2115 extern tree chainon
PARAMS ((tree
, tree
));
2117 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2119 extern tree tree_cons
PARAMS ((tree
, tree
, tree
));
2120 extern tree perm_tree_cons
PARAMS ((tree
, tree
, tree
));
2121 extern tree temp_tree_cons
PARAMS ((tree
, tree
, tree
));
2122 extern tree saveable_tree_cons
PARAMS ((tree
, tree
, tree
));
2123 extern tree decl_tree_cons
PARAMS ((tree
, tree
, tree
));
2124 extern tree expr_tree_cons
PARAMS ((tree
, tree
, tree
));
2126 /* Return the last tree node in a chain. */
2128 extern tree tree_last
PARAMS ((tree
));
2130 /* Reverse the order of elements in a chain, and return the new head. */
2132 extern tree nreverse
PARAMS ((tree
));
2134 /* Returns the length of a chain of nodes
2135 (number of chain pointers to follow before reaching a null pointer). */
2137 extern int list_length
PARAMS ((tree
));
2139 /* Returns the number of FIELD_DECLs in a type. */
2141 extern int fields_length
PARAMS ((tree
));
2143 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2145 extern int integer_zerop
PARAMS ((tree
));
2147 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2149 extern int integer_onep
PARAMS ((tree
));
2151 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2152 all of whose significant bits are 1. */
2154 extern int integer_all_onesp
PARAMS ((tree
));
2156 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2157 exactly one bit 1. */
2159 extern int integer_pow2p
PARAMS ((tree
));
2161 /* staticp (tree x) is nonzero if X is a reference to data allocated
2162 at a fixed address in memory. */
2164 extern int staticp
PARAMS ((tree
));
2166 /* Gets an error if argument X is not an lvalue.
2167 Also returns 1 if X is an lvalue, 0 if not. */
2169 extern int lvalue_or_else
PARAMS ((tree
, const char *));
2171 /* save_expr (EXP) returns an expression equivalent to EXP
2172 but it can be used multiple times within context CTX
2173 and only evaluate EXP once. */
2175 extern tree save_expr
PARAMS ((tree
));
2177 /* Returns the index of the first non-tree operand for CODE, or the number
2178 of operands if all are trees. */
2180 extern int first_rtl_op
PARAMS ((enum tree_code
));
2182 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2183 can be used multiple times and will evaluate EXP in its entirety
2186 extern tree unsave_expr
PARAMS ((tree
));
2188 /* Reset EXP in place so that it can be expaned again. Does not
2189 recurse into subtrees. */
2191 extern void unsave_expr_1
PARAMS ((tree
));
2193 /* Like unsave_expr_1, but recurses into all subtrees. */
2195 extern tree unsave_expr_now
PARAMS ((tree
));
2197 /* If non-null, these are language-specific helper functions for
2198 unsave_expr_now. If present, LANG_UNSAVE is called before its
2199 argument (an UNSAVE_EXPR) is to be unsaved, and all other
2200 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
2201 called from unsave_expr_1 for language-specific tree codes. */
2202 extern void (*lang_unsave
) PARAMS ((tree
*));
2203 extern void (*lang_unsave_expr_now
) PARAMS ((tree
));
2205 /* Return 0 if it is safe to evaluate EXPR multiple times,
2206 return 1 if it is safe if EXPR is unsaved afterward, or
2207 return 2 if it is completely unsafe. */
2208 extern int unsafe_for_reeval
PARAMS ((tree
));
2210 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2211 or offset that depends on a field within a record.
2213 Note that we only allow such expressions within simple arithmetic
2216 extern int contains_placeholder_p
PARAMS ((tree
));
2218 /* Return 1 if EXP contains any expressions that produce cleanups for an
2219 outer scope to deal with. Used by fold. */
2221 extern int has_cleanups
PARAMS ((tree
));
2223 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2224 return a tree with all occurrences of references to F in a
2225 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2226 contains only arithmetic expressions. */
2228 extern tree substitute_in_expr
PARAMS ((tree
, tree
, tree
));
2230 /* variable_size (EXP) is like save_expr (EXP) except that it
2231 is for the special case of something that is part of a
2232 variable size for a data type. It makes special arrangements
2233 to compute the value at the right time when the data type
2234 belongs to a function parameter. */
2236 extern tree variable_size
PARAMS ((tree
));
2238 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2239 but it can be used multiple times
2240 and only evaluate the subexpressions once. */
2242 extern tree stabilize_reference
PARAMS ((tree
));
2244 /* Subroutine of stabilize_reference; this is called for subtrees of
2245 references. Any expression with side-effects must be put in a SAVE_EXPR
2246 to ensure that it is only evaluated once. */
2248 extern tree stabilize_reference_1
PARAMS ((tree
));
2250 /* Return EXP, stripped of any conversions to wider types
2251 in such a way that the result of converting to type FOR_TYPE
2252 is the same as if EXP were converted to FOR_TYPE.
2253 If FOR_TYPE is 0, it signifies EXP's type. */
2255 extern tree get_unwidened
PARAMS ((tree
, tree
));
2257 /* Return OP or a simpler expression for a narrower value
2258 which can be sign-extended or zero-extended to give back OP.
2259 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2260 or 0 if the value should be sign-extended. */
2262 extern tree get_narrower
PARAMS ((tree
, int *));
2264 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2266 The definition of this resides in language-specific code
2267 as the repertoire of available types may vary. */
2269 extern tree type_for_mode
PARAMS ((enum machine_mode
, int));
2271 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2272 for an integer type with at least that precision.
2273 The definition of this resides in language-specific code
2274 as the repertoire of available types may vary. */
2276 extern tree type_for_size
PARAMS ((unsigned, int));
2278 /* Given an integer type T, return a type like T but unsigned.
2279 If T is unsigned, the value is T.
2280 The definition of this resides in language-specific code
2281 as the repertoire of available types may vary. */
2283 extern tree unsigned_type
PARAMS ((tree
));
2285 /* Given an integer type T, return a type like T but signed.
2286 If T is signed, the value is T.
2287 The definition of this resides in language-specific code
2288 as the repertoire of available types may vary. */
2290 extern tree signed_type
PARAMS ((tree
));
2292 /* This function must be defined in the language-specific files.
2293 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2294 This is defined in a language-specific file. */
2296 extern tree maybe_build_cleanup
PARAMS ((tree
));
2298 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2299 look for nested component-refs or array-refs at constant positions
2300 and find the ultimate containing object, which is returned. */
2302 extern tree get_inner_reference
PARAMS ((tree
, HOST_WIDE_INT
*,
2303 HOST_WIDE_INT
*, tree
*,
2304 enum machine_mode
*, int *,
2305 int *, unsigned int *));
2307 /* Given a DECL or TYPE, return the scope in which it was declared, or
2308 NUL_TREE if there is no containing scope. */
2310 extern tree get_containing_scope
PARAMS ((tree
));
2312 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2314 extern tree decl_function_context
PARAMS ((tree
));
2316 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2317 this _DECL with its context, or zero if none. */
2318 extern tree decl_type_context
PARAMS ((tree
));
2320 /* Given the FUNCTION_DECL for the current function,
2321 return zero if it is ok for this function to be inline.
2322 Otherwise return a warning message with a single %s
2323 for the function's name. */
2325 extern const char *function_cannot_inline_p
PARAMS ((tree
));
2327 /* Return 1 if EXPR is the real constant zero. */
2328 extern int real_zerop
PARAMS ((tree
));
2330 /* Declare commonly used variables for tree structure. */
2332 /* Points to the name of the input file from which the current input
2333 being parsed originally came (before it went into cpp). */
2334 extern const char *input_filename
;
2336 /* Current line number in input file. */
2339 /* Nonzero for -pedantic switch: warn about anything
2340 that standard C forbids. */
2341 extern int pedantic
;
2343 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2344 Zero means allow extended lvalues. */
2346 extern int pedantic_lvalues
;
2348 /* Nonzero means can safely call expand_expr now;
2349 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2351 extern int immediate_size_expand
;
2353 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2355 extern tree current_function_decl
;
2357 /* Nonzero means a FUNC_BEGIN label was emitted. */
2358 extern tree current_function_func_begin_label
;
2360 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2362 extern int all_types_permanent
;
2364 /* Pointer to function to compute the name to use to print a declaration.
2365 DECL is the declaration in question.
2366 VERBOSITY determines what information will be printed:
2367 0: DECL_NAME, demangled as necessary.
2368 1: and scope information.
2369 2: and any other information that might be interesting, such as function
2370 parameter types in C++. */
2372 extern const char *(*decl_printable_name
) PARAMS ((tree
, int));
2374 /* Pointer to function to finish handling an incomplete decl at the
2375 end of compilation. */
2377 extern void (*incomplete_decl_finalize_hook
) PARAMS ((tree
));
2379 extern const char *init_parse
PARAMS ((const char *));
2380 extern void finish_parse
PARAMS ((void));
2382 extern const char * const language_string
;
2384 /* Declare a predefined function. Return the declaration. This function is
2385 provided by each language frontend. */
2386 extern tree builtin_function
PARAMS ((const char *, tree
, int,
2387 enum built_in_class
,
2391 extern char *perm_calloc
PARAMS ((int, long));
2392 extern tree get_file_function_name
PARAMS ((int));
2393 extern tree get_file_function_name_long
PARAMS ((const char *));
2394 extern tree get_set_constructor_bits
PARAMS ((tree
, char *, int));
2395 extern tree get_set_constructor_bytes
PARAMS ((tree
,
2396 unsigned char *, int));
2397 extern tree get_callee_fndecl
PARAMS ((tree
));
2401 extern int in_control_zone_p
PARAMS ((void));
2402 extern void expand_fixups
PARAMS ((struct rtx_def
*));
2403 extern tree expand_start_stmt_expr
PARAMS ((void));
2404 extern tree expand_end_stmt_expr
PARAMS ((tree
));
2405 extern void expand_expr_stmt
PARAMS ((tree
));
2406 extern int warn_if_unused_value
PARAMS ((tree
));
2407 extern void expand_decl_init
PARAMS ((tree
));
2408 extern void clear_last_expr
PARAMS ((void));
2409 extern void expand_label
PARAMS ((tree
));
2410 extern void expand_goto
PARAMS ((tree
));
2411 extern void expand_asm
PARAMS ((tree
));
2412 extern void expand_start_cond
PARAMS ((tree
, int));
2413 extern void expand_end_cond
PARAMS ((void));
2414 extern void expand_start_else
PARAMS ((void));
2415 extern void expand_start_elseif
PARAMS ((tree
));
2416 extern struct nesting
*expand_start_loop
PARAMS ((int));
2417 extern struct nesting
*expand_start_loop_continue_elsewhere
PARAMS ((int));
2418 extern void expand_loop_continue_here
PARAMS ((void));
2419 extern void expand_end_loop
PARAMS ((void));
2420 extern int expand_continue_loop
PARAMS ((struct nesting
*));
2421 extern int expand_exit_loop
PARAMS ((struct nesting
*));
2422 extern int expand_exit_loop_if_false
PARAMS ((struct nesting
*,
2424 extern int expand_exit_something
PARAMS ((void));
2426 extern void expand_null_return
PARAMS ((void));
2427 extern void expand_return
PARAMS ((tree
));
2428 extern int optimize_tail_recursion
PARAMS ((tree
, struct rtx_def
*));
2429 extern void expand_start_bindings_and_block
PARAMS ((int, tree
));
2430 #define expand_start_bindings(flags) \
2431 expand_start_bindings_and_block(flags, NULL_TREE)
2432 extern void expand_end_bindings
PARAMS ((tree
, int, int));
2433 extern void warn_about_unused_variables
PARAMS ((tree
));
2434 extern void start_cleanup_deferral
PARAMS ((void));
2435 extern void end_cleanup_deferral
PARAMS ((void));
2436 extern int is_body_block
PARAMS ((tree
));
2438 extern void mark_block_as_eh_region
PARAMS ((void));
2439 extern void mark_block_as_not_eh_region
PARAMS ((void));
2440 extern int is_eh_region
PARAMS ((void));
2441 extern int conditional_context
PARAMS ((void));
2442 extern tree last_cleanup_this_contour
PARAMS ((void));
2443 extern int expand_dhc_cleanup
PARAMS ((tree
));
2444 extern int expand_dcc_cleanup
PARAMS ((tree
));
2445 extern void expand_start_case
PARAMS ((int, tree
, tree
,
2447 extern void expand_end_case
PARAMS ((tree
));
2448 extern int pushcase
PARAMS ((tree
,
2449 tree (*) (tree
, tree
),
2451 extern int pushcase_range
PARAMS ((tree
, tree
,
2452 tree (*) (tree
, tree
),
2454 extern void using_eh_for_cleanups
PARAMS ((void));
2455 extern int stmt_loop_nest_empty
PARAMS ((void));
2457 /* In fold-const.c */
2459 /* Fold constants as much as possible in an expression.
2460 Returns the simplified expression.
2461 Acts only on the top level of the expression;
2462 if the argument itself cannot be simplified, its
2463 subexpressions are not changed. */
2465 extern tree fold
PARAMS ((tree
));
2467 extern int force_fit_type
PARAMS ((tree
, int));
2468 extern int add_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2469 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2470 unsigned HOST_WIDE_INT
*,
2472 extern int neg_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2473 unsigned HOST_WIDE_INT
*,
2475 extern int mul_double
PARAMS ((unsigned HOST_WIDE_INT
,
2477 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2478 unsigned HOST_WIDE_INT
*,
2480 extern void lshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2481 HOST_WIDE_INT
, unsigned int,
2482 unsigned HOST_WIDE_INT
*,
2483 HOST_WIDE_INT
*, int));
2484 extern void rshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2485 HOST_WIDE_INT
, unsigned int,
2486 unsigned HOST_WIDE_INT
*,
2487 HOST_WIDE_INT
*, int));
2488 extern void lrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2489 HOST_WIDE_INT
, unsigned int,
2490 unsigned HOST_WIDE_INT
*,
2492 extern void rrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2493 HOST_WIDE_INT
, unsigned int,
2494 unsigned HOST_WIDE_INT
*,
2496 extern int operand_equal_p
PARAMS ((tree
, tree
, int));
2497 extern tree invert_truthvalue
PARAMS ((tree
));
2499 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2500 function arguments and return the new type. Return NULL_TREE if no
2501 change. Required by any language that supports variadic arguments. */
2503 extern tree (*lang_type_promotes_to
) PARAMS ((tree
));
2505 /* Interface of the DWARF2 unwind info support. */
2507 /* Decide whether we want to emit frame unwind information for the current
2508 translation unit. */
2510 extern int dwarf2out_do_frame
PARAMS ((void));
2512 /* Generate a new label for the CFI info to refer to. */
2514 extern char *dwarf2out_cfi_label
PARAMS ((void));
2516 /* Entry point to update the canonical frame address (CFA). */
2518 extern void dwarf2out_def_cfa
PARAMS ((const char *, unsigned, long));
2520 /* Add the CFI for saving a register window. */
2522 extern void dwarf2out_window_save
PARAMS ((const char *));
2524 /* Add a CFI to update the running total of the size of arguments pushed
2527 extern void dwarf2out_args_size
PARAMS ((const char *, long));
2529 /* Entry point for saving a register to the stack. */
2531 extern void dwarf2out_reg_save
PARAMS ((const char *, unsigned, long));
2533 /* Entry point for saving the return address in the stack. */
2535 extern void dwarf2out_return_save
PARAMS ((const char *, long));
2537 /* Entry point for saving the return address in a register. */
2539 extern void dwarf2out_return_reg
PARAMS ((const char *, unsigned));
2541 /* Output a marker (i.e. a label) for the beginning of a function, before
2544 extern void dwarf2out_begin_prologue
PARAMS ((void));
2546 /* Output a marker (i.e. a label) for the absolute end of the generated
2547 code for a function definition. */
2549 extern void dwarf2out_end_epilogue
PARAMS ((void));
2551 /* The language front-end must define these functions. */
2553 /* Function of no arguments for initializing options. */
2554 extern void lang_init_options
PARAMS ((void));
2556 /* Function of no arguments for initializing lexical scanning. */
2557 extern void init_lex
PARAMS ((void));
2558 /* Function of no arguments for initializing the symbol table. */
2559 extern void init_decl_processing
PARAMS ((void));
2561 /* Functions called with no arguments at the beginning and end or processing
2562 the input source file. */
2563 extern void lang_init
PARAMS ((void));
2564 extern void lang_finish
PARAMS ((void));
2566 /* Function to identify which front-end produced the output file. */
2567 extern const char *lang_identify
PARAMS ((void));
2569 /* Called by report_error_function to print out function name.
2570 * Default may be overridden by language front-ends. */
2571 extern void (*print_error_function
) PARAMS ((const char *));
2573 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2574 extern void copy_lang_decl
PARAMS ((tree
));
2576 /* Function called with no arguments to parse and compile the input. */
2577 extern int yyparse
PARAMS ((void));
2578 /* Function called with option as argument
2579 to decode options starting with -f or -W or +.
2580 It should return nonzero if it handles the option. */
2581 extern int lang_decode_option
PARAMS ((int, char **));
2583 /* Functions for processing symbol declarations. */
2584 /* Function to enter a new lexical scope.
2585 Takes one argument: always zero when called from outside the front end. */
2586 extern void pushlevel
PARAMS ((int));
2587 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2588 Takes three arguments:
2589 KEEP -- nonzero if there were declarations in this scope.
2590 REVERSE -- reverse the order of decls before returning them.
2591 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2592 extern tree poplevel
PARAMS ((int, int, int));
2593 /* Set the BLOCK node for the current scope level. */
2594 extern void set_block
PARAMS ((tree
));
2595 /* Function to add a decl to the current scope level.
2596 Takes one argument, a decl to add.
2597 Returns that decl, or, if the same symbol is already declared, may
2598 return a different decl for that name. */
2599 extern tree pushdecl
PARAMS ((tree
));
2600 /* Function to return the chain of decls so far in the current scope level. */
2601 extern tree getdecls
PARAMS ((void));
2602 /* Function to return the chain of structure tags in the current scope level. */
2603 extern tree gettags
PARAMS ((void));
2605 extern tree build_range_type
PARAMS ((tree
, tree
, tree
));
2607 /* Call when starting to parse a declaration:
2608 make expressions in the declaration last the length of the function.
2609 Returns an argument that should be passed to resume_momentary later. */
2610 extern int suspend_momentary
PARAMS ((void));
2612 extern int allocation_temporary_p
PARAMS ((void));
2614 /* Call when finished parsing a declaration:
2615 restore the treatment of node-allocation that was
2616 in effect before the suspension.
2617 YES should be the value previously returned by suspend_momentary. */
2618 extern void resume_momentary
PARAMS ((int));
2620 /* Called after finishing a record, union or enumeral type. */
2621 extern void rest_of_type_compilation
PARAMS ((tree
, int));
2623 /* Save the current set of obstacks, but don't change them. */
2624 extern void push_obstacks_nochange
PARAMS ((void));
2626 extern void permanent_allocation
PARAMS ((int));
2627 extern void push_momentary
PARAMS ((void));
2628 extern void clear_momentary
PARAMS ((void));
2629 extern void pop_momentary
PARAMS ((void));
2630 extern void end_temporary_allocation
PARAMS ((void));
2632 /* Pop the obstack selection stack. */
2633 extern void pop_obstacks
PARAMS ((void));
2636 void record_component_aliases
PARAMS ((tree
));
2639 extern int really_constant_p
PARAMS ((tree
));
2640 extern void push_obstacks
PARAMS ((struct obstack
*,
2642 extern void pop_momentary_nofree
PARAMS ((void));
2643 extern void preserve_momentary
PARAMS ((void));
2644 extern void saveable_allocation
PARAMS ((void));
2645 extern void temporary_allocation
PARAMS ((void));
2646 extern void resume_temporary_allocation
PARAMS ((void));
2647 extern tree get_file_function_name
PARAMS ((int));
2648 extern void set_identifier_size
PARAMS ((int));
2649 extern int int_fits_type_p
PARAMS ((tree
, tree
));
2650 extern int tree_log2
PARAMS ((tree
));
2651 extern int tree_floor_log2
PARAMS ((tree
));
2652 extern void preserve_initializer
PARAMS ((void));
2653 extern void preserve_data
PARAMS ((void));
2654 extern int object_permanent_p
PARAMS ((tree
));
2655 extern int type_precision
PARAMS ((tree
));
2656 extern int simple_cst_equal
PARAMS ((tree
, tree
));
2657 extern int compare_tree_int
PARAMS ((tree
, unsigned int));
2658 extern int type_list_equal
PARAMS ((tree
, tree
));
2659 extern int chain_member
PARAMS ((tree
, tree
));
2660 extern int chain_member_purpose
PARAMS ((tree
, tree
));
2661 extern int chain_member_value
PARAMS ((tree
, tree
));
2662 extern tree listify
PARAMS ((tree
));
2663 extern tree type_hash_lookup
PARAMS ((unsigned int, tree
));
2664 extern void type_hash_add
PARAMS ((unsigned int, tree
));
2665 extern unsigned int type_hash_list
PARAMS ((tree
));
2666 extern int simple_cst_list_equal
PARAMS ((tree
, tree
));
2667 extern void debug_obstack
PARAMS ((char *));
2668 extern void rtl_in_current_obstack
PARAMS ((void));
2669 extern void rtl_in_saveable_obstack
PARAMS ((void));
2670 extern void init_tree_codes
PARAMS ((void));
2671 extern void dump_tree_statistics
PARAMS ((void));
2672 extern void print_obstack_statistics
PARAMS ((const char *,
2675 extern void print_obstack_name
PARAMS ((char *, FILE *,
2678 extern void expand_function_end
PARAMS ((const char *, int, int));
2679 extern void expand_function_start
PARAMS ((tree
, int));
2681 extern int real_onep
PARAMS ((tree
));
2682 extern int real_twop
PARAMS ((tree
));
2683 extern void start_identifier_warnings
PARAMS ((void));
2684 extern void gcc_obstack_init
PARAMS ((struct obstack
*));
2685 extern void init_obstacks
PARAMS ((void));
2686 extern void obfree
PARAMS ((char *));
2687 extern void build_common_tree_nodes
PARAMS ((int));
2688 extern void build_common_tree_nodes_2
PARAMS ((int));
2691 extern void setjmp_protect_args
PARAMS ((void));
2692 extern void setjmp_protect
PARAMS ((tree
));
2693 extern void expand_main_function
PARAMS ((void));
2694 extern void mark_varargs
PARAMS ((void));
2695 extern void init_dummy_function_start
PARAMS ((void));
2696 extern void expand_dummy_function_end
PARAMS ((void));
2697 extern void init_function_for_compilation
PARAMS ((void));
2698 extern void init_function_start
PARAMS ((tree
, const char *, int));
2699 extern void assign_parms
PARAMS ((tree
));
2700 extern void put_var_into_stack
PARAMS ((tree
));
2701 extern void flush_addressof
PARAMS ((tree
));
2702 extern void uninitialized_vars_warning
PARAMS ((tree
));
2703 extern void setjmp_args_warning
PARAMS ((void));
2704 extern void mark_all_temps_used
PARAMS ((void));
2705 extern void init_temp_slots
PARAMS ((void));
2706 extern void combine_temp_slots
PARAMS ((void));
2707 extern void free_temp_slots
PARAMS ((void));
2708 extern void pop_temp_slots
PARAMS ((void));
2709 extern void push_temp_slots
PARAMS ((void));
2710 extern void preserve_temp_slots
PARAMS ((struct rtx_def
*));
2711 extern void preserve_rtl_expr_temps
PARAMS ((tree
));
2712 extern int aggregate_value_p
PARAMS ((tree
));
2713 extern void free_temps_for_rtl_expr
PARAMS ((tree
));
2714 extern void instantiate_virtual_regs
PARAMS ((tree
, struct rtx_def
*));
2715 extern void unshare_all_rtl
PARAMS ((tree
, struct rtx_def
*));
2716 extern int max_parm_reg_num
PARAMS ((void));
2717 extern void push_function_context
PARAMS ((void));
2718 extern void pop_function_context
PARAMS ((void));
2719 extern void push_function_context_to
PARAMS ((tree
));
2720 extern void pop_function_context_from
PARAMS ((tree
));
2722 /* In print-rtl.c */
2724 extern void print_rtl
PARAMS ((FILE *, struct rtx_def
*));
2727 /* In print-tree.c */
2728 extern void debug_tree
PARAMS ((tree
));
2730 extern void print_node
PARAMS ((FILE *, const char *, tree
,
2732 extern void print_node_brief
PARAMS ((FILE *, const char *, tree
,
2734 extern void indent_to
PARAMS ((FILE *, int));
2738 extern void emit_queue
PARAMS ((void));
2739 extern int apply_args_register_offset
PARAMS ((int));
2740 extern struct rtx_def
*expand_builtin_return_addr
2741 PARAMS ((enum built_in_function
, int, struct rtx_def
*));
2742 extern void do_pending_stack_adjust
PARAMS ((void));
2743 extern struct rtx_def
*expand_assignment
PARAMS ((tree
, tree
, int,
2745 extern struct rtx_def
*store_expr
PARAMS ((tree
,
2748 extern void check_max_integer_computation_mode
PARAMS ((tree
));
2751 extern void start_sequence_for_rtl_expr
PARAMS ((tree
));
2752 extern struct rtx_def
*emit_line_note_after
PARAMS ((const char *, int,
2754 extern struct rtx_def
*emit_line_note
PARAMS ((const char *, int));
2755 extern struct rtx_def
*emit_line_note_force
PARAMS ((const char *, int));
2759 extern int setjmp_call_p
PARAMS ((tree
));
2763 extern int mark_addressable
PARAMS ((tree
));
2764 extern void incomplete_type_error
PARAMS ((tree
, tree
));
2765 extern void print_lang_statistics
PARAMS ((void));
2766 extern tree truthvalue_conversion
PARAMS ((tree
));
2767 extern void split_specs_attrs
PARAMS ((tree
, tree
*, tree
*));
2769 extern void print_lang_decl
PARAMS ((FILE *, tree
, int));
2770 extern void print_lang_type
PARAMS ((FILE *, tree
, int));
2771 extern void print_lang_identifier
PARAMS ((FILE *, tree
, int));
2773 extern int global_bindings_p
PARAMS ((void));
2774 extern void insert_block
PARAMS ((tree
));
2776 /* In integrate.c */
2777 extern void save_for_inline_nocopy
PARAMS ((tree
));
2778 extern void save_for_inline_copying
PARAMS ((tree
));
2779 extern void set_decl_abstract_flags
PARAMS ((tree
, int));
2780 extern void output_inline_function
PARAMS ((tree
));
2781 extern void set_decl_origin_self
PARAMS ((tree
));
2784 extern void set_yydebug
PARAMS ((int));
2786 /* In stor-layout.c */
2787 extern void fixup_signed_type
PARAMS ((tree
));
2790 extern void make_decl_rtl
PARAMS ((tree
, const char *, int));
2791 extern void make_decl_one_only
PARAMS ((tree
));
2792 extern int supports_one_only
PARAMS ((void));
2793 extern void variable_section
PARAMS ((tree
, int));
2795 /* In fold-const.c */
2796 extern int div_and_round_double
PARAMS ((enum tree_code
, int,
2797 unsigned HOST_WIDE_INT
,
2799 unsigned HOST_WIDE_INT
,
2801 unsigned HOST_WIDE_INT
*,
2803 unsigned HOST_WIDE_INT
*,
2807 extern void emit_nop
PARAMS ((void));
2808 extern void expand_computed_goto
PARAMS ((tree
));
2809 extern struct rtx_def
*label_rtx
PARAMS ((tree
));
2810 extern void expand_asm_operands
PARAMS ((tree
, tree
, tree
, tree
, int,
2811 const char *, int));
2812 extern int any_pending_cleanups
PARAMS ((int));
2813 extern void init_stmt
PARAMS ((void));
2814 extern void init_stmt_for_function
PARAMS ((void));
2815 extern int drop_through_at_end_p
PARAMS ((void));
2816 extern void expand_start_target_temps
PARAMS ((void));
2817 extern void expand_end_target_temps
PARAMS ((void));
2818 extern void expand_elseif
PARAMS ((tree
));
2819 extern void expand_decl
PARAMS ((tree
));
2820 extern int expand_decl_cleanup
PARAMS ((tree
, tree
));
2821 extern void expand_anon_union_decl
PARAMS ((tree
, tree
, tree
));
2822 extern void move_cleanups_up
PARAMS ((void));
2823 extern void expand_start_case_dummy
PARAMS ((void));
2824 extern void expand_end_case_dummy
PARAMS ((void));
2825 extern tree case_index_expr_type
PARAMS ((void));
2826 extern HOST_WIDE_INT all_cases_count
PARAMS ((tree
, int *));
2827 extern void check_for_full_enumeration_handling
PARAMS ((tree
));
2828 extern void declare_nonlocal_label
PARAMS ((tree
));
2830 extern void lang_print_xnode
PARAMS ((FILE *, tree
, int));
2834 /* If KIND=='I', return a suitable global initializer (constructor) name.
2835 If KIND=='D', return a suitable global clean-up (destructor) name. */
2836 extern tree get_file_function_name
PARAMS ((int));
2838 /* Interface of the DWARF2 unwind info support. */
2840 /* Decide whether we want to emit frame unwind information for the current
2841 translation unit. */
2843 extern int dwarf2out_do_frame
PARAMS ((void));
2845 /* Generate a new label for the CFI info to refer to. */
2847 extern char *dwarf2out_cfi_label
PARAMS ((void));
2849 /* Entry point to update the canonical frame address (CFA). */
2851 extern void dwarf2out_def_cfa
PARAMS ((const char *, unsigned, long));
2853 /* Add the CFI for saving a register window. */
2855 extern void dwarf2out_window_save
PARAMS ((const char *));
2857 /* Add a CFI to update the running total of the size of arguments pushed
2860 extern void dwarf2out_args_size
PARAMS ((const char *, long));
2862 /* Entry point for saving a register to the stack. */
2864 extern void dwarf2out_reg_save
PARAMS ((const char *, unsigned, long));
2866 /* Entry point for saving the return address in the stack. */
2868 extern void dwarf2out_return_save
PARAMS ((const char *, long));
2870 /* Entry point for saving the return address in a register. */
2872 extern void dwarf2out_return_reg
PARAMS ((const char *, unsigned));
2874 /* Output a marker (i.e. a label) for the beginning of a function, before
2877 extern void dwarf2out_begin_prologue
PARAMS ((void));
2879 /* Output a marker (i.e. a label) for the absolute end of the generated
2880 code for a function definition. */
2882 extern void dwarf2out_end_epilogue
PARAMS ((void));
2884 /* Redefine abort to report an internal error w/o coredump, and
2885 reporting the location of the error in the source file. This logic
2886 is duplicated in rtl.h and tree.h because every file that needs the
2887 special abort includes one or both. toplev.h gets too few files,
2888 system.h gets too many. */
2890 extern void fancy_abort
PARAMS ((const char *, int, const char *))
2892 #if (GCC_VERSION >= 2007)
2893 #define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__)
2895 #define abort() fancy_abort (__FILE__, __LINE__, 0)