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
127 union tree_node *chain;
128 union tree_node *type;
129 ENUM_BITFIELD(tree_code) code : 8;
130 unsigned side_effects_flag : 1;
131 unsigned constant_flag : 1;
132 unsigned permanent_flag : 1;
133 unsigned addressable_flag : 1;
134 unsigned volatile_flag : 1;
135 unsigned readonly_flag : 1;
136 unsigned unsigned_flag : 1;
137 unsigned asm_written_flag: 1;
139 unsigned used_flag : 1;
140 unsigned nothrow_flag : 1;
141 unsigned static_flag : 1;
142 unsigned public_flag : 1;
143 unsigned private_flag : 1;
144 unsigned protected_flag : 1;
146 unsigned lang_flag_0 : 1;
147 unsigned lang_flag_1 : 1;
148 unsigned lang_flag_2 : 1;
149 unsigned lang_flag_3 : 1;
150 unsigned lang_flag_4 : 1;
151 unsigned lang_flag_5 : 1;
152 unsigned lang_flag_6 : 1;
154 /* There is room for three more flags. */
157 /* The following table lists the uses of each of the above flags and
158 for which types of nodes they are defined. Note that expressions
164 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
170 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
171 TREE_NO_UNUSED_WARNING in
172 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
174 TREE_LIST or TREE_VEC
175 TREE_CONSTANT_OVERFLOW in
176 INTEGER_CST, REAL_CST, COMPLEX_CST
177 TREE_SYMBOL_REFERENCED in
183 INTEGER_CST, REAL_CST, COMPLEX_CST
185 VAR_DECL or FUNCTION_DECL
187 TREE_LIST or TREE_VEC
188 EXPR_WFL_EMIT_LINE_NOTE in
189 EXPR_WITH_FILE_LOCATION
194 TREE_LIST or TREE_VEC
196 ??? unspecified nodes
200 TREE_VIA_PROTECTED in
204 ??? unspecified nodes
213 TREE_THIS_VOLATILE in
223 VAR_DECL if iterator (C)
232 permanent_flag: TREE_PERMANENT in all nodes
237 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
238 DECL_BUILT_IN_NONANSI in
242 SAVE_EXPR_NOPLACEHOLDER in
248 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
254 expressions, IDENTIFIER_NODE
259 CALL_EXPR, FUNCTION_DECL
262 /* Define accessors for the fields that all tree nodes have
263 (though some fields are not used for all kinds of nodes). */
265 /* The tree-code says what kind of node it is.
266 Codes are defined in tree.def. */
267 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
268 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
270 /* When checking is enabled, errors will be generated if a tree node
271 is accessed incorrectly. The macros abort with a fatal error. */
272 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
274 #define TREE_CHECK(t, code) \
275 ({ const tree __t = t; \
276 if (TREE_CODE(__t) != (code)) \
277 tree_check_failed (__t, code, __FILE__, \
278 __LINE__, __PRETTY_FUNCTION__); \
280 #define TREE_CLASS_CHECK(t, class) \
281 ({ const tree __t = t; \
282 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
283 tree_class_check_failed (__t, class, __FILE__, \
284 __LINE__, __PRETTY_FUNCTION__); \
287 /* These checks have to be special cased. */
288 #define CST_OR_CONSTRUCTOR_CHECK(t) \
289 ({ const tree __t = t; \
290 enum tree_code __c = TREE_CODE(__t); \
291 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
292 tree_check_failed (__t, CONSTRUCTOR, __FILE__, \
293 __LINE__, __PRETTY_FUNCTION__); \
295 #define EXPR_CHECK(t) \
296 ({ const tree __t = t; \
297 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
298 if (__c != 'r' && __c != 's' && __c != '<' \
299 && __c != '1' && __c != '2' && __c != 'e') \
300 tree_class_check_failed(__t, 'e', __FILE__, \
301 __LINE__, __PRETTY_FUNCTION__); \
304 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
305 const char *, int, const char *))
307 extern void tree_class_check_failed PARAMS ((const tree, char,
308 const char *, int, const char *))
311 #else /* not ENABLE_TREE_CHECKING, or not gcc */
313 #define TREE_CHECK(t, code) (t)
314 #define TREE_CLASS_CHECK(t, code) (t)
315 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
316 #define EXPR_CHECK(t) (t)
320 #include "tree-check.h"
322 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
323 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
324 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
326 /* In all nodes that are expressions, this is the data type of the expression.
327 In POINTER_TYPE nodes, this is the type that the pointer points to.
328 In ARRAY_TYPE nodes, this is the type of the elements. */
329 #define TREE_TYPE(NODE) ((NODE)->common.type)
331 /* Nodes are chained together for many purposes.
332 Types are chained together to record them for being output to the debugger
333 (see the function `chain_type').
334 Decls in the same scope are chained together to record the contents
336 Statement nodes for successive statements used to be chained together.
337 Often lists of things are represented by TREE_LIST nodes that
338 are chained together. */
340 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
342 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
343 that don't change the machine mode. */
345 #define STRIP_NOPS(EXP) \
346 while ((TREE_CODE (EXP) == NOP_EXPR \
347 || TREE_CODE (EXP) == CONVERT_EXPR \
348 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
349 && (TYPE_MODE (TREE_TYPE (EXP)) \
350 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
351 (EXP) = TREE_OPERAND (EXP, 0);
353 /* Like STRIP_NOPS, but don't let the signedness change either. */
355 #define STRIP_SIGN_NOPS(EXP) \
356 while ((TREE_CODE (EXP) == NOP_EXPR \
357 || TREE_CODE (EXP) == CONVERT_EXPR \
358 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
359 && (TYPE_MODE (TREE_TYPE (EXP)) \
360 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
361 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
362 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
363 (EXP) = TREE_OPERAND (EXP, 0);
365 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
367 #define STRIP_TYPE_NOPS(EXP) \
368 while ((TREE_CODE (EXP) == NOP_EXPR \
369 || TREE_CODE (EXP) == CONVERT_EXPR \
370 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
371 && (TREE_TYPE (EXP) \
372 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
373 (EXP) = TREE_OPERAND (EXP, 0);
375 /* Nonzero if TYPE represents an integral type. Note that we do not
376 include COMPLEX types here. */
378 #define INTEGRAL_TYPE_P(TYPE) \
379 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
380 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
382 /* Nonzero if TYPE represents a floating-point type, including complex
383 floating-point types. */
385 #define FLOAT_TYPE_P(TYPE) \
386 (TREE_CODE (TYPE) == REAL_TYPE \
387 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
388 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
390 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
392 #define AGGREGATE_TYPE_P(TYPE) \
393 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
394 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
395 || TREE_CODE (TYPE) == SET_TYPE)
397 /* Nonzero if TYPE represents a pointer type. */
399 #define POINTER_TYPE_P(TYPE) \
400 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
402 /* Nonzero if this type is a complete type. */
403 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
405 /* Nonzero if this type is complete or is cv void. */
406 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
407 (COMPLETE_TYPE_P (NODE) || TREE_CODE (NODE) == VOID_TYPE)
409 /* Nonzero if this type is complete or is an array with unspecified bound. */
410 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
411 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE))
413 /* Nonzero if TYPE represents a type. */
415 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
417 /* Define many boolean fields that all tree nodes have. */
419 /* In VAR_DECL nodes, nonzero means address of this is needed.
420 So it cannot be in a register.
421 In a FUNCTION_DECL, nonzero means its address is needed.
422 So it must be compiled even if it is an inline function.
423 In CONSTRUCTOR nodes, it means object constructed must be in memory.
424 In LABEL_DECL nodes, it means a goto for this label has been seen
425 from a place outside all binding contours that restore stack levels.
426 In ..._TYPE nodes, it means that objects of this type must
427 be fully addressable. This means that pieces of this
428 object cannot go into register parameters, for example.
429 In IDENTIFIER_NODEs, this means that some extern decl for this name
430 had its address taken. That matters for inline functions. */
431 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
433 /* In a VAR_DECL, nonzero means allocate static storage.
434 In a FUNCTION_DECL, nonzero if function has been defined.
435 In a CONSTRUCTOR, nonzero means allocate static storage. */
436 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
438 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
439 made implicitly and should not lead to an "unused value" warning. */
440 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
442 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
443 chain is via a `virtual' declaration. */
444 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
446 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
447 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
448 requires a diagnostic when overflows occur in constant expressions. */
449 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
451 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
452 this string as an argument. */
453 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
455 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
456 overflow in folding, and no warning has been issued for this subexpression.
457 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
458 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
460 /* In a VAR_DECL or FUNCTION_DECL,
461 nonzero means name is to be accessible from outside this module.
462 In an identifier node, nonzero means an external declaration
463 accessible from outside this module was previously seen
464 for this name in an inner scope. */
465 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
467 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
468 base class is via a `public' declaration, which preserves public
469 fields from the base class as public. */
470 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
472 /* Ditto, for `private' declarations. */
473 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
475 /* Nonzero for TREE_LIST node means that the path to the
476 base class is via a `protected' declaration, which preserves
477 protected fields from the base class as protected.
479 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
481 /* In any expression, nonzero means it has side effects or reevaluation
482 of the whole expression could produce a different value.
483 This is set if any subexpression is a function call, a side effect
484 or a reference to a volatile variable.
485 In a ..._DECL, this is set only if the declaration said `volatile'. */
486 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
488 /* Nonzero means this expression is volatile in the C sense:
489 its address should be of type `volatile WHATEVER *'.
490 In other words, the declared item is volatile qualified.
491 This is used in _DECL nodes and _REF nodes.
493 In a ..._TYPE node, means this type is volatile-qualified.
494 But use TYPE_VOLATILE instead of this macro when the node is a type,
495 because eventually we may make that a different bit.
497 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
498 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
500 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
501 nonzero means it may not be the lhs of an assignment.
502 In a ..._TYPE node, means this type is const-qualified
503 (but the macro TYPE_READONLY should be used instead of this macro
504 when the node is a type). */
505 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
507 /* Value of expression is constant.
508 Always appears in all ..._CST nodes.
509 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
510 if the value is constant. */
511 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
513 /* Nonzero means permanent node;
514 node will continue to exist for the entire compiler run.
515 Otherwise it will be recycled at the end of the function.
516 This flag is always zero if garbage collection is in use.
517 Try not to use this. Only set it with TREE_SET_PERMANENT. */
518 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
519 #define TREE_SET_PERMANENT(NODE) do { \
520 if (!ggc_p && current_obstack == &permanent_obstack) \
521 TREE_PERMANENT(NODE) = 1; \
524 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
525 In FIELD_DECL nodes, means an unsigned bit field.
526 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
527 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
529 /* Nonzero in a VAR_DECL means assembler code has been written.
530 Nonzero in a FUNCTION_DECL means that the function has been compiled.
531 This is interesting in an inline function, since it might not need
532 to be compiled separately.
533 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
534 if the sdb debugging info for the type has been written.
535 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
536 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
538 /* Nonzero in a _DECL if the name is used in its scope.
539 Nonzero in an expr node means inhibit warning if value is unused.
540 In IDENTIFIER_NODEs, this means that some extern decl for this name
542 #define TREE_USED(NODE) ((NODE)->common.used_flag)
544 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
545 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
546 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
548 /* Used in classes in C++. */
549 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
550 /* Used in classes in C++.
551 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
552 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
554 /* These flags are available for each language front end to use internally. */
555 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
556 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
557 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
558 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
559 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
560 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
561 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
563 /* Define additional fields and accessors for nodes representing constants. */
565 /* In an INTEGER_CST node. These two together make a 2-word integer.
566 If the data type is signed, the value is sign-extended to 2 words
567 even though not all of them may really be in use.
568 In an unsigned constant shorter than 2 words, the extra bits are 0. */
569 #define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
570 #define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
572 #define INT_CST_LT(A, B) \
573 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
574 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
575 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
577 #define INT_CST_LT_UNSIGNED(A, B) \
578 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
579 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
580 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
581 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
582 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
586 char common[sizeof (struct tree_common)];
587 struct rtx_def *rtl; /* acts as link to register transfer language
589 unsigned HOST_WIDE_INT int_cst_low;
590 HOST_WIDE_INT int_cst_high;
593 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
594 and generally in all kinds of constants that could
595 be given labels (rather than being immediate). */
597 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
599 /* In a REAL_CST node. */
600 /* We can represent a real value as either a `double' or a string.
601 Strings don't allow for any optimization, but they do allow
602 for cross-compilation. */
604 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
610 char common[sizeof (struct tree_common)];
611 struct rtx_def *rtl; /* acts as link to register transfer language
613 REAL_VALUE_TYPE real_cst;
616 /* In a STRING_CST */
617 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
618 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
622 char common[sizeof (struct tree_common)];
623 struct rtx_def *rtl; /* acts as link to register transfer language
629 /* In a COMPLEX_CST node. */
630 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
631 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
635 char common[sizeof (struct tree_common)];
636 struct rtx_def *rtl; /* acts as link to register transfer language
638 union tree_node *real;
639 union tree_node *imag;
642 /* Define fields and accessors for some special-purpose tree nodes. */
644 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
645 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
647 struct tree_identifier
649 char common[sizeof (struct tree_common)];
654 /* In a TREE_LIST node. */
655 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
656 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
660 char common[sizeof (struct tree_common)];
661 union tree_node *purpose;
662 union tree_node *value;
665 /* In a TREE_VEC node. */
666 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
667 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
668 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
672 char common[sizeof (struct tree_common)];
674 union tree_node *a[1];
677 /* Define fields and accessors for some nodes that represent expressions. */
679 /* In a SAVE_EXPR node. */
680 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
681 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
682 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
683 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
684 both in normal code and in a handler. (Normally, in a handler, all
685 SAVE_EXPRs are unsaved, meaning that there values are
687 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
689 /* In a RTL_EXPR node. */
690 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
691 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
693 /* In a CALL_EXPR node. */
694 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
696 /* In a CONSTRUCTOR node. */
697 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
699 /* In ordinary expression nodes. */
700 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
701 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
703 /* In a LABELED_BLOCK_EXPR node. */
704 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
705 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
707 /* In a EXIT_BLOCK_EXPR node. */
708 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
709 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
711 /* In a LOOP_EXPR node. */
712 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
714 /* In a EXPR_WITH_FILE_LOCATION node. */
715 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
716 #define EXPR_WFL_FILENAME(NODE) \
717 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
718 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
719 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
720 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
721 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
722 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
723 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
724 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
728 char common[sizeof (struct tree_common)];
730 union tree_node *operands[1];
733 /* In a BLOCK node. */
734 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
735 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
736 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
737 /* Note: when changing this, make sure to find the places
738 that use chainon or nreverse. */
739 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
740 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
741 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
743 /* Nonzero means that this block is prepared to handle exceptions
744 listed in the BLOCK_VARS slot. */
745 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
747 /* An index number for this block. These values are not guaranteed to
748 be unique across functions -- whether or not they are depends on
749 the debugging output format in use. */
750 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
754 char common[sizeof (struct tree_common)];
756 unsigned handler_block_flag : 1;
757 unsigned abstract_flag : 1;
758 unsigned block_num : 30;
760 union tree_node *vars;
761 union tree_node *subblocks;
762 union tree_node *supercontext;
763 union tree_node *abstract_origin;
766 /* Define fields and accessors for nodes representing data types. */
768 /* See tree.def for documentation of the use of these fields.
769 Look at the documentation of the various ..._TYPE tree codes. */
771 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
772 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
773 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
774 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
775 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
776 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
777 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
778 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
779 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
780 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
781 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
782 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
783 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
784 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
785 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
786 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
787 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
788 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
789 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
790 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
791 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
792 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
793 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
794 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
795 #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
796 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
798 /* For aggregate types, information about this type, as a base type
799 for itself. Used in a language-dependent way for types that are
800 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
801 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
803 /* The (language-specific) typed-based alias set for this type.
804 Objects whose TYPE_ALIAS_SETs are different cannot alias each
805 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
806 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
807 type can alias objects of any type. */
808 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
810 /* Nonzero iff the typed-based alias set for this type has been
812 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
813 (TYPE_CHECK (NODE)->type.alias_set != -1)
815 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
817 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
819 /* The alignment necessary for objects of this type.
820 The value is an int, measured in bits. */
821 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
823 /* The alignment for NODE, in bytes. */
824 #define TYPE_ALIGN_UNIT(NODE) \
825 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
827 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
829 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
830 has BLKmode only because it lacks the alignment requirement for
832 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
834 /* In an INTEGER_TYPE, it means the type represents a size. We use this
835 both for validity checking and to permit optimziations that are unsafe
837 #define TYPE_IS_SIZETYPE(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
839 /* Nonzero in a type considered volatile as a whole. */
840 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
842 /* Means this type is const-qualified. */
843 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
845 /* If nonzero, this type is `restrict'-qualified, in the C sense of
847 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
849 /* There is a TYPE_QUAL value for each type qualifier. They can be
850 combined by bitwise-or to form the complete set of qualifiers for a
853 #define TYPE_UNQUALIFIED 0x0
854 #define TYPE_QUAL_CONST 0x1
855 #define TYPE_QUAL_VOLATILE 0x2
856 #define TYPE_QUAL_RESTRICT 0x4
858 /* The set of type qualifiers for this type. */
859 #define TYPE_QUALS(NODE) \
860 ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) \
861 | (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) \
862 | (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT))
864 /* These flags are available for each language front end to use internally. */
865 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
866 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
867 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
868 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
869 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
870 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
871 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
873 /* If set in an ARRAY_TYPE, indicates a string type (for languages
874 that distinguish string from array of char).
875 If set in a SET_TYPE, indicates a bitstring type. */
876 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
878 /* If non-NULL, this is a upper bound of the size (in bytes) of an
879 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
880 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
882 /* Indicates that objects of this type must be initialized by calling a
883 function when they are created. */
884 #define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
886 /* Indicates that objects of this type (a UNION_TYPE), should be passed
887 the same way that the first union alternative would be passed. */
888 #define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
890 /* Indicated that objects of this type should be laid out in as
891 compact a way as possible. */
892 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
896 char common[sizeof (struct tree_common)];
897 union tree_node *values;
898 union tree_node *size;
899 union tree_node *size_unit;
900 union tree_node *attributes;
903 unsigned int precision : 9;
904 ENUM_BITFIELD(machine_mode) mode : 7;
906 unsigned string_flag : 1;
907 unsigned no_force_blk_flag : 1;
908 unsigned needs_constructing_flag : 1;
909 unsigned transparent_union_flag : 1;
910 unsigned packed_flag : 1;
911 unsigned restrict_flag : 1;
913 unsigned lang_flag_0 : 1;
914 unsigned lang_flag_1 : 1;
915 unsigned lang_flag_2 : 1;
916 unsigned lang_flag_3 : 1;
917 unsigned lang_flag_4 : 1;
918 unsigned lang_flag_5 : 1;
919 unsigned lang_flag_6 : 1;
920 /* room for 3 more bits */
923 union tree_node *pointer_to;
924 union tree_node *reference_to;
925 union {int address; char *pointer; } symtab;
926 union tree_node *name;
927 union tree_node *minval;
928 union tree_node *maxval;
929 union tree_node *next_variant;
930 union tree_node *main_variant;
931 union tree_node *binfo;
932 union tree_node *noncopied_parts;
933 union tree_node *context;
934 struct obstack *obstack;
936 /* Points to a structure whose details depend on the language in use. */
937 struct lang_type *lang_specific;
940 /* Define accessor macros for information about type inheritance
943 A "basetype" means a particular usage of a data type for inheritance
944 in another type. Each such basetype usage has its own "binfo"
945 object to describe it. The binfo object is a TREE_VEC node.
947 Inheritance is represented by the binfo nodes allocated for a
948 given type. For example, given types C and D, such that D is
949 inherited by C, 3 binfo nodes will be allocated: one for describing
950 the binfo properties of C, similarly one for D, and one for
951 describing the binfo properties of D as a base type for C.
952 Thus, given a pointer to class C, one can get a pointer to the binfo
953 of D acting as a basetype for C by looking at C's binfo's basetypes. */
955 /* The actual data type node being inherited in this basetype. */
956 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
958 /* The offset where this basetype appears in its containing type.
959 BINFO_OFFSET slot holds the offset (in bytes)
960 from the base of the complete object to the base of the part of the
961 object that is allocated on behalf of this `type'.
962 This is always 0 except when there is multiple inheritance. */
964 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
965 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
966 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
968 /* The virtual function table belonging to this basetype. Virtual
969 function tables provide a mechanism for run-time method dispatching.
970 The entries of a virtual function table are language-dependent. */
972 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
973 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
975 /* The virtual functions in the virtual function table. This is
976 a TREE_LIST that is used as an initial approximation for building
977 a virtual function table for this basetype. */
978 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
979 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
981 /* A vector of binfos for the direct basetypes inherited by this
984 If this basetype describes type D as inherited in C, and if the
985 basetypes of D are E and F, then this vector contains binfos for
986 inheritance of E and F by C.
988 ??? This could probably be done by just allocating the
989 base types at the end of this TREE_VEC (instead of using
990 another TREE_VEC). This would simplify the calculation
991 of how many basetypes a given type had. */
992 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
993 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
995 /* The number of basetypes for NODE. */
996 #define BINFO_N_BASETYPES(NODE) \
997 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
999 /* Accessor macro to get to the Nth basetype of this basetype. */
1000 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1001 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1003 /* For a BINFO record describing a virtual base class, i.e., one where
1004 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1005 base. The actual contents are language-dependent. Under the old
1006 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1007 pointer to the virtual base; under the new ABI this field is
1008 instead a INTEGER_CST giving an offset into the vtable where the
1009 offset to the virtual base can be found. */
1010 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1012 /* The size of a base class subobject of this type. Not all frontends
1013 currently allocate the space for these fields. */
1014 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1015 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1016 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1017 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1019 /* Slot used to build a chain that represents a use of inheritance.
1020 For example, if X is derived from Y, and Y is derived from Z,
1021 then this field can be used to link the binfo node for X to
1022 the binfo node for X's Y to represent the use of inheritance
1023 from X to Y. Similarly, this slot of the binfo node for X's Y
1024 can point to the Z from which Y is inherited (in X's inheritance
1025 hierarchy). In this fashion, one can represent and traverse specific
1026 uses of inheritance using the binfo nodes themselves (instead of
1027 consing new space pointing to binfo nodes).
1028 It is up to the language-dependent front-ends to maintain
1029 this information as necessary. */
1030 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1032 /* Define fields and accessors for nodes representing declared names. */
1034 /* Nonzero if DECL represents a decl. */
1035 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1036 /* This is the name of the object as written by the user.
1037 It is an IDENTIFIER_NODE. */
1038 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1039 /* This is the name of the object as the assembler will see it
1040 (but before any translations made by ASM_OUTPUT_LABELREF).
1041 Often this is the same as DECL_NAME.
1042 It is an IDENTIFIER_NODE. */
1043 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1044 /* Records the section name in a section attribute. Used to pass
1045 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1046 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1047 /* For FIELD_DECLs, this is the
1048 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1049 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1050 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1051 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1052 type, or NULL_TREE if the given decl has "file scope". */
1053 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1054 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1055 /* In a DECL this is the field where configuration dependent machine
1056 attributes are store */
1057 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1058 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1059 byte containing the bit closest to the beginning of the structure. */
1060 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1061 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1062 field from DECL_FIELD_OFFSET. */
1063 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1064 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1065 if so, the type that was originally specified for it.
1066 TREE_TYPE may have been modified (in finish_struct). */
1067 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1068 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1069 /* VAR_DECL and PARM_DECL reserve the arguments slot
1070 for language-specific uses. */
1071 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1072 /* This field is used to reference anything in decl.result and is meant only
1073 for use by the garbage collector. */
1074 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1075 /* In FUNCTION_DECL, holds the decl for the return value. */
1076 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1077 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1078 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1079 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1080 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1081 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1082 For a VAR_DECL, holds the initial value.
1083 For a PARM_DECL, not used--default
1084 values for parameters are encoded in the type of the function,
1085 not in the PARM_DECL slot. */
1086 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1087 /* For a PARM_DECL, records the data type used to pass the argument,
1088 which may be different from the type seen in the program. */
1089 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1090 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1091 if nonzero, indicates that the field occupies the type. */
1092 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1093 /* These two fields describe where in the source code the declaration was. */
1094 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1095 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1096 /* Holds the size of the datum, in bits, as a tree expression.
1097 Need not be constant. */
1098 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1099 /* Likewise for the size in bytes. */
1100 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1101 /* Holds the alignment required for the datum. */
1102 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1103 /* For FIELD_DECLs, holds the alignment that DECL_FIELD_OFFSET has. */
1104 #define DECL_OFFSET_ALIGN(NODE) (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1105 /* Holds the machine mode corresponding to the declaration of a variable or
1106 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1108 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1109 /* Holds the RTL expression for the value of a variable or function. If
1110 PROMOTED_MODE is defined, the mode of this expression may not be same
1111 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1112 to the variable's data type, while the mode
1113 of DECL_RTL is the mode actually used to contain the data. */
1114 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1115 /* Holds an INSN_LIST of all of the live ranges in which the variable
1116 has been moved to a possibly different register. */
1117 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1118 /* For PARM_DECL, holds an RTL for the stack slot or register
1119 where the data was actually passed. */
1120 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1121 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1122 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1123 /* For FUNCTION_DECL, if it is inline,
1124 holds the size of the stack frame, as an integer. */
1125 #define DECL_FRAME_SIZE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.i)
1126 /* For FUNCTION_DECL, if it is built-in,
1127 this identifies which built-in operation it is. */
1128 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1130 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1131 Before the struct containing the FUNCTION_DECL is laid out,
1132 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1133 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1134 function. When the class is laid out, this pointer is changed
1135 to an INTEGER_CST node which is suitable for use as an index
1136 into the virtual function table. */
1137 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1138 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1139 which this FIELD_DECL is defined. This information is needed when
1140 writing debugging information about vfield and vbase decls for C++. */
1141 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1143 /* Every ..._DECL node gets a unique number. */
1144 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1146 /* For any sort of a ..._DECL node, this points to the original (abstract)
1147 decl node which this decl is an instance of, or else it is NULL indicating
1148 that this decl is not an instance of some other decl. For example,
1149 in a nested declaration of an inline function, this points back to the
1151 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1153 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1154 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1155 #define DECL_ORIGIN(NODE) \
1156 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1158 /* Nonzero for any sort of ..._DECL node means this decl node represents
1159 an inline instance of some original (abstract) decl from an inline function;
1160 suppress any warnings about shadowing some other variable.
1161 FUNCTION_DECL nodes can also have their abstract origin set to themselves
1162 (see save_for_inline_copying). */
1163 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1164 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1166 /* Nonzero if a _DECL means that the name of this decl should be ignored
1167 for symbolic debug purposes. */
1168 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1170 /* Nonzero for a given ..._DECL node means that this node represents an
1171 "abstract instance" of the given declaration (e.g. in the original
1172 declaration of an inline function). When generating symbolic debugging
1173 information, we mustn't try to generate any address information for nodes
1174 marked as "abstract instances" because we don't actually generate
1175 any code or allocate any data space for such instances. */
1176 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1178 /* Nonzero if a _DECL means that no warnings should be generated just
1179 because this decl is unused. */
1180 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1182 /* Nonzero for a given ..._DECL node means that this node should be
1183 put in .common, if possible. If a DECL_INITIAL is given, and it
1184 is not error_mark_node, then the decl cannot be put in .common. */
1185 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1187 /* Language-specific decl information. */
1188 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1190 /* In a VAR_DECL or FUNCTION_DECL,
1191 nonzero means external reference:
1192 do not allocate storage, and refer to a definition elsewhere. */
1193 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1195 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1197 #define DEFAULT_INIT_PRIORITY 65535
1198 #define MAX_INIT_PRIORITY 65535
1199 #define MAX_RESERVED_INIT_PRIORITY 100
1202 nonzero means the detail info about this type is not dumped into stabs.
1203 Instead it will generate cross reference ('x') of names.
1204 This uses the same flag as DECL_EXTERNAL. */
1205 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1206 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1208 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1209 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1210 /* In LABEL_DECL nodes, nonzero means that an error message about
1211 jumping into such a binding contour has been printed for this label. */
1212 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1213 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1214 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1215 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1216 static chain is not needed. */
1217 #define DECL_NO_STATIC_CHAIN(NODE) \
1218 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1220 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1221 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1223 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1225 Also set in some languages for variables, etc., outside the normal
1226 lexical scope, such as class instance variables. */
1227 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1229 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1230 where it is called. */
1231 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1233 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1234 that is not specified by ansi C and that users are supposed to be allowed
1235 to redefine for any purpose whatever. */
1236 #define DECL_BUILT_IN_NONANSI(NODE) \
1237 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1239 /* Nonzero in a FUNCTION_DECL means this function should be treated
1240 as if it were a malloc, meaning it returns a pointer that is
1242 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1244 /* Nonzero in a FUNCTION_DECL means this function should be treated
1245 as "pure" function (like const function, but may read global memory). */
1246 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1248 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1250 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1251 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1252 contour that restored a stack level and which is now exited. */
1253 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1255 /* Unused in FUNCTION_DECL. */
1257 /* In a VAR_DECL that's static,
1258 nonzero if the space is in the text section. */
1259 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1261 /* In a FUNCTION_DECL, nonzero means a built in function. */
1262 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1263 /* For a builtin function, identify which part of the compiler defined it. */
1264 #define DECL_BUILT_IN_CLASS(NODE) \
1265 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1267 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1268 Used in FIELD_DECLs for vtable pointers.
1269 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1270 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1272 /* Used to indicate that the linkage status of this DECL is not yet known,
1273 so it should not be output now. */
1274 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1276 /* Used in PARM_DECLs whose type are unions to indicate that the
1277 argument should be passed in the same way that the first union
1278 alternative would be passed. */
1279 #define DECL_TRANSPARENT_UNION(NODE) \
1280 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1282 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1283 at the beginning or end of execution. */
1284 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1285 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1287 #define DECL_STATIC_DESTRUCTOR(NODE) \
1288 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1290 /* Used to indicate that this DECL represents a compiler-generated entity. */
1291 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1293 /* Used to indicate that this DECL has weak linkage. */
1294 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1296 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1297 multiple translation units should be merged. */
1298 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1300 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1301 not be put out unless it is needed in this translation unit.
1302 Entities like this are shared across translation units (like weak
1303 entities), but are guaranteed to be generated by any translation
1304 unit that needs them, and therefore need not be put out anywhere
1305 where they are not needed. DECL_COMDAT is just a hint to the
1306 back-end; it is up to front-ends which set this flag to ensure
1307 that there will never be any harm, other than bloat, in putting out
1308 something which is DECL_COMDAT. */
1309 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1311 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1312 be instrumented with calls to support routines. */
1313 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1314 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1316 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1317 disabled in this function. */
1318 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) \
1319 (FUNCTION_DECL_CHECK (NODE)->decl.no_check_memory_usage)
1321 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1322 disabled in this function. */
1323 #define DECL_NO_LIMIT_STACK(NODE) \
1324 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1326 /* Additional flags for language-specific uses. */
1327 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1328 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1329 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1330 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1331 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1332 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1333 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1334 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1336 /* Used to indicate that the pointer to this DECL cannot be treated as
1337 an address constant. */
1338 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1340 /* Used to indicate an alias set for the memory pointed to by this
1341 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1342 pointer (or reference) type. */
1343 #define DECL_POINTER_ALIAS_SET(NODE) \
1344 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1346 /* Nonzero if an alias set has been assigned to this declaration. */
1347 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1348 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1352 char common[sizeof (struct tree_common)];
1356 union tree_node *size;
1357 ENUM_BITFIELD(machine_mode) mode : 8;
1359 unsigned external_flag : 1;
1360 unsigned nonlocal_flag : 1;
1361 unsigned regdecl_flag : 1;
1362 unsigned inline_flag : 1;
1363 unsigned bit_field_flag : 1;
1364 unsigned virtual_flag : 1;
1365 unsigned ignored_flag : 1;
1366 unsigned abstract_flag : 1;
1368 unsigned in_system_header_flag : 1;
1369 unsigned common_flag : 1;
1370 unsigned defer_output : 1;
1371 unsigned transparent_union : 1;
1372 unsigned static_ctor_flag : 1;
1373 unsigned static_dtor_flag : 1;
1374 unsigned artificial_flag : 1;
1375 unsigned weak_flag : 1;
1377 unsigned non_addr_const_p : 1;
1378 unsigned no_instrument_function_entry_exit : 1;
1379 unsigned no_check_memory_usage : 1;
1380 unsigned comdat_flag : 1;
1381 unsigned malloc_flag : 1;
1382 unsigned no_limit_stack : 1;
1383 unsigned pure_flag : 1;
1384 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1386 unsigned lang_flag_0 : 1;
1387 unsigned lang_flag_1 : 1;
1388 unsigned lang_flag_2 : 1;
1389 unsigned lang_flag_3 : 1;
1390 unsigned lang_flag_4 : 1;
1391 unsigned lang_flag_5 : 1;
1392 unsigned lang_flag_6 : 1;
1393 unsigned lang_flag_7 : 1;
1395 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1396 If built-in, this is the code for which built-in function.
1397 For other kinds of decls, this is DECL_ALIGN and DECL_OFFSET_ALIGN. */
1400 enum built_in_function f;
1401 struct {unsigned int align : 24; unsigned int off_align : 8;} a;
1404 union tree_node *size_unit;
1405 union tree_node *name;
1406 union tree_node *context;
1407 union tree_node *arguments; /* Also used for DECL_FIELD_OFFSET */
1408 union tree_node *result; /* Also used for DECL_BIT_FIELD_TYPE */
1409 union tree_node *initial; /* Also used for DECL_QUALIFIER */
1410 union tree_node *abstract_origin;
1411 union tree_node *assembler_name;
1412 union tree_node *section_name;
1413 union tree_node *machine_attributes;
1414 struct rtx_def *rtl; /* RTL representation for object. */
1415 struct rtx_def *live_range_rtl;
1417 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1418 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1419 In PARM_DECL, holds an RTL for the stack slot
1420 of register where the data was actually passed.
1421 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1429 union tree_node *vindex;
1430 int pointer_alias_set;
1431 /* Points to a structure whose details depend on the language in use. */
1432 struct lang_decl *lang_specific;
1435 /* Define the overall contents of a tree node.
1436 It may be any of the structures declared above
1437 for various types of node. */
1441 struct tree_common common;
1442 struct tree_int_cst int_cst;
1443 struct tree_real_cst real_cst;
1444 struct tree_string string;
1445 struct tree_complex complex;
1446 struct tree_identifier identifier;
1447 struct tree_decl decl;
1448 struct tree_type type;
1449 struct tree_list list;
1450 struct tree_vec vec;
1451 struct tree_exp exp;
1452 struct tree_block block;
1455 /* Standard named or nameless data types of the C compiler. */
1483 TI_COMPLEX_INTEGER_TYPE,
1484 TI_COMPLEX_FLOAT_TYPE,
1485 TI_COMPLEX_DOUBLE_TYPE,
1486 TI_COMPLEX_LONG_DOUBLE_TYPE,
1490 TI_LONG_DOUBLE_TYPE,
1501 extern tree global_trees[TI_MAX];
1503 #define error_mark_node global_trees[TI_ERROR_MARK]
1505 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1506 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1507 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1508 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1509 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1511 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1512 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1513 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1514 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1515 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1517 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1518 #define integer_one_node global_trees[TI_INTEGER_ONE]
1519 #define size_zero_node global_trees[TI_SIZE_ZERO]
1520 #define size_one_node global_trees[TI_SIZE_ONE]
1521 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1522 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1523 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1525 #define null_pointer_node global_trees[TI_NULL_POINTER]
1527 #define float_type_node global_trees[TI_FLOAT_TYPE]
1528 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1529 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1531 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1532 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1533 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1534 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1536 #define void_type_node global_trees[TI_VOID_TYPE]
1537 /* The C type `void *'. */
1538 #define ptr_type_node global_trees[TI_PTR_TYPE]
1539 /* The C type `const void *'. */
1540 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1541 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1542 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1544 /* An enumeration of the standard C integer types. These must be
1545 ordered so that shorter types appear before longer ones. */
1546 enum integer_type_kind
1558 itk_unsigned_long_long,
1562 typedef enum integer_type_kind integer_type_kind;
1564 /* The standard C integer types. Use integer_type_kind to index into
1566 extern tree integer_types[itk_none];
1568 #define char_type_node integer_types[itk_char]
1569 #define signed_char_type_node integer_types[itk_signed_char]
1570 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1571 #define short_integer_type_node integer_types[itk_short]
1572 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1573 #define integer_type_node integer_types[itk_int]
1574 #define unsigned_type_node integer_types[itk_unsigned_int]
1575 #define long_integer_type_node integer_types[itk_long]
1576 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1577 #define long_long_integer_type_node integer_types[itk_long_long]
1578 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1581 #define NULL_TREE (tree) NULL
1583 /* The following functions accept a wide integer argument. Rather than
1584 having to cast on every function call, we use a macro instead, that is
1585 defined here and in rtl.h. */
1588 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1589 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1591 extern int exact_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1592 extern int floor_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1594 extern char *oballoc PARAMS ((int));
1595 extern char *permalloc PARAMS ((int));
1596 extern char *savealloc PARAMS ((int));
1597 extern char *expralloc PARAMS ((int));
1599 /* Lowest level primitive for allocating a node.
1600 The TREE_CODE is the only argument. Contents are initialized
1601 to zero except for a few of the common fields. */
1603 extern tree make_node PARAMS ((enum tree_code));
1604 extern tree make_lang_type PARAMS ((enum tree_code));
1605 extern tree (*make_lang_type_fn) PARAMS ((enum tree_code));
1607 /* Make a copy of a node, with all the same contents except
1608 for TREE_PERMANENT. (The copy is permanent
1609 iff nodes being made now are permanent.) */
1611 extern tree copy_node PARAMS ((tree));
1613 /* Make a copy of a chain of TREE_LIST nodes. */
1615 extern tree copy_list PARAMS ((tree));
1617 /* Make a TREE_VEC. */
1619 extern tree make_tree_vec PARAMS ((int));
1621 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1622 The name is supplied as a char *. */
1624 extern tree get_identifier PARAMS ((const char *));
1626 /* If an identifier with the name TEXT (a null-terminated string) has
1627 previously been referred to, return that node; otherwise return
1630 extern tree maybe_get_identifier PARAMS ((const char *));
1632 /* Construct various types of nodes. */
1634 #define build_int_2(LO,HI) \
1635 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1637 extern tree build PARAMS ((enum tree_code, tree, ...));
1638 extern tree build_nt PARAMS ((enum tree_code, ...));
1639 extern tree build_parse_node PARAMS ((enum tree_code, ...));
1641 extern tree build_int_2_wide PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT));
1642 extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE));
1643 extern tree build_real_from_int_cst PARAMS ((tree, tree));
1644 extern tree build_complex PARAMS ((tree, tree, tree));
1645 extern tree build_string PARAMS ((int, const char *));
1646 extern tree build1 PARAMS ((enum tree_code, tree, tree));
1647 extern tree build_tree_list PARAMS ((tree, tree));
1648 extern tree build_decl_list PARAMS ((tree, tree));
1649 extern tree build_expr_list PARAMS ((tree, tree));
1650 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
1651 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
1652 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
1654 /* Construct various nodes representing data types. */
1656 extern tree make_signed_type PARAMS ((int));
1657 extern tree make_unsigned_type PARAMS ((int));
1658 extern void initialize_sizetypes PARAMS ((void));
1659 extern void set_sizetype PARAMS ((tree));
1660 extern tree signed_or_unsigned_type PARAMS ((int, tree));
1661 extern void fixup_unsigned_type PARAMS ((tree));
1662 extern tree build_pointer_type PARAMS ((tree));
1663 extern tree build_reference_type PARAMS ((tree));
1664 extern tree build_index_type PARAMS ((tree));
1665 extern tree build_index_2_type PARAMS ((tree, tree));
1666 extern tree build_array_type PARAMS ((tree, tree));
1667 extern tree build_function_type PARAMS ((tree, tree));
1668 extern tree build_method_type PARAMS ((tree, tree));
1669 extern tree build_offset_type PARAMS ((tree, tree));
1670 extern tree build_complex_type PARAMS ((tree));
1671 extern tree array_type_nelts PARAMS ((tree));
1673 extern tree value_member PARAMS ((tree, tree));
1674 extern tree purpose_member PARAMS ((tree, tree));
1675 extern tree binfo_member PARAMS ((tree, tree));
1676 extern unsigned int attribute_hash_list PARAMS ((tree));
1677 extern int attribute_list_equal PARAMS ((tree, tree));
1678 extern int attribute_list_contained PARAMS ((tree, tree));
1679 extern int tree_int_cst_equal PARAMS ((tree, tree));
1680 extern int tree_int_cst_lt PARAMS ((tree, tree));
1681 extern int host_integerp PARAMS ((tree, int));
1682 extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
1683 extern int tree_int_cst_msb PARAMS ((tree));
1684 extern int tree_int_cst_sgn PARAMS ((tree));
1685 extern int tree_expr_nonnegative_p PARAMS ((tree));
1686 extern int index_type_equal PARAMS ((tree, tree));
1687 extern tree get_inner_array_type PARAMS ((tree));
1689 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1690 put the prototype here. Rtl.h does declare the prototype if
1691 tree.h had been included. */
1693 extern tree make_tree PARAMS ((tree, struct rtx_def *));
1695 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1698 Such modified types already made are recorded so that duplicates
1701 extern tree build_type_attribute_variant PARAMS ((tree, tree));
1702 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
1704 extern tree merge_machine_decl_attributes PARAMS ((tree, tree));
1705 extern tree merge_machine_type_attributes PARAMS ((tree, tree));
1707 /* Split a list of declspecs and attributes into two. */
1709 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
1711 /* Strip attributes from a list of combined specs and attrs. */
1713 extern tree strip_attrs PARAMS ((tree));
1715 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1717 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
1719 /* Given a tree node and a string, return non-zero if the tree node is
1720 a valid attribute name for the string. */
1722 extern int is_attribute_p PARAMS ((const char *, tree));
1724 /* Given an attribute name and a list of attributes, return the list element
1725 of the attribute or NULL_TREE if not found. */
1727 extern tree lookup_attribute PARAMS ((const char *, tree));
1729 /* Given two attributes lists, return a list of their union. */
1731 extern tree merge_attributes PARAMS ((tree, tree));
1733 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
1734 the same kind of data as TYPE describes. Variants point to the
1735 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
1736 and it points to a chain of other variants so that duplicate
1737 variants are never made. Only main variants should ever appear as
1738 types of expressions. */
1740 extern tree build_qualified_type PARAMS ((tree, int));
1742 /* Like build_qualified_type, but only deals with the `const' and
1743 `volatile' qualifiers. This interface is retained for backwards
1744 compatiblity with the various front-ends; new code should use
1745 build_qualified_type instead. */
1747 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
1748 build_qualified_type (TYPE, \
1749 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
1750 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
1752 /* Make a copy of a type node. */
1754 extern tree build_type_copy PARAMS ((tree));
1756 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1757 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
1758 node, does nothing except for the first time. */
1760 extern void layout_type PARAMS ((tree));
1762 /* These functions allow a front-end to perform a manual layout of a
1763 RECORD_TYPE. (For instance, if the placement of subsequent fields
1764 depends on the placement of fields so far.) Begin by calling
1765 start_record_layout. Then, call place_field for each of the
1766 fields. Then, call finish_record_layout. See layout_type for the
1767 default way in which these functions are used. */
1769 typedef struct record_layout_info
1771 /* The RECORD_TYPE that we are laying out. */
1773 /* The offset into the record so far, in bytes, not including bits in
1776 /* The last known alignment of SIZE. */
1777 unsigned int offset_align;
1778 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
1780 /* The alignment of the record so far, in bits. */
1781 unsigned int record_align;
1782 /* The alignment of the record so far, not including padding, in bits. */
1783 unsigned int unpacked_align;
1784 /* The static variables (i.e., class variables, as opposed to
1785 instance variables) encountered in T. */
1786 tree pending_statics;
1787 int packed_maybe_necessary;
1788 } *record_layout_info;
1790 extern record_layout_info start_record_layout PARAMS ((tree));
1791 extern tree bit_from_pos PARAMS ((tree, tree));
1792 extern tree byte_from_pos PARAMS ((tree, tree));
1793 extern void pos_from_byte PARAMS ((tree *, tree *, unsigned int,
1795 extern void pos_from_bit PARAMS ((tree *, tree *, unsigned int,
1797 extern void normalize_offset PARAMS ((tree *, tree *,
1799 extern tree rli_size_unit_so_far PARAMS ((record_layout_info));
1800 extern tree rli_size_so_far PARAMS ((record_layout_info));
1801 extern void normalize_rli PARAMS ((record_layout_info));
1802 extern void place_field PARAMS ((record_layout_info, tree));
1803 extern void finish_record_layout PARAMS ((record_layout_info));
1805 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1806 return a canonicalized ..._TYPE node, so that duplicates are not made.
1807 How the hash code is computed is up to the caller, as long as any two
1808 callers that could hash identical-looking type nodes agree. */
1810 extern tree type_hash_canon PARAMS ((unsigned int, tree));
1812 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1813 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1814 fields. Call this only once for any given decl node.
1816 Second argument is the boundary that this field can be assumed to
1817 be starting at (in bits). Zero means it can be assumed aligned
1818 on any boundary that may be needed. */
1820 extern void layout_decl PARAMS ((tree, unsigned));
1822 /* Return the mode for data of a given size SIZE and mode class CLASS.
1823 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
1824 The value is BLKmode if no other mode is found. This is like
1825 mode_for_size, but is passed a tree. */
1827 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
1830 /* Return an expr equal to X but certainly not valid as an lvalue. */
1832 extern tree non_lvalue PARAMS ((tree));
1833 extern tree pedantic_non_lvalue PARAMS ((tree));
1835 extern tree convert PARAMS ((tree, tree));
1836 extern unsigned int expr_align PARAMS ((tree));
1837 extern tree size_in_bytes PARAMS ((tree));
1838 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
1839 extern tree bit_position PARAMS ((tree));
1840 extern HOST_WIDE_INT int_bit_position PARAMS ((tree));
1841 extern tree byte_position PARAMS ((tree));
1842 extern HOST_WIDE_INT int_byte_position PARAMS ((tree));
1844 /* Define data structures, macros, and functions for handling sizes
1845 and the various types used to represent sizes. */
1849 SIZETYPE, /* Normal representation of sizes in bytes. */
1850 SSIZETYPE, /* Signed representation of sizes in bytes. */
1851 USIZETYPE, /* Unsigned representation of sizes in bytes. */
1852 BITSIZETYPE, /* Normal representation of sizes in bits. */
1853 SBITSIZETYPE, /* Signed representation of sizes in bits. */
1854 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
1857 extern tree sizetype_tab[(int) TYPE_KIND_LAST];
1859 #define sizetype sizetype_tab[(int) SIZETYPE]
1860 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
1861 #define ssizetype sizetype_tab[(int) SSIZETYPE]
1862 #define usizetype sizetype_tab[(int) USIZETYPE]
1863 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
1864 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
1866 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
1867 extern tree size_diffop PARAMS ((tree, tree));
1868 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
1869 enum size_type_kind));
1870 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
1872 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
1873 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
1874 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
1875 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
1876 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
1878 extern tree round_up PARAMS ((tree, int));
1879 extern tree get_pending_sizes PARAMS ((void));
1880 extern void put_pending_sizes PARAMS ((tree));
1882 /* Type for sizes of data-type. */
1884 #define BITS_PER_UNIT_LOG \
1885 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1886 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1887 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1889 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1890 extern unsigned int maximum_field_alignment;
1892 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1893 extern unsigned int set_alignment;
1895 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1896 by making the last node in X point to Y.
1897 Returns X, except if X is 0 returns Y. */
1899 extern tree chainon PARAMS ((tree, tree));
1901 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1903 extern tree tree_cons PARAMS ((tree, tree, tree));
1904 extern tree perm_tree_cons PARAMS ((tree, tree, tree));
1905 extern tree temp_tree_cons PARAMS ((tree, tree, tree));
1906 extern tree saveable_tree_cons PARAMS ((tree, tree, tree));
1907 extern tree decl_tree_cons PARAMS ((tree, tree, tree));
1908 extern tree expr_tree_cons PARAMS ((tree, tree, tree));
1910 /* Return the last tree node in a chain. */
1912 extern tree tree_last PARAMS ((tree));
1914 /* Reverse the order of elements in a chain, and return the new head. */
1916 extern tree nreverse PARAMS ((tree));
1918 /* Returns the length of a chain of nodes
1919 (number of chain pointers to follow before reaching a null pointer). */
1921 extern int list_length PARAMS ((tree));
1923 /* Returns the number of FIELD_DECLs in a type. */
1925 extern int fields_length PARAMS ((tree));
1927 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1929 extern int integer_zerop PARAMS ((tree));
1931 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1933 extern int integer_onep PARAMS ((tree));
1935 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1936 all of whose significant bits are 1. */
1938 extern int integer_all_onesp PARAMS ((tree));
1940 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1941 exactly one bit 1. */
1943 extern int integer_pow2p PARAMS ((tree));
1945 /* staticp (tree x) is nonzero if X is a reference to data allocated
1946 at a fixed address in memory. */
1948 extern int staticp PARAMS ((tree));
1950 /* Gets an error if argument X is not an lvalue.
1951 Also returns 1 if X is an lvalue, 0 if not. */
1953 extern int lvalue_or_else PARAMS ((tree, const char *));
1955 /* save_expr (EXP) returns an expression equivalent to EXP
1956 but it can be used multiple times within context CTX
1957 and only evaluate EXP once. */
1959 extern tree save_expr PARAMS ((tree));
1961 /* Returns the index of the first non-tree operand for CODE, or the number
1962 of operands if all are trees. */
1964 extern int first_rtl_op PARAMS ((enum tree_code));
1966 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1967 can be used multiple times and will evaluate EXP in its entirety
1970 extern tree unsave_expr PARAMS ((tree));
1972 /* Reset EXP in place so that it can be expaned again. Does not
1973 recurse into subtrees. */
1975 extern void unsave_expr_1 PARAMS ((tree));
1977 /* Like unsave_expr_1, but recurses into all subtrees. */
1979 extern tree unsave_expr_now PARAMS ((tree));
1981 /* If non-null, these are language-specific helper functions for
1982 unsave_expr_now. If present, LANG_UNSAVE is called before its
1983 argument (an UNSAVE_EXPR) is to be unsaved, and all other
1984 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
1985 called from unsave_expr_1 for language-specific tree codes. */
1986 extern void (*lang_unsave) PARAMS ((tree *));
1987 extern void (*lang_unsave_expr_now) PARAMS ((tree));
1989 /* Return 0 if it is safe to evaluate EXPR multiple times,
1990 return 1 if it is safe if EXPR is unsaved afterward, or
1991 return 2 if it is completely unsafe. */
1992 extern int unsafe_for_reeval PARAMS ((tree));
1994 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1995 or offset that depends on a field within a record.
1997 Note that we only allow such expressions within simple arithmetic
2000 extern int contains_placeholder_p PARAMS ((tree));
2002 /* Return 1 if EXP contains any expressions that produce cleanups for an
2003 outer scope to deal with. Used by fold. */
2005 extern int has_cleanups PARAMS ((tree));
2007 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2008 return a tree with all occurrences of references to F in a
2009 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2010 contains only arithmetic expressions. */
2012 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
2014 /* variable_size (EXP) is like save_expr (EXP) except that it
2015 is for the special case of something that is part of a
2016 variable size for a data type. It makes special arrangements
2017 to compute the value at the right time when the data type
2018 belongs to a function parameter. */
2020 extern tree variable_size PARAMS ((tree));
2022 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2023 but it can be used multiple times
2024 and only evaluate the subexpressions once. */
2026 extern tree stabilize_reference PARAMS ((tree));
2028 /* Subroutine of stabilize_reference; this is called for subtrees of
2029 references. Any expression with side-effects must be put in a SAVE_EXPR
2030 to ensure that it is only evaluated once. */
2032 extern tree stabilize_reference_1 PARAMS ((tree));
2034 /* Return EXP, stripped of any conversions to wider types
2035 in such a way that the result of converting to type FOR_TYPE
2036 is the same as if EXP were converted to FOR_TYPE.
2037 If FOR_TYPE is 0, it signifies EXP's type. */
2039 extern tree get_unwidened PARAMS ((tree, tree));
2041 /* Return OP or a simpler expression for a narrower value
2042 which can be sign-extended or zero-extended to give back OP.
2043 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2044 or 0 if the value should be sign-extended. */
2046 extern tree get_narrower PARAMS ((tree, int *));
2048 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2050 The definition of this resides in language-specific code
2051 as the repertoire of available types may vary. */
2053 extern tree type_for_mode PARAMS ((enum machine_mode, int));
2055 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2056 for an integer type with at least that precision.
2057 The definition of this resides in language-specific code
2058 as the repertoire of available types may vary. */
2060 extern tree type_for_size PARAMS ((unsigned, int));
2062 /* Given an integer type T, return a type like T but unsigned.
2063 If T is unsigned, the value is T.
2064 The definition of this resides in language-specific code
2065 as the repertoire of available types may vary. */
2067 extern tree unsigned_type PARAMS ((tree));
2069 /* Given an integer type T, return a type like T but signed.
2070 If T is signed, the value is T.
2071 The definition of this resides in language-specific code
2072 as the repertoire of available types may vary. */
2074 extern tree signed_type PARAMS ((tree));
2076 /* This function must be defined in the language-specific files.
2077 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2078 This is defined in a language-specific file. */
2080 extern tree maybe_build_cleanup PARAMS ((tree));
2082 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2083 look for nested component-refs or array-refs at constant positions
2084 and find the ultimate containing object, which is returned. */
2086 extern tree get_inner_reference PARAMS ((tree, HOST_WIDE_INT *,
2087 HOST_WIDE_INT *, tree *,
2088 enum machine_mode *, int *,
2089 int *, unsigned int *));
2091 /* Given a DECL or TYPE, return the scope in which it was declared, or
2092 NUL_TREE if there is no containing scope. */
2094 extern tree get_containing_scope PARAMS ((tree));
2096 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2098 extern tree decl_function_context PARAMS ((tree));
2100 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2101 this _DECL with its context, or zero if none. */
2102 extern tree decl_type_context PARAMS ((tree));
2104 /* Given the FUNCTION_DECL for the current function,
2105 return zero if it is ok for this function to be inline.
2106 Otherwise return a warning message with a single %s
2107 for the function's name. */
2109 extern const char *function_cannot_inline_p PARAMS ((tree));
2111 /* Return 1 if EXPR is the real constant zero. */
2112 extern int real_zerop PARAMS ((tree));
2114 /* Declare commonly used variables for tree structure. */
2116 /* Points to the name of the input file from which the current input
2117 being parsed originally came (before it went into cpp). */
2118 extern char *input_filename;
2120 /* Current line number in input file. */
2123 /* Nonzero for -pedantic switch: warn about anything
2124 that standard C forbids. */
2125 extern int pedantic;
2127 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2128 Zero means allow extended lvalues. */
2130 extern int pedantic_lvalues;
2132 /* Nonzero means can safely call expand_expr now;
2133 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2135 extern int immediate_size_expand;
2137 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2139 extern tree current_function_decl;
2141 /* Nonzero means a FUNC_BEGIN label was emitted. */
2142 extern tree current_function_func_begin_label;
2144 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2146 extern int all_types_permanent;
2148 /* Pointer to function to compute the name to use to print a declaration.
2149 DECL is the declaration in question.
2150 VERBOSITY determines what information will be printed:
2151 0: DECL_NAME, demangled as necessary.
2152 1: and scope information.
2153 2: and any other information that might be interesting, such as function
2154 parameter types in C++. */
2156 extern const char *(*decl_printable_name) PARAMS ((tree, int));
2158 /* Pointer to function to finish handling an incomplete decl at the
2159 end of compilation. */
2161 extern void (*incomplete_decl_finalize_hook) PARAMS ((tree));
2163 extern char *init_parse PARAMS ((char *));
2164 extern void finish_parse PARAMS ((void));
2166 extern const char * const language_string;
2168 /* Declare a predefined function. Return the declaration. This function is
2169 provided by each language frontend. */
2170 extern tree builtin_function PARAMS ((const char *, tree, int,
2171 enum built_in_class,
2175 extern char *perm_calloc PARAMS ((int, long));
2176 extern tree get_file_function_name PARAMS ((int));
2177 extern tree get_file_function_name_long PARAMS ((const char *));
2178 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2179 extern tree get_set_constructor_bytes PARAMS ((tree,
2180 unsigned char *, int));
2181 extern int get_alias_set PARAMS ((tree));
2182 extern int new_alias_set PARAMS ((void));
2183 extern int (*lang_get_alias_set) PARAMS ((tree));
2184 extern tree get_callee_fndecl PARAMS ((tree));
2188 extern int in_control_zone_p PARAMS ((void));
2189 extern void expand_fixups PARAMS ((struct rtx_def *));
2190 extern tree expand_start_stmt_expr PARAMS ((void));
2191 extern tree expand_end_stmt_expr PARAMS ((tree));
2192 extern void expand_expr_stmt PARAMS ((tree));
2193 extern int warn_if_unused_value PARAMS ((tree));
2194 extern void expand_decl_init PARAMS ((tree));
2195 extern void clear_last_expr PARAMS ((void));
2196 extern void expand_label PARAMS ((tree));
2197 extern void expand_goto PARAMS ((tree));
2198 extern void expand_asm PARAMS ((tree));
2199 extern void expand_start_cond PARAMS ((tree, int));
2200 extern void expand_end_cond PARAMS ((void));
2201 extern void expand_start_else PARAMS ((void));
2202 extern void expand_start_elseif PARAMS ((tree));
2203 extern struct nesting *expand_start_loop PARAMS ((int));
2204 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2205 extern void expand_loop_continue_here PARAMS ((void));
2206 extern void expand_end_loop PARAMS ((void));
2207 extern int expand_continue_loop PARAMS ((struct nesting *));
2208 extern int expand_exit_loop PARAMS ((struct nesting *));
2209 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2211 extern int expand_exit_something PARAMS ((void));
2213 extern void expand_null_return PARAMS ((void));
2214 extern void expand_return PARAMS ((tree));
2215 extern int optimize_tail_recursion PARAMS ((tree, struct rtx_def *));
2216 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2217 #define expand_start_bindings(flags) \
2218 expand_start_bindings_and_block(flags, NULL_TREE)
2219 extern void expand_end_bindings PARAMS ((tree, int, int));
2220 extern void warn_about_unused_variables PARAMS ((tree));
2221 extern void start_cleanup_deferral PARAMS ((void));
2222 extern void end_cleanup_deferral PARAMS ((void));
2223 extern int is_body_block PARAMS ((tree));
2225 extern void mark_block_as_eh_region PARAMS ((void));
2226 extern void mark_block_as_not_eh_region PARAMS ((void));
2227 extern int is_eh_region PARAMS ((void));
2228 extern int conditional_context PARAMS ((void));
2229 extern tree last_cleanup_this_contour PARAMS ((void));
2230 extern int expand_dhc_cleanup PARAMS ((tree));
2231 extern int expand_dcc_cleanup PARAMS ((tree));
2232 extern void expand_start_case PARAMS ((int, tree, tree,
2234 extern void expand_end_case PARAMS ((tree));
2235 extern int pushcase PARAMS ((tree,
2236 tree (*) (tree, tree),
2238 extern int pushcase_range PARAMS ((tree, tree,
2239 tree (*) (tree, tree),
2241 extern void using_eh_for_cleanups PARAMS ((void));
2242 extern int stmt_loop_nest_empty PARAMS ((void));
2244 /* In fold-const.c */
2246 /* Fold constants as much as possible in an expression.
2247 Returns the simplified expression.
2248 Acts only on the top level of the expression;
2249 if the argument itself cannot be simplified, its
2250 subexpressions are not changed. */
2252 extern tree fold PARAMS ((tree));
2254 extern int force_fit_type PARAMS ((tree, int));
2255 extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2256 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2257 unsigned HOST_WIDE_INT *,
2259 extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2260 unsigned HOST_WIDE_INT *,
2262 extern int mul_double PARAMS ((unsigned HOST_WIDE_INT,
2264 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2265 unsigned HOST_WIDE_INT *,
2267 extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2268 HOST_WIDE_INT, unsigned int,
2269 unsigned HOST_WIDE_INT *,
2270 HOST_WIDE_INT *, int));
2271 extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2272 HOST_WIDE_INT, unsigned int,
2273 unsigned HOST_WIDE_INT *,
2274 HOST_WIDE_INT *, int));
2275 extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2276 HOST_WIDE_INT, unsigned int,
2277 unsigned HOST_WIDE_INT *,
2279 extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2280 HOST_WIDE_INT, unsigned int,
2281 unsigned HOST_WIDE_INT *,
2283 extern int operand_equal_p PARAMS ((tree, tree, int));
2284 extern tree invert_truthvalue PARAMS ((tree));
2286 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2287 function arguments and return the new type. Return NULL_TREE if no
2288 change. Required by any language that supports variadic arguments. */
2290 extern tree (*lang_type_promotes_to) PARAMS ((tree));
2292 /* Interface of the DWARF2 unwind info support. */
2294 /* Decide whether we want to emit frame unwind information for the current
2295 translation unit. */
2297 extern int dwarf2out_do_frame PARAMS ((void));
2299 /* Generate a new label for the CFI info to refer to. */
2301 extern char *dwarf2out_cfi_label PARAMS ((void));
2303 /* Entry point to update the canonical frame address (CFA). */
2305 extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
2307 /* Add the CFI for saving a register window. */
2309 extern void dwarf2out_window_save PARAMS ((char *));
2311 /* Add a CFI to update the running total of the size of arguments pushed
2314 extern void dwarf2out_args_size PARAMS ((char *, long));
2316 /* Entry point for saving a register to the stack. */
2318 extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
2320 /* Entry point for saving the return address in the stack. */
2322 extern void dwarf2out_return_save PARAMS ((char *, long));
2324 /* Entry point for saving the return address in a register. */
2326 extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
2328 /* Output a marker (i.e. a label) for the beginning of a function, before
2331 extern void dwarf2out_begin_prologue PARAMS ((void));
2333 /* Output a marker (i.e. a label) for the absolute end of the generated
2334 code for a function definition. */
2336 extern void dwarf2out_end_epilogue PARAMS ((void));
2338 /* The language front-end must define these functions. */
2340 /* Function of no arguments for initializing options. */
2341 extern void lang_init_options PARAMS ((void));
2343 /* Function of no arguments for initializing lexical scanning. */
2344 extern void init_lex PARAMS ((void));
2345 /* Function of no arguments for initializing the symbol table. */
2346 extern void init_decl_processing PARAMS ((void));
2348 /* Functions called with no arguments at the beginning and end or processing
2349 the input source file. */
2350 extern void lang_init PARAMS ((void));
2351 extern void lang_finish PARAMS ((void));
2353 /* Function to identify which front-end produced the output file. */
2354 extern const char *lang_identify PARAMS ((void));
2356 /* Called by report_error_function to print out function name.
2357 * Default may be overridden by language front-ends. */
2358 extern void (*print_error_function) PARAMS ((const char *));
2360 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2361 extern void copy_lang_decl PARAMS ((tree));
2363 /* Function called with no arguments to parse and compile the input. */
2364 extern int yyparse PARAMS ((void));
2365 /* Function called with option as argument
2366 to decode options starting with -f or -W or +.
2367 It should return nonzero if it handles the option. */
2368 extern int lang_decode_option PARAMS ((int, char **));
2370 /* Functions for processing symbol declarations. */
2371 /* Function to enter a new lexical scope.
2372 Takes one argument: always zero when called from outside the front end. */
2373 extern void pushlevel PARAMS ((int));
2374 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2375 Takes three arguments:
2376 KEEP -- nonzero if there were declarations in this scope.
2377 REVERSE -- reverse the order of decls before returning them.
2378 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2379 extern tree poplevel PARAMS ((int, int, int));
2380 /* Set the BLOCK node for the current scope level. */
2381 extern void set_block PARAMS ((tree));
2382 /* Function to add a decl to the current scope level.
2383 Takes one argument, a decl to add.
2384 Returns that decl, or, if the same symbol is already declared, may
2385 return a different decl for that name. */
2386 extern tree pushdecl PARAMS ((tree));
2387 /* Function to return the chain of decls so far in the current scope level. */
2388 extern tree getdecls PARAMS ((void));
2389 /* Function to return the chain of structure tags in the current scope level. */
2390 extern tree gettags PARAMS ((void));
2392 extern tree build_range_type PARAMS ((tree, tree, tree));
2394 /* Call when starting to parse a declaration:
2395 make expressions in the declaration last the length of the function.
2396 Returns an argument that should be passed to resume_momentary later. */
2397 extern int suspend_momentary PARAMS ((void));
2399 extern int allocation_temporary_p PARAMS ((void));
2401 /* Call when finished parsing a declaration:
2402 restore the treatment of node-allocation that was
2403 in effect before the suspension.
2404 YES should be the value previously returned by suspend_momentary. */
2405 extern void resume_momentary PARAMS ((int));
2407 /* Called after finishing a record, union or enumeral type. */
2408 extern void rest_of_type_compilation PARAMS ((tree, int));
2410 /* Save the current set of obstacks, but don't change them. */
2411 extern void push_obstacks_nochange PARAMS ((void));
2413 extern void permanent_allocation PARAMS ((int));
2415 extern void push_momentary PARAMS ((void));
2417 extern void clear_momentary PARAMS ((void));
2419 extern void pop_momentary PARAMS ((void));
2421 extern void end_temporary_allocation PARAMS ((void));
2423 /* Pop the obstack selection stack. */
2424 extern void pop_obstacks PARAMS ((void));
2427 extern int really_constant_p PARAMS ((tree));
2428 extern void push_obstacks PARAMS ((struct obstack *,
2430 extern void pop_momentary_nofree PARAMS ((void));
2431 extern void preserve_momentary PARAMS ((void));
2432 extern void saveable_allocation PARAMS ((void));
2433 extern void temporary_allocation PARAMS ((void));
2434 extern void resume_temporary_allocation PARAMS ((void));
2435 extern tree get_file_function_name PARAMS ((int));
2436 extern void set_identifier_size PARAMS ((int));
2437 extern int int_fits_type_p PARAMS ((tree, tree));
2438 extern int tree_log2 PARAMS ((tree));
2439 extern int tree_floor_log2 PARAMS ((tree));
2440 extern void preserve_initializer PARAMS ((void));
2441 extern void preserve_data PARAMS ((void));
2442 extern int object_permanent_p PARAMS ((tree));
2443 extern int type_precision PARAMS ((tree));
2444 extern int simple_cst_equal PARAMS ((tree, tree));
2445 extern int compare_tree_int PARAMS ((tree, unsigned int));
2446 extern int type_list_equal PARAMS ((tree, tree));
2447 extern int chain_member PARAMS ((tree, tree));
2448 extern int chain_member_purpose PARAMS ((tree, tree));
2449 extern int chain_member_value PARAMS ((tree, tree));
2450 extern tree listify PARAMS ((tree));
2451 extern tree type_hash_lookup PARAMS ((unsigned int, tree));
2452 extern void type_hash_add PARAMS ((unsigned int, tree));
2453 extern unsigned int type_hash_list PARAMS ((tree));
2454 extern int simple_cst_list_equal PARAMS ((tree, tree));
2455 extern void debug_obstack PARAMS ((char *));
2456 extern void rtl_in_current_obstack PARAMS ((void));
2457 extern void rtl_in_saveable_obstack PARAMS ((void));
2458 extern void init_tree_codes PARAMS ((void));
2459 extern void dump_tree_statistics PARAMS ((void));
2460 extern void print_obstack_statistics PARAMS ((const char *,
2463 extern void print_obstack_name PARAMS ((char *, FILE *, const char *));
2465 extern void expand_function_end PARAMS ((char *, int, int));
2466 extern void expand_function_start PARAMS ((tree, int));
2467 extern int real_onep PARAMS ((tree));
2468 extern int real_twop PARAMS ((tree));
2469 extern void start_identifier_warnings PARAMS ((void));
2470 extern void gcc_obstack_init PARAMS ((struct obstack *));
2471 extern void init_obstacks PARAMS ((void));
2472 extern void obfree PARAMS ((char *));
2473 extern void build_common_tree_nodes PARAMS ((int));
2474 extern void build_common_tree_nodes_2 PARAMS ((int));
2477 extern void setjmp_protect_args PARAMS ((void));
2478 extern void setjmp_protect PARAMS ((tree));
2479 extern void expand_main_function PARAMS ((void));
2480 extern void mark_varargs PARAMS ((void));
2481 extern void init_dummy_function_start PARAMS ((void));
2482 extern void expand_dummy_function_end PARAMS ((void));
2483 extern void init_function_for_compilation PARAMS ((void));
2484 extern void init_function_start PARAMS ((tree, char *, int));
2485 extern void assign_parms PARAMS ((tree));
2486 extern void put_var_into_stack PARAMS ((tree));
2487 extern void flush_addressof PARAMS ((tree));
2488 extern void uninitialized_vars_warning PARAMS ((tree));
2489 extern void setjmp_args_warning PARAMS ((void));
2490 extern void mark_all_temps_used PARAMS ((void));
2491 extern void init_temp_slots PARAMS ((void));
2492 extern void combine_temp_slots PARAMS ((void));
2493 extern void free_temp_slots PARAMS ((void));
2494 extern void pop_temp_slots PARAMS ((void));
2495 extern void push_temp_slots PARAMS ((void));
2496 extern void preserve_temp_slots PARAMS ((struct rtx_def *));
2497 extern void preserve_rtl_expr_temps PARAMS ((tree));
2498 extern int aggregate_value_p PARAMS ((tree));
2499 extern void free_temps_for_rtl_expr PARAMS ((tree));
2500 extern void instantiate_virtual_regs PARAMS ((tree, struct rtx_def *));
2501 extern void unshare_all_rtl PARAMS ((tree, struct rtx_def *));
2502 extern int max_parm_reg_num PARAMS ((void));
2503 extern void push_function_context PARAMS ((void));
2504 extern void pop_function_context PARAMS ((void));
2505 extern void push_function_context_to PARAMS ((tree));
2506 extern void pop_function_context_from PARAMS ((tree));
2508 /* In print-rtl.c */
2510 extern void print_rtl PARAMS ((FILE *, struct rtx_def *));
2513 /* In print-tree.c */
2514 extern void debug_tree PARAMS ((tree));
2516 extern void print_node PARAMS ((FILE *, const char *, tree, int));
2517 extern void print_node_brief PARAMS ((FILE *, const char *, tree, int));
2518 extern void indent_to PARAMS ((FILE *, int));
2522 extern void emit_queue PARAMS ((void));
2523 extern int apply_args_register_offset PARAMS ((int));
2524 extern struct rtx_def *expand_builtin_return_addr
2525 PARAMS ((enum built_in_function, int, struct rtx_def *));
2526 extern void do_pending_stack_adjust PARAMS ((void));
2527 extern struct rtx_def *expand_assignment PARAMS ((tree, tree, int, int));
2528 extern struct rtx_def *store_expr PARAMS ((tree, struct rtx_def *,
2530 extern void check_max_integer_computation_mode PARAMS ((tree));
2533 extern void start_sequence_for_rtl_expr PARAMS ((tree));
2534 extern struct rtx_def *emit_line_note_after PARAMS ((const char *, int,
2536 extern struct rtx_def *emit_line_note PARAMS ((const char *, int));
2537 extern struct rtx_def *emit_line_note_force PARAMS ((const char *, int));
2541 /* Flags used by special_function_p. */
2542 extern int setjmp_call_p PARAMS ((tree));
2545 extern int mark_addressable PARAMS ((tree));
2546 extern void incomplete_type_error PARAMS ((tree, tree));
2549 extern void print_lang_statistics PARAMS ((void));
2552 extern tree truthvalue_conversion PARAMS ((tree));
2553 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2557 extern void print_lang_decl PARAMS ((FILE *, tree, int));
2558 extern void print_lang_type PARAMS ((FILE *, tree, int));
2559 extern void print_lang_identifier PARAMS ((FILE *, tree, int));
2561 extern int global_bindings_p PARAMS ((void));
2562 extern void insert_block PARAMS ((tree));
2564 /* In integrate.c */
2565 extern void save_for_inline_nocopy PARAMS ((tree));
2566 extern void save_for_inline_copying PARAMS ((tree));
2567 extern void set_decl_abstract_flags PARAMS ((tree, int));
2568 extern void output_inline_function PARAMS ((tree));
2571 extern void set_yydebug PARAMS ((int));
2573 /* In stor-layout.c */
2574 extern void fixup_signed_type PARAMS ((tree));
2577 extern void make_decl_rtl PARAMS ((tree, const char *, int));
2578 extern void make_decl_one_only PARAMS ((tree));
2579 extern int supports_one_only PARAMS ((void));
2580 extern void variable_section PARAMS ((tree, int));
2582 /* In fold-const.c */
2583 extern int div_and_round_double PARAMS ((enum tree_code, int,
2584 unsigned HOST_WIDE_INT,
2586 unsigned HOST_WIDE_INT,
2588 unsigned HOST_WIDE_INT *,
2590 unsigned HOST_WIDE_INT *,
2594 extern void emit_nop PARAMS ((void));
2595 extern void expand_computed_goto PARAMS ((tree));
2596 extern struct rtx_def *label_rtx PARAMS ((tree));
2597 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
2599 extern int any_pending_cleanups PARAMS ((int));
2600 extern void init_stmt PARAMS ((void));
2601 extern void init_stmt_for_function PARAMS ((void));
2602 extern int drop_through_at_end_p PARAMS ((void));
2603 extern void expand_start_target_temps PARAMS ((void));
2604 extern void expand_end_target_temps PARAMS ((void));
2605 extern void expand_elseif PARAMS ((tree));
2606 extern void expand_decl PARAMS ((tree));
2607 extern int expand_decl_cleanup PARAMS ((tree, tree));
2608 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
2609 extern void move_cleanups_up PARAMS ((void));
2610 extern void expand_start_case_dummy PARAMS ((void));
2611 extern void expand_end_case_dummy PARAMS ((void));
2612 extern tree case_index_expr_type PARAMS ((void));
2613 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
2614 extern void check_for_full_enumeration_handling PARAMS ((tree));
2615 extern void declare_nonlocal_label PARAMS ((tree));
2617 extern void lang_print_xnode PARAMS ((FILE *, tree, int));
2621 /* If KIND=='I', return a suitable global initializer (constructor) name.
2622 If KIND=='D', return a suitable global clean-up (destructor) name. */
2623 extern tree get_file_function_name PARAMS ((int));
2625 /* Interface of the DWARF2 unwind info support. */
2627 /* Decide whether we want to emit frame unwind information for the current
2628 translation unit. */
2630 extern int dwarf2out_do_frame PARAMS ((void));
2632 /* Generate a new label for the CFI info to refer to. */
2634 extern char *dwarf2out_cfi_label PARAMS ((void));
2636 /* Entry point to update the canonical frame address (CFA). */
2638 extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
2640 /* Add the CFI for saving a register window. */
2642 extern void dwarf2out_window_save PARAMS ((char *));
2644 /* Add a CFI to update the running total of the size of arguments pushed
2647 extern void dwarf2out_args_size PARAMS ((char *, long));
2649 /* Entry point for saving a register to the stack. */
2651 extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
2653 /* Entry point for saving the return address in the stack. */
2655 extern void dwarf2out_return_save PARAMS ((char *, long));
2657 /* Entry point for saving the return address in a register. */
2659 extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
2661 /* Output a marker (i.e. a label) for the beginning of a function, before
2664 extern void dwarf2out_begin_prologue PARAMS ((void));
2666 /* Output a marker (i.e. a label) for the absolute end of the generated
2667 code for a function definition. */
2669 extern void dwarf2out_end_epilogue PARAMS ((void));
2671 /* Redefine abort to report an internal error w/o coredump, and
2672 reporting the location of the error in the source file. This logic
2673 is duplicated in rtl.h and tree.h because every file that needs the
2674 special abort includes one or both. toplev.h gets too few files,
2675 system.h gets too many. */
2677 extern void fancy_abort PARAMS ((const char *, int, const char *))
2679 #if (GCC_VERSION >= 2007)
2680 #define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__)
2682 #define abort() fancy_abort (__FILE__, __LINE__, 0)