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 #define DEF_BUILTIN(x) x,
87 enum built_in_function
89 #include "builtins.def"
91 /* Upper bound on non-language-specific builtins. */
96 /* Names for the above. */
97 extern const char *const built_in_names[(int) END_BUILTINS];
99 /* The definition of tree nodes fills the next several pages. */
101 /* A tree node can represent a data type, a variable, an expression
102 or a statement. Each node has a TREE_CODE which says what kind of
103 thing it represents. Some common codes are:
104 INTEGER_TYPE -- represents a type of integers.
105 ARRAY_TYPE -- represents a type of pointer.
106 VAR_DECL -- represents a declared variable.
107 INTEGER_CST -- represents a constant integer value.
108 PLUS_EXPR -- represents a sum (an expression).
110 As for the contents of a tree node: there are some fields
111 that all nodes share. Each TREE_CODE has various special-purpose
112 fields as well. The fields of a node are never accessed directly,
113 always through accessor macros. */
115 /* This type is used everywhere to refer to a tree node. */
117 typedef union tree_node *tree;
119 /* Every kind of tree node starts with this structure,
120 so all nodes have these fields.
122 See the accessor macros, defined below, for documentation of the fields.
124 DO NOT change the layout of tree_common unless absolutely necessary. Some
125 front-ends (namely g++) depend on the internal layout of this tructure.
126 See my_tree_cons in the cp subdir for such uglyness. Ugh. */
130 union tree_node *chain;
131 union tree_node *type;
132 #ifdef ONLY_INT_FIELDS
133 unsigned int code : 8;
135 enum tree_code code : 8;
138 unsigned side_effects_flag : 1;
139 unsigned constant_flag : 1;
140 unsigned permanent_flag : 1;
141 unsigned addressable_flag : 1;
142 unsigned volatile_flag : 1;
143 unsigned readonly_flag : 1;
144 unsigned unsigned_flag : 1;
145 unsigned asm_written_flag: 1;
147 unsigned used_flag : 1;
148 unsigned nothrow_flag : 1;
149 unsigned static_flag : 1;
150 unsigned public_flag : 1;
151 unsigned private_flag : 1;
152 unsigned protected_flag : 1;
154 unsigned lang_flag_0 : 1;
155 unsigned lang_flag_1 : 1;
156 unsigned lang_flag_2 : 1;
157 unsigned lang_flag_3 : 1;
158 unsigned lang_flag_4 : 1;
159 unsigned lang_flag_5 : 1;
160 unsigned lang_flag_6 : 1;
162 /* There is room for three more flags. */
165 /* The following table lists the uses of each of the above flags and
166 for which types of nodes they are defined. Note that expressions
172 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
178 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
179 TREE_NO_UNUSED_WARNING in
180 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
182 TREE_LIST or TREE_VEC
183 TREE_CONSTANT_OVERFLOW in
184 INTEGER_CST, REAL_CST, COMPLEX_CST
185 TREE_SYMBOL_REFERENCED in
191 INTEGER_CST, REAL_CST, COMPLEX_CST
193 VAR_DECL or FUNCTION_DECL
195 TREE_LIST or TREE_VEC
196 EXPR_WFL_EMIT_LINE_NOTE in
197 EXPR_WITH_FILE_LOCATION
202 TREE_LIST or TREE_VEC
204 ??? unspecified nodes
208 TREE_VIA_PROTECTED in
212 ??? unspecified nodes
221 TREE_THIS_VOLATILE in
231 VAR_DECL if iterator (C)
240 permanent_flag: TREE_PERMANENT in all nodes
245 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
246 DECL_BUILT_IN_NONANSI in
250 SAVE_EXPR_NOPLACEHOLDER in
256 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
262 expressions, IDENTIFIER_NODE
267 CALL_EXPR, FUNCTION_DECL
270 /* Define accessors for the fields that all tree nodes have
271 (though some fields are not used for all kinds of nodes). */
273 /* The tree-code says what kind of node it is.
274 Codes are defined in tree.def. */
275 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
276 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
278 /* When checking is enabled, errors will be generated if a tree node
279 is accessed incorrectly. The macros abort with a fatal error. */
280 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
282 #define TREE_CHECK(t, code) \
283 ({ const tree __t = t; \
284 if (TREE_CODE(__t) != (code)) \
285 tree_check_failed (__t, code, __FILE__, \
286 __LINE__, __PRETTY_FUNCTION__); \
288 #define TREE_CLASS_CHECK(t, class) \
289 ({ const tree __t = t; \
290 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
291 tree_class_check_failed (__t, class, __FILE__, \
292 __LINE__, __PRETTY_FUNCTION__); \
295 /* These checks have to be special cased. */
296 #define CST_OR_CONSTRUCTOR_CHECK(t) \
297 ({ const tree __t = t; \
298 enum tree_code __c = TREE_CODE(__t); \
299 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
300 tree_check_failed (__t, CONSTRUCTOR, __FILE__, \
301 __LINE__, __PRETTY_FUNCTION__); \
303 #define EXPR_CHECK(t) \
304 ({ const tree __t = t; \
305 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
306 if (__c != 'r' && __c != 's' && __c != '<' \
307 && __c != '1' && __c != '2' && __c != 'e') \
308 tree_class_check_failed(__t, 'e', __FILE__, \
309 __LINE__, __PRETTY_FUNCTION__); \
312 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
313 const char *, int, const char *))
315 extern void tree_class_check_failed PARAMS ((const tree, char,
316 const char *, int, const char *))
319 #else /* not ENABLE_TREE_CHECKING, or not gcc */
321 #define TREE_CHECK(t, code) (t)
322 #define TREE_CLASS_CHECK(t, code) (t)
323 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
324 #define EXPR_CHECK(t) (t)
328 #include "tree-check.h"
330 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
331 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
332 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
334 /* In all nodes that are expressions, this is the data type of the expression.
335 In POINTER_TYPE nodes, this is the type that the pointer points to.
336 In ARRAY_TYPE nodes, this is the type of the elements. */
337 #define TREE_TYPE(NODE) ((NODE)->common.type)
339 /* Nodes are chained together for many purposes.
340 Types are chained together to record them for being output to the debugger
341 (see the function `chain_type').
342 Decls in the same scope are chained together to record the contents
344 Statement nodes for successive statements used to be chained together.
345 Often lists of things are represented by TREE_LIST nodes that
346 are chained together. */
348 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
350 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
351 that don't change the machine mode. */
353 #define STRIP_NOPS(EXP) \
354 while ((TREE_CODE (EXP) == NOP_EXPR \
355 || TREE_CODE (EXP) == CONVERT_EXPR \
356 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
357 && (TYPE_MODE (TREE_TYPE (EXP)) \
358 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
359 (EXP) = TREE_OPERAND (EXP, 0);
361 /* Like STRIP_NOPS, but don't let the signedness change either. */
363 #define STRIP_SIGN_NOPS(EXP) \
364 while ((TREE_CODE (EXP) == NOP_EXPR \
365 || TREE_CODE (EXP) == CONVERT_EXPR \
366 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
367 && (TYPE_MODE (TREE_TYPE (EXP)) \
368 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
369 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
370 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
371 (EXP) = TREE_OPERAND (EXP, 0);
373 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
375 #define STRIP_TYPE_NOPS(EXP) \
376 while ((TREE_CODE (EXP) == NOP_EXPR \
377 || TREE_CODE (EXP) == CONVERT_EXPR \
378 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
379 && (TREE_TYPE (EXP) \
380 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
381 (EXP) = TREE_OPERAND (EXP, 0);
383 /* Nonzero if TYPE represents an integral type. Note that we do not
384 include COMPLEX types here. */
386 #define INTEGRAL_TYPE_P(TYPE) \
387 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
388 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
390 /* Nonzero if TYPE represents a floating-point type, including complex
391 floating-point types. */
393 #define FLOAT_TYPE_P(TYPE) \
394 (TREE_CODE (TYPE) == REAL_TYPE \
395 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
396 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
398 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
400 #define AGGREGATE_TYPE_P(TYPE) \
401 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
402 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
403 || TREE_CODE (TYPE) == SET_TYPE)
405 /* Nonzero if TYPE represents a pointer type. */
407 #define POINTER_TYPE_P(TYPE) \
408 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
410 /* Nonzero if this type is a complete type. */
411 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
413 /* Nonzero if this type is complete or is cv void. */
414 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
415 (COMPLETE_TYPE_P (NODE) || TREE_CODE (NODE) == VOID_TYPE)
417 /* Nonzero if this type is complete or is an array with unspecified bound. */
418 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
419 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE))
421 /* Nonzero if TYPE represents a type. */
423 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
425 /* Define many boolean fields that all tree nodes have. */
427 /* In VAR_DECL nodes, nonzero means address of this is needed.
428 So it cannot be in a register.
429 In a FUNCTION_DECL, nonzero means its address is needed.
430 So it must be compiled even if it is an inline function.
431 In CONSTRUCTOR nodes, it means object constructed must be in memory.
432 In LABEL_DECL nodes, it means a goto for this label has been seen
433 from a place outside all binding contours that restore stack levels.
434 In ..._TYPE nodes, it means that objects of this type must
435 be fully addressable. This means that pieces of this
436 object cannot go into register parameters, for example.
437 In IDENTIFIER_NODEs, this means that some extern decl for this name
438 had its address taken. That matters for inline functions. */
439 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
441 /* In a VAR_DECL, nonzero means allocate static storage.
442 In a FUNCTION_DECL, nonzero if function has been defined.
443 In a CONSTRUCTOR, nonzero means allocate static storage. */
444 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
446 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
447 made implicitly and should not lead to an "unused value" warning. */
448 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
450 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
451 chain is via a `virtual' declaration. */
452 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
454 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
455 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
456 requires a diagnostic when overflows occur in constant expressions. */
457 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
459 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
460 this string as an argument. */
461 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
463 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
464 overflow in folding, and no warning has been issued for this subexpression.
465 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
466 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
468 /* In a VAR_DECL or FUNCTION_DECL,
469 nonzero means name is to be accessible from outside this module.
470 In an identifier node, nonzero means an external declaration
471 accessible from outside this module was previously seen
472 for this name in an inner scope. */
473 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
475 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
476 base class is via a `public' declaration, which preserves public
477 fields from the base class as public. */
478 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
480 /* Ditto, for `private' declarations. */
481 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
483 /* Nonzero for TREE_LIST node means that the path to the
484 base class is via a `protected' declaration, which preserves
485 protected fields from the base class as protected.
487 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
489 /* In any expression, nonzero means it has side effects or reevaluation
490 of the whole expression could produce a different value.
491 This is set if any subexpression is a function call, a side effect
492 or a reference to a volatile variable.
493 In a ..._DECL, this is set only if the declaration said `volatile'. */
494 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
496 /* Nonzero means this expression is volatile in the C sense:
497 its address should be of type `volatile WHATEVER *'.
498 In other words, the declared item is volatile qualified.
499 This is used in _DECL nodes and _REF nodes.
501 In a ..._TYPE node, means this type is volatile-qualified.
502 But use TYPE_VOLATILE instead of this macro when the node is a type,
503 because eventually we may make that a different bit.
505 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
506 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
508 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
509 nonzero means it may not be the lhs of an assignment.
510 In a ..._TYPE node, means this type is const-qualified
511 (but the macro TYPE_READONLY should be used instead of this macro
512 when the node is a type). */
513 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
515 /* Value of expression is constant.
516 Always appears in all ..._CST nodes.
517 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
518 if the value is constant. */
519 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
521 /* Nonzero means permanent node;
522 node will continue to exist for the entire compiler run.
523 Otherwise it will be recycled at the end of the function.
524 This flag is always zero if garbage collection is in use.
525 Try not to use this. Only set it with TREE_SET_PERMANENT. */
526 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
527 #define TREE_SET_PERMANENT(NODE) do { \
528 if (!ggc_p && current_obstack == &permanent_obstack) \
529 TREE_PERMANENT(NODE) = 1; \
532 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
533 In FIELD_DECL nodes, means an unsigned bit field.
534 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
535 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
537 /* Nonzero in a VAR_DECL means assembler code has been written.
538 Nonzero in a FUNCTION_DECL means that the function has been compiled.
539 This is interesting in an inline function, since it might not need
540 to be compiled separately.
541 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
542 if the sdb debugging info for the type has been written.
543 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
544 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
546 /* Nonzero in a _DECL if the name is used in its scope.
547 Nonzero in an expr node means inhibit warning if value is unused.
548 In IDENTIFIER_NODEs, this means that some extern decl for this name
550 #define TREE_USED(NODE) ((NODE)->common.used_flag)
552 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
553 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
554 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
556 /* Used in classes in C++. */
557 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
558 /* Used in classes in C++.
559 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
560 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
562 /* These flags are available for each language front end to use internally. */
563 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
564 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
565 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
566 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
567 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
568 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
569 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
571 /* Define additional fields and accessors for nodes representing constants. */
573 /* In an INTEGER_CST node. These two together make a 2-word integer.
574 If the data type is signed, the value is sign-extended to 2 words
575 even though not all of them may really be in use.
576 In an unsigned constant shorter than 2 words, the extra bits are 0. */
577 #define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
578 #define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
580 #define INT_CST_LT(A, B) \
581 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
582 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
583 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
585 #define INT_CST_LT_UNSIGNED(A, B) \
586 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
587 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
588 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
589 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
590 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
594 char common[sizeof (struct tree_common)];
595 struct rtx_def *rtl; /* acts as link to register transfer language
597 unsigned HOST_WIDE_INT int_cst_low;
598 HOST_WIDE_INT int_cst_high;
601 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
602 and generally in all kinds of constants that could
603 be given labels (rather than being immediate). */
605 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
607 /* In a REAL_CST node. */
608 /* We can represent a real value as either a `double' or a string.
609 Strings don't allow for any optimization, but they do allow
610 for cross-compilation. */
612 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
618 char common[sizeof (struct tree_common)];
619 struct rtx_def *rtl; /* acts as link to register transfer language
621 REAL_VALUE_TYPE real_cst;
624 /* In a STRING_CST */
625 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
626 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
630 char common[sizeof (struct tree_common)];
631 struct rtx_def *rtl; /* acts as link to register transfer language
637 /* In a COMPLEX_CST node. */
638 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
639 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
643 char common[sizeof (struct tree_common)];
644 struct rtx_def *rtl; /* acts as link to register transfer language
646 union tree_node *real;
647 union tree_node *imag;
650 /* Define fields and accessors for some special-purpose tree nodes. */
652 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
653 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
655 struct tree_identifier
657 char common[sizeof (struct tree_common)];
662 /* In a TREE_LIST node. */
663 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
664 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
668 char common[sizeof (struct tree_common)];
669 union tree_node *purpose;
670 union tree_node *value;
673 /* In a TREE_VEC node. */
674 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
675 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
676 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
680 char common[sizeof (struct tree_common)];
682 union tree_node *a[1];
685 /* Define fields and accessors for some nodes that represent expressions. */
687 /* In a SAVE_EXPR node. */
688 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
689 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
690 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
691 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
692 both in normal code and in a handler. (Normally, in a handler, all
693 SAVE_EXPRs are unsaved, meaning that there values are
695 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
697 /* In a RTL_EXPR node. */
698 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
699 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
701 /* In a CALL_EXPR node. */
702 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
704 /* In a CONSTRUCTOR node. */
705 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
707 /* In ordinary expression nodes. */
708 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
709 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
711 /* In a LABELED_BLOCK_EXPR node. */
712 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
713 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
715 /* In a EXIT_BLOCK_EXPR node. */
716 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
717 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
719 /* In a LOOP_EXPR node. */
720 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
722 /* In a EXPR_WITH_FILE_LOCATION node. */
723 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
724 #define EXPR_WFL_FILENAME(NODE) \
725 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
726 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
727 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
728 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
729 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
730 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
731 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
732 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
736 char common[sizeof (struct tree_common)];
738 union tree_node *operands[1];
741 /* In a BLOCK node. */
742 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
743 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
744 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
745 /* Note: when changing this, make sure to find the places
746 that use chainon or nreverse. */
747 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
748 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
749 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
751 /* Nonzero means that this block is prepared to handle exceptions
752 listed in the BLOCK_VARS slot. */
753 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
755 /* An index number for this block. These values are not guaranteed to
756 be unique across functions -- whether or not they are depends on
757 the debugging output format in use. */
758 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
762 char common[sizeof (struct tree_common)];
764 unsigned handler_block_flag : 1;
765 unsigned abstract_flag : 1;
766 unsigned block_num : 30;
768 union tree_node *vars;
769 union tree_node *subblocks;
770 union tree_node *supercontext;
771 union tree_node *abstract_origin;
774 /* Define fields and accessors for nodes representing data types. */
776 /* See tree.def for documentation of the use of these fields.
777 Look at the documentation of the various ..._TYPE tree codes. */
779 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
780 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
781 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
782 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
783 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
784 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
785 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
786 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
787 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
788 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
789 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
790 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
791 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
792 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
793 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
794 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
795 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
796 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
797 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
798 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
799 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
800 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
801 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
802 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
803 #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
804 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
806 /* For aggregate types, information about this type, as a base type
807 for itself. Used in a language-dependent way for types that are
808 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
809 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
811 /* The (language-specific) typed-based alias set for this type.
812 Objects whose TYPE_ALIAS_SETs are different cannot alias each
813 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
814 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
815 type can alias objects of any type. */
816 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
818 /* Nonzero iff the typed-based alias set for this type has been
820 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
821 (TYPE_CHECK (NODE)->type.alias_set != -1)
823 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
825 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
827 /* The alignment necessary for objects of this type.
828 The value is an int, measured in bits. */
829 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
831 /* The alignment for NODE, in bytes. */
832 #define TYPE_ALIGN_UNIT(NODE) \
833 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
835 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
837 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
838 has BLKmode only because it lacks the alignment requirement for
840 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
842 /* In an INTEGER_TYPE, it means the type represents a size. We use this
843 both for validity checking and to permit optimziations that are unsafe
845 #define TYPE_IS_SIZETYPE(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
847 /* Nonzero in a type considered volatile as a whole. */
848 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
850 /* Means this type is const-qualified. */
851 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
853 /* If nonzero, this type is `restrict'-qualified, in the C sense of
855 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
857 /* There is a TYPE_QUAL value for each type qualifier. They can be
858 combined by bitwise-or to form the complete set of qualifiers for a
861 #define TYPE_UNQUALIFIED 0x0
862 #define TYPE_QUAL_CONST 0x1
863 #define TYPE_QUAL_VOLATILE 0x2
864 #define TYPE_QUAL_RESTRICT 0x4
866 /* The set of type qualifiers for this type. */
867 #define TYPE_QUALS(NODE) \
868 ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) \
869 | (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) \
870 | (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT))
872 /* These flags are available for each language front end to use internally. */
873 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
874 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
875 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
876 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
877 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
878 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
879 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
881 /* If set in an ARRAY_TYPE, indicates a string type (for languages
882 that distinguish string from array of char).
883 If set in a SET_TYPE, indicates a bitstring type. */
884 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
886 /* If non-NULL, this is a upper bound of the size (in bytes) of an
887 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
888 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
890 /* Indicates that objects of this type must be initialized by calling a
891 function when they are created. */
892 #define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
894 /* Indicates that objects of this type (a UNION_TYPE), should be passed
895 the same way that the first union alternative would be passed. */
896 #define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
898 /* Indicated that objects of this type should be laid out in as
899 compact a way as possible. */
900 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
904 char common[sizeof (struct tree_common)];
905 union tree_node *values;
906 union tree_node *size;
907 union tree_node *size_unit;
908 union tree_node *attributes;
911 unsigned char precision;
912 #ifdef ONLY_INT_FIELDS
913 unsigned int mode : 8;
915 enum machine_mode mode : 8;
918 unsigned string_flag : 1;
919 unsigned no_force_blk_flag : 1;
920 unsigned needs_constructing_flag : 1;
921 unsigned transparent_union_flag : 1;
922 unsigned packed_flag : 1;
923 unsigned restrict_flag : 1;
925 unsigned lang_flag_0 : 1;
926 unsigned lang_flag_1 : 1;
927 unsigned lang_flag_2 : 1;
928 unsigned lang_flag_3 : 1;
929 unsigned lang_flag_4 : 1;
930 unsigned lang_flag_5 : 1;
931 unsigned lang_flag_6 : 1;
932 /* room for 3 more bits */
935 union tree_node *pointer_to;
936 union tree_node *reference_to;
937 union {int address; char *pointer; } symtab;
938 union tree_node *name;
939 union tree_node *minval;
940 union tree_node *maxval;
941 union tree_node *next_variant;
942 union tree_node *main_variant;
943 union tree_node *binfo;
944 union tree_node *noncopied_parts;
945 union tree_node *context;
946 struct obstack *obstack;
948 /* Points to a structure whose details depend on the language in use. */
949 struct lang_type *lang_specific;
952 /* Define accessor macros for information about type inheritance
955 A "basetype" means a particular usage of a data type for inheritance
956 in another type. Each such basetype usage has its own "binfo"
957 object to describe it. The binfo object is a TREE_VEC node.
959 Inheritance is represented by the binfo nodes allocated for a
960 given type. For example, given types C and D, such that D is
961 inherited by C, 3 binfo nodes will be allocated: one for describing
962 the binfo properties of C, similarly one for D, and one for
963 describing the binfo properties of D as a base type for C.
964 Thus, given a pointer to class C, one can get a pointer to the binfo
965 of D acting as a basetype for C by looking at C's binfo's basetypes. */
967 /* The actual data type node being inherited in this basetype. */
968 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
970 /* The offset where this basetype appears in its containing type.
971 BINFO_OFFSET slot holds the offset (in bytes)
972 from the base of the complete object to the base of the part of the
973 object that is allocated on behalf of this `type'.
974 This is always 0 except when there is multiple inheritance. */
976 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
977 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
978 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
980 /* The virtual function table belonging to this basetype. Virtual
981 function tables provide a mechanism for run-time method dispatching.
982 The entries of a virtual function table are language-dependent. */
984 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
985 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
987 /* The virtual functions in the virtual function table. This is
988 a TREE_LIST that is used as an initial approximation for building
989 a virtual function table for this basetype. */
990 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
991 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
993 /* A vector of binfos for the direct basetypes inherited by this
996 If this basetype describes type D as inherited in C, and if the
997 basetypes of D are E and F, then this vector contains binfos for
998 inheritance of E and F by C.
1000 ??? This could probably be done by just allocating the
1001 base types at the end of this TREE_VEC (instead of using
1002 another TREE_VEC). This would simplify the calculation
1003 of how many basetypes a given type had. */
1004 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1005 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1007 /* The number of basetypes for NODE. */
1008 #define BINFO_N_BASETYPES(NODE) \
1009 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1011 /* Accessor macro to get to the Nth basetype of this basetype. */
1012 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1013 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1015 /* For a BINFO record describing a virtual base class, i.e., one where
1016 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1017 base. The actual contents are language-dependent. Under the old
1018 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1019 pointer to the virtual base; under the new ABI this field is
1020 instead a INTEGER_CST giving an offset into the vtable where the
1021 offset to the virtual base can be found. */
1022 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1024 /* The size of a base class subobject of this type. Not all frontends
1025 currently allocate the space for these fields. */
1026 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1027 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1028 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1029 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1031 /* Slot used to build a chain that represents a use of inheritance.
1032 For example, if X is derived from Y, and Y is derived from Z,
1033 then this field can be used to link the binfo node for X to
1034 the binfo node for X's Y to represent the use of inheritance
1035 from X to Y. Similarly, this slot of the binfo node for X's Y
1036 can point to the Z from which Y is inherited (in X's inheritance
1037 hierarchy). In this fashion, one can represent and traverse specific
1038 uses of inheritance using the binfo nodes themselves (instead of
1039 consing new space pointing to binfo nodes).
1040 It is up to the language-dependent front-ends to maintain
1041 this information as necessary. */
1042 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1044 /* Define fields and accessors for nodes representing declared names. */
1046 /* Nonzero if DECL represents a decl. */
1047 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1048 /* This is the name of the object as written by the user.
1049 It is an IDENTIFIER_NODE. */
1050 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1051 /* This is the name of the object as the assembler will see it
1052 (but before any translations made by ASM_OUTPUT_LABELREF).
1053 Often this is the same as DECL_NAME.
1054 It is an IDENTIFIER_NODE. */
1055 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1056 /* Records the section name in a section attribute. Used to pass
1057 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1058 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1059 /* For FIELD_DECLs, this is the
1060 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1061 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1062 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1063 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1064 type, or NULL_TREE if the given decl has "file scope". */
1065 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1066 #define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1067 /* In a DECL this is the field where configuration dependent machine
1068 attributes are store */
1069 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1070 /* In a FIELD_DECL, this is the field position, counting in bits,
1071 of the bit closest to the beginning of the structure. */
1072 #define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1073 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1074 if so, the type that was originally specified for it.
1075 TREE_TYPE may have been modified (in finish_struct). */
1076 #define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1077 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1078 /* VAR_DECL and PARM_DECL reserve the arguments slot
1079 for language-specific uses. */
1080 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1081 /* In FUNCTION_DECL, holds the decl for the return value. */
1082 #define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result)
1083 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1084 #define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1085 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1086 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result)
1087 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1088 For a VAR_DECL, holds the initial value.
1089 For a PARM_DECL, not used--default
1090 values for parameters are encoded in the type of the function,
1091 not in the PARM_DECL slot. */
1092 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1093 /* For a PARM_DECL, records the data type used to pass the argument,
1094 which may be different from the type seen in the program. */
1095 #define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial)
1096 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1097 if nonzero, indicates that the field occupies the type. */
1098 #define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial)
1099 /* These two fields describe where in the source code the declaration was. */
1100 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1101 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1102 /* Holds the size of the datum, in bits, as a tree expression.
1103 Need not be constant. */
1104 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1105 /* Likewise for the size in bytes. */
1106 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1107 /* Holds the alignment required for the datum. */
1108 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.u)
1109 /* Holds the machine mode corresponding to the declaration of a variable or
1110 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1112 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1113 /* Holds the RTL expression for the value of a variable or function. If
1114 PROMOTED_MODE is defined, the mode of this expression may not be same
1115 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1116 to the variable's data type, while the mode
1117 of DECL_RTL is the mode actually used to contain the data. */
1118 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1119 /* Holds an INSN_LIST of all of the live ranges in which the variable
1120 has been moved to a possibly different register. */
1121 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1122 /* For PARM_DECL, holds an RTL for the stack slot or register
1123 where the data was actually passed. */
1124 #define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.u2.r)
1125 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1126 #define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.u2.f)
1127 /* For FUNCTION_DECL, if it is inline,
1128 holds the size of the stack frame, as an integer. */
1129 #define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.u1.i)
1130 /* For FUNCTION_DECL, if it is built-in,
1131 this identifies which built-in operation it is. */
1132 #define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.u1.f)
1134 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1135 Before the struct containing the FUNCTION_DECL is laid out,
1136 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1137 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1138 function. When the class is laid out, this pointer is changed
1139 to an INTEGER_CST node which is suitable for use as an index
1140 into the virtual function table. */
1141 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1142 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1143 which this FIELD_DECL is defined. This information is needed when
1144 writing debugging information about vfield and vbase decls for C++. */
1145 #define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex)
1147 /* Every ..._DECL node gets a unique number. */
1148 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1150 /* For any sort of a ..._DECL node, this points to the original (abstract)
1151 decl node which this decl is an instance of, or else it is NULL indicating
1152 that this decl is not an instance of some other decl. For example,
1153 in a nested declaration of an inline function, this points back to the
1155 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1157 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1158 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1159 #define DECL_ORIGIN(NODE) \
1160 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1162 /* Nonzero for any sort of ..._DECL node means this decl node represents
1163 an inline instance of some original (abstract) decl from an inline function;
1164 suppress any warnings about shadowing some other variable.
1165 FUNCTION_DECL nodes can also have their abstract origin set to themselves
1166 (see save_for_inline_copying). */
1167 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1168 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1170 /* Nonzero if a _DECL means that the name of this decl should be ignored
1171 for symbolic debug purposes. */
1172 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1174 /* Nonzero for a given ..._DECL node means that this node represents an
1175 "abstract instance" of the given declaration (e.g. in the original
1176 declaration of an inline function). When generating symbolic debugging
1177 information, we mustn't try to generate any address information for nodes
1178 marked as "abstract instances" because we don't actually generate
1179 any code or allocate any data space for such instances. */
1180 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1182 /* Nonzero if a _DECL means that no warnings should be generated just
1183 because this decl is unused. */
1184 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1186 /* Nonzero for a given ..._DECL node means that this node should be
1187 put in .common, if possible. If a DECL_INITIAL is given, and it
1188 is not error_mark_node, then the decl cannot be put in .common. */
1189 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1191 /* Language-specific decl information. */
1192 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1194 /* In a VAR_DECL or FUNCTION_DECL,
1195 nonzero means external reference:
1196 do not allocate storage, and refer to a definition elsewhere. */
1197 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1199 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1201 #define DEFAULT_INIT_PRIORITY 65535
1202 #define MAX_INIT_PRIORITY 65535
1203 #define MAX_RESERVED_INIT_PRIORITY 100
1206 nonzero means the detail info about this type is not dumped into stabs.
1207 Instead it will generate cross reference ('x') of names.
1208 This uses the same flag as DECL_EXTERNAL. */
1209 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1212 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1213 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1214 /* In LABEL_DECL nodes, nonzero means that an error message about
1215 jumping into such a binding contour has been printed for this label. */
1216 #define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1217 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1218 #define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1219 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1220 static chain is not needed. */
1221 #define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1223 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1224 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1226 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1228 Also set in some languages for variables, etc., outside the normal
1229 lexical scope, such as class instance variables. */
1230 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1232 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1233 where it is called. */
1234 #define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1236 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1237 that is not specified by ansi C and that users are supposed to be allowed
1238 to redefine for any purpose whatever. */
1239 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1241 /* Nonzero in a FUNCTION_DECL means this function should be treated
1242 as if it were a malloc, meaning it returns a pointer that is
1244 #define DECL_IS_MALLOC(NODE) (DECL_CHECK (NODE)->decl.malloc_flag)
1246 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1248 #define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1249 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1250 contour that restored a stack level and which is now exited. */
1251 #define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1253 /* Unused in FUNCTION_DECL. */
1255 /* In a VAR_DECL that's static,
1256 nonzero if the space is in the text section. */
1257 #define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1259 /* In a FUNCTION_DECL, nonzero means a built in function. */
1260 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1261 /* For a builtin function, identify which part of the compiler defined it. */
1262 #define DECL_BUILT_IN_CLASS(NODE) (DECL_CHECK (NODE)->decl.built_in_class)
1264 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1265 Used in FIELD_DECLs for vtable pointers.
1266 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1267 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1269 /* Used to indicate that the linkage status of this DECL is not yet known,
1270 so it should not be output now. */
1271 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1273 /* Used in PARM_DECLs whose type are unions to indicate that the
1274 argument should be passed in the same way that the first union
1275 alternative would be passed. */
1276 #define DECL_TRANSPARENT_UNION(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1278 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1279 at the beginning or end of execution. */
1280 #define DECL_STATIC_CONSTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_ctor_flag)
1281 #define DECL_STATIC_DESTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_dtor_flag)
1283 /* Used to indicate that this DECL represents a compiler-generated entity. */
1284 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1286 /* Used to indicate that this DECL has weak linkage. */
1287 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1289 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1290 multiple translation units should be merged. */
1291 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1293 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1294 not be put out unless it is needed in this translation unit.
1295 Entities like this are shared across translation units (like weak
1296 entities), but are guaranteed to be generated by any translation
1297 unit that needs them, and therefore need not be put out anywhere
1298 where they are not needed. DECL_COMDAT is just a hint to the
1299 back-end; it is up to front-ends which set this flag to ensure
1300 that there will never be any harm, other than bloat, in putting out
1301 something which is DECL_COMDAT. */
1302 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1304 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1305 be instrumented with calls to support routines. */
1306 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) ((NODE)->decl.no_instrument_function_entry_exit)
1308 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1309 disabled in this function. */
1310 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) ((NODE)->decl.no_check_memory_usage)
1312 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1313 disabled in this function. */
1314 #define DECL_NO_LIMIT_STACK(NODE) ((NODE)->decl.no_limit_stack)
1316 /* Additional flags for language-specific uses. */
1317 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1318 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1319 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1320 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1321 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1322 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1323 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1324 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1326 /* Used to indicate that the pointer to this DECL cannot be treated as
1327 an address constant. */
1328 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1330 /* Used to indicate an alias set for the memory pointed to by this
1331 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1332 pointer (or reference) type. */
1333 #define DECL_POINTER_ALIAS_SET(NODE) \
1334 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1336 /* Nonzero if an alias set has been assigned to this declaration. */
1337 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1338 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1342 char common[sizeof (struct tree_common)];
1346 union tree_node *size;
1347 #ifdef ONLY_INT_FIELDS
1350 enum machine_mode mode : 8;
1353 unsigned external_flag : 1;
1354 unsigned nonlocal_flag : 1;
1355 unsigned regdecl_flag : 1;
1356 unsigned inline_flag : 1;
1357 unsigned bit_field_flag : 1;
1358 unsigned virtual_flag : 1;
1359 unsigned ignored_flag : 1;
1360 unsigned abstract_flag : 1;
1362 unsigned in_system_header_flag : 1;
1363 unsigned common_flag : 1;
1364 unsigned defer_output : 1;
1365 unsigned transparent_union : 1;
1366 unsigned static_ctor_flag : 1;
1367 unsigned static_dtor_flag : 1;
1368 unsigned artificial_flag : 1;
1369 unsigned weak_flag : 1;
1371 unsigned non_addr_const_p : 1;
1372 unsigned no_instrument_function_entry_exit : 1;
1373 unsigned no_check_memory_usage : 1;
1374 unsigned comdat_flag : 1;
1375 unsigned malloc_flag : 1;
1376 unsigned no_limit_stack : 1;
1377 #ifdef ONLY_INT_FIELDS
1378 unsigned int built_in_class : 2;
1380 enum built_in_class built_in_class : 2;
1383 unsigned lang_flag_0 : 1;
1384 unsigned lang_flag_1 : 1;
1385 unsigned lang_flag_2 : 1;
1386 unsigned lang_flag_3 : 1;
1387 unsigned lang_flag_4 : 1;
1388 unsigned lang_flag_5 : 1;
1389 unsigned lang_flag_6 : 1;
1390 unsigned lang_flag_7 : 1;
1392 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1393 If built-in, this is the code for which built-in function.
1394 For other kinds of decls, this is DECL_ALIGN. */
1398 enum built_in_function f;
1401 union tree_node *size_unit;
1402 union tree_node *name;
1403 union tree_node *context;
1404 union tree_node *arguments; /* Also used for DECL_FIELD_BITPOS */
1405 union tree_node *result; /* Also used for DECL_BIT_FIELD_TYPE */
1406 union tree_node *initial; /* Also used for DECL_QUALIFIER */
1407 union tree_node *abstract_origin;
1408 union tree_node *assembler_name;
1409 union tree_node *section_name;
1410 union tree_node *machine_attributes;
1411 struct rtx_def *rtl; /* RTL representation for object. */
1412 struct rtx_def *live_range_rtl;
1414 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1415 In PARM_DECL, holds an RTL for the stack slot
1416 of register where the data was actually passed.
1417 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1425 union tree_node *vindex;
1426 int pointer_alias_set;
1427 /* Points to a structure whose details depend on the language in use. */
1428 struct lang_decl *lang_specific;
1431 /* Define the overall contents of a tree node.
1432 It may be any of the structures declared above
1433 for various types of node. */
1437 struct tree_common common;
1438 struct tree_int_cst int_cst;
1439 struct tree_real_cst real_cst;
1440 struct tree_string string;
1441 struct tree_complex complex;
1442 struct tree_identifier identifier;
1443 struct tree_decl decl;
1444 struct tree_type type;
1445 struct tree_list list;
1446 struct tree_vec vec;
1447 struct tree_exp exp;
1448 struct tree_block block;
1451 /* Standard named or nameless data types of the C compiler. */
1475 TI_COMPLEX_INTEGER_TYPE,
1476 TI_COMPLEX_FLOAT_TYPE,
1477 TI_COMPLEX_DOUBLE_TYPE,
1478 TI_COMPLEX_LONG_DOUBLE_TYPE,
1482 TI_LONG_DOUBLE_TYPE,
1493 extern tree global_trees[TI_MAX];
1495 #define error_mark_node global_trees[TI_ERROR_MARK]
1497 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1498 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1499 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1500 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1501 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1503 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1504 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1505 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1506 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1507 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1509 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1510 #define integer_one_node global_trees[TI_INTEGER_ONE]
1511 #define size_zero_node global_trees[TI_SIZE_ZERO]
1512 #define size_one_node global_trees[TI_SIZE_ONE]
1513 #define null_pointer_node global_trees[TI_NULL_POINTER]
1515 #define float_type_node global_trees[TI_FLOAT_TYPE]
1516 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1517 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1519 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1520 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1521 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1522 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1524 #define void_type_node global_trees[TI_VOID_TYPE]
1525 /* The C type `void *'. */
1526 #define ptr_type_node global_trees[TI_PTR_TYPE]
1527 /* The C type `const void *'. */
1528 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1529 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1530 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1532 /* An enumeration of the standard C integer types. These must be
1533 ordered so that shorter types appear before longer ones. */
1534 enum integer_type_kind
1546 itk_unsigned_long_long,
1550 typedef enum integer_type_kind integer_type_kind;
1552 /* The standard C integer types. Use integer_type_kind to index into
1554 extern tree integer_types[itk_none];
1556 #define char_type_node integer_types[itk_char]
1557 #define signed_char_type_node integer_types[itk_signed_char]
1558 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1559 #define short_integer_type_node integer_types[itk_short]
1560 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1561 #define integer_type_node integer_types[itk_int]
1562 #define unsigned_type_node integer_types[itk_unsigned_int]
1563 #define long_integer_type_node integer_types[itk_long]
1564 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1565 #define long_long_integer_type_node integer_types[itk_long_long]
1566 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1569 #define NULL_TREE (tree) NULL
1571 /* The following functions accept a wide integer argument. Rather than
1572 having to cast on every function call, we use a macro instead, that is
1573 defined here and in rtl.h. */
1576 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1577 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1579 extern int exact_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1580 extern int floor_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1582 extern char *oballoc PARAMS ((int));
1583 extern char *permalloc PARAMS ((int));
1584 extern char *savealloc PARAMS ((int));
1585 extern char *expralloc PARAMS ((int));
1587 /* Lowest level primitive for allocating a node.
1588 The TREE_CODE is the only argument. Contents are initialized
1589 to zero except for a few of the common fields. */
1591 extern tree make_node PARAMS ((enum tree_code));
1592 extern tree make_lang_type PARAMS ((enum tree_code));
1593 extern tree (*make_lang_type_fn) PARAMS ((enum tree_code));
1595 /* Make a copy of a node, with all the same contents except
1596 for TREE_PERMANENT. (The copy is permanent
1597 iff nodes being made now are permanent.) */
1599 extern tree copy_node PARAMS ((tree));
1601 /* Make a copy of a chain of TREE_LIST nodes. */
1603 extern tree copy_list PARAMS ((tree));
1605 /* Make a TREE_VEC. */
1607 extern tree make_tree_vec PARAMS ((int));
1609 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1610 The name is supplied as a char *. */
1612 extern tree get_identifier PARAMS ((const char *));
1614 /* If an identifier with the name TEXT (a null-terminated string) has
1615 previously been referred to, return that node; otherwise return
1618 extern tree maybe_get_identifier PARAMS ((const char *));
1620 /* Construct various types of nodes. */
1622 #define build_int_2(LO,HI) \
1623 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1625 extern tree build PARAMS ((enum tree_code, tree, ...));
1626 extern tree build_nt PARAMS ((enum tree_code, ...));
1627 extern tree build_parse_node PARAMS ((enum tree_code, ...));
1629 extern tree build_int_2_wide PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT));
1630 extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE));
1631 extern tree build_real_from_int_cst PARAMS ((tree, tree));
1632 extern tree build_complex PARAMS ((tree, tree, tree));
1633 extern tree build_string PARAMS ((int, const char *));
1634 extern tree build1 PARAMS ((enum tree_code, tree, tree));
1635 extern tree build_tree_list PARAMS ((tree, tree));
1636 extern tree build_decl_list PARAMS ((tree, tree));
1637 extern tree build_expr_list PARAMS ((tree, tree));
1638 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
1639 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
1640 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
1642 /* Construct various nodes representing data types. */
1644 extern tree make_signed_type PARAMS ((int));
1645 extern tree make_unsigned_type PARAMS ((int));
1646 extern void initialize_sizetypes PARAMS ((void));
1647 extern void set_sizetype PARAMS ((tree));
1648 extern tree signed_or_unsigned_type PARAMS ((int, tree));
1649 extern void fixup_unsigned_type PARAMS ((tree));
1650 extern tree build_pointer_type PARAMS ((tree));
1651 extern tree build_reference_type PARAMS ((tree));
1652 extern tree build_index_type PARAMS ((tree));
1653 extern tree build_index_2_type PARAMS ((tree, tree));
1654 extern tree build_array_type PARAMS ((tree, tree));
1655 extern tree build_function_type PARAMS ((tree, tree));
1656 extern tree build_method_type PARAMS ((tree, tree));
1657 extern tree build_offset_type PARAMS ((tree, tree));
1658 extern tree build_complex_type PARAMS ((tree));
1659 extern tree array_type_nelts PARAMS ((tree));
1661 extern tree value_member PARAMS ((tree, tree));
1662 extern tree purpose_member PARAMS ((tree, tree));
1663 extern tree binfo_member PARAMS ((tree, tree));
1664 extern unsigned int attribute_hash_list PARAMS ((tree));
1665 extern int attribute_list_equal PARAMS ((tree, tree));
1666 extern int attribute_list_contained PARAMS ((tree, tree));
1667 extern int tree_int_cst_equal PARAMS ((tree, tree));
1668 extern int tree_int_cst_lt PARAMS ((tree, tree));
1669 extern int host_integerp PARAMS ((tree, int));
1670 extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
1671 extern int tree_int_cst_msb PARAMS ((tree));
1672 extern int tree_int_cst_sgn PARAMS ((tree));
1673 extern int index_type_equal PARAMS ((tree, tree));
1674 extern tree get_inner_array_type PARAMS ((tree));
1676 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1677 put the prototype here. Rtl.h does declare the prototype if
1678 tree.h had been included. */
1680 extern tree make_tree PARAMS ((tree, struct rtx_def *));
1682 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1685 Such modified types already made are recorded so that duplicates
1688 extern tree build_type_attribute_variant PARAMS ((tree, tree));
1689 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
1691 extern tree merge_machine_decl_attributes PARAMS ((tree, tree));
1692 extern tree merge_machine_type_attributes PARAMS ((tree, tree));
1694 /* Split a list of declspecs and attributes into two. */
1696 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
1698 /* Strip attributes from a list of combined specs and attrs. */
1700 extern tree strip_attrs PARAMS ((tree));
1702 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1704 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
1706 /* Given a tree node and a string, return non-zero if the tree node is
1707 a valid attribute name for the string. */
1709 extern int is_attribute_p PARAMS ((const char *, tree));
1711 /* Given an attribute name and a list of attributes, return the list element
1712 of the attribute or NULL_TREE if not found. */
1714 extern tree lookup_attribute PARAMS ((const char *, tree));
1716 /* Given two attributes lists, return a list of their union. */
1718 extern tree merge_attributes PARAMS ((tree, tree));
1720 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
1721 the same kind of data as TYPE describes. Variants point to the
1722 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
1723 and it points to a chain of other variants so that duplicate
1724 variants are never made. Only main variants should ever appear as
1725 types of expressions. */
1727 extern tree build_qualified_type PARAMS ((tree, int));
1729 /* Like build_qualified_type, but only deals with the `const' and
1730 `volatile' qualifiers. This interface is retained for backwards
1731 compatiblity with the various front-ends; new code should use
1732 build_qualified_type instead. */
1734 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
1735 build_qualified_type (TYPE, \
1736 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
1737 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
1739 /* Make a copy of a type node. */
1741 extern tree build_type_copy PARAMS ((tree));
1743 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1744 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
1745 node, does nothing except for the first time. */
1747 extern void layout_type PARAMS ((tree));
1749 /* These functions allow a front-end to perform a manual layout of a
1750 RECORD_TYPE. (For instance, if the placement of subsequent fields
1751 depends on the placement of fields so far.) Begin by calling
1752 new_record_layout_info. Then, call layout_field for each of the
1753 fields. Then, call finish_record_layout. See layout_type for the
1754 default way in which these functions are used. */
1756 struct record_layout_info_s
1758 /* The RECORD_TYPE that we are laying out. */
1760 /* The size of the record so far, in bits. */
1761 unsigned HOST_WIDE_INT const_size;
1762 /* The alignment of the record so far, in bits. */
1763 unsigned int record_align;
1764 /* If the record can have a variable size, then this will be
1765 non-NULL, and the total size will be CONST_SIZE + VAR_SIZE. */
1767 /* If the record can have a variable size, then this will be the
1768 maximum alignment that we know VAR_SIZE has. */
1769 unsigned int var_align;
1770 /* The static variables (i.e., class variables, as opposed to
1771 instance variables) encountered in T. */
1772 tree pending_statics;
1773 unsigned int unpacked_align;
1774 int packed_maybe_necessary;
1777 typedef struct record_layout_info_s *record_layout_info;
1779 extern record_layout_info new_record_layout_info
1781 extern void layout_field PARAMS ((record_layout_info, tree));
1782 extern void finish_record_layout PARAMS ((record_layout_info));
1784 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1785 return a canonicalized ..._TYPE node, so that duplicates are not made.
1786 How the hash code is computed is up to the caller, as long as any two
1787 callers that could hash identical-looking type nodes agree. */
1789 extern tree type_hash_canon PARAMS ((unsigned int, tree));
1791 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1792 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1793 fields. Call this only once for any given decl node.
1795 Second argument is the boundary that this field can be assumed to
1796 be starting at (in bits). Zero means it can be assumed aligned
1797 on any boundary that may be needed. */
1799 extern void layout_decl PARAMS ((tree, unsigned));
1801 /* Return the mode for data of a given size SIZE and mode class CLASS.
1802 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
1803 The value is BLKmode if no other mode is found. This is like
1804 mode_for_size, but is passed a tree. */
1806 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
1809 /* Return an expr equal to X but certainly not valid as an lvalue. */
1811 extern tree non_lvalue PARAMS ((tree));
1812 extern tree pedantic_non_lvalue PARAMS ((tree));
1814 extern tree convert PARAMS ((tree, tree));
1815 extern unsigned int expr_align PARAMS ((tree));
1816 extern tree size_in_bytes PARAMS ((tree));
1817 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
1818 extern tree bit_position PARAMS ((tree));
1819 extern HOST_WIDE_INT int_bit_position PARAMS ((tree));
1821 /* Define data structures, macros, and functions for handling sizes
1822 and the various types used to represent sizes. */
1826 SIZETYPE, /* Normal representation of sizes in bytes. */
1827 SSIZETYPE, /* Signed representation of sizes in bytes. */
1828 USIZETYPE, /* Unsigned representation of sizes in bytes. */
1829 BITSIZETYPE, /* Normal representation of sizes in bits. */
1830 SBITSIZETYPE, /* Signed representation of sizes in bits. */
1831 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
1834 extern tree sizetype_tab[(int) TYPE_KIND_LAST];
1836 #define sizetype sizetype_tab[(int) SIZETYPE]
1837 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
1838 #define ssizetype sizetype_tab[(int) SSIZETYPE]
1839 #define usizetype sizetype_tab[(int) USIZETYPE]
1840 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
1841 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
1843 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
1844 extern tree size_diffop PARAMS ((tree, tree));
1845 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
1846 enum size_type_kind));
1847 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
1849 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
1850 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
1851 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
1852 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
1853 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
1855 extern tree round_up PARAMS ((tree, int));
1856 extern tree get_pending_sizes PARAMS ((void));
1857 extern void put_pending_sizes PARAMS ((tree));
1859 /* Type for sizes of data-type. */
1861 #define BITS_PER_UNIT_LOG \
1862 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1863 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1864 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1866 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1867 extern unsigned int maximum_field_alignment;
1869 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1870 extern unsigned int set_alignment;
1872 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1873 by making the last node in X point to Y.
1874 Returns X, except if X is 0 returns Y. */
1876 extern tree chainon PARAMS ((tree, tree));
1878 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1880 extern tree tree_cons PARAMS ((tree, tree, tree));
1881 extern tree perm_tree_cons PARAMS ((tree, tree, tree));
1882 extern tree temp_tree_cons PARAMS ((tree, tree, tree));
1883 extern tree saveable_tree_cons PARAMS ((tree, tree, tree));
1884 extern tree decl_tree_cons PARAMS ((tree, tree, tree));
1885 extern tree expr_tree_cons PARAMS ((tree, tree, tree));
1887 /* Return the last tree node in a chain. */
1889 extern tree tree_last PARAMS ((tree));
1891 /* Reverse the order of elements in a chain, and return the new head. */
1893 extern tree nreverse PARAMS ((tree));
1895 /* Returns the length of a chain of nodes
1896 (number of chain pointers to follow before reaching a null pointer). */
1898 extern int list_length PARAMS ((tree));
1900 /* Returns the number of FIELD_DECLs in a type. */
1902 extern int fields_length PARAMS ((tree));
1904 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1906 extern int integer_zerop PARAMS ((tree));
1908 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1910 extern int integer_onep PARAMS ((tree));
1912 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1913 all of whose significant bits are 1. */
1915 extern int integer_all_onesp PARAMS ((tree));
1917 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1918 exactly one bit 1. */
1920 extern int integer_pow2p PARAMS ((tree));
1922 /* staticp (tree x) is nonzero if X is a reference to data allocated
1923 at a fixed address in memory. */
1925 extern int staticp PARAMS ((tree));
1927 /* Gets an error if argument X is not an lvalue.
1928 Also returns 1 if X is an lvalue, 0 if not. */
1930 extern int lvalue_or_else PARAMS ((tree, const char *));
1932 /* save_expr (EXP) returns an expression equivalent to EXP
1933 but it can be used multiple times within context CTX
1934 and only evaluate EXP once. */
1936 extern tree save_expr PARAMS ((tree));
1938 /* Returns the index of the first non-tree operand for CODE, or the number
1939 of operands if all are trees. */
1941 extern int first_rtl_op PARAMS ((enum tree_code));
1943 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1944 can be used multiple times and will evaluate EXP in its entirety
1947 extern tree unsave_expr PARAMS ((tree));
1949 /* Reset EXP in place so that it can be expaned again. Does not
1950 recurse into subtrees. */
1952 extern void unsave_expr_1 PARAMS ((tree));
1954 /* Like unsave_expr_1, but recurses into all subtrees. */
1956 extern tree unsave_expr_now PARAMS ((tree));
1958 /* If non-null, these are language-specific helper functions for
1959 unsave_expr_now. If present, LANG_UNSAVE is called before its
1960 argument (an UNSAVE_EXPR) is to be unsaved, and all other
1961 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
1962 called from unsave_expr_1 for language-specific tree codes. */
1963 extern void (*lang_unsave) PARAMS ((tree *));
1964 extern void (*lang_unsave_expr_now) PARAMS ((tree));
1966 /* If non-null, a language specific version of safe_for_unsave. */
1967 extern int (*lang_safe_for_unsave) PARAMS ((tree));
1969 /* Return nonzero if it is safe to unsave EXPR, else return zero.
1970 It is not safe to unsave EXPR if it contains any embedded RTL_EXPRs. */
1971 extern int safe_for_unsave PARAMS ((tree));
1973 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1974 or offset that depends on a field within a record.
1976 Note that we only allow such expressions within simple arithmetic
1979 extern int contains_placeholder_p PARAMS ((tree));
1981 /* Return 1 if EXP contains any expressions that produce cleanups for an
1982 outer scope to deal with. Used by fold. */
1984 extern int has_cleanups PARAMS ((tree));
1986 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1987 return a tree with all occurrences of references to F in a
1988 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1989 contains only arithmetic expressions. */
1991 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
1993 /* variable_size (EXP) is like save_expr (EXP) except that it
1994 is for the special case of something that is part of a
1995 variable size for a data type. It makes special arrangements
1996 to compute the value at the right time when the data type
1997 belongs to a function parameter. */
1999 extern tree variable_size PARAMS ((tree));
2001 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2002 but it can be used multiple times
2003 and only evaluate the subexpressions once. */
2005 extern tree stabilize_reference PARAMS ((tree));
2007 /* Subroutine of stabilize_reference; this is called for subtrees of
2008 references. Any expression with side-effects must be put in a SAVE_EXPR
2009 to ensure that it is only evaluated once. */
2011 extern tree stabilize_reference_1 PARAMS ((tree));
2013 /* Return EXP, stripped of any conversions to wider types
2014 in such a way that the result of converting to type FOR_TYPE
2015 is the same as if EXP were converted to FOR_TYPE.
2016 If FOR_TYPE is 0, it signifies EXP's type. */
2018 extern tree get_unwidened PARAMS ((tree, tree));
2020 /* Return OP or a simpler expression for a narrower value
2021 which can be sign-extended or zero-extended to give back OP.
2022 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2023 or 0 if the value should be sign-extended. */
2025 extern tree get_narrower PARAMS ((tree, int *));
2027 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2029 The definition of this resides in language-specific code
2030 as the repertoire of available types may vary. */
2032 extern tree type_for_mode PARAMS ((enum machine_mode, int));
2034 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2035 for an integer type with at least that precision.
2036 The definition of this resides in language-specific code
2037 as the repertoire of available types may vary. */
2039 extern tree type_for_size PARAMS ((unsigned, int));
2041 /* Given an integer type T, return a type like T but unsigned.
2042 If T is unsigned, the value is T.
2043 The definition of this resides in language-specific code
2044 as the repertoire of available types may vary. */
2046 extern tree unsigned_type PARAMS ((tree));
2048 /* Given an integer type T, return a type like T but signed.
2049 If T is signed, the value is T.
2050 The definition of this resides in language-specific code
2051 as the repertoire of available types may vary. */
2053 extern tree signed_type PARAMS ((tree));
2055 /* This function must be defined in the language-specific files.
2056 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2057 This is defined in a language-specific file. */
2059 extern tree maybe_build_cleanup PARAMS ((tree));
2061 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2062 look for nested component-refs or array-refs at constant positions
2063 and find the ultimate containing object, which is returned. */
2065 extern tree get_inner_reference PARAMS ((tree, int *, int *, tree *,
2066 enum machine_mode *, int *,
2067 int *, unsigned int *));
2069 /* Given a DECL or TYPE, return the scope in which it was declared, or
2070 NUL_TREE if there is no containing scope. */
2072 extern tree get_containing_scope PARAMS ((tree));
2074 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2076 extern tree decl_function_context PARAMS ((tree));
2078 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2079 this _DECL with its context, or zero if none. */
2080 extern tree decl_type_context PARAMS ((tree));
2082 /* Given the FUNCTION_DECL for the current function,
2083 return zero if it is ok for this function to be inline.
2084 Otherwise return a warning message with a single %s
2085 for the function's name. */
2087 extern const char *function_cannot_inline_p PARAMS ((tree));
2089 /* Return 1 if EXPR is the real constant zero. */
2090 extern int real_zerop PARAMS ((tree));
2092 /* Declare commonly used variables for tree structure. */
2094 /* Points to the name of the input file from which the current input
2095 being parsed originally came (before it went into cpp). */
2096 extern char *input_filename;
2098 /* Current line number in input file. */
2101 /* Nonzero for -pedantic switch: warn about anything
2102 that standard C forbids. */
2103 extern int pedantic;
2105 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2106 Zero means allow extended lvalues. */
2108 extern int pedantic_lvalues;
2110 /* Nonzero means can safely call expand_expr now;
2111 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2113 extern int immediate_size_expand;
2115 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2117 extern tree current_function_decl;
2119 /* Nonzero means a FUNC_BEGIN label was emitted. */
2120 extern tree current_function_func_begin_label;
2122 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2124 extern int all_types_permanent;
2126 /* Pointer to function to compute the name to use to print a declaration.
2127 DECL is the declaration in question.
2128 VERBOSITY determines what information will be printed:
2129 0: DECL_NAME, demangled as necessary.
2130 1: and scope information.
2131 2: and any other information that might be interesting, such as function
2132 parameter types in C++. */
2134 extern const char *(*decl_printable_name) PARAMS ((tree, int));
2136 /* Pointer to function to finish handling an incomplete decl at the
2137 end of compilation. */
2139 extern void (*incomplete_decl_finalize_hook) PARAMS ((tree));
2141 extern char *init_parse PARAMS ((char *));
2142 extern void finish_parse PARAMS ((void));
2144 extern const char * const language_string;
2146 /* Declare a predefined function. Return the declaration. This function is
2147 provided by each language frontend. */
2148 extern tree builtin_function PARAMS ((const char *, tree, int,
2149 enum built_in_class,
2153 extern char *perm_calloc PARAMS ((int, long));
2154 extern tree get_file_function_name PARAMS ((int));
2155 extern tree get_file_function_name_long PARAMS ((const char *));
2156 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2157 extern tree get_set_constructor_bytes PARAMS ((tree,
2158 unsigned char *, int));
2159 extern int get_alias_set PARAMS ((tree));
2160 extern int new_alias_set PARAMS ((void));
2161 extern int (*lang_get_alias_set) PARAMS ((tree));
2162 extern tree get_callee_fndecl PARAMS ((tree));
2166 extern int in_control_zone_p PARAMS ((void));
2167 extern void expand_fixups PARAMS ((struct rtx_def *));
2168 extern tree expand_start_stmt_expr PARAMS ((void));
2169 extern tree expand_end_stmt_expr PARAMS ((tree));
2170 extern void expand_expr_stmt PARAMS ((tree));
2171 extern int warn_if_unused_value PARAMS ((tree));
2172 extern void expand_decl_init PARAMS ((tree));
2173 extern void clear_last_expr PARAMS ((void));
2174 extern void expand_label PARAMS ((tree));
2175 extern void expand_goto PARAMS ((tree));
2176 extern void expand_asm PARAMS ((tree));
2177 extern void expand_start_cond PARAMS ((tree, int));
2178 extern void expand_end_cond PARAMS ((void));
2179 extern void expand_start_else PARAMS ((void));
2180 extern void expand_start_elseif PARAMS ((tree));
2181 extern struct nesting *expand_start_loop PARAMS ((int));
2182 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2183 extern void expand_loop_continue_here PARAMS ((void));
2184 extern void expand_end_loop PARAMS ((void));
2185 extern int expand_continue_loop PARAMS ((struct nesting *));
2186 extern int expand_exit_loop PARAMS ((struct nesting *));
2187 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2189 extern int expand_exit_something PARAMS ((void));
2191 extern void expand_null_return PARAMS ((void));
2192 extern void expand_return PARAMS ((tree));
2193 extern int optimize_tail_recursion PARAMS ((tree, struct rtx_def *));
2194 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2195 #define expand_start_bindings(flags) \
2196 expand_start_bindings_and_block(flags, NULL_TREE)
2197 extern void expand_end_bindings PARAMS ((tree, int, int));
2198 extern void warn_about_unused_variables PARAMS ((tree));
2199 extern void start_cleanup_deferral PARAMS ((void));
2200 extern void end_cleanup_deferral PARAMS ((void));
2201 extern int is_body_block PARAMS ((tree));
2203 extern void mark_block_as_eh_region PARAMS ((void));
2204 extern void mark_block_as_not_eh_region PARAMS ((void));
2205 extern int is_eh_region PARAMS ((void));
2206 extern int conditional_context PARAMS ((void));
2207 extern tree last_cleanup_this_contour PARAMS ((void));
2208 extern int expand_dhc_cleanup PARAMS ((tree));
2209 extern int expand_dcc_cleanup PARAMS ((tree));
2210 extern void expand_start_case PARAMS ((int, tree, tree,
2212 extern void expand_end_case PARAMS ((tree));
2213 extern int pushcase PARAMS ((tree,
2214 tree (*) (tree, tree),
2216 extern int pushcase_range PARAMS ((tree, tree,
2217 tree (*) (tree, tree),
2219 extern void using_eh_for_cleanups PARAMS ((void));
2220 extern int stmt_loop_nest_empty PARAMS ((void));
2222 /* In fold-const.c */
2224 /* Fold constants as much as possible in an expression.
2225 Returns the simplified expression.
2226 Acts only on the top level of the expression;
2227 if the argument itself cannot be simplified, its
2228 subexpressions are not changed. */
2230 extern tree fold PARAMS ((tree));
2232 extern int force_fit_type PARAMS ((tree, int));
2233 extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2234 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2235 unsigned HOST_WIDE_INT *,
2237 extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2238 unsigned HOST_WIDE_INT *,
2240 extern int mul_double PARAMS ((unsigned HOST_WIDE_INT,
2242 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2243 unsigned HOST_WIDE_INT *,
2245 extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2246 HOST_WIDE_INT, unsigned int,
2247 unsigned HOST_WIDE_INT *,
2248 HOST_WIDE_INT *, int));
2249 extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2250 HOST_WIDE_INT, unsigned int,
2251 unsigned HOST_WIDE_INT *,
2252 HOST_WIDE_INT *, int));
2253 extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2254 HOST_WIDE_INT, unsigned int,
2255 unsigned HOST_WIDE_INT *,
2257 extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2258 HOST_WIDE_INT, unsigned int,
2259 unsigned HOST_WIDE_INT *,
2261 extern int operand_equal_p PARAMS ((tree, tree, int));
2262 extern tree invert_truthvalue PARAMS ((tree));
2264 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2265 function arguments and return the new type. Return NULL_TREE if no
2266 change. Required by any language that supports variadic arguments. */
2268 extern tree (*lang_type_promotes_to) PARAMS ((tree));
2270 /* Interface of the DWARF2 unwind info support. */
2272 /* Decide whether we want to emit frame unwind information for the current
2273 translation unit. */
2275 extern int dwarf2out_do_frame PARAMS ((void));
2277 /* Generate a new label for the CFI info to refer to. */
2279 extern char *dwarf2out_cfi_label PARAMS ((void));
2281 /* Entry point to update the canonical frame address (CFA). */
2283 extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
2285 /* Add the CFI for saving a register window. */
2287 extern void dwarf2out_window_save PARAMS ((char *));
2289 /* Add a CFI to update the running total of the size of arguments pushed
2292 extern void dwarf2out_args_size PARAMS ((char *, long));
2294 /* Entry point for saving a register to the stack. */
2296 extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
2298 /* Entry point for saving the return address in the stack. */
2300 extern void dwarf2out_return_save PARAMS ((char *, long));
2302 /* Entry point for saving the return address in a register. */
2304 extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
2306 /* Output a marker (i.e. a label) for the beginning of a function, before
2309 extern void dwarf2out_begin_prologue PARAMS ((void));
2311 /* Output a marker (i.e. a label) for the absolute end of the generated
2312 code for a function definition. */
2314 extern void dwarf2out_end_epilogue PARAMS ((void));
2316 /* The language front-end must define these functions. */
2318 /* Function of no arguments for initializing options. */
2319 extern void lang_init_options PARAMS ((void));
2321 /* Function of no arguments for initializing lexical scanning. */
2322 extern void init_lex PARAMS ((void));
2323 /* Function of no arguments for initializing the symbol table. */
2324 extern void init_decl_processing PARAMS ((void));
2326 /* Functions called with no arguments at the beginning and end or processing
2327 the input source file. */
2328 extern void lang_init PARAMS ((void));
2329 extern void lang_finish PARAMS ((void));
2331 /* Function to identify which front-end produced the output file. */
2332 extern const char *lang_identify PARAMS ((void));
2334 /* Called by report_error_function to print out function name.
2335 * Default may be overridden by language front-ends. */
2336 extern void (*print_error_function) PARAMS ((const char *));
2338 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2339 extern void copy_lang_decl PARAMS ((tree));
2341 /* Function called with no arguments to parse and compile the input. */
2342 extern int yyparse PARAMS ((void));
2343 /* Function called with option as argument
2344 to decode options starting with -f or -W or +.
2345 It should return nonzero if it handles the option. */
2346 extern int lang_decode_option PARAMS ((int, char **));
2348 /* Functions for processing symbol declarations. */
2349 /* Function to enter a new lexical scope.
2350 Takes one argument: always zero when called from outside the front end. */
2351 extern void pushlevel PARAMS ((int));
2352 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2353 Takes three arguments:
2354 KEEP -- nonzero if there were declarations in this scope.
2355 REVERSE -- reverse the order of decls before returning them.
2356 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2357 extern tree poplevel PARAMS ((int, int, int));
2358 /* Set the BLOCK node for the current scope level. */
2359 extern void set_block PARAMS ((tree));
2360 /* Function to add a decl to the current scope level.
2361 Takes one argument, a decl to add.
2362 Returns that decl, or, if the same symbol is already declared, may
2363 return a different decl for that name. */
2364 extern tree pushdecl PARAMS ((tree));
2365 /* Function to return the chain of decls so far in the current scope level. */
2366 extern tree getdecls PARAMS ((void));
2367 /* Function to return the chain of structure tags in the current scope level. */
2368 extern tree gettags PARAMS ((void));
2370 extern tree build_range_type PARAMS ((tree, tree, tree));
2372 /* Call when starting to parse a declaration:
2373 make expressions in the declaration last the length of the function.
2374 Returns an argument that should be passed to resume_momentary later. */
2375 extern int suspend_momentary PARAMS ((void));
2377 extern int allocation_temporary_p PARAMS ((void));
2379 /* Call when finished parsing a declaration:
2380 restore the treatment of node-allocation that was
2381 in effect before the suspension.
2382 YES should be the value previously returned by suspend_momentary. */
2383 extern void resume_momentary PARAMS ((int));
2385 /* Called after finishing a record, union or enumeral type. */
2386 extern void rest_of_type_compilation PARAMS ((tree, int));
2388 /* Save the current set of obstacks, but don't change them. */
2389 extern void push_obstacks_nochange PARAMS ((void));
2391 extern void permanent_allocation PARAMS ((int));
2393 extern void push_momentary PARAMS ((void));
2395 extern void clear_momentary PARAMS ((void));
2397 extern void pop_momentary PARAMS ((void));
2399 extern void end_temporary_allocation PARAMS ((void));
2401 /* Pop the obstack selection stack. */
2402 extern void pop_obstacks PARAMS ((void));
2405 extern int really_constant_p PARAMS ((tree));
2406 extern void push_obstacks PARAMS ((struct obstack *,
2408 extern void pop_momentary_nofree PARAMS ((void));
2409 extern void preserve_momentary PARAMS ((void));
2410 extern void saveable_allocation PARAMS ((void));
2411 extern void temporary_allocation PARAMS ((void));
2412 extern void resume_temporary_allocation PARAMS ((void));
2413 extern tree get_file_function_name PARAMS ((int));
2414 extern void set_identifier_size PARAMS ((int));
2415 extern int int_fits_type_p PARAMS ((tree, tree));
2416 extern int tree_log2 PARAMS ((tree));
2417 extern int tree_floor_log2 PARAMS ((tree));
2418 extern void preserve_initializer PARAMS ((void));
2419 extern void preserve_data PARAMS ((void));
2420 extern int object_permanent_p PARAMS ((tree));
2421 extern int type_precision PARAMS ((tree));
2422 extern int simple_cst_equal PARAMS ((tree, tree));
2423 extern int compare_tree_int PARAMS ((tree, unsigned int));
2424 extern int type_list_equal PARAMS ((tree, tree));
2425 extern int chain_member PARAMS ((tree, tree));
2426 extern int chain_member_purpose PARAMS ((tree, tree));
2427 extern int chain_member_value PARAMS ((tree, tree));
2428 extern tree listify PARAMS ((tree));
2429 extern tree type_hash_lookup PARAMS ((unsigned int, tree));
2430 extern void type_hash_add PARAMS ((unsigned int, tree));
2431 extern unsigned int type_hash_list PARAMS ((tree));
2432 extern int simple_cst_list_equal PARAMS ((tree, tree));
2433 extern void debug_obstack PARAMS ((char *));
2434 extern void rtl_in_current_obstack PARAMS ((void));
2435 extern void rtl_in_saveable_obstack PARAMS ((void));
2436 extern void init_tree_codes PARAMS ((void));
2437 extern void dump_tree_statistics PARAMS ((void));
2438 extern void print_obstack_statistics PARAMS ((const char *,
2441 extern void print_obstack_name PARAMS ((char *, FILE *, const char *));
2443 extern void expand_function_end PARAMS ((char *, int, int));
2444 extern void expand_function_start PARAMS ((tree, int));
2445 extern int real_onep PARAMS ((tree));
2446 extern int real_twop PARAMS ((tree));
2447 extern void start_identifier_warnings PARAMS ((void));
2448 extern void gcc_obstack_init PARAMS ((struct obstack *));
2449 extern void init_obstacks PARAMS ((void));
2450 extern void obfree PARAMS ((char *));
2451 extern void build_common_tree_nodes PARAMS ((int));
2452 extern void build_common_tree_nodes_2 PARAMS ((int));
2455 extern void setjmp_protect_args PARAMS ((void));
2456 extern void setjmp_protect PARAMS ((tree));
2457 extern void expand_main_function PARAMS ((void));
2458 extern void mark_varargs PARAMS ((void));
2459 extern void init_dummy_function_start PARAMS ((void));
2460 extern void expand_dummy_function_end PARAMS ((void));
2461 extern void init_function_for_compilation PARAMS ((void));
2462 extern void init_function_start PARAMS ((tree, char *, int));
2463 extern void assign_parms PARAMS ((tree));
2464 extern void put_var_into_stack PARAMS ((tree));
2465 extern void uninitialized_vars_warning PARAMS ((tree));
2466 extern void setjmp_args_warning PARAMS ((void));
2467 extern void mark_all_temps_used PARAMS ((void));
2468 extern void init_temp_slots PARAMS ((void));
2469 extern void combine_temp_slots PARAMS ((void));
2470 extern void free_temp_slots PARAMS ((void));
2471 extern void pop_temp_slots PARAMS ((void));
2472 extern void push_temp_slots PARAMS ((void));
2473 extern void preserve_temp_slots PARAMS ((struct rtx_def *));
2474 extern void preserve_rtl_expr_temps PARAMS ((tree));
2475 extern int aggregate_value_p PARAMS ((tree));
2476 extern void free_temps_for_rtl_expr PARAMS ((tree));
2477 extern void instantiate_virtual_regs PARAMS ((tree, struct rtx_def *));
2478 extern void unshare_all_rtl PARAMS ((tree, struct rtx_def *));
2479 extern int max_parm_reg_num PARAMS ((void));
2480 extern void push_function_context PARAMS ((void));
2481 extern void pop_function_context PARAMS ((void));
2482 extern void push_function_context_to PARAMS ((tree));
2483 extern void pop_function_context_from PARAMS ((tree));
2485 /* In print-rtl.c */
2487 extern void print_rtl PARAMS ((FILE *, struct rtx_def *));
2490 /* In print-tree.c */
2491 extern void debug_tree PARAMS ((tree));
2493 extern void print_node PARAMS ((FILE *, const char *, tree, int));
2494 extern void print_node_brief PARAMS ((FILE *, const char *, tree, int));
2495 extern void indent_to PARAMS ((FILE *, int));
2499 extern void emit_queue PARAMS ((void));
2500 extern int apply_args_register_offset PARAMS ((int));
2501 extern struct rtx_def *expand_builtin_return_addr
2502 PARAMS ((enum built_in_function, int, struct rtx_def *));
2503 extern void do_pending_stack_adjust PARAMS ((void));
2504 extern struct rtx_def *expand_assignment PARAMS ((tree, tree, int, int));
2505 extern struct rtx_def *store_expr PARAMS ((tree, struct rtx_def *,
2507 extern void check_max_integer_computation_mode PARAMS ((tree));
2510 extern void start_sequence_for_rtl_expr PARAMS ((tree));
2511 extern struct rtx_def *emit_line_note_after PARAMS ((const char *, int,
2513 extern struct rtx_def *emit_line_note PARAMS ((const char *, int));
2514 extern struct rtx_def *emit_line_note_force PARAMS ((const char *, int));
2517 extern void special_function_p PARAMS ((tree, int *, int *,
2518 int *, int *, int *));
2521 extern int mark_addressable PARAMS ((tree));
2522 extern void incomplete_type_error PARAMS ((tree, tree));
2525 extern void print_lang_statistics PARAMS ((void));
2528 extern tree truthvalue_conversion PARAMS ((tree));
2529 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2533 extern void print_lang_decl PARAMS ((FILE *, tree, int));
2534 extern void print_lang_type PARAMS ((FILE *, tree, int));
2535 extern void print_lang_identifier PARAMS ((FILE *, tree, int));
2537 extern int global_bindings_p PARAMS ((void));
2538 extern void insert_block PARAMS ((tree));
2540 /* In integrate.c */
2541 extern void save_for_inline_nocopy PARAMS ((tree));
2542 extern void save_for_inline_copying PARAMS ((tree));
2543 extern void set_decl_abstract_flags PARAMS ((tree, int));
2544 extern void output_inline_function PARAMS ((tree));
2547 extern void set_yydebug PARAMS ((int));
2549 /* In stor-layout.c */
2550 extern void fixup_signed_type PARAMS ((tree));
2553 extern void make_decl_rtl PARAMS ((tree, const char *, int));
2554 extern void make_decl_one_only PARAMS ((tree));
2555 extern int supports_one_only PARAMS ((void));
2556 extern void variable_section PARAMS ((tree, int));
2558 /* In fold-const.c */
2559 extern int div_and_round_double PARAMS ((enum tree_code, int,
2560 unsigned HOST_WIDE_INT,
2562 unsigned HOST_WIDE_INT,
2564 unsigned HOST_WIDE_INT *,
2566 unsigned HOST_WIDE_INT *,
2570 extern void emit_nop PARAMS ((void));
2571 extern void expand_computed_goto PARAMS ((tree));
2572 extern struct rtx_def *label_rtx PARAMS ((tree));
2573 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
2575 extern int any_pending_cleanups PARAMS ((int));
2576 extern void init_stmt PARAMS ((void));
2577 extern void init_stmt_for_function PARAMS ((void));
2578 extern int drop_through_at_end_p PARAMS ((void));
2579 extern void expand_start_target_temps PARAMS ((void));
2580 extern void expand_end_target_temps PARAMS ((void));
2581 extern void expand_elseif PARAMS ((tree));
2582 extern void expand_decl PARAMS ((tree));
2583 extern int expand_decl_cleanup PARAMS ((tree, tree));
2584 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
2585 extern void move_cleanups_up PARAMS ((void));
2586 extern void expand_start_case_dummy PARAMS ((void));
2587 extern void expand_end_case_dummy PARAMS ((void));
2588 extern tree case_index_expr_type PARAMS ((void));
2589 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
2590 extern void check_for_full_enumeration_handling PARAMS ((tree));
2591 extern void declare_nonlocal_label PARAMS ((tree));
2593 extern void lang_print_xnode PARAMS ((FILE *, tree, int));
2597 /* If KIND=='I', return a suitable global initializer (constructor) name.
2598 If KIND=='D', return a suitable global clean-up (destructor) name. */
2599 extern tree get_file_function_name PARAMS ((int));
2601 /* Interface of the DWARF2 unwind info support. */
2603 /* Decide whether we want to emit frame unwind information for the current
2604 translation unit. */
2606 extern int dwarf2out_do_frame PARAMS ((void));
2608 /* Generate a new label for the CFI info to refer to. */
2610 extern char *dwarf2out_cfi_label PARAMS ((void));
2612 /* Entry point to update the canonical frame address (CFA). */
2614 extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
2616 /* Add the CFI for saving a register window. */
2618 extern void dwarf2out_window_save PARAMS ((char *));
2620 /* Add a CFI to update the running total of the size of arguments pushed
2623 extern void dwarf2out_args_size PARAMS ((char *, long));
2625 /* Entry point for saving a register to the stack. */
2627 extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
2629 /* Entry point for saving the return address in the stack. */
2631 extern void dwarf2out_return_save PARAMS ((char *, long));
2633 /* Entry point for saving the return address in a register. */
2635 extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
2637 /* Output a marker (i.e. a label) for the beginning of a function, before
2640 extern void dwarf2out_begin_prologue PARAMS ((void));
2642 /* Output a marker (i.e. a label) for the absolute end of the generated
2643 code for a function definition. */
2645 extern void dwarf2out_end_epilogue PARAMS ((void));
2647 /* Redefine abort to report an internal error w/o coredump, and
2648 reporting the location of the error in the source file. This logic
2649 is duplicated in rtl.h and tree.h because every file that needs the
2650 special abort includes one or both. toplev.h gets too few files,
2651 system.h gets too many. */
2653 extern void fancy_abort PARAMS ((const char *, int, const char *))
2655 #if (GCC_VERSION >= 2007)
2656 #define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__)
2658 #define abort() fancy_abort (__FILE__, __LINE__, 0)