1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 LAST_AND_UNUSED_TREE_CODE
/* A convenient way to get a value for
42 /* Number of language-independent tree codes. */
43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern char tree_code_type
[MAX_TREE_CODES
];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns non-zero iff CLASS is the tree-code class of an
59 #define IS_EXPR_CODE_CLASS(CLASS) \
60 (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e')
62 /* Number of argument-words in each kind of tree-node. */
64 extern int tree_code_length
[MAX_TREE_CODES
];
65 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
67 /* Names of tree components. */
69 extern const char *tree_code_name
[MAX_TREE_CODES
];
71 /* Classify which part of the compiler has defined a given builtin function.
72 Note that we assume below that this is no more than two bits. */
81 /* Names for the above. */
82 extern const char *const built_in_class_names
[4];
84 /* Codes that identify the various built in functions
85 so that expand_call can identify them quickly. */
87 #define DEF_BUILTIN(x) x,
88 enum built_in_function
90 #include "builtins.def"
92 /* Upper bound on non-language-specific builtins. */
97 /* Names for the above. */
98 extern const char *const built_in_names
[(int) END_BUILTINS
];
100 /* An array of _DECL trees for the above. */
101 extern union tree_node
*built_in_decls
[(int) END_BUILTINS
];
103 /* The definition of tree nodes fills the next several pages. */
105 /* A tree node can represent a data type, a variable, an expression
106 or a statement. Each node has a TREE_CODE which says what kind of
107 thing it represents. Some common codes are:
108 INTEGER_TYPE -- represents a type of integers.
109 ARRAY_TYPE -- represents a type of pointer.
110 VAR_DECL -- represents a declared variable.
111 INTEGER_CST -- represents a constant integer value.
112 PLUS_EXPR -- represents a sum (an expression).
114 As for the contents of a tree node: there are some fields
115 that all nodes share. Each TREE_CODE has various special-purpose
116 fields as well. The fields of a node are never accessed directly,
117 always through accessor macros. */
119 /* This type is used everywhere to refer to a tree node. */
121 typedef union tree_node
*tree
;
123 /* Every kind of tree node starts with this structure,
124 so all nodes have these fields.
126 See the accessor macros, defined below, for documentation of the
131 union tree_node
*chain
;
132 union tree_node
*type
;
133 ENUM_BITFIELD(tree_code
) code
: 8;
134 unsigned side_effects_flag
: 1;
135 unsigned constant_flag
: 1;
136 unsigned addressable_flag
: 1;
137 unsigned volatile_flag
: 1;
138 unsigned readonly_flag
: 1;
139 unsigned unsigned_flag
: 1;
140 unsigned asm_written_flag
: 1;
142 unsigned used_flag
: 1;
143 unsigned nothrow_flag
: 1;
144 unsigned static_flag
: 1;
145 unsigned public_flag
: 1;
146 unsigned private_flag
: 1;
147 unsigned protected_flag
: 1;
148 unsigned bounded_flag
: 1;
150 unsigned lang_flag_0
: 1;
151 unsigned lang_flag_1
: 1;
152 unsigned lang_flag_2
: 1;
153 unsigned lang_flag_3
: 1;
154 unsigned lang_flag_4
: 1;
155 unsigned lang_flag_5
: 1;
156 unsigned lang_flag_6
: 1;
157 /* This flag is presently unused. However, language front-ends
158 should not make use of this flag; it is reserved for future
163 /* The following table lists the uses of each of the above flags and
164 for which types of nodes they are defined. Note that expressions
170 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
171 ..._TYPE, IDENTIFIER_NODE
176 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
177 TREE_NO_UNUSED_WARNING in
178 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
180 TREE_LIST or TREE_VEC
181 TREE_CONSTANT_OVERFLOW in
182 INTEGER_CST, REAL_CST, COMPLEX_CST
183 TREE_SYMBOL_REFERENCED in
189 INTEGER_CST, REAL_CST, COMPLEX_CST
191 VAR_DECL or FUNCTION_DECL
193 TREE_LIST or TREE_VEC
194 EXPR_WFL_EMIT_LINE_NOTE in
195 EXPR_WITH_FILE_LOCATION
200 TREE_LIST or TREE_VEC
202 ??? unspecified nodes
206 TREE_VIA_PROTECTED in
210 ??? unspecified nodes
219 TREE_THIS_VOLATILE in
239 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
240 DECL_BUILT_IN_NONANSI in
244 SAVE_EXPR_NOPLACEHOLDER in
250 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
256 expressions, IDENTIFIER_NODE
261 CALL_EXPR, FUNCTION_DECL
266 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) ((NODE)->common.code = (int) (VALUE))
279 /* When checking is enabled, errors will be generated if a tree node
280 is accessed incorrectly. The macros abort with a fatal error. */
281 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
283 #define TREE_CHECK(t, code) __extension__ \
284 ({ const tree __t = t; \
285 if (TREE_CODE(__t) != (code)) \
286 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
288 #define TREE_CLASS_CHECK(t, class) __extension__ \
289 ({ const tree __t = t; \
290 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
291 tree_class_check_failed (__t, class, __FILE__, __LINE__, __FUNCTION__); \
294 /* These checks have to be special cased. */
295 #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
296 ({ const tree __t = t; \
297 enum tree_code __c = TREE_CODE(__t); \
298 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
299 tree_check_failed (__t, CONSTRUCTOR, __FILE__, __LINE__, __FUNCTION__); \
301 #define EXPR_CHECK(t) __extension__ \
302 ({ const tree __t = t; \
303 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
304 if (__c != 'r' && __c != 's' && __c != '<' \
305 && __c != '1' && __c != '2' && __c != 'e') \
306 tree_class_check_failed(__t, 'e', __FILE__, __LINE__, __FUNCTION__); \
309 extern void tree_check_failed
PARAMS ((const tree
, enum tree_code
,
310 const char *, int, const char *))
312 extern void tree_class_check_failed
PARAMS ((const tree
, int,
313 const char *, int, const char *))
316 #else /* not ENABLE_TREE_CHECKING, or not gcc */
318 #define TREE_CHECK(t, code) (t)
319 #define TREE_CLASS_CHECK(t, code) (t)
320 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
321 #define EXPR_CHECK(t) (t)
325 #include "tree-check.h"
327 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
328 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
329 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
331 /* In all nodes that are expressions, this is the data type of the expression.
332 In POINTER_TYPE nodes, this is the type that the pointer points to.
333 In ARRAY_TYPE nodes, this is the type of the elements.
334 In VECTOR_TYPE nodes, this is the type of the elements. */
335 #define TREE_TYPE(NODE) ((NODE)->common.type)
337 /* Nodes are chained together for many purposes.
338 Types are chained together to record them for being output to the debugger
339 (see the function `chain_type').
340 Decls in the same scope are chained together to record the contents
342 Statement nodes for successive statements used to be chained together.
343 Often lists of things are represented by TREE_LIST nodes that
344 are chained together. */
346 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
348 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
349 that don't change the machine mode. */
351 #define STRIP_NOPS(EXP) \
352 while ((TREE_CODE (EXP) == NOP_EXPR \
353 || TREE_CODE (EXP) == CONVERT_EXPR \
354 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
355 && TREE_OPERAND (EXP, 0) != error_mark_node \
356 && (TYPE_MODE (TREE_TYPE (EXP)) \
357 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
358 (EXP) = TREE_OPERAND (EXP, 0);
360 /* Like STRIP_NOPS, but don't let the signedness change either. */
362 #define STRIP_SIGN_NOPS(EXP) \
363 while ((TREE_CODE (EXP) == NOP_EXPR \
364 || TREE_CODE (EXP) == CONVERT_EXPR \
365 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
366 && TREE_OPERAND (EXP, 0) != error_mark_node \
367 && (TYPE_MODE (TREE_TYPE (EXP)) \
368 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
369 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
370 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
371 (EXP) = TREE_OPERAND (EXP, 0);
373 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
375 #define STRIP_TYPE_NOPS(EXP) \
376 while ((TREE_CODE (EXP) == NOP_EXPR \
377 || TREE_CODE (EXP) == CONVERT_EXPR \
378 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
379 && TREE_OPERAND (EXP, 0) != error_mark_node \
380 && (TREE_TYPE (EXP) \
381 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
382 (EXP) = TREE_OPERAND (EXP, 0);
384 /* Nonzero if TYPE represents an integral type. Note that we do not
385 include COMPLEX types here. */
387 #define INTEGRAL_TYPE_P(TYPE) \
388 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
389 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
391 /* Nonzero if TYPE represents a floating-point type, including complex
392 floating-point types. */
394 #define FLOAT_TYPE_P(TYPE) \
395 (TREE_CODE (TYPE) == REAL_TYPE \
396 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
397 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
399 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
401 #define AGGREGATE_TYPE_P(TYPE) \
402 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
403 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
404 || TREE_CODE (TYPE) == SET_TYPE)
406 /* Nonzero if TYPE represents an unbounded pointer or unbounded
407 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
409 #define POINTER_TYPE_P(TYPE) \
410 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
412 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
414 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
415 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
417 /* Nonzero if TYPE represents a bounded pointer type. */
419 #define BOUNDED_POINTER_TYPE_P(TYPE) \
420 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
421 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
423 /* Nonzero if TYPE represents a bounded reference type. Bounded
424 reference types have two specific uses: (1) When a reference is
425 seated to a variable-length RECORD_TYPE that has an array of
426 indeterminate length as its final field. For all other objects, it
427 is sufficient to check bounds at the time the reference is seated,
428 and assume that all future uses of the reference are safe, since
429 the address of references cannot change. (2) When a reference
430 supertype is seated to an subtype object. The bounds "remember"
431 the true size of the complete object, so that subsequent upcasts of
432 the address of the reference will be checked properly (is such a
433 thing valid C++?). */
435 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
436 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
437 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
439 /* Nonzero if TYPE represents a pointer or reference type, either
440 bounded or unbounded. */
442 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
443 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
445 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
447 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
448 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
450 /* Nonzero if TYPE represents a reference type, either bounded or unbounded. */
452 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
453 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
455 /* Nonzero if this type is a complete type. */
456 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
458 /* Nonzero if this type is the (possibly qualified) void type. */
459 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
461 /* Nonzero if this type is complete or is cv void. */
462 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
463 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
465 /* Nonzero if this type is complete or is an array with unspecified bound. */
466 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
467 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE))
469 /* Nonzero if TYPE represents a type. */
471 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
473 /* Define many boolean fields that all tree nodes have. */
475 /* In VAR_DECL nodes, nonzero means address of this is needed.
476 So it cannot be in a register.
477 In a FUNCTION_DECL, nonzero means its address is needed.
478 So it must be compiled even if it is an inline function.
479 In a FIELD_DECL node, it means that the programmer is permitted to
480 construct the address of this field. This is used for aliasing
481 purposes: see record_component_aliases.
482 In CONSTRUCTOR nodes, it means object constructed must be in memory.
483 In LABEL_DECL nodes, it means a goto for this label has been seen
484 from a place outside all binding contours that restore stack levels.
485 In ..._TYPE nodes, it means that objects of this type must
486 be fully addressable. This means that pieces of this
487 object cannot go into register parameters, for example.
488 In IDENTIFIER_NODEs, this means that some extern decl for this name
489 had its address taken. That matters for inline functions. */
490 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
492 /* In a VAR_DECL, nonzero means allocate static storage.
493 In a FUNCTION_DECL, nonzero if function has been defined.
494 In a CONSTRUCTOR, nonzero means allocate static storage. */
495 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
497 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
498 made implicitly and should not lead to an "unused value" warning. */
499 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
501 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
502 chain is via a `virtual' declaration. */
503 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
505 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
506 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
507 requires a diagnostic when overflows occur in constant expressions. */
508 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
510 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
511 this string as an argument. */
512 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
514 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
515 overflow in folding, and no warning has been issued for this subexpression.
516 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
517 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
519 /* In a VAR_DECL or FUNCTION_DECL,
520 nonzero means name is to be accessible from outside this module.
521 In an identifier node, nonzero means an external declaration
522 accessible from outside this module was previously seen
523 for this name in an inner scope. */
524 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
526 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
527 base class is via a `public' declaration, which preserves public
528 fields from the base class as public. */
529 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
531 /* Ditto, for `private' declarations. */
532 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
534 /* Nonzero for TREE_LIST node means that the path to the
535 base class is via a `protected' declaration, which preserves
536 protected fields from the base class as protected.
538 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
540 /* In any expression, nonzero means it has side effects or reevaluation
541 of the whole expression could produce a different value.
542 This is set if any subexpression is a function call, a side effect
543 or a reference to a volatile variable.
544 In a ..._DECL, this is set only if the declaration said `volatile'. */
545 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
547 /* Nonzero means this expression is volatile in the C sense:
548 its address should be of type `volatile WHATEVER *'.
549 In other words, the declared item is volatile qualified.
550 This is used in _DECL nodes and _REF nodes.
552 In a ..._TYPE node, means this type is volatile-qualified.
553 But use TYPE_VOLATILE instead of this macro when the node is a type,
554 because eventually we may make that a different bit.
556 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
557 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
559 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
560 nonzero means it may not be the lhs of an assignment.
561 In a ..._TYPE node, means this type is const-qualified
562 (but the macro TYPE_READONLY should be used instead of this macro
563 when the node is a type). */
564 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
566 /* Value of expression is constant.
567 Always appears in all ..._CST nodes.
568 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
569 if the value is constant. */
570 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
572 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
573 In FIELD_DECL nodes, means an unsigned bit field.
574 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
575 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
577 #define TYPE_TRAP_SIGNED(NODE) (flag_trapv && ! TREE_UNSIGNED (NODE))
579 /* Nonzero in a VAR_DECL means assembler code has been written.
580 Nonzero in a FUNCTION_DECL means that the function has been compiled.
581 This is interesting in an inline function, since it might not need
582 to be compiled separately.
583 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
584 if the sdb debugging info for the type has been written.
585 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
586 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
588 /* Nonzero in a _DECL if the name is used in its scope.
589 Nonzero in an expr node means inhibit warning if value is unused.
590 In IDENTIFIER_NODEs, this means that some extern decl for this name
592 #define TREE_USED(NODE) ((NODE)->common.used_flag)
594 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
595 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
596 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
598 /* Used in classes in C++. */
599 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
600 /* Used in classes in C++.
601 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
602 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
604 /* In a ..._TYPE node, nonzero means that the type's size and layout,
605 (or the size and layout of its arguments and/or return value in the
606 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
607 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
608 node is a type, because eventually we may make that a different
609 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
610 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
611 BOUNDED_INDIRECT_TYPE_P to test for that.
613 In a FUNCTION_DECL, nonzero means that the size and layout of one
614 of its arguments and/or return value was changed by the presence of
615 pointer bounds. This value can differ from the value of
616 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
617 declared, then later called with pointer args, or was declared with
618 a variable argument list and is later called with pointer values in
619 the variable argument list.
621 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
622 of the decl's type's BOUNDED_POINTER_TYPE_P.
624 In a CONSTRUCTOR or other expression, nonzero means the value is a
625 bounded pointer. It is insufficient to determine the boundedness
626 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
627 since we allow pointer to be temporarily cast to integer for
628 rounding up to an alignment boudary in a way that preserves the
631 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
632 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
633 of a function that has bounded pointer(s) for its return type and/or
636 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
638 /* These flags are available for each language front end to use internally. */
639 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
640 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
641 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
642 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
643 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
644 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
645 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
647 /* Define additional fields and accessors for nodes representing constants. */
649 /* In an INTEGER_CST node. These two together make a 2-word integer.
650 If the data type is signed, the value is sign-extended to 2 words
651 even though not all of them may really be in use.
652 In an unsigned constant shorter than 2 words, the extra bits are 0. */
653 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
654 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
655 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
657 #define INT_CST_LT(A, B) \
658 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
659 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
660 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
662 #define INT_CST_LT_UNSIGNED(A, B) \
663 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
664 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
665 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
666 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
667 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
671 struct tree_common common
;
672 struct rtx_def
*rtl
; /* acts as link to register transfer language
674 /* A sub-struct is necessary here because the function `const_hash'
675 wants to scan both words as a unit and taking the address of the
676 sub-struct yields the properly inclusive bounded pointer. */
678 unsigned HOST_WIDE_INT low
;
683 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
684 and generally in all kinds of constants that could
685 be given labels (rather than being immediate). */
687 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
689 /* In a REAL_CST node. */
690 /* We can represent a real value as either a `double' or a string.
691 Strings don't allow for any optimization, but they do allow
692 for cross-compilation. */
694 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
700 struct tree_common common
;
701 struct rtx_def
*rtl
; /* acts as link to register transfer language
703 REAL_VALUE_TYPE real_cst
;
706 /* In a STRING_CST */
707 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
708 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
712 struct tree_common common
;
713 struct rtx_def
*rtl
; /* acts as link to register transfer language
719 /* In a COMPLEX_CST node. */
720 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
721 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
725 struct tree_common common
;
726 struct rtx_def
*rtl
; /* acts as link to register transfer language
728 union tree_node
*real
;
729 union tree_node
*imag
;
732 /* Define fields and accessors for some special-purpose tree nodes. */
734 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
735 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
737 struct tree_identifier
739 struct tree_common common
;
744 /* In a TREE_LIST node. */
745 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
746 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
750 struct tree_common common
;
751 union tree_node
*purpose
;
752 union tree_node
*value
;
755 /* In a TREE_VEC node. */
756 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
757 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
758 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
762 struct tree_common common
;
764 union tree_node
*a
[1];
767 /* Define fields and accessors for some nodes that represent expressions. */
769 /* In a SAVE_EXPR node. */
770 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
771 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
772 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
773 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
774 both in normal code and in a handler. (Normally, in a handler, all
775 SAVE_EXPRs are unsaved, meaning that there values are
777 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
779 /* In a RTL_EXPR node. */
780 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
781 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
783 /* In a CONSTRUCTOR node. */
784 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
786 /* In ordinary expression nodes. */
787 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
788 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
790 /* In a LABELED_BLOCK_EXPR node. */
791 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
792 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
794 /* In a EXIT_BLOCK_EXPR node. */
795 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
796 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
798 /* In a LOOP_EXPR node. */
799 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
801 /* In a EXPR_WITH_FILE_LOCATION node. */
802 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
803 #define EXPR_WFL_FILENAME(NODE) \
804 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
805 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
806 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
807 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
808 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
809 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
810 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
811 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
815 struct tree_common common
;
817 union tree_node
*operands
[1];
820 /* In a BLOCK node. */
821 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
822 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
823 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
824 /* Note: when changing this, make sure to find the places
825 that use chainon or nreverse. */
826 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
827 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
828 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
830 /* Nonzero means that this block is prepared to handle exceptions
831 listed in the BLOCK_VARS slot. */
832 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
834 /* An index number for this block. These values are not guaranteed to
835 be unique across functions -- whether or not they are depends on
836 the debugging output format in use. */
837 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
841 struct tree_common common
;
843 unsigned handler_block_flag
: 1;
844 unsigned abstract_flag
: 1;
845 unsigned block_num
: 30;
847 union tree_node
*vars
;
848 union tree_node
*subblocks
;
849 union tree_node
*supercontext
;
850 union tree_node
*abstract_origin
;
853 /* Define fields and accessors for nodes representing data types. */
855 /* See tree.def for documentation of the use of these fields.
856 Look at the documentation of the various ..._TYPE tree codes. */
858 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
859 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
860 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
861 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
862 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
863 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
864 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
865 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
866 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
867 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
868 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
869 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
870 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
871 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
872 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
873 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
874 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
875 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
876 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
877 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
878 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
879 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
880 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
881 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
882 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
884 /* For a VECTOR_TYPE node, this describes a different type which is emitted
885 in the debugging output. We use this to describe a vector as a
886 structure containing an array. */
887 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
889 /* Indirect types present difficulties because they may be represented
890 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
891 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
892 be logically equivalent, but physically different. Simple
893 comparison of the main variant only tells if the types are
894 logically equivalent. Use this predicate to compare for physical
897 /* Types have the same main variant, and have the same boundedness. */
898 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
899 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
900 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
902 /* Return the type variant that has no qualifiers (i.e., the main variant),
903 except that the boundedness qualifier is preserved. */
904 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
905 (BOUNDED_POINTER_TYPE_P (TYPE) \
906 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
907 : TYPE_MAIN_VARIANT (TYPE))
909 /* For aggregate types, information about this type, as a base type
910 for itself. Used in a language-dependent way for types that are
911 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
912 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
914 /* The (language-specific) typed-based alias set for this type.
915 Objects whose TYPE_ALIAS_SETs are different cannot alias each
916 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
917 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
918 type can alias objects of any type. */
919 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
921 /* Nonzero iff the typed-based alias set for this type has been
923 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
924 (TYPE_CHECK (NODE)->type.alias_set != -1)
926 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
928 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
930 /* The alignment necessary for objects of this type.
931 The value is an int, measured in bits. */
932 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
934 /* 1 if the alignment for this type was requested by "aligned" attribute,
935 0 if it is the default for this type. */
936 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
938 /* The alignment for NODE, in bytes. */
939 #define TYPE_ALIGN_UNIT(NODE) \
940 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
942 /* If your language allows you to declare types, and you want debug info
943 for them, then you need to generate corresponding TYPE_DECL nodes.
944 These "stub" TYPE_DECL nodes have no name, and simply point at the
945 type node. You then set the TYPE_STUB_DECL field of the type node
946 to point back at the TYPE_DECL node. This allows the debug routines
947 to know that the two nodes represent the same type, so that we only
948 get one debug info record for them. */
949 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
951 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
952 has BLKmode only because it lacks the alignment requirement for
954 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
956 /* In an INTEGER_TYPE, it means the type represents a size. We use
957 this both for validity checking and to permit optimizations that
958 are unsafe for other types. Note that the C `size_t' type should
959 *not* have this flag set. The `size_t' type is simply a typedef
960 for an ordinary integer type that happens to be the type of an
961 expression returned by `sizeof'; `size_t' has no special
962 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
963 always actual sizes. */
964 #define TYPE_IS_SIZETYPE(NODE) \
965 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
967 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
968 pointer depressed. */
969 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
970 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
972 /* Nonzero in a type considered volatile as a whole. */
973 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
975 /* Means this type is const-qualified. */
976 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
978 /* If nonzero, this type is `restrict'-qualified, in the C sense of
980 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
982 /* If nonzero, this type's size and layout, (or the size and layout of
983 its arguments and/or return value in the case of a FUNCTION_TYPE or
984 METHOD_TYPE) was changed by the presence of pointer bounds. */
985 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
987 /* There is a TYPE_QUAL value for each type qualifier. They can be
988 combined by bitwise-or to form the complete set of qualifiers for a
991 #define TYPE_UNQUALIFIED 0x0
992 #define TYPE_QUAL_CONST 0x1
993 #define TYPE_QUAL_VOLATILE 0x2
994 #define TYPE_QUAL_RESTRICT 0x4
995 #define TYPE_QUAL_BOUNDED 0x8
997 /* The set of type qualifiers for this type. */
998 #define TYPE_QUALS(NODE) \
999 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1000 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1001 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1002 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1004 /* The set of qualifiers pertinent to an expression node. */
1005 #define TREE_EXPR_QUALS(NODE) \
1006 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1007 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1008 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1010 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1011 #define TREE_FUNC_QUALS(NODE) \
1012 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1013 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1015 /* These flags are available for each language front end to use internally. */
1016 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1017 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1018 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1019 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1020 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1021 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1022 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1024 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1025 that distinguish string from array of char).
1026 If set in a SET_TYPE, indicates a bitstring type. */
1027 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1029 /* If non-NULL, this is a upper bound of the size (in bytes) of an
1030 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
1031 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
1033 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1034 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) (GET_MODE_NUNITS (TYPE_CHECK (VECTOR_TYPE)->type.mode))
1036 /* Indicates that objects of this type must be initialized by calling a
1037 function when they are created. */
1038 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1039 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1041 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1042 the same way that the first union alternative would be passed. */
1043 #define TYPE_TRANSPARENT_UNION(NODE) \
1044 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1046 /* For an ARRAY_TYPE, indicates that it is not permitted to
1047 take the address of a component of the type. */
1048 #define TYPE_NONALIASED_COMPONENT(NODE) \
1049 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1051 /* Indicated that objects of this type should be laid out in as
1052 compact a way as possible. */
1053 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1055 /* A bounded pointer or bounded reference type (collectively called
1056 indirect types) is represented as a RECORD_TYPE node containing
1057 three pointer fields whose type is the corresponding unbounded
1058 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1059 a bounded indirect type differs from a normal RECORD_TYPE node in
1060 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1061 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1062 nodes are stored on the same type variant chain alongside the
1063 variants of the underlaying indirect types nodes. The main variant
1064 of such chains is always the unbounded type. */
1066 /* Access the field decls of a bounded-pointer type. */
1067 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1068 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1069 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1071 /* Access the simple-pointer subtype of a bounded-pointer type. */
1072 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1074 /* Find the unbounded counterpart to a type, or return TYPE if it is
1075 already unbounded. */
1076 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1077 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1079 /* This field comprises two bits, for values in the range 0..3:
1081 depth=0 means that type is a scalar, or an aggregate that contains
1082 only depth=0 types, or a function that has only depth=0 types for
1083 its return value and argument types.
1085 depth=1 means that type is a pointer to a depth=0 type, or an
1086 aggregate that contains only depth=0 and depth=1 types, or a
1087 function that has only depth=0 and depth=1 types for its return
1088 value and argument types.
1090 The meanings of depth=2 and depth=3 are obvious by induction.
1091 Varargs functions are depth=3. The type `va_list' is depth=3.
1093 The purpose of measuring pointer depth of a type is to determine
1094 the eligibility of a function for an automatically-generated
1095 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1096 depth=1 function is eligible for an automatic thunk. Functions
1097 with depth 2 or more are too complex to get automatic thunks.
1099 Function decls also have a pointer_depth field, since we also
1100 consider the actual argument types for functions. */
1102 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1104 /* In a FUNCTION_TYPE node, this bit stores the value of
1105 default_pointer_boundedness at the time TYPE was created. It is
1106 useful for choosing default boundedness of function arguments for
1107 non-prototype function decls and for varargs/stdarg lists. */
1108 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1109 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1111 #define MAX_POINTER_DEPTH 2
1112 #define VA_LIST_POINTER_DEPTH 3
1116 struct tree_common common
;
1117 union tree_node
*values
;
1118 union tree_node
*size
;
1119 union tree_node
*size_unit
;
1120 union tree_node
*attributes
;
1123 unsigned int precision
: 9;
1124 ENUM_BITFIELD(machine_mode
) mode
: 7;
1126 unsigned string_flag
: 1;
1127 unsigned no_force_blk_flag
: 1;
1128 unsigned needs_constructing_flag
: 1;
1129 unsigned transparent_union_flag
: 1;
1130 unsigned packed_flag
: 1;
1131 unsigned restrict_flag
: 1;
1132 unsigned pointer_depth
: 2;
1134 unsigned lang_flag_0
: 1;
1135 unsigned lang_flag_1
: 1;
1136 unsigned lang_flag_2
: 1;
1137 unsigned lang_flag_3
: 1;
1138 unsigned lang_flag_4
: 1;
1139 unsigned lang_flag_5
: 1;
1140 unsigned lang_flag_6
: 1;
1141 unsigned user_align
: 1;
1144 union tree_node
*pointer_to
;
1145 union tree_node
*reference_to
;
1146 union {int address
; char *pointer
; } symtab
;
1147 union tree_node
*name
;
1148 union tree_node
*minval
;
1149 union tree_node
*maxval
;
1150 union tree_node
*next_variant
;
1151 union tree_node
*main_variant
;
1152 union tree_node
*binfo
;
1153 union tree_node
*noncopied_parts
;
1154 union tree_node
*context
;
1155 HOST_WIDE_INT alias_set
;
1156 /* Points to a structure whose details depend on the language in use. */
1157 struct lang_type
*lang_specific
;
1160 /* Define accessor macros for information about type inheritance
1163 A "basetype" means a particular usage of a data type for inheritance
1164 in another type. Each such basetype usage has its own "binfo"
1165 object to describe it. The binfo object is a TREE_VEC node.
1167 Inheritance is represented by the binfo nodes allocated for a
1168 given type. For example, given types C and D, such that D is
1169 inherited by C, 3 binfo nodes will be allocated: one for describing
1170 the binfo properties of C, similarly one for D, and one for
1171 describing the binfo properties of D as a base type for C.
1172 Thus, given a pointer to class C, one can get a pointer to the binfo
1173 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1175 /* The actual data type node being inherited in this basetype. */
1176 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1178 /* The offset where this basetype appears in its containing type.
1179 BINFO_OFFSET slot holds the offset (in bytes)
1180 from the base of the complete object to the base of the part of the
1181 object that is allocated on behalf of this `type'.
1182 This is always 0 except when there is multiple inheritance. */
1184 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1185 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1186 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1188 /* The virtual function table belonging to this basetype. Virtual
1189 function tables provide a mechanism for run-time method dispatching.
1190 The entries of a virtual function table are language-dependent. */
1192 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1193 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1195 /* The virtual functions in the virtual function table. This is
1196 a TREE_LIST that is used as an initial approximation for building
1197 a virtual function table for this basetype. */
1198 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1199 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1201 /* A vector of binfos for the direct basetypes inherited by this
1204 If this basetype describes type D as inherited in C, and if the
1205 basetypes of D are E and F, then this vector contains binfos for
1206 inheritance of E and F by C.
1208 ??? This could probably be done by just allocating the
1209 base types at the end of this TREE_VEC (instead of using
1210 another TREE_VEC). This would simplify the calculation
1211 of how many basetypes a given type had. */
1212 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1213 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1215 /* The number of basetypes for NODE. */
1216 #define BINFO_N_BASETYPES(NODE) \
1217 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1219 /* Accessor macro to get to the Nth basetype of this basetype. */
1220 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1221 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1223 /* For a BINFO record describing a virtual base class, i.e., one where
1224 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1225 base. The actual contents are language-dependent. Under the old
1226 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1227 pointer to the virtual base; under the new ABI this field is
1228 instead a INTEGER_CST giving an offset into the vtable where the
1229 offset to the virtual base can be found. */
1230 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1232 /* The size of a base class subobject of this type. Not all frontends
1233 currently allocate the space for these fields. */
1234 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1235 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1236 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1237 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1239 /* Slot used to build a chain that represents a use of inheritance.
1240 For example, if X is derived from Y, and Y is derived from Z,
1241 then this field can be used to link the binfo node for X to
1242 the binfo node for X's Y to represent the use of inheritance
1243 from X to Y. Similarly, this slot of the binfo node for X's Y
1244 can point to the Z from which Y is inherited (in X's inheritance
1245 hierarchy). In this fashion, one can represent and traverse specific
1246 uses of inheritance using the binfo nodes themselves (instead of
1247 consing new space pointing to binfo nodes).
1248 It is up to the language-dependent front-ends to maintain
1249 this information as necessary. */
1250 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1252 /* Define fields and accessors for nodes representing declared names. */
1254 /* Nonzero if DECL represents a decl. */
1255 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1256 /* This is the name of the object as written by the user.
1257 It is an IDENTIFIER_NODE. */
1258 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1259 /* This is the name of the object as the assembler will see it
1260 (but before any translations made by ASM_OUTPUT_LABELREF).
1261 Often this is the same as DECL_NAME.
1262 It is an IDENTIFIER_NODE. */
1263 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1264 /* Records the section name in a section attribute. Used to pass
1265 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1266 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1267 /* For FIELD_DECLs, this is the
1268 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1269 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1270 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1271 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1272 type, or NULL_TREE if the given decl has "file scope". */
1273 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1274 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1275 /* In a DECL this is the field where configuration dependent machine
1276 attributes are store */
1277 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1278 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1279 byte containing the bit closest to the beginning of the structure. */
1280 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1281 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1282 field from DECL_FIELD_OFFSET. */
1283 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1284 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1285 if so, the type that was originally specified for it.
1286 TREE_TYPE may have been modified (in finish_struct). */
1287 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1288 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1289 /* VAR_DECL and PARM_DECL reserve the arguments slot
1290 for language-specific uses. */
1291 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1292 /* This field is used to reference anything in decl.result and is meant only
1293 for use by the garbage collector. */
1294 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1295 /* In FUNCTION_DECL, holds the decl for the return value. */
1296 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1297 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1298 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1299 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1300 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1301 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1302 For a VAR_DECL, holds the initial value.
1303 For a PARM_DECL, not used--default
1304 values for parameters are encoded in the type of the function,
1305 not in the PARM_DECL slot. */
1306 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1307 /* For a PARM_DECL, records the data type used to pass the argument,
1308 which may be different from the type seen in the program. */
1309 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1310 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1311 if nonzero, indicates that the field occupies the type. */
1312 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1313 /* These two fields describe where in the source code the declaration was. */
1314 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1315 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1316 /* Holds the size of the datum, in bits, as a tree expression.
1317 Need not be constant. */
1318 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1319 /* Likewise for the size in bytes. */
1320 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1321 /* Holds the alignment required for the datum, in bits. */
1322 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1323 /* The alignment of NODE, in bytes. */
1324 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1325 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1326 DECL_FIELD_OFFSET which are known to be always zero.
1327 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1329 #define DECL_OFFSET_ALIGN(NODE) \
1330 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1331 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1332 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1333 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1334 /* 1 if the alignment for this type was requested by "aligned" attribute,
1335 0 if it is the default for this type. */
1336 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1337 /* Holds the machine mode corresponding to the declaration of a variable or
1338 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1340 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1341 /* Holds the RTL expression for the value of a variable or function. If
1342 PROMOTED_MODE is defined, the mode of this expression may not be same
1343 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1344 to the variable's data type, while the mode
1345 of DECL_RTL is the mode actually used to contain the data. */
1346 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1347 /* Holds an INSN_LIST of all of the live ranges in which the variable
1348 has been moved to a possibly different register. */
1349 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1350 /* For PARM_DECL, holds an RTL for the stack slot or register
1351 where the data was actually passed. */
1352 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1353 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1354 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1355 /* For FUNCTION_DECL, if it is inline,
1356 holds the size of the stack frame, as an integer. */
1357 #define DECL_FRAME_SIZE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.i)
1358 /* For FUNCTION_DECL, if it is built-in,
1359 this identifies which built-in operation it is. */
1360 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1362 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1363 Before the struct containing the FUNCTION_DECL is laid out,
1364 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1365 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1366 function. When the class is laid out, this pointer is changed
1367 to an INTEGER_CST node which is suitable for use as an index
1368 into the virtual function table. */
1369 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1370 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1371 which this FIELD_DECL is defined. This information is needed when
1372 writing debugging information about vfield and vbase decls for C++. */
1373 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1375 /* Every ..._DECL node gets a unique number. */
1376 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1378 /* For any sort of a ..._DECL node, this points to the original (abstract)
1379 decl node which this decl is an instance of, or else it is NULL indicating
1380 that this decl is not an instance of some other decl. For example,
1381 in a nested declaration of an inline function, this points back to the
1383 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1385 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1386 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1387 #define DECL_ORIGIN(NODE) \
1388 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1390 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1391 inline instance of some original (abstract) decl from an inline function;
1392 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1393 nodes can also have their abstract origin set to themselves. */
1394 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1395 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1397 /* Nonzero if a _DECL means that the name of this decl should be ignored
1398 for symbolic debug purposes. */
1399 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1401 /* Nonzero for a given ..._DECL node means that this node represents an
1402 "abstract instance" of the given declaration (e.g. in the original
1403 declaration of an inline function). When generating symbolic debugging
1404 information, we mustn't try to generate any address information for nodes
1405 marked as "abstract instances" because we don't actually generate
1406 any code or allocate any data space for such instances. */
1407 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1409 /* Nonzero if a _DECL means that no warnings should be generated just
1410 because this decl is unused. */
1411 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1413 /* Nonzero for a given ..._DECL node means that this node should be
1414 put in .common, if possible. If a DECL_INITIAL is given, and it
1415 is not error_mark_node, then the decl cannot be put in .common. */
1416 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1418 /* Language-specific decl information. */
1419 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1421 /* In a VAR_DECL or FUNCTION_DECL,
1422 nonzero means external reference:
1423 do not allocate storage, and refer to a definition elsewhere. */
1424 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1426 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1428 #define DEFAULT_INIT_PRIORITY 65535
1429 #define MAX_INIT_PRIORITY 65535
1430 #define MAX_RESERVED_INIT_PRIORITY 100
1433 nonzero means the detail info about this type is not dumped into stabs.
1434 Instead it will generate cross reference ('x') of names.
1435 This uses the same flag as DECL_EXTERNAL. */
1436 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1437 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1439 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1440 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1441 /* In LABEL_DECL nodes, nonzero means that an error message about
1442 jumping into such a binding contour has been printed for this label. */
1443 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1444 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1445 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1446 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1447 static chain is not needed. */
1448 #define DECL_NO_STATIC_CHAIN(NODE) \
1449 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1451 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1452 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1454 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1456 Also set in some languages for variables, etc., outside the normal
1457 lexical scope, such as class instance variables. */
1458 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1460 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1461 where it is called. */
1462 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1464 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1465 that is not specified by ansi C and that users are supposed to be allowed
1466 to redefine for any purpose whatever. */
1467 #define DECL_BUILT_IN_NONANSI(NODE) \
1468 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1470 /* Nonzero in a FUNCTION_DECL means this function should be treated
1471 as if it were a malloc, meaning it returns a pointer that is
1473 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1475 /* Nonzero in a FUNCTION_DECL means this function should be treated
1476 as "pure" function (like const function, but may read global memory). */
1477 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1479 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1481 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1482 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1483 contour that restored a stack level and which is now exited. */
1484 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1486 /* Unused in FUNCTION_DECL. */
1488 /* In a VAR_DECL that's static,
1489 nonzero if the space is in the text section. */
1490 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1492 /* In a FUNCTION_DECL, nonzero means a built in function. */
1493 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1494 /* For a builtin function, identify which part of the compiler defined it. */
1495 #define DECL_BUILT_IN_CLASS(NODE) \
1496 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1498 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1499 Used in FIELD_DECLs for vtable pointers.
1500 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1501 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1503 /* Used to indicate that the linkage status of this DECL is not yet known,
1504 so it should not be output now. */
1505 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1507 /* Used in PARM_DECLs whose type are unions to indicate that the
1508 argument should be passed in the same way that the first union
1509 alternative would be passed. */
1510 #define DECL_TRANSPARENT_UNION(NODE) \
1511 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1513 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1514 at the beginning or end of execution. */
1515 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1516 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1518 #define DECL_STATIC_DESTRUCTOR(NODE) \
1519 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1521 /* Used to indicate that this DECL represents a compiler-generated entity. */
1522 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1524 /* Used to indicate that this DECL has weak linkage. */
1525 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1527 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1528 multiple translation units should be merged. */
1529 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1531 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1532 not be put out unless it is needed in this translation unit.
1533 Entities like this are shared across translation units (like weak
1534 entities), but are guaranteed to be generated by any translation
1535 unit that needs them, and therefore need not be put out anywhere
1536 where they are not needed. DECL_COMDAT is just a hint to the
1537 back-end; it is up to front-ends which set this flag to ensure
1538 that there will never be any harm, other than bloat, in putting out
1539 something which is DECL_COMDAT. */
1540 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1542 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1543 be instrumented with calls to support routines. */
1544 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1545 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1547 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1548 disabled in this function. */
1549 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) \
1550 (FUNCTION_DECL_CHECK (NODE)->decl.no_check_memory_usage)
1552 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1553 disabled in this function. */
1554 #define DECL_NO_LIMIT_STACK(NODE) \
1555 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1557 /* Additional flags for language-specific uses. */
1558 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1559 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1560 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1561 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1562 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1563 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1564 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1565 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1567 /* Used to indicate that the pointer to this DECL cannot be treated as
1568 an address constant. */
1569 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1571 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1573 #define DECL_NONADDRESSABLE_P(NODE) \
1574 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1576 /* Used to indicate an alias set for the memory pointed to by this
1577 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1578 pointer (or reference) type. */
1579 #define DECL_POINTER_ALIAS_SET(NODE) \
1580 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1582 /* Nonzero if an alias set has been assigned to this declaration. */
1583 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1584 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1586 /* The pointer_depth field comprises two bits for values in the range
1587 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1588 type node, but for functions it migth be greater. For example,
1589 this can happen when the function is declared to accept a parameter
1590 of type void* (depth=1), but is actually called with an argument of
1591 type foo** (depth=2). The function type will get the formal
1592 parameter's depth, but the function decl will get the actual
1593 argument's depth. */
1594 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1598 struct tree_common common
;
1599 const char *filename
;
1602 union tree_node
*size
;
1603 ENUM_BITFIELD(machine_mode
) mode
: 8;
1605 unsigned external_flag
: 1;
1606 unsigned nonlocal_flag
: 1;
1607 unsigned regdecl_flag
: 1;
1608 unsigned inline_flag
: 1;
1609 unsigned bit_field_flag
: 1;
1610 unsigned virtual_flag
: 1;
1611 unsigned ignored_flag
: 1;
1612 unsigned abstract_flag
: 1;
1614 unsigned in_system_header_flag
: 1;
1615 unsigned common_flag
: 1;
1616 unsigned defer_output
: 1;
1617 unsigned transparent_union
: 1;
1618 unsigned static_ctor_flag
: 1;
1619 unsigned static_dtor_flag
: 1;
1620 unsigned artificial_flag
: 1;
1621 unsigned weak_flag
: 1;
1623 unsigned non_addr_const_p
: 1;
1624 unsigned no_instrument_function_entry_exit
: 1;
1625 unsigned no_check_memory_usage
: 1;
1626 unsigned comdat_flag
: 1;
1627 unsigned malloc_flag
: 1;
1628 unsigned no_limit_stack
: 1;
1629 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
1631 unsigned pure_flag
: 1;
1632 unsigned pointer_depth
: 2;
1633 unsigned non_addressable
: 1;
1634 unsigned user_align
: 1;
1635 /* Three unused bits. */
1637 unsigned lang_flag_0
: 1;
1638 unsigned lang_flag_1
: 1;
1639 unsigned lang_flag_2
: 1;
1640 unsigned lang_flag_3
: 1;
1641 unsigned lang_flag_4
: 1;
1642 unsigned lang_flag_5
: 1;
1643 unsigned lang_flag_6
: 1;
1644 unsigned lang_flag_7
: 1;
1646 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1647 If built-in, this is the code for which built-in function.
1648 For other kinds of decls, this is DECL_ALIGN and DECL_OFFSET_ALIGN. */
1651 enum built_in_function f
;
1652 struct {unsigned int align
: 24; unsigned int off_align
: 8;} a
;
1655 union tree_node
*size_unit
;
1656 union tree_node
*name
;
1657 union tree_node
*context
;
1658 union tree_node
*arguments
; /* Also used for DECL_FIELD_OFFSET */
1659 union tree_node
*result
; /* Also used for DECL_BIT_FIELD_TYPE */
1660 union tree_node
*initial
; /* Also used for DECL_QUALIFIER */
1661 union tree_node
*abstract_origin
;
1662 union tree_node
*assembler_name
;
1663 union tree_node
*section_name
;
1664 union tree_node
*machine_attributes
;
1665 struct rtx_def
*rtl
; /* RTL representation for object. */
1666 struct rtx_def
*live_range_rtl
;
1668 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1669 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1670 In PARM_DECL, holds an RTL for the stack slot
1671 of register where the data was actually passed.
1672 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1680 union tree_node
*vindex
;
1681 HOST_WIDE_INT pointer_alias_set
;
1682 /* Points to a structure whose details depend on the language in use. */
1683 struct lang_decl
*lang_specific
;
1686 /* Define the overall contents of a tree node.
1687 It may be any of the structures declared above
1688 for various types of node. */
1692 struct tree_common common
;
1693 struct tree_int_cst int_cst
;
1694 struct tree_real_cst real_cst
;
1695 struct tree_string string
;
1696 struct tree_complex
complex;
1697 struct tree_identifier identifier
;
1698 struct tree_decl decl
;
1699 struct tree_type type
;
1700 struct tree_list list
;
1701 struct tree_vec vec
;
1702 struct tree_exp exp
;
1703 struct tree_block block
;
1706 /* Standard named or nameless data types of the C compiler. */
1725 TI_INTEGER_MINUS_ONE
,
1735 TI_COMPLEX_INTEGER_TYPE
,
1736 TI_COMPLEX_FLOAT_TYPE
,
1737 TI_COMPLEX_DOUBLE_TYPE
,
1738 TI_COMPLEX_LONG_DOUBLE_TYPE
,
1742 TI_LONG_DOUBLE_TYPE
,
1763 extern tree global_trees
[TI_MAX
];
1765 #define error_mark_node global_trees[TI_ERROR_MARK]
1767 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1768 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1769 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1770 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1771 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1773 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1774 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1775 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1776 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1777 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1779 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1780 #define integer_one_node global_trees[TI_INTEGER_ONE]
1781 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
1782 #define size_zero_node global_trees[TI_SIZE_ZERO]
1783 #define size_one_node global_trees[TI_SIZE_ONE]
1784 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1785 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1786 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1788 #define null_pointer_node global_trees[TI_NULL_POINTER]
1790 #define float_type_node global_trees[TI_FLOAT_TYPE]
1791 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1792 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1794 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1795 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1796 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1797 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1799 #define void_type_node global_trees[TI_VOID_TYPE]
1800 /* The C type `void *'. */
1801 #define ptr_type_node global_trees[TI_PTR_TYPE]
1802 /* The C type `const void *'. */
1803 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1804 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1805 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1807 /* The node that should be placed at the end of a parameter list to
1808 indicate that the function does not take a variable number of
1809 arguments. The TREE_VALUE will be void_type_node and there will be
1810 no TREE_CHAIN. Language-independent code should not assume
1811 anything else about this node. */
1812 #define void_list_node global_trees[TI_VOID_LIST_NODE]
1814 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
1815 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
1817 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
1818 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
1819 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
1820 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
1821 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
1823 /* An enumeration of the standard C integer types. These must be
1824 ordered so that shorter types appear before longer ones. */
1825 enum integer_type_kind
1837 itk_unsigned_long_long
,
1841 typedef enum integer_type_kind integer_type_kind
;
1843 /* The standard C integer types. Use integer_type_kind to index into
1845 extern tree integer_types
[itk_none
];
1847 #define char_type_node integer_types[itk_char]
1848 #define signed_char_type_node integer_types[itk_signed_char]
1849 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1850 #define short_integer_type_node integer_types[itk_short]
1851 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1852 #define integer_type_node integer_types[itk_int]
1853 #define unsigned_type_node integer_types[itk_unsigned_int]
1854 #define long_integer_type_node integer_types[itk_long]
1855 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1856 #define long_long_integer_type_node integer_types[itk_long_long]
1857 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1860 #define NULL_TREE (tree) NULL
1862 /* The following functions accept a wide integer argument. Rather than
1863 having to cast on every function call, we use a macro instead, that is
1864 defined here and in rtl.h. */
1867 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1868 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1870 extern int exact_log2_wide
PARAMS ((unsigned HOST_WIDE_INT
));
1871 extern int floor_log2_wide
PARAMS ((unsigned HOST_WIDE_INT
));
1873 /* Approximate positive square root of a host double. This is for
1874 statistical reports, not code generation. */
1875 extern double approx_sqrt
PARAMS ((double));
1877 extern char *permalloc
PARAMS ((int));
1878 extern char *expralloc
PARAMS ((int));
1880 /* Compute the number of bytes occupied by 'node'. This routine only
1881 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
1883 extern size_t tree_size
PARAMS ((tree
));
1885 /* Lowest level primitive for allocating a node.
1886 The TREE_CODE is the only argument. Contents are initialized
1887 to zero except for a few of the common fields. */
1889 extern tree make_node
PARAMS ((enum tree_code
));
1890 extern tree make_lang_type
PARAMS ((enum tree_code
));
1891 extern tree (*make_lang_type_fn
) PARAMS ((enum tree_code
));
1893 /* Make a copy of a node, with all the same contents except
1894 for TREE_PERMANENT. (The copy is permanent
1895 iff nodes being made now are permanent.) */
1897 extern tree copy_node
PARAMS ((tree
));
1899 /* Make a copy of a chain of TREE_LIST nodes. */
1901 extern tree copy_list
PARAMS ((tree
));
1903 /* Make a TREE_VEC. */
1905 extern tree make_tree_vec
PARAMS ((int));
1907 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1908 The name is supplied as a char *. */
1910 extern tree get_identifier
PARAMS ((const char *));
1912 /* If an identifier with the name TEXT (a null-terminated string) has
1913 previously been referred to, return that node; otherwise return
1916 extern tree maybe_get_identifier
PARAMS ((const char *));
1918 /* Construct various types of nodes. */
1920 #define build_int_2(LO,HI) \
1921 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1923 extern tree build
PARAMS ((enum tree_code
, tree
, ...));
1924 extern tree build_nt
PARAMS ((enum tree_code
, ...));
1926 extern tree build_int_2_wide
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
));
1927 extern tree build_real
PARAMS ((tree
, REAL_VALUE_TYPE
));
1928 extern tree build_real_from_int_cst
PARAMS ((tree
, tree
));
1929 extern tree build_complex
PARAMS ((tree
, tree
, tree
));
1930 extern tree build_string
PARAMS ((int, const char *));
1931 extern tree build1
PARAMS ((enum tree_code
, tree
, tree
));
1932 extern tree build_tree_list
PARAMS ((tree
, tree
));
1933 extern tree build_decl
PARAMS ((enum tree_code
, tree
, tree
));
1934 extern tree build_block
PARAMS ((tree
, tree
, tree
, tree
, tree
));
1935 extern tree build_expr_wfl
PARAMS ((tree
, const char *, int, int));
1937 /* Construct various nodes representing data types. */
1939 extern tree make_signed_type
PARAMS ((int));
1940 extern tree make_unsigned_type
PARAMS ((int));
1941 extern void initialize_sizetypes
PARAMS ((void));
1942 extern void set_sizetype
PARAMS ((tree
));
1943 extern tree signed_or_unsigned_type
PARAMS ((int, tree
));
1944 extern void fixup_unsigned_type
PARAMS ((tree
));
1945 extern tree build_pointer_type
PARAMS ((tree
));
1946 extern tree build_reference_type
PARAMS ((tree
));
1947 extern tree build_type_no_quals
PARAMS ((tree
));
1948 extern tree build_index_type
PARAMS ((tree
));
1949 extern tree build_index_2_type
PARAMS ((tree
, tree
));
1950 extern tree build_array_type
PARAMS ((tree
, tree
));
1951 extern tree build_function_type
PARAMS ((tree
, tree
));
1952 extern tree build_method_type
PARAMS ((tree
, tree
));
1953 extern tree build_offset_type
PARAMS ((tree
, tree
));
1954 extern tree build_complex_type
PARAMS ((tree
));
1955 extern tree array_type_nelts
PARAMS ((tree
));
1957 extern tree value_member
PARAMS ((tree
, tree
));
1958 extern tree purpose_member
PARAMS ((tree
, tree
));
1959 extern tree binfo_member
PARAMS ((tree
, tree
));
1960 extern unsigned int attribute_hash_list
PARAMS ((tree
));
1961 extern int attribute_list_equal
PARAMS ((tree
, tree
));
1962 extern int attribute_list_contained
PARAMS ((tree
, tree
));
1963 extern int tree_int_cst_equal
PARAMS ((tree
, tree
));
1964 extern int tree_int_cst_lt
PARAMS ((tree
, tree
));
1965 extern int tree_int_cst_compare
PARAMS ((tree
, tree
));
1966 extern int host_integerp
PARAMS ((tree
, int));
1967 extern HOST_WIDE_INT tree_low_cst
PARAMS ((tree
, int));
1968 extern int tree_int_cst_msb
PARAMS ((tree
));
1969 extern int tree_int_cst_sgn
PARAMS ((tree
));
1970 extern int tree_expr_nonnegative_p
PARAMS ((tree
));
1971 extern int rtl_expr_nonnegative_p
PARAMS ((struct rtx_def
*));
1972 extern int index_type_equal
PARAMS ((tree
, tree
));
1973 extern tree get_inner_array_type
PARAMS ((tree
));
1975 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1976 put the prototype here. Rtl.h does declare the prototype if
1977 tree.h had been included. */
1979 extern tree make_tree
PARAMS ((tree
, struct rtx_def
*));
1981 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1984 Such modified types already made are recorded so that duplicates
1987 extern tree build_type_attribute_variant
PARAMS ((tree
, tree
));
1988 extern tree build_decl_attribute_variant
PARAMS ((tree
, tree
));
1990 extern tree merge_machine_decl_attributes
PARAMS ((tree
, tree
));
1991 extern tree merge_machine_type_attributes
PARAMS ((tree
, tree
));
1993 /* Split a list of declspecs and attributes into two. */
1995 extern void split_specs_attrs
PARAMS ((tree
, tree
*, tree
*));
1997 /* Strip attributes from a list of combined specs and attrs. */
1999 extern tree strip_attrs
PARAMS ((tree
));
2001 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2003 extern int valid_machine_attribute
PARAMS ((tree
, tree
, tree
, tree
));
2005 /* Given a tree node and a string, return non-zero if the tree node is
2006 a valid attribute name for the string. */
2008 extern int is_attribute_p
PARAMS ((const char *, tree
));
2010 /* Given an attribute name and a list of attributes, return the list element
2011 of the attribute or NULL_TREE if not found. */
2013 extern tree lookup_attribute
PARAMS ((const char *, tree
));
2015 /* Given two attributes lists, return a list of their union. */
2017 extern tree merge_attributes
PARAMS ((tree
, tree
));
2019 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
2020 the same kind of data as TYPE describes. Variants point to the
2021 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
2022 and it points to a chain of other variants so that duplicate
2023 variants are never made. Only main variants should ever appear as
2024 types of expressions. */
2026 extern tree build_qualified_type
PARAMS ((tree
, int));
2028 /* Like build_qualified_type, but only deals with the `const' and
2029 `volatile' qualifiers. This interface is retained for backwards
2030 compatiblity with the various front-ends; new code should use
2031 build_qualified_type instead. */
2033 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2034 build_qualified_type (TYPE, \
2035 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2036 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2038 /* Make a copy of a type node. */
2040 extern tree build_type_copy
PARAMS ((tree
));
2042 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2043 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2044 node, does nothing except for the first time. */
2046 extern void layout_type
PARAMS ((tree
));
2048 /* These functions allow a front-end to perform a manual layout of a
2049 RECORD_TYPE. (For instance, if the placement of subsequent fields
2050 depends on the placement of fields so far.) Begin by calling
2051 start_record_layout. Then, call place_field for each of the
2052 fields. Then, call finish_record_layout. See layout_type for the
2053 default way in which these functions are used. */
2055 typedef struct record_layout_info_s
2057 /* The RECORD_TYPE that we are laying out. */
2059 /* The offset into the record so far, in bytes, not including bits in
2062 /* The last known alignment of SIZE. */
2063 unsigned int offset_align
;
2064 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2066 /* The alignment of the record so far, in bits. */
2067 unsigned int record_align
;
2068 /* The alignment of the record so far, not including padding, in bits. */
2069 unsigned int unpacked_align
;
2070 /* The static variables (i.e., class variables, as opposed to
2071 instance variables) encountered in T. */
2072 tree pending_statics
;
2073 int packed_maybe_necessary
;
2074 } *record_layout_info
;
2076 extern record_layout_info start_record_layout
PARAMS ((tree
));
2077 extern tree bit_from_pos
PARAMS ((tree
, tree
));
2078 extern tree byte_from_pos
PARAMS ((tree
, tree
));
2079 extern void pos_from_byte
PARAMS ((tree
*, tree
*, unsigned int,
2081 extern void pos_from_bit
PARAMS ((tree
*, tree
*, unsigned int,
2083 extern void normalize_offset
PARAMS ((tree
*, tree
*,
2085 extern tree rli_size_unit_so_far
PARAMS ((record_layout_info
));
2086 extern tree rli_size_so_far
PARAMS ((record_layout_info
));
2087 extern void normalize_rli
PARAMS ((record_layout_info
));
2088 extern void place_field
PARAMS ((record_layout_info
, tree
));
2089 extern void compute_record_mode
PARAMS ((tree
));
2090 extern void finish_record_layout
PARAMS ((record_layout_info
));
2092 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2093 return a canonicalized ..._TYPE node, so that duplicates are not made.
2094 How the hash code is computed is up to the caller, as long as any two
2095 callers that could hash identical-looking type nodes agree. */
2097 extern tree type_hash_canon
PARAMS ((unsigned int, tree
));
2099 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2100 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2101 fields. Call this only once for any given decl node.
2103 Second argument is the boundary that this field can be assumed to
2104 be starting at (in bits). Zero means it can be assumed aligned
2105 on any boundary that may be needed. */
2107 extern void layout_decl
PARAMS ((tree
, unsigned));
2109 /* Return the mode for data of a given size SIZE and mode class CLASS.
2110 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2111 The value is BLKmode if no other mode is found. This is like
2112 mode_for_size, but is passed a tree. */
2114 extern enum machine_mode mode_for_size_tree
PARAMS ((tree
, enum mode_class
,
2117 /* Return an expr equal to X but certainly not valid as an lvalue. */
2119 extern tree non_lvalue
PARAMS ((tree
));
2120 extern tree pedantic_non_lvalue
PARAMS ((tree
));
2122 extern tree convert
PARAMS ((tree
, tree
));
2123 extern unsigned int expr_align
PARAMS ((tree
));
2124 extern tree size_in_bytes
PARAMS ((tree
));
2125 extern HOST_WIDE_INT int_size_in_bytes
PARAMS ((tree
));
2126 extern tree bit_position
PARAMS ((tree
));
2127 extern HOST_WIDE_INT int_bit_position
PARAMS ((tree
));
2128 extern tree byte_position
PARAMS ((tree
));
2129 extern HOST_WIDE_INT int_byte_position
PARAMS ((tree
));
2131 /* Define data structures, macros, and functions for handling sizes
2132 and the various types used to represent sizes. */
2136 SIZETYPE
, /* Normal representation of sizes in bytes. */
2137 SSIZETYPE
, /* Signed representation of sizes in bytes. */
2138 USIZETYPE
, /* Unsigned representation of sizes in bytes. */
2139 BITSIZETYPE
, /* Normal representation of sizes in bits. */
2140 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
2141 UBITSIZETYPE
, /* Unsifgned representation of sizes in bits. */
2144 extern tree sizetype_tab
[(int) TYPE_KIND_LAST
];
2146 #define sizetype sizetype_tab[(int) SIZETYPE]
2147 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2148 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2149 #define usizetype sizetype_tab[(int) USIZETYPE]
2150 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2151 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2153 extern tree size_binop
PARAMS ((enum tree_code
, tree
, tree
));
2154 extern tree size_diffop
PARAMS ((tree
, tree
));
2155 extern tree size_int_wide
PARAMS ((HOST_WIDE_INT
,
2156 enum size_type_kind
));
2157 extern tree size_int_type_wide
PARAMS ((HOST_WIDE_INT
, tree
));
2159 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2160 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2161 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2162 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2163 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2165 extern tree round_up
PARAMS ((tree
, int));
2166 extern tree round_down
PARAMS ((tree
, int));
2167 extern tree get_pending_sizes
PARAMS ((void));
2168 extern int is_pending_size
PARAMS ((tree
));
2169 extern void put_pending_size
PARAMS ((tree
));
2170 extern void put_pending_sizes
PARAMS ((tree
));
2172 /* Type for sizes of data-type. */
2174 #define BITS_PER_UNIT_LOG \
2175 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2176 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2177 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2179 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2180 extern unsigned int maximum_field_alignment
;
2182 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
2183 extern unsigned int set_alignment
;
2185 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2186 by making the last node in X point to Y.
2187 Returns X, except if X is 0 returns Y. */
2189 extern tree chainon
PARAMS ((tree
, tree
));
2191 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2193 extern tree tree_cons
PARAMS ((tree
, tree
, tree
));
2195 /* Return the last tree node in a chain. */
2197 extern tree tree_last
PARAMS ((tree
));
2199 /* Reverse the order of elements in a chain, and return the new head. */
2201 extern tree nreverse
PARAMS ((tree
));
2203 /* Returns the length of a chain of nodes
2204 (number of chain pointers to follow before reaching a null pointer). */
2206 extern int list_length
PARAMS ((tree
));
2208 /* Returns the number of FIELD_DECLs in a type. */
2210 extern int fields_length
PARAMS ((tree
));
2212 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2214 extern int integer_zerop
PARAMS ((tree
));
2216 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2218 extern int integer_onep
PARAMS ((tree
));
2220 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2221 all of whose significant bits are 1. */
2223 extern int integer_all_onesp
PARAMS ((tree
));
2225 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2226 exactly one bit 1. */
2228 extern int integer_pow2p
PARAMS ((tree
));
2230 /* staticp (tree x) is nonzero if X is a reference to data allocated
2231 at a fixed address in memory. */
2233 extern int staticp
PARAMS ((tree
));
2235 /* Gets an error if argument X is not an lvalue.
2236 Also returns 1 if X is an lvalue, 0 if not. */
2238 extern int lvalue_or_else
PARAMS ((tree
, const char *));
2240 /* save_expr (EXP) returns an expression equivalent to EXP
2241 but it can be used multiple times within context CTX
2242 and only evaluate EXP once. */
2244 extern tree save_expr
PARAMS ((tree
));
2246 /* Returns the index of the first non-tree operand for CODE, or the number
2247 of operands if all are trees. */
2249 extern int first_rtl_op
PARAMS ((enum tree_code
));
2251 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2252 can be used multiple times and will evaluate EXP in its entirety
2255 extern tree unsave_expr
PARAMS ((tree
));
2257 /* Reset EXP in place so that it can be expaned again. Does not
2258 recurse into subtrees. */
2260 extern void unsave_expr_1
PARAMS ((tree
));
2262 /* Like unsave_expr_1, but recurses into all subtrees. */
2264 extern tree unsave_expr_now
PARAMS ((tree
));
2266 /* If non-null, these are language-specific helper functions for
2267 unsave_expr_now. If present, LANG_UNSAVE is called before its
2268 argument (an UNSAVE_EXPR) is to be unsaved, and all other
2269 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
2270 called from unsave_expr_1 for language-specific tree codes. */
2271 extern void (*lang_unsave
) PARAMS ((tree
*));
2272 extern void (*lang_unsave_expr_now
) PARAMS ((tree
));
2274 /* Return 0 if it is safe to evaluate EXPR multiple times,
2275 return 1 if it is safe if EXPR is unsaved afterward, or
2276 return 2 if it is completely unsafe. */
2277 extern int unsafe_for_reeval
PARAMS ((tree
));
2279 /* If non-null, these are language-specific helper functions for
2280 unsafe_for_reeval. Return negative to not handle some tree. */
2281 extern int (*lang_unsafe_for_reeval
) PARAMS ((tree
));
2283 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2284 or offset that depends on a field within a record.
2286 Note that we only allow such expressions within simple arithmetic
2289 extern int contains_placeholder_p
PARAMS ((tree
));
2291 /* Return 1 if EXP contains any expressions that produce cleanups for an
2292 outer scope to deal with. Used by fold. */
2294 extern int has_cleanups
PARAMS ((tree
));
2296 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2297 return a tree with all occurrences of references to F in a
2298 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2299 contains only arithmetic expressions. */
2301 extern tree substitute_in_expr
PARAMS ((tree
, tree
, tree
));
2303 /* variable_size (EXP) is like save_expr (EXP) except that it
2304 is for the special case of something that is part of a
2305 variable size for a data type. It makes special arrangements
2306 to compute the value at the right time when the data type
2307 belongs to a function parameter. */
2309 extern tree variable_size
PARAMS ((tree
));
2311 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2312 but it can be used multiple times
2313 and only evaluate the subexpressions once. */
2315 extern tree stabilize_reference
PARAMS ((tree
));
2317 /* Subroutine of stabilize_reference; this is called for subtrees of
2318 references. Any expression with side-effects must be put in a SAVE_EXPR
2319 to ensure that it is only evaluated once. */
2321 extern tree stabilize_reference_1
PARAMS ((tree
));
2323 /* Return EXP, stripped of any conversions to wider types
2324 in such a way that the result of converting to type FOR_TYPE
2325 is the same as if EXP were converted to FOR_TYPE.
2326 If FOR_TYPE is 0, it signifies EXP's type. */
2328 extern tree get_unwidened
PARAMS ((tree
, tree
));
2330 /* Return OP or a simpler expression for a narrower value
2331 which can be sign-extended or zero-extended to give back OP.
2332 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2333 or 0 if the value should be sign-extended. */
2335 extern tree get_narrower
PARAMS ((tree
, int *));
2337 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2339 The definition of this resides in language-specific code
2340 as the repertoire of available types may vary. */
2342 extern tree type_for_mode
PARAMS ((enum machine_mode
, int));
2344 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2345 for an integer type with at least that precision.
2346 The definition of this resides in language-specific code
2347 as the repertoire of available types may vary. */
2349 extern tree type_for_size
PARAMS ((unsigned, int));
2351 /* Given an integer type T, return a type like T but unsigned.
2352 If T is unsigned, the value is T.
2353 The definition of this resides in language-specific code
2354 as the repertoire of available types may vary. */
2356 extern tree unsigned_type
PARAMS ((tree
));
2358 /* Given an integer type T, return a type like T but signed.
2359 If T is signed, the value is T.
2360 The definition of this resides in language-specific code
2361 as the repertoire of available types may vary. */
2363 extern tree signed_type
PARAMS ((tree
));
2365 /* This function must be defined in the language-specific files.
2366 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2367 This is defined in a language-specific file. */
2369 extern tree maybe_build_cleanup
PARAMS ((tree
));
2371 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2372 look for nested component-refs or array-refs at constant positions
2373 and find the ultimate containing object, which is returned. */
2375 extern tree get_inner_reference
PARAMS ((tree
, HOST_WIDE_INT
*,
2376 HOST_WIDE_INT
*, tree
*,
2377 enum machine_mode
*, int *,
2378 int *, unsigned int *));
2380 /* Given a DECL or TYPE, return the scope in which it was declared, or
2381 NUL_TREE if there is no containing scope. */
2383 extern tree get_containing_scope
PARAMS ((tree
));
2385 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2387 extern tree decl_function_context
PARAMS ((tree
));
2389 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2390 this _DECL with its context, or zero if none. */
2391 extern tree decl_type_context
PARAMS ((tree
));
2393 /* Given the FUNCTION_DECL for the current function,
2394 return zero if it is ok for this function to be inline.
2395 Otherwise return a warning message with a single %s
2396 for the function's name. */
2398 extern const char *function_cannot_inline_p
PARAMS ((tree
));
2400 /* Return 1 if EXPR is the real constant zero. */
2401 extern int real_zerop
PARAMS ((tree
));
2403 /* Declare commonly used variables for tree structure. */
2405 /* Points to the name of the input file from which the current input
2406 being parsed originally came (before it went into cpp). */
2407 extern const char *input_filename
;
2409 /* Current line number in input file. */
2412 /* Nonzero for -pedantic switch: warn about anything
2413 that standard C forbids. */
2414 extern int pedantic
;
2416 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2417 Zero means allow extended lvalues. */
2419 extern int pedantic_lvalues
;
2421 /* Nonzero means can safely call expand_expr now;
2422 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2424 extern int immediate_size_expand
;
2426 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2428 extern tree current_function_decl
;
2430 /* Nonzero means a FUNC_BEGIN label was emitted. */
2431 extern tree current_function_func_begin_label
;
2433 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2435 extern int all_types_permanent
;
2437 /* Pointer to function to compute the name to use to print a declaration.
2438 DECL is the declaration in question.
2439 VERBOSITY determines what information will be printed:
2440 0: DECL_NAME, demangled as necessary.
2441 1: and scope information.
2442 2: and any other information that might be interesting, such as function
2443 parameter types in C++. */
2445 extern const char *(*decl_printable_name
) PARAMS ((tree
, int));
2447 /* Pointer to function to finish handling an incomplete decl at the
2448 end of compilation. */
2450 extern void (*incomplete_decl_finalize_hook
) PARAMS ((tree
));
2452 extern const char *init_parse
PARAMS ((const char *));
2453 extern void finish_parse
PARAMS ((void));
2455 extern const char * const language_string
;
2457 /* Declare a predefined function. Return the declaration. This function is
2458 provided by each language frontend. */
2459 extern tree builtin_function
PARAMS ((const char *, tree
, int,
2460 enum built_in_class
,
2464 extern char *perm_calloc
PARAMS ((int, long));
2465 extern void clean_symbol_name
PARAMS ((char *));
2466 extern tree get_file_function_name_long
PARAMS ((const char *));
2467 extern tree get_set_constructor_bits
PARAMS ((tree
, char *, int));
2468 extern tree get_set_constructor_bytes
PARAMS ((tree
,
2469 unsigned char *, int));
2470 extern tree get_callee_fndecl
PARAMS ((tree
));
2474 extern int in_control_zone_p
PARAMS ((void));
2475 extern void expand_fixups
PARAMS ((struct rtx_def
*));
2476 extern tree expand_start_stmt_expr
PARAMS ((void));
2477 extern tree expand_end_stmt_expr
PARAMS ((tree
));
2478 extern void expand_expr_stmt
PARAMS ((tree
));
2479 extern int warn_if_unused_value
PARAMS ((tree
));
2480 extern void expand_decl_init
PARAMS ((tree
));
2481 extern void clear_last_expr
PARAMS ((void));
2482 extern void expand_label
PARAMS ((tree
));
2483 extern void expand_goto
PARAMS ((tree
));
2484 extern void expand_asm
PARAMS ((tree
));
2485 extern void expand_start_cond
PARAMS ((tree
, int));
2486 extern void expand_end_cond
PARAMS ((void));
2487 extern void expand_start_else
PARAMS ((void));
2488 extern void expand_start_elseif
PARAMS ((tree
));
2489 extern struct nesting
*expand_start_loop
PARAMS ((int));
2490 extern struct nesting
*expand_start_loop_continue_elsewhere
PARAMS ((int));
2491 extern struct nesting
*expand_start_null_loop
PARAMS ((void));
2492 extern void expand_loop_continue_here
PARAMS ((void));
2493 extern void expand_end_loop
PARAMS ((void));
2494 extern void expand_end_null_loop
PARAMS ((void));
2495 extern int expand_continue_loop
PARAMS ((struct nesting
*));
2496 extern int expand_exit_loop
PARAMS ((struct nesting
*));
2497 extern int expand_exit_loop_if_false
PARAMS ((struct nesting
*,
2499 extern int expand_exit_something
PARAMS ((void));
2501 extern void expand_null_return
PARAMS ((void));
2502 extern void expand_return
PARAMS ((tree
));
2503 extern int optimize_tail_recursion
PARAMS ((tree
, struct rtx_def
*));
2504 extern void expand_start_bindings_and_block
PARAMS ((int, tree
));
2505 #define expand_start_bindings(flags) \
2506 expand_start_bindings_and_block(flags, NULL_TREE)
2507 extern void expand_end_bindings
PARAMS ((tree
, int, int));
2508 extern void warn_about_unused_variables
PARAMS ((tree
));
2509 extern void start_cleanup_deferral
PARAMS ((void));
2510 extern void end_cleanup_deferral
PARAMS ((void));
2511 extern int is_body_block
PARAMS ((tree
));
2513 extern void mark_block_as_eh_region
PARAMS ((void));
2514 extern void mark_block_as_not_eh_region
PARAMS ((void));
2515 extern int is_eh_region
PARAMS ((void));
2516 extern int conditional_context
PARAMS ((void));
2517 extern tree last_cleanup_this_contour
PARAMS ((void));
2518 extern int expand_dhc_cleanup
PARAMS ((tree
));
2519 extern int expand_dcc_cleanup
PARAMS ((tree
));
2520 extern void expand_start_case
PARAMS ((int, tree
, tree
,
2522 extern void expand_end_case
PARAMS ((tree
));
2523 extern int add_case_node
PARAMS ((tree
, tree
,
2525 extern int pushcase
PARAMS ((tree
,
2526 tree (*) (tree
, tree
),
2528 extern int pushcase_range
PARAMS ((tree
, tree
,
2529 tree (*) (tree
, tree
),
2531 extern void using_eh_for_cleanups
PARAMS ((void));
2532 extern int stmt_loop_nest_empty
PARAMS ((void));
2534 /* In fold-const.c */
2536 /* Fold constants as much as possible in an expression.
2537 Returns the simplified expression.
2538 Acts only on the top level of the expression;
2539 if the argument itself cannot be simplified, its
2540 subexpressions are not changed. */
2542 extern tree fold
PARAMS ((tree
));
2544 extern int force_fit_type
PARAMS ((tree
, int));
2545 extern int add_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2546 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2547 unsigned HOST_WIDE_INT
*,
2549 extern int neg_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2550 unsigned HOST_WIDE_INT
*,
2552 extern int mul_double
PARAMS ((unsigned HOST_WIDE_INT
,
2554 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2555 unsigned HOST_WIDE_INT
*,
2557 extern void lshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2558 HOST_WIDE_INT
, unsigned int,
2559 unsigned HOST_WIDE_INT
*,
2560 HOST_WIDE_INT
*, int));
2561 extern void rshift_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2562 HOST_WIDE_INT
, unsigned int,
2563 unsigned HOST_WIDE_INT
*,
2564 HOST_WIDE_INT
*, int));
2565 extern void lrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2566 HOST_WIDE_INT
, unsigned int,
2567 unsigned HOST_WIDE_INT
*,
2569 extern void rrotate_double
PARAMS ((unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
2570 HOST_WIDE_INT
, unsigned int,
2571 unsigned HOST_WIDE_INT
*,
2573 extern int operand_equal_p
PARAMS ((tree
, tree
, int));
2574 extern tree invert_truthvalue
PARAMS ((tree
));
2576 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2577 function arguments and return the new type. Return NULL_TREE if no
2578 change. Required by any language that supports variadic arguments. */
2580 extern tree (*lang_type_promotes_to
) PARAMS ((tree
));
2581 extern tree fold_builtin
PARAMS ((tree
));
2583 /* The language front-end must define these functions. */
2585 /* Function of no arguments for initializing lexical scanning. */
2586 extern void init_lex
PARAMS ((void));
2587 /* Function of no arguments for initializing the symbol table. */
2588 extern void init_decl_processing
PARAMS ((void));
2590 /* Function to identify which front-end produced the output file. */
2591 extern const char *lang_identify
PARAMS ((void));
2593 /* Called by report_error_function to print out function name.
2594 * Default may be overridden by language front-ends. */
2595 extern void (*print_error_function
) PARAMS ((const char *));
2597 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2598 extern void copy_lang_decl
PARAMS ((tree
));
2600 /* Function called with no arguments to parse and compile the input. */
2601 extern int yyparse
PARAMS ((void));
2602 /* Functions for processing symbol declarations. */
2603 /* Function to enter a new lexical scope.
2604 Takes one argument: always zero when called from outside the front end. */
2605 extern void pushlevel
PARAMS ((int));
2606 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2607 Takes three arguments:
2608 KEEP -- nonzero if there were declarations in this scope.
2609 REVERSE -- reverse the order of decls before returning them.
2610 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2611 extern tree poplevel
PARAMS ((int, int, int));
2612 /* Set the BLOCK node for the current scope level. */
2613 extern void set_block
PARAMS ((tree
));
2614 /* Function to add a decl to the current scope level.
2615 Takes one argument, a decl to add.
2616 Returns that decl, or, if the same symbol is already declared, may
2617 return a different decl for that name. */
2618 extern tree pushdecl
PARAMS ((tree
));
2619 /* Function to return the chain of decls so far in the current scope level. */
2620 extern tree getdecls
PARAMS ((void));
2621 /* Function to return the chain of structure tags in the current scope level. */
2622 extern tree gettags
PARAMS ((void));
2624 extern tree build_range_type
PARAMS ((tree
, tree
, tree
));
2626 /* Called after finishing a record, union or enumeral type. */
2627 extern void rest_of_type_compilation
PARAMS ((tree
, int));
2630 extern void record_component_aliases
PARAMS ((tree
));
2631 extern HOST_WIDE_INT get_alias_set
PARAMS ((tree
));
2632 extern int alias_sets_conflict_p
PARAMS ((HOST_WIDE_INT
,
2634 extern int readonly_fields_p
PARAMS ((tree
));
2635 extern int objects_must_conflict_p
PARAMS ((tree
, tree
));
2638 extern HOST_WIDE_INT lang_get_alias_set
PARAMS ((tree
));
2643 extern int really_constant_p
PARAMS ((tree
));
2644 extern void set_identifier_size
PARAMS ((int));
2645 extern int int_fits_type_p
PARAMS ((tree
, tree
));
2646 extern int tree_log2
PARAMS ((tree
));
2647 extern int tree_floor_log2
PARAMS ((tree
));
2648 extern void preserve_data
PARAMS ((void));
2649 extern int object_permanent_p
PARAMS ((tree
));
2650 extern int type_precision
PARAMS ((tree
));
2651 extern int simple_cst_equal
PARAMS ((tree
, tree
));
2652 extern int compare_tree_int
PARAMS ((tree
, unsigned int));
2653 extern int type_list_equal
PARAMS ((tree
, tree
));
2654 extern int chain_member
PARAMS ((tree
, tree
));
2655 extern int chain_member_purpose
PARAMS ((tree
, tree
));
2656 extern int chain_member_value
PARAMS ((tree
, tree
));
2657 extern tree listify
PARAMS ((tree
));
2658 extern tree type_hash_lookup
PARAMS ((unsigned int, tree
));
2659 extern void type_hash_add
PARAMS ((unsigned int, tree
));
2660 extern unsigned int type_hash_list
PARAMS ((tree
));
2661 extern int simple_cst_list_equal
PARAMS ((tree
, tree
));
2662 extern void dump_tree_statistics
PARAMS ((void));
2663 extern void print_obstack_statistics
PARAMS ((const char *,
2666 extern void print_obstack_name
PARAMS ((char *, FILE *,
2669 extern void expand_function_end
PARAMS ((const char *, int, int));
2670 extern void expand_function_start
PARAMS ((tree
, int));
2672 extern int real_onep
PARAMS ((tree
));
2673 extern int real_twop
PARAMS ((tree
));
2674 extern void start_identifier_warnings
PARAMS ((void));
2675 extern void gcc_obstack_init
PARAMS ((struct obstack
*));
2676 extern void init_obstacks
PARAMS ((void));
2677 extern void build_common_tree_nodes
PARAMS ((int));
2678 extern void build_common_tree_nodes_2
PARAMS ((int));
2679 extern void mark_tree_hashtable
PARAMS ((void *));
2682 extern void setjmp_protect_args
PARAMS ((void));
2683 extern void setjmp_protect
PARAMS ((tree
));
2684 extern void expand_main_function
PARAMS ((void));
2685 extern void mark_varargs
PARAMS ((void));
2686 extern void init_dummy_function_start
PARAMS ((void));
2687 extern void expand_dummy_function_end
PARAMS ((void));
2688 extern void init_function_for_compilation
PARAMS ((void));
2689 extern void init_function_start
PARAMS ((tree
, const char *, int));
2690 extern void assign_parms
PARAMS ((tree
));
2691 extern void put_var_into_stack
PARAMS ((tree
));
2692 extern void flush_addressof
PARAMS ((tree
));
2693 extern void uninitialized_vars_warning
PARAMS ((tree
));
2694 extern void setjmp_args_warning
PARAMS ((void));
2695 extern void mark_all_temps_used
PARAMS ((void));
2696 extern void init_temp_slots
PARAMS ((void));
2697 extern void combine_temp_slots
PARAMS ((void));
2698 extern void free_temp_slots
PARAMS ((void));
2699 extern void pop_temp_slots
PARAMS ((void));
2700 extern void push_temp_slots
PARAMS ((void));
2701 extern void preserve_temp_slots
PARAMS ((struct rtx_def
*));
2702 extern void preserve_rtl_expr_temps
PARAMS ((tree
));
2703 extern int aggregate_value_p
PARAMS ((tree
));
2704 extern void free_temps_for_rtl_expr
PARAMS ((tree
));
2705 extern void instantiate_virtual_regs
PARAMS ((tree
, struct rtx_def
*));
2706 extern void unshare_all_rtl
PARAMS ((tree
, struct rtx_def
*));
2707 extern int max_parm_reg_num
PARAMS ((void));
2708 extern void push_function_context
PARAMS ((void));
2709 extern void pop_function_context
PARAMS ((void));
2710 extern void push_function_context_to
PARAMS ((tree
));
2711 extern void pop_function_context_from
PARAMS ((tree
));
2713 /* In print-rtl.c */
2715 extern void print_rtl
PARAMS ((FILE *, struct rtx_def
*));
2718 /* In print-tree.c */
2719 extern void debug_tree
PARAMS ((tree
));
2721 extern void print_node
PARAMS ((FILE *, const char *, tree
,
2723 extern void print_node_brief
PARAMS ((FILE *, const char *, tree
,
2725 extern void indent_to
PARAMS ((FILE *, int));
2729 extern void emit_queue
PARAMS ((void));
2730 extern int apply_args_register_offset
PARAMS ((int));
2731 extern struct rtx_def
*expand_builtin_return_addr
2732 PARAMS ((enum built_in_function
, int, struct rtx_def
*));
2733 extern void do_pending_stack_adjust
PARAMS ((void));
2734 extern struct rtx_def
*expand_assignment
PARAMS ((tree
, tree
, int,
2736 extern struct rtx_def
*store_expr
PARAMS ((tree
,
2739 extern void check_max_integer_computation_mode
PARAMS ((tree
));
2742 extern void start_sequence_for_rtl_expr
PARAMS ((tree
));
2743 extern struct rtx_def
*emit_line_note_after
PARAMS ((const char *, int,
2745 extern struct rtx_def
*emit_line_note
PARAMS ((const char *, int));
2746 extern struct rtx_def
*emit_line_note_force
PARAMS ((const char *, int));
2750 extern int setjmp_call_p
PARAMS ((tree
));
2754 extern int mark_addressable
PARAMS ((tree
));
2755 extern void incomplete_type_error
PARAMS ((tree
, tree
));
2756 extern void print_lang_statistics
PARAMS ((void));
2757 extern tree truthvalue_conversion
PARAMS ((tree
));
2758 extern void split_specs_attrs
PARAMS ((tree
, tree
*, tree
*));
2760 extern void print_lang_decl
PARAMS ((FILE *, tree
, int));
2761 extern void print_lang_type
PARAMS ((FILE *, tree
, int));
2762 extern void print_lang_identifier
PARAMS ((FILE *, tree
, int));
2764 extern int global_bindings_p
PARAMS ((void));
2765 extern void insert_block
PARAMS ((tree
));
2767 /* In integrate.c */
2768 extern void save_for_inline
PARAMS ((tree
));
2769 extern void set_decl_abstract_flags
PARAMS ((tree
, int));
2770 extern void output_inline_function
PARAMS ((tree
));
2771 extern void set_decl_origin_self
PARAMS ((tree
));
2774 extern void set_yydebug
PARAMS ((int));
2776 /* In stor-layout.c */
2777 extern void fixup_signed_type
PARAMS ((tree
));
2778 extern void internal_reference_types
PARAMS ((void));
2781 extern void make_decl_rtl
PARAMS ((tree
, const char *));
2782 extern void make_decl_one_only
PARAMS ((tree
));
2783 extern int supports_one_only
PARAMS ((void));
2784 extern void variable_section
PARAMS ((tree
, int));
2786 /* In fold-const.c */
2787 extern int div_and_round_double
PARAMS ((enum tree_code
, int,
2788 unsigned HOST_WIDE_INT
,
2790 unsigned HOST_WIDE_INT
,
2792 unsigned HOST_WIDE_INT
*,
2794 unsigned HOST_WIDE_INT
*,
2798 extern void emit_nop
PARAMS ((void));
2799 extern void expand_computed_goto
PARAMS ((tree
));
2800 extern struct rtx_def
*label_rtx
PARAMS ((tree
));
2801 extern void expand_asm_operands
PARAMS ((tree
, tree
, tree
, tree
, int,
2802 const char *, int));
2803 extern int any_pending_cleanups
PARAMS ((int));
2804 extern void init_stmt
PARAMS ((void));
2805 extern void init_stmt_for_function
PARAMS ((void));
2806 extern int drop_through_at_end_p
PARAMS ((void));
2807 extern void expand_start_target_temps
PARAMS ((void));
2808 extern void expand_end_target_temps
PARAMS ((void));
2809 extern void expand_elseif
PARAMS ((tree
));
2810 extern void save_stack_pointer
PARAMS ((void));
2811 extern void expand_decl
PARAMS ((tree
));
2812 extern int expand_decl_cleanup
PARAMS ((tree
, tree
));
2813 extern void expand_anon_union_decl
PARAMS ((tree
, tree
, tree
));
2814 extern void move_cleanups_up
PARAMS ((void));
2815 extern void expand_start_case_dummy
PARAMS ((void));
2816 extern void expand_end_case_dummy
PARAMS ((void));
2817 extern tree case_index_expr_type
PARAMS ((void));
2818 extern HOST_WIDE_INT all_cases_count
PARAMS ((tree
, int *));
2819 extern void check_for_full_enumeration_handling
PARAMS ((tree
));
2820 extern void declare_nonlocal_label
PARAMS ((tree
));
2822 extern void lang_print_xnode
PARAMS ((FILE *, tree
, int));
2826 /* If KIND=='I', return a suitable global initializer (constructor) name.
2827 If KIND=='D', return a suitable global clean-up (destructor) name. */
2828 extern tree get_file_function_name
PARAMS ((int));
2830 /* Interface of the DWARF2 unwind info support. */
2832 /* Decide whether we want to emit frame unwind information for the current
2833 translation unit. */
2835 extern int dwarf2out_do_frame
PARAMS ((void));
2837 /* Generate a new label for the CFI info to refer to. */
2839 extern char *dwarf2out_cfi_label
PARAMS ((void));
2841 /* Entry point to update the canonical frame address (CFA). */
2843 extern void dwarf2out_def_cfa
PARAMS ((const char *, unsigned, long));
2845 /* Add the CFI for saving a register window. */
2847 extern void dwarf2out_window_save
PARAMS ((const char *));
2849 /* Add a CFI to update the running total of the size of arguments pushed
2852 extern void dwarf2out_args_size
PARAMS ((const char *, long));
2854 /* Entry point for saving a register to the stack. */
2856 extern void dwarf2out_reg_save
PARAMS ((const char *, unsigned, long));
2858 /* Entry point for saving the return address in the stack. */
2860 extern void dwarf2out_return_save
PARAMS ((const char *, long));
2862 /* Entry point for saving the return address in a register. */
2864 extern void dwarf2out_return_reg
PARAMS ((const char *, unsigned));
2866 /* Output a marker (i.e. a label) for the beginning of a function, before
2869 extern void dwarf2out_begin_prologue
PARAMS ((void));
2871 /* Output a marker (i.e. a label) for the absolute end of the generated
2872 code for a function definition. */
2874 extern void dwarf2out_end_epilogue
PARAMS ((void));
2876 /* Redefine abort to report an internal error w/o coredump, and
2877 reporting the location of the error in the source file. This logic
2878 is duplicated in rtl.h and tree.h because every file that needs the
2879 special abort includes one or both. toplev.h gets too few files,
2880 system.h gets too many. */
2882 extern void fancy_abort
PARAMS ((const char *, int, const char *))
2884 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)