1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 93, 94, 95, 96, 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 /* Returns non-zero iff CLASS is the tree-code class of an
57 #define IS_EXPR_CODE_CLASS(CLASS) \
58 (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == '3' \
61 /* Number of argument-words in each kind of tree-node. */
63 extern int tree_code_length
[MAX_TREE_CODES
];
65 /* Names of tree components. */
67 extern char *tree_code_name
[MAX_TREE_CODES
];
69 /* Codes that identify the various built in functions
70 so that expand_call can identify them quickly. */
72 enum built_in_function
98 BUILT_IN_CLASSIFY_TYPE
,
102 BUILT_IN_FRAME_ADDRESS
,
103 BUILT_IN_RETURN_ADDRESS
,
104 BUILT_IN_AGGREGATE_INCOMING_ADDRESS
,
105 BUILT_IN_CALLER_RETURN_ADDRESS
,
112 /* Various hooks for the DWARF 2 __throw routine. */
113 BUILT_IN_FP
, BUILT_IN_SP
,
114 BUILT_IN_UNWIND_INIT
,
115 BUILT_IN_DWARF_FP_REGNUM
,
116 BUILT_IN_DWARF_REG_SIZE
,
117 BUILT_IN_FROB_RETURN_ADDR
,
118 BUILT_IN_EXTRACT_RETURN_ADDR
,
119 BUILT_IN_SET_RETURN_ADDR_REG
,
121 BUILT_IN_SET_EH_REGS
,
129 /* Upper bound on non-language-specific builtins. */
133 /* The definition of tree nodes fills the next several pages. */
135 /* A tree node can represent a data type, a variable, an expression
136 or a statement. Each node has a TREE_CODE which says what kind of
137 thing it represents. Some common codes are:
138 INTEGER_TYPE -- represents a type of integers.
139 ARRAY_TYPE -- represents a type of pointer.
140 VAR_DECL -- represents a declared variable.
141 INTEGER_CST -- represents a constant integer value.
142 PLUS_EXPR -- represents a sum (an expression).
144 As for the contents of a tree node: there are some fields
145 that all nodes share. Each TREE_CODE has various special-purpose
146 fields as well. The fields of a node are never accessed directly,
147 always through accessor macros. */
149 /* This type is used everywhere to refer to a tree node. */
151 typedef union tree_node
*tree
;
153 /* Every kind of tree node starts with this structure,
154 so all nodes have these fields.
156 See the accessor macros, defined below, for documentation of the fields. */
160 union tree_node
*chain
;
161 union tree_node
*type
;
162 #ifdef ONLY_INT_FIELDS
163 unsigned int code
: 8;
165 enum tree_code code
: 8;
168 unsigned side_effects_flag
: 1;
169 unsigned constant_flag
: 1;
170 unsigned permanent_flag
: 1;
171 unsigned addressable_flag
: 1;
172 unsigned volatile_flag
: 1;
173 unsigned readonly_flag
: 1;
174 unsigned unsigned_flag
: 1;
175 unsigned asm_written_flag
: 1;
177 unsigned used_flag
: 1;
178 unsigned raises_flag
: 1;
179 unsigned static_flag
: 1;
180 unsigned public_flag
: 1;
181 unsigned private_flag
: 1;
182 unsigned protected_flag
: 1;
184 unsigned lang_flag_0
: 1;
185 unsigned lang_flag_1
: 1;
186 unsigned lang_flag_2
: 1;
187 unsigned lang_flag_3
: 1;
188 unsigned lang_flag_4
: 1;
189 unsigned lang_flag_5
: 1;
190 unsigned lang_flag_6
: 1;
191 /* There is room for three more flags. */
194 /* The following table lists the uses of each of the above flags and
195 for which types of nodes they are defined. Note that expressions
201 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
207 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
208 TREE_NO_UNUSED_WARNING in
209 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
211 TREE_LIST or TREE_VEC
212 TREE_CONSTANT_OVERFLOW in
213 INTEGER_CST, REAL_CST, COMPLEX_CST
214 TREE_SYMBOL_REFERENCED in
220 INTEGER_CST, REAL_CST, COMPLEX_CST
222 VAR_DECL or FUNCTION_DECL
224 TREE_LIST or TREE_VEC
229 TREE_LIST or TREE_VEC
231 ??? unspecified nodes
235 TREE_VIA_PROTECTED in
239 ??? unspecified nodes
248 TREE_THIS_VOLATILE in
258 VAR_DECL if iterator (C)
267 permanent_flag: TREE_PERMANENT in all nodes
272 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
273 DECL_BUILT_IN_NONANSI in
277 SAVE_EXPR_NOPLACEHOLDER in
283 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
289 expressions, IDENTIFIER_NODE
297 /* Define accessors for the fields that all tree nodes have
298 (though some fields are not used for all kinds of nodes). */
300 /* The tree-code says what kind of node it is.
301 Codes are defined in tree.def. */
302 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
303 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
305 /* In all nodes that are expressions, this is the data type of the expression.
306 In POINTER_TYPE nodes, this is the type that the pointer points to.
307 In ARRAY_TYPE nodes, this is the type of the elements. */
308 #define TREE_TYPE(NODE) ((NODE)->common.type)
310 /* Nodes are chained together for many purposes.
311 Types are chained together to record them for being output to the debugger
312 (see the function `chain_type').
313 Decls in the same scope are chained together to record the contents
315 Statement nodes for successive statements used to be chained together.
316 Often lists of things are represented by TREE_LIST nodes that
317 are chained together. */
319 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
321 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
322 that don't change the machine mode. */
324 #define STRIP_NOPS(EXP) \
325 while ((TREE_CODE (EXP) == NOP_EXPR \
326 || TREE_CODE (EXP) == CONVERT_EXPR \
327 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
328 && (TYPE_MODE (TREE_TYPE (EXP)) \
329 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
330 (EXP) = TREE_OPERAND (EXP, 0);
332 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
334 #define STRIP_TYPE_NOPS(EXP) \
335 while ((TREE_CODE (EXP) == NOP_EXPR \
336 || TREE_CODE (EXP) == CONVERT_EXPR \
337 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
338 && (TREE_TYPE (EXP) \
339 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
340 (EXP) = TREE_OPERAND (EXP, 0);
342 /* Nonzero if TYPE represents an integral type. Note that we do not
343 include COMPLEX types here. */
345 #define INTEGRAL_TYPE_P(TYPE) \
346 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
347 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
349 /* Nonzero if TYPE represents a floating-point type, including complex
350 floating-point types. */
352 #define FLOAT_TYPE_P(TYPE) \
353 (TREE_CODE (TYPE) == REAL_TYPE \
354 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
355 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
357 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
359 #define AGGREGATE_TYPE_P(TYPE) \
360 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
361 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
362 || TREE_CODE (TYPE) == SET_TYPE)
364 /* Nonzero if TYPE represents a pointer type. */
366 #define POINTER_TYPE_P(TYPE) \
367 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
369 /* Define many boolean fields that all tree nodes have. */
371 /* In VAR_DECL nodes, nonzero means address of this is needed.
372 So it cannot be in a register.
373 In a FUNCTION_DECL, nonzero means its address is needed.
374 So it must be compiled even if it is an inline function.
375 In CONSTRUCTOR nodes, it means object constructed must be in memory.
376 In LABEL_DECL nodes, it means a goto for this label has been seen
377 from a place outside all binding contours that restore stack levels.
378 In ..._TYPE nodes, it means that objects of this type must
379 be fully addressable. This means that pieces of this
380 object cannot go into register parameters, for example.
381 In IDENTIFIER_NODEs, this means that some extern decl for this name
382 had its address taken. That matters for inline functions. */
383 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
385 /* In a VAR_DECL, nonzero means allocate static storage.
386 In a FUNCTION_DECL, nonzero if function has been defined.
387 In a CONSTRUCTOR, nonzero means allocate static storage. */
388 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
390 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
391 made implicitly and should not lead to an "unused value" warning. */
392 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
394 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
395 chain is via a `virtual' declaration. */
396 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
398 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
399 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
400 requires a diagnostic when overflows occur in constant expressions. */
401 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
403 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
404 this string as an argument. */
405 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
407 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
408 overflow in folding, and no warning has been issued for this subexpression.
409 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
410 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
412 /* In a VAR_DECL or FUNCTION_DECL,
413 nonzero means name is to be accessible from outside this module.
414 In an identifier node, nonzero means an external declaration
415 accessible from outside this module was previously seen
416 for this name in an inner scope. */
417 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
419 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
420 base class is via a `public' declaration, which preserves public
421 fields from the base class as public. */
422 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
424 /* Ditto, for `private' declarations. */
425 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
427 /* Nonzero for TREE_LIST node means that the path to the
428 base class is via a `protected' declaration, which preserves
429 protected fields from the base class as protected.
431 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
433 /* In any expression, nonzero means it has side effects or reevaluation
434 of the whole expression could produce a different value.
435 This is set if any subexpression is a function call, a side effect
436 or a reference to a volatile variable.
437 In a ..._DECL, this is set only if the declaration said `volatile'. */
438 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
440 /* Nonzero means this expression is volatile in the C sense:
441 its address should be of type `volatile WHATEVER *'.
442 In other words, the declared item is volatile qualified.
443 This is used in _DECL nodes and _REF nodes.
445 In a ..._TYPE node, means this type is volatile-qualified.
446 But use TYPE_VOLATILE instead of this macro when the node is a type,
447 because eventually we may make that a different bit.
449 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
450 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
452 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
453 nonzero means it may not be the lhs of an assignment.
454 In a ..._TYPE node, means this type is const-qualified
455 (but the macro TYPE_READONLY should be used instead of this macro
456 when the node is a type). */
457 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
459 /* Value of expression is constant.
460 Always appears in all ..._CST nodes.
461 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
462 if the value is constant. */
463 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
465 /* Nonzero means permanent node;
466 node will continue to exist for the entire compiler run.
467 Otherwise it will be recycled at the end of the function. */
468 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
470 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
471 In FIELD_DECL nodes, means an unsigned bit field.
472 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
473 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
475 /* Nonzero in a VAR_DECL means assembler code has been written.
476 Nonzero in a FUNCTION_DECL means that the function has been compiled.
477 This is interesting in an inline function, since it might not need
478 to be compiled separately.
479 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
480 if the sdb debugging info for the type has been written.
481 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
482 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
484 /* Nonzero in a _DECL if the name is used in its scope.
485 Nonzero in an expr node means inhibit warning if value is unused.
486 In IDENTIFIER_NODEs, this means that some extern decl for this name
488 #define TREE_USED(NODE) ((NODE)->common.used_flag)
490 /* Nonzero for a tree node whose evaluation could result
491 in the raising of an exception. Not implemented yet. */
492 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
494 /* Used in classes in C++. */
495 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
496 /* Used in classes in C++.
497 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
498 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
500 /* These flags are available for each language front end to use internally. */
501 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
502 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
503 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
504 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
505 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
506 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
507 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
509 /* Define additional fields and accessors for nodes representing constants. */
511 /* In an INTEGER_CST node. These two together make a 2-word integer.
512 If the data type is signed, the value is sign-extended to 2 words
513 even though not all of them may really be in use.
514 In an unsigned constant shorter than 2 words, the extra bits are 0. */
515 #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low)
516 #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high)
518 #define INT_CST_LT(A, B) \
519 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
520 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
521 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
522 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
524 #define INT_CST_LT_UNSIGNED(A, B) \
525 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
526 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
527 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
528 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
529 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
530 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
534 char common
[sizeof (struct tree_common
)];
535 struct rtx_def
*rtl
; /* acts as link to register transfer language
537 HOST_WIDE_INT int_cst_low
;
538 HOST_WIDE_INT int_cst_high
;
541 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
542 and generally in all kinds of constants that could
543 be given labels (rather than being immediate). */
545 #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl)
547 /* In a REAL_CST node. */
548 /* We can represent a real value as either a `double' or a string.
549 Strings don't allow for any optimization, but they do allow
550 for cross-compilation. */
552 #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst)
558 char common
[sizeof (struct tree_common
)];
559 struct rtx_def
*rtl
; /* acts as link to register transfer language
561 REAL_VALUE_TYPE real_cst
;
564 /* In a STRING_CST */
565 #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length)
566 #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer)
570 char common
[sizeof (struct tree_common
)];
571 struct rtx_def
*rtl
; /* acts as link to register transfer language
577 /* In a COMPLEX_CST node. */
578 #define TREE_REALPART(NODE) ((NODE)->complex.real)
579 #define TREE_IMAGPART(NODE) ((NODE)->complex.imag)
583 char common
[sizeof (struct tree_common
)];
584 struct rtx_def
*rtl
; /* acts as link to register transfer language
586 union tree_node
*real
;
587 union tree_node
*imag
;
590 /* Define fields and accessors for some special-purpose tree nodes. */
592 #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length)
593 #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer)
595 struct tree_identifier
597 char common
[sizeof (struct tree_common
)];
602 /* In a TREE_LIST node. */
603 #define TREE_PURPOSE(NODE) ((NODE)->list.purpose)
604 #define TREE_VALUE(NODE) ((NODE)->list.value)
608 char common
[sizeof (struct tree_common
)];
609 union tree_node
*purpose
;
610 union tree_node
*value
;
613 /* In a TREE_VEC node. */
614 #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length)
615 #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I])
616 #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length]))
620 char common
[sizeof (struct tree_common
)];
622 union tree_node
*a
[1];
625 /* Define fields and accessors for some nodes that represent expressions. */
627 /* In a SAVE_EXPR node. */
628 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
629 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
630 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
632 /* In a RTL_EXPR node. */
633 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0])
634 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1])
636 /* In a CALL_EXPR node. */
637 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
639 /* In a CONSTRUCTOR node. */
640 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
642 /* In ordinary expression nodes. */
643 #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I])
644 #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity)
648 char common
[sizeof (struct tree_common
)];
650 union tree_node
*operands
[1];
653 /* In a BLOCK node. */
654 #define BLOCK_VARS(NODE) ((NODE)->block.vars)
655 #define BLOCK_TYPE_TAGS(NODE) ((NODE)->block.type_tags)
656 #define BLOCK_SUBBLOCKS(NODE) ((NODE)->block.subblocks)
657 #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->block.supercontext)
658 /* Note: when changing this, make sure to find the places
659 that use chainon or nreverse. */
660 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
661 #define BLOCK_ABSTRACT_ORIGIN(NODE) ((NODE)->block.abstract_origin)
662 #define BLOCK_ABSTRACT(NODE) ((NODE)->block.abstract_flag)
663 #define BLOCK_END_NOTE(NODE) ((NODE)->block.end_note)
665 /* Nonzero means that this block is prepared to handle exceptions
666 listed in the BLOCK_VARS slot. */
667 #define BLOCK_HANDLER_BLOCK(NODE) ((NODE)->block.handler_block_flag)
671 char common
[sizeof (struct tree_common
)];
673 unsigned handler_block_flag
: 1;
674 unsigned abstract_flag
: 1;
676 union tree_node
*vars
;
677 union tree_node
*type_tags
;
678 union tree_node
*subblocks
;
679 union tree_node
*supercontext
;
680 union tree_node
*abstract_origin
;
681 struct rtx_def
*end_note
;
684 /* Define fields and accessors for nodes representing data types. */
686 /* See tree.def for documentation of the use of these fields.
687 Look at the documentation of the various ..._TYPE tree codes. */
689 #define TYPE_UID(NODE) ((NODE)->type.uid)
690 #define TYPE_SIZE(NODE) ((NODE)->type.size)
691 #define TYPE_MODE(NODE) ((NODE)->type.mode)
692 #define TYPE_VALUES(NODE) ((NODE)->type.values)
693 #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
694 #define TYPE_FIELDS(NODE) ((NODE)->type.values)
695 #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
696 #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
697 #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
698 #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
699 #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
700 #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
701 #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
702 #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
703 #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
704 #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
705 #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab.address)
706 #define TYPE_SYMTAB_POINTER(NODE) ((NODE)->type.symtab.pointer)
707 #define TYPE_NAME(NODE) ((NODE)->type.name)
708 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
709 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
710 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
711 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
712 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
713 #define TYPE_OBSTACK(NODE) ((NODE)->type.obstack)
714 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
716 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
718 #define TYPE_ATTRIBUTES(NODE) ((NODE)->type.attributes)
720 /* The alignment necessary for objects of this type.
721 The value is an int, measured in bits. */
722 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
724 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
726 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
727 has BLKmode only because it lacks the alignment requirement for
729 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
731 /* Nonzero in a type considered volatile as a whole. */
732 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
734 /* Means this type is const-qualified. */
735 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
737 /* These flags are available for each language front end to use internally. */
738 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
739 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
740 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
741 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
742 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
743 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
744 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
746 /* If set in an ARRAY_TYPE, indicates a string type (for languages
747 that distinguish string from array of char).
748 If set in a SET_TYPE, indicates a bitstring type. */
749 #define TYPE_STRING_FLAG(NODE) ((NODE)->type.string_flag)
751 /* If non-NULL, this is a upper bound of the size (in bytes) of an
752 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
753 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
755 /* Indicates that objects of this type must be initialized by calling a
756 function when they are created. */
757 #define TYPE_NEEDS_CONSTRUCTING(NODE) ((NODE)->type.needs_constructing_flag)
759 /* Indicates that objects of this type (a UNION_TYPE), should be passed
760 the same way that the first union alternative would be passed. */
761 #define TYPE_TRANSPARENT_UNION(NODE) ((NODE)->type.transparent_union_flag)
763 /* Indicated that objects of this type should be laid out in as
764 compact a way as possible. */
765 #define TYPE_PACKED(NODE) ((NODE)->type.packed_flag)
769 char common
[sizeof (struct tree_common
)];
770 union tree_node
*values
;
771 union tree_node
*size
;
772 union tree_node
*attributes
;
775 unsigned char precision
;
776 #ifdef ONLY_INT_FIELDS
779 enum machine_mode mode
: 8;
782 unsigned string_flag
: 1;
783 unsigned no_force_blk_flag
: 1;
784 unsigned needs_constructing_flag
: 1;
785 unsigned transparent_union_flag
: 1;
786 unsigned packed_flag
: 1;
787 unsigned lang_flag_0
: 1;
788 unsigned lang_flag_1
: 1;
789 unsigned lang_flag_2
: 1;
790 unsigned lang_flag_3
: 1;
791 unsigned lang_flag_4
: 1;
792 unsigned lang_flag_5
: 1;
793 unsigned lang_flag_6
: 1;
794 /* room for 4 more bits */
797 union tree_node
*pointer_to
;
798 union tree_node
*reference_to
;
799 union {int address
; char *pointer
; } symtab
;
800 union tree_node
*name
;
801 union tree_node
*minval
;
802 union tree_node
*maxval
;
803 union tree_node
*next_variant
;
804 union tree_node
*main_variant
;
805 union tree_node
*binfo
;
806 union tree_node
*noncopied_parts
;
807 union tree_node
*context
;
808 struct obstack
*obstack
;
809 /* Points to a structure whose details depend on the language in use. */
810 struct lang_type
*lang_specific
;
813 /* Define accessor macros for information about type inheritance
816 A "basetype" means a particular usage of a data type for inheritance
817 in another type. Each such basetype usage has its own "binfo"
818 object to describe it. The binfo object is a TREE_VEC node.
820 Inheritance is represented by the binfo nodes allocated for a
821 given type. For example, given types C and D, such that D is
822 inherited by C, 3 binfo nodes will be allocated: one for describing
823 the binfo properties of C, similarly one for D, and one for
824 describing the binfo properties of D as a base type for C.
825 Thus, given a pointer to class C, one can get a pointer to the binfo
826 of D acting as a basetype for C by looking at C's binfo's basetypes. */
828 /* The actual data type node being inherited in this basetype. */
829 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
831 /* The offset where this basetype appears in its containing type.
832 BINFO_OFFSET slot holds the offset (in bytes)
833 from the base of the complete object to the base of the part of the
834 object that is allocated on behalf of this `type'.
835 This is always 0 except when there is multiple inheritance. */
837 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
838 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
839 #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node)
841 /* The virtual function table belonging to this basetype. Virtual
842 function tables provide a mechanism for run-time method dispatching.
843 The entries of a virtual function table are language-dependent. */
845 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
846 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
848 /* The virtual functions in the virtual function table. This is
849 a TREE_LIST that is used as an initial approximation for building
850 a virtual function table for this basetype. */
851 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
852 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
854 /* A vector of additional binfos for the types inherited by this basetype.
856 If this basetype describes type D as inherited in C,
857 and if the basetypes of D are E anf F,
858 then this vector contains binfos for inheritance of E and F by C.
860 ??? This could probably be done by just allocating the
861 base types at the end of this TREE_VEC (instead of using
862 another TREE_VEC). This would simplify the calculation
863 of how many basetypes a given type had. */
864 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
865 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
867 /* For a BINFO record describing an inheritance, this yields a pointer
868 to the artificial FIELD_DECL node which contains the "virtual base
869 class pointer" for the given inheritance. */
871 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
873 /* Accessor macro to get to the Nth basetype of this basetype. */
874 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
875 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
877 /* Slot used to build a chain that represents a use of inheritance.
878 For example, if X is derived from Y, and Y is derived from Z,
879 then this field can be used to link the binfo node for X to
880 the binfo node for X's Y to represent the use of inheritance
881 from X to Y. Similarly, this slot of the binfo node for X's Y
882 can point to the Z from which Y is inherited (in X's inheritance
883 hierarchy). In this fashion, one can represent and traverse specific
884 uses of inheritance using the binfo nodes themselves (instead of
885 consing new space pointing to binfo nodes).
886 It is up to the language-dependent front-ends to maintain
887 this information as necessary. */
888 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
890 /* Define fields and accessors for nodes representing declared names. */
892 /* This is the name of the object as written by the user.
893 It is an IDENTIFIER_NODE. */
894 #define DECL_NAME(NODE) ((NODE)->decl.name)
895 /* This is the name of the object as the assembler will see it
896 (but before any translations made by ASM_OUTPUT_LABELREF).
897 Often this is the same as DECL_NAME.
898 It is an IDENTIFIER_NODE. */
899 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
900 /* Records the section name in a section attribute. Used to pass
901 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
902 #define DECL_SECTION_NAME(NODE) ((NODE)->decl.section_name)
903 /* For FIELD_DECLs, this is the
904 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
905 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
906 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
907 containing function, the RECORD_TYPE or UNION_TYPE for the containing
908 type, or NULL_TREE if the given decl has "file scope". */
909 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
910 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
911 /* In a DECL this is the field where configuration dependent machine
912 attributes are store */
913 #define DECL_MACHINE_ATTRIBUTES(NODE) ((NODE)->decl.machine_attributes)
914 /* In a FIELD_DECL, this is the field position, counting in bits,
915 of the bit closest to the beginning of the structure. */
916 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
917 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
918 if so, the type that was originally specified for it.
919 TREE_TYPE may have been modified (in finish_struct). */
920 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
921 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
922 /* VAR_DECL and PARM_DECL reserve the arguments slot
923 for language-specific uses. */
924 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
925 /* In FUNCTION_DECL, holds the decl for the return value. */
926 #define DECL_RESULT(NODE) ((NODE)->decl.result)
927 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
928 #define DECL_ORIGINAL_TYPE(NODE) ((NODE)->decl.result)
929 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
930 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
931 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
932 For a VAR_DECL, holds the initial value.
933 For a PARM_DECL, not used--default
934 values for parameters are encoded in the type of the function,
935 not in the PARM_DECL slot. */
936 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
937 /* For a PARM_DECL, records the data type used to pass the argument,
938 which may be different from the type seen in the program. */
939 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
940 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
941 if nonzero, indicates that the field occupies the type. */
942 #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial)
943 /* These two fields describe where in the source code the declaration was. */
944 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
945 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
946 /* Holds the size of the datum, as a tree expression.
947 Need not be constant. */
948 #define DECL_SIZE(NODE) ((NODE)->decl.size)
949 /* Holds the alignment required for the datum. */
950 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size.u)
951 /* Holds the machine mode corresponding to the declaration of a variable or
952 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
954 #define DECL_MODE(NODE) ((NODE)->decl.mode)
955 /* Holds the RTL expression for the value of a variable or function. If
956 PROMOTED_MODE is defined, the mode of this expression may not be same
957 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
958 to the variable's data type, while the mode
959 of DECL_RTL is the mode actually used to contain the data. */
960 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
961 /* For PARM_DECL, holds an RTL for the stack slot or register
962 where the data was actually passed. */
963 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
964 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
965 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
966 /* For FUNCTION_DECL, if it is inline,
967 holds the size of the stack frame, as an integer. */
968 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size.i)
969 /* For FUNCTION_DECL, if it is built-in,
970 this identifies which built-in operation it is. */
971 #define DECL_FUNCTION_CODE(NODE) ((NODE)->decl.frame_size.f)
972 #define DECL_SET_FUNCTION_CODE(NODE,VAL) ((NODE)->decl.frame_size.f = (VAL))
973 /* For a FIELD_DECL, holds the size of the member as an integer. */
974 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
976 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
977 Before the struct containing the FUNCTION_DECL is laid out,
978 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
979 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
980 function. When the class is laid out, this pointer is changed
981 to an INTEGER_CST node which is suitable for use as an index
982 into the virtual function table. */
983 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
984 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
985 which this FIELD_DECL is defined. This information is needed when
986 writing debugging information about vfield and vbase decls for C++. */
987 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
989 /* Every ..._DECL node gets a unique number. */
990 #define DECL_UID(NODE) ((NODE)->decl.uid)
992 /* For any sort of a ..._DECL node, this points to the original (abstract)
993 decl node which this decl is an instance of, or else it is NULL indicating
994 that this decl is not an instance of some other decl. For example,
995 in a nested declaration of an inline function, this points back to the
997 #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin)
999 /* Nonzero for any sort of ..._DECL node means this decl node represents
1000 an inline instance of some original (abstract) decl from an inline function;
1001 suppress any warnings about shadowing some other variable. */
1002 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
1004 /* Nonzero if a _DECL means that the name of this decl should be ignored
1005 for symbolic debug purposes. */
1006 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
1008 /* Nonzero for a given ..._DECL node means that this node represents an
1009 "abstract instance" of the given declaration (e.g. in the original
1010 declaration of an inline function). When generating symbolic debugging
1011 information, we mustn't try to generate any address information for nodes
1012 marked as "abstract instances" because we don't actually generate
1013 any code or allocate any data space for such instances. */
1014 #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag)
1016 /* Nonzero if a _DECL means that no warnings should be generated just
1017 because this decl is unused. */
1018 #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag)
1020 /* Nonzero for a given ..._DECL node means that this node should be
1021 put in .common, if possible. If a DECL_INITIAL is given, and it
1022 is not error_mark_node, then the decl cannot be put in .common. */
1023 #define DECL_COMMON(NODE) ((NODE)->decl.common_flag)
1025 /* Language-specific decl information. */
1026 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
1028 /* In a VAR_DECL or FUNCTION_DECL,
1029 nonzero means external reference:
1030 do not allocate storage, and refer to a definition elsewhere. */
1031 #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag)
1034 nonzero means the detail info about this type is not dumped into stabs.
1035 Instead it will generate cross reference ('x') of names.
1036 This uses the same flag as DECL_EXTERNAL. */
1037 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) ((NODE)->decl.external_flag)
1040 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1041 #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag)
1042 /* In LABEL_DECL nodes, nonzero means that an error message about
1043 jumping into such a binding contour has been printed for this label. */
1044 #define DECL_ERROR_ISSUED(NODE) ((NODE)->decl.regdecl_flag)
1045 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1046 #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag)
1047 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1048 static chain is not needed. */
1049 #define DECL_NO_STATIC_CHAIN(NODE) ((NODE)->decl.regdecl_flag)
1051 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1052 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1054 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1056 Also set in some languages for variables, etc., outside the normal
1057 lexical scope, such as class instance variables. */
1058 #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
1060 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1061 where it is called. */
1062 #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag)
1064 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1065 that is not specified by ansi C and that users are supposed to be allowed
1066 to redefine for any purpose whatever. */
1067 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1069 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1071 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
1072 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1073 contour that restored a stack level and which is now exited. */
1074 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
1075 /* In a FUNCTION_DECL, nonzero means a built in function. */
1076 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
1077 /* In a VAR_DECL that's static,
1078 nonzero if the space is in the text section. */
1079 #define DECL_IN_TEXT_SECTION(NODE) ((NODE)->decl.bit_field_flag)
1081 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1082 Used in FIELD_DECLs for vtable pointers.
1083 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1084 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
1086 /* Used to indicate that the linkage status of this DECL is not yet known,
1087 so it should not be output now. */
1088 #define DECL_DEFER_OUTPUT(NODE) ((NODE)->decl.defer_output)
1090 /* Used in PARM_DECLs whose type are unions to indicate that the
1091 argument should be passed in the same way that the first union
1092 alternative would be passed. */
1093 #define DECL_TRANSPARENT_UNION(NODE) ((NODE)->decl.transparent_union)
1095 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1096 at the beginning or end of execution. */
1097 #define DECL_STATIC_CONSTRUCTOR(NODE) ((NODE)->decl.static_ctor_flag)
1098 #define DECL_STATIC_DESTRUCTOR(NODE) ((NODE)->decl.static_dtor_flag)
1100 /* Used to indicate that this DECL represents a compiler-generated entity. */
1101 #define DECL_ARTIFICIAL(NODE) ((NODE)->decl.artificial_flag)
1103 /* Used to indicate that this DECL has weak linkage. */
1104 #define DECL_WEAK(NODE) ((NODE)->decl.weak_flag)
1106 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1107 multiple translation units should be merged. */
1108 #define DECL_ONE_ONLY(NODE) ((NODE)->decl.transparent_union)
1110 /* Additional flags for language-specific uses. */
1111 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
1112 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
1113 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
1114 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
1115 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
1116 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
1117 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
1118 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
1122 char common
[sizeof (struct tree_common
)];
1126 union tree_node
*size
;
1127 #ifdef ONLY_INT_FIELDS
1130 enum machine_mode mode
: 8;
1133 unsigned external_flag
: 1;
1134 unsigned nonlocal_flag
: 1;
1135 unsigned regdecl_flag
: 1;
1136 unsigned inline_flag
: 1;
1137 unsigned bit_field_flag
: 1;
1138 unsigned virtual_flag
: 1;
1139 unsigned ignored_flag
: 1;
1140 unsigned abstract_flag
: 1;
1142 unsigned in_system_header_flag
: 1;
1143 unsigned common_flag
: 1;
1144 unsigned defer_output
: 1;
1145 unsigned transparent_union
: 1;
1146 unsigned static_ctor_flag
: 1;
1147 unsigned static_dtor_flag
: 1;
1148 unsigned artificial_flag
: 1;
1149 unsigned weak_flag
: 1;
1150 /* room for no more */
1152 unsigned lang_flag_0
: 1;
1153 unsigned lang_flag_1
: 1;
1154 unsigned lang_flag_2
: 1;
1155 unsigned lang_flag_3
: 1;
1156 unsigned lang_flag_4
: 1;
1157 unsigned lang_flag_5
: 1;
1158 unsigned lang_flag_6
: 1;
1159 unsigned lang_flag_7
: 1;
1161 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1162 If built-in, this is the code for which built-in function.
1163 For other kinds of decls, this is DECL_ALIGN. */
1167 enum built_in_function f
;
1170 union tree_node
*name
;
1171 union tree_node
*context
;
1172 union tree_node
*arguments
;
1173 union tree_node
*result
;
1174 union tree_node
*initial
;
1175 union tree_node
*abstract_origin
;
1176 union tree_node
*assembler_name
;
1177 union tree_node
*section_name
;
1178 union tree_node
*machine_attributes
;
1179 struct rtx_def
*rtl
; /* acts as link to register transfer language
1181 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1182 on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */
1187 union tree_node
*vindex
;
1188 /* Points to a structure whose details depend on the language in use. */
1189 struct lang_decl
*lang_specific
;
1192 /* Define the overall contents of a tree node.
1193 It may be any of the structures declared above
1194 for various types of node. */
1198 struct tree_common common
;
1199 struct tree_int_cst int_cst
;
1200 struct tree_real_cst real_cst
;
1201 struct tree_string string
;
1202 struct tree_complex
complex;
1203 struct tree_identifier identifier
;
1204 struct tree_decl decl
;
1205 struct tree_type type
;
1206 struct tree_list list
;
1207 struct tree_vec vec
;
1208 struct tree_exp exp
;
1209 struct tree_block block
;
1212 #include "gansidecl.h"
1214 #define NULL_TREE (tree) NULL
1216 /* The following functions accept a wide integer argument. Rather than
1217 having to cast on every function call, we use a macro instead, that is
1218 defined here and in rtl.h. */
1221 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1222 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1224 extern int exact_log2_wide
PROTO((unsigned HOST_WIDE_INT
));
1225 extern int floor_log2_wide
PROTO((unsigned HOST_WIDE_INT
));
1228 /* At present, don't prototype xrealloc, since all of the callers don't
1229 cast their pointers to char *, and all of the xrealloc's don't use
1231 extern char *xmalloc
PROTO((size_t));
1232 extern char *xrealloc
PROTO((void *, size_t));
1234 extern char *xmalloc ();
1235 extern char *xrealloc ();
1238 extern char *xstrdup
PROTO((char *));
1240 extern char *oballoc
PROTO((int));
1241 extern char *permalloc
PROTO((int));
1242 extern char *savealloc
PROTO((int));
1243 extern char *expralloc
PROTO((int));
1244 #ifdef NEED_DECLARATION_FREE
1245 extern void free
PROTO((void *));
1248 /* Lowest level primitive for allocating a node.
1249 The TREE_CODE is the only argument. Contents are initialized
1250 to zero except for a few of the common fields. */
1252 extern tree make_node
PROTO((enum tree_code
));
1254 /* Make a copy of a node, with all the same contents except
1255 for TREE_PERMANENT. (The copy is permanent
1256 iff nodes being made now are permanent.) */
1258 extern tree copy_node
PROTO((tree
));
1260 /* Make a copy of a chain of TREE_LIST nodes. */
1262 extern tree copy_list
PROTO((tree
));
1264 /* Make a TREE_VEC. */
1266 extern tree make_tree_vec
PROTO((int));
1268 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1269 The name is supplied as a char *. */
1271 extern tree get_identifier
PROTO((char *));
1273 /* If an identifier with the name TEXT (a null-terminated string) has
1274 previously been referred to, return that node; otherwise return
1277 extern tree maybe_get_identifier
PROTO((char *));
1279 /* Construct various types of nodes. */
1281 #define build_int_2(LO,HI) \
1282 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1284 extern tree build
PVPROTO((enum tree_code
, tree
, ...));
1285 extern tree build_nt
PVPROTO((enum tree_code
, ...));
1286 extern tree build_parse_node
PVPROTO((enum tree_code
, ...));
1288 extern tree build_int_2_wide
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
));
1289 extern tree build_real
PROTO((tree
, REAL_VALUE_TYPE
));
1290 extern tree build_real_from_int_cst
PROTO((tree
, tree
));
1291 extern tree build_complex
PROTO((tree
, tree
, tree
));
1292 extern tree build_string
PROTO((int, char *));
1293 extern tree build1
PROTO((enum tree_code
, tree
, tree
));
1294 extern tree build_tree_list
PROTO((tree
, tree
));
1295 extern tree build_decl_list
PROTO((tree
, tree
));
1296 extern tree build_expr_list
PROTO((tree
, tree
));
1297 extern tree build_decl
PROTO((enum tree_code
, tree
, tree
));
1298 extern tree build_block
PROTO((tree
, tree
, tree
, tree
, tree
));
1300 /* Construct various nodes representing data types. */
1302 extern tree make_signed_type
PROTO((int));
1303 extern tree make_unsigned_type
PROTO((int));
1304 extern void set_sizetype
PROTO((tree
));
1305 extern tree signed_or_unsigned_type
PROTO((int, tree
));
1306 extern void fixup_unsigned_type
PROTO((tree
));
1307 extern tree build_pointer_type
PROTO((tree
));
1308 extern tree build_reference_type
PROTO((tree
));
1309 extern tree build_index_type
PROTO((tree
));
1310 extern tree build_index_2_type
PROTO((tree
, tree
));
1311 extern tree build_array_type
PROTO((tree
, tree
));
1312 extern tree build_function_type
PROTO((tree
, tree
));
1313 extern tree build_method_type
PROTO((tree
, tree
));
1314 extern tree build_offset_type
PROTO((tree
, tree
));
1315 extern tree build_complex_type
PROTO((tree
));
1316 extern tree array_type_nelts
PROTO((tree
));
1318 extern tree value_member
PROTO((tree
, tree
));
1319 extern tree purpose_member
PROTO((tree
, tree
));
1320 extern tree binfo_member
PROTO((tree
, tree
));
1321 extern int attribute_hash_list
PROTO((tree
));
1322 extern int attribute_list_equal
PROTO((tree
, tree
));
1323 extern int attribute_list_contained
PROTO((tree
, tree
));
1324 extern int tree_int_cst_equal
PROTO((tree
, tree
));
1325 extern int tree_int_cst_lt
PROTO((tree
, tree
));
1326 extern int tree_int_cst_sgn
PROTO((tree
));
1327 extern int index_type_equal
PROTO((tree
, tree
));
1329 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1330 put the prototype here. Rtl.h does declare the prototype if
1331 tree.h had been included. */
1333 extern tree make_tree
PROTO((tree
, struct rtx_def
*));
1335 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1338 Such modified types already made are recorded so that duplicates
1341 extern tree build_type_attribute_variant
PROTO((tree
, tree
));
1342 extern tree build_decl_attribute_variant
PROTO((tree
, tree
));
1344 extern tree merge_machine_decl_attributes
PROTO((tree
, tree
));
1345 extern tree merge_machine_type_attributes
PROTO((tree
, tree
));
1347 /* Split a list of declspecs and attributes into two. */
1349 extern void split_specs_attrs
PROTO((tree
, tree
*, tree
*));
1351 /* Strip attributes from a list of combined specs and attrs. */
1353 extern tree strip_attrs
PROTO((tree
));
1355 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1357 extern int valid_machine_attribute
PROTO((tree
, tree
, tree
, tree
));
1359 /* Given a tree node and a string, return non-zero if the tree node is
1360 a valid attribute name for the string. */
1362 extern int is_attribute_p
PROTO((char *, tree
));
1364 /* Given an attribute name and a list of attributes, return the list element
1365 of the attribute or NULL_TREE if not found. */
1367 extern tree lookup_attribute
PROTO((char *, tree
));
1369 /* Given two attributes lists, return a list of their union. */
1371 extern tree merge_attributes
PROTO((tree
, tree
));
1373 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1374 for the same kind of data as TYPE describes.
1375 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1376 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1377 so that duplicate variants are never made.
1378 Only main variants should ever appear as types of expressions. */
1380 extern tree build_type_variant
PROTO((tree
, int, int));
1382 /* Make a copy of a type node. */
1384 extern tree build_type_copy
PROTO((tree
));
1386 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1387 TYPE_ALIGN and TYPE_MODE fields.
1388 If called more than once on one node, does nothing except
1389 for the first time. */
1391 extern void layout_type
PROTO((tree
));
1393 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1394 return a canonicalized ..._TYPE node, so that duplicates are not made.
1395 How the hash code is computed is up to the caller, as long as any two
1396 callers that could hash identical-looking type nodes agree. */
1398 extern tree type_hash_canon
PROTO((int, tree
));
1400 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1401 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1402 fields. Call this only once for any given decl node.
1404 Second argument is the boundary that this field can be assumed to
1405 be starting at (in bits). Zero means it can be assumed aligned
1406 on any boundary that may be needed. */
1408 extern void layout_decl
PROTO((tree
, unsigned));
1410 /* Return an expr equal to X but certainly not valid as an lvalue. */
1412 extern tree non_lvalue
PROTO((tree
));
1413 extern tree pedantic_non_lvalue
PROTO((tree
));
1415 extern tree convert
PROTO((tree
, tree
));
1416 extern tree size_in_bytes
PROTO((tree
));
1417 extern HOST_WIDE_INT int_size_in_bytes
PROTO((tree
));
1418 extern tree size_binop
PROTO((enum tree_code
, tree
, tree
));
1419 extern tree size_int_wide
PROTO((unsigned HOST_WIDE_INT
,
1420 unsigned HOST_WIDE_INT
, int));
1421 #define size_int(L) size_int_2 ((L), 0, 0)
1422 #define bitsize_int(L, H) size_int_2 ((L), (H), 1)
1423 #define size_int_2(L, H, T) \
1424 size_int_wide ((unsigned HOST_WIDE_INT) (L), \
1425 (unsigned HOST_WIDE_INT) (H), (T))
1427 extern tree round_up
PROTO((tree
, int));
1428 extern tree get_pending_sizes
PROTO((void));
1429 extern void put_pending_sizes
PROTO((tree
));
1431 /* Type for sizes of data-type. */
1433 #define BITS_PER_UNIT_LOG \
1434 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1435 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1436 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1438 extern tree sizetype_tab
[2], sbitsizetype
, ubitsizetype
;
1439 #define sizetype sizetype_tab[0]
1440 #define bitsizetype sizetype_tab[1]
1442 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1443 extern int maximum_field_alignment
;
1445 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1446 extern int set_alignment
;
1448 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1449 by making the last node in X point to Y.
1450 Returns X, except if X is 0 returns Y. */
1452 extern tree chainon
PROTO((tree
, tree
));
1454 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1456 extern tree tree_cons
PROTO((tree
, tree
, tree
));
1457 extern tree perm_tree_cons
PROTO((tree
, tree
, tree
));
1458 extern tree temp_tree_cons
PROTO((tree
, tree
, tree
));
1459 extern tree saveable_tree_cons
PROTO((tree
, tree
, tree
));
1460 extern tree decl_tree_cons
PROTO((tree
, tree
, tree
));
1461 extern tree expr_tree_cons
PROTO((tree
, tree
, tree
));
1463 /* Return the last tree node in a chain. */
1465 extern tree tree_last
PROTO((tree
));
1467 /* Reverse the order of elements in a chain, and return the new head. */
1469 extern tree nreverse
PROTO((tree
));
1471 /* Returns the length of a chain of nodes
1472 (number of chain pointers to follow before reaching a null pointer). */
1474 extern int list_length
PROTO((tree
));
1476 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1478 extern int integer_zerop
PROTO((tree
));
1480 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1482 extern int integer_onep
PROTO((tree
));
1484 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1485 all of whose significant bits are 1. */
1487 extern int integer_all_onesp
PROTO((tree
));
1489 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1490 exactly one bit 1. */
1492 extern int integer_pow2p
PROTO((tree
));
1494 /* staticp (tree x) is nonzero if X is a reference to data allocated
1495 at a fixed address in memory. */
1497 extern int staticp
PROTO((tree
));
1499 /* Gets an error if argument X is not an lvalue.
1500 Also returns 1 if X is an lvalue, 0 if not. */
1502 extern int lvalue_or_else
PROTO((tree
, char *));
1504 /* save_expr (EXP) returns an expression equivalent to EXP
1505 but it can be used multiple times within context CTX
1506 and only evaluate EXP once. */
1508 extern tree save_expr
PROTO((tree
));
1510 /* Returns the index of the first non-tree operand for CODE, or the number
1511 of operands if all are trees. */
1513 extern int first_rtl_op
PROTO((enum tree_code
));
1515 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1516 can be used multiple times and will evaluate EXP, in it's entirety
1519 extern tree unsave_expr
PROTO((tree
));
1521 /* unsave_expr_now (EXP) resets EXP in place, so that it can be
1524 extern tree unsave_expr_now
PROTO((tree
));
1526 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1527 or offset that depends on a field within a record.
1529 Note that we only allow such expressions within simple arithmetic
1532 extern int contains_placeholder_p
PROTO((tree
));
1534 /* Return 1 if EXP contains any expressions that produce cleanups for an
1535 outer scope to deal with. Used by fold. */
1537 extern int has_cleanups
PROTO((tree
));
1539 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1540 return a tree with all occurrences of references to F in a
1541 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1542 contains only arithmetic expressions. */
1544 extern tree substitute_in_expr
PROTO((tree
, tree
, tree
));
1546 /* variable_size (EXP) is like save_expr (EXP) except that it
1547 is for the special case of something that is part of a
1548 variable size for a data type. It makes special arrangements
1549 to compute the value at the right time when the data type
1550 belongs to a function parameter. */
1552 extern tree variable_size
PROTO((tree
));
1554 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1555 but it can be used multiple times
1556 and only evaluate the subexpressions once. */
1558 extern tree stabilize_reference
PROTO((tree
));
1560 /* Subroutine of stabilize_reference; this is called for subtrees of
1561 references. Any expression with side-effects must be put in a SAVE_EXPR
1562 to ensure that it is only evaluated once. */
1564 extern tree stabilize_reference_1
PROTO((tree
));
1566 /* Return EXP, stripped of any conversions to wider types
1567 in such a way that the result of converting to type FOR_TYPE
1568 is the same as if EXP were converted to FOR_TYPE.
1569 If FOR_TYPE is 0, it signifies EXP's type. */
1571 extern tree get_unwidened
PROTO((tree
, tree
));
1573 /* Return OP or a simpler expression for a narrower value
1574 which can be sign-extended or zero-extended to give back OP.
1575 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1576 or 0 if the value should be sign-extended. */
1578 extern tree get_narrower
PROTO((tree
, int *));
1580 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1582 The definition of this resides in language-specific code
1583 as the repertoire of available types may vary. */
1585 extern tree type_for_mode
PROTO((enum machine_mode
, int));
1587 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1588 for an integer type with at least that precision.
1589 The definition of this resides in language-specific code
1590 as the repertoire of available types may vary. */
1592 extern tree type_for_size
PROTO((unsigned, int));
1594 /* Given an integer type T, return a type like T but unsigned.
1595 If T is unsigned, the value is T.
1596 The definition of this resides in language-specific code
1597 as the repertoire of available types may vary. */
1599 extern tree unsigned_type
PROTO((tree
));
1601 /* Given an integer type T, return a type like T but signed.
1602 If T is signed, the value is T.
1603 The definition of this resides in language-specific code
1604 as the repertoire of available types may vary. */
1606 extern tree signed_type
PROTO((tree
));
1608 /* This function must be defined in the language-specific files.
1609 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1610 This is defined in a language-specific file. */
1612 extern tree maybe_build_cleanup
PROTO((tree
));
1614 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1615 look for nested component-refs or array-refs at constant positions
1616 and find the ultimate containing object, which is returned. */
1618 extern tree get_inner_reference
PROTO((tree
, int *, int *, tree
*,
1619 enum machine_mode
*, int *,
1622 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1624 extern tree decl_function_context
PROTO((tree
));
1626 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1627 this _DECL with its context, or zero if none. */
1628 extern tree decl_type_context
PROTO((tree
));
1630 /* Given the FUNCTION_DECL for the current function,
1631 return zero if it is ok for this function to be inline.
1632 Otherwise return a warning message with a single %s
1633 for the function's name. */
1635 extern char *function_cannot_inline_p
PROTO((tree
));
1637 /* Return 1 if EXPR is the real constant zero. */
1638 extern int real_zerop
PROTO((tree
));
1640 /* Declare commonly used variables for tree structure. */
1642 /* An integer constant with value 0 */
1643 extern tree integer_zero_node
;
1645 /* An integer constant with value 1 */
1646 extern tree integer_one_node
;
1648 /* An integer constant with value 0 whose type is sizetype. */
1649 extern tree size_zero_node
;
1651 /* An integer constant with value 1 whose type is sizetype. */
1652 extern tree size_one_node
;
1654 /* A constant of type pointer-to-int and value 0 */
1655 extern tree null_pointer_node
;
1657 /* A node of type ERROR_MARK. */
1658 extern tree error_mark_node
;
1660 /* The type node for the void type. */
1661 extern tree void_type_node
;
1663 /* The type node for the ordinary (signed) integer type. */
1664 extern tree integer_type_node
;
1666 /* The type node for the unsigned integer type. */
1667 extern tree unsigned_type_node
;
1669 /* The type node for the ordinary character type. */
1670 extern tree char_type_node
;
1672 /* Points to the name of the input file from which the current input
1673 being parsed originally came (before it went into cpp). */
1674 extern char *input_filename
;
1676 /* Current line number in input file. */
1679 /* Nonzero for -pedantic switch: warn about anything
1680 that standard C forbids. */
1681 extern int pedantic
;
1683 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1684 Zero means allow extended lvalues. */
1686 extern int pedantic_lvalues
;
1688 /* Nonzero means can safely call expand_expr now;
1689 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1691 extern int immediate_size_expand
;
1693 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1695 extern tree current_function_decl
;
1697 /* Nonzero if function being compiled can call setjmp. */
1699 extern int current_function_calls_setjmp
;
1701 /* Nonzero if function being compiled can call longjmp. */
1703 extern int current_function_calls_longjmp
;
1705 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1707 extern int all_types_permanent
;
1709 /* Pointer to function to compute the name to use to print a declaration.
1710 DECL is the declaration in question.
1711 VERBOSITY determines what information will be printed:
1712 0: DECL_NAME, demangled as necessary.
1713 1: and scope information.
1714 2: and any other information that might be interesting, such as function
1715 parameter types in C++. */
1717 extern char *(*decl_printable_name
) PROTO((tree
, int));
1719 /* Pointer to function to finish handling an incomplete decl at the
1720 end of compilation. */
1722 extern void (*incomplete_decl_finalize_hook
) PROTO((tree
));
1725 extern char *perm_calloc
PROTO((int, long));
1726 extern tree get_file_function_name
PROTO((int));
1727 extern tree get_set_constructor_bits
PROTO((tree
, char *, int));
1728 extern tree get_set_constructor_bytes
PROTO((tree
,
1729 unsigned char *, int));
1733 extern void expand_fixups
PROTO((struct rtx_def
*));
1734 extern tree expand_start_stmt_expr
PROTO((void));
1735 extern tree expand_end_stmt_expr
PROTO((tree
));
1736 extern void expand_expr_stmt
PROTO((tree
));
1737 extern int warn_if_unused_value
PROTO((tree
));
1738 extern void expand_decl_init
PROTO((tree
));
1739 extern void clear_last_expr
PROTO((void));
1740 extern void expand_label
PROTO((tree
));
1741 extern void expand_goto
PROTO((tree
));
1742 extern void expand_asm
PROTO((tree
));
1743 extern void expand_start_cond
PROTO((tree
, int));
1744 extern void expand_end_cond
PROTO((void));
1745 extern void expand_start_else
PROTO((void));
1746 extern void expand_start_elseif
PROTO((tree
));
1747 extern struct nesting
*expand_start_loop
PROTO((int));
1748 extern struct nesting
*expand_start_loop_continue_elsewhere
PROTO((int));
1749 extern void expand_loop_continue_here
PROTO((void));
1750 extern void expand_end_loop
PROTO((void));
1751 extern int expand_continue_loop
PROTO((struct nesting
*));
1752 extern int expand_exit_loop
PROTO((struct nesting
*));
1753 extern int expand_exit_loop_if_false
PROTO((struct nesting
*,
1755 extern int expand_exit_something
PROTO((void));
1757 extern void expand_null_return
PROTO((void));
1758 extern void expand_return
PROTO((tree
));
1759 extern void expand_start_bindings
PROTO((int));
1760 extern void expand_end_bindings
PROTO((tree
, int, int));
1761 extern void start_cleanup_deferral
PROTO((void));
1762 extern void end_cleanup_deferral
PROTO((void));
1763 extern void mark_block_as_eh_region
PROTO((void));
1764 extern void mark_block_as_not_eh_region
PROTO((void));
1765 extern int is_eh_region
PROTO((void));
1766 extern int conditional_context
PROTO((void));
1767 extern tree last_cleanup_this_contour
PROTO((void));
1768 extern int expand_dhc_cleanup
PROTO((tree
));
1769 extern int expand_dcc_cleanup
PROTO((tree
));
1770 extern void expand_start_case
PROTO((int, tree
, tree
,
1772 extern void expand_end_case
PROTO((tree
));
1773 extern int pushcase
PROTO((tree
,
1774 tree (*) (tree
, tree
),
1776 extern int pushcase_range
PROTO((tree
, tree
,
1777 tree (*) (tree
, tree
),
1780 /* In fold-const.c */
1782 /* Fold constants as much as possible in an expression.
1783 Returns the simplified expression.
1784 Acts only on the top level of the expression;
1785 if the argument itself cannot be simplified, its
1786 subexpressions are not changed. */
1788 extern tree fold
PROTO((tree
));
1790 extern int force_fit_type
PROTO((tree
, int));
1791 extern int add_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1792 HOST_WIDE_INT
, HOST_WIDE_INT
,
1793 HOST_WIDE_INT
*, HOST_WIDE_INT
*));
1794 extern int neg_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1795 HOST_WIDE_INT
*, HOST_WIDE_INT
*));
1796 extern int mul_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1797 HOST_WIDE_INT
, HOST_WIDE_INT
,
1798 HOST_WIDE_INT
*, HOST_WIDE_INT
*));
1799 extern void lshift_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1800 HOST_WIDE_INT
, int, HOST_WIDE_INT
*,
1801 HOST_WIDE_INT
*, int));
1802 extern void rshift_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1804 HOST_WIDE_INT
*, HOST_WIDE_INT
*, int));
1805 extern void lrotate_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1806 HOST_WIDE_INT
, int, HOST_WIDE_INT
*,
1808 extern void rrotate_double
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
,
1809 HOST_WIDE_INT
, int, HOST_WIDE_INT
*,
1811 extern int operand_equal_p
PROTO((tree
, tree
, int));
1812 extern tree invert_truthvalue
PROTO((tree
));
1814 /* Interface of the DWARF2 unwind info support. */
1816 /* Decide whether we want to emit frame unwind information for the current
1817 translation unit. */
1819 extern int dwarf2out_do_frame
PROTO((void));
1821 /* Generate a new label for the CFI info to refer to. */
1823 extern char *dwarf2out_cfi_label
PROTO((void));
1825 /* Entry point to update the canonical frame address (CFA). */
1827 extern void dwarf2out_def_cfa
PROTO((char *, unsigned, long));
1829 /* Add the CFI for saving a register window. */
1831 extern void dwarf2out_window_save
PROTO((char *));
1833 /* Add a CFI to update the running total of the size of arguments pushed
1836 extern void dwarf2out_args_size
PROTO((char *, long));
1838 /* Entry point for saving a register to the stack. */
1840 extern void dwarf2out_reg_save
PROTO((char *, unsigned, long));
1842 /* Entry point for saving the return address in the stack. */
1844 extern void dwarf2out_return_save
PROTO((char *, long));
1846 /* Entry point for saving the return address in a register. */
1848 extern void dwarf2out_return_reg
PROTO((char *, unsigned));
1850 /* Output a marker (i.e. a label) for the beginning of a function, before
1853 extern void dwarf2out_begin_prologue
PROTO((void));
1855 /* Output a marker (i.e. a label) for the absolute end of the generated
1856 code for a function definition. */
1858 extern void dwarf2out_end_epilogue
PROTO((void));
1860 /* The language front-end must define these functions. */
1862 /* Function of no arguments for initializing lexical scanning. */
1863 extern void init_lex
PROTO((void));
1864 /* Function of no arguments for initializing the symbol table. */
1865 extern void init_decl_processing
PROTO((void));
1867 /* Functions called with no arguments at the beginning and end or processing
1868 the input source file. */
1869 extern void lang_init
PROTO((void));
1870 extern void lang_finish
PROTO((void));
1872 /* Function to identify which front-end produced the output file. */
1873 extern char *lang_identify
PROTO((void));
1875 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
1876 extern void copy_lang_decl
PROTO((tree
));
1878 /* Function called with no arguments to parse and compile the input. */
1879 extern int yyparse
PROTO((void));
1880 /* Function called with option as argument
1881 to decode options starting with -f or -W or +.
1882 It should return nonzero if it handles the option. */
1883 extern int lang_decode_option
PROTO((char *));
1885 /* Functions for processing symbol declarations. */
1886 /* Function to enter a new lexical scope.
1887 Takes one argument: always zero when called from outside the front end. */
1888 extern void pushlevel
PROTO((int));
1889 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1890 Takes three arguments:
1891 KEEP -- nonzero if there were declarations in this scope.
1892 REVERSE -- reverse the order of decls before returning them.
1893 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1894 extern tree poplevel
PROTO((int, int, int));
1895 /* Set the BLOCK node for the current scope level. */
1896 extern void set_block
PROTO((tree
));
1897 /* Function to add a decl to the current scope level.
1898 Takes one argument, a decl to add.
1899 Returns that decl, or, if the same symbol is already declared, may
1900 return a different decl for that name. */
1901 extern tree pushdecl
PROTO((tree
));
1902 /* Function to return the chain of decls so far in the current scope level. */
1903 extern tree getdecls
PROTO((void));
1904 /* Function to return the chain of structure tags in the current scope level. */
1905 extern tree gettags
PROTO((void));
1907 extern tree build_range_type
PROTO((tree
, tree
, tree
));
1909 /* Call when starting to parse a declaration:
1910 make expressions in the declaration last the length of the function.
1911 Returns an argument that should be passed to resume_momentary later. */
1912 extern int suspend_momentary
PROTO((void));
1914 extern int allocation_temporary_p
PROTO((void));
1916 /* Call when finished parsing a declaration:
1917 restore the treatment of node-allocation that was
1918 in effect before the suspension.
1919 YES should be the value previously returned by suspend_momentary. */
1920 extern void resume_momentary
PROTO((int));
1922 /* Called after finishing a record, union or enumeral type. */
1923 extern void rest_of_type_compilation
PROTO((tree
, int));
1925 /* Save the current set of obstacks, but don't change them. */
1926 extern void push_obstacks_nochange
PROTO((void));
1928 extern void permanent_allocation
PROTO((int));
1930 extern void push_momentary
PROTO((void));
1932 extern void clear_momentary
PROTO((void));
1934 extern void pop_momentary
PROTO((void));
1936 extern void end_temporary_allocation
PROTO((void));
1938 /* Pop the obstack selection stack. */
1939 extern void pop_obstacks
PROTO((void));
1942 extern int really_constant_p
PROTO ((tree
));
1943 extern void push_obstacks
PROTO ((struct obstack
*,
1945 extern void pop_momentary_nofree
PROTO ((void));
1946 extern void preserve_momentary
PROTO ((void));
1947 extern void saveable_allocation
PROTO ((void));
1948 extern void temporary_allocation
PROTO ((void));
1949 extern void resume_temporary_allocation
PROTO ((void));
1950 extern tree get_file_function_name
PROTO ((int));
1951 extern void set_identifier_size
PROTO ((int));
1952 extern int int_fits_type_p
PROTO ((tree
, tree
));
1953 extern int tree_log2
PROTO ((tree
));
1954 extern void preserve_initializer
PROTO ((void));
1955 extern void preserve_data
PROTO ((void));
1956 extern int object_permanent_p
PROTO ((tree
));
1957 extern int type_precision
PROTO ((tree
));
1958 extern int simple_cst_equal
PROTO ((tree
, tree
));
1959 extern int type_list_equal
PROTO ((tree
, tree
));
1960 extern int chain_member
PROTO ((tree
, tree
));
1961 extern int chain_member_purpose
PROTO ((tree
, tree
));
1962 extern int chain_member_value
PROTO ((tree
, tree
));
1963 extern tree listify
PROTO ((tree
));
1964 extern tree type_hash_lookup
PROTO ((int, tree
));
1965 extern void type_hash_add
PROTO ((int, tree
));
1966 extern int type_hash_list
PROTO ((tree
));
1967 extern int simple_cst_list_equal
PROTO ((tree
, tree
));
1968 extern void debug_obstack
PROTO ((char *));
1969 extern void rtl_in_current_obstack
PROTO ((void));
1970 extern void rtl_in_saveable_obstack
PROTO ((void));
1971 extern void init_tree_codes
PROTO ((void));
1972 extern void dump_tree_statistics
PROTO ((void));
1973 extern void print_obstack_statistics
PROTO ((char *, struct obstack
*));
1975 extern void print_obstack_name
PROTO ((char *, FILE *, char *));
1977 extern void expand_function_end
PROTO ((char *, int, int));
1978 extern void expand_function_start
PROTO ((tree
, int));
1979 extern int real_onep
PROTO ((tree
));
1980 extern int real_twop
PROTO ((tree
));
1981 extern void start_identifier_warnings
PROTO ((void));
1982 extern void gcc_obstack_init
PROTO ((struct obstack
*));
1983 extern void init_obstacks
PROTO ((void));
1984 extern void obfree
PROTO ((char *));
1987 extern void setjmp_protect_args
PROTO ((void));
1988 extern void setjmp_protect
PROTO ((tree
));
1989 extern void expand_main_function
PROTO ((void));
1990 extern void mark_varargs
PROTO ((void));
1991 extern void init_function_start
PROTO ((tree
, char *, int));
1992 extern void assign_parms
PROTO ((tree
, int));
1993 extern void put_var_into_stack
PROTO ((tree
));
1994 extern void uninitialized_vars_warning
PROTO ((tree
));
1995 extern void setjmp_args_warning
PROTO ((void));
1996 extern void mark_all_temps_used
PROTO ((void));
1997 extern void init_temp_slots
PROTO ((void));
1998 extern void combine_temp_slots
PROTO ((void));
1999 extern void free_temp_slots
PROTO ((void));
2000 extern void pop_temp_slots
PROTO ((void));
2001 extern void push_temp_slots
PROTO ((void));
2002 extern void preserve_temp_slots
PROTO ((struct rtx_def
*));
2003 extern int aggregate_value_p
PROTO ((tree
));
2004 extern tree reorder_blocks
PROTO ((tree
*, tree
,
2006 extern void free_temps_for_rtl_expr
PROTO ((tree
));
2007 extern void instantiate_virtual_regs
PROTO ((tree
, struct rtx_def
*));
2008 extern int max_parm_reg_num
PROTO ((void));
2009 extern void push_function_context
PROTO ((void));
2010 extern void pop_function_context
PROTO ((void));
2011 extern void push_function_context_to
PROTO ((tree
));
2012 extern void pop_function_context_from
PROTO ((tree
));
2014 /* In print-rtl.c */
2016 extern void print_rtl
PROTO ((FILE *, struct rtx_def
*));
2019 /* In print-tree.c */
2020 extern void debug_tree
PROTO ((tree
));
2022 extern void print_node
PROTO ((FILE *, char *, tree
, int));
2023 extern void print_node_brief
PROTO ((FILE *, char *, tree
, int));
2024 extern void indent_to
PROTO ((FILE *, int));
2028 extern void emit_queue
PROTO ((void));
2029 extern int apply_args_register_offset
PROTO ((int));
2030 extern struct rtx_def
*expand_builtin_return_addr
2031 PROTO ((enum built_in_function
, int, struct rtx_def
*));
2032 extern void do_pending_stack_adjust
PROTO ((void));
2033 extern struct rtx_def
*expand_assignment
PROTO ((tree
, tree
, int, int));
2034 extern struct rtx_def
*store_expr
PROTO ((tree
, struct rtx_def
*,
2038 extern void start_sequence_for_rtl_expr
PROTO ((tree
));
2039 extern struct rtx_def
*emit_line_note_after
PROTO ((char *, int,
2041 extern struct rtx_def
*emit_line_note
PROTO ((char *, int));
2042 extern struct rtx_def
*emit_line_note_force
PROTO ((char *, int));
2045 extern int mark_addressable
PROTO ((tree
));
2046 extern void incomplete_type_error
PROTO ((tree
, tree
));
2049 extern void print_lang_statistics
PROTO ((void));
2052 extern tree truthvalue_conversion
PROTO ((tree
));
2053 extern int min_precision
PROTO ((tree
, int));
2054 extern void split_specs_attrs
PROTO ((tree
, tree
*, tree
*));
2058 extern void print_lang_decl
PROTO ((FILE *, tree
, int));
2059 extern void print_lang_type
PROTO ((FILE *, tree
, int));
2060 extern void print_lang_identifier
PROTO ((FILE *, tree
, int));
2062 extern int global_bindings_p
PROTO ((void));
2063 extern void insert_block
PROTO ((tree
));
2065 /* In integrate.c */
2066 extern void save_for_inline_nocopy
PROTO ((tree
));
2067 extern void save_for_inline_copying
PROTO ((tree
));
2068 extern void set_decl_abstract_flags
PROTO ((tree
, int));
2069 extern void output_inline_function
PROTO ((tree
));
2072 extern void set_yydebug
PROTO ((int));
2074 /* In stor-layout.c */
2075 extern void fixup_signed_type
PROTO ((tree
));
2078 extern void make_decl_rtl
PROTO ((tree
, char *, int));
2079 extern void make_decl_one_only
PROTO ((tree
));
2080 extern void variable_section
PROTO ((tree
, int));
2083 extern void print_time
PROTO ((char *, int));
2084 extern int get_run_time
PROTO ((void));
2085 extern void debug_start_source_file
PROTO ((char *));
2086 extern void debug_end_source_file
PROTO ((unsigned));
2087 extern void debug_define
PROTO ((unsigned, char *));
2088 extern void debug_undef
PROTO ((unsigned, char *));
2089 extern void rest_of_decl_compilation
PROTO ((tree
, char *, int, int));
2090 extern void rest_of_type_compilation
PROTO ((tree
, int));
2091 extern void rest_of_compilation
PROTO ((tree
));
2092 extern void fatal
PVPROTO ((char *, ...));
2093 extern void fatal_io_error
PROTO ((char *));
2095 extern void warning
PVPROTO ((char *, ...));
2096 extern void error
PVPROTO ((char *, ...));
2098 extern void pedwarn
PVPROTO ((char *, ...));
2099 extern void pedwarn_with_decl
PVPROTO ((tree
, char *, ...));
2100 extern void pedwarn_with_file_and_line
PVPROTO ((char *, int, char *, ...));
2101 extern void warning_with_file_and_line
PVPROTO ((char *, int, char *, ...));
2102 extern void warning_with_decl
PVPROTO ((tree
, char *, ...));
2103 extern void error_with_decl
PVPROTO ((tree
, char *, ...));
2104 extern void error_with_file_and_line
PVPROTO ((char *, int, char *, ...));
2105 extern void sorry
PVPROTO ((char *s
, ...));
2106 extern void default_print_error_function
PROTO ((char *));
2107 extern void report_error_function
PROTO ((char *));
2108 extern void announce_function
PROTO ((tree
));
2110 /* In fold-const.c */
2111 extern int div_and_round_double
PROTO ((enum tree_code
, int,
2112 HOST_WIDE_INT
, HOST_WIDE_INT
,
2113 HOST_WIDE_INT
, HOST_WIDE_INT
,
2120 extern void emit_nop
PROTO ((void));
2121 extern void expand_computed_goto
PROTO ((tree
));
2122 extern struct rtx_def
*label_rtx
PROTO ((tree
));
2123 extern void expand_asm_operands
PROTO ((tree
, tree
, tree
, tree
, int,
2125 extern int any_pending_cleanups
PROTO ((int));
2126 extern void init_stmt
PROTO ((void));
2127 extern void init_stmt_for_function
PROTO ((void));
2128 extern void remember_end_note
PROTO ((tree
));
2129 extern int drop_through_at_end_p
PROTO ((void));
2130 extern void expand_start_target_temps
PROTO ((void));
2131 extern void expand_end_target_temps
PROTO ((void));
2132 extern void expand_elseif
PROTO ((tree
));
2133 extern void expand_decl
PROTO ((tree
));
2134 extern int expand_decl_cleanup
PROTO ((tree
, tree
));
2135 extern void expand_anon_union_decl
PROTO ((tree
, tree
, tree
));
2136 extern void move_cleanups_up
PROTO ((void));
2137 extern void expand_start_case_dummy
PROTO ((void));
2138 extern void expand_end_case_dummy
PROTO ((void));
2139 extern tree case_index_expr_type
PROTO ((void));
2140 extern HOST_WIDE_INT all_cases_count
PROTO ((tree
, int *));
2141 extern void mark_seen_cases
PROTO ((tree
, unsigned char *,
2143 extern void check_for_full_enumeration_handling
PROTO ((tree
));
2144 extern void declare_nonlocal_label
PROTO ((tree
));
2146 extern void lang_print_xnode
PROTO ((FILE *, tree
, int));
2150 /* If KIND=='I', return a suitable global initializer (constructor) name.
2151 If KIND=='D', return a suitable global clean-up (destructor) name. */
2152 extern tree get_file_function_name
PROTO((int));
2154 /* Interface of the DWARF2 unwind info support. */
2156 /* Decide whether we want to emit frame unwind information for the current
2157 translation unit. */
2159 extern int dwarf2out_do_frame
PROTO((void));
2161 /* Generate a new label for the CFI info to refer to. */
2163 extern char *dwarf2out_cfi_label
PROTO((void));
2165 /* Entry point to update the canonical frame address (CFA). */
2167 extern void dwarf2out_def_cfa
PROTO((char *, unsigned, long));
2169 /* Add the CFI for saving a register window. */
2171 extern void dwarf2out_window_save
PROTO((char *));
2173 /* Add a CFI to update the running total of the size of arguments pushed
2176 extern void dwarf2out_args_size
PROTO((char *, long));
2178 /* Entry point for saving a register to the stack. */
2180 extern void dwarf2out_reg_save
PROTO((char *, unsigned, long));
2182 /* Entry point for saving the return address in the stack. */
2184 extern void dwarf2out_return_save
PROTO((char *, long));
2186 /* Entry point for saving the return address in a register. */
2188 extern void dwarf2out_return_reg
PROTO((char *, unsigned));
2190 /* Output a marker (i.e. a label) for the beginning of a function, before
2193 extern void dwarf2out_begin_prologue
PROTO((void));
2195 /* Output a marker (i.e. a label) for the absolute end of the generated
2196 code for a function definition. */
2198 extern void dwarf2out_end_epilogue
PROTO((void));