1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 93-98, 1999, 2000 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 const char *tree_code_name[MAX_TREE_CODES];
68 /* Classify which part of the compiler has defined a given builtin
77 /* Codes that identify the various built in functions
78 so that expand_call can identify them quickly. */
80 enum built_in_function
105 BUILT_IN_CLASSIFY_TYPE,
109 BUILT_IN_FRAME_ADDRESS,
110 BUILT_IN_RETURN_ADDRESS,
111 BUILT_IN_AGGREGATE_INCOMING_ADDRESS,
119 /* ISO C99 floating point unordered comparisons. */
121 BUILT_IN_ISGREATEREQUAL,
123 BUILT_IN_ISLESSEQUAL,
124 BUILT_IN_ISLESSGREATER,
125 BUILT_IN_ISUNORDERED,
127 /* Various hooks for the DWARF 2 __throw routine. */
128 BUILT_IN_UNWIND_INIT,
130 BUILT_IN_DWARF_FP_REGNUM,
131 BUILT_IN_INIT_DWARF_REG_SIZES,
132 BUILT_IN_FROB_RETURN_ADDR,
133 BUILT_IN_EXTRACT_RETURN_ADDR,
136 BUILT_IN_VARARGS_START,
137 BUILT_IN_STDARG_START,
147 /* Upper bound on non-language-specific builtins. */
151 /* The definition of tree nodes fills the next several pages. */
153 /* A tree node can represent a data type, a variable, an expression
154 or a statement. Each node has a TREE_CODE which says what kind of
155 thing it represents. Some common codes are:
156 INTEGER_TYPE -- represents a type of integers.
157 ARRAY_TYPE -- represents a type of pointer.
158 VAR_DECL -- represents a declared variable.
159 INTEGER_CST -- represents a constant integer value.
160 PLUS_EXPR -- represents a sum (an expression).
162 As for the contents of a tree node: there are some fields
163 that all nodes share. Each TREE_CODE has various special-purpose
164 fields as well. The fields of a node are never accessed directly,
165 always through accessor macros. */
167 /* This type is used everywhere to refer to a tree node. */
169 typedef union tree_node *tree;
171 /* Every kind of tree node starts with this structure,
172 so all nodes have these fields.
174 See the accessor macros, defined below, for documentation of the fields.
176 DO NOT change the layout of tree_common unless absolutely necessary. Some
177 front-ends (namely g++) depend on the internal layout of this tructure.
178 See my_tree_cons in the cp subdir for such uglyness. Ugh. */
182 union tree_node *chain;
183 union tree_node *type;
184 #ifdef ONLY_INT_FIELDS
185 unsigned int code : 8;
187 enum tree_code code : 8;
190 unsigned side_effects_flag : 1;
191 unsigned constant_flag : 1;
192 unsigned permanent_flag : 1;
193 unsigned addressable_flag : 1;
194 unsigned volatile_flag : 1;
195 unsigned readonly_flag : 1;
196 unsigned unsigned_flag : 1;
197 unsigned asm_written_flag: 1;
199 unsigned used_flag : 1;
200 unsigned raises_flag : 1;
201 unsigned static_flag : 1;
202 unsigned public_flag : 1;
203 unsigned private_flag : 1;
204 unsigned protected_flag : 1;
206 unsigned lang_flag_0 : 1;
207 unsigned lang_flag_1 : 1;
208 unsigned lang_flag_2 : 1;
209 unsigned lang_flag_3 : 1;
210 unsigned lang_flag_4 : 1;
211 unsigned lang_flag_5 : 1;
212 unsigned lang_flag_6 : 1;
214 /* There is room for three more flags. */
217 /* The following table lists the uses of each of the above flags and
218 for which types of nodes they are defined. Note that expressions
224 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
230 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
231 TREE_NO_UNUSED_WARNING in
232 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
234 TREE_LIST or TREE_VEC
235 TREE_CONSTANT_OVERFLOW in
236 INTEGER_CST, REAL_CST, COMPLEX_CST
237 TREE_SYMBOL_REFERENCED in
243 INTEGER_CST, REAL_CST, COMPLEX_CST
245 VAR_DECL or FUNCTION_DECL
247 TREE_LIST or TREE_VEC
248 EXPR_WFL_EMIT_LINE_NOTE in
249 EXPR_WITH_FILE_LOCATION
254 TREE_LIST or TREE_VEC
256 ??? unspecified nodes
260 TREE_VIA_PROTECTED in
264 ??? unspecified nodes
273 TREE_THIS_VOLATILE in
283 VAR_DECL if iterator (C)
292 permanent_flag: TREE_PERMANENT in all nodes
297 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
298 DECL_BUILT_IN_NONANSI in
302 SAVE_EXPR_NOPLACEHOLDER in
308 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
314 expressions, IDENTIFIER_NODE
322 /* Define accessors for the fields that all tree nodes have
323 (though some fields are not used for all kinds of nodes). */
325 /* The tree-code says what kind of node it is.
326 Codes are defined in tree.def. */
327 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
328 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
330 /* When checking is enabled, errors will be generated if a tree node
331 is accessed incorrectly. The macros abort with a fatal error. */
332 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
334 #define TREE_CHECK(t, code) \
335 ({ const tree __t = t; \
336 if (TREE_CODE(__t) != (code)) \
337 tree_check_failed (__t, code, __FILE__, \
338 __LINE__, __PRETTY_FUNCTION__); \
340 #define TREE_CLASS_CHECK(t, class) \
341 ({ const tree __t = t; \
342 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
343 tree_class_check_failed (__t, class, __FILE__, \
344 __LINE__, __PRETTY_FUNCTION__); \
347 /* These checks have to be special cased. */
348 #define CST_OR_CONSTRUCTOR_CHECK(t) \
349 ({ const tree __t = t; \
350 enum tree_code __c = TREE_CODE(__t); \
351 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
352 tree_check_failed (__t, CONSTRUCTOR, __FILE__, \
353 __LINE__, __PRETTY_FUNCTION__); \
355 #define EXPR_CHECK(t) \
356 ({ const tree __t = t; \
357 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
358 if (__c != 'r' && __c != 's' && __c != '<' \
359 && __c != '1' && __c != '2' && __c != 'e') \
360 tree_class_check_failed(__t, 'e', __FILE__, \
361 __LINE__, __PRETTY_FUNCTION__); \
364 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
365 const char *, int, const char *))
367 extern void tree_class_check_failed PARAMS ((const tree, char,
368 const char *, int, const char *))
371 #else /* not ENABLE_TREE_CHECKING, or not gcc */
373 #define TREE_CHECK(t, code) (t)
374 #define TREE_CLASS_CHECK(t, code) (t)
375 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
376 #define EXPR_CHECK(t) (t)
380 #include "tree-check.h"
382 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
383 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
384 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
386 /* In all nodes that are expressions, this is the data type of the expression.
387 In POINTER_TYPE nodes, this is the type that the pointer points to.
388 In ARRAY_TYPE nodes, this is the type of the elements. */
389 #define TREE_TYPE(NODE) ((NODE)->common.type)
391 /* Nodes are chained together for many purposes.
392 Types are chained together to record them for being output to the debugger
393 (see the function `chain_type').
394 Decls in the same scope are chained together to record the contents
396 Statement nodes for successive statements used to be chained together.
397 Often lists of things are represented by TREE_LIST nodes that
398 are chained together. */
400 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
402 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
403 that don't change the machine mode. */
405 #define STRIP_NOPS(EXP) \
406 while ((TREE_CODE (EXP) == NOP_EXPR \
407 || TREE_CODE (EXP) == CONVERT_EXPR \
408 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
409 && (TYPE_MODE (TREE_TYPE (EXP)) \
410 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
411 (EXP) = TREE_OPERAND (EXP, 0);
413 /* Like STRIP_NOPS, but don't let the signedness change either. */
415 #define STRIP_SIGN_NOPS(EXP) \
416 while ((TREE_CODE (EXP) == NOP_EXPR \
417 || TREE_CODE (EXP) == CONVERT_EXPR \
418 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
419 && (TYPE_MODE (TREE_TYPE (EXP)) \
420 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
421 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
422 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
423 (EXP) = TREE_OPERAND (EXP, 0);
425 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
427 #define STRIP_TYPE_NOPS(EXP) \
428 while ((TREE_CODE (EXP) == NOP_EXPR \
429 || TREE_CODE (EXP) == CONVERT_EXPR \
430 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
431 && (TREE_TYPE (EXP) \
432 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
433 (EXP) = TREE_OPERAND (EXP, 0);
435 /* Nonzero if TYPE represents an integral type. Note that we do not
436 include COMPLEX types here. */
438 #define INTEGRAL_TYPE_P(TYPE) \
439 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
440 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
442 /* Nonzero if TYPE represents a floating-point type, including complex
443 floating-point types. */
445 #define FLOAT_TYPE_P(TYPE) \
446 (TREE_CODE (TYPE) == REAL_TYPE \
447 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
448 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
450 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
452 #define AGGREGATE_TYPE_P(TYPE) \
453 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
454 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
455 || TREE_CODE (TYPE) == SET_TYPE)
457 /* Nonzero if TYPE represents a pointer type. */
459 #define POINTER_TYPE_P(TYPE) \
460 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
462 /* Nonzero if TYPE represents a type. */
464 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
466 /* Define many boolean fields that all tree nodes have. */
468 /* In VAR_DECL nodes, nonzero means address of this is needed.
469 So it cannot be in a register.
470 In a FUNCTION_DECL, nonzero means its address is needed.
471 So it must be compiled even if it is an inline function.
472 In CONSTRUCTOR nodes, it means object constructed must be in memory.
473 In LABEL_DECL nodes, it means a goto for this label has been seen
474 from a place outside all binding contours that restore stack levels.
475 In ..._TYPE nodes, it means that objects of this type must
476 be fully addressable. This means that pieces of this
477 object cannot go into register parameters, for example.
478 In IDENTIFIER_NODEs, this means that some extern decl for this name
479 had its address taken. That matters for inline functions. */
480 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
482 /* In a VAR_DECL, nonzero means allocate static storage.
483 In a FUNCTION_DECL, nonzero if function has been defined.
484 In a CONSTRUCTOR, nonzero means allocate static storage. */
485 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
487 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
488 made implicitly and should not lead to an "unused value" warning. */
489 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
491 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
492 chain is via a `virtual' declaration. */
493 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
495 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
496 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
497 requires a diagnostic when overflows occur in constant expressions. */
498 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
500 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
501 this string as an argument. */
502 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
504 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
505 overflow in folding, and no warning has been issued for this subexpression.
506 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
507 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
509 /* In a VAR_DECL or FUNCTION_DECL,
510 nonzero means name is to be accessible from outside this module.
511 In an identifier node, nonzero means an external declaration
512 accessible from outside this module was previously seen
513 for this name in an inner scope. */
514 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
516 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
517 base class is via a `public' declaration, which preserves public
518 fields from the base class as public. */
519 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
521 /* Ditto, for `private' declarations. */
522 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
524 /* Nonzero for TREE_LIST node means that the path to the
525 base class is via a `protected' declaration, which preserves
526 protected fields from the base class as protected.
528 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
530 /* In any expression, nonzero means it has side effects or reevaluation
531 of the whole expression could produce a different value.
532 This is set if any subexpression is a function call, a side effect
533 or a reference to a volatile variable.
534 In a ..._DECL, this is set only if the declaration said `volatile'. */
535 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
537 /* Nonzero means this expression is volatile in the C sense:
538 its address should be of type `volatile WHATEVER *'.
539 In other words, the declared item is volatile qualified.
540 This is used in _DECL nodes and _REF nodes.
542 In a ..._TYPE node, means this type is volatile-qualified.
543 But use TYPE_VOLATILE instead of this macro when the node is a type,
544 because eventually we may make that a different bit.
546 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
547 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
549 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
550 nonzero means it may not be the lhs of an assignment.
551 In a ..._TYPE node, means this type is const-qualified
552 (but the macro TYPE_READONLY should be used instead of this macro
553 when the node is a type). */
554 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
556 /* Value of expression is constant.
557 Always appears in all ..._CST nodes.
558 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
559 if the value is constant. */
560 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
562 /* Nonzero means permanent node;
563 node will continue to exist for the entire compiler run.
564 Otherwise it will be recycled at the end of the function. */
565 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
567 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
568 In FIELD_DECL nodes, means an unsigned bit field.
569 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
570 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
572 /* Nonzero in a VAR_DECL means assembler code has been written.
573 Nonzero in a FUNCTION_DECL means that the function has been compiled.
574 This is interesting in an inline function, since it might not need
575 to be compiled separately.
576 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
577 if the sdb debugging info for the type has been written.
578 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
579 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
581 /* Nonzero in a _DECL if the name is used in its scope.
582 Nonzero in an expr node means inhibit warning if value is unused.
583 In IDENTIFIER_NODEs, this means that some extern decl for this name
585 #define TREE_USED(NODE) ((NODE)->common.used_flag)
587 /* Nonzero for a tree node whose evaluation could result
588 in the raising of an exception. Not implemented yet. */
589 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
591 /* Used in classes in C++. */
592 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
593 /* Used in classes in C++.
594 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
595 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
597 /* These flags are available for each language front end to use internally. */
598 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
599 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
600 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
601 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
602 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
603 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
604 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
606 /* Define additional fields and accessors for nodes representing constants. */
608 /* In an INTEGER_CST node. These two together make a 2-word integer.
609 If the data type is signed, the value is sign-extended to 2 words
610 even though not all of them may really be in use.
611 In an unsigned constant shorter than 2 words, the extra bits are 0. */
612 #define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
613 #define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
615 #define INT_CST_LT(A, B) \
616 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
617 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
618 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
619 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
621 #define INT_CST_LT_UNSIGNED(A, B) \
622 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
623 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
624 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
625 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
626 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
627 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
631 char common[sizeof (struct tree_common)];
632 struct rtx_def *rtl; /* acts as link to register transfer language
634 HOST_WIDE_INT int_cst_low;
635 HOST_WIDE_INT int_cst_high;
638 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
639 and generally in all kinds of constants that could
640 be given labels (rather than being immediate). */
642 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
644 /* In a REAL_CST node. */
645 /* We can represent a real value as either a `double' or a string.
646 Strings don't allow for any optimization, but they do allow
647 for cross-compilation. */
649 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
655 char common[sizeof (struct tree_common)];
656 struct rtx_def *rtl; /* acts as link to register transfer language
658 REAL_VALUE_TYPE real_cst;
661 /* In a STRING_CST */
662 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
663 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
667 char common[sizeof (struct tree_common)];
668 struct rtx_def *rtl; /* acts as link to register transfer language
674 /* In a COMPLEX_CST node. */
675 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
676 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
680 char common[sizeof (struct tree_common)];
681 struct rtx_def *rtl; /* acts as link to register transfer language
683 union tree_node *real;
684 union tree_node *imag;
687 /* Define fields and accessors for some special-purpose tree nodes. */
689 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
690 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
692 struct tree_identifier
694 char common[sizeof (struct tree_common)];
699 /* In a TREE_LIST node. */
700 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
701 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
705 char common[sizeof (struct tree_common)];
706 union tree_node *purpose;
707 union tree_node *value;
710 /* In a TREE_VEC node. */
711 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
712 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
713 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
717 char common[sizeof (struct tree_common)];
719 union tree_node *a[1];
722 /* Define fields and accessors for some nodes that represent expressions. */
724 /* In a SAVE_EXPR node. */
725 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
726 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
727 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
728 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
729 both in normal code and in a handler. (Normally, in a handler, all
730 SAVE_EXPRs are unsaved, meaning that there values are
732 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
734 /* In a RTL_EXPR node. */
735 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
736 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
738 /* In a CALL_EXPR node. */
739 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
741 /* In a CONSTRUCTOR node. */
742 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
744 /* In ordinary expression nodes. */
745 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
746 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
748 /* In a LABELED_BLOCK_EXPR node. */
749 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
750 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
752 /* In a EXIT_BLOCK_EXPR node. */
753 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
754 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
756 /* In a LOOP_EXPR node. */
757 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
759 /* In a EXPR_WITH_FILE_LOCATION node. */
760 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
761 #define EXPR_WFL_FILENAME(NODE) \
762 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
763 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
764 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
765 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
766 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
767 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
768 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
769 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
773 char common[sizeof (struct tree_common)];
775 union tree_node *operands[1];
778 /* In a BLOCK node. */
779 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
780 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
781 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
782 /* Note: when changing this, make sure to find the places
783 that use chainon or nreverse. */
784 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
785 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
786 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
788 /* Nonzero means that this block is prepared to handle exceptions
789 listed in the BLOCK_VARS slot. */
790 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
794 char common[sizeof (struct tree_common)];
796 unsigned handler_block_flag : 1;
797 unsigned abstract_flag : 1;
799 union tree_node *vars;
800 union tree_node *subblocks;
801 union tree_node *supercontext;
802 union tree_node *abstract_origin;
805 /* Define fields and accessors for nodes representing data types. */
807 /* See tree.def for documentation of the use of these fields.
808 Look at the documentation of the various ..._TYPE tree codes. */
810 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
811 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
812 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
813 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
814 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
815 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
816 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
817 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
818 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
819 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
820 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
821 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
822 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
823 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
824 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
825 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
826 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
827 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
828 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
829 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
830 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
831 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
832 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
833 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
834 #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
835 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
837 /* For aggregate types, information about this type, as a base type
838 for itself. Used in a language-dependent way for types that are
839 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
840 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
842 /* The (language-specific) typed-based alias set for this type.
843 Objects whose TYPE_ALIAS_SETs are different cannot alias each
844 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
845 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
846 type can alias objects of any type. */
847 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
849 /* Nonzero iff the typed-based alias set for this type has been
851 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
852 (TYPE_CHECK (NODE)->type.alias_set != -1)
854 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
856 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
858 /* The alignment necessary for objects of this type.
859 The value is an int, measured in bits. */
860 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
862 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
864 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
865 has BLKmode only because it lacks the alignment requirement for
867 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
869 /* Nonzero in a type considered volatile as a whole. */
870 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
872 /* Means this type is const-qualified. */
873 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
875 /* If nonzero, this type is `restrict'-qualified, in the C sense of
877 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
879 /* There is a TYPE_QUAL value for each type qualifier. They can be
880 combined by bitwise-or to form the complete set of qualifiers for a
883 #define TYPE_UNQUALIFIED 0x0
884 #define TYPE_QUAL_CONST 0x1
885 #define TYPE_QUAL_VOLATILE 0x2
886 #define TYPE_QUAL_RESTRICT 0x4
888 /* The set of type qualifiers for this type. */
889 #define TYPE_QUALS(NODE) \
890 ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) \
891 | (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) \
892 | (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT))
894 /* These flags are available for each language front end to use internally. */
895 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
896 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
897 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
898 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
899 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
900 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
901 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
903 /* If set in an ARRAY_TYPE, indicates a string type (for languages
904 that distinguish string from array of char).
905 If set in a SET_TYPE, indicates a bitstring type. */
906 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
908 /* If non-NULL, this is a upper bound of the size (in bytes) of an
909 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
910 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
912 /* Indicates that objects of this type must be initialized by calling a
913 function when they are created. */
914 #define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
916 /* Indicates that objects of this type (a UNION_TYPE), should be passed
917 the same way that the first union alternative would be passed. */
918 #define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
920 /* Indicated that objects of this type should be laid out in as
921 compact a way as possible. */
922 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
926 char common[sizeof (struct tree_common)];
927 union tree_node *values;
928 union tree_node *size;
929 union tree_node *size_unit;
930 union tree_node *attributes;
933 unsigned char precision;
934 #ifdef ONLY_INT_FIELDS
937 enum machine_mode mode : 8;
940 unsigned string_flag : 1;
941 unsigned no_force_blk_flag : 1;
942 unsigned needs_constructing_flag : 1;
943 unsigned transparent_union_flag : 1;
944 unsigned packed_flag : 1;
945 unsigned restrict_flag : 1;
947 unsigned lang_flag_0 : 1;
948 unsigned lang_flag_1 : 1;
949 unsigned lang_flag_2 : 1;
950 unsigned lang_flag_3 : 1;
951 unsigned lang_flag_4 : 1;
952 unsigned lang_flag_5 : 1;
953 unsigned lang_flag_6 : 1;
954 /* room for 3 more bits */
957 union tree_node *pointer_to;
958 union tree_node *reference_to;
959 union {int address; char *pointer; } symtab;
960 union tree_node *name;
961 union tree_node *minval;
962 union tree_node *maxval;
963 union tree_node *next_variant;
964 union tree_node *main_variant;
965 union tree_node *binfo;
966 union tree_node *noncopied_parts;
967 union tree_node *context;
968 struct obstack *obstack;
970 /* Points to a structure whose details depend on the language in use. */
971 struct lang_type *lang_specific;
974 /* Define accessor macros for information about type inheritance
977 A "basetype" means a particular usage of a data type for inheritance
978 in another type. Each such basetype usage has its own "binfo"
979 object to describe it. The binfo object is a TREE_VEC node.
981 Inheritance is represented by the binfo nodes allocated for a
982 given type. For example, given types C and D, such that D is
983 inherited by C, 3 binfo nodes will be allocated: one for describing
984 the binfo properties of C, similarly one for D, and one for
985 describing the binfo properties of D as a base type for C.
986 Thus, given a pointer to class C, one can get a pointer to the binfo
987 of D acting as a basetype for C by looking at C's binfo's basetypes. */
989 /* The actual data type node being inherited in this basetype. */
990 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
992 /* The offset where this basetype appears in its containing type.
993 BINFO_OFFSET slot holds the offset (in bytes)
994 from the base of the complete object to the base of the part of the
995 object that is allocated on behalf of this `type'.
996 This is always 0 except when there is multiple inheritance. */
998 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
999 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1000 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1002 /* The virtual function table belonging to this basetype. Virtual
1003 function tables provide a mechanism for run-time method dispatching.
1004 The entries of a virtual function table are language-dependent. */
1006 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1007 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1009 /* The virtual functions in the virtual function table. This is
1010 a TREE_LIST that is used as an initial approximation for building
1011 a virtual function table for this basetype. */
1012 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1013 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1015 /* A vector of binfos for the direct basetypes inherited by this
1018 If this basetype describes type D as inherited in C, and if the
1019 basetypes of D are E and F, then this vector contains binfos for
1020 inheritance of E and F by C.
1022 ??? This could probably be done by just allocating the
1023 base types at the end of this TREE_VEC (instead of using
1024 another TREE_VEC). This would simplify the calculation
1025 of how many basetypes a given type had. */
1026 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1027 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1029 /* The number of basetypes for NODE. */
1030 #define BINFO_N_BASETYPES(NODE) \
1031 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1033 /* Accessor macro to get to the Nth basetype of this basetype. */
1034 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1035 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1037 /* For a BINFO record describing a virtual base class, i.e., one where
1038 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1039 base. The actual contents are language-dependent. Under the old
1040 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1041 pointer to the virtual base; under the new ABI this field is
1042 instead a INTEGER_CST giving an offset into the vtable where the
1043 offset to the virtual base can be found. */
1044 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1046 /* The size of a base class subobject of this type. Not all frontends
1047 currently allocate the space for this field. */
1048 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1049 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1051 /* Slot used to build a chain that represents a use of inheritance.
1052 For example, if X is derived from Y, and Y is derived from Z,
1053 then this field can be used to link the binfo node for X to
1054 the binfo node for X's Y to represent the use of inheritance
1055 from X to Y. Similarly, this slot of the binfo node for X's Y
1056 can point to the Z from which Y is inherited (in X's inheritance
1057 hierarchy). In this fashion, one can represent and traverse specific
1058 uses of inheritance using the binfo nodes themselves (instead of
1059 consing new space pointing to binfo nodes).
1060 It is up to the language-dependent front-ends to maintain
1061 this information as necessary. */
1062 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1064 /* Define fields and accessors for nodes representing declared names. */
1066 /* Nonzero if DECL represents a decl. */
1067 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1068 /* This is the name of the object as written by the user.
1069 It is an IDENTIFIER_NODE. */
1070 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1071 /* This is the name of the object as the assembler will see it
1072 (but before any translations made by ASM_OUTPUT_LABELREF).
1073 Often this is the same as DECL_NAME.
1074 It is an IDENTIFIER_NODE. */
1075 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1076 /* Records the section name in a section attribute. Used to pass
1077 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1078 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1079 /* For FIELD_DECLs, this is the
1080 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1081 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1082 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1083 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1084 type, or NULL_TREE if the given decl has "file scope". */
1085 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1086 #define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1087 /* In a DECL this is the field where configuration dependent machine
1088 attributes are store */
1089 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1090 /* In a FIELD_DECL, this is the field position, counting in bits,
1091 of the bit closest to the beginning of the structure. */
1092 #define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1093 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1094 if so, the type that was originally specified for it.
1095 TREE_TYPE may have been modified (in finish_struct). */
1096 #define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1097 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1098 /* VAR_DECL and PARM_DECL reserve the arguments slot
1099 for language-specific uses. */
1100 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1101 /* In FUNCTION_DECL, holds the decl for the return value. */
1102 #define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result)
1103 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1104 #define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1105 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1106 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result)
1107 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1108 For a VAR_DECL, holds the initial value.
1109 For a PARM_DECL, not used--default
1110 values for parameters are encoded in the type of the function,
1111 not in the PARM_DECL slot. */
1112 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1113 /* For a PARM_DECL, records the data type used to pass the argument,
1114 which may be different from the type seen in the program. */
1115 #define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial) /* In PARM_DECL. */
1116 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1117 if nonzero, indicates that the field occupies the type. */
1118 #define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial)
1119 /* These two fields describe where in the source code the declaration was. */
1120 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1121 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1122 /* Holds the size of the datum, as a tree expression.
1123 Need not be constant. */
1124 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1125 /* Holds the alignment required for the datum. */
1126 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.frame_size.u)
1127 /* Holds the machine mode corresponding to the declaration of a variable or
1128 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1130 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1131 /* Holds the RTL expression for the value of a variable or function. If
1132 PROMOTED_MODE is defined, the mode of this expression may not be same
1133 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1134 to the variable's data type, while the mode
1135 of DECL_RTL is the mode actually used to contain the data. */
1136 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1137 /* Holds an INSN_LIST of all of the live ranges in which the variable
1138 has been moved to a possibly different register. */
1139 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1140 /* For PARM_DECL, holds an RTL for the stack slot or register
1141 where the data was actually passed. */
1142 #define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r)
1143 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1144 #define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.saved_insns.f)
1145 /* For FUNCTION_DECL, if it is inline,
1146 holds the size of the stack frame, as an integer. */
1147 #define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.frame_size.i)
1148 /* For FUNCTION_DECL, if it is built-in,
1149 this identifies which built-in operation it is. */
1150 #define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.frame_size.f.code)
1151 #define DECL_SET_FUNCTION_CODE(NODE,VAL) (DECL_CHECK (NODE)->decl.frame_size.f.code = (VAL))
1152 /* For a FIELD_DECL, holds the size of the member as an integer. */
1153 #define DECL_FIELD_SIZE(NODE) (DECL_CHECK (NODE)->decl.saved_insns.i)
1155 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1156 Before the struct containing the FUNCTION_DECL is laid out,
1157 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1158 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1159 function. When the class is laid out, this pointer is changed
1160 to an INTEGER_CST node which is suitable for use as an index
1161 into the virtual function table. */
1162 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1163 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1164 which this FIELD_DECL is defined. This information is needed when
1165 writing debugging information about vfield and vbase decls for C++. */
1166 #define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex)
1168 /* Every ..._DECL node gets a unique number. */
1169 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1171 /* For any sort of a ..._DECL node, this points to the original (abstract)
1172 decl node which this decl is an instance of, or else it is NULL indicating
1173 that this decl is not an instance of some other decl. For example,
1174 in a nested declaration of an inline function, this points back to the
1176 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1178 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1179 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1180 #define DECL_ORIGIN(NODE) \
1181 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1183 /* Nonzero for any sort of ..._DECL node means this decl node represents
1184 an inline instance of some original (abstract) decl from an inline function;
1185 suppress any warnings about shadowing some other variable.
1186 FUNCTION_DECL nodes can also have their abstract origin set to themselves
1187 (see save_for_inline_copying). */
1188 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1189 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1191 /* Nonzero if a _DECL means that the name of this decl should be ignored
1192 for symbolic debug purposes. */
1193 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1195 /* Nonzero for a given ..._DECL node means that this node represents an
1196 "abstract instance" of the given declaration (e.g. in the original
1197 declaration of an inline function). When generating symbolic debugging
1198 information, we mustn't try to generate any address information for nodes
1199 marked as "abstract instances" because we don't actually generate
1200 any code or allocate any data space for such instances. */
1201 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1203 /* Nonzero if a _DECL means that no warnings should be generated just
1204 because this decl is unused. */
1205 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1207 /* Nonzero for a given ..._DECL node means that this node should be
1208 put in .common, if possible. If a DECL_INITIAL is given, and it
1209 is not error_mark_node, then the decl cannot be put in .common. */
1210 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1212 /* Language-specific decl information. */
1213 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1215 /* In a VAR_DECL or FUNCTION_DECL,
1216 nonzero means external reference:
1217 do not allocate storage, and refer to a definition elsewhere. */
1218 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1220 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1222 #define DEFAULT_INIT_PRIORITY 65535
1223 #define MAX_INIT_PRIORITY 65535
1224 #define MAX_RESERVED_INIT_PRIORITY 100
1227 nonzero means the detail info about this type is not dumped into stabs.
1228 Instead it will generate cross reference ('x') of names.
1229 This uses the same flag as DECL_EXTERNAL. */
1230 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1233 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1234 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1235 /* In LABEL_DECL nodes, nonzero means that an error message about
1236 jumping into such a binding contour has been printed for this label. */
1237 #define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1238 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1239 #define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1240 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1241 static chain is not needed. */
1242 #define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1244 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1245 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1247 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1249 Also set in some languages for variables, etc., outside the normal
1250 lexical scope, such as class instance variables. */
1251 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1253 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1254 where it is called. */
1255 #define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1257 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1258 that is not specified by ansi C and that users are supposed to be allowed
1259 to redefine for any purpose whatever. */
1260 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1262 /* Nonzero in a FUNCTION_DECL means this function should be treated
1263 as if it were a malloc, meaning it returns a pointer that is
1265 #define DECL_IS_MALLOC(NODE) (DECL_CHECK (NODE)->decl.malloc_flag)
1267 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1269 #define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1270 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1271 contour that restored a stack level and which is now exited. */
1272 #define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1274 /* In a FUNCTION_DECL, nonzero means a built in function. */
1275 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1276 /* For a builtin function, identify which part of the compiler defined it. */
1277 #define DECL_BUILT_IN_CLASS(NODE) (DECL_CHECK (NODE)->decl.frame_size.f.bclass)
1279 /* In a VAR_DECL that's static,
1280 nonzero if the space is in the text section. */
1281 #define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1283 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1284 Used in FIELD_DECLs for vtable pointers.
1285 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1286 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1288 /* Used to indicate that the linkage status of this DECL is not yet known,
1289 so it should not be output now. */
1290 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1292 /* Used in PARM_DECLs whose type are unions to indicate that the
1293 argument should be passed in the same way that the first union
1294 alternative would be passed. */
1295 #define DECL_TRANSPARENT_UNION(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1297 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1298 at the beginning or end of execution. */
1299 #define DECL_STATIC_CONSTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_ctor_flag)
1300 #define DECL_STATIC_DESTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_dtor_flag)
1302 /* Used to indicate that this DECL represents a compiler-generated entity. */
1303 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1305 /* Used to indicate that this DECL has weak linkage. */
1306 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1308 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1309 multiple translation units should be merged. */
1310 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1312 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1313 not be put out unless it is needed in this translation unit.
1314 Entities like this are shared across translation units (like weak
1315 entities), but are guaranteed to be generated by any translation
1316 unit that needs them, and therefore need not be put out anywhere
1317 where they are not needed. DECL_COMDAT is just a hint to the
1318 back-end; it is up to front-ends which set this flag to ensure
1319 that there will never be any harm, other than bloat, in putting out
1320 something which is DECL_COMDAT. */
1321 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1323 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1324 be instrumented with calls to support routines. */
1325 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) ((NODE)->decl.no_instrument_function_entry_exit)
1327 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1328 disabled in this function. */
1329 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) ((NODE)->decl.no_check_memory_usage)
1331 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1332 disabled in this function. */
1333 #define DECL_NO_LIMIT_STACK(NODE) ((NODE)->decl.no_limit_stack)
1335 /* Additional flags for language-specific uses. */
1336 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1337 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1338 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1339 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1340 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1341 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1342 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1343 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1345 /* Used to indicate that the pointer to this DECL cannot be treated as
1346 an address constant. */
1347 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1349 /* Used to indicate an alias set for the memory pointed to by this
1350 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1351 pointer (or reference) type. */
1352 #define DECL_POINTER_ALIAS_SET(NODE) \
1353 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1355 /* Nonzero if an alias set has been assigned to this declaration. */
1356 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1357 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1361 char common[sizeof (struct tree_common)];
1365 union tree_node *size;
1366 #ifdef ONLY_INT_FIELDS
1369 enum machine_mode mode : 8;
1372 unsigned external_flag : 1;
1373 unsigned nonlocal_flag : 1;
1374 unsigned regdecl_flag : 1;
1375 unsigned inline_flag : 1;
1376 unsigned bit_field_flag : 1;
1377 unsigned virtual_flag : 1;
1378 unsigned ignored_flag : 1;
1379 unsigned abstract_flag : 1;
1381 unsigned in_system_header_flag : 1;
1382 unsigned common_flag : 1;
1383 unsigned defer_output : 1;
1384 unsigned transparent_union : 1;
1385 unsigned static_ctor_flag : 1;
1386 unsigned static_dtor_flag : 1;
1387 unsigned artificial_flag : 1;
1388 unsigned weak_flag : 1;
1390 unsigned lang_flag_0 : 1;
1391 unsigned lang_flag_1 : 1;
1392 unsigned lang_flag_2 : 1;
1393 unsigned lang_flag_3 : 1;
1394 unsigned lang_flag_4 : 1;
1395 unsigned lang_flag_5 : 1;
1396 unsigned lang_flag_6 : 1;
1397 unsigned lang_flag_7 : 1;
1399 unsigned non_addr_const_p : 1;
1400 unsigned no_instrument_function_entry_exit : 1;
1401 unsigned no_check_memory_usage : 1;
1402 unsigned comdat_flag : 1;
1403 unsigned malloc_flag : 1;
1404 unsigned no_limit_stack : 1;
1406 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1407 If built-in, this is the code for which built-in function.
1408 For other kinds of decls, this is DECL_ALIGN. */
1414 unsigned int code:24;
1415 unsigned int bclass:8;
1419 union tree_node *name;
1420 union tree_node *context;
1421 union tree_node *arguments;
1422 union tree_node *result;
1423 union tree_node *initial;
1424 union tree_node *abstract_origin;
1425 union tree_node *assembler_name;
1426 union tree_node *section_name;
1427 union tree_node *machine_attributes;
1428 struct rtx_def *rtl; /* acts as link to register transfer language
1430 struct rtx_def *live_range_rtl;
1431 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1432 on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */
1438 union tree_node *vindex;
1439 int pointer_alias_set;
1440 /* Points to a structure whose details depend on the language in use. */
1441 struct lang_decl *lang_specific;
1444 /* Define the overall contents of a tree node.
1445 It may be any of the structures declared above
1446 for various types of node. */
1450 struct tree_common common;
1451 struct tree_int_cst int_cst;
1452 struct tree_real_cst real_cst;
1453 struct tree_string string;
1454 struct tree_complex complex;
1455 struct tree_identifier identifier;
1456 struct tree_decl decl;
1457 struct tree_type type;
1458 struct tree_list list;
1459 struct tree_vec vec;
1460 struct tree_exp exp;
1461 struct tree_block block;
1464 /* Standard named or nameless data types of the C compiler. */
1482 TI_SIGNED_CHAR_TYPE,
1483 TI_UNSIGNED_CHAR_TYPE,
1486 TI_SHORT_INTEGER_TYPE,
1487 TI_SHORT_UNSIGNED_TYPE,
1488 TI_LONG_INTEGER_TYPE,
1489 TI_LONG_UNSIGNED_TYPE,
1490 TI_LONG_LONG_INTEGER_TYPE,
1491 TI_LONG_LONG_UNSIGNED_TYPE,
1500 TI_COMPLEX_INTEGER_TYPE,
1501 TI_COMPLEX_FLOAT_TYPE,
1502 TI_COMPLEX_DOUBLE_TYPE,
1503 TI_COMPLEX_LONG_DOUBLE_TYPE,
1507 TI_LONG_DOUBLE_TYPE,
1518 extern tree global_trees[TI_MAX];
1520 #define error_mark_node global_trees[TI_ERROR_MARK]
1522 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1523 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1524 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1525 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1526 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1528 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1529 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1530 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1531 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1532 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1534 #define char_type_node global_trees[TI_CHAR_TYPE]
1535 #define signed_char_type_node global_trees[TI_SIGNED_CHAR_TYPE]
1536 #define unsigned_char_type_node global_trees[TI_UNSIGNED_CHAR_TYPE]
1537 #define short_integer_type_node global_trees[TI_SHORT_INTEGER_TYPE]
1538 #define short_unsigned_type_node global_trees[TI_SHORT_UNSIGNED_TYPE]
1539 #define integer_type_node global_trees[TI_INTEGER_TYPE]
1540 #define unsigned_type_node global_trees[TI_UNSIGNED_TYPE]
1541 #define long_integer_type_node global_trees[TI_LONG_INTEGER_TYPE]
1542 #define long_unsigned_type_node global_trees[TI_LONG_UNSIGNED_TYPE]
1543 #define long_long_integer_type_node global_trees[TI_LONG_LONG_INTEGER_TYPE]
1544 #define long_long_unsigned_type_node global_trees[TI_LONG_LONG_UNSIGNED_TYPE]
1546 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1547 #define integer_one_node global_trees[TI_INTEGER_ONE]
1548 #define size_zero_node global_trees[TI_SIZE_ZERO]
1549 #define size_one_node global_trees[TI_SIZE_ONE]
1550 #define null_pointer_node global_trees[TI_NULL_POINTER]
1552 #define float_type_node global_trees[TI_FLOAT_TYPE]
1553 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1554 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1556 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1557 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1558 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1559 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1561 #define void_type_node global_trees[TI_VOID_TYPE]
1562 /* The C type `void *'. */
1563 #define ptr_type_node global_trees[TI_PTR_TYPE]
1564 /* The C type `const void *'. */
1565 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1566 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1567 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1569 #define NULL_TREE (tree) NULL
1571 /* The following functions accept a wide integer argument. Rather than
1572 having to cast on every function call, we use a macro instead, that is
1573 defined here and in rtl.h. */
1576 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1577 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1579 extern int exact_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1580 extern int floor_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1582 extern char *oballoc PARAMS ((int));
1583 extern char *permalloc PARAMS ((int));
1584 extern char *savealloc PARAMS ((int));
1585 extern char *expralloc PARAMS ((int));
1587 /* Lowest level primitive for allocating a node.
1588 The TREE_CODE is the only argument. Contents are initialized
1589 to zero except for a few of the common fields. */
1591 extern tree make_node PARAMS ((enum tree_code));
1592 extern tree make_lang_type PARAMS ((enum tree_code));
1593 extern tree (*make_lang_type_fn) PARAMS ((enum tree_code));
1595 /* Make a copy of a node, with all the same contents except
1596 for TREE_PERMANENT. (The copy is permanent
1597 iff nodes being made now are permanent.) */
1599 extern tree copy_node PARAMS ((tree));
1601 /* Make a copy of a chain of TREE_LIST nodes. */
1603 extern tree copy_list PARAMS ((tree));
1605 /* Make a TREE_VEC. */
1607 extern tree make_tree_vec PARAMS ((int));
1609 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1610 The name is supplied as a char *. */
1612 extern tree get_identifier PARAMS ((const char *));
1614 /* If an identifier with the name TEXT (a null-terminated string) has
1615 previously been referred to, return that node; otherwise return
1618 extern tree maybe_get_identifier PARAMS ((const char *));
1620 /* Construct various types of nodes. */
1622 #define build_int_2(LO,HI) \
1623 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1625 extern tree build PARAMS ((enum tree_code, tree, ...));
1626 extern tree build_nt PARAMS ((enum tree_code, ...));
1627 extern tree build_parse_node PARAMS ((enum tree_code, ...));
1629 extern tree build_int_2_wide PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT));
1630 extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE));
1631 extern tree build_real_from_int_cst PARAMS ((tree, tree));
1632 extern tree build_complex PARAMS ((tree, tree, tree));
1633 extern tree build_string PARAMS ((int, const char *));
1634 extern tree build1 PARAMS ((enum tree_code, tree, tree));
1635 extern tree build_tree_list PARAMS ((tree, tree));
1636 extern tree build_decl_list PARAMS ((tree, tree));
1637 extern tree build_expr_list PARAMS ((tree, tree));
1638 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
1639 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
1640 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
1642 /* Construct various nodes representing data types. */
1644 extern tree make_signed_type PARAMS ((int));
1645 extern tree make_unsigned_type PARAMS ((int));
1646 extern void set_sizetype PARAMS ((tree));
1647 extern tree signed_or_unsigned_type PARAMS ((int, tree));
1648 extern void fixup_unsigned_type PARAMS ((tree));
1649 extern tree build_pointer_type PARAMS ((tree));
1650 extern tree build_reference_type PARAMS ((tree));
1651 extern tree build_index_type PARAMS ((tree));
1652 extern tree build_index_2_type PARAMS ((tree, tree));
1653 extern tree build_array_type PARAMS ((tree, tree));
1654 extern tree build_function_type PARAMS ((tree, tree));
1655 extern tree build_method_type PARAMS ((tree, tree));
1656 extern tree build_offset_type PARAMS ((tree, tree));
1657 extern tree build_complex_type PARAMS ((tree));
1658 extern tree array_type_nelts PARAMS ((tree));
1660 extern tree value_member PARAMS ((tree, tree));
1661 extern tree purpose_member PARAMS ((tree, tree));
1662 extern tree binfo_member PARAMS ((tree, tree));
1663 extern int attribute_hash_list PARAMS ((tree));
1664 extern int attribute_list_equal PARAMS ((tree, tree));
1665 extern int attribute_list_contained PARAMS ((tree, tree));
1666 extern int tree_int_cst_equal PARAMS ((tree, tree));
1667 extern int tree_int_cst_lt PARAMS ((tree, tree));
1668 extern int tree_int_cst_sgn PARAMS ((tree));
1669 extern int index_type_equal PARAMS ((tree, tree));
1670 extern tree get_inner_array_type PARAMS ((tree));
1672 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1673 put the prototype here. Rtl.h does declare the prototype if
1674 tree.h had been included. */
1676 extern tree make_tree PARAMS ((tree, struct rtx_def *));
1678 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1681 Such modified types already made are recorded so that duplicates
1684 extern tree build_type_attribute_variant PARAMS ((tree, tree));
1685 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
1687 extern tree merge_machine_decl_attributes PARAMS ((tree, tree));
1688 extern tree merge_machine_type_attributes PARAMS ((tree, tree));
1690 /* Split a list of declspecs and attributes into two. */
1692 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
1694 /* Strip attributes from a list of combined specs and attrs. */
1696 extern tree strip_attrs PARAMS ((tree));
1698 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1700 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
1702 /* Given a tree node and a string, return non-zero if the tree node is
1703 a valid attribute name for the string. */
1705 extern int is_attribute_p PARAMS ((const char *, tree));
1707 /* Given an attribute name and a list of attributes, return the list element
1708 of the attribute or NULL_TREE if not found. */
1710 extern tree lookup_attribute PARAMS ((const char *, tree));
1712 /* Given two attributes lists, return a list of their union. */
1714 extern tree merge_attributes PARAMS ((tree, tree));
1716 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
1717 the same kind of data as TYPE describes. Variants point to the
1718 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
1719 and it points to a chain of other variants so that duplicate
1720 variants are never made. Only main variants should ever appear as
1721 types of expressions. */
1723 extern tree build_qualified_type PARAMS ((tree, int));
1725 /* Like build_qualified_type, but only deals with the `const' and
1726 `volatile' qualifiers. This interface is retained for backwards
1727 compatiblity with the various front-ends; new code should use
1728 build_qualified_type instead. */
1730 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
1731 build_qualified_type (TYPE, \
1732 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
1733 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
1735 /* Make a copy of a type node. */
1737 extern tree build_type_copy PARAMS ((tree));
1739 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1740 TYPE_ALIGN and TYPE_MODE fields.
1741 If called more than once on one node, does nothing except
1742 for the first time. */
1744 extern void layout_type PARAMS ((tree));
1746 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1747 return a canonicalized ..._TYPE node, so that duplicates are not made.
1748 How the hash code is computed is up to the caller, as long as any two
1749 callers that could hash identical-looking type nodes agree. */
1751 extern tree type_hash_canon PARAMS ((int, tree));
1753 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1754 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1755 fields. Call this only once for any given decl node.
1757 Second argument is the boundary that this field can be assumed to
1758 be starting at (in bits). Zero means it can be assumed aligned
1759 on any boundary that may be needed. */
1761 extern void layout_decl PARAMS ((tree, unsigned));
1763 /* Return an expr equal to X but certainly not valid as an lvalue. */
1765 extern tree non_lvalue PARAMS ((tree));
1766 extern tree pedantic_non_lvalue PARAMS ((tree));
1768 extern tree convert PARAMS ((tree, tree));
1769 extern unsigned int expr_align PARAMS ((tree));
1770 extern tree size_in_bytes PARAMS ((tree));
1771 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
1772 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
1773 extern tree ssize_binop PARAMS ((enum tree_code, tree, tree));
1774 extern tree size_int_wide PARAMS ((unsigned HOST_WIDE_INT,
1775 unsigned HOST_WIDE_INT, int));
1776 #define size_int(L) size_int_2 ((L), 0, 0)
1777 #define bitsize_int(L, H) size_int_2 ((L), (H), 1)
1778 #define size_int_2(L, H, T) \
1779 size_int_wide ((unsigned HOST_WIDE_INT) (L), \
1780 (unsigned HOST_WIDE_INT) (H), (T))
1782 extern tree round_up PARAMS ((tree, int));
1783 extern tree get_pending_sizes PARAMS ((void));
1784 extern void put_pending_sizes PARAMS ((tree));
1786 /* Type for sizes of data-type. */
1788 #define BITS_PER_UNIT_LOG \
1789 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1790 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1791 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1795 tree xsizetype, xbitsizetype;
1796 tree xssizetype, xusizetype;
1797 tree xsbitsizetype, xubitsizetype;
1800 extern struct sizetype_tab sizetype_tab;
1802 #define sizetype sizetype_tab.xsizetype
1803 #define bitsizetype sizetype_tab.xbitsizetype
1804 #define ssizetype sizetype_tab.xssizetype
1805 #define usizetype sizetype_tab.xusizetype
1806 #define sbitsizetype sizetype_tab.xsbitsizetype
1807 #define ubitsizetype sizetype_tab.xubitsizetype
1809 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1810 extern unsigned int maximum_field_alignment;
1812 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1813 extern unsigned int set_alignment;
1815 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1816 by making the last node in X point to Y.
1817 Returns X, except if X is 0 returns Y. */
1819 extern tree chainon PARAMS ((tree, tree));
1821 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1823 extern tree tree_cons PARAMS ((tree, tree, tree));
1824 extern tree perm_tree_cons PARAMS ((tree, tree, tree));
1825 extern tree temp_tree_cons PARAMS ((tree, tree, tree));
1826 extern tree saveable_tree_cons PARAMS ((tree, tree, tree));
1827 extern tree decl_tree_cons PARAMS ((tree, tree, tree));
1828 extern tree expr_tree_cons PARAMS ((tree, tree, tree));
1830 /* Return the last tree node in a chain. */
1832 extern tree tree_last PARAMS ((tree));
1834 /* Reverse the order of elements in a chain, and return the new head. */
1836 extern tree nreverse PARAMS ((tree));
1838 /* Returns the length of a chain of nodes
1839 (number of chain pointers to follow before reaching a null pointer). */
1841 extern int list_length PARAMS ((tree));
1843 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1845 extern int integer_zerop PARAMS ((tree));
1847 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1849 extern int integer_onep PARAMS ((tree));
1851 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1852 all of whose significant bits are 1. */
1854 extern int integer_all_onesp PARAMS ((tree));
1856 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1857 exactly one bit 1. */
1859 extern int integer_pow2p PARAMS ((tree));
1861 /* staticp (tree x) is nonzero if X is a reference to data allocated
1862 at a fixed address in memory. */
1864 extern int staticp PARAMS ((tree));
1866 /* Gets an error if argument X is not an lvalue.
1867 Also returns 1 if X is an lvalue, 0 if not. */
1869 extern int lvalue_or_else PARAMS ((tree, const char *));
1871 /* save_expr (EXP) returns an expression equivalent to EXP
1872 but it can be used multiple times within context CTX
1873 and only evaluate EXP once. */
1875 extern tree save_expr PARAMS ((tree));
1877 /* Returns the index of the first non-tree operand for CODE, or the number
1878 of operands if all are trees. */
1880 extern int first_rtl_op PARAMS ((enum tree_code));
1882 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1883 can be used multiple times and will evaluate EXP in its entirety
1886 extern tree unsave_expr PARAMS ((tree));
1888 /* Reset EXP in place so that it can be expaned again. Does not
1889 recurse into subtrees. */
1891 extern void unsave_expr_1 PARAMS ((tree));
1893 /* Like unsave_expr_1, but recurses into all subtrees. */
1895 extern tree unsave_expr_now PARAMS ((tree));
1897 /* If non-null, these are language-specific helper functions for
1898 unsave_expr_now. If present, LANG_UNSAVE is called before its
1899 argument (an UNSAVE_EXPR) is to be unsaved, and all other
1900 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
1901 called from unsave_expr_1 for language-specific tree codes. */
1902 extern void (*lang_unsave) PARAMS ((tree *));
1903 extern void (*lang_unsave_expr_now) PARAMS ((tree));
1905 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1906 or offset that depends on a field within a record.
1908 Note that we only allow such expressions within simple arithmetic
1911 extern int contains_placeholder_p PARAMS ((tree));
1913 /* Return 1 if EXP contains any expressions that produce cleanups for an
1914 outer scope to deal with. Used by fold. */
1916 extern int has_cleanups PARAMS ((tree));
1918 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1919 return a tree with all occurrences of references to F in a
1920 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1921 contains only arithmetic expressions. */
1923 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
1925 /* variable_size (EXP) is like save_expr (EXP) except that it
1926 is for the special case of something that is part of a
1927 variable size for a data type. It makes special arrangements
1928 to compute the value at the right time when the data type
1929 belongs to a function parameter. */
1931 extern tree variable_size PARAMS ((tree));
1933 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1934 but it can be used multiple times
1935 and only evaluate the subexpressions once. */
1937 extern tree stabilize_reference PARAMS ((tree));
1939 /* Subroutine of stabilize_reference; this is called for subtrees of
1940 references. Any expression with side-effects must be put in a SAVE_EXPR
1941 to ensure that it is only evaluated once. */
1943 extern tree stabilize_reference_1 PARAMS ((tree));
1945 /* Return EXP, stripped of any conversions to wider types
1946 in such a way that the result of converting to type FOR_TYPE
1947 is the same as if EXP were converted to FOR_TYPE.
1948 If FOR_TYPE is 0, it signifies EXP's type. */
1950 extern tree get_unwidened PARAMS ((tree, tree));
1952 /* Return OP or a simpler expression for a narrower value
1953 which can be sign-extended or zero-extended to give back OP.
1954 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1955 or 0 if the value should be sign-extended. */
1957 extern tree get_narrower PARAMS ((tree, int *));
1959 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1961 The definition of this resides in language-specific code
1962 as the repertoire of available types may vary. */
1964 extern tree type_for_mode PARAMS ((enum machine_mode, int));
1966 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1967 for an integer type with at least that precision.
1968 The definition of this resides in language-specific code
1969 as the repertoire of available types may vary. */
1971 extern tree type_for_size PARAMS ((unsigned, int));
1973 /* Given an integer type T, return a type like T but unsigned.
1974 If T is unsigned, the value is T.
1975 The definition of this resides in language-specific code
1976 as the repertoire of available types may vary. */
1978 extern tree unsigned_type PARAMS ((tree));
1980 /* Given an integer type T, return a type like T but signed.
1981 If T is signed, the value is T.
1982 The definition of this resides in language-specific code
1983 as the repertoire of available types may vary. */
1985 extern tree signed_type PARAMS ((tree));
1987 /* This function must be defined in the language-specific files.
1988 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1989 This is defined in a language-specific file. */
1991 extern tree maybe_build_cleanup PARAMS ((tree));
1993 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1994 look for nested component-refs or array-refs at constant positions
1995 and find the ultimate containing object, which is returned. */
1997 extern tree get_inner_reference PARAMS ((tree, int *, int *, tree *,
1998 enum machine_mode *, int *,
1999 int *, unsigned int *));
2001 /* Given a DECL or TYPE, return the scope in which it was declared, or
2002 NUL_TREE if there is no containing scope. */
2004 extern tree get_containing_scope PARAMS ((tree));
2006 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2008 extern tree decl_function_context PARAMS ((tree));
2010 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2011 this _DECL with its context, or zero if none. */
2012 extern tree decl_type_context PARAMS ((tree));
2014 /* Given the FUNCTION_DECL for the current function,
2015 return zero if it is ok for this function to be inline.
2016 Otherwise return a warning message with a single %s
2017 for the function's name. */
2019 extern const char *function_cannot_inline_p PARAMS ((tree));
2021 /* Return 1 if EXPR is the real constant zero. */
2022 extern int real_zerop PARAMS ((tree));
2024 /* Declare commonly used variables for tree structure. */
2026 /* Points to the name of the input file from which the current input
2027 being parsed originally came (before it went into cpp). */
2028 extern char *input_filename;
2030 /* Current line number in input file. */
2033 /* Nonzero for -pedantic switch: warn about anything
2034 that standard C forbids. */
2035 extern int pedantic;
2037 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2038 Zero means allow extended lvalues. */
2040 extern int pedantic_lvalues;
2042 /* Nonzero means can safely call expand_expr now;
2043 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2045 extern int immediate_size_expand;
2047 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2049 extern tree current_function_decl;
2051 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2053 extern int all_types_permanent;
2055 /* Pointer to function to compute the name to use to print a declaration.
2056 DECL is the declaration in question.
2057 VERBOSITY determines what information will be printed:
2058 0: DECL_NAME, demangled as necessary.
2059 1: and scope information.
2060 2: and any other information that might be interesting, such as function
2061 parameter types in C++. */
2063 extern const char *(*decl_printable_name) PARAMS ((tree, int));
2065 /* Pointer to function to finish handling an incomplete decl at the
2066 end of compilation. */
2068 extern void (*incomplete_decl_finalize_hook) PARAMS ((tree));
2070 extern char *init_parse PARAMS ((char *));
2071 extern void finish_parse PARAMS ((void));
2073 extern const char * const language_string;
2075 /* Declare a predefined function. Return the declaration. This function is
2076 provided by each language frontend. */
2077 extern tree builtin_function PARAMS ((const char *, tree, int,
2078 enum built_in_class,
2082 extern char *perm_calloc PARAMS ((int, long));
2083 extern tree get_file_function_name PARAMS ((int));
2084 extern tree get_file_function_name_long PARAMS ((const char *));
2085 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2086 extern tree get_set_constructor_bytes PARAMS ((tree,
2087 unsigned char *, int));
2088 extern int get_alias_set PARAMS ((tree));
2089 extern int new_alias_set PARAMS ((void));
2090 extern int (*lang_get_alias_set) PARAMS ((tree));
2091 extern tree get_callee_fndecl PARAMS ((tree));
2095 extern int in_control_zone_p PARAMS ((void));
2096 extern void expand_fixups PARAMS ((struct rtx_def *));
2097 extern tree expand_start_stmt_expr PARAMS ((void));
2098 extern tree expand_end_stmt_expr PARAMS ((tree));
2099 extern void expand_expr_stmt PARAMS ((tree));
2100 extern int warn_if_unused_value PARAMS ((tree));
2101 extern void expand_decl_init PARAMS ((tree));
2102 extern void clear_last_expr PARAMS ((void));
2103 extern void expand_label PARAMS ((tree));
2104 extern void expand_goto PARAMS ((tree));
2105 extern void expand_asm PARAMS ((tree));
2106 extern void expand_start_cond PARAMS ((tree, int));
2107 extern void expand_end_cond PARAMS ((void));
2108 extern void expand_start_else PARAMS ((void));
2109 extern void expand_start_elseif PARAMS ((tree));
2110 extern struct nesting *expand_start_loop PARAMS ((int));
2111 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2112 extern void expand_loop_continue_here PARAMS ((void));
2113 extern void expand_end_loop PARAMS ((void));
2114 extern int expand_continue_loop PARAMS ((struct nesting *));
2115 extern int expand_exit_loop PARAMS ((struct nesting *));
2116 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2118 extern int expand_exit_something PARAMS ((void));
2120 extern void expand_null_return PARAMS ((void));
2121 extern void expand_return PARAMS ((tree));
2122 extern int optimize_tail_recursion PARAMS ((tree, struct rtx_def *));
2123 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2124 #define expand_start_bindings(flags) \
2125 expand_start_bindings_and_block(flags, NULL_TREE)
2126 extern void expand_end_bindings PARAMS ((tree, int, int));
2127 extern void warn_about_unused_variables PARAMS ((tree));
2128 extern void start_cleanup_deferral PARAMS ((void));
2129 extern void end_cleanup_deferral PARAMS ((void));
2130 extern void mark_block_as_eh_region PARAMS ((void));
2131 extern void mark_block_as_not_eh_region PARAMS ((void));
2132 extern int is_eh_region PARAMS ((void));
2133 extern int conditional_context PARAMS ((void));
2134 extern tree last_cleanup_this_contour PARAMS ((void));
2135 extern int expand_dhc_cleanup PARAMS ((tree));
2136 extern int expand_dcc_cleanup PARAMS ((tree));
2137 extern void expand_start_case PARAMS ((int, tree, tree,
2139 extern void expand_end_case PARAMS ((tree));
2140 extern int pushcase PARAMS ((tree,
2141 tree (*) (tree, tree),
2143 extern int pushcase_range PARAMS ((tree, tree,
2144 tree (*) (tree, tree),
2146 extern void using_eh_for_cleanups PARAMS ((void));
2147 extern int stmt_loop_nest_empty PARAMS ((void));
2149 /* In fold-const.c */
2151 /* Fold constants as much as possible in an expression.
2152 Returns the simplified expression.
2153 Acts only on the top level of the expression;
2154 if the argument itself cannot be simplified, its
2155 subexpressions are not changed. */
2157 extern tree fold PARAMS ((tree));
2159 extern int force_fit_type PARAMS ((tree, int));
2160 extern int add_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2161 HOST_WIDE_INT, HOST_WIDE_INT,
2162 HOST_WIDE_INT *, HOST_WIDE_INT *));
2163 extern int neg_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2164 HOST_WIDE_INT *, HOST_WIDE_INT *));
2165 extern int mul_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2166 HOST_WIDE_INT, HOST_WIDE_INT,
2167 HOST_WIDE_INT *, HOST_WIDE_INT *));
2168 extern void lshift_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2169 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2170 HOST_WIDE_INT *, int));
2171 extern void rshift_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2173 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
2174 extern void lrotate_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2175 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2177 extern void rrotate_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2178 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2180 extern int operand_equal_p PARAMS ((tree, tree, int));
2181 extern tree invert_truthvalue PARAMS ((tree));
2183 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2184 function arguments and return the new type. Return NULL_TREE if no
2185 change. Required by any language that supports variadic arguments. */
2187 extern tree (*lang_type_promotes_to) PARAMS ((tree));
2189 /* Interface of the DWARF2 unwind info support. */
2191 /* Decide whether we want to emit frame unwind information for the current
2192 translation unit. */
2194 extern int dwarf2out_do_frame PARAMS ((void));
2196 /* Generate a new label for the CFI info to refer to. */
2198 extern char *dwarf2out_cfi_label PARAMS ((void));
2200 /* Entry point to update the canonical frame address (CFA). */
2202 extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
2204 /* Add the CFI for saving a register window. */
2206 extern void dwarf2out_window_save PARAMS ((char *));
2208 /* Add a CFI to update the running total of the size of arguments pushed
2211 extern void dwarf2out_args_size PARAMS ((char *, long));
2213 /* Entry point for saving a register to the stack. */
2215 extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
2217 /* Entry point for saving the return address in the stack. */
2219 extern void dwarf2out_return_save PARAMS ((char *, long));
2221 /* Entry point for saving the return address in a register. */
2223 extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
2225 /* Output a marker (i.e. a label) for the beginning of a function, before
2228 extern void dwarf2out_begin_prologue PARAMS ((void));
2230 /* Output a marker (i.e. a label) for the absolute end of the generated
2231 code for a function definition. */
2233 extern void dwarf2out_end_epilogue PARAMS ((void));
2235 /* The language front-end must define these functions. */
2237 /* Function of no arguments for initializing options. */
2238 extern void lang_init_options PARAMS ((void));
2240 /* Function of no arguments for initializing lexical scanning. */
2241 extern void init_lex PARAMS ((void));
2242 /* Function of no arguments for initializing the symbol table. */
2243 extern void init_decl_processing PARAMS ((void));
2245 /* Functions called with no arguments at the beginning and end or processing
2246 the input source file. */
2247 extern void lang_init PARAMS ((void));
2248 extern void lang_finish PARAMS ((void));
2250 /* Function to identify which front-end produced the output file. */
2251 extern const char *lang_identify PARAMS ((void));
2253 /* Called by report_error_function to print out function name.
2254 * Default may be overridden by language front-ends. */
2255 extern void (*print_error_function) PARAMS ((const char *));
2257 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2258 extern void copy_lang_decl PARAMS ((tree));
2260 /* Function called with no arguments to parse and compile the input. */
2261 extern int yyparse PARAMS ((void));
2262 /* Function called with option as argument
2263 to decode options starting with -f or -W or +.
2264 It should return nonzero if it handles the option. */
2265 extern int lang_decode_option PARAMS ((int, char **));
2267 /* Functions for processing symbol declarations. */
2268 /* Function to enter a new lexical scope.
2269 Takes one argument: always zero when called from outside the front end. */
2270 extern void pushlevel PARAMS ((int));
2271 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2272 Takes three arguments:
2273 KEEP -- nonzero if there were declarations in this scope.
2274 REVERSE -- reverse the order of decls before returning them.
2275 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2276 extern tree poplevel PARAMS ((int, int, int));
2277 /* Set the BLOCK node for the current scope level. */
2278 extern void set_block PARAMS ((tree));
2279 /* Function to add a decl to the current scope level.
2280 Takes one argument, a decl to add.
2281 Returns that decl, or, if the same symbol is already declared, may
2282 return a different decl for that name. */
2283 extern tree pushdecl PARAMS ((tree));
2284 /* Function to return the chain of decls so far in the current scope level. */
2285 extern tree getdecls PARAMS ((void));
2286 /* Function to return the chain of structure tags in the current scope level. */
2287 extern tree gettags PARAMS ((void));
2289 extern tree build_range_type PARAMS ((tree, tree, tree));
2291 /* Call when starting to parse a declaration:
2292 make expressions in the declaration last the length of the function.
2293 Returns an argument that should be passed to resume_momentary later. */
2294 extern int suspend_momentary PARAMS ((void));
2296 extern int allocation_temporary_p PARAMS ((void));
2298 /* Call when finished parsing a declaration:
2299 restore the treatment of node-allocation that was
2300 in effect before the suspension.
2301 YES should be the value previously returned by suspend_momentary. */
2302 extern void resume_momentary PARAMS ((int));
2304 /* Called after finishing a record, union or enumeral type. */
2305 extern void rest_of_type_compilation PARAMS ((tree, int));
2307 /* Save the current set of obstacks, but don't change them. */
2308 extern void push_obstacks_nochange PARAMS ((void));
2310 extern void permanent_allocation PARAMS ((int));
2312 extern void push_momentary PARAMS ((void));
2314 extern void clear_momentary PARAMS ((void));
2316 extern void pop_momentary PARAMS ((void));
2318 extern void end_temporary_allocation PARAMS ((void));
2320 /* Pop the obstack selection stack. */
2321 extern void pop_obstacks PARAMS ((void));
2324 extern int really_constant_p PARAMS ((tree));
2325 extern void push_obstacks PARAMS ((struct obstack *,
2327 extern void pop_momentary_nofree PARAMS ((void));
2328 extern void preserve_momentary PARAMS ((void));
2329 extern void saveable_allocation PARAMS ((void));
2330 extern void temporary_allocation PARAMS ((void));
2331 extern void resume_temporary_allocation PARAMS ((void));
2332 extern tree get_file_function_name PARAMS ((int));
2333 extern void set_identifier_size PARAMS ((int));
2334 extern int int_fits_type_p PARAMS ((tree, tree));
2335 extern int tree_log2 PARAMS ((tree));
2336 extern void preserve_initializer PARAMS ((void));
2337 extern void preserve_data PARAMS ((void));
2338 extern int object_permanent_p PARAMS ((tree));
2339 extern int type_precision PARAMS ((tree));
2340 extern int simple_cst_equal PARAMS ((tree, tree));
2341 extern int type_list_equal PARAMS ((tree, tree));
2342 extern int chain_member PARAMS ((tree, tree));
2343 extern int chain_member_purpose PARAMS ((tree, tree));
2344 extern int chain_member_value PARAMS ((tree, tree));
2345 extern tree listify PARAMS ((tree));
2346 extern tree type_hash_lookup PARAMS ((int, tree));
2347 extern void type_hash_add PARAMS ((int, tree));
2348 extern int type_hash_list PARAMS ((tree));
2349 extern int simple_cst_list_equal PARAMS ((tree, tree));
2350 extern void debug_obstack PARAMS ((char *));
2351 extern void rtl_in_current_obstack PARAMS ((void));
2352 extern void rtl_in_saveable_obstack PARAMS ((void));
2353 extern void init_tree_codes PARAMS ((void));
2354 extern void dump_tree_statistics PARAMS ((void));
2355 extern void print_obstack_statistics PARAMS ((const char *,
2358 extern void print_obstack_name PARAMS ((char *, FILE *, const char *));
2360 extern void expand_function_end PARAMS ((char *, int, int));
2361 extern void expand_function_start PARAMS ((tree, int));
2362 extern int real_onep PARAMS ((tree));
2363 extern int real_twop PARAMS ((tree));
2364 extern void start_identifier_warnings PARAMS ((void));
2365 extern void gcc_obstack_init PARAMS ((struct obstack *));
2366 extern void init_obstacks PARAMS ((void));
2367 extern void obfree PARAMS ((char *));
2368 extern void build_common_tree_nodes PARAMS ((int));
2369 extern void build_common_tree_nodes_2 PARAMS ((int));
2372 extern void setjmp_protect_args PARAMS ((void));
2373 extern void setjmp_protect PARAMS ((tree));
2374 extern void expand_main_function PARAMS ((void));
2375 extern void mark_varargs PARAMS ((void));
2376 extern void init_dummy_function_start PARAMS ((void));
2377 extern void expand_dummy_function_end PARAMS ((void));
2378 extern void init_function_for_compilation PARAMS ((void));
2379 extern void init_function_start PARAMS ((tree, char *, int));
2380 extern void assign_parms PARAMS ((tree));
2381 extern void put_var_into_stack PARAMS ((tree));
2382 extern void uninitialized_vars_warning PARAMS ((tree));
2383 extern void setjmp_args_warning PARAMS ((void));
2384 extern void mark_all_temps_used PARAMS ((void));
2385 extern void init_temp_slots PARAMS ((void));
2386 extern void combine_temp_slots PARAMS ((void));
2387 extern void free_temp_slots PARAMS ((void));
2388 extern void pop_temp_slots PARAMS ((void));
2389 extern void push_temp_slots PARAMS ((void));
2390 extern void preserve_temp_slots PARAMS ((struct rtx_def *));
2391 extern int aggregate_value_p PARAMS ((tree));
2392 extern tree reorder_blocks PARAMS ((tree,
2394 extern void free_temps_for_rtl_expr PARAMS ((tree));
2395 extern void instantiate_virtual_regs PARAMS ((tree, struct rtx_def *));
2396 extern void unshare_all_rtl PARAMS ((tree, struct rtx_def *));
2397 extern int max_parm_reg_num PARAMS ((void));
2398 extern void push_function_context PARAMS ((void));
2399 extern void pop_function_context PARAMS ((void));
2400 extern void push_function_context_to PARAMS ((tree));
2401 extern void pop_function_context_from PARAMS ((tree));
2403 /* In print-rtl.c */
2405 extern void print_rtl PARAMS ((FILE *, struct rtx_def *));
2408 /* In print-tree.c */
2409 extern void debug_tree PARAMS ((tree));
2411 extern void print_node PARAMS ((FILE *, const char *, tree, int));
2412 extern void print_node_brief PARAMS ((FILE *, const char *, tree, int));
2413 extern void indent_to PARAMS ((FILE *, int));
2417 extern void emit_queue PARAMS ((void));
2418 extern int apply_args_register_offset PARAMS ((int));
2419 extern struct rtx_def *expand_builtin_return_addr
2420 PARAMS ((enum built_in_function, int, struct rtx_def *));
2421 extern void do_pending_stack_adjust PARAMS ((void));
2422 extern struct rtx_def *expand_assignment PARAMS ((tree, tree, int, int));
2423 extern struct rtx_def *store_expr PARAMS ((tree, struct rtx_def *,
2425 extern void check_max_integer_computation_mode PARAMS ((tree));
2428 extern void start_sequence_for_rtl_expr PARAMS ((tree));
2429 extern struct rtx_def *emit_line_note_after PARAMS ((char *, int,
2431 extern struct rtx_def *emit_line_note PARAMS ((char *, int));
2432 extern struct rtx_def *emit_line_note_force PARAMS ((char *, int));
2435 extern void special_function_p PARAMS ((tree, int *, int *,
2436 int *, int *, int *));
2439 extern int mark_addressable PARAMS ((tree));
2440 extern void incomplete_type_error PARAMS ((tree, tree));
2443 extern void print_lang_statistics PARAMS ((void));
2446 extern tree truthvalue_conversion PARAMS ((tree));
2447 extern int min_precision PARAMS ((tree, int));
2448 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2452 extern void print_lang_decl PARAMS ((FILE *, tree, int));
2453 extern void print_lang_type PARAMS ((FILE *, tree, int));
2454 extern void print_lang_identifier PARAMS ((FILE *, tree, int));
2456 extern int global_bindings_p PARAMS ((void));
2457 extern void insert_block PARAMS ((tree));
2459 /* In integrate.c */
2460 extern void save_for_inline_nocopy PARAMS ((tree));
2461 extern void save_for_inline_copying PARAMS ((tree));
2462 extern void set_decl_abstract_flags PARAMS ((tree, int));
2463 extern void output_inline_function PARAMS ((tree));
2466 extern void set_yydebug PARAMS ((int));
2468 /* In stor-layout.c */
2469 extern void fixup_signed_type PARAMS ((tree));
2472 extern void make_decl_rtl PARAMS ((tree, const char *, int));
2473 extern void make_decl_one_only PARAMS ((tree));
2474 extern int supports_one_only PARAMS ((void));
2475 extern void variable_section PARAMS ((tree, int));
2477 /* In fold-const.c */
2478 extern int div_and_round_double PARAMS ((enum tree_code, int,
2479 HOST_WIDE_INT, HOST_WIDE_INT,
2480 HOST_WIDE_INT, HOST_WIDE_INT,
2487 extern void emit_nop PARAMS ((void));
2488 extern void expand_computed_goto PARAMS ((tree));
2489 extern struct rtx_def *label_rtx PARAMS ((tree));
2490 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
2492 extern int any_pending_cleanups PARAMS ((int));
2493 extern void init_stmt PARAMS ((void));
2494 extern void init_stmt_for_function PARAMS ((void));
2495 extern int drop_through_at_end_p PARAMS ((void));
2496 extern void expand_start_target_temps PARAMS ((void));
2497 extern void expand_end_target_temps PARAMS ((void));
2498 extern void expand_elseif PARAMS ((tree));
2499 extern void expand_decl PARAMS ((tree));
2500 extern int expand_decl_cleanup PARAMS ((tree, tree));
2501 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
2502 extern void move_cleanups_up PARAMS ((void));
2503 extern void expand_start_case_dummy PARAMS ((void));
2504 extern void expand_end_case_dummy PARAMS ((void));
2505 extern tree case_index_expr_type PARAMS ((void));
2506 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
2507 extern void check_for_full_enumeration_handling PARAMS ((tree));
2508 extern void declare_nonlocal_label PARAMS ((tree));
2510 extern void lang_print_xnode PARAMS ((FILE *, tree, int));
2514 /* If KIND=='I', return a suitable global initializer (constructor) name.
2515 If KIND=='D', return a suitable global clean-up (destructor) name. */
2516 extern tree get_file_function_name PARAMS ((int));
2518 /* Interface of the DWARF2 unwind info support. */
2520 /* Decide whether we want to emit frame unwind information for the current
2521 translation unit. */
2523 extern int dwarf2out_do_frame PARAMS ((void));
2525 /* Generate a new label for the CFI info to refer to. */
2527 extern char *dwarf2out_cfi_label PARAMS ((void));
2529 /* Entry point to update the canonical frame address (CFA). */
2531 extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
2533 /* Add the CFI for saving a register window. */
2535 extern void dwarf2out_window_save PARAMS ((char *));
2537 /* Add a CFI to update the running total of the size of arguments pushed
2540 extern void dwarf2out_args_size PARAMS ((char *, long));
2542 /* Entry point for saving a register to the stack. */
2544 extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
2546 /* Entry point for saving the return address in the stack. */
2548 extern void dwarf2out_return_save PARAMS ((char *, long));
2550 /* Entry point for saving the return address in a register. */
2552 extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
2554 /* Output a marker (i.e. a label) for the beginning of a function, before
2557 extern void dwarf2out_begin_prologue PARAMS ((void));
2559 /* Output a marker (i.e. a label) for the absolute end of the generated
2560 code for a function definition. */
2562 extern void dwarf2out_end_epilogue PARAMS ((void));
2564 /* Redefine abort to report an internal error w/o coredump, and
2565 reporting the location of the error in the source file. This logic
2566 is duplicated in rtl.h and tree.h because every file that needs the
2567 special abort includes one or both. toplev.h gets too few files,
2568 system.h gets too many. */
2570 extern void fancy_abort PARAMS ((const char *, int, const char *))
2572 #if (GCC_VERSION >= 2007)
2573 #define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__)
2575 #define abort() fancy_abort (__FILE__, __LINE__, 0)