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