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 /* Classify which part of the compiler has defined a given builtin
77 /* Codes that identify the various built in functions
78 so that expand_call can identify them quickly. */
80 enum built_in_function
105 BUILT_IN_CLASSIFY_TYPE,
109 BUILT_IN_FRAME_ADDRESS,
110 BUILT_IN_RETURN_ADDRESS,
111 BUILT_IN_AGGREGATE_INCOMING_ADDRESS,
119 /* Various hooks for the DWARF 2 __throw routine. */
120 BUILT_IN_UNWIND_INIT,
122 BUILT_IN_DWARF_FP_REGNUM,
123 BUILT_IN_INIT_DWARF_REG_SIZES,
124 BUILT_IN_FROB_RETURN_ADDR,
125 BUILT_IN_EXTRACT_RETURN_ADDR,
128 BUILT_IN_VARARGS_START,
129 BUILT_IN_STDARG_START,
139 /* Upper bound on non-language-specific builtins. */
143 /* The definition of tree nodes fills the next several pages. */
145 /* A tree node can represent a data type, a variable, an expression
146 or a statement. Each node has a TREE_CODE which says what kind of
147 thing it represents. Some common codes are:
148 INTEGER_TYPE -- represents a type of integers.
149 ARRAY_TYPE -- represents a type of pointer.
150 VAR_DECL -- represents a declared variable.
151 INTEGER_CST -- represents a constant integer value.
152 PLUS_EXPR -- represents a sum (an expression).
154 As for the contents of a tree node: there are some fields
155 that all nodes share. Each TREE_CODE has various special-purpose
156 fields as well. The fields of a node are never accessed directly,
157 always through accessor macros. */
159 /* This type is used everywhere to refer to a tree node. */
161 typedef union tree_node *tree;
163 /* Every kind of tree node starts with this structure,
164 so all nodes have these fields.
166 See the accessor macros, defined below, for documentation of the fields.
168 DO NOT change the layout of tree_common unless absolutely necessary. Some
169 front-ends (namely g++) depend on the internal layout of this tructure.
170 See my_tree_cons in the cp subdir for such uglyness. Ugh. */
174 union tree_node *chain;
175 union tree_node *type;
176 #ifdef ONLY_INT_FIELDS
177 unsigned int code : 8;
179 enum tree_code code : 8;
182 unsigned side_effects_flag : 1;
183 unsigned constant_flag : 1;
184 unsigned permanent_flag : 1;
185 unsigned addressable_flag : 1;
186 unsigned volatile_flag : 1;
187 unsigned readonly_flag : 1;
188 unsigned unsigned_flag : 1;
189 unsigned asm_written_flag: 1;
191 unsigned used_flag : 1;
192 unsigned raises_flag : 1;
193 unsigned static_flag : 1;
194 unsigned public_flag : 1;
195 unsigned private_flag : 1;
196 unsigned protected_flag : 1;
198 unsigned lang_flag_0 : 1;
199 unsigned lang_flag_1 : 1;
200 unsigned lang_flag_2 : 1;
201 unsigned lang_flag_3 : 1;
202 unsigned lang_flag_4 : 1;
203 unsigned lang_flag_5 : 1;
204 unsigned lang_flag_6 : 1;
206 /* There is room for three more flags. */
209 /* The following table lists the uses of each of the above flags and
210 for which types of nodes they are defined. Note that expressions
216 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
222 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
223 TREE_NO_UNUSED_WARNING in
224 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
226 TREE_LIST or TREE_VEC
227 TREE_CONSTANT_OVERFLOW in
228 INTEGER_CST, REAL_CST, COMPLEX_CST
229 TREE_SYMBOL_REFERENCED in
235 INTEGER_CST, REAL_CST, COMPLEX_CST
237 VAR_DECL or FUNCTION_DECL
239 TREE_LIST or TREE_VEC
240 EXPR_WFL_EMIT_LINE_NOTE in
241 EXPR_WITH_FILE_LOCATION
246 TREE_LIST or TREE_VEC
248 ??? unspecified nodes
252 TREE_VIA_PROTECTED in
256 ??? unspecified nodes
265 TREE_THIS_VOLATILE in
275 VAR_DECL if iterator (C)
284 permanent_flag: TREE_PERMANENT in all nodes
289 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
290 DECL_BUILT_IN_NONANSI in
294 SAVE_EXPR_NOPLACEHOLDER in
300 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
306 expressions, IDENTIFIER_NODE
314 /* Define accessors for the fields that all tree nodes have
315 (though some fields are not used for all kinds of nodes). */
317 /* The tree-code says what kind of node it is.
318 Codes are defined in tree.def. */
319 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
320 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
322 /* When checking is enabled, errors will be generated if a tree node
323 is accessed incorrectly. The macros abort with a fatal error. */
324 #if defined ENABLE_CHECKING && (GCC_VERSION >= 2007)
326 #define TREE_CHECK(t, code) \
327 ({ const tree __t = t; \
328 if (TREE_CODE(__t) != (code)) \
329 tree_check_failed (__t, code, __FILE__, \
330 __LINE__, __PRETTY_FUNCTION__); \
332 #define TREE_CLASS_CHECK(t, class) \
333 ({ const tree __t = t; \
334 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
335 tree_class_check_failed (__t, class, __FILE__, \
336 __LINE__, __PRETTY_FUNCTION__); \
339 /* These checks have to be special cased. */
340 #define CST_OR_CONSTRUCTOR_CHECK(t) \
341 ({ const tree __t = t; \
342 enum tree_code __c = TREE_CODE(__t); \
343 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
344 tree_check_failed (__t, CONSTRUCTOR, __FILE__, \
345 __LINE__, __PRETTY_FUNCTION__); \
347 #define EXPR_CHECK(t) \
348 ({ const tree __t = t; \
349 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
350 if (__c != 'r' && __c != 's' && __c != '<' \
351 && __c != '1' && __c != '2' && __c != 'e') \
352 tree_class_check_failed(__t, 'e', __FILE__, \
353 __LINE__, __PRETTY_FUNCTION__); \
356 extern void tree_check_failed PROTO((const tree, enum tree_code,
357 const char *, int, const char *))
359 extern void tree_class_check_failed PROTO((const tree, char,
360 const char *, int, const char *))
363 #else /* not ENABLE_CHECKING, or not gcc */
365 #define TREE_CHECK(t, code) (t)
366 #define TREE_CLASS_CHECK(t, code) (t)
367 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
368 #define EXPR_CHECK(t) (t)
372 #include "tree-check.h"
374 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
375 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
376 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
378 /* In all nodes that are expressions, this is the data type of the expression.
379 In POINTER_TYPE nodes, this is the type that the pointer points to.
380 In ARRAY_TYPE nodes, this is the type of the elements. */
381 #define TREE_TYPE(NODE) ((NODE)->common.type)
383 /* Nodes are chained together for many purposes.
384 Types are chained together to record them for being output to the debugger
385 (see the function `chain_type').
386 Decls in the same scope are chained together to record the contents
388 Statement nodes for successive statements used to be chained together.
389 Often lists of things are represented by TREE_LIST nodes that
390 are chained together. */
392 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
394 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
395 that don't change the machine mode. */
397 #define STRIP_NOPS(EXP) \
398 while ((TREE_CODE (EXP) == NOP_EXPR \
399 || TREE_CODE (EXP) == CONVERT_EXPR \
400 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
401 && (TYPE_MODE (TREE_TYPE (EXP)) \
402 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
403 (EXP) = TREE_OPERAND (EXP, 0);
405 /* Like STRIP_NOPS, but don't let the signedness change either. */
407 #define STRIP_SIGN_NOPS(EXP) \
408 while ((TREE_CODE (EXP) == NOP_EXPR \
409 || TREE_CODE (EXP) == CONVERT_EXPR \
410 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
411 && (TYPE_MODE (TREE_TYPE (EXP)) \
412 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
413 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
414 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
415 (EXP) = TREE_OPERAND (EXP, 0);
417 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
419 #define STRIP_TYPE_NOPS(EXP) \
420 while ((TREE_CODE (EXP) == NOP_EXPR \
421 || TREE_CODE (EXP) == CONVERT_EXPR \
422 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
423 && (TREE_TYPE (EXP) \
424 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
425 (EXP) = TREE_OPERAND (EXP, 0);
427 /* Nonzero if TYPE represents an integral type. Note that we do not
428 include COMPLEX types here. */
430 #define INTEGRAL_TYPE_P(TYPE) \
431 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
432 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
434 /* Nonzero if TYPE represents a floating-point type, including complex
435 floating-point types. */
437 #define FLOAT_TYPE_P(TYPE) \
438 (TREE_CODE (TYPE) == REAL_TYPE \
439 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
440 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
442 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
444 #define AGGREGATE_TYPE_P(TYPE) \
445 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
446 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
447 || TREE_CODE (TYPE) == SET_TYPE)
449 /* Nonzero if TYPE represents a pointer type. */
451 #define POINTER_TYPE_P(TYPE) \
452 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
454 /* Nonzero if TYPE represents a type. */
456 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
458 /* Define many boolean fields that all tree nodes have. */
460 /* In VAR_DECL nodes, nonzero means address of this is needed.
461 So it cannot be in a register.
462 In a FUNCTION_DECL, nonzero means its address is needed.
463 So it must be compiled even if it is an inline function.
464 In CONSTRUCTOR nodes, it means object constructed must be in memory.
465 In LABEL_DECL nodes, it means a goto for this label has been seen
466 from a place outside all binding contours that restore stack levels.
467 In ..._TYPE nodes, it means that objects of this type must
468 be fully addressable. This means that pieces of this
469 object cannot go into register parameters, for example.
470 In IDENTIFIER_NODEs, this means that some extern decl for this name
471 had its address taken. That matters for inline functions. */
472 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
474 /* In a VAR_DECL, nonzero means allocate static storage.
475 In a FUNCTION_DECL, nonzero if function has been defined.
476 In a CONSTRUCTOR, nonzero means allocate static storage. */
477 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
479 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
480 made implicitly and should not lead to an "unused value" warning. */
481 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
483 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
484 chain is via a `virtual' declaration. */
485 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
487 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
488 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
489 requires a diagnostic when overflows occur in constant expressions. */
490 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
492 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
493 this string as an argument. */
494 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
496 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
497 overflow in folding, and no warning has been issued for this subexpression.
498 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
499 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
501 /* In a VAR_DECL or FUNCTION_DECL,
502 nonzero means name is to be accessible from outside this module.
503 In an identifier node, nonzero means an external declaration
504 accessible from outside this module was previously seen
505 for this name in an inner scope. */
506 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
508 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
509 base class is via a `public' declaration, which preserves public
510 fields from the base class as public. */
511 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
513 /* Ditto, for `private' declarations. */
514 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
516 /* Nonzero for TREE_LIST node means that the path to the
517 base class is via a `protected' declaration, which preserves
518 protected fields from the base class as protected.
520 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
522 /* In any expression, nonzero means it has side effects or reevaluation
523 of the whole expression could produce a different value.
524 This is set if any subexpression is a function call, a side effect
525 or a reference to a volatile variable.
526 In a ..._DECL, this is set only if the declaration said `volatile'. */
527 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
529 /* Nonzero means this expression is volatile in the C sense:
530 its address should be of type `volatile WHATEVER *'.
531 In other words, the declared item is volatile qualified.
532 This is used in _DECL nodes and _REF nodes.
534 In a ..._TYPE node, means this type is volatile-qualified.
535 But use TYPE_VOLATILE instead of this macro when the node is a type,
536 because eventually we may make that a different bit.
538 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
539 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
541 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
542 nonzero means it may not be the lhs of an assignment.
543 In a ..._TYPE node, means this type is const-qualified
544 (but the macro TYPE_READONLY should be used instead of this macro
545 when the node is a type). */
546 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
548 /* Value of expression is constant.
549 Always appears in all ..._CST nodes.
550 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
551 if the value is constant. */
552 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
554 /* Nonzero means permanent node;
555 node will continue to exist for the entire compiler run.
556 Otherwise it will be recycled at the end of the function. */
557 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
559 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
560 In FIELD_DECL nodes, means an unsigned bit field.
561 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
562 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
564 /* Nonzero in a VAR_DECL means assembler code has been written.
565 Nonzero in a FUNCTION_DECL means that the function has been compiled.
566 This is interesting in an inline function, since it might not need
567 to be compiled separately.
568 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
569 if the sdb debugging info for the type has been written.
570 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
571 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
573 /* Nonzero in a _DECL if the name is used in its scope.
574 Nonzero in an expr node means inhibit warning if value is unused.
575 In IDENTIFIER_NODEs, this means that some extern decl for this name
577 #define TREE_USED(NODE) ((NODE)->common.used_flag)
579 /* Nonzero for a tree node whose evaluation could result
580 in the raising of an exception. Not implemented yet. */
581 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
583 /* Used in classes in C++. */
584 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
585 /* Used in classes in C++.
586 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
587 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
589 /* These flags are available for each language front end to use internally. */
590 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
591 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
592 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
593 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
594 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
595 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
596 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
598 /* Define additional fields and accessors for nodes representing constants. */
600 /* In an INTEGER_CST node. These two together make a 2-word integer.
601 If the data type is signed, the value is sign-extended to 2 words
602 even though not all of them may really be in use.
603 In an unsigned constant shorter than 2 words, the extra bits are 0. */
604 #define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
605 #define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
607 #define INT_CST_LT(A, B) \
608 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
609 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
610 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
611 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
613 #define INT_CST_LT_UNSIGNED(A, B) \
614 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
615 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
616 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
617 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
618 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
619 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
623 char common[sizeof (struct tree_common)];
624 struct rtx_def *rtl; /* acts as link to register transfer language
626 HOST_WIDE_INT int_cst_low;
627 HOST_WIDE_INT int_cst_high;
630 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
631 and generally in all kinds of constants that could
632 be given labels (rather than being immediate). */
634 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
636 /* In a REAL_CST node. */
637 /* We can represent a real value as either a `double' or a string.
638 Strings don't allow for any optimization, but they do allow
639 for cross-compilation. */
641 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
647 char common[sizeof (struct tree_common)];
648 struct rtx_def *rtl; /* acts as link to register transfer language
650 REAL_VALUE_TYPE real_cst;
653 /* In a STRING_CST */
654 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
655 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
659 char common[sizeof (struct tree_common)];
660 struct rtx_def *rtl; /* acts as link to register transfer language
666 /* In a COMPLEX_CST node. */
667 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
668 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
672 char common[sizeof (struct tree_common)];
673 struct rtx_def *rtl; /* acts as link to register transfer language
675 union tree_node *real;
676 union tree_node *imag;
679 /* Define fields and accessors for some special-purpose tree nodes. */
681 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
682 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
684 struct tree_identifier
686 char common[sizeof (struct tree_common)];
691 /* In a TREE_LIST node. */
692 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
693 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
697 char common[sizeof (struct tree_common)];
698 union tree_node *purpose;
699 union tree_node *value;
702 /* In a TREE_VEC node. */
703 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
704 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
705 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
709 char common[sizeof (struct tree_common)];
711 union tree_node *a[1];
714 /* Define fields and accessors for some nodes that represent expressions. */
716 /* In a SAVE_EXPR node. */
717 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
718 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
719 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
720 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
721 both in normal code and in a handler. (Normally, in a handler, all
722 SAVE_EXPRs are unsaved, meaning that there values are
724 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
726 /* In a RTL_EXPR node. */
727 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
728 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
730 /* In a CALL_EXPR node. */
731 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
733 /* In a CONSTRUCTOR node. */
734 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
736 /* In ordinary expression nodes. */
737 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
738 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
740 /* In a LABELED_BLOCK_EXPR node. */
741 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
742 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
744 /* In a EXIT_BLOCK_EXPR node. */
745 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
746 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
748 /* In a LOOP_EXPR node. */
749 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
751 /* In a EXPR_WITH_FILE_LOCATION node. */
752 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
753 #define EXPR_WFL_FILENAME(NODE) \
754 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
755 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
756 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
757 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
758 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
759 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
760 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
761 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
765 char common[sizeof (struct tree_common)];
767 union tree_node *operands[1];
770 /* In a BLOCK node. */
771 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
772 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
773 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
774 /* Note: when changing this, make sure to find the places
775 that use chainon or nreverse. */
776 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
777 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
778 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
780 /* Nonzero means that this block is prepared to handle exceptions
781 listed in the BLOCK_VARS slot. */
782 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
786 char common[sizeof (struct tree_common)];
788 unsigned handler_block_flag : 1;
789 unsigned abstract_flag : 1;
791 union tree_node *vars;
792 union tree_node *subblocks;
793 union tree_node *supercontext;
794 union tree_node *abstract_origin;
797 /* Define fields and accessors for nodes representing data types. */
799 /* See tree.def for documentation of the use of these fields.
800 Look at the documentation of the various ..._TYPE tree codes. */
802 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
803 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
804 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
805 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
806 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
807 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
808 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
809 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
810 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
811 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
812 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
813 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
814 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
815 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
816 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
817 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
818 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
819 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
820 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
821 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
822 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
823 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
824 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
825 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
826 #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
827 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
829 /* For aggregate types, information about this type, as a base type
830 for itself. Used in a language-dependent way for types that are
831 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
832 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
834 /* The (language-specific) typed-based alias set for this type.
835 Objects whose TYPE_ALIAS_SETs are different cannot alias each
836 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
837 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
838 type can alias objects of any type. */
839 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
841 /* Nonzero iff the typed-based alias set for this type has been
843 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
844 (TYPE_CHECK (NODE)->type.alias_set != -1)
846 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
848 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
850 /* The alignment necessary for objects of this type.
851 The value is an int, measured in bits. */
852 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
854 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
856 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
857 has BLKmode only because it lacks the alignment requirement for
859 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
861 /* Nonzero in a type considered volatile as a whole. */
862 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
864 /* Means this type is const-qualified. */
865 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
867 /* If nonzero, this type is `restrict'-qualified, in the C sense of
869 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
871 /* There is a TYPE_QUAL value for each type qualifier. They can be
872 combined by bitwise-or to form the complete set of qualifiers for a
875 #define TYPE_UNQUALIFIED 0x0
876 #define TYPE_QUAL_CONST 0x1
877 #define TYPE_QUAL_VOLATILE 0x2
878 #define TYPE_QUAL_RESTRICT 0x4
880 /* The set of type qualifiers for this type. */
881 #define TYPE_QUALS(NODE) \
882 ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) \
883 | (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) \
884 | (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT))
886 /* These flags are available for each language front end to use internally. */
887 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
888 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
889 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
890 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
891 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
892 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
893 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
895 /* If set in an ARRAY_TYPE, indicates a string type (for languages
896 that distinguish string from array of char).
897 If set in a SET_TYPE, indicates a bitstring type. */
898 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
900 /* If non-NULL, this is a upper bound of the size (in bytes) of an
901 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
902 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
904 /* Indicates that objects of this type must be initialized by calling a
905 function when they are created. */
906 #define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
908 /* Indicates that objects of this type (a UNION_TYPE), should be passed
909 the same way that the first union alternative would be passed. */
910 #define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
912 /* Indicated that objects of this type should be laid out in as
913 compact a way as possible. */
914 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
918 char common[sizeof (struct tree_common)];
919 union tree_node *values;
920 union tree_node *size;
921 union tree_node *size_unit;
922 union tree_node *attributes;
925 unsigned char precision;
926 #ifdef ONLY_INT_FIELDS
929 enum machine_mode mode : 8;
932 unsigned string_flag : 1;
933 unsigned no_force_blk_flag : 1;
934 unsigned needs_constructing_flag : 1;
935 unsigned transparent_union_flag : 1;
936 unsigned packed_flag : 1;
937 unsigned restrict_flag : 1;
939 unsigned lang_flag_0 : 1;
940 unsigned lang_flag_1 : 1;
941 unsigned lang_flag_2 : 1;
942 unsigned lang_flag_3 : 1;
943 unsigned lang_flag_4 : 1;
944 unsigned lang_flag_5 : 1;
945 unsigned lang_flag_6 : 1;
946 /* room for 3 more bits */
949 union tree_node *pointer_to;
950 union tree_node *reference_to;
951 union {int address; char *pointer; } symtab;
952 union tree_node *name;
953 union tree_node *minval;
954 union tree_node *maxval;
955 union tree_node *next_variant;
956 union tree_node *main_variant;
957 union tree_node *binfo;
958 union tree_node *noncopied_parts;
959 union tree_node *context;
960 struct obstack *obstack;
962 /* Points to a structure whose details depend on the language in use. */
963 struct lang_type *lang_specific;
966 /* Define accessor macros for information about type inheritance
969 A "basetype" means a particular usage of a data type for inheritance
970 in another type. Each such basetype usage has its own "binfo"
971 object to describe it. The binfo object is a TREE_VEC node.
973 Inheritance is represented by the binfo nodes allocated for a
974 given type. For example, given types C and D, such that D is
975 inherited by C, 3 binfo nodes will be allocated: one for describing
976 the binfo properties of C, similarly one for D, and one for
977 describing the binfo properties of D as a base type for C.
978 Thus, given a pointer to class C, one can get a pointer to the binfo
979 of D acting as a basetype for C by looking at C's binfo's basetypes. */
981 /* The actual data type node being inherited in this basetype. */
982 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
984 /* The offset where this basetype appears in its containing type.
985 BINFO_OFFSET slot holds the offset (in bytes)
986 from the base of the complete object to the base of the part of the
987 object that is allocated on behalf of this `type'.
988 This is always 0 except when there is multiple inheritance. */
990 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
991 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
992 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
994 /* The virtual function table belonging to this basetype. Virtual
995 function tables provide a mechanism for run-time method dispatching.
996 The entries of a virtual function table are language-dependent. */
998 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
999 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1001 /* The virtual functions in the virtual function table. This is
1002 a TREE_LIST that is used as an initial approximation for building
1003 a virtual function table for this basetype. */
1004 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1005 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1007 /* A vector of additional binfos for the types inherited by this basetype.
1009 If this basetype describes type D as inherited in C,
1010 and if the basetypes of D are E anf F,
1011 then this vector contains binfos for inheritance of E and F by C.
1013 ??? This could probably be done by just allocating the
1014 base types at the end of this TREE_VEC (instead of using
1015 another TREE_VEC). This would simplify the calculation
1016 of how many basetypes a given type had. */
1017 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1018 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1020 /* Accessor macro to get to the Nth basetype of this basetype. */
1021 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1022 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1024 /* For a BINFO record describing an inheritance, this yields a pointer
1025 to the artificial FIELD_DECL node which contains the "virtual base
1026 class pointer" for the given inheritance. */
1027 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1029 /* The size of a base class subobject of this type. Not all frontends
1030 currently allocate the space for this field. */
1031 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1032 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1034 /* Slot used to build a chain that represents a use of inheritance.
1035 For example, if X is derived from Y, and Y is derived from Z,
1036 then this field can be used to link the binfo node for X to
1037 the binfo node for X's Y to represent the use of inheritance
1038 from X to Y. Similarly, this slot of the binfo node for X's Y
1039 can point to the Z from which Y is inherited (in X's inheritance
1040 hierarchy). In this fashion, one can represent and traverse specific
1041 uses of inheritance using the binfo nodes themselves (instead of
1042 consing new space pointing to binfo nodes).
1043 It is up to the language-dependent front-ends to maintain
1044 this information as necessary. */
1045 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1047 /* Define fields and accessors for nodes representing declared names. */
1049 /* Nonzero if DECL represents a decl. */
1050 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1051 /* This is the name of the object as written by the user.
1052 It is an IDENTIFIER_NODE. */
1053 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1054 /* This is the name of the object as the assembler will see it
1055 (but before any translations made by ASM_OUTPUT_LABELREF).
1056 Often this is the same as DECL_NAME.
1057 It is an IDENTIFIER_NODE. */
1058 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1059 /* Records the section name in a section attribute. Used to pass
1060 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1061 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1062 /* For FIELD_DECLs, this is the
1063 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1064 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1065 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1066 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1067 type, or NULL_TREE if the given decl has "file scope". */
1068 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1069 #define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1070 /* In a DECL this is the field where configuration dependent machine
1071 attributes are store */
1072 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1073 /* In a FIELD_DECL, this is the field position, counting in bits,
1074 of the bit closest to the beginning of the structure. */
1075 #define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1076 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1077 if so, the type that was originally specified for it.
1078 TREE_TYPE may have been modified (in finish_struct). */
1079 #define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1080 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1081 /* VAR_DECL and PARM_DECL reserve the arguments slot
1082 for language-specific uses. */
1083 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1084 /* In FUNCTION_DECL, holds the decl for the return value. */
1085 #define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result)
1086 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1087 #define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1088 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1089 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result)
1090 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1091 For a VAR_DECL, holds the initial value.
1092 For a PARM_DECL, not used--default
1093 values for parameters are encoded in the type of the function,
1094 not in the PARM_DECL slot. */
1095 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1096 /* For a PARM_DECL, records the data type used to pass the argument,
1097 which may be different from the type seen in the program. */
1098 #define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial) /* In PARM_DECL. */
1099 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1100 if nonzero, indicates that the field occupies the type. */
1101 #define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial)
1102 /* These two fields describe where in the source code the declaration was. */
1103 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1104 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1105 /* Holds the size of the datum, as a tree expression.
1106 Need not be constant. */
1107 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1108 /* Holds the alignment required for the datum. */
1109 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.frame_size.u)
1110 /* Holds the machine mode corresponding to the declaration of a variable or
1111 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1113 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1114 /* Holds the RTL expression for the value of a variable or function. If
1115 PROMOTED_MODE is defined, the mode of this expression may not be same
1116 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1117 to the variable's data type, while the mode
1118 of DECL_RTL is the mode actually used to contain the data. */
1119 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1120 /* Holds an INSN_LIST of all of the live ranges in which the variable
1121 has been moved to a possibly different register. */
1122 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1123 /* For PARM_DECL, holds an RTL for the stack slot or register
1124 where the data was actually passed. */
1125 #define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r)
1126 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1127 #define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.saved_insns.f)
1128 /* For FUNCTION_DECL, if it is inline,
1129 holds the size of the stack frame, as an integer. */
1130 #define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.frame_size.i)
1131 /* For FUNCTION_DECL, if it is built-in,
1132 this identifies which built-in operation it is. */
1133 #define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.frame_size.f.code)
1134 #define DECL_SET_FUNCTION_CODE(NODE,VAL) (DECL_CHECK (NODE)->decl.frame_size.f.code = (VAL))
1135 /* For a FIELD_DECL, holds the size of the member as an integer. */
1136 #define DECL_FIELD_SIZE(NODE) (DECL_CHECK (NODE)->decl.saved_insns.i)
1138 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1139 Before the struct containing the FUNCTION_DECL is laid out,
1140 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1141 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1142 function. When the class is laid out, this pointer is changed
1143 to an INTEGER_CST node which is suitable for use as an index
1144 into the virtual function table. */
1145 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1146 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1147 which this FIELD_DECL is defined. This information is needed when
1148 writing debugging information about vfield and vbase decls for C++. */
1149 #define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex)
1151 /* Every ..._DECL node gets a unique number. */
1152 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1154 /* For any sort of a ..._DECL node, this points to the original (abstract)
1155 decl node which this decl is an instance of, or else it is NULL indicating
1156 that this decl is not an instance of some other decl. For example,
1157 in a nested declaration of an inline function, this points back to the
1159 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1161 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1162 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1163 #define DECL_ORIGIN(NODE) \
1164 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1166 /* Nonzero for any sort of ..._DECL node means this decl node represents
1167 an inline instance of some original (abstract) decl from an inline function;
1168 suppress any warnings about shadowing some other variable. */
1169 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
1171 /* Nonzero if a _DECL means that the name of this decl should be ignored
1172 for symbolic debug purposes. */
1173 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1175 /* Nonzero for a given ..._DECL node means that this node represents an
1176 "abstract instance" of the given declaration (e.g. in the original
1177 declaration of an inline function). When generating symbolic debugging
1178 information, we mustn't try to generate any address information for nodes
1179 marked as "abstract instances" because we don't actually generate
1180 any code or allocate any data space for such instances. */
1181 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1183 /* Nonzero if a _DECL means that no warnings should be generated just
1184 because this decl is unused. */
1185 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1187 /* Nonzero for a given ..._DECL node means that this node should be
1188 put in .common, if possible. If a DECL_INITIAL is given, and it
1189 is not error_mark_node, then the decl cannot be put in .common. */
1190 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1192 /* Language-specific decl information. */
1193 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1195 /* In a VAR_DECL or FUNCTION_DECL,
1196 nonzero means external reference:
1197 do not allocate storage, and refer to a definition elsewhere. */
1198 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1200 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1202 #define DEFAULT_INIT_PRIORITY 65535
1203 #define MAX_INIT_PRIORITY 65535
1204 #define MAX_RESERVED_INIT_PRIORITY 100
1207 nonzero means the detail info about this type is not dumped into stabs.
1208 Instead it will generate cross reference ('x') of names.
1209 This uses the same flag as DECL_EXTERNAL. */
1210 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1213 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1214 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1215 /* In LABEL_DECL nodes, nonzero means that an error message about
1216 jumping into such a binding contour has been printed for this label. */
1217 #define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1218 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1219 #define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1220 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1221 static chain is not needed. */
1222 #define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1224 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1225 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1227 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1229 Also set in some languages for variables, etc., outside the normal
1230 lexical scope, such as class instance variables. */
1231 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1233 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1234 where it is called. */
1235 #define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1237 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1238 that is not specified by ansi C and that users are supposed to be allowed
1239 to redefine for any purpose whatever. */
1240 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1242 /* Nonzero in a FUNCTION_DECL means this function should be treated
1243 as if it were a malloc, meaning it returns a pointer that is
1245 #define DECL_IS_MALLOC(NODE) (DECL_CHECK (NODE)->decl.malloc_flag)
1247 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1249 #define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1250 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1251 contour that restored a stack level and which is now exited. */
1252 #define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1254 /* In a FUNCTION_DECL, nonzero means a built in function. */
1255 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1256 /* For a builtin function, identify which part of the compiler defined it. */
1257 #define DECL_BUILT_IN_CLASS(NODE) (DECL_CHECK (NODE)->decl.frame_size.f.bclass)
1259 /* In a VAR_DECL that's static,
1260 nonzero if the space is in the text section. */
1261 #define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1263 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1264 Used in FIELD_DECLs for vtable pointers.
1265 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1266 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1268 /* Used to indicate that the linkage status of this DECL is not yet known,
1269 so it should not be output now. */
1270 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1272 /* Used in PARM_DECLs whose type are unions to indicate that the
1273 argument should be passed in the same way that the first union
1274 alternative would be passed. */
1275 #define DECL_TRANSPARENT_UNION(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1277 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1278 at the beginning or end of execution. */
1279 #define DECL_STATIC_CONSTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_ctor_flag)
1280 #define DECL_STATIC_DESTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_dtor_flag)
1282 /* Used to indicate that this DECL represents a compiler-generated entity. */
1283 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1285 /* Used to indicate that this DECL has weak linkage. */
1286 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1288 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1289 multiple translation units should be merged. */
1290 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1292 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1293 not be put out unless it is needed in this translation unit.
1294 Entities like this are shared across translation units (like weak
1295 entities), but are guaranteed to be generated by any translation
1296 unit that needs them, and therefore need not be put out anywhere
1297 where they are not needed. DECL_COMDAT is just a hint to the
1298 back-end; it is up to front-ends which set this flag to ensure
1299 that there will never be any harm, other than bloat, in putting out
1300 something which is DECL_COMDAT. */
1301 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1303 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1304 be instrumented with calls to support routines. */
1305 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) ((NODE)->decl.no_instrument_function_entry_exit)
1307 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1308 disabled in this function. */
1309 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) ((NODE)->decl.no_check_memory_usage)
1311 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1312 disabled in this function. */
1313 #define DECL_NO_LIMIT_STACK(NODE) ((NODE)->decl.no_limit_stack)
1315 /* Additional flags for language-specific uses. */
1316 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1317 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1318 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1319 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1320 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1321 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1322 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1323 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1325 /* Used to indicate that the pointer to this DECL cannot be treated as
1326 an address constant. */
1327 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1329 /* Used to indicate an alias set for the memory pointed to by this
1330 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1331 pointer (or reference) type. */
1332 #define DECL_POINTER_ALIAS_SET(NODE) \
1333 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1335 /* Nonzero if an alias set has been assigned to this declaration. */
1336 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1337 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1341 char common[sizeof (struct tree_common)];
1345 union tree_node *size;
1346 #ifdef ONLY_INT_FIELDS
1349 enum machine_mode mode : 8;
1352 unsigned external_flag : 1;
1353 unsigned nonlocal_flag : 1;
1354 unsigned regdecl_flag : 1;
1355 unsigned inline_flag : 1;
1356 unsigned bit_field_flag : 1;
1357 unsigned virtual_flag : 1;
1358 unsigned ignored_flag : 1;
1359 unsigned abstract_flag : 1;
1361 unsigned in_system_header_flag : 1;
1362 unsigned common_flag : 1;
1363 unsigned defer_output : 1;
1364 unsigned transparent_union : 1;
1365 unsigned static_ctor_flag : 1;
1366 unsigned static_dtor_flag : 1;
1367 unsigned artificial_flag : 1;
1368 unsigned weak_flag : 1;
1370 unsigned lang_flag_0 : 1;
1371 unsigned lang_flag_1 : 1;
1372 unsigned lang_flag_2 : 1;
1373 unsigned lang_flag_3 : 1;
1374 unsigned lang_flag_4 : 1;
1375 unsigned lang_flag_5 : 1;
1376 unsigned lang_flag_6 : 1;
1377 unsigned lang_flag_7 : 1;
1379 unsigned non_addr_const_p : 1;
1380 unsigned no_instrument_function_entry_exit : 1;
1381 unsigned no_check_memory_usage : 1;
1382 unsigned comdat_flag : 1;
1383 unsigned malloc_flag : 1;
1384 unsigned no_limit_stack : 1;
1386 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1387 If built-in, this is the code for which built-in function.
1388 For other kinds of decls, this is DECL_ALIGN. */
1394 unsigned int code:24;
1395 unsigned int bclass:8;
1399 union tree_node *name;
1400 union tree_node *context;
1401 union tree_node *arguments;
1402 union tree_node *result;
1403 union tree_node *initial;
1404 union tree_node *abstract_origin;
1405 union tree_node *assembler_name;
1406 union tree_node *section_name;
1407 union tree_node *machine_attributes;
1408 struct rtx_def *rtl; /* acts as link to register transfer language
1410 struct rtx_def *live_range_rtl;
1411 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1412 on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */
1418 union tree_node *vindex;
1419 int pointer_alias_set;
1420 /* Points to a structure whose details depend on the language in use. */
1421 struct lang_decl *lang_specific;
1424 /* Define the overall contents of a tree node.
1425 It may be any of the structures declared above
1426 for various types of node. */
1430 struct tree_common common;
1431 struct tree_int_cst int_cst;
1432 struct tree_real_cst real_cst;
1433 struct tree_string string;
1434 struct tree_complex complex;
1435 struct tree_identifier identifier;
1436 struct tree_decl decl;
1437 struct tree_type type;
1438 struct tree_list list;
1439 struct tree_vec vec;
1440 struct tree_exp exp;
1441 struct tree_block block;
1444 /* Standard named or nameless data types of the C compiler. */
1462 TI_SIGNED_CHAR_TYPE,
1463 TI_UNSIGNED_CHAR_TYPE,
1466 TI_SHORT_INTEGER_TYPE,
1467 TI_SHORT_UNSIGNED_TYPE,
1468 TI_LONG_INTEGER_TYPE,
1469 TI_LONG_UNSIGNED_TYPE,
1470 TI_LONG_LONG_INTEGER_TYPE,
1471 TI_LONG_LONG_UNSIGNED_TYPE,
1480 TI_COMPLEX_INTEGER_TYPE,
1481 TI_COMPLEX_FLOAT_TYPE,
1482 TI_COMPLEX_DOUBLE_TYPE,
1483 TI_COMPLEX_LONG_DOUBLE_TYPE,
1487 TI_LONG_DOUBLE_TYPE,
1498 extern tree global_trees[TI_MAX];
1500 #define error_mark_node global_trees[TI_ERROR_MARK]
1502 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1503 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1504 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1505 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1506 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1508 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1509 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1510 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1511 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1512 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1514 #define char_type_node global_trees[TI_CHAR_TYPE]
1515 #define signed_char_type_node global_trees[TI_SIGNED_CHAR_TYPE]
1516 #define unsigned_char_type_node global_trees[TI_UNSIGNED_CHAR_TYPE]
1517 #define short_integer_type_node global_trees[TI_SHORT_INTEGER_TYPE]
1518 #define short_unsigned_type_node global_trees[TI_SHORT_UNSIGNED_TYPE]
1519 #define integer_type_node global_trees[TI_INTEGER_TYPE]
1520 #define unsigned_type_node global_trees[TI_UNSIGNED_TYPE]
1521 #define long_integer_type_node global_trees[TI_LONG_INTEGER_TYPE]
1522 #define long_unsigned_type_node global_trees[TI_LONG_UNSIGNED_TYPE]
1523 #define long_long_integer_type_node global_trees[TI_LONG_LONG_INTEGER_TYPE]
1524 #define long_long_unsigned_type_node global_trees[TI_LONG_LONG_UNSIGNED_TYPE]
1526 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1527 #define integer_one_node global_trees[TI_INTEGER_ONE]
1528 #define size_zero_node global_trees[TI_SIZE_ZERO]
1529 #define size_one_node global_trees[TI_SIZE_ONE]
1530 #define null_pointer_node global_trees[TI_NULL_POINTER]
1532 #define float_type_node global_trees[TI_FLOAT_TYPE]
1533 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1534 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1536 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1537 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1538 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1539 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1541 #define void_type_node global_trees[TI_VOID_TYPE]
1542 #define ptr_type_node global_trees[TI_PTR_TYPE]
1543 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1544 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1545 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1547 #define NULL_TREE (tree) NULL
1549 /* The following functions accept a wide integer argument. Rather than
1550 having to cast on every function call, we use a macro instead, that is
1551 defined here and in rtl.h. */
1554 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1555 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1557 extern int exact_log2_wide PROTO((unsigned HOST_WIDE_INT));
1558 extern int floor_log2_wide PROTO((unsigned HOST_WIDE_INT));
1560 extern char *oballoc PROTO((int));
1561 extern char *permalloc PROTO((int));
1562 extern char *savealloc PROTO((int));
1563 extern char *expralloc PROTO((int));
1565 /* Lowest level primitive for allocating a node.
1566 The TREE_CODE is the only argument. Contents are initialized
1567 to zero except for a few of the common fields. */
1569 extern tree make_node PROTO((enum tree_code));
1570 extern tree make_lang_type PROTO((enum tree_code));
1571 extern tree (*make_lang_type_fn) PROTO((enum tree_code));
1573 /* Make a copy of a node, with all the same contents except
1574 for TREE_PERMANENT. (The copy is permanent
1575 iff nodes being made now are permanent.) */
1577 extern tree copy_node PROTO((tree));
1579 /* Make a copy of a chain of TREE_LIST nodes. */
1581 extern tree copy_list PROTO((tree));
1583 /* Make a TREE_VEC. */
1585 extern tree make_tree_vec PROTO((int));
1587 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1588 The name is supplied as a char *. */
1590 extern tree get_identifier PROTO((const char *));
1592 /* If an identifier with the name TEXT (a null-terminated string) has
1593 previously been referred to, return that node; otherwise return
1596 extern tree maybe_get_identifier PROTO((const char *));
1598 /* Construct various types of nodes. */
1600 #define build_int_2(LO,HI) \
1601 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1603 extern tree build PVPROTO((enum tree_code, tree, ...));
1604 extern tree build_nt PVPROTO((enum tree_code, ...));
1605 extern tree build_parse_node PVPROTO((enum tree_code, ...));
1607 extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1608 extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1609 extern tree build_real_from_int_cst PROTO((tree, tree));
1610 extern tree build_complex PROTO((tree, tree, tree));
1611 extern tree build_string PROTO((int, const char *));
1612 extern tree build1 PROTO((enum tree_code, tree, tree));
1613 extern tree build_tree_list PROTO((tree, tree));
1614 extern tree build_decl_list PROTO((tree, tree));
1615 extern tree build_expr_list PROTO((tree, tree));
1616 extern tree build_decl PROTO((enum tree_code, tree, tree));
1617 extern tree build_block PROTO((tree, tree, tree, tree, tree));
1618 extern tree build_expr_wfl PROTO((tree, const char *, int, int));
1620 /* Construct various nodes representing data types. */
1622 extern tree make_signed_type PROTO((int));
1623 extern tree make_unsigned_type PROTO((int));
1624 extern void set_sizetype PROTO((tree));
1625 extern tree signed_or_unsigned_type PROTO((int, tree));
1626 extern void fixup_unsigned_type PROTO((tree));
1627 extern tree build_pointer_type PROTO((tree));
1628 extern tree build_reference_type PROTO((tree));
1629 extern tree build_index_type PROTO((tree));
1630 extern tree build_index_2_type PROTO((tree, tree));
1631 extern tree build_array_type PROTO((tree, tree));
1632 extern tree build_function_type PROTO((tree, tree));
1633 extern tree build_method_type PROTO((tree, tree));
1634 extern tree build_offset_type PROTO((tree, tree));
1635 extern tree build_complex_type PROTO((tree));
1636 extern tree array_type_nelts PROTO((tree));
1638 extern tree value_member PROTO((tree, tree));
1639 extern tree purpose_member PROTO((tree, tree));
1640 extern tree binfo_member PROTO((tree, tree));
1641 extern int attribute_hash_list PROTO((tree));
1642 extern int attribute_list_equal PROTO((tree, tree));
1643 extern int attribute_list_contained PROTO((tree, tree));
1644 extern int tree_int_cst_equal PROTO((tree, tree));
1645 extern int tree_int_cst_lt PROTO((tree, tree));
1646 extern int tree_int_cst_sgn PROTO((tree));
1647 extern int index_type_equal PROTO((tree, tree));
1648 extern tree get_inner_array_type PROTO((tree));
1650 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1651 put the prototype here. Rtl.h does declare the prototype if
1652 tree.h had been included. */
1654 extern tree make_tree PROTO((tree, struct rtx_def *));
1656 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1659 Such modified types already made are recorded so that duplicates
1662 extern tree build_type_attribute_variant PROTO((tree, tree));
1663 extern tree build_decl_attribute_variant PROTO((tree, tree));
1665 extern tree merge_machine_decl_attributes PROTO((tree, tree));
1666 extern tree merge_machine_type_attributes PROTO((tree, tree));
1668 /* Split a list of declspecs and attributes into two. */
1670 extern void split_specs_attrs PROTO((tree, tree *, tree *));
1672 /* Strip attributes from a list of combined specs and attrs. */
1674 extern tree strip_attrs PROTO((tree));
1676 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1678 extern int valid_machine_attribute PROTO((tree, tree, tree, tree));
1680 /* Given a tree node and a string, return non-zero if the tree node is
1681 a valid attribute name for the string. */
1683 extern int is_attribute_p PROTO((const char *, tree));
1685 /* Given an attribute name and a list of attributes, return the list element
1686 of the attribute or NULL_TREE if not found. */
1688 extern tree lookup_attribute PROTO((const char *, tree));
1690 /* Given two attributes lists, return a list of their union. */
1692 extern tree merge_attributes PROTO((tree, tree));
1694 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
1695 the same kind of data as TYPE describes. Variants point to the
1696 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
1697 and it points to a chain of other variants so that duplicate
1698 variants are never made. Only main variants should ever appear as
1699 types of expressions. */
1701 extern tree build_qualified_type PROTO((tree, int));
1703 /* Like build_qualified_type, but only deals with the `const' and
1704 `volatile' qualifiers. This interface is retained for backwards
1705 compatiblity with the various front-ends; new code should use
1706 build_qualified_type instead. */
1708 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
1709 build_qualified_type (TYPE, \
1710 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
1711 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
1713 /* Make a copy of a type node. */
1715 extern tree build_type_copy PROTO((tree));
1717 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1718 TYPE_ALIGN and TYPE_MODE fields.
1719 If called more than once on one node, does nothing except
1720 for the first time. */
1722 extern void layout_type PROTO((tree));
1724 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1725 return a canonicalized ..._TYPE node, so that duplicates are not made.
1726 How the hash code is computed is up to the caller, as long as any two
1727 callers that could hash identical-looking type nodes agree. */
1729 extern tree type_hash_canon PROTO((int, tree));
1731 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1732 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1733 fields. Call this only once for any given decl node.
1735 Second argument is the boundary that this field can be assumed to
1736 be starting at (in bits). Zero means it can be assumed aligned
1737 on any boundary that may be needed. */
1739 extern void layout_decl PROTO((tree, unsigned));
1741 /* Return an expr equal to X but certainly not valid as an lvalue. */
1743 extern tree non_lvalue PROTO((tree));
1744 extern tree pedantic_non_lvalue PROTO((tree));
1746 extern tree convert PROTO((tree, tree));
1747 extern tree size_in_bytes PROTO((tree));
1748 extern HOST_WIDE_INT int_size_in_bytes PROTO((tree));
1749 extern tree size_binop PROTO((enum tree_code, tree, tree));
1750 extern tree ssize_binop PROTO((enum tree_code, tree, tree));
1751 extern tree size_int_wide PROTO((unsigned HOST_WIDE_INT,
1752 unsigned HOST_WIDE_INT, int));
1753 #define size_int(L) size_int_2 ((L), 0, 0)
1754 #define bitsize_int(L, H) size_int_2 ((L), (H), 1)
1755 #define size_int_2(L, H, T) \
1756 size_int_wide ((unsigned HOST_WIDE_INT) (L), \
1757 (unsigned HOST_WIDE_INT) (H), (T))
1759 extern tree round_up PROTO((tree, int));
1760 extern tree get_pending_sizes PROTO((void));
1761 extern void put_pending_sizes PROTO((tree));
1763 /* Type for sizes of data-type. */
1765 #define BITS_PER_UNIT_LOG \
1766 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1767 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1768 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1772 tree xsizetype, xbitsizetype;
1773 tree xssizetype, xusizetype;
1774 tree xsbitsizetype, xubitsizetype;
1777 extern struct sizetype_tab sizetype_tab;
1779 #define sizetype sizetype_tab.xsizetype
1780 #define bitsizetype sizetype_tab.xbitsizetype
1781 #define ssizetype sizetype_tab.xssizetype
1782 #define usizetype sizetype_tab.xusizetype
1783 #define sbitsizetype sizetype_tab.xsbitsizetype
1784 #define ubitsizetype sizetype_tab.xubitsizetype
1786 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1787 extern int maximum_field_alignment;
1789 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1790 extern int set_alignment;
1792 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1793 by making the last node in X point to Y.
1794 Returns X, except if X is 0 returns Y. */
1796 extern tree chainon PROTO((tree, tree));
1798 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1800 extern tree tree_cons PROTO((tree, tree, tree));
1801 extern tree perm_tree_cons PROTO((tree, tree, tree));
1802 extern tree temp_tree_cons PROTO((tree, tree, tree));
1803 extern tree saveable_tree_cons PROTO((tree, tree, tree));
1804 extern tree decl_tree_cons PROTO((tree, tree, tree));
1805 extern tree expr_tree_cons PROTO((tree, tree, tree));
1807 /* Return the last tree node in a chain. */
1809 extern tree tree_last PROTO((tree));
1811 /* Reverse the order of elements in a chain, and return the new head. */
1813 extern tree nreverse PROTO((tree));
1815 /* Returns the length of a chain of nodes
1816 (number of chain pointers to follow before reaching a null pointer). */
1818 extern int list_length PROTO((tree));
1820 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1822 extern int integer_zerop PROTO((tree));
1824 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1826 extern int integer_onep PROTO((tree));
1828 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1829 all of whose significant bits are 1. */
1831 extern int integer_all_onesp PROTO((tree));
1833 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1834 exactly one bit 1. */
1836 extern int integer_pow2p PROTO((tree));
1838 /* staticp (tree x) is nonzero if X is a reference to data allocated
1839 at a fixed address in memory. */
1841 extern int staticp PROTO((tree));
1843 /* Gets an error if argument X is not an lvalue.
1844 Also returns 1 if X is an lvalue, 0 if not. */
1846 extern int lvalue_or_else PROTO((tree, const char *));
1848 /* save_expr (EXP) returns an expression equivalent to EXP
1849 but it can be used multiple times within context CTX
1850 and only evaluate EXP once. */
1852 extern tree save_expr PROTO((tree));
1854 /* Returns the index of the first non-tree operand for CODE, or the number
1855 of operands if all are trees. */
1857 extern int first_rtl_op PROTO((enum tree_code));
1859 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1860 can be used multiple times and will evaluate EXP in its entirety
1863 extern tree unsave_expr PROTO((tree));
1865 /* Reset EXP in place so that it can be expaned again. Does not
1866 recurse into subtrees. */
1868 extern void unsave_expr_1 PROTO((tree));
1870 /* Like unsave_expr_1, but recurses into all subtrees. */
1872 extern tree unsave_expr_now PROTO((tree));
1874 /* If non-null, these are language-specific helper functions for
1875 unsave_expr_now. If present, LANG_UNSAVE is called before its
1876 argument (an UNSAVE_EXPR) is to be unsaved, and all other
1877 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
1878 called from unsave_expr_1 for language-specific tree codes. */
1879 extern void (*lang_unsave) PROTO((tree *));
1880 extern void (*lang_unsave_expr_now) PROTO((tree));
1882 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1883 or offset that depends on a field within a record.
1885 Note that we only allow such expressions within simple arithmetic
1888 extern int contains_placeholder_p PROTO((tree));
1890 /* Return 1 if EXP contains any expressions that produce cleanups for an
1891 outer scope to deal with. Used by fold. */
1893 extern int has_cleanups PROTO((tree));
1895 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1896 return a tree with all occurrences of references to F in a
1897 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1898 contains only arithmetic expressions. */
1900 extern tree substitute_in_expr PROTO((tree, tree, tree));
1902 /* variable_size (EXP) is like save_expr (EXP) except that it
1903 is for the special case of something that is part of a
1904 variable size for a data type. It makes special arrangements
1905 to compute the value at the right time when the data type
1906 belongs to a function parameter. */
1908 extern tree variable_size PROTO((tree));
1910 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1911 but it can be used multiple times
1912 and only evaluate the subexpressions once. */
1914 extern tree stabilize_reference PROTO((tree));
1916 /* Subroutine of stabilize_reference; this is called for subtrees of
1917 references. Any expression with side-effects must be put in a SAVE_EXPR
1918 to ensure that it is only evaluated once. */
1920 extern tree stabilize_reference_1 PROTO((tree));
1922 /* Return EXP, stripped of any conversions to wider types
1923 in such a way that the result of converting to type FOR_TYPE
1924 is the same as if EXP were converted to FOR_TYPE.
1925 If FOR_TYPE is 0, it signifies EXP's type. */
1927 extern tree get_unwidened PROTO((tree, tree));
1929 /* Return OP or a simpler expression for a narrower value
1930 which can be sign-extended or zero-extended to give back OP.
1931 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1932 or 0 if the value should be sign-extended. */
1934 extern tree get_narrower PROTO((tree, int *));
1936 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1938 The definition of this resides in language-specific code
1939 as the repertoire of available types may vary. */
1941 extern tree type_for_mode PROTO((enum machine_mode, int));
1943 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1944 for an integer type with at least that precision.
1945 The definition of this resides in language-specific code
1946 as the repertoire of available types may vary. */
1948 extern tree type_for_size PROTO((unsigned, int));
1950 /* Given an integer type T, return a type like T but unsigned.
1951 If T is unsigned, the value is T.
1952 The definition of this resides in language-specific code
1953 as the repertoire of available types may vary. */
1955 extern tree unsigned_type PROTO((tree));
1957 /* Given an integer type T, return a type like T but signed.
1958 If T is signed, the value is T.
1959 The definition of this resides in language-specific code
1960 as the repertoire of available types may vary. */
1962 extern tree signed_type PROTO((tree));
1964 /* This function must be defined in the language-specific files.
1965 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1966 This is defined in a language-specific file. */
1968 extern tree maybe_build_cleanup PROTO((tree));
1970 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1971 look for nested component-refs or array-refs at constant positions
1972 and find the ultimate containing object, which is returned. */
1974 extern tree get_inner_reference PROTO((tree, int *, int *, tree *,
1975 enum machine_mode *, int *,
1978 /* Given a DECL or TYPE, return the scope in which it was declared, or
1979 NUL_TREE if there is no containing scope. */
1981 extern tree get_containing_scope PROTO((tree));
1983 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1985 extern tree decl_function_context PROTO((tree));
1987 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1988 this _DECL with its context, or zero if none. */
1989 extern tree decl_type_context PROTO((tree));
1991 /* Given the FUNCTION_DECL for the current function,
1992 return zero if it is ok for this function to be inline.
1993 Otherwise return a warning message with a single %s
1994 for the function's name. */
1996 extern const char *function_cannot_inline_p PROTO((tree));
1998 /* Return 1 if EXPR is the real constant zero. */
1999 extern int real_zerop PROTO((tree));
2001 /* Declare commonly used variables for tree structure. */
2003 /* Points to the name of the input file from which the current input
2004 being parsed originally came (before it went into cpp). */
2005 extern char *input_filename;
2007 /* Current line number in input file. */
2010 /* Nonzero for -pedantic switch: warn about anything
2011 that standard C forbids. */
2012 extern int pedantic;
2014 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2015 Zero means allow extended lvalues. */
2017 extern int pedantic_lvalues;
2019 /* Nonzero means can safely call expand_expr now;
2020 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2022 extern int immediate_size_expand;
2024 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2026 extern tree current_function_decl;
2028 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2030 extern int all_types_permanent;
2032 /* Pointer to function to compute the name to use to print a declaration.
2033 DECL is the declaration in question.
2034 VERBOSITY determines what information will be printed:
2035 0: DECL_NAME, demangled as necessary.
2036 1: and scope information.
2037 2: and any other information that might be interesting, such as function
2038 parameter types in C++. */
2040 extern const char *(*decl_printable_name) PROTO((tree, int));
2042 /* Pointer to function to finish handling an incomplete decl at the
2043 end of compilation. */
2045 extern void (*incomplete_decl_finalize_hook) PROTO((tree));
2047 extern char *init_parse PROTO((char *));
2048 extern void finish_parse PROTO((void));
2050 extern const char * const language_string;
2052 /* Declare a predefined function. Return the declaration. This function is
2053 provided by each language frontend. */
2054 extern tree builtin_function PROTO((const char *, tree, int,
2055 enum built_in_class,
2059 extern char *perm_calloc PROTO((int, long));
2060 extern tree get_file_function_name PROTO((int));
2061 extern tree get_file_function_name_long PROTO((const char *));
2062 extern tree get_set_constructor_bits PROTO((tree, char *, int));
2063 extern tree get_set_constructor_bytes PROTO((tree,
2064 unsigned char *, int));
2065 extern int get_alias_set PROTO((tree));
2066 extern int new_alias_set PROTO((void));
2067 extern int (*lang_get_alias_set) PROTO((tree));
2068 extern tree get_callee_fndecl PROTO((tree));
2072 extern int in_control_zone_p PROTO((void));
2073 extern void expand_fixups PROTO((struct rtx_def *));
2074 extern tree expand_start_stmt_expr PROTO((void));
2075 extern tree expand_end_stmt_expr PROTO((tree));
2076 extern void expand_expr_stmt PROTO((tree));
2077 extern int warn_if_unused_value PROTO((tree));
2078 extern void expand_decl_init PROTO((tree));
2079 extern void clear_last_expr PROTO((void));
2080 extern void expand_label PROTO((tree));
2081 extern void expand_goto PROTO((tree));
2082 extern void expand_asm PROTO((tree));
2083 extern void expand_start_cond PROTO((tree, int));
2084 extern void expand_end_cond PROTO((void));
2085 extern void expand_start_else PROTO((void));
2086 extern void expand_start_elseif PROTO((tree));
2087 extern struct nesting *expand_start_loop PROTO((int));
2088 extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
2089 extern void expand_loop_continue_here PROTO((void));
2090 extern void expand_end_loop PROTO((void));
2091 extern int expand_continue_loop PROTO((struct nesting *));
2092 extern int expand_exit_loop PROTO((struct nesting *));
2093 extern int expand_exit_loop_if_false PROTO((struct nesting *,
2095 extern int expand_exit_something PROTO((void));
2097 extern void expand_null_return PROTO((void));
2098 extern void expand_return PROTO((tree));
2099 extern int optimize_tail_recursion PROTO((tree, struct rtx_def *));
2100 extern void expand_start_bindings PROTO((int));
2101 extern void expand_end_bindings PROTO((tree, int, int));
2102 extern void warn_about_unused_variables PROTO((tree));
2103 extern void start_cleanup_deferral PROTO((void));
2104 extern void end_cleanup_deferral PROTO((void));
2105 extern void mark_block_as_eh_region PROTO((void));
2106 extern void mark_block_as_not_eh_region PROTO((void));
2107 extern int is_eh_region PROTO((void));
2108 extern int conditional_context PROTO((void));
2109 extern tree last_cleanup_this_contour PROTO((void));
2110 extern int expand_dhc_cleanup PROTO((tree));
2111 extern int expand_dcc_cleanup PROTO((tree));
2112 extern void expand_start_case PROTO((int, tree, tree,
2114 extern void expand_end_case PROTO((tree));
2115 extern int pushcase PROTO((tree,
2116 tree (*) (tree, tree),
2118 extern int pushcase_range PROTO((tree, tree,
2119 tree (*) (tree, tree),
2121 extern void using_eh_for_cleanups PROTO((void));
2122 extern int stmt_loop_nest_empty PROTO((void));
2124 /* In fold-const.c */
2126 /* Fold constants as much as possible in an expression.
2127 Returns the simplified expression.
2128 Acts only on the top level of the expression;
2129 if the argument itself cannot be simplified, its
2130 subexpressions are not changed. */
2132 extern tree fold PROTO((tree));
2134 extern int force_fit_type PROTO((tree, int));
2135 extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2136 HOST_WIDE_INT, HOST_WIDE_INT,
2137 HOST_WIDE_INT *, HOST_WIDE_INT *));
2138 extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2139 HOST_WIDE_INT *, HOST_WIDE_INT *));
2140 extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2141 HOST_WIDE_INT, HOST_WIDE_INT,
2142 HOST_WIDE_INT *, HOST_WIDE_INT *));
2143 extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2144 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2145 HOST_WIDE_INT *, int));
2146 extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2148 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
2149 extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2150 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2152 extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2153 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2155 extern int operand_equal_p PROTO((tree, tree, int));
2156 extern tree invert_truthvalue PROTO((tree));
2158 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2159 function arguments and return the new type. Return NULL_TREE if no
2160 change. Required by any language that supports variadic arguments. */
2162 extern tree (*lang_type_promotes_to) PROTO((tree));
2164 /* Interface of the DWARF2 unwind info support. */
2166 /* Decide whether we want to emit frame unwind information for the current
2167 translation unit. */
2169 extern int dwarf2out_do_frame PROTO((void));
2171 /* Generate a new label for the CFI info to refer to. */
2173 extern char *dwarf2out_cfi_label PROTO((void));
2175 /* Entry point to update the canonical frame address (CFA). */
2177 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
2179 /* Add the CFI for saving a register window. */
2181 extern void dwarf2out_window_save PROTO((char *));
2183 /* Add a CFI to update the running total of the size of arguments pushed
2186 extern void dwarf2out_args_size PROTO((char *, long));
2188 /* Entry point for saving a register to the stack. */
2190 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
2192 /* Entry point for saving the return address in the stack. */
2194 extern void dwarf2out_return_save PROTO((char *, long));
2196 /* Entry point for saving the return address in a register. */
2198 extern void dwarf2out_return_reg PROTO((char *, unsigned));
2200 /* Output a marker (i.e. a label) for the beginning of a function, before
2203 extern void dwarf2out_begin_prologue PROTO((void));
2205 /* Output a marker (i.e. a label) for the absolute end of the generated
2206 code for a function definition. */
2208 extern void dwarf2out_end_epilogue PROTO((void));
2210 /* The language front-end must define these functions. */
2212 /* Function of no arguments for initializing options. */
2213 extern void lang_init_options PROTO((void));
2215 /* Function of no arguments for initializing lexical scanning. */
2216 extern void init_lex PROTO((void));
2217 /* Function of no arguments for initializing the symbol table. */
2218 extern void init_decl_processing PROTO((void));
2220 /* Functions called with no arguments at the beginning and end or processing
2221 the input source file. */
2222 extern void lang_init PROTO((void));
2223 extern void lang_finish PROTO((void));
2225 /* Function to identify which front-end produced the output file. */
2226 extern const char *lang_identify PROTO((void));
2228 /* Called by report_error_function to print out function name.
2229 * Default may be overridden by language front-ends. */
2230 extern void (*print_error_function) PROTO((const char *));
2232 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2233 extern void copy_lang_decl PROTO((tree));
2235 /* Function called with no arguments to parse and compile the input. */
2236 extern int yyparse PROTO((void));
2237 /* Function called with option as argument
2238 to decode options starting with -f or -W or +.
2239 It should return nonzero if it handles the option. */
2240 extern int lang_decode_option PROTO((int, char **));
2242 /* Functions for processing symbol declarations. */
2243 /* Function to enter a new lexical scope.
2244 Takes one argument: always zero when called from outside the front end. */
2245 extern void pushlevel PROTO((int));
2246 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2247 Takes three arguments:
2248 KEEP -- nonzero if there were declarations in this scope.
2249 REVERSE -- reverse the order of decls before returning them.
2250 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2251 extern tree poplevel PROTO((int, int, int));
2252 /* Set the BLOCK node for the current scope level. */
2253 extern void set_block PROTO((tree));
2254 /* Function to add a decl to the current scope level.
2255 Takes one argument, a decl to add.
2256 Returns that decl, or, if the same symbol is already declared, may
2257 return a different decl for that name. */
2258 extern tree pushdecl PROTO((tree));
2259 /* Function to return the chain of decls so far in the current scope level. */
2260 extern tree getdecls PROTO((void));
2261 /* Function to return the chain of structure tags in the current scope level. */
2262 extern tree gettags PROTO((void));
2264 extern tree build_range_type PROTO((tree, tree, tree));
2266 /* Call when starting to parse a declaration:
2267 make expressions in the declaration last the length of the function.
2268 Returns an argument that should be passed to resume_momentary later. */
2269 extern int suspend_momentary PROTO((void));
2271 extern int allocation_temporary_p PROTO((void));
2273 /* Call when finished parsing a declaration:
2274 restore the treatment of node-allocation that was
2275 in effect before the suspension.
2276 YES should be the value previously returned by suspend_momentary. */
2277 extern void resume_momentary PROTO((int));
2279 /* Called after finishing a record, union or enumeral type. */
2280 extern void rest_of_type_compilation PROTO((tree, int));
2282 /* Save the current set of obstacks, but don't change them. */
2283 extern void push_obstacks_nochange PROTO((void));
2285 extern void permanent_allocation PROTO((int));
2287 extern void push_momentary PROTO((void));
2289 extern void clear_momentary PROTO((void));
2291 extern void pop_momentary PROTO((void));
2293 extern void end_temporary_allocation PROTO((void));
2295 /* Pop the obstack selection stack. */
2296 extern void pop_obstacks PROTO((void));
2299 extern int really_constant_p PROTO ((tree));
2300 extern void push_obstacks PROTO ((struct obstack *,
2302 extern void pop_momentary_nofree PROTO ((void));
2303 extern void preserve_momentary PROTO ((void));
2304 extern void saveable_allocation PROTO ((void));
2305 extern void temporary_allocation PROTO ((void));
2306 extern void resume_temporary_allocation PROTO ((void));
2307 extern tree get_file_function_name PROTO ((int));
2308 extern void set_identifier_size PROTO ((int));
2309 extern int int_fits_type_p PROTO ((tree, tree));
2310 extern int tree_log2 PROTO ((tree));
2311 extern void preserve_initializer PROTO ((void));
2312 extern void preserve_data PROTO ((void));
2313 extern int object_permanent_p PROTO ((tree));
2314 extern int type_precision PROTO ((tree));
2315 extern int simple_cst_equal PROTO ((tree, tree));
2316 extern int type_list_equal PROTO ((tree, tree));
2317 extern int chain_member PROTO ((tree, tree));
2318 extern int chain_member_purpose PROTO ((tree, tree));
2319 extern int chain_member_value PROTO ((tree, tree));
2320 extern tree listify PROTO ((tree));
2321 extern tree type_hash_lookup PROTO ((int, tree));
2322 extern void type_hash_add PROTO ((int, tree));
2323 extern int type_hash_list PROTO ((tree));
2324 extern int simple_cst_list_equal PROTO ((tree, tree));
2325 extern void debug_obstack PROTO ((char *));
2326 extern void rtl_in_current_obstack PROTO ((void));
2327 extern void rtl_in_saveable_obstack PROTO ((void));
2328 extern void init_tree_codes PROTO ((void));
2329 extern void dump_tree_statistics PROTO ((void));
2330 extern void print_obstack_statistics PROTO ((const char *,
2333 extern void print_obstack_name PROTO ((char *, FILE *, const char *));
2335 extern void expand_function_end PROTO ((char *, int, int));
2336 extern void expand_function_start PROTO ((tree, int));
2337 extern int real_onep PROTO ((tree));
2338 extern int real_twop PROTO ((tree));
2339 extern void start_identifier_warnings PROTO ((void));
2340 extern void gcc_obstack_init PROTO ((struct obstack *));
2341 extern void init_obstacks PROTO ((void));
2342 extern void obfree PROTO ((char *));
2343 extern void build_common_tree_nodes PROTO ((int));
2344 extern void build_common_tree_nodes_2 PROTO ((int));
2347 extern void setjmp_protect_args PROTO ((void));
2348 extern void setjmp_protect PROTO ((tree));
2349 extern void expand_main_function PROTO ((void));
2350 extern void mark_varargs PROTO ((void));
2351 extern void init_dummy_function_start PROTO ((void));
2352 extern void expand_dummy_function_end PROTO ((void));
2353 extern void init_function_for_compilation PROTO ((void));
2354 extern void init_function_start PROTO ((tree, char *, int));
2355 extern void assign_parms PROTO ((tree));
2356 extern void put_var_into_stack PROTO ((tree));
2357 extern void uninitialized_vars_warning PROTO ((tree));
2358 extern void setjmp_args_warning PROTO ((void));
2359 extern void mark_all_temps_used PROTO ((void));
2360 extern void init_temp_slots PROTO ((void));
2361 extern void combine_temp_slots PROTO ((void));
2362 extern void free_temp_slots PROTO ((void));
2363 extern void pop_temp_slots PROTO ((void));
2364 extern void push_temp_slots PROTO ((void));
2365 extern void preserve_temp_slots PROTO ((struct rtx_def *));
2366 extern int aggregate_value_p PROTO ((tree));
2367 extern tree reorder_blocks PROTO ((tree,
2369 extern void free_temps_for_rtl_expr PROTO ((tree));
2370 extern void instantiate_virtual_regs PROTO ((tree, struct rtx_def *));
2371 extern int max_parm_reg_num PROTO ((void));
2372 extern void push_function_context PROTO ((void));
2373 extern void pop_function_context PROTO ((void));
2374 extern void push_function_context_to PROTO ((tree));
2375 extern void pop_function_context_from PROTO ((tree));
2377 /* In print-rtl.c */
2379 extern void print_rtl PROTO ((FILE *, struct rtx_def *));
2382 /* In print-tree.c */
2383 extern void debug_tree PROTO ((tree));
2385 extern void print_node PROTO ((FILE *, const char *, tree, int));
2386 extern void print_node_brief PROTO ((FILE *, const char *, tree, int));
2387 extern void indent_to PROTO ((FILE *, int));
2391 extern void emit_queue PROTO ((void));
2392 extern int apply_args_register_offset PROTO ((int));
2393 extern struct rtx_def *expand_builtin_return_addr
2394 PROTO ((enum built_in_function, int, struct rtx_def *));
2395 extern void do_pending_stack_adjust PROTO ((void));
2396 extern struct rtx_def *expand_assignment PROTO ((tree, tree, int, int));
2397 extern struct rtx_def *store_expr PROTO ((tree, struct rtx_def *,
2399 extern void check_max_integer_computation_mode PROTO ((tree));
2402 extern void start_sequence_for_rtl_expr PROTO ((tree));
2403 extern struct rtx_def *emit_line_note_after PROTO ((char *, int,
2405 extern struct rtx_def *emit_line_note PROTO ((char *, int));
2406 extern struct rtx_def *emit_line_note_force PROTO ((char *, int));
2409 extern void special_function_p PROTO ((tree, int *, int *,
2413 extern int mark_addressable PROTO ((tree));
2414 extern void incomplete_type_error PROTO ((tree, tree));
2417 extern void print_lang_statistics PROTO ((void));
2420 extern tree truthvalue_conversion PROTO ((tree));
2421 extern int min_precision PROTO ((tree, int));
2422 extern void split_specs_attrs PROTO ((tree, tree *, tree *));
2426 extern void print_lang_decl PROTO ((FILE *, tree, int));
2427 extern void print_lang_type PROTO ((FILE *, tree, int));
2428 extern void print_lang_identifier PROTO ((FILE *, tree, int));
2430 extern int global_bindings_p PROTO ((void));
2431 extern void insert_block PROTO ((tree));
2433 /* In integrate.c */
2434 extern void save_for_inline_nocopy PROTO ((tree));
2435 extern void save_for_inline_copying PROTO ((tree));
2436 extern void set_decl_abstract_flags PROTO ((tree, int));
2437 extern void output_inline_function PROTO ((tree));
2440 extern void set_yydebug PROTO ((int));
2442 /* In stor-layout.c */
2443 extern void fixup_signed_type PROTO ((tree));
2446 extern void make_decl_rtl PROTO ((tree, const char *, int));
2447 extern void make_decl_one_only PROTO ((tree));
2448 extern int supports_one_only PROTO ((void));
2449 extern void variable_section PROTO ((tree, int));
2451 /* In fold-const.c */
2452 extern int div_and_round_double PROTO ((enum tree_code, int,
2453 HOST_WIDE_INT, HOST_WIDE_INT,
2454 HOST_WIDE_INT, HOST_WIDE_INT,
2461 extern void emit_nop PROTO ((void));
2462 extern void expand_computed_goto PROTO ((tree));
2463 extern struct rtx_def *label_rtx PROTO ((tree));
2464 extern void expand_asm_operands PROTO ((tree, tree, tree, tree, int,
2466 extern int any_pending_cleanups PROTO ((int));
2467 extern void init_stmt PROTO ((void));
2468 extern void init_stmt_for_function PROTO ((void));
2469 extern int drop_through_at_end_p PROTO ((void));
2470 extern void expand_start_target_temps PROTO ((void));
2471 extern void expand_end_target_temps PROTO ((void));
2472 extern void expand_elseif PROTO ((tree));
2473 extern void expand_decl PROTO ((tree));
2474 extern int expand_decl_cleanup PROTO ((tree, tree));
2475 extern void expand_anon_union_decl PROTO ((tree, tree, tree));
2476 extern void move_cleanups_up PROTO ((void));
2477 extern void expand_start_case_dummy PROTO ((void));
2478 extern void expand_end_case_dummy PROTO ((void));
2479 extern tree case_index_expr_type PROTO ((void));
2480 extern HOST_WIDE_INT all_cases_count PROTO ((tree, int *));
2481 extern void check_for_full_enumeration_handling PROTO ((tree));
2482 extern void declare_nonlocal_label PROTO ((tree));
2484 extern void lang_print_xnode PROTO ((FILE *, tree, int));
2488 /* If KIND=='I', return a suitable global initializer (constructor) name.
2489 If KIND=='D', return a suitable global clean-up (destructor) name. */
2490 extern tree get_file_function_name PROTO((int));
2492 /* Interface of the DWARF2 unwind info support. */
2494 /* Decide whether we want to emit frame unwind information for the current
2495 translation unit. */
2497 extern int dwarf2out_do_frame PROTO((void));
2499 /* Generate a new label for the CFI info to refer to. */
2501 extern char *dwarf2out_cfi_label PROTO((void));
2503 /* Entry point to update the canonical frame address (CFA). */
2505 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
2507 /* Add the CFI for saving a register window. */
2509 extern void dwarf2out_window_save PROTO((char *));
2511 /* Add a CFI to update the running total of the size of arguments pushed
2514 extern void dwarf2out_args_size PROTO((char *, long));
2516 /* Entry point for saving a register to the stack. */
2518 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
2520 /* Entry point for saving the return address in the stack. */
2522 extern void dwarf2out_return_save PROTO((char *, long));
2524 /* Entry point for saving the return address in a register. */
2526 extern void dwarf2out_return_reg PROTO((char *, unsigned));
2528 /* Output a marker (i.e. a label) for the beginning of a function, before
2531 extern void dwarf2out_begin_prologue PROTO((void));
2533 /* Output a marker (i.e. a label) for the absolute end of the generated
2534 code for a function definition. */
2536 extern void dwarf2out_end_epilogue PROTO((void));
2538 /* Redefine abort to report an internal error w/o coredump, and
2539 reporting the location of the error in the source file. This logic
2540 is duplicated in rtl.h and tree.h because every file that needs the
2541 special abort includes one or both. toplev.h gets too few files,
2542 system.h gets too many. */
2544 extern void fancy_abort PROTO((const char *, int, const char *))
2546 #if (GCC_VERSION >= 2007)
2547 #define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__)
2549 #define abort() fancy_abort (__FILE__, __LINE__, 0)