1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
27 /* Codes of tree nodes */
29 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
34 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
40 /* Number of tree codes. */
41 #define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE)
43 /* Indexed by enum tree_code, contains a character which is
44 `<' for a comparison expression, `1', for a unary arithmetic
45 expression, `2' for a binary arithmetic expression, `e' for
46 other types of expressions, `r' for a reference, `c' for a
47 constant, `d' for a decl, `t' for a type, `s' for a statement,
48 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
50 extern char **tree_code_type;
51 #define TREE_CODE_CLASS(CODE) (*tree_code_type[(int) (CODE)])
53 /* Number of argument-words in each kind of tree-node. */
55 extern int *tree_code_length;
57 /* Names of tree components. */
59 extern char **tree_code_name;
61 /* Codes that identify the various built in functions
62 so that expand_call can identify them quickly. */
64 enum built_in_function
90 BUILT_IN_CLASSIFY_TYPE,
94 BUILT_IN_FRAME_ADDRESS,
95 BUILT_IN_RETURN_ADDRESS,
96 BUILT_IN_CALLER_RETURN_ADDRESS,
109 /* Upper bound on non-language-specific builtins. */
113 /* The definition of tree nodes fills the next several pages. */
115 /* A tree node can represent a data type, a variable, an expression
116 or a statement. Each node has a TREE_CODE which says what kind of
117 thing it represents. Some common codes are:
118 INTEGER_TYPE -- represents a type of integers.
119 ARRAY_TYPE -- represents a type of pointer.
120 VAR_DECL -- represents a declared variable.
121 INTEGER_CST -- represents a constant integer value.
122 PLUS_EXPR -- represents a sum (an expression).
124 As for the contents of a tree node: there are some fields
125 that all nodes share. Each TREE_CODE has various special-purpose
126 fields as well. The fields of a node are never accessed directly,
127 always through accessor macros. */
129 /* This type is used everywhere to refer to a tree node. */
131 typedef union tree_node *tree;
133 /* Every kind of tree node starts with this structure,
134 so all nodes have these fields.
136 See the accessor macros, defined below, for documentation of the fields. */
140 union tree_node *chain;
141 union tree_node *type;
142 #ifdef ONLY_INT_FIELDS
143 unsigned int code : 8;
145 enum tree_code code : 8;
148 unsigned side_effects_flag : 1;
149 unsigned constant_flag : 1;
150 unsigned permanent_flag : 1;
151 unsigned addressable_flag : 1;
152 unsigned volatile_flag : 1;
153 unsigned readonly_flag : 1;
154 unsigned unsigned_flag : 1;
155 unsigned asm_written_flag: 1;
157 unsigned used_flag : 1;
158 unsigned raises_flag : 1;
159 unsigned static_flag : 1;
160 unsigned public_flag : 1;
161 unsigned private_flag : 1;
162 unsigned protected_flag : 1;
164 unsigned lang_flag_0 : 1;
165 unsigned lang_flag_1 : 1;
166 unsigned lang_flag_2 : 1;
167 unsigned lang_flag_3 : 1;
168 unsigned lang_flag_4 : 1;
169 unsigned lang_flag_5 : 1;
170 unsigned lang_flag_6 : 1;
171 /* There is room for three more flags. */
174 /* The following table lists the uses of each of the above flags and
175 for which types of nodes they are defined. Note that expressions
181 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
187 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR
188 TREE_NO_UNUSED_WARNING in
189 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
191 TREE_LIST or TREE_VEC
192 TREE_CONSTANT_OVERFLOW in
193 INTEGER_CST, REAL_CST, COMPLEX_CST
194 TREE_SYMBOL_REFERENCED in
200 INTEGER_CST, REAL_CST, COMPLEX_CST
202 VAR_DECL or FUNCTION_DECL
204 TREE_LIST or TREE_VEC
209 TREE_LIST or TREE_VEC
211 ??? unspecified nodes
215 TREE_VIA_PROTECTED in
219 ??? unspecified nodes
228 TREE_THIS_VOLATILE in
236 VAR_DECL, PARM_DECL, FIELD_DECL, ..._REF
238 VAR_DECL if iterator (C)
247 permanent_flag: TREE_PERMANENT in all nodes
252 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
253 DECL_BUILT_IN_NONANSI in
261 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
267 expressions, IDENTIFIER_NODE
275 /* Define accessors for the fields that all tree nodes have
276 (though some fields are not used for all kinds of nodes). */
278 /* The tree-code says what kind of node it is.
279 Codes are defined in tree.def. */
280 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
281 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
283 /* In all nodes that are expressions, this is the data type of the expression.
284 In POINTER_TYPE nodes, this is the type that the pointer points to.
285 In ARRAY_TYPE nodes, this is the type of the elements. */
286 #define TREE_TYPE(NODE) ((NODE)->common.type)
288 /* Nodes are chained together for many purposes.
289 Types are chained together to record them for being output to the debugger
290 (see the function `chain_type').
291 Decls in the same scope are chained together to record the contents
293 Statement nodes for successive statements used to be chained together.
294 Often lists of things are represented by TREE_LIST nodes that
295 are chained together. */
297 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
299 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
300 that don't change the machine mode. */
302 #define STRIP_NOPS(EXP) \
303 while ((TREE_CODE (EXP) == NOP_EXPR \
304 || TREE_CODE (EXP) == CONVERT_EXPR \
305 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
306 && (TYPE_MODE (TREE_TYPE (EXP)) \
307 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
308 (EXP) = TREE_OPERAND (EXP, 0);
310 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
312 #define STRIP_TYPE_NOPS(EXP) \
313 while ((TREE_CODE (EXP) == NOP_EXPR \
314 || TREE_CODE (EXP) == CONVERT_EXPR \
315 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
316 && (TREE_TYPE (EXP) \
317 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
318 (EXP) = TREE_OPERAND (EXP, 0);
320 /* Nonzero if TYPE represents an integral type. Note that we do not
321 include COMPLEX types here. */
323 #define INTEGRAL_TYPE_P(TYPE) \
324 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
325 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
327 /* Nonzero if TYPE represents a floating-point type, including complex
328 floating-point types. */
330 #define FLOAT_TYPE_P(TYPE) \
331 (TREE_CODE (TYPE) == REAL_TYPE \
332 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
333 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
335 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
337 #define AGGREGATE_TYPE_P(TYPE) \
338 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
339 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
340 || TREE_CODE (TYPE) == SET_TYPE)
342 /* Nonzero if TYPE represents a pointer type. */
344 #define POINTER_TYPE_P(TYPE) \
345 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
347 /* Define many boolean fields that all tree nodes have. */
349 /* In VAR_DECL nodes, nonzero means address of this is needed.
350 So it cannot be in a register.
351 In a FUNCTION_DECL, nonzero means its address is needed.
352 So it must be compiled even if it is an inline function.
353 In CONSTRUCTOR nodes, it means object constructed must be in memory.
354 In LABEL_DECL nodes, it means a goto for this label has been seen
355 from a place outside all binding contours that restore stack levels.
356 In ..._TYPE nodes, it means that objects of this type must
357 be fully addressable. This means that pieces of this
358 object cannot go into register parameters, for example.
359 In IDENTIFIER_NODEs, this means that some extern decl for this name
360 had its address taken. That matters for inline functions. */
361 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
363 /* In a VAR_DECL, nonzero means allocate static storage.
364 In a FUNCTION_DECL, nonzero if function has been defined.
365 In a CONSTRUCTOR, nonzero means allocate static storage. */
366 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
368 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
369 made implicitly and should not lead to an "unused value" warning. */
370 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
372 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
373 chain is via a `virtual' declaration. */
374 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
376 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
377 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
378 requires a diagnostic when overflows occur in constant expressions. */
379 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
381 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
382 this string as an argument. */
383 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
385 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
386 overflow in folding, and no warning has been issued for this subexpression.
387 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
388 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
390 /* In a VAR_DECL or FUNCTION_DECL,
391 nonzero means name is to be accessible from outside this module.
392 In an identifier node, nonzero means an external declaration
393 accessible from outside this module was previously seen
394 for this name in an inner scope. */
395 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
397 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
398 base class is via a `public' declaration, which preserves public
399 fields from the base class as public. */
400 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
402 /* Ditto, for `private' declarations. */
403 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
405 /* Nonzero for TREE_LIST node means that the path to the
406 base class is via a `protected' declaration, which preserves
407 protected fields from the base class as protected.
409 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
411 /* In any expression, nonzero means it has side effects or reevaluation
412 of the whole expression could produce a different value.
413 This is set if any subexpression is a function call, a side effect
414 or a reference to a volatile variable.
415 In a ..._DECL, this is set only if the declaration said `volatile'. */
416 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
418 /* Nonzero means this expression is volatile in the C sense:
419 its address should be of type `volatile WHATEVER *'.
420 In other words, the declared item is volatile qualified.
421 This is used in _DECL nodes and _REF nodes.
423 In a ..._TYPE node, means this type is volatile-qualified.
424 But use TYPE_VOLATILE instead of this macro when the node is a type,
425 because eventually we may make that a different bit.
427 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
428 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
430 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
431 nonzero means it may not be the lhs of an assignment.
432 In a ..._TYPE node, means this type is const-qualified
433 (but the macro TYPE_READONLY should be used instead of this macro
434 when the node is a type). */
435 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
437 /* Value of expression is constant.
438 Always appears in all ..._CST nodes.
439 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
440 if the value is constant. */
441 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
443 /* Nonzero means permanent node;
444 node will continue to exist for the entire compiler run.
445 Otherwise it will be recycled at the end of the function. */
446 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
448 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
449 In FIELD_DECL nodes, means an unsigned bit field.
450 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
451 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
453 /* Nonzero in a VAR_DECL means assembler code has been written.
454 Nonzero in a FUNCTION_DECL means that the function has been compiled.
455 This is interesting in an inline function, since it might not need
456 to be compiled separately.
457 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
458 if the sdb debugging info for the type has been written.
459 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
460 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
462 /* Nonzero in a _DECL if the name is used in its scope.
463 Nonzero in an expr node means inhibit warning if value is unused.
464 In IDENTIFIER_NODEs, this means that some extern decl for this name
466 #define TREE_USED(NODE) ((NODE)->common.used_flag)
468 /* Nonzero for a tree node whose evaluation could result
469 in the raising of an exception. Not implemented yet. */
470 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
472 /* Used in classes in C++. */
473 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
474 /* Used in classes in C++.
475 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
476 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
478 /* These flags are available for each language front end to use internally. */
479 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
480 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
481 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
482 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
483 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
484 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
485 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
487 /* Define additional fields and accessors for nodes representing constants. */
489 /* In an INTEGER_CST node. These two together make a 2-word integer.
490 If the data type is signed, the value is sign-extended to 2 words
491 even though not all of them may really be in use.
492 In an unsigned constant shorter than 2 words, the extra bits are 0. */
493 #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low)
494 #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high)
496 #define INT_CST_LT(A, B) \
497 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
498 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
499 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
500 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
502 #define INT_CST_LT_UNSIGNED(A, B) \
503 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
504 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
505 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
506 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
507 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
508 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
512 char common[sizeof (struct tree_common)];
513 struct rtx_def *rtl; /* acts as link to register transfer language
515 HOST_WIDE_INT int_cst_low;
516 HOST_WIDE_INT int_cst_high;
519 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
520 and generally in all kinds of constants that could
521 be given labels (rather than being immediate). */
523 #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl)
525 /* In a REAL_CST node. */
526 /* We can represent a real value as either a `double' or a string.
527 Strings don't allow for any optimization, but they do allow
528 for cross-compilation. */
530 #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst)
536 char common[sizeof (struct tree_common)];
537 struct rtx_def *rtl; /* acts as link to register transfer language
539 REAL_VALUE_TYPE real_cst;
542 /* In a STRING_CST */
543 #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length)
544 #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer)
548 char common[sizeof (struct tree_common)];
549 struct rtx_def *rtl; /* acts as link to register transfer language
555 /* In a COMPLEX_CST node. */
556 #define TREE_REALPART(NODE) ((NODE)->complex.real)
557 #define TREE_IMAGPART(NODE) ((NODE)->complex.imag)
561 char common[sizeof (struct tree_common)];
562 struct rtx_def *rtl; /* acts as link to register transfer language
564 union tree_node *real;
565 union tree_node *imag;
568 /* Define fields and accessors for some special-purpose tree nodes. */
570 #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length)
571 #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer)
573 struct tree_identifier
575 char common[sizeof (struct tree_common)];
580 /* In a TREE_LIST node. */
581 #define TREE_PURPOSE(NODE) ((NODE)->list.purpose)
582 #define TREE_VALUE(NODE) ((NODE)->list.value)
586 char common[sizeof (struct tree_common)];
587 union tree_node *purpose;
588 union tree_node *value;
591 /* In a TREE_VEC node. */
592 #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length)
593 #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I])
594 #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length]))
598 char common[sizeof (struct tree_common)];
600 union tree_node *a[1];
603 /* Define fields and accessors for some nodes that represent expressions. */
605 /* In a SAVE_EXPR node. */
606 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
607 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
609 /* In a RTL_EXPR node. */
610 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0])
611 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1])
613 /* In a CALL_EXPR node. */
614 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
616 /* In a CONSTRUCTOR node. */
617 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
619 /* In ordinary expression nodes. */
620 #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I])
621 #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity)
625 char common[sizeof (struct tree_common)];
627 union tree_node *operands[1];
630 /* In a BLOCK node. */
631 #define BLOCK_VARS(NODE) ((NODE)->block.vars)
632 #define BLOCK_TYPE_TAGS(NODE) ((NODE)->block.type_tags)
633 #define BLOCK_SUBBLOCKS(NODE) ((NODE)->block.subblocks)
634 #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->block.supercontext)
635 /* Note: when changing this, make sure to find the places
636 that use chainon or nreverse. */
637 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
638 #define BLOCK_ABSTRACT_ORIGIN(NODE) ((NODE)->block.abstract_origin)
639 #define BLOCK_ABSTRACT(NODE) ((NODE)->block.abstract_flag)
640 #define BLOCK_END_NOTE(NODE) ((NODE)->block.end_note)
642 /* Nonzero means that this block is prepared to handle exceptions
643 listed in the BLOCK_VARS slot. */
644 #define BLOCK_HANDLER_BLOCK(NODE) ((NODE)->block.handler_block_flag)
648 char common[sizeof (struct tree_common)];
650 unsigned handler_block_flag : 1;
651 unsigned abstract_flag : 1;
653 union tree_node *vars;
654 union tree_node *type_tags;
655 union tree_node *subblocks;
656 union tree_node *supercontext;
657 union tree_node *abstract_origin;
658 struct rtx_def *end_note;
661 /* Define fields and accessors for nodes representing data types. */
663 /* See tree.def for documentation of the use of these fields.
664 Look at the documentation of the various ..._TYPE tree codes. */
666 #define TYPE_UID(NODE) ((NODE)->type.uid)
667 #define TYPE_SIZE(NODE) ((NODE)->type.size)
668 #define TYPE_MODE(NODE) ((NODE)->type.mode)
669 #define TYPE_VALUES(NODE) ((NODE)->type.values)
670 #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
671 #define TYPE_FIELDS(NODE) ((NODE)->type.values)
672 #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
673 #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
674 #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
675 #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
676 #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
677 #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
678 #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
679 #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
680 #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
681 #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
682 #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab.address)
683 #define TYPE_SYMTAB_POINTER(NODE) ((NODE)->type.symtab.pointer)
684 #define TYPE_NAME(NODE) ((NODE)->type.name)
685 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
686 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
687 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
688 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
689 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
690 #define TYPE_OBSTACK(NODE) ((NODE)->type.obstack)
691 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
693 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
695 #define TYPE_ATTRIBUTES(NODE) ((NODE)->type.attributes)
697 /* The alignment necessary for objects of this type.
698 The value is an int, measured in bits. */
699 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
701 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
703 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
704 has BLKmode only because it lacks the alignment requirement for
706 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
708 /* Nonzero in a type considered volatile as a whole. */
709 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
711 /* Means this type is const-qualified. */
712 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
714 /* These flags are available for each language front end to use internally. */
715 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
716 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
717 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
718 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
719 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
720 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
721 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
723 /* If set in an ARRAY_TYPE, indicates a string type (for languages
724 that distinguish string from array of char).
725 If set in a SET_TYPE, indicates a bitstring type. */
726 #define TYPE_STRING_FLAG(NODE) ((NODE)->type.string_flag)
728 /* If non-NULL, this is a upper bound of the size (in bytes) of an
729 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
730 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
732 /* Indicates that objects of this type must be initialized by calling a
733 function when they are created. */
734 #define TYPE_NEEDS_CONSTRUCTING(NODE) ((NODE)->type.needs_constructing_flag)
736 /* Indicates that objects of this type (a UNION_TYPE), should be passed
737 the same way that the first union alternative would be passed. */
738 #define TYPE_TRANSPARENT_UNION(NODE) ((NODE)->type.transparent_union_flag)
740 /* Indicated that objects of this type should be layed out in as
741 compact a way as possible. */
742 #define TYPE_PACKED(NODE) ((NODE)->type.packed_flag)
746 char common[sizeof (struct tree_common)];
747 union tree_node *values;
748 union tree_node *size;
749 union tree_node *attributes;
752 unsigned char precision;
753 #ifdef ONLY_INT_FIELDS
756 enum machine_mode mode : 8;
759 unsigned string_flag : 1;
760 unsigned no_force_blk_flag : 1;
761 unsigned needs_constructing_flag : 1;
762 unsigned transparent_union_flag : 1;
763 unsigned packed_flag : 1;
764 unsigned lang_flag_0 : 1;
765 unsigned lang_flag_1 : 1;
766 unsigned lang_flag_2 : 1;
767 unsigned lang_flag_3 : 1;
768 unsigned lang_flag_4 : 1;
769 unsigned lang_flag_5 : 1;
770 unsigned lang_flag_6 : 1;
771 /* room for 4 more bits */
774 union tree_node *pointer_to;
775 union tree_node *reference_to;
776 union {int address; char *pointer; } symtab;
777 union tree_node *name;
778 union tree_node *minval;
779 union tree_node *maxval;
780 union tree_node *next_variant;
781 union tree_node *main_variant;
782 union tree_node *binfo;
783 union tree_node *noncopied_parts;
784 union tree_node *context;
785 struct obstack *obstack;
786 /* Points to a structure whose details depend on the language in use. */
787 struct lang_type *lang_specific;
790 /* Define accessor macros for information about type inheritance
793 A "basetype" means a particular usage of a data type for inheritance
794 in another type. Each such basetype usage has its own "binfo"
795 object to describe it. The binfo object is a TREE_VEC node.
797 Inheritance is represented by the binfo nodes allocated for a
798 given type. For example, given types C and D, such that D is
799 inherited by C, 3 binfo nodes will be allocated: one for describing
800 the binfo properties of C, similarly one for D, and one for
801 describing the binfo properties of D as a base type for C.
802 Thus, given a pointer to class C, one can get a pointer to the binfo
803 of D acting as a basetype for C by looking at C's binfo's basetypes. */
805 /* The actual data type node being inherited in this basetype. */
806 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
808 /* The offset where this basetype appears in its containing type.
809 BINFO_OFFSET slot holds the offset (in bytes)
810 from the base of the complete object to the base of the part of the
811 object that is allocated on behalf of this `type'.
812 This is always 0 except when there is multiple inheritance. */
814 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
815 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
816 #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node)
818 /* The virtual function table belonging to this basetype. Virtual
819 function tables provide a mechanism for run-time method dispatching.
820 The entries of a virtual function table are language-dependent. */
822 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
823 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
825 /* The virtual functions in the virtual function table. This is
826 a TREE_LIST that is used as an initial approximation for building
827 a virtual function table for this basetype. */
828 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
829 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
831 /* A vector of additional binfos for the types inherited by this basetype.
833 If this basetype describes type D as inherited in C,
834 and if the basetypes of D are E anf F,
835 then this vector contains binfos for inheritance of E and F by C.
837 ??? This could probably be done by just allocating the
838 base types at the end of this TREE_VEC (instead of using
839 another TREE_VEC). This would simplify the calculation
840 of how many basetypes a given type had. */
841 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
842 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
844 /* For a BINFO record describing an inheritance, this yields a pointer
845 to the artificial FIELD_DECL node which contains the "virtual base
846 class pointer" for the given inheritance. */
848 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
850 /* Accessor macro to get to the Nth basetype of this basetype. */
851 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
852 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
854 /* Slot used to build a chain that represents a use of inheritance.
855 For example, if X is derived from Y, and Y is derived from Z,
856 then this field can be used to link the binfo node for X to
857 the binfo node for X's Y to represent the use of inheritance
858 from X to Y. Similarly, this slot of the binfo node for X's Y
859 can point to the Z from which Y is inherited (in X's inheritance
860 hierarchy). In this fashion, one can represent and traverse specific
861 uses of inheritance using the binfo nodes themselves (instead of
862 consing new space pointing to binfo nodes).
863 It is up to the language-dependent front-ends to maintain
864 this information as necessary. */
865 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
867 /* Define fields and accessors for nodes representing declared names. */
869 /* This is the name of the object as written by the user.
870 It is an IDENTIFIER_NODE. */
871 #define DECL_NAME(NODE) ((NODE)->decl.name)
872 /* This is the name of the object as the assembler will see it
873 (but before any translations made by ASM_OUTPUT_LABELREF).
874 Often this is the same as DECL_NAME.
875 It is an IDENTIFIER_NODE. */
876 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
877 /* Records the section name in a section attribute. Used to pass
878 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
879 #define DECL_SECTION_NAME(NODE) ((NODE)->decl.section_name)
880 /* For FIELD_DECLs, this is the
881 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
882 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
883 and CONST_DECL nodes, this points to the FUNCTION_DECL for the
884 containing function, or else yields NULL_TREE if the given decl has "file scope". */
885 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
886 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
887 /* In a DECL this is the field where configuration dependent machine
888 attributes are store */
889 #define DECL_MACHINE_ATTRIBUTES(NODE) ((NODE)->decl.machine_attributes)
890 /* In a FIELD_DECL, this is the field position, counting in bits,
891 of the bit closest to the beginning of the structure. */
892 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
893 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
894 if so, the type that was originally specified for it.
895 TREE_TYPE may have been modified (in finish_struct). */
896 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
897 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
898 /* VAR_DECL and PARM_DECL reserve the arguments slot
899 for language-specific uses. */
900 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
901 /* In FUNCTION_DECL, holds the decl for the return value. */
902 #define DECL_RESULT(NODE) ((NODE)->decl.result)
903 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
904 #define DECL_ORIGINAL_TYPE(NODE) ((NODE)->decl.result)
905 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
906 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
907 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
908 For a VAR_DECL, holds the initial value.
909 For a PARM_DECL, not used--default
910 values for parameters are encoded in the type of the function,
911 not in the PARM_DECL slot. */
912 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
913 /* For a PARM_DECL, records the data type used to pass the argument,
914 which may be different from the type seen in the program. */
915 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
916 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
917 if nonzero, indicates that the field occupies the type. */
918 #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial)
919 /* These two fields describe where in the source code the declaration was. */
920 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
921 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
922 /* Holds the size of the datum, as a tree expression.
923 Need not be constant. */
924 #define DECL_SIZE(NODE) ((NODE)->decl.size)
925 /* Holds the alignment required for the datum. */
926 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size.u)
927 /* Holds the machine mode corresponding to the declaration of a variable or
928 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
930 #define DECL_MODE(NODE) ((NODE)->decl.mode)
931 /* Holds the RTL expression for the value of a variable or function. If
932 PROMOTED_MODE is defined, the mode of this expression may not be same
933 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
934 to the variable's data type, while the mode
935 of DECL_RTL is the mode actually used to contain the data. */
936 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
937 /* For PARM_DECL, holds an RTL for the stack slot or register
938 where the data was actually passed. */
939 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
940 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
941 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
942 /* For FUNCTION_DECL, if it is inline,
943 holds the size of the stack frame, as an integer. */
944 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size.i)
945 /* For FUNCTION_DECL, if it is built-in,
946 this identifies which built-in operation it is. */
947 #define DECL_FUNCTION_CODE(NODE) ((NODE)->decl.frame_size.f)
948 #define DECL_SET_FUNCTION_CODE(NODE,VAL) ((NODE)->decl.frame_size.f = (VAL))
949 /* For a FIELD_DECL, holds the size of the member as an integer. */
950 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
952 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
953 Before the struct containing the FUNCTION_DECL is laid out,
954 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
955 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
956 function. When the class is laid out, this pointer is changed
957 to an INTEGER_CST node which is suitable for use as an index
958 into the virtual function table. */
959 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
960 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
961 which this FIELD_DECL is defined. This information is needed when
962 writing debugging information about vfield and vbase decls for C++. */
963 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
965 /* Every ..._DECL node gets a unique number. */
966 #define DECL_UID(NODE) ((NODE)->decl.uid)
968 /* For any sort of a ..._DECL node, this points to the original (abstract)
969 decl node which this decl is an instance of, or else it is NULL indicating
970 that this decl is not an instance of some other decl. */
971 #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin)
973 /* Nonzero for any sort of ..._DECL node means this decl node represents
974 an inline instance of some original (abstract) decl from an inline function;
975 suppress any warnings about shadowing some other variable. */
976 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
978 /* Nonzero if a _DECL means that the name of this decl should be ignored
979 for symbolic debug purposes. */
980 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
982 /* Nonzero for a given ..._DECL node means that this node represents an
983 "abstract instance" of the given declaration (e.g. in the original
984 declaration of an inline function). When generating symbolic debugging
985 information, we mustn't try to generate any address information for nodes
986 marked as "abstract instances" because we don't actually generate
987 any code or allocate any data space for such instances. */
988 #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag)
990 /* Nonzero if a _DECL means that no warnings should be generated just
991 because this decl is unused. */
992 #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag)
994 /* Nonzero for a given ..._DECL node means that this node should be
995 put in .common, if possible. If a DECL_INITIAL is given, and it
996 is not error_mark_node, then the decl cannot be put in .common. */
997 #define DECL_COMMON(NODE) ((NODE)->decl.common_flag)
999 /* Language-specific decl information. */
1000 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
1002 /* In a VAR_DECL or FUNCTION_DECL,
1003 nonzero means external reference:
1004 do not allocate storage, and refer to a definition elsewhere. */
1005 #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag)
1008 nonzero means the detail info about this type is not dumped into stabs.
1009 Instead it will generate cross reference ('x') of names.
1010 This uses the same flag as DECL_EXTERNAL. */
1011 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) ((NODE)->decl.external_flag)
1014 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1015 #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag)
1016 /* In LABEL_DECL nodes, nonzero means that an error message about
1017 jumping into such a binding contour has been printed for this label. */
1018 #define DECL_ERROR_ISSUED(NODE) ((NODE)->decl.regdecl_flag)
1019 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1020 #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag)
1021 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1022 static chain is not needed. */
1023 #define DECL_NO_STATIC_CHAIN(NODE) ((NODE)->decl.regdecl_flag)
1025 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1026 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1028 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1030 Also set in some languages for variables, etc., outside the normal
1031 lexical scope, such as class instance variables. */
1032 #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
1034 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1035 where it is called. */
1036 #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag)
1038 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1039 that is not specified by ansi C and that users are supposed to be allowed
1040 to redefine for any purpose whatever. */
1041 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1043 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1045 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
1046 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1047 contour that restored a stack level and which is now exited. */
1048 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
1049 /* In a FUNCTION_DECL, nonzero means a built in function. */
1050 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
1051 /* In a VAR_DECL that's static,
1052 nonzero if the space is in the text section. */
1053 #define DECL_IN_TEXT_SECTION(NODE) ((NODE)->decl.bit_field_flag)
1055 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1056 Used in FIELD_DECLs for vtable pointers.
1057 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1058 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
1060 /* Used to indicate that the linkage status of this DECL is not yet known,
1061 so it should not be output now. */
1062 #define DECL_DEFER_OUTPUT(NODE) ((NODE)->decl.defer_output)
1064 /* Used in PARM_DECLs whose type are unions to indicate that the
1065 argument should be passed in the same way that the first union
1066 alternative would be passed. */
1067 #define DECL_TRANSPARENT_UNION(NODE) ((NODE)->decl.transparent_union)
1069 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1070 at the beginning or end of execution. */
1071 #define DECL_STATIC_CONSTRUCTOR(NODE) ((NODE)->decl.static_ctor_flag)
1072 #define DECL_STATIC_DESTRUCTOR(NODE) ((NODE)->decl.static_dtor_flag)
1074 /* Used to indicate that this DECL represents a compiler-generated entity. */
1075 #define DECL_ARTIFICIAL(NODE) ((NODE)->decl.artificial_flag)
1077 /* Used to indicate that this DECL has weak linkage. */
1078 #define DECL_WEAK(NODE) ((NODE)->decl.weak_flag)
1080 /* Additional flags for language-specific uses. */
1081 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
1082 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
1083 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
1084 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
1085 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
1086 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
1087 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
1088 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
1092 char common[sizeof (struct tree_common)];
1095 union tree_node *size;
1097 #ifdef ONLY_INT_FIELDS
1100 enum machine_mode mode : 8;
1103 unsigned external_flag : 1;
1104 unsigned nonlocal_flag : 1;
1105 unsigned regdecl_flag : 1;
1106 unsigned inline_flag : 1;
1107 unsigned bit_field_flag : 1;
1108 unsigned virtual_flag : 1;
1109 unsigned ignored_flag : 1;
1110 unsigned abstract_flag : 1;
1112 unsigned in_system_header_flag : 1;
1113 unsigned common_flag : 1;
1114 unsigned defer_output : 1;
1115 unsigned transparent_union : 1;
1116 unsigned static_ctor_flag : 1;
1117 unsigned static_dtor_flag : 1;
1118 unsigned artificial_flag : 1;
1119 unsigned weak_flag : 1;
1120 /* room for no more */
1122 unsigned lang_flag_0 : 1;
1123 unsigned lang_flag_1 : 1;
1124 unsigned lang_flag_2 : 1;
1125 unsigned lang_flag_3 : 1;
1126 unsigned lang_flag_4 : 1;
1127 unsigned lang_flag_5 : 1;
1128 unsigned lang_flag_6 : 1;
1129 unsigned lang_flag_7 : 1;
1131 union tree_node *name;
1132 union tree_node *context;
1133 union tree_node *arguments;
1134 union tree_node *result;
1135 union tree_node *initial;
1136 union tree_node *abstract_origin;
1137 union tree_node *assembler_name;
1138 union tree_node *section_name;
1139 union tree_node *machine_attributes;
1140 struct rtx_def *rtl; /* acts as link to register transfer language
1142 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1143 If built-in, this is the code for which built-in function.
1144 For other kinds of decls, this is DECL_ALIGN. */
1148 enum built_in_function f;
1150 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1151 on the permanent obstack. For any other kind of decl, this is the
1157 union tree_node *vindex;
1158 /* Points to a structure whose details depend on the language in use. */
1159 struct lang_decl *lang_specific;
1162 /* Define the overall contents of a tree node.
1163 It may be any of the structures declared above
1164 for various types of node. */
1168 struct tree_common common;
1169 struct tree_int_cst int_cst;
1170 struct tree_real_cst real_cst;
1171 struct tree_string string;
1172 struct tree_complex complex;
1173 struct tree_identifier identifier;
1174 struct tree_decl decl;
1175 struct tree_type type;
1176 struct tree_list list;
1177 struct tree_vec vec;
1178 struct tree_exp exp;
1179 struct tree_block block;
1182 #include "gansidecl.h"
1184 #define NULL_TREE (tree) NULL
1186 /* The following functions accept a wide integer argument. Rather than
1187 having to cast on every function call, we use a macro instead, that is
1188 defined here and in rtl.h. */
1191 #define exact_log2(N) exact_log2_wide ((HOST_WIDE_INT) (N))
1192 #define floor_log2(N) floor_log2_wide ((HOST_WIDE_INT) (N))
1196 /* At present, don't prototype xrealloc, since all of the callers don't
1197 cast their pointers to char *, and all of the xrealloc's don't use
1199 extern char *xmalloc PROTO((size_t));
1200 extern char *xrealloc PROTO((void *, size_t));
1202 extern char *xmalloc ();
1203 extern char *xrealloc ();
1206 extern char *xstrdup PROTO((char *));
1208 extern char *oballoc PROTO((int));
1209 extern char *permalloc PROTO((int));
1210 extern char *savealloc PROTO((int));
1211 extern void free PROTO((void *));
1213 /* Lowest level primitive for allocating a node.
1214 The TREE_CODE is the only argument. Contents are initialized
1215 to zero except for a few of the common fields. */
1217 extern tree make_node PROTO((enum tree_code));
1219 /* Make a copy of a node, with all the same contents except
1220 for TREE_PERMANENT. (The copy is permanent
1221 iff nodes being made now are permanent.) */
1223 extern tree copy_node PROTO((tree));
1225 /* Make a copy of a chain of TREE_LIST nodes. */
1227 extern tree copy_list PROTO((tree));
1229 /* Make a TREE_VEC. */
1231 extern tree make_tree_vec PROTO((int));
1233 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1234 The name is supplied as a char *. */
1236 extern tree get_identifier PROTO((char *));
1238 /* Construct various types of nodes. */
1240 #define build_int_2(LO,HI) \
1241 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1243 extern tree build PVPROTO((enum tree_code, tree, ...));
1244 extern tree build_nt PVPROTO((enum tree_code, ...));
1245 extern tree build_parse_node PVPROTO((enum tree_code, ...));
1247 extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1248 extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1249 extern tree build_real_from_int_cst PROTO((tree, tree));
1250 extern tree build_complex PROTO((tree, tree));
1251 extern tree build_string PROTO((int, char *));
1252 extern tree build1 PROTO((enum tree_code, tree, tree));
1253 extern tree build_tree_list PROTO((tree, tree));
1254 extern tree build_decl_list PROTO((tree, tree));
1255 extern tree build_decl PROTO((enum tree_code, tree, tree));
1256 extern tree build_block PROTO((tree, tree, tree, tree, tree));
1258 /* Construct various nodes representing data types. */
1260 extern tree make_signed_type PROTO((int));
1261 extern tree make_unsigned_type PROTO((int));
1262 extern tree signed_or_unsigned_type PROTO((int, tree));
1263 extern void fixup_unsigned_type PROTO((tree));
1264 extern tree build_pointer_type PROTO((tree));
1265 extern tree build_reference_type PROTO((tree));
1266 extern tree build_index_type PROTO((tree));
1267 extern tree build_index_2_type PROTO((tree, tree));
1268 extern tree build_array_type PROTO((tree, tree));
1269 extern tree build_function_type PROTO((tree, tree));
1270 extern tree build_method_type PROTO((tree, tree));
1271 extern tree build_offset_type PROTO((tree, tree));
1272 extern tree build_complex_type PROTO((tree));
1273 extern tree array_type_nelts PROTO((tree));
1275 extern tree value_member PROTO((tree, tree));
1276 extern tree purpose_member PROTO((tree, tree));
1277 extern tree binfo_member PROTO((tree, tree));
1278 extern int attribute_hash_list PROTO((tree));
1279 extern int attribute_list_equal PROTO((tree, tree));
1280 extern int attribute_list_contained PROTO((tree, tree));
1281 extern int tree_int_cst_equal PROTO((tree, tree));
1282 extern int tree_int_cst_lt PROTO((tree, tree));
1283 extern int tree_int_cst_sgn PROTO((tree));
1284 extern int index_type_equal PROTO((tree, tree));
1286 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1287 put the prototype here. Rtl.h does declare the prototype if
1288 tree.h had been included. */
1290 extern tree make_tree ();
1292 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1295 Such modified types already made are recorded so that duplicates
1298 extern tree build_type_attribute_variant PROTO((tree, tree));
1299 extern tree build_decl_attribute_variant PROTO((tree, tree));
1301 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1303 extern int valid_machine_attribute PROTO((tree, tree, tree, tree));
1305 /* Given a tree node and a string, return non-zero if the tree node is
1306 a valid attribute name for the string. */
1308 extern int is_attribute_p PROTO((char *, tree));
1310 /* Given an attribute name and a list of attributes, return the list element
1311 of the attribute or NULL_TREE if not found. */
1313 extern tree lookup_attribute PROTO((char *, tree));
1315 /* Given two attributes lists, return a list of their union. */
1317 extern tree merge_attributes PROTO((tree, tree));
1319 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1320 for the same kind of data as TYPE describes.
1321 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1322 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1323 so that duplicate variants are never made.
1324 Only main variants should ever appear as types of expressions. */
1326 extern tree build_type_variant PROTO((tree, int, int));
1328 /* Make a copy of a type node. */
1330 extern tree build_type_copy PROTO((tree));
1332 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1333 TYPE_ALIGN and TYPE_MODE fields.
1334 If called more than once on one node, does nothing except
1335 for the first time. */
1337 extern void layout_type PROTO((tree));
1339 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1340 return a canonicalized ..._TYPE node, so that duplicates are not made.
1341 How the hash code is computed is up to the caller, as long as any two
1342 callers that could hash identical-looking type nodes agree. */
1344 extern tree type_hash_canon PROTO((int, tree));
1346 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1347 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1348 fields. Call this only once for any given decl node.
1350 Second argument is the boundary that this field can be assumed to
1351 be starting at (in bits). Zero means it can be assumed aligned
1352 on any boundary that may be needed. */
1354 extern void layout_decl PROTO((tree, unsigned));
1356 /* Return an expr equal to X but certainly not valid as an lvalue. */
1358 extern tree non_lvalue PROTO((tree));
1359 extern tree pedantic_non_lvalue PROTO((tree));
1361 extern tree convert PROTO((tree, tree));
1362 extern tree size_in_bytes PROTO((tree));
1363 extern int int_size_in_bytes PROTO((tree));
1364 extern tree size_binop PROTO((enum tree_code, tree, tree));
1365 extern tree size_int PROTO((unsigned HOST_WIDE_INT));
1366 extern tree round_up PROTO((tree, int));
1367 extern tree get_pending_sizes PROTO((void));
1368 extern void put_pending_sizes PROTO((tree));
1370 /* Type for sizes of data-type. */
1372 extern tree sizetype;
1374 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1375 extern int maximum_field_alignment;
1377 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1378 extern int set_alignment;
1380 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1381 by making the last node in X point to Y.
1382 Returns X, except if X is 0 returns Y. */
1384 extern tree chainon PROTO((tree, tree));
1386 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1388 extern tree tree_cons PROTO((tree, tree, tree));
1389 extern tree perm_tree_cons PROTO((tree, tree, tree));
1390 extern tree temp_tree_cons PROTO((tree, tree, tree));
1391 extern tree saveable_tree_cons PROTO((tree, tree, tree));
1392 extern tree decl_tree_cons PROTO((tree, tree, tree));
1394 /* Return the last tree node in a chain. */
1396 extern tree tree_last PROTO((tree));
1398 /* Reverse the order of elements in a chain, and return the new head. */
1400 extern tree nreverse PROTO((tree));
1402 /* Returns the length of a chain of nodes
1403 (number of chain pointers to follow before reaching a null pointer). */
1405 extern int list_length PROTO((tree));
1407 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1409 extern int integer_zerop PROTO((tree));
1411 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1413 extern int integer_onep PROTO((tree));
1415 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1416 all of whose significant bits are 1. */
1418 extern int integer_all_onesp PROTO((tree));
1420 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1421 exactly one bit 1. */
1423 extern int integer_pow2p PROTO((tree));
1425 /* staticp (tree x) is nonzero if X is a reference to data allocated
1426 at a fixed address in memory. */
1428 extern int staticp PROTO((tree));
1430 /* Gets an error if argument X is not an lvalue.
1431 Also returns 1 if X is an lvalue, 0 if not. */
1433 extern int lvalue_or_else PROTO((tree, char *));
1435 /* save_expr (EXP) returns an expression equivalent to EXP
1436 but it can be used multiple times within context CTX
1437 and only evaluate EXP once. */
1439 extern tree save_expr PROTO((tree));
1441 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1442 can be used multiple times and will evaluate EXP, in it's entirety
1445 extern tree unsave_expr PROTO((tree));
1447 /* unsave_expr_now (EXP) resets EXP in place, so that it can be
1450 extern tree unsave_expr_now PROTO((tree));
1452 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1453 or offset that depends on a field within a record.
1455 Note that we only allow such expressions within simple arithmetic
1458 extern int contains_placeholder_p PROTO((tree));
1460 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1461 return a tree with all occurrences of references to F in a
1462 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1463 contains only arithmetic expressions. */
1465 extern tree substitute_in_expr PROTO((tree, tree, tree));
1467 /* variable_size (EXP) is like save_expr (EXP) except that it
1468 is for the special case of something that is part of a
1469 variable size for a data type. It makes special arrangements
1470 to compute the value at the right time when the data type
1471 belongs to a function parameter. */
1473 extern tree variable_size PROTO((tree));
1475 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1476 but it can be used multiple times
1477 and only evaluate the subexpressions once. */
1479 extern tree stabilize_reference PROTO((tree));
1481 /* Subroutine of stabilize_reference; this is called for subtrees of
1482 references. Any expression with side-effects must be put in a SAVE_EXPR
1483 to ensure that it is only evaluated once. */
1485 extern tree stabilize_reference_1 PROTO((tree));
1487 /* Return EXP, stripped of any conversions to wider types
1488 in such a way that the result of converting to type FOR_TYPE
1489 is the same as if EXP were converted to FOR_TYPE.
1490 If FOR_TYPE is 0, it signifies EXP's type. */
1492 extern tree get_unwidened PROTO((tree, tree));
1494 /* Return OP or a simpler expression for a narrower value
1495 which can be sign-extended or zero-extended to give back OP.
1496 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1497 or 0 if the value should be sign-extended. */
1499 extern tree get_narrower PROTO((tree, int *));
1501 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1503 The definition of this resides in language-specific code
1504 as the repertoire of available types may vary. */
1506 extern tree type_for_mode PROTO((enum machine_mode, int));
1508 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1509 for an integer type with at least that precision.
1510 The definition of this resides in language-specific code
1511 as the repertoire of available types may vary. */
1513 extern tree type_for_size PROTO((unsigned, int));
1515 /* Given an integer type T, return a type like T but unsigned.
1516 If T is unsigned, the value is T.
1517 The definition of this resides in language-specific code
1518 as the repertoire of available types may vary. */
1520 extern tree unsigned_type PROTO((tree));
1522 /* Given an integer type T, return a type like T but signed.
1523 If T is signed, the value is T.
1524 The definition of this resides in language-specific code
1525 as the repertoire of available types may vary. */
1527 extern tree signed_type PROTO((tree));
1529 /* This function must be defined in the language-specific files.
1530 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1531 This is defined in a language-specific file. */
1533 extern tree maybe_build_cleanup PROTO((tree));
1535 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1536 look for nested component-refs or array-refs at constant positions
1537 and find the ultimate containing object, which is returned. */
1539 extern tree get_inner_reference PROTO((tree, int *, int *, tree *, enum machine_mode *, int *, int *));
1541 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1543 extern tree decl_function_context PROTO((tree));
1545 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1546 this _DECL with its context, or zero if none. */
1547 extern tree decl_type_context PROTO((tree));
1549 /* Given the FUNCTION_DECL for the current function,
1550 return zero if it is ok for this function to be inline.
1551 Otherwise return a warning message with a single %s
1552 for the function's name. */
1554 extern char *function_cannot_inline_p PROTO((tree));
1556 /* Return 1 if EXPR is the real constant zero. */
1557 extern int real_zerop PROTO((tree));
1559 /* Declare commonly used variables for tree structure. */
1561 /* An integer constant with value 0 */
1562 extern tree integer_zero_node;
1564 /* An integer constant with value 1 */
1565 extern tree integer_one_node;
1567 /* An integer constant with value 0 whose type is sizetype. */
1568 extern tree size_zero_node;
1570 /* An integer constant with value 1 whose type is sizetype. */
1571 extern tree size_one_node;
1573 /* A constant of type pointer-to-int and value 0 */
1574 extern tree null_pointer_node;
1576 /* A node of type ERROR_MARK. */
1577 extern tree error_mark_node;
1579 /* The type node for the void type. */
1580 extern tree void_type_node;
1582 /* The type node for the ordinary (signed) integer type. */
1583 extern tree integer_type_node;
1585 /* The type node for the unsigned integer type. */
1586 extern tree unsigned_type_node;
1588 /* The type node for the ordinary character type. */
1589 extern tree char_type_node;
1591 /* Points to the name of the input file from which the current input
1592 being parsed originally came (before it went into cpp). */
1593 extern char *input_filename;
1595 /* Current line number in input file. */
1598 /* Nonzero for -pedantic switch: warn about anything
1599 that standard C forbids. */
1600 extern int pedantic;
1602 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1603 Zero means allow extended lvalues. */
1605 extern int pedantic_lvalues;
1607 /* Nonzero means can safely call expand_expr now;
1608 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1610 extern int immediate_size_expand;
1612 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1614 extern tree current_function_decl;
1616 /* Nonzero if function being compiled can call setjmp. */
1618 extern int current_function_calls_setjmp;
1620 /* Nonzero if function being compiled can call longjmp. */
1622 extern int current_function_calls_longjmp;
1624 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1626 extern int all_types_permanent;
1628 /* Pointer to function to compute the name to use to print a declaration. */
1630 extern char *(*decl_printable_name) ();
1632 /* Pointer to function to finish handling an incomplete decl at the
1633 end of compilation. */
1635 extern void (*incomplete_decl_finalize_hook) ();
1638 extern char *perm_calloc PROTO((int, long));
1639 extern tree get_set_constructor_bits PROTO((tree, char *, int));
1640 extern tree get_set_constructor_bytes PROTO((tree,
1641 unsigned char *, int));
1645 extern void expand_fixups PROTO((struct rtx_def *));
1646 extern tree expand_start_stmt_expr PROTO((void));
1647 extern tree expand_end_stmt_expr PROTO((tree));
1648 extern void expand_expr_stmt PROTO((tree));
1649 extern int warn_if_unused_value PROTO((tree));
1650 extern void expand_decl_init PROTO((tree));
1651 extern void clear_last_expr PROTO((void));
1652 extern void expand_label PROTO((tree));
1653 extern void expand_goto PROTO((tree));
1654 extern void expand_asm PROTO((tree));
1655 extern void expand_start_cond PROTO((tree, int));
1656 extern void expand_end_cond PROTO((void));
1657 extern void expand_start_else PROTO((void));
1658 extern void expand_start_elseif PROTO((tree));
1659 extern struct nesting *expand_start_loop PROTO((int));
1660 extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
1661 extern void expand_loop_continue_here PROTO((void));
1662 extern void expand_end_loop PROTO((void));
1663 extern int expand_continue_loop PROTO((struct nesting *));
1664 extern int expand_exit_loop PROTO((struct nesting *));
1665 extern int expand_exit_loop_if_false PROTO((struct nesting *,
1667 extern int expand_exit_something PROTO((void));
1669 extern void expand_null_return PROTO((void));
1670 extern void expand_return PROTO((tree));
1671 extern void expand_start_bindings PROTO((int));
1672 extern void expand_end_bindings PROTO((tree, int, int));
1673 extern tree last_cleanup_this_contour PROTO((void));
1674 extern void expand_start_case PROTO((int, tree, tree,
1676 extern void expand_end_case PROTO((tree));
1677 extern int pushcase PROTO((tree,
1678 tree (*) (tree, tree),
1680 extern int pushcase_range PROTO((tree, tree,
1681 tree (*) (tree, tree),
1684 /* In fold-const.c */
1686 /* Fold constants as much as possible in an expression.
1687 Returns the simplified expression.
1688 Acts only on the top level of the expression;
1689 if the argument itself cannot be simplified, its
1690 subexpressions are not changed. */
1692 extern tree fold PROTO((tree));
1694 extern int force_fit_type PROTO((tree, int));
1695 extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1696 HOST_WIDE_INT, HOST_WIDE_INT,
1697 HOST_WIDE_INT *, HOST_WIDE_INT *));
1698 extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1699 HOST_WIDE_INT *, HOST_WIDE_INT *));
1700 extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1701 HOST_WIDE_INT, HOST_WIDE_INT,
1702 HOST_WIDE_INT *, HOST_WIDE_INT *));
1703 extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1704 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1705 HOST_WIDE_INT *, int));
1706 extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1708 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
1709 extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1710 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1712 extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1713 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1715 extern int operand_equal_p PROTO((tree, tree, int));
1716 extern tree invert_truthvalue PROTO((tree));
1718 /* The language front-end must define these functions. */
1720 /* Function of no arguments for initializing lexical scanning. */
1721 extern void init_lex PROTO((void));
1722 /* Function of no arguments for initializing the symbol table. */
1723 extern void init_decl_processing PROTO((void));
1725 /* Functions called with no arguments at the beginning and end or processing
1726 the input source file. */
1727 extern void lang_init PROTO((void));
1728 extern void lang_finish PROTO((void));
1730 /* Function to identify which front-end produced the output file. */
1731 extern char *lang_identify PROTO((void));
1733 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
1734 extern void copy_lang_decl PROTO((tree));
1736 /* Function called with no arguments to parse and compile the input. */
1737 extern int yyparse PROTO((void));
1738 /* Function called with option as argument
1739 to decode options starting with -f or -W or +.
1740 It should return nonzero if it handles the option. */
1741 extern int lang_decode_option PROTO((char *));
1743 /* Functions for processing symbol declarations. */
1744 /* Function to enter a new lexical scope.
1745 Takes one argument: always zero when called from outside the front end. */
1746 extern void pushlevel PROTO((int));
1747 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1748 Takes three arguments:
1749 KEEP -- nonzero if there were declarations in this scope.
1750 REVERSE -- reverse the order of decls before returning them.
1751 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1752 extern tree poplevel PROTO((int, int, int));
1753 /* Set the BLOCK node for the current scope level. */
1754 extern void set_block PROTO((tree));
1755 /* Function to add a decl to the current scope level.
1756 Takes one argument, a decl to add.
1757 Returns that decl, or, if the same symbol is already declared, may
1758 return a different decl for that name. */
1759 extern tree pushdecl PROTO((tree));
1760 /* Function to return the chain of decls so far in the current scope level. */
1761 extern tree getdecls PROTO((void));
1762 /* Function to return the chain of structure tags in the current scope level. */
1763 extern tree gettags PROTO((void));
1765 extern tree build_range_type PROTO((tree, tree, tree));
1767 /* Call when starting to parse a declaration:
1768 make expressions in the declaration last the length of the function.
1769 Returns an argument that should be passed to resume_momentary later. */
1770 extern int suspend_momentary PROTO((void));
1772 extern int allocation_temporary_p PROTO((void));
1774 /* Call when finished parsing a declaration:
1775 restore the treatment of node-allocation that was
1776 in effect before the suspension.
1777 YES should be the value previously returned by suspend_momentary. */
1778 extern void resume_momentary PROTO((int));
1780 /* Called after finishing a record, union or enumeral type. */
1781 extern void rest_of_type_compilation PROTO((tree, int));
1783 /* Save the current set of obstacks, but don't change them. */
1784 extern void push_obstacks_nochange PROTO((void));
1786 extern void permanent_allocation PROTO((int));
1788 extern void push_momentary PROTO((void));
1790 extern void clear_momentary PROTO((void));
1792 extern void pop_momentary PROTO((void));
1794 extern void end_temporary_allocation PROTO((void));
1796 /* Pop the obstack selection stack. */
1797 extern void pop_obstacks PROTO((void));