1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
42 /* Number of tree codes. */
43 #define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern char tree_code_type[MAX_TREE_CODES];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns non-zero iff CLASS is the tree-code class of an
59 #define IS_EXPR_CODE_CLASS(CLASS) \
60 (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e')
62 /* Number of argument-words in each kind of tree-node. */
64 extern int tree_code_length[MAX_TREE_CODES];
66 /* Names of tree components. */
68 extern const char *tree_code_name[MAX_TREE_CODES];
70 /* Classify which part of the compiler has defined a given builtin function.
71 Note that we assume below that this is no more than two bits. */
80 /* Names for the above. */
81 extern const char *const built_in_class_names[4];
83 /* Codes that identify the various built in functions
84 so that expand_call can identify them quickly. */
86 enum built_in_function
111 BUILT_IN_CLASSIFY_TYPE,
115 BUILT_IN_FRAME_ADDRESS,
116 BUILT_IN_RETURN_ADDRESS,
117 BUILT_IN_AGGREGATE_INCOMING_ADDRESS,
125 /* ISO C99 floating point unordered comparisons. */
127 BUILT_IN_ISGREATEREQUAL,
129 BUILT_IN_ISLESSEQUAL,
130 BUILT_IN_ISLESSGREATER,
131 BUILT_IN_ISUNORDERED,
133 /* Various hooks for the DWARF 2 __throw routine. */
134 BUILT_IN_UNWIND_INIT,
136 BUILT_IN_DWARF_FP_REGNUM,
137 BUILT_IN_INIT_DWARF_REG_SIZES,
138 BUILT_IN_FROB_RETURN_ADDR,
139 BUILT_IN_EXTRACT_RETURN_ADDR,
142 BUILT_IN_VARARGS_START,
143 BUILT_IN_STDARG_START,
153 /* Upper bound on non-language-specific builtins. */
157 /* Names for the above. */
158 extern const char *const built_in_names[(int) END_BUILTINS];
160 /* The definition of tree nodes fills the next several pages. */
162 /* A tree node can represent a data type, a variable, an expression
163 or a statement. Each node has a TREE_CODE which says what kind of
164 thing it represents. Some common codes are:
165 INTEGER_TYPE -- represents a type of integers.
166 ARRAY_TYPE -- represents a type of pointer.
167 VAR_DECL -- represents a declared variable.
168 INTEGER_CST -- represents a constant integer value.
169 PLUS_EXPR -- represents a sum (an expression).
171 As for the contents of a tree node: there are some fields
172 that all nodes share. Each TREE_CODE has various special-purpose
173 fields as well. The fields of a node are never accessed directly,
174 always through accessor macros. */
176 /* This type is used everywhere to refer to a tree node. */
178 typedef union tree_node *tree;
180 /* Every kind of tree node starts with this structure,
181 so all nodes have these fields.
183 See the accessor macros, defined below, for documentation of the fields.
185 DO NOT change the layout of tree_common unless absolutely necessary. Some
186 front-ends (namely g++) depend on the internal layout of this tructure.
187 See my_tree_cons in the cp subdir for such uglyness. Ugh. */
191 union tree_node *chain;
192 union tree_node *type;
193 #ifdef ONLY_INT_FIELDS
194 unsigned int code : 8;
196 enum tree_code code : 8;
199 unsigned side_effects_flag : 1;
200 unsigned constant_flag : 1;
201 unsigned permanent_flag : 1;
202 unsigned addressable_flag : 1;
203 unsigned volatile_flag : 1;
204 unsigned readonly_flag : 1;
205 unsigned unsigned_flag : 1;
206 unsigned asm_written_flag: 1;
208 unsigned used_flag : 1;
209 unsigned nothrow_flag : 1;
210 unsigned static_flag : 1;
211 unsigned public_flag : 1;
212 unsigned private_flag : 1;
213 unsigned protected_flag : 1;
215 unsigned lang_flag_0 : 1;
216 unsigned lang_flag_1 : 1;
217 unsigned lang_flag_2 : 1;
218 unsigned lang_flag_3 : 1;
219 unsigned lang_flag_4 : 1;
220 unsigned lang_flag_5 : 1;
221 unsigned lang_flag_6 : 1;
223 /* There is room for three more flags. */
226 /* The following table lists the uses of each of the above flags and
227 for which types of nodes they are defined. Note that expressions
233 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
239 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
240 TREE_NO_UNUSED_WARNING in
241 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
243 TREE_LIST or TREE_VEC
244 TREE_CONSTANT_OVERFLOW in
245 INTEGER_CST, REAL_CST, COMPLEX_CST
246 TREE_SYMBOL_REFERENCED in
252 INTEGER_CST, REAL_CST, COMPLEX_CST
254 VAR_DECL or FUNCTION_DECL
256 TREE_LIST or TREE_VEC
257 EXPR_WFL_EMIT_LINE_NOTE in
258 EXPR_WITH_FILE_LOCATION
263 TREE_LIST or TREE_VEC
265 ??? unspecified nodes
269 TREE_VIA_PROTECTED in
273 ??? unspecified nodes
282 TREE_THIS_VOLATILE in
292 VAR_DECL if iterator (C)
301 permanent_flag: TREE_PERMANENT in all nodes
306 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
307 DECL_BUILT_IN_NONANSI in
311 SAVE_EXPR_NOPLACEHOLDER in
317 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
323 expressions, IDENTIFIER_NODE
328 CALL_EXPR, FUNCTION_DECL
331 /* Define accessors for the fields that all tree nodes have
332 (though some fields are not used for all kinds of nodes). */
334 /* The tree-code says what kind of node it is.
335 Codes are defined in tree.def. */
336 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
337 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
339 /* When checking is enabled, errors will be generated if a tree node
340 is accessed incorrectly. The macros abort with a fatal error. */
341 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
343 #define TREE_CHECK(t, code) \
344 ({ const tree __t = t; \
345 if (TREE_CODE(__t) != (code)) \
346 tree_check_failed (__t, code, __FILE__, \
347 __LINE__, __PRETTY_FUNCTION__); \
349 #define TREE_CLASS_CHECK(t, class) \
350 ({ const tree __t = t; \
351 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
352 tree_class_check_failed (__t, class, __FILE__, \
353 __LINE__, __PRETTY_FUNCTION__); \
356 /* These checks have to be special cased. */
357 #define CST_OR_CONSTRUCTOR_CHECK(t) \
358 ({ const tree __t = t; \
359 enum tree_code __c = TREE_CODE(__t); \
360 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
361 tree_check_failed (__t, CONSTRUCTOR, __FILE__, \
362 __LINE__, __PRETTY_FUNCTION__); \
364 #define EXPR_CHECK(t) \
365 ({ const tree __t = t; \
366 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
367 if (__c != 'r' && __c != 's' && __c != '<' \
368 && __c != '1' && __c != '2' && __c != 'e') \
369 tree_class_check_failed(__t, 'e', __FILE__, \
370 __LINE__, __PRETTY_FUNCTION__); \
373 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
374 const char *, int, const char *))
376 extern void tree_class_check_failed PARAMS ((const tree, char,
377 const char *, int, const char *))
380 #else /* not ENABLE_TREE_CHECKING, or not gcc */
382 #define TREE_CHECK(t, code) (t)
383 #define TREE_CLASS_CHECK(t, code) (t)
384 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
385 #define EXPR_CHECK(t) (t)
389 #include "tree-check.h"
391 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
392 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
393 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
395 /* In all nodes that are expressions, this is the data type of the expression.
396 In POINTER_TYPE nodes, this is the type that the pointer points to.
397 In ARRAY_TYPE nodes, this is the type of the elements. */
398 #define TREE_TYPE(NODE) ((NODE)->common.type)
400 /* Nodes are chained together for many purposes.
401 Types are chained together to record them for being output to the debugger
402 (see the function `chain_type').
403 Decls in the same scope are chained together to record the contents
405 Statement nodes for successive statements used to be chained together.
406 Often lists of things are represented by TREE_LIST nodes that
407 are chained together. */
409 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
411 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
412 that don't change the machine mode. */
414 #define STRIP_NOPS(EXP) \
415 while ((TREE_CODE (EXP) == NOP_EXPR \
416 || TREE_CODE (EXP) == CONVERT_EXPR \
417 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
418 && (TYPE_MODE (TREE_TYPE (EXP)) \
419 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
420 (EXP) = TREE_OPERAND (EXP, 0);
422 /* Like STRIP_NOPS, but don't let the signedness change either. */
424 #define STRIP_SIGN_NOPS(EXP) \
425 while ((TREE_CODE (EXP) == NOP_EXPR \
426 || TREE_CODE (EXP) == CONVERT_EXPR \
427 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
428 && (TYPE_MODE (TREE_TYPE (EXP)) \
429 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
430 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
431 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
432 (EXP) = TREE_OPERAND (EXP, 0);
434 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
436 #define STRIP_TYPE_NOPS(EXP) \
437 while ((TREE_CODE (EXP) == NOP_EXPR \
438 || TREE_CODE (EXP) == CONVERT_EXPR \
439 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
440 && (TREE_TYPE (EXP) \
441 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
442 (EXP) = TREE_OPERAND (EXP, 0);
444 /* Nonzero if TYPE represents an integral type. Note that we do not
445 include COMPLEX types here. */
447 #define INTEGRAL_TYPE_P(TYPE) \
448 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
449 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
451 /* Nonzero if TYPE represents a floating-point type, including complex
452 floating-point types. */
454 #define FLOAT_TYPE_P(TYPE) \
455 (TREE_CODE (TYPE) == REAL_TYPE \
456 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
457 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
459 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
461 #define AGGREGATE_TYPE_P(TYPE) \
462 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
463 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
464 || TREE_CODE (TYPE) == SET_TYPE)
466 /* Nonzero if TYPE represents a pointer type. */
468 #define POINTER_TYPE_P(TYPE) \
469 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
471 /* Nonzero if TYPE represents a type. */
473 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
475 /* Define many boolean fields that all tree nodes have. */
477 /* In VAR_DECL nodes, nonzero means address of this is needed.
478 So it cannot be in a register.
479 In a FUNCTION_DECL, nonzero means its address is needed.
480 So it must be compiled even if it is an inline function.
481 In CONSTRUCTOR nodes, it means object constructed must be in memory.
482 In LABEL_DECL nodes, it means a goto for this label has been seen
483 from a place outside all binding contours that restore stack levels.
484 In ..._TYPE nodes, it means that objects of this type must
485 be fully addressable. This means that pieces of this
486 object cannot go into register parameters, for example.
487 In IDENTIFIER_NODEs, this means that some extern decl for this name
488 had its address taken. That matters for inline functions. */
489 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
491 /* In a VAR_DECL, nonzero means allocate static storage.
492 In a FUNCTION_DECL, nonzero if function has been defined.
493 In a CONSTRUCTOR, nonzero means allocate static storage. */
494 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
496 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
497 made implicitly and should not lead to an "unused value" warning. */
498 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
500 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
501 chain is via a `virtual' declaration. */
502 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
504 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
505 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
506 requires a diagnostic when overflows occur in constant expressions. */
507 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
509 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
510 this string as an argument. */
511 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
513 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
514 overflow in folding, and no warning has been issued for this subexpression.
515 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
516 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
518 /* In a VAR_DECL or FUNCTION_DECL,
519 nonzero means name is to be accessible from outside this module.
520 In an identifier node, nonzero means an external declaration
521 accessible from outside this module was previously seen
522 for this name in an inner scope. */
523 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
525 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
526 base class is via a `public' declaration, which preserves public
527 fields from the base class as public. */
528 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
530 /* Ditto, for `private' declarations. */
531 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
533 /* Nonzero for TREE_LIST node means that the path to the
534 base class is via a `protected' declaration, which preserves
535 protected fields from the base class as protected.
537 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
539 /* In any expression, nonzero means it has side effects or reevaluation
540 of the whole expression could produce a different value.
541 This is set if any subexpression is a function call, a side effect
542 or a reference to a volatile variable.
543 In a ..._DECL, this is set only if the declaration said `volatile'. */
544 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
546 /* Nonzero means this expression is volatile in the C sense:
547 its address should be of type `volatile WHATEVER *'.
548 In other words, the declared item is volatile qualified.
549 This is used in _DECL nodes and _REF nodes.
551 In a ..._TYPE node, means this type is volatile-qualified.
552 But use TYPE_VOLATILE instead of this macro when the node is a type,
553 because eventually we may make that a different bit.
555 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
556 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
558 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
559 nonzero means it may not be the lhs of an assignment.
560 In a ..._TYPE node, means this type is const-qualified
561 (but the macro TYPE_READONLY should be used instead of this macro
562 when the node is a type). */
563 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
565 /* Value of expression is constant.
566 Always appears in all ..._CST nodes.
567 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
568 if the value is constant. */
569 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
571 /* Nonzero means permanent node;
572 node will continue to exist for the entire compiler run.
573 Otherwise it will be recycled at the end of the function.
574 This flag is always zero if garbage collection is in use.
575 Try not to use this. Only set it with TREE_SET_PERMANENT. */
576 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
577 #define TREE_SET_PERMANENT(NODE) do { \
578 if (!ggc_p && current_obstack == &permanent_obstack) \
579 TREE_PERMANENT(NODE) = 1; \
582 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
583 In FIELD_DECL nodes, means an unsigned bit field.
584 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
585 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
587 /* Nonzero in a VAR_DECL means assembler code has been written.
588 Nonzero in a FUNCTION_DECL means that the function has been compiled.
589 This is interesting in an inline function, since it might not need
590 to be compiled separately.
591 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
592 if the sdb debugging info for the type has been written.
593 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
594 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
596 /* Nonzero in a _DECL if the name is used in its scope.
597 Nonzero in an expr node means inhibit warning if value is unused.
598 In IDENTIFIER_NODEs, this means that some extern decl for this name
600 #define TREE_USED(NODE) ((NODE)->common.used_flag)
602 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
603 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
604 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
606 /* Used in classes in C++. */
607 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
608 /* Used in classes in C++.
609 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
610 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
612 /* These flags are available for each language front end to use internally. */
613 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
614 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
615 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
616 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
617 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
618 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
619 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
621 /* Define additional fields and accessors for nodes representing constants. */
623 /* In an INTEGER_CST node. These two together make a 2-word integer.
624 If the data type is signed, the value is sign-extended to 2 words
625 even though not all of them may really be in use.
626 In an unsigned constant shorter than 2 words, the extra bits are 0. */
627 #define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
628 #define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
630 #define INT_CST_LT(A, B) \
631 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
632 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
633 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
635 #define INT_CST_LT_UNSIGNED(A, B) \
636 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
637 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
638 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
639 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
640 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
644 char common[sizeof (struct tree_common)];
645 struct rtx_def *rtl; /* acts as link to register transfer language
647 unsigned HOST_WIDE_INT int_cst_low;
648 HOST_WIDE_INT int_cst_high;
651 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
652 and generally in all kinds of constants that could
653 be given labels (rather than being immediate). */
655 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
657 /* In a REAL_CST node. */
658 /* We can represent a real value as either a `double' or a string.
659 Strings don't allow for any optimization, but they do allow
660 for cross-compilation. */
662 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
668 char common[sizeof (struct tree_common)];
669 struct rtx_def *rtl; /* acts as link to register transfer language
671 REAL_VALUE_TYPE real_cst;
674 /* In a STRING_CST */
675 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
676 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
680 char common[sizeof (struct tree_common)];
681 struct rtx_def *rtl; /* acts as link to register transfer language
687 /* In a COMPLEX_CST node. */
688 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
689 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
693 char common[sizeof (struct tree_common)];
694 struct rtx_def *rtl; /* acts as link to register transfer language
696 union tree_node *real;
697 union tree_node *imag;
700 /* Define fields and accessors for some special-purpose tree nodes. */
702 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
703 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
705 struct tree_identifier
707 char common[sizeof (struct tree_common)];
712 /* In a TREE_LIST node. */
713 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
714 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
718 char common[sizeof (struct tree_common)];
719 union tree_node *purpose;
720 union tree_node *value;
723 /* In a TREE_VEC node. */
724 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
725 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
726 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
730 char common[sizeof (struct tree_common)];
732 union tree_node *a[1];
735 /* Define fields and accessors for some nodes that represent expressions. */
737 /* In a SAVE_EXPR node. */
738 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
739 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
740 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
741 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
742 both in normal code and in a handler. (Normally, in a handler, all
743 SAVE_EXPRs are unsaved, meaning that there values are
745 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
747 /* In a RTL_EXPR node. */
748 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
749 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
751 /* In a CALL_EXPR node. */
752 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
754 /* In a CONSTRUCTOR node. */
755 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
757 /* In ordinary expression nodes. */
758 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
759 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
761 /* In a LABELED_BLOCK_EXPR node. */
762 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
763 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
765 /* In a EXIT_BLOCK_EXPR node. */
766 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
767 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
769 /* In a LOOP_EXPR node. */
770 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
772 /* In a EXPR_WITH_FILE_LOCATION node. */
773 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
774 #define EXPR_WFL_FILENAME(NODE) \
775 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
776 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
777 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
778 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
779 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
780 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
781 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
782 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
786 char common[sizeof (struct tree_common)];
788 union tree_node *operands[1];
791 /* In a BLOCK node. */
792 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
793 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
794 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
795 /* Note: when changing this, make sure to find the places
796 that use chainon or nreverse. */
797 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
798 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
799 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
801 /* Nonzero means that this block is prepared to handle exceptions
802 listed in the BLOCK_VARS slot. */
803 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
805 /* An index number for this block. These values are not guaranteed to
806 be unique across functions -- whether or not they are depends on
807 the debugging output format in use. */
808 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
812 char common[sizeof (struct tree_common)];
814 unsigned handler_block_flag : 1;
815 unsigned abstract_flag : 1;
816 unsigned block_num : 30;
818 union tree_node *vars;
819 union tree_node *subblocks;
820 union tree_node *supercontext;
821 union tree_node *abstract_origin;
824 /* Define fields and accessors for nodes representing data types. */
826 /* See tree.def for documentation of the use of these fields.
827 Look at the documentation of the various ..._TYPE tree codes. */
829 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
830 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
831 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
832 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
833 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
834 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
835 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
836 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
837 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
838 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
839 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
840 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
841 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
842 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
843 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
844 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
845 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
846 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
847 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
848 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
849 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
850 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
851 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
852 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
853 #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
854 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
856 /* For aggregate types, information about this type, as a base type
857 for itself. Used in a language-dependent way for types that are
858 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
859 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
861 /* The (language-specific) typed-based alias set for this type.
862 Objects whose TYPE_ALIAS_SETs are different cannot alias each
863 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
864 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
865 type can alias objects of any type. */
866 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
868 /* Nonzero iff the typed-based alias set for this type has been
870 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
871 (TYPE_CHECK (NODE)->type.alias_set != -1)
873 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
875 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
877 /* The alignment necessary for objects of this type.
878 The value is an int, measured in bits. */
879 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
881 /* The alignment for NODE, in bytes. */
882 #define TYPE_ALIGN_UNIT(NODE) \
883 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
885 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
887 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
888 has BLKmode only because it lacks the alignment requirement for
890 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
892 /* In an INTEGER_TYPE, it means the type represents a size. We use this
893 both for validity checking and to permit optimziations that are unsafe
895 #define TYPE_IS_SIZETYPE(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
897 /* Nonzero in a type considered volatile as a whole. */
898 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
900 /* Means this type is const-qualified. */
901 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
903 /* If nonzero, this type is `restrict'-qualified, in the C sense of
905 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
907 /* There is a TYPE_QUAL value for each type qualifier. They can be
908 combined by bitwise-or to form the complete set of qualifiers for a
911 #define TYPE_UNQUALIFIED 0x0
912 #define TYPE_QUAL_CONST 0x1
913 #define TYPE_QUAL_VOLATILE 0x2
914 #define TYPE_QUAL_RESTRICT 0x4
916 /* The set of type qualifiers for this type. */
917 #define TYPE_QUALS(NODE) \
918 ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) \
919 | (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) \
920 | (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT))
922 /* These flags are available for each language front end to use internally. */
923 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
924 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
925 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
926 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
927 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
928 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
929 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
931 /* If set in an ARRAY_TYPE, indicates a string type (for languages
932 that distinguish string from array of char).
933 If set in a SET_TYPE, indicates a bitstring type. */
934 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
936 /* If non-NULL, this is a upper bound of the size (in bytes) of an
937 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
938 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
940 /* Indicates that objects of this type must be initialized by calling a
941 function when they are created. */
942 #define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
944 /* Indicates that objects of this type (a UNION_TYPE), should be passed
945 the same way that the first union alternative would be passed. */
946 #define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
948 /* Indicated that objects of this type should be laid out in as
949 compact a way as possible. */
950 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
954 char common[sizeof (struct tree_common)];
955 union tree_node *values;
956 union tree_node *size;
957 union tree_node *size_unit;
958 union tree_node *attributes;
961 unsigned char precision;
962 #ifdef ONLY_INT_FIELDS
963 unsigned int mode : 8;
965 enum machine_mode mode : 8;
968 unsigned string_flag : 1;
969 unsigned no_force_blk_flag : 1;
970 unsigned needs_constructing_flag : 1;
971 unsigned transparent_union_flag : 1;
972 unsigned packed_flag : 1;
973 unsigned restrict_flag : 1;
975 unsigned lang_flag_0 : 1;
976 unsigned lang_flag_1 : 1;
977 unsigned lang_flag_2 : 1;
978 unsigned lang_flag_3 : 1;
979 unsigned lang_flag_4 : 1;
980 unsigned lang_flag_5 : 1;
981 unsigned lang_flag_6 : 1;
982 /* room for 3 more bits */
985 union tree_node *pointer_to;
986 union tree_node *reference_to;
987 union {int address; char *pointer; } symtab;
988 union tree_node *name;
989 union tree_node *minval;
990 union tree_node *maxval;
991 union tree_node *next_variant;
992 union tree_node *main_variant;
993 union tree_node *binfo;
994 union tree_node *noncopied_parts;
995 union tree_node *context;
996 struct obstack *obstack;
998 /* Points to a structure whose details depend on the language in use. */
999 struct lang_type *lang_specific;
1002 /* Define accessor macros for information about type inheritance
1005 A "basetype" means a particular usage of a data type for inheritance
1006 in another type. Each such basetype usage has its own "binfo"
1007 object to describe it. The binfo object is a TREE_VEC node.
1009 Inheritance is represented by the binfo nodes allocated for a
1010 given type. For example, given types C and D, such that D is
1011 inherited by C, 3 binfo nodes will be allocated: one for describing
1012 the binfo properties of C, similarly one for D, and one for
1013 describing the binfo properties of D as a base type for C.
1014 Thus, given a pointer to class C, one can get a pointer to the binfo
1015 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1017 /* The actual data type node being inherited in this basetype. */
1018 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1020 /* The offset where this basetype appears in its containing type.
1021 BINFO_OFFSET slot holds the offset (in bytes)
1022 from the base of the complete object to the base of the part of the
1023 object that is allocated on behalf of this `type'.
1024 This is always 0 except when there is multiple inheritance. */
1026 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1027 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1028 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1030 /* The virtual function table belonging to this basetype. Virtual
1031 function tables provide a mechanism for run-time method dispatching.
1032 The entries of a virtual function table are language-dependent. */
1034 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1035 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1037 /* The virtual functions in the virtual function table. This is
1038 a TREE_LIST that is used as an initial approximation for building
1039 a virtual function table for this basetype. */
1040 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1041 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1043 /* A vector of binfos for the direct basetypes inherited by this
1046 If this basetype describes type D as inherited in C, and if the
1047 basetypes of D are E and F, then this vector contains binfos for
1048 inheritance of E and F by C.
1050 ??? This could probably be done by just allocating the
1051 base types at the end of this TREE_VEC (instead of using
1052 another TREE_VEC). This would simplify the calculation
1053 of how many basetypes a given type had. */
1054 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1055 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1057 /* The number of basetypes for NODE. */
1058 #define BINFO_N_BASETYPES(NODE) \
1059 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1061 /* Accessor macro to get to the Nth basetype of this basetype. */
1062 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1063 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1065 /* For a BINFO record describing a virtual base class, i.e., one where
1066 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1067 base. The actual contents are language-dependent. Under the old
1068 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1069 pointer to the virtual base; under the new ABI this field is
1070 instead a INTEGER_CST giving an offset into the vtable where the
1071 offset to the virtual base can be found. */
1072 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1074 /* The size of a base class subobject of this type. Not all frontends
1075 currently allocate the space for these fields. */
1076 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1077 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1078 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1079 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1081 /* Slot used to build a chain that represents a use of inheritance.
1082 For example, if X is derived from Y, and Y is derived from Z,
1083 then this field can be used to link the binfo node for X to
1084 the binfo node for X's Y to represent the use of inheritance
1085 from X to Y. Similarly, this slot of the binfo node for X's Y
1086 can point to the Z from which Y is inherited (in X's inheritance
1087 hierarchy). In this fashion, one can represent and traverse specific
1088 uses of inheritance using the binfo nodes themselves (instead of
1089 consing new space pointing to binfo nodes).
1090 It is up to the language-dependent front-ends to maintain
1091 this information as necessary. */
1092 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1094 /* Define fields and accessors for nodes representing declared names. */
1096 /* Nonzero if DECL represents a decl. */
1097 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1098 /* This is the name of the object as written by the user.
1099 It is an IDENTIFIER_NODE. */
1100 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1101 /* This is the name of the object as the assembler will see it
1102 (but before any translations made by ASM_OUTPUT_LABELREF).
1103 Often this is the same as DECL_NAME.
1104 It is an IDENTIFIER_NODE. */
1105 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1106 /* Records the section name in a section attribute. Used to pass
1107 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1108 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1109 /* For FIELD_DECLs, this is the
1110 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1111 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1112 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1113 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1114 type, or NULL_TREE if the given decl has "file scope". */
1115 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1116 #define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1117 /* In a DECL this is the field where configuration dependent machine
1118 attributes are store */
1119 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1120 /* In a FIELD_DECL, this is the field position, counting in bits,
1121 of the bit closest to the beginning of the structure. */
1122 #define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1123 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1124 if so, the type that was originally specified for it.
1125 TREE_TYPE may have been modified (in finish_struct). */
1126 #define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1127 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1128 /* VAR_DECL and PARM_DECL reserve the arguments slot
1129 for language-specific uses. */
1130 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1131 /* In FUNCTION_DECL, holds the decl for the return value. */
1132 #define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result)
1133 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1134 #define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1135 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1136 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result)
1137 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1138 For a VAR_DECL, holds the initial value.
1139 For a PARM_DECL, not used--default
1140 values for parameters are encoded in the type of the function,
1141 not in the PARM_DECL slot. */
1142 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1143 /* For a PARM_DECL, records the data type used to pass the argument,
1144 which may be different from the type seen in the program. */
1145 #define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial)
1146 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1147 if nonzero, indicates that the field occupies the type. */
1148 #define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial)
1149 /* These two fields describe where in the source code the declaration was. */
1150 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1151 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1152 /* Holds the size of the datum, in bits, as a tree expression.
1153 Need not be constant. */
1154 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1155 /* Likewise for the size in bytes. */
1156 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1157 /* Holds the alignment required for the datum. */
1158 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.u)
1159 /* Holds the machine mode corresponding to the declaration of a variable or
1160 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1162 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1163 /* Holds the RTL expression for the value of a variable or function. If
1164 PROMOTED_MODE is defined, the mode of this expression may not be same
1165 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1166 to the variable's data type, while the mode
1167 of DECL_RTL is the mode actually used to contain the data. */
1168 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1169 /* Holds an INSN_LIST of all of the live ranges in which the variable
1170 has been moved to a possibly different register. */
1171 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1172 /* For PARM_DECL, holds an RTL for the stack slot or register
1173 where the data was actually passed. */
1174 #define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.u2.r)
1175 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1176 #define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.u2.f)
1177 /* For FUNCTION_DECL, if it is inline,
1178 holds the size of the stack frame, as an integer. */
1179 #define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.u1.i)
1180 /* For FUNCTION_DECL, if it is built-in,
1181 this identifies which built-in operation it is. */
1182 #define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.u1.f)
1184 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1185 Before the struct containing the FUNCTION_DECL is laid out,
1186 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1187 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1188 function. When the class is laid out, this pointer is changed
1189 to an INTEGER_CST node which is suitable for use as an index
1190 into the virtual function table. */
1191 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1192 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1193 which this FIELD_DECL is defined. This information is needed when
1194 writing debugging information about vfield and vbase decls for C++. */
1195 #define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex)
1197 /* Every ..._DECL node gets a unique number. */
1198 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1200 /* For any sort of a ..._DECL node, this points to the original (abstract)
1201 decl node which this decl is an instance of, or else it is NULL indicating
1202 that this decl is not an instance of some other decl. For example,
1203 in a nested declaration of an inline function, this points back to the
1205 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1207 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1208 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1209 #define DECL_ORIGIN(NODE) \
1210 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1212 /* Nonzero for any sort of ..._DECL node means this decl node represents
1213 an inline instance of some original (abstract) decl from an inline function;
1214 suppress any warnings about shadowing some other variable.
1215 FUNCTION_DECL nodes can also have their abstract origin set to themselves
1216 (see save_for_inline_copying). */
1217 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1218 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1220 /* Nonzero if a _DECL means that the name of this decl should be ignored
1221 for symbolic debug purposes. */
1222 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1224 /* Nonzero for a given ..._DECL node means that this node represents an
1225 "abstract instance" of the given declaration (e.g. in the original
1226 declaration of an inline function). When generating symbolic debugging
1227 information, we mustn't try to generate any address information for nodes
1228 marked as "abstract instances" because we don't actually generate
1229 any code or allocate any data space for such instances. */
1230 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1232 /* Nonzero if a _DECL means that no warnings should be generated just
1233 because this decl is unused. */
1234 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1236 /* Nonzero for a given ..._DECL node means that this node should be
1237 put in .common, if possible. If a DECL_INITIAL is given, and it
1238 is not error_mark_node, then the decl cannot be put in .common. */
1239 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1241 /* Language-specific decl information. */
1242 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1244 /* In a VAR_DECL or FUNCTION_DECL,
1245 nonzero means external reference:
1246 do not allocate storage, and refer to a definition elsewhere. */
1247 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1249 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1251 #define DEFAULT_INIT_PRIORITY 65535
1252 #define MAX_INIT_PRIORITY 65535
1253 #define MAX_RESERVED_INIT_PRIORITY 100
1256 nonzero means the detail info about this type is not dumped into stabs.
1257 Instead it will generate cross reference ('x') of names.
1258 This uses the same flag as DECL_EXTERNAL. */
1259 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1262 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1263 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1264 /* In LABEL_DECL nodes, nonzero means that an error message about
1265 jumping into such a binding contour has been printed for this label. */
1266 #define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1267 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1268 #define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1269 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1270 static chain is not needed. */
1271 #define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1273 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1274 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1276 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1278 Also set in some languages for variables, etc., outside the normal
1279 lexical scope, such as class instance variables. */
1280 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1282 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1283 where it is called. */
1284 #define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1286 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1287 that is not specified by ansi C and that users are supposed to be allowed
1288 to redefine for any purpose whatever. */
1289 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1291 /* Nonzero in a FUNCTION_DECL means this function should be treated
1292 as if it were a malloc, meaning it returns a pointer that is
1294 #define DECL_IS_MALLOC(NODE) (DECL_CHECK (NODE)->decl.malloc_flag)
1296 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1298 #define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1299 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1300 contour that restored a stack level and which is now exited. */
1301 #define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1303 /* Unused in FUNCTION_DECL. */
1305 /* In a VAR_DECL that's static,
1306 nonzero if the space is in the text section. */
1307 #define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1309 /* In a FUNCTION_DECL, nonzero means a built in function. */
1310 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1311 /* For a builtin function, identify which part of the compiler defined it. */
1312 #define DECL_BUILT_IN_CLASS(NODE) (DECL_CHECK (NODE)->decl.built_in_class)
1314 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1315 Used in FIELD_DECLs for vtable pointers.
1316 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1317 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1319 /* Used to indicate that the linkage status of this DECL is not yet known,
1320 so it should not be output now. */
1321 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1323 /* Used in PARM_DECLs whose type are unions to indicate that the
1324 argument should be passed in the same way that the first union
1325 alternative would be passed. */
1326 #define DECL_TRANSPARENT_UNION(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1328 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1329 at the beginning or end of execution. */
1330 #define DECL_STATIC_CONSTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_ctor_flag)
1331 #define DECL_STATIC_DESTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_dtor_flag)
1333 /* Used to indicate that this DECL represents a compiler-generated entity. */
1334 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1336 /* Used to indicate that this DECL has weak linkage. */
1337 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1339 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1340 multiple translation units should be merged. */
1341 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1343 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1344 not be put out unless it is needed in this translation unit.
1345 Entities like this are shared across translation units (like weak
1346 entities), but are guaranteed to be generated by any translation
1347 unit that needs them, and therefore need not be put out anywhere
1348 where they are not needed. DECL_COMDAT is just a hint to the
1349 back-end; it is up to front-ends which set this flag to ensure
1350 that there will never be any harm, other than bloat, in putting out
1351 something which is DECL_COMDAT. */
1352 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1354 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1355 be instrumented with calls to support routines. */
1356 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) ((NODE)->decl.no_instrument_function_entry_exit)
1358 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1359 disabled in this function. */
1360 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) ((NODE)->decl.no_check_memory_usage)
1362 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1363 disabled in this function. */
1364 #define DECL_NO_LIMIT_STACK(NODE) ((NODE)->decl.no_limit_stack)
1366 /* Additional flags for language-specific uses. */
1367 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1368 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1369 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1370 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1371 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1372 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1373 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1374 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1376 /* Used to indicate that the pointer to this DECL cannot be treated as
1377 an address constant. */
1378 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1380 /* Used to indicate an alias set for the memory pointed to by this
1381 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1382 pointer (or reference) type. */
1383 #define DECL_POINTER_ALIAS_SET(NODE) \
1384 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1386 /* Nonzero if an alias set has been assigned to this declaration. */
1387 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1388 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1392 char common[sizeof (struct tree_common)];
1396 union tree_node *size;
1397 #ifdef ONLY_INT_FIELDS
1400 enum machine_mode mode : 8;
1403 unsigned external_flag : 1;
1404 unsigned nonlocal_flag : 1;
1405 unsigned regdecl_flag : 1;
1406 unsigned inline_flag : 1;
1407 unsigned bit_field_flag : 1;
1408 unsigned virtual_flag : 1;
1409 unsigned ignored_flag : 1;
1410 unsigned abstract_flag : 1;
1412 unsigned in_system_header_flag : 1;
1413 unsigned common_flag : 1;
1414 unsigned defer_output : 1;
1415 unsigned transparent_union : 1;
1416 unsigned static_ctor_flag : 1;
1417 unsigned static_dtor_flag : 1;
1418 unsigned artificial_flag : 1;
1419 unsigned weak_flag : 1;
1421 unsigned non_addr_const_p : 1;
1422 unsigned no_instrument_function_entry_exit : 1;
1423 unsigned no_check_memory_usage : 1;
1424 unsigned comdat_flag : 1;
1425 unsigned malloc_flag : 1;
1426 unsigned no_limit_stack : 1;
1427 #ifdef ONLY_INT_FIELDS
1428 unsigned int built_in_class : 2;
1430 enum built_in_class built_in_class : 2;
1433 unsigned lang_flag_0 : 1;
1434 unsigned lang_flag_1 : 1;
1435 unsigned lang_flag_2 : 1;
1436 unsigned lang_flag_3 : 1;
1437 unsigned lang_flag_4 : 1;
1438 unsigned lang_flag_5 : 1;
1439 unsigned lang_flag_6 : 1;
1440 unsigned lang_flag_7 : 1;
1442 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1443 If built-in, this is the code for which built-in function.
1444 For other kinds of decls, this is DECL_ALIGN. */
1448 enum built_in_function f;
1451 union tree_node *size_unit;
1452 union tree_node *name;
1453 union tree_node *context;
1454 union tree_node *arguments; /* Also used for DECL_FIELD_BITPOS */
1455 union tree_node *result; /* Also used for DECL_BIT_FIELD_TYPE */
1456 union tree_node *initial; /* Also used for DECL_QUALIFIER */
1457 union tree_node *abstract_origin;
1458 union tree_node *assembler_name;
1459 union tree_node *section_name;
1460 union tree_node *machine_attributes;
1461 struct rtx_def *rtl; /* RTL representation for object. */
1462 struct rtx_def *live_range_rtl;
1464 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1465 In PARM_DECL, holds an RTL for the stack slot
1466 of register where the data was actually passed.
1467 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1475 union tree_node *vindex;
1476 int pointer_alias_set;
1477 /* Points to a structure whose details depend on the language in use. */
1478 struct lang_decl *lang_specific;
1481 /* Define the overall contents of a tree node.
1482 It may be any of the structures declared above
1483 for various types of node. */
1487 struct tree_common common;
1488 struct tree_int_cst int_cst;
1489 struct tree_real_cst real_cst;
1490 struct tree_string string;
1491 struct tree_complex complex;
1492 struct tree_identifier identifier;
1493 struct tree_decl decl;
1494 struct tree_type type;
1495 struct tree_list list;
1496 struct tree_vec vec;
1497 struct tree_exp exp;
1498 struct tree_block block;
1501 /* Standard named or nameless data types of the C compiler. */
1525 TI_COMPLEX_INTEGER_TYPE,
1526 TI_COMPLEX_FLOAT_TYPE,
1527 TI_COMPLEX_DOUBLE_TYPE,
1528 TI_COMPLEX_LONG_DOUBLE_TYPE,
1532 TI_LONG_DOUBLE_TYPE,
1543 extern tree global_trees[TI_MAX];
1545 #define error_mark_node global_trees[TI_ERROR_MARK]
1547 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1548 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1549 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1550 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1551 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1553 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1554 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1555 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1556 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1557 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1559 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1560 #define integer_one_node global_trees[TI_INTEGER_ONE]
1561 #define size_zero_node global_trees[TI_SIZE_ZERO]
1562 #define size_one_node global_trees[TI_SIZE_ONE]
1563 #define null_pointer_node global_trees[TI_NULL_POINTER]
1565 #define float_type_node global_trees[TI_FLOAT_TYPE]
1566 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1567 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1569 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1570 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1571 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1572 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1574 #define void_type_node global_trees[TI_VOID_TYPE]
1575 /* The C type `void *'. */
1576 #define ptr_type_node global_trees[TI_PTR_TYPE]
1577 /* The C type `const void *'. */
1578 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1579 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1580 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1582 /* An enumeration of the standard C integer types. These must be
1583 ordered so that shorter types appear before longer ones. */
1584 enum integer_type_kind
1596 itk_unsigned_long_long,
1600 typedef enum integer_type_kind integer_type_kind;
1602 /* The standard C integer types. Use integer_type_kind to index into
1604 extern tree integer_types[itk_none];
1606 #define char_type_node integer_types[itk_char]
1607 #define signed_char_type_node integer_types[itk_signed_char]
1608 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1609 #define short_integer_type_node integer_types[itk_short]
1610 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1611 #define integer_type_node integer_types[itk_int]
1612 #define unsigned_type_node integer_types[itk_unsigned_int]
1613 #define long_integer_type_node integer_types[itk_long]
1614 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1615 #define long_long_integer_type_node integer_types[itk_long_long]
1616 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1619 #define NULL_TREE (tree) NULL
1621 /* The following functions accept a wide integer argument. Rather than
1622 having to cast on every function call, we use a macro instead, that is
1623 defined here and in rtl.h. */
1626 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1627 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1629 extern int exact_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1630 extern int floor_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1632 extern char *oballoc PARAMS ((int));
1633 extern char *permalloc PARAMS ((int));
1634 extern char *savealloc PARAMS ((int));
1635 extern char *expralloc PARAMS ((int));
1637 /* Lowest level primitive for allocating a node.
1638 The TREE_CODE is the only argument. Contents are initialized
1639 to zero except for a few of the common fields. */
1641 extern tree make_node PARAMS ((enum tree_code));
1642 extern tree make_lang_type PARAMS ((enum tree_code));
1643 extern tree (*make_lang_type_fn) PARAMS ((enum tree_code));
1645 /* Make a copy of a node, with all the same contents except
1646 for TREE_PERMANENT. (The copy is permanent
1647 iff nodes being made now are permanent.) */
1649 extern tree copy_node PARAMS ((tree));
1651 /* Make a copy of a chain of TREE_LIST nodes. */
1653 extern tree copy_list PARAMS ((tree));
1655 /* Make a TREE_VEC. */
1657 extern tree make_tree_vec PARAMS ((int));
1659 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1660 The name is supplied as a char *. */
1662 extern tree get_identifier PARAMS ((const char *));
1664 /* If an identifier with the name TEXT (a null-terminated string) has
1665 previously been referred to, return that node; otherwise return
1668 extern tree maybe_get_identifier PARAMS ((const char *));
1670 /* Construct various types of nodes. */
1672 #define build_int_2(LO,HI) \
1673 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1675 extern tree build PARAMS ((enum tree_code, tree, ...));
1676 extern tree build_nt PARAMS ((enum tree_code, ...));
1677 extern tree build_parse_node PARAMS ((enum tree_code, ...));
1679 extern tree build_int_2_wide PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT));
1680 extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE));
1681 extern tree build_real_from_int_cst PARAMS ((tree, tree));
1682 extern tree build_complex PARAMS ((tree, tree, tree));
1683 extern tree build_string PARAMS ((int, const char *));
1684 extern tree build1 PARAMS ((enum tree_code, tree, tree));
1685 extern tree build_tree_list PARAMS ((tree, tree));
1686 extern tree build_decl_list PARAMS ((tree, tree));
1687 extern tree build_expr_list PARAMS ((tree, tree));
1688 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
1689 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
1690 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
1692 /* Construct various nodes representing data types. */
1694 extern tree make_signed_type PARAMS ((int));
1695 extern tree make_unsigned_type PARAMS ((int));
1696 extern void initialize_sizetypes PARAMS ((void));
1697 extern void set_sizetype PARAMS ((tree));
1698 extern tree signed_or_unsigned_type PARAMS ((int, tree));
1699 extern void fixup_unsigned_type PARAMS ((tree));
1700 extern tree build_pointer_type PARAMS ((tree));
1701 extern tree build_reference_type PARAMS ((tree));
1702 extern tree build_index_type PARAMS ((tree));
1703 extern tree build_index_2_type PARAMS ((tree, tree));
1704 extern tree build_array_type PARAMS ((tree, tree));
1705 extern tree build_function_type PARAMS ((tree, tree));
1706 extern tree build_method_type PARAMS ((tree, tree));
1707 extern tree build_offset_type PARAMS ((tree, tree));
1708 extern tree build_complex_type PARAMS ((tree));
1709 extern tree array_type_nelts PARAMS ((tree));
1711 extern tree value_member PARAMS ((tree, tree));
1712 extern tree purpose_member PARAMS ((tree, tree));
1713 extern tree binfo_member PARAMS ((tree, tree));
1714 extern unsigned int attribute_hash_list PARAMS ((tree));
1715 extern int attribute_list_equal PARAMS ((tree, tree));
1716 extern int attribute_list_contained PARAMS ((tree, tree));
1717 extern int tree_int_cst_equal PARAMS ((tree, tree));
1718 extern int tree_int_cst_lt PARAMS ((tree, tree));
1719 extern int host_integerp PARAMS ((tree, int));
1720 extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
1721 extern int tree_int_cst_msb PARAMS ((tree));
1722 extern int tree_int_cst_sgn PARAMS ((tree));
1723 extern int index_type_equal PARAMS ((tree, tree));
1724 extern tree get_inner_array_type PARAMS ((tree));
1726 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1727 put the prototype here. Rtl.h does declare the prototype if
1728 tree.h had been included. */
1730 extern tree make_tree PARAMS ((tree, struct rtx_def *));
1732 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1735 Such modified types already made are recorded so that duplicates
1738 extern tree build_type_attribute_variant PARAMS ((tree, tree));
1739 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
1741 extern tree merge_machine_decl_attributes PARAMS ((tree, tree));
1742 extern tree merge_machine_type_attributes PARAMS ((tree, tree));
1744 /* Split a list of declspecs and attributes into two. */
1746 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
1748 /* Strip attributes from a list of combined specs and attrs. */
1750 extern tree strip_attrs PARAMS ((tree));
1752 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1754 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
1756 /* Given a tree node and a string, return non-zero if the tree node is
1757 a valid attribute name for the string. */
1759 extern int is_attribute_p PARAMS ((const char *, tree));
1761 /* Given an attribute name and a list of attributes, return the list element
1762 of the attribute or NULL_TREE if not found. */
1764 extern tree lookup_attribute PARAMS ((const char *, tree));
1766 /* Given two attributes lists, return a list of their union. */
1768 extern tree merge_attributes PARAMS ((tree, tree));
1770 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
1771 the same kind of data as TYPE describes. Variants point to the
1772 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
1773 and it points to a chain of other variants so that duplicate
1774 variants are never made. Only main variants should ever appear as
1775 types of expressions. */
1777 extern tree build_qualified_type PARAMS ((tree, int));
1779 /* Like build_qualified_type, but only deals with the `const' and
1780 `volatile' qualifiers. This interface is retained for backwards
1781 compatiblity with the various front-ends; new code should use
1782 build_qualified_type instead. */
1784 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
1785 build_qualified_type (TYPE, \
1786 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
1787 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
1789 /* Make a copy of a type node. */
1791 extern tree build_type_copy PARAMS ((tree));
1793 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1794 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
1795 node, does nothing except for the first time. */
1797 extern void layout_type PARAMS ((tree));
1799 /* These functions allow a front-end to perform a manual layout of a
1800 RECORD_TYPE. (For instance, if the placement of subsequent fields
1801 depends on the placement of fields so far.) Begin by calling
1802 new_record_layout_info. Then, call layout_field for each of the
1803 fields. Then, call finish_record_layout. See layout_type for the
1804 default way in which these functions are used. */
1806 struct record_layout_info_s
1808 /* The RECORD_TYPE that we are laying out. */
1810 /* The size of the record so far, in bits. */
1811 unsigned HOST_WIDE_INT const_size;
1812 /* The alignment of the record so far, in bits. */
1813 unsigned int record_align;
1814 /* If the record can have a variable size, then this will be
1815 non-NULL, and the total size will be CONST_SIZE + VAR_SIZE. */
1817 /* If the record can have a variable size, then this will be the
1818 maximum alignment that we know VAR_SIZE has. */
1819 unsigned int var_align;
1820 /* The static variables (i.e., class variables, as opposed to
1821 instance variables) encountered in T. */
1822 tree pending_statics;
1823 unsigned int unpacked_align;
1824 int packed_maybe_necessary;
1827 typedef struct record_layout_info_s *record_layout_info;
1829 extern record_layout_info new_record_layout_info
1831 extern void layout_field PARAMS ((record_layout_info, tree));
1832 extern void finish_record_layout PARAMS ((record_layout_info));
1834 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1835 return a canonicalized ..._TYPE node, so that duplicates are not made.
1836 How the hash code is computed is up to the caller, as long as any two
1837 callers that could hash identical-looking type nodes agree. */
1839 extern tree type_hash_canon PARAMS ((unsigned int, tree));
1841 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1842 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1843 fields. Call this only once for any given decl node.
1845 Second argument is the boundary that this field can be assumed to
1846 be starting at (in bits). Zero means it can be assumed aligned
1847 on any boundary that may be needed. */
1849 extern void layout_decl PARAMS ((tree, unsigned));
1851 /* Return the mode for data of a given size SIZE and mode class CLASS.
1852 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
1853 The value is BLKmode if no other mode is found. This is like
1854 mode_for_size, but is passed a tree. */
1856 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
1859 /* Return an expr equal to X but certainly not valid as an lvalue. */
1861 extern tree non_lvalue PARAMS ((tree));
1862 extern tree pedantic_non_lvalue PARAMS ((tree));
1864 extern tree convert PARAMS ((tree, tree));
1865 extern unsigned int expr_align PARAMS ((tree));
1866 extern tree size_in_bytes PARAMS ((tree));
1867 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
1868 extern tree bit_position PARAMS ((tree));
1869 extern HOST_WIDE_INT int_bit_position PARAMS ((tree));
1871 /* Define data structures, macros, and functions for handling sizes
1872 and the various types used to represent sizes. */
1876 SIZETYPE, /* Normal representation of sizes in bytes. */
1877 SSIZETYPE, /* Signed representation of sizes in bytes. */
1878 USIZETYPE, /* Unsigned representation of sizes in bytes. */
1879 BITSIZETYPE, /* Normal representation of sizes in bits. */
1880 SBITSIZETYPE, /* Signed representation of sizes in bits. */
1881 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
1884 extern tree sizetype_tab[(int) TYPE_KIND_LAST];
1886 #define sizetype sizetype_tab[(int) SIZETYPE]
1887 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
1888 #define ssizetype sizetype_tab[(int) SSIZETYPE]
1889 #define usizetype sizetype_tab[(int) USIZETYPE]
1890 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
1891 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
1893 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
1894 extern tree size_diffop PARAMS ((tree, tree));
1895 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
1896 enum size_type_kind));
1897 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
1899 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
1900 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
1901 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
1902 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
1903 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
1905 extern tree round_up PARAMS ((tree, int));
1906 extern tree get_pending_sizes PARAMS ((void));
1907 extern void put_pending_sizes PARAMS ((tree));
1909 /* Type for sizes of data-type. */
1911 #define BITS_PER_UNIT_LOG \
1912 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1913 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1914 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1916 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1917 extern unsigned int maximum_field_alignment;
1919 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1920 extern unsigned int set_alignment;
1922 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1923 by making the last node in X point to Y.
1924 Returns X, except if X is 0 returns Y. */
1926 extern tree chainon PARAMS ((tree, tree));
1928 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1930 extern tree tree_cons PARAMS ((tree, tree, tree));
1931 extern tree perm_tree_cons PARAMS ((tree, tree, tree));
1932 extern tree temp_tree_cons PARAMS ((tree, tree, tree));
1933 extern tree saveable_tree_cons PARAMS ((tree, tree, tree));
1934 extern tree decl_tree_cons PARAMS ((tree, tree, tree));
1935 extern tree expr_tree_cons PARAMS ((tree, tree, tree));
1937 /* Return the last tree node in a chain. */
1939 extern tree tree_last PARAMS ((tree));
1941 /* Reverse the order of elements in a chain, and return the new head. */
1943 extern tree nreverse PARAMS ((tree));
1945 /* Returns the length of a chain of nodes
1946 (number of chain pointers to follow before reaching a null pointer). */
1948 extern int list_length PARAMS ((tree));
1950 /* Returns the number of FIELD_DECLs in a type. */
1952 extern int fields_length PARAMS ((tree));
1954 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1956 extern int integer_zerop PARAMS ((tree));
1958 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1960 extern int integer_onep PARAMS ((tree));
1962 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1963 all of whose significant bits are 1. */
1965 extern int integer_all_onesp PARAMS ((tree));
1967 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1968 exactly one bit 1. */
1970 extern int integer_pow2p PARAMS ((tree));
1972 /* staticp (tree x) is nonzero if X is a reference to data allocated
1973 at a fixed address in memory. */
1975 extern int staticp PARAMS ((tree));
1977 /* Gets an error if argument X is not an lvalue.
1978 Also returns 1 if X is an lvalue, 0 if not. */
1980 extern int lvalue_or_else PARAMS ((tree, const char *));
1982 /* save_expr (EXP) returns an expression equivalent to EXP
1983 but it can be used multiple times within context CTX
1984 and only evaluate EXP once. */
1986 extern tree save_expr PARAMS ((tree));
1988 /* Returns the index of the first non-tree operand for CODE, or the number
1989 of operands if all are trees. */
1991 extern int first_rtl_op PARAMS ((enum tree_code));
1993 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1994 can be used multiple times and will evaluate EXP in its entirety
1997 extern tree unsave_expr PARAMS ((tree));
1999 /* Reset EXP in place so that it can be expaned again. Does not
2000 recurse into subtrees. */
2002 extern void unsave_expr_1 PARAMS ((tree));
2004 /* Like unsave_expr_1, but recurses into all subtrees. */
2006 extern tree unsave_expr_now PARAMS ((tree));
2008 /* If non-null, these are language-specific helper functions for
2009 unsave_expr_now. If present, LANG_UNSAVE is called before its
2010 argument (an UNSAVE_EXPR) is to be unsaved, and all other
2011 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
2012 called from unsave_expr_1 for language-specific tree codes. */
2013 extern void (*lang_unsave) PARAMS ((tree *));
2014 extern void (*lang_unsave_expr_now) PARAMS ((tree));
2016 /* If non-null, a language specific version of safe_for_unsave. */
2017 extern int (*lang_safe_for_unsave) PARAMS ((tree));
2019 /* Return nonzero if it is safe to unsave EXPR, else return zero.
2020 It is not safe to unsave EXPR if it contains any embedded RTL_EXPRs. */
2021 extern int safe_for_unsave PARAMS ((tree));
2023 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2024 or offset that depends on a field within a record.
2026 Note that we only allow such expressions within simple arithmetic
2029 extern int contains_placeholder_p PARAMS ((tree));
2031 /* Return 1 if EXP contains any expressions that produce cleanups for an
2032 outer scope to deal with. Used by fold. */
2034 extern int has_cleanups PARAMS ((tree));
2036 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2037 return a tree with all occurrences of references to F in a
2038 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2039 contains only arithmetic expressions. */
2041 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
2043 /* variable_size (EXP) is like save_expr (EXP) except that it
2044 is for the special case of something that is part of a
2045 variable size for a data type. It makes special arrangements
2046 to compute the value at the right time when the data type
2047 belongs to a function parameter. */
2049 extern tree variable_size PARAMS ((tree));
2051 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2052 but it can be used multiple times
2053 and only evaluate the subexpressions once. */
2055 extern tree stabilize_reference PARAMS ((tree));
2057 /* Subroutine of stabilize_reference; this is called for subtrees of
2058 references. Any expression with side-effects must be put in a SAVE_EXPR
2059 to ensure that it is only evaluated once. */
2061 extern tree stabilize_reference_1 PARAMS ((tree));
2063 /* Return EXP, stripped of any conversions to wider types
2064 in such a way that the result of converting to type FOR_TYPE
2065 is the same as if EXP were converted to FOR_TYPE.
2066 If FOR_TYPE is 0, it signifies EXP's type. */
2068 extern tree get_unwidened PARAMS ((tree, tree));
2070 /* Return OP or a simpler expression for a narrower value
2071 which can be sign-extended or zero-extended to give back OP.
2072 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2073 or 0 if the value should be sign-extended. */
2075 extern tree get_narrower PARAMS ((tree, int *));
2077 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2079 The definition of this resides in language-specific code
2080 as the repertoire of available types may vary. */
2082 extern tree type_for_mode PARAMS ((enum machine_mode, int));
2084 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2085 for an integer type with at least that precision.
2086 The definition of this resides in language-specific code
2087 as the repertoire of available types may vary. */
2089 extern tree type_for_size PARAMS ((unsigned, int));
2091 /* Given an integer type T, return a type like T but unsigned.
2092 If T is unsigned, the value is T.
2093 The definition of this resides in language-specific code
2094 as the repertoire of available types may vary. */
2096 extern tree unsigned_type PARAMS ((tree));
2098 /* Given an integer type T, return a type like T but signed.
2099 If T is signed, the value is T.
2100 The definition of this resides in language-specific code
2101 as the repertoire of available types may vary. */
2103 extern tree signed_type PARAMS ((tree));
2105 /* This function must be defined in the language-specific files.
2106 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2107 This is defined in a language-specific file. */
2109 extern tree maybe_build_cleanup PARAMS ((tree));
2111 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2112 look for nested component-refs or array-refs at constant positions
2113 and find the ultimate containing object, which is returned. */
2115 extern tree get_inner_reference PARAMS ((tree, int *, int *, tree *,
2116 enum machine_mode *, int *,
2117 int *, unsigned int *));
2119 /* Given a DECL or TYPE, return the scope in which it was declared, or
2120 NUL_TREE if there is no containing scope. */
2122 extern tree get_containing_scope PARAMS ((tree));
2124 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2126 extern tree decl_function_context PARAMS ((tree));
2128 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2129 this _DECL with its context, or zero if none. */
2130 extern tree decl_type_context PARAMS ((tree));
2132 /* Given the FUNCTION_DECL for the current function,
2133 return zero if it is ok for this function to be inline.
2134 Otherwise return a warning message with a single %s
2135 for the function's name. */
2137 extern const char *function_cannot_inline_p PARAMS ((tree));
2139 /* Return 1 if EXPR is the real constant zero. */
2140 extern int real_zerop PARAMS ((tree));
2142 /* Declare commonly used variables for tree structure. */
2144 /* Points to the name of the input file from which the current input
2145 being parsed originally came (before it went into cpp). */
2146 extern char *input_filename;
2148 /* Current line number in input file. */
2151 /* Nonzero for -pedantic switch: warn about anything
2152 that standard C forbids. */
2153 extern int pedantic;
2155 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2156 Zero means allow extended lvalues. */
2158 extern int pedantic_lvalues;
2160 /* Nonzero means can safely call expand_expr now;
2161 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2163 extern int immediate_size_expand;
2165 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2167 extern tree current_function_decl;
2169 /* Nonzero means a FUNC_BEGIN label was emitted. */
2170 extern tree current_function_func_begin_label;
2172 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2174 extern int all_types_permanent;
2176 /* Pointer to function to compute the name to use to print a declaration.
2177 DECL is the declaration in question.
2178 VERBOSITY determines what information will be printed:
2179 0: DECL_NAME, demangled as necessary.
2180 1: and scope information.
2181 2: and any other information that might be interesting, such as function
2182 parameter types in C++. */
2184 extern const char *(*decl_printable_name) PARAMS ((tree, int));
2186 /* Pointer to function to finish handling an incomplete decl at the
2187 end of compilation. */
2189 extern void (*incomplete_decl_finalize_hook) PARAMS ((tree));
2191 extern char *init_parse PARAMS ((char *));
2192 extern void finish_parse PARAMS ((void));
2194 extern const char * const language_string;
2196 /* Declare a predefined function. Return the declaration. This function is
2197 provided by each language frontend. */
2198 extern tree builtin_function PARAMS ((const char *, tree, int,
2199 enum built_in_class,
2203 extern char *perm_calloc PARAMS ((int, long));
2204 extern tree get_file_function_name PARAMS ((int));
2205 extern tree get_file_function_name_long PARAMS ((const char *));
2206 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2207 extern tree get_set_constructor_bytes PARAMS ((tree,
2208 unsigned char *, int));
2209 extern int get_alias_set PARAMS ((tree));
2210 extern int new_alias_set PARAMS ((void));
2211 extern int (*lang_get_alias_set) PARAMS ((tree));
2212 extern tree get_callee_fndecl PARAMS ((tree));
2216 extern int in_control_zone_p PARAMS ((void));
2217 extern void expand_fixups PARAMS ((struct rtx_def *));
2218 extern tree expand_start_stmt_expr PARAMS ((void));
2219 extern tree expand_end_stmt_expr PARAMS ((tree));
2220 extern void expand_expr_stmt PARAMS ((tree));
2221 extern int warn_if_unused_value PARAMS ((tree));
2222 extern void expand_decl_init PARAMS ((tree));
2223 extern void clear_last_expr PARAMS ((void));
2224 extern void expand_label PARAMS ((tree));
2225 extern void expand_goto PARAMS ((tree));
2226 extern void expand_asm PARAMS ((tree));
2227 extern void expand_start_cond PARAMS ((tree, int));
2228 extern void expand_end_cond PARAMS ((void));
2229 extern void expand_start_else PARAMS ((void));
2230 extern void expand_start_elseif PARAMS ((tree));
2231 extern struct nesting *expand_start_loop PARAMS ((int));
2232 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2233 extern void expand_loop_continue_here PARAMS ((void));
2234 extern void expand_end_loop PARAMS ((void));
2235 extern int expand_continue_loop PARAMS ((struct nesting *));
2236 extern int expand_exit_loop PARAMS ((struct nesting *));
2237 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2239 extern int expand_exit_something PARAMS ((void));
2241 extern void expand_null_return PARAMS ((void));
2242 extern void expand_return PARAMS ((tree));
2243 extern int optimize_tail_recursion PARAMS ((tree, struct rtx_def *));
2244 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2245 #define expand_start_bindings(flags) \
2246 expand_start_bindings_and_block(flags, NULL_TREE)
2247 extern void expand_end_bindings PARAMS ((tree, int, int));
2248 extern void warn_about_unused_variables PARAMS ((tree));
2249 extern void start_cleanup_deferral PARAMS ((void));
2250 extern void end_cleanup_deferral PARAMS ((void));
2251 extern int is_body_block PARAMS ((tree));
2253 extern void mark_block_as_eh_region PARAMS ((void));
2254 extern void mark_block_as_not_eh_region PARAMS ((void));
2255 extern int is_eh_region PARAMS ((void));
2256 extern int conditional_context PARAMS ((void));
2257 extern tree last_cleanup_this_contour PARAMS ((void));
2258 extern int expand_dhc_cleanup PARAMS ((tree));
2259 extern int expand_dcc_cleanup PARAMS ((tree));
2260 extern void expand_start_case PARAMS ((int, tree, tree,
2262 extern void expand_end_case PARAMS ((tree));
2263 extern int pushcase PARAMS ((tree,
2264 tree (*) (tree, tree),
2266 extern int pushcase_range PARAMS ((tree, tree,
2267 tree (*) (tree, tree),
2269 extern void using_eh_for_cleanups PARAMS ((void));
2270 extern int stmt_loop_nest_empty PARAMS ((void));
2272 /* In fold-const.c */
2274 /* Fold constants as much as possible in an expression.
2275 Returns the simplified expression.
2276 Acts only on the top level of the expression;
2277 if the argument itself cannot be simplified, its
2278 subexpressions are not changed. */
2280 extern tree fold PARAMS ((tree));
2282 extern int force_fit_type PARAMS ((tree, int));
2283 extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2284 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2285 unsigned HOST_WIDE_INT *,
2287 extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2288 unsigned HOST_WIDE_INT *,
2290 extern int mul_double PARAMS ((unsigned HOST_WIDE_INT,
2292 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2293 unsigned HOST_WIDE_INT *,
2295 extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2296 HOST_WIDE_INT, unsigned int,
2297 unsigned HOST_WIDE_INT *,
2298 HOST_WIDE_INT *, int));
2299 extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2300 HOST_WIDE_INT, unsigned int,
2301 unsigned HOST_WIDE_INT *,
2302 HOST_WIDE_INT *, int));
2303 extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2304 HOST_WIDE_INT, unsigned int,
2305 unsigned HOST_WIDE_INT *,
2307 extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2308 HOST_WIDE_INT, unsigned int,
2309 unsigned HOST_WIDE_INT *,
2311 extern int operand_equal_p PARAMS ((tree, tree, int));
2312 extern tree invert_truthvalue PARAMS ((tree));
2314 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2315 function arguments and return the new type. Return NULL_TREE if no
2316 change. Required by any language that supports variadic arguments. */
2318 extern tree (*lang_type_promotes_to) PARAMS ((tree));
2320 /* Interface of the DWARF2 unwind info support. */
2322 /* Decide whether we want to emit frame unwind information for the current
2323 translation unit. */
2325 extern int dwarf2out_do_frame PARAMS ((void));
2327 /* Generate a new label for the CFI info to refer to. */
2329 extern char *dwarf2out_cfi_label PARAMS ((void));
2331 /* Entry point to update the canonical frame address (CFA). */
2333 extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
2335 /* Add the CFI for saving a register window. */
2337 extern void dwarf2out_window_save PARAMS ((char *));
2339 /* Add a CFI to update the running total of the size of arguments pushed
2342 extern void dwarf2out_args_size PARAMS ((char *, long));
2344 /* Entry point for saving a register to the stack. */
2346 extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
2348 /* Entry point for saving the return address in the stack. */
2350 extern void dwarf2out_return_save PARAMS ((char *, long));
2352 /* Entry point for saving the return address in a register. */
2354 extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
2356 /* Output a marker (i.e. a label) for the beginning of a function, before
2359 extern void dwarf2out_begin_prologue PARAMS ((void));
2361 /* Output a marker (i.e. a label) for the absolute end of the generated
2362 code for a function definition. */
2364 extern void dwarf2out_end_epilogue PARAMS ((void));
2366 /* The language front-end must define these functions. */
2368 /* Function of no arguments for initializing options. */
2369 extern void lang_init_options PARAMS ((void));
2371 /* Function of no arguments for initializing lexical scanning. */
2372 extern void init_lex PARAMS ((void));
2373 /* Function of no arguments for initializing the symbol table. */
2374 extern void init_decl_processing PARAMS ((void));
2376 /* Functions called with no arguments at the beginning and end or processing
2377 the input source file. */
2378 extern void lang_init PARAMS ((void));
2379 extern void lang_finish PARAMS ((void));
2381 /* Function to identify which front-end produced the output file. */
2382 extern const char *lang_identify PARAMS ((void));
2384 /* Called by report_error_function to print out function name.
2385 * Default may be overridden by language front-ends. */
2386 extern void (*print_error_function) PARAMS ((const char *));
2388 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2389 extern void copy_lang_decl PARAMS ((tree));
2391 /* Function called with no arguments to parse and compile the input. */
2392 extern int yyparse PARAMS ((void));
2393 /* Function called with option as argument
2394 to decode options starting with -f or -W or +.
2395 It should return nonzero if it handles the option. */
2396 extern int lang_decode_option PARAMS ((int, char **));
2398 /* Functions for processing symbol declarations. */
2399 /* Function to enter a new lexical scope.
2400 Takes one argument: always zero when called from outside the front end. */
2401 extern void pushlevel PARAMS ((int));
2402 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2403 Takes three arguments:
2404 KEEP -- nonzero if there were declarations in this scope.
2405 REVERSE -- reverse the order of decls before returning them.
2406 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2407 extern tree poplevel PARAMS ((int, int, int));
2408 /* Set the BLOCK node for the current scope level. */
2409 extern void set_block PARAMS ((tree));
2410 /* Function to add a decl to the current scope level.
2411 Takes one argument, a decl to add.
2412 Returns that decl, or, if the same symbol is already declared, may
2413 return a different decl for that name. */
2414 extern tree pushdecl PARAMS ((tree));
2415 /* Function to return the chain of decls so far in the current scope level. */
2416 extern tree getdecls PARAMS ((void));
2417 /* Function to return the chain of structure tags in the current scope level. */
2418 extern tree gettags PARAMS ((void));
2420 extern tree build_range_type PARAMS ((tree, tree, tree));
2422 /* Call when starting to parse a declaration:
2423 make expressions in the declaration last the length of the function.
2424 Returns an argument that should be passed to resume_momentary later. */
2425 extern int suspend_momentary PARAMS ((void));
2427 extern int allocation_temporary_p PARAMS ((void));
2429 /* Call when finished parsing a declaration:
2430 restore the treatment of node-allocation that was
2431 in effect before the suspension.
2432 YES should be the value previously returned by suspend_momentary. */
2433 extern void resume_momentary PARAMS ((int));
2435 /* Called after finishing a record, union or enumeral type. */
2436 extern void rest_of_type_compilation PARAMS ((tree, int));
2438 /* Save the current set of obstacks, but don't change them. */
2439 extern void push_obstacks_nochange PARAMS ((void));
2441 extern void permanent_allocation PARAMS ((int));
2443 extern void push_momentary PARAMS ((void));
2445 extern void clear_momentary PARAMS ((void));
2447 extern void pop_momentary PARAMS ((void));
2449 extern void end_temporary_allocation PARAMS ((void));
2451 /* Pop the obstack selection stack. */
2452 extern void pop_obstacks PARAMS ((void));
2455 extern int really_constant_p PARAMS ((tree));
2456 extern void push_obstacks PARAMS ((struct obstack *,
2458 extern void pop_momentary_nofree PARAMS ((void));
2459 extern void preserve_momentary PARAMS ((void));
2460 extern void saveable_allocation PARAMS ((void));
2461 extern void temporary_allocation PARAMS ((void));
2462 extern void resume_temporary_allocation PARAMS ((void));
2463 extern tree get_file_function_name PARAMS ((int));
2464 extern void set_identifier_size PARAMS ((int));
2465 extern int int_fits_type_p PARAMS ((tree, tree));
2466 extern int tree_log2 PARAMS ((tree));
2467 extern int tree_floor_log2 PARAMS ((tree));
2468 extern void preserve_initializer PARAMS ((void));
2469 extern void preserve_data PARAMS ((void));
2470 extern int object_permanent_p PARAMS ((tree));
2471 extern int type_precision PARAMS ((tree));
2472 extern int simple_cst_equal PARAMS ((tree, tree));
2473 extern int compare_tree_int PARAMS ((tree, unsigned int));
2474 extern int type_list_equal PARAMS ((tree, tree));
2475 extern int chain_member PARAMS ((tree, tree));
2476 extern int chain_member_purpose PARAMS ((tree, tree));
2477 extern int chain_member_value PARAMS ((tree, tree));
2478 extern tree listify PARAMS ((tree));
2479 extern tree type_hash_lookup PARAMS ((unsigned int, tree));
2480 extern void type_hash_add PARAMS ((unsigned int, tree));
2481 extern unsigned int type_hash_list PARAMS ((tree));
2482 extern int simple_cst_list_equal PARAMS ((tree, tree));
2483 extern void debug_obstack PARAMS ((char *));
2484 extern void rtl_in_current_obstack PARAMS ((void));
2485 extern void rtl_in_saveable_obstack PARAMS ((void));
2486 extern void init_tree_codes PARAMS ((void));
2487 extern void dump_tree_statistics PARAMS ((void));
2488 extern void print_obstack_statistics PARAMS ((const char *,
2491 extern void print_obstack_name PARAMS ((char *, FILE *, const char *));
2493 extern void expand_function_end PARAMS ((char *, int, int));
2494 extern void expand_function_start PARAMS ((tree, int));
2495 extern int real_onep PARAMS ((tree));
2496 extern int real_twop PARAMS ((tree));
2497 extern void start_identifier_warnings PARAMS ((void));
2498 extern void gcc_obstack_init PARAMS ((struct obstack *));
2499 extern void init_obstacks PARAMS ((void));
2500 extern void obfree PARAMS ((char *));
2501 extern void build_common_tree_nodes PARAMS ((int));
2502 extern void build_common_tree_nodes_2 PARAMS ((int));
2505 extern void setjmp_protect_args PARAMS ((void));
2506 extern void setjmp_protect PARAMS ((tree));
2507 extern void expand_main_function PARAMS ((void));
2508 extern void mark_varargs PARAMS ((void));
2509 extern void init_dummy_function_start PARAMS ((void));
2510 extern void expand_dummy_function_end PARAMS ((void));
2511 extern void init_function_for_compilation PARAMS ((void));
2512 extern void init_function_start PARAMS ((tree, char *, int));
2513 extern void assign_parms PARAMS ((tree));
2514 extern void put_var_into_stack PARAMS ((tree));
2515 extern void uninitialized_vars_warning PARAMS ((tree));
2516 extern void setjmp_args_warning PARAMS ((void));
2517 extern void mark_all_temps_used PARAMS ((void));
2518 extern void init_temp_slots PARAMS ((void));
2519 extern void combine_temp_slots PARAMS ((void));
2520 extern void free_temp_slots PARAMS ((void));
2521 extern void pop_temp_slots PARAMS ((void));
2522 extern void push_temp_slots PARAMS ((void));
2523 extern void preserve_temp_slots PARAMS ((struct rtx_def *));
2524 extern void preserve_rtl_expr_temps PARAMS ((tree));
2525 extern int aggregate_value_p PARAMS ((tree));
2526 extern void free_temps_for_rtl_expr PARAMS ((tree));
2527 extern void instantiate_virtual_regs PARAMS ((tree, struct rtx_def *));
2528 extern void unshare_all_rtl PARAMS ((tree, struct rtx_def *));
2529 extern int max_parm_reg_num PARAMS ((void));
2530 extern void push_function_context PARAMS ((void));
2531 extern void pop_function_context PARAMS ((void));
2532 extern void push_function_context_to PARAMS ((tree));
2533 extern void pop_function_context_from PARAMS ((tree));
2535 /* In print-rtl.c */
2537 extern void print_rtl PARAMS ((FILE *, struct rtx_def *));
2540 /* In print-tree.c */
2541 extern void debug_tree PARAMS ((tree));
2543 extern void print_node PARAMS ((FILE *, const char *, tree, int));
2544 extern void print_node_brief PARAMS ((FILE *, const char *, tree, int));
2545 extern void indent_to PARAMS ((FILE *, int));
2549 extern void emit_queue PARAMS ((void));
2550 extern int apply_args_register_offset PARAMS ((int));
2551 extern struct rtx_def *expand_builtin_return_addr
2552 PARAMS ((enum built_in_function, int, struct rtx_def *));
2553 extern void do_pending_stack_adjust PARAMS ((void));
2554 extern struct rtx_def *expand_assignment PARAMS ((tree, tree, int, int));
2555 extern struct rtx_def *store_expr PARAMS ((tree, struct rtx_def *,
2557 extern void check_max_integer_computation_mode PARAMS ((tree));
2560 extern void start_sequence_for_rtl_expr PARAMS ((tree));
2561 extern struct rtx_def *emit_line_note_after PARAMS ((const char *, int,
2563 extern struct rtx_def *emit_line_note PARAMS ((const char *, int));
2564 extern struct rtx_def *emit_line_note_force PARAMS ((const char *, int));
2567 extern void special_function_p PARAMS ((tree, int *, int *,
2568 int *, int *, int *));
2571 extern int mark_addressable PARAMS ((tree));
2572 extern void incomplete_type_error PARAMS ((tree, tree));
2575 extern void print_lang_statistics PARAMS ((void));
2578 extern tree truthvalue_conversion PARAMS ((tree));
2579 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2583 extern void print_lang_decl PARAMS ((FILE *, tree, int));
2584 extern void print_lang_type PARAMS ((FILE *, tree, int));
2585 extern void print_lang_identifier PARAMS ((FILE *, tree, int));
2587 extern int global_bindings_p PARAMS ((void));
2588 extern void insert_block PARAMS ((tree));
2590 /* In integrate.c */
2591 extern void save_for_inline_nocopy PARAMS ((tree));
2592 extern void save_for_inline_copying PARAMS ((tree));
2593 extern void set_decl_abstract_flags PARAMS ((tree, int));
2594 extern void output_inline_function PARAMS ((tree));
2597 extern void set_yydebug PARAMS ((int));
2599 /* In stor-layout.c */
2600 extern void fixup_signed_type PARAMS ((tree));
2603 extern void make_decl_rtl PARAMS ((tree, const char *, int));
2604 extern void make_decl_one_only PARAMS ((tree));
2605 extern int supports_one_only PARAMS ((void));
2606 extern void variable_section PARAMS ((tree, int));
2608 /* In fold-const.c */
2609 extern int div_and_round_double PARAMS ((enum tree_code, int,
2610 unsigned HOST_WIDE_INT,
2612 unsigned HOST_WIDE_INT,
2614 unsigned HOST_WIDE_INT *,
2616 unsigned HOST_WIDE_INT *,
2620 extern void emit_nop PARAMS ((void));
2621 extern void expand_computed_goto PARAMS ((tree));
2622 extern struct rtx_def *label_rtx PARAMS ((tree));
2623 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
2625 extern int any_pending_cleanups PARAMS ((int));
2626 extern void init_stmt PARAMS ((void));
2627 extern void init_stmt_for_function PARAMS ((void));
2628 extern int drop_through_at_end_p PARAMS ((void));
2629 extern void expand_start_target_temps PARAMS ((void));
2630 extern void expand_end_target_temps PARAMS ((void));
2631 extern void expand_elseif PARAMS ((tree));
2632 extern void expand_decl PARAMS ((tree));
2633 extern int expand_decl_cleanup PARAMS ((tree, tree));
2634 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
2635 extern void move_cleanups_up PARAMS ((void));
2636 extern void expand_start_case_dummy PARAMS ((void));
2637 extern void expand_end_case_dummy PARAMS ((void));
2638 extern tree case_index_expr_type PARAMS ((void));
2639 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
2640 extern void check_for_full_enumeration_handling PARAMS ((tree));
2641 extern void declare_nonlocal_label PARAMS ((tree));
2643 extern void lang_print_xnode PARAMS ((FILE *, tree, int));
2647 /* If KIND=='I', return a suitable global initializer (constructor) name.
2648 If KIND=='D', return a suitable global clean-up (destructor) name. */
2649 extern tree get_file_function_name PARAMS ((int));
2651 /* Interface of the DWARF2 unwind info support. */
2653 /* Decide whether we want to emit frame unwind information for the current
2654 translation unit. */
2656 extern int dwarf2out_do_frame PARAMS ((void));
2658 /* Generate a new label for the CFI info to refer to. */
2660 extern char *dwarf2out_cfi_label PARAMS ((void));
2662 /* Entry point to update the canonical frame address (CFA). */
2664 extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
2666 /* Add the CFI for saving a register window. */
2668 extern void dwarf2out_window_save PARAMS ((char *));
2670 /* Add a CFI to update the running total of the size of arguments pushed
2673 extern void dwarf2out_args_size PARAMS ((char *, long));
2675 /* Entry point for saving a register to the stack. */
2677 extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
2679 /* Entry point for saving the return address in the stack. */
2681 extern void dwarf2out_return_save PARAMS ((char *, long));
2683 /* Entry point for saving the return address in a register. */
2685 extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
2687 /* Output a marker (i.e. a label) for the beginning of a function, before
2690 extern void dwarf2out_begin_prologue PARAMS ((void));
2692 /* Output a marker (i.e. a label) for the absolute end of the generated
2693 code for a function definition. */
2695 extern void dwarf2out_end_epilogue PARAMS ((void));
2697 /* Redefine abort to report an internal error w/o coredump, and
2698 reporting the location of the error in the source file. This logic
2699 is duplicated in rtl.h and tree.h because every file that needs the
2700 special abort includes one or both. toplev.h gets too few files,
2701 system.h gets too many. */
2703 extern void fancy_abort PARAMS ((const char *, int, const char *))
2705 #if (GCC_VERSION >= 2007)
2706 #define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__)
2708 #define abort() fancy_abort (__FILE__, __LINE__, 0)