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 char *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 char *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 raises_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
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 /* Nonzero for a tree node whose evaluation could result
603 in the raising of an exception. Not implemented yet. */
604 #define TREE_RAISES(NODE) ((NODE)->common.raises_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 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
634 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
636 #define INT_CST_LT_UNSIGNED(A, B) \
637 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
638 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
639 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
640 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
641 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
642 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
646 char common[sizeof (struct tree_common)];
647 struct rtx_def *rtl; /* acts as link to register transfer language
649 HOST_WIDE_INT int_cst_low;
650 HOST_WIDE_INT int_cst_high;
653 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
654 and generally in all kinds of constants that could
655 be given labels (rather than being immediate). */
657 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
659 /* In a REAL_CST node. */
660 /* We can represent a real value as either a `double' or a string.
661 Strings don't allow for any optimization, but they do allow
662 for cross-compilation. */
664 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
670 char common[sizeof (struct tree_common)];
671 struct rtx_def *rtl; /* acts as link to register transfer language
673 REAL_VALUE_TYPE real_cst;
676 /* In a STRING_CST */
677 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
678 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
682 char common[sizeof (struct tree_common)];
683 struct rtx_def *rtl; /* acts as link to register transfer language
689 /* In a COMPLEX_CST node. */
690 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
691 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
695 char common[sizeof (struct tree_common)];
696 struct rtx_def *rtl; /* acts as link to register transfer language
698 union tree_node *real;
699 union tree_node *imag;
702 /* Define fields and accessors for some special-purpose tree nodes. */
704 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
705 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
707 struct tree_identifier
709 char common[sizeof (struct tree_common)];
714 /* In a TREE_LIST node. */
715 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
716 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
720 char common[sizeof (struct tree_common)];
721 union tree_node *purpose;
722 union tree_node *value;
725 /* In a TREE_VEC node. */
726 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
727 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
728 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
732 char common[sizeof (struct tree_common)];
734 union tree_node *a[1];
737 /* Define fields and accessors for some nodes that represent expressions. */
739 /* In a SAVE_EXPR node. */
740 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
741 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
742 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
743 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
744 both in normal code and in a handler. (Normally, in a handler, all
745 SAVE_EXPRs are unsaved, meaning that there values are
747 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
749 /* In a RTL_EXPR node. */
750 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
751 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
753 /* In a CALL_EXPR node. */
754 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
756 /* In a CONSTRUCTOR node. */
757 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
759 /* In ordinary expression nodes. */
760 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
761 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
763 /* In a LABELED_BLOCK_EXPR node. */
764 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
765 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
767 /* In a EXIT_BLOCK_EXPR node. */
768 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
769 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
771 /* In a LOOP_EXPR node. */
772 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
774 /* In a EXPR_WITH_FILE_LOCATION node. */
775 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
776 #define EXPR_WFL_FILENAME(NODE) \
777 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
778 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
779 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
780 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
781 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
782 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
783 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
784 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
788 char common[sizeof (struct tree_common)];
790 union tree_node *operands[1];
793 /* In a BLOCK node. */
794 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
795 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
796 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
797 /* Note: when changing this, make sure to find the places
798 that use chainon or nreverse. */
799 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
800 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
801 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
803 /* Nonzero means that this block is prepared to handle exceptions
804 listed in the BLOCK_VARS slot. */
805 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
807 /* An index number for this block. These values are not guaranteed to
808 be unique across functions -- whether or not they are depends on
809 the debugging output format in use. */
810 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
814 char common[sizeof (struct tree_common)];
816 unsigned handler_block_flag : 1;
817 unsigned abstract_flag : 1;
818 unsigned block_num : 30;
820 union tree_node *vars;
821 union tree_node *subblocks;
822 union tree_node *supercontext;
823 union tree_node *abstract_origin;
826 /* Define fields and accessors for nodes representing data types. */
828 /* See tree.def for documentation of the use of these fields.
829 Look at the documentation of the various ..._TYPE tree codes. */
831 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
832 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
833 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
834 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
835 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
836 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
837 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
838 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
839 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
840 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
841 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
842 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
843 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
844 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
845 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
846 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
847 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
848 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
849 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
850 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
851 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
852 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
853 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
854 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
855 #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
856 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
858 /* For aggregate types, information about this type, as a base type
859 for itself. Used in a language-dependent way for types that are
860 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
861 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
863 /* The (language-specific) typed-based alias set for this type.
864 Objects whose TYPE_ALIAS_SETs are different cannot alias each
865 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
866 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
867 type can alias objects of any type. */
868 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
870 /* Nonzero iff the typed-based alias set for this type has been
872 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
873 (TYPE_CHECK (NODE)->type.alias_set != -1)
875 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
877 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
879 /* The alignment necessary for objects of this type.
880 The value is an int, measured in bits. */
881 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
883 /* The alignment for NODE, in bytes. */
884 #define TYPE_ALIGN_UNIT(NODE) \
885 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
887 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
889 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
890 has BLKmode only because it lacks the alignment requirement for
892 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
894 /* In an INTEGER_TYPE, it means the type represents a size. We use this
895 both for validity checking and to permit optimziations that are unsafe
897 #define TYPE_IS_SIZETYPE(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
899 /* Nonzero in a type considered volatile as a whole. */
900 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
902 /* Means this type is const-qualified. */
903 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
905 /* If nonzero, this type is `restrict'-qualified, in the C sense of
907 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
909 /* There is a TYPE_QUAL value for each type qualifier. They can be
910 combined by bitwise-or to form the complete set of qualifiers for a
913 #define TYPE_UNQUALIFIED 0x0
914 #define TYPE_QUAL_CONST 0x1
915 #define TYPE_QUAL_VOLATILE 0x2
916 #define TYPE_QUAL_RESTRICT 0x4
918 /* The set of type qualifiers for this type. */
919 #define TYPE_QUALS(NODE) \
920 ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) \
921 | (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) \
922 | (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT))
924 /* These flags are available for each language front end to use internally. */
925 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
926 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
927 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
928 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
929 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
930 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
931 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
933 /* If set in an ARRAY_TYPE, indicates a string type (for languages
934 that distinguish string from array of char).
935 If set in a SET_TYPE, indicates a bitstring type. */
936 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
938 /* If non-NULL, this is a upper bound of the size (in bytes) of an
939 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
940 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
942 /* Indicates that objects of this type must be initialized by calling a
943 function when they are created. */
944 #define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
946 /* Indicates that objects of this type (a UNION_TYPE), should be passed
947 the same way that the first union alternative would be passed. */
948 #define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
950 /* Indicated that objects of this type should be laid out in as
951 compact a way as possible. */
952 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
956 char common[sizeof (struct tree_common)];
957 union tree_node *values;
958 union tree_node *size;
959 union tree_node *size_unit;
960 union tree_node *attributes;
963 unsigned char precision;
964 #ifdef ONLY_INT_FIELDS
965 unsigned int mode : 8;
967 enum machine_mode mode : 8;
970 unsigned string_flag : 1;
971 unsigned no_force_blk_flag : 1;
972 unsigned needs_constructing_flag : 1;
973 unsigned transparent_union_flag : 1;
974 unsigned packed_flag : 1;
975 unsigned restrict_flag : 1;
977 unsigned lang_flag_0 : 1;
978 unsigned lang_flag_1 : 1;
979 unsigned lang_flag_2 : 1;
980 unsigned lang_flag_3 : 1;
981 unsigned lang_flag_4 : 1;
982 unsigned lang_flag_5 : 1;
983 unsigned lang_flag_6 : 1;
984 /* room for 3 more bits */
987 union tree_node *pointer_to;
988 union tree_node *reference_to;
989 union {int address; char *pointer; } symtab;
990 union tree_node *name;
991 union tree_node *minval;
992 union tree_node *maxval;
993 union tree_node *next_variant;
994 union tree_node *main_variant;
995 union tree_node *binfo;
996 union tree_node *noncopied_parts;
997 union tree_node *context;
998 struct obstack *obstack;
1000 /* Points to a structure whose details depend on the language in use. */
1001 struct lang_type *lang_specific;
1004 /* Define accessor macros for information about type inheritance
1007 A "basetype" means a particular usage of a data type for inheritance
1008 in another type. Each such basetype usage has its own "binfo"
1009 object to describe it. The binfo object is a TREE_VEC node.
1011 Inheritance is represented by the binfo nodes allocated for a
1012 given type. For example, given types C and D, such that D is
1013 inherited by C, 3 binfo nodes will be allocated: one for describing
1014 the binfo properties of C, similarly one for D, and one for
1015 describing the binfo properties of D as a base type for C.
1016 Thus, given a pointer to class C, one can get a pointer to the binfo
1017 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1019 /* The actual data type node being inherited in this basetype. */
1020 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1022 /* The offset where this basetype appears in its containing type.
1023 BINFO_OFFSET slot holds the offset (in bytes)
1024 from the base of the complete object to the base of the part of the
1025 object that is allocated on behalf of this `type'.
1026 This is always 0 except when there is multiple inheritance. */
1028 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1029 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1030 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1032 /* The virtual function table belonging to this basetype. Virtual
1033 function tables provide a mechanism for run-time method dispatching.
1034 The entries of a virtual function table are language-dependent. */
1036 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1037 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1039 /* The virtual functions in the virtual function table. This is
1040 a TREE_LIST that is used as an initial approximation for building
1041 a virtual function table for this basetype. */
1042 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1043 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1045 /* A vector of binfos for the direct basetypes inherited by this
1048 If this basetype describes type D as inherited in C, and if the
1049 basetypes of D are E and F, then this vector contains binfos for
1050 inheritance of E and F by C.
1052 ??? This could probably be done by just allocating the
1053 base types at the end of this TREE_VEC (instead of using
1054 another TREE_VEC). This would simplify the calculation
1055 of how many basetypes a given type had. */
1056 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1057 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1059 /* The number of basetypes for NODE. */
1060 #define BINFO_N_BASETYPES(NODE) \
1061 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1063 /* Accessor macro to get to the Nth basetype of this basetype. */
1064 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1065 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1067 /* For a BINFO record describing a virtual base class, i.e., one where
1068 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1069 base. The actual contents are language-dependent. Under the old
1070 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1071 pointer to the virtual base; under the new ABI this field is
1072 instead a INTEGER_CST giving an offset into the vtable where the
1073 offset to the virtual base can be found. */
1074 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1076 /* The size of a base class subobject of this type. Not all frontends
1077 currently allocate the space for these fields. */
1078 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1079 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1080 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1081 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1083 /* Slot used to build a chain that represents a use of inheritance.
1084 For example, if X is derived from Y, and Y is derived from Z,
1085 then this field can be used to link the binfo node for X to
1086 the binfo node for X's Y to represent the use of inheritance
1087 from X to Y. Similarly, this slot of the binfo node for X's Y
1088 can point to the Z from which Y is inherited (in X's inheritance
1089 hierarchy). In this fashion, one can represent and traverse specific
1090 uses of inheritance using the binfo nodes themselves (instead of
1091 consing new space pointing to binfo nodes).
1092 It is up to the language-dependent front-ends to maintain
1093 this information as necessary. */
1094 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1096 /* Define fields and accessors for nodes representing declared names. */
1098 /* Nonzero if DECL represents a decl. */
1099 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1100 /* This is the name of the object as written by the user.
1101 It is an IDENTIFIER_NODE. */
1102 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1103 /* This is the name of the object as the assembler will see it
1104 (but before any translations made by ASM_OUTPUT_LABELREF).
1105 Often this is the same as DECL_NAME.
1106 It is an IDENTIFIER_NODE. */
1107 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1108 /* Records the section name in a section attribute. Used to pass
1109 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1110 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1111 /* For FIELD_DECLs, this is the
1112 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1113 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1114 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1115 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1116 type, or NULL_TREE if the given decl has "file scope". */
1117 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1118 #define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1119 /* In a DECL this is the field where configuration dependent machine
1120 attributes are store */
1121 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1122 /* In a FIELD_DECL, this is the field position, counting in bits,
1123 of the bit closest to the beginning of the structure. */
1124 #define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1125 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1126 if so, the type that was originally specified for it.
1127 TREE_TYPE may have been modified (in finish_struct). */
1128 #define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1129 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1130 /* VAR_DECL and PARM_DECL reserve the arguments slot
1131 for language-specific uses. */
1132 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1133 /* In FUNCTION_DECL, holds the decl for the return value. */
1134 #define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result)
1135 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1136 #define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1137 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1138 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result)
1139 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1140 For a VAR_DECL, holds the initial value.
1141 For a PARM_DECL, not used--default
1142 values for parameters are encoded in the type of the function,
1143 not in the PARM_DECL slot. */
1144 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1145 /* For a PARM_DECL, records the data type used to pass the argument,
1146 which may be different from the type seen in the program. */
1147 #define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial)
1148 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1149 if nonzero, indicates that the field occupies the type. */
1150 #define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial)
1151 /* These two fields describe where in the source code the declaration was. */
1152 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1153 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1154 /* Holds the size of the datum, in bits, as a tree expression.
1155 Need not be constant. */
1156 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1157 /* Likewise for the size in bytes. */
1158 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1159 /* Holds the alignment required for the datum. */
1160 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.u)
1161 /* Holds the machine mode corresponding to the declaration of a variable or
1162 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1164 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1165 /* Holds the RTL expression for the value of a variable or function. If
1166 PROMOTED_MODE is defined, the mode of this expression may not be same
1167 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1168 to the variable's data type, while the mode
1169 of DECL_RTL is the mode actually used to contain the data. */
1170 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1171 /* Holds an INSN_LIST of all of the live ranges in which the variable
1172 has been moved to a possibly different register. */
1173 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1174 /* For PARM_DECL, holds an RTL for the stack slot or register
1175 where the data was actually passed. */
1176 #define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.u2.r)
1177 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1178 #define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.u2.f)
1179 /* For FUNCTION_DECL, if it is inline,
1180 holds the size of the stack frame, as an integer. */
1181 #define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.u1.i)
1182 /* For FUNCTION_DECL, if it is built-in,
1183 this identifies which built-in operation it is. */
1184 #define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.u1.f)
1186 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1187 Before the struct containing the FUNCTION_DECL is laid out,
1188 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1189 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1190 function. When the class is laid out, this pointer is changed
1191 to an INTEGER_CST node which is suitable for use as an index
1192 into the virtual function table. */
1193 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1194 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1195 which this FIELD_DECL is defined. This information is needed when
1196 writing debugging information about vfield and vbase decls for C++. */
1197 #define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex)
1199 /* Every ..._DECL node gets a unique number. */
1200 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1202 /* For any sort of a ..._DECL node, this points to the original (abstract)
1203 decl node which this decl is an instance of, or else it is NULL indicating
1204 that this decl is not an instance of some other decl. For example,
1205 in a nested declaration of an inline function, this points back to the
1207 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1209 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1210 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1211 #define DECL_ORIGIN(NODE) \
1212 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1214 /* Nonzero for any sort of ..._DECL node means this decl node represents
1215 an inline instance of some original (abstract) decl from an inline function;
1216 suppress any warnings about shadowing some other variable.
1217 FUNCTION_DECL nodes can also have their abstract origin set to themselves
1218 (see save_for_inline_copying). */
1219 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1220 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1222 /* Nonzero if a _DECL means that the name of this decl should be ignored
1223 for symbolic debug purposes. */
1224 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1226 /* Nonzero for a given ..._DECL node means that this node represents an
1227 "abstract instance" of the given declaration (e.g. in the original
1228 declaration of an inline function). When generating symbolic debugging
1229 information, we mustn't try to generate any address information for nodes
1230 marked as "abstract instances" because we don't actually generate
1231 any code or allocate any data space for such instances. */
1232 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1234 /* Nonzero if a _DECL means that no warnings should be generated just
1235 because this decl is unused. */
1236 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1238 /* Nonzero for a given ..._DECL node means that this node should be
1239 put in .common, if possible. If a DECL_INITIAL is given, and it
1240 is not error_mark_node, then the decl cannot be put in .common. */
1241 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1243 /* Language-specific decl information. */
1244 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1246 /* In a VAR_DECL or FUNCTION_DECL,
1247 nonzero means external reference:
1248 do not allocate storage, and refer to a definition elsewhere. */
1249 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1251 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1253 #define DEFAULT_INIT_PRIORITY 65535
1254 #define MAX_INIT_PRIORITY 65535
1255 #define MAX_RESERVED_INIT_PRIORITY 100
1258 nonzero means the detail info about this type is not dumped into stabs.
1259 Instead it will generate cross reference ('x') of names.
1260 This uses the same flag as DECL_EXTERNAL. */
1261 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1264 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1265 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1266 /* In LABEL_DECL nodes, nonzero means that an error message about
1267 jumping into such a binding contour has been printed for this label. */
1268 #define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1269 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1270 #define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1271 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1272 static chain is not needed. */
1273 #define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1275 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1276 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1278 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1280 Also set in some languages for variables, etc., outside the normal
1281 lexical scope, such as class instance variables. */
1282 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1284 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1285 where it is called. */
1286 #define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1288 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1289 that is not specified by ansi C and that users are supposed to be allowed
1290 to redefine for any purpose whatever. */
1291 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1293 /* Nonzero in a FUNCTION_DECL means this function should be treated
1294 as if it were a malloc, meaning it returns a pointer that is
1296 #define DECL_IS_MALLOC(NODE) (DECL_CHECK (NODE)->decl.malloc_flag)
1298 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1300 #define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1301 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1302 contour that restored a stack level and which is now exited. */
1303 #define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1305 /* In a FUNCTION_DECL, nonzero means a built in function. */
1306 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1307 /* For a builtin function, identify which part of the compiler defined it. */
1308 #define DECL_BUILT_IN_CLASS(NODE) (DECL_CHECK (NODE)->decl.built_in_class)
1310 /* In a VAR_DECL that's static,
1311 nonzero if the space is in the text section. */
1312 #define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
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. */
1519 TI_SIGNED_CHAR_TYPE,
1520 TI_UNSIGNED_CHAR_TYPE,
1523 TI_SHORT_INTEGER_TYPE,
1524 TI_SHORT_UNSIGNED_TYPE,
1525 TI_LONG_INTEGER_TYPE,
1526 TI_LONG_UNSIGNED_TYPE,
1527 TI_LONG_LONG_INTEGER_TYPE,
1528 TI_LONG_LONG_UNSIGNED_TYPE,
1537 TI_COMPLEX_INTEGER_TYPE,
1538 TI_COMPLEX_FLOAT_TYPE,
1539 TI_COMPLEX_DOUBLE_TYPE,
1540 TI_COMPLEX_LONG_DOUBLE_TYPE,
1544 TI_LONG_DOUBLE_TYPE,
1555 extern tree global_trees[TI_MAX];
1557 #define error_mark_node global_trees[TI_ERROR_MARK]
1559 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1560 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1561 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1562 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1563 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1565 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1566 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1567 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1568 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1569 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1571 #define char_type_node global_trees[TI_CHAR_TYPE]
1572 #define signed_char_type_node global_trees[TI_SIGNED_CHAR_TYPE]
1573 #define unsigned_char_type_node global_trees[TI_UNSIGNED_CHAR_TYPE]
1574 #define short_integer_type_node global_trees[TI_SHORT_INTEGER_TYPE]
1575 #define short_unsigned_type_node global_trees[TI_SHORT_UNSIGNED_TYPE]
1576 #define integer_type_node global_trees[TI_INTEGER_TYPE]
1577 #define unsigned_type_node global_trees[TI_UNSIGNED_TYPE]
1578 #define long_integer_type_node global_trees[TI_LONG_INTEGER_TYPE]
1579 #define long_unsigned_type_node global_trees[TI_LONG_UNSIGNED_TYPE]
1580 #define long_long_integer_type_node global_trees[TI_LONG_LONG_INTEGER_TYPE]
1581 #define long_long_unsigned_type_node global_trees[TI_LONG_LONG_UNSIGNED_TYPE]
1583 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1584 #define integer_one_node global_trees[TI_INTEGER_ONE]
1585 #define size_zero_node global_trees[TI_SIZE_ZERO]
1586 #define size_one_node global_trees[TI_SIZE_ONE]
1587 #define null_pointer_node global_trees[TI_NULL_POINTER]
1589 #define float_type_node global_trees[TI_FLOAT_TYPE]
1590 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1591 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1593 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1594 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1595 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1596 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1598 #define void_type_node global_trees[TI_VOID_TYPE]
1599 /* The C type `void *'. */
1600 #define ptr_type_node global_trees[TI_PTR_TYPE]
1601 /* The C type `const void *'. */
1602 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1603 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1604 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1606 #define NULL_TREE (tree) NULL
1608 /* The following functions accept a wide integer argument. Rather than
1609 having to cast on every function call, we use a macro instead, that is
1610 defined here and in rtl.h. */
1613 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1614 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1616 extern int exact_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1617 extern int floor_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1619 extern char *oballoc PARAMS ((int));
1620 extern char *permalloc PARAMS ((int));
1621 extern char *savealloc PARAMS ((int));
1622 extern char *expralloc PARAMS ((int));
1624 /* Lowest level primitive for allocating a node.
1625 The TREE_CODE is the only argument. Contents are initialized
1626 to zero except for a few of the common fields. */
1628 extern tree make_node PARAMS ((enum tree_code));
1629 extern tree make_lang_type PARAMS ((enum tree_code));
1630 extern tree (*make_lang_type_fn) PARAMS ((enum tree_code));
1632 /* Make a copy of a node, with all the same contents except
1633 for TREE_PERMANENT. (The copy is permanent
1634 iff nodes being made now are permanent.) */
1636 extern tree copy_node PARAMS ((tree));
1638 /* Make a copy of a chain of TREE_LIST nodes. */
1640 extern tree copy_list PARAMS ((tree));
1642 /* Make a TREE_VEC. */
1644 extern tree make_tree_vec PARAMS ((int));
1646 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1647 The name is supplied as a char *. */
1649 extern tree get_identifier PARAMS ((const char *));
1651 /* If an identifier with the name TEXT (a null-terminated string) has
1652 previously been referred to, return that node; otherwise return
1655 extern tree maybe_get_identifier PARAMS ((const char *));
1657 /* Construct various types of nodes. */
1659 #define build_int_2(LO,HI) \
1660 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1662 extern tree build PARAMS ((enum tree_code, tree, ...));
1663 extern tree build_nt PARAMS ((enum tree_code, ...));
1664 extern tree build_parse_node PARAMS ((enum tree_code, ...));
1666 extern tree build_int_2_wide PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT));
1667 extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE));
1668 extern tree build_real_from_int_cst PARAMS ((tree, tree));
1669 extern tree build_complex PARAMS ((tree, tree, tree));
1670 extern tree build_string PARAMS ((int, const char *));
1671 extern tree build1 PARAMS ((enum tree_code, tree, tree));
1672 extern tree build_tree_list PARAMS ((tree, tree));
1673 extern tree build_decl_list PARAMS ((tree, tree));
1674 extern tree build_expr_list PARAMS ((tree, tree));
1675 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
1676 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
1677 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
1679 /* Construct various nodes representing data types. */
1681 extern tree make_signed_type PARAMS ((int));
1682 extern tree make_unsigned_type PARAMS ((int));
1683 extern void initialize_sizetypes PARAMS ((void));
1684 extern void set_sizetype PARAMS ((tree));
1685 extern tree signed_or_unsigned_type PARAMS ((int, tree));
1686 extern void fixup_unsigned_type PARAMS ((tree));
1687 extern tree build_pointer_type PARAMS ((tree));
1688 extern tree build_reference_type PARAMS ((tree));
1689 extern tree build_index_type PARAMS ((tree));
1690 extern tree build_index_2_type PARAMS ((tree, tree));
1691 extern tree build_array_type PARAMS ((tree, tree));
1692 extern tree build_function_type PARAMS ((tree, tree));
1693 extern tree build_method_type PARAMS ((tree, tree));
1694 extern tree build_offset_type PARAMS ((tree, tree));
1695 extern tree build_complex_type PARAMS ((tree));
1696 extern tree array_type_nelts PARAMS ((tree));
1698 extern tree value_member PARAMS ((tree, tree));
1699 extern tree purpose_member PARAMS ((tree, tree));
1700 extern tree binfo_member PARAMS ((tree, tree));
1701 extern int attribute_hash_list PARAMS ((tree));
1702 extern int attribute_list_equal PARAMS ((tree, tree));
1703 extern int attribute_list_contained PARAMS ((tree, tree));
1704 extern int tree_int_cst_equal PARAMS ((tree, tree));
1705 extern int tree_int_cst_lt PARAMS ((tree, tree));
1706 extern int tree_int_cst_msb PARAMS ((tree));
1707 extern int tree_int_cst_sgn PARAMS ((tree));
1708 extern int index_type_equal PARAMS ((tree, tree));
1709 extern tree get_inner_array_type PARAMS ((tree));
1711 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1712 put the prototype here. Rtl.h does declare the prototype if
1713 tree.h had been included. */
1715 extern tree make_tree PARAMS ((tree, struct rtx_def *));
1717 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1720 Such modified types already made are recorded so that duplicates
1723 extern tree build_type_attribute_variant PARAMS ((tree, tree));
1724 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
1726 extern tree merge_machine_decl_attributes PARAMS ((tree, tree));
1727 extern tree merge_machine_type_attributes PARAMS ((tree, tree));
1729 /* Split a list of declspecs and attributes into two. */
1731 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
1733 /* Strip attributes from a list of combined specs and attrs. */
1735 extern tree strip_attrs PARAMS ((tree));
1737 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1739 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
1741 /* Given a tree node and a string, return non-zero if the tree node is
1742 a valid attribute name for the string. */
1744 extern int is_attribute_p PARAMS ((const char *, tree));
1746 /* Given an attribute name and a list of attributes, return the list element
1747 of the attribute or NULL_TREE if not found. */
1749 extern tree lookup_attribute PARAMS ((const char *, tree));
1751 /* Given two attributes lists, return a list of their union. */
1753 extern tree merge_attributes PARAMS ((tree, tree));
1755 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
1756 the same kind of data as TYPE describes. Variants point to the
1757 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
1758 and it points to a chain of other variants so that duplicate
1759 variants are never made. Only main variants should ever appear as
1760 types of expressions. */
1762 extern tree build_qualified_type PARAMS ((tree, int));
1764 /* Like build_qualified_type, but only deals with the `const' and
1765 `volatile' qualifiers. This interface is retained for backwards
1766 compatiblity with the various front-ends; new code should use
1767 build_qualified_type instead. */
1769 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
1770 build_qualified_type (TYPE, \
1771 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
1772 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
1774 /* Make a copy of a type node. */
1776 extern tree build_type_copy PARAMS ((tree));
1778 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1779 TYPE_ALIGN and TYPE_MODE fields.
1780 If called more than once on one node, does nothing except
1781 for the first time. */
1783 extern void layout_type PARAMS ((tree));
1785 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1786 return a canonicalized ..._TYPE node, so that duplicates are not made.
1787 How the hash code is computed is up to the caller, as long as any two
1788 callers that could hash identical-looking type nodes agree. */
1790 extern tree type_hash_canon PARAMS ((int, tree));
1792 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1793 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1794 fields. Call this only once for any given decl node.
1796 Second argument is the boundary that this field can be assumed to
1797 be starting at (in bits). Zero means it can be assumed aligned
1798 on any boundary that may be needed. */
1800 extern void layout_decl PARAMS ((tree, unsigned));
1802 /* Return the mode for data of a given size SIZE and mode class CLASS.
1803 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
1804 The value is BLKmode if no other mode is found. This is like
1805 mode_for_size, but is passed a tree. */
1807 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
1810 /* Return an expr equal to X but certainly not valid as an lvalue. */
1812 extern tree non_lvalue PARAMS ((tree));
1813 extern tree pedantic_non_lvalue PARAMS ((tree));
1815 extern tree convert PARAMS ((tree, tree));
1816 extern unsigned int expr_align PARAMS ((tree));
1817 extern tree size_in_bytes PARAMS ((tree));
1818 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
1820 /* Define data structures, macros, and functions for handling sizes
1821 and the various types used to represent sizes. */
1825 SIZETYPE, /* Normal representation of sizes in bytes. */
1826 SSIZETYPE, /* Signed representation of sizes in bytes. */
1827 USIZETYPE, /* Unsigned representation of sizes in bytes. */
1828 BITSIZETYPE, /* Normal representation of sizes in bits. */
1829 SBITSIZETYPE, /* Signed representation of sizes in bits. */
1830 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
1833 extern tree sizetype_tab[(int) TYPE_KIND_LAST];
1835 #define sizetype sizetype_tab[(int) SIZETYPE]
1836 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
1837 #define ssizetype sizetype_tab[(int) SSIZETYPE]
1838 #define usizetype sizetype_tab[(int) USIZETYPE]
1839 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
1840 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
1842 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
1843 extern tree size_diffop PARAMS ((tree, tree));
1844 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
1845 enum size_type_kind));
1846 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
1848 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
1849 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
1850 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
1851 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
1852 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
1854 extern tree round_up PARAMS ((tree, int));
1855 extern tree get_pending_sizes PARAMS ((void));
1856 extern void put_pending_sizes PARAMS ((tree));
1858 /* Type for sizes of data-type. */
1860 #define BITS_PER_UNIT_LOG \
1861 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1862 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1863 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1865 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1866 extern unsigned int maximum_field_alignment;
1868 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1869 extern unsigned int set_alignment;
1871 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1872 by making the last node in X point to Y.
1873 Returns X, except if X is 0 returns Y. */
1875 extern tree chainon PARAMS ((tree, tree));
1877 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1879 extern tree tree_cons PARAMS ((tree, tree, tree));
1880 extern tree perm_tree_cons PARAMS ((tree, tree, tree));
1881 extern tree temp_tree_cons PARAMS ((tree, tree, tree));
1882 extern tree saveable_tree_cons PARAMS ((tree, tree, tree));
1883 extern tree decl_tree_cons PARAMS ((tree, tree, tree));
1884 extern tree expr_tree_cons PARAMS ((tree, tree, tree));
1886 /* Return the last tree node in a chain. */
1888 extern tree tree_last PARAMS ((tree));
1890 /* Reverse the order of elements in a chain, and return the new head. */
1892 extern tree nreverse PARAMS ((tree));
1894 /* Returns the length of a chain of nodes
1895 (number of chain pointers to follow before reaching a null pointer). */
1897 extern int list_length PARAMS ((tree));
1899 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1901 extern int integer_zerop PARAMS ((tree));
1903 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1905 extern int integer_onep PARAMS ((tree));
1907 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1908 all of whose significant bits are 1. */
1910 extern int integer_all_onesp PARAMS ((tree));
1912 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1913 exactly one bit 1. */
1915 extern int integer_pow2p PARAMS ((tree));
1917 /* staticp (tree x) is nonzero if X is a reference to data allocated
1918 at a fixed address in memory. */
1920 extern int staticp PARAMS ((tree));
1922 /* Gets an error if argument X is not an lvalue.
1923 Also returns 1 if X is an lvalue, 0 if not. */
1925 extern int lvalue_or_else PARAMS ((tree, const char *));
1927 /* save_expr (EXP) returns an expression equivalent to EXP
1928 but it can be used multiple times within context CTX
1929 and only evaluate EXP once. */
1931 extern tree save_expr PARAMS ((tree));
1933 /* Returns the index of the first non-tree operand for CODE, or the number
1934 of operands if all are trees. */
1936 extern int first_rtl_op PARAMS ((enum tree_code));
1938 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1939 can be used multiple times and will evaluate EXP in its entirety
1942 extern tree unsave_expr PARAMS ((tree));
1944 /* Reset EXP in place so that it can be expaned again. Does not
1945 recurse into subtrees. */
1947 extern void unsave_expr_1 PARAMS ((tree));
1949 /* Like unsave_expr_1, but recurses into all subtrees. */
1951 extern tree unsave_expr_now PARAMS ((tree));
1953 /* If non-null, these are language-specific helper functions for
1954 unsave_expr_now. If present, LANG_UNSAVE is called before its
1955 argument (an UNSAVE_EXPR) is to be unsaved, and all other
1956 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
1957 called from unsave_expr_1 for language-specific tree codes. */
1958 extern void (*lang_unsave) PARAMS ((tree *));
1959 extern void (*lang_unsave_expr_now) PARAMS ((tree));
1961 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1962 or offset that depends on a field within a record.
1964 Note that we only allow such expressions within simple arithmetic
1967 extern int contains_placeholder_p PARAMS ((tree));
1969 /* Return 1 if EXP contains any expressions that produce cleanups for an
1970 outer scope to deal with. Used by fold. */
1972 extern int has_cleanups PARAMS ((tree));
1974 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1975 return a tree with all occurrences of references to F in a
1976 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1977 contains only arithmetic expressions. */
1979 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
1981 /* variable_size (EXP) is like save_expr (EXP) except that it
1982 is for the special case of something that is part of a
1983 variable size for a data type. It makes special arrangements
1984 to compute the value at the right time when the data type
1985 belongs to a function parameter. */
1987 extern tree variable_size PARAMS ((tree));
1989 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1990 but it can be used multiple times
1991 and only evaluate the subexpressions once. */
1993 extern tree stabilize_reference PARAMS ((tree));
1995 /* Subroutine of stabilize_reference; this is called for subtrees of
1996 references. Any expression with side-effects must be put in a SAVE_EXPR
1997 to ensure that it is only evaluated once. */
1999 extern tree stabilize_reference_1 PARAMS ((tree));
2001 /* Return EXP, stripped of any conversions to wider types
2002 in such a way that the result of converting to type FOR_TYPE
2003 is the same as if EXP were converted to FOR_TYPE.
2004 If FOR_TYPE is 0, it signifies EXP's type. */
2006 extern tree get_unwidened PARAMS ((tree, tree));
2008 /* Return OP or a simpler expression for a narrower value
2009 which can be sign-extended or zero-extended to give back OP.
2010 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2011 or 0 if the value should be sign-extended. */
2013 extern tree get_narrower PARAMS ((tree, int *));
2015 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2017 The definition of this resides in language-specific code
2018 as the repertoire of available types may vary. */
2020 extern tree type_for_mode PARAMS ((enum machine_mode, int));
2022 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2023 for an integer type with at least that precision.
2024 The definition of this resides in language-specific code
2025 as the repertoire of available types may vary. */
2027 extern tree type_for_size PARAMS ((unsigned, int));
2029 /* Given an integer type T, return a type like T but unsigned.
2030 If T is unsigned, the value is T.
2031 The definition of this resides in language-specific code
2032 as the repertoire of available types may vary. */
2034 extern tree unsigned_type PARAMS ((tree));
2036 /* Given an integer type T, return a type like T but signed.
2037 If T is signed, the value is T.
2038 The definition of this resides in language-specific code
2039 as the repertoire of available types may vary. */
2041 extern tree signed_type PARAMS ((tree));
2043 /* This function must be defined in the language-specific files.
2044 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2045 This is defined in a language-specific file. */
2047 extern tree maybe_build_cleanup PARAMS ((tree));
2049 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2050 look for nested component-refs or array-refs at constant positions
2051 and find the ultimate containing object, which is returned. */
2053 extern tree get_inner_reference PARAMS ((tree, int *, int *, tree *,
2054 enum machine_mode *, int *,
2055 int *, unsigned int *));
2057 /* Given a DECL or TYPE, return the scope in which it was declared, or
2058 NUL_TREE if there is no containing scope. */
2060 extern tree get_containing_scope PARAMS ((tree));
2062 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2064 extern tree decl_function_context PARAMS ((tree));
2066 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2067 this _DECL with its context, or zero if none. */
2068 extern tree decl_type_context PARAMS ((tree));
2070 /* Given the FUNCTION_DECL for the current function,
2071 return zero if it is ok for this function to be inline.
2072 Otherwise return a warning message with a single %s
2073 for the function's name. */
2075 extern const char *function_cannot_inline_p PARAMS ((tree));
2077 /* Return 1 if EXPR is the real constant zero. */
2078 extern int real_zerop PARAMS ((tree));
2080 /* Declare commonly used variables for tree structure. */
2082 /* Points to the name of the input file from which the current input
2083 being parsed originally came (before it went into cpp). */
2084 extern char *input_filename;
2086 /* Current line number in input file. */
2089 /* Nonzero for -pedantic switch: warn about anything
2090 that standard C forbids. */
2091 extern int pedantic;
2093 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2094 Zero means allow extended lvalues. */
2096 extern int pedantic_lvalues;
2098 /* Nonzero means can safely call expand_expr now;
2099 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2101 extern int immediate_size_expand;
2103 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2105 extern tree current_function_decl;
2107 /* Nonzero means a FUNC_BEGIN label was emitted. */
2108 extern tree current_function_func_begin_label;
2110 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2112 extern int all_types_permanent;
2114 /* Pointer to function to compute the name to use to print a declaration.
2115 DECL is the declaration in question.
2116 VERBOSITY determines what information will be printed:
2117 0: DECL_NAME, demangled as necessary.
2118 1: and scope information.
2119 2: and any other information that might be interesting, such as function
2120 parameter types in C++. */
2122 extern const char *(*decl_printable_name) PARAMS ((tree, int));
2124 /* Pointer to function to finish handling an incomplete decl at the
2125 end of compilation. */
2127 extern void (*incomplete_decl_finalize_hook) PARAMS ((tree));
2129 extern char *init_parse PARAMS ((char *));
2130 extern void finish_parse PARAMS ((void));
2132 extern const char * const language_string;
2134 /* Declare a predefined function. Return the declaration. This function is
2135 provided by each language frontend. */
2136 extern tree builtin_function PARAMS ((const char *, tree, int,
2137 enum built_in_class,
2141 extern char *perm_calloc PARAMS ((int, long));
2142 extern tree get_file_function_name PARAMS ((int));
2143 extern tree get_file_function_name_long PARAMS ((const char *));
2144 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2145 extern tree get_set_constructor_bytes PARAMS ((tree,
2146 unsigned char *, int));
2147 extern int get_alias_set PARAMS ((tree));
2148 extern int new_alias_set PARAMS ((void));
2149 extern int (*lang_get_alias_set) PARAMS ((tree));
2150 extern tree get_callee_fndecl PARAMS ((tree));
2154 extern int in_control_zone_p PARAMS ((void));
2155 extern void expand_fixups PARAMS ((struct rtx_def *));
2156 extern tree expand_start_stmt_expr PARAMS ((void));
2157 extern tree expand_end_stmt_expr PARAMS ((tree));
2158 extern void expand_expr_stmt PARAMS ((tree));
2159 extern int warn_if_unused_value PARAMS ((tree));
2160 extern void expand_decl_init PARAMS ((tree));
2161 extern void clear_last_expr PARAMS ((void));
2162 extern void expand_label PARAMS ((tree));
2163 extern void expand_goto PARAMS ((tree));
2164 extern void expand_asm PARAMS ((tree));
2165 extern void expand_start_cond PARAMS ((tree, int));
2166 extern void expand_end_cond PARAMS ((void));
2167 extern void expand_start_else PARAMS ((void));
2168 extern void expand_start_elseif PARAMS ((tree));
2169 extern struct nesting *expand_start_loop PARAMS ((int));
2170 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2171 extern void expand_loop_continue_here PARAMS ((void));
2172 extern void expand_end_loop PARAMS ((void));
2173 extern int expand_continue_loop PARAMS ((struct nesting *));
2174 extern int expand_exit_loop PARAMS ((struct nesting *));
2175 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2177 extern int expand_exit_something PARAMS ((void));
2179 extern void expand_null_return PARAMS ((void));
2180 extern void expand_return PARAMS ((tree));
2181 extern int optimize_tail_recursion PARAMS ((tree, struct rtx_def *));
2182 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2183 #define expand_start_bindings(flags) \
2184 expand_start_bindings_and_block(flags, NULL_TREE)
2185 extern void expand_end_bindings PARAMS ((tree, int, int));
2186 extern void warn_about_unused_variables PARAMS ((tree));
2187 extern void start_cleanup_deferral PARAMS ((void));
2188 extern void end_cleanup_deferral PARAMS ((void));
2189 extern int is_body_block PARAMS ((tree));
2191 extern void mark_block_as_eh_region PARAMS ((void));
2192 extern void mark_block_as_not_eh_region PARAMS ((void));
2193 extern int is_eh_region PARAMS ((void));
2194 extern int conditional_context PARAMS ((void));
2195 extern tree last_cleanup_this_contour PARAMS ((void));
2196 extern int expand_dhc_cleanup PARAMS ((tree));
2197 extern int expand_dcc_cleanup PARAMS ((tree));
2198 extern void expand_start_case PARAMS ((int, tree, tree,
2200 extern void expand_end_case PARAMS ((tree));
2201 extern int pushcase PARAMS ((tree,
2202 tree (*) (tree, tree),
2204 extern int pushcase_range PARAMS ((tree, tree,
2205 tree (*) (tree, tree),
2207 extern void using_eh_for_cleanups PARAMS ((void));
2208 extern int stmt_loop_nest_empty PARAMS ((void));
2210 /* In fold-const.c */
2212 /* Fold constants as much as possible in an expression.
2213 Returns the simplified expression.
2214 Acts only on the top level of the expression;
2215 if the argument itself cannot be simplified, its
2216 subexpressions are not changed. */
2218 extern tree fold PARAMS ((tree));
2220 extern int force_fit_type PARAMS ((tree, int));
2221 extern int add_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2222 HOST_WIDE_INT, HOST_WIDE_INT,
2223 HOST_WIDE_INT *, HOST_WIDE_INT *));
2224 extern int neg_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2225 HOST_WIDE_INT *, HOST_WIDE_INT *));
2226 extern int mul_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2227 HOST_WIDE_INT, HOST_WIDE_INT,
2228 HOST_WIDE_INT *, HOST_WIDE_INT *));
2229 extern void lshift_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2230 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2231 HOST_WIDE_INT *, int));
2232 extern void rshift_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2234 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
2235 extern void lrotate_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2236 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2238 extern void rrotate_double PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT,
2239 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2241 extern int operand_equal_p PARAMS ((tree, tree, int));
2242 extern tree invert_truthvalue PARAMS ((tree));
2244 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2245 function arguments and return the new type. Return NULL_TREE if no
2246 change. Required by any language that supports variadic arguments. */
2248 extern tree (*lang_type_promotes_to) PARAMS ((tree));
2250 /* Interface of the DWARF2 unwind info support. */
2252 /* Decide whether we want to emit frame unwind information for the current
2253 translation unit. */
2255 extern int dwarf2out_do_frame PARAMS ((void));
2257 /* Generate a new label for the CFI info to refer to. */
2259 extern char *dwarf2out_cfi_label PARAMS ((void));
2261 /* Entry point to update the canonical frame address (CFA). */
2263 extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
2265 /* Add the CFI for saving a register window. */
2267 extern void dwarf2out_window_save PARAMS ((char *));
2269 /* Add a CFI to update the running total of the size of arguments pushed
2272 extern void dwarf2out_args_size PARAMS ((char *, long));
2274 /* Entry point for saving a register to the stack. */
2276 extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
2278 /* Entry point for saving the return address in the stack. */
2280 extern void dwarf2out_return_save PARAMS ((char *, long));
2282 /* Entry point for saving the return address in a register. */
2284 extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
2286 /* Output a marker (i.e. a label) for the beginning of a function, before
2289 extern void dwarf2out_begin_prologue PARAMS ((void));
2291 /* Output a marker (i.e. a label) for the absolute end of the generated
2292 code for a function definition. */
2294 extern void dwarf2out_end_epilogue PARAMS ((void));
2296 /* The language front-end must define these functions. */
2298 /* Function of no arguments for initializing options. */
2299 extern void lang_init_options PARAMS ((void));
2301 /* Function of no arguments for initializing lexical scanning. */
2302 extern void init_lex PARAMS ((void));
2303 /* Function of no arguments for initializing the symbol table. */
2304 extern void init_decl_processing PARAMS ((void));
2306 /* Functions called with no arguments at the beginning and end or processing
2307 the input source file. */
2308 extern void lang_init PARAMS ((void));
2309 extern void lang_finish PARAMS ((void));
2311 /* Function to identify which front-end produced the output file. */
2312 extern const char *lang_identify PARAMS ((void));
2314 /* Called by report_error_function to print out function name.
2315 * Default may be overridden by language front-ends. */
2316 extern void (*print_error_function) PARAMS ((const char *));
2318 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2319 extern void copy_lang_decl PARAMS ((tree));
2321 /* Function called with no arguments to parse and compile the input. */
2322 extern int yyparse PARAMS ((void));
2323 /* Function called with option as argument
2324 to decode options starting with -f or -W or +.
2325 It should return nonzero if it handles the option. */
2326 extern int lang_decode_option PARAMS ((int, char **));
2328 /* Functions for processing symbol declarations. */
2329 /* Function to enter a new lexical scope.
2330 Takes one argument: always zero when called from outside the front end. */
2331 extern void pushlevel PARAMS ((int));
2332 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2333 Takes three arguments:
2334 KEEP -- nonzero if there were declarations in this scope.
2335 REVERSE -- reverse the order of decls before returning them.
2336 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2337 extern tree poplevel PARAMS ((int, int, int));
2338 /* Set the BLOCK node for the current scope level. */
2339 extern void set_block PARAMS ((tree));
2340 /* Function to add a decl to the current scope level.
2341 Takes one argument, a decl to add.
2342 Returns that decl, or, if the same symbol is already declared, may
2343 return a different decl for that name. */
2344 extern tree pushdecl PARAMS ((tree));
2345 /* Function to return the chain of decls so far in the current scope level. */
2346 extern tree getdecls PARAMS ((void));
2347 /* Function to return the chain of structure tags in the current scope level. */
2348 extern tree gettags PARAMS ((void));
2350 extern tree build_range_type PARAMS ((tree, tree, tree));
2352 /* Call when starting to parse a declaration:
2353 make expressions in the declaration last the length of the function.
2354 Returns an argument that should be passed to resume_momentary later. */
2355 extern int suspend_momentary PARAMS ((void));
2357 extern int allocation_temporary_p PARAMS ((void));
2359 /* Call when finished parsing a declaration:
2360 restore the treatment of node-allocation that was
2361 in effect before the suspension.
2362 YES should be the value previously returned by suspend_momentary. */
2363 extern void resume_momentary PARAMS ((int));
2365 /* Called after finishing a record, union or enumeral type. */
2366 extern void rest_of_type_compilation PARAMS ((tree, int));
2368 /* Save the current set of obstacks, but don't change them. */
2369 extern void push_obstacks_nochange PARAMS ((void));
2371 extern void permanent_allocation PARAMS ((int));
2373 extern void push_momentary PARAMS ((void));
2375 extern void clear_momentary PARAMS ((void));
2377 extern void pop_momentary PARAMS ((void));
2379 extern void end_temporary_allocation PARAMS ((void));
2381 /* Pop the obstack selection stack. */
2382 extern void pop_obstacks PARAMS ((void));
2385 extern int really_constant_p PARAMS ((tree));
2386 extern void push_obstacks PARAMS ((struct obstack *,
2388 extern void pop_momentary_nofree PARAMS ((void));
2389 extern void preserve_momentary PARAMS ((void));
2390 extern void saveable_allocation PARAMS ((void));
2391 extern void temporary_allocation PARAMS ((void));
2392 extern void resume_temporary_allocation PARAMS ((void));
2393 extern tree get_file_function_name PARAMS ((int));
2394 extern void set_identifier_size PARAMS ((int));
2395 extern int int_fits_type_p PARAMS ((tree, tree));
2396 extern int tree_log2 PARAMS ((tree));
2397 extern void preserve_initializer PARAMS ((void));
2398 extern void preserve_data PARAMS ((void));
2399 extern int object_permanent_p PARAMS ((tree));
2400 extern int type_precision PARAMS ((tree));
2401 extern int simple_cst_equal PARAMS ((tree, tree));
2402 extern int type_list_equal PARAMS ((tree, tree));
2403 extern int chain_member PARAMS ((tree, tree));
2404 extern int chain_member_purpose PARAMS ((tree, tree));
2405 extern int chain_member_value PARAMS ((tree, tree));
2406 extern tree listify PARAMS ((tree));
2407 extern tree type_hash_lookup PARAMS ((int, tree));
2408 extern void type_hash_add PARAMS ((int, tree));
2409 extern int type_hash_list PARAMS ((tree));
2410 extern int simple_cst_list_equal PARAMS ((tree, tree));
2411 extern void debug_obstack PARAMS ((char *));
2412 extern void rtl_in_current_obstack PARAMS ((void));
2413 extern void rtl_in_saveable_obstack PARAMS ((void));
2414 extern void init_tree_codes PARAMS ((void));
2415 extern void dump_tree_statistics PARAMS ((void));
2416 extern void print_obstack_statistics PARAMS ((const char *,
2419 extern void print_obstack_name PARAMS ((char *, FILE *, const char *));
2421 extern void expand_function_end PARAMS ((char *, int, int));
2422 extern void expand_function_start PARAMS ((tree, int));
2423 extern int real_onep PARAMS ((tree));
2424 extern int real_twop PARAMS ((tree));
2425 extern void start_identifier_warnings PARAMS ((void));
2426 extern void gcc_obstack_init PARAMS ((struct obstack *));
2427 extern void init_obstacks PARAMS ((void));
2428 extern void obfree PARAMS ((char *));
2429 extern void build_common_tree_nodes PARAMS ((int));
2430 extern void build_common_tree_nodes_2 PARAMS ((int));
2433 extern void setjmp_protect_args PARAMS ((void));
2434 extern void setjmp_protect PARAMS ((tree));
2435 extern void expand_main_function PARAMS ((void));
2436 extern void mark_varargs PARAMS ((void));
2437 extern void init_dummy_function_start PARAMS ((void));
2438 extern void expand_dummy_function_end PARAMS ((void));
2439 extern void init_function_for_compilation PARAMS ((void));
2440 extern void init_function_start PARAMS ((tree, char *, int));
2441 extern void assign_parms PARAMS ((tree));
2442 extern void put_var_into_stack PARAMS ((tree));
2443 extern void uninitialized_vars_warning PARAMS ((tree));
2444 extern void setjmp_args_warning PARAMS ((void));
2445 extern void mark_all_temps_used PARAMS ((void));
2446 extern void init_temp_slots PARAMS ((void));
2447 extern void combine_temp_slots PARAMS ((void));
2448 extern void free_temp_slots PARAMS ((void));
2449 extern void pop_temp_slots PARAMS ((void));
2450 extern void push_temp_slots PARAMS ((void));
2451 extern void preserve_temp_slots PARAMS ((struct rtx_def *));
2452 extern int aggregate_value_p PARAMS ((tree));
2453 extern tree reorder_blocks PARAMS ((tree,
2455 extern void free_temps_for_rtl_expr PARAMS ((tree));
2456 extern void instantiate_virtual_regs PARAMS ((tree, struct rtx_def *));
2457 extern void unshare_all_rtl PARAMS ((tree, struct rtx_def *));
2458 extern int max_parm_reg_num PARAMS ((void));
2459 extern void push_function_context PARAMS ((void));
2460 extern void pop_function_context PARAMS ((void));
2461 extern void push_function_context_to PARAMS ((tree));
2462 extern void pop_function_context_from PARAMS ((tree));
2464 /* In print-rtl.c */
2466 extern void print_rtl PARAMS ((FILE *, struct rtx_def *));
2469 /* In print-tree.c */
2470 extern void debug_tree PARAMS ((tree));
2472 extern void print_node PARAMS ((FILE *, const char *, tree, int));
2473 extern void print_node_brief PARAMS ((FILE *, const char *, tree, int));
2474 extern void indent_to PARAMS ((FILE *, int));
2478 extern void emit_queue PARAMS ((void));
2479 extern int apply_args_register_offset PARAMS ((int));
2480 extern struct rtx_def *expand_builtin_return_addr
2481 PARAMS ((enum built_in_function, int, struct rtx_def *));
2482 extern void do_pending_stack_adjust PARAMS ((void));
2483 extern struct rtx_def *expand_assignment PARAMS ((tree, tree, int, int));
2484 extern struct rtx_def *store_expr PARAMS ((tree, struct rtx_def *,
2486 extern void check_max_integer_computation_mode PARAMS ((tree));
2489 extern void start_sequence_for_rtl_expr PARAMS ((tree));
2490 extern struct rtx_def *emit_line_note_after PARAMS ((char *, int,
2492 extern struct rtx_def *emit_line_note PARAMS ((char *, int));
2493 extern struct rtx_def *emit_line_note_force PARAMS ((char *, int));
2496 extern void special_function_p PARAMS ((tree, int *, int *,
2497 int *, int *, int *));
2500 extern int mark_addressable PARAMS ((tree));
2501 extern void incomplete_type_error PARAMS ((tree, tree));
2504 extern void print_lang_statistics PARAMS ((void));
2507 extern tree truthvalue_conversion PARAMS ((tree));
2508 extern int min_precision PARAMS ((tree, int));
2509 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2513 extern void print_lang_decl PARAMS ((FILE *, tree, int));
2514 extern void print_lang_type PARAMS ((FILE *, tree, int));
2515 extern void print_lang_identifier PARAMS ((FILE *, tree, int));
2517 extern int global_bindings_p PARAMS ((void));
2518 extern void insert_block PARAMS ((tree));
2520 /* In integrate.c */
2521 extern void save_for_inline_nocopy PARAMS ((tree));
2522 extern void save_for_inline_copying PARAMS ((tree));
2523 extern void set_decl_abstract_flags PARAMS ((tree, int));
2524 extern void output_inline_function PARAMS ((tree));
2527 extern void set_yydebug PARAMS ((int));
2529 /* In stor-layout.c */
2530 extern void fixup_signed_type PARAMS ((tree));
2533 extern void make_decl_rtl PARAMS ((tree, const char *, int));
2534 extern void make_decl_one_only PARAMS ((tree));
2535 extern int supports_one_only PARAMS ((void));
2536 extern void variable_section PARAMS ((tree, int));
2538 /* In fold-const.c */
2539 extern int div_and_round_double PARAMS ((enum tree_code, int,
2540 HOST_WIDE_INT, HOST_WIDE_INT,
2541 HOST_WIDE_INT, HOST_WIDE_INT,
2548 extern void emit_nop PARAMS ((void));
2549 extern void expand_computed_goto PARAMS ((tree));
2550 extern struct rtx_def *label_rtx PARAMS ((tree));
2551 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
2553 extern int any_pending_cleanups PARAMS ((int));
2554 extern void init_stmt PARAMS ((void));
2555 extern void init_stmt_for_function PARAMS ((void));
2556 extern int drop_through_at_end_p PARAMS ((void));
2557 extern void expand_start_target_temps PARAMS ((void));
2558 extern void expand_end_target_temps PARAMS ((void));
2559 extern void expand_elseif PARAMS ((tree));
2560 extern void expand_decl PARAMS ((tree));
2561 extern int expand_decl_cleanup PARAMS ((tree, tree));
2562 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
2563 extern void move_cleanups_up PARAMS ((void));
2564 extern void expand_start_case_dummy PARAMS ((void));
2565 extern void expand_end_case_dummy PARAMS ((void));
2566 extern tree case_index_expr_type PARAMS ((void));
2567 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
2568 extern void check_for_full_enumeration_handling PARAMS ((tree));
2569 extern void declare_nonlocal_label PARAMS ((tree));
2571 extern void lang_print_xnode PARAMS ((FILE *, tree, int));
2575 /* If KIND=='I', return a suitable global initializer (constructor) name.
2576 If KIND=='D', return a suitable global clean-up (destructor) name. */
2577 extern tree get_file_function_name PARAMS ((int));
2579 /* Interface of the DWARF2 unwind info support. */
2581 /* Decide whether we want to emit frame unwind information for the current
2582 translation unit. */
2584 extern int dwarf2out_do_frame PARAMS ((void));
2586 /* Generate a new label for the CFI info to refer to. */
2588 extern char *dwarf2out_cfi_label PARAMS ((void));
2590 /* Entry point to update the canonical frame address (CFA). */
2592 extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
2594 /* Add the CFI for saving a register window. */
2596 extern void dwarf2out_window_save PARAMS ((char *));
2598 /* Add a CFI to update the running total of the size of arguments pushed
2601 extern void dwarf2out_args_size PARAMS ((char *, long));
2603 /* Entry point for saving a register to the stack. */
2605 extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
2607 /* Entry point for saving the return address in the stack. */
2609 extern void dwarf2out_return_save PARAMS ((char *, long));
2611 /* Entry point for saving the return address in a register. */
2613 extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
2615 /* Output a marker (i.e. a label) for the beginning of a function, before
2618 extern void dwarf2out_begin_prologue PARAMS ((void));
2620 /* Output a marker (i.e. a label) for the absolute end of the generated
2621 code for a function definition. */
2623 extern void dwarf2out_end_epilogue PARAMS ((void));
2625 /* Redefine abort to report an internal error w/o coredump, and
2626 reporting the location of the error in the source file. This logic
2627 is duplicated in rtl.h and tree.h because every file that needs the
2628 special abort includes one or both. toplev.h gets too few files,
2629 system.h gets too many. */
2631 extern void fancy_abort PARAMS ((const char *, int, const char *))
2633 #if (GCC_VERSION >= 2007)
2634 #define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__)
2636 #define abort() fancy_abort (__FILE__, __LINE__, 0)
OSDN Git Service
