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)
646 /* In expression with file location information. */
647 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
648 #define EXPR_WFL_FILENAME(NODE) (IDENTIFIER_POINTER ((NODE)->common.chain))
649 #define EXPR_WFL_FILENAME_NODE(NODE) ((NODE)->common.chain)
650 #define EXPR_WFL_LINENO(NODE) ((NODE)->exp.complexity >> 12)
651 #define EXPR_WFL_COLNO(NODE) ((NODE)->exp.complexity & 0xfff)
652 #define EXPR_WFL_LINECOL(NODE) ((NODE)->exp.complexity)
653 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
654 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
655 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.lang_flag_0)
659 char common[sizeof (struct tree_common)];
661 union tree_node *operands[1];
664 /* In a BLOCK node. */
665 #define BLOCK_VARS(NODE) ((NODE)->block.vars)
666 #define BLOCK_TYPE_TAGS(NODE) ((NODE)->block.type_tags)
667 #define BLOCK_SUBBLOCKS(NODE) ((NODE)->block.subblocks)
668 #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->block.supercontext)
669 /* Note: when changing this, make sure to find the places
670 that use chainon or nreverse. */
671 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
672 #define BLOCK_ABSTRACT_ORIGIN(NODE) ((NODE)->block.abstract_origin)
673 #define BLOCK_ABSTRACT(NODE) ((NODE)->block.abstract_flag)
674 #define BLOCK_END_NOTE(NODE) ((NODE)->block.end_note)
676 /* Nonzero means that this block is prepared to handle exceptions
677 listed in the BLOCK_VARS slot. */
678 #define BLOCK_HANDLER_BLOCK(NODE) ((NODE)->block.handler_block_flag)
682 char common[sizeof (struct tree_common)];
684 unsigned handler_block_flag : 1;
685 unsigned abstract_flag : 1;
687 union tree_node *vars;
688 union tree_node *type_tags;
689 union tree_node *subblocks;
690 union tree_node *supercontext;
691 union tree_node *abstract_origin;
692 struct rtx_def *end_note;
695 /* Define fields and accessors for nodes representing data types. */
697 /* See tree.def for documentation of the use of these fields.
698 Look at the documentation of the various ..._TYPE tree codes. */
700 #define TYPE_UID(NODE) ((NODE)->type.uid)
701 #define TYPE_SIZE(NODE) ((NODE)->type.size)
702 #define TYPE_MODE(NODE) ((NODE)->type.mode)
703 #define TYPE_VALUES(NODE) ((NODE)->type.values)
704 #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
705 #define TYPE_FIELDS(NODE) ((NODE)->type.values)
706 #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
707 #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
708 #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
709 #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
710 #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
711 #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
712 #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
713 #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
714 #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
715 #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
716 #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab.address)
717 #define TYPE_SYMTAB_POINTER(NODE) ((NODE)->type.symtab.pointer)
718 #define TYPE_NAME(NODE) ((NODE)->type.name)
719 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
720 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
721 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
722 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
723 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
724 #define TYPE_OBSTACK(NODE) ((NODE)->type.obstack)
725 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
727 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
729 #define TYPE_ATTRIBUTES(NODE) ((NODE)->type.attributes)
731 /* The alignment necessary for objects of this type.
732 The value is an int, measured in bits. */
733 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
735 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
737 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
738 has BLKmode only because it lacks the alignment requirement for
740 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
742 /* Nonzero in a type considered volatile as a whole. */
743 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
745 /* Means this type is const-qualified. */
746 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
748 /* These flags are available for each language front end to use internally. */
749 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
750 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
751 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
752 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
753 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
754 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
755 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
757 /* If set in an ARRAY_TYPE, indicates a string type (for languages
758 that distinguish string from array of char).
759 If set in a SET_TYPE, indicates a bitstring type. */
760 #define TYPE_STRING_FLAG(NODE) ((NODE)->type.string_flag)
762 /* If non-NULL, this is a upper bound of the size (in bytes) of an
763 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
764 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
766 /* Indicates that objects of this type must be initialized by calling a
767 function when they are created. */
768 #define TYPE_NEEDS_CONSTRUCTING(NODE) ((NODE)->type.needs_constructing_flag)
770 /* Indicates that objects of this type (a UNION_TYPE), should be passed
771 the same way that the first union alternative would be passed. */
772 #define TYPE_TRANSPARENT_UNION(NODE) ((NODE)->type.transparent_union_flag)
774 /* Indicated that objects of this type should be laid out in as
775 compact a way as possible. */
776 #define TYPE_PACKED(NODE) ((NODE)->type.packed_flag)
780 char common[sizeof (struct tree_common)];
781 union tree_node *values;
782 union tree_node *size;
783 union tree_node *attributes;
786 unsigned char precision;
787 #ifdef ONLY_INT_FIELDS
790 enum machine_mode mode : 8;
793 unsigned string_flag : 1;
794 unsigned no_force_blk_flag : 1;
795 unsigned needs_constructing_flag : 1;
796 unsigned transparent_union_flag : 1;
797 unsigned packed_flag : 1;
798 unsigned lang_flag_0 : 1;
799 unsigned lang_flag_1 : 1;
800 unsigned lang_flag_2 : 1;
801 unsigned lang_flag_3 : 1;
802 unsigned lang_flag_4 : 1;
803 unsigned lang_flag_5 : 1;
804 unsigned lang_flag_6 : 1;
805 /* room for 4 more bits */
808 union tree_node *pointer_to;
809 union tree_node *reference_to;
810 union {int address; char *pointer; } symtab;
811 union tree_node *name;
812 union tree_node *minval;
813 union tree_node *maxval;
814 union tree_node *next_variant;
815 union tree_node *main_variant;
816 union tree_node *binfo;
817 union tree_node *noncopied_parts;
818 union tree_node *context;
819 struct obstack *obstack;
820 /* Points to a structure whose details depend on the language in use. */
821 struct lang_type *lang_specific;
824 /* Define accessor macros for information about type inheritance
827 A "basetype" means a particular usage of a data type for inheritance
828 in another type. Each such basetype usage has its own "binfo"
829 object to describe it. The binfo object is a TREE_VEC node.
831 Inheritance is represented by the binfo nodes allocated for a
832 given type. For example, given types C and D, such that D is
833 inherited by C, 3 binfo nodes will be allocated: one for describing
834 the binfo properties of C, similarly one for D, and one for
835 describing the binfo properties of D as a base type for C.
836 Thus, given a pointer to class C, one can get a pointer to the binfo
837 of D acting as a basetype for C by looking at C's binfo's basetypes. */
839 /* The actual data type node being inherited in this basetype. */
840 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
842 /* The offset where this basetype appears in its containing type.
843 BINFO_OFFSET slot holds the offset (in bytes)
844 from the base of the complete object to the base of the part of the
845 object that is allocated on behalf of this `type'.
846 This is always 0 except when there is multiple inheritance. */
848 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
849 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
850 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
852 /* The virtual function table belonging to this basetype. Virtual
853 function tables provide a mechanism for run-time method dispatching.
854 The entries of a virtual function table are language-dependent. */
856 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
857 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
859 /* The virtual functions in the virtual function table. This is
860 a TREE_LIST that is used as an initial approximation for building
861 a virtual function table for this basetype. */
862 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
863 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
865 /* A vector of additional binfos for the types inherited by this basetype.
867 If this basetype describes type D as inherited in C,
868 and if the basetypes of D are E anf F,
869 then this vector contains binfos for inheritance of E and F by C.
871 ??? This could probably be done by just allocating the
872 base types at the end of this TREE_VEC (instead of using
873 another TREE_VEC). This would simplify the calculation
874 of how many basetypes a given type had. */
875 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
876 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
878 /* Accessor macro to get to the Nth basetype of this basetype. */
879 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
880 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
882 /* For a BINFO record describing an inheritance, this yields a pointer
883 to the artificial FIELD_DECL node which contains the "virtual base
884 class pointer" for the given inheritance. */
885 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
887 /* The size of a base class subobject of this type. */
888 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
889 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
891 /* Slot used to build a chain that represents a use of inheritance.
892 For example, if X is derived from Y, and Y is derived from Z,
893 then this field can be used to link the binfo node for X to
894 the binfo node for X's Y to represent the use of inheritance
895 from X to Y. Similarly, this slot of the binfo node for X's Y
896 can point to the Z from which Y is inherited (in X's inheritance
897 hierarchy). In this fashion, one can represent and traverse specific
898 uses of inheritance using the binfo nodes themselves (instead of
899 consing new space pointing to binfo nodes).
900 It is up to the language-dependent front-ends to maintain
901 this information as necessary. */
902 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
904 /* Define fields and accessors for nodes representing declared names. */
906 /* This is the name of the object as written by the user.
907 It is an IDENTIFIER_NODE. */
908 #define DECL_NAME(NODE) ((NODE)->decl.name)
909 /* This is the name of the object as the assembler will see it
910 (but before any translations made by ASM_OUTPUT_LABELREF).
911 Often this is the same as DECL_NAME.
912 It is an IDENTIFIER_NODE. */
913 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
914 /* Records the section name in a section attribute. Used to pass
915 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
916 #define DECL_SECTION_NAME(NODE) ((NODE)->decl.section_name)
917 /* For FIELD_DECLs, this is the
918 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
919 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
920 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
921 containing function, the RECORD_TYPE or UNION_TYPE for the containing
922 type, or NULL_TREE if the given decl has "file scope". */
923 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
924 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
925 /* In a DECL this is the field where configuration dependent machine
926 attributes are store */
927 #define DECL_MACHINE_ATTRIBUTES(NODE) ((NODE)->decl.machine_attributes)
928 /* In a FIELD_DECL, this is the field position, counting in bits,
929 of the bit closest to the beginning of the structure. */
930 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
931 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
932 if so, the type that was originally specified for it.
933 TREE_TYPE may have been modified (in finish_struct). */
934 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
935 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
936 /* VAR_DECL and PARM_DECL reserve the arguments slot
937 for language-specific uses. */
938 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
939 /* In FUNCTION_DECL, holds the decl for the return value. */
940 #define DECL_RESULT(NODE) ((NODE)->decl.result)
941 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
942 #define DECL_ORIGINAL_TYPE(NODE) ((NODE)->decl.result)
943 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
944 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
945 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
946 For a VAR_DECL, holds the initial value.
947 For a PARM_DECL, not used--default
948 values for parameters are encoded in the type of the function,
949 not in the PARM_DECL slot. */
950 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
951 /* For a PARM_DECL, records the data type used to pass the argument,
952 which may be different from the type seen in the program. */
953 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
954 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
955 if nonzero, indicates that the field occupies the type. */
956 #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial)
957 /* These two fields describe where in the source code the declaration was. */
958 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
959 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
960 /* Holds the size of the datum, as a tree expression.
961 Need not be constant. */
962 #define DECL_SIZE(NODE) ((NODE)->decl.size)
963 /* Holds the alignment required for the datum. */
964 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size.u)
965 /* Holds the machine mode corresponding to the declaration of a variable or
966 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
968 #define DECL_MODE(NODE) ((NODE)->decl.mode)
969 /* Holds the RTL expression for the value of a variable or function. If
970 PROMOTED_MODE is defined, the mode of this expression may not be same
971 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
972 to the variable's data type, while the mode
973 of DECL_RTL is the mode actually used to contain the data. */
974 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
975 /* For PARM_DECL, holds an RTL for the stack slot or register
976 where the data was actually passed. */
977 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
978 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
979 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
980 /* For FUNCTION_DECL, if it is inline,
981 holds the size of the stack frame, as an integer. */
982 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size.i)
983 /* For FUNCTION_DECL, if it is built-in,
984 this identifies which built-in operation it is. */
985 #define DECL_FUNCTION_CODE(NODE) ((NODE)->decl.frame_size.f)
986 #define DECL_SET_FUNCTION_CODE(NODE,VAL) ((NODE)->decl.frame_size.f = (VAL))
987 /* For a FIELD_DECL, holds the size of the member as an integer. */
988 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
990 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
991 Before the struct containing the FUNCTION_DECL is laid out,
992 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
993 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
994 function. When the class is laid out, this pointer is changed
995 to an INTEGER_CST node which is suitable for use as an index
996 into the virtual function table. */
997 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
998 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
999 which this FIELD_DECL is defined. This information is needed when
1000 writing debugging information about vfield and vbase decls for C++. */
1001 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
1003 /* Every ..._DECL node gets a unique number. */
1004 #define DECL_UID(NODE) ((NODE)->decl.uid)
1006 /* For any sort of a ..._DECL node, this points to the original (abstract)
1007 decl node which this decl is an instance of, or else it is NULL indicating
1008 that this decl is not an instance of some other decl. For example,
1009 in a nested declaration of an inline function, this points back to the
1011 #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin)
1013 /* Nonzero for any sort of ..._DECL node means this decl node represents
1014 an inline instance of some original (abstract) decl from an inline function;
1015 suppress any warnings about shadowing some other variable. */
1016 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
1018 /* Nonzero if a _DECL means that the name of this decl should be ignored
1019 for symbolic debug purposes. */
1020 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
1022 /* Nonzero for a given ..._DECL node means that this node represents an
1023 "abstract instance" of the given declaration (e.g. in the original
1024 declaration of an inline function). When generating symbolic debugging
1025 information, we mustn't try to generate any address information for nodes
1026 marked as "abstract instances" because we don't actually generate
1027 any code or allocate any data space for such instances. */
1028 #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag)
1030 /* Nonzero if a _DECL means that no warnings should be generated just
1031 because this decl is unused. */
1032 #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag)
1034 /* Nonzero for a given ..._DECL node means that this node should be
1035 put in .common, if possible. If a DECL_INITIAL is given, and it
1036 is not error_mark_node, then the decl cannot be put in .common. */
1037 #define DECL_COMMON(NODE) ((NODE)->decl.common_flag)
1039 /* Language-specific decl information. */
1040 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
1042 /* In a VAR_DECL or FUNCTION_DECL,
1043 nonzero means external reference:
1044 do not allocate storage, and refer to a definition elsewhere. */
1045 #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag)
1048 nonzero means the detail info about this type is not dumped into stabs.
1049 Instead it will generate cross reference ('x') of names.
1050 This uses the same flag as DECL_EXTERNAL. */
1051 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) ((NODE)->decl.external_flag)
1054 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1055 #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag)
1056 /* In LABEL_DECL nodes, nonzero means that an error message about
1057 jumping into such a binding contour has been printed for this label. */
1058 #define DECL_ERROR_ISSUED(NODE) ((NODE)->decl.regdecl_flag)
1059 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1060 #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag)
1061 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1062 static chain is not needed. */
1063 #define DECL_NO_STATIC_CHAIN(NODE) ((NODE)->decl.regdecl_flag)
1065 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1066 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1068 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1070 Also set in some languages for variables, etc., outside the normal
1071 lexical scope, such as class instance variables. */
1072 #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
1074 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1075 where it is called. */
1076 #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag)
1078 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1079 that is not specified by ansi C and that users are supposed to be allowed
1080 to redefine for any purpose whatever. */
1081 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1083 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1085 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
1086 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1087 contour that restored a stack level and which is now exited. */
1088 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
1089 /* In a FUNCTION_DECL, nonzero means a built in function. */
1090 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
1091 /* In a VAR_DECL that's static,
1092 nonzero if the space is in the text section. */
1093 #define DECL_IN_TEXT_SECTION(NODE) ((NODE)->decl.bit_field_flag)
1095 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1096 Used in FIELD_DECLs for vtable pointers.
1097 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1098 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
1100 /* Used to indicate that the linkage status of this DECL is not yet known,
1101 so it should not be output now. */
1102 #define DECL_DEFER_OUTPUT(NODE) ((NODE)->decl.defer_output)
1104 /* Used in PARM_DECLs whose type are unions to indicate that the
1105 argument should be passed in the same way that the first union
1106 alternative would be passed. */
1107 #define DECL_TRANSPARENT_UNION(NODE) ((NODE)->decl.transparent_union)
1109 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1110 at the beginning or end of execution. */
1111 #define DECL_STATIC_CONSTRUCTOR(NODE) ((NODE)->decl.static_ctor_flag)
1112 #define DECL_STATIC_DESTRUCTOR(NODE) ((NODE)->decl.static_dtor_flag)
1114 /* Used to indicate that this DECL represents a compiler-generated entity. */
1115 #define DECL_ARTIFICIAL(NODE) ((NODE)->decl.artificial_flag)
1117 /* Used to indicate that this DECL has weak linkage. */
1118 #define DECL_WEAK(NODE) ((NODE)->decl.weak_flag)
1120 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1121 multiple translation units should be merged. */
1122 #define DECL_ONE_ONLY(NODE) ((NODE)->decl.transparent_union)
1124 /* Additional flags for language-specific uses. */
1125 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
1126 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
1127 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
1128 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
1129 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
1130 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
1131 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
1132 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
1136 char common[sizeof (struct tree_common)];
1140 union tree_node *size;
1141 #ifdef ONLY_INT_FIELDS
1144 enum machine_mode mode : 8;
1147 unsigned external_flag : 1;
1148 unsigned nonlocal_flag : 1;
1149 unsigned regdecl_flag : 1;
1150 unsigned inline_flag : 1;
1151 unsigned bit_field_flag : 1;
1152 unsigned virtual_flag : 1;
1153 unsigned ignored_flag : 1;
1154 unsigned abstract_flag : 1;
1156 unsigned in_system_header_flag : 1;
1157 unsigned common_flag : 1;
1158 unsigned defer_output : 1;
1159 unsigned transparent_union : 1;
1160 unsigned static_ctor_flag : 1;
1161 unsigned static_dtor_flag : 1;
1162 unsigned artificial_flag : 1;
1163 unsigned weak_flag : 1;
1164 /* room for no more */
1166 unsigned lang_flag_0 : 1;
1167 unsigned lang_flag_1 : 1;
1168 unsigned lang_flag_2 : 1;
1169 unsigned lang_flag_3 : 1;
1170 unsigned lang_flag_4 : 1;
1171 unsigned lang_flag_5 : 1;
1172 unsigned lang_flag_6 : 1;
1173 unsigned lang_flag_7 : 1;
1175 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1176 If built-in, this is the code for which built-in function.
1177 For other kinds of decls, this is DECL_ALIGN. */
1181 enum built_in_function f;
1184 union tree_node *name;
1185 union tree_node *context;
1186 union tree_node *arguments;
1187 union tree_node *result;
1188 union tree_node *initial;
1189 union tree_node *abstract_origin;
1190 union tree_node *assembler_name;
1191 union tree_node *section_name;
1192 union tree_node *machine_attributes;
1193 struct rtx_def *rtl; /* acts as link to register transfer language
1195 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1196 on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */
1201 union tree_node *vindex;
1202 /* Points to a structure whose details depend on the language in use. */
1203 struct lang_decl *lang_specific;
1206 /* Define the overall contents of a tree node.
1207 It may be any of the structures declared above
1208 for various types of node. */
1212 struct tree_common common;
1213 struct tree_int_cst int_cst;
1214 struct tree_real_cst real_cst;
1215 struct tree_string string;
1216 struct tree_complex complex;
1217 struct tree_identifier identifier;
1218 struct tree_decl decl;
1219 struct tree_type type;
1220 struct tree_list list;
1221 struct tree_vec vec;
1222 struct tree_exp exp;
1223 struct tree_block block;
1226 #include "gansidecl.h"
1228 #define NULL_TREE (tree) NULL
1230 /* The following functions accept a wide integer argument. Rather than
1231 having to cast on every function call, we use a macro instead, that is
1232 defined here and in rtl.h. */
1235 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1236 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1238 extern int exact_log2_wide PROTO((unsigned HOST_WIDE_INT));
1239 extern int floor_log2_wide PROTO((unsigned HOST_WIDE_INT));
1242 /* At present, don't prototype xrealloc, since all of the callers don't
1243 cast their pointers to char *, and all of the xrealloc's don't use
1245 extern char *xmalloc PROTO((size_t));
1246 extern char *xrealloc PROTO((void *, size_t));
1248 extern char *xmalloc ();
1249 extern char *xrealloc ();
1252 extern char *xstrdup PROTO((char *));
1254 extern char *oballoc PROTO((int));
1255 extern char *permalloc PROTO((int));
1256 extern char *savealloc PROTO((int));
1257 extern char *expralloc PROTO((int));
1258 #ifdef NEED_DECLARATION_FREE
1259 extern void free PROTO((void *));
1262 /* Lowest level primitive for allocating a node.
1263 The TREE_CODE is the only argument. Contents are initialized
1264 to zero except for a few of the common fields. */
1266 extern tree make_node PROTO((enum tree_code));
1268 /* Make a copy of a node, with all the same contents except
1269 for TREE_PERMANENT. (The copy is permanent
1270 iff nodes being made now are permanent.) */
1272 extern tree copy_node PROTO((tree));
1274 /* Make a copy of a chain of TREE_LIST nodes. */
1276 extern tree copy_list PROTO((tree));
1278 /* Make a TREE_VEC. */
1280 extern tree make_tree_vec PROTO((int));
1282 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1283 The name is supplied as a char *. */
1285 extern tree get_identifier PROTO((char *));
1287 /* If an identifier with the name TEXT (a null-terminated string) has
1288 previously been referred to, return that node; otherwise return
1291 extern tree maybe_get_identifier PROTO((char *));
1293 /* Construct various types of nodes. */
1295 #define build_int_2(LO,HI) \
1296 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1298 extern tree build PVPROTO((enum tree_code, tree, ...));
1299 extern tree build_nt PVPROTO((enum tree_code, ...));
1300 extern tree build_parse_node PVPROTO((enum tree_code, ...));
1302 extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1303 extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1304 extern tree build_real_from_int_cst PROTO((tree, tree));
1305 extern tree build_complex PROTO((tree, tree, tree));
1306 extern tree build_string PROTO((int, char *));
1307 extern tree build1 PROTO((enum tree_code, tree, tree));
1308 extern tree build_tree_list PROTO((tree, tree));
1309 extern tree build_decl_list PROTO((tree, tree));
1310 extern tree build_expr_list PROTO((tree, tree));
1311 extern tree build_decl PROTO((enum tree_code, tree, tree));
1312 extern tree build_block PROTO((tree, tree, tree, tree, tree));
1313 extern tree build_expr_wfl PROTO((tree, char *, int, int));
1315 /* Construct various nodes representing data types. */
1317 extern tree make_signed_type PROTO((int));
1318 extern tree make_unsigned_type PROTO((int));
1319 extern void set_sizetype PROTO((tree));
1320 extern tree signed_or_unsigned_type PROTO((int, tree));
1321 extern void fixup_unsigned_type PROTO((tree));
1322 extern tree build_pointer_type PROTO((tree));
1323 extern tree build_reference_type PROTO((tree));
1324 extern tree build_index_type PROTO((tree));
1325 extern tree build_index_2_type PROTO((tree, tree));
1326 extern tree build_array_type PROTO((tree, tree));
1327 extern tree build_function_type PROTO((tree, tree));
1328 extern tree build_method_type PROTO((tree, tree));
1329 extern tree build_offset_type PROTO((tree, tree));
1330 extern tree build_complex_type PROTO((tree));
1331 extern tree array_type_nelts PROTO((tree));
1333 extern tree value_member PROTO((tree, tree));
1334 extern tree purpose_member PROTO((tree, tree));
1335 extern tree binfo_member PROTO((tree, tree));
1336 extern int attribute_hash_list PROTO((tree));
1337 extern int attribute_list_equal PROTO((tree, tree));
1338 extern int attribute_list_contained PROTO((tree, tree));
1339 extern int tree_int_cst_equal PROTO((tree, tree));
1340 extern int tree_int_cst_lt PROTO((tree, tree));
1341 extern int tree_int_cst_sgn PROTO((tree));
1342 extern int index_type_equal PROTO((tree, tree));
1344 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1345 put the prototype here. Rtl.h does declare the prototype if
1346 tree.h had been included. */
1348 extern tree make_tree PROTO((tree, struct rtx_def *));
1350 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1353 Such modified types already made are recorded so that duplicates
1356 extern tree build_type_attribute_variant PROTO((tree, tree));
1357 extern tree build_decl_attribute_variant PROTO((tree, tree));
1359 extern tree merge_machine_decl_attributes PROTO((tree, tree));
1360 extern tree merge_machine_type_attributes PROTO((tree, tree));
1362 /* Split a list of declspecs and attributes into two. */
1364 extern void split_specs_attrs PROTO((tree, tree *, tree *));
1366 /* Strip attributes from a list of combined specs and attrs. */
1368 extern tree strip_attrs PROTO((tree));
1370 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1372 extern int valid_machine_attribute PROTO((tree, tree, tree, tree));
1374 /* Given a tree node and a string, return non-zero if the tree node is
1375 a valid attribute name for the string. */
1377 extern int is_attribute_p PROTO((char *, tree));
1379 /* Given an attribute name and a list of attributes, return the list element
1380 of the attribute or NULL_TREE if not found. */
1382 extern tree lookup_attribute PROTO((char *, tree));
1384 /* Given two attributes lists, return a list of their union. */
1386 extern tree merge_attributes PROTO((tree, tree));
1388 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1389 for the same kind of data as TYPE describes.
1390 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1391 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1392 so that duplicate variants are never made.
1393 Only main variants should ever appear as types of expressions. */
1395 extern tree build_type_variant PROTO((tree, int, int));
1397 /* Make a copy of a type node. */
1399 extern tree build_type_copy PROTO((tree));
1401 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1402 TYPE_ALIGN and TYPE_MODE fields.
1403 If called more than once on one node, does nothing except
1404 for the first time. */
1406 extern void layout_type PROTO((tree));
1408 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1409 return a canonicalized ..._TYPE node, so that duplicates are not made.
1410 How the hash code is computed is up to the caller, as long as any two
1411 callers that could hash identical-looking type nodes agree. */
1413 extern tree type_hash_canon PROTO((int, tree));
1415 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1416 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1417 fields. Call this only once for any given decl node.
1419 Second argument is the boundary that this field can be assumed to
1420 be starting at (in bits). Zero means it can be assumed aligned
1421 on any boundary that may be needed. */
1423 extern void layout_decl PROTO((tree, unsigned));
1425 /* Return an expr equal to X but certainly not valid as an lvalue. */
1427 extern tree non_lvalue PROTO((tree));
1428 extern tree pedantic_non_lvalue PROTO((tree));
1430 extern tree convert PROTO((tree, tree));
1431 extern tree size_in_bytes PROTO((tree));
1432 extern HOST_WIDE_INT int_size_in_bytes PROTO((tree));
1433 extern tree size_binop PROTO((enum tree_code, tree, tree));
1434 extern tree size_int_wide PROTO((unsigned HOST_WIDE_INT,
1435 unsigned HOST_WIDE_INT, int));
1436 #define size_int(L) size_int_2 ((L), 0, 0)
1437 #define bitsize_int(L, H) size_int_2 ((L), (H), 1)
1438 #define size_int_2(L, H, T) \
1439 size_int_wide ((unsigned HOST_WIDE_INT) (L), \
1440 (unsigned HOST_WIDE_INT) (H), (T))
1442 extern tree round_up PROTO((tree, int));
1443 extern tree get_pending_sizes PROTO((void));
1444 extern void put_pending_sizes PROTO((tree));
1446 /* Type for sizes of data-type. */
1448 #define BITS_PER_UNIT_LOG \
1449 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1450 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1451 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1455 tree xsizetype, xbitsizetype;
1456 tree xssizetype, xusizetype;
1457 tree xsbitsizetype, xubitsizetype;
1460 extern struct sizetype_tab sizetype_tab;
1462 #define sizetype sizetype_tab.xsizetype
1463 #define bitsizetype sizetype_tab.xbitsizetype
1464 #define ssizetype sizetype_tab.xssizetype
1465 #define usizetype sizetype_tab.xusizetype
1466 #define sbitsizetype sizetype_tab.xsbitsizetype
1467 #define ubitsizetype sizetype_tab.xubitsizetype
1469 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1470 extern int maximum_field_alignment;
1472 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1473 extern int set_alignment;
1475 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1476 by making the last node in X point to Y.
1477 Returns X, except if X is 0 returns Y. */
1479 extern tree chainon PROTO((tree, tree));
1481 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1483 extern tree tree_cons PROTO((tree, tree, tree));
1484 extern tree perm_tree_cons PROTO((tree, tree, tree));
1485 extern tree temp_tree_cons PROTO((tree, tree, tree));
1486 extern tree saveable_tree_cons PROTO((tree, tree, tree));
1487 extern tree decl_tree_cons PROTO((tree, tree, tree));
1488 extern tree expr_tree_cons PROTO((tree, tree, tree));
1490 /* Return the last tree node in a chain. */
1492 extern tree tree_last PROTO((tree));
1494 /* Reverse the order of elements in a chain, and return the new head. */
1496 extern tree nreverse PROTO((tree));
1498 /* Returns the length of a chain of nodes
1499 (number of chain pointers to follow before reaching a null pointer). */
1501 extern int list_length PROTO((tree));
1503 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1505 extern int integer_zerop PROTO((tree));
1507 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1509 extern int integer_onep PROTO((tree));
1511 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1512 all of whose significant bits are 1. */
1514 extern int integer_all_onesp PROTO((tree));
1516 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1517 exactly one bit 1. */
1519 extern int integer_pow2p PROTO((tree));
1521 /* staticp (tree x) is nonzero if X is a reference to data allocated
1522 at a fixed address in memory. */
1524 extern int staticp PROTO((tree));
1526 /* Gets an error if argument X is not an lvalue.
1527 Also returns 1 if X is an lvalue, 0 if not. */
1529 extern int lvalue_or_else PROTO((tree, char *));
1531 /* save_expr (EXP) returns an expression equivalent to EXP
1532 but it can be used multiple times within context CTX
1533 and only evaluate EXP once. */
1535 extern tree save_expr PROTO((tree));
1537 /* Returns the index of the first non-tree operand for CODE, or the number
1538 of operands if all are trees. */
1540 extern int first_rtl_op PROTO((enum tree_code));
1542 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1543 can be used multiple times and will evaluate EXP, in it's entirety
1546 extern tree unsave_expr PROTO((tree));
1548 /* unsave_expr_now (EXP) resets EXP in place, so that it can be
1551 extern tree unsave_expr_now PROTO((tree));
1553 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1554 or offset that depends on a field within a record.
1556 Note that we only allow such expressions within simple arithmetic
1559 extern int contains_placeholder_p PROTO((tree));
1561 /* Return 1 if EXP contains any expressions that produce cleanups for an
1562 outer scope to deal with. Used by fold. */
1564 extern int has_cleanups PROTO((tree));
1566 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1567 return a tree with all occurrences of references to F in a
1568 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1569 contains only arithmetic expressions. */
1571 extern tree substitute_in_expr PROTO((tree, tree, tree));
1573 /* variable_size (EXP) is like save_expr (EXP) except that it
1574 is for the special case of something that is part of a
1575 variable size for a data type. It makes special arrangements
1576 to compute the value at the right time when the data type
1577 belongs to a function parameter. */
1579 extern tree variable_size PROTO((tree));
1581 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1582 but it can be used multiple times
1583 and only evaluate the subexpressions once. */
1585 extern tree stabilize_reference PROTO((tree));
1587 /* Subroutine of stabilize_reference; this is called for subtrees of
1588 references. Any expression with side-effects must be put in a SAVE_EXPR
1589 to ensure that it is only evaluated once. */
1591 extern tree stabilize_reference_1 PROTO((tree));
1593 /* Return EXP, stripped of any conversions to wider types
1594 in such a way that the result of converting to type FOR_TYPE
1595 is the same as if EXP were converted to FOR_TYPE.
1596 If FOR_TYPE is 0, it signifies EXP's type. */
1598 extern tree get_unwidened PROTO((tree, tree));
1600 /* Return OP or a simpler expression for a narrower value
1601 which can be sign-extended or zero-extended to give back OP.
1602 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1603 or 0 if the value should be sign-extended. */
1605 extern tree get_narrower PROTO((tree, int *));
1607 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1609 The definition of this resides in language-specific code
1610 as the repertoire of available types may vary. */
1612 extern tree type_for_mode PROTO((enum machine_mode, int));
1614 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1615 for an integer type with at least that precision.
1616 The definition of this resides in language-specific code
1617 as the repertoire of available types may vary. */
1619 extern tree type_for_size PROTO((unsigned, int));
1621 /* Given an integer type T, return a type like T but unsigned.
1622 If T is unsigned, the value is T.
1623 The definition of this resides in language-specific code
1624 as the repertoire of available types may vary. */
1626 extern tree unsigned_type PROTO((tree));
1628 /* Given an integer type T, return a type like T but signed.
1629 If T is signed, the value is T.
1630 The definition of this resides in language-specific code
1631 as the repertoire of available types may vary. */
1633 extern tree signed_type PROTO((tree));
1635 /* This function must be defined in the language-specific files.
1636 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1637 This is defined in a language-specific file. */
1639 extern tree maybe_build_cleanup PROTO((tree));
1641 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1642 look for nested component-refs or array-refs at constant positions
1643 and find the ultimate containing object, which is returned. */
1645 extern tree get_inner_reference PROTO((tree, int *, int *, tree *,
1646 enum machine_mode *, int *,
1649 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1651 extern tree decl_function_context PROTO((tree));
1653 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1654 this _DECL with its context, or zero if none. */
1655 extern tree decl_type_context PROTO((tree));
1657 /* Given the FUNCTION_DECL for the current function,
1658 return zero if it is ok for this function to be inline.
1659 Otherwise return a warning message with a single %s
1660 for the function's name. */
1662 extern char *function_cannot_inline_p PROTO((tree));
1664 /* Return 1 if EXPR is the real constant zero. */
1665 extern int real_zerop PROTO((tree));
1667 /* Declare commonly used variables for tree structure. */
1669 /* An integer constant with value 0 */
1670 extern tree integer_zero_node;
1672 /* An integer constant with value 1 */
1673 extern tree integer_one_node;
1675 /* An integer constant with value 0 whose type is sizetype. */
1676 extern tree size_zero_node;
1678 /* An integer constant with value 1 whose type is sizetype. */
1679 extern tree size_one_node;
1681 /* A constant of type pointer-to-int and value 0 */
1682 extern tree null_pointer_node;
1684 /* A node of type ERROR_MARK. */
1685 extern tree error_mark_node;
1687 /* The type node for the void type. */
1688 extern tree void_type_node;
1690 /* The type node for the ordinary (signed) integer type. */
1691 extern tree integer_type_node;
1693 /* The type node for the unsigned integer type. */
1694 extern tree unsigned_type_node;
1696 /* The type node for the ordinary character type. */
1697 extern tree char_type_node;
1699 /* Points to the name of the input file from which the current input
1700 being parsed originally came (before it went into cpp). */
1701 extern char *input_filename;
1703 /* Current line number in input file. */
1706 /* Nonzero for -pedantic switch: warn about anything
1707 that standard C forbids. */
1708 extern int pedantic;
1710 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1711 Zero means allow extended lvalues. */
1713 extern int pedantic_lvalues;
1715 /* Nonzero means can safely call expand_expr now;
1716 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1718 extern int immediate_size_expand;
1720 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1722 extern tree current_function_decl;
1724 /* Nonzero if function being compiled can call setjmp. */
1726 extern int current_function_calls_setjmp;
1728 /* Nonzero if function being compiled can call longjmp. */
1730 extern int current_function_calls_longjmp;
1732 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1734 extern int all_types_permanent;
1736 /* Pointer to function to compute the name to use to print a declaration.
1737 DECL is the declaration in question.
1738 VERBOSITY determines what information will be printed:
1739 0: DECL_NAME, demangled as necessary.
1740 1: and scope information.
1741 2: and any other information that might be interesting, such as function
1742 parameter types in C++. */
1744 extern char *(*decl_printable_name) PROTO((tree, int));
1746 /* Pointer to function to finish handling an incomplete decl at the
1747 end of compilation. */
1749 extern void (*incomplete_decl_finalize_hook) PROTO((tree));
1752 extern char *perm_calloc PROTO((int, long));
1753 extern tree get_file_function_name PROTO((int));
1754 extern tree get_set_constructor_bits PROTO((tree, char *, int));
1755 extern tree get_set_constructor_bytes PROTO((tree,
1756 unsigned char *, int));
1760 extern void expand_fixups PROTO((struct rtx_def *));
1761 extern tree expand_start_stmt_expr PROTO((void));
1762 extern tree expand_end_stmt_expr PROTO((tree));
1763 extern void expand_expr_stmt PROTO((tree));
1764 extern int warn_if_unused_value PROTO((tree));
1765 extern void expand_decl_init PROTO((tree));
1766 extern void clear_last_expr PROTO((void));
1767 extern void expand_label PROTO((tree));
1768 extern void expand_goto PROTO((tree));
1769 extern void expand_asm PROTO((tree));
1770 extern void expand_start_cond PROTO((tree, int));
1771 extern void expand_end_cond PROTO((void));
1772 extern void expand_start_else PROTO((void));
1773 extern void expand_start_elseif PROTO((tree));
1774 extern struct nesting *expand_start_loop PROTO((int));
1775 extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
1776 extern void expand_loop_continue_here PROTO((void));
1777 extern void expand_end_loop PROTO((void));
1778 extern int expand_continue_loop PROTO((struct nesting *));
1779 extern int expand_exit_loop PROTO((struct nesting *));
1780 extern int expand_exit_loop_if_false PROTO((struct nesting *,
1782 extern int expand_exit_something PROTO((void));
1784 extern void expand_null_return PROTO((void));
1785 extern void expand_return PROTO((tree));
1786 extern void expand_start_bindings PROTO((int));
1787 extern void expand_end_bindings PROTO((tree, int, int));
1788 extern void start_cleanup_deferral PROTO((void));
1789 extern void end_cleanup_deferral PROTO((void));
1790 extern void mark_block_as_eh_region PROTO((void));
1791 extern void mark_block_as_not_eh_region PROTO((void));
1792 extern int is_eh_region PROTO((void));
1793 extern int conditional_context PROTO((void));
1794 extern tree last_cleanup_this_contour PROTO((void));
1795 extern int expand_dhc_cleanup PROTO((tree));
1796 extern int expand_dcc_cleanup PROTO((tree));
1797 extern void expand_start_case PROTO((int, tree, tree,
1799 extern void expand_end_case PROTO((tree));
1800 extern int pushcase PROTO((tree,
1801 tree (*) (tree, tree),
1803 extern int pushcase_range PROTO((tree, tree,
1804 tree (*) (tree, tree),
1807 /* In fold-const.c */
1809 /* Fold constants as much as possible in an expression.
1810 Returns the simplified expression.
1811 Acts only on the top level of the expression;
1812 if the argument itself cannot be simplified, its
1813 subexpressions are not changed. */
1815 extern tree fold PROTO((tree));
1817 extern int force_fit_type PROTO((tree, int));
1818 extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1819 HOST_WIDE_INT, HOST_WIDE_INT,
1820 HOST_WIDE_INT *, HOST_WIDE_INT *));
1821 extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1822 HOST_WIDE_INT *, HOST_WIDE_INT *));
1823 extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1824 HOST_WIDE_INT, HOST_WIDE_INT,
1825 HOST_WIDE_INT *, HOST_WIDE_INT *));
1826 extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1827 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1828 HOST_WIDE_INT *, int));
1829 extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1831 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
1832 extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1833 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1835 extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1836 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1838 extern int operand_equal_p PROTO((tree, tree, int));
1839 extern tree invert_truthvalue PROTO((tree));
1841 /* Interface of the DWARF2 unwind info support. */
1843 /* Decide whether we want to emit frame unwind information for the current
1844 translation unit. */
1846 extern int dwarf2out_do_frame PROTO((void));
1848 /* Generate a new label for the CFI info to refer to. */
1850 extern char *dwarf2out_cfi_label PROTO((void));
1852 /* Entry point to update the canonical frame address (CFA). */
1854 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
1856 /* Add the CFI for saving a register window. */
1858 extern void dwarf2out_window_save PROTO((char *));
1860 /* Add a CFI to update the running total of the size of arguments pushed
1863 extern void dwarf2out_args_size PROTO((char *, long));
1865 /* Entry point for saving a register to the stack. */
1867 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
1869 /* Entry point for saving the return address in the stack. */
1871 extern void dwarf2out_return_save PROTO((char *, long));
1873 /* Entry point for saving the return address in a register. */
1875 extern void dwarf2out_return_reg PROTO((char *, unsigned));
1877 /* Output a marker (i.e. a label) for the beginning of a function, before
1880 extern void dwarf2out_begin_prologue PROTO((void));
1882 /* Output a marker (i.e. a label) for the absolute end of the generated
1883 code for a function definition. */
1885 extern void dwarf2out_end_epilogue PROTO((void));
1887 /* The language front-end must define these functions. */
1889 /* Function of no arguments for initializing lexical scanning. */
1890 extern void init_lex PROTO((void));
1891 /* Function of no arguments for initializing the symbol table. */
1892 extern void init_decl_processing PROTO((void));
1894 /* Functions called with no arguments at the beginning and end or processing
1895 the input source file. */
1896 extern void lang_init PROTO((void));
1897 extern void lang_finish PROTO((void));
1899 /* Function to identify which front-end produced the output file. */
1900 extern char *lang_identify PROTO((void));
1902 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
1903 extern void copy_lang_decl PROTO((tree));
1905 /* Function called with no arguments to parse and compile the input. */
1906 extern int yyparse PROTO((void));
1907 /* Function called with option as argument
1908 to decode options starting with -f or -W or +.
1909 It should return nonzero if it handles the option. */
1910 extern int lang_decode_option PROTO((char *));
1912 /* Functions for processing symbol declarations. */
1913 /* Function to enter a new lexical scope.
1914 Takes one argument: always zero when called from outside the front end. */
1915 extern void pushlevel PROTO((int));
1916 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1917 Takes three arguments:
1918 KEEP -- nonzero if there were declarations in this scope.
1919 REVERSE -- reverse the order of decls before returning them.
1920 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1921 extern tree poplevel PROTO((int, int, int));
1922 /* Set the BLOCK node for the current scope level. */
1923 extern void set_block PROTO((tree));
1924 /* Function to add a decl to the current scope level.
1925 Takes one argument, a decl to add.
1926 Returns that decl, or, if the same symbol is already declared, may
1927 return a different decl for that name. */
1928 extern tree pushdecl PROTO((tree));
1929 /* Function to return the chain of decls so far in the current scope level. */
1930 extern tree getdecls PROTO((void));
1931 /* Function to return the chain of structure tags in the current scope level. */
1932 extern tree gettags PROTO((void));
1934 extern tree build_range_type PROTO((tree, tree, tree));
1936 /* Call when starting to parse a declaration:
1937 make expressions in the declaration last the length of the function.
1938 Returns an argument that should be passed to resume_momentary later. */
1939 extern int suspend_momentary PROTO((void));
1941 extern int allocation_temporary_p PROTO((void));
1943 /* Call when finished parsing a declaration:
1944 restore the treatment of node-allocation that was
1945 in effect before the suspension.
1946 YES should be the value previously returned by suspend_momentary. */
1947 extern void resume_momentary PROTO((int));
1949 /* Called after finishing a record, union or enumeral type. */
1950 extern void rest_of_type_compilation PROTO((tree, int));
1952 /* Save the current set of obstacks, but don't change them. */
1953 extern void push_obstacks_nochange PROTO((void));
1955 extern void permanent_allocation PROTO((int));
1957 extern void push_momentary PROTO((void));
1959 extern void clear_momentary PROTO((void));
1961 extern void pop_momentary PROTO((void));
1963 extern void end_temporary_allocation PROTO((void));
1965 /* Pop the obstack selection stack. */
1966 extern void pop_obstacks PROTO((void));
1969 extern int really_constant_p PROTO ((tree));
1970 extern void push_obstacks PROTO ((struct obstack *,
1972 extern void pop_momentary_nofree PROTO ((void));
1973 extern void preserve_momentary PROTO ((void));
1974 extern void saveable_allocation PROTO ((void));
1975 extern void temporary_allocation PROTO ((void));
1976 extern void resume_temporary_allocation PROTO ((void));
1977 extern tree get_file_function_name PROTO ((int));
1978 extern void set_identifier_size PROTO ((int));
1979 extern int int_fits_type_p PROTO ((tree, tree));
1980 extern int tree_log2 PROTO ((tree));
1981 extern void preserve_initializer PROTO ((void));
1982 extern void preserve_data PROTO ((void));
1983 extern int object_permanent_p PROTO ((tree));
1984 extern int type_precision PROTO ((tree));
1985 extern int simple_cst_equal PROTO ((tree, tree));
1986 extern int type_list_equal PROTO ((tree, tree));
1987 extern int chain_member PROTO ((tree, tree));
1988 extern int chain_member_purpose PROTO ((tree, tree));
1989 extern int chain_member_value PROTO ((tree, tree));
1990 extern tree listify PROTO ((tree));
1991 extern tree type_hash_lookup PROTO ((int, tree));
1992 extern void type_hash_add PROTO ((int, tree));
1993 extern int type_hash_list PROTO ((tree));
1994 extern int simple_cst_list_equal PROTO ((tree, tree));
1995 extern void debug_obstack PROTO ((char *));
1996 extern void rtl_in_current_obstack PROTO ((void));
1997 extern void rtl_in_saveable_obstack PROTO ((void));
1998 extern void init_tree_codes PROTO ((void));
1999 extern void dump_tree_statistics PROTO ((void));
2000 extern void print_obstack_statistics PROTO ((char *, struct obstack *));
2002 extern void print_obstack_name PROTO ((char *, FILE *, char *));
2004 extern void expand_function_end PROTO ((char *, int, int));
2005 extern void expand_function_start PROTO ((tree, int));
2006 extern int real_onep PROTO ((tree));
2007 extern int real_twop PROTO ((tree));
2008 extern void start_identifier_warnings PROTO ((void));
2009 extern void gcc_obstack_init PROTO ((struct obstack *));
2010 extern void init_obstacks PROTO ((void));
2011 extern void obfree PROTO ((char *));
2014 extern void setjmp_protect_args PROTO ((void));
2015 extern void setjmp_protect PROTO ((tree));
2016 extern void expand_main_function PROTO ((void));
2017 extern void mark_varargs PROTO ((void));
2018 extern void init_function_start PROTO ((tree, char *, int));
2019 extern void assign_parms PROTO ((tree, int));
2020 extern void put_var_into_stack PROTO ((tree));
2021 extern void uninitialized_vars_warning PROTO ((tree));
2022 extern void setjmp_args_warning PROTO ((void));
2023 extern void mark_all_temps_used PROTO ((void));
2024 extern void init_temp_slots PROTO ((void));
2025 extern void combine_temp_slots PROTO ((void));
2026 extern void free_temp_slots PROTO ((void));
2027 extern void pop_temp_slots PROTO ((void));
2028 extern void push_temp_slots PROTO ((void));
2029 extern void preserve_temp_slots PROTO ((struct rtx_def *));
2030 extern int aggregate_value_p PROTO ((tree));
2031 extern tree reorder_blocks PROTO ((tree *, tree,
2033 extern void free_temps_for_rtl_expr PROTO ((tree));
2034 extern void instantiate_virtual_regs PROTO ((tree, struct rtx_def *));
2035 extern int max_parm_reg_num PROTO ((void));
2036 extern void push_function_context PROTO ((void));
2037 extern void pop_function_context PROTO ((void));
2038 extern void push_function_context_to PROTO ((tree));
2039 extern void pop_function_context_from PROTO ((tree));
2041 /* In print-rtl.c */
2043 extern void print_rtl PROTO ((FILE *, struct rtx_def *));
2046 /* In print-tree.c */
2047 extern void debug_tree PROTO ((tree));
2049 extern void print_node PROTO ((FILE *, char *, tree, int));
2050 extern void print_node_brief PROTO ((FILE *, char *, tree, int));
2051 extern void indent_to PROTO ((FILE *, int));
2055 extern void emit_queue PROTO ((void));
2056 extern int apply_args_register_offset PROTO ((int));
2057 extern struct rtx_def *expand_builtin_return_addr
2058 PROTO ((enum built_in_function, int, struct rtx_def *));
2059 extern void do_pending_stack_adjust PROTO ((void));
2060 extern struct rtx_def *expand_assignment PROTO ((tree, tree, int, int));
2061 extern struct rtx_def *store_expr PROTO ((tree, struct rtx_def *,
2065 extern void start_sequence_for_rtl_expr PROTO ((tree));
2066 extern struct rtx_def *emit_line_note_after PROTO ((char *, int,
2068 extern struct rtx_def *emit_line_note PROTO ((char *, int));
2069 extern struct rtx_def *emit_line_note_force PROTO ((char *, int));
2072 extern int mark_addressable PROTO ((tree));
2073 extern void incomplete_type_error PROTO ((tree, tree));
2076 extern void print_lang_statistics PROTO ((void));
2079 extern tree truthvalue_conversion PROTO ((tree));
2080 extern int min_precision PROTO ((tree, int));
2081 extern void split_specs_attrs PROTO ((tree, tree *, tree *));
2085 extern void print_lang_decl PROTO ((FILE *, tree, int));
2086 extern void print_lang_type PROTO ((FILE *, tree, int));
2087 extern void print_lang_identifier PROTO ((FILE *, tree, int));
2089 extern int global_bindings_p PROTO ((void));
2090 extern void insert_block PROTO ((tree));
2092 /* In integrate.c */
2093 extern void save_for_inline_nocopy PROTO ((tree));
2094 extern void save_for_inline_copying PROTO ((tree));
2095 extern void set_decl_abstract_flags PROTO ((tree, int));
2096 extern void output_inline_function PROTO ((tree));
2099 extern void set_yydebug PROTO ((int));
2101 /* In stor-layout.c */
2102 extern void fixup_signed_type PROTO ((tree));
2105 extern void make_decl_rtl PROTO ((tree, char *, int));
2106 extern void make_decl_one_only PROTO ((tree));
2107 extern void variable_section PROTO ((tree, int));
2110 extern void print_time PROTO ((char *, int));
2111 extern int get_run_time PROTO ((void));
2112 extern void debug_start_source_file PROTO ((char *));
2113 extern void debug_end_source_file PROTO ((unsigned));
2114 extern void debug_define PROTO ((unsigned, char *));
2115 extern void debug_undef PROTO ((unsigned, char *));
2116 extern void rest_of_decl_compilation PROTO ((tree, char *, int, int));
2117 extern void rest_of_type_compilation PROTO ((tree, int));
2118 extern void rest_of_compilation PROTO ((tree));
2119 extern void fatal PVPROTO ((char *, ...));
2120 extern void fatal_io_error PROTO ((char *));
2122 extern void warning PVPROTO ((char *, ...));
2123 extern void error PVPROTO ((char *, ...));
2125 extern void pedwarn PVPROTO ((char *, ...));
2126 extern void pedwarn_with_decl PVPROTO ((tree, char *, ...));
2127 extern void pedwarn_with_file_and_line PVPROTO ((char *, int, char *, ...));
2128 extern void warning_with_file_and_line PVPROTO ((char *, int, char *, ...));
2129 extern void warning_with_decl PVPROTO ((tree, char *, ...));
2130 extern void error_with_decl PVPROTO ((tree, char *, ...));
2131 extern void error_with_file_and_line PVPROTO ((char *, int, char *, ...));
2132 extern void sorry PVPROTO ((char *s, ...));
2133 extern void default_print_error_function PROTO ((char *));
2134 extern void report_error_function PROTO ((char *));
2135 extern void announce_function PROTO ((tree));
2137 /* In fold-const.c */
2138 extern int div_and_round_double PROTO ((enum tree_code, int,
2139 HOST_WIDE_INT, HOST_WIDE_INT,
2140 HOST_WIDE_INT, HOST_WIDE_INT,
2147 extern void emit_nop PROTO ((void));
2148 extern void expand_computed_goto PROTO ((tree));
2149 extern struct rtx_def *label_rtx PROTO ((tree));
2150 extern void expand_asm_operands PROTO ((tree, tree, tree, tree, int,
2152 extern int any_pending_cleanups PROTO ((int));
2153 extern void init_stmt PROTO ((void));
2154 extern void init_stmt_for_function PROTO ((void));
2155 extern void remember_end_note PROTO ((tree));
2156 extern int drop_through_at_end_p PROTO ((void));
2157 extern void expand_start_target_temps PROTO ((void));
2158 extern void expand_end_target_temps PROTO ((void));
2159 extern void expand_elseif PROTO ((tree));
2160 extern void expand_decl PROTO ((tree));
2161 extern int expand_decl_cleanup PROTO ((tree, tree));
2162 extern void expand_anon_union_decl PROTO ((tree, tree, tree));
2163 extern void move_cleanups_up PROTO ((void));
2164 extern void expand_start_case_dummy PROTO ((void));
2165 extern void expand_end_case_dummy PROTO ((void));
2166 extern tree case_index_expr_type PROTO ((void));
2167 extern HOST_WIDE_INT all_cases_count PROTO ((tree, int *));
2168 extern void check_for_full_enumeration_handling PROTO ((tree));
2169 extern void declare_nonlocal_label PROTO ((tree));
2171 extern void lang_print_xnode PROTO ((FILE *, tree, int));
2175 /* If KIND=='I', return a suitable global initializer (constructor) name.
2176 If KIND=='D', return a suitable global clean-up (destructor) name. */
2177 extern tree get_file_function_name PROTO((int));
2179 /* Interface of the DWARF2 unwind info support. */
2181 /* Decide whether we want to emit frame unwind information for the current
2182 translation unit. */
2184 extern int dwarf2out_do_frame PROTO((void));
2186 /* Generate a new label for the CFI info to refer to. */
2188 extern char *dwarf2out_cfi_label PROTO((void));
2190 /* Entry point to update the canonical frame address (CFA). */
2192 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
2194 /* Add the CFI for saving a register window. */
2196 extern void dwarf2out_window_save PROTO((char *));
2198 /* Add a CFI to update the running total of the size of arguments pushed
2201 extern void dwarf2out_args_size PROTO((char *, long));
2203 /* Entry point for saving a register to the stack. */
2205 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
2207 /* Entry point for saving the return address in the stack. */
2209 extern void dwarf2out_return_save PROTO((char *, long));
2211 /* Entry point for saving the return address in a register. */
2213 extern void dwarf2out_return_reg PROTO((char *, unsigned));
2215 /* Output a marker (i.e. a label) for the beginning of a function, before
2218 extern void dwarf2out_begin_prologue PROTO((void));
2220 /* Output a marker (i.e. a label) for the absolute end of the generated
2221 code for a function definition. */
2223 extern void dwarf2out_end_epilogue PROTO((void));