1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 93, 94, 95, 96, 1997 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_AGGREGATE_INCOMING_ADDRESS,
97 BUILT_IN_CALLER_RETURN_ADDRESS,
104 /* Various hooks for the DWARF 2 __throw routine. */
105 BUILT_IN_FP, BUILT_IN_SP,
106 BUILT_IN_UNWIND_INIT,
107 BUILT_IN_DWARF_FP_REGNUM,
108 BUILT_IN_DWARF_REG_SIZE,
109 BUILT_IN_FROB_RETURN_ADDR,
110 BUILT_IN_EXTRACT_RETURN_ADDR,
111 BUILT_IN_SET_RETURN_ADDR_REG,
113 BUILT_IN_SET_EH_REGS,
121 /* Upper bound on non-language-specific builtins. */
125 /* The definition of tree nodes fills the next several pages. */
127 /* A tree node can represent a data type, a variable, an expression
128 or a statement. Each node has a TREE_CODE which says what kind of
129 thing it represents. Some common codes are:
130 INTEGER_TYPE -- represents a type of integers.
131 ARRAY_TYPE -- represents a type of pointer.
132 VAR_DECL -- represents a declared variable.
133 INTEGER_CST -- represents a constant integer value.
134 PLUS_EXPR -- represents a sum (an expression).
136 As for the contents of a tree node: there are some fields
137 that all nodes share. Each TREE_CODE has various special-purpose
138 fields as well. The fields of a node are never accessed directly,
139 always through accessor macros. */
141 /* This type is used everywhere to refer to a tree node. */
143 typedef union tree_node *tree;
145 /* Every kind of tree node starts with this structure,
146 so all nodes have these fields.
148 See the accessor macros, defined below, for documentation of the fields. */
152 union tree_node *chain;
153 union tree_node *type;
154 #ifdef ONLY_INT_FIELDS
155 unsigned int code : 8;
157 enum tree_code code : 8;
160 unsigned side_effects_flag : 1;
161 unsigned constant_flag : 1;
162 unsigned permanent_flag : 1;
163 unsigned addressable_flag : 1;
164 unsigned volatile_flag : 1;
165 unsigned readonly_flag : 1;
166 unsigned unsigned_flag : 1;
167 unsigned asm_written_flag: 1;
169 unsigned used_flag : 1;
170 unsigned raises_flag : 1;
171 unsigned static_flag : 1;
172 unsigned public_flag : 1;
173 unsigned private_flag : 1;
174 unsigned protected_flag : 1;
176 unsigned lang_flag_0 : 1;
177 unsigned lang_flag_1 : 1;
178 unsigned lang_flag_2 : 1;
179 unsigned lang_flag_3 : 1;
180 unsigned lang_flag_4 : 1;
181 unsigned lang_flag_5 : 1;
182 unsigned lang_flag_6 : 1;
183 /* There is room for three more flags. */
186 /* The following table lists the uses of each of the above flags and
187 for which types of nodes they are defined. Note that expressions
193 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
199 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR
200 TREE_NO_UNUSED_WARNING in
201 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
203 TREE_LIST or TREE_VEC
204 TREE_CONSTANT_OVERFLOW in
205 INTEGER_CST, REAL_CST, COMPLEX_CST
206 TREE_SYMBOL_REFERENCED in
212 INTEGER_CST, REAL_CST, COMPLEX_CST
214 VAR_DECL or FUNCTION_DECL
216 TREE_LIST or TREE_VEC
221 TREE_LIST or TREE_VEC
223 ??? unspecified nodes
227 TREE_VIA_PROTECTED in
231 ??? unspecified nodes
240 TREE_THIS_VOLATILE in
248 VAR_DECL, PARM_DECL, FIELD_DECL, ..._REF
250 VAR_DECL if iterator (C)
259 permanent_flag: TREE_PERMANENT in all nodes
264 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
265 DECL_BUILT_IN_NONANSI in
273 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
279 expressions, IDENTIFIER_NODE
287 /* Define accessors for the fields that all tree nodes have
288 (though some fields are not used for all kinds of nodes). */
290 /* The tree-code says what kind of node it is.
291 Codes are defined in tree.def. */
292 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
293 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
295 /* In all nodes that are expressions, this is the data type of the expression.
296 In POINTER_TYPE nodes, this is the type that the pointer points to.
297 In ARRAY_TYPE nodes, this is the type of the elements. */
298 #define TREE_TYPE(NODE) ((NODE)->common.type)
300 /* Nodes are chained together for many purposes.
301 Types are chained together to record them for being output to the debugger
302 (see the function `chain_type').
303 Decls in the same scope are chained together to record the contents
305 Statement nodes for successive statements used to be chained together.
306 Often lists of things are represented by TREE_LIST nodes that
307 are chained together. */
309 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
311 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
312 that don't change the machine mode. */
314 #define STRIP_NOPS(EXP) \
315 while ((TREE_CODE (EXP) == NOP_EXPR \
316 || TREE_CODE (EXP) == CONVERT_EXPR \
317 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
318 && (TYPE_MODE (TREE_TYPE (EXP)) \
319 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
320 (EXP) = TREE_OPERAND (EXP, 0);
322 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
324 #define STRIP_TYPE_NOPS(EXP) \
325 while ((TREE_CODE (EXP) == NOP_EXPR \
326 || TREE_CODE (EXP) == CONVERT_EXPR \
327 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
328 && (TREE_TYPE (EXP) \
329 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
330 (EXP) = TREE_OPERAND (EXP, 0);
332 /* Nonzero if TYPE represents an integral type. Note that we do not
333 include COMPLEX types here. */
335 #define INTEGRAL_TYPE_P(TYPE) \
336 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
337 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
339 /* Nonzero if TYPE represents a floating-point type, including complex
340 floating-point types. */
342 #define FLOAT_TYPE_P(TYPE) \
343 (TREE_CODE (TYPE) == REAL_TYPE \
344 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
345 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
347 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
349 #define AGGREGATE_TYPE_P(TYPE) \
350 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
351 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
352 || TREE_CODE (TYPE) == SET_TYPE)
354 /* Nonzero if TYPE represents a pointer type. */
356 #define POINTER_TYPE_P(TYPE) \
357 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
359 /* Define many boolean fields that all tree nodes have. */
361 /* In VAR_DECL nodes, nonzero means address of this is needed.
362 So it cannot be in a register.
363 In a FUNCTION_DECL, nonzero means its address is needed.
364 So it must be compiled even if it is an inline function.
365 In CONSTRUCTOR nodes, it means object constructed must be in memory.
366 In LABEL_DECL nodes, it means a goto for this label has been seen
367 from a place outside all binding contours that restore stack levels.
368 In ..._TYPE nodes, it means that objects of this type must
369 be fully addressable. This means that pieces of this
370 object cannot go into register parameters, for example.
371 In IDENTIFIER_NODEs, this means that some extern decl for this name
372 had its address taken. That matters for inline functions. */
373 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
375 /* In a VAR_DECL, nonzero means allocate static storage.
376 In a FUNCTION_DECL, nonzero if function has been defined.
377 In a CONSTRUCTOR, nonzero means allocate static storage. */
378 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
380 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
381 made implicitly and should not lead to an "unused value" warning. */
382 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
384 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
385 chain is via a `virtual' declaration. */
386 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
388 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
389 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
390 requires a diagnostic when overflows occur in constant expressions. */
391 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
393 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
394 this string as an argument. */
395 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
397 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
398 overflow in folding, and no warning has been issued for this subexpression.
399 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
400 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
402 /* In a VAR_DECL or FUNCTION_DECL,
403 nonzero means name is to be accessible from outside this module.
404 In an identifier node, nonzero means an external declaration
405 accessible from outside this module was previously seen
406 for this name in an inner scope. */
407 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
409 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
410 base class is via a `public' declaration, which preserves public
411 fields from the base class as public. */
412 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
414 /* Ditto, for `private' declarations. */
415 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
417 /* Nonzero for TREE_LIST node means that the path to the
418 base class is via a `protected' declaration, which preserves
419 protected fields from the base class as protected.
421 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
423 /* In any expression, nonzero means it has side effects or reevaluation
424 of the whole expression could produce a different value.
425 This is set if any subexpression is a function call, a side effect
426 or a reference to a volatile variable.
427 In a ..._DECL, this is set only if the declaration said `volatile'. */
428 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
430 /* Nonzero means this expression is volatile in the C sense:
431 its address should be of type `volatile WHATEVER *'.
432 In other words, the declared item is volatile qualified.
433 This is used in _DECL nodes and _REF nodes.
435 In a ..._TYPE node, means this type is volatile-qualified.
436 But use TYPE_VOLATILE instead of this macro when the node is a type,
437 because eventually we may make that a different bit.
439 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
440 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
442 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
443 nonzero means it may not be the lhs of an assignment.
444 In a ..._TYPE node, means this type is const-qualified
445 (but the macro TYPE_READONLY should be used instead of this macro
446 when the node is a type). */
447 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
449 /* Value of expression is constant.
450 Always appears in all ..._CST nodes.
451 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
452 if the value is constant. */
453 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
455 /* Nonzero means permanent node;
456 node will continue to exist for the entire compiler run.
457 Otherwise it will be recycled at the end of the function. */
458 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
460 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
461 In FIELD_DECL nodes, means an unsigned bit field.
462 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
463 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
465 /* Nonzero in a VAR_DECL means assembler code has been written.
466 Nonzero in a FUNCTION_DECL means that the function has been compiled.
467 This is interesting in an inline function, since it might not need
468 to be compiled separately.
469 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
470 if the sdb debugging info for the type has been written.
471 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
472 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
474 /* Nonzero in a _DECL if the name is used in its scope.
475 Nonzero in an expr node means inhibit warning if value is unused.
476 In IDENTIFIER_NODEs, this means that some extern decl for this name
478 #define TREE_USED(NODE) ((NODE)->common.used_flag)
480 /* Nonzero for a tree node whose evaluation could result
481 in the raising of an exception. Not implemented yet. */
482 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
484 /* Used in classes in C++. */
485 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
486 /* Used in classes in C++.
487 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
488 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
490 /* These flags are available for each language front end to use internally. */
491 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
492 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
493 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
494 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
495 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
496 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
497 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
499 /* Define additional fields and accessors for nodes representing constants. */
501 /* In an INTEGER_CST node. These two together make a 2-word integer.
502 If the data type is signed, the value is sign-extended to 2 words
503 even though not all of them may really be in use.
504 In an unsigned constant shorter than 2 words, the extra bits are 0. */
505 #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low)
506 #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high)
508 #define INT_CST_LT(A, B) \
509 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
510 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
511 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
512 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
514 #define INT_CST_LT_UNSIGNED(A, B) \
515 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
516 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
517 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
518 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
519 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
520 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
524 char common[sizeof (struct tree_common)];
525 struct rtx_def *rtl; /* acts as link to register transfer language
527 HOST_WIDE_INT int_cst_low;
528 HOST_WIDE_INT int_cst_high;
531 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
532 and generally in all kinds of constants that could
533 be given labels (rather than being immediate). */
535 #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl)
537 /* In a REAL_CST node. */
538 /* We can represent a real value as either a `double' or a string.
539 Strings don't allow for any optimization, but they do allow
540 for cross-compilation. */
542 #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst)
548 char common[sizeof (struct tree_common)];
549 struct rtx_def *rtl; /* acts as link to register transfer language
551 REAL_VALUE_TYPE real_cst;
554 /* In a STRING_CST */
555 #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length)
556 #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer)
560 char common[sizeof (struct tree_common)];
561 struct rtx_def *rtl; /* acts as link to register transfer language
567 /* In a COMPLEX_CST node. */
568 #define TREE_REALPART(NODE) ((NODE)->complex.real)
569 #define TREE_IMAGPART(NODE) ((NODE)->complex.imag)
573 char common[sizeof (struct tree_common)];
574 struct rtx_def *rtl; /* acts as link to register transfer language
576 union tree_node *real;
577 union tree_node *imag;
580 /* Define fields and accessors for some special-purpose tree nodes. */
582 #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length)
583 #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer)
585 struct tree_identifier
587 char common[sizeof (struct tree_common)];
592 /* In a TREE_LIST node. */
593 #define TREE_PURPOSE(NODE) ((NODE)->list.purpose)
594 #define TREE_VALUE(NODE) ((NODE)->list.value)
598 char common[sizeof (struct tree_common)];
599 union tree_node *purpose;
600 union tree_node *value;
603 /* In a TREE_VEC node. */
604 #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length)
605 #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I])
606 #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length]))
610 char common[sizeof (struct tree_common)];
612 union tree_node *a[1];
615 /* Define fields and accessors for some nodes that represent expressions. */
617 /* In a SAVE_EXPR node. */
618 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
619 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
621 /* In a RTL_EXPR node. */
622 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0])
623 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1])
625 /* In a CALL_EXPR node. */
626 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
628 /* In a CONSTRUCTOR node. */
629 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
631 /* In ordinary expression nodes. */
632 #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I])
633 #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity)
637 char common[sizeof (struct tree_common)];
639 union tree_node *operands[1];
642 /* In a BLOCK node. */
643 #define BLOCK_VARS(NODE) ((NODE)->block.vars)
644 #define BLOCK_TYPE_TAGS(NODE) ((NODE)->block.type_tags)
645 #define BLOCK_SUBBLOCKS(NODE) ((NODE)->block.subblocks)
646 #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->block.supercontext)
647 /* Note: when changing this, make sure to find the places
648 that use chainon or nreverse. */
649 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
650 #define BLOCK_ABSTRACT_ORIGIN(NODE) ((NODE)->block.abstract_origin)
651 #define BLOCK_ABSTRACT(NODE) ((NODE)->block.abstract_flag)
652 #define BLOCK_END_NOTE(NODE) ((NODE)->block.end_note)
654 /* Nonzero means that this block is prepared to handle exceptions
655 listed in the BLOCK_VARS slot. */
656 #define BLOCK_HANDLER_BLOCK(NODE) ((NODE)->block.handler_block_flag)
660 char common[sizeof (struct tree_common)];
662 unsigned handler_block_flag : 1;
663 unsigned abstract_flag : 1;
665 union tree_node *vars;
666 union tree_node *type_tags;
667 union tree_node *subblocks;
668 union tree_node *supercontext;
669 union tree_node *abstract_origin;
670 struct rtx_def *end_note;
673 /* Define fields and accessors for nodes representing data types. */
675 /* See tree.def for documentation of the use of these fields.
676 Look at the documentation of the various ..._TYPE tree codes. */
678 #define TYPE_UID(NODE) ((NODE)->type.uid)
679 #define TYPE_SIZE(NODE) ((NODE)->type.size)
680 #define TYPE_MODE(NODE) ((NODE)->type.mode)
681 #define TYPE_VALUES(NODE) ((NODE)->type.values)
682 #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
683 #define TYPE_FIELDS(NODE) ((NODE)->type.values)
684 #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
685 #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
686 #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
687 #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
688 #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
689 #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
690 #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
691 #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
692 #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
693 #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
694 #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab.address)
695 #define TYPE_SYMTAB_POINTER(NODE) ((NODE)->type.symtab.pointer)
696 #define TYPE_NAME(NODE) ((NODE)->type.name)
697 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
698 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
699 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
700 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
701 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
702 #define TYPE_OBSTACK(NODE) ((NODE)->type.obstack)
703 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
705 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
707 #define TYPE_ATTRIBUTES(NODE) ((NODE)->type.attributes)
709 /* The alignment necessary for objects of this type.
710 The value is an int, measured in bits. */
711 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
713 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
715 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
716 has BLKmode only because it lacks the alignment requirement for
718 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
720 /* Nonzero in a type considered volatile as a whole. */
721 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
723 /* Means this type is const-qualified. */
724 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
726 /* These flags are available for each language front end to use internally. */
727 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
728 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
729 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
730 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
731 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
732 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
733 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
735 /* If set in an ARRAY_TYPE, indicates a string type (for languages
736 that distinguish string from array of char).
737 If set in a SET_TYPE, indicates a bitstring type. */
738 #define TYPE_STRING_FLAG(NODE) ((NODE)->type.string_flag)
740 /* If non-NULL, this is a upper bound of the size (in bytes) of an
741 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
742 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
744 /* Indicates that objects of this type must be initialized by calling a
745 function when they are created. */
746 #define TYPE_NEEDS_CONSTRUCTING(NODE) ((NODE)->type.needs_constructing_flag)
748 /* Indicates that objects of this type (a UNION_TYPE), should be passed
749 the same way that the first union alternative would be passed. */
750 #define TYPE_TRANSPARENT_UNION(NODE) ((NODE)->type.transparent_union_flag)
752 /* Indicated that objects of this type should be layed out in as
753 compact a way as possible. */
754 #define TYPE_PACKED(NODE) ((NODE)->type.packed_flag)
758 char common[sizeof (struct tree_common)];
759 union tree_node *values;
760 union tree_node *size;
761 union tree_node *attributes;
764 unsigned char precision;
765 #ifdef ONLY_INT_FIELDS
768 enum machine_mode mode : 8;
771 unsigned string_flag : 1;
772 unsigned no_force_blk_flag : 1;
773 unsigned needs_constructing_flag : 1;
774 unsigned transparent_union_flag : 1;
775 unsigned packed_flag : 1;
776 unsigned lang_flag_0 : 1;
777 unsigned lang_flag_1 : 1;
778 unsigned lang_flag_2 : 1;
779 unsigned lang_flag_3 : 1;
780 unsigned lang_flag_4 : 1;
781 unsigned lang_flag_5 : 1;
782 unsigned lang_flag_6 : 1;
783 /* room for 4 more bits */
786 union tree_node *pointer_to;
787 union tree_node *reference_to;
788 union {int address; char *pointer; } symtab;
789 union tree_node *name;
790 union tree_node *minval;
791 union tree_node *maxval;
792 union tree_node *next_variant;
793 union tree_node *main_variant;
794 union tree_node *binfo;
795 union tree_node *noncopied_parts;
796 union tree_node *context;
797 struct obstack *obstack;
798 /* Points to a structure whose details depend on the language in use. */
799 struct lang_type *lang_specific;
802 /* Define accessor macros for information about type inheritance
805 A "basetype" means a particular usage of a data type for inheritance
806 in another type. Each such basetype usage has its own "binfo"
807 object to describe it. The binfo object is a TREE_VEC node.
809 Inheritance is represented by the binfo nodes allocated for a
810 given type. For example, given types C and D, such that D is
811 inherited by C, 3 binfo nodes will be allocated: one for describing
812 the binfo properties of C, similarly one for D, and one for
813 describing the binfo properties of D as a base type for C.
814 Thus, given a pointer to class C, one can get a pointer to the binfo
815 of D acting as a basetype for C by looking at C's binfo's basetypes. */
817 /* The actual data type node being inherited in this basetype. */
818 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
820 /* The offset where this basetype appears in its containing type.
821 BINFO_OFFSET slot holds the offset (in bytes)
822 from the base of the complete object to the base of the part of the
823 object that is allocated on behalf of this `type'.
824 This is always 0 except when there is multiple inheritance. */
826 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
827 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
828 #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node)
830 /* The virtual function table belonging to this basetype. Virtual
831 function tables provide a mechanism for run-time method dispatching.
832 The entries of a virtual function table are language-dependent. */
834 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
835 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
837 /* The virtual functions in the virtual function table. This is
838 a TREE_LIST that is used as an initial approximation for building
839 a virtual function table for this basetype. */
840 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
841 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
843 /* A vector of additional binfos for the types inherited by this basetype.
845 If this basetype describes type D as inherited in C,
846 and if the basetypes of D are E anf F,
847 then this vector contains binfos for inheritance of E and F by C.
849 ??? This could probably be done by just allocating the
850 base types at the end of this TREE_VEC (instead of using
851 another TREE_VEC). This would simplify the calculation
852 of how many basetypes a given type had. */
853 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
854 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
856 /* For a BINFO record describing an inheritance, this yields a pointer
857 to the artificial FIELD_DECL node which contains the "virtual base
858 class pointer" for the given inheritance. */
860 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
862 /* Accessor macro to get to the Nth basetype of this basetype. */
863 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
864 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
866 /* Slot used to build a chain that represents a use of inheritance.
867 For example, if X is derived from Y, and Y is derived from Z,
868 then this field can be used to link the binfo node for X to
869 the binfo node for X's Y to represent the use of inheritance
870 from X to Y. Similarly, this slot of the binfo node for X's Y
871 can point to the Z from which Y is inherited (in X's inheritance
872 hierarchy). In this fashion, one can represent and traverse specific
873 uses of inheritance using the binfo nodes themselves (instead of
874 consing new space pointing to binfo nodes).
875 It is up to the language-dependent front-ends to maintain
876 this information as necessary. */
877 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
879 /* Define fields and accessors for nodes representing declared names. */
881 /* This is the name of the object as written by the user.
882 It is an IDENTIFIER_NODE. */
883 #define DECL_NAME(NODE) ((NODE)->decl.name)
884 /* This is the name of the object as the assembler will see it
885 (but before any translations made by ASM_OUTPUT_LABELREF).
886 Often this is the same as DECL_NAME.
887 It is an IDENTIFIER_NODE. */
888 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
889 /* Records the section name in a section attribute. Used to pass
890 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
891 #define DECL_SECTION_NAME(NODE) ((NODE)->decl.section_name)
892 /* For FIELD_DECLs, this is the
893 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
894 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
895 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
896 containing function, the RECORD_TYPE or UNION_TYPE for the containing
897 type, or NULL_TREE if the given decl has "file scope". */
898 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
899 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
900 /* In a DECL this is the field where configuration dependent machine
901 attributes are store */
902 #define DECL_MACHINE_ATTRIBUTES(NODE) ((NODE)->decl.machine_attributes)
903 /* In a FIELD_DECL, this is the field position, counting in bits,
904 of the bit closest to the beginning of the structure. */
905 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
906 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
907 if so, the type that was originally specified for it.
908 TREE_TYPE may have been modified (in finish_struct). */
909 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
910 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
911 /* VAR_DECL and PARM_DECL reserve the arguments slot
912 for language-specific uses. */
913 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
914 /* In FUNCTION_DECL, holds the decl for the return value. */
915 #define DECL_RESULT(NODE) ((NODE)->decl.result)
916 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
917 #define DECL_ORIGINAL_TYPE(NODE) ((NODE)->decl.result)
918 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
919 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
920 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
921 For a VAR_DECL, holds the initial value.
922 For a PARM_DECL, not used--default
923 values for parameters are encoded in the type of the function,
924 not in the PARM_DECL slot. */
925 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
926 /* For a PARM_DECL, records the data type used to pass the argument,
927 which may be different from the type seen in the program. */
928 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
929 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
930 if nonzero, indicates that the field occupies the type. */
931 #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial)
932 /* These two fields describe where in the source code the declaration was. */
933 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
934 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
935 /* Holds the size of the datum, as a tree expression.
936 Need not be constant. */
937 #define DECL_SIZE(NODE) ((NODE)->decl.size)
938 /* Holds the alignment required for the datum. */
939 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size.u)
940 /* Holds the machine mode corresponding to the declaration of a variable or
941 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
943 #define DECL_MODE(NODE) ((NODE)->decl.mode)
944 /* Holds the RTL expression for the value of a variable or function. If
945 PROMOTED_MODE is defined, the mode of this expression may not be same
946 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
947 to the variable's data type, while the mode
948 of DECL_RTL is the mode actually used to contain the data. */
949 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
950 /* For PARM_DECL, holds an RTL for the stack slot or register
951 where the data was actually passed. */
952 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
953 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
954 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
955 /* For FUNCTION_DECL, if it is inline,
956 holds the size of the stack frame, as an integer. */
957 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size.i)
958 /* For FUNCTION_DECL, if it is built-in,
959 this identifies which built-in operation it is. */
960 #define DECL_FUNCTION_CODE(NODE) ((NODE)->decl.frame_size.f)
961 #define DECL_SET_FUNCTION_CODE(NODE,VAL) ((NODE)->decl.frame_size.f = (VAL))
962 /* For a FIELD_DECL, holds the size of the member as an integer. */
963 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
965 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
966 Before the struct containing the FUNCTION_DECL is laid out,
967 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
968 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
969 function. When the class is laid out, this pointer is changed
970 to an INTEGER_CST node which is suitable for use as an index
971 into the virtual function table. */
972 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
973 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
974 which this FIELD_DECL is defined. This information is needed when
975 writing debugging information about vfield and vbase decls for C++. */
976 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
978 /* Every ..._DECL node gets a unique number. */
979 #define DECL_UID(NODE) ((NODE)->decl.uid)
981 /* For any sort of a ..._DECL node, this points to the original (abstract)
982 decl node which this decl is an instance of, or else it is NULL indicating
983 that this decl is not an instance of some other decl. For example,
984 in a nested declaration of an inline function, this points back to the
986 #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin)
988 /* Nonzero for any sort of ..._DECL node means this decl node represents
989 an inline instance of some original (abstract) decl from an inline function;
990 suppress any warnings about shadowing some other variable. */
991 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
993 /* Nonzero if a _DECL means that the name of this decl should be ignored
994 for symbolic debug purposes. */
995 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
997 /* Nonzero for a given ..._DECL node means that this node represents an
998 "abstract instance" of the given declaration (e.g. in the original
999 declaration of an inline function). When generating symbolic debugging
1000 information, we mustn't try to generate any address information for nodes
1001 marked as "abstract instances" because we don't actually generate
1002 any code or allocate any data space for such instances. */
1003 #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag)
1005 /* Nonzero if a _DECL means that no warnings should be generated just
1006 because this decl is unused. */
1007 #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag)
1009 /* Nonzero for a given ..._DECL node means that this node should be
1010 put in .common, if possible. If a DECL_INITIAL is given, and it
1011 is not error_mark_node, then the decl cannot be put in .common. */
1012 #define DECL_COMMON(NODE) ((NODE)->decl.common_flag)
1014 /* Language-specific decl information. */
1015 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
1017 /* In a VAR_DECL or FUNCTION_DECL,
1018 nonzero means external reference:
1019 do not allocate storage, and refer to a definition elsewhere. */
1020 #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag)
1023 nonzero means the detail info about this type is not dumped into stabs.
1024 Instead it will generate cross reference ('x') of names.
1025 This uses the same flag as DECL_EXTERNAL. */
1026 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) ((NODE)->decl.external_flag)
1029 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1030 #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag)
1031 /* In LABEL_DECL nodes, nonzero means that an error message about
1032 jumping into such a binding contour has been printed for this label. */
1033 #define DECL_ERROR_ISSUED(NODE) ((NODE)->decl.regdecl_flag)
1034 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1035 #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag)
1036 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1037 static chain is not needed. */
1038 #define DECL_NO_STATIC_CHAIN(NODE) ((NODE)->decl.regdecl_flag)
1040 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1041 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1043 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1045 Also set in some languages for variables, etc., outside the normal
1046 lexical scope, such as class instance variables. */
1047 #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
1049 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1050 where it is called. */
1051 #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag)
1053 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1054 that is not specified by ansi C and that users are supposed to be allowed
1055 to redefine for any purpose whatever. */
1056 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1058 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1060 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
1061 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1062 contour that restored a stack level and which is now exited. */
1063 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
1064 /* In a FUNCTION_DECL, nonzero means a built in function. */
1065 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
1066 /* In a VAR_DECL that's static,
1067 nonzero if the space is in the text section. */
1068 #define DECL_IN_TEXT_SECTION(NODE) ((NODE)->decl.bit_field_flag)
1070 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1071 Used in FIELD_DECLs for vtable pointers.
1072 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1073 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
1075 /* Used to indicate that the linkage status of this DECL is not yet known,
1076 so it should not be output now. */
1077 #define DECL_DEFER_OUTPUT(NODE) ((NODE)->decl.defer_output)
1079 /* Used in PARM_DECLs whose type are unions to indicate that the
1080 argument should be passed in the same way that the first union
1081 alternative would be passed. */
1082 #define DECL_TRANSPARENT_UNION(NODE) ((NODE)->decl.transparent_union)
1084 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1085 at the beginning or end of execution. */
1086 #define DECL_STATIC_CONSTRUCTOR(NODE) ((NODE)->decl.static_ctor_flag)
1087 #define DECL_STATIC_DESTRUCTOR(NODE) ((NODE)->decl.static_dtor_flag)
1089 /* Used to indicate that this DECL represents a compiler-generated entity. */
1090 #define DECL_ARTIFICIAL(NODE) ((NODE)->decl.artificial_flag)
1092 /* Used to indicate that this DECL has weak linkage. */
1093 #define DECL_WEAK(NODE) ((NODE)->decl.weak_flag)
1095 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1096 multiple translation units should be merged. */
1097 #define DECL_ONE_ONLY(NODE) ((NODE)->decl.transparent_union)
1099 /* Additional flags for language-specific uses. */
1100 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
1101 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
1102 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
1103 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
1104 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
1105 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
1106 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
1107 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
1111 char common[sizeof (struct tree_common)];
1115 union tree_node *size;
1116 #ifdef ONLY_INT_FIELDS
1119 enum machine_mode mode : 8;
1122 unsigned external_flag : 1;
1123 unsigned nonlocal_flag : 1;
1124 unsigned regdecl_flag : 1;
1125 unsigned inline_flag : 1;
1126 unsigned bit_field_flag : 1;
1127 unsigned virtual_flag : 1;
1128 unsigned ignored_flag : 1;
1129 unsigned abstract_flag : 1;
1131 unsigned in_system_header_flag : 1;
1132 unsigned common_flag : 1;
1133 unsigned defer_output : 1;
1134 unsigned transparent_union : 1;
1135 unsigned static_ctor_flag : 1;
1136 unsigned static_dtor_flag : 1;
1137 unsigned artificial_flag : 1;
1138 unsigned weak_flag : 1;
1139 /* room for no more */
1141 unsigned lang_flag_0 : 1;
1142 unsigned lang_flag_1 : 1;
1143 unsigned lang_flag_2 : 1;
1144 unsigned lang_flag_3 : 1;
1145 unsigned lang_flag_4 : 1;
1146 unsigned lang_flag_5 : 1;
1147 unsigned lang_flag_6 : 1;
1148 unsigned lang_flag_7 : 1;
1150 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1151 If built-in, this is the code for which built-in function.
1152 For other kinds of decls, this is DECL_ALIGN. */
1156 enum built_in_function f;
1159 union tree_node *name;
1160 union tree_node *context;
1161 union tree_node *arguments;
1162 union tree_node *result;
1163 union tree_node *initial;
1164 union tree_node *abstract_origin;
1165 union tree_node *assembler_name;
1166 union tree_node *section_name;
1167 union tree_node *machine_attributes;
1168 struct rtx_def *rtl; /* acts as link to register transfer language
1170 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1171 on the permanent obstack. For any other kind of decl, this is the
1177 union tree_node *vindex;
1178 /* Points to a structure whose details depend on the language in use. */
1179 struct lang_decl *lang_specific;
1182 /* Define the overall contents of a tree node.
1183 It may be any of the structures declared above
1184 for various types of node. */
1188 struct tree_common common;
1189 struct tree_int_cst int_cst;
1190 struct tree_real_cst real_cst;
1191 struct tree_string string;
1192 struct tree_complex complex;
1193 struct tree_identifier identifier;
1194 struct tree_decl decl;
1195 struct tree_type type;
1196 struct tree_list list;
1197 struct tree_vec vec;
1198 struct tree_exp exp;
1199 struct tree_block block;
1202 #include "gansidecl.h"
1204 #define NULL_TREE (tree) NULL
1206 /* The following functions accept a wide integer argument. Rather than
1207 having to cast on every function call, we use a macro instead, that is
1208 defined here and in rtl.h. */
1211 #define exact_log2(N) exact_log2_wide ((HOST_WIDE_INT) (N))
1212 #define floor_log2(N) floor_log2_wide ((HOST_WIDE_INT) (N))
1216 /* At present, don't prototype xrealloc, since all of the callers don't
1217 cast their pointers to char *, and all of the xrealloc's don't use
1219 extern char *xmalloc PROTO((size_t));
1220 extern char *xrealloc PROTO((void *, size_t));
1222 extern char *xmalloc ();
1223 extern char *xrealloc ();
1226 extern char *xstrdup PROTO((char *));
1228 extern char *oballoc PROTO((int));
1229 extern char *permalloc PROTO((int));
1230 extern char *savealloc PROTO((int));
1232 /* Lowest level primitive for allocating a node.
1233 The TREE_CODE is the only argument. Contents are initialized
1234 to zero except for a few of the common fields. */
1236 extern tree make_node PROTO((enum tree_code));
1238 /* Make a copy of a node, with all the same contents except
1239 for TREE_PERMANENT. (The copy is permanent
1240 iff nodes being made now are permanent.) */
1242 extern tree copy_node PROTO((tree));
1244 /* Make a copy of a chain of TREE_LIST nodes. */
1246 extern tree copy_list PROTO((tree));
1248 /* Make a TREE_VEC. */
1250 extern tree make_tree_vec PROTO((int));
1252 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1253 The name is supplied as a char *. */
1255 extern tree get_identifier PROTO((char *));
1257 /* If an identifier with the name TEXT (a null-terminated string) has
1258 previously been referred to, return that node; otherwise return
1261 extern tree maybe_get_identifier PROTO((char *));
1263 /* Construct various types of nodes. */
1265 #define build_int_2(LO,HI) \
1266 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1268 extern tree build PVPROTO((enum tree_code, tree, ...));
1269 extern tree build_nt PVPROTO((enum tree_code, ...));
1270 extern tree build_parse_node PVPROTO((enum tree_code, ...));
1272 extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1273 extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1274 extern tree build_real_from_int_cst PROTO((tree, tree));
1275 extern tree build_complex PROTO((tree, tree, tree));
1276 extern tree build_string PROTO((int, char *));
1277 extern tree build1 PROTO((enum tree_code, tree, tree));
1278 extern tree build_tree_list PROTO((tree, tree));
1279 extern tree build_decl_list PROTO((tree, tree));
1280 extern tree build_decl PROTO((enum tree_code, tree, tree));
1281 extern tree build_block PROTO((tree, tree, tree, tree, tree));
1283 /* Construct various nodes representing data types. */
1285 extern tree make_signed_type PROTO((int));
1286 extern tree make_unsigned_type PROTO((int));
1287 extern tree signed_or_unsigned_type PROTO((int, tree));
1288 extern void fixup_unsigned_type PROTO((tree));
1289 extern tree build_pointer_type PROTO((tree));
1290 extern tree build_reference_type PROTO((tree));
1291 extern tree build_index_type PROTO((tree));
1292 extern tree build_index_2_type PROTO((tree, tree));
1293 extern tree build_array_type PROTO((tree, tree));
1294 extern tree build_function_type PROTO((tree, tree));
1295 extern tree build_method_type PROTO((tree, tree));
1296 extern tree build_offset_type PROTO((tree, tree));
1297 extern tree build_complex_type PROTO((tree));
1298 extern tree array_type_nelts PROTO((tree));
1300 extern tree value_member PROTO((tree, tree));
1301 extern tree purpose_member PROTO((tree, tree));
1302 extern tree binfo_member PROTO((tree, tree));
1303 extern int attribute_hash_list PROTO((tree));
1304 extern int attribute_list_equal PROTO((tree, tree));
1305 extern int attribute_list_contained PROTO((tree, tree));
1306 extern int tree_int_cst_equal PROTO((tree, tree));
1307 extern int tree_int_cst_lt PROTO((tree, tree));
1308 extern int tree_int_cst_sgn PROTO((tree));
1309 extern int index_type_equal PROTO((tree, tree));
1311 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1312 put the prototype here. Rtl.h does declare the prototype if
1313 tree.h had been included. */
1315 extern tree make_tree ();
1317 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1320 Such modified types already made are recorded so that duplicates
1323 extern tree build_type_attribute_variant PROTO((tree, tree));
1324 extern tree build_decl_attribute_variant PROTO((tree, tree));
1326 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1328 extern int valid_machine_attribute PROTO((tree, tree, tree, tree));
1330 /* Given a tree node and a string, return non-zero if the tree node is
1331 a valid attribute name for the string. */
1333 extern int is_attribute_p PROTO((char *, tree));
1335 /* Given an attribute name and a list of attributes, return the list element
1336 of the attribute or NULL_TREE if not found. */
1338 extern tree lookup_attribute PROTO((char *, tree));
1340 /* Given two attributes lists, return a list of their union. */
1342 extern tree merge_attributes PROTO((tree, tree));
1344 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1345 for the same kind of data as TYPE describes.
1346 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1347 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1348 so that duplicate variants are never made.
1349 Only main variants should ever appear as types of expressions. */
1351 extern tree build_type_variant PROTO((tree, int, int));
1353 /* Make a copy of a type node. */
1355 extern tree build_type_copy PROTO((tree));
1357 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1358 TYPE_ALIGN and TYPE_MODE fields.
1359 If called more than once on one node, does nothing except
1360 for the first time. */
1362 extern void layout_type PROTO((tree));
1364 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1365 return a canonicalized ..._TYPE node, so that duplicates are not made.
1366 How the hash code is computed is up to the caller, as long as any two
1367 callers that could hash identical-looking type nodes agree. */
1369 extern tree type_hash_canon PROTO((int, tree));
1371 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1372 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1373 fields. Call this only once for any given decl node.
1375 Second argument is the boundary that this field can be assumed to
1376 be starting at (in bits). Zero means it can be assumed aligned
1377 on any boundary that may be needed. */
1379 extern void layout_decl PROTO((tree, unsigned));
1381 /* Return an expr equal to X but certainly not valid as an lvalue. */
1383 extern tree non_lvalue PROTO((tree));
1384 extern tree pedantic_non_lvalue PROTO((tree));
1386 extern tree convert PROTO((tree, tree));
1387 extern tree size_in_bytes PROTO((tree));
1388 extern int int_size_in_bytes PROTO((tree));
1389 extern tree size_binop PROTO((enum tree_code, tree, tree));
1390 extern tree size_int PROTO((unsigned HOST_WIDE_INT));
1391 extern tree round_up PROTO((tree, int));
1392 extern tree get_pending_sizes PROTO((void));
1393 extern void put_pending_sizes PROTO((tree));
1395 /* Type for sizes of data-type. */
1397 extern tree sizetype;
1399 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1400 extern int maximum_field_alignment;
1402 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1403 extern int set_alignment;
1405 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1406 by making the last node in X point to Y.
1407 Returns X, except if X is 0 returns Y. */
1409 extern tree chainon PROTO((tree, tree));
1411 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1413 extern tree tree_cons PROTO((tree, tree, tree));
1414 extern tree perm_tree_cons PROTO((tree, tree, tree));
1415 extern tree temp_tree_cons PROTO((tree, tree, tree));
1416 extern tree saveable_tree_cons PROTO((tree, tree, tree));
1417 extern tree decl_tree_cons PROTO((tree, tree, tree));
1419 /* Return the last tree node in a chain. */
1421 extern tree tree_last PROTO((tree));
1423 /* Reverse the order of elements in a chain, and return the new head. */
1425 extern tree nreverse PROTO((tree));
1427 /* Returns the length of a chain of nodes
1428 (number of chain pointers to follow before reaching a null pointer). */
1430 extern int list_length PROTO((tree));
1432 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1434 extern int integer_zerop PROTO((tree));
1436 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1438 extern int integer_onep PROTO((tree));
1440 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1441 all of whose significant bits are 1. */
1443 extern int integer_all_onesp PROTO((tree));
1445 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1446 exactly one bit 1. */
1448 extern int integer_pow2p PROTO((tree));
1450 /* staticp (tree x) is nonzero if X is a reference to data allocated
1451 at a fixed address in memory. */
1453 extern int staticp PROTO((tree));
1455 /* Gets an error if argument X is not an lvalue.
1456 Also returns 1 if X is an lvalue, 0 if not. */
1458 extern int lvalue_or_else PROTO((tree, char *));
1460 /* save_expr (EXP) returns an expression equivalent to EXP
1461 but it can be used multiple times within context CTX
1462 and only evaluate EXP once. */
1464 extern tree save_expr PROTO((tree));
1466 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1467 can be used multiple times and will evaluate EXP, in it's entirety
1470 extern tree unsave_expr PROTO((tree));
1472 /* unsave_expr_now (EXP) resets EXP in place, so that it can be
1475 extern tree unsave_expr_now PROTO((tree));
1477 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1478 or offset that depends on a field within a record.
1480 Note that we only allow such expressions within simple arithmetic
1483 extern int contains_placeholder_p PROTO((tree));
1485 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1486 return a tree with all occurrences of references to F in a
1487 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1488 contains only arithmetic expressions. */
1490 extern tree substitute_in_expr PROTO((tree, tree, tree));
1492 /* variable_size (EXP) is like save_expr (EXP) except that it
1493 is for the special case of something that is part of a
1494 variable size for a data type. It makes special arrangements
1495 to compute the value at the right time when the data type
1496 belongs to a function parameter. */
1498 extern tree variable_size PROTO((tree));
1500 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1501 but it can be used multiple times
1502 and only evaluate the subexpressions once. */
1504 extern tree stabilize_reference PROTO((tree));
1506 /* Subroutine of stabilize_reference; this is called for subtrees of
1507 references. Any expression with side-effects must be put in a SAVE_EXPR
1508 to ensure that it is only evaluated once. */
1510 extern tree stabilize_reference_1 PROTO((tree));
1512 /* Return EXP, stripped of any conversions to wider types
1513 in such a way that the result of converting to type FOR_TYPE
1514 is the same as if EXP were converted to FOR_TYPE.
1515 If FOR_TYPE is 0, it signifies EXP's type. */
1517 extern tree get_unwidened PROTO((tree, tree));
1519 /* Return OP or a simpler expression for a narrower value
1520 which can be sign-extended or zero-extended to give back OP.
1521 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1522 or 0 if the value should be sign-extended. */
1524 extern tree get_narrower PROTO((tree, int *));
1526 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1528 The definition of this resides in language-specific code
1529 as the repertoire of available types may vary. */
1531 extern tree type_for_mode PROTO((enum machine_mode, int));
1533 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1534 for an integer type with at least that precision.
1535 The definition of this resides in language-specific code
1536 as the repertoire of available types may vary. */
1538 extern tree type_for_size PROTO((unsigned, int));
1540 /* Given an integer type T, return a type like T but unsigned.
1541 If T is unsigned, the value is T.
1542 The definition of this resides in language-specific code
1543 as the repertoire of available types may vary. */
1545 extern tree unsigned_type PROTO((tree));
1547 /* Given an integer type T, return a type like T but signed.
1548 If T is signed, the value is T.
1549 The definition of this resides in language-specific code
1550 as the repertoire of available types may vary. */
1552 extern tree signed_type PROTO((tree));
1554 /* This function must be defined in the language-specific files.
1555 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1556 This is defined in a language-specific file. */
1558 extern tree maybe_build_cleanup PROTO((tree));
1560 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1561 look for nested component-refs or array-refs at constant positions
1562 and find the ultimate containing object, which is returned. */
1564 extern tree get_inner_reference PROTO((tree, int *, int *, tree *,
1565 enum machine_mode *, int *,
1568 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1570 extern tree decl_function_context PROTO((tree));
1572 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1573 this _DECL with its context, or zero if none. */
1574 extern tree decl_type_context PROTO((tree));
1576 /* Given the FUNCTION_DECL for the current function,
1577 return zero if it is ok for this function to be inline.
1578 Otherwise return a warning message with a single %s
1579 for the function's name. */
1581 extern char *function_cannot_inline_p PROTO((tree));
1583 /* Return 1 if EXPR is the real constant zero. */
1584 extern int real_zerop PROTO((tree));
1586 /* Declare commonly used variables for tree structure. */
1588 /* An integer constant with value 0 */
1589 extern tree integer_zero_node;
1591 /* An integer constant with value 1 */
1592 extern tree integer_one_node;
1594 /* An integer constant with value 0 whose type is sizetype. */
1595 extern tree size_zero_node;
1597 /* An integer constant with value 1 whose type is sizetype. */
1598 extern tree size_one_node;
1600 /* A constant of type pointer-to-int and value 0 */
1601 extern tree null_pointer_node;
1603 /* A node of type ERROR_MARK. */
1604 extern tree error_mark_node;
1606 /* The type node for the void type. */
1607 extern tree void_type_node;
1609 /* The type node for the ordinary (signed) integer type. */
1610 extern tree integer_type_node;
1612 /* The type node for the unsigned integer type. */
1613 extern tree unsigned_type_node;
1615 /* The type node for the ordinary character type. */
1616 extern tree char_type_node;
1618 /* Points to the name of the input file from which the current input
1619 being parsed originally came (before it went into cpp). */
1620 extern char *input_filename;
1622 /* Current line number in input file. */
1625 /* Nonzero for -pedantic switch: warn about anything
1626 that standard C forbids. */
1627 extern int pedantic;
1629 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1630 Zero means allow extended lvalues. */
1632 extern int pedantic_lvalues;
1634 /* Nonzero means can safely call expand_expr now;
1635 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1637 extern int immediate_size_expand;
1639 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1641 extern tree current_function_decl;
1643 /* Nonzero if function being compiled can call setjmp. */
1645 extern int current_function_calls_setjmp;
1647 /* Nonzero if function being compiled can call longjmp. */
1649 extern int current_function_calls_longjmp;
1651 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1653 extern int all_types_permanent;
1655 /* Pointer to function to compute the name to use to print a declaration.
1656 DECL is the declaration in question.
1657 VERBOSITY determines what information will be printed:
1658 0: DECL_NAME, demangled as necessary.
1659 1: and scope information.
1660 2: and any other information that might be interesting, such as function
1661 parameter types in C++. */
1663 extern char *(*decl_printable_name) (/* tree decl, int verbosity */);
1665 /* Pointer to function to finish handling an incomplete decl at the
1666 end of compilation. */
1668 extern void (*incomplete_decl_finalize_hook) ();
1671 extern char *perm_calloc PROTO((int, long));
1672 extern tree get_set_constructor_bits PROTO((tree, char *, int));
1673 extern tree get_set_constructor_bytes PROTO((tree,
1674 unsigned char *, int));
1678 extern void expand_fixups PROTO((struct rtx_def *));
1679 extern tree expand_start_stmt_expr PROTO((void));
1680 extern tree expand_end_stmt_expr PROTO((tree));
1681 extern void expand_expr_stmt PROTO((tree));
1682 extern int warn_if_unused_value PROTO((tree));
1683 extern void expand_decl_init PROTO((tree));
1684 extern void clear_last_expr PROTO((void));
1685 extern void expand_label PROTO((tree));
1686 extern void expand_goto PROTO((tree));
1687 extern void expand_asm PROTO((tree));
1688 extern void expand_start_cond PROTO((tree, int));
1689 extern void expand_end_cond PROTO((void));
1690 extern void expand_start_else PROTO((void));
1691 extern void expand_start_elseif PROTO((tree));
1692 extern struct nesting *expand_start_loop PROTO((int));
1693 extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
1694 extern void expand_loop_continue_here PROTO((void));
1695 extern void expand_end_loop PROTO((void));
1696 extern int expand_continue_loop PROTO((struct nesting *));
1697 extern int expand_exit_loop PROTO((struct nesting *));
1698 extern int expand_exit_loop_if_false PROTO((struct nesting *,
1700 extern int expand_exit_something PROTO((void));
1702 extern void expand_null_return PROTO((void));
1703 extern void expand_return PROTO((tree));
1704 extern void expand_start_bindings PROTO((int));
1705 extern void expand_end_bindings PROTO((tree, int, int));
1706 extern void start_cleanup_deferal PROTO((void));
1707 extern void end_cleanup_deferal PROTO((void));
1708 extern void mark_block_as_eh_region PROTO((void));
1709 extern void mark_block_as_not_eh_region PROTO((void));
1710 extern int is_eh_region PROTO((void));
1711 extern int conditional_context PROTO((void));
1712 extern tree last_cleanup_this_contour PROTO((void));
1713 extern int expand_dhc_cleanup PROTO((tree));
1714 extern int expand_dcc_cleanup PROTO((tree));
1715 extern void expand_start_case PROTO((int, tree, tree,
1717 extern void expand_end_case PROTO((tree));
1718 extern int pushcase PROTO((tree,
1719 tree (*) (tree, tree),
1721 extern int pushcase_range PROTO((tree, tree,
1722 tree (*) (tree, tree),
1725 /* In fold-const.c */
1727 /* Fold constants as much as possible in an expression.
1728 Returns the simplified expression.
1729 Acts only on the top level of the expression;
1730 if the argument itself cannot be simplified, its
1731 subexpressions are not changed. */
1733 extern tree fold PROTO((tree));
1735 extern int force_fit_type PROTO((tree, int));
1736 extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1737 HOST_WIDE_INT, HOST_WIDE_INT,
1738 HOST_WIDE_INT *, HOST_WIDE_INT *));
1739 extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1740 HOST_WIDE_INT *, HOST_WIDE_INT *));
1741 extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1742 HOST_WIDE_INT, HOST_WIDE_INT,
1743 HOST_WIDE_INT *, HOST_WIDE_INT *));
1744 extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1745 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1746 HOST_WIDE_INT *, int));
1747 extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1749 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
1750 extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1751 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1753 extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1754 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1756 extern int operand_equal_p PROTO((tree, tree, int));
1757 extern tree invert_truthvalue PROTO((tree));
1759 /* The language front-end must define these functions. */
1761 /* Function of no arguments for initializing lexical scanning. */
1762 extern void init_lex PROTO((void));
1763 /* Function of no arguments for initializing the symbol table. */
1764 extern void init_decl_processing PROTO((void));
1766 /* Functions called with no arguments at the beginning and end or processing
1767 the input source file. */
1768 extern void lang_init PROTO((void));
1769 extern void lang_finish PROTO((void));
1771 /* Function to identify which front-end produced the output file. */
1772 extern char *lang_identify PROTO((void));
1774 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
1775 extern void copy_lang_decl PROTO((tree));
1777 /* Function called with no arguments to parse and compile the input. */
1778 extern int yyparse PROTO((void));
1779 /* Function called with option as argument
1780 to decode options starting with -f or -W or +.
1781 It should return nonzero if it handles the option. */
1782 extern int lang_decode_option PROTO((char *));
1784 /* Functions for processing symbol declarations. */
1785 /* Function to enter a new lexical scope.
1786 Takes one argument: always zero when called from outside the front end. */
1787 extern void pushlevel PROTO((int));
1788 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1789 Takes three arguments:
1790 KEEP -- nonzero if there were declarations in this scope.
1791 REVERSE -- reverse the order of decls before returning them.
1792 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1793 extern tree poplevel PROTO((int, int, int));
1794 /* Set the BLOCK node for the current scope level. */
1795 extern void set_block PROTO((tree));
1796 /* Function to add a decl to the current scope level.
1797 Takes one argument, a decl to add.
1798 Returns that decl, or, if the same symbol is already declared, may
1799 return a different decl for that name. */
1800 extern tree pushdecl PROTO((tree));
1801 /* Function to return the chain of decls so far in the current scope level. */
1802 extern tree getdecls PROTO((void));
1803 /* Function to return the chain of structure tags in the current scope level. */
1804 extern tree gettags PROTO((void));
1806 extern tree build_range_type PROTO((tree, tree, tree));
1808 /* Call when starting to parse a declaration:
1809 make expressions in the declaration last the length of the function.
1810 Returns an argument that should be passed to resume_momentary later. */
1811 extern int suspend_momentary PROTO((void));
1813 extern int allocation_temporary_p PROTO((void));
1815 /* Call when finished parsing a declaration:
1816 restore the treatment of node-allocation that was
1817 in effect before the suspension.
1818 YES should be the value previously returned by suspend_momentary. */
1819 extern void resume_momentary PROTO((int));
1821 /* Called after finishing a record, union or enumeral type. */
1822 extern void rest_of_type_compilation PROTO((tree, int));
1824 /* Save the current set of obstacks, but don't change them. */
1825 extern void push_obstacks_nochange PROTO((void));
1827 extern void permanent_allocation PROTO((int));
1829 extern void push_momentary PROTO((void));
1831 extern void clear_momentary PROTO((void));
1833 extern void pop_momentary PROTO((void));
1835 extern void end_temporary_allocation PROTO((void));
1837 /* Pop the obstack selection stack. */
1838 extern void pop_obstacks PROTO((void));
1841 /* Interface of the DWARF2 unwind info support. */
1843 /* Decide whether we want to emit frame unwind information for the current
1844 translation unit. */
1846 extern int dwarf2out_do_frame PROTO((void));
1848 /* Generate a new label for the CFI info to refer to. */
1850 extern char *dwarf2out_cfi_label PROTO((void));
1852 /* Entry point to update the canonical frame address (CFA). */
1854 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
1856 /* Add the CFI for saving a register window. */
1858 extern void dwarf2out_window_save PROTO((char *));
1860 /* Add a CFI to update the running total of the size of arguments pushed
1863 extern void dwarf2out_args_size PROTO((char *, long));
1865 /* Entry point for saving a register to the stack. */
1867 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
1869 /* Entry point for saving the return address in the stack. */
1871 extern void dwarf2out_return_save PROTO((char *, long));
1873 /* Entry point for saving the return address in a register. */
1875 extern void dwarf2out_return_reg PROTO((char *, unsigned));
1877 /* Output a marker (i.e. a label) for the beginning of a function, before
1880 extern void dwarf2out_begin_prologue PROTO((void));
1882 /* Output a marker (i.e. a label) for the absolute end of the generated
1883 code for a function definition. */
1885 extern void dwarf2out_end_epilogue PROTO((void));