1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
25 /* Codes of tree nodes */
27 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
32 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
38 /* Number of language-independent tree codes. */
39 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
41 /* Indexed by enum tree_code, contains a character which is
42 `<' for a comparison expression, `1', for a unary arithmetic
43 expression, `2' for a binary arithmetic expression, `e' for
44 other types of expressions, `r' for a reference, `c' for a
45 constant, `d' for a decl, `t' for a type, `s' for a statement,
46 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
48 #define MAX_TREE_CODES 256
49 extern char tree_code_type[MAX_TREE_CODES];
50 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
52 /* Returns non-zero iff CLASS is the tree-code class of an
55 #define IS_EXPR_CODE_CLASS(CLASS) \
56 (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e')
58 /* Number of argument-words in each kind of tree-node. */
60 extern int tree_code_length[MAX_TREE_CODES];
61 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
63 /* Names of tree components. */
65 extern const char *tree_code_name[MAX_TREE_CODES];
67 /* Classify which part of the compiler has defined a given builtin function.
68 Note that we assume below that this is no more than two bits. */
77 /* Names for the above. */
78 extern const char *const built_in_class_names[4];
80 /* Codes that identify the various built in functions
81 so that expand_call can identify them quickly. */
83 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA) ENUM,
84 enum built_in_function
86 #include "builtins.def"
88 /* Upper bound on non-language-specific builtins. */
93 /* Names for the above. */
94 extern const char *const built_in_names[(int) END_BUILTINS];
96 /* An array of _DECL trees for the above. */
97 extern tree built_in_decls[(int) END_BUILTINS];
99 /* The definition of tree nodes fills the next several pages. */
101 /* A tree node can represent a data type, a variable, an expression
102 or a statement. Each node has a TREE_CODE which says what kind of
103 thing it represents. Some common codes are:
104 INTEGER_TYPE -- represents a type of integers.
105 ARRAY_TYPE -- represents a type of pointer.
106 VAR_DECL -- represents a declared variable.
107 INTEGER_CST -- represents a constant integer value.
108 PLUS_EXPR -- represents a sum (an expression).
110 As for the contents of a tree node: there are some fields
111 that all nodes share. Each TREE_CODE has various special-purpose
112 fields as well. The fields of a node are never accessed directly,
113 always through accessor macros. */
115 /* Every kind of tree node starts with this structure,
116 so all nodes have these fields.
118 See the accessor macros, defined below, for documentation of the
126 ENUM_BITFIELD(tree_code) code : 8;
127 unsigned side_effects_flag : 1;
128 unsigned constant_flag : 1;
129 unsigned addressable_flag : 1;
130 unsigned volatile_flag : 1;
131 unsigned readonly_flag : 1;
132 unsigned unsigned_flag : 1;
133 unsigned asm_written_flag: 1;
135 unsigned used_flag : 1;
136 unsigned nothrow_flag : 1;
137 unsigned static_flag : 1;
138 unsigned public_flag : 1;
139 unsigned private_flag : 1;
140 unsigned protected_flag : 1;
141 unsigned bounded_flag : 1;
143 unsigned lang_flag_0 : 1;
144 unsigned lang_flag_1 : 1;
145 unsigned lang_flag_2 : 1;
146 unsigned lang_flag_3 : 1;
147 unsigned lang_flag_4 : 1;
148 unsigned lang_flag_5 : 1;
149 unsigned lang_flag_6 : 1;
150 /* This flag is presently unused. However, language front-ends
151 should not make use of this flag; it is reserved for future
156 /* The following table lists the uses of each of the above flags and
157 for which types of nodes they are defined. Note that expressions
163 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
164 ..._TYPE, IDENTIFIER_NODE
169 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
170 TREE_NO_UNUSED_WARNING in
171 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
173 TREE_LIST or TREE_VEC
174 TREE_CONSTANT_OVERFLOW in
175 INTEGER_CST, REAL_CST, COMPLEX_CST
176 TREE_SYMBOL_REFERENCED in
182 INTEGER_CST, REAL_CST, COMPLEX_CST
184 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
186 TREE_LIST or TREE_VEC
187 EXPR_WFL_EMIT_LINE_NOTE in
188 EXPR_WITH_FILE_LOCATION
193 TREE_LIST or TREE_VEC
195 ??? unspecified nodes
199 TREE_VIA_PROTECTED in
204 ??? unspecified nodes
213 TREE_THIS_VOLATILE in
233 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
234 DECL_BUILT_IN_NONANSI in
236 SAVE_EXPR_NOPLACEHOLDER in
242 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
248 expressions, IDENTIFIER_NODE
253 CALL_EXPR, FUNCTION_DECL
258 expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL,
264 /* Define accessors for the fields that all tree nodes have
265 (though some fields are not used for all kinds of nodes). */
267 /* The tree-code says what kind of node it is.
268 Codes are defined in tree.def. */
269 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
270 #define TREE_SET_CODE(NODE, VALUE) \
271 ((NODE)->common.code = (ENUM_BITFIELD(tree_code)) (VALUE))
273 /* When checking is enabled, errors will be generated if a tree node
274 is accessed incorrectly. The macros abort with a fatal error. */
275 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
277 #define TREE_CHECK(t, code) __extension__ \
278 ({ const tree __t = t; \
279 if (TREE_CODE(__t) != (code)) \
280 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
282 #define TREE_CLASS_CHECK(t, class) __extension__ \
283 ({ const tree __t = t; \
284 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
285 tree_class_check_failed (__t, class, __FILE__, __LINE__, __FUNCTION__); \
288 /* These checks have to be special cased. */
289 #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
290 ({ const tree __t = t; \
291 enum tree_code __c = TREE_CODE(__t); \
292 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
293 tree_check_failed (__t, CONSTRUCTOR, __FILE__, __LINE__, __FUNCTION__); \
295 #define EXPR_CHECK(t) __extension__ \
296 ({ const tree __t = t; \
297 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
298 if (__c != 'r' && __c != 's' && __c != '<' \
299 && __c != '1' && __c != '2' && __c != 'e') \
300 tree_class_check_failed(__t, 'e', __FILE__, __LINE__, __FUNCTION__); \
303 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
304 const char *, int, const char *))
306 extern void tree_class_check_failed PARAMS ((const tree, int,
307 const char *, int, const char *))
310 #else /* not ENABLE_TREE_CHECKING, or not gcc */
312 #define TREE_CHECK(t, code) (t)
313 #define TREE_CLASS_CHECK(t, code) (t)
314 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
315 #define EXPR_CHECK(t) (t)
319 #include "tree-check.h"
321 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
322 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
323 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
325 /* In all nodes that are expressions, this is the data type of the expression.
326 In POINTER_TYPE nodes, this is the type that the pointer points to.
327 In ARRAY_TYPE nodes, this is the type of the elements.
328 In VECTOR_TYPE nodes, this is the type of the elements. */
329 #define TREE_TYPE(NODE) ((NODE)->common.type)
331 /* Here is how primitive or already-canonicalized types' hash codes
333 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777)
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
451 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
452 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
454 /* Nonzero if this type is a complete type. */
455 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
457 /* Nonzero if this type is the (possibly qualified) void type. */
458 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
460 /* Nonzero if this type is complete or is cv void. */
461 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
462 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
464 /* Nonzero if this type is complete or is an array with unspecified bound. */
465 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
466 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE))
468 /* Nonzero if TYPE represents a type. */
470 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
472 /* Define many boolean fields that all tree nodes have. */
474 /* In VAR_DECL nodes, nonzero means address of this is needed.
475 So it cannot be in a register.
476 In a FUNCTION_DECL, nonzero means its address is needed.
477 So it must be compiled even if it is an inline function.
478 In a FIELD_DECL node, it means that the programmer is permitted to
479 construct the address of this field. This is used for aliasing
480 purposes: see record_component_aliases.
481 In CONSTRUCTOR nodes, it means object constructed must be in memory.
482 In LABEL_DECL nodes, it means a goto for this label has been seen
483 from a place outside all binding contours that restore stack levels.
484 In ..._TYPE nodes, it means that objects of this type must
485 be fully addressable. This means that pieces of this
486 object cannot go into register parameters, for example.
487 In IDENTIFIER_NODEs, this means that some extern decl for this name
488 had its address taken. That matters for inline functions. */
489 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
491 /* In a VAR_DECL, nonzero means allocate static storage.
492 In a FUNCTION_DECL, nonzero if function has been defined.
493 In a CONSTRUCTOR, nonzero means allocate static storage. */
494 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
496 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
497 made implicitly and should not lead to an "unused value" warning. */
498 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
500 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
501 chain is via a `virtual' declaration. */
502 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
504 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
505 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
506 requires a diagnostic when overflows occur in constant expressions. */
507 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
509 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
510 this string as an argument. */
511 #define TREE_SYMBOL_REFERENCED(NODE) \
512 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
514 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
515 overflow in folding, and no warning has been issued for this subexpression.
516 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
517 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
519 /* In a VAR_DECL or FUNCTION_DECL,
520 nonzero means name is to be accessible from outside this module.
521 In an IDENTIFIER_NODE, nonzero means an external declaration
522 accessible from outside this module was previously seen
523 for this name in an inner scope. */
524 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
526 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
527 base class is via a `public' declaration, which preserves public
528 fields from the base class as public. */
529 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
531 /* Ditto, for `private' declarations. */
532 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
534 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
535 base class is via a `protected' declaration, which preserves
536 protected fields from the base class as protected.
538 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
540 /* In any expression, nonzero means it has side effects or reevaluation
541 of the whole expression could produce a different value.
542 This is set if any subexpression is a function call, a side effect
543 or a reference to a volatile variable.
544 In a ..._DECL, this is set only if the declaration said `volatile'. */
545 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
547 /* Nonzero means this expression is volatile in the C sense:
548 its address should be of type `volatile WHATEVER *'.
549 In other words, the declared item is volatile qualified.
550 This is used in _DECL nodes and _REF nodes.
552 In a ..._TYPE node, means this type is volatile-qualified.
553 But use TYPE_VOLATILE instead of this macro when the node is a type,
554 because eventually we may make that a different bit.
556 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
557 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
559 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
560 nonzero means it may not be the lhs of an assignment.
561 In a ..._TYPE node, means this type is const-qualified
562 (but the macro TYPE_READONLY should be used instead of this macro
563 when the node is a type). */
564 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
566 /* Non-zero if NODE is a _DECL with TREE_READONLY set. */
567 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE))
569 /* Value of expression is constant.
570 Always appears in all ..._CST nodes.
571 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
572 if the value is constant. */
573 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
575 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
576 In FIELD_DECL nodes, means an unsigned bit field.
577 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
578 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
580 #define TYPE_TRAP_SIGNED(NODE) \
581 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE)))
583 /* Nonzero in a VAR_DECL means assembler code has been written.
584 Nonzero in a FUNCTION_DECL means that the function has been compiled.
585 This is interesting in an inline function, since it might not need
586 to be compiled separately.
587 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
588 if the sdb debugging info for the type has been written.
589 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
590 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
592 /* Nonzero in a _DECL if the name is used in its scope.
593 Nonzero in an expr node means inhibit warning if value is unused.
594 In IDENTIFIER_NODEs, this means that some extern decl for this name
596 #define TREE_USED(NODE) ((NODE)->common.used_flag)
598 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
599 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
600 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
602 /* In a type, nonzero means that all objects of the type are guaranteed by the
603 language or front-end to be properly aligned, so we can indicate that a MEM
604 of this type is aligned at least to the alignment of the type, even if it
605 doesn't appear that it is. We see this, for example, in object-oriented
606 languages where a tag field may show this is an object of a more-aligned
607 variant of the more generic type. */
608 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
610 /* Used in classes in C++. */
611 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
612 /* Used in classes in C++.
613 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
614 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
616 /* In a ..._TYPE node, nonzero means that the type's size and layout,
617 (or the size and layout of its arguments and/or return value in the
618 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
619 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
620 node is a type, because eventually we may make that a different
621 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
622 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
623 BOUNDED_INDIRECT_TYPE_P to test for that.
625 In a FUNCTION_DECL, nonzero means that the size and layout of one
626 of its arguments and/or return value was changed by the presence of
627 pointer bounds. This value can differ from the value of
628 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
629 declared, then later called with pointer args, or was declared with
630 a variable argument list and is later called with pointer values in
631 the variable argument list.
633 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
634 of the decl's type's BOUNDED_POINTER_TYPE_P.
636 In a CONSTRUCTOR or other expression, nonzero means the value is a
637 bounded pointer. It is insufficient to determine the boundedness
638 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
639 since we allow pointer to be temporarily cast to integer for
640 rounding up to an alignment boudary in a way that preserves the
643 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
644 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
645 of a function that has bounded pointer(s) for its return type and/or
648 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
650 /* These flags are available for each language front end to use internally. */
651 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
652 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
653 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
654 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
655 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
656 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
657 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
659 /* Define additional fields and accessors for nodes representing constants. */
661 /* In an INTEGER_CST node. These two together make a 2-word integer.
662 If the data type is signed, the value is sign-extended to 2 words
663 even though not all of them may really be in use.
664 In an unsigned constant shorter than 2 words, the extra bits are 0. */
665 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
666 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
667 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
669 #define INT_CST_LT(A, B) \
670 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
671 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
672 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
674 #define INT_CST_LT_UNSIGNED(A, B) \
675 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
676 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
677 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
678 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
679 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
683 struct tree_common common;
684 rtx rtl; /* acts as link to register transfer language
686 /* A sub-struct is necessary here because the function `const_hash'
687 wants to scan both words as a unit and taking the address of the
688 sub-struct yields the properly inclusive bounded pointer. */
690 unsigned HOST_WIDE_INT low;
695 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
696 and generally in all kinds of constants that could
697 be given labels (rather than being immediate). */
699 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
701 /* In a REAL_CST node.
703 We can represent a real value as either a `double' or an array of
706 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
712 struct tree_common common;
713 rtx rtl; /* acts as link to register transfer language
715 REAL_VALUE_TYPE real_cst;
718 /* In a STRING_CST */
719 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
720 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
724 struct tree_common common;
725 rtx rtl; /* acts as link to register transfer language
731 /* In a COMPLEX_CST node. */
732 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
733 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
737 struct tree_common common;
738 rtx rtl; /* acts as link to register transfer language
744 #include "hashtable.h"
746 /* Define fields and accessors for some special-purpose tree nodes. */
748 #define IDENTIFIER_LENGTH(NODE) \
749 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
750 #define IDENTIFIER_POINTER(NODE) \
751 ((char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
753 /* Translate a hash table identifier pointer to a tree_identifier
754 pointer, and vice versa. */
756 #define HT_IDENT_TO_GCC_IDENT(NODE) \
757 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
758 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
760 struct tree_identifier
762 struct tree_common common;
763 struct ht_identifier id;
766 /* In a TREE_LIST node. */
767 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
768 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
772 struct tree_common common;
777 /* In a TREE_VEC node. */
778 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
779 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
780 #define TREE_VEC_END(NODE) \
781 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
785 struct tree_common common;
790 /* Define fields and accessors for some nodes that represent expressions. */
792 /* In a SAVE_EXPR node. */
793 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(SAVE_EXPR_CHECK (NODE), 1)
794 #define SAVE_EXPR_RTL(NODE) (*(rtx *) &SAVE_EXPR_CHECK (NODE)->exp.operands[2])
795 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE))
796 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
797 both in normal code and in a handler. (Normally, in a handler, all
798 SAVE_EXPRs are unsaved, meaning that there values are
800 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
802 /* In a RTL_EXPR node. */
803 #define RTL_EXPR_SEQUENCE(NODE) \
804 (*(rtx *) &RTL_EXPR_CHECK (NODE)->exp.operands[0])
805 #define RTL_EXPR_RTL(NODE) (*(rtx *) &RTL_EXPR_CHECK (NODE)->exp.operands[1])
807 /* In a WITH_CLEANUP_EXPR node. */
808 #define WITH_CLEANUP_EXPR_RTL(NODE) \
809 (*(rtx *) &WITH_CLEANUP_EXPR_CHECK (NODE)->exp.operands[2])
811 /* In a CONSTRUCTOR node. */
812 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (CONSTRUCTOR_CHECK (NODE), 1)
814 /* In ordinary expression nodes. */
815 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
816 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
818 /* In a LABELED_BLOCK_EXPR node. */
819 #define LABELED_BLOCK_LABEL(NODE) \
820 TREE_OPERAND (LABELED_BLOCK_EXPR_CHECK (NODE), 0)
821 #define LABELED_BLOCK_BODY(NODE) \
822 TREE_OPERAND (LABELED_BLOCK_EXPR_CHECK (NODE), 1)
824 /* In a EXIT_BLOCK_EXPR node. */
825 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
826 TREE_OPERAND (EXIT_BLOCK_EXPR_CHECK (NODE), 0)
827 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (EXIT_BLOCK_EXPR_CHECK (NODE), 1)
829 /* In a LOOP_EXPR node. */
830 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (LOOP_EXPR_CHECK (NODE), 0)
832 /* In a EXPR_WITH_FILE_LOCATION node. */
833 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
834 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
835 #define EXPR_WFL_NODE(NODE) \
836 TREE_OPERAND (EXPR_WITH_FILE_LOCATION_CHECK (NODE), 0)
837 #define EXPR_WFL_FILENAME_NODE(NODE) \
838 TREE_OPERAND(EXPR_WITH_FILE_LOCATION_CHECK (NODE), 1)
839 #define EXPR_WFL_FILENAME(NODE) \
840 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE)))
841 /* ??? Java uses this in all expressions. */
842 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
843 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
844 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
845 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
846 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
850 struct tree_common common;
855 /* In a BLOCK node. */
856 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
857 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
858 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
859 /* Note: when changing this, make sure to find the places
860 that use chainon or nreverse. */
861 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
862 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
863 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
865 /* Nonzero means that this block is prepared to handle exceptions
866 listed in the BLOCK_VARS slot. */
867 #define BLOCK_HANDLER_BLOCK(NODE) \
868 (BLOCK_CHECK (NODE)->block.handler_block_flag)
870 /* An index number for this block. These values are not guaranteed to
871 be unique across functions -- whether or not they are depends on
872 the debugging output format in use. */
873 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
875 /* If block reordering splits a lexical block into discontiguous
876 address ranges, we'll make a copy of the original block.
878 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
879 In that case, we have one source block that has been replicated
880 (through inlining or unrolling) into many logical blocks, and that
881 these logical blocks have different physical variables in them.
883 In this case, we have one logical block split into several
884 non-contiguous address ranges. Most debug formats can't actually
885 represent this idea directly, so we fake it by creating multiple
886 logical blocks with the same variables in them. However, for those
887 that do support non-contiguous regions, these allow the original
888 logical block to be reconstructed, along with the set of address
891 One of the logical block fragments is arbitrarily chosen to be
892 the ORIGIN. The other fragments will point to the origin via
893 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
894 be null. The list of fragments will be chained through
895 BLOCK_FRAGMENT_CHAIN from the origin. */
897 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
898 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
902 struct tree_common common;
904 unsigned handler_block_flag : 1;
905 unsigned abstract_flag : 1;
906 unsigned block_num : 30;
911 tree abstract_origin;
912 tree fragment_origin;
916 /* Define fields and accessors for nodes representing data types. */
918 /* See tree.def for documentation of the use of these fields.
919 Look at the documentation of the various ..._TYPE tree codes. */
921 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
922 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
923 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
924 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
925 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
926 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
927 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
928 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
929 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
930 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
931 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
932 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
933 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
934 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
935 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
936 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
937 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
938 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
939 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
940 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
941 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
942 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
943 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
944 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
946 /* For a VECTOR_TYPE node, this describes a different type which is emitted
947 in the debugging output. We use this to describe a vector as a
948 structure containing an array. */
949 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
951 /* Indirect types present difficulties because they may be represented
952 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
953 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
954 be logically equivalent, but physically different. Simple
955 comparison of the main variant only tells if the types are
956 logically equivalent. Use this predicate to compare for physical
959 /* Types have the same main variant, and have the same boundedness. */
960 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
961 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
962 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
964 /* Return the type variant that has no qualifiers (i.e., the main variant),
965 except that the boundedness qualifier is preserved. */
966 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
967 (BOUNDED_POINTER_TYPE_P (TYPE) \
968 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
969 : TYPE_MAIN_VARIANT (TYPE))
971 /* For aggregate types, information about this type, as a base type
972 for itself. Used in a language-dependent way for types that are
973 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
974 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
976 /* The (language-specific) typed-based alias set for this type.
977 Objects whose TYPE_ALIAS_SETs are different cannot alias each
978 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
979 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
980 type can alias objects of any type. */
981 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
983 /* Nonzero iff the typed-based alias set for this type has been
985 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
987 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
989 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
991 /* The alignment necessary for objects of this type.
992 The value is an int, measured in bits. */
993 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
995 /* 1 if the alignment for this type was requested by "aligned" attribute,
996 0 if it is the default for this type. */
997 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
999 /* The alignment for NODE, in bytes. */
1000 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1002 /* If your language allows you to declare types, and you want debug info
1003 for them, then you need to generate corresponding TYPE_DECL nodes.
1004 These "stub" TYPE_DECL nodes have no name, and simply point at the
1005 type node. You then set the TYPE_STUB_DECL field of the type node
1006 to point back at the TYPE_DECL node. This allows the debug routines
1007 to know that the two nodes represent the same type, so that we only
1008 get one debug info record for them. */
1009 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1011 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1012 has BLKmode only because it lacks the alignment requirement for
1014 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1016 /* In an INTEGER_TYPE, it means the type represents a size. We use
1017 this both for validity checking and to permit optimizations that
1018 are unsafe for other types. Note that the C `size_t' type should
1019 *not* have this flag set. The `size_t' type is simply a typedef
1020 for an ordinary integer type that happens to be the type of an
1021 expression returned by `sizeof'; `size_t' has no special
1022 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1023 always actual sizes. */
1024 #define TYPE_IS_SIZETYPE(NODE) \
1025 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1027 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1028 pointer depressed. */
1029 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1030 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1032 /* Nonzero in a type considered volatile as a whole. */
1033 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1035 /* Means this type is const-qualified. */
1036 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1038 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1040 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1042 /* If nonzero, this type's size and layout, (or the size and layout of
1043 its arguments and/or return value in the case of a FUNCTION_TYPE or
1044 METHOD_TYPE) was changed by the presence of pointer bounds. */
1045 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
1047 /* There is a TYPE_QUAL value for each type qualifier. They can be
1048 combined by bitwise-or to form the complete set of qualifiers for a
1051 #define TYPE_UNQUALIFIED 0x0
1052 #define TYPE_QUAL_CONST 0x1
1053 #define TYPE_QUAL_VOLATILE 0x2
1054 #define TYPE_QUAL_RESTRICT 0x4
1055 #define TYPE_QUAL_BOUNDED 0x8
1057 /* The set of type qualifiers for this type. */
1058 #define TYPE_QUALS(NODE) \
1059 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1060 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1061 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1062 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1064 /* The set of qualifiers pertinent to an expression node. */
1065 #define TREE_EXPR_QUALS(NODE) \
1066 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1067 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1068 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1070 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1071 #define TREE_FUNC_QUALS(NODE) \
1072 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1073 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1075 /* These flags are available for each language front end to use internally. */
1076 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1077 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1078 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1079 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1080 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1081 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1082 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1084 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1085 that distinguish string from array of char).
1086 If set in a SET_TYPE, indicates a bitstring type. */
1087 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1089 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1090 object of the given ARRAY_TYPE. This allows temporaries to be
1092 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1093 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE))
1095 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1096 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1097 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1099 /* Indicates that objects of this type must be initialized by calling a
1100 function when they are created. */
1101 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1102 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1104 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1105 the same way that the first union alternative would be passed. */
1106 #define TYPE_TRANSPARENT_UNION(NODE) \
1107 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1109 /* For an ARRAY_TYPE, indicates that it is not permitted to
1110 take the address of a component of the type. */
1111 #define TYPE_NONALIASED_COMPONENT(NODE) \
1112 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1114 /* Indicated that objects of this type should be laid out in as
1115 compact a way as possible. */
1116 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1118 /* A bounded pointer or bounded reference type (collectively called
1119 indirect types) is represented as a RECORD_TYPE node containing
1120 three pointer fields whose type is the corresponding unbounded
1121 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1122 a bounded indirect type differs from a normal RECORD_TYPE node in
1123 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1124 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1125 nodes are stored on the same type variant chain alongside the
1126 variants of the underlaying indirect types nodes. The main variant
1127 of such chains is always the unbounded type. */
1129 /* Access the field decls of a bounded-pointer type. */
1130 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1131 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1132 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1134 /* Access the simple-pointer subtype of a bounded-pointer type. */
1135 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1137 /* Find the unbounded counterpart to a type, or return TYPE if it is
1138 already unbounded. */
1139 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1140 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1142 /* This field comprises two bits, for values in the range 0..3:
1144 depth=0 means that type is a scalar, or an aggregate that contains
1145 only depth=0 types, or a function that has only depth=0 types for
1146 its return value and argument types.
1148 depth=1 means that type is a pointer to a depth=0 type, or an
1149 aggregate that contains only depth=0 and depth=1 types, or a
1150 function that has only depth=0 and depth=1 types for its return
1151 value and argument types.
1153 The meanings of depth=2 and depth=3 are obvious by induction.
1154 Varargs functions are depth=3. The type `va_list' is depth=3.
1156 The purpose of measuring pointer depth of a type is to determine
1157 the eligibility of a function for an automatically-generated
1158 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1159 depth=1 function is eligible for an automatic thunk. Functions
1160 with depth 2 or more are too complex to get automatic thunks.
1162 Function decls also have a pointer_depth field, since we also
1163 consider the actual argument types for functions. */
1165 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1167 /* In a FUNCTION_TYPE node, this bit stores the value of
1168 default_pointer_boundedness at the time TYPE was created. It is
1169 useful for choosing default boundedness of function arguments for
1170 non-prototype function decls and for varargs/stdarg lists. */
1171 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1172 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1174 #define MAX_POINTER_DEPTH 2
1175 #define VA_LIST_POINTER_DEPTH 3
1179 struct tree_common common;
1186 unsigned int precision : 9;
1187 ENUM_BITFIELD(machine_mode) mode : 7;
1189 unsigned string_flag : 1;
1190 unsigned no_force_blk_flag : 1;
1191 unsigned needs_constructing_flag : 1;
1192 unsigned transparent_union_flag : 1;
1193 unsigned packed_flag : 1;
1194 unsigned restrict_flag : 1;
1195 unsigned pointer_depth : 2;
1197 unsigned lang_flag_0 : 1;
1198 unsigned lang_flag_1 : 1;
1199 unsigned lang_flag_2 : 1;
1200 unsigned lang_flag_3 : 1;
1201 unsigned lang_flag_4 : 1;
1202 unsigned lang_flag_5 : 1;
1203 unsigned lang_flag_6 : 1;
1204 unsigned user_align : 1;
1209 union {int address; char *pointer; } symtab;
1217 HOST_WIDE_INT alias_set;
1218 /* Points to a structure whose details depend on the language in use. */
1219 struct lang_type *lang_specific;
1222 /* Define accessor macros for information about type inheritance
1225 A "basetype" means a particular usage of a data type for inheritance
1226 in another type. Each such basetype usage has its own "binfo"
1227 object to describe it. The binfo object is a TREE_VEC node.
1229 Inheritance is represented by the binfo nodes allocated for a
1230 given type. For example, given types C and D, such that D is
1231 inherited by C, 3 binfo nodes will be allocated: one for describing
1232 the binfo properties of C, similarly one for D, and one for
1233 describing the binfo properties of D as a base type for C.
1234 Thus, given a pointer to class C, one can get a pointer to the binfo
1235 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1237 /* The actual data type node being inherited in this basetype. */
1238 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1240 /* The offset where this basetype appears in its containing type.
1241 BINFO_OFFSET slot holds the offset (in bytes)
1242 from the base of the complete object to the base of the part of the
1243 object that is allocated on behalf of this `type'.
1244 This is always 0 except when there is multiple inheritance. */
1246 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1247 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1248 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1250 /* The virtual function table belonging to this basetype. Virtual
1251 function tables provide a mechanism for run-time method dispatching.
1252 The entries of a virtual function table are language-dependent. */
1254 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1255 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1257 /* The virtual functions in the virtual function table. This is
1258 a TREE_LIST that is used as an initial approximation for building
1259 a virtual function table for this basetype. */
1260 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1261 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1263 /* A vector of binfos for the direct basetypes inherited by this
1266 If this basetype describes type D as inherited in C, and if the
1267 basetypes of D are E and F, then this vector contains binfos for
1268 inheritance of E and F by C.
1270 ??? This could probably be done by just allocating the
1271 base types at the end of this TREE_VEC (instead of using
1272 another TREE_VEC). This would simplify the calculation
1273 of how many basetypes a given type had. */
1274 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1275 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1277 /* The number of basetypes for NODE. */
1278 #define BINFO_N_BASETYPES(NODE) \
1279 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1281 /* Accessor macro to get to the Nth basetype of this basetype. */
1282 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1283 #define TYPE_BINFO_BASETYPE(NODE,N) \
1284 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1286 /* For a BINFO record describing a virtual base class, i.e., one where
1287 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1288 base. The actual contents are language-dependent. Under the old
1289 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1290 pointer to the virtual base; under the new ABI this field is
1291 instead a INTEGER_CST giving an offset into the vtable where the
1292 offset to the virtual base can be found. */
1293 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1295 /* The size of a base class subobject of this type. Not all frontends
1296 currently allocate the space for these fields. */
1297 #define BINFO_SIZE(NODE) TREE_VEC_ELT (NODE, 6)
1298 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT (NODE, 7)
1299 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1300 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1302 /* Slot used to build a chain that represents a use of inheritance.
1303 For example, if X is derived from Y, and Y is derived from Z,
1304 then this field can be used to link the binfo node for X to
1305 the binfo node for X's Y to represent the use of inheritance
1306 from X to Y. Similarly, this slot of the binfo node for X's Y
1307 can point to the Z from which Y is inherited (in X's inheritance
1308 hierarchy). In this fashion, one can represent and traverse specific
1309 uses of inheritance using the binfo nodes themselves (instead of
1310 consing new space pointing to binfo nodes).
1311 It is up to the language-dependent front-ends to maintain
1312 this information as necessary. */
1313 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1315 /* Define fields and accessors for nodes representing declared names. */
1317 /* Nonzero if DECL represents a decl. */
1318 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1320 /* This is the name of the object as written by the user.
1321 It is an IDENTIFIER_NODE. */
1322 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1324 /* The name of the object as the assembler will see it (but before any
1325 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1326 as DECL_NAME. It is an IDENTIFIER_NODE. */
1327 #define DECL_ASSEMBLER_NAME(NODE) \
1328 ((DECL_ASSEMBLER_NAME_SET_P (NODE) \
1330 : (*lang_set_decl_assembler_name) (NODE)), \
1331 DECL_CHECK (NODE)->decl.assembler_name)
1333 /* Returns non-zero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1334 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1336 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1337 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1339 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1340 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1341 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1343 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1344 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1345 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1346 semantics of using this macro, are different than saying:
1348 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1350 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1352 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1353 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1354 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1355 DECL_ASSEMBLER_NAME (DECL1)) \
1358 /* Records the section name in a section attribute. Used to pass
1359 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1360 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1362 /* For FIELD_DECLs, this is the
1363 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1364 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1365 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1366 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1367 type, or NULL_TREE if the given decl has "file scope". */
1368 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1369 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1370 /* In a DECL this is the field where attributes are stored. */
1371 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1372 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1373 byte containing the bit closest to the beginning of the structure. */
1374 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1375 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1376 field from DECL_FIELD_OFFSET. */
1377 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1378 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1379 if so, the type that was originally specified for it.
1380 TREE_TYPE may have been modified (in finish_struct). */
1381 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1382 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1383 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1385 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1386 /* This field is used to reference anything in decl.result and is meant only
1387 for use by the garbage collector. */
1388 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1389 /* In FUNCTION_DECL, holds the decl for the return value. */
1390 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1391 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1392 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1393 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1394 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1395 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1396 For a VAR_DECL, holds the initial value.
1397 For a PARM_DECL, not used--default
1398 values for parameters are encoded in the type of the function,
1399 not in the PARM_DECL slot. */
1400 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1401 /* For a PARM_DECL, records the data type used to pass the argument,
1402 which may be different from the type seen in the program. */
1403 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1404 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1405 if nonzero, indicates that the field occupies the type. */
1406 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1407 /* These two fields describe where in the source code the declaration
1408 was. If the declaration appears in several places (as for a C
1409 function that is declared first and then defined later), this
1410 information should refer to the definition. */
1411 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1412 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1413 /* Holds the size of the datum, in bits, as a tree expression.
1414 Need not be constant. */
1415 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1416 /* Likewise for the size in bytes. */
1417 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1418 /* Holds the alignment required for the datum, in bits. */
1419 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1420 /* The alignment of NODE, in bytes. */
1421 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1422 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1423 DECL_FIELD_OFFSET which are known to be always zero.
1424 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1426 #define DECL_OFFSET_ALIGN(NODE) \
1427 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1428 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1429 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1430 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1431 /* 1 if the alignment for this type was requested by "aligned" attribute,
1432 0 if it is the default for this type. */
1433 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1434 /* Holds the machine mode corresponding to the declaration of a variable or
1435 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1437 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1438 /* Holds the RTL expression for the value of a variable or function. If
1439 PROMOTED_MODE is defined, the mode of this expression may not be same
1440 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1441 to the variable's data type, while the mode
1442 of DECL_RTL is the mode actually used to contain the data.
1444 This value can be evaluated lazily for functions, variables with
1445 static storage duration, and labels. */
1446 #define DECL_RTL(NODE) \
1447 (DECL_CHECK (NODE)->decl.rtl \
1448 ? (NODE)->decl.rtl \
1449 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1450 /* Set the DECL_RTL for NODE to RTL. */
1451 #define SET_DECL_RTL(NODE, RTL) (DECL_CHECK (NODE)->decl.rtl = (RTL))
1452 /* Returns non-zero if the DECL_RTL for NODE has already been set. */
1453 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1454 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1455 NODE1, it will not be set for NODE2; this is a lazy copy. */
1456 #define COPY_DECL_RTL(NODE1, NODE2) \
1457 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1458 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1459 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1461 /* Holds an INSN_LIST of all of the live ranges in which the variable
1462 has been moved to a possibly different register. */
1463 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1465 /* For PARM_DECL, holds an RTL for the stack slot or register
1466 where the data was actually passed. */
1467 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1469 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1470 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1472 /* For FUNCTION_DECL, if it is built-in,
1473 this identifies which built-in operation it is. */
1474 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1476 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1477 Before the struct containing the FUNCTION_DECL is laid out,
1478 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1479 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1480 function. When the class is laid out, this pointer is changed
1481 to an INTEGER_CST node which is suitable for use as an index
1482 into the virtual function table. */
1483 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1485 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1486 which this FIELD_DECL is defined. This information is needed when
1487 writing debugging information about vfield and vbase decls for C++. */
1488 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1490 /* Every ..._DECL node gets a unique number. */
1491 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1493 /* For any sort of a ..._DECL node, this points to the original (abstract)
1494 decl node which this decl is an instance of, or else it is NULL indicating
1495 that this decl is not an instance of some other decl. For example,
1496 in a nested declaration of an inline function, this points back to the
1498 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1500 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1501 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1502 #define DECL_ORIGIN(NODE) \
1503 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1505 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1506 inline instance of some original (abstract) decl from an inline function;
1507 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1508 nodes can also have their abstract origin set to themselves. */
1509 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1510 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1512 /* Nonzero if a _DECL means that the name of this decl should be ignored
1513 for symbolic debug purposes. */
1514 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1516 /* Nonzero for a given ..._DECL node means that this node represents an
1517 "abstract instance" of the given declaration (e.g. in the original
1518 declaration of an inline function). When generating symbolic debugging
1519 information, we mustn't try to generate any address information for nodes
1520 marked as "abstract instances" because we don't actually generate
1521 any code or allocate any data space for such instances. */
1522 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1524 /* Nonzero if a _DECL means that no warnings should be generated just
1525 because this decl is unused. */
1526 #define DECL_IN_SYSTEM_HEADER(NODE) \
1527 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1529 /* Nonzero for a given ..._DECL node means that this node should be
1530 put in .common, if possible. If a DECL_INITIAL is given, and it
1531 is not error_mark_node, then the decl cannot be put in .common. */
1532 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1534 /* Language-specific decl information. */
1535 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1537 /* In a VAR_DECL or FUNCTION_DECL,
1538 nonzero means external reference:
1539 do not allocate storage, and refer to a definition elsewhere. */
1540 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1542 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1544 #define DEFAULT_INIT_PRIORITY 65535
1545 #define MAX_INIT_PRIORITY 65535
1546 #define MAX_RESERVED_INIT_PRIORITY 100
1549 nonzero means the detail info about this type is not dumped into stabs.
1550 Instead it will generate cross reference ('x') of names.
1551 This uses the same flag as DECL_EXTERNAL. */
1552 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1553 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1555 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1556 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1558 /* In LABEL_DECL nodes, nonzero means that an error message about
1559 jumping into such a binding contour has been printed for this label. */
1560 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1562 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1563 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1565 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1566 static chain is not needed. */
1567 #define DECL_NO_STATIC_CHAIN(NODE) \
1568 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1570 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1571 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1573 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1575 Also set in some languages for variables, etc., outside the normal
1576 lexical scope, such as class instance variables. */
1577 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1579 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1580 where it is called. */
1581 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1583 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1584 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1586 /* In a FUNCTION_DECL, the saved representation of the body of the
1587 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1588 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1589 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1591 /* List of FUNCTION_DECLs inlined into this function's body. */
1592 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1594 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1595 that is not specified by ansi C and that users are supposed to be allowed
1596 to redefine for any purpose whatever. */
1597 #define DECL_BUILT_IN_NONANSI(NODE) \
1598 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1600 /* Nonzero in a FUNCTION_DECL means this function should be treated
1601 as if it were a malloc, meaning it returns a pointer that is
1603 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1605 /* Nonzero in a FUNCTION_DECL means this function should be treated
1606 as "pure" function (like const function, but may read global memory). */
1607 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1609 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1611 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1613 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1614 contour that restored a stack level and which is now exited. */
1615 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1617 /* Unused in FUNCTION_DECL. */
1619 /* In a VAR_DECL that's static,
1620 nonzero if the space is in the text section. */
1621 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1623 /* In a FUNCTION_DECL, nonzero means a built in function. */
1624 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1626 /* For a builtin function, identify which part of the compiler defined it. */
1627 #define DECL_BUILT_IN_CLASS(NODE) \
1628 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1630 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1631 Used in FIELD_DECLs for vtable pointers.
1632 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1633 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1635 /* Used to indicate that the linkage status of this DECL is not yet known,
1636 so it should not be output now. */
1637 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1639 /* Used in PARM_DECLs whose type are unions to indicate that the
1640 argument should be passed in the same way that the first union
1641 alternative would be passed. */
1642 #define DECL_TRANSPARENT_UNION(NODE) \
1643 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1645 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1646 at the beginning or end of execution. */
1647 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1648 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1650 #define DECL_STATIC_DESTRUCTOR(NODE) \
1651 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1653 /* Used to indicate that this DECL represents a compiler-generated entity. */
1654 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1656 /* Used to indicate that this DECL has weak linkage. */
1657 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1659 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1660 multiple translation units should be merged. */
1661 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1663 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1664 not be put out unless it is needed in this translation unit.
1665 Entities like this are shared across translation units (like weak
1666 entities), but are guaranteed to be generated by any translation
1667 unit that needs them, and therefore need not be put out anywhere
1668 where they are not needed. DECL_COMDAT is just a hint to the
1669 back-end; it is up to front-ends which set this flag to ensure
1670 that there will never be any harm, other than bloat, in putting out
1671 something which is DECL_COMDAT. */
1672 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1674 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1675 be instrumented with calls to support routines. */
1676 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1677 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1679 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1680 disabled in this function. */
1681 #define DECL_NO_LIMIT_STACK(NODE) \
1682 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1684 /* Additional flags for language-specific uses. */
1685 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1686 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1687 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1688 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1689 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1690 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1691 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1692 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1694 /* Used to indicate that the pointer to this DECL cannot be treated as
1695 an address constant. */
1696 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1698 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1700 #define DECL_NONADDRESSABLE_P(NODE) \
1701 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1703 /* Used to indicate an alias set for the memory pointed to by this
1704 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1705 pointer (or reference) type. */
1706 #define DECL_POINTER_ALIAS_SET(NODE) \
1707 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1709 /* Nonzero if an alias set has been assigned to this declaration. */
1710 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1711 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1713 /* The pointer_depth field comprises two bits for values in the range
1714 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1715 type node, but for functions it migth be greater. For example,
1716 this can happen when the function is declared to accept a parameter
1717 of type void* (depth=1), but is actually called with an argument of
1718 type foo** (depth=2). The function type will get the formal
1719 parameter's depth, but the function decl will get the actual
1720 argument's depth. */
1721 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1727 struct tree_common common;
1728 const char *filename;
1732 ENUM_BITFIELD(machine_mode) mode : 8;
1734 unsigned external_flag : 1;
1735 unsigned nonlocal_flag : 1;
1736 unsigned regdecl_flag : 1;
1737 unsigned inline_flag : 1;
1738 unsigned bit_field_flag : 1;
1739 unsigned virtual_flag : 1;
1740 unsigned ignored_flag : 1;
1741 unsigned abstract_flag : 1;
1743 unsigned in_system_header_flag : 1;
1744 unsigned common_flag : 1;
1745 unsigned defer_output : 1;
1746 unsigned transparent_union : 1;
1747 unsigned static_ctor_flag : 1;
1748 unsigned static_dtor_flag : 1;
1749 unsigned artificial_flag : 1;
1750 unsigned weak_flag : 1;
1752 unsigned non_addr_const_p : 1;
1753 unsigned no_instrument_function_entry_exit : 1;
1754 unsigned comdat_flag : 1;
1755 unsigned malloc_flag : 1;
1756 unsigned no_limit_stack : 1;
1757 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1758 unsigned pure_flag : 1;
1760 unsigned pointer_depth : 2;
1761 unsigned non_addressable : 1;
1762 unsigned user_align : 1;
1763 unsigned uninlinable : 1;
1764 /* Three unused bits. */
1766 unsigned lang_flag_0 : 1;
1767 unsigned lang_flag_1 : 1;
1768 unsigned lang_flag_2 : 1;
1769 unsigned lang_flag_3 : 1;
1770 unsigned lang_flag_4 : 1;
1771 unsigned lang_flag_5 : 1;
1772 unsigned lang_flag_6 : 1;
1773 unsigned lang_flag_7 : 1;
1776 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1777 DECL_FUNCTION_CODE. */
1778 enum built_in_function f;
1779 /* In a FUNCITON_DECL for which DECL_BUILT_IN does not hold, this
1780 is used by language-dependent code. */
1782 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1784 struct {unsigned int align : 24; unsigned int off_align : 8;} a;
1790 tree arguments; /* Also used for DECL_FIELD_OFFSET */
1791 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
1792 tree initial; /* Also used for DECL_QUALIFIER */
1793 tree abstract_origin;
1794 tree assembler_name;
1797 rtx rtl; /* RTL representation for object. */
1800 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1801 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1802 In PARM_DECL, holds an RTL for the stack slot
1803 of register where the data was actually passed.
1804 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1812 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1815 /* In a FUNCTION_DECL, these are function data which is to be kept
1816 as long as FUNCTION_DECL is kept. */
1820 HOST_WIDE_INT pointer_alias_set;
1821 /* Points to a structure whose details depend on the language in use. */
1822 struct lang_decl *lang_specific;
1825 /* Define the overall contents of a tree node.
1826 It may be any of the structures declared above
1827 for various types of node. */
1831 struct tree_common common;
1832 struct tree_int_cst int_cst;
1833 struct tree_real_cst real_cst;
1834 struct tree_string string;
1835 struct tree_complex complex;
1836 struct tree_identifier identifier;
1837 struct tree_decl decl;
1838 struct tree_type type;
1839 struct tree_list list;
1840 struct tree_vec vec;
1841 struct tree_exp exp;
1842 struct tree_block block;
1845 /* Standard named or nameless data types of the C compiler. */
1864 TI_INTEGER_MINUS_ONE,
1874 TI_COMPLEX_INTEGER_TYPE,
1875 TI_COMPLEX_FLOAT_TYPE,
1876 TI_COMPLEX_DOUBLE_TYPE,
1877 TI_COMPLEX_LONG_DOUBLE_TYPE,
1881 TI_LONG_DOUBLE_TYPE,
1905 extern tree global_trees[TI_MAX];
1907 #define error_mark_node global_trees[TI_ERROR_MARK]
1909 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1910 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1911 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1912 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1913 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1915 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1916 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1917 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1918 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1919 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1921 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1922 #define integer_one_node global_trees[TI_INTEGER_ONE]
1923 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
1924 #define size_zero_node global_trees[TI_SIZE_ZERO]
1925 #define size_one_node global_trees[TI_SIZE_ONE]
1926 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1927 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1928 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1930 #define null_pointer_node global_trees[TI_NULL_POINTER]
1932 #define float_type_node global_trees[TI_FLOAT_TYPE]
1933 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1934 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1936 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1937 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1938 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1939 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1941 #define void_type_node global_trees[TI_VOID_TYPE]
1942 /* The C type `void *'. */
1943 #define ptr_type_node global_trees[TI_PTR_TYPE]
1944 /* The C type `const void *'. */
1945 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1946 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1947 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1949 /* The node that should be placed at the end of a parameter list to
1950 indicate that the function does not take a variable number of
1951 arguments. The TREE_VALUE will be void_type_node and there will be
1952 no TREE_CHAIN. Language-independent code should not assume
1953 anything else about this node. */
1954 #define void_list_node global_trees[TI_VOID_LIST_NODE]
1956 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
1957 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
1959 #define V16QI_type_node global_trees[TI_V16QI_TYPE]
1960 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
1961 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
1962 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
1963 #define V8HI_type_node global_trees[TI_V8HI_TYPE]
1964 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
1965 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
1966 #define V2SF_type_node global_trees[TI_V2SF_TYPE]
1968 /* An enumeration of the standard C integer types. These must be
1969 ordered so that shorter types appear before longer ones. */
1970 enum integer_type_kind
1982 itk_unsigned_long_long,
1986 typedef enum integer_type_kind integer_type_kind;
1988 /* The standard C integer types. Use integer_type_kind to index into
1990 extern tree integer_types[itk_none];
1992 #define char_type_node integer_types[itk_char]
1993 #define signed_char_type_node integer_types[itk_signed_char]
1994 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1995 #define short_integer_type_node integer_types[itk_short]
1996 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1997 #define integer_type_node integer_types[itk_int]
1998 #define unsigned_type_node integer_types[itk_unsigned_int]
1999 #define long_integer_type_node integer_types[itk_long]
2000 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2001 #define long_long_integer_type_node integer_types[itk_long_long]
2002 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2005 #define NULL_TREE (tree) NULL
2007 /* Approximate positive square root of a host double. This is for
2008 statistical reports, not code generation. */
2009 extern double approx_sqrt PARAMS ((double));
2011 extern char *permalloc PARAMS ((int));
2012 extern char *expralloc PARAMS ((int));
2014 /* Compute the number of bytes occupied by 'node'. This routine only
2015 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2017 extern size_t tree_size PARAMS ((tree));
2019 /* Lowest level primitive for allocating a node.
2020 The TREE_CODE is the only argument. Contents are initialized
2021 to zero except for a few of the common fields. */
2023 extern tree make_node PARAMS ((enum tree_code));
2024 extern tree make_lang_type PARAMS ((enum tree_code));
2025 extern tree (*make_lang_type_fn) PARAMS ((enum tree_code));
2027 /* Make a copy of a node, with all the same contents except
2028 for TREE_PERMANENT. (The copy is permanent
2029 iff nodes being made now are permanent.) */
2031 extern tree copy_node PARAMS ((tree));
2033 /* Make a copy of a chain of TREE_LIST nodes. */
2035 extern tree copy_list PARAMS ((tree));
2037 /* Make a TREE_VEC. */
2039 extern tree make_tree_vec PARAMS ((int));
2041 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2042 The name is supplied as a char *. */
2044 extern tree get_identifier PARAMS ((const char *));
2046 /* Identical to get_identifier, except that the length is assumed
2049 extern tree get_identifier_with_length PARAMS ((const char *, unsigned int));
2051 /* If an identifier with the name TEXT (a null-terminated string) has
2052 previously been referred to, return that node; otherwise return
2055 extern tree maybe_get_identifier PARAMS ((const char *));
2057 /* Construct various types of nodes. */
2059 #define build_int_2(LO,HI) \
2060 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2062 extern tree build PARAMS ((enum tree_code, tree, ...));
2063 extern tree build_nt PARAMS ((enum tree_code, ...));
2065 extern tree build_int_2_wide PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT));
2066 extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE));
2067 extern tree build_real_from_int_cst PARAMS ((tree, tree));
2068 extern tree build_complex PARAMS ((tree, tree, tree));
2069 extern tree build_string PARAMS ((int, const char *));
2070 extern tree build1 PARAMS ((enum tree_code, tree, tree));
2071 extern tree build_tree_list PARAMS ((tree, tree));
2072 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
2073 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
2074 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
2076 /* Construct various nodes representing data types. */
2078 extern tree make_signed_type PARAMS ((int));
2079 extern tree make_unsigned_type PARAMS ((int));
2080 extern void initialize_sizetypes PARAMS ((void));
2081 extern void set_sizetype PARAMS ((tree));
2082 extern tree signed_or_unsigned_type PARAMS ((int, tree));
2083 extern void fixup_unsigned_type PARAMS ((tree));
2084 extern tree build_pointer_type PARAMS ((tree));
2085 extern tree build_reference_type PARAMS ((tree));
2086 extern tree build_type_no_quals PARAMS ((tree));
2087 extern tree build_index_type PARAMS ((tree));
2088 extern tree build_index_2_type PARAMS ((tree, tree));
2089 extern tree build_array_type PARAMS ((tree, tree));
2090 extern tree build_function_type PARAMS ((tree, tree));
2091 extern tree build_method_type PARAMS ((tree, tree));
2092 extern tree build_offset_type PARAMS ((tree, tree));
2093 extern tree build_complex_type PARAMS ((tree));
2094 extern tree array_type_nelts PARAMS ((tree));
2096 extern tree value_member PARAMS ((tree, tree));
2097 extern tree purpose_member PARAMS ((tree, tree));
2098 extern tree binfo_member PARAMS ((tree, tree));
2099 extern unsigned int attribute_hash_list PARAMS ((tree));
2100 extern int attribute_list_equal PARAMS ((tree, tree));
2101 extern int attribute_list_contained PARAMS ((tree, tree));
2102 extern int tree_int_cst_equal PARAMS ((tree, tree));
2103 extern int tree_int_cst_lt PARAMS ((tree, tree));
2104 extern int tree_int_cst_compare PARAMS ((tree, tree));
2105 extern int host_integerp PARAMS ((tree, int));
2106 extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
2107 extern int tree_int_cst_msb PARAMS ((tree));
2108 extern int tree_int_cst_sgn PARAMS ((tree));
2109 extern int tree_expr_nonnegative_p PARAMS ((tree));
2110 extern int rtl_expr_nonnegative_p PARAMS ((rtx));
2111 extern int index_type_equal PARAMS ((tree, tree));
2112 extern tree get_inner_array_type PARAMS ((tree));
2114 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2115 put the prototype here. Rtl.h does declare the prototype if
2116 tree.h had been included. */
2118 extern tree make_tree PARAMS ((tree, rtx));
2120 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2123 Such modified types already made are recorded so that duplicates
2126 extern tree build_type_attribute_variant PARAMS ((tree, tree));
2127 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
2129 /* Structure describing an attribute and a function to handle it. */
2130 struct attribute_spec
2132 /* The name of the attribute (without any leading or trailing __),
2133 or NULL to mark the end of a table of attributes. */
2134 const char *const name;
2135 /* The minimum length of the list of arguments of the attribute. */
2136 const int min_length;
2137 /* The maximum length of the list of arguments of the attribute
2138 (-1 for no maximum). */
2139 const int max_length;
2140 /* Whether this attribute requires a DECL. If it does, it will be passed
2141 from types of DECLs, function return types and array element types to
2142 the DECLs, function types and array types respectively; but when
2143 applied to a type in any other circumstances, it will be ignored with
2144 a warning. (If greater control is desired for a given attribute,
2145 this should be false, and the flags argument to the handler may be
2146 used to gain greater control in that case.) */
2147 const bool decl_required;
2148 /* Whether this attribute requires a type. If it does, it will be passed
2149 from a DECL to the type of that DECL. */
2150 const bool type_required;
2151 /* Whether this attribute requires a function (or method) type. If it does,
2152 it will be passed from a function pointer type to the target type,
2153 and from a function return type (which is not itself a function
2154 pointer type) to the function type. */
2155 const bool function_type_required;
2156 /* Function to handle this attribute. NODE points to the node to which
2157 the attribute is to be applied. If a DECL, it should be modified in
2158 place; if a TYPE, a copy should be created. NAME is the name of the
2159 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2160 of the arguments (which may be NULL). FLAGS gives further information
2161 about the context of the attribute. Afterwards, the attributes will
2162 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2163 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2164 as well as in any other cases when the attributes should not be added
2165 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2166 applied to another type or DECL later may be returned;
2167 otherwise the return value should be NULL_TREE. This pointer may be
2168 NULL if no special handling is required beyond the checks implied
2169 by the rest of this structure. */
2170 tree (*const handler) PARAMS ((tree *node, tree name, tree args,
2171 int flags, bool *no_add_attrs));
2174 extern const struct attribute_spec default_target_attribute_table[];
2176 /* Flags that may be passed in the third argument of decl_attributes, and
2177 to handler functions for attributes. */
2178 enum attribute_flags
2180 /* The type passed in is the type of a DECL, and any attributes that
2181 should be passed in again to be applied to the DECL rather than the
2182 type should be returned. */
2183 ATTR_FLAG_DECL_NEXT = 1,
2184 /* The type passed in is a function return type, and any attributes that
2185 should be passed in again to be applied to the function type rather
2186 than the return type should be returned. */
2187 ATTR_FLAG_FUNCTION_NEXT = 2,
2188 /* The type passed in is an array element type, and any attributes that
2189 should be passed in again to be applied to the array type rather
2190 than the element type should be returned. */
2191 ATTR_FLAG_ARRAY_NEXT = 4,
2192 /* The type passed in is a structure, union or enumeration type being
2193 created, and should be modified in place. */
2194 ATTR_FLAG_TYPE_IN_PLACE = 8,
2195 /* The attributes are being applied by default to a library function whose
2196 name indicates known behavior, and should be silently ignored if they
2197 are not in fact compatible with the function type. */
2198 ATTR_FLAG_BUILT_IN = 16
2201 /* Default versions of target-overridable functions. */
2203 extern tree merge_decl_attributes PARAMS ((tree, tree));
2204 extern tree merge_type_attributes PARAMS ((tree, tree));
2205 extern int default_comp_type_attributes PARAMS ((tree, tree));
2206 extern void default_set_default_type_attributes PARAMS ((tree));
2207 extern void default_insert_attributes PARAMS ((tree, tree *));
2208 extern bool default_function_attribute_inlinable_p PARAMS ((tree));
2210 /* Split a list of declspecs and attributes into two. */
2212 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2214 /* Strip attributes from a list of combined specs and attrs. */
2216 extern tree strip_attrs PARAMS ((tree));
2218 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2220 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
2222 /* Given a tree node and a string, return non-zero if the tree node is
2223 a valid attribute name for the string. */
2225 extern int is_attribute_p PARAMS ((const char *, tree));
2227 /* Given an attribute name and a list of attributes, return the list element
2228 of the attribute or NULL_TREE if not found. */
2230 extern tree lookup_attribute PARAMS ((const char *, tree));
2232 /* Given two attributes lists, return a list of their union. */
2234 extern tree merge_attributes PARAMS ((tree, tree));
2236 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2237 /* Given two Windows decl attributes lists, possibly including
2238 dllimport, return a list of their union . */
2239 extern tree merge_dllimport_decl_attributes PARAMS ((tree, tree));
2242 /* Return a version of the TYPE, qualified as indicated by the
2243 TYPE_QUALS, if one exists. If no qualified version exists yet,
2244 return NULL_TREE. */
2246 extern tree get_qualified_type PARAMS ((tree, int));
2248 /* Like get_qualified_type, but creates the type if it does not
2249 exist. This function never returns NULL_TREE. */
2251 extern tree build_qualified_type PARAMS ((tree, int));
2253 /* Like build_qualified_type, but only deals with the `const' and
2254 `volatile' qualifiers. This interface is retained for backwards
2255 compatiblity with the various front-ends; new code should use
2256 build_qualified_type instead. */
2258 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2259 build_qualified_type (TYPE, \
2260 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2261 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2263 /* Make a copy of a type node. */
2265 extern tree build_type_copy PARAMS ((tree));
2267 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2268 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2269 node, does nothing except for the first time. */
2271 extern void layout_type PARAMS ((tree));
2273 /* These functions allow a front-end to perform a manual layout of a
2274 RECORD_TYPE. (For instance, if the placement of subsequent fields
2275 depends on the placement of fields so far.) Begin by calling
2276 start_record_layout. Then, call place_field for each of the
2277 fields. Then, call finish_record_layout. See layout_type for the
2278 default way in which these functions are used. */
2280 typedef struct record_layout_info_s
2282 /* The RECORD_TYPE that we are laying out. */
2284 /* The offset into the record so far, in bytes, not including bits in
2287 /* The last known alignment of SIZE. */
2288 unsigned int offset_align;
2289 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2291 /* The alignment of the record so far, in bits. */
2292 unsigned int record_align;
2293 /* The alignment of the record so far, not including padding, in bits. */
2294 unsigned int unpacked_align;
2295 /* The alignment of the record so far, allowing for the record to be
2296 padded only at the end, in bits. */
2297 unsigned int unpadded_align;
2298 /* The static variables (i.e., class variables, as opposed to
2299 instance variables) encountered in T. */
2300 tree pending_statics;
2301 int packed_maybe_necessary;
2302 } *record_layout_info;
2304 extern void set_lang_adjust_rli PARAMS ((void (*) PARAMS
2305 ((record_layout_info))));
2306 extern record_layout_info start_record_layout PARAMS ((tree));
2307 extern tree bit_from_pos PARAMS ((tree, tree));
2308 extern tree byte_from_pos PARAMS ((tree, tree));
2309 extern void pos_from_byte PARAMS ((tree *, tree *, unsigned int,
2311 extern void pos_from_bit PARAMS ((tree *, tree *, unsigned int,
2313 extern void normalize_offset PARAMS ((tree *, tree *,
2315 extern tree rli_size_unit_so_far PARAMS ((record_layout_info));
2316 extern tree rli_size_so_far PARAMS ((record_layout_info));
2317 extern void normalize_rli PARAMS ((record_layout_info));
2318 extern void place_field PARAMS ((record_layout_info, tree));
2319 extern void compute_record_mode PARAMS ((tree));
2320 extern void finish_record_layout PARAMS ((record_layout_info));
2322 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2323 return a canonicalized ..._TYPE node, so that duplicates are not made.
2324 How the hash code is computed is up to the caller, as long as any two
2325 callers that could hash identical-looking type nodes agree. */
2327 extern tree type_hash_canon PARAMS ((unsigned int, tree));
2329 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2330 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2331 fields. Call this only once for any given decl node.
2333 Second argument is the boundary that this field can be assumed to
2334 be starting at (in bits). Zero means it can be assumed aligned
2335 on any boundary that may be needed. */
2337 extern void layout_decl PARAMS ((tree, unsigned));
2339 /* Return the mode for data of a given size SIZE and mode class CLASS.
2340 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2341 The value is BLKmode if no other mode is found. This is like
2342 mode_for_size, but is passed a tree. */
2344 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
2347 /* Return an expr equal to X but certainly not valid as an lvalue. */
2349 extern tree non_lvalue PARAMS ((tree));
2350 extern tree pedantic_non_lvalue PARAMS ((tree));
2352 extern tree convert PARAMS ((tree, tree));
2353 extern unsigned int expr_align PARAMS ((tree));
2354 extern tree size_in_bytes PARAMS ((tree));
2355 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
2356 extern tree bit_position PARAMS ((tree));
2357 extern HOST_WIDE_INT int_bit_position PARAMS ((tree));
2358 extern tree byte_position PARAMS ((tree));
2359 extern HOST_WIDE_INT int_byte_position PARAMS ((tree));
2361 /* Define data structures, macros, and functions for handling sizes
2362 and the various types used to represent sizes. */
2366 SIZETYPE, /* Normal representation of sizes in bytes. */
2367 SSIZETYPE, /* Signed representation of sizes in bytes. */
2368 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2369 BITSIZETYPE, /* Normal representation of sizes in bits. */
2370 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2371 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
2374 extern tree sizetype_tab[(int) TYPE_KIND_LAST];
2376 #define sizetype sizetype_tab[(int) SIZETYPE]
2377 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2378 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2379 #define usizetype sizetype_tab[(int) USIZETYPE]
2380 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2381 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2383 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
2384 extern tree size_diffop PARAMS ((tree, tree));
2385 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
2386 enum size_type_kind));
2387 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
2389 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2390 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2391 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2392 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2393 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2395 extern tree round_up PARAMS ((tree, int));
2396 extern tree round_down PARAMS ((tree, int));
2397 extern tree get_pending_sizes PARAMS ((void));
2398 extern int is_pending_size PARAMS ((tree));
2399 extern void put_pending_size PARAMS ((tree));
2400 extern void put_pending_sizes PARAMS ((tree));
2402 /* Type for sizes of data-type. */
2404 #define BITS_PER_UNIT_LOG \
2405 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2406 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2407 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2409 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2410 extern unsigned int maximum_field_alignment;
2412 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
2413 extern unsigned int set_alignment;
2415 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2416 by making the last node in X point to Y.
2417 Returns X, except if X is 0 returns Y. */
2419 extern tree chainon PARAMS ((tree, tree));
2421 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2423 extern tree tree_cons PARAMS ((tree, tree, tree));
2425 /* Return the last tree node in a chain. */
2427 extern tree tree_last PARAMS ((tree));
2429 /* Reverse the order of elements in a chain, and return the new head. */
2431 extern tree nreverse PARAMS ((tree));
2433 /* Returns the length of a chain of nodes
2434 (number of chain pointers to follow before reaching a null pointer). */
2436 extern int list_length PARAMS ((tree));
2438 /* Returns the number of FIELD_DECLs in a type. */
2440 extern int fields_length PARAMS ((tree));
2442 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2444 extern int integer_zerop PARAMS ((tree));
2446 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2448 extern int integer_onep PARAMS ((tree));
2450 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2451 all of whose significant bits are 1. */
2453 extern int integer_all_onesp PARAMS ((tree));
2455 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2456 exactly one bit 1. */
2458 extern int integer_pow2p PARAMS ((tree));
2460 /* staticp (tree x) is nonzero if X is a reference to data allocated
2461 at a fixed address in memory. */
2463 extern int staticp PARAMS ((tree));
2465 /* Gets an error if argument X is not an lvalue.
2466 Also returns 1 if X is an lvalue, 0 if not. */
2468 extern int lvalue_or_else PARAMS ((tree, const char *));
2470 /* save_expr (EXP) returns an expression equivalent to EXP
2471 but it can be used multiple times within context CTX
2472 and only evaluate EXP once. */
2474 extern tree save_expr PARAMS ((tree));
2476 /* Returns the index of the first non-tree operand for CODE, or the number
2477 of operands if all are trees. */
2479 extern int first_rtl_op PARAMS ((enum tree_code));
2481 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2482 can be used multiple times and will evaluate EXP in its entirety
2485 extern tree unsave_expr PARAMS ((tree));
2487 /* Reset EXP in place so that it can be expaned again. Does not
2488 recurse into subtrees. */
2490 extern void unsave_expr_1 PARAMS ((tree));
2492 /* Like unsave_expr_1, but recurses into all subtrees. */
2494 extern tree unsave_expr_now PARAMS ((tree));
2496 /* If non-null, these are language-specific helper functions for
2497 unsave_expr_now. If present, LANG_UNSAVE is called before its
2498 argument (an UNSAVE_EXPR) is to be unsaved, and all other
2499 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
2500 called from unsave_expr_1 for language-specific tree codes. */
2501 extern void (*lang_unsave) PARAMS ((tree *));
2502 extern void (*lang_unsave_expr_now) PARAMS ((tree));
2504 /* Return 0 if it is safe to evaluate EXPR multiple times,
2505 return 1 if it is safe if EXPR is unsaved afterward, or
2506 return 2 if it is completely unsafe. */
2507 extern int unsafe_for_reeval PARAMS ((tree));
2509 /* If non-null, these are language-specific helper functions for
2510 unsafe_for_reeval. Return negative to not handle some tree. */
2511 extern int (*lang_unsafe_for_reeval) PARAMS ((tree));
2513 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2514 or offset that depends on a field within a record.
2516 Note that we only allow such expressions within simple arithmetic
2519 extern int contains_placeholder_p PARAMS ((tree));
2521 /* Return 1 if EXP contains any expressions that produce cleanups for an
2522 outer scope to deal with. Used by fold. */
2524 extern int has_cleanups PARAMS ((tree));
2526 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2527 return a tree with all occurrences of references to F in a
2528 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2529 contains only arithmetic expressions. */
2531 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
2533 /* variable_size (EXP) is like save_expr (EXP) except that it
2534 is for the special case of something that is part of a
2535 variable size for a data type. It makes special arrangements
2536 to compute the value at the right time when the data type
2537 belongs to a function parameter. */
2539 extern tree variable_size PARAMS ((tree));
2541 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2542 but it can be used multiple times
2543 and only evaluate the subexpressions once. */
2545 extern tree stabilize_reference PARAMS ((tree));
2547 /* Subroutine of stabilize_reference; this is called for subtrees of
2548 references. Any expression with side-effects must be put in a SAVE_EXPR
2549 to ensure that it is only evaluated once. */
2551 extern tree stabilize_reference_1 PARAMS ((tree));
2553 /* Return EXP, stripped of any conversions to wider types
2554 in such a way that the result of converting to type FOR_TYPE
2555 is the same as if EXP were converted to FOR_TYPE.
2556 If FOR_TYPE is 0, it signifies EXP's type. */
2558 extern tree get_unwidened PARAMS ((tree, tree));
2560 /* Return OP or a simpler expression for a narrower value
2561 which can be sign-extended or zero-extended to give back OP.
2562 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2563 or 0 if the value should be sign-extended. */
2565 extern tree get_narrower PARAMS ((tree, int *));
2567 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2569 The definition of this resides in language-specific code
2570 as the repertoire of available types may vary. */
2572 extern tree type_for_mode PARAMS ((enum machine_mode, int));
2574 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2575 for an integer type with at least that precision.
2576 The definition of this resides in language-specific code
2577 as the repertoire of available types may vary. */
2579 extern tree type_for_size PARAMS ((unsigned, int));
2581 /* Given an integer type T, return a type like T but unsigned.
2582 If T is unsigned, the value is T.
2583 The definition of this resides in language-specific code
2584 as the repertoire of available types may vary. */
2586 extern tree unsigned_type PARAMS ((tree));
2588 /* Given an integer type T, return a type like T but signed.
2589 If T is signed, the value is T.
2590 The definition of this resides in language-specific code
2591 as the repertoire of available types may vary. */
2593 extern tree signed_type PARAMS ((tree));
2595 /* This function must be defined in the language-specific files.
2596 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2597 This is defined in a language-specific file. */
2599 extern tree maybe_build_cleanup PARAMS ((tree));
2601 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2602 look for nested component-refs or array-refs at constant positions
2603 and find the ultimate containing object, which is returned. */
2605 extern tree get_inner_reference PARAMS ((tree, HOST_WIDE_INT *,
2606 HOST_WIDE_INT *, tree *,
2607 enum machine_mode *, int *,
2610 /* Return 1 if T is an expression that get_inner_reference handles. */
2612 extern int handled_component_p PARAMS ((tree));
2614 /* Given a DECL or TYPE, return the scope in which it was declared, or
2615 NUL_TREE if there is no containing scope. */
2617 extern tree get_containing_scope PARAMS ((tree));
2619 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2621 extern tree decl_function_context PARAMS ((tree));
2623 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2624 this _DECL with its context, or zero if none. */
2625 extern tree decl_type_context PARAMS ((tree));
2627 /* Given the FUNCTION_DECL for the current function,
2628 return zero if it is ok for this function to be inline.
2629 Otherwise return a warning message with a single %s
2630 for the function's name. */
2632 extern const char *function_cannot_inline_p PARAMS ((tree));
2634 /* Return 1 if EXPR is the real constant zero. */
2635 extern int real_zerop PARAMS ((tree));
2637 /* Declare commonly used variables for tree structure. */
2639 /* Points to the name of the input file from which the current input
2640 being parsed originally came (before it went into cpp). */
2641 extern const char *input_filename;
2643 /* Current line number in input file. */
2646 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2647 Zero means allow extended lvalues. */
2649 extern int pedantic_lvalues;
2651 /* Nonzero means can safely call expand_expr now;
2652 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2654 extern int immediate_size_expand;
2656 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2658 extern tree current_function_decl;
2660 /* Nonzero means a FUNC_BEGIN label was emitted. */
2661 extern tree current_function_func_begin_label;
2663 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2665 extern int all_types_permanent;
2667 /* Pointer to function to compute the name to use to print a declaration.
2668 DECL is the declaration in question.
2669 VERBOSITY determines what information will be printed:
2670 0: DECL_NAME, demangled as necessary.
2671 1: and scope information.
2672 2: and any other information that might be interesting, such as function
2673 parameter types in C++. */
2675 extern const char *(*decl_printable_name) PARAMS ((tree, int));
2677 /* Pointer to function to finish handling an incomplete decl at the
2678 end of compilation. */
2680 extern void (*incomplete_decl_finalize_hook) PARAMS ((tree));
2682 /* Declare a predefined function. Return the declaration. This function is
2683 provided by each language frontend. */
2684 extern tree builtin_function PARAMS ((const char *, tree, int,
2685 enum built_in_class,
2689 extern char *perm_calloc PARAMS ((int, long));
2690 extern void clean_symbol_name PARAMS ((char *));
2691 extern tree get_file_function_name_long PARAMS ((const char *));
2692 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2693 extern tree get_set_constructor_bytes PARAMS ((tree,
2694 unsigned char *, int));
2695 extern tree get_callee_fndecl PARAMS ((tree));
2696 extern void set_decl_assembler_name PARAMS ((tree));
2697 extern int type_num_arguments PARAMS ((tree));
2701 extern int in_control_zone_p PARAMS ((void));
2702 extern void expand_fixups PARAMS ((rtx));
2703 extern tree expand_start_stmt_expr PARAMS ((void));
2704 extern tree expand_end_stmt_expr PARAMS ((tree));
2705 extern void expand_expr_stmt PARAMS ((tree));
2706 extern int warn_if_unused_value PARAMS ((tree));
2707 extern void expand_decl_init PARAMS ((tree));
2708 extern void clear_last_expr PARAMS ((void));
2709 extern void expand_label PARAMS ((tree));
2710 extern void expand_goto PARAMS ((tree));
2711 extern void expand_asm PARAMS ((tree));
2712 extern void expand_start_cond PARAMS ((tree, int));
2713 extern void expand_end_cond PARAMS ((void));
2714 extern void expand_start_else PARAMS ((void));
2715 extern void expand_start_elseif PARAMS ((tree));
2716 extern struct nesting *expand_start_loop PARAMS ((int));
2717 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2718 extern struct nesting *expand_start_null_loop PARAMS ((void));
2719 extern void expand_loop_continue_here PARAMS ((void));
2720 extern void expand_end_loop PARAMS ((void));
2721 extern void expand_end_null_loop PARAMS ((void));
2722 extern int expand_continue_loop PARAMS ((struct nesting *));
2723 extern int expand_exit_loop PARAMS ((struct nesting *));
2724 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2726 extern int expand_exit_something PARAMS ((void));
2728 extern void expand_return PARAMS ((tree));
2729 extern int optimize_tail_recursion PARAMS ((tree, rtx));
2730 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2731 #define expand_start_bindings(flags) \
2732 expand_start_bindings_and_block(flags, NULL_TREE)
2733 extern void expand_end_bindings PARAMS ((tree, int, int));
2734 extern void warn_about_unused_variables PARAMS ((tree));
2735 extern void start_cleanup_deferral PARAMS ((void));
2736 extern void end_cleanup_deferral PARAMS ((void));
2737 extern int is_body_block PARAMS ((tree));
2739 extern int conditional_context PARAMS ((void));
2740 extern struct nesting * current_nesting_level PARAMS ((void));
2741 extern tree last_cleanup_this_contour PARAMS ((void));
2742 extern void expand_start_case PARAMS ((int, tree, tree,
2744 extern void expand_end_case PARAMS ((tree));
2745 extern int add_case_node PARAMS ((tree, tree,
2747 extern int pushcase PARAMS ((tree,
2748 tree (*) (tree, tree),
2750 extern int pushcase_range PARAMS ((tree, tree,
2751 tree (*) (tree, tree),
2753 extern void using_eh_for_cleanups PARAMS ((void));
2754 extern int stmt_loop_nest_empty PARAMS ((void));
2756 /* In fold-const.c */
2758 /* Fold constants as much as possible in an expression.
2759 Returns the simplified expression.
2760 Acts only on the top level of the expression;
2761 if the argument itself cannot be simplified, its
2762 subexpressions are not changed. */
2764 extern tree fold PARAMS ((tree));
2766 extern int force_fit_type PARAMS ((tree, int));
2767 extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2768 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2769 unsigned HOST_WIDE_INT *,
2771 extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2772 unsigned HOST_WIDE_INT *,
2774 extern int mul_double PARAMS ((unsigned HOST_WIDE_INT,
2776 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2777 unsigned HOST_WIDE_INT *,
2779 extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2780 HOST_WIDE_INT, unsigned int,
2781 unsigned HOST_WIDE_INT *,
2782 HOST_WIDE_INT *, int));
2783 extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2784 HOST_WIDE_INT, unsigned int,
2785 unsigned HOST_WIDE_INT *,
2786 HOST_WIDE_INT *, int));
2787 extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2788 HOST_WIDE_INT, unsigned int,
2789 unsigned HOST_WIDE_INT *,
2791 extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2792 HOST_WIDE_INT, unsigned int,
2793 unsigned HOST_WIDE_INT *,
2795 extern int operand_equal_p PARAMS ((tree, tree, int));
2796 extern tree invert_truthvalue PARAMS ((tree));
2798 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2799 function arguments and return the new type. Return NULL_TREE if no
2800 change. Required by any language that supports variadic arguments. */
2802 extern tree (*lang_type_promotes_to) PARAMS ((tree));
2803 extern tree fold_builtin PARAMS ((tree));
2805 /* The language front-end must define these functions. */
2807 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2808 extern void copy_lang_decl PARAMS ((tree));
2810 /* Function called with no arguments to parse and compile the input. */
2811 extern int yyparse PARAMS ((void));
2812 /* Functions for processing symbol declarations. */
2813 /* Function to enter a new lexical scope.
2814 Takes one argument: always zero when called from outside the front end. */
2815 extern void pushlevel PARAMS ((int));
2816 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2817 Takes three arguments:
2818 KEEP -- nonzero if there were declarations in this scope.
2819 REVERSE -- reverse the order of decls before returning them.
2820 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2821 extern tree poplevel PARAMS ((int, int, int));
2822 /* Set the BLOCK node for the current scope level. */
2823 extern void set_block PARAMS ((tree));
2824 /* Function to add a decl to the current scope level.
2825 Takes one argument, a decl to add.
2826 Returns that decl, or, if the same symbol is already declared, may
2827 return a different decl for that name. */
2828 extern tree pushdecl PARAMS ((tree));
2829 /* Function to return the chain of decls so far in the current scope level. */
2830 extern tree getdecls PARAMS ((void));
2831 /* Function to return the chain of structure tags in the current scope level. */
2832 extern tree gettags PARAMS ((void));
2834 extern tree build_range_type PARAMS ((tree, tree, tree));
2837 extern void record_component_aliases PARAMS ((tree));
2838 extern HOST_WIDE_INT get_alias_set PARAMS ((tree));
2839 extern int alias_sets_conflict_p PARAMS ((HOST_WIDE_INT,
2841 extern int readonly_fields_p PARAMS ((tree));
2842 extern int objects_must_conflict_p PARAMS ((tree, tree));
2844 /* Set the DECL_ASSEMBLER_NAME for a node. If it is the sort of thing
2845 that the assembler should talk about, set DECL_ASSEMBLER_NAME to an
2846 appropriate IDENTIFIER_NODE. Otherwise, set it to the
2847 ERROR_MARK_NODE to ensure that the assembler does not talk about
2849 extern void (*lang_set_decl_assembler_name) PARAMS ((tree));
2854 extern int really_constant_p PARAMS ((tree));
2855 extern int int_fits_type_p PARAMS ((tree, tree));
2856 extern int tree_log2 PARAMS ((tree));
2857 extern int tree_floor_log2 PARAMS ((tree));
2858 extern void preserve_data PARAMS ((void));
2859 extern int object_permanent_p PARAMS ((tree));
2860 extern int type_precision PARAMS ((tree));
2861 extern int simple_cst_equal PARAMS ((tree, tree));
2862 extern int compare_tree_int PARAMS ((tree, unsigned int));
2863 extern int type_list_equal PARAMS ((tree, tree));
2864 extern int chain_member PARAMS ((tree, tree));
2865 extern int chain_member_purpose PARAMS ((tree, tree));
2866 extern int chain_member_value PARAMS ((tree, tree));
2867 extern tree listify PARAMS ((tree));
2868 extern tree type_hash_lookup PARAMS ((unsigned int, tree));
2869 extern void type_hash_add PARAMS ((unsigned int, tree));
2870 extern unsigned int type_hash_list PARAMS ((tree));
2871 extern int simple_cst_list_equal PARAMS ((tree, tree));
2872 extern void dump_tree_statistics PARAMS ((void));
2873 extern void print_obstack_statistics PARAMS ((const char *,
2876 extern void print_obstack_name PARAMS ((char *, FILE *,
2879 extern void expand_function_end PARAMS ((const char *, int, int));
2880 extern void expand_function_start PARAMS ((tree, int));
2881 extern void expand_pending_sizes PARAMS ((tree));
2883 extern int real_onep PARAMS ((tree));
2884 extern int real_twop PARAMS ((tree));
2885 extern void gcc_obstack_init PARAMS ((struct obstack *));
2886 extern void init_obstacks PARAMS ((void));
2887 extern void build_common_tree_nodes PARAMS ((int));
2888 extern void build_common_tree_nodes_2 PARAMS ((int));
2889 extern void mark_tree_hashtable PARAMS ((void *));
2892 extern void setjmp_protect_args PARAMS ((void));
2893 extern void setjmp_protect PARAMS ((tree));
2894 extern void expand_main_function PARAMS ((void));
2895 extern void mark_varargs PARAMS ((void));
2896 extern void init_dummy_function_start PARAMS ((void));
2897 extern void expand_dummy_function_end PARAMS ((void));
2898 extern void init_function_for_compilation PARAMS ((void));
2899 extern void init_function_start PARAMS ((tree, const char *, int));
2900 extern void assign_parms PARAMS ((tree));
2901 extern void put_var_into_stack PARAMS ((tree));
2902 extern void flush_addressof PARAMS ((tree));
2903 extern void uninitialized_vars_warning PARAMS ((tree));
2904 extern void setjmp_args_warning PARAMS ((void));
2905 extern void mark_all_temps_used PARAMS ((void));
2906 extern void init_temp_slots PARAMS ((void));
2907 extern void combine_temp_slots PARAMS ((void));
2908 extern void free_temp_slots PARAMS ((void));
2909 extern void pop_temp_slots PARAMS ((void));
2910 extern void push_temp_slots PARAMS ((void));
2911 extern void preserve_temp_slots PARAMS ((rtx));
2912 extern void preserve_rtl_expr_temps PARAMS ((tree));
2913 extern int aggregate_value_p PARAMS ((tree));
2914 extern void free_temps_for_rtl_expr PARAMS ((tree));
2915 extern void instantiate_virtual_regs PARAMS ((tree, rtx));
2916 extern void unshare_all_rtl PARAMS ((tree, rtx));
2917 extern int max_parm_reg_num PARAMS ((void));
2918 extern void push_function_context PARAMS ((void));
2919 extern void pop_function_context PARAMS ((void));
2920 extern void push_function_context_to PARAMS ((tree));
2921 extern void pop_function_context_from PARAMS ((tree));
2922 extern void ggc_mark_struct_function PARAMS ((struct function *));
2924 /* In print-rtl.c */
2926 extern void print_rtl PARAMS ((FILE *, rtx));
2929 /* In print-tree.c */
2930 extern void debug_tree PARAMS ((tree));
2932 extern void print_node PARAMS ((FILE *, const char *, tree,
2934 extern void print_node_brief PARAMS ((FILE *, const char *, tree,
2936 extern void indent_to PARAMS ((FILE *, int));
2940 extern int apply_args_register_offset PARAMS ((int));
2941 extern rtx expand_builtin_return_addr
2942 PARAMS ((enum built_in_function, int, rtx));
2943 extern void check_max_integer_computation_mode PARAMS ((tree));
2946 extern void start_sequence_for_rtl_expr PARAMS ((tree));
2947 extern rtx emit_line_note PARAMS ((const char *, int));
2951 extern int setjmp_call_p PARAMS ((tree));
2955 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
2956 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
2957 it should be modified in place; if a TYPE, a copy should be created
2958 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
2959 information, in the form of a bitwise OR of flags in enum attribute_flags
2960 from tree.h. Depending on these flags, some attributes may be
2961 returned to be applied at a later stage (for example, to apply
2962 a decl attribute to the declaration rather than to its type). */
2963 extern tree decl_attributes PARAMS ((tree *, tree, int));
2965 /* The following function must be provided by front ends
2968 /* Possibly apply default attributes to a function (represented by
2969 a FUNCTION_DECL). */
2970 extern void insert_default_attributes PARAMS ((tree));
2972 /* Table of machine-independent attributes for checking formats, if used. */
2973 extern const struct attribute_spec *format_attribute_table;
2975 /* Table of machine-independent attributes for a particular language. */
2976 extern const struct attribute_spec *lang_attribute_table;
2978 /* Flag saying whether common language attributes are to be supported. */
2979 extern int lang_attribute_common;
2983 extern int mark_addressable PARAMS ((tree));
2984 extern void incomplete_type_error PARAMS ((tree, tree));
2985 extern tree truthvalue_conversion PARAMS ((tree));
2986 extern int global_bindings_p PARAMS ((void));
2987 extern void insert_block PARAMS ((tree));
2989 /* In integrate.c */
2990 extern void save_for_inline PARAMS ((tree));
2991 extern void set_decl_abstract_flags PARAMS ((tree, int));
2992 extern void output_inline_function PARAMS ((tree));
2993 extern void set_decl_origin_self PARAMS ((tree));
2995 /* In stor-layout.c */
2996 extern void fixup_signed_type PARAMS ((tree));
2997 extern void internal_reference_types PARAMS ((void));
3000 extern void make_decl_rtl PARAMS ((tree, const char *));
3001 extern void make_decl_one_only PARAMS ((tree));
3002 extern int supports_one_only PARAMS ((void));
3003 extern void variable_section PARAMS ((tree, int));
3005 /* In fold-const.c */
3006 extern int div_and_round_double PARAMS ((enum tree_code, int,
3007 unsigned HOST_WIDE_INT,
3009 unsigned HOST_WIDE_INT,
3011 unsigned HOST_WIDE_INT *,
3013 unsigned HOST_WIDE_INT *,
3017 extern void emit_nop PARAMS ((void));
3018 extern void expand_computed_goto PARAMS ((tree));
3019 extern bool parse_output_constraint PARAMS ((const char **,
3021 bool *, bool *, bool *));
3022 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
3023 const char *, int));
3024 extern int any_pending_cleanups PARAMS ((int));
3025 extern void init_stmt PARAMS ((void));
3026 extern void init_stmt_for_function PARAMS ((void));
3027 extern int drop_through_at_end_p PARAMS ((void));
3028 extern void expand_start_target_temps PARAMS ((void));
3029 extern void expand_end_target_temps PARAMS ((void));
3030 extern void expand_elseif PARAMS ((tree));
3031 extern void save_stack_pointer PARAMS ((void));
3032 extern void expand_decl PARAMS ((tree));
3033 extern int expand_decl_cleanup PARAMS ((tree, tree));
3034 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
3035 extern void move_cleanups_up PARAMS ((void));
3036 extern void expand_start_case_dummy PARAMS ((void));
3037 extern void expand_end_case_dummy PARAMS ((void));
3038 extern tree case_index_expr_type PARAMS ((void));
3039 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
3040 extern void check_for_full_enumeration_handling PARAMS ((tree));
3041 extern void declare_nonlocal_label PARAMS ((tree));
3043 /* If KIND=='I', return a suitable global initializer (constructor) name.
3044 If KIND=='D', return a suitable global clean-up (destructor) name. */
3045 extern tree get_file_function_name PARAMS ((int));
3047 /* Interface of the DWARF2 unwind info support. */
3049 /* Generate a new label for the CFI info to refer to. */
3051 extern char *dwarf2out_cfi_label PARAMS ((void));
3053 /* Entry point to update the canonical frame address (CFA). */
3055 extern void dwarf2out_def_cfa PARAMS ((const char *, unsigned, long));
3057 /* Add the CFI for saving a register window. */
3059 extern void dwarf2out_window_save PARAMS ((const char *));
3061 /* Add a CFI to update the running total of the size of arguments pushed
3064 extern void dwarf2out_args_size PARAMS ((const char *, long));
3066 /* Entry point for saving a register to the stack. */
3068 extern void dwarf2out_reg_save PARAMS ((const char *, unsigned, long));
3070 /* Entry point for saving the return address in the stack. */
3072 extern void dwarf2out_return_save PARAMS ((const char *, long));
3074 /* Entry point for saving the return address in a register. */
3076 extern void dwarf2out_return_reg PARAMS ((const char *, unsigned));
3078 /* The type of a function that walks over tree structure. */
3080 typedef tree (*walk_tree_fn) PARAMS ((tree *, int *, void *));
3082 /* In tree-dump.c */
3084 /* Different tree dump places. When you add new tree dump places,
3085 extend the DUMP_FILES array in tree-dump.c */
3086 enum tree_dump_index
3088 TDI_all, /* dump the whole translation unit */
3089 TDI_class, /* dump class hierarchy */
3090 TDI_original, /* dump each function before optimizing it */
3091 TDI_optimized, /* dump each function after optimizing it */
3092 TDI_inlined, /* dump each function after inlining
3097 /* Bit masks to control tree dumping. Not all values are applicable to
3098 all tree dumps. Add new ones at the end. When you define new
3099 values, extend the DUMP_OPTIONS array in tree-dump.c */
3100 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3101 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3103 typedef struct dump_info *dump_info_p;
3105 extern int dump_flag PARAMS ((dump_info_p, int, tree));
3106 extern int dump_enabled_p PARAMS ((enum tree_dump_index));
3107 extern FILE *dump_begin PARAMS ((enum tree_dump_index, int *));
3108 extern void dump_end PARAMS ((enum tree_dump_index, FILE *));
3109 extern void dump_node PARAMS ((tree, int, FILE *));
3110 extern int dump_switch_p PARAMS ((const char *));
3111 extern const char *dump_flag_name PARAMS ((enum tree_dump_index));
3114 /* Redefine abort to report an internal error w/o coredump, and
3115 reporting the location of the error in the source file. This logic
3116 is duplicated in rtl.h and tree.h because every file that needs the
3117 special abort includes one or both. toplev.h gets too few files,
3118 system.h gets too many. */
3120 extern void fancy_abort PARAMS ((const char *, int, const char *))
3122 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)