1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 93-98, 1999 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 /* Codes that identify the various built in functions
69 so that expand_call can identify them quickly. */
71 enum built_in_function
97 BUILT_IN_CLASSIFY_TYPE,
101 BUILT_IN_FRAME_ADDRESS,
102 BUILT_IN_RETURN_ADDRESS,
103 BUILT_IN_AGGREGATE_INCOMING_ADDRESS,
111 /* Various hooks for the DWARF 2 __throw routine. */
112 BUILT_IN_UNWIND_INIT,
114 BUILT_IN_DWARF_FP_REGNUM,
115 BUILT_IN_DWARF_REG_SIZE,
116 BUILT_IN_FROB_RETURN_ADDR,
117 BUILT_IN_EXTRACT_RETURN_ADDR,
120 BUILT_IN_VARARGS_START,
121 BUILT_IN_STDARG_START,
131 /* Upper bound on non-language-specific builtins. */
135 /* The definition of tree nodes fills the next several pages. */
137 /* A tree node can represent a data type, a variable, an expression
138 or a statement. Each node has a TREE_CODE which says what kind of
139 thing it represents. Some common codes are:
140 INTEGER_TYPE -- represents a type of integers.
141 ARRAY_TYPE -- represents a type of pointer.
142 VAR_DECL -- represents a declared variable.
143 INTEGER_CST -- represents a constant integer value.
144 PLUS_EXPR -- represents a sum (an expression).
146 As for the contents of a tree node: there are some fields
147 that all nodes share. Each TREE_CODE has various special-purpose
148 fields as well. The fields of a node are never accessed directly,
149 always through accessor macros. */
151 /* This type is used everywhere to refer to a tree node. */
153 typedef union tree_node *tree;
155 /* Every kind of tree node starts with this structure,
156 so all nodes have these fields.
158 See the accessor macros, defined below, for documentation of the fields.
160 DO NOT change the layout of tree_common unless absolutely necessary. Some
161 front-ends (namely g++) depend on the internal layout of this tructure.
162 See my_tree_cons in the cp subdir for such uglyness. Ugh. */
166 union tree_node *chain;
167 union tree_node *type;
168 #ifdef ONLY_INT_FIELDS
169 unsigned int code : 8;
171 enum tree_code code : 8;
174 unsigned side_effects_flag : 1;
175 unsigned constant_flag : 1;
176 unsigned permanent_flag : 1;
177 unsigned addressable_flag : 1;
178 unsigned volatile_flag : 1;
179 unsigned readonly_flag : 1;
180 unsigned unsigned_flag : 1;
181 unsigned asm_written_flag: 1;
183 unsigned used_flag : 1;
184 unsigned raises_flag : 1;
185 unsigned static_flag : 1;
186 unsigned public_flag : 1;
187 unsigned private_flag : 1;
188 unsigned protected_flag : 1;
190 unsigned lang_flag_0 : 1;
191 unsigned lang_flag_1 : 1;
192 unsigned lang_flag_2 : 1;
193 unsigned lang_flag_3 : 1;
194 unsigned lang_flag_4 : 1;
195 unsigned lang_flag_5 : 1;
196 unsigned lang_flag_6 : 1;
198 unsigned gc_mark : 1;
200 /* There is room for two more flags. */
203 /* The following table lists the uses of each of the above flags and
204 for which types of nodes they are defined. Note that expressions
210 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
216 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
217 TREE_NO_UNUSED_WARNING in
218 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
220 TREE_LIST or TREE_VEC
221 TREE_CONSTANT_OVERFLOW in
222 INTEGER_CST, REAL_CST, COMPLEX_CST
223 TREE_SYMBOL_REFERENCED in
229 INTEGER_CST, REAL_CST, COMPLEX_CST
231 VAR_DECL or FUNCTION_DECL
233 TREE_LIST or TREE_VEC
234 EXPR_WFL_EMIT_LINE_NOTE in
235 EXPR_WITH_FILE_LOCATION
240 TREE_LIST or TREE_VEC
242 ??? unspecified nodes
246 TREE_VIA_PROTECTED in
250 ??? unspecified nodes
259 TREE_THIS_VOLATILE in
269 VAR_DECL if iterator (C)
278 permanent_flag: TREE_PERMANENT in all nodes
283 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
284 DECL_BUILT_IN_NONANSI in
288 SAVE_EXPR_NOPLACEHOLDER in
294 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
300 expressions, IDENTIFIER_NODE
308 /* Define accessors for the fields that all tree nodes have
309 (though some fields are not used for all kinds of nodes). */
311 /* The tree-code says what kind of node it is.
312 Codes are defined in tree.def. */
313 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
314 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
316 /* When checking is enabled, errors will be generated if a tree node
317 is accessed incorrectly. The macros abort with a fatal error. */
318 #if defined ENABLE_CHECKING && (__GNUC__ > 2 || __GNUC_MINOR__ > 6)
320 #define TREE_CHECK(t, code) \
321 ({ const tree __t = t; \
322 if (TREE_CODE(__t) != (code)) \
323 tree_check_failed (__t, code, __FILE__, \
324 __LINE__, __PRETTY_FUNCTION__); \
326 #define TREE_CLASS_CHECK(t, class) \
327 ({ const tree __t = t; \
328 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
329 tree_class_check_failed (__t, class, __FILE__, \
330 __LINE__, __PRETTY_FUNCTION__); \
333 /* These checks have to be special cased. */
334 #define CST_OR_CONSTRUCTOR_CHECK(t) \
335 ({ const tree __t = t; \
336 enum tree_code __c = TREE_CODE(__t); \
337 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
338 tree_check_failed (__t, CONSTRUCTOR, __FILE__, \
339 __LINE__, __PRETTY_FUNCTION__); \
341 #define EXPR_CHECK(t) \
342 ({ const tree __t = t; \
343 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
344 if (__c != 'r' && __c != 's' && __c != '<' \
345 && __c != '1' && __c != '2' && __c != 'e') \
346 tree_class_check_failed(__t, 'e', __FILE__, \
347 __LINE__, __PRETTY_FUNCTION__); \
350 extern void tree_check_failed PROTO((const tree, enum tree_code,
351 const char *, int, const char *))
353 extern void tree_class_check_failed PROTO((const tree, char,
354 const char *, int, const char *))
357 #else /* not ENABLE_CHECKING, or not gcc */
359 #define TREE_CHECK(t, code) (t)
360 #define TREE_CLASS_CHECK(t, code) (t)
361 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
362 #define EXPR_CHECK(t) (t)
366 #include "tree-check.h"
368 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
369 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
370 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
372 /* In all nodes that are expressions, this is the data type of the expression.
373 In POINTER_TYPE nodes, this is the type that the pointer points to.
374 In ARRAY_TYPE nodes, this is the type of the elements. */
375 #define TREE_TYPE(NODE) ((NODE)->common.type)
377 /* Nodes are chained together for many purposes.
378 Types are chained together to record them for being output to the debugger
379 (see the function `chain_type').
380 Decls in the same scope are chained together to record the contents
382 Statement nodes for successive statements used to be chained together.
383 Often lists of things are represented by TREE_LIST nodes that
384 are chained together. */
386 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
388 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
389 that don't change the machine mode. */
391 #define STRIP_NOPS(EXP) \
392 while ((TREE_CODE (EXP) == NOP_EXPR \
393 || TREE_CODE (EXP) == CONVERT_EXPR \
394 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
395 && (TYPE_MODE (TREE_TYPE (EXP)) \
396 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
397 (EXP) = TREE_OPERAND (EXP, 0);
399 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
401 #define STRIP_TYPE_NOPS(EXP) \
402 while ((TREE_CODE (EXP) == NOP_EXPR \
403 || TREE_CODE (EXP) == CONVERT_EXPR \
404 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
405 && (TREE_TYPE (EXP) \
406 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
407 (EXP) = TREE_OPERAND (EXP, 0);
409 /* Nonzero if TYPE represents an integral type. Note that we do not
410 include COMPLEX types here. */
412 #define INTEGRAL_TYPE_P(TYPE) \
413 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
414 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
416 /* Nonzero if TYPE represents a floating-point type, including complex
417 floating-point types. */
419 #define FLOAT_TYPE_P(TYPE) \
420 (TREE_CODE (TYPE) == REAL_TYPE \
421 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
422 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
424 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
426 #define AGGREGATE_TYPE_P(TYPE) \
427 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
428 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
429 || TREE_CODE (TYPE) == SET_TYPE)
431 /* Nonzero if TYPE represents a pointer type. */
433 #define POINTER_TYPE_P(TYPE) \
434 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
436 /* Nonzero if TYPE represents a type. */
438 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
440 /* Define many boolean fields that all tree nodes have. */
442 /* In VAR_DECL nodes, nonzero means address of this is needed.
443 So it cannot be in a register.
444 In a FUNCTION_DECL, nonzero means its address is needed.
445 So it must be compiled even if it is an inline function.
446 In CONSTRUCTOR nodes, it means object constructed must be in memory.
447 In LABEL_DECL nodes, it means a goto for this label has been seen
448 from a place outside all binding contours that restore stack levels.
449 In ..._TYPE nodes, it means that objects of this type must
450 be fully addressable. This means that pieces of this
451 object cannot go into register parameters, for example.
452 In IDENTIFIER_NODEs, this means that some extern decl for this name
453 had its address taken. That matters for inline functions. */
454 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
456 /* In a VAR_DECL, nonzero means allocate static storage.
457 In a FUNCTION_DECL, nonzero if function has been defined.
458 In a CONSTRUCTOR, nonzero means allocate static storage. */
459 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
461 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
462 made implicitly and should not lead to an "unused value" warning. */
463 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
465 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
466 chain is via a `virtual' declaration. */
467 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
469 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
470 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
471 requires a diagnostic when overflows occur in constant expressions. */
472 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
474 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
475 this string as an argument. */
476 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
478 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
479 overflow in folding, and no warning has been issued for this subexpression.
480 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
481 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
483 /* In a VAR_DECL or FUNCTION_DECL,
484 nonzero means name is to be accessible from outside this module.
485 In an identifier node, nonzero means an external declaration
486 accessible from outside this module was previously seen
487 for this name in an inner scope. */
488 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
490 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
491 base class is via a `public' declaration, which preserves public
492 fields from the base class as public. */
493 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
495 /* Ditto, for `private' declarations. */
496 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
498 /* Nonzero for TREE_LIST node means that the path to the
499 base class is via a `protected' declaration, which preserves
500 protected fields from the base class as protected.
502 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
504 /* In any expression, nonzero means it has side effects or reevaluation
505 of the whole expression could produce a different value.
506 This is set if any subexpression is a function call, a side effect
507 or a reference to a volatile variable.
508 In a ..._DECL, this is set only if the declaration said `volatile'. */
509 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
511 /* Nonzero means this expression is volatile in the C sense:
512 its address should be of type `volatile WHATEVER *'.
513 In other words, the declared item is volatile qualified.
514 This is used in _DECL nodes and _REF nodes.
516 In a ..._TYPE node, means this type is volatile-qualified.
517 But use TYPE_VOLATILE instead of this macro when the node is a type,
518 because eventually we may make that a different bit.
520 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
521 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
523 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
524 nonzero means it may not be the lhs of an assignment.
525 In a ..._TYPE node, means this type is const-qualified
526 (but the macro TYPE_READONLY should be used instead of this macro
527 when the node is a type). */
528 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
530 /* Value of expression is constant.
531 Always appears in all ..._CST nodes.
532 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
533 if the value is constant. */
534 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
536 /* Nonzero means permanent node;
537 node will continue to exist for the entire compiler run.
538 Otherwise it will be recycled at the end of the function. */
539 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
541 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
542 In FIELD_DECL nodes, means an unsigned bit field.
543 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
544 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
546 /* Nonzero in a VAR_DECL means assembler code has been written.
547 Nonzero in a FUNCTION_DECL means that the function has been compiled.
548 This is interesting in an inline function, since it might not need
549 to be compiled separately.
550 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
551 if the sdb debugging info for the type has been written.
552 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
553 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
555 /* Nonzero in a _DECL if the name is used in its scope.
556 Nonzero in an expr node means inhibit warning if value is unused.
557 In IDENTIFIER_NODEs, this means that some extern decl for this name
559 #define TREE_USED(NODE) ((NODE)->common.used_flag)
561 /* Nonzero for a tree node whose evaluation could result
562 in the raising of an exception. Not implemented yet. */
563 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
565 /* Used in classes in C++. */
566 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
567 /* Used in classes in C++.
568 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
569 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
571 /* These flags are available for each language front end to use internally. */
572 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
573 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
574 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
575 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
576 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
577 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
578 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
580 /* Define additional fields and accessors for nodes representing constants. */
582 /* In an INTEGER_CST node. These two together make a 2-word integer.
583 If the data type is signed, the value is sign-extended to 2 words
584 even though not all of them may really be in use.
585 In an unsigned constant shorter than 2 words, the extra bits are 0. */
586 #define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
587 #define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
589 #define INT_CST_LT(A, B) \
590 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
591 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
592 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
593 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
595 #define INT_CST_LT_UNSIGNED(A, B) \
596 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
597 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
598 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
599 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
600 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
601 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
605 char common[sizeof (struct tree_common)];
606 struct rtx_def *rtl; /* acts as link to register transfer language
608 HOST_WIDE_INT int_cst_low;
609 HOST_WIDE_INT int_cst_high;
612 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
613 and generally in all kinds of constants that could
614 be given labels (rather than being immediate). */
616 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
618 /* In a REAL_CST node. */
619 /* We can represent a real value as either a `double' or a string.
620 Strings don't allow for any optimization, but they do allow
621 for cross-compilation. */
623 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
629 char common[sizeof (struct tree_common)];
630 struct rtx_def *rtl; /* acts as link to register transfer language
632 REAL_VALUE_TYPE real_cst;
635 /* In a STRING_CST */
636 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
637 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
641 char common[sizeof (struct tree_common)];
642 struct rtx_def *rtl; /* acts as link to register transfer language
648 /* In a COMPLEX_CST node. */
649 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
650 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
654 char common[sizeof (struct tree_common)];
655 struct rtx_def *rtl; /* acts as link to register transfer language
657 union tree_node *real;
658 union tree_node *imag;
661 /* Define fields and accessors for some special-purpose tree nodes. */
663 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
664 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
666 struct tree_identifier
668 char common[sizeof (struct tree_common)];
673 /* In a TREE_LIST node. */
674 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
675 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
679 char common[sizeof (struct tree_common)];
680 union tree_node *purpose;
681 union tree_node *value;
684 /* In a TREE_VEC node. */
685 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
686 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
687 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
691 char common[sizeof (struct tree_common)];
693 union tree_node *a[1];
696 /* Define fields and accessors for some nodes that represent expressions. */
698 /* In a SAVE_EXPR node. */
699 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
700 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
701 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
703 /* In a RTL_EXPR node. */
704 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
705 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
707 /* In a CALL_EXPR node. */
708 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
710 /* In a CONSTRUCTOR node. */
711 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
713 /* In ordinary expression nodes. */
714 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
715 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
717 /* In a LABELED_BLOCK_EXPR node. */
718 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
719 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
721 /* In a EXIT_BLOCK_EXPR node. */
722 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
723 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
725 /* In a LOOP_EXPR node. */
726 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
728 /* In a EXPR_WITH_FILE_LOCATION node. */
729 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
730 #define EXPR_WFL_FILENAME(NODE) (IDENTIFIER_POINTER ((NODE)->common.chain))
731 #define EXPR_WFL_FILENAME_NODE(NODE) ((NODE)->common.chain)
732 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
733 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
734 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
735 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
736 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
737 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
741 char common[sizeof (struct tree_common)];
743 union tree_node *operands[1];
746 /* In a BLOCK node. */
747 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
748 #define BLOCK_TYPE_TAGS(NODE) (BLOCK_CHECK (NODE)->block.type_tags)
749 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
750 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
751 /* Note: when changing this, make sure to find the places
752 that use chainon or nreverse. */
753 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
754 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
755 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
756 #define BLOCK_END_NOTE(NODE) (BLOCK_CHECK (NODE)->block.end_note)
757 /* Nonzero means that this block has separate live range regions */
758 #define BLOCK_LIVE_RANGE_FLAG(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_flag)
760 /* Nonzero means that this block has a variable declared in it
761 that is split into separate live ranges. */
762 #define BLOCK_LIVE_RANGE_VAR_FLAG(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_var_flag)
764 /* Index for marking the start of the block for live ranges. */
765 #define BLOCK_LIVE_RANGE_START(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_start)
767 /* Index for marking the end of the block for live ranges. */
768 #define BLOCK_LIVE_RANGE_END(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_end)
770 /* Nonzero means that this block is prepared to handle exceptions
771 listed in the BLOCK_VARS slot. */
772 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
776 char common[sizeof (struct tree_common)];
778 unsigned handler_block_flag : 1;
779 unsigned abstract_flag : 1;
780 unsigned live_range_flag : 1;
781 unsigned live_range_var_flag : 1;
783 union tree_node *vars;
784 union tree_node *type_tags;
785 union tree_node *subblocks;
786 union tree_node *supercontext;
787 union tree_node *abstract_origin;
788 struct rtx_def *end_note;
789 int live_range_start;
793 /* Define fields and accessors for nodes representing data types. */
795 /* See tree.def for documentation of the use of these fields.
796 Look at the documentation of the various ..._TYPE tree codes. */
798 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
799 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
800 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
801 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
802 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
803 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
804 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
805 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
806 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
807 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
808 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
809 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
810 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
811 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
812 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
813 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
814 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
815 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
816 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
817 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
818 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
819 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
820 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
821 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
822 #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
823 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
825 /* For aggregate types, information about this type, as a base type
826 for itself. Used in a language-dependent way for types that are
827 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
828 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
830 /* The (language-specific) typed-based alias set for this type.
831 Objects whose TYPE_ALIAS_SETs are different cannot alias each
832 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
833 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
834 type can alias objects of any type. */
835 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
837 /* Nonzero iff the typed-based alias set for this type has been
839 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
840 (TYPE_CHECK (NODE)->type.alias_set != -1)
842 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
844 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
846 /* The alignment necessary for objects of this type.
847 The value is an int, measured in bits. */
848 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
850 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
852 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
853 has BLKmode only because it lacks the alignment requirement for
855 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
857 /* Nonzero in a type considered volatile as a whole. */
858 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
860 /* Means this type is const-qualified. */
861 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
863 /* If nonzero, this type is `restrict'-qualified, in the C sense of
865 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
867 /* There is a TYPE_QUAL value for each type qualifier. They can be
868 combined by bitwise-or to form the complete set of qualifiers for a
871 #define TYPE_UNQUALIFIED 0x0
872 #define TYPE_QUAL_CONST 0x1
873 #define TYPE_QUAL_VOLATILE 0x2
874 #define TYPE_QUAL_RESTRICT 0x4
876 /* The set of type qualifiers for this type. */
877 #define TYPE_QUALS(NODE) \
878 ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) | \
879 (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) | \
880 (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT))
882 /* These flags are available for each language front end to use internally. */
883 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
884 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
885 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
886 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
887 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
888 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
889 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
891 /* If set in an ARRAY_TYPE, indicates a string type (for languages
892 that distinguish string from array of char).
893 If set in a SET_TYPE, indicates a bitstring type. */
894 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
896 /* If non-NULL, this is a upper bound of the size (in bytes) of an
897 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
898 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
900 /* Indicates that objects of this type must be initialized by calling a
901 function when they are created. */
902 #define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
904 /* Indicates that objects of this type (a UNION_TYPE), should be passed
905 the same way that the first union alternative would be passed. */
906 #define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
908 /* Indicated that objects of this type should be laid out in as
909 compact a way as possible. */
910 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
914 char common[sizeof (struct tree_common)];
915 union tree_node *values;
916 union tree_node *size;
917 union tree_node *size_unit;
918 union tree_node *attributes;
921 unsigned char precision;
922 #ifdef ONLY_INT_FIELDS
925 enum machine_mode mode : 8;
928 unsigned string_flag : 1;
929 unsigned no_force_blk_flag : 1;
930 unsigned needs_constructing_flag : 1;
931 unsigned transparent_union_flag : 1;
932 unsigned packed_flag : 1;
933 unsigned restrict_flag : 1;
935 unsigned lang_flag_0 : 1;
936 unsigned lang_flag_1 : 1;
937 unsigned lang_flag_2 : 1;
938 unsigned lang_flag_3 : 1;
939 unsigned lang_flag_4 : 1;
940 unsigned lang_flag_5 : 1;
941 unsigned lang_flag_6 : 1;
942 /* room for 3 more bits */
945 union tree_node *pointer_to;
946 union tree_node *reference_to;
947 union {int address; char *pointer; } symtab;
948 union tree_node *name;
949 union tree_node *minval;
950 union tree_node *maxval;
951 union tree_node *next_variant;
952 union tree_node *main_variant;
953 union tree_node *binfo;
954 union tree_node *noncopied_parts;
955 union tree_node *context;
956 struct obstack *obstack;
958 /* Points to a structure whose details depend on the language in use. */
959 struct lang_type *lang_specific;
962 /* Define accessor macros for information about type inheritance
965 A "basetype" means a particular usage of a data type for inheritance
966 in another type. Each such basetype usage has its own "binfo"
967 object to describe it. The binfo object is a TREE_VEC node.
969 Inheritance is represented by the binfo nodes allocated for a
970 given type. For example, given types C and D, such that D is
971 inherited by C, 3 binfo nodes will be allocated: one for describing
972 the binfo properties of C, similarly one for D, and one for
973 describing the binfo properties of D as a base type for C.
974 Thus, given a pointer to class C, one can get a pointer to the binfo
975 of D acting as a basetype for C by looking at C's binfo's basetypes. */
977 /* The actual data type node being inherited in this basetype. */
978 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
980 /* The offset where this basetype appears in its containing type.
981 BINFO_OFFSET slot holds the offset (in bytes)
982 from the base of the complete object to the base of the part of the
983 object that is allocated on behalf of this `type'.
984 This is always 0 except when there is multiple inheritance. */
986 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
987 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
988 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
990 /* The virtual function table belonging to this basetype. Virtual
991 function tables provide a mechanism for run-time method dispatching.
992 The entries of a virtual function table are language-dependent. */
994 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
995 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
997 /* The virtual functions in the virtual function table. This is
998 a TREE_LIST that is used as an initial approximation for building
999 a virtual function table for this basetype. */
1000 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1001 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1003 /* A vector of additional binfos for the types inherited by this basetype.
1005 If this basetype describes type D as inherited in C,
1006 and if the basetypes of D are E anf F,
1007 then this vector contains binfos for inheritance of E and F by C.
1009 ??? This could probably be done by just allocating the
1010 base types at the end of this TREE_VEC (instead of using
1011 another TREE_VEC). This would simplify the calculation
1012 of how many basetypes a given type had. */
1013 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1014 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1016 /* Accessor macro to get to the Nth basetype of this basetype. */
1017 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1018 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1020 /* For a BINFO record describing an inheritance, this yields a pointer
1021 to the artificial FIELD_DECL node which contains the "virtual base
1022 class pointer" for the given inheritance. */
1023 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1025 /* The size of a base class subobject of this type. Not all frontends
1026 currently allocate the space for this field. */
1027 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1028 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1030 /* Slot used to build a chain that represents a use of inheritance.
1031 For example, if X is derived from Y, and Y is derived from Z,
1032 then this field can be used to link the binfo node for X to
1033 the binfo node for X's Y to represent the use of inheritance
1034 from X to Y. Similarly, this slot of the binfo node for X's Y
1035 can point to the Z from which Y is inherited (in X's inheritance
1036 hierarchy). In this fashion, one can represent and traverse specific
1037 uses of inheritance using the binfo nodes themselves (instead of
1038 consing new space pointing to binfo nodes).
1039 It is up to the language-dependent front-ends to maintain
1040 this information as necessary. */
1041 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1043 /* Define fields and accessors for nodes representing declared names. */
1045 /* Nonzero if DECL represents a decl. */
1046 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1047 /* This is the name of the object as written by the user.
1048 It is an IDENTIFIER_NODE. */
1049 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1050 /* This is the name of the object as the assembler will see it
1051 (but before any translations made by ASM_OUTPUT_LABELREF).
1052 Often this is the same as DECL_NAME.
1053 It is an IDENTIFIER_NODE. */
1054 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1055 /* Records the section name in a section attribute. Used to pass
1056 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1057 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1058 /* For FIELD_DECLs, this is the
1059 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1060 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1061 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1062 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1063 type, or NULL_TREE if the given decl has "file scope". */
1064 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1065 #define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1066 /* In a DECL this is the field where configuration dependent machine
1067 attributes are store */
1068 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1069 /* In a FIELD_DECL, this is the field position, counting in bits,
1070 of the bit closest to the beginning of the structure. */
1071 #define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1072 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1073 if so, the type that was originally specified for it.
1074 TREE_TYPE may have been modified (in finish_struct). */
1075 #define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1076 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1077 /* VAR_DECL and PARM_DECL reserve the arguments slot
1078 for language-specific uses. */
1079 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1080 /* In FUNCTION_DECL, holds the decl for the return value. */
1081 #define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result)
1082 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1083 #define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1084 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1085 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result)
1086 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1087 For a VAR_DECL, holds the initial value.
1088 For a PARM_DECL, not used--default
1089 values for parameters are encoded in the type of the function,
1090 not in the PARM_DECL slot. */
1091 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1092 /* For a PARM_DECL, records the data type used to pass the argument,
1093 which may be different from the type seen in the program. */
1094 #define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial) /* In PARM_DECL. */
1095 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1096 if nonzero, indicates that the field occupies the type. */
1097 #define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial)
1098 /* These two fields describe where in the source code the declaration was. */
1099 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1100 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1101 /* Holds the size of the datum, as a tree expression.
1102 Need not be constant. */
1103 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1104 /* Holds the alignment required for the datum. */
1105 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.frame_size.u)
1106 /* Holds the machine mode corresponding to the declaration of a variable or
1107 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1109 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1110 /* Holds the RTL expression for the value of a variable or function. If
1111 PROMOTED_MODE is defined, the mode of this expression may not be same
1112 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1113 to the variable's data type, while the mode
1114 of DECL_RTL is the mode actually used to contain the data. */
1115 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1116 /* Holds an INSN_LIST of all of the live ranges in which the variable
1117 has been moved to a possibly different register. */
1118 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1119 /* For PARM_DECL, holds an RTL for the stack slot or register
1120 where the data was actually passed. */
1121 #define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r)
1122 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1123 #define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.saved_insns.f)
1124 /* For FUNCTION_DECL, if it is inline,
1125 holds the size of the stack frame, as an integer. */
1126 #define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.frame_size.i)
1127 /* For FUNCTION_DECL, if it is built-in,
1128 this identifies which built-in operation it is. */
1129 #define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.frame_size.f)
1130 #define DECL_SET_FUNCTION_CODE(NODE,VAL) (DECL_CHECK (NODE)->decl.frame_size.f = (VAL))
1131 /* For a FIELD_DECL, holds the size of the member as an integer. */
1132 #define DECL_FIELD_SIZE(NODE) (DECL_CHECK (NODE)->decl.saved_insns.i)
1134 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1135 Before the struct containing the FUNCTION_DECL is laid out,
1136 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1137 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1138 function. When the class is laid out, this pointer is changed
1139 to an INTEGER_CST node which is suitable for use as an index
1140 into the virtual function table. */
1141 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1142 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1143 which this FIELD_DECL is defined. This information is needed when
1144 writing debugging information about vfield and vbase decls for C++. */
1145 #define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex)
1147 /* Every ..._DECL node gets a unique number. */
1148 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1150 /* For any sort of a ..._DECL node, this points to the original (abstract)
1151 decl node which this decl is an instance of, or else it is NULL indicating
1152 that this decl is not an instance of some other decl. For example,
1153 in a nested declaration of an inline function, this points back to the
1155 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1157 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1158 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1159 #define DECL_ORIGIN(NODE) \
1160 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1162 /* Nonzero for any sort of ..._DECL node means this decl node represents
1163 an inline instance of some original (abstract) decl from an inline function;
1164 suppress any warnings about shadowing some other variable. */
1165 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
1167 /* Nonzero if a _DECL means that the name of this decl should be ignored
1168 for symbolic debug purposes. */
1169 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1171 /* Nonzero for a given ..._DECL node means that this node represents an
1172 "abstract instance" of the given declaration (e.g. in the original
1173 declaration of an inline function). When generating symbolic debugging
1174 information, we mustn't try to generate any address information for nodes
1175 marked as "abstract instances" because we don't actually generate
1176 any code or allocate any data space for such instances. */
1177 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1179 /* Nonzero if a _DECL means that no warnings should be generated just
1180 because this decl is unused. */
1181 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1183 /* Nonzero for a given ..._DECL node means that this node should be
1184 put in .common, if possible. If a DECL_INITIAL is given, and it
1185 is not error_mark_node, then the decl cannot be put in .common. */
1186 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1188 /* Language-specific decl information. */
1189 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1191 /* In a VAR_DECL or FUNCTION_DECL,
1192 nonzero means external reference:
1193 do not allocate storage, and refer to a definition elsewhere. */
1194 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1196 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1198 #define DEFAULT_INIT_PRIORITY 65535
1199 #define MAX_INIT_PRIORITY 65535
1200 #define MAX_RESERVED_INIT_PRIORITY 100
1203 nonzero means the detail info about this type is not dumped into stabs.
1204 Instead it will generate cross reference ('x') of names.
1205 This uses the same flag as DECL_EXTERNAL. */
1206 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1209 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1210 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1211 /* In LABEL_DECL nodes, nonzero means that an error message about
1212 jumping into such a binding contour has been printed for this label. */
1213 #define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1214 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1215 #define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1216 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1217 static chain is not needed. */
1218 #define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1220 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1221 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1223 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1225 Also set in some languages for variables, etc., outside the normal
1226 lexical scope, such as class instance variables. */
1227 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1229 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1230 where it is called. */
1231 #define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1233 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1234 that is not specified by ansi C and that users are supposed to be allowed
1235 to redefine for any purpose whatever. */
1236 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1238 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1240 #define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1241 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1242 contour that restored a stack level and which is now exited. */
1243 #define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1244 /* In a FUNCTION_DECL, nonzero means a built in function. */
1245 #define DECL_BUILT_IN(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1246 /* In a VAR_DECL that's static,
1247 nonzero if the space is in the text section. */
1248 #define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1250 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1251 Used in FIELD_DECLs for vtable pointers.
1252 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1253 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1255 /* Used to indicate that the linkage status of this DECL is not yet known,
1256 so it should not be output now. */
1257 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1259 /* Used in PARM_DECLs whose type are unions to indicate that the
1260 argument should be passed in the same way that the first union
1261 alternative would be passed. */
1262 #define DECL_TRANSPARENT_UNION(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1264 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1265 at the beginning or end of execution. */
1266 #define DECL_STATIC_CONSTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_ctor_flag)
1267 #define DECL_STATIC_DESTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_dtor_flag)
1269 /* Used to indicate that this DECL represents a compiler-generated entity. */
1270 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1272 /* Used to indicate that this DECL has weak linkage. */
1273 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1275 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1276 multiple translation units should be merged. */
1277 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1279 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1280 not be put out unless it is needed in this translation unit.
1281 Entities like this are shared across translation units (like weak
1282 entities), but are guaranteed to be generated by any translation
1283 unit that needs them, and therefore need not be put out anywhere
1284 where they are not needed. DECL_COMDAT is just a hint to the
1285 back-end; it is up to front-ends which set this flag to ensure
1286 that there will never be any harm, other than bloat, in putting out
1287 something which is DECL_COMDAT. */
1288 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1290 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1291 be instrumented with calls to support routines. */
1292 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) ((NODE)->decl.no_instrument_function_entry_exit)
1294 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1295 disabled in this function. */
1296 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) ((NODE)->decl.no_check_memory_usage)
1298 /* Additional flags for language-specific uses. */
1299 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1300 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1301 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1302 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1303 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1304 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1305 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1306 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1308 /* Used to indicate that the pointer to this DECL cannot be treated as
1309 an address constant. */
1310 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1312 /* Used to indicate an alias set for the memory pointed to by this
1313 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1314 pointer (or reference) type. */
1315 #define DECL_POINTER_ALIAS_SET(NODE) \
1316 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1318 /* Nonzero if an alias set has been assigned to this declaration. */
1319 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1320 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1324 char common[sizeof (struct tree_common)];
1328 union tree_node *size;
1329 #ifdef ONLY_INT_FIELDS
1332 enum machine_mode mode : 8;
1335 unsigned external_flag : 1;
1336 unsigned nonlocal_flag : 1;
1337 unsigned regdecl_flag : 1;
1338 unsigned inline_flag : 1;
1339 unsigned bit_field_flag : 1;
1340 unsigned virtual_flag : 1;
1341 unsigned ignored_flag : 1;
1342 unsigned abstract_flag : 1;
1344 unsigned in_system_header_flag : 1;
1345 unsigned common_flag : 1;
1346 unsigned defer_output : 1;
1347 unsigned transparent_union : 1;
1348 unsigned static_ctor_flag : 1;
1349 unsigned static_dtor_flag : 1;
1350 unsigned artificial_flag : 1;
1351 unsigned weak_flag : 1;
1353 unsigned lang_flag_0 : 1;
1354 unsigned lang_flag_1 : 1;
1355 unsigned lang_flag_2 : 1;
1356 unsigned lang_flag_3 : 1;
1357 unsigned lang_flag_4 : 1;
1358 unsigned lang_flag_5 : 1;
1359 unsigned lang_flag_6 : 1;
1360 unsigned lang_flag_7 : 1;
1362 unsigned non_addr_const_p : 1;
1363 unsigned no_instrument_function_entry_exit : 1;
1364 unsigned no_check_memory_usage : 1;
1365 unsigned comdat_flag : 1;
1367 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1368 If built-in, this is the code for which built-in function.
1369 For other kinds of decls, this is DECL_ALIGN. */
1373 enum built_in_function f;
1376 union tree_node *name;
1377 union tree_node *context;
1378 union tree_node *arguments;
1379 union tree_node *result;
1380 union tree_node *initial;
1381 union tree_node *abstract_origin;
1382 union tree_node *assembler_name;
1383 union tree_node *section_name;
1384 union tree_node *machine_attributes;
1385 struct rtx_def *rtl; /* acts as link to register transfer language
1387 struct rtx_def *live_range_rtl;
1388 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1389 on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */
1395 union tree_node *vindex;
1396 int pointer_alias_set;
1397 /* Points to a structure whose details depend on the language in use. */
1398 struct lang_decl *lang_specific;
1401 /* Define the overall contents of a tree node.
1402 It may be any of the structures declared above
1403 for various types of node. */
1407 struct tree_common common;
1408 struct tree_int_cst int_cst;
1409 struct tree_real_cst real_cst;
1410 struct tree_string string;
1411 struct tree_complex complex;
1412 struct tree_identifier identifier;
1413 struct tree_decl decl;
1414 struct tree_type type;
1415 struct tree_list list;
1416 struct tree_vec vec;
1417 struct tree_exp exp;
1418 struct tree_block block;
1421 /* Standard named or nameless data types of the C compiler. */
1439 TI_SIGNED_CHAR_TYPE,
1440 TI_UNSIGNED_CHAR_TYPE,
1443 TI_SHORT_INTEGER_TYPE,
1444 TI_SHORT_UNSIGNED_TYPE,
1445 TI_LONG_INTEGER_TYPE,
1446 TI_LONG_UNSIGNED_TYPE,
1447 TI_LONG_LONG_INTEGER_TYPE,
1448 TI_LONG_LONG_UNSIGNED_TYPE,
1457 TI_COMPLEX_INTEGER_TYPE,
1458 TI_COMPLEX_FLOAT_TYPE,
1459 TI_COMPLEX_DOUBLE_TYPE,
1460 TI_COMPLEX_LONG_DOUBLE_TYPE,
1464 TI_LONG_DOUBLE_TYPE,
1475 extern tree global_trees[TI_MAX];
1477 #define error_mark_node global_trees[TI_ERROR_MARK]
1479 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1480 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1481 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1482 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1483 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1485 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1486 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1487 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1488 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1489 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1491 #define char_type_node global_trees[TI_CHAR_TYPE]
1492 #define signed_char_type_node global_trees[TI_SIGNED_CHAR_TYPE]
1493 #define unsigned_char_type_node global_trees[TI_UNSIGNED_CHAR_TYPE]
1494 #define short_integer_type_node global_trees[TI_SHORT_INTEGER_TYPE]
1495 #define short_unsigned_type_node global_trees[TI_SHORT_UNSIGNED_TYPE]
1496 #define integer_type_node global_trees[TI_INTEGER_TYPE]
1497 #define unsigned_type_node global_trees[TI_UNSIGNED_TYPE]
1498 #define long_integer_type_node global_trees[TI_LONG_INTEGER_TYPE]
1499 #define long_unsigned_type_node global_trees[TI_LONG_UNSIGNED_TYPE]
1500 #define long_long_integer_type_node global_trees[TI_LONG_LONG_INTEGER_TYPE]
1501 #define long_long_unsigned_type_node global_trees[TI_LONG_LONG_UNSIGNED_TYPE]
1503 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1504 #define integer_one_node global_trees[TI_INTEGER_ONE]
1505 #define size_zero_node global_trees[TI_SIZE_ZERO]
1506 #define size_one_node global_trees[TI_SIZE_ONE]
1507 #define null_pointer_node global_trees[TI_NULL_POINTER]
1509 #define float_type_node global_trees[TI_FLOAT_TYPE]
1510 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1511 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1513 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1514 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1515 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1516 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1518 #define void_type_node global_trees[TI_VOID_TYPE]
1519 #define ptr_type_node global_trees[TI_PTR_TYPE]
1520 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1521 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1522 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1524 #define NULL_TREE (tree) NULL
1526 /* The following functions accept a wide integer argument. Rather than
1527 having to cast on every function call, we use a macro instead, that is
1528 defined here and in rtl.h. */
1531 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1532 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1534 extern int exact_log2_wide PROTO((unsigned HOST_WIDE_INT));
1535 extern int floor_log2_wide PROTO((unsigned HOST_WIDE_INT));
1537 extern char *oballoc PROTO((int));
1538 extern char *permalloc PROTO((int));
1539 extern char *savealloc PROTO((int));
1540 extern char *expralloc PROTO((int));
1542 /* Lowest level primitive for allocating a node.
1543 The TREE_CODE is the only argument. Contents are initialized
1544 to zero except for a few of the common fields. */
1546 extern tree make_node PROTO((enum tree_code));
1548 /* Make a copy of a node, with all the same contents except
1549 for TREE_PERMANENT. (The copy is permanent
1550 iff nodes being made now are permanent.) */
1552 extern tree copy_node PROTO((tree));
1554 /* Make a copy of a chain of TREE_LIST nodes. */
1556 extern tree copy_list PROTO((tree));
1558 /* Make a TREE_VEC. */
1560 extern tree make_tree_vec PROTO((int));
1562 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1563 The name is supplied as a char *. */
1565 extern tree get_identifier PROTO((const char *));
1567 /* If an identifier with the name TEXT (a null-terminated string) has
1568 previously been referred to, return that node; otherwise return
1571 extern tree maybe_get_identifier PROTO((const char *));
1573 /* Construct various types of nodes. */
1575 #define build_int_2(LO,HI) \
1576 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1578 extern tree build PVPROTO((enum tree_code, tree, ...));
1579 extern tree build_nt PVPROTO((enum tree_code, ...));
1580 extern tree build_parse_node PVPROTO((enum tree_code, ...));
1582 extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1583 extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1584 extern tree build_real_from_int_cst PROTO((tree, tree));
1585 extern tree build_complex PROTO((tree, tree, tree));
1586 extern tree build_string PROTO((int, const char *));
1587 extern tree build1 PROTO((enum tree_code, tree, tree));
1588 extern tree build_tree_list PROTO((tree, tree));
1589 extern tree build_decl_list PROTO((tree, tree));
1590 extern tree build_expr_list PROTO((tree, tree));
1591 extern tree build_decl PROTO((enum tree_code, tree, tree));
1592 extern tree build_block PROTO((tree, tree, tree, tree, tree));
1593 extern tree build_expr_wfl PROTO((tree, const char *, int, int));
1595 /* Construct various nodes representing data types. */
1597 extern tree make_signed_type PROTO((int));
1598 extern tree make_unsigned_type PROTO((int));
1599 extern void set_sizetype PROTO((tree));
1600 extern tree signed_or_unsigned_type PROTO((int, tree));
1601 extern void fixup_unsigned_type PROTO((tree));
1602 extern tree build_pointer_type PROTO((tree));
1603 extern tree build_reference_type PROTO((tree));
1604 extern tree build_index_type PROTO((tree));
1605 extern tree build_index_2_type PROTO((tree, tree));
1606 extern tree build_array_type PROTO((tree, tree));
1607 extern tree build_function_type PROTO((tree, tree));
1608 extern tree build_method_type PROTO((tree, tree));
1609 extern tree build_offset_type PROTO((tree, tree));
1610 extern tree build_complex_type PROTO((tree));
1611 extern tree array_type_nelts PROTO((tree));
1613 extern tree value_member PROTO((tree, tree));
1614 extern tree purpose_member PROTO((tree, tree));
1615 extern tree binfo_member PROTO((tree, tree));
1616 extern int attribute_hash_list PROTO((tree));
1617 extern int attribute_list_equal PROTO((tree, tree));
1618 extern int attribute_list_contained PROTO((tree, tree));
1619 extern int tree_int_cst_equal PROTO((tree, tree));
1620 extern int tree_int_cst_lt PROTO((tree, tree));
1621 extern int tree_int_cst_sgn PROTO((tree));
1622 extern int index_type_equal PROTO((tree, tree));
1623 extern tree get_inner_array_type PROTO((tree));
1625 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1626 put the prototype here. Rtl.h does declare the prototype if
1627 tree.h had been included. */
1629 extern tree make_tree PROTO((tree, struct rtx_def *));
1631 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1634 Such modified types already made are recorded so that duplicates
1637 extern tree build_type_attribute_variant PROTO((tree, tree));
1638 extern tree build_decl_attribute_variant PROTO((tree, tree));
1640 extern tree merge_machine_decl_attributes PROTO((tree, tree));
1641 extern tree merge_machine_type_attributes PROTO((tree, tree));
1643 /* Split a list of declspecs and attributes into two. */
1645 extern void split_specs_attrs PROTO((tree, tree *, tree *));
1647 /* Strip attributes from a list of combined specs and attrs. */
1649 extern tree strip_attrs PROTO((tree));
1651 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1653 extern int valid_machine_attribute PROTO((tree, tree, tree, tree));
1655 /* Given a tree node and a string, return non-zero if the tree node is
1656 a valid attribute name for the string. */
1658 extern int is_attribute_p PROTO((const char *, tree));
1660 /* Given an attribute name and a list of attributes, return the list element
1661 of the attribute or NULL_TREE if not found. */
1663 extern tree lookup_attribute PROTO((const char *, tree));
1665 /* Given two attributes lists, return a list of their union. */
1667 extern tree merge_attributes PROTO((tree, tree));
1669 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
1670 the same kind of data as TYPE describes. Variants point to the
1671 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
1672 and it points to a chain of other variants so that duplicate
1673 variants are never made. Only main variants should ever appear as
1674 types of expressions. */
1676 extern tree build_qualified_type PROTO((tree, int));
1678 /* Like build_qualified_type, but only deals with the `const' and
1679 `volatile' qualifiers. This interface is retained for backwards
1680 compatiblity with the various front-ends; new code should use
1681 build_qualified_type instead. */
1683 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
1684 build_qualified_type (TYPE, \
1685 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
1686 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
1688 /* Make a copy of a type node. */
1690 extern tree build_type_copy PROTO((tree));
1692 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1693 TYPE_ALIGN and TYPE_MODE fields.
1694 If called more than once on one node, does nothing except
1695 for the first time. */
1697 extern void layout_type PROTO((tree));
1699 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1700 return a canonicalized ..._TYPE node, so that duplicates are not made.
1701 How the hash code is computed is up to the caller, as long as any two
1702 callers that could hash identical-looking type nodes agree. */
1704 extern tree type_hash_canon PROTO((int, tree));
1706 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1707 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1708 fields. Call this only once for any given decl node.
1710 Second argument is the boundary that this field can be assumed to
1711 be starting at (in bits). Zero means it can be assumed aligned
1712 on any boundary that may be needed. */
1714 extern void layout_decl PROTO((tree, unsigned));
1716 /* Return an expr equal to X but certainly not valid as an lvalue. */
1718 extern tree non_lvalue PROTO((tree));
1719 extern tree pedantic_non_lvalue PROTO((tree));
1721 extern tree convert PROTO((tree, tree));
1722 extern tree size_in_bytes PROTO((tree));
1723 extern HOST_WIDE_INT int_size_in_bytes PROTO((tree));
1724 extern tree size_binop PROTO((enum tree_code, tree, tree));
1725 extern tree ssize_binop PROTO((enum tree_code, tree, tree));
1726 extern tree size_int_wide PROTO((unsigned HOST_WIDE_INT,
1727 unsigned HOST_WIDE_INT, int));
1728 #define size_int(L) size_int_2 ((L), 0, 0)
1729 #define bitsize_int(L, H) size_int_2 ((L), (H), 1)
1730 #define size_int_2(L, H, T) \
1731 size_int_wide ((unsigned HOST_WIDE_INT) (L), \
1732 (unsigned HOST_WIDE_INT) (H), (T))
1734 extern tree round_up PROTO((tree, int));
1735 extern tree get_pending_sizes PROTO((void));
1736 extern void put_pending_sizes PROTO((tree));
1738 /* Type for sizes of data-type. */
1740 #define BITS_PER_UNIT_LOG \
1741 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1742 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1743 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1747 tree xsizetype, xbitsizetype;
1748 tree xssizetype, xusizetype;
1749 tree xsbitsizetype, xubitsizetype;
1752 extern struct sizetype_tab sizetype_tab;
1754 #define sizetype sizetype_tab.xsizetype
1755 #define bitsizetype sizetype_tab.xbitsizetype
1756 #define ssizetype sizetype_tab.xssizetype
1757 #define usizetype sizetype_tab.xusizetype
1758 #define sbitsizetype sizetype_tab.xsbitsizetype
1759 #define ubitsizetype sizetype_tab.xubitsizetype
1761 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1762 extern int maximum_field_alignment;
1764 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1765 extern int set_alignment;
1767 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1768 by making the last node in X point to Y.
1769 Returns X, except if X is 0 returns Y. */
1771 extern tree chainon PROTO((tree, tree));
1773 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1775 extern tree tree_cons PROTO((tree, tree, tree));
1776 extern tree perm_tree_cons PROTO((tree, tree, tree));
1777 extern tree temp_tree_cons PROTO((tree, tree, tree));
1778 extern tree saveable_tree_cons PROTO((tree, tree, tree));
1779 extern tree decl_tree_cons PROTO((tree, tree, tree));
1780 extern tree expr_tree_cons PROTO((tree, tree, tree));
1782 /* Return the last tree node in a chain. */
1784 extern tree tree_last PROTO((tree));
1786 /* Reverse the order of elements in a chain, and return the new head. */
1788 extern tree nreverse PROTO((tree));
1790 /* Returns the length of a chain of nodes
1791 (number of chain pointers to follow before reaching a null pointer). */
1793 extern int list_length PROTO((tree));
1795 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1797 extern int integer_zerop PROTO((tree));
1799 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1801 extern int integer_onep PROTO((tree));
1803 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1804 all of whose significant bits are 1. */
1806 extern int integer_all_onesp PROTO((tree));
1808 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1809 exactly one bit 1. */
1811 extern int integer_pow2p PROTO((tree));
1813 /* staticp (tree x) is nonzero if X is a reference to data allocated
1814 at a fixed address in memory. */
1816 extern int staticp PROTO((tree));
1818 /* Gets an error if argument X is not an lvalue.
1819 Also returns 1 if X is an lvalue, 0 if not. */
1821 extern int lvalue_or_else PROTO((tree, const char *));
1823 /* save_expr (EXP) returns an expression equivalent to EXP
1824 but it can be used multiple times within context CTX
1825 and only evaluate EXP once. */
1827 extern tree save_expr PROTO((tree));
1829 /* Returns the index of the first non-tree operand for CODE, or the number
1830 of operands if all are trees. */
1832 extern int first_rtl_op PROTO((enum tree_code));
1834 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1835 can be used multiple times and will evaluate EXP, in its entirety
1838 extern tree unsave_expr PROTO((tree));
1840 /* unsave_expr_now (EXP) resets EXP in place, so that it can be
1843 extern tree unsave_expr_now PROTO((tree));
1845 /* If non-null, a language specific helper for unsave_expr_now. */
1847 extern void (*lang_unsave_expr_now) PROTO((tree));
1849 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1850 or offset that depends on a field within a record.
1852 Note that we only allow such expressions within simple arithmetic
1855 extern int contains_placeholder_p PROTO((tree));
1857 /* Return 1 if EXP contains any expressions that produce cleanups for an
1858 outer scope to deal with. Used by fold. */
1860 extern int has_cleanups PROTO((tree));
1862 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1863 return a tree with all occurrences of references to F in a
1864 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1865 contains only arithmetic expressions. */
1867 extern tree substitute_in_expr PROTO((tree, tree, tree));
1869 /* variable_size (EXP) is like save_expr (EXP) except that it
1870 is for the special case of something that is part of a
1871 variable size for a data type. It makes special arrangements
1872 to compute the value at the right time when the data type
1873 belongs to a function parameter. */
1875 extern tree variable_size PROTO((tree));
1877 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1878 but it can be used multiple times
1879 and only evaluate the subexpressions once. */
1881 extern tree stabilize_reference PROTO((tree));
1883 /* Subroutine of stabilize_reference; this is called for subtrees of
1884 references. Any expression with side-effects must be put in a SAVE_EXPR
1885 to ensure that it is only evaluated once. */
1887 extern tree stabilize_reference_1 PROTO((tree));
1889 /* Return EXP, stripped of any conversions to wider types
1890 in such a way that the result of converting to type FOR_TYPE
1891 is the same as if EXP were converted to FOR_TYPE.
1892 If FOR_TYPE is 0, it signifies EXP's type. */
1894 extern tree get_unwidened PROTO((tree, tree));
1896 /* Return OP or a simpler expression for a narrower value
1897 which can be sign-extended or zero-extended to give back OP.
1898 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1899 or 0 if the value should be sign-extended. */
1901 extern tree get_narrower PROTO((tree, int *));
1903 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1905 The definition of this resides in language-specific code
1906 as the repertoire of available types may vary. */
1908 extern tree type_for_mode PROTO((enum machine_mode, int));
1910 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1911 for an integer type with at least that precision.
1912 The definition of this resides in language-specific code
1913 as the repertoire of available types may vary. */
1915 extern tree type_for_size PROTO((unsigned, int));
1917 /* Given an integer type T, return a type like T but unsigned.
1918 If T is unsigned, the value is T.
1919 The definition of this resides in language-specific code
1920 as the repertoire of available types may vary. */
1922 extern tree unsigned_type PROTO((tree));
1924 /* Given an integer type T, return a type like T but signed.
1925 If T is signed, the value is T.
1926 The definition of this resides in language-specific code
1927 as the repertoire of available types may vary. */
1929 extern tree signed_type PROTO((tree));
1931 /* This function must be defined in the language-specific files.
1932 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1933 This is defined in a language-specific file. */
1935 extern tree maybe_build_cleanup PROTO((tree));
1937 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1938 look for nested component-refs or array-refs at constant positions
1939 and find the ultimate containing object, which is returned. */
1941 extern tree get_inner_reference PROTO((tree, int *, int *, tree *,
1942 enum machine_mode *, int *,
1945 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1947 extern tree decl_function_context PROTO((tree));
1949 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1950 this _DECL with its context, or zero if none. */
1951 extern tree decl_type_context PROTO((tree));
1953 /* Given the FUNCTION_DECL for the current function,
1954 return zero if it is ok for this function to be inline.
1955 Otherwise return a warning message with a single %s
1956 for the function's name. */
1958 extern const char *function_cannot_inline_p PROTO((tree));
1960 /* Return 1 if EXPR is the real constant zero. */
1961 extern int real_zerop PROTO((tree));
1963 /* Declare commonly used variables for tree structure. */
1965 /* Points to the name of the input file from which the current input
1966 being parsed originally came (before it went into cpp). */
1967 extern char *input_filename;
1969 /* Current line number in input file. */
1972 /* Nonzero for -pedantic switch: warn about anything
1973 that standard C forbids. */
1974 extern int pedantic;
1976 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1977 Zero means allow extended lvalues. */
1979 extern int pedantic_lvalues;
1981 /* Nonzero means can safely call expand_expr now;
1982 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1984 extern int immediate_size_expand;
1986 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1988 extern tree current_function_decl;
1990 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1992 extern int all_types_permanent;
1994 /* Pointer to function to compute the name to use to print a declaration.
1995 DECL is the declaration in question.
1996 VERBOSITY determines what information will be printed:
1997 0: DECL_NAME, demangled as necessary.
1998 1: and scope information.
1999 2: and any other information that might be interesting, such as function
2000 parameter types in C++. */
2002 extern const char *(*decl_printable_name) PROTO((tree, int));
2004 /* Pointer to function to finish handling an incomplete decl at the
2005 end of compilation. */
2007 extern void (*incomplete_decl_finalize_hook) PROTO((tree));
2009 extern char *init_parse PROTO((char *));
2010 extern void finish_parse PROTO((void));
2012 extern const char * const language_string;
2015 extern char *perm_calloc PROTO((int, long));
2016 extern tree get_file_function_name PROTO((int));
2017 extern tree get_file_function_name_long PROTO((const char *));
2018 extern tree get_set_constructor_bits PROTO((tree, char *, int));
2019 extern tree get_set_constructor_bytes PROTO((tree,
2020 unsigned char *, int));
2021 extern int get_alias_set PROTO((tree));
2022 extern int new_alias_set PROTO((void));
2023 extern int (*lang_get_alias_set) PROTO((tree));
2027 extern int in_control_zone_p PROTO((void));
2028 extern void expand_fixups PROTO((struct rtx_def *));
2029 extern tree expand_start_stmt_expr PROTO((void));
2030 extern tree expand_end_stmt_expr PROTO((tree));
2031 extern void expand_expr_stmt PROTO((tree));
2032 extern int warn_if_unused_value PROTO((tree));
2033 extern void expand_decl_init PROTO((tree));
2034 extern void clear_last_expr PROTO((void));
2035 extern void expand_label PROTO((tree));
2036 extern void expand_goto PROTO((tree));
2037 extern void expand_asm PROTO((tree));
2038 extern void expand_start_cond PROTO((tree, int));
2039 extern void expand_end_cond PROTO((void));
2040 extern void expand_start_else PROTO((void));
2041 extern void expand_start_elseif PROTO((tree));
2042 extern struct nesting *expand_start_loop PROTO((int));
2043 extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
2044 extern void expand_loop_continue_here PROTO((void));
2045 extern void expand_end_loop PROTO((void));
2046 extern int expand_continue_loop PROTO((struct nesting *));
2047 extern int expand_exit_loop PROTO((struct nesting *));
2048 extern int expand_exit_loop_if_false PROTO((struct nesting *,
2050 extern int expand_exit_something PROTO((void));
2052 extern void expand_null_return PROTO((void));
2053 extern void expand_return PROTO((tree));
2054 extern int optimize_tail_recursion PROTO((tree, struct rtx_def *));
2055 extern void expand_start_bindings PROTO((int));
2056 extern void expand_end_bindings PROTO((tree, int, int));
2057 extern void start_cleanup_deferral PROTO((void));
2058 extern void end_cleanup_deferral PROTO((void));
2059 extern void mark_block_as_eh_region PROTO((void));
2060 extern void mark_block_as_not_eh_region PROTO((void));
2061 extern int is_eh_region PROTO((void));
2062 extern int conditional_context PROTO((void));
2063 extern tree last_cleanup_this_contour PROTO((void));
2064 extern int expand_dhc_cleanup PROTO((tree));
2065 extern int expand_dcc_cleanup PROTO((tree));
2066 extern void expand_start_case PROTO((int, tree, tree,
2068 extern void expand_end_case PROTO((tree));
2069 extern int pushcase PROTO((tree,
2070 tree (*) (tree, tree),
2072 extern int pushcase_range PROTO((tree, tree,
2073 tree (*) (tree, tree),
2075 extern void using_eh_for_cleanups PROTO((void));
2076 extern int stmt_loop_nest_empty PROTO((void));
2078 /* In fold-const.c */
2080 /* Fold constants as much as possible in an expression.
2081 Returns the simplified expression.
2082 Acts only on the top level of the expression;
2083 if the argument itself cannot be simplified, its
2084 subexpressions are not changed. */
2086 extern tree fold PROTO((tree));
2088 extern int force_fit_type PROTO((tree, int));
2089 extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2090 HOST_WIDE_INT, HOST_WIDE_INT,
2091 HOST_WIDE_INT *, HOST_WIDE_INT *));
2092 extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2093 HOST_WIDE_INT *, HOST_WIDE_INT *));
2094 extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2095 HOST_WIDE_INT, HOST_WIDE_INT,
2096 HOST_WIDE_INT *, HOST_WIDE_INT *));
2097 extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2098 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2099 HOST_WIDE_INT *, int));
2100 extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2102 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
2103 extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2104 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2106 extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2107 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2109 extern int operand_equal_p PROTO((tree, tree, int));
2110 extern tree invert_truthvalue PROTO((tree));
2112 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2113 function arguments and return the new type. Return NULL_TREE if no
2114 change. Required by any language that supports variadic arguments. */
2116 extern tree (*lang_type_promotes_to) PROTO((tree));
2118 /* Interface of the DWARF2 unwind info support. */
2120 /* Decide whether we want to emit frame unwind information for the current
2121 translation unit. */
2123 extern int dwarf2out_do_frame PROTO((void));
2125 /* Generate a new label for the CFI info to refer to. */
2127 extern char *dwarf2out_cfi_label PROTO((void));
2129 /* Entry point to update the canonical frame address (CFA). */
2131 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
2133 /* Add the CFI for saving a register window. */
2135 extern void dwarf2out_window_save PROTO((char *));
2137 /* Add a CFI to update the running total of the size of arguments pushed
2140 extern void dwarf2out_args_size PROTO((char *, long));
2142 /* Entry point for saving a register to the stack. */
2144 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
2146 /* Entry point for saving the return address in the stack. */
2148 extern void dwarf2out_return_save PROTO((char *, long));
2150 /* Entry point for saving the return address in a register. */
2152 extern void dwarf2out_return_reg PROTO((char *, unsigned));
2154 /* Output a marker (i.e. a label) for the beginning of a function, before
2157 extern void dwarf2out_begin_prologue PROTO((void));
2159 /* Output a marker (i.e. a label) for the absolute end of the generated
2160 code for a function definition. */
2162 extern void dwarf2out_end_epilogue PROTO((void));
2164 /* The language front-end must define these functions. */
2166 /* Function of no arguments for initializing options. */
2167 extern void lang_init_options PROTO((void));
2169 /* Function of no arguments for initializing lexical scanning. */
2170 extern void init_lex PROTO((void));
2171 /* Function of no arguments for initializing the symbol table. */
2172 extern void init_decl_processing PROTO((void));
2174 /* Functions called with no arguments at the beginning and end or processing
2175 the input source file. */
2176 extern void lang_init PROTO((void));
2177 extern void lang_finish PROTO((void));
2179 /* Function to identify which front-end produced the output file. */
2180 extern const char *lang_identify PROTO((void));
2182 /* Called by report_error_function to print out function name.
2183 * Default may be overridden by language front-ends. */
2184 extern void (*print_error_function) PROTO((const char *));
2186 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2187 extern void copy_lang_decl PROTO((tree));
2189 /* Function called with no arguments to parse and compile the input. */
2190 extern int yyparse PROTO((void));
2191 /* Function called with option as argument
2192 to decode options starting with -f or -W or +.
2193 It should return nonzero if it handles the option. */
2194 extern int lang_decode_option PROTO((int, char **));
2196 /* Functions for processing symbol declarations. */
2197 /* Function to enter a new lexical scope.
2198 Takes one argument: always zero when called from outside the front end. */
2199 extern void pushlevel PROTO((int));
2200 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2201 Takes three arguments:
2202 KEEP -- nonzero if there were declarations in this scope.
2203 REVERSE -- reverse the order of decls before returning them.
2204 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2205 extern tree poplevel PROTO((int, int, int));
2206 /* Set the BLOCK node for the current scope level. */
2207 extern void set_block PROTO((tree));
2208 /* Function to add a decl to the current scope level.
2209 Takes one argument, a decl to add.
2210 Returns that decl, or, if the same symbol is already declared, may
2211 return a different decl for that name. */
2212 extern tree pushdecl PROTO((tree));
2213 /* Function to return the chain of decls so far in the current scope level. */
2214 extern tree getdecls PROTO((void));
2215 /* Function to return the chain of structure tags in the current scope level. */
2216 extern tree gettags PROTO((void));
2218 extern tree build_range_type PROTO((tree, tree, tree));
2220 /* Call when starting to parse a declaration:
2221 make expressions in the declaration last the length of the function.
2222 Returns an argument that should be passed to resume_momentary later. */
2223 extern int suspend_momentary PROTO((void));
2225 extern int allocation_temporary_p PROTO((void));
2227 /* Call when finished parsing a declaration:
2228 restore the treatment of node-allocation that was
2229 in effect before the suspension.
2230 YES should be the value previously returned by suspend_momentary. */
2231 extern void resume_momentary PROTO((int));
2233 /* Called after finishing a record, union or enumeral type. */
2234 extern void rest_of_type_compilation PROTO((tree, int));
2236 /* Save the current set of obstacks, but don't change them. */
2237 extern void push_obstacks_nochange PROTO((void));
2239 extern void permanent_allocation PROTO((int));
2241 extern void push_momentary PROTO((void));
2243 extern void clear_momentary PROTO((void));
2245 extern void pop_momentary PROTO((void));
2247 extern void end_temporary_allocation PROTO((void));
2249 /* Pop the obstack selection stack. */
2250 extern void pop_obstacks PROTO((void));
2253 extern int really_constant_p PROTO ((tree));
2254 extern void push_obstacks PROTO ((struct obstack *,
2256 extern void pop_momentary_nofree PROTO ((void));
2257 extern void preserve_momentary PROTO ((void));
2258 extern void saveable_allocation PROTO ((void));
2259 extern void temporary_allocation PROTO ((void));
2260 extern void resume_temporary_allocation PROTO ((void));
2261 extern tree get_file_function_name PROTO ((int));
2262 extern void set_identifier_size PROTO ((int));
2263 extern int int_fits_type_p PROTO ((tree, tree));
2264 extern int tree_log2 PROTO ((tree));
2265 extern void preserve_initializer PROTO ((void));
2266 extern void preserve_data PROTO ((void));
2267 extern int object_permanent_p PROTO ((tree));
2268 extern int type_precision PROTO ((tree));
2269 extern int simple_cst_equal PROTO ((tree, tree));
2270 extern int type_list_equal PROTO ((tree, tree));
2271 extern int chain_member PROTO ((tree, tree));
2272 extern int chain_member_purpose PROTO ((tree, tree));
2273 extern int chain_member_value PROTO ((tree, tree));
2274 extern tree listify PROTO ((tree));
2275 extern tree type_hash_lookup PROTO ((int, tree));
2276 extern void type_hash_add PROTO ((int, tree));
2277 extern int type_hash_list PROTO ((tree));
2278 extern int simple_cst_list_equal PROTO ((tree, tree));
2279 extern void debug_obstack PROTO ((char *));
2280 extern void rtl_in_current_obstack PROTO ((void));
2281 extern void rtl_in_saveable_obstack PROTO ((void));
2282 extern void init_tree_codes PROTO ((void));
2283 extern void dump_tree_statistics PROTO ((void));
2284 extern void print_obstack_statistics PROTO ((const char *,
2287 extern void print_obstack_name PROTO ((char *, FILE *, const char *));
2289 extern void expand_function_end PROTO ((char *, int, int));
2290 extern void expand_function_start PROTO ((tree, int));
2291 extern int real_onep PROTO ((tree));
2292 extern int real_twop PROTO ((tree));
2293 extern void start_identifier_warnings PROTO ((void));
2294 extern void gcc_obstack_init PROTO ((struct obstack *));
2295 extern void init_obstacks PROTO ((void));
2296 extern void obfree PROTO ((char *));
2297 extern void build_common_tree_nodes PROTO ((int));
2298 extern void build_common_tree_nodes_2 PROTO ((int));
2301 extern void setjmp_protect_args PROTO ((void));
2302 extern void setjmp_protect PROTO ((tree));
2303 extern void expand_main_function PROTO ((void));
2304 extern void mark_varargs PROTO ((void));
2305 extern void init_dummy_function_start PROTO ((void));
2306 extern void expand_dummy_function_end PROTO ((void));
2307 extern void init_function_for_compilation PROTO ((void));
2308 extern void init_function_start PROTO ((tree, char *, int));
2309 extern void assign_parms PROTO ((tree));
2310 extern void put_var_into_stack PROTO ((tree));
2311 extern void uninitialized_vars_warning PROTO ((tree));
2312 extern void setjmp_args_warning PROTO ((void));
2313 extern void mark_all_temps_used PROTO ((void));
2314 extern void init_temp_slots PROTO ((void));
2315 extern void combine_temp_slots PROTO ((void));
2316 extern void free_temp_slots PROTO ((void));
2317 extern void pop_temp_slots PROTO ((void));
2318 extern void push_temp_slots PROTO ((void));
2319 extern void preserve_temp_slots PROTO ((struct rtx_def *));
2320 extern int aggregate_value_p PROTO ((tree));
2321 extern tree reorder_blocks PROTO ((tree,
2323 extern void free_temps_for_rtl_expr PROTO ((tree));
2324 extern void instantiate_virtual_regs PROTO ((tree, struct rtx_def *));
2325 extern int max_parm_reg_num PROTO ((void));
2326 extern void push_function_context PROTO ((void));
2327 extern void pop_function_context PROTO ((void));
2328 extern void push_function_context_to PROTO ((tree));
2329 extern void pop_function_context_from PROTO ((tree));
2331 /* In print-rtl.c */
2333 extern void print_rtl PROTO ((FILE *, struct rtx_def *));
2336 /* In print-tree.c */
2337 extern void debug_tree PROTO ((tree));
2339 extern void print_node PROTO ((FILE *, const char *, tree, int));
2340 extern void print_node_brief PROTO ((FILE *, const char *, tree, int));
2341 extern void indent_to PROTO ((FILE *, int));
2345 extern void emit_queue PROTO ((void));
2346 extern int apply_args_register_offset PROTO ((int));
2347 extern struct rtx_def *expand_builtin_return_addr
2348 PROTO ((enum built_in_function, int, struct rtx_def *));
2349 extern void do_pending_stack_adjust PROTO ((void));
2350 extern struct rtx_def *expand_assignment PROTO ((tree, tree, int, int));
2351 extern struct rtx_def *store_expr PROTO ((tree, struct rtx_def *,
2353 extern void check_max_integer_computation_mode PROTO ((tree));
2356 extern void start_sequence_for_rtl_expr PROTO ((tree));
2357 extern struct rtx_def *emit_line_note_after PROTO ((char *, int,
2359 extern struct rtx_def *emit_line_note PROTO ((char *, int));
2360 extern struct rtx_def *emit_line_note_force PROTO ((char *, int));
2363 extern int mark_addressable PROTO ((tree));
2364 extern void incomplete_type_error PROTO ((tree, tree));
2367 extern void print_lang_statistics PROTO ((void));
2370 extern tree truthvalue_conversion PROTO ((tree));
2371 extern int min_precision PROTO ((tree, int));
2372 extern void split_specs_attrs PROTO ((tree, tree *, tree *));
2376 extern void print_lang_decl PROTO ((FILE *, tree, int));
2377 extern void print_lang_type PROTO ((FILE *, tree, int));
2378 extern void print_lang_identifier PROTO ((FILE *, tree, int));
2380 extern int global_bindings_p PROTO ((void));
2381 extern void insert_block PROTO ((tree));
2383 /* In integrate.c */
2384 extern void save_for_inline_nocopy PROTO ((tree));
2385 extern void save_for_inline_copying PROTO ((tree));
2386 extern void set_decl_abstract_flags PROTO ((tree, int));
2387 extern void output_inline_function PROTO ((tree));
2390 extern void set_yydebug PROTO ((int));
2392 /* In stor-layout.c */
2393 extern void fixup_signed_type PROTO ((tree));
2396 extern void make_decl_rtl PROTO ((tree, const char *, int));
2397 extern void make_decl_one_only PROTO ((tree));
2398 extern int supports_one_only PROTO ((void));
2399 extern void variable_section PROTO ((tree, int));
2401 /* In fold-const.c */
2402 extern int div_and_round_double PROTO ((enum tree_code, int,
2403 HOST_WIDE_INT, HOST_WIDE_INT,
2404 HOST_WIDE_INT, HOST_WIDE_INT,
2411 extern void emit_nop PROTO ((void));
2412 extern void expand_computed_goto PROTO ((tree));
2413 extern struct rtx_def *label_rtx PROTO ((tree));
2414 extern void expand_asm_operands PROTO ((tree, tree, tree, tree, int,
2416 extern int any_pending_cleanups PROTO ((int));
2417 extern void init_stmt PROTO ((void));
2418 extern void init_stmt_for_function PROTO ((void));
2419 extern void remember_end_note PROTO ((tree));
2420 extern int drop_through_at_end_p PROTO ((void));
2421 extern void expand_start_target_temps PROTO ((void));
2422 extern void expand_end_target_temps PROTO ((void));
2423 extern void expand_elseif PROTO ((tree));
2424 extern void expand_decl PROTO ((tree));
2425 extern int expand_decl_cleanup PROTO ((tree, tree));
2426 extern void expand_anon_union_decl PROTO ((tree, tree, tree));
2427 extern void move_cleanups_up PROTO ((void));
2428 extern void expand_start_case_dummy PROTO ((void));
2429 extern void expand_end_case_dummy PROTO ((void));
2430 extern tree case_index_expr_type PROTO ((void));
2431 extern HOST_WIDE_INT all_cases_count PROTO ((tree, int *));
2432 extern void check_for_full_enumeration_handling PROTO ((tree));
2433 extern void declare_nonlocal_label PROTO ((tree));
2435 extern void lang_print_xnode PROTO ((FILE *, tree, int));
2439 /* If KIND=='I', return a suitable global initializer (constructor) name.
2440 If KIND=='D', return a suitable global clean-up (destructor) name. */
2441 extern tree get_file_function_name PROTO((int));
2443 /* Interface of the DWARF2 unwind info support. */
2445 /* Decide whether we want to emit frame unwind information for the current
2446 translation unit. */
2448 extern int dwarf2out_do_frame PROTO((void));
2450 /* Generate a new label for the CFI info to refer to. */
2452 extern char *dwarf2out_cfi_label PROTO((void));
2454 /* Entry point to update the canonical frame address (CFA). */
2456 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
2458 /* Add the CFI for saving a register window. */
2460 extern void dwarf2out_window_save PROTO((char *));
2462 /* Add a CFI to update the running total of the size of arguments pushed
2465 extern void dwarf2out_args_size PROTO((char *, long));
2467 /* Entry point for saving a register to the stack. */
2469 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
2471 /* Entry point for saving the return address in the stack. */
2473 extern void dwarf2out_return_save PROTO((char *, long));
2475 /* Entry point for saving the return address in a register. */
2477 extern void dwarf2out_return_reg PROTO((char *, unsigned));
2479 /* Output a marker (i.e. a label) for the beginning of a function, before
2482 extern void dwarf2out_begin_prologue PROTO((void));
2484 /* Output a marker (i.e. a label) for the absolute end of the generated
2485 code for a function definition. */
2487 extern void dwarf2out_end_epilogue PROTO((void));
2489 /* Redefine abort to report an internal error w/o coredump, and
2490 reporting the location of the error in the source file. This logic
2491 is duplicated in rtl.h and tree.h because every file that needs the
2492 special abort includes one or both. toplev.h gets too few files,
2493 system.h gets too many. */
2495 extern void fancy_abort PROTO((const char *, int, const char *))
2497 #if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 7)
2498 #define abort() fancy_abort (__FILE__, __LINE__, 0)
2500 #define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__)