1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 93-97, 1998 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 #define MAX_TREE_CODES 256
51 extern char tree_code_type
[MAX_TREE_CODES
];
52 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
54 /* Number of argument-words in each kind of tree-node. */
56 extern int tree_code_length
[MAX_TREE_CODES
];
58 /* Names of tree components. */
60 extern char *tree_code_name
[MAX_TREE_CODES
];
62 /* Codes that identify the various built in functions
63 so that expand_call can identify them quickly. */
65 enum built_in_function
91 BUILT_IN_CLASSIFY_TYPE
,
95 BUILT_IN_FRAME_ADDRESS
,
96 BUILT_IN_RETURN_ADDRESS
,
97 BUILT_IN_AGGREGATE_INCOMING_ADDRESS
,
98 BUILT_IN_CALLER_RETURN_ADDRESS
,
105 /* Various hooks for the DWARF 2 __throw routine. */
106 BUILT_IN_FP
, BUILT_IN_SP
,
107 BUILT_IN_UNWIND_INIT
,
108 BUILT_IN_DWARF_FP_REGNUM
,
109 BUILT_IN_DWARF_REG_SIZE
,
110 BUILT_IN_FROB_RETURN_ADDR
,
111 BUILT_IN_EXTRACT_RETURN_ADDR
,
112 BUILT_IN_SET_RETURN_ADDR_REG
,
114 BUILT_IN_SET_EH_REGS
,
122 /* Upper bound on non-language-specific builtins. */
126 /* The definition of tree nodes fills the next several pages. */
128 /* A tree node can represent a data type, a variable, an expression
129 or a statement. Each node has a TREE_CODE which says what kind of
130 thing it represents. Some common codes are:
131 INTEGER_TYPE -- represents a type of integers.
132 ARRAY_TYPE -- represents a type of pointer.
133 VAR_DECL -- represents a declared variable.
134 INTEGER_CST -- represents a constant integer value.
135 PLUS_EXPR -- represents a sum (an expression).
137 As for the contents of a tree node: there are some fields
138 that all nodes share. Each TREE_CODE has various special-purpose
139 fields as well. The fields of a node are never accessed directly,
140 always through accessor macros. */
142 /* This type is used everywhere to refer to a tree node. */
144 typedef union tree_node
*tree
;
146 /* Every kind of tree node starts with this structure,
147 so all nodes have these fields.
149 See the accessor macros, defined below, for documentation of the fields. */
153 union tree_node
*chain
;
154 union tree_node
*type
;
155 #ifdef ONLY_INT_FIELDS
156 unsigned int code
: 8;
158 enum tree_code code
: 8;
161 unsigned side_effects_flag
: 1;
162 unsigned constant_flag
: 1;
163 unsigned permanent_flag
: 1;
164 unsigned addressable_flag
: 1;
165 unsigned volatile_flag
: 1;
166 unsigned readonly_flag
: 1;
167 unsigned unsigned_flag
: 1;
168 unsigned asm_written_flag
: 1;
170 unsigned used_flag
: 1;
171 unsigned raises_flag
: 1;
172 unsigned static_flag
: 1;
173 unsigned public_flag
: 1;
174 unsigned private_flag
: 1;
175 unsigned protected_flag
: 1;
177 unsigned lang_flag_0
: 1;
178 unsigned lang_flag_1
: 1;
179 unsigned lang_flag_2
: 1;
180 unsigned lang_flag_3
: 1;
181 unsigned lang_flag_4
: 1;
182 unsigned lang_flag_5
: 1;
183 unsigned lang_flag_6
: 1;
184 /* There is room for three more flags. */
187 /* The following table lists the uses of each of the above flags and
188 for which types of nodes they are defined. Note that expressions
194 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
200 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR
201 TREE_NO_UNUSED_WARNING in
202 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
204 TREE_LIST or TREE_VEC
205 TREE_CONSTANT_OVERFLOW in
206 INTEGER_CST, REAL_CST, COMPLEX_CST
207 TREE_SYMBOL_REFERENCED in
213 INTEGER_CST, REAL_CST, COMPLEX_CST
215 VAR_DECL or FUNCTION_DECL
217 TREE_LIST or TREE_VEC
222 TREE_LIST or TREE_VEC
224 ??? unspecified nodes
228 TREE_VIA_PROTECTED in
232 ??? unspecified nodes
241 TREE_THIS_VOLATILE in
249 VAR_DECL, PARM_DECL, FIELD_DECL, ..._REF
251 VAR_DECL if iterator (C)
260 permanent_flag: TREE_PERMANENT in all nodes
265 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
266 DECL_BUILT_IN_NONANSI in
270 SAVE_EXPR_NOPLACEHOLDER in
276 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
282 expressions, IDENTIFIER_NODE
290 /* Define accessors for the fields that all tree nodes have
291 (though some fields are not used for all kinds of nodes). */
293 /* The tree-code says what kind of node it is.
294 Codes are defined in tree.def. */
295 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
296 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
298 /* In all nodes that are expressions, this is the data type of the expression.
299 In POINTER_TYPE nodes, this is the type that the pointer points to.
300 In ARRAY_TYPE nodes, this is the type of the elements. */
301 #define TREE_TYPE(NODE) ((NODE)->common.type)
303 /* Nodes are chained together for many purposes.
304 Types are chained together to record them for being output to the debugger
305 (see the function `chain_type').
306 Decls in the same scope are chained together to record the contents
308 Statement nodes for successive statements used to be chained together.
309 Often lists of things are represented by TREE_LIST nodes that
310 are chained together. */
312 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
314 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
315 that don't change the machine mode. */
317 #define STRIP_NOPS(EXP) \
318 while ((TREE_CODE (EXP) == NOP_EXPR \
319 || TREE_CODE (EXP) == CONVERT_EXPR \
320 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
321 && (TYPE_MODE (TREE_TYPE (EXP)) \
322 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
323 (EXP) = TREE_OPERAND (EXP, 0);
325 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
327 #define STRIP_TYPE_NOPS(EXP) \
328 while ((TREE_CODE (EXP) == NOP_EXPR \
329 || TREE_CODE (EXP) == CONVERT_EXPR \
330 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
331 && (TREE_TYPE (EXP) \
332 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
333 (EXP) = TREE_OPERAND (EXP, 0);
335 /* Nonzero if TYPE represents an integral type. Note that we do not
336 include COMPLEX types here. */
338 #define INTEGRAL_TYPE_P(TYPE) \
339 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
340 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
342 /* Nonzero if TYPE represents a floating-point type, including complex
343 floating-point types. */
345 #define FLOAT_TYPE_P(TYPE) \
346 (TREE_CODE (TYPE) == REAL_TYPE \
347 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
348 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
350 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
352 #define AGGREGATE_TYPE_P(TYPE) \
353 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
354 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
355 || TREE_CODE (TYPE) == SET_TYPE)
357 /* Nonzero if TYPE represents a pointer type. */
359 #define POINTER_TYPE_P(TYPE) \
360 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
362 /* Define many boolean fields that all tree nodes have. */
364 /* In VAR_DECL nodes, nonzero means address of this is needed.
365 So it cannot be in a register.
366 In a FUNCTION_DECL, nonzero means its address is needed.
367 So it must be compiled even if it is an inline function.
368 In CONSTRUCTOR nodes, it means object constructed must be in memory.
369 In LABEL_DECL nodes, it means a goto for this label has been seen
370 from a place outside all binding contours that restore stack levels.
371 In ..._TYPE nodes, it means that objects of this type must
372 be fully addressable. This means that pieces of this
373 object cannot go into register parameters, for example.
374 In IDENTIFIER_NODEs, this means that some extern decl for this name
375 had its address taken. That matters for inline functions. */
376 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
378 /* In a VAR_DECL, nonzero means allocate static storage.
379 In a FUNCTION_DECL, nonzero if function has been defined.
380 In a CONSTRUCTOR, nonzero means allocate static storage. */
381 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
383 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
384 made implicitly and should not lead to an "unused value" warning. */
385 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
387 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
388 chain is via a `virtual' declaration. */
389 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
391 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
392 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
393 requires a diagnostic when overflows occur in constant expressions. */
394 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
396 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
397 this string as an argument. */
398 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
400 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
401 overflow in folding, and no warning has been issued for this subexpression.
402 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
403 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
405 /* In a VAR_DECL or FUNCTION_DECL,
406 nonzero means name is to be accessible from outside this module.
407 In an identifier node, nonzero means an external declaration
408 accessible from outside this module was previously seen
409 for this name in an inner scope. */
410 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
412 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
413 base class is via a `public' declaration, which preserves public
414 fields from the base class as public. */
415 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
417 /* Ditto, for `private' declarations. */
418 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
420 /* Nonzero for TREE_LIST node means that the path to the
421 base class is via a `protected' declaration, which preserves
422 protected fields from the base class as protected.
424 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
426 /* In any expression, nonzero means it has side effects or reevaluation
427 of the whole expression could produce a different value.
428 This is set if any subexpression is a function call, a side effect
429 or a reference to a volatile variable.
430 In a ..._DECL, this is set only if the declaration said `volatile'. */
431 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
433 /* Nonzero means this expression is volatile in the C sense:
434 its address should be of type `volatile WHATEVER *'.
435 In other words, the declared item is volatile qualified.
436 This is used in _DECL nodes and _REF nodes.
438 In a ..._TYPE node, means this type is volatile-qualified.
439 But use TYPE_VOLATILE instead of this macro when the node is a type,
440 because eventually we may make that a different bit.
442 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
443 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
445 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
446 nonzero means it may not be the lhs of an assignment.
447 In a ..._TYPE node, means this type is const-qualified
448 (but the macro TYPE_READONLY should be used instead of this macro
449 when the node is a type). */
450 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
452 /* Value of expression is constant.
453 Always appears in all ..._CST nodes.
454 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
455 if the value is constant. */
456 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
458 /* Nonzero means permanent node;
459 node will continue to exist for the entire compiler run.
460 Otherwise it will be recycled at the end of the function. */
461 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
463 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
464 In FIELD_DECL nodes, means an unsigned bit field.
465 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
466 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
468 /* Nonzero in a VAR_DECL means assembler code has been written.
469 Nonzero in a FUNCTION_DECL means that the function has been compiled.
470 This is interesting in an inline function, since it might not need
471 to be compiled separately.
472 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
473 if the sdb debugging info for the type has been written.
474 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
475 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
477 /* Nonzero in a _DECL if the name is used in its scope.
478 Nonzero in an expr node means inhibit warning if value is unused.
479 In IDENTIFIER_NODEs, this means that some extern decl for this name
481 #define TREE_USED(NODE) ((NODE)->common.used_flag)
483 /* Nonzero for a tree node whose evaluation could result
484 in the raising of an exception. Not implemented yet. */
485 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
487 /* Used in classes in C++. */
488 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
489 /* Used in classes in C++.
490 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
491 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
493 /* These flags are available for each language front end to use internally. */
494 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
495 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
496 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
497 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
498 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
499 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
500 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
502 /* Define additional fields and accessors for nodes representing constants. */
504 /* In an INTEGER_CST node. These two together make a 2-word integer.
505 If the data type is signed, the value is sign-extended to 2 words
506 even though not all of them may really be in use.
507 In an unsigned constant shorter than 2 words, the extra bits are 0. */
508 #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low)
509 #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high)
511 #define INT_CST_LT(A, B) \
512 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
513 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
514 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
515 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
517 #define INT_CST_LT_UNSIGNED(A, B) \
518 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
519 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
520 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
521 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
522 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
523 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
527 char common
[sizeof (struct tree_common
)];
528 struct rtx_def
*rtl
; /* acts as link to register transfer language
530 HOST_WIDE_INT int_cst_low
;
531 HOST_WIDE_INT int_cst_high
;
534 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
535 and generally in all kinds of constants that could
536 be given labels (rather than being immediate). */
538 #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl)
540 /* In a REAL_CST node. */
541 /* We can represent a real value as either a `double' or a string.
542 Strings don't allow for any optimization, but they do allow
543 for cross-compilation. */
545 #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst)
551 char common
[sizeof (struct tree_common
)];
552 struct rtx_def
*rtl
; /* acts as link to register transfer language
554 REAL_VALUE_TYPE real_cst
;
557 /* In a STRING_CST */
558 #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length)
559 #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer)
563 char common
[sizeof (struct tree_common
)];
564 struct rtx_def
*rtl
; /* acts as link to register transfer language
570 /* In a COMPLEX_CST node. */
571 #define TREE_REALPART(NODE) ((NODE)->complex.real)
572 #define TREE_IMAGPART(NODE) ((NODE)->complex.imag)
576 char common
[sizeof (struct tree_common
)];
577 struct rtx_def
*rtl
; /* acts as link to register transfer language
579 union tree_node
*real
;
580 union tree_node
*imag
;
583 /* Define fields and accessors for some special-purpose tree nodes. */
585 #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length)
586 #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer)
588 struct tree_identifier
590 char common
[sizeof (struct tree_common
)];
595 /* In a TREE_LIST node. */
596 #define TREE_PURPOSE(NODE) ((NODE)->list.purpose)
597 #define TREE_VALUE(NODE) ((NODE)->list.value)
601 char common
[sizeof (struct tree_common
)];
602 union tree_node
*purpose
;
603 union tree_node
*value
;
606 /* In a TREE_VEC node. */
607 #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length)
608 #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I])
609 #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length]))
613 char common
[sizeof (struct tree_common
)];
615 union tree_node
*a
[1];
618 /* Define fields and accessors for some nodes that represent expressions. */
620 /* In a SAVE_EXPR node. */
621 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
622 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
623 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
625 /* In a RTL_EXPR node. */
626 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0])
627 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1])
629 /* In a CALL_EXPR node. */
630 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
632 /* In a CONSTRUCTOR node. */
633 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
635 /* In ordinary expression nodes. */
636 #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I])
637 #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity)
641 char common
[sizeof (struct tree_common
)];
643 union tree_node
*operands
[1];
646 /* In a BLOCK node. */
647 #define BLOCK_VARS(NODE) ((NODE)->block.vars)
648 #define BLOCK_TYPE_TAGS(NODE) ((NODE)->block.type_tags)
649 #define BLOCK_SUBBLOCKS(NODE) ((NODE)->block.subblocks)
650 #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->block.supercontext)
651 /* Note: when changing this, make sure to find the places
652 that use chainon or nreverse. */
653 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
654 #define BLOCK_ABSTRACT_ORIGIN(NODE) ((NODE)->block.abstract_origin)
655 #define BLOCK_ABSTRACT(NODE) ((NODE)->block.abstract_flag)
656 #define BLOCK_END_NOTE(NODE) ((NODE)->block.end_note)
658 /* Nonzero means that this block is prepared to handle exceptions
659 listed in the BLOCK_VARS slot. */
660 #define BLOCK_HANDLER_BLOCK(NODE) ((NODE)->block.handler_block_flag)
664 char common
[sizeof (struct tree_common
)];
666 unsigned handler_block_flag
: 1;
667 unsigned abstract_flag
: 1;
669 union tree_node
*vars
;
670 union tree_node
*type_tags
;
671 union tree_node
*subblocks
;
672 union tree_node
*supercontext
;
673 union tree_node
*abstract_origin
;
674 struct rtx_def
*end_note
;
677 /* Define fields and accessors for nodes representing data types. */
679 /* See tree.def for documentation of the use of these fields.
680 Look at the documentation of the various ..._TYPE tree codes. */
682 #define TYPE_UID(NODE) ((NODE)->type.uid)
683 #define TYPE_SIZE(NODE) ((NODE)->type.size)
684 #define TYPE_MODE(NODE) ((NODE)->type.mode)
685 #define TYPE_VALUES(NODE) ((NODE)->type.values)
686 #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
687 #define TYPE_FIELDS(NODE) ((NODE)->type.values)
688 #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
689 #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
690 #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
691 #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
692 #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
693 #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
694 #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
695 #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
696 #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
697 #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
698 #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab.address)
699 #define TYPE_SYMTAB_POINTER(NODE) ((NODE)->type.symtab.pointer)
700 #define TYPE_NAME(NODE) ((NODE)->type.name)
701 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
702 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
703 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
704 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
705 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
706 #define TYPE_OBSTACK(NODE) ((NODE)->type.obstack)
707 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
709 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
711 #define TYPE_ATTRIBUTES(NODE) ((NODE)->type.attributes)
713 /* The alignment necessary for objects of this type.
714 The value is an int, measured in bits. */
715 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
717 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
719 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
720 has BLKmode only because it lacks the alignment requirement for
722 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
724 /* Nonzero in a type considered volatile as a whole. */
725 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
727 /* Means this type is const-qualified. */
728 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
730 /* These flags are available for each language front end to use internally. */
731 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
732 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
733 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
734 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
735 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
736 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
737 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
739 /* If set in an ARRAY_TYPE, indicates a string type (for languages
740 that distinguish string from array of char).
741 If set in a SET_TYPE, indicates a bitstring type. */
742 #define TYPE_STRING_FLAG(NODE) ((NODE)->type.string_flag)
744 /* If non-NULL, this is a upper bound of the size (in bytes) of an
745 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
746 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
748 /* Indicates that objects of this type must be initialized by calling a
749 function when they are created. */
750 #define TYPE_NEEDS_CONSTRUCTING(NODE) ((NODE)->type.needs_constructing_flag)
752 /* Indicates that objects of this type (a UNION_TYPE), should be passed
753 the same way that the first union alternative would be passed. */
754 #define TYPE_TRANSPARENT_UNION(NODE) ((NODE)->type.transparent_union_flag)
756 /* Indicated that objects of this type should be laid out in as
757 compact a way as possible. */
758 #define TYPE_PACKED(NODE) ((NODE)->type.packed_flag)
762 char common
[sizeof (struct tree_common
)];
763 union tree_node
*values
;
764 union tree_node
*size
;
765 union tree_node
*attributes
;
768 unsigned char precision
;
769 #ifdef ONLY_INT_FIELDS
772 enum machine_mode mode
: 8;
775 unsigned string_flag
: 1;
776 unsigned no_force_blk_flag
: 1;
777 unsigned needs_constructing_flag
: 1;
778 unsigned transparent_union_flag
: 1;
779 unsigned packed_flag
: 1;
780 unsigned lang_flag_0
: 1;
781 unsigned lang_flag_1
: 1;
782 unsigned lang_flag_2
: 1;
783 unsigned lang_flag_3
: 1;
784 unsigned lang_flag_4
: 1;
785 unsigned lang_flag_5
: 1;
786 unsigned lang_flag_6
: 1;
787 /* room for 4 more bits */
790 union tree_node
*pointer_to
;
791 union tree_node
*reference_to
;
792 union {int address
; char *pointer
; } symtab
;
793 union tree_node
*name
;
794 union tree_node
*minval
;
795 union tree_node
*maxval
;
796 union tree_node
*next_variant
;
797 union tree_node
*main_variant
;
798 union tree_node
*binfo
;
799 union tree_node
*noncopied_parts
;
800 union tree_node
*context
;
801 struct obstack
*obstack
;
802 /* Points to a structure whose details depend on the language in use. */
803 struct lang_type
*lang_specific
;
806 /* Define accessor macros for information about type inheritance
809 A "basetype" means a particular usage of a data type for inheritance
810 in another type. Each such basetype usage has its own "binfo"
811 object to describe it. The binfo object is a TREE_VEC node.
813 Inheritance is represented by the binfo nodes allocated for a
814 given type. For example, given types C and D, such that D is
815 inherited by C, 3 binfo nodes will be allocated: one for describing
816 the binfo properties of C, similarly one for D, and one for
817 describing the binfo properties of D as a base type for C.
818 Thus, given a pointer to class C, one can get a pointer to the binfo
819 of D acting as a basetype for C by looking at C's binfo's basetypes. */
821 /* The actual data type node being inherited in this basetype. */
822 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
824 /* The offset where this basetype appears in its containing type.
825 BINFO_OFFSET slot holds the offset (in bytes)
826 from the base of the complete object to the base of the part of the
827 object that is allocated on behalf of this `type'.
828 This is always 0 except when there is multiple inheritance. */
830 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
831 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
832 #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node)
834 /* The virtual function table belonging to this basetype. Virtual
835 function tables provide a mechanism for run-time method dispatching.
836 The entries of a virtual function table are language-dependent. */
838 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
839 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
841 /* The virtual functions in the virtual function table. This is
842 a TREE_LIST that is used as an initial approximation for building
843 a virtual function table for this basetype. */
844 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
845 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
847 /* A vector of additional binfos for the types inherited by this basetype.
849 If this basetype describes type D as inherited in C,
850 and if the basetypes of D are E anf F,
851 then this vector contains binfos for inheritance of E and F by C.
853 ??? This could probably be done by just allocating the
854 base types at the end of this TREE_VEC (instead of using
855 another TREE_VEC). This would simplify the calculation
856 of how many basetypes a given type had. */
857 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
858 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
860 /* For a BINFO record describing an inheritance, this yields a pointer
861 to the artificial FIELD_DECL node which contains the "virtual base
862 class pointer" for the given inheritance. */
864 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
866 /* Accessor macro to get to the Nth basetype of this basetype. */
867 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
868 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
870 /* Slot used to build a chain that represents a use of inheritance.
871 For example, if X is derived from Y, and Y is derived from Z,
872 then this field can be used to link the binfo node for X to
873 the binfo node for X's Y to represent the use of inheritance
874 from X to Y. Similarly, this slot of the binfo node for X's Y
875 can point to the Z from which Y is inherited (in X's inheritance
876 hierarchy). In this fashion, one can represent and traverse specific
877 uses of inheritance using the binfo nodes themselves (instead of
878 consing new space pointing to binfo nodes).
879 It is up to the language-dependent front-ends to maintain
880 this information as necessary. */
881 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
883 /* Define fields and accessors for nodes representing declared names. */
885 /* This is the name of the object as written by the user.
886 It is an IDENTIFIER_NODE. */
887 #define DECL_NAME(NODE) ((NODE)->decl.name)
888 /* This is the name of the object as the assembler will see it
889 (but before any translations made by ASM_OUTPUT_LABELREF).
890 Often this is the same as DECL_NAME.
891 It is an IDENTIFIER_NODE. */
892 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
893 /* Records the section name in a section attribute. Used to pass
894 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
895 #define DECL_SECTION_NAME(NODE) ((NODE)->decl.section_name)
896 /* For FIELD_DECLs, this is the
897 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
898 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
899 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
900 containing function, the RECORD_TYPE or UNION_TYPE for the containing
901 type, or NULL_TREE if the given decl has "file scope". */
902 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
903 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
904 /* In a DECL this is the field where configuration dependent machine
905 attributes are store */
906 #define DECL_MACHINE_ATTRIBUTES(NODE) ((NODE)->decl.machine_attributes)
907 /* In a FIELD_DECL, this is the field position, counting in bits,
908 of the bit closest to the beginning of the structure. */
909 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
910 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
911 if so, the type that was originally specified for it.
912 TREE_TYPE may have been modified (in finish_struct). */
913 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
914 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
915 /* VAR_DECL and PARM_DECL reserve the arguments slot
916 for language-specific uses. */
917 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
918 /* In FUNCTION_DECL, holds the decl for the return value. */
919 #define DECL_RESULT(NODE) ((NODE)->decl.result)
920 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
921 #define DECL_ORIGINAL_TYPE(NODE) ((NODE)->decl.result)
922 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
923 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
924 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
925 For a VAR_DECL, holds the initial value.
926 For a PARM_DECL, not used--default
927 values for parameters are encoded in the type of the function,
928 not in the PARM_DECL slot. */
929 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
930 /* For a PARM_DECL, records the data type used to pass the argument,
931 which may be different from the type seen in the program. */
932 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
933 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
934 if nonzero, indicates that the field occupies the type. */
935 #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial)
936 /* These two fields describe where in the source code the declaration was. */
937 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
938 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
939 /* Holds the size of the datum, as a tree expression.
940 Need not be constant. */
941 #define DECL_SIZE(NODE) ((NODE)->decl.size)
942 /* Holds the alignment required for the datum. */
943 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size.u)
944 /* Holds the machine mode corresponding to the declaration of a variable or
945 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
947 #define DECL_MODE(NODE) ((NODE)->decl.mode)
948 /* Holds the RTL expression for the value of a variable or function. If
949 PROMOTED_MODE is defined, the mode of this expression may not be same
950 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
951 to the variable's data type, while the mode
952 of DECL_RTL is the mode actually used to contain the data. */
953 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
954 /* For PARM_DECL, holds an RTL for the stack slot or register
955 where the data was actually passed. */
956 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
957 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
958 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
959 /* For FUNCTION_DECL, if it is inline,
960 holds the size of the stack frame, as an integer. */
961 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size.i)
962 /* For FUNCTION_DECL, if it is built-in,
963 this identifies which built-in operation it is. */
964 #define DECL_FUNCTION_CODE(NODE) ((NODE)->decl.frame_size.f)
965 #define DECL_SET_FUNCTION_CODE(NODE,VAL) ((NODE)->decl.frame_size.f = (VAL))
966 /* For a FIELD_DECL, holds the size of the member as an integer. */
967 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
969 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
970 Before the struct containing the FUNCTION_DECL is laid out,
971 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
972 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
973 function. When the class is laid out, this pointer is changed
974 to an INTEGER_CST node which is suitable for use as an index
975 into the virtual function table. */
976 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
977 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
978 which this FIELD_DECL is defined. This information is needed when
979 writing debugging information about vfield and vbase decls for C++. */
980 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
982 /* Every ..._DECL node gets a unique number. */
983 #define DECL_UID(NODE) ((NODE)->decl.uid)
985 /* For any sort of a ..._DECL node, this points to the original (abstract)
986 decl node which this decl is an instance of, or else it is NULL indicating
987 that this decl is not an instance of some other decl. For example,
988 in a nested declaration of an inline function, this points back to the
990 #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin)
992 /* Nonzero for any sort of ..._DECL node means this decl node represents
993 an inline instance of some original (abstract) decl from an inline function;
994 suppress any warnings about shadowing some other variable. */
995 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
997 /* Nonzero if a _DECL means that the name of this decl should be ignored
998 for symbolic debug purposes. */
999 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
1001 /* Nonzero for a given ..._DECL node means that this node represents an
1002 "abstract instance" of the given declaration (e.g. in the original
1003 declaration of an inline function). When generating symbolic debugging
1004 information, we mustn't try to generate any address information for nodes
1005 marked as "abstract instances" because we don't actually generate
1006 any code or allocate any data space for such instances. */
1007 #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag)
1009 /* Nonzero if a _DECL means that no warnings should be generated just
1010 because this decl is unused. */
1011 #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag)
1013 /* Nonzero for a given ..._DECL node means that this node should be
1014 put in .common, if possible. If a DECL_INITIAL is given, and it
1015 is not error_mark_node, then the decl cannot be put in .common. */
1016 #define DECL_COMMON(NODE) ((NODE)->decl.common_flag)
1018 /* Language-specific decl information. */
1019 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
1021 /* In a VAR_DECL or FUNCTION_DECL,
1022 nonzero means external reference:
1023 do not allocate storage, and refer to a definition elsewhere. */
1024 #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag)
1027 nonzero means the detail info about this type is not dumped into stabs.
1028 Instead it will generate cross reference ('x') of names.
1029 This uses the same flag as DECL_EXTERNAL. */
1030 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) ((NODE)->decl.external_flag)
1033 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1034 #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag)
1035 /* In LABEL_DECL nodes, nonzero means that an error message about
1036 jumping into such a binding contour has been printed for this label. */
1037 #define DECL_ERROR_ISSUED(NODE) ((NODE)->decl.regdecl_flag)
1038 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1039 #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag)
1040 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1041 static chain is not needed. */
1042 #define DECL_NO_STATIC_CHAIN(NODE) ((NODE)->decl.regdecl_flag)
1044 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1045 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1047 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1049 Also set in some languages for variables, etc., outside the normal
1050 lexical scope, such as class instance variables. */
1051 #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
1053 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1054 where it is called. */
1055 #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag)
1057 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1058 that is not specified by ansi C and that users are supposed to be allowed
1059 to redefine for any purpose whatever. */
1060 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1062 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1064 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
1065 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1066 contour that restored a stack level and which is now exited. */
1067 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
1068 /* In a FUNCTION_DECL, nonzero means a built in function. */
1069 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
1070 /* In a VAR_DECL that's static,
1071 nonzero if the space is in the text section. */
1072 #define DECL_IN_TEXT_SECTION(NODE) ((NODE)->decl.bit_field_flag)
1074 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1075 Used in FIELD_DECLs for vtable pointers.
1076 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1077 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
1079 /* Used to indicate that the linkage status of this DECL is not yet known,
1080 so it should not be output now. */
1081 #define DECL_DEFER_OUTPUT(NODE) ((NODE)->decl.defer_output)
1083 /* Used in PARM_DECLs whose type are unions to indicate that the
1084 argument should be passed in the same way that the first union
1085 alternative would be passed. */
1086 #define DECL_TRANSPARENT_UNION(NODE) ((NODE)->decl.transparent_union)
1088 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1089 at the beginning or end of execution. */
1090 #define DECL_STATIC_CONSTRUCTOR(NODE) ((NODE)->decl.static_ctor_flag)
1091 #define DECL_STATIC_DESTRUCTOR(NODE) ((NODE)->decl.static_dtor_flag)
1093 /* Used to indicate that this DECL represents a compiler-generated entity. */
1094 #define DECL_ARTIFICIAL(NODE) ((NODE)->decl.artificial_flag)
1096 /* Used to indicate that this DECL has weak linkage. */
1097 #define DECL_WEAK(NODE) ((NODE)->decl.weak_flag)
1099 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1100 multiple translation units should be merged. */
1101 #define DECL_ONE_ONLY(NODE) ((NODE)->decl.transparent_union)
1103 /* Additional flags for language-specific uses. */
1104 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
1105 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
1106 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
1107 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
1108 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
1109 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
1110 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
1111 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
1115 char common
[sizeof (struct tree_common
)];
1119 union tree_node
*size
;
1120 #ifdef ONLY_INT_FIELDS
1123 enum machine_mode mode
: 8;
1126 unsigned external_flag
: 1;
1127 unsigned nonlocal_flag
: 1;
1128 unsigned regdecl_flag
: 1;
1129 unsigned inline_flag
: 1;
1130 unsigned bit_field_flag
: 1;
1131 unsigned virtual_flag
: 1;
1132 unsigned ignored_flag
: 1;
1133 unsigned abstract_flag
: 1;
1135 unsigned in_system_header_flag
: 1;
1136 unsigned common_flag
: 1;
1137 unsigned defer_output
: 1;
1138 unsigned transparent_union
: 1;
1139 unsigned static_ctor_flag
: 1;
1140 unsigned static_dtor_flag
: 1;
1141 unsigned artificial_flag
: 1;
1142 unsigned weak_flag
: 1;
1143 /* room for no more */
1145 unsigned lang_flag_0
: 1;
1146 unsigned lang_flag_1
: 1;
1147 unsigned lang_flag_2
: 1;
1148 unsigned lang_flag_3
: 1;
1149 unsigned lang_flag_4
: 1;
1150 unsigned lang_flag_5
: 1;
1151 unsigned lang_flag_6
: 1;
1152 unsigned lang_flag_7
: 1;
1154 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1155 If built-in, this is the code for which built-in function.
1156 For other kinds of decls, this is DECL_ALIGN. */
1160 enum built_in_function f
;
1163 union tree_node
*name
;
1164 union tree_node
*context
;
1165 union tree_node
*arguments
;
1166 union tree_node
*result
;
1167 union tree_node
*initial
;
1168 union tree_node
*abstract_origin
;
1169 union tree_node
*assembler_name
;
1170 union tree_node
*section_name
;
1171 union tree_node
*machine_attributes
;
1172 struct rtx_def
*rtl
; /* acts as link to register transfer language
1174 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1175 on the permanent obstack. For any other kind of decl, this is the
1181 union tree_node
*vindex
;
1182 /* Points to a structure whose details depend on the language in use. */
1183 struct lang_decl
*lang_specific
;
1186 /* Define the overall contents of a tree node.
1187 It may be any of the structures declared above
1188 for various types of node. */
1192 struct tree_common common
;
1193 struct tree_int_cst int_cst
;
1194 struct tree_real_cst real_cst
;
1195 struct tree_string string
;
1196 struct tree_complex
complex;
1197 struct tree_identifier identifier
;
1198 struct tree_decl decl
;
1199 struct tree_type type
;
1200 struct tree_list list
;
1201 struct tree_vec vec
;
1202 struct tree_exp exp
;
1203 struct tree_block block
;
1206 #include "gansidecl.h"
1208 #define NULL_TREE (tree) NULL
1210 /* The following functions accept a wide integer argument. Rather than
1211 having to cast on every function call, we use a macro instead, that is
1212 defined here and in rtl.h. */
1215 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1216 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1218 extern int exact_log2_wide
PROTO((unsigned HOST_WIDE_INT
));
1219 extern int floor_log2_wide
PROTO((unsigned HOST_WIDE_INT
));
1222 /* At present, don't prototype xrealloc, since all of the callers don't
1223 cast their pointers to char *, and all of the xrealloc's don't use
1225 extern char *xmalloc
PROTO((size_t));
1226 extern char *xrealloc
PROTO((void *, size_t));
1228 extern char *xmalloc ();
1229 extern char *xrealloc ();
1232 extern char *xstrdup
PROTO((char *));
1234 extern char *oballoc
PROTO((int));
1235 extern char *permalloc
PROTO((int));
1236 extern char *savealloc
PROTO((int));
1237 extern char *expralloc
PROTO((int));
1238 #ifdef NEED_DECLARATION_FREE
1239 extern void free
PROTO((void *));
1242 /* Lowest level primitive for allocating a node.
1243 The TREE_CODE is the only argument. Contents are initialized
1244 to zero except for a few of the common fields. */
1246 extern tree make_node
PROTO((enum tree_code
));
1248 /* Make a copy of a node, with all the same contents except
1249 for TREE_PERMANENT. (The copy is permanent
1250 iff nodes being made now are permanent.) */
1252 extern tree copy_node
PROTO((tree
));
1254 /* Make a copy of a chain of TREE_LIST nodes. */
1256 extern tree copy_list
PROTO((tree
));
1258 /* Make a TREE_VEC. */
1260 extern tree make_tree_vec
PROTO((int));
1262 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1263 The name is supplied as a char *. */
1265 extern tree get_identifier
PROTO((char *));
1267 /* If an identifier with the name TEXT (a null-terminated string) has
1268 previously been referred to, return that node; otherwise return
1271 extern tree maybe_get_identifier
PROTO((char *));
1273 /* Construct various types of nodes. */
1275 #define build_int_2(LO,HI) \
1276 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1278 extern tree build
PVPROTO((enum tree_code
, tree
, ...));
1279 extern tree build_nt
PVPROTO((enum tree_code
, ...));
1280 extern tree build_parse_node
PVPROTO((enum tree_code
, ...));
1282 extern tree build_int_2_wide
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
));
1283 extern tree build_real
PROTO((tree
, REAL_VALUE_TYPE
));
1284 extern tree build_real_from_int_cst
PROTO((tree
, tree
));
1285 extern tree build_complex
PROTO((tree
, tree
, tree
));
1286 extern tree build_string
PROTO((int, char *));
1287 extern tree build1
PROTO((enum tree_code
, tree
, tree
));
1288 extern tree build_tree_list
PROTO((tree
, tree
));
1289 extern tree build_decl_list
PROTO((tree
, tree
));
1290 extern tree build_expr_list
PROTO((tree
, tree
));
1291 extern tree build_decl
PROTO((enum tree_code
, tree
, tree
));
1292 extern tree build_block
PROTO((tree
, tree
, tree
, tree
, tree
));
1294 /* Construct various nodes representing data types. */
1296 extern tree make_signed_type
PROTO((int));
1297 extern tree make_unsigned_type
PROTO((int));
1298 extern void set_sizetype
PROTO((tree
));
1299 extern tree signed_or_unsigned_type
PROTO((int, tree
));
1300 extern void fixup_unsigned_type
PROTO((tree
));
1301 extern tree build_pointer_type
PROTO((tree
));
1302 extern tree build_reference_type
PROTO((tree
));
1303 extern tree build_index_type
PROTO((tree
));
1304 extern tree build_index_2_type
PROTO((tree
, tree
));
1305 extern tree build_array_type
PROTO((tree
, tree
));
1306 extern tree build_function_type
PROTO((tree
, tree
));
1307 extern tree build_method_type
PROTO((tree
, tree
));
1308 extern tree build_offset_type
PROTO((tree
, tree
));
1309 extern tree build_complex_type
PROTO((tree
));
1310 extern tree array_type_nelts
PROTO((tree
));
1312 extern tree value_member
PROTO((tree
, tree
));
1313 extern tree purpose_member
PROTO((tree
, tree
));
1314 extern tree binfo_member
PROTO((tree
, tree
));
1315 extern int attribute_hash_list
PROTO((tree
));
1316 extern int attribute_list_equal
PROTO((tree
, tree
));
1317 extern int attribute_list_contained
PROTO((tree
, tree
));
1318 extern int tree_int_cst_equal
PROTO((tree
, tree
));
1319 extern int tree_int_cst_lt
PROTO((tree
, tree
));
1320 extern int tree_int_cst_sgn
PROTO((tree
));
1321 extern int index_type_equal
PROTO((tree
, tree
));
1323 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1324 put the prototype here. Rtl.h does declare the prototype if
1325 tree.h had been included. */
1327 extern tree make_tree
PROTO((tree
, struct rtx_def
*));
1329 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1332 Such modified types already made are recorded so that duplicates
1335 extern tree build_type_attribute_variant
PROTO((tree
, tree
));
1336 extern tree build_decl_attribute_variant
PROTO((tree
, tree
));
1338 extern tree merge_machine_decl_attributes
PROTO((tree
, tree
));
1339 extern tree merge_machine_type_attributes
PROTO((tree
, tree
));
1341 /* Split a list of declspecs and attributes into two. */
1343 extern void split_specs_attrs
PROTO((tree
, tree
*, tree
*));
1345 /* Strip attributes from a list of combined specs and attrs. */
1347 extern tree strip_attrs
PROTO((tree
));
1349 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1351 extern int valid_machine_attribute
PROTO((tree
, tree
, tree
, tree
));
1353 /* Given a tree node and a string, return non-zero if the tree node is
1354 a valid attribute name for the string. */
1356 extern int is_attribute_p
PROTO((char *, tree
));
1358 /* Given an attribute name and a list of attributes, return the list element
1359 of the attribute or NULL_TREE if not found. */
1361 extern tree lookup_attribute
PROTO((char *, tree
));
1363 /* Given two attributes lists, return a list of their union. */
1365 extern tree merge_attributes
PROTO((tree
, tree
));
1367 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1368 for the same kind of data as TYPE describes.
1369 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1370 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1371 so that duplicate variants are never made.
1372 Only main variants should ever appear as types of expressions. */
1374 extern tree build_type_variant
PROTO((tree
, int, int));
1376 /* Make a copy of a type node. */
1378 extern tree build_type_copy
PROTO((tree
));
1380 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1381 TYPE_ALIGN and TYPE_MODE fields.
1382 If called more than once on one node, does nothing except
1383 for the first time. */
1385 extern void layout_type
PROTO((tree
));
1387 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1388 return a canonicalized ..._TYPE node, so that duplicates are not made.
1389 How the hash code is computed is up to the caller, as long as any two
1390 callers that could hash identical-looking type nodes agree. */
1392 extern tree type_hash_canon
PROTO((int, tree
));
1394 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1395 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1396 fields. Call this only once for any given decl node.
1398 Second argument is the boundary that this field can be assumed to
1399 be starting at (in bits). Zero means it can be assumed aligned
1400 on any boundary that may be needed. */
1402 extern void layout_decl
PROTO((tree
, unsigned));
1404 /* Return an expr equal to X but certainly not valid as an lvalue. */
1406 extern tree non_lvalue
PROTO((tree
));
1407 extern tree pedantic_non_lvalue
PROTO((tree
));
1409 extern tree convert
PROTO((tree
, tree
));
1410 extern tree size_in_bytes
PROTO((tree
));
1411 extern int int_size_in_bytes
PROTO((tree
));
1412 extern tree size_binop
PROTO((enum tree_code
, tree
, tree
));
1413 extern tree size_int_wide
PROTO((unsigned HOST_WIDE_INT
,
1414 unsigned HOST_WIDE_INT
, int));
1415 #define size_int(L) size_int_2 ((L), 0, 0)
1416 #define bitsize_int(L, H) size_int_2 ((L), (H), 1)
1417 #define size_int_2(L, H, T) \
1418 size_int_wide ((unsigned HOST_WIDE_INT) (L), \
1419 (unsigned HOST_WIDE_INT) (H), (T))
1421 extern tree round_up
PROTO((tree
, int));
1422 extern tree get_pending_sizes
PROTO((void));
1423 extern void put_pending_sizes
PROTO((tree
));
1425 /* Type for sizes of data-type. */
1427 #define BITS_PER_UNIT_LOG \
1428 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1429 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1430 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1432 extern tree sizetype_tab
[2], sbitsizetype
, ubitsizetype
;
1433 #define sizetype sizetype_tab[0]
1434 #define bitsizetype sizetype_tab[1]
1436 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1437 extern int maximum_field_alignment
;
1439 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1440 extern int set_alignment
;
1442 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1443 by making the last node in X point to Y.
1444 Returns X, except if X is 0 returns Y. */
1446 extern tree chainon
PROTO((tree
, tree
));
1448 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1450 extern tree tree_cons
PROTO((tree
, tree
, tree
));
1451 extern tree perm_tree_cons
PROTO((tree
, tree
, tree
));
1452 extern tree temp_tree_cons
PROTO((tree
, tree
, tree
));
1453 extern tree saveable_tree_cons
PROTO((tree
, tree
, tree
));
1454 extern tree decl_tree_cons
PROTO((tree
, tree
, tree
));
1455 extern tree expr_tree_cons
PROTO((tree
, tree
, tree
));
1457 /* Return the last tree node in a chain. */
1459 extern tree tree_last
PROTO((tree
));
1461 /* Reverse the order of elements in a chain, and return the new head. */
1463 extern tree nreverse
PROTO((tree
));
1465 /* Returns the length of a chain of nodes
1466 (number of chain pointers to follow before reaching a null pointer). */
1468 extern int list_length
PROTO((tree
));
1470 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1472 extern int integer_zerop
PROTO((tree
));
1474 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1476 extern int integer_onep
PROTO((tree
));
1478 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1479 all of whose significant bits are 1. */
1481 extern int integer_all_onesp
PROTO((tree
));
1483 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1484 exactly one bit 1. */
1486 extern int integer_pow2p
PROTO((tree
));
1488 /* staticp (tree x) is nonzero if X is a reference to data allocated
1489 at a fixed address in memory. */
1491 extern int staticp
PROTO((tree
));
1493 /* Gets an error if argument X is not an lvalue.
1494 Also returns 1 if X is an lvalue, 0 if not. */
1496 extern int lvalue_or_else
PROTO((tree
, char *));
1498 /* save_expr (EXP) returns an expression equivalent to EXP
1499 but it can be used multiple times within context CTX
1500 and only evaluate EXP once. */
1502 extern tree save_expr
PROTO((tree
));
1504 /* Returns the index of the first non-tree operand for CODE, or the number
1505 of operands if all are trees. */
1507 extern int first_rtl_op
PROTO((enum tree_code
));
1509 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1510 can be used multiple times and will evaluate EXP, in it's entirety
1513 extern tree unsave_expr
PROTO((tree
));
1515 /* unsave_expr_now (EXP) resets EXP in place, so that it can be
1518 extern tree unsave_expr_now
PROTO((tree
));
1520 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1521 or offset that depends on a field within a record.
1523 Note that we only allow such expressions within simple arithmetic
1526 extern int contains_placeholder_p
PROTO((tree
));
1528 /* Return 1 if EXP contains any expressions that produce cleanups for an
1529 outer scope to deal with. Used by fold. */
1531 extern int has_cleanups
PROTO((tree
));
1533 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1534 return a tree with all occurrences of references to F in a
1535 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1536 contains only arithmetic expressions. */
1538 extern tree substitute_in_expr
PROTO((tree
, tree
, tree
));
1540 /* variable_size (EXP) is like save_expr (EXP) except that it
1541 is for the special case of something that is part of a
1542 variable size for a data type. It makes special arrangements
1543 to compute the value at the right time when the data type
1544 belongs to a function parameter. */
1546 extern tree variable_size
PROTO((tree
));
1548 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1549 but it can be used multiple times
1550 and only evaluate the subexpressions once. */
1552 extern tree stabilize_reference
PROTO((tree
));
1554 /* Subroutine of stabilize_reference; this is called for subtrees of
1555 references. Any expression with side-effects must be put in a SAVE_EXPR
1556 to ensure that it is only evaluated once. */
1558 extern tree stabilize_reference_1
PROTO((tree
));
1560 /* Return EXP, stripped of any conversions to wider types
1561 in such a way that the result of converting to type FOR_TYPE
1562 is the same as if EXP were converted to FOR_TYPE.
1563 If FOR_TYPE is 0, it signifies EXP's type. */
1565 extern tree get_unwidened
PROTO((tree
, tree
));
1567 /* Return OP or a simpler expression for a narrower value
1568 which can be sign-extended or zero-extended to give back OP.
1569 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1570 or 0 if the value should be sign-extended. */
1572 extern tree get_narrower
PROTO((tree
, int *));
1574 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1576 The definition of this resides in language-specific code
1577 as the repertoire of available types may vary. */
1579 extern tree type_for_mode
PROTO((enum machine_mode
, int));
1581 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1582 for an integer type with at least that precision.
1583 The definition of this resides in language-specific code
1584 as the repertoire of available types may vary. */
1586 extern tree type_for_size
PROTO((unsigned, int));
1588 /* Given an integer type T, return a type like T but unsigned.
1589 If T is unsigned, the value is T.
1590 The definition of this resides in language-specific code
1591 as the repertoire of available types may vary. */
1593 extern tree unsigned_type
PROTO((tree
));
1595 /* Given an integer type T, return a type like T but signed.
1596 If T is signed, the value is T.
1597 The definition of this resides in language-specific code
1598 as the repertoire of available types may vary. */
1600 extern tree signed_type
PROTO((tree
));
1602 /* This function must be defined in the language-specific files.
1603 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1604 This is defined in a language-specific file. */
1606 extern tree maybe_build_cleanup
PROTO((tree
));
1608 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1609 look for nested component-refs or array-refs at constant positions
1610 and find the ultimate containing object, which is returned. */
1612 extern tree get_inner_reference
PROTO((tree
, int *, int *, tree
*,
1613 enum machine_mode
*, int *,
1616 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1618 extern tree decl_function_context
PROTO((tree
));
1620 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1621 this _DECL with its context, or zero if none. */
1622 extern tree decl_type_context
PROTO((tree
));
1624 /* Given the FUNCTION_DECL for the current function,
1625 return zero if it is ok for this function to be inline.
1626 Otherwise return a warning message with a single %s
1627 for the function's name. */
1629 extern char *function_cannot_inline_p
PROTO((tree
));
1631 /* Return 1 if EXPR is the real constant zero. */
1632 extern int real_zerop
PROTO((tree
));
1634 /* Declare commonly used variables for tree structure. */
1636 /* An integer constant with value 0 */
1637 extern tree integer_zero_node
;
1639 /* An integer constant with value 1 */
1640 extern tree integer_one_node
;
1642 /* An integer constant with value 0 whose type is sizetype. */
1643 extern tree size_zero_node
;
1645 /* An integer constant with value 1 whose type is sizetype. */
1646 extern tree size_one_node
;
1648 /* A constant of type pointer-to-int and value 0 */
1649 extern tree null_pointer_node
;
1651 /* A node of type ERROR_MARK. */
1652 extern tree error_mark_node
;
1654 /* The type node for the void type. */
1655 extern tree void_type_node
;
1657 /* The type node for the ordinary (signed) integer type. */
1658 extern tree integer_type_node
;
1660 /* The type node for the unsigned integer type. */
1661 extern tree unsigned_type_node
;
1663 /* The type node for the ordinary character type. */
1664 extern tree char_type_node
;
1666 /* Points to the name of the input file from which the current input
1667 being parsed originally came (before it went into cpp). */
1668 extern char *input_filename
;
1670 /* Current line number in input file. */
1673 /* Nonzero for -pedantic switch: warn about anything
1674 that standard C forbids. */
1675 extern int pedantic
;
1677 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1678 Zero means allow extended lvalues. */
1680 extern int pedantic_lvalues
;
1682 /* Nonzero means can safely call expand_expr now;
1683 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1685 extern int immediate_size_expand
;
1687 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1689 extern tree current_function_decl
;
1691 /* Nonzero if function being compiled can call setjmp. */
1693 extern int current_function_calls_setjmp
;
1695 /* Nonzero if function being compiled can call longjmp. */
1697 extern int current_function_calls_longjmp
;
1699 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1701 extern int all_types_permanent
;
1703 /* Pointer to function to compute the name to use to print a declaration.
1704 DECL is the declaration in question.
1705 VERBOSITY determines what information will be printed:
1706 0: DECL_NAME, demangled as necessary.
1707 1: and scope information.
1708 2: and any other information that might be interesting, such as function
1709 parameter types in C++. */
1711 extern char *(*decl_printable_name
) PROTO((tree
, int));
1713 /* Pointer to function to finish handling an incomplete decl at the
1714 end of compilation. */
1716 extern void (*incomplete_decl_finalize_hook
) PROTO((tree
));
1719 extern char *perm_calloc
PROTO((int, long));
1720 extern tree get_file_function_name
PROTO((int));
1721 extern tree get_set_constructor_bits
PROTO((tree
, char *, int));
1722 extern tree get_set_constructor_bytes
PROTO((tree
,
1723 unsigned char *, int));
1727 extern void expand_fixups
PROTO((struct rtx_def
*));
1728 extern tree expand_start_stmt_expr
PROTO((void));
1729 extern tree expand_end_stmt_expr
PROTO((tree
));
1730 extern void expand_expr_stmt
PROTO((tree
));
1731 extern int warn_if_unused_value
PROTO((tree
));
1732 extern void expand_decl_init
PROTO((tree
));
1733 extern void clear_last_expr
PROTO((void));
1734 extern void expand_label
PROTO((tree
));
1735 extern void expand_goto
PROTO((tree
));
1736 extern void expand_asm
PROTO((tree
));
1737 extern void expand_start_cond
PROTO((tree
, int));
1738 extern void expand_end_cond
PROTO((void));
1739 extern void expand_start_else
PROTO((void));
1740 extern void expand_start_elseif
PROTO((tree
));
1741 extern struct nesting
*expand_start_loop
PROTO((int));
1742 extern struct nesting
*expand_start_loop_continue_elsewhere
PROTO((int));
1743 extern void expand_loop_continue_here
PROTO((void));
1744 extern void expand_end_loop
PROTO((void));
1745 extern int expand_continue_loop
PROTO((struct nesting
*));
1746 extern int expand_exit_loop
PROTO((struct nesting
*));
1747 extern int expand_exit_loop_if_false
PROTO((struct nesting
*,
1749 extern int expand_exit_something
PROTO((void));
1751 extern void expand_null_return
PROTO((void));
1752 extern void expand_return
PROTO((tree
));
1753 extern void expand_start_bindings
PROTO((int));
1754 extern void expand_end_bindings
PROTO((tree
, int, int));
1755 extern void start_cleanup_deferral
PROTO((void));
1756 extern void end_cleanup_deferral
PROTO((void));
1757 extern void mark_block_as_eh_region
PROTO((void));
1758 extern void mark_block_as_not_eh_region
PROTO((void));
1759 extern int is_eh_region
PROTO((void));
1760 extern int conditional_context
PROTO((void));
1761 extern tree last_cleanup_this_contour
PROTO((void));
1762 extern int expand_dhc_cleanup
PROTO((tree
));
1763 extern int expand_dcc_cleanup
PROTO((tree
));
1764 extern void expand_start_case
PROTO((int, tree
, tree
,
1766 extern void expand_end_case
PROTO((tree
));
1767 extern int pushcase
PROTO((tree
,
1768 tree (*) (tree
, tree
),
1770 extern int pushcase_range
PROTO((tree
, tree
,
1771 tree (*) (tree
, tree
),
1774 /* In fold-const.c */
1776 /* Fold constants as much as possible in an expression.
1777 Returns the simplified expression.
1778 Acts only on the top level of the expression;
1779 if the argument itself cannot be simplified, its
1780 subexpressions are not changed. */
1782 extern tree fold
PROTO((tree
));
1784 extern int force_fit_type
PROTO((tree
, int));
1785 extern int add_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1786 HOST_WIDE_INT
, HOST_WIDE_INT
,
1787 HOST_WIDE_INT
*, HOST_WIDE_INT
*));
1788 extern int neg_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1789 HOST_WIDE_INT
*, HOST_WIDE_INT
*));
1790 extern int mul_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1791 HOST_WIDE_INT
, HOST_WIDE_INT
,
1792 HOST_WIDE_INT
*, HOST_WIDE_INT
*));
1793 extern void lshift_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1794 HOST_WIDE_INT
, int, HOST_WIDE_INT
*,
1795 HOST_WIDE_INT
*, int));
1796 extern void rshift_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1798 HOST_WIDE_INT
*, HOST_WIDE_INT
*, int));
1799 extern void lrotate_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1800 HOST_WIDE_INT
, int, HOST_WIDE_INT
*,
1802 extern void rrotate_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1803 HOST_WIDE_INT
, int, HOST_WIDE_INT
*,
1805 extern int operand_equal_p
PROTO((tree
, tree
, int));
1806 extern tree invert_truthvalue
PROTO((tree
));
1808 /* Interface of the DWARF2 unwind info support. */
1810 /* Decide whether we want to emit frame unwind information for the current
1811 translation unit. */
1813 extern int dwarf2out_do_frame
PROTO((void));
1815 /* Generate a new label for the CFI info to refer to. */
1817 extern char *dwarf2out_cfi_label
PROTO((void));
1819 /* Entry point to update the canonical frame address (CFA). */
1821 extern void dwarf2out_def_cfa
PROTO((char *, unsigned, long));
1823 /* Add the CFI for saving a register window. */
1825 extern void dwarf2out_window_save
PROTO((char *));
1827 /* Add a CFI to update the running total of the size of arguments pushed
1830 extern void dwarf2out_args_size
PROTO((char *, long));
1832 /* Entry point for saving a register to the stack. */
1834 extern void dwarf2out_reg_save
PROTO((char *, unsigned, long));
1836 /* Entry point for saving the return address in the stack. */
1838 extern void dwarf2out_return_save
PROTO((char *, long));
1840 /* Entry point for saving the return address in a register. */
1842 extern void dwarf2out_return_reg
PROTO((char *, unsigned));
1844 /* Output a marker (i.e. a label) for the beginning of a function, before
1847 extern void dwarf2out_begin_prologue
PROTO((void));
1849 /* Output a marker (i.e. a label) for the absolute end of the generated
1850 code for a function definition. */
1852 extern void dwarf2out_end_epilogue
PROTO((void));
1854 /* The language front-end must define these functions. */
1856 /* Function of no arguments for initializing lexical scanning. */
1857 extern void init_lex
PROTO((void));
1858 /* Function of no arguments for initializing the symbol table. */
1859 extern void init_decl_processing
PROTO((void));
1861 /* Functions called with no arguments at the beginning and end or processing
1862 the input source file. */
1863 extern void lang_init
PROTO((void));
1864 extern void lang_finish
PROTO((void));
1866 /* Function to identify which front-end produced the output file. */
1867 extern char *lang_identify
PROTO((void));
1869 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
1870 extern void copy_lang_decl
PROTO((tree
));
1872 /* Function called with no arguments to parse and compile the input. */
1873 extern int yyparse
PROTO((void));
1874 /* Function called with option as argument
1875 to decode options starting with -f or -W or +.
1876 It should return nonzero if it handles the option. */
1877 extern int lang_decode_option
PROTO((char *));
1879 /* Functions for processing symbol declarations. */
1880 /* Function to enter a new lexical scope.
1881 Takes one argument: always zero when called from outside the front end. */
1882 extern void pushlevel
PROTO((int));
1883 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1884 Takes three arguments:
1885 KEEP -- nonzero if there were declarations in this scope.
1886 REVERSE -- reverse the order of decls before returning them.
1887 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1888 extern tree poplevel
PROTO((int, int, int));
1889 /* Set the BLOCK node for the current scope level. */
1890 extern void set_block
PROTO((tree
));
1891 /* Function to add a decl to the current scope level.
1892 Takes one argument, a decl to add.
1893 Returns that decl, or, if the same symbol is already declared, may
1894 return a different decl for that name. */
1895 extern tree pushdecl
PROTO((tree
));
1896 /* Function to return the chain of decls so far in the current scope level. */
1897 extern tree getdecls
PROTO((void));
1898 /* Function to return the chain of structure tags in the current scope level. */
1899 extern tree gettags
PROTO((void));
1901 extern tree build_range_type
PROTO((tree
, tree
, tree
));
1903 /* Call when starting to parse a declaration:
1904 make expressions in the declaration last the length of the function.
1905 Returns an argument that should be passed to resume_momentary later. */
1906 extern int suspend_momentary
PROTO((void));
1908 extern int allocation_temporary_p
PROTO((void));
1910 /* Call when finished parsing a declaration:
1911 restore the treatment of node-allocation that was
1912 in effect before the suspension.
1913 YES should be the value previously returned by suspend_momentary. */
1914 extern void resume_momentary
PROTO((int));
1916 /* Called after finishing a record, union or enumeral type. */
1917 extern void rest_of_type_compilation
PROTO((tree
, int));
1919 /* Save the current set of obstacks, but don't change them. */
1920 extern void push_obstacks_nochange
PROTO((void));
1922 extern void permanent_allocation
PROTO((int));
1924 extern void push_momentary
PROTO((void));
1926 extern void clear_momentary
PROTO((void));
1928 extern void pop_momentary
PROTO((void));
1930 extern void end_temporary_allocation
PROTO((void));
1932 /* Pop the obstack selection stack. */
1933 extern void pop_obstacks
PROTO((void));
1936 extern int really_constant_p
PROTO ((tree
));
1937 extern void push_obstacks
PROTO ((struct obstack
*,
1939 extern void pop_momentary_nofree
PROTO ((void));
1940 extern void preserve_momentary
PROTO ((void));
1941 extern void saveable_allocation
PROTO ((void));
1942 extern void temporary_allocation
PROTO ((void));
1943 extern void resume_temporary_allocation
PROTO ((void));
1944 extern tree get_file_function_name
PROTO ((int));
1945 extern void set_identifier_size
PROTO ((int));
1946 extern int int_fits_type_p
PROTO ((tree
, tree
));
1947 extern int tree_log2
PROTO ((tree
));
1948 extern void preserve_initializer
PROTO ((void));
1949 extern void preserve_data
PROTO ((void));
1950 extern int object_permanent_p
PROTO ((tree
));
1951 extern int type_precision
PROTO ((tree
));
1952 extern int simple_cst_equal
PROTO ((tree
, tree
));
1953 extern int type_list_equal
PROTO ((tree
, tree
));
1954 extern int chain_member
PROTO ((tree
, tree
));
1955 extern int chain_member_purpose
PROTO ((tree
, tree
));
1956 extern int chain_member_value
PROTO ((tree
, tree
));
1957 extern tree listify
PROTO ((tree
));
1958 extern tree type_hash_lookup
PROTO ((int, tree
));
1959 extern void type_hash_add
PROTO ((int, tree
));
1960 extern int type_hash_list
PROTO ((tree
));
1961 extern int simple_cst_list_equal
PROTO ((tree
, tree
));
1962 extern void debug_obstack
PROTO ((char *));
1963 extern void rtl_in_current_obstack
PROTO ((void));
1964 extern void rtl_in_saveable_obstack
PROTO ((void));
1965 extern void init_tree_codes
PROTO ((void));
1966 extern void dump_tree_statistics
PROTO ((void));
1967 extern void print_obstack_statistics
PROTO ((char *, struct obstack
*));
1969 extern void print_obstack_name
PROTO ((char *, FILE *, char *));
1971 extern void expand_function_end
PROTO ((char *, int, int));
1972 extern void expand_function_start
PROTO ((tree
, int));
1973 extern int real_onep
PROTO ((tree
));
1974 extern int real_twop
PROTO ((tree
));
1975 extern void start_identifier_warnings
PROTO ((void));
1976 extern void gcc_obstack_init
PROTO ((struct obstack
*));
1977 extern void init_obstacks
PROTO ((void));
1978 extern void obfree
PROTO ((char *));
1981 extern void setjmp_protect_args
PROTO ((void));
1982 extern void setjmp_protect
PROTO ((tree
));
1983 extern void expand_main_function
PROTO ((void));
1984 extern void mark_varargs
PROTO ((void));
1985 extern void init_function_start
PROTO ((tree
, char *, int));
1986 extern void assign_parms
PROTO ((tree
, int));
1987 extern void put_var_into_stack
PROTO ((tree
));
1988 extern void uninitialized_vars_warning
PROTO ((tree
));
1989 extern void setjmp_args_warning
PROTO ((void));
1990 extern void mark_all_temps_used
PROTO ((void));
1991 extern void init_temp_slots
PROTO ((void));
1992 extern void combine_temp_slots
PROTO ((void));
1993 extern void free_temp_slots
PROTO ((void));
1994 extern void pop_temp_slots
PROTO ((void));
1995 extern void push_temp_slots
PROTO ((void));
1996 extern void preserve_temp_slots
PROTO ((struct rtx_def
*));
1997 extern int aggregate_value_p
PROTO ((tree
));
1998 extern tree reorder_blocks
PROTO ((tree
*, tree
,
2000 extern void free_temps_for_rtl_expr
PROTO ((tree
));
2001 extern void instantiate_virtual_regs
PROTO ((tree
, struct rtx_def
*));
2002 extern int max_parm_reg_num
PROTO ((void));
2003 extern void push_function_context
PROTO ((void));
2004 extern void pop_function_context
PROTO ((void));
2005 extern void push_function_context_to
PROTO ((tree
));
2006 extern void pop_function_context_from
PROTO ((tree
));
2008 /* In print-rtl.c */
2010 extern void print_rtl
PROTO ((FILE *, struct rtx_def
*));
2013 /* In print-tree.c */
2014 extern void debug_tree
PROTO ((tree
));
2016 extern void print_node
PROTO ((FILE *, char *, tree
, int));
2017 extern void print_node_brief
PROTO ((FILE *, char *, tree
, int));
2018 extern void indent_to
PROTO ((FILE *, int));
2022 extern void emit_queue
PROTO ((void));
2023 extern int apply_args_register_offset
PROTO ((int));
2024 extern struct rtx_def
*expand_builtin_return_addr
2025 PROTO ((enum built_in_function
, int, struct rtx_def
*));
2026 extern void do_pending_stack_adjust
PROTO ((void));
2027 extern struct rtx_def
*expand_assignment
PROTO ((tree
, tree
, int, int));
2028 extern struct rtx_def
*store_expr
PROTO ((tree
, struct rtx_def
*,
2032 extern void start_sequence_for_rtl_expr
PROTO ((tree
));
2033 extern struct rtx_def
*emit_line_note_after
PROTO ((char *, int,
2035 extern struct rtx_def
*emit_line_note
PROTO ((char *, int));
2036 extern struct rtx_def
*emit_line_note_force
PROTO ((char *, int));
2039 extern int mark_addressable
PROTO ((tree
));
2040 extern void incomplete_type_error
PROTO ((tree
, tree
));
2043 extern void print_lang_statistics
PROTO ((void));
2046 extern tree truthvalue_conversion
PROTO ((tree
));
2047 extern int min_precision
PROTO ((tree
, int));
2048 extern void split_specs_attrs
PROTO ((tree
, tree
*, tree
*));
2052 extern void print_lang_decl
PROTO ((FILE *, tree
, int));
2053 extern void print_lang_type
PROTO ((FILE *, tree
, int));
2054 extern void print_lang_identifier
PROTO ((FILE *, tree
, int));
2056 extern int global_bindings_p
PROTO ((void));
2057 extern void insert_block
PROTO ((tree
));
2059 /* In integrate.c */
2060 extern void save_for_inline_nocopy
PROTO ((tree
));
2061 extern void save_for_inline_copying
PROTO ((tree
));
2062 extern void set_decl_abstract_flags
PROTO ((tree
, int));
2063 extern void output_inline_function
PROTO ((tree
));
2066 extern void set_yydebug
PROTO ((int));
2068 /* In stor-layout.c */
2069 extern void fixup_signed_type
PROTO ((tree
));
2072 extern void make_decl_rtl
PROTO ((tree
, char *, int));
2073 extern void make_decl_one_only
PROTO ((tree
));
2074 extern void variable_section
PROTO ((tree
, int));
2077 extern void print_time
PROTO ((char *, int));
2078 extern int get_run_time
PROTO ((void));
2079 extern void debug_start_source_file
PROTO ((char *));
2080 extern void debug_end_source_file
PROTO ((unsigned));
2081 extern void debug_define
PROTO ((unsigned, char *));
2082 extern void debug_undef
PROTO ((unsigned, char *));
2083 extern void rest_of_decl_compilation
PROTO ((tree
, char *, int, int));
2084 extern void rest_of_type_compilation
PROTO ((tree
, int));
2085 extern void rest_of_compilation
PROTO ((tree
));
2086 extern void fatal
PVPROTO ((char *, ...));
2087 extern void fatal_io_error
PROTO ((char *));
2089 extern void warning
PVPROTO ((char *, ...));
2090 extern void error
PVPROTO ((char *, ...));
2092 extern void pedwarn
PVPROTO ((char *, ...));
2093 extern void pedwarn_with_decl
PVPROTO ((tree
, char *, ...));
2094 extern void pedwarn_with_file_and_line
PVPROTO ((char *, int, char *, ...));
2095 extern void warning_with_file_and_line
PVPROTO ((char *, int, char *, ...));
2096 extern void warning_with_decl
PVPROTO ((tree
, char *, ...));
2097 extern void error_with_decl
PVPROTO ((tree
, char *, ...));
2098 extern void error_with_file_and_line
PVPROTO ((char *, int, char *, ...));
2099 extern void sorry
PVPROTO ((char *s
, ...));
2100 extern void default_print_error_function
PROTO ((char *));
2101 extern void report_error_function
PROTO ((char *));
2102 extern void announce_function
PROTO ((tree
));
2104 /* In fold-const.c */
2105 extern int div_and_round_double
PROTO ((enum tree_code
, int,
2106 HOST_WIDE_INT
, HOST_WIDE_INT
,
2107 HOST_WIDE_INT
, HOST_WIDE_INT
,
2114 extern void emit_nop
PROTO ((void));
2115 extern void expand_computed_goto
PROTO ((tree
));
2116 extern struct rtx_def
*label_rtx
PROTO ((tree
));
2117 extern void expand_asm_operands
PROTO ((tree
, tree
, tree
, tree
, int,
2119 extern int any_pending_cleanups
PROTO ((int));
2120 extern void init_stmt
PROTO ((void));
2121 extern void init_stmt_for_function
PROTO ((void));
2122 extern void remember_end_note
PROTO ((tree
));
2123 extern int drop_through_at_end_p
PROTO ((void));
2124 extern void expand_start_target_temps
PROTO ((void));
2125 extern void expand_end_target_temps
PROTO ((void));
2126 extern void expand_elseif
PROTO ((tree
));
2127 extern void expand_decl
PROTO ((tree
));
2128 extern int expand_decl_cleanup
PROTO ((tree
, tree
));
2129 extern void expand_anon_union_decl
PROTO ((tree
, tree
, tree
));
2130 extern void move_cleanups_up
PROTO ((void));
2131 extern void expand_start_case_dummy
PROTO ((void));
2132 extern void expand_end_case_dummy
PROTO ((void));
2133 extern tree case_index_expr_type
PROTO ((void));
2134 extern HOST_WIDE_INT all_cases_count
PROTO ((tree
, int *));
2135 extern void mark_seen_cases
PROTO ((tree
, unsigned char *,
2137 extern void check_for_full_enumeration_handling
PROTO ((tree
));
2138 extern void declare_nonlocal_label
PROTO ((tree
));
2140 /* If KIND=='I', return a suitable global initializer (constructor) name.
2141 If KIND=='D', return a suitable global clean-up (destructor) name. */
2142 extern tree get_file_function_name
PROTO((int));
2144 /* Interface of the DWARF2 unwind info support. */
2146 /* Decide whether we want to emit frame unwind information for the current
2147 translation unit. */
2149 extern int dwarf2out_do_frame
PROTO((void));
2151 /* Generate a new label for the CFI info to refer to. */
2153 extern char *dwarf2out_cfi_label
PROTO((void));
2155 /* Entry point to update the canonical frame address (CFA). */
2157 extern void dwarf2out_def_cfa
PROTO((char *, unsigned, long));
2159 /* Add the CFI for saving a register window. */
2161 extern void dwarf2out_window_save
PROTO((char *));
2163 /* Add a CFI to update the running total of the size of arguments pushed
2166 extern void dwarf2out_args_size
PROTO((char *, long));
2168 /* Entry point for saving a register to the stack. */
2170 extern void dwarf2out_reg_save
PROTO((char *, unsigned, long));
2172 /* Entry point for saving the return address in the stack. */
2174 extern void dwarf2out_return_save
PROTO((char *, long));
2176 /* Entry point for saving the return address in a register. */
2178 extern void dwarf2out_return_reg
PROTO((char *, unsigned));
2180 /* Output a marker (i.e. a label) for the beginning of a function, before
2183 extern void dwarf2out_begin_prologue
PROTO((void));
2185 /* Output a marker (i.e. a label) for the absolute end of the generated
2186 code for a function definition. */
2188 extern void dwarf2out_end_epilogue
PROTO((void));