1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 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
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
42 /* Number of language-independent tree codes. */
43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern const char tree_code_type[];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns nonzero iff CLASS is the tree-code class of an
59 #define IS_EXPR_CODE_CLASS(CLASS) \
60 ((CLASS) == '<' || (CLASS) == '1' || (CLASS) == '2' || (CLASS) == 'e')
62 /* Number of argument-words in each kind of tree-node. */
64 extern const unsigned char tree_code_length[];
65 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
67 /* Names of tree components. */
69 extern const char *const tree_code_name[];
71 /* Classify which part of the compiler has defined a given builtin function.
72 Note that we assume below that this is no more than two bits. */
81 /* Names for the above. */
82 extern const char *const built_in_class_names[4];
84 /* Codes that identify the various built in functions
85 so that expand_call can identify them quickly. */
87 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
88 enum built_in_function
90 #include "builtins.def"
92 /* Upper bound on non-language-specific builtins. */
97 /* Names for the above. */
98 extern const char *const built_in_names[(int) END_BUILTINS];
100 /* An array of _DECL trees for the above. */
101 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
102 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
104 /* The definition of tree nodes fills the next several pages. */
106 /* A tree node can represent a data type, a variable, an expression
107 or a statement. Each node has a TREE_CODE which says what kind of
108 thing it represents. Some common codes are:
109 INTEGER_TYPE -- represents a type of integers.
110 ARRAY_TYPE -- represents a type of pointer.
111 VAR_DECL -- represents a declared variable.
112 INTEGER_CST -- represents a constant integer value.
113 PLUS_EXPR -- represents a sum (an expression).
115 As for the contents of a tree node: there are some fields
116 that all nodes share. Each TREE_CODE has various special-purpose
117 fields as well. The fields of a node are never accessed directly,
118 always through accessor macros. */
120 /* Every kind of tree node starts with this structure,
121 so all nodes have these fields.
123 See the accessor macros, defined below, for documentation of the
126 struct tree_common GTY(())
131 ENUM_BITFIELD(tree_code) code : 8;
133 unsigned side_effects_flag : 1;
134 unsigned constant_flag : 1;
135 unsigned addressable_flag : 1;
136 unsigned volatile_flag : 1;
137 unsigned readonly_flag : 1;
138 unsigned unsigned_flag : 1;
139 unsigned asm_written_flag: 1;
140 unsigned unused_0 : 1;
142 unsigned used_flag : 1;
143 unsigned nothrow_flag : 1;
144 unsigned static_flag : 1;
145 unsigned public_flag : 1;
146 unsigned private_flag : 1;
147 unsigned protected_flag : 1;
148 unsigned bounded_flag : 1;
149 unsigned deprecated_flag : 1;
151 unsigned lang_flag_0 : 1;
152 unsigned lang_flag_1 : 1;
153 unsigned lang_flag_2 : 1;
154 unsigned lang_flag_3 : 1;
155 unsigned lang_flag_4 : 1;
156 unsigned lang_flag_5 : 1;
157 unsigned lang_flag_6 : 1;
158 unsigned unused_1 : 1;
161 /* The following table lists the uses of each of the above flags and
162 for which types of nodes they are defined. Note that expressions
168 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
169 ..._TYPE, IDENTIFIER_NODE.
170 In a STMT_EXPR, it means we want the result of the enclosed
176 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
177 TREE_NO_UNUSED_WARNING in
178 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
180 TREE_LIST or TREE_VEC
181 TREE_CONSTANT_OVERFLOW in
182 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
183 TREE_SYMBOL_REFERENCED in
186 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
187 TREE_LIST elements of a block's cleanup list.
192 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
194 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
195 EXPR_WFL_EMIT_LINE_NOTE in
196 EXPR_WITH_FILE_LOCATION
202 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
218 TREE_THIS_VOLATILE in
238 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
239 SAVE_EXPR_NOPLACEHOLDER in
245 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
251 expressions, IDENTIFIER_NODE
256 CALL_EXPR, FUNCTION_DECL
261 expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL,
272 /* Define accessors for the fields that all tree nodes have
273 (though some fields are not used for all kinds of nodes). */
275 /* The tree-code says what kind of node it is.
276 Codes are defined in tree.def. */
277 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
278 #define TREE_SET_CODE(NODE, VALUE) \
279 ((NODE)->common.code = (ENUM_BITFIELD (tree_code)) (VALUE))
281 /* When checking is enabled, errors will be generated if a tree node
282 is accessed incorrectly. The macros abort with a fatal error. */
283 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
285 #define TREE_CHECK(t, code) __extension__ \
286 ({ const tree __t = (t); \
287 if (TREE_CODE(__t) != (code)) \
288 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
290 #define TREE_CLASS_CHECK(t, class) __extension__ \
291 ({ const tree __t = (t); \
292 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
293 tree_class_check_failed (__t, class, __FILE__, __LINE__, \
297 /* These checks have to be special cased. */
298 #define EXPR_CHECK(t) __extension__ \
299 ({ const tree __t = (t); \
300 char const __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
301 if (__c != 'r' && __c != 's' && __c != '<' \
302 && __c != '1' && __c != '2' && __c != 'e') \
303 tree_class_check_failed (__t, 'e', __FILE__, __LINE__, \
307 #define TREE_VEC_ELT_CHECK(t, i) __extension__ \
308 (*({const tree __t = t; \
309 const int __i = (i); \
310 if (TREE_CODE (__t) != TREE_VEC) \
311 tree_check_failed (__t, TREE_VEC, \
312 __FILE__, __LINE__, __FUNCTION__); \
313 if (__i < 0 || __i >= __t->vec.length) \
314 tree_vec_elt_check_failed (__i, __t->vec.length, \
315 __FILE__, __LINE__, __FUNCTION__); \
316 &__t->vec.a[__i]; }))
318 /* Special checks for TREE_OPERANDs. */
319 #define TREE_OPERAND_CHECK(t, i) __extension__ \
320 (*({const tree __t = EXPR_CHECK(t); \
321 const int __i = (i); \
322 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
323 tree_operand_check_failed (__i, TREE_CODE (__t), \
324 __FILE__, __LINE__, __FUNCTION__); \
325 &__t->exp.operands[__i]; }))
327 #define TREE_OPERAND_CHECK_CODE(t, code, i) __extension__ \
328 (*({const tree __t = t; \
329 const int __i = (i); \
330 const enum tree_code __code = code; \
331 if (TREE_CODE (__t) != __code) \
332 tree_check_failed (__t, __code, \
333 __FILE__, __LINE__, __FUNCTION__); \
334 if (__i < 0 || __i >= TREE_CODE_LENGTH (__code)) \
335 tree_operand_check_failed (__i, __code, \
336 __FILE__, __LINE__, __FUNCTION__); \
337 &__t->exp.operands[__i]; }))
339 #define TREE_RTL_OPERAND_CHECK(t, code, i) __extension__ \
341 ({const tree __t = t; \
342 const int __i = (i); \
343 const enum tree_code __code = code; \
344 if (TREE_CODE (__t) != __code) \
345 tree_check_failed (__t, __code, \
346 __FILE__, __LINE__, __FUNCTION__); \
347 if (__i < 0 || __i >= TREE_CODE_LENGTH (__code)) \
348 tree_operand_check_failed (__i, __code, \
349 __FILE__, __LINE__, __FUNCTION__); \
350 &__t->exp.operands[__i]; }))
352 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
353 const char *, int, const char *))
355 extern void tree_class_check_failed PARAMS ((const tree, int,
356 const char *, int, const char *))
358 extern void tree_vec_elt_check_failed PARAMS ((int, int, const char *,
362 extern void tree_operand_check_failed PARAMS ((int, enum tree_code,
363 const char *, int, const char *))
366 #else /* not ENABLE_TREE_CHECKING, or not gcc */
368 #define TREE_CHECK(t, code) (t)
369 #define TREE_CLASS_CHECK(t, code) (t)
370 #define EXPR_CHECK(t) (t)
371 #define TREE_VEC_ELT_CHECK(t, i) ((t)->vec.a[i])
372 #define TREE_OPERAND_CHECK(t, i) ((t)->exp.operands[i])
373 #define TREE_OPERAND_CHECK_CODE(t, code, i) ((t)->exp.operands[i])
374 #define TREE_RTL_OPERAND_CHECK(t, code, i) (*(rtx *) &((t)->exp.operands[i]))
378 #include "tree-check.h"
380 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
381 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
382 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
384 /* In all nodes that are expressions, this is the data type of the expression.
385 In POINTER_TYPE nodes, this is the type that the pointer points to.
386 In ARRAY_TYPE nodes, this is the type of the elements.
387 In VECTOR_TYPE nodes, this is the type of the elements. */
388 #define TREE_TYPE(NODE) ((NODE)->common.type)
390 /* Here is how primitive or already-canonicalized types' hash codes
392 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777)
394 /* Nodes are chained together for many purposes.
395 Types are chained together to record them for being output to the debugger
396 (see the function `chain_type').
397 Decls in the same scope are chained together to record the contents
399 Statement nodes for successive statements used to be chained together.
400 Often lists of things are represented by TREE_LIST nodes that
401 are chained together. */
403 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
405 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
406 that don't change the machine mode. */
408 #define STRIP_NOPS(EXP) \
409 while ((TREE_CODE (EXP) == NOP_EXPR \
410 || TREE_CODE (EXP) == CONVERT_EXPR \
411 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
412 && TREE_OPERAND (EXP, 0) != error_mark_node \
413 && (TYPE_MODE (TREE_TYPE (EXP)) \
414 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
415 (EXP) = TREE_OPERAND (EXP, 0)
417 /* Like STRIP_NOPS, but don't let the signedness change either. */
419 #define STRIP_SIGN_NOPS(EXP) \
420 while ((TREE_CODE (EXP) == NOP_EXPR \
421 || TREE_CODE (EXP) == CONVERT_EXPR \
422 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
423 && TREE_OPERAND (EXP, 0) != error_mark_node \
424 && (TYPE_MODE (TREE_TYPE (EXP)) \
425 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
426 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
427 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
428 (EXP) = TREE_OPERAND (EXP, 0)
430 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
432 #define STRIP_MAIN_TYPE_NOPS(EXP) \
433 while ((TREE_CODE (EXP) == NOP_EXPR \
434 || TREE_CODE (EXP) == CONVERT_EXPR \
435 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
436 && TREE_OPERAND (EXP, 0) != error_mark_node \
437 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
438 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
439 (EXP) = TREE_OPERAND (EXP, 0)
441 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
443 #define STRIP_TYPE_NOPS(EXP) \
444 while ((TREE_CODE (EXP) == NOP_EXPR \
445 || TREE_CODE (EXP) == CONVERT_EXPR \
446 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
447 && TREE_OPERAND (EXP, 0) != error_mark_node \
448 && (TREE_TYPE (EXP) \
449 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
450 (EXP) = TREE_OPERAND (EXP, 0)
452 /* Nonzero if TYPE represents an integral type. Note that we do not
453 include COMPLEX types here. */
455 #define INTEGRAL_TYPE_P(TYPE) \
456 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
457 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
459 /* Nonzero if TYPE represents a floating-point type, including complex
460 floating-point types. */
462 #define FLOAT_TYPE_P(TYPE) \
463 (TREE_CODE (TYPE) == REAL_TYPE \
464 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
465 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
467 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
469 #define AGGREGATE_TYPE_P(TYPE) \
470 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
471 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
472 || TREE_CODE (TYPE) == SET_TYPE)
474 /* Nonzero if TYPE represents an unbounded pointer or unbounded
475 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
477 #define POINTER_TYPE_P(TYPE) \
478 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
480 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
482 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
483 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
485 /* Nonzero if TYPE represents a bounded pointer type. */
487 #define BOUNDED_POINTER_TYPE_P(TYPE) \
488 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
489 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
491 /* Nonzero if TYPE represents a bounded reference type. Bounded
492 reference types have two specific uses: (1) When a reference is
493 seated to a variable-length RECORD_TYPE that has an array of
494 indeterminate length as its final field. For all other objects, it
495 is sufficient to check bounds at the time the reference is seated,
496 and assume that all future uses of the reference are safe, since
497 the address of references cannot change. (2) When a reference
498 supertype is seated to a subtype object. The bounds "remember"
499 the true size of the complete object, so that subsequent upcasts of
500 the address of the reference will be checked properly (is such a
501 thing valid C++?). */
503 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
504 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
505 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
507 /* Nonzero if TYPE represents a pointer or reference type, either
508 bounded or unbounded. */
510 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
511 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
513 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
515 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
516 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
518 /* Nonzero if TYPE represents a reference type, either bounded or
521 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
522 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
524 /* Nonzero if this type is a complete type. */
525 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
527 /* Nonzero if this type is the (possibly qualified) void type. */
528 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
530 /* Nonzero if this type is complete or is cv void. */
531 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
532 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
534 /* Nonzero if this type is complete or is an array with unspecified bound. */
535 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
536 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
538 /* Nonzero if TYPE represents a type. */
540 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
542 /* Define many boolean fields that all tree nodes have. */
544 /* In VAR_DECL nodes, nonzero means address of this is needed.
545 So it cannot be in a register.
546 In a FUNCTION_DECL, nonzero means its address is needed.
547 So it must be compiled even if it is an inline function.
548 In a FIELD_DECL node, it means that the programmer is permitted to
549 construct the address of this field. This is used for aliasing
550 purposes: see record_component_aliases.
551 In CONSTRUCTOR nodes, it means object constructed must be in memory.
552 In LABEL_DECL nodes, it means a goto for this label has been seen
553 from a place outside all binding contours that restore stack levels.
554 In ..._TYPE nodes, it means that objects of this type must
555 be fully addressable. This means that pieces of this
556 object cannot go into register parameters, for example.
557 In IDENTIFIER_NODEs, this means that some extern decl for this name
558 had its address taken. That matters for inline functions. */
559 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
561 /* In a VAR_DECL, nonzero means allocate static storage.
562 In a FUNCTION_DECL, nonzero if function has been defined.
563 In a CONSTRUCTOR, nonzero means allocate static storage. */
564 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
566 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
567 block's cleanup list, means that the pertinent cleanup should only be
568 executed if an exception is thrown, not on normal exit of its scope. */
569 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
571 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
572 made implicitly and should not lead to an "unused value" warning. */
573 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
575 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
576 chain is via a `virtual' declaration. */
577 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
579 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
580 there was an overflow in folding. This is distinct from
581 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
582 occur in constant expressions. */
583 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
585 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
586 this string as an argument. */
587 #define TREE_SYMBOL_REFERENCED(NODE) \
588 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
590 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
591 there was an overflow in folding, and no warning has been issued
592 for this subexpression. TREE_OVERFLOW implies
593 TREE_CONSTANT_OVERFLOW, but not vice versa. */
594 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
596 /* In a VAR_DECL or FUNCTION_DECL,
597 nonzero means name is to be accessible from outside this module.
598 In an IDENTIFIER_NODE, nonzero means an external declaration
599 accessible from outside this module was previously seen
600 for this name in an inner scope. */
601 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
603 /* In any expression, nonzero means it has side effects or reevaluation
604 of the whole expression could produce a different value.
605 This is set if any subexpression is a function call, a side effect
606 or a reference to a volatile variable.
607 In a ..._DECL, this is set only if the declaration said `volatile'. */
608 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
610 /* Nonzero means this expression is volatile in the C sense:
611 its address should be of type `volatile WHATEVER *'.
612 In other words, the declared item is volatile qualified.
613 This is used in _DECL nodes and _REF nodes.
615 In a ..._TYPE node, means this type is volatile-qualified.
616 But use TYPE_VOLATILE instead of this macro when the node is a type,
617 because eventually we may make that a different bit.
619 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
620 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
622 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
623 nonzero means it may not be the lhs of an assignment.
624 In a ..._TYPE node, means this type is const-qualified
625 (but the macro TYPE_READONLY should be used instead of this macro
626 when the node is a type). */
627 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
629 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
630 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE))
632 /* Value of expression is constant.
633 Always appears in all ..._CST nodes.
634 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
635 if the value is constant. */
636 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
638 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
639 In FIELD_DECL nodes, means an unsigned bit field. */
640 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
642 #define TYPE_TRAP_SIGNED(NODE) \
643 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE)))
645 /* Nonzero in a VAR_DECL means assembler code has been written.
646 Nonzero in a FUNCTION_DECL means that the function has been compiled.
647 This is interesting in an inline function, since it might not need
648 to be compiled separately.
649 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
650 if the sdb debugging info for the type has been written.
651 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
652 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
654 /* Nonzero in a _DECL if the name is used in its scope.
655 Nonzero in an expr node means inhibit warning if value is unused.
656 In IDENTIFIER_NODEs, this means that some extern decl for this name
658 #define TREE_USED(NODE) ((NODE)->common.used_flag)
660 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
661 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
662 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
664 /* In a CALL_EXPR, means that the address of the return slot is part of the
666 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
668 /* In a type, nonzero means that all objects of the type are guaranteed by the
669 language or front-end to be properly aligned, so we can indicate that a MEM
670 of this type is aligned at least to the alignment of the type, even if it
671 doesn't appear that it is. We see this, for example, in object-oriented
672 languages where a tag field may show this is an object of a more-aligned
673 variant of the more generic type. */
674 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
676 /* Used in classes in C++. */
677 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
678 /* Used in classes in C++.
679 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
680 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
682 /* In a ..._TYPE node, nonzero means that the type's size and layout,
683 (or the size and layout of its arguments and/or return value in the
684 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
685 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
686 node is a type, because eventually we may make that a different
687 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
688 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
689 BOUNDED_INDIRECT_TYPE_P to test for that.
691 In a FUNCTION_DECL, nonzero means that the size and layout of one
692 of its arguments and/or return value was changed by the presence of
693 pointer bounds. This value can differ from the value of
694 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
695 declared, then later called with pointer args, or was declared with
696 a variable argument list and is later called with pointer values in
697 the variable argument list.
699 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
700 of the decl's type's BOUNDED_POINTER_TYPE_P.
702 In a CONSTRUCTOR or other expression, nonzero means the value is a
703 bounded pointer. It is insufficient to determine the boundedness
704 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
705 since we allow pointer to be temporarily cast to integer for
706 rounding up to an alignment boundary in a way that preserves the
709 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
710 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
711 of a function that has bounded pointer(s) for its return type and/or
714 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
716 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
717 deprecated feature by __attribute__((deprecated)). */
718 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
720 /* These flags are available for each language front end to use internally. */
721 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
722 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
723 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
724 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
725 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
726 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
727 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
729 /* Define additional fields and accessors for nodes representing constants. */
731 /* In an INTEGER_CST node. These two together make a 2-word integer.
732 If the data type is signed, the value is sign-extended to 2 words
733 even though not all of them may really be in use.
734 In an unsigned constant shorter than 2 words, the extra bits are 0. */
735 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
736 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
737 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
739 #define INT_CST_LT(A, B) \
740 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
741 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
742 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
744 #define INT_CST_LT_UNSIGNED(A, B) \
745 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
746 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
747 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
748 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
749 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
751 struct tree_int_cst GTY(())
753 struct tree_common common;
754 /* A sub-struct is necessary here because the function `const_hash'
755 wants to scan both words as a unit and taking the address of the
756 sub-struct yields the properly inclusive bounded pointer. */
757 struct tree_int_cst_lowhi {
758 unsigned HOST_WIDE_INT low;
763 /* In a REAL_CST node. struct real_value is an opaque entity, with
764 manipulators defined in real.h. We don't want tree.h depending on
765 real.h and transitively on tm.h. */
768 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
769 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
771 struct tree_real_cst GTY(())
773 struct tree_common common;
774 struct real_value * real_cst_ptr;
777 /* In a STRING_CST */
778 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
779 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
781 struct tree_string GTY(())
783 struct tree_common common;
788 /* In a COMPLEX_CST node. */
789 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
790 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
792 struct tree_complex GTY(())
794 struct tree_common common;
799 /* In a VECTOR_CST node. */
800 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
802 struct tree_vector GTY(())
804 struct tree_common common;
808 #include "hashtable.h"
810 /* Define fields and accessors for some special-purpose tree nodes. */
812 #define IDENTIFIER_LENGTH(NODE) \
813 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
814 #define IDENTIFIER_POINTER(NODE) \
815 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
816 #define IDENTIFIER_HASH_VALUE(NODE) \
817 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
819 /* Translate a hash table identifier pointer to a tree_identifier
820 pointer, and vice versa. */
822 #define HT_IDENT_TO_GCC_IDENT(NODE) \
823 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
824 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
826 struct tree_identifier GTY(())
828 struct tree_common common;
829 struct ht_identifier id;
832 /* In a TREE_LIST node. */
833 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
834 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
836 struct tree_list GTY(())
838 struct tree_common common;
843 /* In a TREE_VEC node. */
844 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
845 #define TREE_VEC_END(NODE) \
846 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
848 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
850 struct tree_vec GTY(())
852 struct tree_common common;
854 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
857 /* Define fields and accessors for some nodes that represent expressions. */
859 /* In a SAVE_EXPR node. */
860 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1)
861 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2)
863 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE))
864 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
865 both in normal code and in a handler. (Normally, in a handler, all
866 SAVE_EXPRs are unsaved, meaning that their values are
868 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
870 /* In a RTL_EXPR node. */
871 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0)
872 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1)
874 /* In a WITH_CLEANUP_EXPR node. */
875 #define WITH_CLEANUP_EXPR_RTL(NODE) \
876 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2)
878 /* In a CONSTRUCTOR node. */
879 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
881 /* In ordinary expression nodes. */
882 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
883 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
885 /* In a LABELED_BLOCK_EXPR node. */
886 #define LABELED_BLOCK_LABEL(NODE) \
887 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
888 #define LABELED_BLOCK_BODY(NODE) \
889 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
891 /* In an EXIT_BLOCK_EXPR node. */
892 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
893 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
894 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
896 /* In a LOOP_EXPR node. */
897 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
899 /* In an EXPR_WITH_FILE_LOCATION node. */
900 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
901 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
902 #define EXPR_WFL_NODE(NODE) \
903 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 0)
904 #define EXPR_WFL_FILENAME_NODE(NODE) \
905 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 1)
906 #define EXPR_WFL_FILENAME(NODE) \
907 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE))
908 /* ??? Java uses this in all expressions. */
909 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
910 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
911 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
912 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
913 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
915 /* In a TARGET_EXPR node. */
916 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
917 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
918 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
920 struct tree_exp GTY(())
922 struct tree_common common;
924 tree GTY ((special ("tree_exp"),
925 desc ("TREE_CODE ((tree) &%0)")))
929 /* In a BLOCK node. */
930 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
931 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
932 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
933 /* Note: when changing this, make sure to find the places
934 that use chainon or nreverse. */
935 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
936 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
937 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
939 /* Nonzero means that this block is prepared to handle exceptions
940 listed in the BLOCK_VARS slot. */
941 #define BLOCK_HANDLER_BLOCK(NODE) \
942 (BLOCK_CHECK (NODE)->block.handler_block_flag)
944 /* An index number for this block. These values are not guaranteed to
945 be unique across functions -- whether or not they are depends on
946 the debugging output format in use. */
947 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
949 /* If block reordering splits a lexical block into discontiguous
950 address ranges, we'll make a copy of the original block.
952 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
953 In that case, we have one source block that has been replicated
954 (through inlining or unrolling) into many logical blocks, and that
955 these logical blocks have different physical variables in them.
957 In this case, we have one logical block split into several
958 non-contiguous address ranges. Most debug formats can't actually
959 represent this idea directly, so we fake it by creating multiple
960 logical blocks with the same variables in them. However, for those
961 that do support non-contiguous regions, these allow the original
962 logical block to be reconstructed, along with the set of address
965 One of the logical block fragments is arbitrarily chosen to be
966 the ORIGIN. The other fragments will point to the origin via
967 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
968 be null. The list of fragments will be chained through
969 BLOCK_FRAGMENT_CHAIN from the origin. */
971 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
972 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
974 struct tree_block GTY(())
976 struct tree_common common;
978 unsigned handler_block_flag : 1;
979 unsigned abstract_flag : 1;
980 unsigned block_num : 30;
985 tree abstract_origin;
986 tree fragment_origin;
990 /* Define fields and accessors for nodes representing data types. */
992 /* See tree.def for documentation of the use of these fields.
993 Look at the documentation of the various ..._TYPE tree codes. */
995 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
996 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
997 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
998 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
999 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
1000 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
1001 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
1002 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
1003 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
1004 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
1005 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
1006 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
1007 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1008 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1009 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
1010 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
1011 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1012 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1013 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1014 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1015 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1016 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1017 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1018 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1019 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1021 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1022 in the debugging output. We use this to describe a vector as a
1023 structure containing an array. */
1024 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
1026 /* Indirect types present difficulties because they may be represented
1027 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
1028 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
1029 be logically equivalent, but physically different. Simple
1030 comparison of the main variant only tells if the types are
1031 logically equivalent. Use this predicate to compare for physical
1034 /* Types have the same main variant, and have the same boundedness. */
1035 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
1036 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
1037 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
1039 /* Return the type variant that has no qualifiers (i.e., the main variant),
1040 except that the boundedness qualifier is preserved. */
1041 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
1042 (BOUNDED_POINTER_TYPE_P (TYPE) \
1043 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
1044 : TYPE_MAIN_VARIANT (TYPE))
1046 /* For aggregate types, information about this type, as a base type
1047 for itself. Used in a language-dependent way for types that are
1048 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
1049 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
1051 /* The (language-specific) typed-based alias set for this type.
1052 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1053 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1054 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1055 type can alias objects of any type. */
1056 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1058 /* Nonzero iff the typed-based alias set for this type has been
1060 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1062 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1064 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1066 /* The alignment necessary for objects of this type.
1067 The value is an int, measured in bits. */
1068 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1070 /* 1 if the alignment for this type was requested by "aligned" attribute,
1071 0 if it is the default for this type. */
1072 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1074 /* The alignment for NODE, in bytes. */
1075 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1077 /* If your language allows you to declare types, and you want debug info
1078 for them, then you need to generate corresponding TYPE_DECL nodes.
1079 These "stub" TYPE_DECL nodes have no name, and simply point at the
1080 type node. You then set the TYPE_STUB_DECL field of the type node
1081 to point back at the TYPE_DECL node. This allows the debug routines
1082 to know that the two nodes represent the same type, so that we only
1083 get one debug info record for them. */
1084 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1086 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1087 has BLKmode only because it lacks the alignment requirement for
1089 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1091 /* In an INTEGER_TYPE, it means the type represents a size. We use
1092 this both for validity checking and to permit optimizations that
1093 are unsafe for other types. Note that the C `size_t' type should
1094 *not* have this flag set. The `size_t' type is simply a typedef
1095 for an ordinary integer type that happens to be the type of an
1096 expression returned by `sizeof'; `size_t' has no special
1097 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1098 always actual sizes. */
1099 #define TYPE_IS_SIZETYPE(NODE) \
1100 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1102 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1103 pointer depressed. */
1104 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1105 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1107 /* Nonzero in a type considered volatile as a whole. */
1108 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1110 /* Means this type is const-qualified. */
1111 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1113 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1115 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1117 /* If nonzero, this type's size and layout, (or the size and layout of
1118 its arguments and/or return value in the case of a FUNCTION_TYPE or
1119 METHOD_TYPE) was changed by the presence of pointer bounds. */
1120 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
1122 /* There is a TYPE_QUAL value for each type qualifier. They can be
1123 combined by bitwise-or to form the complete set of qualifiers for a
1126 #define TYPE_UNQUALIFIED 0x0
1127 #define TYPE_QUAL_CONST 0x1
1128 #define TYPE_QUAL_VOLATILE 0x2
1129 #define TYPE_QUAL_RESTRICT 0x4
1130 #define TYPE_QUAL_BOUNDED 0x8
1132 /* The set of type qualifiers for this type. */
1133 #define TYPE_QUALS(NODE) \
1134 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1135 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1136 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1137 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1139 /* The set of qualifiers pertinent to an expression node. */
1140 #define TREE_EXPR_QUALS(NODE) \
1141 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1142 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1143 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1145 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1146 #define TREE_FUNC_QUALS(NODE) \
1147 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1148 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1150 /* These flags are available for each language front end to use internally. */
1151 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1152 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1153 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1154 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1155 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1156 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1157 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1159 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1160 that distinguish string from array of char).
1161 If set in a SET_TYPE, indicates a bitstring type. */
1162 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1164 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1165 object of the given ARRAY_TYPE. This allows temporaries to be
1167 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1168 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE))
1170 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1171 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1172 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1174 /* Indicates that objects of this type must be initialized by calling a
1175 function when they are created. */
1176 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1177 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1179 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1180 the same way that the first union alternative would be passed. */
1181 #define TYPE_TRANSPARENT_UNION(NODE) \
1182 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1184 /* For an ARRAY_TYPE, indicates that it is not permitted to
1185 take the address of a component of the type. */
1186 #define TYPE_NONALIASED_COMPONENT(NODE) \
1187 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1189 /* Indicated that objects of this type should be laid out in as
1190 compact a way as possible. */
1191 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1193 /* A bounded pointer or bounded reference type (collectively called
1194 indirect types) is represented as a RECORD_TYPE node containing
1195 three pointer fields whose type is the corresponding unbounded
1196 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1197 a bounded indirect type differs from a normal RECORD_TYPE node in
1198 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1199 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1200 nodes are stored on the same type variant chain alongside the
1201 variants of the underlaying indirect types nodes. The main variant
1202 of such chains is always the unbounded type. */
1204 /* Access the field decls of a bounded-pointer type. */
1205 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1206 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1207 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1209 /* Access the simple-pointer subtype of a bounded-pointer type. */
1210 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1212 /* Find the unbounded counterpart to a type, or return TYPE if it is
1213 already unbounded. */
1214 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1215 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1217 /* This field comprises two bits, for values in the range 0..3:
1219 depth=0 means that type is a scalar, or an aggregate that contains
1220 only depth=0 types, or a function that has only depth=0 types for
1221 its return value and argument types.
1223 depth=1 means that type is a pointer to a depth=0 type, or an
1224 aggregate that contains only depth=0 and depth=1 types, or a
1225 function that has only depth=0 and depth=1 types for its return
1226 value and argument types.
1228 The meanings of depth=2 and depth=3 are obvious by induction.
1229 Varargs functions are depth=3. The type `va_list' is depth=3.
1231 The purpose of measuring pointer depth of a type is to determine
1232 the eligibility of a function for an automatically-generated
1233 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1234 depth=1 function is eligible for an automatic thunk. Functions
1235 with depth 2 or more are too complex to get automatic thunks.
1237 Function decls also have a pointer_depth field, since we also
1238 consider the actual argument types for functions. */
1240 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1242 /* In a FUNCTION_TYPE node, this bit stores the value of
1243 default_pointer_boundedness at the time TYPE was created. It is
1244 useful for choosing default boundedness of function arguments for
1245 non-prototype function decls and for varargs/stdarg lists. */
1246 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1247 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1249 #define MAX_POINTER_DEPTH 2
1250 #define VA_LIST_POINTER_DEPTH 3
1254 struct tree_type GTY(())
1256 struct tree_common common;
1263 unsigned int precision : 9;
1264 ENUM_BITFIELD(machine_mode) mode : 7;
1266 unsigned string_flag : 1;
1267 unsigned no_force_blk_flag : 1;
1268 unsigned needs_constructing_flag : 1;
1269 unsigned transparent_union_flag : 1;
1270 unsigned packed_flag : 1;
1271 unsigned restrict_flag : 1;
1272 unsigned pointer_depth : 2;
1274 unsigned lang_flag_0 : 1;
1275 unsigned lang_flag_1 : 1;
1276 unsigned lang_flag_2 : 1;
1277 unsigned lang_flag_3 : 1;
1278 unsigned lang_flag_4 : 1;
1279 unsigned lang_flag_5 : 1;
1280 unsigned lang_flag_6 : 1;
1281 unsigned user_align : 1;
1286 union tree_type_symtab {
1287 int GTY ((tag ("0"))) address;
1288 char * GTY ((tag ("1"))) pointer;
1289 struct die_struct * GTY ((tag ("2"))) die;
1290 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1291 descbits ("2"))) symtab;
1299 HOST_WIDE_INT alias_set;
1300 /* Points to a structure whose details depend on the language in use. */
1301 struct lang_type *lang_specific;
1304 /* Define accessor macros for information about type inheritance
1307 A "basetype" means a particular usage of a data type for inheritance
1308 in another type. Each such basetype usage has its own "binfo"
1309 object to describe it. The binfo object is a TREE_VEC node.
1311 Inheritance is represented by the binfo nodes allocated for a
1312 given type. For example, given types C and D, such that D is
1313 inherited by C, 3 binfo nodes will be allocated: one for describing
1314 the binfo properties of C, similarly one for D, and one for
1315 describing the binfo properties of D as a base type for C.
1316 Thus, given a pointer to class C, one can get a pointer to the binfo
1317 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1319 /* The actual data type node being inherited in this basetype. */
1320 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1322 /* The offset where this basetype appears in its containing type.
1323 BINFO_OFFSET slot holds the offset (in bytes)
1324 from the base of the complete object to the base of the part of the
1325 object that is allocated on behalf of this `type'.
1326 This is always 0 except when there is multiple inheritance. */
1328 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1329 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1330 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1332 /* The virtual function table belonging to this basetype. Virtual
1333 function tables provide a mechanism for run-time method dispatching.
1334 The entries of a virtual function table are language-dependent. */
1336 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1337 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1339 /* The virtual functions in the virtual function table. This is
1340 a TREE_LIST that is used as an initial approximation for building
1341 a virtual function table for this basetype. */
1342 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1343 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1345 /* A vector of binfos for the direct basetypes inherited by this
1348 If this basetype describes type D as inherited in C, and if the
1349 basetypes of D are E and F, then this vector contains binfos for
1350 inheritance of E and F by C.
1352 ??? This could probably be done by just allocating the
1353 base types at the end of this TREE_VEC (instead of using
1354 another TREE_VEC). This would simplify the calculation
1355 of how many basetypes a given type had. */
1356 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1357 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1359 /* The number of basetypes for NODE. */
1360 #define BINFO_N_BASETYPES(NODE) \
1361 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1363 /* Accessor macro to get to the Nth basetype of this basetype. */
1364 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1365 #define TYPE_BINFO_BASETYPE(NODE,N) \
1366 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1368 /* For a BINFO record describing a virtual base class, i.e., one where
1369 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1370 base. The actual contents are language-dependent. In the C++
1371 front-end this field is an INTEGER_CST giving an offset into the
1372 vtable where the offset to the virtual base can be found. */
1373 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1375 /* Indicates the accesses this binfo has to its bases. The values are
1376 access_public_node, access_protected_node or access_private_node.
1377 If this array is not present, public access is implied. */
1378 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1379 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1381 /* Number of language independent elements in a binfo. Languages may
1382 add additional trailing elements. */
1384 #define BINFO_ELTS 7
1386 /* Slot used to build a chain that represents a use of inheritance.
1387 For example, if X is derived from Y, and Y is derived from Z,
1388 then this field can be used to link the binfo node for X to
1389 the binfo node for X's Y to represent the use of inheritance
1390 from X to Y. Similarly, this slot of the binfo node for X's Y
1391 can point to the Z from which Y is inherited (in X's inheritance
1392 hierarchy). In this fashion, one can represent and traverse specific
1393 uses of inheritance using the binfo nodes themselves (instead of
1394 consing new space pointing to binfo nodes).
1395 It is up to the language-dependent front-ends to maintain
1396 this information as necessary. */
1397 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1399 /* Define fields and accessors for nodes representing declared names. */
1401 /* Nonzero if DECL represents a decl. */
1402 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1404 /* This is the name of the object as written by the user.
1405 It is an IDENTIFIER_NODE. */
1406 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1408 /* The name of the object as the assembler will see it (but before any
1409 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1410 as DECL_NAME. It is an IDENTIFIER_NODE. */
1411 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1413 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1414 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1416 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1417 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1419 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1420 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1421 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1423 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1424 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1425 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1426 semantics of using this macro, are different than saying:
1428 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1430 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1432 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1433 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1434 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1435 DECL_ASSEMBLER_NAME (DECL1)) \
1438 /* Records the section name in a section attribute. Used to pass
1439 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1440 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1442 /* For FIELD_DECLs, this is the
1443 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1444 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1445 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1446 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1447 type, or NULL_TREE if the given decl has "file scope". */
1448 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1449 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1450 /* In a DECL this is the field where attributes are stored. */
1451 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1452 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1453 byte containing the bit closest to the beginning of the structure. */
1454 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1455 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1456 field from DECL_FIELD_OFFSET. */
1457 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1458 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1459 if so, the type that was originally specified for it.
1460 TREE_TYPE may have been modified (in finish_struct). */
1461 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1462 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1463 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1465 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1466 /* This field is used to reference anything in decl.result and is meant only
1467 for use by the garbage collector. */
1468 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1469 /* In FUNCTION_DECL, holds the decl for the return value. */
1470 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1471 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1472 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1473 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1474 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1475 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1476 For a VAR_DECL, holds the initial value.
1477 For a PARM_DECL, not used--default
1478 values for parameters are encoded in the type of the function,
1479 not in the PARM_DECL slot. */
1480 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1481 /* For a PARM_DECL, records the data type used to pass the argument,
1482 which may be different from the type seen in the program. */
1483 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1484 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1485 if nonzero, indicates that the field occupies the type. */
1486 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1487 /* These two fields describe where in the source code the declaration
1488 was. If the declaration appears in several places (as for a C
1489 function that is declared first and then defined later), this
1490 information should refer to the definition. */
1491 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1492 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1493 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1494 /* Holds the size of the datum, in bits, as a tree expression.
1495 Need not be constant. */
1496 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1497 /* Likewise for the size in bytes. */
1498 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1499 /* Holds the alignment required for the datum, in bits. */
1500 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1501 /* The alignment of NODE, in bytes. */
1502 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1503 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1504 DECL_FIELD_OFFSET which are known to be always zero.
1505 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1507 #define DECL_OFFSET_ALIGN(NODE) \
1508 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1509 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1510 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1511 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1512 /* 1 if the alignment for this type was requested by "aligned" attribute,
1513 0 if it is the default for this type. */
1514 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1515 /* Holds the machine mode corresponding to the declaration of a variable or
1516 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1518 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1519 /* Holds the RTL expression for the value of a variable or function. If
1520 PROMOTED_MODE is defined, the mode of this expression may not be same
1521 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1522 to the variable's data type, while the mode
1523 of DECL_RTL is the mode actually used to contain the data.
1525 This value can be evaluated lazily for functions, variables with
1526 static storage duration, and labels. */
1527 #define DECL_RTL(NODE) \
1528 (DECL_CHECK (NODE)->decl.rtl \
1529 ? (NODE)->decl.rtl \
1530 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1531 /* Set the DECL_RTL for NODE to RTL. */
1532 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1533 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1534 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1535 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1536 NODE1, it will not be set for NODE2; this is a lazy copy. */
1537 #define COPY_DECL_RTL(NODE1, NODE2) \
1538 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1539 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1540 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1542 /* For PARM_DECL, holds an RTL for the stack slot or register
1543 where the data was actually passed. */
1544 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1546 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1547 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1549 /* For FUNCTION_DECL, if it is built-in,
1550 this identifies which built-in operation it is. */
1551 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1553 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1554 Before the struct containing the FUNCTION_DECL is laid out,
1555 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1556 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1557 function. When the class is laid out, this pointer is changed
1558 to an INTEGER_CST node which is suitable for use as an index
1559 into the virtual function table. */
1560 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1562 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1563 which this FIELD_DECL is defined. This information is needed when
1564 writing debugging information about vfield and vbase decls for C++. */
1565 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1567 /* Every ..._DECL node gets a unique number. */
1568 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1570 /* For any sort of a ..._DECL node, this points to the original (abstract)
1571 decl node which this decl is an instance of, or else it is NULL indicating
1572 that this decl is not an instance of some other decl. For example,
1573 in a nested declaration of an inline function, this points back to the
1575 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1577 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1578 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1579 #define DECL_ORIGIN(NODE) \
1580 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1582 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1583 inline instance of some original (abstract) decl from an inline function;
1584 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1585 nodes can also have their abstract origin set to themselves. */
1586 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1587 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1589 /* Nonzero if a _DECL means that the name of this decl should be ignored
1590 for symbolic debug purposes. */
1591 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1593 /* Nonzero for a given ..._DECL node means that this node represents an
1594 "abstract instance" of the given declaration (e.g. in the original
1595 declaration of an inline function). When generating symbolic debugging
1596 information, we mustn't try to generate any address information for nodes
1597 marked as "abstract instances" because we don't actually generate
1598 any code or allocate any data space for such instances. */
1599 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1601 /* Nonzero if a _DECL means that no warnings should be generated just
1602 because this decl is unused. */
1603 #define DECL_IN_SYSTEM_HEADER(NODE) \
1604 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1606 /* Nonzero for a given ..._DECL node means that this node should be
1607 put in .common, if possible. If a DECL_INITIAL is given, and it
1608 is not error_mark_node, then the decl cannot be put in .common. */
1609 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1611 /* Language-specific decl information. */
1612 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1614 /* In a VAR_DECL or FUNCTION_DECL,
1615 nonzero means external reference:
1616 do not allocate storage, and refer to a definition elsewhere. */
1617 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1619 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1621 #define DEFAULT_INIT_PRIORITY 65535
1622 #define MAX_INIT_PRIORITY 65535
1623 #define MAX_RESERVED_INIT_PRIORITY 100
1626 nonzero means the detail info about this type is not dumped into stabs.
1627 Instead it will generate cross reference ('x') of names.
1628 This uses the same flag as DECL_EXTERNAL. */
1629 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1630 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1632 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1633 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1635 /* In LABEL_DECL nodes, nonzero means that an error message about
1636 jumping into such a binding contour has been printed for this label. */
1637 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1639 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1640 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1642 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1643 static chain is not needed. */
1644 #define DECL_NO_STATIC_CHAIN(NODE) \
1645 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1647 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1648 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1650 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1652 Also set in some languages for variables, etc., outside the normal
1653 lexical scope, such as class instance variables. */
1654 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1656 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1657 where it is called. */
1658 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1660 /* Nonzero in a FUNCTION_DECL means this function has been found inlinable
1661 only by virtue of -finline-functions */
1662 #define DID_INLINE_FUNC(NODE) \
1663 (FUNCTION_DECL_CHECK (NODE)->decl.inlined_function_flag)
1665 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1666 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1668 /* In a VAR_DECL, nonzero if the data should be allocated from
1669 thread-local storage. */
1670 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1672 /* In a FUNCTION_DECL, the saved representation of the body of the
1673 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1674 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1675 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1677 /* List of FUNCTION_DECLs inlined into this function's body. */
1678 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1680 /* Nonzero in a FUNCTION_DECL means this function should be treated
1681 as if it were a malloc, meaning it returns a pointer that is
1683 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1685 /* Nonzero in a FUNCTION_DECL means this function should be treated
1686 as "pure" function (like const function, but may read global memory). */
1687 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1689 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1691 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1693 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1694 contour that restored a stack level and which is now exited. */
1695 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1697 /* Unused in FUNCTION_DECL. */
1699 /* In a VAR_DECL that's static,
1700 nonzero if the space is in the text section. */
1701 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1703 /* In a FUNCTION_DECL, nonzero means a built in function. */
1704 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1706 /* For a builtin function, identify which part of the compiler defined it. */
1707 #define DECL_BUILT_IN_CLASS(NODE) \
1708 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1710 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1711 Used in FIELD_DECLs for vtable pointers.
1712 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1713 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1715 /* Used to indicate that the linkage status of this DECL is not yet known,
1716 so it should not be output now. */
1717 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1719 /* Used in PARM_DECLs whose type are unions to indicate that the
1720 argument should be passed in the same way that the first union
1721 alternative would be passed. */
1722 #define DECL_TRANSPARENT_UNION(NODE) \
1723 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1725 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1726 at the beginning or end of execution. */
1727 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1728 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1730 #define DECL_STATIC_DESTRUCTOR(NODE) \
1731 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1733 /* Used to indicate that this DECL represents a compiler-generated entity. */
1734 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1736 /* Used to indicate that this DECL has weak linkage. */
1737 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1739 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1740 multiple translation units should be merged. */
1741 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1743 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1744 not be put out unless it is needed in this translation unit.
1745 Entities like this are shared across translation units (like weak
1746 entities), but are guaranteed to be generated by any translation
1747 unit that needs them, and therefore need not be put out anywhere
1748 where they are not needed. DECL_COMDAT is just a hint to the
1749 back-end; it is up to front-ends which set this flag to ensure
1750 that there will never be any harm, other than bloat, in putting out
1751 something which is DECL_COMDAT. */
1752 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1754 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1755 be instrumented with calls to support routines. */
1756 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1757 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1759 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1760 disabled in this function. */
1761 #define DECL_NO_LIMIT_STACK(NODE) \
1762 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1764 /* Additional flags for language-specific uses. */
1765 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1766 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1767 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1768 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1769 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1770 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1771 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1772 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1774 /* Used to indicate that the pointer to this DECL cannot be treated as
1775 an address constant. */
1776 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1778 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1780 #define DECL_NONADDRESSABLE_P(NODE) \
1781 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1783 /* Used to indicate an alias set for the memory pointed to by this
1784 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1785 pointer (or reference) type. */
1786 #define DECL_POINTER_ALIAS_SET(NODE) \
1787 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1789 /* Nonzero if an alias set has been assigned to this declaration. */
1790 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1791 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1795 struct tree_decl GTY(())
1797 struct tree_common common;
1801 ENUM_BITFIELD(machine_mode) mode : 8;
1803 unsigned external_flag : 1;
1804 unsigned nonlocal_flag : 1;
1805 unsigned regdecl_flag : 1;
1806 unsigned inline_flag : 1;
1807 unsigned bit_field_flag : 1;
1808 unsigned virtual_flag : 1;
1809 unsigned ignored_flag : 1;
1810 unsigned abstract_flag : 1;
1812 unsigned in_system_header_flag : 1;
1813 unsigned common_flag : 1;
1814 unsigned defer_output : 1;
1815 unsigned transparent_union : 1;
1816 unsigned static_ctor_flag : 1;
1817 unsigned static_dtor_flag : 1;
1818 unsigned artificial_flag : 1;
1819 unsigned weak_flag : 1;
1821 unsigned non_addr_const_p : 1;
1822 unsigned no_instrument_function_entry_exit : 1;
1823 unsigned comdat_flag : 1;
1824 unsigned malloc_flag : 1;
1825 unsigned no_limit_stack : 1;
1826 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1827 unsigned pure_flag : 1;
1829 unsigned non_addressable : 1;
1830 unsigned user_align : 1;
1831 unsigned uninlinable : 1;
1832 unsigned thread_local_flag : 1;
1833 unsigned inlined_function_flag : 1;
1834 unsigned unused : 3;
1835 /* three unused bits. */
1837 unsigned lang_flag_0 : 1;
1838 unsigned lang_flag_1 : 1;
1839 unsigned lang_flag_2 : 1;
1840 unsigned lang_flag_3 : 1;
1841 unsigned lang_flag_4 : 1;
1842 unsigned lang_flag_5 : 1;
1843 unsigned lang_flag_6 : 1;
1844 unsigned lang_flag_7 : 1;
1846 union tree_decl_u1 {
1847 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1848 DECL_FUNCTION_CODE. */
1849 enum built_in_function f;
1850 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
1851 is used by language-dependent code. */
1853 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1855 struct tree_decl_u1_a {
1856 unsigned int align : 24;
1857 unsigned int off_align : 8;
1859 } GTY ((skip (""))) u1;
1864 tree arguments; /* Also used for DECL_FIELD_OFFSET */
1865 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
1866 tree initial; /* Also used for DECL_QUALIFIER */
1867 tree abstract_origin;
1868 tree assembler_name;
1871 rtx rtl; /* RTL representation for object. */
1873 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1874 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1875 In PARM_DECL, holds an RTL for the stack slot
1876 of register where the data was actually passed.
1877 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1878 union tree_decl_u2 {
1879 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
1880 rtx GTY ((tag ("PARM_DECL"))) r;
1881 tree GTY ((tag ("FIELD_DECL"))) t;
1882 int GTY ((tag ("VAR_DECL"))) i;
1883 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
1885 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1888 /* In a FUNCTION_DECL, these are function data which is to be kept
1889 as long as FUNCTION_DECL is kept. */
1893 HOST_WIDE_INT pointer_alias_set;
1894 /* Points to a structure whose details depend on the language in use. */
1895 struct lang_decl *lang_specific;
1898 enum tree_node_structure_enum {
1915 /* Define the overall contents of a tree node.
1916 It may be any of the structures declared above
1917 for various types of node. */
1919 union tree_node GTY ((ptr_alias (union lang_tree_node),
1920 desc ("tree_node_structure (&%h)")))
1922 struct tree_common GTY ((tag ("TS_COMMON"))) common;
1923 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
1924 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
1925 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
1926 struct tree_string GTY ((tag ("TS_STRING"))) string;
1927 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
1928 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
1929 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
1930 struct tree_type GTY ((tag ("TS_TYPE"))) type;
1931 struct tree_list GTY ((tag ("TS_LIST"))) list;
1932 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
1933 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
1934 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
1937 /* Standard named or nameless data types of the C compiler. */
1956 TI_INTEGER_MINUS_ONE,
1966 TI_COMPLEX_INTEGER_TYPE,
1967 TI_COMPLEX_FLOAT_TYPE,
1968 TI_COMPLEX_DOUBLE_TYPE,
1969 TI_COMPLEX_LONG_DOUBLE_TYPE,
1973 TI_LONG_DOUBLE_TYPE,
2015 extern GTY(()) tree global_trees[TI_MAX];
2017 #define error_mark_node global_trees[TI_ERROR_MARK]
2019 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2020 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2021 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2022 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2023 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2025 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2026 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2027 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2028 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2029 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2031 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2032 #define integer_one_node global_trees[TI_INTEGER_ONE]
2033 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2034 #define size_zero_node global_trees[TI_SIZE_ZERO]
2035 #define size_one_node global_trees[TI_SIZE_ONE]
2036 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2037 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2038 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2040 /* Base access nodes. */
2041 #define access_public_node NULL_TREE
2042 #define access_protected_node size_zero_node
2043 #define access_private_node size_one_node
2045 #define null_pointer_node global_trees[TI_NULL_POINTER]
2047 #define float_type_node global_trees[TI_FLOAT_TYPE]
2048 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2049 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2051 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2052 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2053 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2054 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2056 #define void_type_node global_trees[TI_VOID_TYPE]
2057 /* The C type `void *'. */
2058 #define ptr_type_node global_trees[TI_PTR_TYPE]
2059 /* The C type `const void *'. */
2060 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2061 /* The C type `size_t'. */
2062 #define size_type_node global_trees[TI_SIZE_TYPE]
2063 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2064 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2066 /* The node that should be placed at the end of a parameter list to
2067 indicate that the function does not take a variable number of
2068 arguments. The TREE_VALUE will be void_type_node and there will be
2069 no TREE_CHAIN. Language-independent code should not assume
2070 anything else about this node. */
2071 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2073 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2074 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2076 #define unsigned_V16QI_type_node global_trees[TI_UV16QI_TYPE]
2077 #define unsigned_V4SI_type_node global_trees[TI_UV4SI_TYPE]
2078 #define unsigned_V8QI_type_node global_trees[TI_UV8QI_TYPE]
2079 #define unsigned_V8HI_type_node global_trees[TI_UV8HI_TYPE]
2080 #define unsigned_V4HI_type_node global_trees[TI_UV4HI_TYPE]
2081 #define unsigned_V2HI_type_node global_trees[TI_UV2HI_TYPE]
2082 #define unsigned_V2SI_type_node global_trees[TI_UV2SI_TYPE]
2083 #define unsigned_V2DI_type_node global_trees[TI_UV2DI_TYPE]
2084 #define unsigned_V1DI_type_node global_trees[TI_UV1DI_TYPE]
2086 #define V16QI_type_node global_trees[TI_V16QI_TYPE]
2087 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
2088 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
2089 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
2090 #define V8HI_type_node global_trees[TI_V8HI_TYPE]
2091 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
2092 #define V2HI_type_node global_trees[TI_V2HI_TYPE]
2093 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
2094 #define V2SF_type_node global_trees[TI_V2SF_TYPE]
2095 #define V2DI_type_node global_trees[TI_V2DI_TYPE]
2096 #define V2DF_type_node global_trees[TI_V2DF_TYPE]
2097 #define V16SF_type_node global_trees[TI_V16SF_TYPE]
2098 #define V1DI_type_node global_trees[TI_V1DI_TYPE]
2100 /* An enumeration of the standard C integer types. These must be
2101 ordered so that shorter types appear before longer ones, and so
2102 that signed types appear before unsigned ones, for the correct
2103 functioning of interpret_integer() in c-lex.c. */
2104 enum integer_type_kind
2116 itk_unsigned_long_long,
2120 typedef enum integer_type_kind integer_type_kind;
2122 /* The standard C integer types. Use integer_type_kind to index into
2124 extern GTY(()) tree integer_types[itk_none];
2126 #define char_type_node integer_types[itk_char]
2127 #define signed_char_type_node integer_types[itk_signed_char]
2128 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2129 #define short_integer_type_node integer_types[itk_short]
2130 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2131 #define integer_type_node integer_types[itk_int]
2132 #define unsigned_type_node integer_types[itk_unsigned_int]
2133 #define long_integer_type_node integer_types[itk_long]
2134 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2135 #define long_long_integer_type_node integer_types[itk_long_long]
2136 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2138 /* Set to the default thread-local storage (tls) model to use. */
2141 TLS_MODEL_GLOBAL_DYNAMIC = 1,
2142 TLS_MODEL_LOCAL_DYNAMIC,
2143 TLS_MODEL_INITIAL_EXEC,
2144 TLS_MODEL_LOCAL_EXEC
2147 extern enum tls_model flag_tls_default;
2149 /* Enumerate visibility settings. */
2151 enum symbol_visibility
2154 VISIBILITY_INTERNAL,
2156 VISIBILITY_PROTECTED
2159 /* A pointer-to-function member type looks like:
2166 If __pfn is NULL, it is a NULL pointer-to-member-function.
2168 (Because the vtable is always the first thing in the object, we
2169 don't need its offset.) If the function is virtual, then PFN is
2170 one plus twice the index into the vtable; otherwise, it is just a
2171 pointer to the function.
2173 Unfortunately, using the lowest bit of PFN doesn't work in
2174 architectures that don't impose alignment requirements on function
2175 addresses, or that use the lowest bit to tell one ISA from another,
2176 for example. For such architectures, we use the lowest bit of
2177 DELTA instead of the lowest bit of the PFN, and DELTA will be
2180 enum ptrmemfunc_vbit_where_t
2182 ptrmemfunc_vbit_in_pfn,
2183 ptrmemfunc_vbit_in_delta
2186 #define NULL_TREE (tree) NULL
2188 /* Approximate positive square root of a host double. This is for
2189 statistical reports, not code generation. */
2190 extern double approx_sqrt PARAMS ((double));
2192 extern tree decl_assembler_name PARAMS ((tree));
2194 /* Compute the number of bytes occupied by 'node'. This routine only
2195 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2197 extern size_t tree_size PARAMS ((tree));
2199 /* Lowest level primitive for allocating a node.
2200 The TREE_CODE is the only argument. Contents are initialized
2201 to zero except for a few of the common fields. */
2203 extern tree make_node PARAMS ((enum tree_code));
2205 /* Make a copy of a node, with all the same contents. */
2207 extern tree copy_node PARAMS ((tree));
2209 /* Make a copy of a chain of TREE_LIST nodes. */
2211 extern tree copy_list PARAMS ((tree));
2213 /* Make a TREE_VEC. */
2215 extern tree make_tree_vec PARAMS ((int));
2217 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2218 The name is supplied as a char *. */
2220 extern tree get_identifier PARAMS ((const char *));
2222 /* Identical to get_identifier, except that the length is assumed
2225 extern tree get_identifier_with_length PARAMS ((const char *, unsigned int));
2227 /* If an identifier with the name TEXT (a null-terminated string) has
2228 previously been referred to, return that node; otherwise return
2231 extern tree maybe_get_identifier PARAMS ((const char *));
2233 /* Construct various types of nodes. */
2235 #define build_int_2(LO, HI) \
2236 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2238 extern tree build PARAMS ((enum tree_code, tree, ...));
2239 extern tree build_nt PARAMS ((enum tree_code, ...));
2241 extern tree build_int_2_wide PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT));
2242 extern tree build_vector PARAMS ((tree, tree));
2243 extern tree build_constructor PARAMS ((tree, tree));
2244 extern tree build_real_from_int_cst PARAMS ((tree, tree));
2245 extern tree build_complex PARAMS ((tree, tree, tree));
2246 extern tree build_string PARAMS ((int, const char *));
2247 extern tree build1 PARAMS ((enum tree_code, tree, tree));
2248 extern tree build_tree_list PARAMS ((tree, tree));
2249 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
2250 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
2251 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
2253 /* Construct various nodes representing data types. */
2255 extern tree make_signed_type PARAMS ((int));
2256 extern tree make_unsigned_type PARAMS ((int));
2257 extern void initialize_sizetypes PARAMS ((void));
2258 extern void set_sizetype PARAMS ((tree));
2259 extern void fixup_unsigned_type PARAMS ((tree));
2260 extern tree build_pointer_type_for_mode PARAMS ((tree, enum machine_mode));
2261 extern tree build_pointer_type PARAMS ((tree));
2262 extern tree build_reference_type_for_mode PARAMS ((tree, enum machine_mode));
2263 extern tree build_reference_type PARAMS ((tree));
2264 extern tree build_type_no_quals PARAMS ((tree));
2265 extern tree build_index_type PARAMS ((tree));
2266 extern tree build_index_2_type PARAMS ((tree, tree));
2267 extern tree build_array_type PARAMS ((tree, tree));
2268 extern tree build_function_type PARAMS ((tree, tree));
2269 extern tree build_function_type_list PARAMS ((tree, ...));
2270 extern tree build_method_type PARAMS ((tree, tree));
2271 extern tree build_offset_type PARAMS ((tree, tree));
2272 extern tree build_complex_type PARAMS ((tree));
2273 extern tree array_type_nelts PARAMS ((tree));
2275 extern tree value_member PARAMS ((tree, tree));
2276 extern tree purpose_member PARAMS ((tree, tree));
2277 extern tree binfo_member PARAMS ((tree, tree));
2278 extern unsigned int attribute_hash_list PARAMS ((tree));
2279 extern int attribute_list_equal PARAMS ((tree, tree));
2280 extern int attribute_list_contained PARAMS ((tree, tree));
2281 extern int tree_int_cst_equal PARAMS ((tree, tree));
2282 extern int tree_int_cst_lt PARAMS ((tree, tree));
2283 extern int tree_int_cst_compare PARAMS ((tree, tree));
2284 extern int host_integerp PARAMS ((tree, int));
2285 extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
2286 extern int tree_int_cst_msb PARAMS ((tree));
2287 extern int tree_int_cst_sgn PARAMS ((tree));
2288 extern int tree_expr_nonnegative_p PARAMS ((tree));
2289 extern int rtl_expr_nonnegative_p PARAMS ((rtx));
2290 extern tree get_inner_array_type PARAMS ((tree));
2292 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2293 put the prototype here. Rtl.h does declare the prototype if
2294 tree.h had been included. */
2296 extern tree make_tree PARAMS ((tree, rtx));
2298 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2301 Such modified types already made are recorded so that duplicates
2304 extern tree build_type_attribute_variant PARAMS ((tree, tree));
2305 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
2307 /* Structure describing an attribute and a function to handle it. */
2308 struct attribute_spec
2310 /* The name of the attribute (without any leading or trailing __),
2311 or NULL to mark the end of a table of attributes. */
2312 const char *const name;
2313 /* The minimum length of the list of arguments of the attribute. */
2314 const int min_length;
2315 /* The maximum length of the list of arguments of the attribute
2316 (-1 for no maximum). */
2317 const int max_length;
2318 /* Whether this attribute requires a DECL. If it does, it will be passed
2319 from types of DECLs, function return types and array element types to
2320 the DECLs, function types and array types respectively; but when
2321 applied to a type in any other circumstances, it will be ignored with
2322 a warning. (If greater control is desired for a given attribute,
2323 this should be false, and the flags argument to the handler may be
2324 used to gain greater control in that case.) */
2325 const bool decl_required;
2326 /* Whether this attribute requires a type. If it does, it will be passed
2327 from a DECL to the type of that DECL. */
2328 const bool type_required;
2329 /* Whether this attribute requires a function (or method) type. If it does,
2330 it will be passed from a function pointer type to the target type,
2331 and from a function return type (which is not itself a function
2332 pointer type) to the function type. */
2333 const bool function_type_required;
2334 /* Function to handle this attribute. NODE points to the node to which
2335 the attribute is to be applied. If a DECL, it should be modified in
2336 place; if a TYPE, a copy should be created. NAME is the name of the
2337 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2338 of the arguments (which may be NULL). FLAGS gives further information
2339 about the context of the attribute. Afterwards, the attributes will
2340 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2341 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2342 as well as in any other cases when the attributes should not be added
2343 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2344 applied to another type or DECL later may be returned;
2345 otherwise the return value should be NULL_TREE. This pointer may be
2346 NULL if no special handling is required beyond the checks implied
2347 by the rest of this structure. */
2348 tree (*const handler) PARAMS ((tree *node, tree name, tree args,
2349 int flags, bool *no_add_attrs));
2352 /* Flags that may be passed in the third argument of decl_attributes, and
2353 to handler functions for attributes. */
2354 enum attribute_flags
2356 /* The type passed in is the type of a DECL, and any attributes that
2357 should be passed in again to be applied to the DECL rather than the
2358 type should be returned. */
2359 ATTR_FLAG_DECL_NEXT = 1,
2360 /* The type passed in is a function return type, and any attributes that
2361 should be passed in again to be applied to the function type rather
2362 than the return type should be returned. */
2363 ATTR_FLAG_FUNCTION_NEXT = 2,
2364 /* The type passed in is an array element type, and any attributes that
2365 should be passed in again to be applied to the array type rather
2366 than the element type should be returned. */
2367 ATTR_FLAG_ARRAY_NEXT = 4,
2368 /* The type passed in is a structure, union or enumeration type being
2369 created, and should be modified in place. */
2370 ATTR_FLAG_TYPE_IN_PLACE = 8,
2371 /* The attributes are being applied by default to a library function whose
2372 name indicates known behavior, and should be silently ignored if they
2373 are not in fact compatible with the function type. */
2374 ATTR_FLAG_BUILT_IN = 16
2377 /* Default versions of target-overridable functions. */
2379 extern tree merge_decl_attributes PARAMS ((tree, tree));
2380 extern tree merge_type_attributes PARAMS ((tree, tree));
2381 extern void default_register_cpp_builtins PARAMS ((struct cpp_reader *));
2383 /* Split a list of declspecs and attributes into two. */
2385 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2387 /* Strip attributes from a list of combined specs and attrs. */
2389 extern tree strip_attrs PARAMS ((tree));
2391 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2393 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
2395 /* Given a tree node and a string, return nonzero if the tree node is
2396 a valid attribute name for the string. */
2398 extern int is_attribute_p PARAMS ((const char *, tree));
2400 /* Given an attribute name and a list of attributes, return the list element
2401 of the attribute or NULL_TREE if not found. */
2403 extern tree lookup_attribute PARAMS ((const char *, tree));
2405 /* Given two attributes lists, return a list of their union. */
2407 extern tree merge_attributes PARAMS ((tree, tree));
2409 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2410 /* Given two Windows decl attributes lists, possibly including
2411 dllimport, return a list of their union . */
2412 extern tree merge_dllimport_decl_attributes PARAMS ((tree, tree));
2415 /* Return a version of the TYPE, qualified as indicated by the
2416 TYPE_QUALS, if one exists. If no qualified version exists yet,
2417 return NULL_TREE. */
2419 extern tree get_qualified_type PARAMS ((tree, int));
2421 /* Like get_qualified_type, but creates the type if it does not
2422 exist. This function never returns NULL_TREE. */
2424 extern tree build_qualified_type PARAMS ((tree, int));
2426 /* Like build_qualified_type, but only deals with the `const' and
2427 `volatile' qualifiers. This interface is retained for backwards
2428 compatibility with the various front-ends; new code should use
2429 build_qualified_type instead. */
2431 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2432 build_qualified_type ((TYPE), \
2433 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2434 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2436 /* Make a copy of a type node. */
2438 extern tree build_type_copy PARAMS ((tree));
2440 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2441 fields. Optionally specify an alignment, and then lsy it out. */
2443 extern void finish_builtin_struct PARAMS ((tree, const char *,
2446 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2447 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2448 node, does nothing except for the first time. */
2450 extern void layout_type PARAMS ((tree));
2452 /* These functions allow a front-end to perform a manual layout of a
2453 RECORD_TYPE. (For instance, if the placement of subsequent fields
2454 depends on the placement of fields so far.) Begin by calling
2455 start_record_layout. Then, call place_field for each of the
2456 fields. Then, call finish_record_layout. See layout_type for the
2457 default way in which these functions are used. */
2459 typedef struct record_layout_info_s
2461 /* The RECORD_TYPE that we are laying out. */
2463 /* The offset into the record so far, in bytes, not including bits in
2466 /* The last known alignment of SIZE. */
2467 unsigned int offset_align;
2468 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2470 /* The alignment of the record so far, in bits. */
2471 unsigned int record_align;
2472 /* The alignment of the record so far, ignoring #pragma pack and
2473 __attribute__ ((packed)), in bits. */
2474 unsigned int unpacked_align;
2475 /* The previous field layed out. */
2477 /* The static variables (i.e., class variables, as opposed to
2478 instance variables) encountered in T. */
2479 tree pending_statics;
2480 /* Bits remaining in the current alignment group */
2481 int remaining_in_alignment;
2482 /* True if we've seen a packed field that didn't have normal
2483 alignment anyway. */
2484 int packed_maybe_necessary;
2485 } *record_layout_info;
2487 extern void set_lang_adjust_rli PARAMS ((void (*) PARAMS
2488 ((record_layout_info))));
2489 extern record_layout_info start_record_layout PARAMS ((tree));
2490 extern tree bit_from_pos PARAMS ((tree, tree));
2491 extern tree byte_from_pos PARAMS ((tree, tree));
2492 extern void pos_from_bit PARAMS ((tree *, tree *, unsigned int,
2494 extern void normalize_offset PARAMS ((tree *, tree *,
2496 extern tree rli_size_unit_so_far PARAMS ((record_layout_info));
2497 extern tree rli_size_so_far PARAMS ((record_layout_info));
2498 extern void normalize_rli PARAMS ((record_layout_info));
2499 extern void place_field PARAMS ((record_layout_info, tree));
2500 extern void compute_record_mode PARAMS ((tree));
2501 extern void finish_record_layout PARAMS ((record_layout_info, int));
2503 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2504 return a canonicalized ..._TYPE node, so that duplicates are not made.
2505 How the hash code is computed is up to the caller, as long as any two
2506 callers that could hash identical-looking type nodes agree. */
2508 extern tree type_hash_canon PARAMS ((unsigned int, tree));
2510 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2511 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2512 fields. Call this only once for any given decl node.
2514 Second argument is the boundary that this field can be assumed to
2515 be starting at (in bits). Zero means it can be assumed aligned
2516 on any boundary that may be needed. */
2518 extern void layout_decl PARAMS ((tree, unsigned));
2520 /* Return the mode for data of a given size SIZE and mode class CLASS.
2521 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2522 The value is BLKmode if no other mode is found. This is like
2523 mode_for_size, but is passed a tree. */
2525 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
2528 /* Return an expr equal to X but certainly not valid as an lvalue. */
2530 extern tree non_lvalue PARAMS ((tree));
2531 extern tree pedantic_non_lvalue PARAMS ((tree));
2533 extern tree convert PARAMS ((tree, tree));
2534 extern unsigned int expr_align PARAMS ((tree));
2535 extern tree expr_last PARAMS ((tree));
2536 extern tree size_in_bytes PARAMS ((tree));
2537 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
2538 extern tree bit_position PARAMS ((tree));
2539 extern HOST_WIDE_INT int_bit_position PARAMS ((tree));
2540 extern tree byte_position PARAMS ((tree));
2541 extern HOST_WIDE_INT int_byte_position PARAMS ((tree));
2543 /* Define data structures, macros, and functions for handling sizes
2544 and the various types used to represent sizes. */
2548 SIZETYPE, /* Normal representation of sizes in bytes. */
2549 SSIZETYPE, /* Signed representation of sizes in bytes. */
2550 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2551 BITSIZETYPE, /* Normal representation of sizes in bits. */
2552 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2553 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
2556 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
2558 #define sizetype sizetype_tab[(int) SIZETYPE]
2559 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2560 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2561 #define usizetype sizetype_tab[(int) USIZETYPE]
2562 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2563 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2565 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
2566 extern tree size_diffop PARAMS ((tree, tree));
2567 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
2568 enum size_type_kind));
2569 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
2571 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2572 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2573 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2574 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2575 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2577 extern tree round_up PARAMS ((tree, int));
2578 extern tree round_down PARAMS ((tree, int));
2579 extern tree get_pending_sizes PARAMS ((void));
2580 extern int is_pending_size PARAMS ((tree));
2581 extern void put_pending_size PARAMS ((tree));
2582 extern void put_pending_sizes PARAMS ((tree));
2584 /* Type for sizes of data-type. */
2586 #define BITS_PER_UNIT_LOG \
2587 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2588 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2589 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2591 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2592 extern unsigned int maximum_field_alignment;
2594 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2595 extern unsigned int set_alignment;
2597 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2598 by making the last node in X point to Y.
2599 Returns X, except if X is 0 returns Y. */
2601 extern tree chainon PARAMS ((tree, tree));
2603 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2605 extern tree tree_cons PARAMS ((tree, tree, tree));
2607 /* Return the last tree node in a chain. */
2609 extern tree tree_last PARAMS ((tree));
2611 /* Reverse the order of elements in a chain, and return the new head. */
2613 extern tree nreverse PARAMS ((tree));
2615 /* Returns the length of a chain of nodes
2616 (number of chain pointers to follow before reaching a null pointer). */
2618 extern int list_length PARAMS ((tree));
2620 /* Returns the number of FIELD_DECLs in a type. */
2622 extern int fields_length PARAMS ((tree));
2624 /* Given an initializer INIT, return TRUE if INIT is zero or some
2625 aggregate of zeros. Otherwise return FALSE. */
2627 extern bool initializer_zerop PARAMS ((tree));
2629 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2631 extern int integer_zerop PARAMS ((tree));
2633 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2635 extern int integer_onep PARAMS ((tree));
2637 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2638 all of whose significant bits are 1. */
2640 extern int integer_all_onesp PARAMS ((tree));
2642 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2643 exactly one bit 1. */
2645 extern int integer_pow2p PARAMS ((tree));
2647 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
2648 with a nonzero value. */
2650 extern int integer_nonzerop PARAMS ((tree));
2652 /* staticp (tree x) is nonzero if X is a reference to data allocated
2653 at a fixed address in memory. */
2655 extern int staticp PARAMS ((tree));
2657 /* Gets an error if argument X is not an lvalue.
2658 Also returns 1 if X is an lvalue, 0 if not. */
2660 extern int lvalue_or_else PARAMS ((tree, const char *));
2662 /* save_expr (EXP) returns an expression equivalent to EXP
2663 but it can be used multiple times within context CTX
2664 and only evaluate EXP once. */
2666 extern tree save_expr PARAMS ((tree));
2668 /* Look inside EXPR and into any simple arithmetic operations. Return
2669 the innermost non-arithmetic node. */
2671 extern tree skip_simple_arithmetic PARAMS ((tree));
2673 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
2674 SAVE_EXPR. Return FALSE otherwise. */
2676 extern bool saved_expr_p PARAMS ((tree));
2678 /* Returns the index of the first non-tree operand for CODE, or the number
2679 of operands if all are trees. */
2681 extern int first_rtl_op PARAMS ((enum tree_code));
2683 /* Return which tree structure is used by T. */
2685 enum tree_node_structure_enum tree_node_structure PARAMS ((tree));
2687 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2688 can be used multiple times and will evaluate EXP in its entirety
2691 extern tree unsave_expr PARAMS ((tree));
2693 /* Reset EXP in place so that it can be expanded again. Does not
2694 recurse into subtrees. */
2696 extern void unsave_expr_1 PARAMS ((tree));
2698 /* Return 0 if it is safe to evaluate EXPR multiple times,
2699 return 1 if it is safe if EXPR is unsaved afterward, or
2700 return 2 if it is completely unsafe. */
2701 extern int unsafe_for_reeval PARAMS ((tree));
2703 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2704 or offset that depends on a field within a record.
2706 Note that we only allow such expressions within simple arithmetic
2709 extern int contains_placeholder_p PARAMS ((tree));
2711 /* Return 1 if EXP contains any expressions that produce cleanups for an
2712 outer scope to deal with. Used by fold. */
2714 extern int has_cleanups PARAMS ((tree));
2716 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2717 return a tree with all occurrences of references to F in a
2718 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2719 contains only arithmetic expressions. */
2721 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
2723 /* variable_size (EXP) is like save_expr (EXP) except that it
2724 is for the special case of something that is part of a
2725 variable size for a data type. It makes special arrangements
2726 to compute the value at the right time when the data type
2727 belongs to a function parameter. */
2729 extern tree variable_size PARAMS ((tree));
2731 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2732 but it can be used multiple times
2733 and only evaluate the subexpressions once. */
2735 extern tree stabilize_reference PARAMS ((tree));
2737 /* Subroutine of stabilize_reference; this is called for subtrees of
2738 references. Any expression with side-effects must be put in a SAVE_EXPR
2739 to ensure that it is only evaluated once. */
2741 extern tree stabilize_reference_1 PARAMS ((tree));
2743 /* Return EXP, stripped of any conversions to wider types
2744 in such a way that the result of converting to type FOR_TYPE
2745 is the same as if EXP were converted to FOR_TYPE.
2746 If FOR_TYPE is 0, it signifies EXP's type. */
2748 extern tree get_unwidened PARAMS ((tree, tree));
2750 /* Return OP or a simpler expression for a narrower value
2751 which can be sign-extended or zero-extended to give back OP.
2752 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2753 or 0 if the value should be sign-extended. */
2755 extern tree get_narrower PARAMS ((tree, int *));
2757 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2758 look for nested component-refs or array-refs at constant positions
2759 and find the ultimate containing object, which is returned. */
2761 extern tree get_inner_reference PARAMS ((tree, HOST_WIDE_INT *,
2762 HOST_WIDE_INT *, tree *,
2763 enum machine_mode *, int *,
2766 /* Return 1 if T is an expression that get_inner_reference handles. */
2768 extern int handled_component_p PARAMS ((tree));
2770 /* Given a DECL or TYPE, return the scope in which it was declared, or
2771 NUL_TREE if there is no containing scope. */
2773 extern tree get_containing_scope PARAMS ((tree));
2775 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2777 extern tree decl_function_context PARAMS ((tree));
2779 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2780 this _DECL with its context, or zero if none. */
2781 extern tree decl_type_context PARAMS ((tree));
2783 /* Given the FUNCTION_DECL for the current function,
2784 return zero if it is ok for this function to be inline.
2785 Otherwise return a warning message with a single %s
2786 for the function's name. */
2788 extern const char *function_cannot_inline_p PARAMS ((tree));
2790 /* Return 1 if EXPR is the real constant zero. */
2791 extern int real_zerop PARAMS ((tree));
2793 /* Declare commonly used variables for tree structure. */
2795 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2796 Zero means allow extended lvalues. */
2798 extern int pedantic_lvalues;
2800 /* Nonzero means can safely call expand_expr now;
2801 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2803 extern int immediate_size_expand;
2805 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2807 extern GTY(()) tree current_function_decl;
2809 /* Nonzero means a FUNC_BEGIN label was emitted. */
2810 extern GTY(()) tree current_function_func_begin_label;
2812 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2814 extern int all_types_permanent;
2816 /* Declare a predefined function. Return the declaration. This function is
2817 provided by each language frontend. */
2818 extern tree builtin_function PARAMS ((const char *, tree, int,
2819 enum built_in_class,
2820 const char *, tree));
2823 extern void clean_symbol_name PARAMS ((char *));
2824 extern tree get_file_function_name_long PARAMS ((const char *));
2825 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2826 extern tree get_set_constructor_bytes PARAMS ((tree,
2827 unsigned char *, int));
2828 extern tree get_callee_fndecl PARAMS ((tree));
2829 extern void set_decl_assembler_name PARAMS ((tree));
2830 extern int type_num_arguments PARAMS ((tree));
2831 extern tree lhd_unsave_expr_now PARAMS ((tree));
2836 extern void expand_fixups PARAMS ((rtx));
2837 extern tree expand_start_stmt_expr PARAMS ((int));
2838 extern tree expand_end_stmt_expr PARAMS ((tree));
2839 extern void expand_expr_stmt PARAMS ((tree));
2840 extern void expand_expr_stmt_value PARAMS ((tree, int, int));
2841 extern int warn_if_unused_value PARAMS ((tree));
2842 extern void expand_decl_init PARAMS ((tree));
2843 extern void clear_last_expr PARAMS ((void));
2844 extern void expand_label PARAMS ((tree));
2845 extern void expand_goto PARAMS ((tree));
2846 extern void expand_asm PARAMS ((tree, int));
2847 extern void expand_start_cond PARAMS ((tree, int));
2848 extern void expand_end_cond PARAMS ((void));
2849 extern void expand_start_else PARAMS ((void));
2850 extern void expand_start_elseif PARAMS ((tree));
2851 extern struct nesting *expand_start_loop PARAMS ((int));
2852 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2853 extern struct nesting *expand_start_null_loop PARAMS ((void));
2854 extern void expand_loop_continue_here PARAMS ((void));
2855 extern void expand_end_loop PARAMS ((void));
2856 extern void expand_end_null_loop PARAMS ((void));
2857 extern int expand_continue_loop PARAMS ((struct nesting *));
2858 extern int expand_exit_loop PARAMS ((struct nesting *));
2859 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2861 extern int expand_exit_loop_top_cond PARAMS ((struct nesting *,
2863 extern int expand_exit_something PARAMS ((void));
2865 extern void expand_return PARAMS ((tree));
2866 extern int optimize_tail_recursion PARAMS ((tree, rtx));
2867 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2868 #define expand_start_bindings(flags) \
2869 expand_start_bindings_and_block(flags, NULL_TREE)
2870 extern void expand_end_bindings PARAMS ((tree, int, int));
2871 extern void warn_about_unused_variables PARAMS ((tree));
2872 extern void start_cleanup_deferral PARAMS ((void));
2873 extern void end_cleanup_deferral PARAMS ((void));
2874 extern int is_body_block PARAMS ((tree));
2876 extern int conditional_context PARAMS ((void));
2877 extern struct nesting * current_nesting_level PARAMS ((void));
2878 extern tree last_cleanup_this_contour PARAMS ((void));
2879 extern void expand_start_case PARAMS ((int, tree, tree,
2881 extern void expand_end_case_type PARAMS ((tree, tree));
2882 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
2883 extern int add_case_node PARAMS ((tree, tree,
2885 extern int pushcase PARAMS ((tree,
2886 tree (*) (tree, tree),
2888 extern int pushcase_range PARAMS ((tree, tree,
2889 tree (*) (tree, tree),
2891 extern void using_eh_for_cleanups PARAMS ((void));
2893 /* In fold-const.c */
2895 /* Fold constants as much as possible in an expression.
2896 Returns the simplified expression.
2897 Acts only on the top level of the expression;
2898 if the argument itself cannot be simplified, its
2899 subexpressions are not changed. */
2901 extern tree fold PARAMS ((tree));
2903 extern int force_fit_type PARAMS ((tree, int));
2904 extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2905 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2906 unsigned HOST_WIDE_INT *,
2908 extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2909 unsigned HOST_WIDE_INT *,
2911 extern int mul_double PARAMS ((unsigned HOST_WIDE_INT,
2913 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2914 unsigned HOST_WIDE_INT *,
2916 extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2917 HOST_WIDE_INT, unsigned int,
2918 unsigned HOST_WIDE_INT *,
2919 HOST_WIDE_INT *, int));
2920 extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2921 HOST_WIDE_INT, unsigned int,
2922 unsigned HOST_WIDE_INT *,
2923 HOST_WIDE_INT *, int));
2924 extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2925 HOST_WIDE_INT, unsigned int,
2926 unsigned HOST_WIDE_INT *,
2928 extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2929 HOST_WIDE_INT, unsigned int,
2930 unsigned HOST_WIDE_INT *,
2933 extern int div_and_round_double PARAMS ((enum tree_code, int,
2934 unsigned HOST_WIDE_INT,
2936 unsigned HOST_WIDE_INT,
2938 unsigned HOST_WIDE_INT *,
2940 unsigned HOST_WIDE_INT *,
2943 extern int operand_equal_p PARAMS ((tree, tree, int));
2944 extern tree omit_one_operand PARAMS ((tree, tree, tree));
2945 extern tree invert_truthvalue PARAMS ((tree));
2948 extern tree fold_builtin PARAMS ((tree));
2949 extern enum built_in_function builtin_mathfn_code PARAMS ((tree));
2950 extern tree build_function_call_expr PARAMS ((tree, tree));
2951 extern tree mathfn_built_in PARAMS ((tree, enum built_in_function fn));
2952 extern tree strip_float_extensions PARAMS ((tree));
2955 extern tree strip_float_extensions PARAMS ((tree));
2958 extern void record_component_aliases PARAMS ((tree));
2959 extern HOST_WIDE_INT get_alias_set PARAMS ((tree));
2960 extern int alias_sets_conflict_p PARAMS ((HOST_WIDE_INT,
2962 extern int readonly_fields_p PARAMS ((tree));
2963 extern int objects_must_conflict_p PARAMS ((tree, tree));
2966 extern int really_constant_p PARAMS ((tree));
2967 extern int int_fits_type_p PARAMS ((tree, tree));
2968 extern bool variably_modified_type_p PARAMS ((tree));
2969 extern int tree_log2 PARAMS ((tree));
2970 extern int tree_floor_log2 PARAMS ((tree));
2971 extern int simple_cst_equal PARAMS ((tree, tree));
2972 extern unsigned int iterative_hash_expr PARAMS ((tree, unsigned int));
2973 extern int compare_tree_int PARAMS ((tree,
2974 unsigned HOST_WIDE_INT));
2975 extern int type_list_equal PARAMS ((tree, tree));
2976 extern int chain_member PARAMS ((tree, tree));
2977 extern tree type_hash_lookup PARAMS ((unsigned int, tree));
2978 extern void type_hash_add PARAMS ((unsigned int, tree));
2979 extern unsigned int type_hash_list PARAMS ((tree));
2980 extern int simple_cst_list_equal PARAMS ((tree, tree));
2981 extern void dump_tree_statistics PARAMS ((void));
2982 extern void expand_function_end PARAMS ((const char *, int, int));
2983 extern void expand_function_start PARAMS ((tree, int));
2984 extern void expand_pending_sizes PARAMS ((tree));
2986 extern int real_onep PARAMS ((tree));
2987 extern int real_twop PARAMS ((tree));
2988 extern int real_minus_onep PARAMS ((tree));
2989 extern void init_ttree PARAMS ((void));
2990 extern void build_common_tree_nodes PARAMS ((int));
2991 extern void build_common_tree_nodes_2 PARAMS ((int));
2992 extern tree build_range_type PARAMS ((tree, tree, tree));
2995 extern void setjmp_protect_args PARAMS ((void));
2996 extern void setjmp_protect PARAMS ((tree));
2997 extern void expand_main_function PARAMS ((void));
2998 extern void init_dummy_function_start PARAMS ((void));
2999 extern void expand_dummy_function_end PARAMS ((void));
3000 extern void init_function_for_compilation PARAMS ((void));
3001 extern void init_function_start PARAMS ((tree, const char *, int));
3002 extern void assign_parms PARAMS ((tree));
3003 extern void put_var_into_stack PARAMS ((tree, int));
3004 extern void flush_addressof PARAMS ((tree));
3005 extern void uninitialized_vars_warning PARAMS ((tree));
3006 extern void setjmp_args_warning PARAMS ((void));
3007 extern void mark_all_temps_used PARAMS ((void));
3008 extern void init_temp_slots PARAMS ((void));
3009 extern void combine_temp_slots PARAMS ((void));
3010 extern void free_temp_slots PARAMS ((void));
3011 extern void pop_temp_slots PARAMS ((void));
3012 extern void push_temp_slots PARAMS ((void));
3013 extern void preserve_temp_slots PARAMS ((rtx));
3014 extern void preserve_rtl_expr_temps PARAMS ((tree));
3015 extern int aggregate_value_p PARAMS ((tree));
3016 extern void free_temps_for_rtl_expr PARAMS ((tree));
3017 extern void instantiate_virtual_regs PARAMS ((tree, rtx));
3018 extern void unshare_all_rtl PARAMS ((tree, rtx));
3019 extern void push_function_context PARAMS ((void));
3020 extern void pop_function_context PARAMS ((void));
3021 extern void push_function_context_to PARAMS ((tree));
3022 extern void pop_function_context_from PARAMS ((tree));
3024 /* In print-rtl.c */
3026 extern void print_rtl PARAMS ((FILE *, rtx));
3029 /* In print-tree.c */
3030 extern void debug_tree PARAMS ((tree));
3032 extern void print_node PARAMS ((FILE *, const char *, tree,
3034 extern void print_node_brief PARAMS ((FILE *, const char *, tree,
3036 extern void indent_to PARAMS ((FILE *, int));
3040 extern int apply_args_register_offset PARAMS ((int));
3041 extern rtx expand_builtin_return_addr
3042 PARAMS ((enum built_in_function, int, rtx));
3043 extern void check_max_integer_computation_mode PARAMS ((tree));
3046 extern void start_sequence_for_rtl_expr PARAMS ((tree));
3047 extern rtx emit_line_note PARAMS ((const char *, int));
3051 extern int setjmp_call_p PARAMS ((tree));
3052 extern bool alloca_call_p PARAMS ((tree));
3056 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3057 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3058 it should be modified in place; if a TYPE, a copy should be created
3059 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3060 information, in the form of a bitwise OR of flags in enum attribute_flags
3061 from tree.h. Depending on these flags, some attributes may be
3062 returned to be applied at a later stage (for example, to apply
3063 a decl attribute to the declaration rather than to its type). */
3064 extern tree decl_attributes PARAMS ((tree *, tree, int));
3066 /* In integrate.c */
3067 extern void save_for_inline PARAMS ((tree));
3068 extern void set_decl_abstract_flags PARAMS ((tree, int));
3069 extern void output_inline_function PARAMS ((tree));
3070 extern void set_decl_origin_self PARAMS ((tree));
3072 /* In stor-layout.c */
3073 extern void fixup_signed_type PARAMS ((tree));
3074 extern void internal_reference_types PARAMS ((void));
3077 extern void make_decl_rtl PARAMS ((tree, const char *));
3078 extern void make_decl_one_only PARAMS ((tree));
3079 extern int supports_one_only PARAMS ((void));
3080 extern void variable_section PARAMS ((tree, int));
3081 enum tls_model decl_tls_model PARAMS ((tree));
3082 enum symbol_visibility decl_visibility PARAMS ((tree));
3085 extern void emit_nop PARAMS ((void));
3086 extern void expand_computed_goto PARAMS ((tree));
3087 extern bool parse_output_constraint PARAMS ((const char **,
3089 bool *, bool *, bool *));
3090 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
3091 const char *, int));
3092 extern int any_pending_cleanups PARAMS ((int));
3093 extern void init_stmt_for_function PARAMS ((void));
3094 extern void expand_start_target_temps PARAMS ((void));
3095 extern void expand_end_target_temps PARAMS ((void));
3096 extern void expand_elseif PARAMS ((tree));
3097 extern void save_stack_pointer PARAMS ((void));
3098 extern void expand_decl PARAMS ((tree));
3099 extern int expand_decl_cleanup PARAMS ((tree, tree));
3100 extern int expand_decl_cleanup_eh PARAMS ((tree, tree, int));
3101 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
3102 extern void expand_start_case_dummy PARAMS ((void));
3103 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
3104 extern void check_for_full_enumeration_handling PARAMS ((tree));
3105 extern void declare_nonlocal_label PARAMS ((tree));
3106 extern void default_flag_random_seed PARAMS ((void));
3108 /* If KIND=='I', return a suitable global initializer (constructor) name.
3109 If KIND=='D', return a suitable global clean-up (destructor) name. */
3110 extern tree get_file_function_name PARAMS ((int));
3112 /* Interface of the DWARF2 unwind info support. */
3114 /* Generate a new label for the CFI info to refer to. */
3116 extern char *dwarf2out_cfi_label PARAMS ((void));
3118 /* Entry point to update the canonical frame address (CFA). */
3120 extern void dwarf2out_def_cfa PARAMS ((const char *, unsigned, long));
3122 /* Add the CFI for saving a register window. */
3124 extern void dwarf2out_window_save PARAMS ((const char *));
3126 /* Add a CFI to update the running total of the size of arguments pushed
3129 extern void dwarf2out_args_size PARAMS ((const char *, long));
3131 /* Entry point for saving a register to the stack. */
3133 extern void dwarf2out_reg_save PARAMS ((const char *, unsigned, long));
3135 /* Entry point for saving the return address in the stack. */
3137 extern void dwarf2out_return_save PARAMS ((const char *, long));
3139 /* Entry point for saving the return address in a register. */
3141 extern void dwarf2out_return_reg PARAMS ((const char *, unsigned));
3143 /* The type of a function that walks over tree structure. */
3145 typedef tree (*walk_tree_fn) PARAMS ((tree *, int *, void *));
3147 /* In tree-dump.c */
3149 /* Different tree dump places. When you add new tree dump places,
3150 extend the DUMP_FILES array in tree-dump.c */
3151 enum tree_dump_index
3153 TDI_all, /* dump the whole translation unit */
3154 TDI_class, /* dump class hierarchy */
3155 TDI_original, /* dump each function before optimizing it */
3156 TDI_optimized, /* dump each function after optimizing it */
3157 TDI_inlined, /* dump each function after inlining
3162 /* Bit masks to control tree dumping. Not all values are applicable to
3163 all tree dumps. Add new ones at the end. When you define new
3164 values, extend the DUMP_OPTIONS array in tree-dump.c */
3165 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3166 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3168 typedef struct dump_info *dump_info_p;
3170 extern int dump_flag PARAMS ((dump_info_p, int, tree));
3171 extern int dump_enabled_p PARAMS ((enum tree_dump_index));
3172 extern FILE *dump_begin PARAMS ((enum tree_dump_index, int *));
3173 extern void dump_end PARAMS ((enum tree_dump_index, FILE *));
3174 extern void dump_node PARAMS ((tree, int, FILE *));
3175 extern int dump_switch_p PARAMS ((const char *));
3176 extern const char *dump_flag_name PARAMS ((enum tree_dump_index));
3177 /* Assign the RTX to declaration. */
3179 extern void set_decl_rtl PARAMS ((tree, rtx));
3181 /* Redefine abort to report an internal error w/o coredump, and
3182 reporting the location of the error in the source file. This logic
3183 is duplicated in rtl.h and tree.h because every file that needs the
3184 special abort includes one or both. toplev.h gets too few files,
3185 system.h gets too many. */
3187 extern void fancy_abort PARAMS ((const char *, int, const char *))
3189 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3191 #endif /* GCC_TREE_H */
OSDN Git Service
