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