1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
42 /* Number of language-independent tree codes. */
43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern char tree_code_type[MAX_TREE_CODES];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns non-zero iff CLASS is the tree-code class of an
59 #define IS_EXPR_CODE_CLASS(CLASS) \
60 (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e')
62 /* Number of argument-words in each kind of tree-node. */
64 extern int tree_code_length[MAX_TREE_CODES];
65 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
67 /* Names of tree components. */
69 extern const char *tree_code_name[MAX_TREE_CODES];
71 /* Classify which part of the compiler has defined a given builtin function.
72 Note that we assume below that this is no more than two bits. */
81 /* Names for the above. */
82 extern const char *const built_in_class_names[4];
84 /* Codes that identify the various built in functions
85 so that expand_call can identify them quickly. */
87 #define DEF_BUILTIN(x) x,
88 enum built_in_function
90 #include "builtins.def"
92 /* Upper bound on non-language-specific builtins. */
97 /* Names for the above. */
98 extern const char *const built_in_names[(int) END_BUILTINS];
100 /* 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
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
269 /* Define accessors for the fields that all tree nodes have
270 (though some fields are not used for all kinds of nodes). */
272 /* The tree-code says what kind of node it is.
273 Codes are defined in tree.def. */
274 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
275 #define TREE_SET_CODE(NODE, VALUE) \
276 ((NODE)->common.code = (ENUM_BITFIELD(tree_code)) (VALUE))
278 /* When checking is enabled, errors will be generated if a tree node
279 is accessed incorrectly. The macros abort with a fatal error. */
280 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
282 #define TREE_CHECK(t, code) __extension__ \
283 ({ const tree __t = t; \
284 if (TREE_CODE(__t) != (code)) \
285 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
287 #define TREE_CLASS_CHECK(t, class) __extension__ \
288 ({ const tree __t = t; \
289 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
290 tree_class_check_failed (__t, class, __FILE__, __LINE__, __FUNCTION__); \
293 /* These checks have to be special cased. */
294 #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
295 ({ const tree __t = t; \
296 enum tree_code __c = TREE_CODE(__t); \
297 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
298 tree_check_failed (__t, CONSTRUCTOR, __FILE__, __LINE__, __FUNCTION__); \
300 #define EXPR_CHECK(t) __extension__ \
301 ({ const tree __t = t; \
302 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
303 if (__c != 'r' && __c != 's' && __c != '<' \
304 && __c != '1' && __c != '2' && __c != 'e') \
305 tree_class_check_failed(__t, 'e', __FILE__, __LINE__, __FUNCTION__); \
308 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
309 const char *, int, const char *))
311 extern void tree_class_check_failed PARAMS ((const tree, int,
312 const char *, int, const char *))
315 #else /* not ENABLE_TREE_CHECKING, or not gcc */
317 #define TREE_CHECK(t, code) (t)
318 #define TREE_CLASS_CHECK(t, code) (t)
319 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
320 #define EXPR_CHECK(t) (t)
324 #include "tree-check.h"
326 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
327 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
328 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
330 /* In all nodes that are expressions, this is the data type of the expression.
331 In POINTER_TYPE nodes, this is the type that the pointer points to.
332 In ARRAY_TYPE nodes, this is the type of the elements.
333 In VECTOR_TYPE nodes, this is the type of the elements. */
334 #define TREE_TYPE(NODE) ((NODE)->common.type)
336 /* Nodes are chained together for many purposes.
337 Types are chained together to record them for being output to the debugger
338 (see the function `chain_type').
339 Decls in the same scope are chained together to record the contents
341 Statement nodes for successive statements used to be chained together.
342 Often lists of things are represented by TREE_LIST nodes that
343 are chained together. */
345 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
347 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
348 that don't change the machine mode. */
350 #define STRIP_NOPS(EXP) \
351 while ((TREE_CODE (EXP) == NOP_EXPR \
352 || TREE_CODE (EXP) == CONVERT_EXPR \
353 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
354 && TREE_OPERAND (EXP, 0) != error_mark_node \
355 && (TYPE_MODE (TREE_TYPE (EXP)) \
356 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
357 (EXP) = TREE_OPERAND (EXP, 0);
359 /* Like STRIP_NOPS, but don't let the signedness change either. */
361 #define STRIP_SIGN_NOPS(EXP) \
362 while ((TREE_CODE (EXP) == NOP_EXPR \
363 || TREE_CODE (EXP) == CONVERT_EXPR \
364 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
365 && TREE_OPERAND (EXP, 0) != error_mark_node \
366 && (TYPE_MODE (TREE_TYPE (EXP)) \
367 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
368 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
369 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
370 (EXP) = TREE_OPERAND (EXP, 0);
372 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
374 #define STRIP_TYPE_NOPS(EXP) \
375 while ((TREE_CODE (EXP) == NOP_EXPR \
376 || TREE_CODE (EXP) == CONVERT_EXPR \
377 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
378 && TREE_OPERAND (EXP, 0) != error_mark_node \
379 && (TREE_TYPE (EXP) \
380 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
381 (EXP) = TREE_OPERAND (EXP, 0);
383 /* Nonzero if TYPE represents an integral type. Note that we do not
384 include COMPLEX types here. */
386 #define INTEGRAL_TYPE_P(TYPE) \
387 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
388 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
390 /* Nonzero if TYPE represents a floating-point type, including complex
391 floating-point types. */
393 #define FLOAT_TYPE_P(TYPE) \
394 (TREE_CODE (TYPE) == REAL_TYPE \
395 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
396 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
398 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
400 #define AGGREGATE_TYPE_P(TYPE) \
401 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
402 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
403 || TREE_CODE (TYPE) == SET_TYPE)
405 /* Nonzero if TYPE represents an unbounded pointer or unbounded
406 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
408 #define POINTER_TYPE_P(TYPE) \
409 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
411 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
413 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
414 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
416 /* Nonzero if TYPE represents a bounded pointer type. */
418 #define BOUNDED_POINTER_TYPE_P(TYPE) \
419 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
420 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
422 /* Nonzero if TYPE represents a bounded reference type. Bounded
423 reference types have two specific uses: (1) When a reference is
424 seated to a variable-length RECORD_TYPE that has an array of
425 indeterminate length as its final field. For all other objects, it
426 is sufficient to check bounds at the time the reference is seated,
427 and assume that all future uses of the reference are safe, since
428 the address of references cannot change. (2) When a reference
429 supertype is seated to an subtype object. The bounds "remember"
430 the true size of the complete object, so that subsequent upcasts of
431 the address of the reference will be checked properly (is such a
432 thing valid C++?). */
434 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
435 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
436 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
438 /* Nonzero if TYPE represents a pointer or reference type, either
439 bounded or unbounded. */
441 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
442 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
444 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
446 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
447 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
449 /* Nonzero if TYPE represents a reference type, either bounded or unbounded. */
451 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
452 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
454 /* Nonzero if this type is a complete type. */
455 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
457 /* Nonzero if this type is the (possibly qualified) void type. */
458 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
460 /* Nonzero if this type is complete or is cv void. */
461 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
462 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
464 /* Nonzero if this type is complete or is an array with unspecified bound. */
465 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
466 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE))
468 /* Nonzero if TYPE represents a type. */
470 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
472 /* Define many boolean fields that all tree nodes have. */
474 /* In VAR_DECL nodes, nonzero means address of this is needed.
475 So it cannot be in a register.
476 In a FUNCTION_DECL, nonzero means its address is needed.
477 So it must be compiled even if it is an inline function.
478 In a FIELD_DECL node, it means that the programmer is permitted to
479 construct the address of this field. This is used for aliasing
480 purposes: see record_component_aliases.
481 In CONSTRUCTOR nodes, it means object constructed must be in memory.
482 In LABEL_DECL nodes, it means a goto for this label has been seen
483 from a place outside all binding contours that restore stack levels.
484 In ..._TYPE nodes, it means that objects of this type must
485 be fully addressable. This means that pieces of this
486 object cannot go into register parameters, for example.
487 In IDENTIFIER_NODEs, this means that some extern decl for this name
488 had its address taken. That matters for inline functions. */
489 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
491 /* In a VAR_DECL, nonzero means allocate static storage.
492 In a FUNCTION_DECL, nonzero if function has been defined.
493 In a CONSTRUCTOR, nonzero means allocate static storage. */
494 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
496 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
497 made implicitly and should not lead to an "unused value" warning. */
498 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
500 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
501 chain is via a `virtual' declaration. */
502 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
504 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
505 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
506 requires a diagnostic when overflows occur in constant expressions. */
507 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
509 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
510 this string as an argument. */
511 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
513 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
514 overflow in folding, and no warning has been issued for this subexpression.
515 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
516 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
518 /* In a VAR_DECL or FUNCTION_DECL,
519 nonzero means name is to be accessible from outside this module.
520 In an identifier node, nonzero means an external declaration
521 accessible from outside this module was previously seen
522 for this name in an inner scope. */
523 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
525 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
526 base class is via a `public' declaration, which preserves public
527 fields from the base class as public. */
528 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
530 /* Ditto, for `private' declarations. */
531 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
533 /* Nonzero for TREE_LIST node means that the path to the
534 base class is via a `protected' declaration, which preserves
535 protected fields from the base class as protected.
537 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
539 /* In any expression, nonzero means it has side effects or reevaluation
540 of the whole expression could produce a different value.
541 This is set if any subexpression is a function call, a side effect
542 or a reference to a volatile variable.
543 In a ..._DECL, this is set only if the declaration said `volatile'. */
544 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
546 /* Nonzero means this expression is volatile in the C sense:
547 its address should be of type `volatile WHATEVER *'.
548 In other words, the declared item is volatile qualified.
549 This is used in _DECL nodes and _REF nodes.
551 In a ..._TYPE node, means this type is volatile-qualified.
552 But use TYPE_VOLATILE instead of this macro when the node is a type,
553 because eventually we may make that a different bit.
555 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
556 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
558 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
559 nonzero means it may not be the lhs of an assignment.
560 In a ..._TYPE node, means this type is const-qualified
561 (but the macro TYPE_READONLY should be used instead of this macro
562 when the node is a type). */
563 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
565 /* Value of expression is constant.
566 Always appears in all ..._CST nodes.
567 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
568 if the value is constant. */
569 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
571 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
572 In FIELD_DECL nodes, means an unsigned bit field.
573 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
574 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
576 #define TYPE_TRAP_SIGNED(NODE) (flag_trapv && ! TREE_UNSIGNED (NODE))
578 /* Nonzero in a VAR_DECL means assembler code has been written.
579 Nonzero in a FUNCTION_DECL means that the function has been compiled.
580 This is interesting in an inline function, since it might not need
581 to be compiled separately.
582 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
583 if the sdb debugging info for the type has been written.
584 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
585 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
587 /* Nonzero in a _DECL if the name is used in its scope.
588 Nonzero in an expr node means inhibit warning if value is unused.
589 In IDENTIFIER_NODEs, this means that some extern decl for this name
591 #define TREE_USED(NODE) ((NODE)->common.used_flag)
593 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
594 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
595 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
597 /* Used in classes in C++. */
598 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
599 /* Used in classes in C++.
600 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
601 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
603 /* In a ..._TYPE node, nonzero means that the type's size and layout,
604 (or the size and layout of its arguments and/or return value in the
605 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
606 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
607 node is a type, because eventually we may make that a different
608 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
609 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
610 BOUNDED_INDIRECT_TYPE_P to test for that.
612 In a FUNCTION_DECL, nonzero means that the size and layout of one
613 of its arguments and/or return value was changed by the presence of
614 pointer bounds. This value can differ from the value of
615 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
616 declared, then later called with pointer args, or was declared with
617 a variable argument list and is later called with pointer values in
618 the variable argument list.
620 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
621 of the decl's type's BOUNDED_POINTER_TYPE_P.
623 In a CONSTRUCTOR or other expression, nonzero means the value is a
624 bounded pointer. It is insufficient to determine the boundedness
625 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
626 since we allow pointer to be temporarily cast to integer for
627 rounding up to an alignment boudary in a way that preserves the
630 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
631 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
632 of a function that has bounded pointer(s) for its return type and/or
635 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
637 /* These flags are available for each language front end to use internally. */
638 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
639 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
640 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
641 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
642 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
643 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
644 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
646 /* Define additional fields and accessors for nodes representing constants. */
648 /* In an INTEGER_CST node. These two together make a 2-word integer.
649 If the data type is signed, the value is sign-extended to 2 words
650 even though not all of them may really be in use.
651 In an unsigned constant shorter than 2 words, the extra bits are 0. */
652 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
653 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
654 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
656 #define INT_CST_LT(A, B) \
657 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
658 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
659 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
661 #define INT_CST_LT_UNSIGNED(A, B) \
662 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
663 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
664 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
665 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
666 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
670 struct tree_common common;
671 struct rtx_def *rtl; /* acts as link to register transfer language
673 /* A sub-struct is necessary here because the function `const_hash'
674 wants to scan both words as a unit and taking the address of the
675 sub-struct yields the properly inclusive bounded pointer. */
677 unsigned HOST_WIDE_INT low;
682 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
683 and generally in all kinds of constants that could
684 be given labels (rather than being immediate). */
686 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
688 /* In a REAL_CST node. */
689 /* We can represent a real value as either a `double' or a string.
690 Strings don't allow for any optimization, but they do allow
691 for cross-compilation. */
693 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
699 struct tree_common common;
700 struct rtx_def *rtl; /* acts as link to register transfer language
702 REAL_VALUE_TYPE real_cst;
705 /* In a STRING_CST */
706 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
707 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
711 struct tree_common common;
712 struct rtx_def *rtl; /* acts as link to register transfer language
718 /* In a COMPLEX_CST node. */
719 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
720 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
724 struct tree_common common;
725 struct rtx_def *rtl; /* acts as link to register transfer language
727 union tree_node *real;
728 union tree_node *imag;
731 /* Define fields and accessors for some special-purpose tree nodes. */
733 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
734 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
736 struct tree_identifier
738 struct tree_common common;
743 /* In a TREE_LIST node. */
744 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
745 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
749 struct tree_common common;
750 union tree_node *purpose;
751 union tree_node *value;
754 /* In a TREE_VEC node. */
755 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
756 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
757 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
761 struct tree_common common;
763 union tree_node *a[1];
766 /* Define fields and accessors for some nodes that represent expressions. */
768 /* In a SAVE_EXPR node. */
769 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
770 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
771 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
772 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
773 both in normal code and in a handler. (Normally, in a handler, all
774 SAVE_EXPRs are unsaved, meaning that there values are
776 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
778 /* In a RTL_EXPR node. */
779 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
780 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
782 /* In a CONSTRUCTOR node. */
783 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
785 /* In ordinary expression nodes. */
786 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
787 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
789 /* In a LABELED_BLOCK_EXPR node. */
790 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
791 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
793 /* In a EXIT_BLOCK_EXPR node. */
794 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
795 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
797 /* In a LOOP_EXPR node. */
798 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
800 /* In a EXPR_WITH_FILE_LOCATION node. */
801 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
802 #define EXPR_WFL_FILENAME(NODE) \
803 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
804 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
805 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
806 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
807 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
808 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
809 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
810 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
814 struct tree_common common;
816 union tree_node *operands[1];
819 /* In a BLOCK node. */
820 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
821 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
822 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
823 /* Note: when changing this, make sure to find the places
824 that use chainon or nreverse. */
825 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
826 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
827 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
829 /* Nonzero means that this block is prepared to handle exceptions
830 listed in the BLOCK_VARS slot. */
831 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
833 /* Nonzero means the block was deleted as dead and should not be copied
834 when a function is inlined. */
835 #define BLOCK_DEAD(NODE) (BLOCK_CHECK (NODE)->block.dead_flag)
837 /* An index number for this block. These values are not guaranteed to
838 be unique across functions -- whether or not they are depends on
839 the debugging output format in use. */
840 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
844 struct tree_common common;
846 unsigned handler_block_flag : 1;
847 unsigned abstract_flag : 1;
848 unsigned dead_flag : 1;
849 unsigned block_num : 29;
851 union tree_node *vars;
852 union tree_node *subblocks;
853 union tree_node *supercontext;
854 union tree_node *abstract_origin;
857 /* Define fields and accessors for nodes representing data types. */
859 /* See tree.def for documentation of the use of these fields.
860 Look at the documentation of the various ..._TYPE tree codes. */
862 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
863 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
864 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
865 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
866 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
867 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
868 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
869 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
870 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
871 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
872 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
873 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
874 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
875 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
876 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
877 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
878 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
879 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
880 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
881 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
882 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
883 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
884 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
885 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
886 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
888 /* For a VECTOR_TYPE node, this describes a different type which is emitted
889 in the debugging output. We use this to describe a vector as a
890 structure containing an array. */
891 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
893 /* Indirect types present difficulties because they may be represented
894 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
895 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
896 be logically equivalent, but physically different. Simple
897 comparison of the main variant only tells if the types are
898 logically equivalent. Use this predicate to compare for physical
901 /* Types have the same main variant, and have the same boundedness. */
902 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
903 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
904 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
906 /* Return the type variant that has no qualifiers (i.e., the main variant),
907 except that the boundedness qualifier is preserved. */
908 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
909 (BOUNDED_POINTER_TYPE_P (TYPE) \
910 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
911 : TYPE_MAIN_VARIANT (TYPE))
913 /* For aggregate types, information about this type, as a base type
914 for itself. Used in a language-dependent way for types that are
915 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
916 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
918 /* The (language-specific) typed-based alias set for this type.
919 Objects whose TYPE_ALIAS_SETs are different cannot alias each
920 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
921 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
922 type can alias objects of any type. */
923 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
925 /* Nonzero iff the typed-based alias set for this type has been
927 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
928 (TYPE_CHECK (NODE)->type.alias_set != -1)
930 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
932 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
934 /* The alignment necessary for objects of this type.
935 The value is an int, measured in bits. */
936 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
938 /* 1 if the alignment for this type was requested by "aligned" attribute,
939 0 if it is the default for this type. */
940 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
942 /* The alignment for NODE, in bytes. */
943 #define TYPE_ALIGN_UNIT(NODE) \
944 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
946 /* If your language allows you to declare types, and you want debug info
947 for them, then you need to generate corresponding TYPE_DECL nodes.
948 These "stub" TYPE_DECL nodes have no name, and simply point at the
949 type node. You then set the TYPE_STUB_DECL field of the type node
950 to point back at the TYPE_DECL node. This allows the debug routines
951 to know that the two nodes represent the same type, so that we only
952 get one debug info record for them. */
953 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
955 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
956 has BLKmode only because it lacks the alignment requirement for
958 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
960 /* In an INTEGER_TYPE, it means the type represents a size. We use
961 this both for validity checking and to permit optimizations that
962 are unsafe for other types. Note that the C `size_t' type should
963 *not* have this flag set. The `size_t' type is simply a typedef
964 for an ordinary integer type that happens to be the type of an
965 expression returned by `sizeof'; `size_t' has no special
966 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
967 always actual sizes. */
968 #define TYPE_IS_SIZETYPE(NODE) \
969 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
971 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
972 pointer depressed. */
973 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
974 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
976 /* Nonzero in a type considered volatile as a whole. */
977 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
979 /* Means this type is const-qualified. */
980 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
982 /* If nonzero, this type is `restrict'-qualified, in the C sense of
984 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
986 /* If nonzero, this type's size and layout, (or the size and layout of
987 its arguments and/or return value in the case of a FUNCTION_TYPE or
988 METHOD_TYPE) was changed by the presence of pointer bounds. */
989 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
991 /* There is a TYPE_QUAL value for each type qualifier. They can be
992 combined by bitwise-or to form the complete set of qualifiers for a
995 #define TYPE_UNQUALIFIED 0x0
996 #define TYPE_QUAL_CONST 0x1
997 #define TYPE_QUAL_VOLATILE 0x2
998 #define TYPE_QUAL_RESTRICT 0x4
999 #define TYPE_QUAL_BOUNDED 0x8
1001 /* The set of type qualifiers for this type. */
1002 #define TYPE_QUALS(NODE) \
1003 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1004 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1005 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1006 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1008 /* The set of qualifiers pertinent to an expression node. */
1009 #define TREE_EXPR_QUALS(NODE) \
1010 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1011 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1012 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1014 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1015 #define TREE_FUNC_QUALS(NODE) \
1016 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1017 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1019 /* These flags are available for each language front end to use internally. */
1020 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1021 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1022 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1023 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1024 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1025 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1026 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1028 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1029 that distinguish string from array of char).
1030 If set in a SET_TYPE, indicates a bitstring type. */
1031 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1033 /* If non-NULL, this is a upper bound of the size (in bytes) of an
1034 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
1035 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
1037 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1038 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) (GET_MODE_NUNITS (TYPE_CHECK (VECTOR_TYPE)->type.mode))
1040 /* Indicates that objects of this type must be initialized by calling a
1041 function when they are created. */
1042 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1043 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1045 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1046 the same way that the first union alternative would be passed. */
1047 #define TYPE_TRANSPARENT_UNION(NODE) \
1048 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1050 /* For an ARRAY_TYPE, indicates that it is not permitted to
1051 take the address of a component of the type. */
1052 #define TYPE_NONALIASED_COMPONENT(NODE) \
1053 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1055 /* Indicated that objects of this type should be laid out in as
1056 compact a way as possible. */
1057 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1059 /* A bounded pointer or bounded reference type (collectively called
1060 indirect types) is represented as a RECORD_TYPE node containing
1061 three pointer fields whose type is the corresponding unbounded
1062 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1063 a bounded indirect type differs from a normal RECORD_TYPE node in
1064 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1065 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1066 nodes are stored on the same type variant chain alongside the
1067 variants of the underlaying indirect types nodes. The main variant
1068 of such chains is always the unbounded type. */
1070 /* Access the field decls of a bounded-pointer type. */
1071 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1072 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1073 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1075 /* Access the simple-pointer subtype of a bounded-pointer type. */
1076 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1078 /* Find the unbounded counterpart to a type, or return TYPE if it is
1079 already unbounded. */
1080 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1081 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1083 /* This field comprises two bits, for values in the range 0..3:
1085 depth=0 means that type is a scalar, or an aggregate that contains
1086 only depth=0 types, or a function that has only depth=0 types for
1087 its return value and argument types.
1089 depth=1 means that type is a pointer to a depth=0 type, or an
1090 aggregate that contains only depth=0 and depth=1 types, or a
1091 function that has only depth=0 and depth=1 types for its return
1092 value and argument types.
1094 The meanings of depth=2 and depth=3 are obvious by induction.
1095 Varargs functions are depth=3. The type `va_list' is depth=3.
1097 The purpose of measuring pointer depth of a type is to determine
1098 the eligibility of a function for an automatically-generated
1099 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1100 depth=1 function is eligible for an automatic thunk. Functions
1101 with depth 2 or more are too complex to get automatic thunks.
1103 Function decls also have a pointer_depth field, since we also
1104 consider the actual argument types for functions. */
1106 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1108 /* In a FUNCTION_TYPE node, this bit stores the value of
1109 default_pointer_boundedness at the time TYPE was created. It is
1110 useful for choosing default boundedness of function arguments for
1111 non-prototype function decls and for varargs/stdarg lists. */
1112 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1113 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1115 #define MAX_POINTER_DEPTH 2
1116 #define VA_LIST_POINTER_DEPTH 3
1120 struct tree_common common;
1121 union tree_node *values;
1122 union tree_node *size;
1123 union tree_node *size_unit;
1124 union tree_node *attributes;
1127 unsigned int precision : 9;
1128 ENUM_BITFIELD(machine_mode) mode : 7;
1130 unsigned string_flag : 1;
1131 unsigned no_force_blk_flag : 1;
1132 unsigned needs_constructing_flag : 1;
1133 unsigned transparent_union_flag : 1;
1134 unsigned packed_flag : 1;
1135 unsigned restrict_flag : 1;
1136 unsigned pointer_depth : 2;
1138 unsigned lang_flag_0 : 1;
1139 unsigned lang_flag_1 : 1;
1140 unsigned lang_flag_2 : 1;
1141 unsigned lang_flag_3 : 1;
1142 unsigned lang_flag_4 : 1;
1143 unsigned lang_flag_5 : 1;
1144 unsigned lang_flag_6 : 1;
1145 unsigned user_align : 1;
1148 union tree_node *pointer_to;
1149 union tree_node *reference_to;
1150 union {int address; char *pointer; } symtab;
1151 union tree_node *name;
1152 union tree_node *minval;
1153 union tree_node *maxval;
1154 union tree_node *next_variant;
1155 union tree_node *main_variant;
1156 union tree_node *binfo;
1157 union tree_node *noncopied_parts;
1158 union tree_node *context;
1159 HOST_WIDE_INT alias_set;
1160 /* Points to a structure whose details depend on the language in use. */
1161 struct lang_type *lang_specific;
1164 /* Define accessor macros for information about type inheritance
1167 A "basetype" means a particular usage of a data type for inheritance
1168 in another type. Each such basetype usage has its own "binfo"
1169 object to describe it. The binfo object is a TREE_VEC node.
1171 Inheritance is represented by the binfo nodes allocated for a
1172 given type. For example, given types C and D, such that D is
1173 inherited by C, 3 binfo nodes will be allocated: one for describing
1174 the binfo properties of C, similarly one for D, and one for
1175 describing the binfo properties of D as a base type for C.
1176 Thus, given a pointer to class C, one can get a pointer to the binfo
1177 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1179 /* The actual data type node being inherited in this basetype. */
1180 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1182 /* The offset where this basetype appears in its containing type.
1183 BINFO_OFFSET slot holds the offset (in bytes)
1184 from the base of the complete object to the base of the part of the
1185 object that is allocated on behalf of this `type'.
1186 This is always 0 except when there is multiple inheritance. */
1188 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1189 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1190 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1192 /* The virtual function table belonging to this basetype. Virtual
1193 function tables provide a mechanism for run-time method dispatching.
1194 The entries of a virtual function table are language-dependent. */
1196 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1197 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1199 /* The virtual functions in the virtual function table. This is
1200 a TREE_LIST that is used as an initial approximation for building
1201 a virtual function table for this basetype. */
1202 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1203 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1205 /* A vector of binfos for the direct basetypes inherited by this
1208 If this basetype describes type D as inherited in C, and if the
1209 basetypes of D are E and F, then this vector contains binfos for
1210 inheritance of E and F by C.
1212 ??? This could probably be done by just allocating the
1213 base types at the end of this TREE_VEC (instead of using
1214 another TREE_VEC). This would simplify the calculation
1215 of how many basetypes a given type had. */
1216 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1217 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1219 /* The number of basetypes for NODE. */
1220 #define BINFO_N_BASETYPES(NODE) \
1221 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1223 /* Accessor macro to get to the Nth basetype of this basetype. */
1224 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1225 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1227 /* For a BINFO record describing a virtual base class, i.e., one where
1228 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1229 base. The actual contents are language-dependent. Under the old
1230 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1231 pointer to the virtual base; under the new ABI this field is
1232 instead a INTEGER_CST giving an offset into the vtable where the
1233 offset to the virtual base can be found. */
1234 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1236 /* The size of a base class subobject of this type. Not all frontends
1237 currently allocate the space for these fields. */
1238 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1239 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1240 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1241 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1243 /* Slot used to build a chain that represents a use of inheritance.
1244 For example, if X is derived from Y, and Y is derived from Z,
1245 then this field can be used to link the binfo node for X to
1246 the binfo node for X's Y to represent the use of inheritance
1247 from X to Y. Similarly, this slot of the binfo node for X's Y
1248 can point to the Z from which Y is inherited (in X's inheritance
1249 hierarchy). In this fashion, one can represent and traverse specific
1250 uses of inheritance using the binfo nodes themselves (instead of
1251 consing new space pointing to binfo nodes).
1252 It is up to the language-dependent front-ends to maintain
1253 this information as necessary. */
1254 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1256 /* Define fields and accessors for nodes representing declared names. */
1258 /* Nonzero if DECL represents a decl. */
1259 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1260 /* This is the name of the object as written by the user.
1261 It is an IDENTIFIER_NODE. */
1262 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1263 /* This is the name of the object as the assembler will see it
1264 (but before any translations made by ASM_OUTPUT_LABELREF).
1265 Often this is the same as DECL_NAME.
1266 It is an IDENTIFIER_NODE. */
1267 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1268 /* Records the section name in a section attribute. Used to pass
1269 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1270 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1271 /* For FIELD_DECLs, this is the
1272 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1273 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1274 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1275 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1276 type, or NULL_TREE if the given decl has "file scope". */
1277 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1278 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1279 /* In a DECL this is the field where configuration dependent machine
1280 attributes are store */
1281 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1282 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1283 byte containing the bit closest to the beginning of the structure. */
1284 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1285 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1286 field from DECL_FIELD_OFFSET. */
1287 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1288 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1289 if so, the type that was originally specified for it.
1290 TREE_TYPE may have been modified (in finish_struct). */
1291 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1292 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1293 /* VAR_DECL and PARM_DECL reserve the arguments slot
1294 for language-specific uses. */
1295 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1296 /* This field is used to reference anything in decl.result and is meant only
1297 for use by the garbage collector. */
1298 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1299 /* In FUNCTION_DECL, holds the decl for the return value. */
1300 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1301 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1302 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1303 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1304 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1305 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1306 For a VAR_DECL, holds the initial value.
1307 For a PARM_DECL, not used--default
1308 values for parameters are encoded in the type of the function,
1309 not in the PARM_DECL slot. */
1310 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1311 /* For a PARM_DECL, records the data type used to pass the argument,
1312 which may be different from the type seen in the program. */
1313 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1314 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1315 if nonzero, indicates that the field occupies the type. */
1316 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1317 /* These two fields describe where in the source code the declaration was. */
1318 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1319 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1320 /* Holds the size of the datum, in bits, as a tree expression.
1321 Need not be constant. */
1322 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1323 /* Likewise for the size in bytes. */
1324 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1325 /* Holds the alignment required for the datum, in bits. */
1326 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1327 /* The alignment of NODE, in bytes. */
1328 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1329 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1330 DECL_FIELD_OFFSET which are known to be always zero.
1331 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1333 #define DECL_OFFSET_ALIGN(NODE) \
1334 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1335 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1336 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1337 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1338 /* 1 if the alignment for this type was requested by "aligned" attribute,
1339 0 if it is the default for this type. */
1340 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1341 /* Holds the machine mode corresponding to the declaration of a variable or
1342 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1344 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1345 /* Holds the RTL expression for the value of a variable or function. If
1346 PROMOTED_MODE is defined, the mode of this expression may not be same
1347 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1348 to the variable's data type, while the mode
1349 of DECL_RTL is the mode actually used to contain the data. */
1350 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1351 /* Holds an INSN_LIST of all of the live ranges in which the variable
1352 has been moved to a possibly different register. */
1353 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1354 /* For PARM_DECL, holds an RTL for the stack slot or register
1355 where the data was actually passed. */
1356 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1357 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1358 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1359 /* For FUNCTION_DECL, if it is inline,
1360 holds the size of the stack frame, as an integer. */
1361 #define DECL_FRAME_SIZE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.i)
1362 /* For FUNCTION_DECL, if it is built-in,
1363 this identifies which built-in operation it is. */
1364 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1366 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1367 Before the struct containing the FUNCTION_DECL is laid out,
1368 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1369 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1370 function. When the class is laid out, this pointer is changed
1371 to an INTEGER_CST node which is suitable for use as an index
1372 into the virtual function table. */
1373 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1374 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1375 which this FIELD_DECL is defined. This information is needed when
1376 writing debugging information about vfield and vbase decls for C++. */
1377 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1379 /* Every ..._DECL node gets a unique number. */
1380 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1382 /* For any sort of a ..._DECL node, this points to the original (abstract)
1383 decl node which this decl is an instance of, or else it is NULL indicating
1384 that this decl is not an instance of some other decl. For example,
1385 in a nested declaration of an inline function, this points back to the
1387 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1389 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1390 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1391 #define DECL_ORIGIN(NODE) \
1392 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1394 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1395 inline instance of some original (abstract) decl from an inline function;
1396 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1397 nodes can also have their abstract origin set to themselves. */
1398 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1399 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1401 /* Nonzero if a _DECL means that the name of this decl should be ignored
1402 for symbolic debug purposes. */
1403 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1405 /* Nonzero for a given ..._DECL node means that this node represents an
1406 "abstract instance" of the given declaration (e.g. in the original
1407 declaration of an inline function). When generating symbolic debugging
1408 information, we mustn't try to generate any address information for nodes
1409 marked as "abstract instances" because we don't actually generate
1410 any code or allocate any data space for such instances. */
1411 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1413 /* Nonzero if a _DECL means that no warnings should be generated just
1414 because this decl is unused. */
1415 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1417 /* Nonzero for a given ..._DECL node means that this node should be
1418 put in .common, if possible. If a DECL_INITIAL is given, and it
1419 is not error_mark_node, then the decl cannot be put in .common. */
1420 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1422 /* Language-specific decl information. */
1423 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1425 /* In a VAR_DECL or FUNCTION_DECL,
1426 nonzero means external reference:
1427 do not allocate storage, and refer to a definition elsewhere. */
1428 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1430 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1432 #define DEFAULT_INIT_PRIORITY 65535
1433 #define MAX_INIT_PRIORITY 65535
1434 #define MAX_RESERVED_INIT_PRIORITY 100
1437 nonzero means the detail info about this type is not dumped into stabs.
1438 Instead it will generate cross reference ('x') of names.
1439 This uses the same flag as DECL_EXTERNAL. */
1440 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1441 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1443 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1444 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1445 /* In LABEL_DECL nodes, nonzero means that an error message about
1446 jumping into such a binding contour has been printed for this label. */
1447 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1448 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1449 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1450 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1451 static chain is not needed. */
1452 #define DECL_NO_STATIC_CHAIN(NODE) \
1453 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1455 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1456 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1458 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1460 Also set in some languages for variables, etc., outside the normal
1461 lexical scope, such as class instance variables. */
1462 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1464 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1465 where it is called. */
1466 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1468 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1469 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1471 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1472 that is not specified by ansi C and that users are supposed to be allowed
1473 to redefine for any purpose whatever. */
1474 #define DECL_BUILT_IN_NONANSI(NODE) \
1475 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1477 /* Nonzero in a FUNCTION_DECL means this function should be treated
1478 as if it were a malloc, meaning it returns a pointer that is
1480 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1482 /* Nonzero in a FUNCTION_DECL means this function should be treated
1483 as "pure" function (like const function, but may read global memory). */
1484 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1486 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1488 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1489 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1490 contour that restored a stack level and which is now exited. */
1491 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1493 /* Unused in FUNCTION_DECL. */
1495 /* In a VAR_DECL that's static,
1496 nonzero if the space is in the text section. */
1497 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1499 /* In a FUNCTION_DECL, nonzero means a built in function. */
1500 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1501 /* For a builtin function, identify which part of the compiler defined it. */
1502 #define DECL_BUILT_IN_CLASS(NODE) \
1503 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1505 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1506 Used in FIELD_DECLs for vtable pointers.
1507 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1508 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1510 /* Used to indicate that the linkage status of this DECL is not yet known,
1511 so it should not be output now. */
1512 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1514 /* Used in PARM_DECLs whose type are unions to indicate that the
1515 argument should be passed in the same way that the first union
1516 alternative would be passed. */
1517 #define DECL_TRANSPARENT_UNION(NODE) \
1518 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1520 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1521 at the beginning or end of execution. */
1522 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1523 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1525 #define DECL_STATIC_DESTRUCTOR(NODE) \
1526 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1528 /* Used to indicate that this DECL represents a compiler-generated entity. */
1529 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1531 /* Used to indicate that this DECL has weak linkage. */
1532 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1534 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1535 multiple translation units should be merged. */
1536 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1538 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1539 not be put out unless it is needed in this translation unit.
1540 Entities like this are shared across translation units (like weak
1541 entities), but are guaranteed to be generated by any translation
1542 unit that needs them, and therefore need not be put out anywhere
1543 where they are not needed. DECL_COMDAT is just a hint to the
1544 back-end; it is up to front-ends which set this flag to ensure
1545 that there will never be any harm, other than bloat, in putting out
1546 something which is DECL_COMDAT. */
1547 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1549 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1550 be instrumented with calls to support routines. */
1551 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1552 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1554 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1555 disabled in this function. */
1556 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) \
1557 (FUNCTION_DECL_CHECK (NODE)->decl.no_check_memory_usage)
1559 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1560 disabled in this function. */
1561 #define DECL_NO_LIMIT_STACK(NODE) \
1562 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1564 /* Additional flags for language-specific uses. */
1565 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1566 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1567 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1568 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1569 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1570 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1571 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1572 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1574 /* Used to indicate that the pointer to this DECL cannot be treated as
1575 an address constant. */
1576 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1578 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1580 #define DECL_NONADDRESSABLE_P(NODE) \
1581 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1583 /* Used to indicate an alias set for the memory pointed to by this
1584 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1585 pointer (or reference) type. */
1586 #define DECL_POINTER_ALIAS_SET(NODE) \
1587 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1589 /* Nonzero if an alias set has been assigned to this declaration. */
1590 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1591 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1593 /* The pointer_depth field comprises two bits for values in the range
1594 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1595 type node, but for functions it migth be greater. For example,
1596 this can happen when the function is declared to accept a parameter
1597 of type void* (depth=1), but is actually called with an argument of
1598 type foo** (depth=2). The function type will get the formal
1599 parameter's depth, but the function decl will get the actual
1600 argument's depth. */
1601 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1605 struct tree_common common;
1606 const char *filename;
1609 union tree_node *size;
1610 ENUM_BITFIELD(machine_mode) mode : 8;
1612 unsigned external_flag : 1;
1613 unsigned nonlocal_flag : 1;
1614 unsigned regdecl_flag : 1;
1615 unsigned inline_flag : 1;
1616 unsigned bit_field_flag : 1;
1617 unsigned virtual_flag : 1;
1618 unsigned ignored_flag : 1;
1619 unsigned abstract_flag : 1;
1621 unsigned in_system_header_flag : 1;
1622 unsigned common_flag : 1;
1623 unsigned defer_output : 1;
1624 unsigned transparent_union : 1;
1625 unsigned static_ctor_flag : 1;
1626 unsigned static_dtor_flag : 1;
1627 unsigned artificial_flag : 1;
1628 unsigned weak_flag : 1;
1630 unsigned non_addr_const_p : 1;
1631 unsigned no_instrument_function_entry_exit : 1;
1632 unsigned no_check_memory_usage : 1;
1633 unsigned comdat_flag : 1;
1634 unsigned malloc_flag : 1;
1635 unsigned no_limit_stack : 1;
1636 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1638 unsigned pure_flag : 1;
1639 unsigned pointer_depth : 2;
1640 unsigned non_addressable : 1;
1641 unsigned user_align : 1;
1642 unsigned uninlinable : 1;
1643 /* Two unused bits. */
1645 unsigned lang_flag_0 : 1;
1646 unsigned lang_flag_1 : 1;
1647 unsigned lang_flag_2 : 1;
1648 unsigned lang_flag_3 : 1;
1649 unsigned lang_flag_4 : 1;
1650 unsigned lang_flag_5 : 1;
1651 unsigned lang_flag_6 : 1;
1652 unsigned lang_flag_7 : 1;
1654 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1655 If built-in, this is the code for which built-in function.
1656 For other kinds of decls, this is DECL_ALIGN and DECL_OFFSET_ALIGN. */
1659 enum built_in_function f;
1660 struct {unsigned int align : 24; unsigned int off_align : 8;} a;
1663 union tree_node *size_unit;
1664 union tree_node *name;
1665 union tree_node *context;
1666 union tree_node *arguments; /* Also used for DECL_FIELD_OFFSET */
1667 union tree_node *result; /* Also used for DECL_BIT_FIELD_TYPE */
1668 union tree_node *initial; /* Also used for DECL_QUALIFIER */
1669 union tree_node *abstract_origin;
1670 union tree_node *assembler_name;
1671 union tree_node *section_name;
1672 union tree_node *machine_attributes;
1673 struct rtx_def *rtl; /* RTL representation for object. */
1674 struct rtx_def *live_range_rtl;
1676 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1677 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1678 In PARM_DECL, holds an RTL for the stack slot
1679 of register where the data was actually passed.
1680 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1688 union tree_node *vindex;
1689 HOST_WIDE_INT pointer_alias_set;
1690 /* Points to a structure whose details depend on the language in use. */
1691 struct lang_decl *lang_specific;
1694 /* Define the overall contents of a tree node.
1695 It may be any of the structures declared above
1696 for various types of node. */
1700 struct tree_common common;
1701 struct tree_int_cst int_cst;
1702 struct tree_real_cst real_cst;
1703 struct tree_string string;
1704 struct tree_complex complex;
1705 struct tree_identifier identifier;
1706 struct tree_decl decl;
1707 struct tree_type type;
1708 struct tree_list list;
1709 struct tree_vec vec;
1710 struct tree_exp exp;
1711 struct tree_block block;
1714 /* Standard named or nameless data types of the C compiler. */
1733 TI_INTEGER_MINUS_ONE,
1743 TI_COMPLEX_INTEGER_TYPE,
1744 TI_COMPLEX_FLOAT_TYPE,
1745 TI_COMPLEX_DOUBLE_TYPE,
1746 TI_COMPLEX_LONG_DOUBLE_TYPE,
1750 TI_LONG_DOUBLE_TYPE,
1771 extern tree global_trees[TI_MAX];
1773 #define error_mark_node global_trees[TI_ERROR_MARK]
1775 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1776 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1777 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1778 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1779 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1781 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1782 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1783 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1784 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1785 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1787 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1788 #define integer_one_node global_trees[TI_INTEGER_ONE]
1789 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
1790 #define size_zero_node global_trees[TI_SIZE_ZERO]
1791 #define size_one_node global_trees[TI_SIZE_ONE]
1792 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1793 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1794 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1796 #define null_pointer_node global_trees[TI_NULL_POINTER]
1798 #define float_type_node global_trees[TI_FLOAT_TYPE]
1799 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1800 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1802 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1803 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1804 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1805 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1807 #define void_type_node global_trees[TI_VOID_TYPE]
1808 /* The C type `void *'. */
1809 #define ptr_type_node global_trees[TI_PTR_TYPE]
1810 /* The C type `const void *'. */
1811 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1812 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1813 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1815 /* The node that should be placed at the end of a parameter list to
1816 indicate that the function does not take a variable number of
1817 arguments. The TREE_VALUE will be void_type_node and there will be
1818 no TREE_CHAIN. Language-independent code should not assume
1819 anything else about this node. */
1820 #define void_list_node global_trees[TI_VOID_LIST_NODE]
1822 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
1823 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
1825 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
1826 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
1827 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
1828 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
1829 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
1831 /* An enumeration of the standard C integer types. These must be
1832 ordered so that shorter types appear before longer ones. */
1833 enum integer_type_kind
1845 itk_unsigned_long_long,
1849 typedef enum integer_type_kind integer_type_kind;
1851 /* The standard C integer types. Use integer_type_kind to index into
1853 extern tree integer_types[itk_none];
1855 #define char_type_node integer_types[itk_char]
1856 #define signed_char_type_node integer_types[itk_signed_char]
1857 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1858 #define short_integer_type_node integer_types[itk_short]
1859 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1860 #define integer_type_node integer_types[itk_int]
1861 #define unsigned_type_node integer_types[itk_unsigned_int]
1862 #define long_integer_type_node integer_types[itk_long]
1863 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1864 #define long_long_integer_type_node integer_types[itk_long_long]
1865 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1868 #define NULL_TREE (tree) NULL
1870 /* The following functions accept a wide integer argument. Rather than
1871 having to cast on every function call, we use a macro instead, that is
1872 defined here and in rtl.h. */
1875 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1876 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1878 extern int exact_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1879 extern int floor_log2_wide PARAMS ((unsigned HOST_WIDE_INT));
1881 /* Approximate positive square root of a host double. This is for
1882 statistical reports, not code generation. */
1883 extern double approx_sqrt PARAMS ((double));
1885 extern char *permalloc PARAMS ((int));
1886 extern char *expralloc PARAMS ((int));
1888 /* Compute the number of bytes occupied by 'node'. This routine only
1889 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
1891 extern size_t tree_size PARAMS ((tree));
1893 /* Lowest level primitive for allocating a node.
1894 The TREE_CODE is the only argument. Contents are initialized
1895 to zero except for a few of the common fields. */
1897 extern tree make_node PARAMS ((enum tree_code));
1898 extern tree make_lang_type PARAMS ((enum tree_code));
1899 extern tree (*make_lang_type_fn) PARAMS ((enum tree_code));
1901 /* Make a copy of a node, with all the same contents except
1902 for TREE_PERMANENT. (The copy is permanent
1903 iff nodes being made now are permanent.) */
1905 extern tree copy_node PARAMS ((tree));
1907 /* Make a copy of a chain of TREE_LIST nodes. */
1909 extern tree copy_list PARAMS ((tree));
1911 /* Make a TREE_VEC. */
1913 extern tree make_tree_vec PARAMS ((int));
1915 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1916 The name is supplied as a char *. */
1918 extern tree get_identifier PARAMS ((const char *));
1920 /* If an identifier with the name TEXT (a null-terminated string) has
1921 previously been referred to, return that node; otherwise return
1924 extern tree maybe_get_identifier PARAMS ((const char *));
1926 /* Look up an identifier with the name TEXT, replace its identifier
1927 node with NODE, and return the old identifier node. This is used
1928 by languages which need to enable and disable keywords based on
1929 context; e.g. see remember_protocol_qualifiers in objc/objc-act.c. */
1931 extern tree set_identifier PARAMS ((const char *, tree));
1933 /* Construct various types of nodes. */
1935 #define build_int_2(LO,HI) \
1936 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1938 extern tree build PARAMS ((enum tree_code, tree, ...));
1939 extern tree build_nt PARAMS ((enum tree_code, ...));
1941 extern tree build_int_2_wide PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT));
1942 extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE));
1943 extern tree build_real_from_int_cst PARAMS ((tree, tree));
1944 extern tree build_complex PARAMS ((tree, tree, tree));
1945 extern tree build_string PARAMS ((int, const char *));
1946 extern tree build1 PARAMS ((enum tree_code, tree, tree));
1947 extern tree build_tree_list PARAMS ((tree, tree));
1948 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
1949 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
1950 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
1952 /* Construct various nodes representing data types. */
1954 extern tree make_signed_type PARAMS ((int));
1955 extern tree make_unsigned_type PARAMS ((int));
1956 extern void initialize_sizetypes PARAMS ((void));
1957 extern void set_sizetype PARAMS ((tree));
1958 extern tree signed_or_unsigned_type PARAMS ((int, tree));
1959 extern void fixup_unsigned_type PARAMS ((tree));
1960 extern tree build_pointer_type PARAMS ((tree));
1961 extern tree build_reference_type PARAMS ((tree));
1962 extern tree build_type_no_quals PARAMS ((tree));
1963 extern tree build_index_type PARAMS ((tree));
1964 extern tree build_index_2_type PARAMS ((tree, tree));
1965 extern tree build_array_type PARAMS ((tree, tree));
1966 extern tree build_function_type PARAMS ((tree, tree));
1967 extern tree build_method_type PARAMS ((tree, tree));
1968 extern tree build_offset_type PARAMS ((tree, tree));
1969 extern tree build_complex_type PARAMS ((tree));
1970 extern tree array_type_nelts PARAMS ((tree));
1972 extern tree value_member PARAMS ((tree, tree));
1973 extern tree purpose_member PARAMS ((tree, tree));
1974 extern tree binfo_member PARAMS ((tree, tree));
1975 extern unsigned int attribute_hash_list PARAMS ((tree));
1976 extern int attribute_list_equal PARAMS ((tree, tree));
1977 extern int attribute_list_contained PARAMS ((tree, tree));
1978 extern int tree_int_cst_equal PARAMS ((tree, tree));
1979 extern int tree_int_cst_lt PARAMS ((tree, tree));
1980 extern int tree_int_cst_compare PARAMS ((tree, tree));
1981 extern int host_integerp PARAMS ((tree, int));
1982 extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
1983 extern int tree_int_cst_msb PARAMS ((tree));
1984 extern int tree_int_cst_sgn PARAMS ((tree));
1985 extern int tree_expr_nonnegative_p PARAMS ((tree));
1986 extern int rtl_expr_nonnegative_p PARAMS ((struct rtx_def *));
1987 extern int index_type_equal PARAMS ((tree, tree));
1988 extern tree get_inner_array_type PARAMS ((tree));
1990 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1991 put the prototype here. Rtl.h does declare the prototype if
1992 tree.h had been included. */
1994 extern tree make_tree PARAMS ((tree, struct rtx_def *));
1996 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1999 Such modified types already made are recorded so that duplicates
2002 extern tree build_type_attribute_variant PARAMS ((tree, tree));
2003 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
2005 extern tree merge_machine_decl_attributes PARAMS ((tree, tree));
2006 extern tree merge_machine_type_attributes PARAMS ((tree, tree));
2008 /* Split a list of declspecs and attributes into two. */
2010 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2012 /* Strip attributes from a list of combined specs and attrs. */
2014 extern tree strip_attrs PARAMS ((tree));
2016 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2018 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
2020 /* Given a tree node and a string, return non-zero if the tree node is
2021 a valid attribute name for the string. */
2023 extern int is_attribute_p PARAMS ((const char *, tree));
2025 /* Given an attribute name and a list of attributes, return the list element
2026 of the attribute or NULL_TREE if not found. */
2028 extern tree lookup_attribute PARAMS ((const char *, tree));
2030 /* Given two attributes lists, return a list of their union. */
2032 extern tree merge_attributes PARAMS ((tree, tree));
2034 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
2035 the same kind of data as TYPE describes. Variants point to the
2036 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
2037 and it points to a chain of other variants so that duplicate
2038 variants are never made. Only main variants should ever appear as
2039 types of expressions. */
2041 extern tree build_qualified_type PARAMS ((tree, int));
2043 /* Like build_qualified_type, but only deals with the `const' and
2044 `volatile' qualifiers. This interface is retained for backwards
2045 compatiblity with the various front-ends; new code should use
2046 build_qualified_type instead. */
2048 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2049 build_qualified_type (TYPE, \
2050 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2051 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2053 /* Make a copy of a type node. */
2055 extern tree build_type_copy PARAMS ((tree));
2057 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2058 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2059 node, does nothing except for the first time. */
2061 extern void layout_type PARAMS ((tree));
2063 /* These functions allow a front-end to perform a manual layout of a
2064 RECORD_TYPE. (For instance, if the placement of subsequent fields
2065 depends on the placement of fields so far.) Begin by calling
2066 start_record_layout. Then, call place_field for each of the
2067 fields. Then, call finish_record_layout. See layout_type for the
2068 default way in which these functions are used. */
2070 typedef struct record_layout_info_s
2072 /* The RECORD_TYPE that we are laying out. */
2074 /* The offset into the record so far, in bytes, not including bits in
2077 /* The last known alignment of SIZE. */
2078 unsigned int offset_align;
2079 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2081 /* The alignment of the record so far, in bits. */
2082 unsigned int record_align;
2083 /* The alignment of the record so far, not including padding, in bits. */
2084 unsigned int unpacked_align;
2085 /* The static variables (i.e., class variables, as opposed to
2086 instance variables) encountered in T. */
2087 tree pending_statics;
2088 int packed_maybe_necessary;
2089 } *record_layout_info;
2091 extern record_layout_info start_record_layout PARAMS ((tree));
2092 extern tree bit_from_pos PARAMS ((tree, tree));
2093 extern tree byte_from_pos PARAMS ((tree, tree));
2094 extern void pos_from_byte PARAMS ((tree *, tree *, unsigned int,
2096 extern void pos_from_bit PARAMS ((tree *, tree *, unsigned int,
2098 extern void normalize_offset PARAMS ((tree *, tree *,
2100 extern tree rli_size_unit_so_far PARAMS ((record_layout_info));
2101 extern tree rli_size_so_far PARAMS ((record_layout_info));
2102 extern void normalize_rli PARAMS ((record_layout_info));
2103 extern void place_field PARAMS ((record_layout_info, tree));
2104 extern void compute_record_mode PARAMS ((tree));
2105 extern void finish_record_layout PARAMS ((record_layout_info));
2107 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2108 return a canonicalized ..._TYPE node, so that duplicates are not made.
2109 How the hash code is computed is up to the caller, as long as any two
2110 callers that could hash identical-looking type nodes agree. */
2112 extern tree type_hash_canon PARAMS ((unsigned int, tree));
2114 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2115 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2116 fields. Call this only once for any given decl node.
2118 Second argument is the boundary that this field can be assumed to
2119 be starting at (in bits). Zero means it can be assumed aligned
2120 on any boundary that may be needed. */
2122 extern void layout_decl PARAMS ((tree, unsigned));
2124 /* Return the mode for data of a given size SIZE and mode class CLASS.
2125 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2126 The value is BLKmode if no other mode is found. This is like
2127 mode_for_size, but is passed a tree. */
2129 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
2132 /* Return an expr equal to X but certainly not valid as an lvalue. */
2134 extern tree non_lvalue PARAMS ((tree));
2135 extern tree pedantic_non_lvalue PARAMS ((tree));
2137 extern tree convert PARAMS ((tree, tree));
2138 extern unsigned int expr_align PARAMS ((tree));
2139 extern tree size_in_bytes PARAMS ((tree));
2140 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
2141 extern tree bit_position PARAMS ((tree));
2142 extern HOST_WIDE_INT int_bit_position PARAMS ((tree));
2143 extern tree byte_position PARAMS ((tree));
2144 extern HOST_WIDE_INT int_byte_position PARAMS ((tree));
2146 /* Define data structures, macros, and functions for handling sizes
2147 and the various types used to represent sizes. */
2151 SIZETYPE, /* Normal representation of sizes in bytes. */
2152 SSIZETYPE, /* Signed representation of sizes in bytes. */
2153 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2154 BITSIZETYPE, /* Normal representation of sizes in bits. */
2155 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2156 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
2159 extern tree sizetype_tab[(int) TYPE_KIND_LAST];
2161 #define sizetype sizetype_tab[(int) SIZETYPE]
2162 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2163 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2164 #define usizetype sizetype_tab[(int) USIZETYPE]
2165 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2166 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2168 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
2169 extern tree size_diffop PARAMS ((tree, tree));
2170 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
2171 enum size_type_kind));
2172 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
2174 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2175 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2176 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2177 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2178 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2180 extern tree round_up PARAMS ((tree, int));
2181 extern tree round_down PARAMS ((tree, int));
2182 extern tree get_pending_sizes PARAMS ((void));
2183 extern int is_pending_size PARAMS ((tree));
2184 extern void put_pending_size PARAMS ((tree));
2185 extern void put_pending_sizes PARAMS ((tree));
2187 /* Type for sizes of data-type. */
2189 #define BITS_PER_UNIT_LOG \
2190 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2191 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2192 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2194 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2195 extern unsigned int maximum_field_alignment;
2197 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
2198 extern unsigned int set_alignment;
2200 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2201 by making the last node in X point to Y.
2202 Returns X, except if X is 0 returns Y. */
2204 extern tree chainon PARAMS ((tree, tree));
2206 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2208 extern tree tree_cons PARAMS ((tree, tree, tree));
2210 /* Return the last tree node in a chain. */
2212 extern tree tree_last PARAMS ((tree));
2214 /* Reverse the order of elements in a chain, and return the new head. */
2216 extern tree nreverse PARAMS ((tree));
2218 /* Returns the length of a chain of nodes
2219 (number of chain pointers to follow before reaching a null pointer). */
2221 extern int list_length PARAMS ((tree));
2223 /* Returns the number of FIELD_DECLs in a type. */
2225 extern int fields_length PARAMS ((tree));
2227 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2229 extern int integer_zerop PARAMS ((tree));
2231 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2233 extern int integer_onep PARAMS ((tree));
2235 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2236 all of whose significant bits are 1. */
2238 extern int integer_all_onesp PARAMS ((tree));
2240 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2241 exactly one bit 1. */
2243 extern int integer_pow2p PARAMS ((tree));
2245 /* staticp (tree x) is nonzero if X is a reference to data allocated
2246 at a fixed address in memory. */
2248 extern int staticp PARAMS ((tree));
2250 /* Gets an error if argument X is not an lvalue.
2251 Also returns 1 if X is an lvalue, 0 if not. */
2253 extern int lvalue_or_else PARAMS ((tree, const char *));
2255 /* save_expr (EXP) returns an expression equivalent to EXP
2256 but it can be used multiple times within context CTX
2257 and only evaluate EXP once. */
2259 extern tree save_expr PARAMS ((tree));
2261 /* Returns the index of the first non-tree operand for CODE, or the number
2262 of operands if all are trees. */
2264 extern int first_rtl_op PARAMS ((enum tree_code));
2266 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2267 can be used multiple times and will evaluate EXP in its entirety
2270 extern tree unsave_expr PARAMS ((tree));
2272 /* Reset EXP in place so that it can be expaned again. Does not
2273 recurse into subtrees. */
2275 extern void unsave_expr_1 PARAMS ((tree));
2277 /* Like unsave_expr_1, but recurses into all subtrees. */
2279 extern tree unsave_expr_now PARAMS ((tree));
2281 /* If non-null, these are language-specific helper functions for
2282 unsave_expr_now. If present, LANG_UNSAVE is called before its
2283 argument (an UNSAVE_EXPR) is to be unsaved, and all other
2284 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
2285 called from unsave_expr_1 for language-specific tree codes. */
2286 extern void (*lang_unsave) PARAMS ((tree *));
2287 extern void (*lang_unsave_expr_now) PARAMS ((tree));
2289 /* Return 0 if it is safe to evaluate EXPR multiple times,
2290 return 1 if it is safe if EXPR is unsaved afterward, or
2291 return 2 if it is completely unsafe. */
2292 extern int unsafe_for_reeval PARAMS ((tree));
2294 /* If non-null, these are language-specific helper functions for
2295 unsafe_for_reeval. Return negative to not handle some tree. */
2296 extern int (*lang_unsafe_for_reeval) PARAMS ((tree));
2298 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2299 or offset that depends on a field within a record.
2301 Note that we only allow such expressions within simple arithmetic
2304 extern int contains_placeholder_p PARAMS ((tree));
2306 /* Return 1 if EXP contains any expressions that produce cleanups for an
2307 outer scope to deal with. Used by fold. */
2309 extern int has_cleanups PARAMS ((tree));
2311 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2312 return a tree with all occurrences of references to F in a
2313 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2314 contains only arithmetic expressions. */
2316 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
2318 /* variable_size (EXP) is like save_expr (EXP) except that it
2319 is for the special case of something that is part of a
2320 variable size for a data type. It makes special arrangements
2321 to compute the value at the right time when the data type
2322 belongs to a function parameter. */
2324 extern tree variable_size PARAMS ((tree));
2326 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2327 but it can be used multiple times
2328 and only evaluate the subexpressions once. */
2330 extern tree stabilize_reference PARAMS ((tree));
2332 /* Subroutine of stabilize_reference; this is called for subtrees of
2333 references. Any expression with side-effects must be put in a SAVE_EXPR
2334 to ensure that it is only evaluated once. */
2336 extern tree stabilize_reference_1 PARAMS ((tree));
2338 /* Return EXP, stripped of any conversions to wider types
2339 in such a way that the result of converting to type FOR_TYPE
2340 is the same as if EXP were converted to FOR_TYPE.
2341 If FOR_TYPE is 0, it signifies EXP's type. */
2343 extern tree get_unwidened PARAMS ((tree, tree));
2345 /* Return OP or a simpler expression for a narrower value
2346 which can be sign-extended or zero-extended to give back OP.
2347 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2348 or 0 if the value should be sign-extended. */
2350 extern tree get_narrower PARAMS ((tree, int *));
2352 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2354 The definition of this resides in language-specific code
2355 as the repertoire of available types may vary. */
2357 extern tree type_for_mode PARAMS ((enum machine_mode, int));
2359 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2360 for an integer type with at least that precision.
2361 The definition of this resides in language-specific code
2362 as the repertoire of available types may vary. */
2364 extern tree type_for_size PARAMS ((unsigned, int));
2366 /* Given an integer type T, return a type like T but unsigned.
2367 If T is unsigned, the value is T.
2368 The definition of this resides in language-specific code
2369 as the repertoire of available types may vary. */
2371 extern tree unsigned_type PARAMS ((tree));
2373 /* Given an integer type T, return a type like T but signed.
2374 If T is signed, the value is T.
2375 The definition of this resides in language-specific code
2376 as the repertoire of available types may vary. */
2378 extern tree signed_type PARAMS ((tree));
2380 /* This function must be defined in the language-specific files.
2381 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2382 This is defined in a language-specific file. */
2384 extern tree maybe_build_cleanup PARAMS ((tree));
2386 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2387 look for nested component-refs or array-refs at constant positions
2388 and find the ultimate containing object, which is returned. */
2390 extern tree get_inner_reference PARAMS ((tree, HOST_WIDE_INT *,
2391 HOST_WIDE_INT *, tree *,
2392 enum machine_mode *, int *,
2393 int *, unsigned int *));
2395 /* Given a DECL or TYPE, return the scope in which it was declared, or
2396 NUL_TREE if there is no containing scope. */
2398 extern tree get_containing_scope PARAMS ((tree));
2400 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2402 extern tree decl_function_context PARAMS ((tree));
2404 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2405 this _DECL with its context, or zero if none. */
2406 extern tree decl_type_context PARAMS ((tree));
2408 /* Given the FUNCTION_DECL for the current function,
2409 return zero if it is ok for this function to be inline.
2410 Otherwise return a warning message with a single %s
2411 for the function's name. */
2413 extern const char *function_cannot_inline_p PARAMS ((tree));
2415 /* Return 1 if EXPR is the real constant zero. */
2416 extern int real_zerop PARAMS ((tree));
2418 /* Declare commonly used variables for tree structure. */
2420 /* Points to the name of the input file from which the current input
2421 being parsed originally came (before it went into cpp). */
2422 extern const char *input_filename;
2424 /* Current line number in input file. */
2427 /* Nonzero for -pedantic switch: warn about anything
2428 that standard C forbids. */
2429 extern int pedantic;
2431 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2432 Zero means allow extended lvalues. */
2434 extern int pedantic_lvalues;
2436 /* Nonzero means can safely call expand_expr now;
2437 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2439 extern int immediate_size_expand;
2441 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2443 extern tree current_function_decl;
2445 /* Nonzero means a FUNC_BEGIN label was emitted. */
2446 extern tree current_function_func_begin_label;
2448 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2450 extern int all_types_permanent;
2452 /* Pointer to function to compute the name to use to print a declaration.
2453 DECL is the declaration in question.
2454 VERBOSITY determines what information will be printed:
2455 0: DECL_NAME, demangled as necessary.
2456 1: and scope information.
2457 2: and any other information that might be interesting, such as function
2458 parameter types in C++. */
2460 extern const char *(*decl_printable_name) PARAMS ((tree, int));
2462 /* Pointer to function to finish handling an incomplete decl at the
2463 end of compilation. */
2465 extern void (*incomplete_decl_finalize_hook) PARAMS ((tree));
2467 extern const char *init_parse PARAMS ((const char *));
2468 extern void finish_parse PARAMS ((void));
2470 extern const char * const language_string;
2472 /* Declare a predefined function. Return the declaration. This function is
2473 provided by each language frontend. */
2474 extern tree builtin_function PARAMS ((const char *, tree, int,
2475 enum built_in_class,
2479 extern char *perm_calloc PARAMS ((int, long));
2480 extern void clean_symbol_name PARAMS ((char *));
2481 extern tree get_file_function_name_long PARAMS ((const char *));
2482 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2483 extern tree get_set_constructor_bytes PARAMS ((tree,
2484 unsigned char *, int));
2485 extern tree get_callee_fndecl PARAMS ((tree));
2489 extern int in_control_zone_p PARAMS ((void));
2490 extern void expand_fixups PARAMS ((struct rtx_def *));
2491 extern tree expand_start_stmt_expr PARAMS ((void));
2492 extern tree expand_end_stmt_expr PARAMS ((tree));
2493 extern void expand_expr_stmt PARAMS ((tree));
2494 extern int warn_if_unused_value PARAMS ((tree));
2495 extern void expand_decl_init PARAMS ((tree));
2496 extern void clear_last_expr PARAMS ((void));
2497 extern void expand_label PARAMS ((tree));
2498 extern void expand_goto PARAMS ((tree));
2499 extern void expand_asm PARAMS ((tree));
2500 extern void expand_start_cond PARAMS ((tree, int));
2501 extern void expand_end_cond PARAMS ((void));
2502 extern void expand_start_else PARAMS ((void));
2503 extern void expand_start_elseif PARAMS ((tree));
2504 extern struct nesting *expand_start_loop PARAMS ((int));
2505 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2506 extern struct nesting *expand_start_null_loop PARAMS ((void));
2507 extern void expand_loop_continue_here PARAMS ((void));
2508 extern void expand_end_loop PARAMS ((void));
2509 extern void expand_end_null_loop PARAMS ((void));
2510 extern int expand_continue_loop PARAMS ((struct nesting *));
2511 extern int expand_exit_loop PARAMS ((struct nesting *));
2512 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2514 extern int expand_exit_something PARAMS ((void));
2516 extern void expand_null_return PARAMS ((void));
2517 extern void expand_return PARAMS ((tree));
2518 extern int optimize_tail_recursion PARAMS ((tree, struct rtx_def *));
2519 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2520 #define expand_start_bindings(flags) \
2521 expand_start_bindings_and_block(flags, NULL_TREE)
2522 extern void expand_end_bindings PARAMS ((tree, int, int));
2523 extern void warn_about_unused_variables PARAMS ((tree));
2524 extern void start_cleanup_deferral PARAMS ((void));
2525 extern void end_cleanup_deferral PARAMS ((void));
2526 extern int is_body_block PARAMS ((tree));
2528 extern void mark_block_as_eh_region PARAMS ((void));
2529 extern void mark_block_as_not_eh_region PARAMS ((void));
2530 extern int is_eh_region PARAMS ((void));
2531 extern int conditional_context PARAMS ((void));
2532 extern tree last_cleanup_this_contour PARAMS ((void));
2533 extern int expand_dhc_cleanup PARAMS ((tree));
2534 extern int expand_dcc_cleanup PARAMS ((tree));
2535 extern void expand_start_case PARAMS ((int, tree, tree,
2537 extern void expand_end_case PARAMS ((tree));
2538 extern int add_case_node PARAMS ((tree, tree,
2540 extern int pushcase PARAMS ((tree,
2541 tree (*) (tree, tree),
2543 extern int pushcase_range PARAMS ((tree, tree,
2544 tree (*) (tree, tree),
2546 extern void using_eh_for_cleanups PARAMS ((void));
2547 extern int stmt_loop_nest_empty PARAMS ((void));
2549 /* In fold-const.c */
2551 /* Fold constants as much as possible in an expression.
2552 Returns the simplified expression.
2553 Acts only on the top level of the expression;
2554 if the argument itself cannot be simplified, its
2555 subexpressions are not changed. */
2557 extern tree fold PARAMS ((tree));
2559 extern int force_fit_type PARAMS ((tree, int));
2560 extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2561 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2562 unsigned HOST_WIDE_INT *,
2564 extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2565 unsigned HOST_WIDE_INT *,
2567 extern int mul_double PARAMS ((unsigned HOST_WIDE_INT,
2569 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2570 unsigned HOST_WIDE_INT *,
2572 extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2573 HOST_WIDE_INT, unsigned int,
2574 unsigned HOST_WIDE_INT *,
2575 HOST_WIDE_INT *, int));
2576 extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2577 HOST_WIDE_INT, unsigned int,
2578 unsigned HOST_WIDE_INT *,
2579 HOST_WIDE_INT *, int));
2580 extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2581 HOST_WIDE_INT, unsigned int,
2582 unsigned HOST_WIDE_INT *,
2584 extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2585 HOST_WIDE_INT, unsigned int,
2586 unsigned HOST_WIDE_INT *,
2588 extern int operand_equal_p PARAMS ((tree, tree, int));
2589 extern tree invert_truthvalue PARAMS ((tree));
2591 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2592 function arguments and return the new type. Return NULL_TREE if no
2593 change. Required by any language that supports variadic arguments. */
2595 extern tree (*lang_type_promotes_to) PARAMS ((tree));
2596 extern tree fold_builtin PARAMS ((tree));
2598 /* The language front-end must define these functions. */
2600 /* Function of no arguments for initializing lexical scanning. */
2601 extern void init_lex PARAMS ((void));
2602 /* Function of no arguments for initializing the symbol table. */
2603 extern void init_decl_processing PARAMS ((void));
2605 /* Function to identify which front-end produced the output file. */
2606 extern const char *lang_identify PARAMS ((void));
2608 /* Called by report_error_function to print out function name.
2609 * Default may be overridden by language front-ends. */
2610 extern void (*print_error_function) PARAMS ((const char *));
2612 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2613 extern void copy_lang_decl PARAMS ((tree));
2615 /* Function called with no arguments to parse and compile the input. */
2616 extern int yyparse PARAMS ((void));
2617 /* Functions for processing symbol declarations. */
2618 /* Function to enter a new lexical scope.
2619 Takes one argument: always zero when called from outside the front end. */
2620 extern void pushlevel PARAMS ((int));
2621 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2622 Takes three arguments:
2623 KEEP -- nonzero if there were declarations in this scope.
2624 REVERSE -- reverse the order of decls before returning them.
2625 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2626 extern tree poplevel PARAMS ((int, int, int));
2627 /* Set the BLOCK node for the current scope level. */
2628 extern void set_block PARAMS ((tree));
2629 /* Function to add a decl to the current scope level.
2630 Takes one argument, a decl to add.
2631 Returns that decl, or, if the same symbol is already declared, may
2632 return a different decl for that name. */
2633 extern tree pushdecl PARAMS ((tree));
2634 /* Function to return the chain of decls so far in the current scope level. */
2635 extern tree getdecls PARAMS ((void));
2636 /* Function to return the chain of structure tags in the current scope level. */
2637 extern tree gettags PARAMS ((void));
2639 extern tree build_range_type PARAMS ((tree, tree, tree));
2641 /* Called after finishing a record, union or enumeral type. */
2642 extern void rest_of_type_compilation PARAMS ((tree, int));
2645 extern void record_component_aliases PARAMS ((tree));
2646 extern HOST_WIDE_INT get_alias_set PARAMS ((tree));
2647 extern int alias_sets_conflict_p PARAMS ((HOST_WIDE_INT,
2649 extern int readonly_fields_p PARAMS ((tree));
2650 extern int objects_must_conflict_p PARAMS ((tree, tree));
2653 extern HOST_WIDE_INT lang_get_alias_set PARAMS ((tree));
2658 extern int really_constant_p PARAMS ((tree));
2659 extern void set_identifier_size PARAMS ((int));
2660 extern int int_fits_type_p PARAMS ((tree, tree));
2661 extern int tree_log2 PARAMS ((tree));
2662 extern int tree_floor_log2 PARAMS ((tree));
2663 extern void preserve_data PARAMS ((void));
2664 extern int object_permanent_p PARAMS ((tree));
2665 extern int type_precision PARAMS ((tree));
2666 extern int simple_cst_equal PARAMS ((tree, tree));
2667 extern int compare_tree_int PARAMS ((tree, unsigned int));
2668 extern int type_list_equal PARAMS ((tree, tree));
2669 extern int chain_member PARAMS ((tree, tree));
2670 extern int chain_member_purpose PARAMS ((tree, tree));
2671 extern int chain_member_value PARAMS ((tree, tree));
2672 extern tree listify PARAMS ((tree));
2673 extern tree type_hash_lookup PARAMS ((unsigned int, tree));
2674 extern void type_hash_add PARAMS ((unsigned int, tree));
2675 extern unsigned int type_hash_list PARAMS ((tree));
2676 extern int simple_cst_list_equal PARAMS ((tree, tree));
2677 extern void dump_tree_statistics PARAMS ((void));
2678 extern void print_obstack_statistics PARAMS ((const char *,
2681 extern void print_obstack_name PARAMS ((char *, FILE *,
2684 extern void expand_function_end PARAMS ((const char *, int, int));
2685 extern void expand_function_start PARAMS ((tree, int));
2687 extern int real_onep PARAMS ((tree));
2688 extern int real_twop PARAMS ((tree));
2689 extern void start_identifier_warnings PARAMS ((void));
2690 extern void gcc_obstack_init PARAMS ((struct obstack *));
2691 extern void init_obstacks PARAMS ((void));
2692 extern void build_common_tree_nodes PARAMS ((int));
2693 extern void build_common_tree_nodes_2 PARAMS ((int));
2694 extern void mark_tree_hashtable PARAMS ((void *));
2697 extern void setjmp_protect_args PARAMS ((void));
2698 extern void setjmp_protect PARAMS ((tree));
2699 extern void expand_main_function PARAMS ((void));
2700 extern void mark_varargs PARAMS ((void));
2701 extern void init_dummy_function_start PARAMS ((void));
2702 extern void expand_dummy_function_end PARAMS ((void));
2703 extern void init_function_for_compilation PARAMS ((void));
2704 extern void init_function_start PARAMS ((tree, const char *, int));
2705 extern void assign_parms PARAMS ((tree));
2706 extern void put_var_into_stack PARAMS ((tree));
2707 extern void flush_addressof PARAMS ((tree));
2708 extern void uninitialized_vars_warning PARAMS ((tree));
2709 extern void setjmp_args_warning PARAMS ((void));
2710 extern void mark_all_temps_used PARAMS ((void));
2711 extern void init_temp_slots PARAMS ((void));
2712 extern void combine_temp_slots PARAMS ((void));
2713 extern void free_temp_slots PARAMS ((void));
2714 extern void pop_temp_slots PARAMS ((void));
2715 extern void push_temp_slots PARAMS ((void));
2716 extern void preserve_temp_slots PARAMS ((struct rtx_def *));
2717 extern void preserve_rtl_expr_temps PARAMS ((tree));
2718 extern int aggregate_value_p PARAMS ((tree));
2719 extern void free_temps_for_rtl_expr PARAMS ((tree));
2720 extern void instantiate_virtual_regs PARAMS ((tree, struct rtx_def *));
2721 extern void unshare_all_rtl PARAMS ((tree, struct rtx_def *));
2722 extern int max_parm_reg_num PARAMS ((void));
2723 extern void push_function_context PARAMS ((void));
2724 extern void pop_function_context PARAMS ((void));
2725 extern void push_function_context_to PARAMS ((tree));
2726 extern void pop_function_context_from PARAMS ((tree));
2728 /* In print-rtl.c */
2730 extern void print_rtl PARAMS ((FILE *, struct rtx_def *));
2733 /* In print-tree.c */
2734 extern void debug_tree PARAMS ((tree));
2736 extern void print_node PARAMS ((FILE *, const char *, tree,
2738 extern void print_node_brief PARAMS ((FILE *, const char *, tree,
2740 extern void indent_to PARAMS ((FILE *, int));
2744 extern void emit_queue PARAMS ((void));
2745 extern int apply_args_register_offset PARAMS ((int));
2746 extern struct rtx_def *expand_builtin_return_addr
2747 PARAMS ((enum built_in_function, int, struct rtx_def *));
2748 extern void do_pending_stack_adjust PARAMS ((void));
2749 extern struct rtx_def *expand_assignment PARAMS ((tree, tree, int,
2751 extern struct rtx_def *store_expr PARAMS ((tree,
2754 extern void check_max_integer_computation_mode PARAMS ((tree));
2757 extern void start_sequence_for_rtl_expr PARAMS ((tree));
2758 extern struct rtx_def *emit_line_note_after PARAMS ((const char *, int,
2760 extern struct rtx_def *emit_line_note PARAMS ((const char *, int));
2761 extern struct rtx_def *emit_line_note_force PARAMS ((const char *, int));
2765 extern int setjmp_call_p PARAMS ((tree));
2769 extern int mark_addressable PARAMS ((tree));
2770 extern void incomplete_type_error PARAMS ((tree, tree));
2771 extern void print_lang_statistics PARAMS ((void));
2772 extern tree truthvalue_conversion PARAMS ((tree));
2773 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2775 extern void print_lang_decl PARAMS ((FILE *, tree, int));
2776 extern void print_lang_type PARAMS ((FILE *, tree, int));
2777 extern void print_lang_identifier PARAMS ((FILE *, tree, int));
2779 extern int global_bindings_p PARAMS ((void));
2780 extern void insert_block PARAMS ((tree));
2782 /* In integrate.c */
2783 extern void save_for_inline PARAMS ((tree));
2784 extern void set_decl_abstract_flags PARAMS ((tree, int));
2785 extern void output_inline_function PARAMS ((tree));
2786 extern void set_decl_origin_self PARAMS ((tree));
2789 extern void set_yydebug PARAMS ((int));
2791 /* In stor-layout.c */
2792 extern void fixup_signed_type PARAMS ((tree));
2793 extern void internal_reference_types PARAMS ((void));
2796 extern void make_decl_rtl PARAMS ((tree, const char *));
2797 extern void make_decl_one_only PARAMS ((tree));
2798 extern int supports_one_only PARAMS ((void));
2799 extern void variable_section PARAMS ((tree, int));
2801 /* In fold-const.c */
2802 extern int div_and_round_double PARAMS ((enum tree_code, int,
2803 unsigned HOST_WIDE_INT,
2805 unsigned HOST_WIDE_INT,
2807 unsigned HOST_WIDE_INT *,
2809 unsigned HOST_WIDE_INT *,
2813 extern void emit_nop PARAMS ((void));
2814 extern void expand_computed_goto PARAMS ((tree));
2815 extern struct rtx_def *label_rtx PARAMS ((tree));
2816 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
2817 const char *, int));
2818 extern int any_pending_cleanups PARAMS ((int));
2819 extern void init_stmt PARAMS ((void));
2820 extern void init_stmt_for_function PARAMS ((void));
2821 extern int drop_through_at_end_p PARAMS ((void));
2822 extern void expand_start_target_temps PARAMS ((void));
2823 extern void expand_end_target_temps PARAMS ((void));
2824 extern void expand_elseif PARAMS ((tree));
2825 extern void save_stack_pointer PARAMS ((void));
2826 extern void expand_decl PARAMS ((tree));
2827 extern int expand_decl_cleanup PARAMS ((tree, tree));
2828 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
2829 extern void move_cleanups_up PARAMS ((void));
2830 extern void expand_start_case_dummy PARAMS ((void));
2831 extern void expand_end_case_dummy PARAMS ((void));
2832 extern tree case_index_expr_type PARAMS ((void));
2833 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
2834 extern void check_for_full_enumeration_handling PARAMS ((tree));
2835 extern void declare_nonlocal_label PARAMS ((tree));
2837 extern void lang_print_xnode PARAMS ((FILE *, tree, int));
2841 /* If KIND=='I', return a suitable global initializer (constructor) name.
2842 If KIND=='D', return a suitable global clean-up (destructor) name. */
2843 extern tree get_file_function_name PARAMS ((int));
2845 /* Interface of the DWARF2 unwind info support. */
2847 /* Decide whether we want to emit frame unwind information for the current
2848 translation unit. */
2850 extern int dwarf2out_do_frame PARAMS ((void));
2852 /* Generate a new label for the CFI info to refer to. */
2854 extern char *dwarf2out_cfi_label PARAMS ((void));
2856 /* Entry point to update the canonical frame address (CFA). */
2858 extern void dwarf2out_def_cfa PARAMS ((const char *, unsigned, long));
2860 /* Add the CFI for saving a register window. */
2862 extern void dwarf2out_window_save PARAMS ((const char *));
2864 /* Add a CFI to update the running total of the size of arguments pushed
2867 extern void dwarf2out_args_size PARAMS ((const char *, long));
2869 /* Entry point for saving a register to the stack. */
2871 extern void dwarf2out_reg_save PARAMS ((const char *, unsigned, long));
2873 /* Entry point for saving the return address in the stack. */
2875 extern void dwarf2out_return_save PARAMS ((const char *, long));
2877 /* Entry point for saving the return address in a register. */
2879 extern void dwarf2out_return_reg PARAMS ((const char *, unsigned));
2881 /* Output a marker (i.e. a label) for the beginning of a function, before
2884 extern void dwarf2out_begin_prologue PARAMS ((void));
2886 /* Output a marker (i.e. a label) for the absolute end of the generated
2887 code for a function definition. */
2889 extern void dwarf2out_end_epilogue PARAMS ((void));
2891 /* Redefine abort to report an internal error w/o coredump, and
2892 reporting the location of the error in the source file. This logic
2893 is duplicated in rtl.h and tree.h because every file that needs the
2894 special abort includes one or both. toplev.h gets too few files,
2895 system.h gets too many. */
2897 extern void fancy_abort PARAMS ((const char *, int, const char *))
2899 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)