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 == 'e')
60 /* Number of argument-words in each kind of tree-node. */
62 extern int tree_code_length[MAX_TREE_CODES];
64 /* Names of tree components. */
66 extern char *tree_code_name[MAX_TREE_CODES];
68 /* Codes that identify the various built in functions
69 so that expand_call can identify them quickly. */
71 enum built_in_function
97 BUILT_IN_CLASSIFY_TYPE,
101 BUILT_IN_FRAME_ADDRESS,
102 BUILT_IN_RETURN_ADDRESS,
103 BUILT_IN_AGGREGATE_INCOMING_ADDRESS,
104 BUILT_IN_CALLER_RETURN_ADDRESS,
111 /* Various hooks for the DWARF 2 __throw routine. */
112 BUILT_IN_FP, BUILT_IN_SP,
113 BUILT_IN_UNWIND_INIT,
114 BUILT_IN_DWARF_FP_REGNUM,
115 BUILT_IN_DWARF_REG_SIZE,
116 BUILT_IN_FROB_RETURN_ADDR,
117 BUILT_IN_EXTRACT_RETURN_ADDR,
118 BUILT_IN_SET_RETURN_ADDR_REG,
120 BUILT_IN_SET_EH_REGS,
128 /* Upper bound on non-language-specific builtins. */
132 /* The definition of tree nodes fills the next several pages. */
134 /* A tree node can represent a data type, a variable, an expression
135 or a statement. Each node has a TREE_CODE which says what kind of
136 thing it represents. Some common codes are:
137 INTEGER_TYPE -- represents a type of integers.
138 ARRAY_TYPE -- represents a type of pointer.
139 VAR_DECL -- represents a declared variable.
140 INTEGER_CST -- represents a constant integer value.
141 PLUS_EXPR -- represents a sum (an expression).
143 As for the contents of a tree node: there are some fields
144 that all nodes share. Each TREE_CODE has various special-purpose
145 fields as well. The fields of a node are never accessed directly,
146 always through accessor macros. */
148 /* This type is used everywhere to refer to a tree node. */
150 typedef union tree_node *tree;
152 /* Every kind of tree node starts with this structure,
153 so all nodes have these fields.
155 See the accessor macros, defined below, for documentation of the fields. */
159 union tree_node *chain;
160 union tree_node *type;
161 #ifdef ONLY_INT_FIELDS
162 unsigned int code : 8;
164 enum tree_code code : 8;
167 unsigned side_effects_flag : 1;
168 unsigned constant_flag : 1;
169 unsigned permanent_flag : 1;
170 unsigned addressable_flag : 1;
171 unsigned volatile_flag : 1;
172 unsigned readonly_flag : 1;
173 unsigned unsigned_flag : 1;
174 unsigned asm_written_flag: 1;
176 unsigned used_flag : 1;
177 unsigned raises_flag : 1;
178 unsigned static_flag : 1;
179 unsigned public_flag : 1;
180 unsigned private_flag : 1;
181 unsigned protected_flag : 1;
183 unsigned lang_flag_0 : 1;
184 unsigned lang_flag_1 : 1;
185 unsigned lang_flag_2 : 1;
186 unsigned lang_flag_3 : 1;
187 unsigned lang_flag_4 : 1;
188 unsigned lang_flag_5 : 1;
189 unsigned lang_flag_6 : 1;
190 /* There is room for three more flags. */
193 /* The following table lists the uses of each of the above flags and
194 for which types of nodes they are defined. Note that expressions
200 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
206 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
207 TREE_NO_UNUSED_WARNING in
208 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
210 TREE_LIST or TREE_VEC
211 TREE_CONSTANT_OVERFLOW in
212 INTEGER_CST, REAL_CST, COMPLEX_CST
213 TREE_SYMBOL_REFERENCED in
219 INTEGER_CST, REAL_CST, COMPLEX_CST
221 VAR_DECL or FUNCTION_DECL
223 TREE_LIST or TREE_VEC
228 TREE_LIST or TREE_VEC
230 ??? unspecified nodes
234 TREE_VIA_PROTECTED in
238 ??? unspecified nodes
247 TREE_THIS_VOLATILE in
257 VAR_DECL if iterator (C)
266 permanent_flag: TREE_PERMANENT in all nodes
271 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
272 DECL_BUILT_IN_NONANSI in
276 SAVE_EXPR_NOPLACEHOLDER in
282 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
288 expressions, IDENTIFIER_NODE
296 /* Define accessors for the fields that all tree nodes have
297 (though some fields are not used for all kinds of nodes). */
299 /* The tree-code says what kind of node it is.
300 Codes are defined in tree.def. */
301 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
302 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
304 /* In all nodes that are expressions, this is the data type of the expression.
305 In POINTER_TYPE nodes, this is the type that the pointer points to.
306 In ARRAY_TYPE nodes, this is the type of the elements. */
307 #define TREE_TYPE(NODE) ((NODE)->common.type)
309 /* Nodes are chained together for many purposes.
310 Types are chained together to record them for being output to the debugger
311 (see the function `chain_type').
312 Decls in the same scope are chained together to record the contents
314 Statement nodes for successive statements used to be chained together.
315 Often lists of things are represented by TREE_LIST nodes that
316 are chained together. */
318 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
320 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
321 that don't change the machine mode. */
323 #define STRIP_NOPS(EXP) \
324 while ((TREE_CODE (EXP) == NOP_EXPR \
325 || TREE_CODE (EXP) == CONVERT_EXPR \
326 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
327 && (TYPE_MODE (TREE_TYPE (EXP)) \
328 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
329 (EXP) = TREE_OPERAND (EXP, 0);
331 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
333 #define STRIP_TYPE_NOPS(EXP) \
334 while ((TREE_CODE (EXP) == NOP_EXPR \
335 || TREE_CODE (EXP) == CONVERT_EXPR \
336 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
337 && (TREE_TYPE (EXP) \
338 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
339 (EXP) = TREE_OPERAND (EXP, 0);
341 /* Nonzero if TYPE represents an integral type. Note that we do not
342 include COMPLEX types here. */
344 #define INTEGRAL_TYPE_P(TYPE) \
345 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
346 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
348 /* Nonzero if TYPE represents a floating-point type, including complex
349 floating-point types. */
351 #define FLOAT_TYPE_P(TYPE) \
352 (TREE_CODE (TYPE) == REAL_TYPE \
353 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
354 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
356 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
358 #define AGGREGATE_TYPE_P(TYPE) \
359 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
360 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
361 || TREE_CODE (TYPE) == SET_TYPE)
363 /* Nonzero if TYPE represents a pointer type. */
365 #define POINTER_TYPE_P(TYPE) \
366 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
368 /* Define many boolean fields that all tree nodes have. */
370 /* In VAR_DECL nodes, nonzero means address of this is needed.
371 So it cannot be in a register.
372 In a FUNCTION_DECL, nonzero means its address is needed.
373 So it must be compiled even if it is an inline function.
374 In CONSTRUCTOR nodes, it means object constructed must be in memory.
375 In LABEL_DECL nodes, it means a goto for this label has been seen
376 from a place outside all binding contours that restore stack levels.
377 In ..._TYPE nodes, it means that objects of this type must
378 be fully addressable. This means that pieces of this
379 object cannot go into register parameters, for example.
380 In IDENTIFIER_NODEs, this means that some extern decl for this name
381 had its address taken. That matters for inline functions. */
382 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
384 /* In a VAR_DECL, nonzero means allocate static storage.
385 In a FUNCTION_DECL, nonzero if function has been defined.
386 In a CONSTRUCTOR, nonzero means allocate static storage. */
387 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
389 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
390 made implicitly and should not lead to an "unused value" warning. */
391 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
393 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
394 chain is via a `virtual' declaration. */
395 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
397 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
398 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
399 requires a diagnostic when overflows occur in constant expressions. */
400 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
402 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
403 this string as an argument. */
404 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
406 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
407 overflow in folding, and no warning has been issued for this subexpression.
408 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
409 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
411 /* In a VAR_DECL or FUNCTION_DECL,
412 nonzero means name is to be accessible from outside this module.
413 In an identifier node, nonzero means an external declaration
414 accessible from outside this module was previously seen
415 for this name in an inner scope. */
416 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
418 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
419 base class is via a `public' declaration, which preserves public
420 fields from the base class as public. */
421 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
423 /* Ditto, for `private' declarations. */
424 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
426 /* Nonzero for TREE_LIST node means that the path to the
427 base class is via a `protected' declaration, which preserves
428 protected fields from the base class as protected.
430 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
432 /* In any expression, nonzero means it has side effects or reevaluation
433 of the whole expression could produce a different value.
434 This is set if any subexpression is a function call, a side effect
435 or a reference to a volatile variable.
436 In a ..._DECL, this is set only if the declaration said `volatile'. */
437 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
439 /* Nonzero means this expression is volatile in the C sense:
440 its address should be of type `volatile WHATEVER *'.
441 In other words, the declared item is volatile qualified.
442 This is used in _DECL nodes and _REF nodes.
444 In a ..._TYPE node, means this type is volatile-qualified.
445 But use TYPE_VOLATILE instead of this macro when the node is a type,
446 because eventually we may make that a different bit.
448 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
449 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
451 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
452 nonzero means it may not be the lhs of an assignment.
453 In a ..._TYPE node, means this type is const-qualified
454 (but the macro TYPE_READONLY should be used instead of this macro
455 when the node is a type). */
456 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
458 /* Value of expression is constant.
459 Always appears in all ..._CST nodes.
460 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
461 if the value is constant. */
462 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
464 /* Nonzero means permanent node;
465 node will continue to exist for the entire compiler run.
466 Otherwise it will be recycled at the end of the function. */
467 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
469 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
470 In FIELD_DECL nodes, means an unsigned bit field.
471 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
472 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
474 /* Nonzero in a VAR_DECL means assembler code has been written.
475 Nonzero in a FUNCTION_DECL means that the function has been compiled.
476 This is interesting in an inline function, since it might not need
477 to be compiled separately.
478 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
479 if the sdb debugging info for the type has been written.
480 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
481 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
483 /* Nonzero in a _DECL if the name is used in its scope.
484 Nonzero in an expr node means inhibit warning if value is unused.
485 In IDENTIFIER_NODEs, this means that some extern decl for this name
487 #define TREE_USED(NODE) ((NODE)->common.used_flag)
489 /* Nonzero for a tree node whose evaluation could result
490 in the raising of an exception. Not implemented yet. */
491 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
493 /* Used in classes in C++. */
494 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
495 /* Used in classes in C++.
496 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
497 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
499 /* These flags are available for each language front end to use internally. */
500 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
501 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
502 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
503 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
504 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
505 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
506 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
508 /* Define additional fields and accessors for nodes representing constants. */
510 /* In an INTEGER_CST node. These two together make a 2-word integer.
511 If the data type is signed, the value is sign-extended to 2 words
512 even though not all of them may really be in use.
513 In an unsigned constant shorter than 2 words, the extra bits are 0. */
514 #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low)
515 #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high)
517 #define INT_CST_LT(A, B) \
518 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
519 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
520 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
521 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
523 #define INT_CST_LT_UNSIGNED(A, B) \
524 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
525 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
526 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
527 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
528 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
529 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
533 char common[sizeof (struct tree_common)];
534 struct rtx_def *rtl; /* acts as link to register transfer language
536 HOST_WIDE_INT int_cst_low;
537 HOST_WIDE_INT int_cst_high;
540 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
541 and generally in all kinds of constants that could
542 be given labels (rather than being immediate). */
544 #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl)
546 /* In a REAL_CST node. */
547 /* We can represent a real value as either a `double' or a string.
548 Strings don't allow for any optimization, but they do allow
549 for cross-compilation. */
551 #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst)
557 char common[sizeof (struct tree_common)];
558 struct rtx_def *rtl; /* acts as link to register transfer language
560 REAL_VALUE_TYPE real_cst;
563 /* In a STRING_CST */
564 #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length)
565 #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer)
569 char common[sizeof (struct tree_common)];
570 struct rtx_def *rtl; /* acts as link to register transfer language
576 /* In a COMPLEX_CST node. */
577 #define TREE_REALPART(NODE) ((NODE)->complex.real)
578 #define TREE_IMAGPART(NODE) ((NODE)->complex.imag)
582 char common[sizeof (struct tree_common)];
583 struct rtx_def *rtl; /* acts as link to register transfer language
585 union tree_node *real;
586 union tree_node *imag;
589 /* Define fields and accessors for some special-purpose tree nodes. */
591 #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length)
592 #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer)
594 struct tree_identifier
596 char common[sizeof (struct tree_common)];
601 /* In a TREE_LIST node. */
602 #define TREE_PURPOSE(NODE) ((NODE)->list.purpose)
603 #define TREE_VALUE(NODE) ((NODE)->list.value)
607 char common[sizeof (struct tree_common)];
608 union tree_node *purpose;
609 union tree_node *value;
612 /* In a TREE_VEC node. */
613 #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length)
614 #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I])
615 #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length]))
619 char common[sizeof (struct tree_common)];
621 union tree_node *a[1];
624 /* Define fields and accessors for some nodes that represent expressions. */
626 /* In a SAVE_EXPR node. */
627 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
628 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
629 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
631 /* In a RTL_EXPR node. */
632 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0])
633 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1])
635 /* In a CALL_EXPR node. */
636 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
638 /* In a CONSTRUCTOR node. */
639 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
641 /* In ordinary expression nodes. */
642 #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I])
643 #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity)
645 /* In expression with file location information. */
646 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
647 #define EXPR_WFL_FILENAME(NODE) (IDENTIFIER_POINTER ((NODE)->common.chain))
648 #define EXPR_WFL_FILENAME_NODE(NODE) ((NODE)->common.chain)
649 #define EXPR_WFL_LINENO(NODE) ((NODE)->exp.complexity >> 12)
650 #define EXPR_WFL_COLNO(NODE) ((NODE)->exp.complexity & 0xfff)
651 #define EXPR_WFL_LINECOL(NODE) ((NODE)->exp.complexity)
652 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
653 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
654 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.lang_flag_0)
658 char common[sizeof (struct tree_common)];
660 union tree_node *operands[1];
663 /* In a BLOCK node. */
664 #define BLOCK_VARS(NODE) ((NODE)->block.vars)
665 #define BLOCK_TYPE_TAGS(NODE) ((NODE)->block.type_tags)
666 #define BLOCK_SUBBLOCKS(NODE) ((NODE)->block.subblocks)
667 #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->block.supercontext)
668 /* Note: when changing this, make sure to find the places
669 that use chainon or nreverse. */
670 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
671 #define BLOCK_ABSTRACT_ORIGIN(NODE) ((NODE)->block.abstract_origin)
672 #define BLOCK_ABSTRACT(NODE) ((NODE)->block.abstract_flag)
673 #define BLOCK_END_NOTE(NODE) ((NODE)->block.end_note)
675 /* Nonzero means that this block is prepared to handle exceptions
676 listed in the BLOCK_VARS slot. */
677 #define BLOCK_HANDLER_BLOCK(NODE) ((NODE)->block.handler_block_flag)
681 char common[sizeof (struct tree_common)];
683 unsigned handler_block_flag : 1;
684 unsigned abstract_flag : 1;
686 union tree_node *vars;
687 union tree_node *type_tags;
688 union tree_node *subblocks;
689 union tree_node *supercontext;
690 union tree_node *abstract_origin;
691 struct rtx_def *end_note;
694 /* Define fields and accessors for nodes representing data types. */
696 /* See tree.def for documentation of the use of these fields.
697 Look at the documentation of the various ..._TYPE tree codes. */
699 #define TYPE_UID(NODE) ((NODE)->type.uid)
700 #define TYPE_SIZE(NODE) ((NODE)->type.size)
701 #define TYPE_MODE(NODE) ((NODE)->type.mode)
702 #define TYPE_VALUES(NODE) ((NODE)->type.values)
703 #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
704 #define TYPE_FIELDS(NODE) ((NODE)->type.values)
705 #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
706 #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
707 #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
708 #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
709 #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
710 #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
711 #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
712 #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
713 #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
714 #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
715 #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab.address)
716 #define TYPE_SYMTAB_POINTER(NODE) ((NODE)->type.symtab.pointer)
717 #define TYPE_NAME(NODE) ((NODE)->type.name)
718 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
719 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
720 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
721 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
722 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
723 #define TYPE_OBSTACK(NODE) ((NODE)->type.obstack)
724 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
726 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
728 #define TYPE_ATTRIBUTES(NODE) ((NODE)->type.attributes)
730 /* The alignment necessary for objects of this type.
731 The value is an int, measured in bits. */
732 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
734 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
736 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
737 has BLKmode only because it lacks the alignment requirement for
739 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
741 /* Nonzero in a type considered volatile as a whole. */
742 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
744 /* Means this type is const-qualified. */
745 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
747 /* These flags are available for each language front end to use internally. */
748 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
749 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
750 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
751 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
752 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
753 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
754 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
756 /* If set in an ARRAY_TYPE, indicates a string type (for languages
757 that distinguish string from array of char).
758 If set in a SET_TYPE, indicates a bitstring type. */
759 #define TYPE_STRING_FLAG(NODE) ((NODE)->type.string_flag)
761 /* If non-NULL, this is a upper bound of the size (in bytes) of an
762 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
763 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
765 /* Indicates that objects of this type must be initialized by calling a
766 function when they are created. */
767 #define TYPE_NEEDS_CONSTRUCTING(NODE) ((NODE)->type.needs_constructing_flag)
769 /* Indicates that objects of this type (a UNION_TYPE), should be passed
770 the same way that the first union alternative would be passed. */
771 #define TYPE_TRANSPARENT_UNION(NODE) ((NODE)->type.transparent_union_flag)
773 /* Indicated that objects of this type should be laid out in as
774 compact a way as possible. */
775 #define TYPE_PACKED(NODE) ((NODE)->type.packed_flag)
779 char common[sizeof (struct tree_common)];
780 union tree_node *values;
781 union tree_node *size;
782 union tree_node *attributes;
785 unsigned char precision;
786 #ifdef ONLY_INT_FIELDS
789 enum machine_mode mode : 8;
792 unsigned string_flag : 1;
793 unsigned no_force_blk_flag : 1;
794 unsigned needs_constructing_flag : 1;
795 unsigned transparent_union_flag : 1;
796 unsigned packed_flag : 1;
797 unsigned lang_flag_0 : 1;
798 unsigned lang_flag_1 : 1;
799 unsigned lang_flag_2 : 1;
800 unsigned lang_flag_3 : 1;
801 unsigned lang_flag_4 : 1;
802 unsigned lang_flag_5 : 1;
803 unsigned lang_flag_6 : 1;
804 /* room for 4 more bits */
807 union tree_node *pointer_to;
808 union tree_node *reference_to;
809 union {int address; char *pointer; } symtab;
810 union tree_node *name;
811 union tree_node *minval;
812 union tree_node *maxval;
813 union tree_node *next_variant;
814 union tree_node *main_variant;
815 union tree_node *binfo;
816 union tree_node *noncopied_parts;
817 union tree_node *context;
818 struct obstack *obstack;
819 /* Points to a structure whose details depend on the language in use. */
820 struct lang_type *lang_specific;
823 /* Define accessor macros for information about type inheritance
826 A "basetype" means a particular usage of a data type for inheritance
827 in another type. Each such basetype usage has its own "binfo"
828 object to describe it. The binfo object is a TREE_VEC node.
830 Inheritance is represented by the binfo nodes allocated for a
831 given type. For example, given types C and D, such that D is
832 inherited by C, 3 binfo nodes will be allocated: one for describing
833 the binfo properties of C, similarly one for D, and one for
834 describing the binfo properties of D as a base type for C.
835 Thus, given a pointer to class C, one can get a pointer to the binfo
836 of D acting as a basetype for C by looking at C's binfo's basetypes. */
838 /* The actual data type node being inherited in this basetype. */
839 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
841 /* The offset where this basetype appears in its containing type.
842 BINFO_OFFSET slot holds the offset (in bytes)
843 from the base of the complete object to the base of the part of the
844 object that is allocated on behalf of this `type'.
845 This is always 0 except when there is multiple inheritance. */
847 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
848 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
849 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
851 /* The virtual function table belonging to this basetype. Virtual
852 function tables provide a mechanism for run-time method dispatching.
853 The entries of a virtual function table are language-dependent. */
855 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
856 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
858 /* The virtual functions in the virtual function table. This is
859 a TREE_LIST that is used as an initial approximation for building
860 a virtual function table for this basetype. */
861 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
862 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
864 /* A vector of additional binfos for the types inherited by this basetype.
866 If this basetype describes type D as inherited in C,
867 and if the basetypes of D are E anf F,
868 then this vector contains binfos for inheritance of E and F by C.
870 ??? This could probably be done by just allocating the
871 base types at the end of this TREE_VEC (instead of using
872 another TREE_VEC). This would simplify the calculation
873 of how many basetypes a given type had. */
874 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
875 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
877 /* Accessor macro to get to the Nth basetype of this basetype. */
878 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
879 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
881 /* For a BINFO record describing an inheritance, this yields a pointer
882 to the artificial FIELD_DECL node which contains the "virtual base
883 class pointer" for the given inheritance. */
884 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
886 /* The size of a base class subobject of this type. */
887 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
888 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
890 /* Slot used to build a chain that represents a use of inheritance.
891 For example, if X is derived from Y, and Y is derived from Z,
892 then this field can be used to link the binfo node for X to
893 the binfo node for X's Y to represent the use of inheritance
894 from X to Y. Similarly, this slot of the binfo node for X's Y
895 can point to the Z from which Y is inherited (in X's inheritance
896 hierarchy). In this fashion, one can represent and traverse specific
897 uses of inheritance using the binfo nodes themselves (instead of
898 consing new space pointing to binfo nodes).
899 It is up to the language-dependent front-ends to maintain
900 this information as necessary. */
901 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
903 /* Define fields and accessors for nodes representing declared names. */
905 /* This is the name of the object as written by the user.
906 It is an IDENTIFIER_NODE. */
907 #define DECL_NAME(NODE) ((NODE)->decl.name)
908 /* This is the name of the object as the assembler will see it
909 (but before any translations made by ASM_OUTPUT_LABELREF).
910 Often this is the same as DECL_NAME.
911 It is an IDENTIFIER_NODE. */
912 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
913 /* Records the section name in a section attribute. Used to pass
914 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
915 #define DECL_SECTION_NAME(NODE) ((NODE)->decl.section_name)
916 /* For FIELD_DECLs, this is the
917 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
918 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
919 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
920 containing function, the RECORD_TYPE or UNION_TYPE for the containing
921 type, or NULL_TREE if the given decl has "file scope". */
922 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
923 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
924 /* In a DECL this is the field where configuration dependent machine
925 attributes are store */
926 #define DECL_MACHINE_ATTRIBUTES(NODE) ((NODE)->decl.machine_attributes)
927 /* In a FIELD_DECL, this is the field position, counting in bits,
928 of the bit closest to the beginning of the structure. */
929 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
930 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
931 if so, the type that was originally specified for it.
932 TREE_TYPE may have been modified (in finish_struct). */
933 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
934 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
935 /* VAR_DECL and PARM_DECL reserve the arguments slot
936 for language-specific uses. */
937 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
938 /* In FUNCTION_DECL, holds the decl for the return value. */
939 #define DECL_RESULT(NODE) ((NODE)->decl.result)
940 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
941 #define DECL_ORIGINAL_TYPE(NODE) ((NODE)->decl.result)
942 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
943 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
944 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
945 For a VAR_DECL, holds the initial value.
946 For a PARM_DECL, not used--default
947 values for parameters are encoded in the type of the function,
948 not in the PARM_DECL slot. */
949 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
950 /* For a PARM_DECL, records the data type used to pass the argument,
951 which may be different from the type seen in the program. */
952 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
953 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
954 if nonzero, indicates that the field occupies the type. */
955 #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial)
956 /* These two fields describe where in the source code the declaration was. */
957 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
958 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
959 /* Holds the size of the datum, as a tree expression.
960 Need not be constant. */
961 #define DECL_SIZE(NODE) ((NODE)->decl.size)
962 /* Holds the alignment required for the datum. */
963 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size.u)
964 /* Holds the machine mode corresponding to the declaration of a variable or
965 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
967 #define DECL_MODE(NODE) ((NODE)->decl.mode)
968 /* Holds the RTL expression for the value of a variable or function. If
969 PROMOTED_MODE is defined, the mode of this expression may not be same
970 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
971 to the variable's data type, while the mode
972 of DECL_RTL is the mode actually used to contain the data. */
973 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
974 /* For PARM_DECL, holds an RTL for the stack slot or register
975 where the data was actually passed. */
976 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
977 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
978 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
979 /* For FUNCTION_DECL, if it is inline,
980 holds the size of the stack frame, as an integer. */
981 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size.i)
982 /* For FUNCTION_DECL, if it is built-in,
983 this identifies which built-in operation it is. */
984 #define DECL_FUNCTION_CODE(NODE) ((NODE)->decl.frame_size.f)
985 #define DECL_SET_FUNCTION_CODE(NODE,VAL) ((NODE)->decl.frame_size.f = (VAL))
986 /* For a FIELD_DECL, holds the size of the member as an integer. */
987 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
989 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
990 Before the struct containing the FUNCTION_DECL is laid out,
991 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
992 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
993 function. When the class is laid out, this pointer is changed
994 to an INTEGER_CST node which is suitable for use as an index
995 into the virtual function table. */
996 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
997 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
998 which this FIELD_DECL is defined. This information is needed when
999 writing debugging information about vfield and vbase decls for C++. */
1000 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
1002 /* Every ..._DECL node gets a unique number. */
1003 #define DECL_UID(NODE) ((NODE)->decl.uid)
1005 /* For any sort of a ..._DECL node, this points to the original (abstract)
1006 decl node which this decl is an instance of, or else it is NULL indicating
1007 that this decl is not an instance of some other decl. For example,
1008 in a nested declaration of an inline function, this points back to the
1010 #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin)
1012 /* Nonzero for any sort of ..._DECL node means this decl node represents
1013 an inline instance of some original (abstract) decl from an inline function;
1014 suppress any warnings about shadowing some other variable. */
1015 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
1017 /* Nonzero if a _DECL means that the name of this decl should be ignored
1018 for symbolic debug purposes. */
1019 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
1021 /* Nonzero for a given ..._DECL node means that this node represents an
1022 "abstract instance" of the given declaration (e.g. in the original
1023 declaration of an inline function). When generating symbolic debugging
1024 information, we mustn't try to generate any address information for nodes
1025 marked as "abstract instances" because we don't actually generate
1026 any code or allocate any data space for such instances. */
1027 #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag)
1029 /* Nonzero if a _DECL means that no warnings should be generated just
1030 because this decl is unused. */
1031 #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag)
1033 /* Nonzero for a given ..._DECL node means that this node should be
1034 put in .common, if possible. If a DECL_INITIAL is given, and it
1035 is not error_mark_node, then the decl cannot be put in .common. */
1036 #define DECL_COMMON(NODE) ((NODE)->decl.common_flag)
1038 /* Language-specific decl information. */
1039 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
1041 /* In a VAR_DECL or FUNCTION_DECL,
1042 nonzero means external reference:
1043 do not allocate storage, and refer to a definition elsewhere. */
1044 #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag)
1047 nonzero means the detail info about this type is not dumped into stabs.
1048 Instead it will generate cross reference ('x') of names.
1049 This uses the same flag as DECL_EXTERNAL. */
1050 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) ((NODE)->decl.external_flag)
1053 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1054 #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag)
1055 /* In LABEL_DECL nodes, nonzero means that an error message about
1056 jumping into such a binding contour has been printed for this label. */
1057 #define DECL_ERROR_ISSUED(NODE) ((NODE)->decl.regdecl_flag)
1058 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1059 #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag)
1060 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1061 static chain is not needed. */
1062 #define DECL_NO_STATIC_CHAIN(NODE) ((NODE)->decl.regdecl_flag)
1064 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1065 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1067 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1069 Also set in some languages for variables, etc., outside the normal
1070 lexical scope, such as class instance variables. */
1071 #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
1073 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1074 where it is called. */
1075 #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag)
1077 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1078 that is not specified by ansi C and that users are supposed to be allowed
1079 to redefine for any purpose whatever. */
1080 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1082 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1084 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
1085 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1086 contour that restored a stack level and which is now exited. */
1087 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
1088 /* In a FUNCTION_DECL, nonzero means a built in function. */
1089 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
1090 /* In a VAR_DECL that's static,
1091 nonzero if the space is in the text section. */
1092 #define DECL_IN_TEXT_SECTION(NODE) ((NODE)->decl.bit_field_flag)
1094 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1095 Used in FIELD_DECLs for vtable pointers.
1096 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1097 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
1099 /* Used to indicate that the linkage status of this DECL is not yet known,
1100 so it should not be output now. */
1101 #define DECL_DEFER_OUTPUT(NODE) ((NODE)->decl.defer_output)
1103 /* Used in PARM_DECLs whose type are unions to indicate that the
1104 argument should be passed in the same way that the first union
1105 alternative would be passed. */
1106 #define DECL_TRANSPARENT_UNION(NODE) ((NODE)->decl.transparent_union)
1108 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1109 at the beginning or end of execution. */
1110 #define DECL_STATIC_CONSTRUCTOR(NODE) ((NODE)->decl.static_ctor_flag)
1111 #define DECL_STATIC_DESTRUCTOR(NODE) ((NODE)->decl.static_dtor_flag)
1113 /* Used to indicate that this DECL represents a compiler-generated entity. */
1114 #define DECL_ARTIFICIAL(NODE) ((NODE)->decl.artificial_flag)
1116 /* Used to indicate that this DECL has weak linkage. */
1117 #define DECL_WEAK(NODE) ((NODE)->decl.weak_flag)
1119 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1120 multiple translation units should be merged. */
1121 #define DECL_ONE_ONLY(NODE) ((NODE)->decl.transparent_union)
1123 /* Additional flags for language-specific uses. */
1124 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
1125 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
1126 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
1127 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
1128 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
1129 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
1130 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
1131 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
1135 char common[sizeof (struct tree_common)];
1139 union tree_node *size;
1140 #ifdef ONLY_INT_FIELDS
1143 enum machine_mode mode : 8;
1146 unsigned external_flag : 1;
1147 unsigned nonlocal_flag : 1;
1148 unsigned regdecl_flag : 1;
1149 unsigned inline_flag : 1;
1150 unsigned bit_field_flag : 1;
1151 unsigned virtual_flag : 1;
1152 unsigned ignored_flag : 1;
1153 unsigned abstract_flag : 1;
1155 unsigned in_system_header_flag : 1;
1156 unsigned common_flag : 1;
1157 unsigned defer_output : 1;
1158 unsigned transparent_union : 1;
1159 unsigned static_ctor_flag : 1;
1160 unsigned static_dtor_flag : 1;
1161 unsigned artificial_flag : 1;
1162 unsigned weak_flag : 1;
1163 /* room for no more */
1165 unsigned lang_flag_0 : 1;
1166 unsigned lang_flag_1 : 1;
1167 unsigned lang_flag_2 : 1;
1168 unsigned lang_flag_3 : 1;
1169 unsigned lang_flag_4 : 1;
1170 unsigned lang_flag_5 : 1;
1171 unsigned lang_flag_6 : 1;
1172 unsigned lang_flag_7 : 1;
1174 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1175 If built-in, this is the code for which built-in function.
1176 For other kinds of decls, this is DECL_ALIGN. */
1180 enum built_in_function f;
1183 union tree_node *name;
1184 union tree_node *context;
1185 union tree_node *arguments;
1186 union tree_node *result;
1187 union tree_node *initial;
1188 union tree_node *abstract_origin;
1189 union tree_node *assembler_name;
1190 union tree_node *section_name;
1191 union tree_node *machine_attributes;
1192 struct rtx_def *rtl; /* acts as link to register transfer language
1194 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1195 on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */
1200 union tree_node *vindex;
1201 /* Points to a structure whose details depend on the language in use. */
1202 struct lang_decl *lang_specific;
1205 /* Define the overall contents of a tree node.
1206 It may be any of the structures declared above
1207 for various types of node. */
1211 struct tree_common common;
1212 struct tree_int_cst int_cst;
1213 struct tree_real_cst real_cst;
1214 struct tree_string string;
1215 struct tree_complex complex;
1216 struct tree_identifier identifier;
1217 struct tree_decl decl;
1218 struct tree_type type;
1219 struct tree_list list;
1220 struct tree_vec vec;
1221 struct tree_exp exp;
1222 struct tree_block block;
1225 #include "gansidecl.h"
1227 #define NULL_TREE (tree) NULL
1229 /* The following functions accept a wide integer argument. Rather than
1230 having to cast on every function call, we use a macro instead, that is
1231 defined here and in rtl.h. */
1234 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1235 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1237 extern int exact_log2_wide PROTO((unsigned HOST_WIDE_INT));
1238 extern int floor_log2_wide PROTO((unsigned HOST_WIDE_INT));
1241 /* At present, don't prototype xrealloc, since all of the callers don't
1242 cast their pointers to char *, and all of the xrealloc's don't use
1244 extern char *xmalloc PROTO((size_t));
1245 extern char *xrealloc PROTO((void *, size_t));
1247 extern char *xmalloc ();
1248 extern char *xrealloc ();
1251 extern char *xstrdup PROTO((char *));
1253 extern char *oballoc PROTO((int));
1254 extern char *permalloc PROTO((int));
1255 extern char *savealloc PROTO((int));
1256 extern char *expralloc PROTO((int));
1258 /* Lowest level primitive for allocating a node.
1259 The TREE_CODE is the only argument. Contents are initialized
1260 to zero except for a few of the common fields. */
1262 extern tree make_node PROTO((enum tree_code));
1264 /* Make a copy of a node, with all the same contents except
1265 for TREE_PERMANENT. (The copy is permanent
1266 iff nodes being made now are permanent.) */
1268 extern tree copy_node PROTO((tree));
1270 /* Make a copy of a chain of TREE_LIST nodes. */
1272 extern tree copy_list PROTO((tree));
1274 /* Make a TREE_VEC. */
1276 extern tree make_tree_vec PROTO((int));
1278 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1279 The name is supplied as a char *. */
1281 extern tree get_identifier PROTO((char *));
1283 /* If an identifier with the name TEXT (a null-terminated string) has
1284 previously been referred to, return that node; otherwise return
1287 extern tree maybe_get_identifier PROTO((char *));
1289 /* Construct various types of nodes. */
1291 #define build_int_2(LO,HI) \
1292 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1294 extern tree build PVPROTO((enum tree_code, tree, ...));
1295 extern tree build_nt PVPROTO((enum tree_code, ...));
1296 extern tree build_parse_node PVPROTO((enum tree_code, ...));
1298 extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1299 extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1300 extern tree build_real_from_int_cst PROTO((tree, tree));
1301 extern tree build_complex PROTO((tree, tree, tree));
1302 extern tree build_string PROTO((int, char *));
1303 extern tree build1 PROTO((enum tree_code, tree, tree));
1304 extern tree build_tree_list PROTO((tree, tree));
1305 extern tree build_decl_list PROTO((tree, tree));
1306 extern tree build_expr_list PROTO((tree, tree));
1307 extern tree build_decl PROTO((enum tree_code, tree, tree));
1308 extern tree build_block PROTO((tree, tree, tree, tree, tree));
1309 extern tree build_expr_wfl PROTO((tree, char *, int, int));
1311 /* Construct various nodes representing data types. */
1313 extern tree make_signed_type PROTO((int));
1314 extern tree make_unsigned_type PROTO((int));
1315 extern void set_sizetype PROTO((tree));
1316 extern tree signed_or_unsigned_type PROTO((int, tree));
1317 extern void fixup_unsigned_type PROTO((tree));
1318 extern tree build_pointer_type PROTO((tree));
1319 extern tree build_reference_type PROTO((tree));
1320 extern tree build_index_type PROTO((tree));
1321 extern tree build_index_2_type PROTO((tree, tree));
1322 extern tree build_array_type PROTO((tree, tree));
1323 extern tree build_function_type PROTO((tree, tree));
1324 extern tree build_method_type PROTO((tree, tree));
1325 extern tree build_offset_type PROTO((tree, tree));
1326 extern tree build_complex_type PROTO((tree));
1327 extern tree array_type_nelts PROTO((tree));
1329 extern tree value_member PROTO((tree, tree));
1330 extern tree purpose_member PROTO((tree, tree));
1331 extern tree binfo_member PROTO((tree, tree));
1332 extern int attribute_hash_list PROTO((tree));
1333 extern int attribute_list_equal PROTO((tree, tree));
1334 extern int attribute_list_contained PROTO((tree, tree));
1335 extern int tree_int_cst_equal PROTO((tree, tree));
1336 extern int tree_int_cst_lt PROTO((tree, tree));
1337 extern int tree_int_cst_sgn PROTO((tree));
1338 extern int index_type_equal PROTO((tree, tree));
1340 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1341 put the prototype here. Rtl.h does declare the prototype if
1342 tree.h had been included. */
1344 extern tree make_tree PROTO((tree, struct rtx_def *));
1346 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1349 Such modified types already made are recorded so that duplicates
1352 extern tree build_type_attribute_variant PROTO((tree, tree));
1353 extern tree build_decl_attribute_variant PROTO((tree, tree));
1355 extern tree merge_machine_decl_attributes PROTO((tree, tree));
1356 extern tree merge_machine_type_attributes PROTO((tree, tree));
1358 /* Split a list of declspecs and attributes into two. */
1360 extern void split_specs_attrs PROTO((tree, tree *, tree *));
1362 /* Strip attributes from a list of combined specs and attrs. */
1364 extern tree strip_attrs PROTO((tree));
1366 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1368 extern int valid_machine_attribute PROTO((tree, tree, tree, tree));
1370 /* Given a tree node and a string, return non-zero if the tree node is
1371 a valid attribute name for the string. */
1373 extern int is_attribute_p PROTO((char *, tree));
1375 /* Given an attribute name and a list of attributes, return the list element
1376 of the attribute or NULL_TREE if not found. */
1378 extern tree lookup_attribute PROTO((char *, tree));
1380 /* Given two attributes lists, return a list of their union. */
1382 extern tree merge_attributes PROTO((tree, tree));
1384 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1385 for the same kind of data as TYPE describes.
1386 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1387 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1388 so that duplicate variants are never made.
1389 Only main variants should ever appear as types of expressions. */
1391 extern tree build_type_variant PROTO((tree, int, int));
1393 /* Make a copy of a type node. */
1395 extern tree build_type_copy PROTO((tree));
1397 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1398 TYPE_ALIGN and TYPE_MODE fields.
1399 If called more than once on one node, does nothing except
1400 for the first time. */
1402 extern void layout_type PROTO((tree));
1404 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1405 return a canonicalized ..._TYPE node, so that duplicates are not made.
1406 How the hash code is computed is up to the caller, as long as any two
1407 callers that could hash identical-looking type nodes agree. */
1409 extern tree type_hash_canon PROTO((int, tree));
1411 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1412 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1413 fields. Call this only once for any given decl node.
1415 Second argument is the boundary that this field can be assumed to
1416 be starting at (in bits). Zero means it can be assumed aligned
1417 on any boundary that may be needed. */
1419 extern void layout_decl PROTO((tree, unsigned));
1421 /* Return an expr equal to X but certainly not valid as an lvalue. */
1423 extern tree non_lvalue PROTO((tree));
1424 extern tree pedantic_non_lvalue PROTO((tree));
1426 extern tree convert PROTO((tree, tree));
1427 extern tree size_in_bytes PROTO((tree));
1428 extern HOST_WIDE_INT int_size_in_bytes PROTO((tree));
1429 extern tree size_binop PROTO((enum tree_code, tree, tree));
1430 extern tree size_int_wide PROTO((unsigned HOST_WIDE_INT,
1431 unsigned HOST_WIDE_INT, int));
1432 #define size_int(L) size_int_2 ((L), 0, 0)
1433 #define bitsize_int(L, H) size_int_2 ((L), (H), 1)
1434 #define size_int_2(L, H, T) \
1435 size_int_wide ((unsigned HOST_WIDE_INT) (L), \
1436 (unsigned HOST_WIDE_INT) (H), (T))
1438 extern tree round_up PROTO((tree, int));
1439 extern tree get_pending_sizes PROTO((void));
1440 extern void put_pending_sizes PROTO((tree));
1442 /* Type for sizes of data-type. */
1444 #define BITS_PER_UNIT_LOG \
1445 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1446 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1447 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1451 tree xsizetype, xbitsizetype;
1452 tree xssizetype, xusizetype;
1453 tree xsbitsizetype, xubitsizetype;
1456 extern struct sizetype_tab sizetype_tab;
1458 #define sizetype sizetype_tab.xsizetype
1459 #define bitsizetype sizetype_tab.xbitsizetype
1460 #define ssizetype sizetype_tab.xssizetype
1461 #define usizetype sizetype_tab.xusizetype
1462 #define sbitsizetype sizetype_tab.xsbitsizetype
1463 #define ubitsizetype sizetype_tab.xubitsizetype
1465 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1466 extern int maximum_field_alignment;
1468 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1469 extern int set_alignment;
1471 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1472 by making the last node in X point to Y.
1473 Returns X, except if X is 0 returns Y. */
1475 extern tree chainon PROTO((tree, tree));
1477 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1479 extern tree tree_cons PROTO((tree, tree, tree));
1480 extern tree perm_tree_cons PROTO((tree, tree, tree));
1481 extern tree temp_tree_cons PROTO((tree, tree, tree));
1482 extern tree saveable_tree_cons PROTO((tree, tree, tree));
1483 extern tree decl_tree_cons PROTO((tree, tree, tree));
1484 extern tree expr_tree_cons PROTO((tree, tree, tree));
1486 /* Return the last tree node in a chain. */
1488 extern tree tree_last PROTO((tree));
1490 /* Reverse the order of elements in a chain, and return the new head. */
1492 extern tree nreverse PROTO((tree));
1494 /* Returns the length of a chain of nodes
1495 (number of chain pointers to follow before reaching a null pointer). */
1497 extern int list_length PROTO((tree));
1499 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1501 extern int integer_zerop PROTO((tree));
1503 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1505 extern int integer_onep PROTO((tree));
1507 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1508 all of whose significant bits are 1. */
1510 extern int integer_all_onesp PROTO((tree));
1512 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1513 exactly one bit 1. */
1515 extern int integer_pow2p PROTO((tree));
1517 /* staticp (tree x) is nonzero if X is a reference to data allocated
1518 at a fixed address in memory. */
1520 extern int staticp PROTO((tree));
1522 /* Gets an error if argument X is not an lvalue.
1523 Also returns 1 if X is an lvalue, 0 if not. */
1525 extern int lvalue_or_else PROTO((tree, char *));
1527 /* save_expr (EXP) returns an expression equivalent to EXP
1528 but it can be used multiple times within context CTX
1529 and only evaluate EXP once. */
1531 extern tree save_expr PROTO((tree));
1533 /* Returns the index of the first non-tree operand for CODE, or the number
1534 of operands if all are trees. */
1536 extern int first_rtl_op PROTO((enum tree_code));
1538 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1539 can be used multiple times and will evaluate EXP, in it's entirety
1542 extern tree unsave_expr PROTO((tree));
1544 /* unsave_expr_now (EXP) resets EXP in place, so that it can be
1547 extern tree unsave_expr_now PROTO((tree));
1549 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1550 or offset that depends on a field within a record.
1552 Note that we only allow such expressions within simple arithmetic
1555 extern int contains_placeholder_p PROTO((tree));
1557 /* Return 1 if EXP contains any expressions that produce cleanups for an
1558 outer scope to deal with. Used by fold. */
1560 extern int has_cleanups PROTO((tree));
1562 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1563 return a tree with all occurrences of references to F in a
1564 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1565 contains only arithmetic expressions. */
1567 extern tree substitute_in_expr PROTO((tree, tree, tree));
1569 /* variable_size (EXP) is like save_expr (EXP) except that it
1570 is for the special case of something that is part of a
1571 variable size for a data type. It makes special arrangements
1572 to compute the value at the right time when the data type
1573 belongs to a function parameter. */
1575 extern tree variable_size PROTO((tree));
1577 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1578 but it can be used multiple times
1579 and only evaluate the subexpressions once. */
1581 extern tree stabilize_reference PROTO((tree));
1583 /* Subroutine of stabilize_reference; this is called for subtrees of
1584 references. Any expression with side-effects must be put in a SAVE_EXPR
1585 to ensure that it is only evaluated once. */
1587 extern tree stabilize_reference_1 PROTO((tree));
1589 /* Return EXP, stripped of any conversions to wider types
1590 in such a way that the result of converting to type FOR_TYPE
1591 is the same as if EXP were converted to FOR_TYPE.
1592 If FOR_TYPE is 0, it signifies EXP's type. */
1594 extern tree get_unwidened PROTO((tree, tree));
1596 /* Return OP or a simpler expression for a narrower value
1597 which can be sign-extended or zero-extended to give back OP.
1598 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1599 or 0 if the value should be sign-extended. */
1601 extern tree get_narrower PROTO((tree, int *));
1603 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1605 The definition of this resides in language-specific code
1606 as the repertoire of available types may vary. */
1608 extern tree type_for_mode PROTO((enum machine_mode, int));
1610 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1611 for an integer type with at least that precision.
1612 The definition of this resides in language-specific code
1613 as the repertoire of available types may vary. */
1615 extern tree type_for_size PROTO((unsigned, int));
1617 /* Given an integer type T, return a type like T but unsigned.
1618 If T is unsigned, the value is T.
1619 The definition of this resides in language-specific code
1620 as the repertoire of available types may vary. */
1622 extern tree unsigned_type PROTO((tree));
1624 /* Given an integer type T, return a type like T but signed.
1625 If T is signed, the value is T.
1626 The definition of this resides in language-specific code
1627 as the repertoire of available types may vary. */
1629 extern tree signed_type PROTO((tree));
1631 /* This function must be defined in the language-specific files.
1632 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1633 This is defined in a language-specific file. */
1635 extern tree maybe_build_cleanup PROTO((tree));
1637 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1638 look for nested component-refs or array-refs at constant positions
1639 and find the ultimate containing object, which is returned. */
1641 extern tree get_inner_reference PROTO((tree, int *, int *, tree *,
1642 enum machine_mode *, int *,
1645 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1647 extern tree decl_function_context PROTO((tree));
1649 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1650 this _DECL with its context, or zero if none. */
1651 extern tree decl_type_context PROTO((tree));
1653 /* Given the FUNCTION_DECL for the current function,
1654 return zero if it is ok for this function to be inline.
1655 Otherwise return a warning message with a single %s
1656 for the function's name. */
1658 extern char *function_cannot_inline_p PROTO((tree));
1660 /* Return 1 if EXPR is the real constant zero. */
1661 extern int real_zerop PROTO((tree));
1663 /* Declare commonly used variables for tree structure. */
1665 /* An integer constant with value 0 */
1666 extern tree integer_zero_node;
1668 /* An integer constant with value 1 */
1669 extern tree integer_one_node;
1671 /* An integer constant with value 0 whose type is sizetype. */
1672 extern tree size_zero_node;
1674 /* An integer constant with value 1 whose type is sizetype. */
1675 extern tree size_one_node;
1677 /* A constant of type pointer-to-int and value 0 */
1678 extern tree null_pointer_node;
1680 /* A node of type ERROR_MARK. */
1681 extern tree error_mark_node;
1683 /* The type node for the void type. */
1684 extern tree void_type_node;
1686 /* The type node for the ordinary (signed) integer type. */
1687 extern tree integer_type_node;
1689 /* The type node for the unsigned integer type. */
1690 extern tree unsigned_type_node;
1692 /* The type node for the ordinary character type. */
1693 extern tree char_type_node;
1695 /* Points to the name of the input file from which the current input
1696 being parsed originally came (before it went into cpp). */
1697 extern char *input_filename;
1699 /* Current line number in input file. */
1702 /* Nonzero for -pedantic switch: warn about anything
1703 that standard C forbids. */
1704 extern int pedantic;
1706 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1707 Zero means allow extended lvalues. */
1709 extern int pedantic_lvalues;
1711 /* Nonzero means can safely call expand_expr now;
1712 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1714 extern int immediate_size_expand;
1716 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1718 extern tree current_function_decl;
1720 /* Nonzero if function being compiled can call setjmp. */
1722 extern int current_function_calls_setjmp;
1724 /* Nonzero if function being compiled can call longjmp. */
1726 extern int current_function_calls_longjmp;
1728 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1730 extern int all_types_permanent;
1732 /* Pointer to function to compute the name to use to print a declaration.
1733 DECL is the declaration in question.
1734 VERBOSITY determines what information will be printed:
1735 0: DECL_NAME, demangled as necessary.
1736 1: and scope information.
1737 2: and any other information that might be interesting, such as function
1738 parameter types in C++. */
1740 extern char *(*decl_printable_name) PROTO((tree, int));
1742 /* Pointer to function to finish handling an incomplete decl at the
1743 end of compilation. */
1745 extern void (*incomplete_decl_finalize_hook) PROTO((tree));
1748 extern char *perm_calloc PROTO((int, long));
1749 extern tree get_file_function_name PROTO((int));
1750 extern tree get_set_constructor_bits PROTO((tree, char *, int));
1751 extern tree get_set_constructor_bytes PROTO((tree,
1752 unsigned char *, int));
1756 extern void expand_fixups PROTO((struct rtx_def *));
1757 extern tree expand_start_stmt_expr PROTO((void));
1758 extern tree expand_end_stmt_expr PROTO((tree));
1759 extern void expand_expr_stmt PROTO((tree));
1760 extern int warn_if_unused_value PROTO((tree));
1761 extern void expand_decl_init PROTO((tree));
1762 extern void clear_last_expr PROTO((void));
1763 extern void expand_label PROTO((tree));
1764 extern void expand_goto PROTO((tree));
1765 extern void expand_asm PROTO((tree));
1766 extern void expand_start_cond PROTO((tree, int));
1767 extern void expand_end_cond PROTO((void));
1768 extern void expand_start_else PROTO((void));
1769 extern void expand_start_elseif PROTO((tree));
1770 extern struct nesting *expand_start_loop PROTO((int));
1771 extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
1772 extern void expand_loop_continue_here PROTO((void));
1773 extern void expand_end_loop PROTO((void));
1774 extern int expand_continue_loop PROTO((struct nesting *));
1775 extern int expand_exit_loop PROTO((struct nesting *));
1776 extern int expand_exit_loop_if_false PROTO((struct nesting *,
1778 extern int expand_exit_something PROTO((void));
1780 extern void expand_null_return PROTO((void));
1781 extern void expand_return PROTO((tree));
1782 extern void expand_start_bindings PROTO((int));
1783 extern void expand_end_bindings PROTO((tree, int, int));
1784 extern void start_cleanup_deferral PROTO((void));
1785 extern void end_cleanup_deferral PROTO((void));
1786 extern void mark_block_as_eh_region PROTO((void));
1787 extern void mark_block_as_not_eh_region PROTO((void));
1788 extern int is_eh_region PROTO((void));
1789 extern int conditional_context PROTO((void));
1790 extern tree last_cleanup_this_contour PROTO((void));
1791 extern int expand_dhc_cleanup PROTO((tree));
1792 extern int expand_dcc_cleanup PROTO((tree));
1793 extern void expand_start_case PROTO((int, tree, tree,
1795 extern void expand_end_case PROTO((tree));
1796 extern int pushcase PROTO((tree,
1797 tree (*) (tree, tree),
1799 extern int pushcase_range PROTO((tree, tree,
1800 tree (*) (tree, tree),
1803 /* In fold-const.c */
1805 /* Fold constants as much as possible in an expression.
1806 Returns the simplified expression.
1807 Acts only on the top level of the expression;
1808 if the argument itself cannot be simplified, its
1809 subexpressions are not changed. */
1811 extern tree fold PROTO((tree));
1813 extern int force_fit_type PROTO((tree, int));
1814 extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1815 HOST_WIDE_INT, HOST_WIDE_INT,
1816 HOST_WIDE_INT *, HOST_WIDE_INT *));
1817 extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1818 HOST_WIDE_INT *, HOST_WIDE_INT *));
1819 extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1820 HOST_WIDE_INT, HOST_WIDE_INT,
1821 HOST_WIDE_INT *, HOST_WIDE_INT *));
1822 extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1823 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1824 HOST_WIDE_INT *, int));
1825 extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1827 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
1828 extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1829 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1831 extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1832 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1834 extern int operand_equal_p PROTO((tree, tree, int));
1835 extern tree invert_truthvalue PROTO((tree));
1837 /* Interface of the DWARF2 unwind info support. */
1839 /* Decide whether we want to emit frame unwind information for the current
1840 translation unit. */
1842 extern int dwarf2out_do_frame PROTO((void));
1844 /* Generate a new label for the CFI info to refer to. */
1846 extern char *dwarf2out_cfi_label PROTO((void));
1848 /* Entry point to update the canonical frame address (CFA). */
1850 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
1852 /* Add the CFI for saving a register window. */
1854 extern void dwarf2out_window_save PROTO((char *));
1856 /* Add a CFI to update the running total of the size of arguments pushed
1859 extern void dwarf2out_args_size PROTO((char *, long));
1861 /* Entry point for saving a register to the stack. */
1863 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
1865 /* Entry point for saving the return address in the stack. */
1867 extern void dwarf2out_return_save PROTO((char *, long));
1869 /* Entry point for saving the return address in a register. */
1871 extern void dwarf2out_return_reg PROTO((char *, unsigned));
1873 /* Output a marker (i.e. a label) for the beginning of a function, before
1876 extern void dwarf2out_begin_prologue PROTO((void));
1878 /* Output a marker (i.e. a label) for the absolute end of the generated
1879 code for a function definition. */
1881 extern void dwarf2out_end_epilogue PROTO((void));
1883 /* The language front-end must define these functions. */
1885 /* Function of no arguments for initializing lexical scanning. */
1886 extern void init_lex PROTO((void));
1887 /* Function of no arguments for initializing the symbol table. */
1888 extern void init_decl_processing PROTO((void));
1890 /* Functions called with no arguments at the beginning and end or processing
1891 the input source file. */
1892 extern void lang_init PROTO((void));
1893 extern void lang_finish PROTO((void));
1895 /* Function to identify which front-end produced the output file. */
1896 extern char *lang_identify PROTO((void));
1898 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
1899 extern void copy_lang_decl PROTO((tree));
1901 /* Function called with no arguments to parse and compile the input. */
1902 extern int yyparse PROTO((void));
1903 /* Function called with option as argument
1904 to decode options starting with -f or -W or +.
1905 It should return nonzero if it handles the option. */
1906 extern int lang_decode_option PROTO((char *));
1908 /* Functions for processing symbol declarations. */
1909 /* Function to enter a new lexical scope.
1910 Takes one argument: always zero when called from outside the front end. */
1911 extern void pushlevel PROTO((int));
1912 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1913 Takes three arguments:
1914 KEEP -- nonzero if there were declarations in this scope.
1915 REVERSE -- reverse the order of decls before returning them.
1916 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1917 extern tree poplevel PROTO((int, int, int));
1918 /* Set the BLOCK node for the current scope level. */
1919 extern void set_block PROTO((tree));
1920 /* Function to add a decl to the current scope level.
1921 Takes one argument, a decl to add.
1922 Returns that decl, or, if the same symbol is already declared, may
1923 return a different decl for that name. */
1924 extern tree pushdecl PROTO((tree));
1925 /* Function to return the chain of decls so far in the current scope level. */
1926 extern tree getdecls PROTO((void));
1927 /* Function to return the chain of structure tags in the current scope level. */
1928 extern tree gettags PROTO((void));
1930 extern tree build_range_type PROTO((tree, tree, tree));
1932 /* Call when starting to parse a declaration:
1933 make expressions in the declaration last the length of the function.
1934 Returns an argument that should be passed to resume_momentary later. */
1935 extern int suspend_momentary PROTO((void));
1937 extern int allocation_temporary_p PROTO((void));
1939 /* Call when finished parsing a declaration:
1940 restore the treatment of node-allocation that was
1941 in effect before the suspension.
1942 YES should be the value previously returned by suspend_momentary. */
1943 extern void resume_momentary PROTO((int));
1945 /* Called after finishing a record, union or enumeral type. */
1946 extern void rest_of_type_compilation PROTO((tree, int));
1948 /* Save the current set of obstacks, but don't change them. */
1949 extern void push_obstacks_nochange PROTO((void));
1951 extern void permanent_allocation PROTO((int));
1953 extern void push_momentary PROTO((void));
1955 extern void clear_momentary PROTO((void));
1957 extern void pop_momentary PROTO((void));
1959 extern void end_temporary_allocation PROTO((void));
1961 /* Pop the obstack selection stack. */
1962 extern void pop_obstacks PROTO((void));
1965 extern int really_constant_p PROTO ((tree));
1966 extern void push_obstacks PROTO ((struct obstack *,
1968 extern void pop_momentary_nofree PROTO ((void));
1969 extern void preserve_momentary PROTO ((void));
1970 extern void saveable_allocation PROTO ((void));
1971 extern void temporary_allocation PROTO ((void));
1972 extern void resume_temporary_allocation PROTO ((void));
1973 extern tree get_file_function_name PROTO ((int));
1974 extern void set_identifier_size PROTO ((int));
1975 extern int int_fits_type_p PROTO ((tree, tree));
1976 extern int tree_log2 PROTO ((tree));
1977 extern void preserve_initializer PROTO ((void));
1978 extern void preserve_data PROTO ((void));
1979 extern int object_permanent_p PROTO ((tree));
1980 extern int type_precision PROTO ((tree));
1981 extern int simple_cst_equal PROTO ((tree, tree));
1982 extern int type_list_equal PROTO ((tree, tree));
1983 extern int chain_member PROTO ((tree, tree));
1984 extern int chain_member_purpose PROTO ((tree, tree));
1985 extern int chain_member_value PROTO ((tree, tree));
1986 extern tree listify PROTO ((tree));
1987 extern tree type_hash_lookup PROTO ((int, tree));
1988 extern void type_hash_add PROTO ((int, tree));
1989 extern int type_hash_list PROTO ((tree));
1990 extern int simple_cst_list_equal PROTO ((tree, tree));
1991 extern void debug_obstack PROTO ((char *));
1992 extern void rtl_in_current_obstack PROTO ((void));
1993 extern void rtl_in_saveable_obstack PROTO ((void));
1994 extern void init_tree_codes PROTO ((void));
1995 extern void dump_tree_statistics PROTO ((void));
1996 extern void print_obstack_statistics PROTO ((char *, struct obstack *));
1998 extern void print_obstack_name PROTO ((char *, FILE *, char *));
2000 extern void expand_function_end PROTO ((char *, int, int));
2001 extern void expand_function_start PROTO ((tree, int));
2002 extern int real_onep PROTO ((tree));
2003 extern int real_twop PROTO ((tree));
2004 extern void start_identifier_warnings PROTO ((void));
2005 extern void gcc_obstack_init PROTO ((struct obstack *));
2006 extern void init_obstacks PROTO ((void));
2007 extern void obfree PROTO ((char *));
2010 extern void setjmp_protect_args PROTO ((void));
2011 extern void setjmp_protect PROTO ((tree));
2012 extern void expand_main_function PROTO ((void));
2013 extern void mark_varargs PROTO ((void));
2014 extern void init_function_start PROTO ((tree, char *, int));
2015 extern void assign_parms PROTO ((tree, int));
2016 extern void put_var_into_stack PROTO ((tree));
2017 extern void uninitialized_vars_warning PROTO ((tree));
2018 extern void setjmp_args_warning PROTO ((void));
2019 extern void mark_all_temps_used PROTO ((void));
2020 extern void init_temp_slots PROTO ((void));
2021 extern void combine_temp_slots PROTO ((void));
2022 extern void free_temp_slots PROTO ((void));
2023 extern void pop_temp_slots PROTO ((void));
2024 extern void push_temp_slots PROTO ((void));
2025 extern void preserve_temp_slots PROTO ((struct rtx_def *));
2026 extern int aggregate_value_p PROTO ((tree));
2027 extern tree reorder_blocks PROTO ((tree *, tree,
2029 extern void free_temps_for_rtl_expr PROTO ((tree));
2030 extern void instantiate_virtual_regs PROTO ((tree, struct rtx_def *));
2031 extern int max_parm_reg_num PROTO ((void));
2032 extern void push_function_context PROTO ((void));
2033 extern void pop_function_context PROTO ((void));
2034 extern void push_function_context_to PROTO ((tree));
2035 extern void pop_function_context_from PROTO ((tree));
2037 /* In print-rtl.c */
2039 extern void print_rtl PROTO ((FILE *, struct rtx_def *));
2042 /* In print-tree.c */
2043 extern void debug_tree PROTO ((tree));
2045 extern void print_node PROTO ((FILE *, char *, tree, int));
2046 extern void print_node_brief PROTO ((FILE *, char *, tree, int));
2047 extern void indent_to PROTO ((FILE *, int));
2051 extern void emit_queue PROTO ((void));
2052 extern int apply_args_register_offset PROTO ((int));
2053 extern struct rtx_def *expand_builtin_return_addr
2054 PROTO ((enum built_in_function, int, struct rtx_def *));
2055 extern void do_pending_stack_adjust PROTO ((void));
2056 extern struct rtx_def *expand_assignment PROTO ((tree, tree, int, int));
2057 extern struct rtx_def *store_expr PROTO ((tree, struct rtx_def *,
2061 extern void start_sequence_for_rtl_expr PROTO ((tree));
2062 extern struct rtx_def *emit_line_note_after PROTO ((char *, int,
2064 extern struct rtx_def *emit_line_note PROTO ((char *, int));
2065 extern struct rtx_def *emit_line_note_force PROTO ((char *, int));
2068 extern int mark_addressable PROTO ((tree));
2069 extern void incomplete_type_error PROTO ((tree, tree));
2072 extern void print_lang_statistics PROTO ((void));
2075 extern tree truthvalue_conversion PROTO ((tree));
2076 extern int min_precision PROTO ((tree, int));
2077 extern void split_specs_attrs PROTO ((tree, tree *, tree *));
2081 extern void print_lang_decl PROTO ((FILE *, tree, int));
2082 extern void print_lang_type PROTO ((FILE *, tree, int));
2083 extern void print_lang_identifier PROTO ((FILE *, tree, int));
2085 extern int global_bindings_p PROTO ((void));
2086 extern void insert_block PROTO ((tree));
2088 /* In integrate.c */
2089 extern void save_for_inline_nocopy PROTO ((tree));
2090 extern void save_for_inline_copying PROTO ((tree));
2091 extern void set_decl_abstract_flags PROTO ((tree, int));
2092 extern void output_inline_function PROTO ((tree));
2095 extern void set_yydebug PROTO ((int));
2097 /* In stor-layout.c */
2098 extern void fixup_signed_type PROTO ((tree));
2101 extern void make_decl_rtl PROTO ((tree, char *, int));
2102 extern void make_decl_one_only PROTO ((tree));
2103 extern void variable_section PROTO ((tree, int));
2105 /* In fold-const.c */
2106 extern int div_and_round_double PROTO ((enum tree_code, int,
2107 HOST_WIDE_INT, HOST_WIDE_INT,
2108 HOST_WIDE_INT, HOST_WIDE_INT,
2115 extern void emit_nop PROTO ((void));
2116 extern void expand_computed_goto PROTO ((tree));
2117 extern struct rtx_def *label_rtx PROTO ((tree));
2118 extern void expand_asm_operands PROTO ((tree, tree, tree, tree, int,
2120 extern int any_pending_cleanups PROTO ((int));
2121 extern void init_stmt PROTO ((void));
2122 extern void init_stmt_for_function PROTO ((void));
2123 extern void remember_end_note PROTO ((tree));
2124 extern int drop_through_at_end_p PROTO ((void));
2125 extern void expand_start_target_temps PROTO ((void));
2126 extern void expand_end_target_temps PROTO ((void));
2127 extern void expand_elseif PROTO ((tree));
2128 extern void expand_decl PROTO ((tree));
2129 extern int expand_decl_cleanup PROTO ((tree, tree));
2130 extern void expand_anon_union_decl PROTO ((tree, tree, tree));
2131 extern void move_cleanups_up PROTO ((void));
2132 extern void expand_start_case_dummy PROTO ((void));
2133 extern void expand_end_case_dummy PROTO ((void));
2134 extern tree case_index_expr_type PROTO ((void));
2135 extern HOST_WIDE_INT all_cases_count PROTO ((tree, int *));
2136 extern void check_for_full_enumeration_handling PROTO ((tree));
2137 extern void declare_nonlocal_label PROTO ((tree));
2139 extern void lang_print_xnode PROTO ((FILE *, tree, int));
2143 /* If KIND=='I', return a suitable global initializer (constructor) name.
2144 If KIND=='D', return a suitable global clean-up (destructor) name. */
2145 extern tree get_file_function_name PROTO((int));
2147 /* Interface of the DWARF2 unwind info support. */
2149 /* Decide whether we want to emit frame unwind information for the current
2150 translation unit. */
2152 extern int dwarf2out_do_frame PROTO((void));
2154 /* Generate a new label for the CFI info to refer to. */
2156 extern char *dwarf2out_cfi_label PROTO((void));
2158 /* Entry point to update the canonical frame address (CFA). */
2160 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
2162 /* Add the CFI for saving a register window. */
2164 extern void dwarf2out_window_save PROTO((char *));
2166 /* Add a CFI to update the running total of the size of arguments pushed
2169 extern void dwarf2out_args_size PROTO((char *, long));
2171 /* Entry point for saving a register to the stack. */
2173 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
2175 /* Entry point for saving the return address in the stack. */
2177 extern void dwarf2out_return_save PROTO((char *, long));
2179 /* Entry point for saving the return address in a register. */
2181 extern void dwarf2out_return_reg PROTO((char *, unsigned));
2183 /* Output a marker (i.e. a label) for the beginning of a function, before
2186 extern void dwarf2out_begin_prologue PROTO((void));
2188 /* Output a marker (i.e. a label) for the absolute end of the generated
2189 code for a function definition. */
2191 extern void dwarf2out_end_epilogue PROTO((void));