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(ENUM, N, C, T, LT, B, F, NA) ENUM,
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 /* An array of _DECL trees for the above. */
101 extern union tree_node
*built_in_decls
[(int) END_BUILTINS
];
103 /* The definition of tree nodes fills the next several pages. */
105 /* A tree node can represent a data type, a variable, an expression
106 or a statement. Each node has a TREE_CODE which says what kind of
107 thing it represents. Some common codes are:
108 INTEGER_TYPE -- represents a type of integers.
109 ARRAY_TYPE -- represents a type of pointer.
110 VAR_DECL -- represents a declared variable.
111 INTEGER_CST -- represents a constant integer value.
112 PLUS_EXPR -- represents a sum (an expression).
114 As for the contents of a tree node: there are some fields
115 that all nodes share. Each TREE_CODE has various special-purpose
116 fields as well. The fields of a node are never accessed directly,
117 always through accessor macros. */
119 /* This type is used everywhere to refer to a tree node. */
121 typedef union tree_node
*tree
;
123 /* Every kind of tree node starts with this structure,
124 so all nodes have these fields.
126 See the accessor macros, defined below, for documentation of the
131 union tree_node
*chain
;
132 union tree_node
*type
;
133 ENUM_BITFIELD(tree_code
) code
: 8;
134 unsigned side_effects_flag
: 1;
135 unsigned constant_flag
: 1;
136 unsigned addressable_flag
: 1;
137 unsigned volatile_flag
: 1;
138 unsigned readonly_flag
: 1;
139 unsigned unsigned_flag
: 1;
140 unsigned asm_written_flag
: 1;
142 unsigned used_flag
: 1;
143 unsigned nothrow_flag
: 1;
144 unsigned static_flag
: 1;
145 unsigned public_flag
: 1;
146 unsigned private_flag
: 1;
147 unsigned protected_flag
: 1;
148 unsigned bounded_flag
: 1;
150 unsigned lang_flag_0
: 1;
151 unsigned lang_flag_1
: 1;
152 unsigned lang_flag_2
: 1;
153 unsigned lang_flag_3
: 1;
154 unsigned lang_flag_4
: 1;
155 unsigned lang_flag_5
: 1;
156 unsigned lang_flag_6
: 1;
157 /* This flag is presently unused. However, language front-ends
158 should not make use of this flag; it is reserved for future
163 /* The following table lists the uses of each of the above flags and
164 for which types of nodes they are defined. Note that expressions
170 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
171 ..._TYPE, IDENTIFIER_NODE
176 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
177 TREE_NO_UNUSED_WARNING in
178 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
180 TREE_LIST or TREE_VEC
181 TREE_CONSTANT_OVERFLOW in
182 INTEGER_CST, REAL_CST, COMPLEX_CST
183 TREE_SYMBOL_REFERENCED in
189 INTEGER_CST, REAL_CST, COMPLEX_CST
191 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
193 TREE_LIST or TREE_VEC
194 EXPR_WFL_EMIT_LINE_NOTE in
195 EXPR_WITH_FILE_LOCATION
200 TREE_LIST or TREE_VEC
202 ??? unspecified nodes
206 TREE_VIA_PROTECTED in
210 ??? unspecified nodes
219 TREE_THIS_VOLATILE in
239 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
240 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,
270 /* Define accessors for the fields that all tree nodes have
271 (though some fields are not used for all kinds of nodes). */
273 /* The tree-code says what kind of node it is.
274 Codes are defined in tree.def. */
275 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
276 #define TREE_SET_CODE(NODE, VALUE) \
277 ((NODE)->common.code = (ENUM_BITFIELD(tree_code)) (VALUE))
279 /* When checking is enabled, errors will be generated if a tree node
280 is accessed incorrectly. The macros abort with a fatal error. */
281 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
283 #define TREE_CHECK(t, code) __extension__ \
284 ({ const tree __t = t; \
285 if (TREE_CODE(__t) != (code)) \
286 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
288 #define TREE_CLASS_CHECK(t, class) __extension__ \
289 ({ const tree __t = t; \
290 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
291 tree_class_check_failed (__t, class, __FILE__, __LINE__, __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__, __LINE__, __FUNCTION__); \
301 #define EXPR_CHECK(t) __extension__ \
302 ({ const tree __t = t; \
303 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
304 if (__c != 'r' && __c != 's' && __c != '<' \
305 && __c != '1' && __c != '2' && __c != 'e') \
306 tree_class_check_failed(__t, 'e', __FILE__, __LINE__, __FUNCTION__); \
309 extern void tree_check_failed
PARAMS ((const tree
, enum tree_code
,
310 const char *, int, const char *))
312 extern void tree_class_check_failed
PARAMS ((const tree
, int,
313 const char *, int, const char *))
316 #else /* not ENABLE_TREE_CHECKING, or not gcc */
318 #define TREE_CHECK(t, code) (t)
319 #define TREE_CLASS_CHECK(t, code) (t)
320 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
321 #define EXPR_CHECK(t) (t)
325 #include "tree-check.h"
327 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
328 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
329 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
331 /* In all nodes that are expressions, this is the data type of the expression.
332 In POINTER_TYPE nodes, this is the type that the pointer points to.
333 In ARRAY_TYPE nodes, this is the type of the elements.
334 In VECTOR_TYPE nodes, this is the type of the elements. */
335 #define TREE_TYPE(NODE) ((NODE)->common.type)
337 /* Nodes are chained together for many purposes.
338 Types are chained together to record them for being output to the debugger
339 (see the function `chain_type').
340 Decls in the same scope are chained together to record the contents
342 Statement nodes for successive statements used to be chained together.
343 Often lists of things are represented by TREE_LIST nodes that
344 are chained together. */
346 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
348 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
349 that don't change the machine mode. */
351 #define STRIP_NOPS(EXP) \
352 while ((TREE_CODE (EXP) == NOP_EXPR \
353 || TREE_CODE (EXP) == CONVERT_EXPR \
354 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
355 && TREE_OPERAND (EXP, 0) != error_mark_node \
356 && (TYPE_MODE (TREE_TYPE (EXP)) \
357 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
358 (EXP) = TREE_OPERAND (EXP, 0);
360 /* Like STRIP_NOPS, but don't let the signedness change either. */
362 #define STRIP_SIGN_NOPS(EXP) \
363 while ((TREE_CODE (EXP) == NOP_EXPR \
364 || TREE_CODE (EXP) == CONVERT_EXPR \
365 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
366 && TREE_OPERAND (EXP, 0) != error_mark_node \
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_OPERAND (EXP, 0) != error_mark_node \
380 && (TREE_TYPE (EXP) \
381 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
382 (EXP) = TREE_OPERAND (EXP, 0);
384 /* Nonzero if TYPE represents an integral type. Note that we do not
385 include COMPLEX types here. */
387 #define INTEGRAL_TYPE_P(TYPE) \
388 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
389 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
391 /* Nonzero if TYPE represents a floating-point type, including complex
392 floating-point types. */
394 #define FLOAT_TYPE_P(TYPE) \
395 (TREE_CODE (TYPE) == REAL_TYPE \
396 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
397 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
399 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
401 #define AGGREGATE_TYPE_P(TYPE) \
402 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
403 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
404 || TREE_CODE (TYPE) == SET_TYPE)
406 /* Nonzero if TYPE represents an unbounded pointer or unbounded
407 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
409 #define POINTER_TYPE_P(TYPE) \
410 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
412 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
414 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
415 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
417 /* Nonzero if TYPE represents a bounded pointer type. */
419 #define BOUNDED_POINTER_TYPE_P(TYPE) \
420 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
421 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
423 /* Nonzero if TYPE represents a bounded reference type. Bounded
424 reference types have two specific uses: (1) When a reference is
425 seated to a variable-length RECORD_TYPE that has an array of
426 indeterminate length as its final field. For all other objects, it
427 is sufficient to check bounds at the time the reference is seated,
428 and assume that all future uses of the reference are safe, since
429 the address of references cannot change. (2) When a reference
430 supertype is seated to an subtype object. The bounds "remember"
431 the true size of the complete object, so that subsequent upcasts of
432 the address of the reference will be checked properly (is such a
433 thing valid C++?). */
435 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
436 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
437 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
439 /* Nonzero if TYPE represents a pointer or reference type, either
440 bounded or unbounded. */
442 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
443 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
445 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
447 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
448 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
450 /* Nonzero if TYPE represents a reference type, either bounded or unbounded. */
452 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
453 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
455 /* Nonzero if this type is a complete type. */
456 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
458 /* Nonzero if this type is the (possibly qualified) void type. */
459 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
461 /* Nonzero if this type is complete or is cv void. */
462 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
463 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
465 /* Nonzero if this type is complete or is an array with unspecified bound. */
466 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
467 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE))
469 /* Nonzero if TYPE represents a type. */
471 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
473 /* Define many boolean fields that all tree nodes have. */
475 /* In VAR_DECL nodes, nonzero means address of this is needed.
476 So it cannot be in a register.
477 In a FUNCTION_DECL, nonzero means its address is needed.
478 So it must be compiled even if it is an inline function.
479 In a FIELD_DECL node, it means that the programmer is permitted to
480 construct the address of this field. This is used for aliasing
481 purposes: see record_component_aliases.
482 In CONSTRUCTOR nodes, it means object constructed must be in memory.
483 In LABEL_DECL nodes, it means a goto for this label has been seen
484 from a place outside all binding contours that restore stack levels.
485 In ..._TYPE nodes, it means that objects of this type must
486 be fully addressable. This means that pieces of this
487 object cannot go into register parameters, for example.
488 In IDENTIFIER_NODEs, this means that some extern decl for this name
489 had its address taken. That matters for inline functions. */
490 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
492 /* In a VAR_DECL, nonzero means allocate static storage.
493 In a FUNCTION_DECL, nonzero if function has been defined.
494 In a CONSTRUCTOR, nonzero means allocate static storage. */
495 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
497 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
498 made implicitly and should not lead to an "unused value" warning. */
499 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
501 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
502 chain is via a `virtual' declaration. */
503 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
505 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
506 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
507 requires a diagnostic when overflows occur in constant expressions. */
508 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
510 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
511 this string as an argument. */
512 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
514 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
515 overflow in folding, and no warning has been issued for this subexpression.
516 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
517 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
519 /* In a VAR_DECL or FUNCTION_DECL,
520 nonzero means name is to be accessible from outside this module.
521 In an IDENTIFIER_NODE, nonzero means an external declaration
522 accessible from outside this module was previously seen
523 for this name in an inner scope. */
524 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
526 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
527 base class is via a `public' declaration, which preserves public
528 fields from the base class as public. */
529 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
531 /* Ditto, for `private' declarations. */
532 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
534 /* Nonzero for TREE_LIST node means that the path to the
535 base class is via a `protected' declaration, which preserves
536 protected fields from the base class as protected.
538 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
540 /* In any expression, nonzero means it has side effects or reevaluation
541 of the whole expression could produce a different value.
542 This is set if any subexpression is a function call, a side effect
543 or a reference to a volatile variable.
544 In a ..._DECL, this is set only if the declaration said `volatile'. */
545 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
547 /* Nonzero means this expression is volatile in the C sense:
548 its address should be of type `volatile WHATEVER *'.
549 In other words, the declared item is volatile qualified.
550 This is used in _DECL nodes and _REF nodes.
552 In a ..._TYPE node, means this type is volatile-qualified.
553 But use TYPE_VOLATILE instead of this macro when the node is a type,
554 because eventually we may make that a different bit.
556 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
557 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
559 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
560 nonzero means it may not be the lhs of an assignment.
561 In a ..._TYPE node, means this type is const-qualified
562 (but the macro TYPE_READONLY should be used instead of this macro
563 when the node is a type). */
564 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
566 /* Value of expression is constant.
567 Always appears in all ..._CST nodes.
568 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
569 if the value is constant. */
570 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
572 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
573 In FIELD_DECL nodes, means an unsigned bit field.
574 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
575 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
577 #define TYPE_TRAP_SIGNED(NODE) (flag_trapv && ! TREE_UNSIGNED (NODE))
579 /* Nonzero in a VAR_DECL means assembler code has been written.
580 Nonzero in a FUNCTION_DECL means that the function has been compiled.
581 This is interesting in an inline function, since it might not need
582 to be compiled separately.
583 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
584 if the sdb debugging info for the type has been written.
585 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
586 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
588 /* Nonzero in a _DECL if the name is used in its scope.
589 Nonzero in an expr node means inhibit warning if value is unused.
590 In IDENTIFIER_NODEs, this means that some extern decl for this name
592 #define TREE_USED(NODE) ((NODE)->common.used_flag)
594 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
595 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
596 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
598 /* Used in classes in C++. */
599 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
600 /* Used in classes in C++.
601 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
602 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
604 /* In a ..._TYPE node, nonzero means that the type's size and layout,
605 (or the size and layout of its arguments and/or return value in the
606 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
607 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
608 node is a type, because eventually we may make that a different
609 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
610 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
611 BOUNDED_INDIRECT_TYPE_P to test for that.
613 In a FUNCTION_DECL, nonzero means that the size and layout of one
614 of its arguments and/or return value was changed by the presence of
615 pointer bounds. This value can differ from the value of
616 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
617 declared, then later called with pointer args, or was declared with
618 a variable argument list and is later called with pointer values in
619 the variable argument list.
621 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
622 of the decl's type's BOUNDED_POINTER_TYPE_P.
624 In a CONSTRUCTOR or other expression, nonzero means the value is a
625 bounded pointer. It is insufficient to determine the boundedness
626 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
627 since we allow pointer to be temporarily cast to integer for
628 rounding up to an alignment boudary in a way that preserves the
631 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
632 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
633 of a function that has bounded pointer(s) for its return type and/or
636 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
638 /* These flags are available for each language front end to use internally. */
639 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
640 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
641 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
642 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
643 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
644 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
645 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
647 /* Define additional fields and accessors for nodes representing constants. */
649 /* In an INTEGER_CST node. These two together make a 2-word integer.
650 If the data type is signed, the value is sign-extended to 2 words
651 even though not all of them may really be in use.
652 In an unsigned constant shorter than 2 words, the extra bits are 0. */
653 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
654 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
655 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
657 #define INT_CST_LT(A, B) \
658 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
659 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
660 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
662 #define INT_CST_LT_UNSIGNED(A, B) \
663 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
664 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
665 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
666 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
667 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
671 struct tree_common common
;
672 struct rtx_def
*rtl
; /* acts as link to register transfer language
674 /* A sub-struct is necessary here because the function `const_hash'
675 wants to scan both words as a unit and taking the address of the
676 sub-struct yields the properly inclusive bounded pointer. */
678 unsigned HOST_WIDE_INT low
;
683 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
684 and generally in all kinds of constants that could
685 be given labels (rather than being immediate). */
687 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
689 /* In a REAL_CST node. */
690 /* We can represent a real value as either a `double' or a string.
691 Strings don't allow for any optimization, but they do allow
692 for cross-compilation. */
694 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
700 struct tree_common common
;
701 struct rtx_def
*rtl
; /* acts as link to register transfer language
703 REAL_VALUE_TYPE real_cst
;
706 /* In a STRING_CST */
707 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
708 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
712 struct tree_common common
;
713 struct rtx_def
*rtl
; /* acts as link to register transfer language
719 /* In a COMPLEX_CST node. */
720 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
721 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
725 struct tree_common common
;
726 struct rtx_def
*rtl
; /* acts as link to register transfer language
728 union tree_node
*real
;
729 union tree_node
*imag
;
732 #include "hashtable.h"
734 /* Define fields and accessors for some special-purpose tree nodes. */
736 #define IDENTIFIER_LENGTH(NODE) \
737 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
738 #define IDENTIFIER_POINTER(NODE) \
739 ((char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
741 /* Translate a hash table identifier pointer to a tree_identifier
742 pointer, and vice versa. */
744 #define HT_IDENT_TO_GCC_IDENT(NODE) \
745 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
746 #define GCC_IDENT_TO_HT_IDENT(NODE) \
747 (&((struct tree_identifier *) (NODE))->id)
749 struct tree_identifier
751 struct tree_common common
;
752 struct ht_identifier id
;
755 /* In a TREE_LIST node. */
756 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
757 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
761 struct tree_common common
;
762 union tree_node
*purpose
;
763 union tree_node
*value
;
766 /* In a TREE_VEC node. */
767 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
768 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
769 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
773 struct tree_common common
;
775 union tree_node
*a
[1];
778 /* Define fields and accessors for some nodes that represent expressions. */
780 /* In a SAVE_EXPR node. */
781 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
782 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
783 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
784 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
785 both in normal code and in a handler. (Normally, in a handler, all
786 SAVE_EXPRs are unsaved, meaning that there values are
788 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
790 /* In a RTL_EXPR node. */
791 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
792 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
794 /* In a CONSTRUCTOR node. */
795 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
797 /* In ordinary expression nodes. */
798 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
799 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
801 /* In a LABELED_BLOCK_EXPR node. */
802 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
803 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
805 /* In a EXIT_BLOCK_EXPR node. */
806 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
807 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
809 /* In a LOOP_EXPR node. */
810 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
812 /* In a EXPR_WITH_FILE_LOCATION node. */
813 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
814 #define EXPR_WFL_FILENAME(NODE) \
815 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
816 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
817 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
818 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
819 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
820 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
821 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
822 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
826 struct tree_common common
;
828 union tree_node
*operands
[1];
831 /* In a BLOCK node. */
832 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
833 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
834 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
835 /* Note: when changing this, make sure to find the places
836 that use chainon or nreverse. */
837 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
838 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
839 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
841 /* Nonzero means that this block is prepared to handle exceptions
842 listed in the BLOCK_VARS slot. */
843 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
845 /* An index number for this block. These values are not guaranteed to
846 be unique across functions -- whether or not they are depends on
847 the debugging output format in use. */
848 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
852 struct tree_common common
;
854 unsigned handler_block_flag
: 1;
855 unsigned abstract_flag
: 1;
856 unsigned block_num
: 30;
858 union tree_node
*vars
;
859 union tree_node
*subblocks
;
860 union tree_node
*supercontext
;
861 union tree_node
*abstract_origin
;
864 /* Define fields and accessors for nodes representing data types. */
866 /* See tree.def for documentation of the use of these fields.
867 Look at the documentation of the various ..._TYPE tree codes. */
869 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
870 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
871 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
872 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
873 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
874 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
875 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
876 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
877 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
878 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
879 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
880 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
881 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
882 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
883 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
884 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
885 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
886 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
887 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
888 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
889 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
890 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
891 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
892 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
893 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
895 /* For a VECTOR_TYPE node, this describes a different type which is emitted
896 in the debugging output. We use this to describe a vector as a
897 structure containing an array. */
898 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
900 /* Indirect types present difficulties because they may be represented
901 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
902 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
903 be logically equivalent, but physically different. Simple
904 comparison of the main variant only tells if the types are
905 logically equivalent. Use this predicate to compare for physical
908 /* Types have the same main variant, and have the same boundedness. */
909 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
910 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
911 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
913 /* Return the type variant that has no qualifiers (i.e., the main variant),
914 except that the boundedness qualifier is preserved. */
915 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
916 (BOUNDED_POINTER_TYPE_P (TYPE) \
917 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
918 : TYPE_MAIN_VARIANT (TYPE))
920 /* For aggregate types, information about this type, as a base type
921 for itself. Used in a language-dependent way for types that are
922 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
923 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
925 /* The (language-specific) typed-based alias set for this type.
926 Objects whose TYPE_ALIAS_SETs are different cannot alias each
927 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
928 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
929 type can alias objects of any type. */
930 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
932 /* Nonzero iff the typed-based alias set for this type has been
934 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
935 (TYPE_CHECK (NODE)->type.alias_set != -1)
937 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
939 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
941 /* The alignment necessary for objects of this type.
942 The value is an int, measured in bits. */
943 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
945 /* 1 if the alignment for this type was requested by "aligned" attribute,
946 0 if it is the default for this type. */
947 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
949 /* The alignment for NODE, in bytes. */
950 #define TYPE_ALIGN_UNIT(NODE) \
951 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
953 /* If your language allows you to declare types, and you want debug info
954 for them, then you need to generate corresponding TYPE_DECL nodes.
955 These "stub" TYPE_DECL nodes have no name, and simply point at the
956 type node. You then set the TYPE_STUB_DECL field of the type node
957 to point back at the TYPE_DECL node. This allows the debug routines
958 to know that the two nodes represent the same type, so that we only
959 get one debug info record for them. */
960 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
962 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
963 has BLKmode only because it lacks the alignment requirement for
965 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
967 /* In an INTEGER_TYPE, it means the type represents a size. We use
968 this both for validity checking and to permit optimizations that
969 are unsafe for other types. Note that the C `size_t' type should
970 *not* have this flag set. The `size_t' type is simply a typedef
971 for an ordinary integer type that happens to be the type of an
972 expression returned by `sizeof'; `size_t' has no special
973 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
974 always actual sizes. */
975 #define TYPE_IS_SIZETYPE(NODE) \
976 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
978 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
979 pointer depressed. */
980 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
981 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
983 /* Nonzero in a type considered volatile as a whole. */
984 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
986 /* Means this type is const-qualified. */
987 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
989 /* If nonzero, this type is `restrict'-qualified, in the C sense of
991 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
993 /* If nonzero, this type's size and layout, (or the size and layout of
994 its arguments and/or return value in the case of a FUNCTION_TYPE or
995 METHOD_TYPE) was changed by the presence of pointer bounds. */
996 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
998 /* There is a TYPE_QUAL value for each type qualifier. They can be
999 combined by bitwise-or to form the complete set of qualifiers for a
1002 #define TYPE_UNQUALIFIED 0x0
1003 #define TYPE_QUAL_CONST 0x1
1004 #define TYPE_QUAL_VOLATILE 0x2
1005 #define TYPE_QUAL_RESTRICT 0x4
1006 #define TYPE_QUAL_BOUNDED 0x8
1008 /* The set of type qualifiers for this type. */
1009 #define TYPE_QUALS(NODE) \
1010 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1011 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1012 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1013 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1015 /* The set of qualifiers pertinent to an expression node. */
1016 #define TREE_EXPR_QUALS(NODE) \
1017 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1018 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1019 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1021 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1022 #define TREE_FUNC_QUALS(NODE) \
1023 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1024 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1026 /* These flags are available for each language front end to use internally. */
1027 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1028 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1029 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1030 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1031 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1032 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1033 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1035 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1036 that distinguish string from array of char).
1037 If set in a SET_TYPE, indicates a bitstring type. */
1038 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1040 /* If non-NULL, this is a upper bound of the size (in bytes) of an
1041 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
1042 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
1044 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1045 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) (GET_MODE_NUNITS (TYPE_CHECK (VECTOR_TYPE)->type.mode))
1047 /* Indicates that objects of this type must be initialized by calling a
1048 function when they are created. */
1049 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1050 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1052 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1053 the same way that the first union alternative would be passed. */
1054 #define TYPE_TRANSPARENT_UNION(NODE) \
1055 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1057 /* For an ARRAY_TYPE, indicates that it is not permitted to
1058 take the address of a component of the type. */
1059 #define TYPE_NONALIASED_COMPONENT(NODE) \
1060 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1062 /* Indicated that objects of this type should be laid out in as
1063 compact a way as possible. */
1064 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1066 /* A bounded pointer or bounded reference type (collectively called
1067 indirect types) is represented as a RECORD_TYPE node containing
1068 three pointer fields whose type is the corresponding unbounded
1069 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1070 a bounded indirect type differs from a normal RECORD_TYPE node in
1071 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1072 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1073 nodes are stored on the same type variant chain alongside the
1074 variants of the underlaying indirect types nodes. The main variant
1075 of such chains is always the unbounded type. */
1077 /* Access the field decls of a bounded-pointer type. */
1078 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1079 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1080 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1082 /* Access the simple-pointer subtype of a bounded-pointer type. */
1083 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1085 /* Find the unbounded counterpart to a type, or return TYPE if it is
1086 already unbounded. */
1087 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1088 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1090 /* This field comprises two bits, for values in the range 0..3:
1092 depth=0 means that type is a scalar, or an aggregate that contains
1093 only depth=0 types, or a function that has only depth=0 types for
1094 its return value and argument types.
1096 depth=1 means that type is a pointer to a depth=0 type, or an
1097 aggregate that contains only depth=0 and depth=1 types, or a
1098 function that has only depth=0 and depth=1 types for its return
1099 value and argument types.
1101 The meanings of depth=2 and depth=3 are obvious by induction.
1102 Varargs functions are depth=3. The type `va_list' is depth=3.
1104 The purpose of measuring pointer depth of a type is to determine
1105 the eligibility of a function for an automatically-generated
1106 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1107 depth=1 function is eligible for an automatic thunk. Functions
1108 with depth 2 or more are too complex to get automatic thunks.
1110 Function decls also have a pointer_depth field, since we also
1111 consider the actual argument types for functions. */
1113 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1115 /* In a FUNCTION_TYPE node, this bit stores the value of
1116 default_pointer_boundedness at the time TYPE was created. It is
1117 useful for choosing default boundedness of function arguments for
1118 non-prototype function decls and for varargs/stdarg lists. */
1119 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1120 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1122 #define MAX_POINTER_DEPTH 2
1123 #define VA_LIST_POINTER_DEPTH 3
1127 struct tree_common common
;
1128 union tree_node
*values
;
1129 union tree_node
*size
;
1130 union tree_node
*size_unit
;
1131 union tree_node
*attributes
;
1134 unsigned int precision
: 9;
1135 ENUM_BITFIELD(machine_mode
) mode
: 7;
1137 unsigned string_flag
: 1;
1138 unsigned no_force_blk_flag
: 1;
1139 unsigned needs_constructing_flag
: 1;
1140 unsigned transparent_union_flag
: 1;
1141 unsigned packed_flag
: 1;
1142 unsigned restrict_flag
: 1;
1143 unsigned pointer_depth
: 2;
1145 unsigned lang_flag_0
: 1;
1146 unsigned lang_flag_1
: 1;
1147 unsigned lang_flag_2
: 1;
1148 unsigned lang_flag_3
: 1;
1149 unsigned lang_flag_4
: 1;
1150 unsigned lang_flag_5
: 1;
1151 unsigned lang_flag_6
: 1;
1152 unsigned user_align
: 1;
1155 union tree_node
*pointer_to
;
1156 union tree_node
*reference_to
;
1157 union {int address
; char *pointer
; } symtab
;
1158 union tree_node
*name
;
1159 union tree_node
*minval
;
1160 union tree_node
*maxval
;
1161 union tree_node
*next_variant
;
1162 union tree_node
*main_variant
;
1163 union tree_node
*binfo
;
1164 union tree_node
*noncopied_parts
;
1165 union tree_node
*context
;
1166 HOST_WIDE_INT alias_set
;
1167 /* Points to a structure whose details depend on the language in use. */
1168 struct lang_type
*lang_specific
;
1171 /* Define accessor macros for information about type inheritance
1174 A "basetype" means a particular usage of a data type for inheritance
1175 in another type. Each such basetype usage has its own "binfo"
1176 object to describe it. The binfo object is a TREE_VEC node.
1178 Inheritance is represented by the binfo nodes allocated for a
1179 given type. For example, given types C and D, such that D is
1180 inherited by C, 3 binfo nodes will be allocated: one for describing
1181 the binfo properties of C, similarly one for D, and one for
1182 describing the binfo properties of D as a base type for C.
1183 Thus, given a pointer to class C, one can get a pointer to the binfo
1184 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1186 /* The actual data type node being inherited in this basetype. */
1187 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1189 /* The offset where this basetype appears in its containing type.
1190 BINFO_OFFSET slot holds the offset (in bytes)
1191 from the base of the complete object to the base of the part of the
1192 object that is allocated on behalf of this `type'.
1193 This is always 0 except when there is multiple inheritance. */
1195 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1196 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1197 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1199 /* The virtual function table belonging to this basetype. Virtual
1200 function tables provide a mechanism for run-time method dispatching.
1201 The entries of a virtual function table are language-dependent. */
1203 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1204 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1206 /* The virtual functions in the virtual function table. This is
1207 a TREE_LIST that is used as an initial approximation for building
1208 a virtual function table for this basetype. */
1209 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1210 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1212 /* A vector of binfos for the direct basetypes inherited by this
1215 If this basetype describes type D as inherited in C, and if the
1216 basetypes of D are E and F, then this vector contains binfos for
1217 inheritance of E and F by C.
1219 ??? This could probably be done by just allocating the
1220 base types at the end of this TREE_VEC (instead of using
1221 another TREE_VEC). This would simplify the calculation
1222 of how many basetypes a given type had. */
1223 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1224 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1226 /* The number of basetypes for NODE. */
1227 #define BINFO_N_BASETYPES(NODE) \
1228 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1230 /* Accessor macro to get to the Nth basetype of this basetype. */
1231 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1232 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1234 /* For a BINFO record describing a virtual base class, i.e., one where
1235 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1236 base. The actual contents are language-dependent. Under the old
1237 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1238 pointer to the virtual base; under the new ABI this field is
1239 instead a INTEGER_CST giving an offset into the vtable where the
1240 offset to the virtual base can be found. */
1241 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1243 /* The size of a base class subobject of this type. Not all frontends
1244 currently allocate the space for these fields. */
1245 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1246 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1247 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1248 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1250 /* Slot used to build a chain that represents a use of inheritance.
1251 For example, if X is derived from Y, and Y is derived from Z,
1252 then this field can be used to link the binfo node for X to
1253 the binfo node for X's Y to represent the use of inheritance
1254 from X to Y. Similarly, this slot of the binfo node for X's Y
1255 can point to the Z from which Y is inherited (in X's inheritance
1256 hierarchy). In this fashion, one can represent and traverse specific
1257 uses of inheritance using the binfo nodes themselves (instead of
1258 consing new space pointing to binfo nodes).
1259 It is up to the language-dependent front-ends to maintain
1260 this information as necessary. */
1261 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1263 /* Define fields and accessors for nodes representing declared names. */
1265 /* Nonzero if DECL represents a decl. */
1266 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1267 /* This is the name of the object as written by the user.
1268 It is an IDENTIFIER_NODE. */
1269 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1270 /* The name of the object as the assembler will see it (but before any
1271 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1272 as DECL_NAME. It is an IDENTIFIER_NODE. */
1273 #define DECL_ASSEMBLER_NAME(NODE) \
1274 ((DECL_ASSEMBLER_NAME_SET_P (NODE) \
1276 : (*lang_set_decl_assembler_name) (NODE)), \
1277 DECL_CHECK (NODE)->decl.assembler_name)
1278 /* Returns non-zero if the DECL_ASSEMBLER_NAME for NODE has been
1279 set. If zero, the NODE might still have a DECL_ASSEMBLER_NAME --
1280 it just hasn't been set yet. */
1281 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1282 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1283 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1284 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1285 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1286 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if
1287 DECL1's DECL_ASSEMBLER_NAME has not yet been set, using this macro
1288 will not cause the DECL_ASSEMBLER_NAME of either DECL to be set.
1289 In other words, the semantics of using this macro, are different
1292 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1294 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1295 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1296 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1297 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1298 DECL_ASSEMBLER_NAME (DECL1)) \
1301 /* Records the section name in a section attribute. Used to pass
1302 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1303 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1304 /* For FIELD_DECLs, this is the
1305 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1306 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1307 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1308 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1309 type, or NULL_TREE if the given decl has "file scope". */
1310 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1311 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1312 /* In a DECL this is the field where configuration dependent machine
1313 attributes are store */
1314 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1315 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1316 byte containing the bit closest to the beginning of the structure. */
1317 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1318 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1319 field from DECL_FIELD_OFFSET. */
1320 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1321 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1322 if so, the type that was originally specified for it.
1323 TREE_TYPE may have been modified (in finish_struct). */
1324 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1325 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1326 /* VAR_DECL and PARM_DECL reserve the arguments slot
1327 for language-specific uses. */
1328 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1329 /* This field is used to reference anything in decl.result and is meant only
1330 for use by the garbage collector. */
1331 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1332 /* In FUNCTION_DECL, holds the decl for the return value. */
1333 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1334 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1335 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1336 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1337 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1338 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1339 For a VAR_DECL, holds the initial value.
1340 For a PARM_DECL, not used--default
1341 values for parameters are encoded in the type of the function,
1342 not in the PARM_DECL slot. */
1343 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1344 /* For a PARM_DECL, records the data type used to pass the argument,
1345 which may be different from the type seen in the program. */
1346 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1347 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1348 if nonzero, indicates that the field occupies the type. */
1349 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1350 /* These two fields describe where in the source code the declaration
1351 was. If the declaration appears in several places (as for a C
1352 function that is declared first and then defined later), this
1353 information should refer to the definition. */
1354 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1355 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1356 /* Holds the size of the datum, in bits, as a tree expression.
1357 Need not be constant. */
1358 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1359 /* Likewise for the size in bytes. */
1360 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1361 /* Holds the alignment required for the datum, in bits. */
1362 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1363 /* The alignment of NODE, in bytes. */
1364 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1365 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1366 DECL_FIELD_OFFSET which are known to be always zero.
1367 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1369 #define DECL_OFFSET_ALIGN(NODE) \
1370 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1371 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1372 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1373 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1374 /* 1 if the alignment for this type was requested by "aligned" attribute,
1375 0 if it is the default for this type. */
1376 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1377 /* Holds the machine mode corresponding to the declaration of a variable or
1378 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1380 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1381 /* Holds the RTL expression for the value of a variable or function. If
1382 PROMOTED_MODE is defined, the mode of this expression may not be same
1383 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1384 to the variable's data type, while the mode
1385 of DECL_RTL is the mode actually used to contain the data.
1387 This value can be evaluated lazily for functions, variables with
1388 static storage duration, and labels. */
1389 #define DECL_RTL(NODE) \
1390 (DECL_CHECK (NODE)->decl.rtl \
1391 ? (NODE)->decl.rtl \
1392 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1393 /* Set the DECL_RTL for NODE to RTL. */
1394 #define SET_DECL_RTL(NODE, RTL) \
1395 (DECL_CHECK (NODE)->decl.rtl = (RTL))
1396 /* Returns non-zero if the DECL_RTL for NODE has already been set. */
1397 #define DECL_RTL_SET_P(NODE) \
1398 (DECL_CHECK (NODE)->decl.rtl != NULL)
1399 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1400 NODE1, it will not be set for NODE2; this is a lazy copy. */
1401 #define COPY_DECL_RTL(NODE1, NODE2) \
1402 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1403 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1404 #define DECL_RTL_IF_SET(NODE) \
1405 (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1406 /* Holds an INSN_LIST of all of the live ranges in which the variable
1407 has been moved to a possibly different register. */
1408 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1409 /* For PARM_DECL, holds an RTL for the stack slot or register
1410 where the data was actually passed. */
1411 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1412 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1413 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1414 /* For FUNCTION_DECL, if it is built-in,
1415 this identifies which built-in operation it is. */
1416 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1418 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1419 Before the struct containing the FUNCTION_DECL is laid out,
1420 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1421 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1422 function. When the class is laid out, this pointer is changed
1423 to an INTEGER_CST node which is suitable for use as an index
1424 into the virtual function table. */
1425 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1426 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1427 which this FIELD_DECL is defined. This information is needed when
1428 writing debugging information about vfield and vbase decls for C++. */
1429 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1431 /* Every ..._DECL node gets a unique number. */
1432 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1434 /* For any sort of a ..._DECL node, this points to the original (abstract)
1435 decl node which this decl is an instance of, or else it is NULL indicating
1436 that this decl is not an instance of some other decl. For example,
1437 in a nested declaration of an inline function, this points back to the
1439 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1441 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1442 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1443 #define DECL_ORIGIN(NODE) \
1444 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1446 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1447 inline instance of some original (abstract) decl from an inline function;
1448 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1449 nodes can also have their abstract origin set to themselves. */
1450 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1451 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1453 /* Nonzero if a _DECL means that the name of this decl should be ignored
1454 for symbolic debug purposes. */
1455 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1457 /* Nonzero for a given ..._DECL node means that this node represents an
1458 "abstract instance" of the given declaration (e.g. in the original
1459 declaration of an inline function). When generating symbolic debugging
1460 information, we mustn't try to generate any address information for nodes
1461 marked as "abstract instances" because we don't actually generate
1462 any code or allocate any data space for such instances. */
1463 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1465 /* Nonzero if a _DECL means that no warnings should be generated just
1466 because this decl is unused. */
1467 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1469 /* Nonzero for a given ..._DECL node means that this node should be
1470 put in .common, if possible. If a DECL_INITIAL is given, and it
1471 is not error_mark_node, then the decl cannot be put in .common. */
1472 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1474 /* Language-specific decl information. */
1475 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1477 /* In a VAR_DECL or FUNCTION_DECL,
1478 nonzero means external reference:
1479 do not allocate storage, and refer to a definition elsewhere. */
1480 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1482 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1484 #define DEFAULT_INIT_PRIORITY 65535
1485 #define MAX_INIT_PRIORITY 65535
1486 #define MAX_RESERVED_INIT_PRIORITY 100
1489 nonzero means the detail info about this type is not dumped into stabs.
1490 Instead it will generate cross reference ('x') of names.
1491 This uses the same flag as DECL_EXTERNAL. */
1492 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1493 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1495 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1496 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1497 /* In LABEL_DECL nodes, nonzero means that an error message about
1498 jumping into such a binding contour has been printed for this label. */
1499 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1500 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1501 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1502 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1503 static chain is not needed. */
1504 #define DECL_NO_STATIC_CHAIN(NODE) \
1505 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1507 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1508 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1510 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1512 Also set in some languages for variables, etc., outside the normal
1513 lexical scope, such as class instance variables. */
1514 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1516 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1517 where it is called. */
1518 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1520 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1521 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1523 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1524 that is not specified by ansi C and that users are supposed to be allowed
1525 to redefine for any purpose whatever. */
1526 #define DECL_BUILT_IN_NONANSI(NODE) \
1527 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1529 /* Nonzero in a FUNCTION_DECL means this function should be treated
1530 as if it were a malloc, meaning it returns a pointer that is
1532 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1534 /* Nonzero in a FUNCTION_DECL means this function should be treated
1535 as "pure" function (like const function, but may read global memory). */
1536 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1538 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1540 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1541 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1542 contour that restored a stack level and which is now exited. */
1543 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1545 /* Unused in FUNCTION_DECL. */
1547 /* In a VAR_DECL that's static,
1548 nonzero if the space is in the text section. */
1549 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1551 /* In a FUNCTION_DECL, nonzero means a built in function. */
1552 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1553 /* For a builtin function, identify which part of the compiler defined it. */
1554 #define DECL_BUILT_IN_CLASS(NODE) \
1555 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1557 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1558 Used in FIELD_DECLs for vtable pointers.
1559 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1560 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1562 /* Used to indicate that the linkage status of this DECL is not yet known,
1563 so it should not be output now. */
1564 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1566 /* Used in PARM_DECLs whose type are unions to indicate that the
1567 argument should be passed in the same way that the first union
1568 alternative would be passed. */
1569 #define DECL_TRANSPARENT_UNION(NODE) \
1570 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1572 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1573 at the beginning or end of execution. */
1574 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1575 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1577 #define DECL_STATIC_DESTRUCTOR(NODE) \
1578 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1580 /* Used to indicate that this DECL represents a compiler-generated entity. */
1581 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1583 /* Used to indicate that this DECL has weak linkage. */
1584 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1586 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1587 multiple translation units should be merged. */
1588 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1590 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1591 not be put out unless it is needed in this translation unit.
1592 Entities like this are shared across translation units (like weak
1593 entities), but are guaranteed to be generated by any translation
1594 unit that needs them, and therefore need not be put out anywhere
1595 where they are not needed. DECL_COMDAT is just a hint to the
1596 back-end; it is up to front-ends which set this flag to ensure
1597 that there will never be any harm, other than bloat, in putting out
1598 something which is DECL_COMDAT. */
1599 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1601 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1602 be instrumented with calls to support routines. */
1603 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1604 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1606 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1607 disabled in this function. */
1608 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) \
1609 (FUNCTION_DECL_CHECK (NODE)->decl.no_check_memory_usage)
1611 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1612 disabled in this function. */
1613 #define DECL_NO_LIMIT_STACK(NODE) \
1614 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1616 /* Additional flags for language-specific uses. */
1617 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1618 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1619 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1620 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1621 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1622 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1623 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1624 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1626 /* Used to indicate that the pointer to this DECL cannot be treated as
1627 an address constant. */
1628 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1630 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1632 #define DECL_NONADDRESSABLE_P(NODE) \
1633 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1635 /* Used to indicate an alias set for the memory pointed to by this
1636 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1637 pointer (or reference) type. */
1638 #define DECL_POINTER_ALIAS_SET(NODE) \
1639 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1641 /* Nonzero if an alias set has been assigned to this declaration. */
1642 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1643 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1645 /* The pointer_depth field comprises two bits for values in the range
1646 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1647 type node, but for functions it migth be greater. For example,
1648 this can happen when the function is declared to accept a parameter
1649 of type void* (depth=1), but is actually called with an argument of
1650 type foo** (depth=2). The function type will get the formal
1651 parameter's depth, but the function decl will get the actual
1652 argument's depth. */
1653 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1657 struct tree_common common
;
1658 const char *filename
;
1661 union tree_node
*size
;
1662 ENUM_BITFIELD(machine_mode
) mode
: 8;
1664 unsigned external_flag
: 1;
1665 unsigned nonlocal_flag
: 1;
1666 unsigned regdecl_flag
: 1;
1667 unsigned inline_flag
: 1;
1668 unsigned bit_field_flag
: 1;
1669 unsigned virtual_flag
: 1;
1670 unsigned ignored_flag
: 1;
1671 unsigned abstract_flag
: 1;
1673 unsigned in_system_header_flag
: 1;
1674 unsigned common_flag
: 1;
1675 unsigned defer_output
: 1;
1676 unsigned transparent_union
: 1;
1677 unsigned static_ctor_flag
: 1;
1678 unsigned static_dtor_flag
: 1;
1679 unsigned artificial_flag
: 1;
1680 unsigned weak_flag
: 1;
1682 unsigned non_addr_const_p
: 1;
1683 unsigned no_instrument_function_entry_exit
: 1;
1684 unsigned no_check_memory_usage
: 1;
1685 unsigned comdat_flag
: 1;
1686 unsigned malloc_flag
: 1;
1687 unsigned no_limit_stack
: 1;
1688 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
1690 unsigned pure_flag
: 1;
1691 unsigned pointer_depth
: 2;
1692 unsigned non_addressable
: 1;
1693 unsigned user_align
: 1;
1694 unsigned uninlinable
: 1;
1695 /* Two unused bits. */
1697 unsigned lang_flag_0
: 1;
1698 unsigned lang_flag_1
: 1;
1699 unsigned lang_flag_2
: 1;
1700 unsigned lang_flag_3
: 1;
1701 unsigned lang_flag_4
: 1;
1702 unsigned lang_flag_5
: 1;
1703 unsigned lang_flag_6
: 1;
1704 unsigned lang_flag_7
: 1;
1707 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1708 DECL_FUNCTION_CODE. */
1709 enum built_in_function f
;
1710 /* In a FUNCITON_DECL for which DECL_BUILT_IN does not hold, this
1711 is used by language-dependent code. */
1713 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1715 struct {unsigned int align
: 24; unsigned int off_align
: 8;} a
;
1718 union tree_node
*size_unit
;
1719 union tree_node
*name
;
1720 union tree_node
*context
;
1721 union tree_node
*arguments
; /* Also used for DECL_FIELD_OFFSET */
1722 union tree_node
*result
; /* Also used for DECL_BIT_FIELD_TYPE */
1723 union tree_node
*initial
; /* Also used for DECL_QUALIFIER */
1724 union tree_node
*abstract_origin
;
1725 union tree_node
*assembler_name
;
1726 union tree_node
*section_name
;
1727 union tree_node
*machine_attributes
;
1728 struct rtx_def
*rtl
; /* RTL representation for object. */
1729 struct rtx_def
*live_range_rtl
;
1731 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1732 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1733 In PARM_DECL, holds an RTL for the stack slot
1734 of register where the data was actually passed.
1735 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1743 union tree_node
*vindex
;
1744 HOST_WIDE_INT pointer_alias_set
;
1745 /* Points to a structure whose details depend on the language in use. */
1746 struct lang_decl
*lang_specific
;
1749 /* Define the overall contents of a tree node.
1750 It may be any of the structures declared above
1751 for various types of node. */
1755 struct tree_common common
;
1756 struct tree_int_cst int_cst
;
1757 struct tree_real_cst real_cst
;
1758 struct tree_string string
;
1759 struct tree_complex
complex;
1760 struct tree_identifier identifier
;
1761 struct tree_decl decl
;
1762 struct tree_type type
;
1763 struct tree_list list
;
1764 struct tree_vec vec
;
1765 struct tree_exp exp
;
1766 struct tree_block block
;
1769 /* Standard named or nameless data types of the C compiler. */
1788 TI_INTEGER_MINUS_ONE
,
1798 TI_COMPLEX_INTEGER_TYPE
,
1799 TI_COMPLEX_FLOAT_TYPE
,
1800 TI_COMPLEX_DOUBLE_TYPE
,
1801 TI_COMPLEX_LONG_DOUBLE_TYPE
,
1805 TI_LONG_DOUBLE_TYPE
,
1826 extern tree global_trees
[TI_MAX
];
1828 #define error_mark_node global_trees[TI_ERROR_MARK]
1830 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1831 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1832 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1833 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1834 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1836 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1837 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1838 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1839 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1840 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1842 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1843 #define integer_one_node global_trees[TI_INTEGER_ONE]
1844 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
1845 #define size_zero_node global_trees[TI_SIZE_ZERO]
1846 #define size_one_node global_trees[TI_SIZE_ONE]
1847 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1848 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1849 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1851 #define null_pointer_node global_trees[TI_NULL_POINTER]
1853 #define float_type_node global_trees[TI_FLOAT_TYPE]
1854 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1855 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1857 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1858 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1859 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1860 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1862 #define void_type_node global_trees[TI_VOID_TYPE]
1863 /* The C type `void *'. */
1864 #define ptr_type_node global_trees[TI_PTR_TYPE]
1865 /* The C type `const void *'. */
1866 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1867 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1868 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1870 /* The node that should be placed at the end of a parameter list to
1871 indicate that the function does not take a variable number of
1872 arguments. The TREE_VALUE will be void_type_node and there will be
1873 no TREE_CHAIN. Language-independent code should not assume
1874 anything else about this node. */
1875 #define void_list_node global_trees[TI_VOID_LIST_NODE]
1877 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
1878 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
1880 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
1881 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
1882 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
1883 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
1884 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
1886 /* An enumeration of the standard C integer types. These must be
1887 ordered so that shorter types appear before longer ones. */
1888 enum integer_type_kind
1900 itk_unsigned_long_long
,
1904 typedef enum integer_type_kind integer_type_kind
;
1906 /* The standard C integer types. Use integer_type_kind to index into
1908 extern tree integer_types
[itk_none
];
1910 #define char_type_node integer_types[itk_char]
1911 #define signed_char_type_node integer_types[itk_signed_char]
1912 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1913 #define short_integer_type_node integer_types[itk_short]
1914 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1915 #define integer_type_node integer_types[itk_int]
1916 #define unsigned_type_node integer_types[itk_unsigned_int]
1917 #define long_integer_type_node integer_types[itk_long]
1918 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1919 #define long_long_integer_type_node integer_types[itk_long_long]
1920 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1923 #define NULL_TREE (tree) NULL
1925 /* Approximate positive square root of a host double. This is for
1926 statistical reports, not code generation. */
1927 extern double approx_sqrt
PARAMS ((double));
1929 extern char *permalloc
PARAMS ((int));
1930 extern char *expralloc
PARAMS ((int));
1932 /* Compute the number of bytes occupied by 'node'. This routine only
1933 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
1935 extern size_t tree_size
PARAMS ((tree
));
1937 /* Lowest level primitive for allocating a node.
1938 The TREE_CODE is the only argument. Contents are initialized
1939 to zero except for a few of the common fields. */
1941 extern tree make_node
PARAMS ((enum tree_code
));
1942 extern tree make_lang_type
PARAMS ((enum tree_code
));
1943 extern tree (*make_lang_type_fn
) PARAMS ((enum tree_code
));
1945 /* Make a copy of a node, with all the same contents except
1946 for TREE_PERMANENT. (The copy is permanent
1947 iff nodes being made now are permanent.) */
1949 extern tree copy_node
PARAMS ((tree
));
1951 /* Make a copy of a chain of TREE_LIST nodes. */
1953 extern tree copy_list
PARAMS ((tree
));
1955 /* Make a TREE_VEC. */
1957 extern tree make_tree_vec
PARAMS ((int));
1959 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1960 The name is supplied as a char *. */
1962 extern tree get_identifier
PARAMS ((const char *));
1964 /* If an identifier with the name TEXT (a null-terminated string) has
1965 previously been referred to, return that node; otherwise return
1968 extern tree maybe_get_identifier
PARAMS ((const char *));
1970 /* Construct various types of nodes. */
1972 #define build_int_2(LO,HI) \
1973 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1975 extern tree build
PARAMS ((enum tree_code
, tree
, ...));
1976 extern tree build_nt
PARAMS ((enum tree_code
, ...));
1978 extern tree build_int_2_wide
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
));
1979 extern tree build_real
PARAMS ((tree
, REAL_VALUE_TYPE
));
1980 extern tree build_real_from_int_cst
PARAMS ((tree
, tree
));
1981 extern tree build_complex
PARAMS ((tree
, tree
, tree
));
1982 extern tree build_string
PARAMS ((int, const char *));
1983 extern tree build1
PARAMS ((enum tree_code
, tree
, tree
));
1984 extern tree build_tree_list
PARAMS ((tree
, tree
));
1985 extern tree build_decl
PARAMS ((enum tree_code
, tree
, tree
));
1986 extern tree build_block
PARAMS ((tree
, tree
, tree
, tree
, tree
));
1987 extern tree build_expr_wfl
PARAMS ((tree
, const char *, int, int));
1989 /* Construct various nodes representing data types. */
1991 extern tree make_signed_type
PARAMS ((int));
1992 extern tree make_unsigned_type
PARAMS ((int));
1993 extern void initialize_sizetypes
PARAMS ((void));
1994 extern void set_sizetype
PARAMS ((tree
));
1995 extern tree signed_or_unsigned_type
PARAMS ((int, tree
));
1996 extern void fixup_unsigned_type
PARAMS ((tree
));
1997 extern tree build_pointer_type
PARAMS ((tree
));
1998 extern tree build_reference_type
PARAMS ((tree
));
1999 extern tree build_type_no_quals
PARAMS ((tree
));
2000 extern tree build_index_type
PARAMS ((tree
));
2001 extern tree build_index_2_type
PARAMS ((tree
, tree
));
2002 extern tree build_array_type
PARAMS ((tree
, tree
));
2003 extern tree build_function_type
PARAMS ((tree
, tree
));
2004 extern tree build_method_type
PARAMS ((tree
, tree
));
2005 extern tree build_offset_type
PARAMS ((tree
, tree
));
2006 extern tree build_complex_type
PARAMS ((tree
));
2007 extern tree array_type_nelts
PARAMS ((tree
));
2009 extern tree value_member
PARAMS ((tree
, tree
));
2010 extern tree purpose_member
PARAMS ((tree
, tree
));
2011 extern tree binfo_member
PARAMS ((tree
, tree
));
2012 extern unsigned int attribute_hash_list
PARAMS ((tree
));
2013 extern int attribute_list_equal
PARAMS ((tree
, tree
));
2014 extern int attribute_list_contained
PARAMS ((tree
, tree
));
2015 extern int tree_int_cst_equal
PARAMS ((tree
, tree
));
2016 extern int tree_int_cst_lt
PARAMS ((tree
, tree
));
2017 extern int tree_int_cst_compare
PARAMS ((tree
, tree
));
2018 extern int host_integerp
PARAMS ((tree
, int));
2019 extern HOST_WIDE_INT tree_low_cst
PARAMS ((tree
, int));
2020 extern int tree_int_cst_msb
PARAMS ((tree
));
2021 extern int tree_int_cst_sgn
PARAMS ((tree
));
2022 extern int tree_expr_nonnegative_p
PARAMS ((tree
));
2023 extern int rtl_expr_nonnegative_p
PARAMS ((struct rtx_def
*));
2024 extern int index_type_equal
PARAMS ((tree
, tree
));
2025 extern tree get_inner_array_type
PARAMS ((tree
));
2027 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2028 put the prototype here. Rtl.h does declare the prototype if
2029 tree.h had been included. */
2031 extern tree make_tree
PARAMS ((tree
, struct rtx_def
*));
2033 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2036 Such modified types already made are recorded so that duplicates
2039 extern tree build_type_attribute_variant
PARAMS ((tree
, tree
));
2040 extern tree build_decl_attribute_variant
PARAMS ((tree
, tree
));
2042 extern tree merge_machine_decl_attributes
PARAMS ((tree
, tree
));
2043 extern tree merge_machine_type_attributes
PARAMS ((tree
, tree
));
2045 /* Split a list of declspecs and attributes into two. */
2047 extern void split_specs_attrs
PARAMS ((tree
, tree
*, tree
*));
2049 /* Strip attributes from a list of combined specs and attrs. */
2051 extern tree strip_attrs
PARAMS ((tree
));
2053 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2055 extern int valid_machine_attribute
PARAMS ((tree
, tree
, tree
, tree
));
2057 /* Given a tree node and a string, return non-zero if the tree node is
2058 a valid attribute name for the string. */
2060 extern int is_attribute_p
PARAMS ((const char *, tree
));
2062 /* Given an attribute name and a list of attributes, return the list element
2063 of the attribute or NULL_TREE if not found. */
2065 extern tree lookup_attribute
PARAMS ((const char *, tree
));
2067 /* Given two attributes lists, return a list of their union. */
2069 extern tree merge_attributes
PARAMS ((tree
, tree
));
2071 /* Return a version of the TYPE, qualified as indicated by the
2072 TYPE_QUALS, if one exists. If no qualified version exists yet,
2073 return NULL_TREE. */
2075 extern tree get_qualified_type
PARAMS ((tree
, int));
2077 /* Like get_qualified_type, but creates the type if it does not
2078 exist. This function never returns NULL_TREE. */
2080 extern tree build_qualified_type
PARAMS ((tree
, int));
2082 /* Like build_qualified_type, but only deals with the `const' and
2083 `volatile' qualifiers. This interface is retained for backwards
2084 compatiblity with the various front-ends; new code should use
2085 build_qualified_type instead. */
2087 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2088 build_qualified_type (TYPE, \
2089 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2090 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2092 /* Make a copy of a type node. */
2094 extern tree build_type_copy
PARAMS ((tree
));
2096 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2097 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2098 node, does nothing except for the first time. */
2100 extern void layout_type
PARAMS ((tree
));
2102 /* These functions allow a front-end to perform a manual layout of a
2103 RECORD_TYPE. (For instance, if the placement of subsequent fields
2104 depends on the placement of fields so far.) Begin by calling
2105 start_record_layout. Then, call place_field for each of the
2106 fields. Then, call finish_record_layout. See layout_type for the
2107 default way in which these functions are used. */
2109 typedef struct record_layout_info_s
2111 /* The RECORD_TYPE that we are laying out. */
2113 /* The offset into the record so far, in bytes, not including bits in
2116 /* The last known alignment of SIZE. */
2117 unsigned int offset_align
;
2118 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2120 /* The alignment of the record so far, in bits. */
2121 unsigned int record_align
;
2122 /* The alignment of the record so far, not including padding, in bits. */
2123 unsigned int unpacked_align
;
2124 /* The alignment of the record so far, allowing for the record to be
2125 padded only at the end, in bits. */
2126 unsigned int unpadded_align
;
2127 /* The static variables (i.e., class variables, as opposed to
2128 instance variables) encountered in T. */
2129 tree pending_statics
;
2130 int packed_maybe_necessary
;
2131 } *record_layout_info
;
2133 extern void set_lang_adjust_rli
PARAMS ((void (*) PARAMS
2134 ((record_layout_info
))));
2135 extern record_layout_info start_record_layout
PARAMS ((tree
));
2136 extern tree bit_from_pos
PARAMS ((tree
, tree
));
2137 extern tree byte_from_pos
PARAMS ((tree
, tree
));
2138 extern void pos_from_byte
PARAMS ((tree
*, tree
*, unsigned int,
2140 extern void pos_from_bit
PARAMS ((tree
*, tree
*, unsigned int,
2142 extern void normalize_offset
PARAMS ((tree
*, tree
*,
2144 extern tree rli_size_unit_so_far
PARAMS ((record_layout_info
));
2145 extern tree rli_size_so_far
PARAMS ((record_layout_info
));
2146 extern void normalize_rli
PARAMS ((record_layout_info
));
2147 extern void place_field
PARAMS ((record_layout_info
, tree
));
2148 extern void compute_record_mode
PARAMS ((tree
));
2149 extern void finish_record_layout
PARAMS ((record_layout_info
));
2151 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2152 return a canonicalized ..._TYPE node, so that duplicates are not made.
2153 How the hash code is computed is up to the caller, as long as any two
2154 callers that could hash identical-looking type nodes agree. */
2156 extern tree type_hash_canon
PARAMS ((unsigned int, tree
));
2158 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2159 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2160 fields. Call this only once for any given decl node.
2162 Second argument is the boundary that this field can be assumed to
2163 be starting at (in bits). Zero means it can be assumed aligned
2164 on any boundary that may be needed. */
2166 extern void layout_decl
PARAMS ((tree
, unsigned));
2168 /* Return the mode for data of a given size SIZE and mode class CLASS.
2169 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2170 The value is BLKmode if no other mode is found. This is like
2171 mode_for_size, but is passed a tree. */
2173 extern enum machine_mode mode_for_size_tree
PARAMS ((tree
, enum mode_class
,
2176 /* Return an expr equal to X but certainly not valid as an lvalue. */
2178 extern tree non_lvalue
PARAMS ((tree
));
2179 extern tree pedantic_non_lvalue
PARAMS ((tree
));
2181 extern tree convert
PARAMS ((tree
, tree
));
2182 extern unsigned int expr_align
PARAMS ((tree
));
2183 extern tree size_in_bytes
PARAMS ((tree
));
2184 extern HOST_WIDE_INT int_size_in_bytes
PARAMS ((tree
));
2185 extern tree bit_position
PARAMS ((tree
));
2186 extern HOST_WIDE_INT int_bit_position
PARAMS ((tree
));
2187 extern tree byte_position
PARAMS ((tree
));
2188 extern HOST_WIDE_INT int_byte_position
PARAMS ((tree
));
2190 /* Define data structures, macros, and functions for handling sizes
2191 and the various types used to represent sizes. */
2195 SIZETYPE
, /* Normal representation of sizes in bytes. */
2196 SSIZETYPE
, /* Signed representation of sizes in bytes. */
2197 USIZETYPE
, /* Unsigned representation of sizes in bytes. */
2198 BITSIZETYPE
, /* Normal representation of sizes in bits. */
2199 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
2200 UBITSIZETYPE
, /* Unsifgned representation of sizes in bits. */
2203 extern tree sizetype_tab
[(int) TYPE_KIND_LAST
];
2205 #define sizetype sizetype_tab[(int) SIZETYPE]
2206 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2207 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2208 #define usizetype sizetype_tab[(int) USIZETYPE]
2209 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2210 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2212 extern tree size_binop
PARAMS ((enum tree_code
, tree
, tree
));
2213 extern tree size_diffop
PARAMS ((tree
, tree
));
2214 extern tree size_int_wide
PARAMS ((HOST_WIDE_INT
,
2215 enum size_type_kind
));
2216 extern tree size_int_type_wide
PARAMS ((HOST_WIDE_INT
, tree
));
2218 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2219 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2220 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2221 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2222 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2224 extern tree round_up
PARAMS ((tree
, int));
2225 extern tree round_down
PARAMS ((tree
, int));
2226 extern tree get_pending_sizes
PARAMS ((void));
2227 extern int is_pending_size
PARAMS ((tree
));
2228 extern void put_pending_size
PARAMS ((tree
));
2229 extern void put_pending_sizes
PARAMS ((tree
));
2231 /* Type for sizes of data-type. */
2233 #define BITS_PER_UNIT_LOG \
2234 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2235 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2236 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2238 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2239 extern unsigned int maximum_field_alignment
;
2241 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
2242 extern unsigned int set_alignment
;
2244 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2245 by making the last node in X point to Y.
2246 Returns X, except if X is 0 returns Y. */
2248 extern tree chainon
PARAMS ((tree
, tree
));
2250 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2252 extern tree tree_cons
PARAMS ((tree
, tree
, tree
));
2254 /* Return the last tree node in a chain. */
2256 extern tree tree_last
PARAMS ((tree
));
2258 /* Reverse the order of elements in a chain, and return the new head. */
2260 extern tree nreverse
PARAMS ((tree
));
2262 /* Returns the length of a chain of nodes
2263 (number of chain pointers to follow before reaching a null pointer). */
2265 extern int list_length
PARAMS ((tree
));
2267 /* Returns the number of FIELD_DECLs in a type. */
2269 extern int fields_length
PARAMS ((tree
));
2271 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2273 extern int integer_zerop
PARAMS ((tree
));
2275 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2277 extern int integer_onep
PARAMS ((tree
));
2279 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2280 all of whose significant bits are 1. */
2282 extern int integer_all_onesp
PARAMS ((tree
));
2284 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2285 exactly one bit 1. */
2287 extern int integer_pow2p
PARAMS ((tree
));
2289 /* staticp (tree x) is nonzero if X is a reference to data allocated
2290 at a fixed address in memory. */
2292 extern int staticp
PARAMS ((tree
));
2294 /* Gets an error if argument X is not an lvalue.
2295 Also returns 1 if X is an lvalue, 0 if not. */
2297 extern int lvalue_or_else
PARAMS ((tree
, const char *));
2299 /* save_expr (EXP) returns an expression equivalent to EXP
2300 but it can be used multiple times within context CTX
2301 and only evaluate EXP once. */
2303 extern tree save_expr
PARAMS ((tree
));
2305 /* Returns the index of the first non-tree operand for CODE, or the number
2306 of operands if all are trees. */
2308 extern int first_rtl_op
PARAMS ((enum tree_code
));
2310 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2311 can be used multiple times and will evaluate EXP in its entirety
2314 extern tree unsave_expr
PARAMS ((tree
));
2316 /* Reset EXP in place so that it can be expaned again. Does not
2317 recurse into subtrees. */
2319 extern void unsave_expr_1
PARAMS ((tree
));
2321 /* Like unsave_expr_1, but recurses into all subtrees. */
2323 extern tree unsave_expr_now
PARAMS ((tree
));
2325 /* If non-null, these are language-specific helper functions for
2326 unsave_expr_now. If present, LANG_UNSAVE is called before its
2327 argument (an UNSAVE_EXPR) is to be unsaved, and all other
2328 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
2329 called from unsave_expr_1 for language-specific tree codes. */
2330 extern void (*lang_unsave
) PARAMS ((tree
*));
2331 extern void (*lang_unsave_expr_now
) PARAMS ((tree
));
2333 /* Return 0 if it is safe to evaluate EXPR multiple times,
2334 return 1 if it is safe if EXPR is unsaved afterward, or
2335 return 2 if it is completely unsafe. */
2336 extern int unsafe_for_reeval
PARAMS ((tree
));
2338 /* If non-null, these are language-specific helper functions for
2339 unsafe_for_reeval. Return negative to not handle some tree. */
2340 extern int (*lang_unsafe_for_reeval
) PARAMS ((tree
));
2342 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2343 or offset that depends on a field within a record.
2345 Note that we only allow such expressions within simple arithmetic
2348 extern int contains_placeholder_p
PARAMS ((tree
));
2350 /* Return 1 if EXP contains any expressions that produce cleanups for an
2351 outer scope to deal with. Used by fold. */
2353 extern int has_cleanups
PARAMS ((tree
));
2355 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2356 return a tree with all occurrences of references to F in a
2357 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2358 contains only arithmetic expressions. */
2360 extern tree substitute_in_expr
PARAMS ((tree
, tree
, tree
));
2362 /* variable_size (EXP) is like save_expr (EXP) except that it
2363 is for the special case of something that is part of a
2364 variable size for a data type. It makes special arrangements
2365 to compute the value at the right time when the data type
2366 belongs to a function parameter. */
2368 extern tree variable_size
PARAMS ((tree
));
2370 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2371 but it can be used multiple times
2372 and only evaluate the subexpressions once. */
2374 extern tree stabilize_reference
PARAMS ((tree
));
2376 /* Subroutine of stabilize_reference; this is called for subtrees of
2377 references. Any expression with side-effects must be put in a SAVE_EXPR
2378 to ensure that it is only evaluated once. */
2380 extern tree stabilize_reference_1
PARAMS ((tree
));
2382 /* Return EXP, stripped of any conversions to wider types
2383 in such a way that the result of converting to type FOR_TYPE
2384 is the same as if EXP were converted to FOR_TYPE.
2385 If FOR_TYPE is 0, it signifies EXP's type. */
2387 extern tree get_unwidened
PARAMS ((tree
, tree
));
2389 /* Return OP or a simpler expression for a narrower value
2390 which can be sign-extended or zero-extended to give back OP.
2391 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2392 or 0 if the value should be sign-extended. */
2394 extern tree get_narrower
PARAMS ((tree
, int *));
2396 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2398 The definition of this resides in language-specific code
2399 as the repertoire of available types may vary. */
2401 extern tree type_for_mode
PARAMS ((enum machine_mode
, int));
2403 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2404 for an integer type with at least that precision.
2405 The definition of this resides in language-specific code
2406 as the repertoire of available types may vary. */
2408 extern tree type_for_size
PARAMS ((unsigned, int));
2410 /* Given an integer type T, return a type like T but unsigned.
2411 If T is unsigned, the value is T.
2412 The definition of this resides in language-specific code
2413 as the repertoire of available types may vary. */
2415 extern tree unsigned_type
PARAMS ((tree
));
2417 /* Given an integer type T, return a type like T but signed.
2418 If T is signed, the value is T.
2419 The definition of this resides in language-specific code
2420 as the repertoire of available types may vary. */
2422 extern tree signed_type
PARAMS ((tree
));
2424 /* This function must be defined in the language-specific files.
2425 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2426 This is defined in a language-specific file. */
2428 extern tree maybe_build_cleanup
PARAMS ((tree
));
2430 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2431 look for nested component-refs or array-refs at constant positions
2432 and find the ultimate containing object, which is returned. */
2434 extern tree get_inner_reference
PARAMS ((tree
, HOST_WIDE_INT
*,
2435 HOST_WIDE_INT
*, tree
*,
2436 enum machine_mode
*, int *,
2437 int *, unsigned int *));
2439 /* Given a DECL or TYPE, return the scope in which it was declared, or
2440 NUL_TREE if there is no containing scope. */
2442 extern tree get_containing_scope
PARAMS ((tree
));
2444 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2446 extern tree decl_function_context
PARAMS ((tree
));
2448 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2449 this _DECL with its context, or zero if none. */
2450 extern tree decl_type_context
PARAMS ((tree
));
2452 /* Given the FUNCTION_DECL for the current function,
2453 return zero if it is ok for this function to be inline.
2454 Otherwise return a warning message with a single %s
2455 for the function's name. */
2457 extern const char *function_cannot_inline_p
PARAMS ((tree
));
2459 /* Return 1 if EXPR is the real constant zero. */
2460 extern int real_zerop
PARAMS ((tree
));
2462 /* Declare commonly used variables for tree structure. */
2464 /* Points to the name of the input file from which the current input
2465 being parsed originally came (before it went into cpp). */
2466 extern const char *input_filename
;
2468 /* Current line number in input file. */
2471 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2472 Zero means allow extended lvalues. */
2474 extern int pedantic_lvalues
;
2476 /* Nonzero means can safely call expand_expr now;
2477 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2479 extern int immediate_size_expand
;
2481 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2483 extern tree current_function_decl
;
2485 /* Nonzero means a FUNC_BEGIN label was emitted. */
2486 extern tree current_function_func_begin_label
;
2488 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2490 extern int all_types_permanent
;
2492 /* Pointer to function to compute the name to use to print a declaration.
2493 DECL is the declaration in question.
2494 VERBOSITY determines what information will be printed:
2495 0: DECL_NAME, demangled as necessary.
2496 1: and scope information.
2497 2: and any other information that might be interesting, such as function
2498 parameter types in C++. */
2500 extern const char *(*decl_printable_name
) PARAMS ((tree
, int));
2502 /* Pointer to function to finish handling an incomplete decl at the
2503 end of compilation. */
2505 extern void (*incomplete_decl_finalize_hook
) PARAMS ((tree
));
2507 extern const char *init_parse
PARAMS ((const char *));
2508 extern void finish_parse
PARAMS ((void));
2510 extern const char * const language_string
;
2512 /* Declare a predefined function. Return the declaration. This function is
2513 provided by each language frontend. */
2514 extern tree builtin_function
PARAMS ((const char *, tree
, int,
2515 enum built_in_class
,
2519 extern char *perm_calloc
PARAMS ((int, long));
2520 extern void clean_symbol_name
PARAMS ((char *));
2521 extern tree get_file_function_name_long
PARAMS ((const char *));
2522 extern tree get_set_constructor_bits
PARAMS ((tree
, char *, int));
2523 extern tree get_set_constructor_bytes
PARAMS ((tree
,
2524 unsigned char *, int));
2525 extern tree get_callee_fndecl
PARAMS ((tree
));
2526 extern void set_decl_assembler_name
PARAMS ((tree
));
2527 extern int type_num_arguments
PARAMS ((tree
));
2531 extern int in_control_zone_p
PARAMS ((void));
2532 extern void expand_fixups
PARAMS ((struct rtx_def
*));
2533 extern tree expand_start_stmt_expr
PARAMS ((void));
2534 extern tree expand_end_stmt_expr
PARAMS ((tree
));
2535 extern void expand_expr_stmt
PARAMS ((tree
));
2536 extern int warn_if_unused_value
PARAMS ((tree
));
2537 extern void expand_decl_init
PARAMS ((tree
));
2538 extern void clear_last_expr
PARAMS ((void));
2539 extern void expand_label
PARAMS ((tree
));
2540 extern void expand_goto
PARAMS ((tree
));
2541 extern void expand_asm
PARAMS ((tree
));
2542 extern void expand_start_cond
PARAMS ((tree
, int));
2543 extern void expand_end_cond
PARAMS ((void));
2544 extern void expand_start_else
PARAMS ((void));
2545 extern void expand_start_elseif
PARAMS ((tree
));
2546 extern struct nesting
*expand_start_loop
PARAMS ((int));
2547 extern struct nesting
*expand_start_loop_continue_elsewhere
PARAMS ((int));
2548 extern struct nesting
*expand_start_null_loop
PARAMS ((void));
2549 extern void expand_loop_continue_here
PARAMS ((void));
2550 extern void expand_end_loop
PARAMS ((void));
2551 extern void expand_end_null_loop
PARAMS ((void));
2552 extern int expand_continue_loop
PARAMS ((struct nesting
*));
2553 extern int expand_exit_loop
PARAMS ((struct nesting
*));
2554 extern int expand_exit_loop_if_false
PARAMS ((struct nesting
*,
2556 extern int expand_exit_something
PARAMS ((void));
2558 extern void expand_return
PARAMS ((tree
));
2559 extern int optimize_tail_recursion
PARAMS ((tree
, struct rtx_def
*));
2560 extern void expand_start_bindings_and_block
PARAMS ((int, tree
));
2561 #define expand_start_bindings(flags) \
2562 expand_start_bindings_and_block(flags, NULL_TREE)
2563 extern void expand_end_bindings
PARAMS ((tree
, int, int));
2564 extern void warn_about_unused_variables
PARAMS ((tree
));
2565 extern void start_cleanup_deferral
PARAMS ((void));
2566 extern void end_cleanup_deferral
PARAMS ((void));
2567 extern int is_body_block
PARAMS ((tree
));
2569 extern int conditional_context
PARAMS ((void));
2570 extern struct nesting
* current_nesting_level
PARAMS ((void));
2571 extern tree last_cleanup_this_contour
PARAMS ((void));
2572 extern void expand_start_case
PARAMS ((int, tree
, tree
,
2574 extern void expand_end_case
PARAMS ((tree
));
2575 extern int add_case_node
PARAMS ((tree
, tree
,
2577 extern int pushcase
PARAMS ((tree
,
2578 tree (*) (tree
, tree
),
2580 extern int pushcase_range
PARAMS ((tree
, tree
,
2581 tree (*) (tree
, tree
),
2583 extern void using_eh_for_cleanups
PARAMS ((void));
2584 extern int stmt_loop_nest_empty
PARAMS ((void));
2586 /* In fold-const.c */
2588 /* Fold constants as much as possible in an expression.
2589 Returns the simplified expression.
2590 Acts only on the top level of the expression;
2591 if the argument itself cannot be simplified, its
2592 subexpressions are not changed. */
2594 extern tree fold
PARAMS ((tree
));
2596 extern int force_fit_type
PARAMS ((tree
, int));
2597 extern int add_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2598 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2599 unsigned HOST_WIDE_INT
*,
2601 extern int neg_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2602 unsigned HOST_WIDE_INT
*,
2604 extern int mul_double
PARAMS ((unsigned HOST_WIDE_INT
,
2606 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2607 unsigned HOST_WIDE_INT
*,
2609 extern void lshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2610 HOST_WIDE_INT
, unsigned int,
2611 unsigned HOST_WIDE_INT
*,
2612 HOST_WIDE_INT
*, int));
2613 extern void rshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2614 HOST_WIDE_INT
, unsigned int,
2615 unsigned HOST_WIDE_INT
*,
2616 HOST_WIDE_INT
*, int));
2617 extern void lrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2618 HOST_WIDE_INT
, unsigned int,
2619 unsigned HOST_WIDE_INT
*,
2621 extern void rrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2622 HOST_WIDE_INT
, unsigned int,
2623 unsigned HOST_WIDE_INT
*,
2625 extern int operand_equal_p
PARAMS ((tree
, tree
, int));
2626 extern tree invert_truthvalue
PARAMS ((tree
));
2628 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2629 function arguments and return the new type. Return NULL_TREE if no
2630 change. Required by any language that supports variadic arguments. */
2632 extern tree (*lang_type_promotes_to
) PARAMS ((tree
));
2633 extern tree fold_builtin
PARAMS ((tree
));
2635 /* The language front-end must define these functions. */
2637 /* Function of no arguments for initializing lexical scanning. */
2638 extern void init_lex
PARAMS ((void));
2639 /* Function of no arguments for initializing the symbol table. */
2640 extern void init_decl_processing
PARAMS ((void));
2642 /* Function to identify which front-end produced the output file. */
2643 extern const char *lang_identify
PARAMS ((void));
2645 /* Called by report_error_function to print out function name.
2646 * Default may be overridden by language front-ends. */
2647 extern void (*print_error_function
) PARAMS ((const char *));
2649 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2650 extern void copy_lang_decl
PARAMS ((tree
));
2652 /* Function called with no arguments to parse and compile the input. */
2653 extern int yyparse
PARAMS ((void));
2654 /* Functions for processing symbol declarations. */
2655 /* Function to enter a new lexical scope.
2656 Takes one argument: always zero when called from outside the front end. */
2657 extern void pushlevel
PARAMS ((int));
2658 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2659 Takes three arguments:
2660 KEEP -- nonzero if there were declarations in this scope.
2661 REVERSE -- reverse the order of decls before returning them.
2662 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2663 extern tree poplevel
PARAMS ((int, int, int));
2664 /* Set the BLOCK node for the current scope level. */
2665 extern void set_block
PARAMS ((tree
));
2666 /* Function to add a decl to the current scope level.
2667 Takes one argument, a decl to add.
2668 Returns that decl, or, if the same symbol is already declared, may
2669 return a different decl for that name. */
2670 extern tree pushdecl
PARAMS ((tree
));
2671 /* Function to return the chain of decls so far in the current scope level. */
2672 extern tree getdecls
PARAMS ((void));
2673 /* Function to return the chain of structure tags in the current scope level. */
2674 extern tree gettags
PARAMS ((void));
2676 extern tree build_range_type
PARAMS ((tree
, tree
, tree
));
2679 extern void record_component_aliases
PARAMS ((tree
));
2680 extern HOST_WIDE_INT get_alias_set
PARAMS ((tree
));
2681 extern int alias_sets_conflict_p
PARAMS ((HOST_WIDE_INT
,
2683 extern int readonly_fields_p
PARAMS ((tree
));
2684 extern int objects_must_conflict_p
PARAMS ((tree
, tree
));
2687 extern HOST_WIDE_INT lang_get_alias_set
PARAMS ((tree
));
2689 /* Set the DECL_ASSEMBLER_NAME for a node. If it is the sort of thing
2690 that the assembler should talk about, set DECL_ASSEMBLER_NAME to an
2691 appropriate IDENTIFIER_NODE. Otherwise, set it to the
2692 ERROR_MARK_NODE to ensure that the assembler does not talk about
2694 extern void (*lang_set_decl_assembler_name
) PARAMS ((tree
));
2699 extern int really_constant_p
PARAMS ((tree
));
2700 extern void set_identifier_size
PARAMS ((int));
2701 extern int int_fits_type_p
PARAMS ((tree
, tree
));
2702 extern int tree_log2
PARAMS ((tree
));
2703 extern int tree_floor_log2
PARAMS ((tree
));
2704 extern void preserve_data
PARAMS ((void));
2705 extern int object_permanent_p
PARAMS ((tree
));
2706 extern int type_precision
PARAMS ((tree
));
2707 extern int simple_cst_equal
PARAMS ((tree
, tree
));
2708 extern int compare_tree_int
PARAMS ((tree
, unsigned int));
2709 extern int type_list_equal
PARAMS ((tree
, tree
));
2710 extern int chain_member
PARAMS ((tree
, tree
));
2711 extern int chain_member_purpose
PARAMS ((tree
, tree
));
2712 extern int chain_member_value
PARAMS ((tree
, tree
));
2713 extern tree listify
PARAMS ((tree
));
2714 extern tree type_hash_lookup
PARAMS ((unsigned int, tree
));
2715 extern void type_hash_add
PARAMS ((unsigned int, tree
));
2716 extern unsigned int type_hash_list
PARAMS ((tree
));
2717 extern int simple_cst_list_equal
PARAMS ((tree
, tree
));
2718 extern void dump_tree_statistics
PARAMS ((void));
2719 extern void print_obstack_statistics
PARAMS ((const char *,
2722 extern void print_obstack_name
PARAMS ((char *, FILE *,
2725 extern void expand_function_end
PARAMS ((const char *, int, int));
2726 extern void expand_function_start
PARAMS ((tree
, int));
2727 extern void expand_pending_sizes
PARAMS ((tree
));
2729 extern int real_onep
PARAMS ((tree
));
2730 extern int real_twop
PARAMS ((tree
));
2731 extern void gcc_obstack_init
PARAMS ((struct obstack
*));
2732 extern void init_obstacks
PARAMS ((void));
2733 extern void build_common_tree_nodes
PARAMS ((int));
2734 extern void build_common_tree_nodes_2
PARAMS ((int));
2735 extern void mark_tree_hashtable
PARAMS ((void *));
2738 extern void setjmp_protect_args
PARAMS ((void));
2739 extern void setjmp_protect
PARAMS ((tree
));
2740 extern void expand_main_function
PARAMS ((void));
2741 extern void mark_varargs
PARAMS ((void));
2742 extern void init_dummy_function_start
PARAMS ((void));
2743 extern void expand_dummy_function_end
PARAMS ((void));
2744 extern void init_function_for_compilation
PARAMS ((void));
2745 extern void init_function_start
PARAMS ((tree
, const char *, int));
2746 extern void assign_parms
PARAMS ((tree
));
2747 extern void put_var_into_stack
PARAMS ((tree
));
2748 extern void flush_addressof
PARAMS ((tree
));
2749 extern void uninitialized_vars_warning
PARAMS ((tree
));
2750 extern void setjmp_args_warning
PARAMS ((void));
2751 extern void mark_all_temps_used
PARAMS ((void));
2752 extern void init_temp_slots
PARAMS ((void));
2753 extern void combine_temp_slots
PARAMS ((void));
2754 extern void free_temp_slots
PARAMS ((void));
2755 extern void pop_temp_slots
PARAMS ((void));
2756 extern void push_temp_slots
PARAMS ((void));
2757 extern void preserve_temp_slots
PARAMS ((struct rtx_def
*));
2758 extern void preserve_rtl_expr_temps
PARAMS ((tree
));
2759 extern int aggregate_value_p
PARAMS ((tree
));
2760 extern void free_temps_for_rtl_expr
PARAMS ((tree
));
2761 extern void instantiate_virtual_regs
PARAMS ((tree
, struct rtx_def
*));
2762 extern void unshare_all_rtl
PARAMS ((tree
, struct rtx_def
*));
2763 extern int max_parm_reg_num
PARAMS ((void));
2764 extern void push_function_context
PARAMS ((void));
2765 extern void pop_function_context
PARAMS ((void));
2766 extern void push_function_context_to
PARAMS ((tree
));
2767 extern void pop_function_context_from
PARAMS ((tree
));
2769 /* In print-rtl.c */
2771 extern void print_rtl
PARAMS ((FILE *, struct rtx_def
*));
2774 /* In print-tree.c */
2775 extern void debug_tree
PARAMS ((tree
));
2777 extern void print_node
PARAMS ((FILE *, const char *, tree
,
2779 extern void print_node_brief
PARAMS ((FILE *, const char *, tree
,
2781 extern void indent_to
PARAMS ((FILE *, int));
2785 extern int apply_args_register_offset
PARAMS ((int));
2786 extern struct rtx_def
*expand_builtin_return_addr
2787 PARAMS ((enum built_in_function
, int, struct rtx_def
*));
2788 extern void check_max_integer_computation_mode
PARAMS ((tree
));
2791 extern void start_sequence_for_rtl_expr
PARAMS ((tree
));
2792 extern struct rtx_def
*emit_line_note
PARAMS ((const char *, int));
2796 extern int setjmp_call_p
PARAMS ((tree
));
2800 extern int mark_addressable
PARAMS ((tree
));
2801 extern void incomplete_type_error
PARAMS ((tree
, tree
));
2802 extern void print_lang_statistics
PARAMS ((void));
2803 extern tree truthvalue_conversion
PARAMS ((tree
));
2805 extern void print_lang_decl
PARAMS ((FILE *, tree
, int));
2806 extern void print_lang_type
PARAMS ((FILE *, tree
, int));
2807 extern void print_lang_identifier
PARAMS ((FILE *, tree
, int));
2809 extern int global_bindings_p
PARAMS ((void));
2810 extern void insert_block
PARAMS ((tree
));
2812 /* In integrate.c */
2813 extern void save_for_inline
PARAMS ((tree
));
2814 extern void set_decl_abstract_flags
PARAMS ((tree
, int));
2815 extern void output_inline_function
PARAMS ((tree
));
2816 extern void set_decl_origin_self
PARAMS ((tree
));
2819 extern void set_yydebug
PARAMS ((int));
2821 /* In stor-layout.c */
2822 extern void fixup_signed_type
PARAMS ((tree
));
2823 extern void internal_reference_types
PARAMS ((void));
2826 extern void make_decl_rtl
PARAMS ((tree
, const char *));
2827 extern void make_decl_one_only
PARAMS ((tree
));
2828 extern int supports_one_only
PARAMS ((void));
2829 extern void variable_section
PARAMS ((tree
, int));
2831 /* In fold-const.c */
2832 extern int div_and_round_double
PARAMS ((enum tree_code
, int,
2833 unsigned HOST_WIDE_INT
,
2835 unsigned HOST_WIDE_INT
,
2837 unsigned HOST_WIDE_INT
*,
2839 unsigned HOST_WIDE_INT
*,
2843 extern void emit_nop
PARAMS ((void));
2844 extern void expand_computed_goto
PARAMS ((tree
));
2845 extern void expand_asm_operands
PARAMS ((tree
, tree
, tree
, tree
, int,
2846 const char *, int));
2847 extern int any_pending_cleanups
PARAMS ((int));
2848 extern void init_stmt
PARAMS ((void));
2849 extern void init_stmt_for_function
PARAMS ((void));
2850 extern int drop_through_at_end_p
PARAMS ((void));
2851 extern void expand_start_target_temps
PARAMS ((void));
2852 extern void expand_end_target_temps
PARAMS ((void));
2853 extern void expand_elseif
PARAMS ((tree
));
2854 extern void save_stack_pointer
PARAMS ((void));
2855 extern void expand_decl
PARAMS ((tree
));
2856 extern int expand_decl_cleanup
PARAMS ((tree
, tree
));
2857 extern void expand_anon_union_decl
PARAMS ((tree
, tree
, tree
));
2858 extern void move_cleanups_up
PARAMS ((void));
2859 extern void expand_start_case_dummy
PARAMS ((void));
2860 extern void expand_end_case_dummy
PARAMS ((void));
2861 extern tree case_index_expr_type
PARAMS ((void));
2862 extern HOST_WIDE_INT all_cases_count
PARAMS ((tree
, int *));
2863 extern void check_for_full_enumeration_handling
PARAMS ((tree
));
2864 extern void declare_nonlocal_label
PARAMS ((tree
));
2866 extern void lang_print_xnode
PARAMS ((FILE *, tree
, int));
2870 /* If KIND=='I', return a suitable global initializer (constructor) name.
2871 If KIND=='D', return a suitable global clean-up (destructor) name. */
2872 extern tree get_file_function_name
PARAMS ((int));
2874 /* Interface of the DWARF2 unwind info support. */
2876 /* Decide whether we want to emit frame unwind information for the current
2877 translation unit. */
2879 extern int dwarf2out_do_frame
PARAMS ((void));
2881 /* Generate a new label for the CFI info to refer to. */
2883 extern char *dwarf2out_cfi_label
PARAMS ((void));
2885 /* Entry point to update the canonical frame address (CFA). */
2887 extern void dwarf2out_def_cfa
PARAMS ((const char *, unsigned, long));
2889 /* Add the CFI for saving a register window. */
2891 extern void dwarf2out_window_save
PARAMS ((const char *));
2893 /* Add a CFI to update the running total of the size of arguments pushed
2896 extern void dwarf2out_args_size
PARAMS ((const char *, long));
2898 /* Entry point for saving a register to the stack. */
2900 extern void dwarf2out_reg_save
PARAMS ((const char *, unsigned, long));
2902 /* Entry point for saving the return address in the stack. */
2904 extern void dwarf2out_return_save
PARAMS ((const char *, long));
2906 /* Entry point for saving the return address in a register. */
2908 extern void dwarf2out_return_reg
PARAMS ((const char *, unsigned));
2910 /* Output a marker (i.e. a label) for the beginning of a function, before
2913 extern void dwarf2out_begin_prologue
PARAMS ((void));
2915 /* Output a marker (i.e. a label) for the absolute end of the generated
2916 code for a function definition. */
2918 extern void dwarf2out_end_epilogue
PARAMS ((void));
2920 /* Redefine abort to report an internal error w/o coredump, and
2921 reporting the location of the error in the source file. This logic
2922 is duplicated in rtl.h and tree.h because every file that needs the
2923 special abort includes one or both. toplev.h gets too few files,
2924 system.h gets too many. */
2926 extern void fancy_abort
PARAMS ((const char *, int, const char *))
2928 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)