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 language-independent 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];
65 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
67 /* Names of tree components. */
69 extern const char *tree_code_name[MAX_TREE_CODES];
71 /* Classify which part of the compiler has defined a given builtin function.
72 Note that we assume below that this is no more than two bits. */
81 /* Names for the above. */
82 extern const char *const built_in_class_names[4];
84 /* Codes that identify the various built in functions
85 so that expand_call can identify them quickly. */
87 #define DEF_BUILTIN(x) x,
88 enum built_in_function
90 #include "builtins.def"
92 /* Upper bound on non-language-specific builtins. */
97 /* Names for the above. */
98 extern const char *const built_in_names[(int) END_BUILTINS];
100 /* The definition of tree nodes fills the next several pages. */
102 /* A tree node can represent a data type, a variable, an expression
103 or a statement. Each node has a TREE_CODE which says what kind of
104 thing it represents. Some common codes are:
105 INTEGER_TYPE -- represents a type of integers.
106 ARRAY_TYPE -- represents a type of pointer.
107 VAR_DECL -- represents a declared variable.
108 INTEGER_CST -- represents a constant integer value.
109 PLUS_EXPR -- represents a sum (an expression).
111 As for the contents of a tree node: there are some fields
112 that all nodes share. Each TREE_CODE has various special-purpose
113 fields as well. The fields of a node are never accessed directly,
114 always through accessor macros. */
116 /* This type is used everywhere to refer to a tree node. */
118 typedef union tree_node *tree;
120 /* Every kind of tree node starts with this structure,
121 so all nodes have these fields.
123 See the accessor macros, defined below, for documentation of the
128 union tree_node *chain;
129 union tree_node *type;
130 ENUM_BITFIELD(tree_code) code : 8;
131 unsigned side_effects_flag : 1;
132 unsigned constant_flag : 1;
133 unsigned permanent_flag : 1;
134 unsigned addressable_flag : 1;
135 unsigned volatile_flag : 1;
136 unsigned readonly_flag : 1;
137 unsigned unsigned_flag : 1;
138 unsigned asm_written_flag: 1;
140 unsigned used_flag : 1;
141 unsigned nothrow_flag : 1;
142 unsigned static_flag : 1;
143 unsigned public_flag : 1;
144 unsigned private_flag : 1;
145 unsigned protected_flag : 1;
146 unsigned bounded_flag : 1;
148 unsigned lang_flag_0 : 1;
149 unsigned lang_flag_1 : 1;
150 unsigned lang_flag_2 : 1;
151 unsigned lang_flag_3 : 1;
152 unsigned lang_flag_4 : 1;
153 unsigned lang_flag_5 : 1;
154 unsigned lang_flag_6 : 1;
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, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
165 ..._TYPE, IDENTIFIER_NODE
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
264 expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL
269 /* Define accessors for the fields that all tree nodes have
270 (though some fields are not used for all kinds of nodes). */
272 /* The tree-code says what kind of node it is.
273 Codes are defined in tree.def. */
274 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
275 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
277 /* When checking is enabled, errors will be generated if a tree node
278 is accessed incorrectly. The macros abort with a fatal error. */
279 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
281 #define TREE_CHECK(t, code) __extension__ \
282 ({ const tree __t = t; \
283 if (TREE_CODE(__t) != (code)) \
284 tree_check_failed (__t, code, __FILE__, \
285 __LINE__, __PRETTY_FUNCTION__); \
287 #define TREE_CLASS_CHECK(t, class) __extension__ \
288 ({ const tree __t = t; \
289 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
290 tree_class_check_failed (__t, class, __FILE__, \
291 __LINE__, __PRETTY_FUNCTION__); \
294 /* These checks have to be special cased. */
295 #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
296 ({ const tree __t = t; \
297 enum tree_code __c = TREE_CODE(__t); \
298 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
299 tree_check_failed (__t, CONSTRUCTOR, __FILE__, \
300 __LINE__, __PRETTY_FUNCTION__); \
302 #define EXPR_CHECK(t) __extension__ \
303 ({ const tree __t = t; \
304 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
305 if (__c != 'r' && __c != 's' && __c != '<' \
306 && __c != '1' && __c != '2' && __c != 'e') \
307 tree_class_check_failed(__t, 'e', __FILE__, \
308 __LINE__, __PRETTY_FUNCTION__); \
311 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
312 const char *, int, const char *))
314 extern void tree_class_check_failed PARAMS ((const tree, int,
315 const char *, int, const char *))
318 #else /* not ENABLE_TREE_CHECKING, or not gcc */
320 #define TREE_CHECK(t, code) (t)
321 #define TREE_CLASS_CHECK(t, code) (t)
322 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
323 #define EXPR_CHECK(t) (t)
327 #include "tree-check.h"
329 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
330 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
331 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
333 /* In all nodes that are expressions, this is the data type of the expression.
334 In POINTER_TYPE nodes, this is the type that the pointer points to.
335 In ARRAY_TYPE nodes, this is the type of the elements.
336 In VECTOR_TYPE nodes, this is the type of the elements. */
337 #define TREE_TYPE(NODE) ((NODE)->common.type)
339 /* Nodes are chained together for many purposes.
340 Types are chained together to record them for being output to the debugger
341 (see the function `chain_type').
342 Decls in the same scope are chained together to record the contents
344 Statement nodes for successive statements used to be chained together.
345 Often lists of things are represented by TREE_LIST nodes that
346 are chained together. */
348 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
350 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
351 that don't change the machine mode. */
353 #define STRIP_NOPS(EXP) \
354 while ((TREE_CODE (EXP) == NOP_EXPR \
355 || TREE_CODE (EXP) == CONVERT_EXPR \
356 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
357 && (TYPE_MODE (TREE_TYPE (EXP)) \
358 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
359 (EXP) = TREE_OPERAND (EXP, 0);
361 /* Like STRIP_NOPS, but don't let the signedness change either. */
363 #define STRIP_SIGN_NOPS(EXP) \
364 while ((TREE_CODE (EXP) == NOP_EXPR \
365 || TREE_CODE (EXP) == CONVERT_EXPR \
366 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
367 && (TYPE_MODE (TREE_TYPE (EXP)) \
368 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
369 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
370 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
371 (EXP) = TREE_OPERAND (EXP, 0);
373 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
375 #define STRIP_TYPE_NOPS(EXP) \
376 while ((TREE_CODE (EXP) == NOP_EXPR \
377 || TREE_CODE (EXP) == CONVERT_EXPR \
378 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
379 && (TREE_TYPE (EXP) \
380 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
381 (EXP) = TREE_OPERAND (EXP, 0);
383 /* Nonzero if TYPE represents an integral type. Note that we do not
384 include COMPLEX types here. */
386 #define INTEGRAL_TYPE_P(TYPE) \
387 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
388 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
390 /* Nonzero if TYPE represents a floating-point type, including complex
391 floating-point types. */
393 #define FLOAT_TYPE_P(TYPE) \
394 (TREE_CODE (TYPE) == REAL_TYPE \
395 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
396 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
398 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
400 #define AGGREGATE_TYPE_P(TYPE) \
401 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
402 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
403 || TREE_CODE (TYPE) == SET_TYPE)
405 /* Nonzero if TYPE represents an unbounded pointer or unbounded
406 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
408 #define POINTER_TYPE_P(TYPE) \
409 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
411 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
413 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
414 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
416 /* Nonzero if TYPE represents a bounded pointer type. */
418 #define BOUNDED_POINTER_TYPE_P(TYPE) \
419 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
420 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
422 /* Nonzero if TYPE represents a bounded reference type. Bounded
423 reference types have two specific uses: (1) When a reference is
424 seated to a variable-length RECORD_TYPE that has an array of
425 indeterminate length as its final field. For all other objects, it
426 is sufficient to check bounds at the time the reference is seated,
427 and assume that all future uses of the reference are safe, since
428 the address of references cannot change. (2) When a reference
429 supertype is seated to an subtype object. The bounds "remember"
430 the true size of the complete object, so that subsequent upcasts of
431 the address of the reference will be checked properly (is such a
432 thing valid C++?). */
434 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
435 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
436 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
438 /* Nonzero if TYPE represents a pointer or reference type, either
439 bounded or unbounded. */
441 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
442 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
444 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
446 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
447 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
449 /* Nonzero if TYPE represents a reference type, either bounded or unbounded. */
451 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
452 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
454 /* Nonzero if this type is a complete type. */
455 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
457 /* Nonzero if this type is the (possibly qualified) void type. */
458 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
460 /* Nonzero if this type is complete or is cv void. */
461 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
462 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
464 /* Nonzero if this type is complete or is an array with unspecified bound. */
465 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
466 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE))
468 /* Nonzero if TYPE represents a type. */
470 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
472 /* Define many boolean fields that all tree nodes have. */
474 /* In VAR_DECL nodes, nonzero means address of this is needed.
475 So it cannot be in a register.
476 In a FUNCTION_DECL, nonzero means its address is needed.
477 So it must be compiled even if it is an inline function.
478 In a FIELD_DECL node, it means that the programmer is permitted to
479 construct the address of this field. This is used for aliasing
480 purposes: see record_component_aliases.
481 In CONSTRUCTOR nodes, it means object constructed must be in memory.
482 In LABEL_DECL nodes, it means a goto for this label has been seen
483 from a place outside all binding contours that restore stack levels.
484 In ..._TYPE nodes, it means that objects of this type must
485 be fully addressable. This means that pieces of this
486 object cannot go into register parameters, for example.
487 In IDENTIFIER_NODEs, this means that some extern decl for this name
488 had its address taken. That matters for inline functions. */
489 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
491 /* In a VAR_DECL, nonzero means allocate static storage.
492 In a FUNCTION_DECL, nonzero if function has been defined.
493 In a CONSTRUCTOR, nonzero means allocate static storage. */
494 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
496 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
497 made implicitly and should not lead to an "unused value" warning. */
498 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
500 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
501 chain is via a `virtual' declaration. */
502 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
504 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
505 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
506 requires a diagnostic when overflows occur in constant expressions. */
507 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
509 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
510 this string as an argument. */
511 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
513 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
514 overflow in folding, and no warning has been issued for this subexpression.
515 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
516 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
518 /* In a VAR_DECL or FUNCTION_DECL,
519 nonzero means name is to be accessible from outside this module.
520 In an identifier node, nonzero means an external declaration
521 accessible from outside this module was previously seen
522 for this name in an inner scope. */
523 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
525 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
526 base class is via a `public' declaration, which preserves public
527 fields from the base class as public. */
528 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
530 /* Ditto, for `private' declarations. */
531 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
533 /* Nonzero for TREE_LIST node means that the path to the
534 base class is via a `protected' declaration, which preserves
535 protected fields from the base class as protected.
537 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
539 /* In any expression, nonzero means it has side effects or reevaluation
540 of the whole expression could produce a different value.
541 This is set if any subexpression is a function call, a side effect
542 or a reference to a volatile variable.
543 In a ..._DECL, this is set only if the declaration said `volatile'. */
544 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
546 /* Nonzero means this expression is volatile in the C sense:
547 its address should be of type `volatile WHATEVER *'.
548 In other words, the declared item is volatile qualified.
549 This is used in _DECL nodes and _REF nodes.
551 In a ..._TYPE node, means this type is volatile-qualified.
552 But use TYPE_VOLATILE instead of this macro when the node is a type,
553 because eventually we may make that a different bit.
555 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
556 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
558 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
559 nonzero means it may not be the lhs of an assignment.
560 In a ..._TYPE node, means this type is const-qualified
561 (but the macro TYPE_READONLY should be used instead of this macro
562 when the node is a type). */
563 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
565 /* Value of expression is constant.
566 Always appears in all ..._CST nodes.
567 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
568 if the value is constant. */
569 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
571 /* Nonzero means permanent node;
572 node will continue to exist for the entire compiler run.
573 Otherwise it will be recycled at the end of the function.
574 This flag is always zero if garbage collection is in use.
575 Try not to use this. Only set it with TREE_SET_PERMANENT. */
576 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
577 #define TREE_SET_PERMANENT(NODE) do { \
578 if (!ggc_p && current_obstack == &permanent_obstack) \
579 TREE_PERMANENT(NODE) = 1; \
582 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
583 In FIELD_DECL nodes, means an unsigned bit field.
584 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
585 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
587 /* Nonzero in a VAR_DECL means assembler code has been written.
588 Nonzero in a FUNCTION_DECL means that the function has been compiled.
589 This is interesting in an inline function, since it might not need
590 to be compiled separately.
591 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
592 if the sdb debugging info for the type has been written.
593 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
594 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
596 /* Nonzero in a _DECL if the name is used in its scope.
597 Nonzero in an expr node means inhibit warning if value is unused.
598 In IDENTIFIER_NODEs, this means that some extern decl for this name
600 #define TREE_USED(NODE) ((NODE)->common.used_flag)
602 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
603 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
604 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
606 /* Used in classes in C++. */
607 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
608 /* Used in classes in C++.
609 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
610 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
612 /* In a ..._TYPE node, nonzero means that the type's size and layout,
613 (or the size and layout of its arguments and/or return value in the
614 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
615 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
616 node is a type, because eventually we may make that a different
617 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
618 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
619 BOUNDED_INDIRECT_TYPE_P to test for that.
621 In a FUNCTION_DECL, nonzero means that the size and layout of one
622 of its arguments and/or return value was changed by the presence of
623 pointer bounds. This value can differ from the value of
624 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
625 declared, then later called with pointer args, or was declared with
626 a variable argument list and is later called with pointer values in
627 the variable argument list.
629 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
630 of the decl's type's BOUNDED_POINTER_TYPE_P.
632 In a CONSTRUCTOR or other expression, nonzero means the value is a
633 bounded pointer. It is insufficient to determine the boundedness
634 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
635 since we allow pointer to be temporarily cast to integer for
636 rounding up to an alignment boudary in a way that preserves the
639 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
640 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
641 of a function that has bounded pointer(s) for its return type and/or
644 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
646 /* These flags are available for each language front end to use internally. */
647 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
648 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
649 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
650 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
651 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
652 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
653 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
655 /* Define additional fields and accessors for nodes representing constants. */
657 /* In an INTEGER_CST node. These two together make a 2-word integer.
658 If the data type is signed, the value is sign-extended to 2 words
659 even though not all of them may really be in use.
660 In an unsigned constant shorter than 2 words, the extra bits are 0. */
661 #define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
662 #define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
664 #define INT_CST_LT(A, B) \
665 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
666 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
667 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
669 #define INT_CST_LT_UNSIGNED(A, B) \
670 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
671 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
672 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
673 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
674 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
678 struct tree_common common;
679 struct rtx_def *rtl; /* acts as link to register transfer language
681 unsigned HOST_WIDE_INT int_cst_low;
682 HOST_WIDE_INT int_cst_high;
685 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
686 and generally in all kinds of constants that could
687 be given labels (rather than being immediate). */
689 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
691 /* In a REAL_CST node. */
692 /* We can represent a real value as either a `double' or a string.
693 Strings don't allow for any optimization, but they do allow
694 for cross-compilation. */
696 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
702 struct tree_common common;
703 struct rtx_def *rtl; /* acts as link to register transfer language
705 REAL_VALUE_TYPE real_cst;
708 /* In a STRING_CST */
709 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
710 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
714 struct tree_common common;
715 struct rtx_def *rtl; /* acts as link to register transfer language
721 /* In a COMPLEX_CST node. */
722 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
723 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
727 struct tree_common common;
728 struct rtx_def *rtl; /* acts as link to register transfer language
730 union tree_node *real;
731 union tree_node *imag;
734 /* Define fields and accessors for some special-purpose tree nodes. */
736 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
737 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
739 struct tree_identifier
741 struct tree_common common;
746 /* In a TREE_LIST node. */
747 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
748 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
752 struct tree_common common;
753 union tree_node *purpose;
754 union tree_node *value;
757 /* In a TREE_VEC node. */
758 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
759 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
760 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
764 struct tree_common common;
766 union tree_node *a[1];
769 /* Define fields and accessors for some nodes that represent expressions. */
771 /* In a SAVE_EXPR node. */
772 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
773 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
774 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
775 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
776 both in normal code and in a handler. (Normally, in a handler, all
777 SAVE_EXPRs are unsaved, meaning that there values are
779 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
781 /* In a RTL_EXPR node. */
782 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
783 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
785 /* In a CALL_EXPR node. */
786 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
788 /* In a CONSTRUCTOR node. */
789 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
791 /* In ordinary expression nodes. */
792 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
793 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
795 /* In a LABELED_BLOCK_EXPR node. */
796 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
797 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
799 /* In a EXIT_BLOCK_EXPR node. */
800 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
801 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
803 /* In a LOOP_EXPR node. */
804 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
806 /* In a EXPR_WITH_FILE_LOCATION node. */
807 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
808 #define EXPR_WFL_FILENAME(NODE) \
809 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
810 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
811 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
812 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
813 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
814 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
815 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
816 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
820 struct tree_common common;
822 union tree_node *operands[1];
825 /* In a BLOCK node. */
826 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
827 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
828 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
829 /* Note: when changing this, make sure to find the places
830 that use chainon or nreverse. */
831 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
832 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
833 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
835 /* Nonzero means that this block is prepared to handle exceptions
836 listed in the BLOCK_VARS slot. */
837 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
839 /* An index number for this block. These values are not guaranteed to
840 be unique across functions -- whether or not they are depends on
841 the debugging output format in use. */
842 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
846 struct tree_common common;
848 unsigned handler_block_flag : 1;
849 unsigned abstract_flag : 1;
850 unsigned block_num : 30;
852 union tree_node *vars;
853 union tree_node *subblocks;
854 union tree_node *supercontext;
855 union tree_node *abstract_origin;
858 /* Define fields and accessors for nodes representing data types. */
860 /* See tree.def for documentation of the use of these fields.
861 Look at the documentation of the various ..._TYPE tree codes. */
863 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
864 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
865 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
866 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
867 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
868 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
869 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
870 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
871 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
872 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
873 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
874 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
875 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
876 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
877 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
878 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
879 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
880 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
881 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
882 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
883 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
884 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
885 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
886 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
887 #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
888 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
890 /* Indirect types present difficulties because they may be represented
891 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
892 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
893 be logically equivalent, but physically different. Simple
894 comparison of the main variant only tells if the types are
895 logically equivalent. Use this predicate to compare for physical
898 /* Types have the same main variant, and have the same boundedness. */
899 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
900 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
901 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
903 /* Return the type variant that has no qualifiers (i.e., the main variant),
904 except that the boundedness qualifier is preserved. */
905 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
906 (BOUNDED_POINTER_TYPE_P (TYPE) \
907 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
908 : TYPE_MAIN_VARIANT (TYPE))
910 /* For aggregate types, information about this type, as a base type
911 for itself. Used in a language-dependent way for types that are
912 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
913 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
915 /* The (language-specific) typed-based alias set for this type.
916 Objects whose TYPE_ALIAS_SETs are different cannot alias each
917 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
918 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
919 type can alias objects of any type. */
920 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
922 /* Nonzero iff the typed-based alias set for this type has been
924 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
925 (TYPE_CHECK (NODE)->type.alias_set != -1)
927 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
929 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
931 /* The alignment necessary for objects of this type.
932 The value is an int, measured in bits. */
933 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
935 /* 1 if the alignment for this type was requested by "aligned" attribute,
936 0 if it is the default for this type. */
937 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
939 /* The alignment for NODE, in bytes. */
940 #define TYPE_ALIGN_UNIT(NODE) \
941 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
943 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
945 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
946 has BLKmode only because it lacks the alignment requirement for
948 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
950 /* In an INTEGER_TYPE, it means the type represents a size. We use this
951 both for validity checking and to permit optimziations that are unsafe
953 #define TYPE_IS_SIZETYPE(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
955 /* Nonzero in a type considered volatile as a whole. */
956 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
958 /* Means this type is const-qualified. */
959 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
961 /* If nonzero, this type is `restrict'-qualified, in the C sense of
963 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
965 /* If nonzero, this type's size and layout, (or the size and layout of
966 its arguments and/or return value in the case of a FUNCTION_TYPE or
967 METHOD_TYPE) was changed by the presence of pointer bounds. */
968 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
970 /* There is a TYPE_QUAL value for each type qualifier. They can be
971 combined by bitwise-or to form the complete set of qualifiers for a
974 #define TYPE_UNQUALIFIED 0x0
975 #define TYPE_QUAL_CONST 0x1
976 #define TYPE_QUAL_VOLATILE 0x2
977 #define TYPE_QUAL_RESTRICT 0x4
978 #define TYPE_QUAL_BOUNDED 0x8
980 /* The set of type qualifiers for this type. */
981 #define TYPE_QUALS(NODE) \
982 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
983 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
984 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
985 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
987 /* The set of qualifiers pertinent to an expression node. */
988 #define TREE_EXPR_QUALS(NODE) \
989 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
990 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
991 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
993 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
994 #define TREE_FUNC_QUALS(NODE) \
995 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
996 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
998 /* These flags are available for each language front end to use internally. */
999 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1000 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1001 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1002 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1003 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1004 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1005 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1007 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1008 that distinguish string from array of char).
1009 If set in a SET_TYPE, indicates a bitstring type. */
1010 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1012 /* If non-NULL, this is a upper bound of the size (in bytes) of an
1013 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
1014 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
1016 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1017 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) (GET_MODE_NUNITS (TYPE_CHECK (VECTOR_TYPE)->type.mode))
1019 /* Indicates that objects of this type must be initialized by calling a
1020 function when they are created. */
1021 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1022 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1024 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1025 the same way that the first union alternative would be passed. */
1026 #define TYPE_TRANSPARENT_UNION(NODE) \
1027 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1029 /* For an ARRAY_TYPE, indicates that it is not permitted to
1030 take the address of a component of the type. */
1031 #define TYPE_NONALIASED_COMPONENT(NODE) \
1032 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1034 /* Indicated that objects of this type should be laid out in as
1035 compact a way as possible. */
1036 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1038 /* A bounded pointer or bounded reference type (collectively called
1039 indirect types) is represented as a RECORD_TYPE node containing
1040 three pointer fields whose type is the corresponding unbounded
1041 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1042 a bounded indirect type differs from a normal RECORD_TYPE node in
1043 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1044 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1045 nodes are stored on the same type variant chain alongside the
1046 variants of the underlaying indirect types nodes. The main variant
1047 of such chains is always the unbounded type. */
1049 /* Access the field decls of a bounded-pointer type. */
1050 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1051 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1052 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1054 /* Access the simple-pointer subtype of a bounded-pointer type. */
1055 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1057 /* Find the unbounded counterpart to a type, or return TYPE if it is
1058 already unbounded. */
1059 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1060 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1062 /* This field comprises two bits, for values in the range 0..3:
1064 depth=0 means that type is a scalar, or an aggregate that contains
1065 only depth=0 types, or a function that has only depth=0 types for
1066 its return value and argument types.
1068 depth=1 means that type is a pointer to a depth=0 type, or an
1069 aggregate that contains only depth=0 and depth=1 types, or a
1070 function that has only depth=0 and depth=1 types for its return
1071 value and argument types.
1073 The meanings of depth=2 and depth=3 are obvious by induction.
1074 Varargs functions are depth=3. The type `va_list' is depth=3.
1076 The purpose of measuring pointer depth of a type is to determine
1077 the eligibility of a function for an automatically-generated
1078 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1079 depth=1 function is eligible for an automatic thunk. Functions
1080 with depth 2 or more are too complex to get automatic thunks.
1082 Function decls also have a pointer_depth field, since we also
1083 consider the actual argument types for functions. */
1085 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1087 /* In a FUNCTION_TYPE node, this bit stores the value of
1088 default_pointer_boundedness at the time TYPE was created. It is
1089 useful for choosing default boundedness of function arguments for
1090 non-prototype function decls and for varargs/stdarg lists. */
1091 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1092 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1094 #define MAX_POINTER_DEPTH 2
1095 #define VA_LIST_POINTER_DEPTH 3
1099 struct tree_common common;
1100 union tree_node *values;
1101 union tree_node *size;
1102 union tree_node *size_unit;
1103 union tree_node *attributes;
1106 unsigned int precision : 9;
1107 ENUM_BITFIELD(machine_mode) mode : 7;
1109 unsigned string_flag : 1;
1110 unsigned no_force_blk_flag : 1;
1111 unsigned needs_constructing_flag : 1;
1112 unsigned transparent_union_flag : 1;
1113 unsigned packed_flag : 1;
1114 unsigned restrict_flag : 1;
1115 unsigned pointer_depth : 2;
1117 unsigned lang_flag_0 : 1;
1118 unsigned lang_flag_1 : 1;
1119 unsigned lang_flag_2 : 1;
1120 unsigned lang_flag_3 : 1;
1121 unsigned lang_flag_4 : 1;
1122 unsigned lang_flag_5 : 1;
1123 unsigned lang_flag_6 : 1;
1124 unsigned user_align : 1;
1127 union tree_node *pointer_to;
1128 union tree_node *reference_to;
1129 union {int address; char *pointer; } symtab;
1130 union tree_node *name;
1131 union tree_node *minval;
1132 union tree_node *maxval;
1133 union tree_node *next_variant;
1134 union tree_node *main_variant;
1135 union tree_node *binfo;
1136 union tree_node *noncopied_parts;
1137 union tree_node *context;
1138 struct obstack *obstack;
1139 HOST_WIDE_INT alias_set;
1140 /* Points to a structure whose details depend on the language in use. */
1141 struct lang_type *lang_specific;
1144 /* Define accessor macros for information about type inheritance
1147 A "basetype" means a particular usage of a data type for inheritance
1148 in another type. Each such basetype usage has its own "binfo"
1149 object to describe it. The binfo object is a TREE_VEC node.
1151 Inheritance is represented by the binfo nodes allocated for a
1152 given type. For example, given types C and D, such that D is
1153 inherited by C, 3 binfo nodes will be allocated: one for describing
1154 the binfo properties of C, similarly one for D, and one for
1155 describing the binfo properties of D as a base type for C.
1156 Thus, given a pointer to class C, one can get a pointer to the binfo
1157 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1159 /* The actual data type node being inherited in this basetype. */
1160 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1162 /* The offset where this basetype appears in its containing type.
1163 BINFO_OFFSET slot holds the offset (in bytes)
1164 from the base of the complete object to the base of the part of the
1165 object that is allocated on behalf of this `type'.
1166 This is always 0 except when there is multiple inheritance. */
1168 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1169 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1170 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1172 /* The virtual function table belonging to this basetype. Virtual
1173 function tables provide a mechanism for run-time method dispatching.
1174 The entries of a virtual function table are language-dependent. */
1176 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1177 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1179 /* The virtual functions in the virtual function table. This is
1180 a TREE_LIST that is used as an initial approximation for building
1181 a virtual function table for this basetype. */
1182 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1183 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1185 /* A vector of binfos for the direct basetypes inherited by this
1188 If this basetype describes type D as inherited in C, and if the
1189 basetypes of D are E and F, then this vector contains binfos for
1190 inheritance of E and F by C.
1192 ??? This could probably be done by just allocating the
1193 base types at the end of this TREE_VEC (instead of using
1194 another TREE_VEC). This would simplify the calculation
1195 of how many basetypes a given type had. */
1196 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1197 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1199 /* The number of basetypes for NODE. */
1200 #define BINFO_N_BASETYPES(NODE) \
1201 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1203 /* Accessor macro to get to the Nth basetype of this basetype. */
1204 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1205 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1207 /* For a BINFO record describing a virtual base class, i.e., one where
1208 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1209 base. The actual contents are language-dependent. Under the old
1210 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1211 pointer to the virtual base; under the new ABI this field is
1212 instead a INTEGER_CST giving an offset into the vtable where the
1213 offset to the virtual base can be found. */
1214 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1216 /* The size of a base class subobject of this type. Not all frontends
1217 currently allocate the space for these fields. */
1218 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1219 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1220 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1221 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1223 /* Slot used to build a chain that represents a use of inheritance.
1224 For example, if X is derived from Y, and Y is derived from Z,
1225 then this field can be used to link the binfo node for X to
1226 the binfo node for X's Y to represent the use of inheritance
1227 from X to Y. Similarly, this slot of the binfo node for X's Y
1228 can point to the Z from which Y is inherited (in X's inheritance
1229 hierarchy). In this fashion, one can represent and traverse specific
1230 uses of inheritance using the binfo nodes themselves (instead of
1231 consing new space pointing to binfo nodes).
1232 It is up to the language-dependent front-ends to maintain
1233 this information as necessary. */
1234 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1236 /* Define fields and accessors for nodes representing declared names. */
1238 /* Nonzero if DECL represents a decl. */
1239 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1240 /* This is the name of the object as written by the user.
1241 It is an IDENTIFIER_NODE. */
1242 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1243 /* This is the name of the object as the assembler will see it
1244 (but before any translations made by ASM_OUTPUT_LABELREF).
1245 Often this is the same as DECL_NAME.
1246 It is an IDENTIFIER_NODE. */
1247 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1248 /* Records the section name in a section attribute. Used to pass
1249 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1250 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1251 /* For FIELD_DECLs, this is the
1252 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1253 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1254 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1255 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1256 type, or NULL_TREE if the given decl has "file scope". */
1257 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1258 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1259 /* In a DECL this is the field where configuration dependent machine
1260 attributes are store */
1261 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1262 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1263 byte containing the bit closest to the beginning of the structure. */
1264 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1265 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1266 field from DECL_FIELD_OFFSET. */
1267 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1268 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1269 if so, the type that was originally specified for it.
1270 TREE_TYPE may have been modified (in finish_struct). */
1271 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1272 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1273 /* VAR_DECL and PARM_DECL reserve the arguments slot
1274 for language-specific uses. */
1275 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1276 /* This field is used to reference anything in decl.result and is meant only
1277 for use by the garbage collector. */
1278 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1279 /* In FUNCTION_DECL, holds the decl for the return value. */
1280 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1281 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1282 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1283 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1284 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1285 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1286 For a VAR_DECL, holds the initial value.
1287 For a PARM_DECL, not used--default
1288 values for parameters are encoded in the type of the function,
1289 not in the PARM_DECL slot. */
1290 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1291 /* For a PARM_DECL, records the data type used to pass the argument,
1292 which may be different from the type seen in the program. */
1293 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1294 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1295 if nonzero, indicates that the field occupies the type. */
1296 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1297 /* These two fields describe where in the source code the declaration was. */
1298 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1299 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1300 /* Holds the size of the datum, in bits, as a tree expression.
1301 Need not be constant. */
1302 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1303 /* Likewise for the size in bytes. */
1304 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1305 /* Holds the alignment required for the datum. */
1306 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1307 /* For FIELD_DECLs, holds the alignment that DECL_FIELD_OFFSET has. */
1308 #define DECL_OFFSET_ALIGN(NODE) (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1309 /* 1 if the alignment for this type was requested by "aligned" attribute,
1310 0 if it is the default for this type. */
1311 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1312 /* Holds the machine mode corresponding to the declaration of a variable or
1313 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1315 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1316 /* Holds the RTL expression for the value of a variable or function. If
1317 PROMOTED_MODE is defined, the mode of this expression may not be same
1318 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1319 to the variable's data type, while the mode
1320 of DECL_RTL is the mode actually used to contain the data. */
1321 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1322 /* Holds an INSN_LIST of all of the live ranges in which the variable
1323 has been moved to a possibly different register. */
1324 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1325 /* For PARM_DECL, holds an RTL for the stack slot or register
1326 where the data was actually passed. */
1327 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1328 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1329 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1330 /* For FUNCTION_DECL, if it is inline,
1331 holds the size of the stack frame, as an integer. */
1332 #define DECL_FRAME_SIZE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.i)
1333 /* For FUNCTION_DECL, if it is built-in,
1334 this identifies which built-in operation it is. */
1335 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1337 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1338 Before the struct containing the FUNCTION_DECL is laid out,
1339 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1340 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1341 function. When the class is laid out, this pointer is changed
1342 to an INTEGER_CST node which is suitable for use as an index
1343 into the virtual function table. */
1344 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1345 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1346 which this FIELD_DECL is defined. This information is needed when
1347 writing debugging information about vfield and vbase decls for C++. */
1348 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1350 /* Every ..._DECL node gets a unique number. */
1351 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1353 /* For any sort of a ..._DECL node, this points to the original (abstract)
1354 decl node which this decl is an instance of, or else it is NULL indicating
1355 that this decl is not an instance of some other decl. For example,
1356 in a nested declaration of an inline function, this points back to the
1358 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1360 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1361 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1362 #define DECL_ORIGIN(NODE) \
1363 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1365 /* Nonzero for any sort of ..._DECL node means this decl node represents
1366 an inline instance of some original (abstract) decl from an inline function;
1367 suppress any warnings about shadowing some other variable.
1368 FUNCTION_DECL nodes can also have their abstract origin set to themselves
1369 (see save_for_inline_copying). */
1370 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1371 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1373 /* Nonzero if a _DECL means that the name of this decl should be ignored
1374 for symbolic debug purposes. */
1375 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1377 /* Nonzero for a given ..._DECL node means that this node represents an
1378 "abstract instance" of the given declaration (e.g. in the original
1379 declaration of an inline function). When generating symbolic debugging
1380 information, we mustn't try to generate any address information for nodes
1381 marked as "abstract instances" because we don't actually generate
1382 any code or allocate any data space for such instances. */
1383 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1385 /* Nonzero if a _DECL means that no warnings should be generated just
1386 because this decl is unused. */
1387 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1389 /* Nonzero for a given ..._DECL node means that this node should be
1390 put in .common, if possible. If a DECL_INITIAL is given, and it
1391 is not error_mark_node, then the decl cannot be put in .common. */
1392 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1394 /* Language-specific decl information. */
1395 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1397 /* In a VAR_DECL or FUNCTION_DECL,
1398 nonzero means external reference:
1399 do not allocate storage, and refer to a definition elsewhere. */
1400 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1402 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1404 #define DEFAULT_INIT_PRIORITY 65535
1405 #define MAX_INIT_PRIORITY 65535
1406 #define MAX_RESERVED_INIT_PRIORITY 100
1409 nonzero means the detail info about this type is not dumped into stabs.
1410 Instead it will generate cross reference ('x') of names.
1411 This uses the same flag as DECL_EXTERNAL. */
1412 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1413 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1415 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1416 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1417 /* In LABEL_DECL nodes, nonzero means that an error message about
1418 jumping into such a binding contour has been printed for this label. */
1419 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1420 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1421 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1422 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1423 static chain is not needed. */
1424 #define DECL_NO_STATIC_CHAIN(NODE) \
1425 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1427 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1428 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1430 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1432 Also set in some languages for variables, etc., outside the normal
1433 lexical scope, such as class instance variables. */
1434 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1436 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1437 where it is called. */
1438 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1440 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1441 that is not specified by ansi C and that users are supposed to be allowed
1442 to redefine for any purpose whatever. */
1443 #define DECL_BUILT_IN_NONANSI(NODE) \
1444 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1446 /* Nonzero in a FUNCTION_DECL means this function should be treated
1447 as if it were a malloc, meaning it returns a pointer that is
1449 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1451 /* Nonzero in a FUNCTION_DECL means this function should be treated
1452 as "pure" function (like const function, but may read global memory). */
1453 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1455 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1457 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1458 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1459 contour that restored a stack level and which is now exited. */
1460 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1462 /* Unused in FUNCTION_DECL. */
1464 /* In a VAR_DECL that's static,
1465 nonzero if the space is in the text section. */
1466 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1468 /* In a FUNCTION_DECL, nonzero means a built in function. */
1469 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1470 /* For a builtin function, identify which part of the compiler defined it. */
1471 #define DECL_BUILT_IN_CLASS(NODE) \
1472 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1474 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1475 Used in FIELD_DECLs for vtable pointers.
1476 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1477 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1479 /* Used to indicate that the linkage status of this DECL is not yet known,
1480 so it should not be output now. */
1481 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1483 /* Used in PARM_DECLs whose type are unions to indicate that the
1484 argument should be passed in the same way that the first union
1485 alternative would be passed. */
1486 #define DECL_TRANSPARENT_UNION(NODE) \
1487 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1489 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1490 at the beginning or end of execution. */
1491 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1492 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1494 #define DECL_STATIC_DESTRUCTOR(NODE) \
1495 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1497 /* Used to indicate that this DECL represents a compiler-generated entity. */
1498 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1500 /* Used to indicate that this DECL has weak linkage. */
1501 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1503 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1504 multiple translation units should be merged. */
1505 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1507 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1508 not be put out unless it is needed in this translation unit.
1509 Entities like this are shared across translation units (like weak
1510 entities), but are guaranteed to be generated by any translation
1511 unit that needs them, and therefore need not be put out anywhere
1512 where they are not needed. DECL_COMDAT is just a hint to the
1513 back-end; it is up to front-ends which set this flag to ensure
1514 that there will never be any harm, other than bloat, in putting out
1515 something which is DECL_COMDAT. */
1516 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1518 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1519 be instrumented with calls to support routines. */
1520 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1521 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1523 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1524 disabled in this function. */
1525 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) \
1526 (FUNCTION_DECL_CHECK (NODE)->decl.no_check_memory_usage)
1528 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1529 disabled in this function. */
1530 #define DECL_NO_LIMIT_STACK(NODE) \
1531 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1533 /* Additional flags for language-specific uses. */
1534 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1535 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1536 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1537 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1538 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1539 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1540 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1541 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1543 /* Used to indicate that the pointer to this DECL cannot be treated as
1544 an address constant. */
1545 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1547 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1549 #define DECL_NONADDRESSABLE_P(NODE) \
1550 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1552 /* Used to indicate an alias set for the memory pointed to by this
1553 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1554 pointer (or reference) type. */
1555 #define DECL_POINTER_ALIAS_SET(NODE) \
1556 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1558 /* Nonzero if an alias set has been assigned to this declaration. */
1559 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1560 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1562 /* The pointer_depth field comprises two bits for values in the range
1563 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1564 type node, but for functions it migth be greater. For example,
1565 this can happen when the function is declared to accept a parameter
1566 of type void* (depth=1), but is actually called with an argument of
1567 type foo** (depth=2). The function type will get the formal
1568 parameter's depth, but the function decl will get the actual
1569 argument's depth. */
1570 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1574 struct tree_common common;
1575 const char *filename;
1578 union tree_node *size;
1579 ENUM_BITFIELD(machine_mode) mode : 8;
1581 unsigned external_flag : 1;
1582 unsigned nonlocal_flag : 1;
1583 unsigned regdecl_flag : 1;
1584 unsigned inline_flag : 1;
1585 unsigned bit_field_flag : 1;
1586 unsigned virtual_flag : 1;
1587 unsigned ignored_flag : 1;
1588 unsigned abstract_flag : 1;
1590 unsigned in_system_header_flag : 1;
1591 unsigned common_flag : 1;
1592 unsigned defer_output : 1;
1593 unsigned transparent_union : 1;
1594 unsigned static_ctor_flag : 1;
1595 unsigned static_dtor_flag : 1;
1596 unsigned artificial_flag : 1;
1597 unsigned weak_flag : 1;
1599 unsigned non_addr_const_p : 1;
1600 unsigned no_instrument_function_entry_exit : 1;
1601 unsigned no_check_memory_usage : 1;
1602 unsigned comdat_flag : 1;
1603 unsigned malloc_flag : 1;
1604 unsigned no_limit_stack : 1;
1605 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1607 unsigned pure_flag : 1;
1608 unsigned pointer_depth : 2;
1609 unsigned non_addressable : 1;
1610 unsigned user_align : 1;
1611 /* Three unused bits. */
1613 unsigned lang_flag_0 : 1;
1614 unsigned lang_flag_1 : 1;
1615 unsigned lang_flag_2 : 1;
1616 unsigned lang_flag_3 : 1;
1617 unsigned lang_flag_4 : 1;
1618 unsigned lang_flag_5 : 1;
1619 unsigned lang_flag_6 : 1;
1620 unsigned lang_flag_7 : 1;
1622 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1623 If built-in, this is the code for which built-in function.
1624 For other kinds of decls, this is DECL_ALIGN and DECL_OFFSET_ALIGN. */
1627 enum built_in_function f;
1628 struct {unsigned int align : 24; unsigned int off_align : 8;} a;
1631 union tree_node *size_unit;
1632 union tree_node *name;
1633 union tree_node *context;
1634 union tree_node *arguments; /* Also used for DECL_FIELD_OFFSET */
1635 union tree_node *result; /* Also used for DECL_BIT_FIELD_TYPE */
1636 union tree_node *initial; /* Also used for DECL_QUALIFIER */
1637 union tree_node *abstract_origin;
1638 union tree_node *assembler_name;
1639 union tree_node *section_name;
1640 union tree_node *machine_attributes;
1641 struct rtx_def *rtl; /* RTL representation for object. */
1642 struct rtx_def *live_range_rtl;
1644 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1645 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1646 In PARM_DECL, holds an RTL for the stack slot
1647 of register where the data was actually passed.
1648 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1656 union tree_node *vindex;
1657 HOST_WIDE_INT pointer_alias_set;
1658 /* Points to a structure whose details depend on the language in use. */
1659 struct lang_decl *lang_specific;
1662 /* Define the overall contents of a tree node.
1663 It may be any of the structures declared above
1664 for various types of node. */
1668 struct tree_common common;
1669 struct tree_int_cst int_cst;
1670 struct tree_real_cst real_cst;
1671 struct tree_string string;
1672 struct tree_complex complex;
1673 struct tree_identifier identifier;
1674 struct tree_decl decl;
1675 struct tree_type type;
1676 struct tree_list list;
1677 struct tree_vec vec;
1678 struct tree_exp exp;
1679 struct tree_block block;
1682 /* Standard named or nameless data types of the C compiler. */
1710 TI_COMPLEX_INTEGER_TYPE,
1711 TI_COMPLEX_FLOAT_TYPE,
1712 TI_COMPLEX_DOUBLE_TYPE,
1713 TI_COMPLEX_LONG_DOUBLE_TYPE,
1717 TI_LONG_DOUBLE_TYPE,
1728 extern tree global_trees[TI_MAX];
1730 #define error_mark_node global_trees[TI_ERROR_MARK]
1732 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1733 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1734 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1735 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1736 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1738 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1739 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1740 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1741 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1742 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1744 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1745 #define integer_one_node global_trees[TI_INTEGER_ONE]
1746 #define size_zero_node global_trees[TI_SIZE_ZERO]
1747 #define size_one_node global_trees[TI_SIZE_ONE]
1748 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1749 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1750 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1752 #define null_pointer_node global_trees[TI_NULL_POINTER]
1754 #define float_type_node global_trees[TI_FLOAT_TYPE]
1755 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1756 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1758 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1759 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1760 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1761 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1763 #define void_type_node global_trees[TI_VOID_TYPE]
1764 /* The C type `void *'. */
1765 #define ptr_type_node global_trees[TI_PTR_TYPE]
1766 /* The C type `const void *'. */
1767 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1768 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1769 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1771 /* An enumeration of the standard C integer types. These must be
1772 ordered so that shorter types appear before longer ones. */
1773 enum integer_type_kind
1785 itk_unsigned_long_long,
1789 typedef enum integer_type_kind integer_type_kind;
1791 /* The standard C integer types. Use integer_type_kind to index into
1793 extern tree integer_types[itk_none];
1795 #define char_type_node integer_types[itk_char]
1796 #define signed_char_type_node integer_types[itk_signed_char]
1797 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1798 #define short_integer_type_node integer_types[itk_short]
1799 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1800 #define integer_type_node integer_types[itk_int]
1801 #define unsigned_type_node integer_types[itk_unsigned_int]
1802 #define long_integer_type_node integer_types[itk_long]
1803 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1804 #define long_long_integer_type_node integer_types[itk_long_long]
1805 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1808 #define NULL_TREE (tree) NULL
1810 /* The following functions accept a wide integer argument. Rather than
1811 having to cast on every function call, we use a macro instead, that is
1812 defined here and in rtl.h. */
1815 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1816 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1818 extern int exact_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1819 extern int floor_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1821 extern char *oballoc PARAMS ((int));
1822 extern char *permalloc PARAMS ((int));
1823 extern char *savealloc PARAMS ((int));
1824 extern char *expralloc PARAMS ((int));
1826 /* Lowest level primitive for allocating a node.
1827 The TREE_CODE is the only argument. Contents are initialized
1828 to zero except for a few of the common fields. */
1830 extern tree make_node PARAMS ((enum tree_code));
1831 extern tree make_lang_type PARAMS ((enum tree_code));
1832 extern tree (*make_lang_type_fn) PARAMS ((enum tree_code));
1834 /* Make a copy of a node, with all the same contents except
1835 for TREE_PERMANENT. (The copy is permanent
1836 iff nodes being made now are permanent.) */
1838 extern tree copy_node PARAMS ((tree));
1840 /* Make a copy of a chain of TREE_LIST nodes. */
1842 extern tree copy_list PARAMS ((tree));
1844 /* Make a TREE_VEC. */
1846 extern tree make_tree_vec PARAMS ((int));
1848 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1849 The name is supplied as a char *. */
1851 extern tree get_identifier PARAMS ((const char *));
1853 /* If an identifier with the name TEXT (a null-terminated string) has
1854 previously been referred to, return that node; otherwise return
1857 extern tree maybe_get_identifier PARAMS ((const char *));
1859 /* Construct various types of nodes. */
1861 #define build_int_2(LO,HI) \
1862 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1864 extern tree build PARAMS ((enum tree_code, tree, ...));
1865 extern tree build_nt PARAMS ((enum tree_code, ...));
1866 extern tree build_parse_node PARAMS ((enum tree_code, ...));
1868 extern tree build_int_2_wide PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT));
1869 extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE));
1870 extern tree build_real_from_int_cst PARAMS ((tree, tree));
1871 extern tree build_complex PARAMS ((tree, tree, tree));
1872 extern tree build_string PARAMS ((int, const char *));
1873 extern tree build1 PARAMS ((enum tree_code, tree, tree));
1874 extern tree build_tree_list PARAMS ((tree, tree));
1875 extern tree build_decl_list PARAMS ((tree, tree));
1876 extern tree build_expr_list PARAMS ((tree, tree));
1877 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
1878 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
1879 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
1881 /* Construct various nodes representing data types. */
1883 extern tree make_signed_type PARAMS ((int));
1884 extern tree make_unsigned_type PARAMS ((int));
1885 extern void initialize_sizetypes PARAMS ((void));
1886 extern void set_sizetype PARAMS ((tree));
1887 extern tree signed_or_unsigned_type PARAMS ((int, tree));
1888 extern void fixup_unsigned_type PARAMS ((tree));
1889 extern tree build_pointer_type PARAMS ((tree));
1890 extern tree build_reference_type PARAMS ((tree));
1891 extern tree build_index_type PARAMS ((tree));
1892 extern tree build_index_2_type PARAMS ((tree, tree));
1893 extern tree build_array_type PARAMS ((tree, tree));
1894 extern tree build_function_type PARAMS ((tree, tree));
1895 extern tree build_method_type PARAMS ((tree, tree));
1896 extern tree build_offset_type PARAMS ((tree, tree));
1897 extern tree build_complex_type PARAMS ((tree));
1898 extern tree array_type_nelts PARAMS ((tree));
1900 extern tree value_member PARAMS ((tree, tree));
1901 extern tree purpose_member PARAMS ((tree, tree));
1902 extern tree binfo_member PARAMS ((tree, tree));
1903 extern unsigned int attribute_hash_list PARAMS ((tree));
1904 extern int attribute_list_equal PARAMS ((tree, tree));
1905 extern int attribute_list_contained PARAMS ((tree, tree));
1906 extern int tree_int_cst_equal PARAMS ((tree, tree));
1907 extern int tree_int_cst_lt PARAMS ((tree, tree));
1908 extern int host_integerp PARAMS ((tree, int));
1909 extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
1910 extern int tree_int_cst_msb PARAMS ((tree));
1911 extern int tree_int_cst_sgn PARAMS ((tree));
1912 extern int tree_expr_nonnegative_p PARAMS ((tree));
1913 extern int index_type_equal PARAMS ((tree, tree));
1914 extern tree get_inner_array_type PARAMS ((tree));
1916 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1917 put the prototype here. Rtl.h does declare the prototype if
1918 tree.h had been included. */
1920 extern tree make_tree PARAMS ((tree, struct rtx_def *));
1922 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1925 Such modified types already made are recorded so that duplicates
1928 extern tree build_type_attribute_variant PARAMS ((tree, tree));
1929 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
1931 extern tree merge_machine_decl_attributes PARAMS ((tree, tree));
1932 extern tree merge_machine_type_attributes PARAMS ((tree, tree));
1934 /* Split a list of declspecs and attributes into two. */
1936 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
1938 /* Strip attributes from a list of combined specs and attrs. */
1940 extern tree strip_attrs PARAMS ((tree));
1942 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1944 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
1946 /* Given a tree node and a string, return non-zero if the tree node is
1947 a valid attribute name for the string. */
1949 extern int is_attribute_p PARAMS ((const char *, tree));
1951 /* Given an attribute name and a list of attributes, return the list element
1952 of the attribute or NULL_TREE if not found. */
1954 extern tree lookup_attribute PARAMS ((const char *, tree));
1956 /* Given two attributes lists, return a list of their union. */
1958 extern tree merge_attributes PARAMS ((tree, tree));
1960 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
1961 the same kind of data as TYPE describes. Variants point to the
1962 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
1963 and it points to a chain of other variants so that duplicate
1964 variants are never made. Only main variants should ever appear as
1965 types of expressions. */
1967 extern tree build_qualified_type PARAMS ((tree, int));
1969 /* Like build_qualified_type, but only deals with the `const' and
1970 `volatile' qualifiers. This interface is retained for backwards
1971 compatiblity with the various front-ends; new code should use
1972 build_qualified_type instead. */
1974 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
1975 build_qualified_type (TYPE, \
1976 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
1977 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
1979 /* Make a copy of a type node. */
1981 extern tree build_type_copy PARAMS ((tree));
1983 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1984 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
1985 node, does nothing except for the first time. */
1987 extern void layout_type PARAMS ((tree));
1989 /* These functions allow a front-end to perform a manual layout of a
1990 RECORD_TYPE. (For instance, if the placement of subsequent fields
1991 depends on the placement of fields so far.) Begin by calling
1992 start_record_layout. Then, call place_field for each of the
1993 fields. Then, call finish_record_layout. See layout_type for the
1994 default way in which these functions are used. */
1996 typedef struct record_layout_info_s
1998 /* The RECORD_TYPE that we are laying out. */
2000 /* The offset into the record so far, in bytes, not including bits in
2003 /* The last known alignment of SIZE. */
2004 unsigned int offset_align;
2005 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2007 /* The alignment of the record so far, in bits. */
2008 unsigned int record_align;
2009 /* The alignment of the record so far, not including padding, in bits. */
2010 unsigned int unpacked_align;
2011 /* The static variables (i.e., class variables, as opposed to
2012 instance variables) encountered in T. */
2013 tree pending_statics;
2014 int packed_maybe_necessary;
2015 } *record_layout_info;
2017 extern record_layout_info start_record_layout PARAMS ((tree));
2018 extern tree bit_from_pos PARAMS ((tree, tree));
2019 extern tree byte_from_pos PARAMS ((tree, tree));
2020 extern void pos_from_byte PARAMS ((tree *, tree *, unsigned int,
2022 extern void pos_from_bit PARAMS ((tree *, tree *, unsigned int,
2024 extern void normalize_offset PARAMS ((tree *, tree *,
2026 extern tree rli_size_unit_so_far PARAMS ((record_layout_info));
2027 extern tree rli_size_so_far PARAMS ((record_layout_info));
2028 extern void normalize_rli PARAMS ((record_layout_info));
2029 extern void place_field PARAMS ((record_layout_info, tree));
2030 extern void compute_record_mode PARAMS ((tree));
2031 extern void finish_record_layout PARAMS ((record_layout_info));
2033 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2034 return a canonicalized ..._TYPE node, so that duplicates are not made.
2035 How the hash code is computed is up to the caller, as long as any two
2036 callers that could hash identical-looking type nodes agree. */
2038 extern tree type_hash_canon PARAMS ((unsigned int, tree));
2040 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2041 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2042 fields. Call this only once for any given decl node.
2044 Second argument is the boundary that this field can be assumed to
2045 be starting at (in bits). Zero means it can be assumed aligned
2046 on any boundary that may be needed. */
2048 extern void layout_decl PARAMS ((tree, unsigned));
2050 /* Return the mode for data of a given size SIZE and mode class CLASS.
2051 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2052 The value is BLKmode if no other mode is found. This is like
2053 mode_for_size, but is passed a tree. */
2055 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
2058 /* Return an expr equal to X but certainly not valid as an lvalue. */
2060 extern tree non_lvalue PARAMS ((tree));
2061 extern tree pedantic_non_lvalue PARAMS ((tree));
2063 extern tree convert PARAMS ((tree, tree));
2064 extern unsigned int expr_align PARAMS ((tree));
2065 extern tree size_in_bytes PARAMS ((tree));
2066 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
2067 extern tree bit_position PARAMS ((tree));
2068 extern HOST_WIDE_INT int_bit_position PARAMS ((tree));
2069 extern tree byte_position PARAMS ((tree));
2070 extern HOST_WIDE_INT int_byte_position PARAMS ((tree));
2072 /* Define data structures, macros, and functions for handling sizes
2073 and the various types used to represent sizes. */
2077 SIZETYPE, /* Normal representation of sizes in bytes. */
2078 SSIZETYPE, /* Signed representation of sizes in bytes. */
2079 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2080 BITSIZETYPE, /* Normal representation of sizes in bits. */
2081 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2082 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
2085 extern tree sizetype_tab[(int) TYPE_KIND_LAST];
2087 #define sizetype sizetype_tab[(int) SIZETYPE]
2088 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2089 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2090 #define usizetype sizetype_tab[(int) USIZETYPE]
2091 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2092 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2094 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
2095 extern tree size_diffop PARAMS ((tree, tree));
2096 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
2097 enum size_type_kind));
2098 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
2100 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2101 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2102 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2103 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2104 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2106 extern tree round_up PARAMS ((tree, int));
2107 extern tree round_down PARAMS ((tree, int));
2108 extern tree get_pending_sizes PARAMS ((void));
2109 extern void put_pending_sizes PARAMS ((tree));
2111 /* Type for sizes of data-type. */
2113 #define BITS_PER_UNIT_LOG \
2114 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2115 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2116 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2118 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2119 extern unsigned int maximum_field_alignment;
2121 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
2122 extern unsigned int set_alignment;
2124 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2125 by making the last node in X point to Y.
2126 Returns X, except if X is 0 returns Y. */
2128 extern tree chainon PARAMS ((tree, tree));
2130 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2132 extern tree tree_cons PARAMS ((tree, tree, tree));
2133 extern tree perm_tree_cons PARAMS ((tree, tree, tree));
2134 extern tree temp_tree_cons PARAMS ((tree, tree, tree));
2135 extern tree saveable_tree_cons PARAMS ((tree, tree, tree));
2136 extern tree decl_tree_cons PARAMS ((tree, tree, tree));
2137 extern tree expr_tree_cons PARAMS ((tree, tree, tree));
2139 /* Return the last tree node in a chain. */
2141 extern tree tree_last PARAMS ((tree));
2143 /* Reverse the order of elements in a chain, and return the new head. */
2145 extern tree nreverse PARAMS ((tree));
2147 /* Returns the length of a chain of nodes
2148 (number of chain pointers to follow before reaching a null pointer). */
2150 extern int list_length PARAMS ((tree));
2152 /* Returns the number of FIELD_DECLs in a type. */
2154 extern int fields_length PARAMS ((tree));
2156 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2158 extern int integer_zerop PARAMS ((tree));
2160 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2162 extern int integer_onep PARAMS ((tree));
2164 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2165 all of whose significant bits are 1. */
2167 extern int integer_all_onesp PARAMS ((tree));
2169 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2170 exactly one bit 1. */
2172 extern int integer_pow2p PARAMS ((tree));
2174 /* staticp (tree x) is nonzero if X is a reference to data allocated
2175 at a fixed address in memory. */
2177 extern int staticp PARAMS ((tree));
2179 /* Gets an error if argument X is not an lvalue.
2180 Also returns 1 if X is an lvalue, 0 if not. */
2182 extern int lvalue_or_else PARAMS ((tree, const char *));
2184 /* save_expr (EXP) returns an expression equivalent to EXP
2185 but it can be used multiple times within context CTX
2186 and only evaluate EXP once. */
2188 extern tree save_expr PARAMS ((tree));
2190 /* Returns the index of the first non-tree operand for CODE, or the number
2191 of operands if all are trees. */
2193 extern int first_rtl_op PARAMS ((enum tree_code));
2195 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2196 can be used multiple times and will evaluate EXP in its entirety
2199 extern tree unsave_expr PARAMS ((tree));
2201 /* Reset EXP in place so that it can be expaned again. Does not
2202 recurse into subtrees. */
2204 extern void unsave_expr_1 PARAMS ((tree));
2206 /* Like unsave_expr_1, but recurses into all subtrees. */
2208 extern tree unsave_expr_now PARAMS ((tree));
2210 /* If non-null, these are language-specific helper functions for
2211 unsave_expr_now. If present, LANG_UNSAVE is called before its
2212 argument (an UNSAVE_EXPR) is to be unsaved, and all other
2213 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
2214 called from unsave_expr_1 for language-specific tree codes. */
2215 extern void (*lang_unsave) PARAMS ((tree *));
2216 extern void (*lang_unsave_expr_now) PARAMS ((tree));
2218 /* Return 0 if it is safe to evaluate EXPR multiple times,
2219 return 1 if it is safe if EXPR is unsaved afterward, or
2220 return 2 if it is completely unsafe. */
2221 extern int unsafe_for_reeval PARAMS ((tree));
2223 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2224 or offset that depends on a field within a record.
2226 Note that we only allow such expressions within simple arithmetic
2229 extern int contains_placeholder_p PARAMS ((tree));
2231 /* Return 1 if EXP contains any expressions that produce cleanups for an
2232 outer scope to deal with. Used by fold. */
2234 extern int has_cleanups PARAMS ((tree));
2236 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2237 return a tree with all occurrences of references to F in a
2238 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2239 contains only arithmetic expressions. */
2241 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
2243 /* variable_size (EXP) is like save_expr (EXP) except that it
2244 is for the special case of something that is part of a
2245 variable size for a data type. It makes special arrangements
2246 to compute the value at the right time when the data type
2247 belongs to a function parameter. */
2249 extern tree variable_size PARAMS ((tree));
2251 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2252 but it can be used multiple times
2253 and only evaluate the subexpressions once. */
2255 extern tree stabilize_reference PARAMS ((tree));
2257 /* Subroutine of stabilize_reference; this is called for subtrees of
2258 references. Any expression with side-effects must be put in a SAVE_EXPR
2259 to ensure that it is only evaluated once. */
2261 extern tree stabilize_reference_1 PARAMS ((tree));
2263 /* Return EXP, stripped of any conversions to wider types
2264 in such a way that the result of converting to type FOR_TYPE
2265 is the same as if EXP were converted to FOR_TYPE.
2266 If FOR_TYPE is 0, it signifies EXP's type. */
2268 extern tree get_unwidened PARAMS ((tree, tree));
2270 /* Return OP or a simpler expression for a narrower value
2271 which can be sign-extended or zero-extended to give back OP.
2272 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2273 or 0 if the value should be sign-extended. */
2275 extern tree get_narrower PARAMS ((tree, int *));
2277 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2279 The definition of this resides in language-specific code
2280 as the repertoire of available types may vary. */
2282 extern tree type_for_mode PARAMS ((enum machine_mode, int));
2284 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2285 for an integer type with at least that precision.
2286 The definition of this resides in language-specific code
2287 as the repertoire of available types may vary. */
2289 extern tree type_for_size PARAMS ((unsigned, int));
2291 /* Given an integer type T, return a type like T but unsigned.
2292 If T is unsigned, the value is T.
2293 The definition of this resides in language-specific code
2294 as the repertoire of available types may vary. */
2296 extern tree unsigned_type PARAMS ((tree));
2298 /* Given an integer type T, return a type like T but signed.
2299 If T is signed, the value is T.
2300 The definition of this resides in language-specific code
2301 as the repertoire of available types may vary. */
2303 extern tree signed_type PARAMS ((tree));
2305 /* This function must be defined in the language-specific files.
2306 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2307 This is defined in a language-specific file. */
2309 extern tree maybe_build_cleanup PARAMS ((tree));
2311 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2312 look for nested component-refs or array-refs at constant positions
2313 and find the ultimate containing object, which is returned. */
2315 extern tree get_inner_reference PARAMS ((tree, HOST_WIDE_INT *,
2316 HOST_WIDE_INT *, tree *,
2317 enum machine_mode *, int *,
2318 int *, unsigned int *));
2320 /* Given a DECL or TYPE, return the scope in which it was declared, or
2321 NUL_TREE if there is no containing scope. */
2323 extern tree get_containing_scope PARAMS ((tree));
2325 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2327 extern tree decl_function_context PARAMS ((tree));
2329 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2330 this _DECL with its context, or zero if none. */
2331 extern tree decl_type_context PARAMS ((tree));
2333 /* Given the FUNCTION_DECL for the current function,
2334 return zero if it is ok for this function to be inline.
2335 Otherwise return a warning message with a single %s
2336 for the function's name. */
2338 extern const char *function_cannot_inline_p PARAMS ((tree));
2340 /* Return 1 if EXPR is the real constant zero. */
2341 extern int real_zerop PARAMS ((tree));
2343 /* Declare commonly used variables for tree structure. */
2345 /* Points to the name of the input file from which the current input
2346 being parsed originally came (before it went into cpp). */
2347 extern const char *input_filename;
2349 /* Current line number in input file. */
2352 /* Nonzero for -pedantic switch: warn about anything
2353 that standard C forbids. */
2354 extern int pedantic;
2356 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2357 Zero means allow extended lvalues. */
2359 extern int pedantic_lvalues;
2361 /* Nonzero means can safely call expand_expr now;
2362 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2364 extern int immediate_size_expand;
2366 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2368 extern tree current_function_decl;
2370 /* Nonzero means a FUNC_BEGIN label was emitted. */
2371 extern tree current_function_func_begin_label;
2373 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2375 extern int all_types_permanent;
2377 /* Pointer to function to compute the name to use to print a declaration.
2378 DECL is the declaration in question.
2379 VERBOSITY determines what information will be printed:
2380 0: DECL_NAME, demangled as necessary.
2381 1: and scope information.
2382 2: and any other information that might be interesting, such as function
2383 parameter types in C++. */
2385 extern const char *(*decl_printable_name) PARAMS ((tree, int));
2387 /* Pointer to function to finish handling an incomplete decl at the
2388 end of compilation. */
2390 extern void (*incomplete_decl_finalize_hook) PARAMS ((tree));
2392 extern const char *init_parse PARAMS ((const char *));
2393 extern void finish_parse PARAMS ((void));
2395 extern const char * const language_string;
2397 /* Declare a predefined function. Return the declaration. This function is
2398 provided by each language frontend. */
2399 extern tree builtin_function PARAMS ((const char *, tree, int,
2400 enum built_in_class,
2404 extern char *perm_calloc PARAMS ((int, long));
2405 extern tree get_file_function_name PARAMS ((int));
2406 extern tree get_file_function_name_long PARAMS ((const char *));
2407 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2408 extern tree get_set_constructor_bytes PARAMS ((tree,
2409 unsigned char *, int));
2410 extern tree get_callee_fndecl PARAMS ((tree));
2414 extern int in_control_zone_p PARAMS ((void));
2415 extern void expand_fixups PARAMS ((struct rtx_def *));
2416 extern tree expand_start_stmt_expr PARAMS ((void));
2417 extern tree expand_end_stmt_expr PARAMS ((tree));
2418 extern void expand_expr_stmt PARAMS ((tree));
2419 extern int warn_if_unused_value PARAMS ((tree));
2420 extern void expand_decl_init PARAMS ((tree));
2421 extern void clear_last_expr PARAMS ((void));
2422 extern void expand_label PARAMS ((tree));
2423 extern void expand_goto PARAMS ((tree));
2424 extern void expand_asm PARAMS ((tree));
2425 extern void expand_start_cond PARAMS ((tree, int));
2426 extern void expand_end_cond PARAMS ((void));
2427 extern void expand_start_else PARAMS ((void));
2428 extern void expand_start_elseif PARAMS ((tree));
2429 extern struct nesting *expand_start_loop PARAMS ((int));
2430 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2431 extern void expand_loop_continue_here PARAMS ((void));
2432 extern void expand_end_loop PARAMS ((void));
2433 extern int expand_continue_loop PARAMS ((struct nesting *));
2434 extern int expand_exit_loop PARAMS ((struct nesting *));
2435 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2437 extern int expand_exit_something PARAMS ((void));
2439 extern void expand_null_return PARAMS ((void));
2440 extern void expand_return PARAMS ((tree));
2441 extern int optimize_tail_recursion PARAMS ((tree, struct rtx_def *));
2442 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2443 #define expand_start_bindings(flags) \
2444 expand_start_bindings_and_block(flags, NULL_TREE)
2445 extern void expand_end_bindings PARAMS ((tree, int, int));
2446 extern void warn_about_unused_variables PARAMS ((tree));
2447 extern void start_cleanup_deferral PARAMS ((void));
2448 extern void end_cleanup_deferral PARAMS ((void));
2449 extern int is_body_block PARAMS ((tree));
2451 extern void mark_block_as_eh_region PARAMS ((void));
2452 extern void mark_block_as_not_eh_region PARAMS ((void));
2453 extern int is_eh_region PARAMS ((void));
2454 extern int conditional_context PARAMS ((void));
2455 extern tree last_cleanup_this_contour PARAMS ((void));
2456 extern int expand_dhc_cleanup PARAMS ((tree));
2457 extern int expand_dcc_cleanup PARAMS ((tree));
2458 extern void expand_start_case PARAMS ((int, tree, tree,
2460 extern void expand_end_case PARAMS ((tree));
2461 extern int pushcase PARAMS ((tree,
2462 tree (*) (tree, tree),
2464 extern int pushcase_range PARAMS ((tree, tree,
2465 tree (*) (tree, tree),
2467 extern void using_eh_for_cleanups PARAMS ((void));
2468 extern int stmt_loop_nest_empty PARAMS ((void));
2470 /* In fold-const.c */
2472 /* Fold constants as much as possible in an expression.
2473 Returns the simplified expression.
2474 Acts only on the top level of the expression;
2475 if the argument itself cannot be simplified, its
2476 subexpressions are not changed. */
2478 extern tree fold PARAMS ((tree));
2480 extern int force_fit_type PARAMS ((tree, int));
2481 extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2482 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2483 unsigned HOST_WIDE_INT *,
2485 extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2486 unsigned HOST_WIDE_INT *,
2488 extern int mul_double PARAMS ((unsigned HOST_WIDE_INT,
2490 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2491 unsigned HOST_WIDE_INT *,
2493 extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2494 HOST_WIDE_INT, unsigned int,
2495 unsigned HOST_WIDE_INT *,
2496 HOST_WIDE_INT *, int));
2497 extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2498 HOST_WIDE_INT, unsigned int,
2499 unsigned HOST_WIDE_INT *,
2500 HOST_WIDE_INT *, int));
2501 extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2502 HOST_WIDE_INT, unsigned int,
2503 unsigned HOST_WIDE_INT *,
2505 extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2506 HOST_WIDE_INT, unsigned int,
2507 unsigned HOST_WIDE_INT *,
2509 extern int operand_equal_p PARAMS ((tree, tree, int));
2510 extern tree invert_truthvalue PARAMS ((tree));
2512 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2513 function arguments and return the new type. Return NULL_TREE if no
2514 change. Required by any language that supports variadic arguments. */
2516 extern tree (*lang_type_promotes_to) PARAMS ((tree));
2518 /* Interface of the DWARF2 unwind info support. */
2520 /* Decide whether we want to emit frame unwind information for the current
2521 translation unit. */
2523 extern int dwarf2out_do_frame PARAMS ((void));
2525 /* Generate a new label for the CFI info to refer to. */
2527 extern char *dwarf2out_cfi_label PARAMS ((void));
2529 /* Entry point to update the canonical frame address (CFA). */
2531 extern void dwarf2out_def_cfa PARAMS ((const char *, unsigned, long));
2533 /* Add the CFI for saving a register window. */
2535 extern void dwarf2out_window_save PARAMS ((const char *));
2537 /* Add a CFI to update the running total of the size of arguments pushed
2540 extern void dwarf2out_args_size PARAMS ((const char *, long));
2542 /* Entry point for saving a register to the stack. */
2544 extern void dwarf2out_reg_save PARAMS ((const char *, unsigned, long));
2546 /* Entry point for saving the return address in the stack. */
2548 extern void dwarf2out_return_save PARAMS ((const char *, long));
2550 /* Entry point for saving the return address in a register. */
2552 extern void dwarf2out_return_reg PARAMS ((const char *, unsigned));
2554 /* Output a marker (i.e. a label) for the beginning of a function, before
2557 extern void dwarf2out_begin_prologue PARAMS ((void));
2559 /* Output a marker (i.e. a label) for the absolute end of the generated
2560 code for a function definition. */
2562 extern void dwarf2out_end_epilogue PARAMS ((void));
2564 /* The language front-end must define these functions. */
2566 /* Function of no arguments for initializing options. */
2567 extern void lang_init_options PARAMS ((void));
2569 /* Function of no arguments for initializing lexical scanning. */
2570 extern void init_lex PARAMS ((void));
2571 /* Function of no arguments for initializing the symbol table. */
2572 extern void init_decl_processing PARAMS ((void));
2574 /* Functions called with no arguments at the beginning and end or processing
2575 the input source file. */
2576 extern void lang_init PARAMS ((void));
2577 extern void lang_finish PARAMS ((void));
2579 /* Function to identify which front-end produced the output file. */
2580 extern const char *lang_identify PARAMS ((void));
2582 /* Called by report_error_function to print out function name.
2583 * Default may be overridden by language front-ends. */
2584 extern void (*print_error_function) PARAMS ((const char *));
2586 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2587 extern void copy_lang_decl PARAMS ((tree));
2589 /* Function called with no arguments to parse and compile the input. */
2590 extern int yyparse PARAMS ((void));
2591 /* Function called with option as argument
2592 to decode options starting with -f or -W or +.
2593 It should return nonzero if it handles the option. */
2594 extern int lang_decode_option PARAMS ((int, char **));
2596 /* Functions for processing symbol declarations. */
2597 /* Function to enter a new lexical scope.
2598 Takes one argument: always zero when called from outside the front end. */
2599 extern void pushlevel PARAMS ((int));
2600 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2601 Takes three arguments:
2602 KEEP -- nonzero if there were declarations in this scope.
2603 REVERSE -- reverse the order of decls before returning them.
2604 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2605 extern tree poplevel PARAMS ((int, int, int));
2606 /* Set the BLOCK node for the current scope level. */
2607 extern void set_block PARAMS ((tree));
2608 /* Function to add a decl to the current scope level.
2609 Takes one argument, a decl to add.
2610 Returns that decl, or, if the same symbol is already declared, may
2611 return a different decl for that name. */
2612 extern tree pushdecl PARAMS ((tree));
2613 /* Function to return the chain of decls so far in the current scope level. */
2614 extern tree getdecls PARAMS ((void));
2615 /* Function to return the chain of structure tags in the current scope level. */
2616 extern tree gettags PARAMS ((void));
2618 extern tree build_range_type PARAMS ((tree, tree, tree));
2620 /* Call when starting to parse a declaration:
2621 make expressions in the declaration last the length of the function.
2622 Returns an argument that should be passed to resume_momentary later. */
2623 extern int suspend_momentary PARAMS ((void));
2625 extern int allocation_temporary_p PARAMS ((void));
2627 /* Call when finished parsing a declaration:
2628 restore the treatment of node-allocation that was
2629 in effect before the suspension.
2630 YES should be the value previously returned by suspend_momentary. */
2631 extern void resume_momentary PARAMS ((int));
2633 /* Called after finishing a record, union or enumeral type. */
2634 extern void rest_of_type_compilation PARAMS ((tree, int));
2636 /* Save the current set of obstacks, but don't change them. */
2637 extern void push_obstacks_nochange PARAMS ((void));
2639 extern void permanent_allocation PARAMS ((int));
2640 extern void push_momentary PARAMS ((void));
2641 extern void clear_momentary PARAMS ((void));
2642 extern void pop_momentary PARAMS ((void));
2643 extern void end_temporary_allocation PARAMS ((void));
2645 /* Pop the obstack selection stack. */
2646 extern void pop_obstacks PARAMS ((void));
2649 void record_component_aliases PARAMS ((tree));
2652 extern int really_constant_p PARAMS ((tree));
2653 extern void push_obstacks PARAMS ((struct obstack *,
2655 extern void pop_momentary_nofree PARAMS ((void));
2656 extern void preserve_momentary PARAMS ((void));
2657 extern void saveable_allocation PARAMS ((void));
2658 extern void temporary_allocation PARAMS ((void));
2659 extern void resume_temporary_allocation PARAMS ((void));
2660 extern tree get_file_function_name PARAMS ((int));
2661 extern void set_identifier_size PARAMS ((int));
2662 extern int int_fits_type_p PARAMS ((tree, tree));
2663 extern int tree_log2 PARAMS ((tree));
2664 extern int tree_floor_log2 PARAMS ((tree));
2665 extern void preserve_initializer PARAMS ((void));
2666 extern void preserve_data PARAMS ((void));
2667 extern int object_permanent_p PARAMS ((tree));
2668 extern int type_precision PARAMS ((tree));
2669 extern int simple_cst_equal PARAMS ((tree, tree));
2670 extern int compare_tree_int PARAMS ((tree, unsigned int));
2671 extern int type_list_equal PARAMS ((tree, tree));
2672 extern int chain_member PARAMS ((tree, tree));
2673 extern int chain_member_purpose PARAMS ((tree, tree));
2674 extern int chain_member_value PARAMS ((tree, tree));
2675 extern tree listify PARAMS ((tree));
2676 extern tree type_hash_lookup PARAMS ((unsigned int, tree));
2677 extern void type_hash_add PARAMS ((unsigned int, tree));
2678 extern unsigned int type_hash_list PARAMS ((tree));
2679 extern int simple_cst_list_equal PARAMS ((tree, tree));
2680 extern void debug_obstack PARAMS ((char *));
2681 extern void rtl_in_current_obstack PARAMS ((void));
2682 extern void rtl_in_saveable_obstack PARAMS ((void));
2683 extern void init_tree_codes PARAMS ((void));
2684 extern void dump_tree_statistics PARAMS ((void));
2685 extern void print_obstack_statistics PARAMS ((const char *,
2688 extern void print_obstack_name PARAMS ((char *, FILE *,
2691 extern void expand_function_end PARAMS ((const char *, int, int));
2692 extern void expand_function_start PARAMS ((tree, int));
2694 extern int real_onep PARAMS ((tree));
2695 extern int real_twop PARAMS ((tree));
2696 extern void start_identifier_warnings PARAMS ((void));
2697 extern void gcc_obstack_init PARAMS ((struct obstack *));
2698 extern void init_obstacks PARAMS ((void));
2699 extern void obfree PARAMS ((char *));
2700 extern void build_common_tree_nodes PARAMS ((int));
2701 extern void build_common_tree_nodes_2 PARAMS ((int));
2704 extern void setjmp_protect_args PARAMS ((void));
2705 extern void setjmp_protect PARAMS ((tree));
2706 extern void expand_main_function PARAMS ((void));
2707 extern void mark_varargs PARAMS ((void));
2708 extern void init_dummy_function_start PARAMS ((void));
2709 extern void expand_dummy_function_end PARAMS ((void));
2710 extern void init_function_for_compilation PARAMS ((void));
2711 extern void init_function_start PARAMS ((tree, const char *, int));
2712 extern void assign_parms PARAMS ((tree));
2713 extern void put_var_into_stack PARAMS ((tree));
2714 extern void flush_addressof PARAMS ((tree));
2715 extern void uninitialized_vars_warning PARAMS ((tree));
2716 extern void setjmp_args_warning PARAMS ((void));
2717 extern void mark_all_temps_used PARAMS ((void));
2718 extern void init_temp_slots PARAMS ((void));
2719 extern void combine_temp_slots PARAMS ((void));
2720 extern void free_temp_slots PARAMS ((void));
2721 extern void pop_temp_slots PARAMS ((void));
2722 extern void push_temp_slots PARAMS ((void));
2723 extern void preserve_temp_slots PARAMS ((struct rtx_def *));
2724 extern void preserve_rtl_expr_temps PARAMS ((tree));
2725 extern int aggregate_value_p PARAMS ((tree));
2726 extern void free_temps_for_rtl_expr PARAMS ((tree));
2727 extern void instantiate_virtual_regs PARAMS ((tree, struct rtx_def *));
2728 extern void unshare_all_rtl PARAMS ((tree, struct rtx_def *));
2729 extern int max_parm_reg_num PARAMS ((void));
2730 extern void push_function_context PARAMS ((void));
2731 extern void pop_function_context PARAMS ((void));
2732 extern void push_function_context_to PARAMS ((tree));
2733 extern void pop_function_context_from PARAMS ((tree));
2735 /* In print-rtl.c */
2737 extern void print_rtl PARAMS ((FILE *, struct rtx_def *));
2740 /* In print-tree.c */
2741 extern void debug_tree PARAMS ((tree));
2743 extern void print_node PARAMS ((FILE *, const char *, tree,
2745 extern void print_node_brief PARAMS ((FILE *, const char *, tree,
2747 extern void indent_to PARAMS ((FILE *, int));
2751 extern void emit_queue PARAMS ((void));
2752 extern int apply_args_register_offset PARAMS ((int));
2753 extern struct rtx_def *expand_builtin_return_addr
2754 PARAMS ((enum built_in_function, int, struct rtx_def *));
2755 extern void do_pending_stack_adjust PARAMS ((void));
2756 extern struct rtx_def *expand_assignment PARAMS ((tree, tree, int,
2758 extern struct rtx_def *store_expr PARAMS ((tree,
2761 extern void check_max_integer_computation_mode PARAMS ((tree));
2764 extern void start_sequence_for_rtl_expr PARAMS ((tree));
2765 extern struct rtx_def *emit_line_note_after PARAMS ((const char *, int,
2767 extern struct rtx_def *emit_line_note PARAMS ((const char *, int));
2768 extern struct rtx_def *emit_line_note_force PARAMS ((const char *, int));
2772 extern int setjmp_call_p PARAMS ((tree));
2776 extern int mark_addressable PARAMS ((tree));
2777 extern void incomplete_type_error PARAMS ((tree, tree));
2778 extern void print_lang_statistics PARAMS ((void));
2779 extern tree truthvalue_conversion PARAMS ((tree));
2780 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2782 extern void print_lang_decl PARAMS ((FILE *, tree, int));
2783 extern void print_lang_type PARAMS ((FILE *, tree, int));
2784 extern void print_lang_identifier PARAMS ((FILE *, tree, int));
2786 extern int global_bindings_p PARAMS ((void));
2787 extern void insert_block PARAMS ((tree));
2789 /* In integrate.c */
2790 extern void save_for_inline_nocopy PARAMS ((tree));
2791 extern void save_for_inline_copying PARAMS ((tree));
2792 extern void set_decl_abstract_flags PARAMS ((tree, int));
2793 extern void output_inline_function PARAMS ((tree));
2794 extern void set_decl_origin_self PARAMS ((tree));
2797 extern void set_yydebug PARAMS ((int));
2799 /* In stor-layout.c */
2800 extern void fixup_signed_type PARAMS ((tree));
2803 extern void make_decl_rtl PARAMS ((tree, const char *, int));
2804 extern void make_decl_one_only PARAMS ((tree));
2805 extern int supports_one_only PARAMS ((void));
2806 extern void variable_section PARAMS ((tree, int));
2808 /* In fold-const.c */
2809 extern int div_and_round_double PARAMS ((enum tree_code, int,
2810 unsigned HOST_WIDE_INT,
2812 unsigned HOST_WIDE_INT,
2814 unsigned HOST_WIDE_INT *,
2816 unsigned HOST_WIDE_INT *,
2820 extern void emit_nop PARAMS ((void));
2821 extern void expand_computed_goto PARAMS ((tree));
2822 extern struct rtx_def *label_rtx PARAMS ((tree));
2823 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
2824 const char *, int));
2825 extern int any_pending_cleanups PARAMS ((int));
2826 extern void init_stmt PARAMS ((void));
2827 extern void init_stmt_for_function PARAMS ((void));
2828 extern int drop_through_at_end_p PARAMS ((void));
2829 extern void expand_start_target_temps PARAMS ((void));
2830 extern void expand_end_target_temps PARAMS ((void));
2831 extern void expand_elseif PARAMS ((tree));
2832 extern void expand_decl PARAMS ((tree));
2833 extern int expand_decl_cleanup PARAMS ((tree, tree));
2834 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
2835 extern void move_cleanups_up PARAMS ((void));
2836 extern void expand_start_case_dummy PARAMS ((void));
2837 extern void expand_end_case_dummy PARAMS ((void));
2838 extern tree case_index_expr_type PARAMS ((void));
2839 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
2840 extern void check_for_full_enumeration_handling PARAMS ((tree));
2841 extern void declare_nonlocal_label PARAMS ((tree));
2843 extern void lang_print_xnode PARAMS ((FILE *, tree, int));
2847 /* If KIND=='I', return a suitable global initializer (constructor) name.
2848 If KIND=='D', return a suitable global clean-up (destructor) name. */
2849 extern tree get_file_function_name PARAMS ((int));
2851 /* Interface of the DWARF2 unwind info support. */
2853 /* Decide whether we want to emit frame unwind information for the current
2854 translation unit. */
2856 extern int dwarf2out_do_frame PARAMS ((void));
2858 /* Generate a new label for the CFI info to refer to. */
2860 extern char *dwarf2out_cfi_label PARAMS ((void));
2862 /* Entry point to update the canonical frame address (CFA). */
2864 extern void dwarf2out_def_cfa PARAMS ((const char *, unsigned, long));
2866 /* Add the CFI for saving a register window. */
2868 extern void dwarf2out_window_save PARAMS ((const char *));
2870 /* Add a CFI to update the running total of the size of arguments pushed
2873 extern void dwarf2out_args_size PARAMS ((const char *, long));
2875 /* Entry point for saving a register to the stack. */
2877 extern void dwarf2out_reg_save PARAMS ((const char *, unsigned, long));
2879 /* Entry point for saving the return address in the stack. */
2881 extern void dwarf2out_return_save PARAMS ((const char *, long));
2883 /* Entry point for saving the return address in a register. */
2885 extern void dwarf2out_return_reg PARAMS ((const char *, unsigned));
2887 /* Output a marker (i.e. a label) for the beginning of a function, before
2890 extern void dwarf2out_begin_prologue PARAMS ((void));
2892 /* Output a marker (i.e. a label) for the absolute end of the generated
2893 code for a function definition. */
2895 extern void dwarf2out_end_epilogue PARAMS ((void));
2897 /* Redefine abort to report an internal error w/o coredump, and
2898 reporting the location of the error in the source file. This logic
2899 is duplicated in rtl.h and tree.h because every file that needs the
2900 special abort includes one or both. toplev.h gets too few files,
2901 system.h gets too many. */
2903 extern void fancy_abort PARAMS ((const char *, int, const char *))
2905 #if (GCC_VERSION >= 2007)
2906 #define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__)
2908 #define abort() fancy_abort (__FILE__, __LINE__, 0)