1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 LAST_AND_UNUSED_TREE_CODE
/* A convenient way to get a value for
42 /* Number of language-independent tree codes. */
43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern char tree_code_type
[MAX_TREE_CODES
];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns non-zero iff CLASS is the tree-code class of an
59 #define IS_EXPR_CODE_CLASS(CLASS) \
60 (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e')
62 /* Number of argument-words in each kind of tree-node. */
64 extern int tree_code_length
[MAX_TREE_CODES
];
65 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
67 /* Names of tree components. */
69 extern const char *tree_code_name
[MAX_TREE_CODES
];
71 /* Classify which part of the compiler has defined a given builtin function.
72 Note that we assume below that this is no more than two bits. */
81 /* Names for the above. */
82 extern const char *const built_in_class_names
[4];
84 /* Codes that identify the various built in functions
85 so that expand_call can identify them quickly. */
87 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA) ENUM,
88 enum built_in_function
90 #include "builtins.def"
92 /* Upper bound on non-language-specific builtins. */
97 /* Names for the above. */
98 extern const char *const built_in_names
[(int) END_BUILTINS
];
100 /* An array of _DECL trees for the above. */
101 extern union tree_node
*built_in_decls
[(int) END_BUILTINS
];
103 /* The definition of tree nodes fills the next several pages. */
105 /* A tree node can represent a data type, a variable, an expression
106 or a statement. Each node has a TREE_CODE which says what kind of
107 thing it represents. Some common codes are:
108 INTEGER_TYPE -- represents a type of integers.
109 ARRAY_TYPE -- represents a type of pointer.
110 VAR_DECL -- represents a declared variable.
111 INTEGER_CST -- represents a constant integer value.
112 PLUS_EXPR -- represents a sum (an expression).
114 As for the contents of a tree node: there are some fields
115 that all nodes share. Each TREE_CODE has various special-purpose
116 fields as well. The fields of a node are never accessed directly,
117 always through accessor macros. */
119 /* This type is used everywhere to refer to a tree node. */
121 typedef union tree_node
*tree
;
123 /* Every kind of tree node starts with this structure,
124 so all nodes have these fields.
126 See the accessor macros, defined below, for documentation of the
131 union tree_node
*chain
;
132 union tree_node
*type
;
134 ENUM_BITFIELD(tree_code
) code
: 8;
135 unsigned side_effects_flag
: 1;
136 unsigned constant_flag
: 1;
137 unsigned addressable_flag
: 1;
138 unsigned volatile_flag
: 1;
139 unsigned readonly_flag
: 1;
140 unsigned unsigned_flag
: 1;
141 unsigned asm_written_flag
: 1;
143 unsigned used_flag
: 1;
144 unsigned nothrow_flag
: 1;
145 unsigned static_flag
: 1;
146 unsigned public_flag
: 1;
147 unsigned private_flag
: 1;
148 unsigned protected_flag
: 1;
149 unsigned bounded_flag
: 1;
151 unsigned lang_flag_0
: 1;
152 unsigned lang_flag_1
: 1;
153 unsigned lang_flag_2
: 1;
154 unsigned lang_flag_3
: 1;
155 unsigned lang_flag_4
: 1;
156 unsigned lang_flag_5
: 1;
157 unsigned lang_flag_6
: 1;
158 /* This flag is presently unused. However, language front-ends
159 should not make use of this flag; it is reserved for future
164 /* The following table lists the uses of each of the above flags and
165 for which types of nodes they are defined. Note that expressions
171 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
172 ..._TYPE, IDENTIFIER_NODE
177 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
178 TREE_NO_UNUSED_WARNING in
179 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
181 TREE_LIST or TREE_VEC
182 TREE_CONSTANT_OVERFLOW in
183 INTEGER_CST, REAL_CST, COMPLEX_CST
184 TREE_SYMBOL_REFERENCED in
190 INTEGER_CST, REAL_CST, COMPLEX_CST
192 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
194 TREE_LIST or TREE_VEC
195 EXPR_WFL_EMIT_LINE_NOTE in
196 EXPR_WITH_FILE_LOCATION
201 TREE_LIST or TREE_VEC
203 ??? unspecified nodes
207 TREE_VIA_PROTECTED in
211 ??? unspecified nodes
220 TREE_THIS_VOLATILE in
240 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
241 DECL_BUILT_IN_NONANSI in
243 SAVE_EXPR_NOPLACEHOLDER in
249 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
255 expressions, IDENTIFIER_NODE
260 CALL_EXPR, FUNCTION_DECL
265 expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL,
271 /* Define accessors for the fields that all tree nodes have
272 (though some fields are not used for all kinds of nodes). */
274 /* The tree-code says what kind of node it is.
275 Codes are defined in tree.def. */
276 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
277 #define TREE_SET_CODE(NODE, VALUE) \
278 ((NODE)->common.code = (ENUM_BITFIELD(tree_code)) (VALUE))
280 /* When checking is enabled, errors will be generated if a tree node
281 is accessed incorrectly. The macros abort with a fatal error. */
282 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
284 #define TREE_CHECK(t, code) __extension__ \
285 ({ const tree __t = t; \
286 if (TREE_CODE(__t) != (code)) \
287 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
289 #define TREE_CLASS_CHECK(t, class) __extension__ \
290 ({ const tree __t = t; \
291 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
292 tree_class_check_failed (__t, class, __FILE__, __LINE__, __FUNCTION__); \
295 /* These checks have to be special cased. */
296 #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
297 ({ const tree __t = t; \
298 enum tree_code __c = TREE_CODE(__t); \
299 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
300 tree_check_failed (__t, CONSTRUCTOR, __FILE__, __LINE__, __FUNCTION__); \
302 #define EXPR_CHECK(t) __extension__ \
303 ({ const tree __t = t; \
304 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
305 if (__c != 'r' && __c != 's' && __c != '<' \
306 && __c != '1' && __c != '2' && __c != 'e') \
307 tree_class_check_failed(__t, 'e', __FILE__, __LINE__, __FUNCTION__); \
310 extern void tree_check_failed
PARAMS ((const tree
, enum tree_code
,
311 const char *, int, const char *))
313 extern void tree_class_check_failed
PARAMS ((const tree
, int,
314 const char *, int, const char *))
317 #else /* not ENABLE_TREE_CHECKING, or not gcc */
319 #define TREE_CHECK(t, code) (t)
320 #define TREE_CLASS_CHECK(t, code) (t)
321 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
322 #define EXPR_CHECK(t) (t)
326 #include "tree-check.h"
328 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
329 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
330 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
332 /* In all nodes that are expressions, this is the data type of the expression.
333 In POINTER_TYPE nodes, this is the type that the pointer points to.
334 In ARRAY_TYPE nodes, this is the type of the elements.
335 In VECTOR_TYPE nodes, this is the type of the elements. */
336 #define TREE_TYPE(NODE) ((NODE)->common.type)
338 /* Nodes are chained together for many purposes.
339 Types are chained together to record them for being output to the debugger
340 (see the function `chain_type').
341 Decls in the same scope are chained together to record the contents
343 Statement nodes for successive statements used to be chained together.
344 Often lists of things are represented by TREE_LIST nodes that
345 are chained together. */
347 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
349 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
350 that don't change the machine mode. */
352 #define STRIP_NOPS(EXP) \
353 while ((TREE_CODE (EXP) == NOP_EXPR \
354 || TREE_CODE (EXP) == CONVERT_EXPR \
355 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
356 && TREE_OPERAND (EXP, 0) != error_mark_node \
357 && (TYPE_MODE (TREE_TYPE (EXP)) \
358 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
359 (EXP) = TREE_OPERAND (EXP, 0);
361 /* Like STRIP_NOPS, but don't let the signedness change either. */
363 #define STRIP_SIGN_NOPS(EXP) \
364 while ((TREE_CODE (EXP) == NOP_EXPR \
365 || TREE_CODE (EXP) == CONVERT_EXPR \
366 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
367 && TREE_OPERAND (EXP, 0) != error_mark_node \
368 && (TYPE_MODE (TREE_TYPE (EXP)) \
369 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
370 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
371 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
372 (EXP) = TREE_OPERAND (EXP, 0);
374 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
376 #define STRIP_TYPE_NOPS(EXP) \
377 while ((TREE_CODE (EXP) == NOP_EXPR \
378 || TREE_CODE (EXP) == CONVERT_EXPR \
379 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
380 && TREE_OPERAND (EXP, 0) != error_mark_node \
381 && (TREE_TYPE (EXP) \
382 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
383 (EXP) = TREE_OPERAND (EXP, 0);
385 /* Nonzero if TYPE represents an integral type. Note that we do not
386 include COMPLEX types here. */
388 #define INTEGRAL_TYPE_P(TYPE) \
389 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
390 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
392 /* Nonzero if TYPE represents a floating-point type, including complex
393 floating-point types. */
395 #define FLOAT_TYPE_P(TYPE) \
396 (TREE_CODE (TYPE) == REAL_TYPE \
397 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
398 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
400 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
402 #define AGGREGATE_TYPE_P(TYPE) \
403 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
404 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
405 || TREE_CODE (TYPE) == SET_TYPE)
407 /* Nonzero if TYPE represents an unbounded pointer or unbounded
408 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
410 #define POINTER_TYPE_P(TYPE) \
411 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
413 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
415 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
416 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
418 /* Nonzero if TYPE represents a bounded pointer type. */
420 #define BOUNDED_POINTER_TYPE_P(TYPE) \
421 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
422 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
424 /* Nonzero if TYPE represents a bounded reference type. Bounded
425 reference types have two specific uses: (1) When a reference is
426 seated to a variable-length RECORD_TYPE that has an array of
427 indeterminate length as its final field. For all other objects, it
428 is sufficient to check bounds at the time the reference is seated,
429 and assume that all future uses of the reference are safe, since
430 the address of references cannot change. (2) When a reference
431 supertype is seated to an subtype object. The bounds "remember"
432 the true size of the complete object, so that subsequent upcasts of
433 the address of the reference will be checked properly (is such a
434 thing valid C++?). */
436 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
437 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
438 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
440 /* Nonzero if TYPE represents a pointer or reference type, either
441 bounded or unbounded. */
443 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
444 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
446 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
448 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
449 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
451 /* Nonzero if TYPE represents a reference type, either bounded or unbounded. */
453 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
454 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
456 /* Nonzero if this type is a complete type. */
457 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
459 /* Nonzero if this type is the (possibly qualified) void type. */
460 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
462 /* Nonzero if this type is complete or is cv void. */
463 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
464 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
466 /* Nonzero if this type is complete or is an array with unspecified bound. */
467 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
468 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE))
470 /* Nonzero if TYPE represents a type. */
472 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
474 /* Define many boolean fields that all tree nodes have. */
476 /* In VAR_DECL nodes, nonzero means address of this is needed.
477 So it cannot be in a register.
478 In a FUNCTION_DECL, nonzero means its address is needed.
479 So it must be compiled even if it is an inline function.
480 In a FIELD_DECL node, it means that the programmer is permitted to
481 construct the address of this field. This is used for aliasing
482 purposes: see record_component_aliases.
483 In CONSTRUCTOR nodes, it means object constructed must be in memory.
484 In LABEL_DECL nodes, it means a goto for this label has been seen
485 from a place outside all binding contours that restore stack levels.
486 In ..._TYPE nodes, it means that objects of this type must
487 be fully addressable. This means that pieces of this
488 object cannot go into register parameters, for example.
489 In IDENTIFIER_NODEs, this means that some extern decl for this name
490 had its address taken. That matters for inline functions. */
491 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
493 /* In a VAR_DECL, nonzero means allocate static storage.
494 In a FUNCTION_DECL, nonzero if function has been defined.
495 In a CONSTRUCTOR, nonzero means allocate static storage. */
496 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
498 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
499 made implicitly and should not lead to an "unused value" warning. */
500 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
502 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
503 chain is via a `virtual' declaration. */
504 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
506 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
507 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
508 requires a diagnostic when overflows occur in constant expressions. */
509 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
511 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
512 this string as an argument. */
513 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
515 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
516 overflow in folding, and no warning has been issued for this subexpression.
517 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
518 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
520 /* In a VAR_DECL or FUNCTION_DECL,
521 nonzero means name is to be accessible from outside this module.
522 In an IDENTIFIER_NODE, nonzero means an external declaration
523 accessible from outside this module was previously seen
524 for this name in an inner scope. */
525 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
527 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
528 base class is via a `public' declaration, which preserves public
529 fields from the base class as public. */
530 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
532 /* Ditto, for `private' declarations. */
533 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
535 /* Nonzero for TREE_LIST node means that the path to the
536 base class is via a `protected' declaration, which preserves
537 protected fields from the base class as protected.
539 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
541 /* In any expression, nonzero means it has side effects or reevaluation
542 of the whole expression could produce a different value.
543 This is set if any subexpression is a function call, a side effect
544 or a reference to a volatile variable.
545 In a ..._DECL, this is set only if the declaration said `volatile'. */
546 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
548 /* Nonzero means this expression is volatile in the C sense:
549 its address should be of type `volatile WHATEVER *'.
550 In other words, the declared item is volatile qualified.
551 This is used in _DECL nodes and _REF nodes.
553 In a ..._TYPE node, means this type is volatile-qualified.
554 But use TYPE_VOLATILE instead of this macro when the node is a type,
555 because eventually we may make that a different bit.
557 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
558 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
560 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
561 nonzero means it may not be the lhs of an assignment.
562 In a ..._TYPE node, means this type is const-qualified
563 (but the macro TYPE_READONLY should be used instead of this macro
564 when the node is a type). */
565 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
567 /* Value of expression is constant.
568 Always appears in all ..._CST nodes.
569 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
570 if the value is constant. */
571 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
573 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
574 In FIELD_DECL nodes, means an unsigned bit field.
575 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
576 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
578 #define TYPE_TRAP_SIGNED(NODE) (flag_trapv && ! TREE_UNSIGNED (NODE))
580 /* Nonzero in a VAR_DECL means assembler code has been written.
581 Nonzero in a FUNCTION_DECL means that the function has been compiled.
582 This is interesting in an inline function, since it might not need
583 to be compiled separately.
584 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
585 if the sdb debugging info for the type has been written.
586 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
587 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
589 /* Nonzero in a _DECL if the name is used in its scope.
590 Nonzero in an expr node means inhibit warning if value is unused.
591 In IDENTIFIER_NODEs, this means that some extern decl for this name
593 #define TREE_USED(NODE) ((NODE)->common.used_flag)
595 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
596 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
597 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
599 /* Used in classes in C++. */
600 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
601 /* Used in classes in C++.
602 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
603 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
605 /* In a ..._TYPE node, nonzero means that the type's size and layout,
606 (or the size and layout of its arguments and/or return value in the
607 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
608 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
609 node is a type, because eventually we may make that a different
610 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
611 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
612 BOUNDED_INDIRECT_TYPE_P to test for that.
614 In a FUNCTION_DECL, nonzero means that the size and layout of one
615 of its arguments and/or return value was changed by the presence of
616 pointer bounds. This value can differ from the value of
617 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
618 declared, then later called with pointer args, or was declared with
619 a variable argument list and is later called with pointer values in
620 the variable argument list.
622 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
623 of the decl's type's BOUNDED_POINTER_TYPE_P.
625 In a CONSTRUCTOR or other expression, nonzero means the value is a
626 bounded pointer. It is insufficient to determine the boundedness
627 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
628 since we allow pointer to be temporarily cast to integer for
629 rounding up to an alignment boudary in a way that preserves the
632 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
633 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
634 of a function that has bounded pointer(s) for its return type and/or
637 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
639 /* These flags are available for each language front end to use internally. */
640 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
641 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
642 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
643 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
644 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
645 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
646 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
648 /* Define additional fields and accessors for nodes representing constants. */
650 /* In an INTEGER_CST node. These two together make a 2-word integer.
651 If the data type is signed, the value is sign-extended to 2 words
652 even though not all of them may really be in use.
653 In an unsigned constant shorter than 2 words, the extra bits are 0. */
654 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
655 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
656 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
658 #define INT_CST_LT(A, B) \
659 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
660 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
661 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
663 #define INT_CST_LT_UNSIGNED(A, B) \
664 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
665 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
666 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
667 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
668 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
672 struct tree_common common
;
673 struct rtx_def
*rtl
; /* acts as link to register transfer language
675 /* A sub-struct is necessary here because the function `const_hash'
676 wants to scan both words as a unit and taking the address of the
677 sub-struct yields the properly inclusive bounded pointer. */
679 unsigned HOST_WIDE_INT low
;
684 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
685 and generally in all kinds of constants that could
686 be given labels (rather than being immediate). */
688 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
690 /* In a REAL_CST node. */
691 /* We can represent a real value as either a `double' or a string.
692 Strings don't allow for any optimization, but they do allow
693 for cross-compilation. */
695 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
701 struct tree_common common
;
702 struct rtx_def
*rtl
; /* acts as link to register transfer language
704 REAL_VALUE_TYPE real_cst
;
707 /* In a STRING_CST */
708 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
709 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
713 struct tree_common common
;
714 struct rtx_def
*rtl
; /* acts as link to register transfer language
720 /* In a COMPLEX_CST node. */
721 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
722 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
726 struct tree_common common
;
727 struct rtx_def
*rtl
; /* acts as link to register transfer language
729 union tree_node
*real
;
730 union tree_node
*imag
;
733 #include "hashtable.h"
735 /* Define fields and accessors for some special-purpose tree nodes. */
737 #define IDENTIFIER_LENGTH(NODE) \
738 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
739 #define IDENTIFIER_POINTER(NODE) \
740 ((char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
742 /* Translate a hash table identifier pointer to a tree_identifier
743 pointer, and vice versa. */
745 #define HT_IDENT_TO_GCC_IDENT(NODE) \
746 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
747 #define GCC_IDENT_TO_HT_IDENT(NODE) \
748 (&((struct tree_identifier *) (NODE))->id)
750 struct tree_identifier
752 struct tree_common common
;
753 struct ht_identifier id
;
756 /* In a TREE_LIST node. */
757 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
758 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
762 struct tree_common common
;
763 union tree_node
*purpose
;
764 union tree_node
*value
;
767 /* In a TREE_VEC node. */
768 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
769 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
770 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
774 struct tree_common common
;
776 union tree_node
*a
[1];
779 /* Define fields and accessors for some nodes that represent expressions. */
781 /* In a SAVE_EXPR node. */
782 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
783 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
784 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
785 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
786 both in normal code and in a handler. (Normally, in a handler, all
787 SAVE_EXPRs are unsaved, meaning that there values are
789 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
791 /* In a RTL_EXPR node. */
792 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
793 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
795 /* In a WITH_CLEANUP_EXPR node. */
796 #define WITH_CLEANUP_EXPR_RTL(NODE) \
797 (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
799 /* In a CONSTRUCTOR node. */
800 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
802 /* In ordinary expression nodes. */
803 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
804 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
806 /* In a LABELED_BLOCK_EXPR node. */
807 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
808 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
810 /* In a EXIT_BLOCK_EXPR node. */
811 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
812 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
814 /* In a LOOP_EXPR node. */
815 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
817 /* In a EXPR_WITH_FILE_LOCATION node. */
818 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
819 #define EXPR_WFL_FILENAME(NODE) \
820 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
821 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
822 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
823 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
824 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
825 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
826 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
827 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
831 struct tree_common common
;
833 union tree_node
*operands
[1];
836 /* In a BLOCK node. */
837 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
838 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
839 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
840 /* Note: when changing this, make sure to find the places
841 that use chainon or nreverse. */
842 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
843 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
844 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
846 /* Nonzero means that this block is prepared to handle exceptions
847 listed in the BLOCK_VARS slot. */
848 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
850 /* An index number for this block. These values are not guaranteed to
851 be unique across functions -- whether or not they are depends on
852 the debugging output format in use. */
853 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
855 /* If block reordering splits a lexical block into discontiguous
856 address ranges, we'll make a copy of the original block.
858 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
859 In that case, we have one source block that has been replicated
860 (through inlining or unrolling) into many logical blocks, and that
861 these logical blocks have different physical variables in them.
863 In this case, we have one logical block split into several
864 non-contiguous address ranges. Most debug formats can't actually
865 represent this idea directly, so we fake it by creating multiple
866 logical blocks with the same variables in them. However, for those
867 that do support non-contiguous regions, these allow the original
868 logical block to be reconstructed, along with the set of address
871 One of the logical block fragments is arbitrarily chosen to be
872 the ORIGIN. The other fragments will point to the origin via
873 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
874 be null. The list of fragments will be chained through
875 BLOCK_FRAGMENT_CHAIN from the origin. */
877 #define BLOCK_FRAGMENT_ORIGIN(NODE) \
878 (BLOCK_CHECK (NODE)->block.fragment_origin)
879 #define BLOCK_FRAGMENT_CHAIN(NODE) \
880 (BLOCK_CHECK (NODE)->block.fragment_chain)
884 struct tree_common common
;
886 unsigned handler_block_flag
: 1;
887 unsigned abstract_flag
: 1;
888 unsigned block_num
: 30;
890 union tree_node
*vars
;
891 union tree_node
*subblocks
;
892 union tree_node
*supercontext
;
893 union tree_node
*abstract_origin
;
894 union tree_node
*fragment_origin
;
895 union tree_node
*fragment_chain
;
898 /* Define fields and accessors for nodes representing data types. */
900 /* See tree.def for documentation of the use of these fields.
901 Look at the documentation of the various ..._TYPE tree codes. */
903 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
904 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
905 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
906 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
907 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
908 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
909 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
910 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
911 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
912 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
913 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
914 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
915 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
916 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
917 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
918 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
919 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
920 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
921 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
922 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
923 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
924 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
925 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
926 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
927 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
929 /* For a VECTOR_TYPE node, this describes a different type which is emitted
930 in the debugging output. We use this to describe a vector as a
931 structure containing an array. */
932 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
934 /* Indirect types present difficulties because they may be represented
935 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
936 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
937 be logically equivalent, but physically different. Simple
938 comparison of the main variant only tells if the types are
939 logically equivalent. Use this predicate to compare for physical
942 /* Types have the same main variant, and have the same boundedness. */
943 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
944 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
945 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
947 /* Return the type variant that has no qualifiers (i.e., the main variant),
948 except that the boundedness qualifier is preserved. */
949 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
950 (BOUNDED_POINTER_TYPE_P (TYPE) \
951 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
952 : TYPE_MAIN_VARIANT (TYPE))
954 /* For aggregate types, information about this type, as a base type
955 for itself. Used in a language-dependent way for types that are
956 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
957 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
959 /* The (language-specific) typed-based alias set for this type.
960 Objects whose TYPE_ALIAS_SETs are different cannot alias each
961 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
962 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
963 type can alias objects of any type. */
964 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
966 /* Nonzero iff the typed-based alias set for this type has been
968 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
969 (TYPE_CHECK (NODE)->type.alias_set != -1)
971 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
973 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
975 /* The alignment necessary for objects of this type.
976 The value is an int, measured in bits. */
977 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
979 /* 1 if the alignment for this type was requested by "aligned" attribute,
980 0 if it is the default for this type. */
981 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
983 /* The alignment for NODE, in bytes. */
984 #define TYPE_ALIGN_UNIT(NODE) \
985 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
987 /* If your language allows you to declare types, and you want debug info
988 for them, then you need to generate corresponding TYPE_DECL nodes.
989 These "stub" TYPE_DECL nodes have no name, and simply point at the
990 type node. You then set the TYPE_STUB_DECL field of the type node
991 to point back at the TYPE_DECL node. This allows the debug routines
992 to know that the two nodes represent the same type, so that we only
993 get one debug info record for them. */
994 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
996 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
997 has BLKmode only because it lacks the alignment requirement for
999 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1001 /* In an INTEGER_TYPE, it means the type represents a size. We use
1002 this both for validity checking and to permit optimizations that
1003 are unsafe for other types. Note that the C `size_t' type should
1004 *not* have this flag set. The `size_t' type is simply a typedef
1005 for an ordinary integer type that happens to be the type of an
1006 expression returned by `sizeof'; `size_t' has no special
1007 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1008 always actual sizes. */
1009 #define TYPE_IS_SIZETYPE(NODE) \
1010 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1012 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1013 pointer depressed. */
1014 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1015 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1017 /* Nonzero in a type considered volatile as a whole. */
1018 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
1020 /* Means this type is const-qualified. */
1021 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
1023 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1025 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1027 /* If nonzero, this type's size and layout, (or the size and layout of
1028 its arguments and/or return value in the case of a FUNCTION_TYPE or
1029 METHOD_TYPE) was changed by the presence of pointer bounds. */
1030 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
1032 /* There is a TYPE_QUAL value for each type qualifier. They can be
1033 combined by bitwise-or to form the complete set of qualifiers for a
1036 #define TYPE_UNQUALIFIED 0x0
1037 #define TYPE_QUAL_CONST 0x1
1038 #define TYPE_QUAL_VOLATILE 0x2
1039 #define TYPE_QUAL_RESTRICT 0x4
1040 #define TYPE_QUAL_BOUNDED 0x8
1042 /* The set of type qualifiers for this type. */
1043 #define TYPE_QUALS(NODE) \
1044 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1045 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1046 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1047 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1049 /* The set of qualifiers pertinent to an expression node. */
1050 #define TREE_EXPR_QUALS(NODE) \
1051 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1052 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1053 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1055 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1056 #define TREE_FUNC_QUALS(NODE) \
1057 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1058 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1060 /* These flags are available for each language front end to use internally. */
1061 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1062 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1063 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1064 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1065 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1066 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1067 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1069 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1070 that distinguish string from array of char).
1071 If set in a SET_TYPE, indicates a bitstring type. */
1072 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1074 /* If non-NULL, this is a upper bound of the size (in bytes) of an
1075 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
1076 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
1078 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1079 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) (GET_MODE_NUNITS (TYPE_CHECK (VECTOR_TYPE)->type.mode))
1081 /* Indicates that objects of this type must be initialized by calling a
1082 function when they are created. */
1083 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1084 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1086 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1087 the same way that the first union alternative would be passed. */
1088 #define TYPE_TRANSPARENT_UNION(NODE) \
1089 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1091 /* For an ARRAY_TYPE, indicates that it is not permitted to
1092 take the address of a component of the type. */
1093 #define TYPE_NONALIASED_COMPONENT(NODE) \
1094 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1096 /* Indicated that objects of this type should be laid out in as
1097 compact a way as possible. */
1098 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1100 /* A bounded pointer or bounded reference type (collectively called
1101 indirect types) is represented as a RECORD_TYPE node containing
1102 three pointer fields whose type is the corresponding unbounded
1103 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1104 a bounded indirect type differs from a normal RECORD_TYPE node in
1105 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1106 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1107 nodes are stored on the same type variant chain alongside the
1108 variants of the underlaying indirect types nodes. The main variant
1109 of such chains is always the unbounded type. */
1111 /* Access the field decls of a bounded-pointer type. */
1112 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1113 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1114 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1116 /* Access the simple-pointer subtype of a bounded-pointer type. */
1117 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1119 /* Find the unbounded counterpart to a type, or return TYPE if it is
1120 already unbounded. */
1121 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1122 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1124 /* This field comprises two bits, for values in the range 0..3:
1126 depth=0 means that type is a scalar, or an aggregate that contains
1127 only depth=0 types, or a function that has only depth=0 types for
1128 its return value and argument types.
1130 depth=1 means that type is a pointer to a depth=0 type, or an
1131 aggregate that contains only depth=0 and depth=1 types, or a
1132 function that has only depth=0 and depth=1 types for its return
1133 value and argument types.
1135 The meanings of depth=2 and depth=3 are obvious by induction.
1136 Varargs functions are depth=3. The type `va_list' is depth=3.
1138 The purpose of measuring pointer depth of a type is to determine
1139 the eligibility of a function for an automatically-generated
1140 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1141 depth=1 function is eligible for an automatic thunk. Functions
1142 with depth 2 or more are too complex to get automatic thunks.
1144 Function decls also have a pointer_depth field, since we also
1145 consider the actual argument types for functions. */
1147 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1149 /* In a FUNCTION_TYPE node, this bit stores the value of
1150 default_pointer_boundedness at the time TYPE was created. It is
1151 useful for choosing default boundedness of function arguments for
1152 non-prototype function decls and for varargs/stdarg lists. */
1153 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1154 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1156 #define MAX_POINTER_DEPTH 2
1157 #define VA_LIST_POINTER_DEPTH 3
1161 struct tree_common common
;
1162 union tree_node
*values
;
1163 union tree_node
*size
;
1164 union tree_node
*size_unit
;
1165 union tree_node
*attributes
;
1168 unsigned int precision
: 9;
1169 ENUM_BITFIELD(machine_mode
) mode
: 7;
1171 unsigned string_flag
: 1;
1172 unsigned no_force_blk_flag
: 1;
1173 unsigned needs_constructing_flag
: 1;
1174 unsigned transparent_union_flag
: 1;
1175 unsigned packed_flag
: 1;
1176 unsigned restrict_flag
: 1;
1177 unsigned pointer_depth
: 2;
1179 unsigned lang_flag_0
: 1;
1180 unsigned lang_flag_1
: 1;
1181 unsigned lang_flag_2
: 1;
1182 unsigned lang_flag_3
: 1;
1183 unsigned lang_flag_4
: 1;
1184 unsigned lang_flag_5
: 1;
1185 unsigned lang_flag_6
: 1;
1186 unsigned user_align
: 1;
1189 union tree_node
*pointer_to
;
1190 union tree_node
*reference_to
;
1191 union {int address
; char *pointer
; } symtab
;
1192 union tree_node
*name
;
1193 union tree_node
*minval
;
1194 union tree_node
*maxval
;
1195 union tree_node
*next_variant
;
1196 union tree_node
*main_variant
;
1197 union tree_node
*binfo
;
1198 union tree_node
*noncopied_parts
;
1199 union tree_node
*context
;
1200 HOST_WIDE_INT alias_set
;
1201 /* Points to a structure whose details depend on the language in use. */
1202 struct lang_type
*lang_specific
;
1205 /* Define accessor macros for information about type inheritance
1208 A "basetype" means a particular usage of a data type for inheritance
1209 in another type. Each such basetype usage has its own "binfo"
1210 object to describe it. The binfo object is a TREE_VEC node.
1212 Inheritance is represented by the binfo nodes allocated for a
1213 given type. For example, given types C and D, such that D is
1214 inherited by C, 3 binfo nodes will be allocated: one for describing
1215 the binfo properties of C, similarly one for D, and one for
1216 describing the binfo properties of D as a base type for C.
1217 Thus, given a pointer to class C, one can get a pointer to the binfo
1218 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1220 /* The actual data type node being inherited in this basetype. */
1221 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1223 /* The offset where this basetype appears in its containing type.
1224 BINFO_OFFSET slot holds the offset (in bytes)
1225 from the base of the complete object to the base of the part of the
1226 object that is allocated on behalf of this `type'.
1227 This is always 0 except when there is multiple inheritance. */
1229 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1230 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1231 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1233 /* The virtual function table belonging to this basetype. Virtual
1234 function tables provide a mechanism for run-time method dispatching.
1235 The entries of a virtual function table are language-dependent. */
1237 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1238 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1240 /* The virtual functions in the virtual function table. This is
1241 a TREE_LIST that is used as an initial approximation for building
1242 a virtual function table for this basetype. */
1243 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1244 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1246 /* A vector of binfos for the direct basetypes inherited by this
1249 If this basetype describes type D as inherited in C, and if the
1250 basetypes of D are E and F, then this vector contains binfos for
1251 inheritance of E and F by C.
1253 ??? This could probably be done by just allocating the
1254 base types at the end of this TREE_VEC (instead of using
1255 another TREE_VEC). This would simplify the calculation
1256 of how many basetypes a given type had. */
1257 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1258 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1260 /* The number of basetypes for NODE. */
1261 #define BINFO_N_BASETYPES(NODE) \
1262 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1264 /* Accessor macro to get to the Nth basetype of this basetype. */
1265 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1266 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1268 /* For a BINFO record describing a virtual base class, i.e., one where
1269 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1270 base. The actual contents are language-dependent. Under the old
1271 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1272 pointer to the virtual base; under the new ABI this field is
1273 instead a INTEGER_CST giving an offset into the vtable where the
1274 offset to the virtual base can be found. */
1275 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1277 /* The size of a base class subobject of this type. Not all frontends
1278 currently allocate the space for these fields. */
1279 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1280 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1281 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1282 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1284 /* Slot used to build a chain that represents a use of inheritance.
1285 For example, if X is derived from Y, and Y is derived from Z,
1286 then this field can be used to link the binfo node for X to
1287 the binfo node for X's Y to represent the use of inheritance
1288 from X to Y. Similarly, this slot of the binfo node for X's Y
1289 can point to the Z from which Y is inherited (in X's inheritance
1290 hierarchy). In this fashion, one can represent and traverse specific
1291 uses of inheritance using the binfo nodes themselves (instead of
1292 consing new space pointing to binfo nodes).
1293 It is up to the language-dependent front-ends to maintain
1294 this information as necessary. */
1295 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1297 /* Define fields and accessors for nodes representing declared names. */
1299 /* Nonzero if DECL represents a decl. */
1300 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1301 /* This is the name of the object as written by the user.
1302 It is an IDENTIFIER_NODE. */
1303 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1304 /* The name of the object as the assembler will see it (but before any
1305 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1306 as DECL_NAME. It is an IDENTIFIER_NODE. */
1307 #define DECL_ASSEMBLER_NAME(NODE) \
1308 ((DECL_ASSEMBLER_NAME_SET_P (NODE) \
1310 : (*lang_set_decl_assembler_name) (NODE)), \
1311 DECL_CHECK (NODE)->decl.assembler_name)
1312 /* Returns non-zero if the DECL_ASSEMBLER_NAME for NODE has been
1313 set. If zero, the NODE might still have a DECL_ASSEMBLER_NAME --
1314 it just hasn't been set yet. */
1315 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1316 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1317 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1318 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1319 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1320 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if
1321 DECL1's DECL_ASSEMBLER_NAME has not yet been set, using this macro
1322 will not cause the DECL_ASSEMBLER_NAME of either DECL to be set.
1323 In other words, the semantics of using this macro, are different
1326 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1328 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1329 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1330 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1331 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1332 DECL_ASSEMBLER_NAME (DECL1)) \
1335 /* Records the section name in a section attribute. Used to pass
1336 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1337 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1338 /* For FIELD_DECLs, this is the
1339 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1340 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1341 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1342 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1343 type, or NULL_TREE if the given decl has "file scope". */
1344 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1345 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1346 /* In a DECL this is the field where configuration dependent machine
1347 attributes are store */
1348 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1349 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1350 byte containing the bit closest to the beginning of the structure. */
1351 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1352 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1353 field from DECL_FIELD_OFFSET. */
1354 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1355 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1356 if so, the type that was originally specified for it.
1357 TREE_TYPE may have been modified (in finish_struct). */
1358 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1359 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1360 /* VAR_DECL and PARM_DECL reserve the arguments slot
1361 for language-specific uses. */
1362 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1363 /* This field is used to reference anything in decl.result and is meant only
1364 for use by the garbage collector. */
1365 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1366 /* In FUNCTION_DECL, holds the decl for the return value. */
1367 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1368 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1369 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1370 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1371 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1372 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1373 For a VAR_DECL, holds the initial value.
1374 For a PARM_DECL, not used--default
1375 values for parameters are encoded in the type of the function,
1376 not in the PARM_DECL slot. */
1377 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1378 /* For a PARM_DECL, records the data type used to pass the argument,
1379 which may be different from the type seen in the program. */
1380 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1381 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1382 if nonzero, indicates that the field occupies the type. */
1383 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1384 /* These two fields describe where in the source code the declaration
1385 was. If the declaration appears in several places (as for a C
1386 function that is declared first and then defined later), this
1387 information should refer to the definition. */
1388 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1389 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1390 /* Holds the size of the datum, in bits, as a tree expression.
1391 Need not be constant. */
1392 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1393 /* Likewise for the size in bytes. */
1394 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1395 /* Holds the alignment required for the datum, in bits. */
1396 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1397 /* The alignment of NODE, in bytes. */
1398 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1399 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1400 DECL_FIELD_OFFSET which are known to be always zero.
1401 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1403 #define DECL_OFFSET_ALIGN(NODE) \
1404 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1405 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1406 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1407 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1408 /* 1 if the alignment for this type was requested by "aligned" attribute,
1409 0 if it is the default for this type. */
1410 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1411 /* Holds the machine mode corresponding to the declaration of a variable or
1412 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1414 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1415 /* Holds the RTL expression for the value of a variable or function. If
1416 PROMOTED_MODE is defined, the mode of this expression may not be same
1417 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1418 to the variable's data type, while the mode
1419 of DECL_RTL is the mode actually used to contain the data.
1421 This value can be evaluated lazily for functions, variables with
1422 static storage duration, and labels. */
1423 #define DECL_RTL(NODE) \
1424 (DECL_CHECK (NODE)->decl.rtl \
1425 ? (NODE)->decl.rtl \
1426 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1427 /* Set the DECL_RTL for NODE to RTL. */
1428 #define SET_DECL_RTL(NODE, RTL) \
1429 (DECL_CHECK (NODE)->decl.rtl = (RTL))
1430 /* Returns non-zero if the DECL_RTL for NODE has already been set. */
1431 #define DECL_RTL_SET_P(NODE) \
1432 (DECL_CHECK (NODE)->decl.rtl != NULL)
1433 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1434 NODE1, it will not be set for NODE2; this is a lazy copy. */
1435 #define COPY_DECL_RTL(NODE1, NODE2) \
1436 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1437 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1438 #define DECL_RTL_IF_SET(NODE) \
1439 (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1440 /* Holds an INSN_LIST of all of the live ranges in which the variable
1441 has been moved to a possibly different register. */
1442 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1443 /* For PARM_DECL, holds an RTL for the stack slot or register
1444 where the data was actually passed. */
1445 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1446 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1447 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1448 /* For FUNCTION_DECL, if it is built-in,
1449 this identifies which built-in operation it is. */
1450 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1452 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1453 Before the struct containing the FUNCTION_DECL is laid out,
1454 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1455 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1456 function. When the class is laid out, this pointer is changed
1457 to an INTEGER_CST node which is suitable for use as an index
1458 into the virtual function table. */
1459 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1460 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1461 which this FIELD_DECL is defined. This information is needed when
1462 writing debugging information about vfield and vbase decls for C++. */
1463 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1465 /* Every ..._DECL node gets a unique number. */
1466 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1468 /* For any sort of a ..._DECL node, this points to the original (abstract)
1469 decl node which this decl is an instance of, or else it is NULL indicating
1470 that this decl is not an instance of some other decl. For example,
1471 in a nested declaration of an inline function, this points back to the
1473 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1475 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1476 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1477 #define DECL_ORIGIN(NODE) \
1478 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1480 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1481 inline instance of some original (abstract) decl from an inline function;
1482 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1483 nodes can also have their abstract origin set to themselves. */
1484 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1485 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1487 /* Nonzero if a _DECL means that the name of this decl should be ignored
1488 for symbolic debug purposes. */
1489 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1491 /* Nonzero for a given ..._DECL node means that this node represents an
1492 "abstract instance" of the given declaration (e.g. in the original
1493 declaration of an inline function). When generating symbolic debugging
1494 information, we mustn't try to generate any address information for nodes
1495 marked as "abstract instances" because we don't actually generate
1496 any code or allocate any data space for such instances. */
1497 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1499 /* Nonzero if a _DECL means that no warnings should be generated just
1500 because this decl is unused. */
1501 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1503 /* Nonzero for a given ..._DECL node means that this node should be
1504 put in .common, if possible. If a DECL_INITIAL is given, and it
1505 is not error_mark_node, then the decl cannot be put in .common. */
1506 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1508 /* Language-specific decl information. */
1509 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1511 /* In a VAR_DECL or FUNCTION_DECL,
1512 nonzero means external reference:
1513 do not allocate storage, and refer to a definition elsewhere. */
1514 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1516 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1518 #define DEFAULT_INIT_PRIORITY 65535
1519 #define MAX_INIT_PRIORITY 65535
1520 #define MAX_RESERVED_INIT_PRIORITY 100
1523 nonzero means the detail info about this type is not dumped into stabs.
1524 Instead it will generate cross reference ('x') of names.
1525 This uses the same flag as DECL_EXTERNAL. */
1526 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1527 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1529 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1530 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1531 /* In LABEL_DECL nodes, nonzero means that an error message about
1532 jumping into such a binding contour has been printed for this label. */
1533 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1534 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1535 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1536 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1537 static chain is not needed. */
1538 #define DECL_NO_STATIC_CHAIN(NODE) \
1539 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1541 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1542 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1544 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1546 Also set in some languages for variables, etc., outside the normal
1547 lexical scope, such as class instance variables. */
1548 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1550 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1551 where it is called. */
1552 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1554 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1555 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1557 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1558 that is not specified by ansi C and that users are supposed to be allowed
1559 to redefine for any purpose whatever. */
1560 #define DECL_BUILT_IN_NONANSI(NODE) \
1561 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1563 /* Nonzero in a FUNCTION_DECL means this function should be treated
1564 as if it were a malloc, meaning it returns a pointer that is
1566 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1568 /* Nonzero in a FUNCTION_DECL means this function should be treated
1569 as "pure" function (like const function, but may read global memory). */
1570 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1572 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1574 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1575 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1576 contour that restored a stack level and which is now exited. */
1577 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1579 /* Unused in FUNCTION_DECL. */
1581 /* In a VAR_DECL that's static,
1582 nonzero if the space is in the text section. */
1583 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1585 /* In a FUNCTION_DECL, nonzero means a built in function. */
1586 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1587 /* For a builtin function, identify which part of the compiler defined it. */
1588 #define DECL_BUILT_IN_CLASS(NODE) \
1589 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1591 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1592 Used in FIELD_DECLs for vtable pointers.
1593 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1594 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1596 /* Used to indicate that the linkage status of this DECL is not yet known,
1597 so it should not be output now. */
1598 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1600 /* Used in PARM_DECLs whose type are unions to indicate that the
1601 argument should be passed in the same way that the first union
1602 alternative would be passed. */
1603 #define DECL_TRANSPARENT_UNION(NODE) \
1604 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1606 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1607 at the beginning or end of execution. */
1608 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1609 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1611 #define DECL_STATIC_DESTRUCTOR(NODE) \
1612 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1614 /* Used to indicate that this DECL represents a compiler-generated entity. */
1615 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1617 /* Used to indicate that this DECL has weak linkage. */
1618 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1620 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1621 multiple translation units should be merged. */
1622 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1624 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1625 not be put out unless it is needed in this translation unit.
1626 Entities like this are shared across translation units (like weak
1627 entities), but are guaranteed to be generated by any translation
1628 unit that needs them, and therefore need not be put out anywhere
1629 where they are not needed. DECL_COMDAT is just a hint to the
1630 back-end; it is up to front-ends which set this flag to ensure
1631 that there will never be any harm, other than bloat, in putting out
1632 something which is DECL_COMDAT. */
1633 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1635 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1636 be instrumented with calls to support routines. */
1637 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1638 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1640 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1641 disabled in this function. */
1642 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) \
1643 (FUNCTION_DECL_CHECK (NODE)->decl.no_check_memory_usage)
1645 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1646 disabled in this function. */
1647 #define DECL_NO_LIMIT_STACK(NODE) \
1648 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1650 /* Additional flags for language-specific uses. */
1651 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1652 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1653 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1654 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1655 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1656 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1657 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1658 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1660 /* Used to indicate that the pointer to this DECL cannot be treated as
1661 an address constant. */
1662 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1664 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1666 #define DECL_NONADDRESSABLE_P(NODE) \
1667 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1669 /* Used to indicate an alias set for the memory pointed to by this
1670 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1671 pointer (or reference) type. */
1672 #define DECL_POINTER_ALIAS_SET(NODE) \
1673 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1675 /* Nonzero if an alias set has been assigned to this declaration. */
1676 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1677 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1679 /* The pointer_depth field comprises two bits for values in the range
1680 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1681 type node, but for functions it migth be greater. For example,
1682 this can happen when the function is declared to accept a parameter
1683 of type void* (depth=1), but is actually called with an argument of
1684 type foo** (depth=2). The function type will get the formal
1685 parameter's depth, but the function decl will get the actual
1686 argument's depth. */
1687 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1691 struct tree_common common
;
1692 const char *filename
;
1695 union tree_node
*size
;
1696 ENUM_BITFIELD(machine_mode
) mode
: 8;
1698 unsigned external_flag
: 1;
1699 unsigned nonlocal_flag
: 1;
1700 unsigned regdecl_flag
: 1;
1701 unsigned inline_flag
: 1;
1702 unsigned bit_field_flag
: 1;
1703 unsigned virtual_flag
: 1;
1704 unsigned ignored_flag
: 1;
1705 unsigned abstract_flag
: 1;
1707 unsigned in_system_header_flag
: 1;
1708 unsigned common_flag
: 1;
1709 unsigned defer_output
: 1;
1710 unsigned transparent_union
: 1;
1711 unsigned static_ctor_flag
: 1;
1712 unsigned static_dtor_flag
: 1;
1713 unsigned artificial_flag
: 1;
1714 unsigned weak_flag
: 1;
1716 unsigned non_addr_const_p
: 1;
1717 unsigned no_instrument_function_entry_exit
: 1;
1718 unsigned no_check_memory_usage
: 1;
1719 unsigned comdat_flag
: 1;
1720 unsigned malloc_flag
: 1;
1721 unsigned no_limit_stack
: 1;
1722 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
1724 unsigned pure_flag
: 1;
1725 unsigned pointer_depth
: 2;
1726 unsigned non_addressable
: 1;
1727 unsigned user_align
: 1;
1728 unsigned uninlinable
: 1;
1729 /* Two unused bits. */
1731 unsigned lang_flag_0
: 1;
1732 unsigned lang_flag_1
: 1;
1733 unsigned lang_flag_2
: 1;
1734 unsigned lang_flag_3
: 1;
1735 unsigned lang_flag_4
: 1;
1736 unsigned lang_flag_5
: 1;
1737 unsigned lang_flag_6
: 1;
1738 unsigned lang_flag_7
: 1;
1741 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1742 DECL_FUNCTION_CODE. */
1743 enum built_in_function f
;
1744 /* In a FUNCITON_DECL for which DECL_BUILT_IN does not hold, this
1745 is used by language-dependent code. */
1747 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1749 struct {unsigned int align
: 24; unsigned int off_align
: 8;} a
;
1752 union tree_node
*size_unit
;
1753 union tree_node
*name
;
1754 union tree_node
*context
;
1755 union tree_node
*arguments
; /* Also used for DECL_FIELD_OFFSET */
1756 union tree_node
*result
; /* Also used for DECL_BIT_FIELD_TYPE */
1757 union tree_node
*initial
; /* Also used for DECL_QUALIFIER */
1758 union tree_node
*abstract_origin
;
1759 union tree_node
*assembler_name
;
1760 union tree_node
*section_name
;
1761 union tree_node
*machine_attributes
;
1762 struct rtx_def
*rtl
; /* RTL representation for object. */
1763 struct rtx_def
*live_range_rtl
;
1765 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1766 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1767 In PARM_DECL, holds an RTL for the stack slot
1768 of register where the data was actually passed.
1769 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1777 union tree_node
*vindex
;
1778 HOST_WIDE_INT pointer_alias_set
;
1779 /* Points to a structure whose details depend on the language in use. */
1780 struct lang_decl
*lang_specific
;
1783 /* Define the overall contents of a tree node.
1784 It may be any of the structures declared above
1785 for various types of node. */
1789 struct tree_common common
;
1790 struct tree_int_cst int_cst
;
1791 struct tree_real_cst real_cst
;
1792 struct tree_string string
;
1793 struct tree_complex
complex;
1794 struct tree_identifier identifier
;
1795 struct tree_decl decl
;
1796 struct tree_type type
;
1797 struct tree_list list
;
1798 struct tree_vec vec
;
1799 struct tree_exp exp
;
1800 struct tree_block block
;
1803 /* Standard named or nameless data types of the C compiler. */
1822 TI_INTEGER_MINUS_ONE
,
1832 TI_COMPLEX_INTEGER_TYPE
,
1833 TI_COMPLEX_FLOAT_TYPE
,
1834 TI_COMPLEX_DOUBLE_TYPE
,
1835 TI_COMPLEX_LONG_DOUBLE_TYPE
,
1839 TI_LONG_DOUBLE_TYPE
,
1860 extern tree global_trees
[TI_MAX
];
1862 #define error_mark_node global_trees[TI_ERROR_MARK]
1864 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1865 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1866 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1867 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1868 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1870 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1871 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1872 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1873 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1874 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1876 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1877 #define integer_one_node global_trees[TI_INTEGER_ONE]
1878 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
1879 #define size_zero_node global_trees[TI_SIZE_ZERO]
1880 #define size_one_node global_trees[TI_SIZE_ONE]
1881 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1882 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1883 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1885 #define null_pointer_node global_trees[TI_NULL_POINTER]
1887 #define float_type_node global_trees[TI_FLOAT_TYPE]
1888 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1889 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1891 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1892 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1893 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1894 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1896 #define void_type_node global_trees[TI_VOID_TYPE]
1897 /* The C type `void *'. */
1898 #define ptr_type_node global_trees[TI_PTR_TYPE]
1899 /* The C type `const void *'. */
1900 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1901 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1902 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1904 /* The node that should be placed at the end of a parameter list to
1905 indicate that the function does not take a variable number of
1906 arguments. The TREE_VALUE will be void_type_node and there will be
1907 no TREE_CHAIN. Language-independent code should not assume
1908 anything else about this node. */
1909 #define void_list_node global_trees[TI_VOID_LIST_NODE]
1911 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
1912 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
1914 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
1915 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
1916 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
1917 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
1918 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
1920 /* An enumeration of the standard C integer types. These must be
1921 ordered so that shorter types appear before longer ones. */
1922 enum integer_type_kind
1934 itk_unsigned_long_long
,
1938 typedef enum integer_type_kind integer_type_kind
;
1940 /* The standard C integer types. Use integer_type_kind to index into
1942 extern tree integer_types
[itk_none
];
1944 #define char_type_node integer_types[itk_char]
1945 #define signed_char_type_node integer_types[itk_signed_char]
1946 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1947 #define short_integer_type_node integer_types[itk_short]
1948 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1949 #define integer_type_node integer_types[itk_int]
1950 #define unsigned_type_node integer_types[itk_unsigned_int]
1951 #define long_integer_type_node integer_types[itk_long]
1952 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1953 #define long_long_integer_type_node integer_types[itk_long_long]
1954 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1957 #define NULL_TREE (tree) NULL
1959 /* Approximate positive square root of a host double. This is for
1960 statistical reports, not code generation. */
1961 extern double approx_sqrt
PARAMS ((double));
1963 extern char *permalloc
PARAMS ((int));
1964 extern char *expralloc
PARAMS ((int));
1966 /* Compute the number of bytes occupied by 'node'. This routine only
1967 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
1969 extern size_t tree_size
PARAMS ((tree
));
1971 /* Lowest level primitive for allocating a node.
1972 The TREE_CODE is the only argument. Contents are initialized
1973 to zero except for a few of the common fields. */
1975 extern tree make_node
PARAMS ((enum tree_code
));
1976 extern tree make_lang_type
PARAMS ((enum tree_code
));
1977 extern tree (*make_lang_type_fn
) PARAMS ((enum tree_code
));
1979 /* Make a copy of a node, with all the same contents except
1980 for TREE_PERMANENT. (The copy is permanent
1981 iff nodes being made now are permanent.) */
1983 extern tree copy_node
PARAMS ((tree
));
1985 /* Make a copy of a chain of TREE_LIST nodes. */
1987 extern tree copy_list
PARAMS ((tree
));
1989 /* Make a TREE_VEC. */
1991 extern tree make_tree_vec
PARAMS ((int));
1993 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1994 The name is supplied as a char *. */
1996 extern tree get_identifier
PARAMS ((const char *));
1998 /* If an identifier with the name TEXT (a null-terminated string) has
1999 previously been referred to, return that node; otherwise return
2002 extern tree maybe_get_identifier
PARAMS ((const char *));
2004 /* Construct various types of nodes. */
2006 #define build_int_2(LO,HI) \
2007 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2009 extern tree build
PARAMS ((enum tree_code
, tree
, ...));
2010 extern tree build_nt
PARAMS ((enum tree_code
, ...));
2012 extern tree build_int_2_wide
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
));
2013 extern tree build_real
PARAMS ((tree
, REAL_VALUE_TYPE
));
2014 extern tree build_real_from_int_cst
PARAMS ((tree
, tree
));
2015 extern tree build_complex
PARAMS ((tree
, tree
, tree
));
2016 extern tree build_string
PARAMS ((int, const char *));
2017 extern tree build1
PARAMS ((enum tree_code
, tree
, tree
));
2018 extern tree build_tree_list
PARAMS ((tree
, tree
));
2019 extern tree build_decl
PARAMS ((enum tree_code
, tree
, tree
));
2020 extern tree build_block
PARAMS ((tree
, tree
, tree
, tree
, tree
));
2021 extern tree build_expr_wfl
PARAMS ((tree
, const char *, int, int));
2023 /* Construct various nodes representing data types. */
2025 extern tree make_signed_type
PARAMS ((int));
2026 extern tree make_unsigned_type
PARAMS ((int));
2027 extern void initialize_sizetypes
PARAMS ((void));
2028 extern void set_sizetype
PARAMS ((tree
));
2029 extern tree signed_or_unsigned_type
PARAMS ((int, tree
));
2030 extern void fixup_unsigned_type
PARAMS ((tree
));
2031 extern tree build_pointer_type
PARAMS ((tree
));
2032 extern tree build_reference_type
PARAMS ((tree
));
2033 extern tree build_type_no_quals
PARAMS ((tree
));
2034 extern tree build_index_type
PARAMS ((tree
));
2035 extern tree build_index_2_type
PARAMS ((tree
, tree
));
2036 extern tree build_array_type
PARAMS ((tree
, tree
));
2037 extern tree build_function_type
PARAMS ((tree
, tree
));
2038 extern tree build_method_type
PARAMS ((tree
, tree
));
2039 extern tree build_offset_type
PARAMS ((tree
, tree
));
2040 extern tree build_complex_type
PARAMS ((tree
));
2041 extern tree array_type_nelts
PARAMS ((tree
));
2043 extern tree value_member
PARAMS ((tree
, tree
));
2044 extern tree purpose_member
PARAMS ((tree
, tree
));
2045 extern tree binfo_member
PARAMS ((tree
, tree
));
2046 extern unsigned int attribute_hash_list
PARAMS ((tree
));
2047 extern int attribute_list_equal
PARAMS ((tree
, tree
));
2048 extern int attribute_list_contained
PARAMS ((tree
, tree
));
2049 extern int tree_int_cst_equal
PARAMS ((tree
, tree
));
2050 extern int tree_int_cst_lt
PARAMS ((tree
, tree
));
2051 extern int tree_int_cst_compare
PARAMS ((tree
, tree
));
2052 extern int host_integerp
PARAMS ((tree
, int));
2053 extern HOST_WIDE_INT tree_low_cst
PARAMS ((tree
, int));
2054 extern int tree_int_cst_msb
PARAMS ((tree
));
2055 extern int tree_int_cst_sgn
PARAMS ((tree
));
2056 extern int tree_expr_nonnegative_p
PARAMS ((tree
));
2057 extern int rtl_expr_nonnegative_p
PARAMS ((struct rtx_def
*));
2058 extern int index_type_equal
PARAMS ((tree
, tree
));
2059 extern tree get_inner_array_type
PARAMS ((tree
));
2061 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2062 put the prototype here. Rtl.h does declare the prototype if
2063 tree.h had been included. */
2065 extern tree make_tree
PARAMS ((tree
, struct rtx_def
*));
2067 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2070 Such modified types already made are recorded so that duplicates
2073 extern tree build_type_attribute_variant
PARAMS ((tree
, tree
));
2074 extern tree build_decl_attribute_variant
PARAMS ((tree
, tree
));
2076 /* Default versions of target-overridable functions. */
2078 extern tree merge_decl_attributes
PARAMS ((tree
, tree
));
2079 extern tree merge_type_attributes
PARAMS ((tree
, tree
));
2080 extern int default_valid_attribute_p
PARAMS ((tree
, tree
, tree
, tree
));
2081 extern int default_comp_type_attributes
PARAMS ((tree
, tree
));
2082 extern void default_set_default_type_attributes
PARAMS ((tree
));
2083 extern void default_insert_attributes
PARAMS ((tree
, tree
*));
2085 /* Split a list of declspecs and attributes into two. */
2087 extern void split_specs_attrs
PARAMS ((tree
, tree
*, tree
*));
2089 /* Strip attributes from a list of combined specs and attrs. */
2091 extern tree strip_attrs
PARAMS ((tree
));
2093 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2095 extern int valid_machine_attribute
PARAMS ((tree
, tree
, tree
, tree
));
2097 /* Given a tree node and a string, return non-zero if the tree node is
2098 a valid attribute name for the string. */
2100 extern int is_attribute_p
PARAMS ((const char *, tree
));
2102 /* Given an attribute name and a list of attributes, return the list element
2103 of the attribute or NULL_TREE if not found. */
2105 extern tree lookup_attribute
PARAMS ((const char *, tree
));
2107 /* Given two attributes lists, return a list of their union. */
2109 extern tree merge_attributes
PARAMS ((tree
, tree
));
2111 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2112 /* Given two Windows decl attributes lists, possibly including
2113 dllimport, return a list of their union . */
2114 extern tree merge_dllimport_decl_attributes
PARAMS ((tree
, tree
));
2117 /* Return a version of the TYPE, qualified as indicated by the
2118 TYPE_QUALS, if one exists. If no qualified version exists yet,
2119 return NULL_TREE. */
2121 extern tree get_qualified_type
PARAMS ((tree
, int));
2123 /* Like get_qualified_type, but creates the type if it does not
2124 exist. This function never returns NULL_TREE. */
2126 extern tree build_qualified_type
PARAMS ((tree
, int));
2128 /* Like build_qualified_type, but only deals with the `const' and
2129 `volatile' qualifiers. This interface is retained for backwards
2130 compatiblity with the various front-ends; new code should use
2131 build_qualified_type instead. */
2133 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2134 build_qualified_type (TYPE, \
2135 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2136 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2138 /* Make a copy of a type node. */
2140 extern tree build_type_copy
PARAMS ((tree
));
2142 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2143 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2144 node, does nothing except for the first time. */
2146 extern void layout_type
PARAMS ((tree
));
2148 /* These functions allow a front-end to perform a manual layout of a
2149 RECORD_TYPE. (For instance, if the placement of subsequent fields
2150 depends on the placement of fields so far.) Begin by calling
2151 start_record_layout. Then, call place_field for each of the
2152 fields. Then, call finish_record_layout. See layout_type for the
2153 default way in which these functions are used. */
2155 typedef struct record_layout_info_s
2157 /* The RECORD_TYPE that we are laying out. */
2159 /* The offset into the record so far, in bytes, not including bits in
2162 /* The last known alignment of SIZE. */
2163 unsigned int offset_align
;
2164 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2166 /* The alignment of the record so far, in bits. */
2167 unsigned int record_align
;
2168 /* The alignment of the record so far, not including padding, in bits. */
2169 unsigned int unpacked_align
;
2170 /* The alignment of the record so far, allowing for the record to be
2171 padded only at the end, in bits. */
2172 unsigned int unpadded_align
;
2173 /* The static variables (i.e., class variables, as opposed to
2174 instance variables) encountered in T. */
2175 tree pending_statics
;
2176 int packed_maybe_necessary
;
2177 } *record_layout_info
;
2179 extern void set_lang_adjust_rli
PARAMS ((void (*) PARAMS
2180 ((record_layout_info
))));
2181 extern record_layout_info start_record_layout
PARAMS ((tree
));
2182 extern tree bit_from_pos
PARAMS ((tree
, tree
));
2183 extern tree byte_from_pos
PARAMS ((tree
, tree
));
2184 extern void pos_from_byte
PARAMS ((tree
*, tree
*, unsigned int,
2186 extern void pos_from_bit
PARAMS ((tree
*, tree
*, unsigned int,
2188 extern void normalize_offset
PARAMS ((tree
*, tree
*,
2190 extern tree rli_size_unit_so_far
PARAMS ((record_layout_info
));
2191 extern tree rli_size_so_far
PARAMS ((record_layout_info
));
2192 extern void normalize_rli
PARAMS ((record_layout_info
));
2193 extern void place_field
PARAMS ((record_layout_info
, tree
));
2194 extern void compute_record_mode
PARAMS ((tree
));
2195 extern void finish_record_layout
PARAMS ((record_layout_info
));
2197 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2198 return a canonicalized ..._TYPE node, so that duplicates are not made.
2199 How the hash code is computed is up to the caller, as long as any two
2200 callers that could hash identical-looking type nodes agree. */
2202 extern tree type_hash_canon
PARAMS ((unsigned int, tree
));
2204 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2205 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2206 fields. Call this only once for any given decl node.
2208 Second argument is the boundary that this field can be assumed to
2209 be starting at (in bits). Zero means it can be assumed aligned
2210 on any boundary that may be needed. */
2212 extern void layout_decl
PARAMS ((tree
, unsigned));
2214 /* Return the mode for data of a given size SIZE and mode class CLASS.
2215 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2216 The value is BLKmode if no other mode is found. This is like
2217 mode_for_size, but is passed a tree. */
2219 extern enum machine_mode mode_for_size_tree
PARAMS ((tree
, enum mode_class
,
2222 /* Return an expr equal to X but certainly not valid as an lvalue. */
2224 extern tree non_lvalue
PARAMS ((tree
));
2225 extern tree pedantic_non_lvalue
PARAMS ((tree
));
2227 extern tree convert
PARAMS ((tree
, tree
));
2228 extern unsigned int expr_align
PARAMS ((tree
));
2229 extern tree size_in_bytes
PARAMS ((tree
));
2230 extern HOST_WIDE_INT int_size_in_bytes
PARAMS ((tree
));
2231 extern tree bit_position
PARAMS ((tree
));
2232 extern HOST_WIDE_INT int_bit_position
PARAMS ((tree
));
2233 extern tree byte_position
PARAMS ((tree
));
2234 extern HOST_WIDE_INT int_byte_position
PARAMS ((tree
));
2236 /* Define data structures, macros, and functions for handling sizes
2237 and the various types used to represent sizes. */
2241 SIZETYPE
, /* Normal representation of sizes in bytes. */
2242 SSIZETYPE
, /* Signed representation of sizes in bytes. */
2243 USIZETYPE
, /* Unsigned representation of sizes in bytes. */
2244 BITSIZETYPE
, /* Normal representation of sizes in bits. */
2245 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
2246 UBITSIZETYPE
, /* Unsifgned representation of sizes in bits. */
2249 extern tree sizetype_tab
[(int) TYPE_KIND_LAST
];
2251 #define sizetype sizetype_tab[(int) SIZETYPE]
2252 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2253 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2254 #define usizetype sizetype_tab[(int) USIZETYPE]
2255 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2256 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2258 extern tree size_binop
PARAMS ((enum tree_code
, tree
, tree
));
2259 extern tree size_diffop
PARAMS ((tree
, tree
));
2260 extern tree size_int_wide
PARAMS ((HOST_WIDE_INT
,
2261 enum size_type_kind
));
2262 extern tree size_int_type_wide
PARAMS ((HOST_WIDE_INT
, tree
));
2264 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2265 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2266 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2267 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2268 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2270 extern tree round_up
PARAMS ((tree
, int));
2271 extern tree round_down
PARAMS ((tree
, int));
2272 extern tree get_pending_sizes
PARAMS ((void));
2273 extern int is_pending_size
PARAMS ((tree
));
2274 extern void put_pending_size
PARAMS ((tree
));
2275 extern void put_pending_sizes
PARAMS ((tree
));
2277 /* Type for sizes of data-type. */
2279 #define BITS_PER_UNIT_LOG \
2280 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2281 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2282 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2284 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2285 extern unsigned int maximum_field_alignment
;
2287 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
2288 extern unsigned int set_alignment
;
2290 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2291 by making the last node in X point to Y.
2292 Returns X, except if X is 0 returns Y. */
2294 extern tree chainon
PARAMS ((tree
, tree
));
2296 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2298 extern tree tree_cons
PARAMS ((tree
, tree
, tree
));
2300 /* Return the last tree node in a chain. */
2302 extern tree tree_last
PARAMS ((tree
));
2304 /* Reverse the order of elements in a chain, and return the new head. */
2306 extern tree nreverse
PARAMS ((tree
));
2308 /* Returns the length of a chain of nodes
2309 (number of chain pointers to follow before reaching a null pointer). */
2311 extern int list_length
PARAMS ((tree
));
2313 /* Returns the number of FIELD_DECLs in a type. */
2315 extern int fields_length
PARAMS ((tree
));
2317 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2319 extern int integer_zerop
PARAMS ((tree
));
2321 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2323 extern int integer_onep
PARAMS ((tree
));
2325 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2326 all of whose significant bits are 1. */
2328 extern int integer_all_onesp
PARAMS ((tree
));
2330 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2331 exactly one bit 1. */
2333 extern int integer_pow2p
PARAMS ((tree
));
2335 /* staticp (tree x) is nonzero if X is a reference to data allocated
2336 at a fixed address in memory. */
2338 extern int staticp
PARAMS ((tree
));
2340 /* Gets an error if argument X is not an lvalue.
2341 Also returns 1 if X is an lvalue, 0 if not. */
2343 extern int lvalue_or_else
PARAMS ((tree
, const char *));
2345 /* save_expr (EXP) returns an expression equivalent to EXP
2346 but it can be used multiple times within context CTX
2347 and only evaluate EXP once. */
2349 extern tree save_expr
PARAMS ((tree
));
2351 /* Returns the index of the first non-tree operand for CODE, or the number
2352 of operands if all are trees. */
2354 extern int first_rtl_op
PARAMS ((enum tree_code
));
2356 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2357 can be used multiple times and will evaluate EXP in its entirety
2360 extern tree unsave_expr
PARAMS ((tree
));
2362 /* Reset EXP in place so that it can be expaned again. Does not
2363 recurse into subtrees. */
2365 extern void unsave_expr_1
PARAMS ((tree
));
2367 /* Like unsave_expr_1, but recurses into all subtrees. */
2369 extern tree unsave_expr_now
PARAMS ((tree
));
2371 /* If non-null, these are language-specific helper functions for
2372 unsave_expr_now. If present, LANG_UNSAVE is called before its
2373 argument (an UNSAVE_EXPR) is to be unsaved, and all other
2374 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
2375 called from unsave_expr_1 for language-specific tree codes. */
2376 extern void (*lang_unsave
) PARAMS ((tree
*));
2377 extern void (*lang_unsave_expr_now
) PARAMS ((tree
));
2379 /* Return 0 if it is safe to evaluate EXPR multiple times,
2380 return 1 if it is safe if EXPR is unsaved afterward, or
2381 return 2 if it is completely unsafe. */
2382 extern int unsafe_for_reeval
PARAMS ((tree
));
2384 /* If non-null, these are language-specific helper functions for
2385 unsafe_for_reeval. Return negative to not handle some tree. */
2386 extern int (*lang_unsafe_for_reeval
) PARAMS ((tree
));
2388 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2389 or offset that depends on a field within a record.
2391 Note that we only allow such expressions within simple arithmetic
2394 extern int contains_placeholder_p
PARAMS ((tree
));
2396 /* Return 1 if EXP contains any expressions that produce cleanups for an
2397 outer scope to deal with. Used by fold. */
2399 extern int has_cleanups
PARAMS ((tree
));
2401 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2402 return a tree with all occurrences of references to F in a
2403 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2404 contains only arithmetic expressions. */
2406 extern tree substitute_in_expr
PARAMS ((tree
, tree
, tree
));
2408 /* variable_size (EXP) is like save_expr (EXP) except that it
2409 is for the special case of something that is part of a
2410 variable size for a data type. It makes special arrangements
2411 to compute the value at the right time when the data type
2412 belongs to a function parameter. */
2414 extern tree variable_size
PARAMS ((tree
));
2416 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2417 but it can be used multiple times
2418 and only evaluate the subexpressions once. */
2420 extern tree stabilize_reference
PARAMS ((tree
));
2422 /* Subroutine of stabilize_reference; this is called for subtrees of
2423 references. Any expression with side-effects must be put in a SAVE_EXPR
2424 to ensure that it is only evaluated once. */
2426 extern tree stabilize_reference_1
PARAMS ((tree
));
2428 /* Return EXP, stripped of any conversions to wider types
2429 in such a way that the result of converting to type FOR_TYPE
2430 is the same as if EXP were converted to FOR_TYPE.
2431 If FOR_TYPE is 0, it signifies EXP's type. */
2433 extern tree get_unwidened
PARAMS ((tree
, tree
));
2435 /* Return OP or a simpler expression for a narrower value
2436 which can be sign-extended or zero-extended to give back OP.
2437 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2438 or 0 if the value should be sign-extended. */
2440 extern tree get_narrower
PARAMS ((tree
, int *));
2442 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2444 The definition of this resides in language-specific code
2445 as the repertoire of available types may vary. */
2447 extern tree type_for_mode
PARAMS ((enum machine_mode
, int));
2449 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2450 for an integer type with at least that precision.
2451 The definition of this resides in language-specific code
2452 as the repertoire of available types may vary. */
2454 extern tree type_for_size
PARAMS ((unsigned, int));
2456 /* Given an integer type T, return a type like T but unsigned.
2457 If T is unsigned, the value is T.
2458 The definition of this resides in language-specific code
2459 as the repertoire of available types may vary. */
2461 extern tree unsigned_type
PARAMS ((tree
));
2463 /* Given an integer type T, return a type like T but signed.
2464 If T is signed, the value is T.
2465 The definition of this resides in language-specific code
2466 as the repertoire of available types may vary. */
2468 extern tree signed_type
PARAMS ((tree
));
2470 /* This function must be defined in the language-specific files.
2471 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2472 This is defined in a language-specific file. */
2474 extern tree maybe_build_cleanup
PARAMS ((tree
));
2476 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2477 look for nested component-refs or array-refs at constant positions
2478 and find the ultimate containing object, which is returned. */
2480 extern tree get_inner_reference
PARAMS ((tree
, HOST_WIDE_INT
*,
2481 HOST_WIDE_INT
*, tree
*,
2482 enum machine_mode
*, int *,
2483 int *, unsigned int *));
2485 /* Given a DECL or TYPE, return the scope in which it was declared, or
2486 NUL_TREE if there is no containing scope. */
2488 extern tree get_containing_scope
PARAMS ((tree
));
2490 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2492 extern tree decl_function_context
PARAMS ((tree
));
2494 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2495 this _DECL with its context, or zero if none. */
2496 extern tree decl_type_context
PARAMS ((tree
));
2498 /* Given the FUNCTION_DECL for the current function,
2499 return zero if it is ok for this function to be inline.
2500 Otherwise return a warning message with a single %s
2501 for the function's name. */
2503 extern const char *function_cannot_inline_p
PARAMS ((tree
));
2505 /* Return 1 if EXPR is the real constant zero. */
2506 extern int real_zerop
PARAMS ((tree
));
2508 /* Declare commonly used variables for tree structure. */
2510 /* Points to the name of the input file from which the current input
2511 being parsed originally came (before it went into cpp). */
2512 extern const char *input_filename
;
2514 /* Current line number in input file. */
2517 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2518 Zero means allow extended lvalues. */
2520 extern int pedantic_lvalues
;
2522 /* Nonzero means can safely call expand_expr now;
2523 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2525 extern int immediate_size_expand
;
2527 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2529 extern tree current_function_decl
;
2531 /* Nonzero means a FUNC_BEGIN label was emitted. */
2532 extern tree current_function_func_begin_label
;
2534 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2536 extern int all_types_permanent
;
2538 /* Pointer to function to compute the name to use to print a declaration.
2539 DECL is the declaration in question.
2540 VERBOSITY determines what information will be printed:
2541 0: DECL_NAME, demangled as necessary.
2542 1: and scope information.
2543 2: and any other information that might be interesting, such as function
2544 parameter types in C++. */
2546 extern const char *(*decl_printable_name
) PARAMS ((tree
, int));
2548 /* Pointer to function to finish handling an incomplete decl at the
2549 end of compilation. */
2551 extern void (*incomplete_decl_finalize_hook
) PARAMS ((tree
));
2553 extern const char *init_parse
PARAMS ((const char *));
2554 extern void finish_parse
PARAMS ((void));
2556 extern const char * const language_string
;
2558 /* Declare a predefined function. Return the declaration. This function is
2559 provided by each language frontend. */
2560 extern tree builtin_function
PARAMS ((const char *, tree
, int,
2561 enum built_in_class
,
2565 extern char *perm_calloc
PARAMS ((int, long));
2566 extern void clean_symbol_name
PARAMS ((char *));
2567 extern tree get_file_function_name_long
PARAMS ((const char *));
2568 extern tree get_set_constructor_bits
PARAMS ((tree
, char *, int));
2569 extern tree get_set_constructor_bytes
PARAMS ((tree
,
2570 unsigned char *, int));
2571 extern tree get_callee_fndecl
PARAMS ((tree
));
2572 extern void set_decl_assembler_name
PARAMS ((tree
));
2573 extern int type_num_arguments
PARAMS ((tree
));
2577 extern int in_control_zone_p
PARAMS ((void));
2578 extern void expand_fixups
PARAMS ((struct rtx_def
*));
2579 extern tree expand_start_stmt_expr
PARAMS ((void));
2580 extern tree expand_end_stmt_expr
PARAMS ((tree
));
2581 extern void expand_expr_stmt
PARAMS ((tree
));
2582 extern int warn_if_unused_value
PARAMS ((tree
));
2583 extern void expand_decl_init
PARAMS ((tree
));
2584 extern void clear_last_expr
PARAMS ((void));
2585 extern void expand_label
PARAMS ((tree
));
2586 extern void expand_goto
PARAMS ((tree
));
2587 extern void expand_asm
PARAMS ((tree
));
2588 extern void expand_start_cond
PARAMS ((tree
, int));
2589 extern void expand_end_cond
PARAMS ((void));
2590 extern void expand_start_else
PARAMS ((void));
2591 extern void expand_start_elseif
PARAMS ((tree
));
2592 extern struct nesting
*expand_start_loop
PARAMS ((int));
2593 extern struct nesting
*expand_start_loop_continue_elsewhere
PARAMS ((int));
2594 extern struct nesting
*expand_start_null_loop
PARAMS ((void));
2595 extern void expand_loop_continue_here
PARAMS ((void));
2596 extern void expand_end_loop
PARAMS ((void));
2597 extern void expand_end_null_loop
PARAMS ((void));
2598 extern int expand_continue_loop
PARAMS ((struct nesting
*));
2599 extern int expand_exit_loop
PARAMS ((struct nesting
*));
2600 extern int expand_exit_loop_if_false
PARAMS ((struct nesting
*,
2602 extern int expand_exit_something
PARAMS ((void));
2604 extern void expand_return
PARAMS ((tree
));
2605 extern int optimize_tail_recursion
PARAMS ((tree
, struct rtx_def
*));
2606 extern void expand_start_bindings_and_block
PARAMS ((int, tree
));
2607 #define expand_start_bindings(flags) \
2608 expand_start_bindings_and_block(flags, NULL_TREE)
2609 extern void expand_end_bindings
PARAMS ((tree
, int, int));
2610 extern void warn_about_unused_variables
PARAMS ((tree
));
2611 extern void start_cleanup_deferral
PARAMS ((void));
2612 extern void end_cleanup_deferral
PARAMS ((void));
2613 extern int is_body_block
PARAMS ((tree
));
2615 extern int conditional_context
PARAMS ((void));
2616 extern struct nesting
* current_nesting_level
PARAMS ((void));
2617 extern tree last_cleanup_this_contour
PARAMS ((void));
2618 extern void expand_start_case
PARAMS ((int, tree
, tree
,
2620 extern void expand_end_case
PARAMS ((tree
));
2621 extern int add_case_node
PARAMS ((tree
, tree
,
2623 extern int pushcase
PARAMS ((tree
,
2624 tree (*) (tree
, tree
),
2626 extern int pushcase_range
PARAMS ((tree
, tree
,
2627 tree (*) (tree
, tree
),
2629 extern void using_eh_for_cleanups
PARAMS ((void));
2630 extern int stmt_loop_nest_empty
PARAMS ((void));
2632 /* In fold-const.c */
2634 /* Fold constants as much as possible in an expression.
2635 Returns the simplified expression.
2636 Acts only on the top level of the expression;
2637 if the argument itself cannot be simplified, its
2638 subexpressions are not changed. */
2640 extern tree fold
PARAMS ((tree
));
2642 extern int force_fit_type
PARAMS ((tree
, int));
2643 extern int add_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2644 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2645 unsigned HOST_WIDE_INT
*,
2647 extern int neg_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2648 unsigned HOST_WIDE_INT
*,
2650 extern int mul_double
PARAMS ((unsigned HOST_WIDE_INT
,
2652 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2653 unsigned HOST_WIDE_INT
*,
2655 extern void lshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2656 HOST_WIDE_INT
, unsigned int,
2657 unsigned HOST_WIDE_INT
*,
2658 HOST_WIDE_INT
*, int));
2659 extern void rshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2660 HOST_WIDE_INT
, unsigned int,
2661 unsigned HOST_WIDE_INT
*,
2662 HOST_WIDE_INT
*, int));
2663 extern void lrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2664 HOST_WIDE_INT
, unsigned int,
2665 unsigned HOST_WIDE_INT
*,
2667 extern void rrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2668 HOST_WIDE_INT
, unsigned int,
2669 unsigned HOST_WIDE_INT
*,
2671 extern int operand_equal_p
PARAMS ((tree
, tree
, int));
2672 extern tree invert_truthvalue
PARAMS ((tree
));
2674 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2675 function arguments and return the new type. Return NULL_TREE if no
2676 change. Required by any language that supports variadic arguments. */
2678 extern tree (*lang_type_promotes_to
) PARAMS ((tree
));
2679 extern tree fold_builtin
PARAMS ((tree
));
2681 /* The language front-end must define these functions. */
2683 /* Function of no arguments for initializing lexical scanning. */
2684 extern void init_lex
PARAMS ((void));
2685 /* Function of no arguments for initializing the symbol table. */
2686 extern void init_decl_processing
PARAMS ((void));
2688 /* Function to identify which front-end produced the output file. */
2689 extern const char *lang_identify
PARAMS ((void));
2691 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2692 extern void copy_lang_decl
PARAMS ((tree
));
2694 /* Function called with no arguments to parse and compile the input. */
2695 extern int yyparse
PARAMS ((void));
2696 /* Functions for processing symbol declarations. */
2697 /* Function to enter a new lexical scope.
2698 Takes one argument: always zero when called from outside the front end. */
2699 extern void pushlevel
PARAMS ((int));
2700 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2701 Takes three arguments:
2702 KEEP -- nonzero if there were declarations in this scope.
2703 REVERSE -- reverse the order of decls before returning them.
2704 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2705 extern tree poplevel
PARAMS ((int, int, int));
2706 /* Set the BLOCK node for the current scope level. */
2707 extern void set_block
PARAMS ((tree
));
2708 /* Function to add a decl to the current scope level.
2709 Takes one argument, a decl to add.
2710 Returns that decl, or, if the same symbol is already declared, may
2711 return a different decl for that name. */
2712 extern tree pushdecl
PARAMS ((tree
));
2713 /* Function to return the chain of decls so far in the current scope level. */
2714 extern tree getdecls
PARAMS ((void));
2715 /* Function to return the chain of structure tags in the current scope level. */
2716 extern tree gettags
PARAMS ((void));
2718 extern tree build_range_type
PARAMS ((tree
, tree
, tree
));
2721 extern void record_component_aliases
PARAMS ((tree
));
2722 extern HOST_WIDE_INT get_alias_set
PARAMS ((tree
));
2723 extern int alias_sets_conflict_p
PARAMS ((HOST_WIDE_INT
,
2725 extern int readonly_fields_p
PARAMS ((tree
));
2726 extern int objects_must_conflict_p
PARAMS ((tree
, tree
));
2729 extern HOST_WIDE_INT lang_get_alias_set
PARAMS ((tree
));
2731 /* Set the DECL_ASSEMBLER_NAME for a node. If it is the sort of thing
2732 that the assembler should talk about, set DECL_ASSEMBLER_NAME to an
2733 appropriate IDENTIFIER_NODE. Otherwise, set it to the
2734 ERROR_MARK_NODE to ensure that the assembler does not talk about
2736 extern void (*lang_set_decl_assembler_name
) PARAMS ((tree
));
2741 extern int really_constant_p
PARAMS ((tree
));
2742 extern void set_identifier_size
PARAMS ((int));
2743 extern int int_fits_type_p
PARAMS ((tree
, tree
));
2744 extern int tree_log2
PARAMS ((tree
));
2745 extern int tree_floor_log2
PARAMS ((tree
));
2746 extern void preserve_data
PARAMS ((void));
2747 extern int object_permanent_p
PARAMS ((tree
));
2748 extern int type_precision
PARAMS ((tree
));
2749 extern int simple_cst_equal
PARAMS ((tree
, tree
));
2750 extern int compare_tree_int
PARAMS ((tree
, unsigned int));
2751 extern int type_list_equal
PARAMS ((tree
, tree
));
2752 extern int chain_member
PARAMS ((tree
, tree
));
2753 extern int chain_member_purpose
PARAMS ((tree
, tree
));
2754 extern int chain_member_value
PARAMS ((tree
, tree
));
2755 extern tree listify
PARAMS ((tree
));
2756 extern tree type_hash_lookup
PARAMS ((unsigned int, tree
));
2757 extern void type_hash_add
PARAMS ((unsigned int, tree
));
2758 extern unsigned int type_hash_list
PARAMS ((tree
));
2759 extern int simple_cst_list_equal
PARAMS ((tree
, tree
));
2760 extern void dump_tree_statistics
PARAMS ((void));
2761 extern void print_obstack_statistics
PARAMS ((const char *,
2764 extern void print_obstack_name
PARAMS ((char *, FILE *,
2767 extern void expand_function_end
PARAMS ((const char *, int, int));
2768 extern void expand_function_start
PARAMS ((tree
, int));
2769 extern void expand_pending_sizes
PARAMS ((tree
));
2771 extern int real_onep
PARAMS ((tree
));
2772 extern int real_twop
PARAMS ((tree
));
2773 extern void gcc_obstack_init
PARAMS ((struct obstack
*));
2774 extern void init_obstacks
PARAMS ((void));
2775 extern void build_common_tree_nodes
PARAMS ((int));
2776 extern void build_common_tree_nodes_2
PARAMS ((int));
2777 extern void mark_tree_hashtable
PARAMS ((void *));
2780 extern void setjmp_protect_args
PARAMS ((void));
2781 extern void setjmp_protect
PARAMS ((tree
));
2782 extern void expand_main_function
PARAMS ((void));
2783 extern void mark_varargs
PARAMS ((void));
2784 extern void init_dummy_function_start
PARAMS ((void));
2785 extern void expand_dummy_function_end
PARAMS ((void));
2786 extern void init_function_for_compilation
PARAMS ((void));
2787 extern void init_function_start
PARAMS ((tree
, const char *, int));
2788 extern void assign_parms
PARAMS ((tree
));
2789 extern void put_var_into_stack
PARAMS ((tree
));
2790 extern void flush_addressof
PARAMS ((tree
));
2791 extern void uninitialized_vars_warning
PARAMS ((tree
));
2792 extern void setjmp_args_warning
PARAMS ((void));
2793 extern void mark_all_temps_used
PARAMS ((void));
2794 extern void init_temp_slots
PARAMS ((void));
2795 extern void combine_temp_slots
PARAMS ((void));
2796 extern void free_temp_slots
PARAMS ((void));
2797 extern void pop_temp_slots
PARAMS ((void));
2798 extern void push_temp_slots
PARAMS ((void));
2799 extern void preserve_temp_slots
PARAMS ((struct rtx_def
*));
2800 extern void preserve_rtl_expr_temps
PARAMS ((tree
));
2801 extern int aggregate_value_p
PARAMS ((tree
));
2802 extern void free_temps_for_rtl_expr
PARAMS ((tree
));
2803 extern void instantiate_virtual_regs
PARAMS ((tree
, struct rtx_def
*));
2804 extern void unshare_all_rtl
PARAMS ((tree
, struct rtx_def
*));
2805 extern int max_parm_reg_num
PARAMS ((void));
2806 extern void push_function_context
PARAMS ((void));
2807 extern void pop_function_context
PARAMS ((void));
2808 extern void push_function_context_to
PARAMS ((tree
));
2809 extern void pop_function_context_from
PARAMS ((tree
));
2811 /* In print-rtl.c */
2813 extern void print_rtl
PARAMS ((FILE *, struct rtx_def
*));
2816 /* In print-tree.c */
2817 extern void debug_tree
PARAMS ((tree
));
2819 extern void print_node
PARAMS ((FILE *, const char *, tree
,
2821 extern void print_node_brief
PARAMS ((FILE *, const char *, tree
,
2823 extern void indent_to
PARAMS ((FILE *, int));
2827 extern int apply_args_register_offset
PARAMS ((int));
2828 extern struct rtx_def
*expand_builtin_return_addr
2829 PARAMS ((enum built_in_function
, int, struct rtx_def
*));
2830 extern void check_max_integer_computation_mode
PARAMS ((tree
));
2833 extern void start_sequence_for_rtl_expr
PARAMS ((tree
));
2834 extern struct rtx_def
*emit_line_note
PARAMS ((const char *, int));
2838 extern int setjmp_call_p
PARAMS ((tree
));
2842 extern int mark_addressable
PARAMS ((tree
));
2843 extern void incomplete_type_error
PARAMS ((tree
, tree
));
2844 extern void print_lang_statistics
PARAMS ((void));
2845 extern tree truthvalue_conversion
PARAMS ((tree
));
2847 extern void print_lang_decl
PARAMS ((FILE *, tree
, int));
2848 extern void print_lang_type
PARAMS ((FILE *, tree
, int));
2849 extern void print_lang_identifier
PARAMS ((FILE *, tree
, int));
2851 extern int global_bindings_p
PARAMS ((void));
2852 extern void insert_block
PARAMS ((tree
));
2854 /* In integrate.c */
2855 extern void save_for_inline
PARAMS ((tree
));
2856 extern void set_decl_abstract_flags
PARAMS ((tree
, int));
2857 extern void output_inline_function
PARAMS ((tree
));
2858 extern void set_decl_origin_self
PARAMS ((tree
));
2861 extern void set_yydebug
PARAMS ((int));
2863 /* In stor-layout.c */
2864 extern void fixup_signed_type
PARAMS ((tree
));
2865 extern void internal_reference_types
PARAMS ((void));
2868 extern void make_decl_rtl
PARAMS ((tree
, const char *));
2869 extern void make_decl_one_only
PARAMS ((tree
));
2870 extern int supports_one_only
PARAMS ((void));
2871 extern void variable_section
PARAMS ((tree
, int));
2873 /* In fold-const.c */
2874 extern int div_and_round_double
PARAMS ((enum tree_code
, int,
2875 unsigned HOST_WIDE_INT
,
2877 unsigned HOST_WIDE_INT
,
2879 unsigned HOST_WIDE_INT
*,
2881 unsigned HOST_WIDE_INT
*,
2885 extern void emit_nop
PARAMS ((void));
2886 extern void expand_computed_goto
PARAMS ((tree
));
2887 extern bool parse_output_constraint
PARAMS ((const char **,
2889 bool *, bool *, bool *));
2890 extern void expand_asm_operands
PARAMS ((tree
, tree
, tree
, tree
, int,
2891 const char *, int));
2892 extern int any_pending_cleanups
PARAMS ((int));
2893 extern void init_stmt
PARAMS ((void));
2894 extern void init_stmt_for_function
PARAMS ((void));
2895 extern int drop_through_at_end_p
PARAMS ((void));
2896 extern void expand_start_target_temps
PARAMS ((void));
2897 extern void expand_end_target_temps
PARAMS ((void));
2898 extern void expand_elseif
PARAMS ((tree
));
2899 extern void save_stack_pointer
PARAMS ((void));
2900 extern void expand_decl
PARAMS ((tree
));
2901 extern int expand_decl_cleanup
PARAMS ((tree
, tree
));
2902 extern void expand_anon_union_decl
PARAMS ((tree
, tree
, tree
));
2903 extern void move_cleanups_up
PARAMS ((void));
2904 extern void expand_start_case_dummy
PARAMS ((void));
2905 extern void expand_end_case_dummy
PARAMS ((void));
2906 extern tree case_index_expr_type
PARAMS ((void));
2907 extern HOST_WIDE_INT all_cases_count
PARAMS ((tree
, int *));
2908 extern void check_for_full_enumeration_handling
PARAMS ((tree
));
2909 extern void declare_nonlocal_label
PARAMS ((tree
));
2911 extern void lang_print_xnode
PARAMS ((FILE *, tree
, int));
2915 /* If KIND=='I', return a suitable global initializer (constructor) name.
2916 If KIND=='D', return a suitable global clean-up (destructor) name. */
2917 extern tree get_file_function_name
PARAMS ((int));
2919 /* Interface of the DWARF2 unwind info support. */
2921 /* Generate a new label for the CFI info to refer to. */
2923 extern char *dwarf2out_cfi_label
PARAMS ((void));
2925 /* Entry point to update the canonical frame address (CFA). */
2927 extern void dwarf2out_def_cfa
PARAMS ((const char *, unsigned, long));
2929 /* Add the CFI for saving a register window. */
2931 extern void dwarf2out_window_save
PARAMS ((const char *));
2933 /* Add a CFI to update the running total of the size of arguments pushed
2936 extern void dwarf2out_args_size
PARAMS ((const char *, long));
2938 /* Entry point for saving a register to the stack. */
2940 extern void dwarf2out_reg_save
PARAMS ((const char *, unsigned, long));
2942 /* Entry point for saving the return address in the stack. */
2944 extern void dwarf2out_return_save
PARAMS ((const char *, long));
2946 /* Entry point for saving the return address in a register. */
2948 extern void dwarf2out_return_reg
PARAMS ((const char *, unsigned));
2951 /* Redefine abort to report an internal error w/o coredump, and
2952 reporting the location of the error in the source file. This logic
2953 is duplicated in rtl.h and tree.h because every file that needs the
2954 special abort includes one or both. toplev.h gets too few files,
2955 system.h gets too many. */
2957 extern void fancy_abort
PARAMS ((const char *, int, const char *))
2959 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)