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
203 ??? unspecified nodes
212 TREE_THIS_VOLATILE in
232 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
233 DECL_BUILT_IN_NONANSI in
235 SAVE_EXPR_NOPLACEHOLDER in
241 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
247 expressions, IDENTIFIER_NODE
252 CALL_EXPR, FUNCTION_DECL
257 expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL,
263 /* Define accessors for the fields that all tree nodes have
264 (though some fields are not used for all kinds of nodes). */
266 /* The tree-code says what kind of node it is.
267 Codes are defined in tree.def. */
268 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
269 #define TREE_SET_CODE(NODE, VALUE) \
270 ((NODE)->common.code = (ENUM_BITFIELD(tree_code)) (VALUE))
272 /* When checking is enabled, errors will be generated if a tree node
273 is accessed incorrectly. The macros abort with a fatal error. */
274 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
276 #define TREE_CHECK(t, code) __extension__ \
277 ({ const tree __t = t; \
278 if (TREE_CODE(__t) != (code)) \
279 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
281 #define TREE_CLASS_CHECK(t, class) __extension__ \
282 ({ const tree __t = t; \
283 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
284 tree_class_check_failed (__t, class, __FILE__, __LINE__, __FUNCTION__); \
287 /* These checks have to be special cased. */
288 #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
289 ({ const tree __t = t; \
290 enum tree_code __c = TREE_CODE(__t); \
291 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
292 tree_check_failed (__t, CONSTRUCTOR, __FILE__, __LINE__, __FUNCTION__); \
294 #define EXPR_CHECK(t) __extension__ \
295 ({ const tree __t = t; \
296 char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
297 if (__c != 'r' && __c != 's' && __c != '<' \
298 && __c != '1' && __c != '2' && __c != 'e') \
299 tree_class_check_failed(__t, 'e', __FILE__, __LINE__, __FUNCTION__); \
302 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
303 const char *, int, const char *))
305 extern void tree_class_check_failed PARAMS ((const tree, int,
306 const char *, int, const char *))
309 #else /* not ENABLE_TREE_CHECKING, or not gcc */
311 #define TREE_CHECK(t, code) (t)
312 #define TREE_CLASS_CHECK(t, code) (t)
313 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
314 #define EXPR_CHECK(t) (t)
318 #include "tree-check.h"
320 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
321 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
322 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
324 /* In all nodes that are expressions, this is the data type of the expression.
325 In POINTER_TYPE nodes, this is the type that the pointer points to.
326 In ARRAY_TYPE nodes, this is the type of the elements.
327 In VECTOR_TYPE nodes, this is the type of the elements. */
328 #define TREE_TYPE(NODE) ((NODE)->common.type)
330 /* Here is how primitive or already-canonicalized types' hash codes
332 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777)
334 /* Nodes are chained together for many purposes.
335 Types are chained together to record them for being output to the debugger
336 (see the function `chain_type').
337 Decls in the same scope are chained together to record the contents
339 Statement nodes for successive statements used to be chained together.
340 Often lists of things are represented by TREE_LIST nodes that
341 are chained together. */
343 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
345 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
346 that don't change the machine mode. */
348 #define STRIP_NOPS(EXP) \
349 while ((TREE_CODE (EXP) == NOP_EXPR \
350 || TREE_CODE (EXP) == CONVERT_EXPR \
351 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
352 && TREE_OPERAND (EXP, 0) != error_mark_node \
353 && (TYPE_MODE (TREE_TYPE (EXP)) \
354 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
355 (EXP) = TREE_OPERAND (EXP, 0);
357 /* Like STRIP_NOPS, but don't let the signedness change either. */
359 #define STRIP_SIGN_NOPS(EXP) \
360 while ((TREE_CODE (EXP) == NOP_EXPR \
361 || TREE_CODE (EXP) == CONVERT_EXPR \
362 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
363 && TREE_OPERAND (EXP, 0) != error_mark_node \
364 && (TYPE_MODE (TREE_TYPE (EXP)) \
365 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
366 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
367 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
368 (EXP) = TREE_OPERAND (EXP, 0);
370 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
372 #define STRIP_TYPE_NOPS(EXP) \
373 while ((TREE_CODE (EXP) == NOP_EXPR \
374 || TREE_CODE (EXP) == CONVERT_EXPR \
375 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
376 && TREE_OPERAND (EXP, 0) != error_mark_node \
377 && (TREE_TYPE (EXP) \
378 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
379 (EXP) = TREE_OPERAND (EXP, 0);
381 /* Nonzero if TYPE represents an integral type. Note that we do not
382 include COMPLEX types here. */
384 #define INTEGRAL_TYPE_P(TYPE) \
385 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
386 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
388 /* Nonzero if TYPE represents a floating-point type, including complex
389 floating-point types. */
391 #define FLOAT_TYPE_P(TYPE) \
392 (TREE_CODE (TYPE) == REAL_TYPE \
393 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
394 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
396 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
398 #define AGGREGATE_TYPE_P(TYPE) \
399 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
400 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
401 || TREE_CODE (TYPE) == SET_TYPE)
403 /* Nonzero if TYPE represents an unbounded pointer or unbounded
404 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
406 #define POINTER_TYPE_P(TYPE) \
407 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
409 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
411 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
412 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
414 /* Nonzero if TYPE represents a bounded pointer type. */
416 #define BOUNDED_POINTER_TYPE_P(TYPE) \
417 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
418 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
420 /* Nonzero if TYPE represents a bounded reference type. Bounded
421 reference types have two specific uses: (1) When a reference is
422 seated to a variable-length RECORD_TYPE that has an array of
423 indeterminate length as its final field. For all other objects, it
424 is sufficient to check bounds at the time the reference is seated,
425 and assume that all future uses of the reference are safe, since
426 the address of references cannot change. (2) When a reference
427 supertype is seated to an subtype object. The bounds "remember"
428 the true size of the complete object, so that subsequent upcasts of
429 the address of the reference will be checked properly (is such a
430 thing valid C++?). */
432 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
433 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
434 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
436 /* Nonzero if TYPE represents a pointer or reference type, either
437 bounded or unbounded. */
439 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
440 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
442 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
444 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
445 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
447 /* Nonzero if TYPE represents a reference type, either bounded or unbounded. */
449 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
450 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
452 /* Nonzero if this type is a complete type. */
453 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
455 /* Nonzero if this type is the (possibly qualified) void type. */
456 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
458 /* Nonzero if this type is complete or is cv void. */
459 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
460 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
462 /* Nonzero if this type is complete or is an array with unspecified bound. */
463 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
464 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE))
466 /* Nonzero if TYPE represents a type. */
468 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
470 /* Define many boolean fields that all tree nodes have. */
472 /* In VAR_DECL nodes, nonzero means address of this is needed.
473 So it cannot be in a register.
474 In a FUNCTION_DECL, nonzero means its address is needed.
475 So it must be compiled even if it is an inline function.
476 In a FIELD_DECL node, it means that the programmer is permitted to
477 construct the address of this field. This is used for aliasing
478 purposes: see record_component_aliases.
479 In CONSTRUCTOR nodes, it means object constructed must be in memory.
480 In LABEL_DECL nodes, it means a goto for this label has been seen
481 from a place outside all binding contours that restore stack levels.
482 In ..._TYPE nodes, it means that objects of this type must
483 be fully addressable. This means that pieces of this
484 object cannot go into register parameters, for example.
485 In IDENTIFIER_NODEs, this means that some extern decl for this name
486 had its address taken. That matters for inline functions. */
487 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
489 /* In a VAR_DECL, nonzero means allocate static storage.
490 In a FUNCTION_DECL, nonzero if function has been defined.
491 In a CONSTRUCTOR, nonzero means allocate static storage. */
492 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
494 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
495 made implicitly and should not lead to an "unused value" warning. */
496 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
498 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
499 chain is via a `virtual' declaration. */
500 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
502 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
503 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
504 requires a diagnostic when overflows occur in constant expressions. */
505 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
507 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
508 this string as an argument. */
509 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
511 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
512 overflow in folding, and no warning has been issued for this subexpression.
513 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
514 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
516 /* In a VAR_DECL or FUNCTION_DECL,
517 nonzero means name is to be accessible from outside this module.
518 In an IDENTIFIER_NODE, nonzero means an external declaration
519 accessible from outside this module was previously seen
520 for this name in an inner scope. */
521 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
523 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
524 base class is via a `public' declaration, which preserves public
525 fields from the base class as public. */
526 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
528 /* Ditto, for `private' declarations. */
529 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
531 /* Nonzero for TREE_LIST node means that the path to the
532 base class is via a `protected' declaration, which preserves
533 protected fields from the base class as protected.
535 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
537 /* In any expression, nonzero means it has side effects or reevaluation
538 of the whole expression could produce a different value.
539 This is set if any subexpression is a function call, a side effect
540 or a reference to a volatile variable.
541 In a ..._DECL, this is set only if the declaration said `volatile'. */
542 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
544 /* Nonzero means this expression is volatile in the C sense:
545 its address should be of type `volatile WHATEVER *'.
546 In other words, the declared item is volatile qualified.
547 This is used in _DECL nodes and _REF nodes.
549 In a ..._TYPE node, means this type is volatile-qualified.
550 But use TYPE_VOLATILE instead of this macro when the node is a type,
551 because eventually we may make that a different bit.
553 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
554 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
556 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
557 nonzero means it may not be the lhs of an assignment.
558 In a ..._TYPE node, means this type is const-qualified
559 (but the macro TYPE_READONLY should be used instead of this macro
560 when the node is a type). */
561 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
563 /* Value of expression is constant.
564 Always appears in all ..._CST nodes.
565 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
566 if the value is constant. */
567 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
569 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
570 In FIELD_DECL nodes, means an unsigned bit field.
571 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
572 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
574 #define TYPE_TRAP_SIGNED(NODE) (flag_trapv && ! TREE_UNSIGNED (NODE))
576 /* Nonzero in a VAR_DECL means assembler code has been written.
577 Nonzero in a FUNCTION_DECL means that the function has been compiled.
578 This is interesting in an inline function, since it might not need
579 to be compiled separately.
580 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
581 if the sdb debugging info for the type has been written.
582 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
583 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
585 /* Nonzero in a _DECL if the name is used in its scope.
586 Nonzero in an expr node means inhibit warning if value is unused.
587 In IDENTIFIER_NODEs, this means that some extern decl for this name
589 #define TREE_USED(NODE) ((NODE)->common.used_flag)
591 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
592 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
593 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
595 /* Used in classes in C++. */
596 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
597 /* Used in classes in C++.
598 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
599 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
601 /* In a ..._TYPE node, nonzero means that the type's size and layout,
602 (or the size and layout of its arguments and/or return value in the
603 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
604 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
605 node is a type, because eventually we may make that a different
606 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
607 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
608 BOUNDED_INDIRECT_TYPE_P to test for that.
610 In a FUNCTION_DECL, nonzero means that the size and layout of one
611 of its arguments and/or return value was changed by the presence of
612 pointer bounds. This value can differ from the value of
613 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
614 declared, then later called with pointer args, or was declared with
615 a variable argument list and is later called with pointer values in
616 the variable argument list.
618 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
619 of the decl's type's BOUNDED_POINTER_TYPE_P.
621 In a CONSTRUCTOR or other expression, nonzero means the value is a
622 bounded pointer. It is insufficient to determine the boundedness
623 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
624 since we allow pointer to be temporarily cast to integer for
625 rounding up to an alignment boudary in a way that preserves the
628 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
629 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
630 of a function that has bounded pointer(s) for its return type and/or
633 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
635 /* These flags are available for each language front end to use internally. */
636 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
637 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
638 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
639 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
640 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
641 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
642 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
644 /* Define additional fields and accessors for nodes representing constants. */
646 /* In an INTEGER_CST node. These two together make a 2-word integer.
647 If the data type is signed, the value is sign-extended to 2 words
648 even though not all of them may really be in use.
649 In an unsigned constant shorter than 2 words, the extra bits are 0. */
650 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
651 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
652 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
654 #define INT_CST_LT(A, B) \
655 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
656 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
657 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
659 #define INT_CST_LT_UNSIGNED(A, B) \
660 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
661 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
662 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
663 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
664 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
668 struct tree_common common;
669 rtx rtl; /* acts as link to register transfer language
671 /* A sub-struct is necessary here because the function `const_hash'
672 wants to scan both words as a unit and taking the address of the
673 sub-struct yields the properly inclusive bounded pointer. */
675 unsigned HOST_WIDE_INT low;
680 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
681 and generally in all kinds of constants that could
682 be given labels (rather than being immediate). */
684 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
686 /* In a REAL_CST node. */
687 /* We can represent a real value as either a `double' or a string.
688 Strings don't allow for any optimization, but they do allow
689 for cross-compilation. */
691 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
697 struct tree_common common;
698 rtx rtl; /* acts as link to register transfer language
700 REAL_VALUE_TYPE real_cst;
703 /* In a STRING_CST */
704 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
705 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
709 struct tree_common common;
710 rtx rtl; /* acts as link to register transfer language
716 /* In a COMPLEX_CST node. */
717 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
718 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
722 struct tree_common common;
723 rtx rtl; /* acts as link to register transfer language
729 #include "hashtable.h"
731 /* Define fields and accessors for some special-purpose tree nodes. */
733 #define IDENTIFIER_LENGTH(NODE) \
734 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
735 #define IDENTIFIER_POINTER(NODE) \
736 ((char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
738 /* Translate a hash table identifier pointer to a tree_identifier
739 pointer, and vice versa. */
741 #define HT_IDENT_TO_GCC_IDENT(NODE) \
742 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
743 #define GCC_IDENT_TO_HT_IDENT(NODE) \
744 (&((struct tree_identifier *) (NODE))->id)
746 struct tree_identifier
748 struct tree_common common;
749 struct ht_identifier id;
752 /* In a TREE_LIST node. */
753 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
754 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
758 struct tree_common common;
763 /* In a TREE_VEC node. */
764 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
765 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
766 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
770 struct tree_common common;
775 /* Define fields and accessors for some nodes that represent expressions. */
777 /* In a SAVE_EXPR node. */
778 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
779 #define SAVE_EXPR_RTL(NODE) (*(rtx *) &EXPR_CHECK (NODE)->exp.operands[2])
780 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
781 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
782 both in normal code and in a handler. (Normally, in a handler, all
783 SAVE_EXPRs are unsaved, meaning that there values are
785 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE)
787 /* In a RTL_EXPR node. */
788 #define RTL_EXPR_SEQUENCE(NODE) (*(rtx *) &EXPR_CHECK (NODE)->exp.operands[0])
789 #define RTL_EXPR_RTL(NODE) (*(rtx *) &EXPR_CHECK (NODE)->exp.operands[1])
791 /* In a WITH_CLEANUP_EXPR node. */
792 #define WITH_CLEANUP_EXPR_RTL(NODE) \
793 (*(rtx *) &EXPR_CHECK (NODE)->exp.operands[2])
795 /* In a CONSTRUCTOR node. */
796 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
798 /* In ordinary expression nodes. */
799 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
800 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
802 /* In a LABELED_BLOCK_EXPR node. */
803 #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
804 #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
806 /* In a EXIT_BLOCK_EXPR node. */
807 #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
808 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
810 /* In a LOOP_EXPR node. */
811 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
813 /* In a EXPR_WITH_FILE_LOCATION node. */
814 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
815 #define EXPR_WFL_FILENAME(NODE) \
816 (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE))))
817 #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1)
818 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
819 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
820 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
821 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
822 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
823 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
827 struct tree_common common;
832 /* In a BLOCK node. */
833 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
834 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
835 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
836 /* Note: when changing this, make sure to find the places
837 that use chainon or nreverse. */
838 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
839 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
840 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
842 /* Nonzero means that this block is prepared to handle exceptions
843 listed in the BLOCK_VARS slot. */
844 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
846 /* An index number for this block. These values are not guaranteed to
847 be unique across functions -- whether or not they are depends on
848 the debugging output format in use. */
849 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
851 /* If block reordering splits a lexical block into discontiguous
852 address ranges, we'll make a copy of the original block.
854 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
855 In that case, we have one source block that has been replicated
856 (through inlining or unrolling) into many logical blocks, and that
857 these logical blocks have different physical variables in them.
859 In this case, we have one logical block split into several
860 non-contiguous address ranges. Most debug formats can't actually
861 represent this idea directly, so we fake it by creating multiple
862 logical blocks with the same variables in them. However, for those
863 that do support non-contiguous regions, these allow the original
864 logical block to be reconstructed, along with the set of address
867 One of the logical block fragments is arbitrarily chosen to be
868 the ORIGIN. The other fragments will point to the origin via
869 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
870 be null. The list of fragments will be chained through
871 BLOCK_FRAGMENT_CHAIN from the origin. */
873 #define BLOCK_FRAGMENT_ORIGIN(NODE) \
874 (BLOCK_CHECK (NODE)->block.fragment_origin)
875 #define BLOCK_FRAGMENT_CHAIN(NODE) \
876 (BLOCK_CHECK (NODE)->block.fragment_chain)
880 struct tree_common common;
882 unsigned handler_block_flag : 1;
883 unsigned abstract_flag : 1;
884 unsigned block_num : 30;
889 tree abstract_origin;
890 tree fragment_origin;
894 /* Define fields and accessors for nodes representing data types. */
896 /* See tree.def for documentation of the use of these fields.
897 Look at the documentation of the various ..._TYPE tree codes. */
899 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
900 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
901 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
902 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
903 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
904 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
905 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
906 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
907 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
908 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
909 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
910 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
911 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
912 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
913 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
914 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
915 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
916 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
917 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
918 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
919 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
920 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
921 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
922 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
924 /* For a VECTOR_TYPE node, this describes a different type which is emitted
925 in the debugging output. We use this to describe a vector as a
926 structure containing an array. */
927 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
929 /* Indirect types present difficulties because they may be represented
930 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
931 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
932 be logically equivalent, but physically different. Simple
933 comparison of the main variant only tells if the types are
934 logically equivalent. Use this predicate to compare for physical
937 /* Types have the same main variant, and have the same boundedness. */
938 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
939 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
940 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
942 /* Return the type variant that has no qualifiers (i.e., the main variant),
943 except that the boundedness qualifier is preserved. */
944 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
945 (BOUNDED_POINTER_TYPE_P (TYPE) \
946 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
947 : TYPE_MAIN_VARIANT (TYPE))
949 /* For aggregate types, information about this type, as a base type
950 for itself. Used in a language-dependent way for types that are
951 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
952 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
954 /* The (language-specific) typed-based alias set for this type.
955 Objects whose TYPE_ALIAS_SETs are different cannot alias each
956 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
957 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
958 type can alias objects of any type. */
959 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
961 /* Nonzero iff the typed-based alias set for this type has been
963 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
964 (TYPE_CHECK (NODE)->type.alias_set != -1)
966 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
968 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
970 /* The alignment necessary for objects of this type.
971 The value is an int, measured in bits. */
972 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
974 /* 1 if the alignment for this type was requested by "aligned" attribute,
975 0 if it is the default for this type. */
976 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
978 /* The alignment for NODE, in bytes. */
979 #define TYPE_ALIGN_UNIT(NODE) \
980 (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
982 /* If your language allows you to declare types, and you want debug info
983 for them, then you need to generate corresponding TYPE_DECL nodes.
984 These "stub" TYPE_DECL nodes have no name, and simply point at the
985 type node. You then set the TYPE_STUB_DECL field of the type node
986 to point back at the TYPE_DECL node. This allows the debug routines
987 to know that the two nodes represent the same type, so that we only
988 get one debug info record for them. */
989 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
991 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
992 has BLKmode only because it lacks the alignment requirement for
994 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
996 /* In an INTEGER_TYPE, it means the type represents a size. We use
997 this both for validity checking and to permit optimizations that
998 are unsafe for other types. Note that the C `size_t' type should
999 *not* have this flag set. The `size_t' type is simply a typedef
1000 for an ordinary integer type that happens to be the type of an
1001 expression returned by `sizeof'; `size_t' has no special
1002 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1003 always actual sizes. */
1004 #define TYPE_IS_SIZETYPE(NODE) \
1005 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1007 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1008 pointer depressed. */
1009 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1010 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1012 /* Nonzero in a type considered volatile as a whole. */
1013 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
1015 /* Means this type is const-qualified. */
1016 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
1018 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1020 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1022 /* If nonzero, this type's size and layout, (or the size and layout of
1023 its arguments and/or return value in the case of a FUNCTION_TYPE or
1024 METHOD_TYPE) was changed by the presence of pointer bounds. */
1025 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
1027 /* There is a TYPE_QUAL value for each type qualifier. They can be
1028 combined by bitwise-or to form the complete set of qualifiers for a
1031 #define TYPE_UNQUALIFIED 0x0
1032 #define TYPE_QUAL_CONST 0x1
1033 #define TYPE_QUAL_VOLATILE 0x2
1034 #define TYPE_QUAL_RESTRICT 0x4
1035 #define TYPE_QUAL_BOUNDED 0x8
1037 /* The set of type qualifiers for this type. */
1038 #define TYPE_QUALS(NODE) \
1039 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1040 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1041 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1042 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1044 /* The set of qualifiers pertinent to an expression node. */
1045 #define TREE_EXPR_QUALS(NODE) \
1046 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1047 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1048 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1050 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1051 #define TREE_FUNC_QUALS(NODE) \
1052 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1053 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1055 /* These flags are available for each language front end to use internally. */
1056 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1057 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1058 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1059 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1060 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1061 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1062 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1064 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1065 that distinguish string from array of char).
1066 If set in a SET_TYPE, indicates a bitstring type. */
1067 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1069 /* If non-NULL, this is a upper bound of the size (in bytes) of an
1070 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
1071 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
1073 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1074 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) (GET_MODE_NUNITS (TYPE_CHECK (VECTOR_TYPE)->type.mode))
1076 /* Indicates that objects of this type must be initialized by calling a
1077 function when they are created. */
1078 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1079 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1081 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1082 the same way that the first union alternative would be passed. */
1083 #define TYPE_TRANSPARENT_UNION(NODE) \
1084 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1086 /* For an ARRAY_TYPE, indicates that it is not permitted to
1087 take the address of a component of the type. */
1088 #define TYPE_NONALIASED_COMPONENT(NODE) \
1089 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1091 /* Indicated that objects of this type should be laid out in as
1092 compact a way as possible. */
1093 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1095 /* A bounded pointer or bounded reference type (collectively called
1096 indirect types) is represented as a RECORD_TYPE node containing
1097 three pointer fields whose type is the corresponding unbounded
1098 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1099 a bounded indirect type differs from a normal RECORD_TYPE node in
1100 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1101 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1102 nodes are stored on the same type variant chain alongside the
1103 variants of the underlaying indirect types nodes. The main variant
1104 of such chains is always the unbounded type. */
1106 /* Access the field decls of a bounded-pointer type. */
1107 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1108 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1109 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1111 /* Access the simple-pointer subtype of a bounded-pointer type. */
1112 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1114 /* Find the unbounded counterpart to a type, or return TYPE if it is
1115 already unbounded. */
1116 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1117 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1119 /* This field comprises two bits, for values in the range 0..3:
1121 depth=0 means that type is a scalar, or an aggregate that contains
1122 only depth=0 types, or a function that has only depth=0 types for
1123 its return value and argument types.
1125 depth=1 means that type is a pointer to a depth=0 type, or an
1126 aggregate that contains only depth=0 and depth=1 types, or a
1127 function that has only depth=0 and depth=1 types for its return
1128 value and argument types.
1130 The meanings of depth=2 and depth=3 are obvious by induction.
1131 Varargs functions are depth=3. The type `va_list' is depth=3.
1133 The purpose of measuring pointer depth of a type is to determine
1134 the eligibility of a function for an automatically-generated
1135 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1136 depth=1 function is eligible for an automatic thunk. Functions
1137 with depth 2 or more are too complex to get automatic thunks.
1139 Function decls also have a pointer_depth field, since we also
1140 consider the actual argument types for functions. */
1142 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1144 /* In a FUNCTION_TYPE node, this bit stores the value of
1145 default_pointer_boundedness at the time TYPE was created. It is
1146 useful for choosing default boundedness of function arguments for
1147 non-prototype function decls and for varargs/stdarg lists. */
1148 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1149 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1151 #define MAX_POINTER_DEPTH 2
1152 #define VA_LIST_POINTER_DEPTH 3
1156 struct tree_common common;
1163 unsigned int precision : 9;
1164 ENUM_BITFIELD(machine_mode) mode : 7;
1166 unsigned string_flag : 1;
1167 unsigned no_force_blk_flag : 1;
1168 unsigned needs_constructing_flag : 1;
1169 unsigned transparent_union_flag : 1;
1170 unsigned packed_flag : 1;
1171 unsigned restrict_flag : 1;
1172 unsigned pointer_depth : 2;
1174 unsigned lang_flag_0 : 1;
1175 unsigned lang_flag_1 : 1;
1176 unsigned lang_flag_2 : 1;
1177 unsigned lang_flag_3 : 1;
1178 unsigned lang_flag_4 : 1;
1179 unsigned lang_flag_5 : 1;
1180 unsigned lang_flag_6 : 1;
1181 unsigned user_align : 1;
1186 union {int address; char *pointer; } symtab;
1194 HOST_WIDE_INT alias_set;
1195 /* Points to a structure whose details depend on the language in use. */
1196 struct lang_type *lang_specific;
1199 /* Define accessor macros for information about type inheritance
1202 A "basetype" means a particular usage of a data type for inheritance
1203 in another type. Each such basetype usage has its own "binfo"
1204 object to describe it. The binfo object is a TREE_VEC node.
1206 Inheritance is represented by the binfo nodes allocated for a
1207 given type. For example, given types C and D, such that D is
1208 inherited by C, 3 binfo nodes will be allocated: one for describing
1209 the binfo properties of C, similarly one for D, and one for
1210 describing the binfo properties of D as a base type for C.
1211 Thus, given a pointer to class C, one can get a pointer to the binfo
1212 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1214 /* The actual data type node being inherited in this basetype. */
1215 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1217 /* The offset where this basetype appears in its containing type.
1218 BINFO_OFFSET slot holds the offset (in bytes)
1219 from the base of the complete object to the base of the part of the
1220 object that is allocated on behalf of this `type'.
1221 This is always 0 except when there is multiple inheritance. */
1223 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1224 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1225 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1227 /* The virtual function table belonging to this basetype. Virtual
1228 function tables provide a mechanism for run-time method dispatching.
1229 The entries of a virtual function table are language-dependent. */
1231 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1232 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1234 /* The virtual functions in the virtual function table. This is
1235 a TREE_LIST that is used as an initial approximation for building
1236 a virtual function table for this basetype. */
1237 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1238 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1240 /* A vector of binfos for the direct basetypes inherited by this
1243 If this basetype describes type D as inherited in C, and if the
1244 basetypes of D are E and F, then this vector contains binfos for
1245 inheritance of E and F by C.
1247 ??? This could probably be done by just allocating the
1248 base types at the end of this TREE_VEC (instead of using
1249 another TREE_VEC). This would simplify the calculation
1250 of how many basetypes a given type had. */
1251 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1252 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1254 /* The number of basetypes for NODE. */
1255 #define BINFO_N_BASETYPES(NODE) \
1256 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1258 /* Accessor macro to get to the Nth basetype of this basetype. */
1259 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1260 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1262 /* For a BINFO record describing a virtual base class, i.e., one where
1263 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1264 base. The actual contents are language-dependent. Under the old
1265 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1266 pointer to the virtual base; under the new ABI this field is
1267 instead a INTEGER_CST giving an offset into the vtable where the
1268 offset to the virtual base can be found. */
1269 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
1271 /* The size of a base class subobject of this type. Not all frontends
1272 currently allocate the space for these fields. */
1273 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
1274 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7)
1275 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1276 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1278 /* Slot used to build a chain that represents a use of inheritance.
1279 For example, if X is derived from Y, and Y is derived from Z,
1280 then this field can be used to link the binfo node for X to
1281 the binfo node for X's Y to represent the use of inheritance
1282 from X to Y. Similarly, this slot of the binfo node for X's Y
1283 can point to the Z from which Y is inherited (in X's inheritance
1284 hierarchy). In this fashion, one can represent and traverse specific
1285 uses of inheritance using the binfo nodes themselves (instead of
1286 consing new space pointing to binfo nodes).
1287 It is up to the language-dependent front-ends to maintain
1288 this information as necessary. */
1289 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1291 /* Define fields and accessors for nodes representing declared names. */
1293 /* Nonzero if DECL represents a decl. */
1294 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1295 /* This is the name of the object as written by the user.
1296 It is an IDENTIFIER_NODE. */
1297 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1298 /* The name of the object as the assembler will see it (but before any
1299 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1300 as DECL_NAME. It is an IDENTIFIER_NODE. */
1301 #define DECL_ASSEMBLER_NAME(NODE) \
1302 ((DECL_ASSEMBLER_NAME_SET_P (NODE) \
1304 : (*lang_set_decl_assembler_name) (NODE)), \
1305 DECL_CHECK (NODE)->decl.assembler_name)
1306 /* Returns non-zero if the DECL_ASSEMBLER_NAME for NODE has been
1307 set. If zero, the NODE might still have a DECL_ASSEMBLER_NAME --
1308 it just hasn't been set yet. */
1309 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1310 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1311 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1312 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1313 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1314 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if
1315 DECL1's DECL_ASSEMBLER_NAME has not yet been set, using this macro
1316 will not cause the DECL_ASSEMBLER_NAME of either DECL to be set.
1317 In other words, the semantics of using this macro, are different
1320 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1322 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1323 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1324 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1325 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1326 DECL_ASSEMBLER_NAME (DECL1)) \
1329 /* Records the section name in a section attribute. Used to pass
1330 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1331 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1332 /* For FIELD_DECLs, this is the
1333 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1334 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1335 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1336 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1337 type, or NULL_TREE if the given decl has "file scope". */
1338 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1339 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1340 /* In a DECL this is the field where attributes are stored. */
1341 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1342 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1343 byte containing the bit closest to the beginning of the structure. */
1344 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1345 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1346 field from DECL_FIELD_OFFSET. */
1347 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1348 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1349 if so, the type that was originally specified for it.
1350 TREE_TYPE may have been modified (in finish_struct). */
1351 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1352 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1353 /* VAR_DECL and PARM_DECL reserve the arguments slot
1354 for language-specific uses. */
1355 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1356 /* This field is used to reference anything in decl.result and is meant only
1357 for use by the garbage collector. */
1358 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1359 /* In FUNCTION_DECL, holds the decl for the return value. */
1360 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1361 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1362 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1363 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1364 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1365 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1366 For a VAR_DECL, holds the initial value.
1367 For a PARM_DECL, not used--default
1368 values for parameters are encoded in the type of the function,
1369 not in the PARM_DECL slot. */
1370 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1371 /* For a PARM_DECL, records the data type used to pass the argument,
1372 which may be different from the type seen in the program. */
1373 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1374 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1375 if nonzero, indicates that the field occupies the type. */
1376 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1377 /* These two fields describe where in the source code the declaration
1378 was. If the declaration appears in several places (as for a C
1379 function that is declared first and then defined later), this
1380 information should refer to the definition. */
1381 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1382 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1383 /* Holds the size of the datum, in bits, as a tree expression.
1384 Need not be constant. */
1385 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1386 /* Likewise for the size in bytes. */
1387 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1388 /* Holds the alignment required for the datum, in bits. */
1389 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1390 /* The alignment of NODE, in bytes. */
1391 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1392 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1393 DECL_FIELD_OFFSET which are known to be always zero.
1394 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1396 #define DECL_OFFSET_ALIGN(NODE) \
1397 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1398 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1399 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1400 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1401 /* 1 if the alignment for this type was requested by "aligned" attribute,
1402 0 if it is the default for this type. */
1403 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1404 /* Holds the machine mode corresponding to the declaration of a variable or
1405 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1407 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1408 /* Holds the RTL expression for the value of a variable or function. If
1409 PROMOTED_MODE is defined, the mode of this expression may not be same
1410 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1411 to the variable's data type, while the mode
1412 of DECL_RTL is the mode actually used to contain the data.
1414 This value can be evaluated lazily for functions, variables with
1415 static storage duration, and labels. */
1416 #define DECL_RTL(NODE) \
1417 (DECL_CHECK (NODE)->decl.rtl \
1418 ? (NODE)->decl.rtl \
1419 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1420 /* Set the DECL_RTL for NODE to RTL. */
1421 #define SET_DECL_RTL(NODE, RTL) \
1422 (DECL_CHECK (NODE)->decl.rtl = (RTL))
1423 /* Returns non-zero if the DECL_RTL for NODE has already been set. */
1424 #define DECL_RTL_SET_P(NODE) \
1425 (DECL_CHECK (NODE)->decl.rtl != NULL)
1426 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1427 NODE1, it will not be set for NODE2; this is a lazy copy. */
1428 #define COPY_DECL_RTL(NODE1, NODE2) \
1429 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1430 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1431 #define DECL_RTL_IF_SET(NODE) \
1432 (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1433 /* Holds an INSN_LIST of all of the live ranges in which the variable
1434 has been moved to a possibly different register. */
1435 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1436 /* For PARM_DECL, holds an RTL for the stack slot or register
1437 where the data was actually passed. */
1438 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1439 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1440 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1441 /* For FUNCTION_DECL, if it is built-in,
1442 this identifies which built-in operation it is. */
1443 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1445 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1446 Before the struct containing the FUNCTION_DECL is laid out,
1447 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1448 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1449 function. When the class is laid out, this pointer is changed
1450 to an INTEGER_CST node which is suitable for use as an index
1451 into the virtual function table. */
1452 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1453 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1454 which this FIELD_DECL is defined. This information is needed when
1455 writing debugging information about vfield and vbase decls for C++. */
1456 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1458 /* Every ..._DECL node gets a unique number. */
1459 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1461 /* For any sort of a ..._DECL node, this points to the original (abstract)
1462 decl node which this decl is an instance of, or else it is NULL indicating
1463 that this decl is not an instance of some other decl. For example,
1464 in a nested declaration of an inline function, this points back to the
1466 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1468 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1469 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1470 #define DECL_ORIGIN(NODE) \
1471 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1473 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1474 inline instance of some original (abstract) decl from an inline function;
1475 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1476 nodes can also have their abstract origin set to themselves. */
1477 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
1478 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1480 /* Nonzero if a _DECL means that the name of this decl should be ignored
1481 for symbolic debug purposes. */
1482 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1484 /* Nonzero for a given ..._DECL node means that this node represents an
1485 "abstract instance" of the given declaration (e.g. in the original
1486 declaration of an inline function). When generating symbolic debugging
1487 information, we mustn't try to generate any address information for nodes
1488 marked as "abstract instances" because we don't actually generate
1489 any code or allocate any data space for such instances. */
1490 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1492 /* Nonzero if a _DECL means that no warnings should be generated just
1493 because this decl is unused. */
1494 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1496 /* Nonzero for a given ..._DECL node means that this node should be
1497 put in .common, if possible. If a DECL_INITIAL is given, and it
1498 is not error_mark_node, then the decl cannot be put in .common. */
1499 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1501 /* Language-specific decl information. */
1502 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1504 /* In a VAR_DECL or FUNCTION_DECL,
1505 nonzero means external reference:
1506 do not allocate storage, and refer to a definition elsewhere. */
1507 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1509 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1511 #define DEFAULT_INIT_PRIORITY 65535
1512 #define MAX_INIT_PRIORITY 65535
1513 #define MAX_RESERVED_INIT_PRIORITY 100
1516 nonzero means the detail info about this type is not dumped into stabs.
1517 Instead it will generate cross reference ('x') of names.
1518 This uses the same flag as DECL_EXTERNAL. */
1519 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1520 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1522 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1523 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1524 /* In LABEL_DECL nodes, nonzero means that an error message about
1525 jumping into such a binding contour has been printed for this label. */
1526 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1527 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1528 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1529 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1530 static chain is not needed. */
1531 #define DECL_NO_STATIC_CHAIN(NODE) \
1532 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1534 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1535 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1537 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1539 Also set in some languages for variables, etc., outside the normal
1540 lexical scope, such as class instance variables. */
1541 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1543 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1544 where it is called. */
1545 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1547 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1548 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1550 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1551 that is not specified by ansi C and that users are supposed to be allowed
1552 to redefine for any purpose whatever. */
1553 #define DECL_BUILT_IN_NONANSI(NODE) \
1554 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1556 /* Nonzero in a FUNCTION_DECL means this function should be treated
1557 as if it were a malloc, meaning it returns a pointer that is
1559 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1561 /* Nonzero in a FUNCTION_DECL means this function should be treated
1562 as "pure" function (like const function, but may read global memory). */
1563 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1565 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1567 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1568 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1569 contour that restored a stack level and which is now exited. */
1570 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1572 /* Unused in FUNCTION_DECL. */
1574 /* In a VAR_DECL that's static,
1575 nonzero if the space is in the text section. */
1576 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1578 /* In a FUNCTION_DECL, nonzero means a built in function. */
1579 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1580 /* For a builtin function, identify which part of the compiler defined it. */
1581 #define DECL_BUILT_IN_CLASS(NODE) \
1582 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1584 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1585 Used in FIELD_DECLs for vtable pointers.
1586 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1587 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1589 /* Used to indicate that the linkage status of this DECL is not yet known,
1590 so it should not be output now. */
1591 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1593 /* Used in PARM_DECLs whose type are unions to indicate that the
1594 argument should be passed in the same way that the first union
1595 alternative would be passed. */
1596 #define DECL_TRANSPARENT_UNION(NODE) \
1597 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1599 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1600 at the beginning or end of execution. */
1601 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1602 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1604 #define DECL_STATIC_DESTRUCTOR(NODE) \
1605 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1607 /* Used to indicate that this DECL represents a compiler-generated entity. */
1608 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1610 /* Used to indicate that this DECL has weak linkage. */
1611 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1613 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1614 multiple translation units should be merged. */
1615 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1617 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1618 not be put out unless it is needed in this translation unit.
1619 Entities like this are shared across translation units (like weak
1620 entities), but are guaranteed to be generated by any translation
1621 unit that needs them, and therefore need not be put out anywhere
1622 where they are not needed. DECL_COMDAT is just a hint to the
1623 back-end; it is up to front-ends which set this flag to ensure
1624 that there will never be any harm, other than bloat, in putting out
1625 something which is DECL_COMDAT. */
1626 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1628 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1629 be instrumented with calls to support routines. */
1630 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1631 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1633 /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be
1634 disabled in this function. */
1635 #define DECL_NO_CHECK_MEMORY_USAGE(NODE) \
1636 (FUNCTION_DECL_CHECK (NODE)->decl.no_check_memory_usage)
1638 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1639 disabled in this function. */
1640 #define DECL_NO_LIMIT_STACK(NODE) \
1641 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1643 /* Additional flags for language-specific uses. */
1644 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1645 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1646 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1647 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1648 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1649 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1650 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1651 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1653 /* Used to indicate that the pointer to this DECL cannot be treated as
1654 an address constant. */
1655 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1657 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1659 #define DECL_NONADDRESSABLE_P(NODE) \
1660 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1662 /* Used to indicate an alias set for the memory pointed to by this
1663 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1664 pointer (or reference) type. */
1665 #define DECL_POINTER_ALIAS_SET(NODE) \
1666 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1668 /* Nonzero if an alias set has been assigned to this declaration. */
1669 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1670 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1672 /* The pointer_depth field comprises two bits for values in the range
1673 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1674 type node, but for functions it migth be greater. For example,
1675 this can happen when the function is declared to accept a parameter
1676 of type void* (depth=1), but is actually called with an argument of
1677 type foo** (depth=2). The function type will get the formal
1678 parameter's depth, but the function decl will get the actual
1679 argument's depth. */
1680 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1686 struct tree_common common;
1687 const char *filename;
1691 ENUM_BITFIELD(machine_mode) mode : 8;
1693 unsigned external_flag : 1;
1694 unsigned nonlocal_flag : 1;
1695 unsigned regdecl_flag : 1;
1696 unsigned inline_flag : 1;
1697 unsigned bit_field_flag : 1;
1698 unsigned virtual_flag : 1;
1699 unsigned ignored_flag : 1;
1700 unsigned abstract_flag : 1;
1702 unsigned in_system_header_flag : 1;
1703 unsigned common_flag : 1;
1704 unsigned defer_output : 1;
1705 unsigned transparent_union : 1;
1706 unsigned static_ctor_flag : 1;
1707 unsigned static_dtor_flag : 1;
1708 unsigned artificial_flag : 1;
1709 unsigned weak_flag : 1;
1711 unsigned non_addr_const_p : 1;
1712 unsigned no_instrument_function_entry_exit : 1;
1713 unsigned no_check_memory_usage : 1;
1714 unsigned comdat_flag : 1;
1715 unsigned malloc_flag : 1;
1716 unsigned no_limit_stack : 1;
1717 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1719 unsigned pure_flag : 1;
1720 unsigned pointer_depth : 2;
1721 unsigned non_addressable : 1;
1722 unsigned user_align : 1;
1723 unsigned uninlinable : 1;
1724 /* Two unused bits. */
1726 unsigned lang_flag_0 : 1;
1727 unsigned lang_flag_1 : 1;
1728 unsigned lang_flag_2 : 1;
1729 unsigned lang_flag_3 : 1;
1730 unsigned lang_flag_4 : 1;
1731 unsigned lang_flag_5 : 1;
1732 unsigned lang_flag_6 : 1;
1733 unsigned lang_flag_7 : 1;
1736 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1737 DECL_FUNCTION_CODE. */
1738 enum built_in_function f;
1739 /* In a FUNCITON_DECL for which DECL_BUILT_IN does not hold, this
1740 is used by language-dependent code. */
1742 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1744 struct {unsigned int align : 24; unsigned int off_align : 8;} a;
1750 tree arguments; /* Also used for DECL_FIELD_OFFSET */
1751 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
1752 tree initial; /* Also used for DECL_QUALIFIER */
1753 tree abstract_origin;
1754 tree assembler_name;
1757 rtx rtl; /* RTL representation for object. */
1760 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1761 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1762 In PARM_DECL, holds an RTL for the stack slot
1763 of register where the data was actually passed.
1764 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1773 HOST_WIDE_INT pointer_alias_set;
1774 /* Points to a structure whose details depend on the language in use. */
1775 struct lang_decl *lang_specific;
1778 /* Define the overall contents of a tree node.
1779 It may be any of the structures declared above
1780 for various types of node. */
1784 struct tree_common common;
1785 struct tree_int_cst int_cst;
1786 struct tree_real_cst real_cst;
1787 struct tree_string string;
1788 struct tree_complex complex;
1789 struct tree_identifier identifier;
1790 struct tree_decl decl;
1791 struct tree_type type;
1792 struct tree_list list;
1793 struct tree_vec vec;
1794 struct tree_exp exp;
1795 struct tree_block block;
1798 /* Standard named or nameless data types of the C compiler. */
1817 TI_INTEGER_MINUS_ONE,
1827 TI_COMPLEX_INTEGER_TYPE,
1828 TI_COMPLEX_FLOAT_TYPE,
1829 TI_COMPLEX_DOUBLE_TYPE,
1830 TI_COMPLEX_LONG_DOUBLE_TYPE,
1834 TI_LONG_DOUBLE_TYPE,
1855 extern tree global_trees[TI_MAX];
1857 #define error_mark_node global_trees[TI_ERROR_MARK]
1859 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1860 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1861 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1862 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1863 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1865 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1866 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1867 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1868 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1869 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1871 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1872 #define integer_one_node global_trees[TI_INTEGER_ONE]
1873 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
1874 #define size_zero_node global_trees[TI_SIZE_ZERO]
1875 #define size_one_node global_trees[TI_SIZE_ONE]
1876 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1877 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1878 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1880 #define null_pointer_node global_trees[TI_NULL_POINTER]
1882 #define float_type_node global_trees[TI_FLOAT_TYPE]
1883 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1884 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1886 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1887 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1888 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1889 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1891 #define void_type_node global_trees[TI_VOID_TYPE]
1892 /* The C type `void *'. */
1893 #define ptr_type_node global_trees[TI_PTR_TYPE]
1894 /* The C type `const void *'. */
1895 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1896 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1897 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1899 /* The node that should be placed at the end of a parameter list to
1900 indicate that the function does not take a variable number of
1901 arguments. The TREE_VALUE will be void_type_node and there will be
1902 no TREE_CHAIN. Language-independent code should not assume
1903 anything else about this node. */
1904 #define void_list_node global_trees[TI_VOID_LIST_NODE]
1906 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
1907 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
1909 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
1910 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
1911 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
1912 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
1913 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
1915 /* An enumeration of the standard C integer types. These must be
1916 ordered so that shorter types appear before longer ones. */
1917 enum integer_type_kind
1929 itk_unsigned_long_long,
1933 typedef enum integer_type_kind integer_type_kind;
1935 /* The standard C integer types. Use integer_type_kind to index into
1937 extern tree integer_types[itk_none];
1939 #define char_type_node integer_types[itk_char]
1940 #define signed_char_type_node integer_types[itk_signed_char]
1941 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1942 #define short_integer_type_node integer_types[itk_short]
1943 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1944 #define integer_type_node integer_types[itk_int]
1945 #define unsigned_type_node integer_types[itk_unsigned_int]
1946 #define long_integer_type_node integer_types[itk_long]
1947 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1948 #define long_long_integer_type_node integer_types[itk_long_long]
1949 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1952 #define NULL_TREE (tree) NULL
1954 /* Approximate positive square root of a host double. This is for
1955 statistical reports, not code generation. */
1956 extern double approx_sqrt PARAMS ((double));
1958 extern char *permalloc PARAMS ((int));
1959 extern char *expralloc PARAMS ((int));
1961 /* Compute the number of bytes occupied by 'node'. This routine only
1962 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
1964 extern size_t tree_size PARAMS ((tree));
1966 /* Lowest level primitive for allocating a node.
1967 The TREE_CODE is the only argument. Contents are initialized
1968 to zero except for a few of the common fields. */
1970 extern tree make_node PARAMS ((enum tree_code));
1971 extern tree make_lang_type PARAMS ((enum tree_code));
1972 extern tree (*make_lang_type_fn) PARAMS ((enum tree_code));
1974 /* Make a copy of a node, with all the same contents except
1975 for TREE_PERMANENT. (The copy is permanent
1976 iff nodes being made now are permanent.) */
1978 extern tree copy_node PARAMS ((tree));
1980 /* Make a copy of a chain of TREE_LIST nodes. */
1982 extern tree copy_list PARAMS ((tree));
1984 /* Make a TREE_VEC. */
1986 extern tree make_tree_vec PARAMS ((int));
1988 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1989 The name is supplied as a char *. */
1991 extern tree get_identifier PARAMS ((const char *));
1993 /* Identical to get_identifier, except that the length is assumed
1996 extern tree get_identifier_with_length PARAMS ((const char *, unsigned int));
1998 /* If an identifier with the name TEXT (a null-terminated string) has
1999 previously been referred to, return that node; otherwise return
2002 extern tree maybe_get_identifier PARAMS ((const char *));
2004 /* Construct various types of nodes. */
2006 #define build_int_2(LO,HI) \
2007 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2009 extern tree build PARAMS ((enum tree_code, tree, ...));
2010 extern tree build_nt PARAMS ((enum tree_code, ...));
2012 extern tree build_int_2_wide PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT));
2013 extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE));
2014 extern tree build_real_from_int_cst PARAMS ((tree, tree));
2015 extern tree build_complex PARAMS ((tree, tree, tree));
2016 extern tree build_string PARAMS ((int, const char *));
2017 extern tree build1 PARAMS ((enum tree_code, tree, tree));
2018 extern tree build_tree_list PARAMS ((tree, tree));
2019 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
2020 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
2021 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
2023 /* Construct various nodes representing data types. */
2025 extern tree make_signed_type PARAMS ((int));
2026 extern tree make_unsigned_type PARAMS ((int));
2027 extern void initialize_sizetypes PARAMS ((void));
2028 extern void set_sizetype PARAMS ((tree));
2029 extern tree signed_or_unsigned_type PARAMS ((int, tree));
2030 extern void fixup_unsigned_type PARAMS ((tree));
2031 extern tree build_pointer_type PARAMS ((tree));
2032 extern tree build_reference_type PARAMS ((tree));
2033 extern tree build_type_no_quals PARAMS ((tree));
2034 extern tree build_index_type PARAMS ((tree));
2035 extern tree build_index_2_type PARAMS ((tree, tree));
2036 extern tree build_array_type PARAMS ((tree, tree));
2037 extern tree build_function_type PARAMS ((tree, tree));
2038 extern tree build_method_type PARAMS ((tree, tree));
2039 extern tree build_offset_type PARAMS ((tree, tree));
2040 extern tree build_complex_type PARAMS ((tree));
2041 extern tree array_type_nelts PARAMS ((tree));
2043 extern tree value_member PARAMS ((tree, tree));
2044 extern tree purpose_member PARAMS ((tree, tree));
2045 extern tree binfo_member PARAMS ((tree, tree));
2046 extern unsigned int attribute_hash_list PARAMS ((tree));
2047 extern int attribute_list_equal PARAMS ((tree, tree));
2048 extern int attribute_list_contained PARAMS ((tree, tree));
2049 extern int tree_int_cst_equal PARAMS ((tree, tree));
2050 extern int tree_int_cst_lt PARAMS ((tree, tree));
2051 extern int tree_int_cst_compare PARAMS ((tree, tree));
2052 extern int host_integerp PARAMS ((tree, int));
2053 extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
2054 extern int tree_int_cst_msb PARAMS ((tree));
2055 extern int tree_int_cst_sgn PARAMS ((tree));
2056 extern int tree_expr_nonnegative_p PARAMS ((tree));
2057 extern int rtl_expr_nonnegative_p PARAMS ((rtx));
2058 extern int index_type_equal PARAMS ((tree, tree));
2059 extern tree get_inner_array_type PARAMS ((tree));
2061 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2062 put the prototype here. Rtl.h does declare the prototype if
2063 tree.h had been included. */
2065 extern tree make_tree PARAMS ((tree, rtx));
2067 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2070 Such modified types already made are recorded so that duplicates
2073 extern tree build_type_attribute_variant PARAMS ((tree, tree));
2074 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
2076 /* Structure describing an attribute and a function to handle it. */
2077 struct attribute_spec
2079 /* The name of the attribute (without any leading or trailing __),
2080 or NULL to mark the end of a table of attributes. */
2082 /* The minimum length of the list of arguments of the attribute. */
2084 /* The maximum length of the list of arguments of the attribute
2085 (-1 for no maximum). */
2087 /* Whether this attribute requires a DECL. If it does, it will be passed
2088 from types of DECLs, function return types and array element types to
2089 the DECLs, function types and array types respectively; but when
2090 applied to a type in any other circumstances, it will be ignored with
2091 a warning. (If greater control is desired for a given attribute,
2092 this should be false, and the flags argument to the handler may be
2093 used to gain greater control in that case.) */
2095 /* Whether this attribute requires a type. If it does, it will be passed
2096 from a DECL to the type of that DECL. */
2098 /* Whether this attribute requires a function (or method) type. If it does,
2099 it will be passed from a function pointer type to the target type,
2100 and from a function return type (which is not itself a function
2101 pointer type) to the function type. */
2102 bool function_type_required;
2103 /* Function to handle this attribute. NODE points to the node to which
2104 the attribute is to be applied. If a DECL, it should be modified in
2105 place; if a TYPE, a copy should be created. NAME is the name of the
2106 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2107 of the arguments (which may be NULL). FLAGS gives further information
2108 about the context of the attribute. Afterwards, the attributes will
2109 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2110 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2111 as well as in any other cases when the attributes should not be added
2112 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2113 applied to another type or DECL later may be returned;
2114 otherwise the return value should be NULL_TREE. This pointer may be
2115 NULL if no special handling is required beyond the checks implied
2116 by the rest of this structure. */
2117 tree (*handler) PARAMS ((tree *node, tree name, tree args,
2118 int flags, bool *no_add_attrs));
2121 extern const struct attribute_spec default_target_attribute_table[];
2123 /* Flags that may be passed in the third argument of decl_attributes, and
2124 to handler functions for attributes. */
2125 enum attribute_flags
2127 /* The type passed in is the type of a DECL, and any attributes that
2128 should be passed in again to be applied to the DECL rather than the
2129 type should be returned. */
2130 ATTR_FLAG_DECL_NEXT = 1,
2131 /* The type passed in is a function return type, and any attributes that
2132 should be passed in again to be applied to the function type rather
2133 than the return type should be returned. */
2134 ATTR_FLAG_FUNCTION_NEXT = 2,
2135 /* The type passed in is an array element type, and any attributes that
2136 should be passed in again to be applied to the array type rather
2137 than the element type should be returned. */
2138 ATTR_FLAG_ARRAY_NEXT = 4,
2139 /* The type passed in is a structure, union or enumeration type being
2140 created, and should be modified in place. */
2141 ATTR_FLAG_TYPE_IN_PLACE = 8
2144 /* Default versions of target-overridable functions. */
2146 extern tree merge_decl_attributes PARAMS ((tree, tree));
2147 extern tree merge_type_attributes PARAMS ((tree, tree));
2148 extern int default_comp_type_attributes PARAMS ((tree, tree));
2149 extern void default_set_default_type_attributes PARAMS ((tree));
2150 extern void default_insert_attributes PARAMS ((tree, tree *));
2151 extern bool default_function_attribute_inlinable_p PARAMS ((tree));
2153 /* Split a list of declspecs and attributes into two. */
2155 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2157 /* Strip attributes from a list of combined specs and attrs. */
2159 extern tree strip_attrs PARAMS ((tree));
2161 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2163 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
2165 /* Given a tree node and a string, return non-zero if the tree node is
2166 a valid attribute name for the string. */
2168 extern int is_attribute_p PARAMS ((const char *, tree));
2170 /* Given an attribute name and a list of attributes, return the list element
2171 of the attribute or NULL_TREE if not found. */
2173 extern tree lookup_attribute PARAMS ((const char *, tree));
2175 /* Given two attributes lists, return a list of their union. */
2177 extern tree merge_attributes PARAMS ((tree, tree));
2179 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2180 /* Given two Windows decl attributes lists, possibly including
2181 dllimport, return a list of their union . */
2182 extern tree merge_dllimport_decl_attributes PARAMS ((tree, tree));
2185 /* Return a version of the TYPE, qualified as indicated by the
2186 TYPE_QUALS, if one exists. If no qualified version exists yet,
2187 return NULL_TREE. */
2189 extern tree get_qualified_type PARAMS ((tree, int));
2191 /* Like get_qualified_type, but creates the type if it does not
2192 exist. This function never returns NULL_TREE. */
2194 extern tree build_qualified_type PARAMS ((tree, int));
2196 /* Like build_qualified_type, but only deals with the `const' and
2197 `volatile' qualifiers. This interface is retained for backwards
2198 compatiblity with the various front-ends; new code should use
2199 build_qualified_type instead. */
2201 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2202 build_qualified_type (TYPE, \
2203 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2204 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2206 /* Make a copy of a type node. */
2208 extern tree build_type_copy PARAMS ((tree));
2210 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2211 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2212 node, does nothing except for the first time. */
2214 extern void layout_type PARAMS ((tree));
2216 /* These functions allow a front-end to perform a manual layout of a
2217 RECORD_TYPE. (For instance, if the placement of subsequent fields
2218 depends on the placement of fields so far.) Begin by calling
2219 start_record_layout. Then, call place_field for each of the
2220 fields. Then, call finish_record_layout. See layout_type for the
2221 default way in which these functions are used. */
2223 typedef struct record_layout_info_s
2225 /* The RECORD_TYPE that we are laying out. */
2227 /* The offset into the record so far, in bytes, not including bits in
2230 /* The last known alignment of SIZE. */
2231 unsigned int offset_align;
2232 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2234 /* The alignment of the record so far, in bits. */
2235 unsigned int record_align;
2236 /* The alignment of the record so far, not including padding, in bits. */
2237 unsigned int unpacked_align;
2238 /* The alignment of the record so far, allowing for the record to be
2239 padded only at the end, in bits. */
2240 unsigned int unpadded_align;
2241 /* The static variables (i.e., class variables, as opposed to
2242 instance variables) encountered in T. */
2243 tree pending_statics;
2244 int packed_maybe_necessary;
2245 } *record_layout_info;
2247 extern void set_lang_adjust_rli PARAMS ((void (*) PARAMS
2248 ((record_layout_info))));
2249 extern record_layout_info start_record_layout PARAMS ((tree));
2250 extern tree bit_from_pos PARAMS ((tree, tree));
2251 extern tree byte_from_pos PARAMS ((tree, tree));
2252 extern void pos_from_byte PARAMS ((tree *, tree *, unsigned int,
2254 extern void pos_from_bit PARAMS ((tree *, tree *, unsigned int,
2256 extern void normalize_offset PARAMS ((tree *, tree *,
2258 extern tree rli_size_unit_so_far PARAMS ((record_layout_info));
2259 extern tree rli_size_so_far PARAMS ((record_layout_info));
2260 extern void normalize_rli PARAMS ((record_layout_info));
2261 extern void place_field PARAMS ((record_layout_info, tree));
2262 extern void compute_record_mode PARAMS ((tree));
2263 extern void finish_record_layout PARAMS ((record_layout_info));
2265 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2266 return a canonicalized ..._TYPE node, so that duplicates are not made.
2267 How the hash code is computed is up to the caller, as long as any two
2268 callers that could hash identical-looking type nodes agree. */
2270 extern tree type_hash_canon PARAMS ((unsigned int, tree));
2272 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2273 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2274 fields. Call this only once for any given decl node.
2276 Second argument is the boundary that this field can be assumed to
2277 be starting at (in bits). Zero means it can be assumed aligned
2278 on any boundary that may be needed. */
2280 extern void layout_decl PARAMS ((tree, unsigned));
2282 /* Return the mode for data of a given size SIZE and mode class CLASS.
2283 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2284 The value is BLKmode if no other mode is found. This is like
2285 mode_for_size, but is passed a tree. */
2287 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
2290 /* Return an expr equal to X but certainly not valid as an lvalue. */
2292 extern tree non_lvalue PARAMS ((tree));
2293 extern tree pedantic_non_lvalue PARAMS ((tree));
2295 extern tree convert PARAMS ((tree, tree));
2296 extern unsigned int expr_align PARAMS ((tree));
2297 extern tree size_in_bytes PARAMS ((tree));
2298 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
2299 extern tree bit_position PARAMS ((tree));
2300 extern HOST_WIDE_INT int_bit_position PARAMS ((tree));
2301 extern tree byte_position PARAMS ((tree));
2302 extern HOST_WIDE_INT int_byte_position PARAMS ((tree));
2304 /* Define data structures, macros, and functions for handling sizes
2305 and the various types used to represent sizes. */
2309 SIZETYPE, /* Normal representation of sizes in bytes. */
2310 SSIZETYPE, /* Signed representation of sizes in bytes. */
2311 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2312 BITSIZETYPE, /* Normal representation of sizes in bits. */
2313 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2314 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
2317 extern tree sizetype_tab[(int) TYPE_KIND_LAST];
2319 #define sizetype sizetype_tab[(int) SIZETYPE]
2320 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2321 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2322 #define usizetype sizetype_tab[(int) USIZETYPE]
2323 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2324 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2326 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
2327 extern tree size_diffop PARAMS ((tree, tree));
2328 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
2329 enum size_type_kind));
2330 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
2332 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2333 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2334 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2335 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2336 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2338 extern tree round_up PARAMS ((tree, int));
2339 extern tree round_down PARAMS ((tree, int));
2340 extern tree get_pending_sizes PARAMS ((void));
2341 extern int is_pending_size PARAMS ((tree));
2342 extern void put_pending_size PARAMS ((tree));
2343 extern void put_pending_sizes PARAMS ((tree));
2345 /* Type for sizes of data-type. */
2347 #define BITS_PER_UNIT_LOG \
2348 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2349 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2350 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2352 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2353 extern unsigned int maximum_field_alignment;
2355 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
2356 extern unsigned int set_alignment;
2358 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2359 by making the last node in X point to Y.
2360 Returns X, except if X is 0 returns Y. */
2362 extern tree chainon PARAMS ((tree, tree));
2364 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2366 extern tree tree_cons PARAMS ((tree, tree, tree));
2368 /* Return the last tree node in a chain. */
2370 extern tree tree_last PARAMS ((tree));
2372 /* Reverse the order of elements in a chain, and return the new head. */
2374 extern tree nreverse PARAMS ((tree));
2376 /* Returns the length of a chain of nodes
2377 (number of chain pointers to follow before reaching a null pointer). */
2379 extern int list_length PARAMS ((tree));
2381 /* Returns the number of FIELD_DECLs in a type. */
2383 extern int fields_length PARAMS ((tree));
2385 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2387 extern int integer_zerop PARAMS ((tree));
2389 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2391 extern int integer_onep PARAMS ((tree));
2393 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2394 all of whose significant bits are 1. */
2396 extern int integer_all_onesp PARAMS ((tree));
2398 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2399 exactly one bit 1. */
2401 extern int integer_pow2p PARAMS ((tree));
2403 /* staticp (tree x) is nonzero if X is a reference to data allocated
2404 at a fixed address in memory. */
2406 extern int staticp PARAMS ((tree));
2408 /* Gets an error if argument X is not an lvalue.
2409 Also returns 1 if X is an lvalue, 0 if not. */
2411 extern int lvalue_or_else PARAMS ((tree, const char *));
2413 /* save_expr (EXP) returns an expression equivalent to EXP
2414 but it can be used multiple times within context CTX
2415 and only evaluate EXP once. */
2417 extern tree save_expr PARAMS ((tree));
2419 /* Returns the index of the first non-tree operand for CODE, or the number
2420 of operands if all are trees. */
2422 extern int first_rtl_op PARAMS ((enum tree_code));
2424 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2425 can be used multiple times and will evaluate EXP in its entirety
2428 extern tree unsave_expr PARAMS ((tree));
2430 /* Reset EXP in place so that it can be expaned again. Does not
2431 recurse into subtrees. */
2433 extern void unsave_expr_1 PARAMS ((tree));
2435 /* Like unsave_expr_1, but recurses into all subtrees. */
2437 extern tree unsave_expr_now PARAMS ((tree));
2439 /* If non-null, these are language-specific helper functions for
2440 unsave_expr_now. If present, LANG_UNSAVE is called before its
2441 argument (an UNSAVE_EXPR) is to be unsaved, and all other
2442 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
2443 called from unsave_expr_1 for language-specific tree codes. */
2444 extern void (*lang_unsave) PARAMS ((tree *));
2445 extern void (*lang_unsave_expr_now) PARAMS ((tree));
2447 /* Return 0 if it is safe to evaluate EXPR multiple times,
2448 return 1 if it is safe if EXPR is unsaved afterward, or
2449 return 2 if it is completely unsafe. */
2450 extern int unsafe_for_reeval PARAMS ((tree));
2452 /* If non-null, these are language-specific helper functions for
2453 unsafe_for_reeval. Return negative to not handle some tree. */
2454 extern int (*lang_unsafe_for_reeval) PARAMS ((tree));
2456 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2457 or offset that depends on a field within a record.
2459 Note that we only allow such expressions within simple arithmetic
2462 extern int contains_placeholder_p PARAMS ((tree));
2464 /* Return 1 if EXP contains any expressions that produce cleanups for an
2465 outer scope to deal with. Used by fold. */
2467 extern int has_cleanups PARAMS ((tree));
2469 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2470 return a tree with all occurrences of references to F in a
2471 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2472 contains only arithmetic expressions. */
2474 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
2476 /* variable_size (EXP) is like save_expr (EXP) except that it
2477 is for the special case of something that is part of a
2478 variable size for a data type. It makes special arrangements
2479 to compute the value at the right time when the data type
2480 belongs to a function parameter. */
2482 extern tree variable_size PARAMS ((tree));
2484 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2485 but it can be used multiple times
2486 and only evaluate the subexpressions once. */
2488 extern tree stabilize_reference PARAMS ((tree));
2490 /* Subroutine of stabilize_reference; this is called for subtrees of
2491 references. Any expression with side-effects must be put in a SAVE_EXPR
2492 to ensure that it is only evaluated once. */
2494 extern tree stabilize_reference_1 PARAMS ((tree));
2496 /* Return EXP, stripped of any conversions to wider types
2497 in such a way that the result of converting to type FOR_TYPE
2498 is the same as if EXP were converted to FOR_TYPE.
2499 If FOR_TYPE is 0, it signifies EXP's type. */
2501 extern tree get_unwidened PARAMS ((tree, tree));
2503 /* Return OP or a simpler expression for a narrower value
2504 which can be sign-extended or zero-extended to give back OP.
2505 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2506 or 0 if the value should be sign-extended. */
2508 extern tree get_narrower PARAMS ((tree, int *));
2510 /* Given MODE and UNSIGNEDP, return a suitable type-tree
2512 The definition of this resides in language-specific code
2513 as the repertoire of available types may vary. */
2515 extern tree type_for_mode PARAMS ((enum machine_mode, int));
2517 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
2518 for an integer type with at least that precision.
2519 The definition of this resides in language-specific code
2520 as the repertoire of available types may vary. */
2522 extern tree type_for_size PARAMS ((unsigned, int));
2524 /* Given an integer type T, return a type like T but unsigned.
2525 If T is unsigned, the value is T.
2526 The definition of this resides in language-specific code
2527 as the repertoire of available types may vary. */
2529 extern tree unsigned_type PARAMS ((tree));
2531 /* Given an integer type T, return a type like T but signed.
2532 If T is signed, the value is T.
2533 The definition of this resides in language-specific code
2534 as the repertoire of available types may vary. */
2536 extern tree signed_type PARAMS ((tree));
2538 /* This function must be defined in the language-specific files.
2539 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
2540 This is defined in a language-specific file. */
2542 extern tree maybe_build_cleanup PARAMS ((tree));
2544 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2545 look for nested component-refs or array-refs at constant positions
2546 and find the ultimate containing object, which is returned. */
2548 extern tree get_inner_reference PARAMS ((tree, HOST_WIDE_INT *,
2549 HOST_WIDE_INT *, tree *,
2550 enum machine_mode *, int *,
2551 int *, unsigned int *));
2553 /* Given a DECL or TYPE, return the scope in which it was declared, or
2554 NUL_TREE if there is no containing scope. */
2556 extern tree get_containing_scope PARAMS ((tree));
2558 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2560 extern tree decl_function_context PARAMS ((tree));
2562 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2563 this _DECL with its context, or zero if none. */
2564 extern tree decl_type_context PARAMS ((tree));
2566 /* Given the FUNCTION_DECL for the current function,
2567 return zero if it is ok for this function to be inline.
2568 Otherwise return a warning message with a single %s
2569 for the function's name. */
2571 extern const char *function_cannot_inline_p PARAMS ((tree));
2573 /* Return 1 if EXPR is the real constant zero. */
2574 extern int real_zerop PARAMS ((tree));
2576 /* Declare commonly used variables for tree structure. */
2578 /* Points to the name of the input file from which the current input
2579 being parsed originally came (before it went into cpp). */
2580 extern const char *input_filename;
2582 /* Current line number in input file. */
2585 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2586 Zero means allow extended lvalues. */
2588 extern int pedantic_lvalues;
2590 /* Nonzero means can safely call expand_expr now;
2591 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2593 extern int immediate_size_expand;
2595 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2597 extern tree current_function_decl;
2599 /* Nonzero means a FUNC_BEGIN label was emitted. */
2600 extern tree current_function_func_begin_label;
2602 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2604 extern int all_types_permanent;
2606 /* Pointer to function to compute the name to use to print a declaration.
2607 DECL is the declaration in question.
2608 VERBOSITY determines what information will be printed:
2609 0: DECL_NAME, demangled as necessary.
2610 1: and scope information.
2611 2: and any other information that might be interesting, such as function
2612 parameter types in C++. */
2614 extern const char *(*decl_printable_name) PARAMS ((tree, int));
2616 /* Pointer to function to finish handling an incomplete decl at the
2617 end of compilation. */
2619 extern void (*incomplete_decl_finalize_hook) PARAMS ((tree));
2621 extern const char *init_parse PARAMS ((const char *));
2622 extern void finish_parse PARAMS ((void));
2624 extern const char * const language_string;
2626 /* Declare a predefined function. Return the declaration. This function is
2627 provided by each language frontend. */
2628 extern tree builtin_function PARAMS ((const char *, tree, int,
2629 enum built_in_class,
2633 extern char *perm_calloc PARAMS ((int, long));
2634 extern void clean_symbol_name PARAMS ((char *));
2635 extern tree get_file_function_name_long PARAMS ((const char *));
2636 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2637 extern tree get_set_constructor_bytes PARAMS ((tree,
2638 unsigned char *, int));
2639 extern tree get_callee_fndecl PARAMS ((tree));
2640 extern void set_decl_assembler_name PARAMS ((tree));
2641 extern int type_num_arguments PARAMS ((tree));
2645 extern int in_control_zone_p PARAMS ((void));
2646 extern void expand_fixups PARAMS ((rtx));
2647 extern tree expand_start_stmt_expr PARAMS ((void));
2648 extern tree expand_end_stmt_expr PARAMS ((tree));
2649 extern void expand_expr_stmt PARAMS ((tree));
2650 extern int warn_if_unused_value PARAMS ((tree));
2651 extern void expand_decl_init PARAMS ((tree));
2652 extern void clear_last_expr PARAMS ((void));
2653 extern void expand_label PARAMS ((tree));
2654 extern void expand_goto PARAMS ((tree));
2655 extern void expand_asm PARAMS ((tree));
2656 extern void expand_start_cond PARAMS ((tree, int));
2657 extern void expand_end_cond PARAMS ((void));
2658 extern void expand_start_else PARAMS ((void));
2659 extern void expand_start_elseif PARAMS ((tree));
2660 extern struct nesting *expand_start_loop PARAMS ((int));
2661 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2662 extern struct nesting *expand_start_null_loop PARAMS ((void));
2663 extern void expand_loop_continue_here PARAMS ((void));
2664 extern void expand_end_loop PARAMS ((void));
2665 extern void expand_end_null_loop PARAMS ((void));
2666 extern int expand_continue_loop PARAMS ((struct nesting *));
2667 extern int expand_exit_loop PARAMS ((struct nesting *));
2668 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2670 extern int expand_exit_something PARAMS ((void));
2672 extern void expand_return PARAMS ((tree));
2673 extern int optimize_tail_recursion PARAMS ((tree, rtx));
2674 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2675 #define expand_start_bindings(flags) \
2676 expand_start_bindings_and_block(flags, NULL_TREE)
2677 extern void expand_end_bindings PARAMS ((tree, int, int));
2678 extern void warn_about_unused_variables PARAMS ((tree));
2679 extern void start_cleanup_deferral PARAMS ((void));
2680 extern void end_cleanup_deferral PARAMS ((void));
2681 extern int is_body_block PARAMS ((tree));
2683 extern int conditional_context PARAMS ((void));
2684 extern struct nesting * current_nesting_level PARAMS ((void));
2685 extern tree last_cleanup_this_contour PARAMS ((void));
2686 extern void expand_start_case PARAMS ((int, tree, tree,
2688 extern void expand_end_case PARAMS ((tree));
2689 extern int add_case_node PARAMS ((tree, tree,
2691 extern int pushcase PARAMS ((tree,
2692 tree (*) (tree, tree),
2694 extern int pushcase_range PARAMS ((tree, tree,
2695 tree (*) (tree, tree),
2697 extern void using_eh_for_cleanups PARAMS ((void));
2698 extern int stmt_loop_nest_empty PARAMS ((void));
2700 /* In fold-const.c */
2702 /* Fold constants as much as possible in an expression.
2703 Returns the simplified expression.
2704 Acts only on the top level of the expression;
2705 if the argument itself cannot be simplified, its
2706 subexpressions are not changed. */
2708 extern tree fold PARAMS ((tree));
2710 extern int force_fit_type PARAMS ((tree, int));
2711 extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2712 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2713 unsigned HOST_WIDE_INT *,
2715 extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2716 unsigned HOST_WIDE_INT *,
2718 extern int mul_double PARAMS ((unsigned HOST_WIDE_INT,
2720 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2721 unsigned HOST_WIDE_INT *,
2723 extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2724 HOST_WIDE_INT, unsigned int,
2725 unsigned HOST_WIDE_INT *,
2726 HOST_WIDE_INT *, int));
2727 extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2728 HOST_WIDE_INT, unsigned int,
2729 unsigned HOST_WIDE_INT *,
2730 HOST_WIDE_INT *, int));
2731 extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2732 HOST_WIDE_INT, unsigned int,
2733 unsigned HOST_WIDE_INT *,
2735 extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2736 HOST_WIDE_INT, unsigned int,
2737 unsigned HOST_WIDE_INT *,
2739 extern int operand_equal_p PARAMS ((tree, tree, int));
2740 extern tree invert_truthvalue PARAMS ((tree));
2742 /* In builtins.c. Given a type, apply default promotions wrt unnamed
2743 function arguments and return the new type. Return NULL_TREE if no
2744 change. Required by any language that supports variadic arguments. */
2746 extern tree (*lang_type_promotes_to) PARAMS ((tree));
2747 extern tree fold_builtin PARAMS ((tree));
2749 /* The language front-end must define these functions. */
2751 /* Function of no arguments for initializing lexical scanning. */
2752 extern void init_lex PARAMS ((void));
2753 /* Function of no arguments for initializing the symbol table. */
2754 extern void init_decl_processing PARAMS ((void));
2756 /* Function to identify which front-end produced the output file. */
2757 extern const char *lang_identify PARAMS ((void));
2759 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2760 extern void copy_lang_decl PARAMS ((tree));
2762 /* Function called with no arguments to parse and compile the input. */
2763 extern int yyparse PARAMS ((void));
2764 /* Functions for processing symbol declarations. */
2765 /* Function to enter a new lexical scope.
2766 Takes one argument: always zero when called from outside the front end. */
2767 extern void pushlevel PARAMS ((int));
2768 /* Function to exit a lexical scope. It returns a BINDING for that scope.
2769 Takes three arguments:
2770 KEEP -- nonzero if there were declarations in this scope.
2771 REVERSE -- reverse the order of decls before returning them.
2772 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2773 extern tree poplevel PARAMS ((int, int, int));
2774 /* Set the BLOCK node for the current scope level. */
2775 extern void set_block PARAMS ((tree));
2776 /* Function to add a decl to the current scope level.
2777 Takes one argument, a decl to add.
2778 Returns that decl, or, if the same symbol is already declared, may
2779 return a different decl for that name. */
2780 extern tree pushdecl PARAMS ((tree));
2781 /* Function to return the chain of decls so far in the current scope level. */
2782 extern tree getdecls PARAMS ((void));
2783 /* Function to return the chain of structure tags in the current scope level. */
2784 extern tree gettags PARAMS ((void));
2786 extern tree build_range_type PARAMS ((tree, tree, tree));
2789 extern void record_component_aliases PARAMS ((tree));
2790 extern HOST_WIDE_INT get_alias_set PARAMS ((tree));
2791 extern int alias_sets_conflict_p PARAMS ((HOST_WIDE_INT,
2793 extern int readonly_fields_p PARAMS ((tree));
2794 extern int objects_must_conflict_p PARAMS ((tree, tree));
2797 extern HOST_WIDE_INT lang_get_alias_set PARAMS ((tree));
2799 /* Set the DECL_ASSEMBLER_NAME for a node. If it is the sort of thing
2800 that the assembler should talk about, set DECL_ASSEMBLER_NAME to an
2801 appropriate IDENTIFIER_NODE. Otherwise, set it to the
2802 ERROR_MARK_NODE to ensure that the assembler does not talk about
2804 extern void (*lang_set_decl_assembler_name) PARAMS ((tree));
2809 extern int really_constant_p PARAMS ((tree));
2810 extern void set_identifier_size PARAMS ((int));
2811 extern int int_fits_type_p PARAMS ((tree, tree));
2812 extern int tree_log2 PARAMS ((tree));
2813 extern int tree_floor_log2 PARAMS ((tree));
2814 extern void preserve_data PARAMS ((void));
2815 extern int object_permanent_p PARAMS ((tree));
2816 extern int type_precision PARAMS ((tree));
2817 extern int simple_cst_equal PARAMS ((tree, tree));
2818 extern int compare_tree_int PARAMS ((tree, unsigned int));
2819 extern int type_list_equal PARAMS ((tree, tree));
2820 extern int chain_member PARAMS ((tree, tree));
2821 extern int chain_member_purpose PARAMS ((tree, tree));
2822 extern int chain_member_value PARAMS ((tree, tree));
2823 extern tree listify PARAMS ((tree));
2824 extern tree type_hash_lookup PARAMS ((unsigned int, tree));
2825 extern void type_hash_add PARAMS ((unsigned int, tree));
2826 extern unsigned int type_hash_list PARAMS ((tree));
2827 extern int simple_cst_list_equal PARAMS ((tree, tree));
2828 extern void dump_tree_statistics PARAMS ((void));
2829 extern void print_obstack_statistics PARAMS ((const char *,
2832 extern void print_obstack_name PARAMS ((char *, FILE *,
2835 extern void expand_function_end PARAMS ((const char *, int, int));
2836 extern void expand_function_start PARAMS ((tree, int));
2837 extern void expand_pending_sizes PARAMS ((tree));
2839 extern int real_onep PARAMS ((tree));
2840 extern int real_twop PARAMS ((tree));
2841 extern void gcc_obstack_init PARAMS ((struct obstack *));
2842 extern void init_obstacks PARAMS ((void));
2843 extern void build_common_tree_nodes PARAMS ((int));
2844 extern void build_common_tree_nodes_2 PARAMS ((int));
2845 extern void mark_tree_hashtable PARAMS ((void *));
2848 extern void setjmp_protect_args PARAMS ((void));
2849 extern void setjmp_protect PARAMS ((tree));
2850 extern void expand_main_function PARAMS ((void));
2851 extern void mark_varargs PARAMS ((void));
2852 extern void init_dummy_function_start PARAMS ((void));
2853 extern void expand_dummy_function_end PARAMS ((void));
2854 extern void init_function_for_compilation PARAMS ((void));
2855 extern void init_function_start PARAMS ((tree, const char *, int));
2856 extern void assign_parms PARAMS ((tree));
2857 extern void put_var_into_stack PARAMS ((tree));
2858 extern void flush_addressof PARAMS ((tree));
2859 extern void uninitialized_vars_warning PARAMS ((tree));
2860 extern void setjmp_args_warning PARAMS ((void));
2861 extern void mark_all_temps_used PARAMS ((void));
2862 extern void init_temp_slots PARAMS ((void));
2863 extern void combine_temp_slots PARAMS ((void));
2864 extern void free_temp_slots PARAMS ((void));
2865 extern void pop_temp_slots PARAMS ((void));
2866 extern void push_temp_slots PARAMS ((void));
2867 extern void preserve_temp_slots PARAMS ((rtx));
2868 extern void preserve_rtl_expr_temps PARAMS ((tree));
2869 extern int aggregate_value_p PARAMS ((tree));
2870 extern void free_temps_for_rtl_expr PARAMS ((tree));
2871 extern void instantiate_virtual_regs PARAMS ((tree, rtx));
2872 extern void unshare_all_rtl PARAMS ((tree, rtx));
2873 extern int max_parm_reg_num PARAMS ((void));
2874 extern void push_function_context PARAMS ((void));
2875 extern void pop_function_context PARAMS ((void));
2876 extern void push_function_context_to PARAMS ((tree));
2877 extern void pop_function_context_from PARAMS ((tree));
2878 extern void ggc_mark_struct_function PARAMS ((struct function *));
2880 /* In print-rtl.c */
2882 extern void print_rtl PARAMS ((FILE *, rtx));
2885 /* In print-tree.c */
2886 extern void debug_tree PARAMS ((tree));
2888 extern void print_node PARAMS ((FILE *, const char *, tree,
2890 extern void print_node_brief PARAMS ((FILE *, const char *, tree,
2892 extern void indent_to PARAMS ((FILE *, int));
2896 extern int apply_args_register_offset PARAMS ((int));
2897 extern rtx expand_builtin_return_addr
2898 PARAMS ((enum built_in_function, int, rtx));
2899 extern void check_max_integer_computation_mode PARAMS ((tree));
2902 extern void start_sequence_for_rtl_expr PARAMS ((tree));
2903 extern rtx emit_line_note PARAMS ((const char *, int));
2907 extern int setjmp_call_p PARAMS ((tree));
2910 extern tree decl_attributes PARAMS ((tree *, tree, int));
2914 extern int mark_addressable PARAMS ((tree));
2915 extern void incomplete_type_error PARAMS ((tree, tree));
2916 extern void print_lang_statistics PARAMS ((void));
2917 extern tree truthvalue_conversion PARAMS ((tree));
2919 extern void print_lang_decl PARAMS ((FILE *, tree, int));
2920 extern void print_lang_type PARAMS ((FILE *, tree, int));
2921 extern void print_lang_identifier PARAMS ((FILE *, tree, int));
2923 extern int global_bindings_p PARAMS ((void));
2924 extern void insert_block PARAMS ((tree));
2926 /* In integrate.c */
2927 extern void save_for_inline PARAMS ((tree));
2928 extern void set_decl_abstract_flags PARAMS ((tree, int));
2929 extern void output_inline_function PARAMS ((tree));
2930 extern void set_decl_origin_self PARAMS ((tree));
2933 extern void set_yydebug PARAMS ((int));
2935 /* In stor-layout.c */
2936 extern void fixup_signed_type PARAMS ((tree));
2937 extern void internal_reference_types PARAMS ((void));
2940 extern void make_decl_rtl PARAMS ((tree, const char *));
2941 extern void make_decl_one_only PARAMS ((tree));
2942 extern int supports_one_only PARAMS ((void));
2943 extern void variable_section PARAMS ((tree, int));
2945 /* In fold-const.c */
2946 extern int div_and_round_double PARAMS ((enum tree_code, int,
2947 unsigned HOST_WIDE_INT,
2949 unsigned HOST_WIDE_INT,
2951 unsigned HOST_WIDE_INT *,
2953 unsigned HOST_WIDE_INT *,
2957 extern void emit_nop PARAMS ((void));
2958 extern void expand_computed_goto PARAMS ((tree));
2959 extern bool parse_output_constraint PARAMS ((const char **,
2961 bool *, bool *, bool *));
2962 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
2963 const char *, int));
2964 extern int any_pending_cleanups PARAMS ((int));
2965 extern void init_stmt PARAMS ((void));
2966 extern void init_stmt_for_function PARAMS ((void));
2967 extern int drop_through_at_end_p PARAMS ((void));
2968 extern void expand_start_target_temps PARAMS ((void));
2969 extern void expand_end_target_temps PARAMS ((void));
2970 extern void expand_elseif PARAMS ((tree));
2971 extern void save_stack_pointer PARAMS ((void));
2972 extern void expand_decl PARAMS ((tree));
2973 extern int expand_decl_cleanup PARAMS ((tree, tree));
2974 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
2975 extern void move_cleanups_up PARAMS ((void));
2976 extern void expand_start_case_dummy PARAMS ((void));
2977 extern void expand_end_case_dummy PARAMS ((void));
2978 extern tree case_index_expr_type PARAMS ((void));
2979 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
2980 extern void check_for_full_enumeration_handling PARAMS ((tree));
2981 extern void declare_nonlocal_label PARAMS ((tree));
2983 extern void lang_print_xnode PARAMS ((FILE *, tree, int));
2987 /* If KIND=='I', return a suitable global initializer (constructor) name.
2988 If KIND=='D', return a suitable global clean-up (destructor) name. */
2989 extern tree get_file_function_name PARAMS ((int));
2991 /* Interface of the DWARF2 unwind info support. */
2993 /* Generate a new label for the CFI info to refer to. */
2995 extern char *dwarf2out_cfi_label PARAMS ((void));
2997 /* Entry point to update the canonical frame address (CFA). */
2999 extern void dwarf2out_def_cfa PARAMS ((const char *, unsigned, long));
3001 /* Add the CFI for saving a register window. */
3003 extern void dwarf2out_window_save PARAMS ((const char *));
3005 /* Add a CFI to update the running total of the size of arguments pushed
3008 extern void dwarf2out_args_size PARAMS ((const char *, long));
3010 /* Entry point for saving a register to the stack. */
3012 extern void dwarf2out_reg_save PARAMS ((const char *, unsigned, long));
3014 /* Entry point for saving the return address in the stack. */
3016 extern void dwarf2out_return_save PARAMS ((const char *, long));
3018 /* Entry point for saving the return address in a register. */
3020 extern void dwarf2out_return_reg PARAMS ((const char *, unsigned));
3023 /* Redefine abort to report an internal error w/o coredump, and
3024 reporting the location of the error in the source file. This logic
3025 is duplicated in rtl.h and tree.h because every file that needs the
3026 special abort includes one or both. toplev.h gets too few files,
3027 system.h gets too many. */
3029 extern void fancy_abort PARAMS ((const char *, int, const char *))
3031 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)