1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 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
28 #include "statistics.h"
30 /* Codes of tree nodes */
32 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
37 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
43 /* Number of language-independent tree codes. */
44 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
46 /* Indexed by enum tree_code, contains a character which is
47 `<' for a comparison expression, `1', for a unary arithmetic
48 expression, `2' for a binary arithmetic expression, `e' for
49 other types of expressions, `r' for a reference, `c' for a
50 constant, `d' for a decl, `t' for a type, `s' for a statement,
51 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
53 #define MAX_TREE_CODES 256
54 extern const char tree_code_type[];
55 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
57 /* Returns nonzero iff CLASS is the tree-code class of an
60 #define IS_EXPR_CODE_CLASS(CLASS) (strchr ("<12ers", (CLASS)) != 0)
62 /* Returns nonzero iff NODE is an expression of some kind. */
64 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
66 /* Number of argument-words in each kind of tree-node. */
68 extern const unsigned char tree_code_length[];
69 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
71 /* Names of tree components. */
73 extern const char *const tree_code_name[];
75 /* Classify which part of the compiler has defined a given builtin function.
76 Note that we assume below that this is no more than two bits. */
85 /* Names for the above. */
86 extern const char *const built_in_class_names[4];
88 /* Codes that identify the various built in functions
89 so that expand_call can identify them quickly. */
91 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
92 enum built_in_function
94 #include "builtins.def"
96 /* Upper bound on non-language-specific builtins. */
101 /* Names for the above. */
102 extern const char *const built_in_names[(int) END_BUILTINS];
104 /* An array of _DECL trees for the above. */
105 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
106 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
108 /* The definition of tree nodes fills the next several pages. */
110 /* A tree node can represent a data type, a variable, an expression
111 or a statement. Each node has a TREE_CODE which says what kind of
112 thing it represents. Some common codes are:
113 INTEGER_TYPE -- represents a type of integers.
114 ARRAY_TYPE -- represents a type of pointer.
115 VAR_DECL -- represents a declared variable.
116 INTEGER_CST -- represents a constant integer value.
117 PLUS_EXPR -- represents a sum (an expression).
119 As for the contents of a tree node: there are some fields
120 that all nodes share. Each TREE_CODE has various special-purpose
121 fields as well. The fields of a node are never accessed directly,
122 always through accessor macros. */
124 /* Every kind of tree node starts with this structure,
125 so all nodes have these fields.
127 See the accessor macros, defined below, for documentation of the
130 struct tree_common GTY(())
135 ENUM_BITFIELD(tree_code) code : 8;
137 unsigned side_effects_flag : 1;
138 unsigned constant_flag : 1;
139 unsigned addressable_flag : 1;
140 unsigned volatile_flag : 1;
141 unsigned readonly_flag : 1;
142 unsigned unsigned_flag : 1;
143 unsigned asm_written_flag: 1;
144 unsigned unused_0 : 1;
146 unsigned used_flag : 1;
147 unsigned nothrow_flag : 1;
148 unsigned static_flag : 1;
149 unsigned public_flag : 1;
150 unsigned private_flag : 1;
151 unsigned protected_flag : 1;
152 unsigned deprecated_flag : 1;
153 unsigned unused_1 : 1;
155 unsigned lang_flag_0 : 1;
156 unsigned lang_flag_1 : 1;
157 unsigned lang_flag_2 : 1;
158 unsigned lang_flag_3 : 1;
159 unsigned lang_flag_4 : 1;
160 unsigned lang_flag_5 : 1;
161 unsigned lang_flag_6 : 1;
162 unsigned unused_2 : 1;
165 /* The following table lists the uses of each of the above flags and
166 for which types of nodes they are defined. Note that expressions
172 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
173 ..._TYPE, IDENTIFIER_NODE.
174 In a STMT_EXPR, it means we want the result of the enclosed
180 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
181 TREE_NO_UNUSED_WARNING in
182 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
184 TREE_LIST or TREE_VEC
185 TREE_CONSTANT_OVERFLOW in
186 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
187 TREE_SYMBOL_REFERENCED in
190 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
191 TREE_LIST elements of a block's cleanup list.
196 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
198 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
199 EXPR_WFL_EMIT_LINE_NOTE in
200 EXPR_WITH_FILE_LOCATION
206 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
224 TREE_THIS_VOLATILE in
244 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
245 SAVE_EXPR_NOPLACEHOLDER in
251 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
257 expressions, IDENTIFIER_NODE
262 CALL_EXPR, FUNCTION_DECL
274 /* Define accessors for the fields that all tree nodes have
275 (though some fields are not used for all kinds of nodes). */
277 /* The tree-code says what kind of node it is.
278 Codes are defined in tree.def. */
279 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
280 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
282 /* When checking is enabled, errors will be generated if a tree node
283 is accessed incorrectly. The macros abort with a fatal error. */
284 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
286 #define TREE_CHECK(T, CODE) __extension__ \
287 ({ const tree __t = (T); \
288 if (TREE_CODE (__t) != (CODE)) \
289 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
292 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
293 ({ const tree __t = (T); \
294 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
295 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
299 /* These checks have to be special cased. */
300 #define EXPR_CHECK(T) __extension__ \
301 ({ const tree __t = (T); \
302 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
303 if (!IS_EXPR_CODE_CLASS (__c)) \
304 tree_class_check_failed (__t, 'e', __FILE__, __LINE__, \
308 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
309 (*({const tree __t = (T); \
310 const int __i = (I); \
311 if (TREE_CODE (__t) != TREE_VEC) \
312 tree_check_failed (__t, TREE_VEC, \
313 __FILE__, __LINE__, __FUNCTION__); \
314 if (__i < 0 || __i >= __t->vec.length) \
315 tree_vec_elt_check_failed (__i, __t->vec.length, \
316 __FILE__, __LINE__, __FUNCTION__); \
317 &__t->vec.a[__i]; }))
319 /* Special checks for TREE_OPERANDs. */
320 #define TREE_OPERAND_CHECK(T, I) __extension__ \
321 (*({const tree __t = EXPR_CHECK (T); \
322 const int __i = (I); \
323 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
324 tree_operand_check_failed (__i, TREE_CODE (__t), \
325 __FILE__, __LINE__, __FUNCTION__); \
326 &__t->exp.operands[__i]; }))
328 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
329 (*({const tree __t = (T); \
330 const int __i = (I); \
331 if (TREE_CODE (__t) != CODE) \
332 tree_check_failed (__t, CODE, __FILE__, __LINE__, __FUNCTION__); \
333 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
334 tree_operand_check_failed (__i, (CODE), \
335 __FILE__, __LINE__, __FUNCTION__); \
336 &__t->exp.operands[__i]; }))
338 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
340 ({const tree __t = (T); \
341 const int __i = (I); \
342 if (TREE_CODE (__t) != (CODE)) \
343 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
344 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
345 tree_operand_check_failed (__i, (CODE), \
346 __FILE__, __LINE__, __FUNCTION__); \
347 &__t->exp.operands[__i]; }))
349 extern void tree_check_failed (const tree, enum tree_code,
350 const char *, int, const char *)
352 extern void tree_class_check_failed (const tree, int,
353 const char *, int, const char *)
355 extern void tree_vec_elt_check_failed (int, int, const char *,
359 extern void tree_operand_check_failed (int, enum tree_code,
360 const char *, int, const char *)
363 #else /* not ENABLE_TREE_CHECKING, or not gcc */
365 #define TREE_CHECK(T, CODE) (T)
366 #define TREE_CLASS_CHECK(T, CODE) (T)
367 #define EXPR_CHECK(T) (T)
368 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
369 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
370 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
371 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
375 #include "tree-check.h"
377 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't')
378 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd')
379 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c')
380 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's')
382 /* In all nodes that are expressions, this is the data type of the expression.
383 In POINTER_TYPE nodes, this is the type that the pointer points to.
384 In ARRAY_TYPE nodes, this is the type of the elements.
385 In VECTOR_TYPE nodes, this is the type of the elements. */
386 #define TREE_TYPE(NODE) ((NODE)->common.type)
388 /* Here is how primitive or already-canonicalized types' hash codes
390 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777)
392 /* Nodes are chained together for many purposes.
393 Types are chained together to record them for being output to the debugger
394 (see the function `chain_type').
395 Decls in the same scope are chained together to record the contents
397 Statement nodes for successive statements used to be chained together.
398 Often lists of things are represented by TREE_LIST nodes that
399 are chained together. */
401 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
403 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
404 that don't change the machine mode. */
406 #define STRIP_NOPS(EXP) \
407 while ((TREE_CODE (EXP) == NOP_EXPR \
408 || TREE_CODE (EXP) == CONVERT_EXPR \
409 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
410 && TREE_OPERAND (EXP, 0) != error_mark_node \
411 && (TYPE_MODE (TREE_TYPE (EXP)) \
412 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
413 (EXP) = TREE_OPERAND (EXP, 0)
415 /* Like STRIP_NOPS, but don't let the signedness change either. */
417 #define STRIP_SIGN_NOPS(EXP) \
418 while ((TREE_CODE (EXP) == NOP_EXPR \
419 || TREE_CODE (EXP) == CONVERT_EXPR \
420 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
421 && TREE_OPERAND (EXP, 0) != error_mark_node \
422 && (TYPE_MODE (TREE_TYPE (EXP)) \
423 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
424 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
425 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
426 (EXP) = TREE_OPERAND (EXP, 0)
428 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
430 #define STRIP_MAIN_TYPE_NOPS(EXP) \
431 while ((TREE_CODE (EXP) == NOP_EXPR \
432 || TREE_CODE (EXP) == CONVERT_EXPR \
433 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
434 && TREE_OPERAND (EXP, 0) != error_mark_node \
435 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
436 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
437 (EXP) = TREE_OPERAND (EXP, 0)
439 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
441 #define STRIP_TYPE_NOPS(EXP) \
442 while ((TREE_CODE (EXP) == NOP_EXPR \
443 || TREE_CODE (EXP) == CONVERT_EXPR \
444 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
445 && TREE_OPERAND (EXP, 0) != error_mark_node \
446 && (TREE_TYPE (EXP) \
447 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
448 (EXP) = TREE_OPERAND (EXP, 0)
450 /* Nonzero if TYPE represents an integral type. Note that we do not
451 include COMPLEX types here. */
453 #define INTEGRAL_TYPE_P(TYPE) \
454 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
455 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
457 /* Nonzero if TYPE represents a scalar floating-point type. */
459 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
461 /* Nonzero if TYPE represents a complex floating-point type. */
463 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
464 (TREE_CODE (TYPE) == COMPLEX_TYPE \
465 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
467 /* Nonzero if TYPE represents a floating-point type, including complex
468 floating-point types. */
470 #define FLOAT_TYPE_P(TYPE) \
471 (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE))
473 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
475 #define AGGREGATE_TYPE_P(TYPE) \
476 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
477 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
478 || TREE_CODE (TYPE) == SET_TYPE)
480 /* Nonzero if TYPE represents a pointer or reference type.
481 (It should be renamed to INDIRECT_TYPE_P.) */
483 #define POINTER_TYPE_P(TYPE) \
484 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
486 /* Nonzero if this type is a complete type. */
487 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
489 /* Nonzero if this type is the (possibly qualified) void type. */
490 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
492 /* Nonzero if this type is complete or is cv void. */
493 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
494 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
496 /* Nonzero if this type is complete or is an array with unspecified bound. */
497 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
498 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
500 /* Nonzero if TYPE represents a type. */
502 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
504 /* Define many boolean fields that all tree nodes have. */
506 /* In VAR_DECL nodes, nonzero means address of this is needed.
507 So it cannot be in a register.
508 In a FUNCTION_DECL, nonzero means its address is needed.
509 So it must be compiled even if it is an inline function.
510 In a FIELD_DECL node, it means that the programmer is permitted to
511 construct the address of this field. This is used for aliasing
512 purposes: see record_component_aliases.
513 In CONSTRUCTOR nodes, it means object constructed must be in memory.
514 In LABEL_DECL nodes, it means a goto for this label has been seen
515 from a place outside all binding contours that restore stack levels.
516 In ..._TYPE nodes, it means that objects of this type must
517 be fully addressable. This means that pieces of this
518 object cannot go into register parameters, for example.
519 In IDENTIFIER_NODEs, this means that some extern decl for this name
520 had its address taken. That matters for inline functions. */
521 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
523 /* In a VAR_DECL, nonzero means allocate static storage.
524 In a FUNCTION_DECL, nonzero if function has been defined.
525 In a CONSTRUCTOR, nonzero means allocate static storage. */
526 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
528 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
529 block's cleanup list, means that the pertinent cleanup should only be
530 executed if an exception is thrown, not on normal exit of its scope. */
531 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
533 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
534 made implicitly and should not lead to an "unused value" warning. */
535 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
537 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
538 chain is via a `virtual' declaration. */
539 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
541 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
542 there was an overflow in folding. This is distinct from
543 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
544 occur in constant expressions. */
545 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
547 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
548 this string as an argument. */
549 #define TREE_SYMBOL_REFERENCED(NODE) \
550 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
552 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
553 there was an overflow in folding, and no warning has been issued
554 for this subexpression. TREE_OVERFLOW implies
555 TREE_CONSTANT_OVERFLOW, but not vice versa. */
556 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
558 /* In a VAR_DECL or FUNCTION_DECL,
559 nonzero means name is to be accessible from outside this module.
560 In an IDENTIFIER_NODE, nonzero means an external declaration
561 accessible from outside this module was previously seen
562 for this name in an inner scope. */
563 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
565 /* In any expression, nonzero means it has side effects or reevaluation
566 of the whole expression could produce a different value.
567 This is set if any subexpression is a function call, a side effect
568 or a reference to a volatile variable.
569 In a ..._DECL, this is set only if the declaration said `volatile'. */
570 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
572 /* Nonzero means this expression is volatile in the C sense:
573 its address should be of type `volatile WHATEVER *'.
574 In other words, the declared item is volatile qualified.
575 This is used in _DECL nodes and _REF nodes.
577 In a ..._TYPE node, means this type is volatile-qualified.
578 But use TYPE_VOLATILE instead of this macro when the node is a type,
579 because eventually we may make that a different bit.
581 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
582 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
584 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
585 nonzero means it may not be the lhs of an assignment.
586 In a ..._TYPE node, means this type is const-qualified
587 (but the macro TYPE_READONLY should be used instead of this macro
588 when the node is a type). */
589 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
591 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
592 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE))
594 /* Value of expression is constant.
595 Always appears in all ..._CST nodes.
596 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
597 if the value is constant. */
598 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
600 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
601 In FIELD_DECL nodes, means an unsigned bit field. */
602 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
604 #define TYPE_TRAP_SIGNED(NODE) \
605 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE)))
607 /* Nonzero in a VAR_DECL means assembler code has been written.
608 Nonzero in a FUNCTION_DECL means that the function has been compiled.
609 This is interesting in an inline function, since it might not need
610 to be compiled separately.
611 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
612 if the sdb debugging info for the type has been written.
613 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
614 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
616 /* Nonzero in a _DECL if the name is used in its scope.
617 Nonzero in an expr node means inhibit warning if value is unused.
618 In IDENTIFIER_NODEs, this means that some extern decl for this name
620 #define TREE_USED(NODE) ((NODE)->common.used_flag)
622 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
623 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
624 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
626 /* In a CALL_EXPR, means that the address of the return slot is part of the
628 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
630 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
631 thunked-to function. */
632 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag)
634 /* In a type, nonzero means that all objects of the type are guaranteed by the
635 language or front-end to be properly aligned, so we can indicate that a MEM
636 of this type is aligned at least to the alignment of the type, even if it
637 doesn't appear that it is. We see this, for example, in object-oriented
638 languages where a tag field may show this is an object of a more-aligned
639 variant of the more generic type. */
640 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
642 /* Used in classes in C++. */
643 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
644 /* Used in classes in C++.
645 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
646 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
648 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
649 deprecated feature by __attribute__((deprecated)). */
650 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
652 /* These flags are available for each language front end to use internally. */
653 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
654 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
655 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
656 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
657 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
658 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
659 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
661 /* Define additional fields and accessors for nodes representing constants. */
663 /* In an INTEGER_CST node. These two together make a 2-word integer.
664 If the data type is signed, the value is sign-extended to 2 words
665 even though not all of them may really be in use.
666 In an unsigned constant shorter than 2 words, the extra bits are 0. */
667 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
668 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
669 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
671 #define INT_CST_LT(A, B) \
672 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
673 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
674 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
676 #define INT_CST_LT_UNSIGNED(A, B) \
677 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
678 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
679 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
680 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
681 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
683 struct tree_int_cst GTY(())
685 struct tree_common common;
686 /* A sub-struct is necessary here because the function `const_hash'
687 wants to scan both words as a unit and taking the address of the
688 sub-struct yields the properly inclusive bounded pointer. */
689 struct tree_int_cst_lowhi {
690 unsigned HOST_WIDE_INT low;
695 /* In a REAL_CST node. struct real_value is an opaque entity, with
696 manipulators defined in real.h. We don't want tree.h depending on
697 real.h and transitively on tm.h. */
700 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
701 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
703 struct tree_real_cst GTY(())
705 struct tree_common common;
706 struct real_value * real_cst_ptr;
709 /* In a STRING_CST */
710 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
711 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
713 struct tree_string GTY(())
715 struct tree_common common;
720 /* In a COMPLEX_CST node. */
721 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
722 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
724 struct tree_complex GTY(())
726 struct tree_common common;
731 /* In a VECTOR_CST node. */
732 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
734 struct tree_vector GTY(())
736 struct tree_common common;
740 #include "hashtable.h"
742 /* Define fields and accessors for some special-purpose tree nodes. */
744 #define IDENTIFIER_LENGTH(NODE) \
745 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
746 #define IDENTIFIER_POINTER(NODE) \
747 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
748 #define IDENTIFIER_HASH_VALUE(NODE) \
749 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
751 /* Translate a hash table identifier pointer to a tree_identifier
752 pointer, and vice versa. */
754 #define HT_IDENT_TO_GCC_IDENT(NODE) \
755 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
756 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
758 struct tree_identifier GTY(())
760 struct tree_common common;
761 struct ht_identifier id;
764 /* In a TREE_LIST node. */
765 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
766 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
768 struct tree_list GTY(())
770 struct tree_common common;
775 /* In a TREE_VEC node. */
776 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
777 #define TREE_VEC_END(NODE) \
778 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
780 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
782 struct tree_vec GTY(())
784 struct tree_common common;
786 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
789 /* Define fields and accessors for some nodes that represent expressions. */
791 /* In a SAVE_EXPR node. */
792 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1)
793 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2)
795 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE))
796 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
797 both in normal code and in a handler. (Normally, in a handler, all
798 SAVE_EXPRs are unsaved, meaning that their values are
800 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
802 /* In a RTL_EXPR node. */
803 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0)
804 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1)
805 #define RTL_EXPR_ALT_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 2)
807 /* In a WITH_CLEANUP_EXPR node. */
808 #define WITH_CLEANUP_EXPR_RTL(NODE) \
809 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2)
811 /* In a CONSTRUCTOR node. */
812 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
814 /* In ordinary expression nodes. */
815 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
816 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
818 /* In a LABELED_BLOCK_EXPR node. */
819 #define LABELED_BLOCK_LABEL(NODE) \
820 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
821 #define LABELED_BLOCK_BODY(NODE) \
822 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
824 /* In an EXIT_BLOCK_EXPR node. */
825 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
826 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
827 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
829 /* In a LOOP_EXPR node. */
830 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
832 /* In an EXPR_WITH_FILE_LOCATION node. */
833 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
834 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
835 #define EXPR_WFL_NODE(NODE) \
836 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 0)
837 #define EXPR_WFL_FILENAME_NODE(NODE) \
838 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 1)
839 #define EXPR_WFL_FILENAME(NODE) \
840 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE))
841 /* ??? Java uses this in all expressions. */
842 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
843 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
844 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
845 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
846 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
848 /* In a TARGET_EXPR node. */
849 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
850 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
851 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
853 struct tree_exp GTY(())
855 struct tree_common common;
857 tree GTY ((special ("tree_exp"),
858 desc ("TREE_CODE ((tree) &%0)")))
862 /* In a BLOCK node. */
863 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
864 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
865 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
866 /* Note: when changing this, make sure to find the places
867 that use chainon or nreverse. */
868 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
869 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
870 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
872 /* Nonzero means that this block is prepared to handle exceptions
873 listed in the BLOCK_VARS slot. */
874 #define BLOCK_HANDLER_BLOCK(NODE) \
875 (BLOCK_CHECK (NODE)->block.handler_block_flag)
877 /* An index number for this block. These values are not guaranteed to
878 be unique across functions -- whether or not they are depends on
879 the debugging output format in use. */
880 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
882 /* If block reordering splits a lexical block into discontiguous
883 address ranges, we'll make a copy of the original block.
885 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
886 In that case, we have one source block that has been replicated
887 (through inlining or unrolling) into many logical blocks, and that
888 these logical blocks have different physical variables in them.
890 In this case, we have one logical block split into several
891 non-contiguous address ranges. Most debug formats can't actually
892 represent this idea directly, so we fake it by creating multiple
893 logical blocks with the same variables in them. However, for those
894 that do support non-contiguous regions, these allow the original
895 logical block to be reconstructed, along with the set of address
898 One of the logical block fragments is arbitrarily chosen to be
899 the ORIGIN. The other fragments will point to the origin via
900 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
901 be null. The list of fragments will be chained through
902 BLOCK_FRAGMENT_CHAIN from the origin. */
904 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
905 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
907 struct tree_block GTY(())
909 struct tree_common common;
911 unsigned handler_block_flag : 1;
912 unsigned abstract_flag : 1;
913 unsigned block_num : 30;
918 tree abstract_origin;
919 tree fragment_origin;
923 /* Define fields and accessors for nodes representing data types. */
925 /* See tree.def for documentation of the use of these fields.
926 Look at the documentation of the various ..._TYPE tree codes. */
928 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
929 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
930 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
931 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
932 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
933 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
934 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
935 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
936 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
937 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
938 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
939 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
940 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
941 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
942 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
943 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
944 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
945 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
946 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
947 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
948 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
949 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
950 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
951 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
952 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
954 /* For a VECTOR_TYPE node, this describes a different type which is emitted
955 in the debugging output. We use this to describe a vector as a
956 structure containing an array. */
957 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
959 /* For aggregate types, information about this type, as a base type
960 for itself. Used in a language-dependent way for types that are
961 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
962 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
964 /* The (language-specific) typed-based alias set for this type.
965 Objects whose TYPE_ALIAS_SETs are different cannot alias each
966 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
967 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
968 type can alias objects of any type. */
969 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
971 /* Nonzero iff the typed-based alias set for this type has been
973 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
975 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
977 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
979 /* The alignment necessary for objects of this type.
980 The value is an int, measured in bits. */
981 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
983 /* 1 if the alignment for this type was requested by "aligned" attribute,
984 0 if it is the default for this type. */
985 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
987 /* The alignment for NODE, in bytes. */
988 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
990 /* If your language allows you to declare types, and you want debug info
991 for them, then you need to generate corresponding TYPE_DECL nodes.
992 These "stub" TYPE_DECL nodes have no name, and simply point at the
993 type node. You then set the TYPE_STUB_DECL field of the type node
994 to point back at the TYPE_DECL node. This allows the debug routines
995 to know that the two nodes represent the same type, so that we only
996 get one debug info record for them. */
997 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
999 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1000 has BLKmode only because it lacks the alignment requirement for
1002 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1004 /* In an INTEGER_TYPE, it means the type represents a size. We use
1005 this both for validity checking and to permit optimizations that
1006 are unsafe for other types. Note that the C `size_t' type should
1007 *not* have this flag set. The `size_t' type is simply a typedef
1008 for an ordinary integer type that happens to be the type of an
1009 expression returned by `sizeof'; `size_t' has no special
1010 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1011 always actual sizes. */
1012 #define TYPE_IS_SIZETYPE(NODE) \
1013 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1015 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1016 pointer depressed. */
1017 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1018 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1020 /* Nonzero in a type considered volatile as a whole. */
1021 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1023 /* Means this type is const-qualified. */
1024 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1026 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1028 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1030 /* There is a TYPE_QUAL value for each type qualifier. They can be
1031 combined by bitwise-or to form the complete set of qualifiers for a
1034 #define TYPE_UNQUALIFIED 0x0
1035 #define TYPE_QUAL_CONST 0x1
1036 #define TYPE_QUAL_VOLATILE 0x2
1037 #define TYPE_QUAL_RESTRICT 0x4
1039 /* The set of type qualifiers for this type. */
1040 #define TYPE_QUALS(NODE) \
1041 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1042 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1043 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1045 /* These flags are available for each language front end to use internally. */
1046 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1047 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1048 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1049 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1050 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1051 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1052 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1054 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1055 that distinguish string from array of char).
1056 If set in a SET_TYPE, indicates a bitstring type. */
1057 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1059 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1060 object of the given ARRAY_TYPE. This allows temporaries to be
1062 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1063 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE))
1065 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1066 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1067 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1069 /* Indicates that objects of this type must be initialized by calling a
1070 function when they are created. */
1071 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1072 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1074 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1075 the same way that the first union alternative would be passed. */
1076 #define TYPE_TRANSPARENT_UNION(NODE) \
1077 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1079 /* For an ARRAY_TYPE, indicates that it is not permitted to
1080 take the address of a component of the type. */
1081 #define TYPE_NONALIASED_COMPONENT(NODE) \
1082 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1084 /* Indicated that objects of this type should be laid out in as
1085 compact a way as possible. */
1086 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1090 struct tree_type GTY(())
1092 struct tree_common common;
1099 unsigned int precision : 9;
1100 ENUM_BITFIELD(machine_mode) mode : 7;
1102 unsigned string_flag : 1;
1103 unsigned no_force_blk_flag : 1;
1104 unsigned needs_constructing_flag : 1;
1105 unsigned transparent_union_flag : 1;
1106 unsigned packed_flag : 1;
1107 unsigned restrict_flag : 1;
1110 unsigned lang_flag_0 : 1;
1111 unsigned lang_flag_1 : 1;
1112 unsigned lang_flag_2 : 1;
1113 unsigned lang_flag_3 : 1;
1114 unsigned lang_flag_4 : 1;
1115 unsigned lang_flag_5 : 1;
1116 unsigned lang_flag_6 : 1;
1117 unsigned user_align : 1;
1122 union tree_type_symtab {
1123 int GTY ((tag ("0"))) address;
1124 char * GTY ((tag ("1"))) pointer;
1125 struct die_struct * GTY ((tag ("2"))) die;
1126 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1127 descbits ("2"))) symtab;
1135 HOST_WIDE_INT alias_set;
1136 /* Points to a structure whose details depend on the language in use. */
1137 struct lang_type *lang_specific;
1140 /* Define accessor macros for information about type inheritance
1143 A "basetype" means a particular usage of a data type for inheritance
1144 in another type. Each such basetype usage has its own "binfo"
1145 object to describe it. The binfo object is a TREE_VEC node.
1147 Inheritance is represented by the binfo nodes allocated for a
1148 given type. For example, given types C and D, such that D is
1149 inherited by C, 3 binfo nodes will be allocated: one for describing
1150 the binfo properties of C, similarly one for D, and one for
1151 describing the binfo properties of D as a base type for C.
1152 Thus, given a pointer to class C, one can get a pointer to the binfo
1153 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1155 /* The actual data type node being inherited in this basetype. */
1156 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1158 /* The offset where this basetype appears in its containing type.
1159 BINFO_OFFSET slot holds the offset (in bytes)
1160 from the base of the complete object to the base of the part of the
1161 object that is allocated on behalf of this `type'.
1162 This is always 0 except when there is multiple inheritance. */
1164 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1165 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1166 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1168 /* The virtual function table belonging to this basetype. Virtual
1169 function tables provide a mechanism for run-time method dispatching.
1170 The entries of a virtual function table are language-dependent. */
1172 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1173 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1175 /* The virtual functions in the virtual function table. This is
1176 a TREE_LIST that is used as an initial approximation for building
1177 a virtual function table for this basetype. */
1178 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1179 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1181 /* A vector of binfos for the direct basetypes inherited by this
1184 If this basetype describes type D as inherited in C, and if the
1185 basetypes of D are E and F, then this vector contains binfos for
1186 inheritance of E and F by C.
1188 ??? This could probably be done by just allocating the
1189 base types at the end of this TREE_VEC (instead of using
1190 another TREE_VEC). This would simplify the calculation
1191 of how many basetypes a given type had. */
1192 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1193 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1195 /* The number of basetypes for NODE. */
1196 #define BINFO_N_BASETYPES(NODE) \
1197 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1199 /* Accessor macro to get to the Nth basetype of this basetype. */
1200 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1201 #define TYPE_BINFO_BASETYPE(NODE,N) \
1202 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1204 /* For a BINFO record describing a virtual base class, i.e., one where
1205 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1206 base. The actual contents are language-dependent. In the C++
1207 front-end this field is an INTEGER_CST giving an offset into the
1208 vtable where the offset to the virtual base can be found. */
1209 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1211 /* Indicates the accesses this binfo has to its bases. The values are
1212 access_public_node, access_protected_node or access_private_node.
1213 If this array is not present, public access is implied. */
1214 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1215 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1217 /* Number of language independent elements in a binfo. Languages may
1218 add additional trailing elements. */
1220 #define BINFO_ELTS 7
1222 /* Slot used to build a chain that represents a use of inheritance.
1223 For example, if X is derived from Y, and Y is derived from Z,
1224 then this field can be used to link the binfo node for X to
1225 the binfo node for X's Y to represent the use of inheritance
1226 from X to Y. Similarly, this slot of the binfo node for X's Y
1227 can point to the Z from which Y is inherited (in X's inheritance
1228 hierarchy). In this fashion, one can represent and traverse specific
1229 uses of inheritance using the binfo nodes themselves (instead of
1230 consing new space pointing to binfo nodes).
1231 It is up to the language-dependent front-ends to maintain
1232 this information as necessary. */
1233 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1235 /* Define fields and accessors for nodes representing declared names. */
1237 /* Nonzero if DECL represents a decl. */
1238 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1240 /* This is the name of the object as written by the user.
1241 It is an IDENTIFIER_NODE. */
1242 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1244 /* The name of the object as the assembler will see it (but before any
1245 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1246 as DECL_NAME. It is an IDENTIFIER_NODE. */
1247 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1249 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1250 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1252 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1253 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1255 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1256 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1257 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1259 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1260 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1261 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1262 semantics of using this macro, are different than saying:
1264 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1266 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1268 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1269 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1270 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1271 DECL_ASSEMBLER_NAME (DECL1)) \
1274 /* Records the section name in a section attribute. Used to pass
1275 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1276 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1278 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1279 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1280 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1281 points to either the FUNCTION_DECL for the containing function,
1282 the RECORD_TYPE or UNION_TYPE for the containing type, or
1283 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1285 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1286 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1287 /* In a DECL this is the field where attributes are stored. */
1288 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1289 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1290 byte containing the bit closest to the beginning of the structure. */
1291 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1292 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1293 field from DECL_FIELD_OFFSET. */
1294 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1295 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1296 if so, the type that was originally specified for it.
1297 TREE_TYPE may have been modified (in finish_struct). */
1298 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1299 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1300 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1302 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1303 /* This field is used to reference anything in decl.result and is meant only
1304 for use by the garbage collector. */
1305 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1306 /* In FUNCTION_DECL, holds the decl for the return value. */
1307 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1308 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1309 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1310 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1311 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1312 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1313 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1314 For a VAR_DECL, holds the initial value.
1315 For a PARM_DECL, not used--default
1316 values for parameters are encoded in the type of the function,
1317 not in the PARM_DECL slot. */
1318 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1319 /* For a PARM_DECL, records the data type used to pass the argument,
1320 which may be different from the type seen in the program. */
1321 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1322 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1323 if nonzero, indicates that the field occupies the type. */
1324 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1325 /* These two fields describe where in the source code the declaration
1326 was. If the declaration appears in several places (as for a C
1327 function that is declared first and then defined later), this
1328 information should refer to the definition. */
1329 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1330 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1331 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1332 /* Holds the size of the datum, in bits, as a tree expression.
1333 Need not be constant. */
1334 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1335 /* Likewise for the size in bytes. */
1336 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1337 /* Holds the alignment required for the datum, in bits. */
1338 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1339 /* The alignment of NODE, in bytes. */
1340 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1341 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1342 DECL_FIELD_OFFSET which are known to be always zero.
1343 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1345 #define DECL_OFFSET_ALIGN(NODE) \
1346 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1347 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1348 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1349 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1350 /* 1 if the alignment for this type was requested by "aligned" attribute,
1351 0 if it is the default for this type. */
1352 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1353 /* Holds the machine mode corresponding to the declaration of a variable or
1354 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1356 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1357 /* Holds the RTL expression for the value of a variable or function.
1358 This value can be evaluated lazily for functions, variables with
1359 static storage duration, and labels. */
1360 #define DECL_RTL(NODE) \
1361 (DECL_CHECK (NODE)->decl.rtl \
1362 ? (NODE)->decl.rtl \
1363 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1364 /* Set the DECL_RTL for NODE to RTL. */
1365 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1366 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1367 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1368 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1369 NODE1, it will not be set for NODE2; this is a lazy copy. */
1370 #define COPY_DECL_RTL(NODE1, NODE2) \
1371 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1372 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1373 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1375 /* For PARM_DECL, holds an RTL for the stack slot or register
1376 where the data was actually passed. */
1377 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1379 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
1380 that describes the status of this function. */
1381 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1383 /* For FUNCTION_DECL, if it is built-in,
1384 this identifies which built-in operation it is. */
1385 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1387 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1388 Before the struct containing the FUNCTION_DECL is laid out,
1389 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1390 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1391 function. When the class is laid out, this pointer is changed
1392 to an INTEGER_CST node which is suitable for use as an index
1393 into the virtual function table. */
1394 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1396 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1397 which this FIELD_DECL is defined. This information is needed when
1398 writing debugging information about vfield and vbase decls for C++. */
1399 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1401 /* Every ..._DECL node gets a unique number. */
1402 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1404 /* For any sort of a ..._DECL node, this points to the original (abstract)
1405 decl node which this decl is an instance of, or else it is NULL indicating
1406 that this decl is not an instance of some other decl. For example,
1407 in a nested declaration of an inline function, this points back to the
1409 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1411 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1412 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1413 #define DECL_ORIGIN(NODE) \
1414 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1416 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1417 inline instance of some original (abstract) decl from an inline function;
1418 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1419 nodes can also have their abstract origin set to themselves. */
1420 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1421 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1423 /* Nonzero if a _DECL means that the name of this decl should be ignored
1424 for symbolic debug purposes. */
1425 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1427 /* Nonzero for a given ..._DECL node means that this node represents an
1428 "abstract instance" of the given declaration (e.g. in the original
1429 declaration of an inline function). When generating symbolic debugging
1430 information, we mustn't try to generate any address information for nodes
1431 marked as "abstract instances" because we don't actually generate
1432 any code or allocate any data space for such instances. */
1433 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1435 /* Nonzero if a _DECL means that no warnings should be generated just
1436 because this decl is unused. */
1437 #define DECL_IN_SYSTEM_HEADER(NODE) \
1438 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1440 /* Nonzero for a given ..._DECL node means that this node should be
1441 put in .common, if possible. If a DECL_INITIAL is given, and it
1442 is not error_mark_node, then the decl cannot be put in .common. */
1443 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1445 /* Language-specific decl information. */
1446 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1448 /* In a VAR_DECL or FUNCTION_DECL,
1449 nonzero means external reference:
1450 do not allocate storage, and refer to a definition elsewhere. */
1451 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1453 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1455 #define DEFAULT_INIT_PRIORITY 65535
1456 #define MAX_INIT_PRIORITY 65535
1457 #define MAX_RESERVED_INIT_PRIORITY 100
1460 nonzero means the detail info about this type is not dumped into stabs.
1461 Instead it will generate cross reference ('x') of names.
1462 This uses the same flag as DECL_EXTERNAL. */
1463 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1464 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1466 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1467 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1469 /* In LABEL_DECL nodes, nonzero means that an error message about
1470 jumping into such a binding contour has been printed for this label. */
1471 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1473 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1474 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1476 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1477 static chain is not needed. */
1478 #define DECL_NO_STATIC_CHAIN(NODE) \
1479 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1481 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1482 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1484 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1486 Also set in some languages for variables, etc., outside the normal
1487 lexical scope, such as class instance variables. */
1488 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1490 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1491 where it is called. */
1492 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1494 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
1495 such as via the `inline' keyword in C/C++. This flag controls the linkage
1496 semantics of 'inline'; whether or not the function is inlined is
1497 controlled by DECL_INLINE. */
1498 #define DECL_DECLARED_INLINE_P(NODE) \
1499 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
1501 /* Value of the decls's visibility attribute */
1502 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility)
1504 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1505 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1507 /* In a VAR_DECL, nonzero if the data should be allocated from
1508 thread-local storage. */
1509 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1511 /* In a FUNCTION_DECL, the saved representation of the body of the
1512 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1513 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1514 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1516 /* List of FUNCTION_DECLs inlined into this function's body. */
1517 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1519 /* Nonzero in a FUNCTION_DECL means this function should be treated
1520 as if it were a malloc, meaning it returns a pointer that is
1522 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1524 /* Nonzero in a FUNCTION_DECL means this function should be treated
1525 as "pure" function (like const function, but may read global memory). */
1526 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1528 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1530 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1532 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1533 contour that restored a stack level and which is now exited. */
1534 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1536 /* Unused in FUNCTION_DECL. */
1538 /* In a VAR_DECL that's static,
1539 nonzero if the space is in the text section. */
1540 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1542 /* In a FUNCTION_DECL, nonzero means a built in function. */
1543 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1545 /* For a builtin function, identify which part of the compiler defined it. */
1546 #define DECL_BUILT_IN_CLASS(NODE) \
1547 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1549 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1550 Used in FIELD_DECLs for vtable pointers.
1551 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1552 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1554 /* Used to indicate that the linkage status of this DECL is not yet known,
1555 so it should not be output now. */
1556 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1558 /* Used in PARM_DECLs whose type are unions to indicate that the
1559 argument should be passed in the same way that the first union
1560 alternative would be passed. */
1561 #define DECL_TRANSPARENT_UNION(NODE) \
1562 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1564 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1565 at the beginning or end of execution. */
1566 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1567 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1569 #define DECL_STATIC_DESTRUCTOR(NODE) \
1570 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1572 /* Used to indicate that this DECL represents a compiler-generated entity. */
1573 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1575 /* Used to indicate that this DECL has weak linkage. */
1576 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1578 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1579 multiple translation units should be merged. */
1580 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1582 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1583 not be put out unless it is needed in this translation unit.
1584 Entities like this are shared across translation units (like weak
1585 entities), but are guaranteed to be generated by any translation
1586 unit that needs them, and therefore need not be put out anywhere
1587 where they are not needed. DECL_COMDAT is just a hint to the
1588 back-end; it is up to front-ends which set this flag to ensure
1589 that there will never be any harm, other than bloat, in putting out
1590 something which is DECL_COMDAT. */
1591 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1593 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1594 be instrumented with calls to support routines. */
1595 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1596 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1598 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1599 disabled in this function. */
1600 #define DECL_NO_LIMIT_STACK(NODE) \
1601 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1603 /* Additional flags for language-specific uses. */
1604 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1605 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1606 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1607 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1608 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1609 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1610 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1611 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1613 /* Used to indicate that the pointer to this DECL cannot be treated as
1614 an address constant. */
1615 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1617 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1619 #define DECL_NONADDRESSABLE_P(NODE) \
1620 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1622 /* Used to indicate an alias set for the memory pointed to by this
1623 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1624 pointer (or reference) type. */
1625 #define DECL_POINTER_ALIAS_SET(NODE) \
1626 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1628 /* Nonzero if an alias set has been assigned to this declaration. */
1629 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1630 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1632 /* Nonzero for a decl which is at file scope. */
1633 #define DECL_FILE_SCOPE_P(EXP) \
1634 (! DECL_CONTEXT (EXP) \
1635 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
1637 /* Enumerate visibility settings. */
1639 enum symbol_visibility
1642 VISIBILITY_INTERNAL,
1644 VISIBILITY_PROTECTED
1649 struct tree_decl GTY(())
1651 struct tree_common common;
1655 ENUM_BITFIELD(machine_mode) mode : 8;
1657 unsigned external_flag : 1;
1658 unsigned nonlocal_flag : 1;
1659 unsigned regdecl_flag : 1;
1660 unsigned inline_flag : 1;
1661 unsigned bit_field_flag : 1;
1662 unsigned virtual_flag : 1;
1663 unsigned ignored_flag : 1;
1664 unsigned abstract_flag : 1;
1666 unsigned in_system_header_flag : 1;
1667 unsigned common_flag : 1;
1668 unsigned defer_output : 1;
1669 unsigned transparent_union : 1;
1670 unsigned static_ctor_flag : 1;
1671 unsigned static_dtor_flag : 1;
1672 unsigned artificial_flag : 1;
1673 unsigned weak_flag : 1;
1675 unsigned non_addr_const_p : 1;
1676 unsigned no_instrument_function_entry_exit : 1;
1677 unsigned comdat_flag : 1;
1678 unsigned malloc_flag : 1;
1679 unsigned no_limit_stack : 1;
1680 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1681 unsigned pure_flag : 1;
1683 unsigned non_addressable : 1;
1684 unsigned user_align : 1;
1685 unsigned uninlinable : 1;
1686 unsigned thread_local_flag : 1;
1687 unsigned declared_inline_flag : 1;
1688 ENUM_BITFIELD(symbol_visibility) visibility : 2;
1689 unsigned unused : 1;
1690 /* one unused bit. */
1692 unsigned lang_flag_0 : 1;
1693 unsigned lang_flag_1 : 1;
1694 unsigned lang_flag_2 : 1;
1695 unsigned lang_flag_3 : 1;
1696 unsigned lang_flag_4 : 1;
1697 unsigned lang_flag_5 : 1;
1698 unsigned lang_flag_6 : 1;
1699 unsigned lang_flag_7 : 1;
1701 union tree_decl_u1 {
1702 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1703 DECL_FUNCTION_CODE. */
1704 enum built_in_function f;
1705 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
1706 is used by language-dependent code. */
1708 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1710 struct tree_decl_u1_a {
1711 unsigned int align : 24;
1712 unsigned int off_align : 8;
1714 } GTY ((skip (""))) u1;
1719 tree arguments; /* Also used for DECL_FIELD_OFFSET */
1720 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
1721 tree initial; /* Also used for DECL_QUALIFIER */
1722 tree abstract_origin;
1723 tree assembler_name;
1726 rtx rtl; /* RTL representation for object. */
1728 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1729 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1730 In PARM_DECL, holds an RTL for the stack slot
1731 of register where the data was actually passed.
1732 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1733 union tree_decl_u2 {
1734 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
1735 rtx GTY ((tag ("PARM_DECL"))) r;
1736 tree GTY ((tag ("FIELD_DECL"))) t;
1737 int GTY ((tag ("VAR_DECL"))) i;
1738 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
1740 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1743 /* In a FUNCTION_DECL, these are function data which is to be kept
1744 as long as FUNCTION_DECL is kept. */
1748 HOST_WIDE_INT pointer_alias_set;
1749 /* Points to a structure whose details depend on the language in use. */
1750 struct lang_decl *lang_specific;
1753 enum tree_node_structure_enum {
1770 /* Define the overall contents of a tree node.
1771 It may be any of the structures declared above
1772 for various types of node. */
1774 union tree_node GTY ((ptr_alias (union lang_tree_node),
1775 desc ("tree_node_structure (&%h)")))
1777 struct tree_common GTY ((tag ("TS_COMMON"))) common;
1778 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
1779 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
1780 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
1781 struct tree_string GTY ((tag ("TS_STRING"))) string;
1782 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
1783 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
1784 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
1785 struct tree_type GTY ((tag ("TS_TYPE"))) type;
1786 struct tree_list GTY ((tag ("TS_LIST"))) list;
1787 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
1788 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
1789 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
1792 /* Standard named or nameless data types of the C compiler. */
1811 TI_INTEGER_MINUS_ONE,
1828 TI_COMPLEX_INTEGER_TYPE,
1829 TI_COMPLEX_FLOAT_TYPE,
1830 TI_COMPLEX_DOUBLE_TYPE,
1831 TI_COMPLEX_LONG_DOUBLE_TYPE,
1835 TI_LONG_DOUBLE_TYPE,
1839 TI_LONG_DOUBLE_PTR_TYPE,
1840 TI_INTEGER_PTR_TYPE,
1884 extern GTY(()) tree global_trees[TI_MAX];
1886 #define error_mark_node global_trees[TI_ERROR_MARK]
1888 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1889 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1890 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1891 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1892 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1894 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1895 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1896 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1897 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1898 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1900 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1901 #define integer_one_node global_trees[TI_INTEGER_ONE]
1902 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
1903 #define size_zero_node global_trees[TI_SIZE_ZERO]
1904 #define size_one_node global_trees[TI_SIZE_ONE]
1905 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1906 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1907 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1909 /* Base access nodes. */
1910 #define access_public_node global_trees[TI_PUBLIC]
1911 #define access_protected_node global_trees[TI_PROTECTED]
1912 #define access_private_node global_trees[TI_PRIVATE]
1914 #define null_pointer_node global_trees[TI_NULL_POINTER]
1916 #define float_type_node global_trees[TI_FLOAT_TYPE]
1917 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1918 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1920 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
1921 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
1922 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
1923 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
1925 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1926 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1927 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1928 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1930 #define void_type_node global_trees[TI_VOID_TYPE]
1931 /* The C type `void *'. */
1932 #define ptr_type_node global_trees[TI_PTR_TYPE]
1933 /* The C type `const void *'. */
1934 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1935 /* The C type `size_t'. */
1936 #define size_type_node global_trees[TI_SIZE_TYPE]
1937 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1938 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1940 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
1941 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
1942 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
1944 /* The node that should be placed at the end of a parameter list to
1945 indicate that the function does not take a variable number of
1946 arguments. The TREE_VALUE will be void_type_node and there will be
1947 no TREE_CHAIN. Language-independent code should not assume
1948 anything else about this node. */
1949 #define void_list_node global_trees[TI_VOID_LIST_NODE]
1951 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
1952 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
1954 #define unsigned_V16QI_type_node global_trees[TI_UV16QI_TYPE]
1955 #define unsigned_V4SI_type_node global_trees[TI_UV4SI_TYPE]
1956 #define unsigned_V8QI_type_node global_trees[TI_UV8QI_TYPE]
1957 #define unsigned_V8HI_type_node global_trees[TI_UV8HI_TYPE]
1958 #define unsigned_V4HI_type_node global_trees[TI_UV4HI_TYPE]
1959 #define unsigned_V2HI_type_node global_trees[TI_UV2HI_TYPE]
1960 #define unsigned_V2SI_type_node global_trees[TI_UV2SI_TYPE]
1961 #define unsigned_V2DI_type_node global_trees[TI_UV2DI_TYPE]
1962 #define unsigned_V1DI_type_node global_trees[TI_UV1DI_TYPE]
1964 #define V16QI_type_node global_trees[TI_V16QI_TYPE]
1965 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
1966 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
1967 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
1968 #define V8HI_type_node global_trees[TI_V8HI_TYPE]
1969 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
1970 #define V2HI_type_node global_trees[TI_V2HI_TYPE]
1971 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
1972 #define V2SF_type_node global_trees[TI_V2SF_TYPE]
1973 #define V2DI_type_node global_trees[TI_V2DI_TYPE]
1974 #define V2DF_type_node global_trees[TI_V2DF_TYPE]
1975 #define V16SF_type_node global_trees[TI_V16SF_TYPE]
1976 #define V1DI_type_node global_trees[TI_V1DI_TYPE]
1977 #define V4DF_type_node global_trees[TI_V4DF_TYPE]
1979 /* An enumeration of the standard C integer types. These must be
1980 ordered so that shorter types appear before longer ones, and so
1981 that signed types appear before unsigned ones, for the correct
1982 functioning of interpret_integer() in c-lex.c. */
1983 enum integer_type_kind
1995 itk_unsigned_long_long,
1999 typedef enum integer_type_kind integer_type_kind;
2001 /* The standard C integer types. Use integer_type_kind to index into
2003 extern GTY(()) tree integer_types[itk_none];
2005 #define char_type_node integer_types[itk_char]
2006 #define signed_char_type_node integer_types[itk_signed_char]
2007 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2008 #define short_integer_type_node integer_types[itk_short]
2009 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2010 #define integer_type_node integer_types[itk_int]
2011 #define unsigned_type_node integer_types[itk_unsigned_int]
2012 #define long_integer_type_node integer_types[itk_long]
2013 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2014 #define long_long_integer_type_node integer_types[itk_long_long]
2015 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2017 /* Set to the default thread-local storage (tls) model to use. */
2020 TLS_MODEL_GLOBAL_DYNAMIC = 1,
2021 TLS_MODEL_LOCAL_DYNAMIC,
2022 TLS_MODEL_INITIAL_EXEC,
2023 TLS_MODEL_LOCAL_EXEC
2026 extern enum tls_model flag_tls_default;
2029 /* A pointer-to-function member type looks like:
2036 If __pfn is NULL, it is a NULL pointer-to-member-function.
2038 (Because the vtable is always the first thing in the object, we
2039 don't need its offset.) If the function is virtual, then PFN is
2040 one plus twice the index into the vtable; otherwise, it is just a
2041 pointer to the function.
2043 Unfortunately, using the lowest bit of PFN doesn't work in
2044 architectures that don't impose alignment requirements on function
2045 addresses, or that use the lowest bit to tell one ISA from another,
2046 for example. For such architectures, we use the lowest bit of
2047 DELTA instead of the lowest bit of the PFN, and DELTA will be
2050 enum ptrmemfunc_vbit_where_t
2052 ptrmemfunc_vbit_in_pfn,
2053 ptrmemfunc_vbit_in_delta
2056 #define NULL_TREE (tree) NULL
2058 extern GTY(()) tree frame_base_decl;
2059 extern tree decl_assembler_name (tree);
2061 /* Compute the number of bytes occupied by 'node'. This routine only
2062 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2064 extern size_t tree_size (tree);
2066 /* Lowest level primitive for allocating a node.
2067 The TREE_CODE is the only argument. Contents are initialized
2068 to zero except for a few of the common fields. */
2070 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
2071 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
2073 /* Make a copy of a node, with all the same contents. */
2075 extern tree copy_node_stat (tree MEM_STAT_DECL);
2076 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
2078 /* Make a copy of a chain of TREE_LIST nodes. */
2080 extern tree copy_list (tree);
2082 /* Make a TREE_VEC. */
2084 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
2085 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
2087 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2088 The name is supplied as a char *. */
2090 extern tree get_identifier (const char *);
2092 #if GCC_VERSION >= 3000
2093 #define get_identifier(str) \
2094 (__builtin_constant_p (str) \
2095 ? get_identifier_with_length ((str), strlen (str)) \
2096 : get_identifier (str))
2100 /* Identical to get_identifier, except that the length is assumed
2103 extern tree get_identifier_with_length (const char *, size_t);
2105 /* If an identifier with the name TEXT (a null-terminated string) has
2106 previously been referred to, return that node; otherwise return
2109 extern tree maybe_get_identifier (const char *);
2111 /* Construct various types of nodes. */
2113 #define build_int_2(LO, HI) \
2114 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2116 extern tree build (enum tree_code, tree, ...);
2117 extern tree build_nt (enum tree_code, ...);
2119 #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L
2120 /* Use preprocessor trickery to map "build" to "buildN" where N is the
2121 expected number of arguments. This is used for both efficiency (no
2122 varargs), and checking (verifying number of passed arguments). */
2123 #define build(code, ...) \
2124 _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__)
2125 #define _buildN1(BASE, X) _buildN2(BASE, X)
2126 #define _buildN2(BASE, X) BASE##X
2127 #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0)
2128 #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c
2131 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
2132 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
2133 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2134 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
2135 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
2136 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
2137 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
2138 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
2139 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
2140 tree MEM_STAT_DECL);
2141 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
2143 extern tree build_int_2_wide (unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2144 extern tree build_vector (tree, tree);
2145 extern tree build_constructor (tree, tree);
2146 extern tree build_real_from_int_cst (tree, tree);
2147 extern tree build_complex (tree, tree, tree);
2148 extern tree build_string (int, const char *);
2149 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
2150 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
2151 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2152 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
2153 extern tree build_block (tree, tree, tree, tree, tree);
2154 extern tree build_expr_wfl (tree, const char *, int, int);
2156 /* Construct various nodes representing data types. */
2158 extern tree make_signed_type (int);
2159 extern tree make_unsigned_type (int);
2160 extern void initialize_sizetypes (void);
2161 extern void set_sizetype (tree);
2162 extern void fixup_unsigned_type (tree);
2163 extern tree build_pointer_type_for_mode (tree, enum machine_mode);
2164 extern tree build_pointer_type (tree);
2165 extern tree build_reference_type_for_mode (tree, enum machine_mode);
2166 extern tree build_reference_type (tree);
2167 extern tree build_type_no_quals (tree);
2168 extern tree build_index_type (tree);
2169 extern tree build_index_2_type (tree, tree);
2170 extern tree build_array_type (tree, tree);
2171 extern tree build_function_type (tree, tree);
2172 extern tree build_function_type_list (tree, ...);
2173 extern tree build_method_type_directly (tree, tree, tree);
2174 extern tree build_method_type (tree, tree);
2175 extern tree build_offset_type (tree, tree);
2176 extern tree build_complex_type (tree);
2177 extern tree array_type_nelts (tree);
2179 extern tree value_member (tree, tree);
2180 extern tree purpose_member (tree, tree);
2181 extern tree binfo_member (tree, tree);
2182 extern unsigned int attribute_hash_list (tree);
2183 extern int attribute_list_equal (tree, tree);
2184 extern int attribute_list_contained (tree, tree);
2185 extern int tree_int_cst_equal (tree, tree);
2186 extern int tree_int_cst_lt (tree, tree);
2187 extern int tree_int_cst_compare (tree, tree);
2188 extern int host_integerp (tree, int);
2189 extern HOST_WIDE_INT tree_low_cst (tree, int);
2190 extern int tree_int_cst_msb (tree);
2191 extern int tree_int_cst_sgn (tree);
2192 extern int tree_expr_nonnegative_p (tree);
2193 extern int rtl_expr_nonnegative_p (rtx);
2194 extern tree get_inner_array_type (tree);
2196 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2197 put the prototype here. Rtl.h does declare the prototype if
2198 tree.h had been included. */
2200 extern tree make_tree (tree, rtx);
2202 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2205 Such modified types already made are recorded so that duplicates
2208 extern tree build_type_attribute_variant (tree, tree);
2209 extern tree build_decl_attribute_variant (tree, tree);
2211 /* Structure describing an attribute and a function to handle it. */
2212 struct attribute_spec
2214 /* The name of the attribute (without any leading or trailing __),
2215 or NULL to mark the end of a table of attributes. */
2216 const char *const name;
2217 /* The minimum length of the list of arguments of the attribute. */
2218 const int min_length;
2219 /* The maximum length of the list of arguments of the attribute
2220 (-1 for no maximum). */
2221 const int max_length;
2222 /* Whether this attribute requires a DECL. If it does, it will be passed
2223 from types of DECLs, function return types and array element types to
2224 the DECLs, function types and array types respectively; but when
2225 applied to a type in any other circumstances, it will be ignored with
2226 a warning. (If greater control is desired for a given attribute,
2227 this should be false, and the flags argument to the handler may be
2228 used to gain greater control in that case.) */
2229 const bool decl_required;
2230 /* Whether this attribute requires a type. If it does, it will be passed
2231 from a DECL to the type of that DECL. */
2232 const bool type_required;
2233 /* Whether this attribute requires a function (or method) type. If it does,
2234 it will be passed from a function pointer type to the target type,
2235 and from a function return type (which is not itself a function
2236 pointer type) to the function type. */
2237 const bool function_type_required;
2238 /* Function to handle this attribute. NODE points to the node to which
2239 the attribute is to be applied. If a DECL, it should be modified in
2240 place; if a TYPE, a copy should be created. NAME is the name of the
2241 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2242 of the arguments (which may be NULL). FLAGS gives further information
2243 about the context of the attribute. Afterwards, the attributes will
2244 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2245 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2246 as well as in any other cases when the attributes should not be added
2247 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2248 applied to another type or DECL later may be returned;
2249 otherwise the return value should be NULL_TREE. This pointer may be
2250 NULL if no special handling is required beyond the checks implied
2251 by the rest of this structure. */
2252 tree (*const handler) (tree *node, tree name, tree args,
2253 int flags, bool *no_add_attrs);
2256 /* Flags that may be passed in the third argument of decl_attributes, and
2257 to handler functions for attributes. */
2258 enum attribute_flags
2260 /* The type passed in is the type of a DECL, and any attributes that
2261 should be passed in again to be applied to the DECL rather than the
2262 type should be returned. */
2263 ATTR_FLAG_DECL_NEXT = 1,
2264 /* The type passed in is a function return type, and any attributes that
2265 should be passed in again to be applied to the function type rather
2266 than the return type should be returned. */
2267 ATTR_FLAG_FUNCTION_NEXT = 2,
2268 /* The type passed in is an array element type, and any attributes that
2269 should be passed in again to be applied to the array type rather
2270 than the element type should be returned. */
2271 ATTR_FLAG_ARRAY_NEXT = 4,
2272 /* The type passed in is a structure, union or enumeration type being
2273 created, and should be modified in place. */
2274 ATTR_FLAG_TYPE_IN_PLACE = 8,
2275 /* The attributes are being applied by default to a library function whose
2276 name indicates known behavior, and should be silently ignored if they
2277 are not in fact compatible with the function type. */
2278 ATTR_FLAG_BUILT_IN = 16
2281 /* Default versions of target-overridable functions. */
2283 extern tree merge_decl_attributes (tree, tree);
2284 extern tree merge_type_attributes (tree, tree);
2285 extern void default_register_cpp_builtins (struct cpp_reader *);
2287 /* Split a list of declspecs and attributes into two. */
2289 extern void split_specs_attrs (tree, tree *, tree *);
2291 /* Strip attributes from a list of combined specs and attrs. */
2293 extern tree strip_attrs (tree);
2295 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2297 extern int valid_machine_attribute (tree, tree, tree, tree);
2299 /* Given a tree node and a string, return nonzero if the tree node is
2300 a valid attribute name for the string. */
2302 extern int is_attribute_p (const char *, tree);
2304 /* Given an attribute name and a list of attributes, return the list element
2305 of the attribute or NULL_TREE if not found. */
2307 extern tree lookup_attribute (const char *, tree);
2309 /* Given two attributes lists, return a list of their union. */
2311 extern tree merge_attributes (tree, tree);
2313 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2314 /* Given two Windows decl attributes lists, possibly including
2315 dllimport, return a list of their union . */
2316 extern tree merge_dllimport_decl_attributes (tree, tree);
2319 /* Check whether CAND is suitable to be returned from get_qualified_type
2320 (BASE, TYPE_QUALS). */
2322 extern bool check_qualified_type (tree, tree, int);
2324 /* Return a version of the TYPE, qualified as indicated by the
2325 TYPE_QUALS, if one exists. If no qualified version exists yet,
2326 return NULL_TREE. */
2328 extern tree get_qualified_type (tree, int);
2330 /* Like get_qualified_type, but creates the type if it does not
2331 exist. This function never returns NULL_TREE. */
2333 extern tree build_qualified_type (tree, int);
2335 /* Like build_qualified_type, but only deals with the `const' and
2336 `volatile' qualifiers. This interface is retained for backwards
2337 compatibility with the various front-ends; new code should use
2338 build_qualified_type instead. */
2340 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2341 build_qualified_type ((TYPE), \
2342 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2343 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2345 /* Make a copy of a type node. */
2347 extern tree build_type_copy (tree);
2349 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2350 fields. Optionally specify an alignment, and then lsy it out. */
2352 extern void finish_builtin_struct (tree, const char *,
2355 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2356 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2357 node, does nothing except for the first time. */
2359 extern void layout_type (tree);
2361 /* These functions allow a front-end to perform a manual layout of a
2362 RECORD_TYPE. (For instance, if the placement of subsequent fields
2363 depends on the placement of fields so far.) Begin by calling
2364 start_record_layout. Then, call place_field for each of the
2365 fields. Then, call finish_record_layout. See layout_type for the
2366 default way in which these functions are used. */
2368 typedef struct record_layout_info_s
2370 /* The RECORD_TYPE that we are laying out. */
2372 /* The offset into the record so far, in bytes, not including bits in
2375 /* The last known alignment of SIZE. */
2376 unsigned int offset_align;
2377 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2379 /* The alignment of the record so far, in bits. */
2380 unsigned int record_align;
2381 /* The alignment of the record so far, ignoring #pragma pack and
2382 __attribute__ ((packed)), in bits. */
2383 unsigned int unpacked_align;
2384 /* The previous field layed out. */
2386 /* The static variables (i.e., class variables, as opposed to
2387 instance variables) encountered in T. */
2388 tree pending_statics;
2389 /* Bits remaining in the current alignment group */
2390 int remaining_in_alignment;
2391 /* True if we've seen a packed field that didn't have normal
2392 alignment anyway. */
2393 int packed_maybe_necessary;
2394 } *record_layout_info;
2396 extern void set_lang_adjust_rli (void (*) (record_layout_info));
2397 extern record_layout_info start_record_layout (tree);
2398 extern tree bit_from_pos (tree, tree);
2399 extern tree byte_from_pos (tree, tree);
2400 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
2401 extern void normalize_offset (tree *, tree *, unsigned int);
2402 extern tree rli_size_unit_so_far (record_layout_info);
2403 extern tree rli_size_so_far (record_layout_info);
2404 extern void normalize_rli (record_layout_info);
2405 extern void place_field (record_layout_info, tree);
2406 extern void compute_record_mode (tree);
2407 extern void finish_record_layout (record_layout_info, int);
2409 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2410 return a canonicalized ..._TYPE node, so that duplicates are not made.
2411 How the hash code is computed is up to the caller, as long as any two
2412 callers that could hash identical-looking type nodes agree. */
2414 extern tree type_hash_canon (unsigned int, tree);
2416 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2417 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2418 fields. Call this only once for any given decl node.
2420 Second argument is the boundary that this field can be assumed to
2421 be starting at (in bits). Zero means it can be assumed aligned
2422 on any boundary that may be needed. */
2424 extern void layout_decl (tree, unsigned);
2426 /* Return the mode for data of a given size SIZE and mode class CLASS.
2427 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2428 The value is BLKmode if no other mode is found. This is like
2429 mode_for_size, but is passed a tree. */
2431 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
2433 /* Return an expr equal to X but certainly not valid as an lvalue. */
2435 extern tree non_lvalue (tree);
2436 extern tree pedantic_non_lvalue (tree);
2438 extern tree convert (tree, tree);
2439 extern unsigned int expr_align (tree);
2440 extern tree expr_first (tree);
2441 extern tree expr_last (tree);
2442 extern int expr_length (tree);
2443 extern tree size_in_bytes (tree);
2444 extern HOST_WIDE_INT int_size_in_bytes (tree);
2445 extern tree bit_position (tree);
2446 extern HOST_WIDE_INT int_bit_position (tree);
2447 extern tree byte_position (tree);
2448 extern HOST_WIDE_INT int_byte_position (tree);
2450 /* Define data structures, macros, and functions for handling sizes
2451 and the various types used to represent sizes. */
2455 SIZETYPE, /* Normal representation of sizes in bytes. */
2456 SSIZETYPE, /* Signed representation of sizes in bytes. */
2457 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2458 BITSIZETYPE, /* Normal representation of sizes in bits. */
2459 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2460 UBITSIZETYPE, /* Unsigned representation of sizes in bits. */
2463 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
2465 #define sizetype sizetype_tab[(int) SIZETYPE]
2466 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2467 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2468 #define usizetype sizetype_tab[(int) USIZETYPE]
2469 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2470 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2472 extern tree size_binop (enum tree_code, tree, tree);
2473 extern tree size_diffop (tree, tree);
2474 extern tree size_int_wide (HOST_WIDE_INT, enum size_type_kind);
2475 extern tree size_int_type_wide (HOST_WIDE_INT, tree);
2477 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2478 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2479 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2480 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2481 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2483 extern tree round_up (tree, int);
2484 extern tree round_down (tree, int);
2485 extern tree get_pending_sizes (void);
2486 extern void put_pending_size (tree);
2487 extern void put_pending_sizes (tree);
2489 /* Type for sizes of data-type. */
2491 #define BITS_PER_UNIT_LOG \
2492 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2493 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2494 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2496 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2497 extern unsigned int maximum_field_alignment;
2499 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2500 extern unsigned int set_alignment;
2502 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2503 by making the last node in X point to Y.
2504 Returns X, except if X is 0 returns Y. */
2506 extern tree chainon (tree, tree);
2508 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2510 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
2511 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
2513 /* Return the last tree node in a chain. */
2515 extern tree tree_last (tree);
2517 /* Reverse the order of elements in a chain, and return the new head. */
2519 extern tree nreverse (tree);
2521 /* Returns the length of a chain of nodes
2522 (number of chain pointers to follow before reaching a null pointer). */
2524 extern int list_length (tree);
2526 /* Returns the number of FIELD_DECLs in a type. */
2528 extern int fields_length (tree);
2530 /* Given an initializer INIT, return TRUE if INIT is zero or some
2531 aggregate of zeros. Otherwise return FALSE. */
2533 extern bool initializer_zerop (tree);
2535 /* Given an initializer INIT, return TRUE if INIT is at least 3/4 zeros.
2536 Otherwise return FALSE. */
2538 extern int mostly_zeros_p (tree);
2540 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2542 extern int integer_zerop (tree);
2544 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2546 extern int integer_onep (tree);
2548 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2549 all of whose significant bits are 1. */
2551 extern int integer_all_onesp (tree);
2553 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2554 exactly one bit 1. */
2556 extern int integer_pow2p (tree);
2558 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
2559 with a nonzero value. */
2561 extern int integer_nonzerop (tree);
2563 /* staticp (tree x) is nonzero if X is a reference to data allocated
2564 at a fixed address in memory. */
2566 extern int staticp (tree);
2568 /* Gets an error if argument X is not an lvalue.
2569 Also returns 1 if X is an lvalue, 0 if not. */
2571 extern int lvalue_or_else (tree, const char *);
2573 /* save_expr (EXP) returns an expression equivalent to EXP
2574 but it can be used multiple times within context CTX
2575 and only evaluate EXP once. */
2577 extern tree save_expr (tree);
2579 /* Look inside EXPR and into any simple arithmetic operations. Return
2580 the innermost non-arithmetic node. */
2582 extern tree skip_simple_arithmetic (tree);
2584 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
2585 SAVE_EXPR. Return FALSE otherwise. */
2587 extern bool saved_expr_p (tree);
2589 /* Returns the index of the first non-tree operand for CODE, or the number
2590 of operands if all are trees. */
2592 extern int first_rtl_op (enum tree_code);
2594 /* Return which tree structure is used by T. */
2596 enum tree_node_structure_enum tree_node_structure (tree);
2598 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2599 can be used multiple times and will evaluate EXP in its entirety
2602 extern tree unsave_expr (tree);
2604 /* Reset EXP in place so that it can be expanded again. Does not
2605 recurse into subtrees. */
2607 extern void unsave_expr_1 (tree);
2609 /* Return 0 if it is safe to evaluate EXPR multiple times,
2610 return 1 if it is safe if EXPR is unsaved afterward, or
2611 return 2 if it is completely unsafe. */
2612 extern int unsafe_for_reeval (tree);
2614 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2615 or offset that depends on a field within a record.
2617 Note that we only allow such expressions within simple arithmetic
2620 extern bool contains_placeholder_p (tree);
2622 /* This macro calls the above function but short-circuits the common
2623 case of a constant to save time. Also check for null. */
2625 #define CONTAINS_PLACEHOLDER_P(EXP) \
2626 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
2628 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
2629 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
2632 extern bool type_contains_placeholder_p (tree);
2634 /* Return 1 if EXP contains any expressions that produce cleanups for an
2635 outer scope to deal with. Used by fold. */
2637 extern int has_cleanups (tree);
2639 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2640 return a tree with all occurrences of references to F in a
2641 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2642 contains only arithmetic expressions. */
2644 extern tree substitute_in_expr (tree, tree, tree);
2646 /* variable_size (EXP) is like save_expr (EXP) except that it
2647 is for the special case of something that is part of a
2648 variable size for a data type. It makes special arrangements
2649 to compute the value at the right time when the data type
2650 belongs to a function parameter. */
2652 extern tree variable_size (tree);
2654 /* stabilize_reference (EXP) returns a reference equivalent to EXP
2655 but it can be used multiple times
2656 and only evaluate the subexpressions once. */
2658 extern tree stabilize_reference (tree);
2660 /* Subroutine of stabilize_reference; this is called for subtrees of
2661 references. Any expression with side-effects must be put in a SAVE_EXPR
2662 to ensure that it is only evaluated once. */
2664 extern tree stabilize_reference_1 (tree);
2666 /* Return EXP, stripped of any conversions to wider types
2667 in such a way that the result of converting to type FOR_TYPE
2668 is the same as if EXP were converted to FOR_TYPE.
2669 If FOR_TYPE is 0, it signifies EXP's type. */
2671 extern tree get_unwidened (tree, tree);
2673 /* Return OP or a simpler expression for a narrower value
2674 which can be sign-extended or zero-extended to give back OP.
2675 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2676 or 0 if the value should be sign-extended. */
2678 extern tree get_narrower (tree, int *);
2680 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2681 look for nested component-refs or array-refs at constant positions
2682 and find the ultimate containing object, which is returned. */
2684 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
2685 tree *, enum machine_mode *, int *, int *);
2687 /* Return 1 if T is an expression that get_inner_reference handles. */
2689 extern int handled_component_p (tree);
2691 /* Given a DECL or TYPE, return the scope in which it was declared, or
2692 NUL_TREE if there is no containing scope. */
2694 extern tree get_containing_scope (tree);
2696 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2698 extern tree decl_function_context (tree);
2700 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2701 this _DECL with its context, or zero if none. */
2702 extern tree decl_type_context (tree);
2704 /* Given the FUNCTION_DECL for the current function,
2705 return zero if it is ok for this function to be inline.
2706 Otherwise return a warning message with a single %s
2707 for the function's name. */
2709 extern const char *function_cannot_inline_p (tree);
2711 /* Return 1 if EXPR is the real constant zero. */
2712 extern int real_zerop (tree);
2714 /* Declare commonly used variables for tree structure. */
2716 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2717 Zero means allow extended lvalues. */
2719 extern int pedantic_lvalues;
2721 /* Nonzero means can safely call expand_expr now;
2722 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2724 extern int immediate_size_expand;
2726 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2728 extern GTY(()) tree current_function_decl;
2730 /* Nonzero means a FUNC_BEGIN label was emitted. */
2731 extern GTY(()) tree current_function_func_begin_label;
2733 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2735 extern int all_types_permanent;
2737 /* Exit a binding level. This function is provided by each language
2739 extern tree poplevel (int, int, int);
2741 /* Declare a predefined function. Return the declaration. This function is
2742 provided by each language frontend. */
2743 extern tree builtin_function (const char *, tree, int, enum built_in_class,
2744 const char *, tree);
2747 extern unsigned crc32_string (unsigned, const char *);
2748 extern void clean_symbol_name (char *);
2749 extern tree get_file_function_name_long (const char *);
2750 extern tree get_set_constructor_bits (tree, char *, int);
2751 extern tree get_set_constructor_bytes (tree, unsigned char *, int);
2752 extern tree get_callee_fndecl (tree);
2753 extern void change_decl_assembler_name (tree, tree);
2754 extern int type_num_arguments (tree);
2755 extern tree lhd_unsave_expr_now (tree);
2756 extern bool associative_tree_code (enum tree_code);
2757 extern bool commutative_tree_code (enum tree_code);
2762 extern void expand_fixups (rtx);
2763 extern tree expand_start_stmt_expr (int);
2764 extern tree expand_end_stmt_expr (tree);
2765 extern void expand_expr_stmt (tree);
2766 extern void expand_expr_stmt_value (tree, int, int);
2767 extern int warn_if_unused_value (tree);
2768 extern void expand_decl_init (tree);
2769 extern void clear_last_expr (void);
2770 extern void expand_label (tree);
2771 extern void expand_goto (tree);
2772 extern void expand_asm (tree, int);
2773 extern void expand_start_cond (tree, int);
2774 extern void expand_end_cond (void);
2775 extern void expand_start_else (void);
2776 extern void expand_start_elseif (tree);
2777 extern struct nesting *expand_start_loop (int);
2778 extern struct nesting *expand_start_loop_continue_elsewhere (int);
2779 extern struct nesting *expand_start_null_loop (void);
2780 extern void expand_loop_continue_here (void);
2781 extern void expand_end_loop (void);
2782 extern void expand_end_null_loop (void);
2783 extern int expand_continue_loop (struct nesting *);
2784 extern int expand_exit_loop (struct nesting *);
2785 extern int expand_exit_loop_if_false (struct nesting *,tree);
2786 extern int expand_exit_loop_top_cond (struct nesting *, tree);
2787 extern int expand_exit_something (void);
2789 extern void expand_return (tree);
2790 extern int optimize_tail_recursion (tree, rtx);
2791 extern void expand_start_bindings_and_block (int, tree);
2792 #define expand_start_bindings(flags) \
2793 expand_start_bindings_and_block(flags, NULL_TREE)
2794 extern void expand_end_bindings (tree, int, int);
2795 extern void warn_about_unused_variables (tree);
2796 extern void start_cleanup_deferral (void);
2797 extern void end_cleanup_deferral (void);
2798 extern int is_body_block (tree);
2800 extern int conditional_context (void);
2801 extern struct nesting * current_nesting_level (void);
2802 extern tree last_cleanup_this_contour (void);
2803 extern void expand_start_case (int, tree, tree, const char *);
2804 extern void expand_end_case_type (tree, tree);
2805 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
2806 extern int add_case_node (tree, tree, tree, tree *);
2807 extern int pushcase (tree, tree (*) (tree, tree), tree, tree *);
2808 extern int pushcase_range (tree, tree, tree (*) (tree, tree), tree, tree *);
2809 extern void using_eh_for_cleanups (void);
2811 /* In fold-const.c */
2813 /* Fold constants as much as possible in an expression.
2814 Returns the simplified expression.
2815 Acts only on the top level of the expression;
2816 if the argument itself cannot be simplified, its
2817 subexpressions are not changed. */
2819 extern tree fold (tree);
2820 extern tree fold_initializer (tree);
2821 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
2823 extern int force_fit_type (tree, int);
2824 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2825 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2826 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2827 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2828 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2829 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2830 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2831 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2832 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2833 HOST_WIDE_INT, unsigned int,
2834 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
2835 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2836 HOST_WIDE_INT, unsigned int,
2837 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
2838 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2839 HOST_WIDE_INT, unsigned int,
2840 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2841 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2842 HOST_WIDE_INT, unsigned int,
2843 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2845 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
2846 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
2847 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
2848 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
2851 extern int operand_equal_p (tree, tree, int);
2852 extern tree omit_one_operand (tree, tree, tree);
2853 extern tree invert_truthvalue (tree);
2856 extern tree fold_builtin (tree);
2857 extern enum built_in_function builtin_mathfn_code (tree);
2858 extern tree build_function_call_expr (tree, tree);
2859 extern tree mathfn_built_in (tree, enum built_in_function fn);
2862 extern tree strip_float_extensions (tree);
2865 extern void record_component_aliases (tree);
2866 extern HOST_WIDE_INT get_alias_set (tree);
2867 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
2868 extern int readonly_fields_p (tree);
2869 extern int objects_must_conflict_p (tree, tree);
2872 extern int really_constant_p (tree);
2873 extern int int_fits_type_p (tree, tree);
2874 extern bool variably_modified_type_p (tree);
2875 extern int tree_log2 (tree);
2876 extern int tree_floor_log2 (tree);
2877 extern int simple_cst_equal (tree, tree);
2878 extern unsigned int iterative_hash_expr (tree, unsigned int);
2879 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
2880 extern int type_list_equal (tree, tree);
2881 extern int chain_member (tree, tree);
2882 extern tree type_hash_lookup (unsigned int, tree);
2883 extern void type_hash_add (unsigned int, tree);
2884 extern unsigned int type_hash_list (tree);
2885 extern int simple_cst_list_equal (tree, tree);
2886 extern void dump_tree_statistics (void);
2887 extern void expand_function_end (void);
2888 extern void expand_function_start (tree, int);
2889 extern void expand_pending_sizes (tree);
2890 extern tree make_vector (enum machine_mode, tree, int);
2891 extern tree reconstruct_complex_type (tree, tree);
2893 extern int real_onep (tree);
2894 extern int real_twop (tree);
2895 extern int real_minus_onep (tree);
2896 extern void init_ttree (void);
2897 extern void build_common_tree_nodes (int);
2898 extern void build_common_tree_nodes_2 (int);
2899 extern tree build_range_type (tree, tree, tree);
2902 extern void setjmp_protect_args (void);
2903 extern void setjmp_protect (tree);
2904 extern void expand_main_function (void);
2905 extern void init_dummy_function_start (void);
2906 extern void expand_dummy_function_end (void);
2907 extern void init_function_for_compilation (void);
2908 extern void allocate_struct_function (tree);
2909 extern void init_function_start (tree);
2910 extern void assign_parms (tree);
2911 extern void put_var_into_stack (tree, int);
2912 extern void flush_addressof (tree);
2913 extern void uninitialized_vars_warning (tree);
2914 extern void setjmp_args_warning (void);
2915 extern void mark_all_temps_used (void);
2916 extern void init_temp_slots (void);
2917 extern void combine_temp_slots (void);
2918 extern void free_temp_slots (void);
2919 extern void pop_temp_slots (void);
2920 extern void push_temp_slots (void);
2921 extern void preserve_temp_slots (rtx);
2922 extern void preserve_rtl_expr_temps (tree);
2923 extern int aggregate_value_p (tree, tree);
2924 extern void free_temps_for_rtl_expr (tree);
2925 extern void instantiate_virtual_regs (tree, rtx);
2926 extern void unshare_all_rtl (tree, rtx);
2927 extern void push_function_context (void);
2928 extern void pop_function_context (void);
2929 extern void push_function_context_to (tree);
2930 extern void pop_function_context_from (tree);
2932 /* In print-rtl.c */
2934 extern void print_rtl (FILE *, rtx);
2937 /* In print-tree.c */
2938 extern void debug_tree (tree);
2940 extern void print_node (FILE *, const char *, tree, int);
2941 extern void print_node_brief (FILE *, const char *, tree, int);
2942 extern void indent_to (FILE *, int);
2946 extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx);
2947 extern void check_max_integer_computation_mode (tree);
2950 extern void start_sequence_for_rtl_expr (tree);
2951 extern rtx emit_line_note (location_t);
2955 /* Nonzero if this is a call to a `const' function. */
2957 /* Nonzero if this is a call to a `volatile' function. */
2958 #define ECF_NORETURN 2
2959 /* Nonzero if this is a call to malloc or a related function. */
2960 #define ECF_MALLOC 4
2961 /* Nonzero if it is plausible that this is a call to alloca. */
2962 #define ECF_MAY_BE_ALLOCA 8
2963 /* Nonzero if this is a call to a function that won't throw an exception. */
2964 #define ECF_NOTHROW 16
2965 /* Nonzero if this is a call to setjmp or a related function. */
2966 #define ECF_RETURNS_TWICE 32
2967 /* Nonzero if this is a call to `longjmp'. */
2968 #define ECF_LONGJMP 64
2969 /* Nonzero if this is a syscall that makes a new process in the image of
2971 #define ECF_FORK_OR_EXEC 128
2972 #define ECF_SIBCALL 256
2973 /* Nonzero if this is a call to "pure" function (like const function,
2974 but may read memory. */
2975 #define ECF_PURE 512
2976 /* Nonzero if this is a call to a function that returns with the stack
2977 pointer depressed. */
2978 #define ECF_SP_DEPRESSED 1024
2979 /* Nonzero if this call is known to always return. */
2980 #define ECF_ALWAYS_RETURN 2048
2981 /* Create libcall block around the call. */
2982 #define ECF_LIBCALL_BLOCK 4096
2984 extern int flags_from_decl_or_type (tree);
2985 extern int call_expr_flags (tree);
2987 extern int setjmp_call_p (tree);
2988 extern bool alloca_call_p (tree);
2992 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
2993 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
2994 it should be modified in place; if a TYPE, a copy should be created
2995 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
2996 information, in the form of a bitwise OR of flags in enum attribute_flags
2997 from tree.h. Depending on these flags, some attributes may be
2998 returned to be applied at a later stage (for example, to apply
2999 a decl attribute to the declaration rather than to its type). */
3000 extern tree decl_attributes (tree *, tree, int);
3002 /* In integrate.c */
3003 extern void save_for_inline (tree);
3004 extern void set_decl_abstract_flags (tree, int);
3005 extern void output_inline_function (tree);
3006 extern void set_decl_origin_self (tree);
3008 /* In stor-layout.c */
3009 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
3010 extern void fixup_signed_type (tree);
3011 extern void internal_reference_types (void);
3014 extern void make_decl_rtl (tree, const char *);
3015 extern void make_decl_one_only (tree);
3016 extern int supports_one_only (void);
3017 extern void variable_section (tree, int);
3018 enum tls_model decl_tls_model (tree);
3019 extern void resolve_unique_section (tree, int, int);
3020 extern void mark_referenced (tree);
3021 extern void notice_global_symbol (tree);
3024 extern void emit_nop (void);
3025 extern void expand_computed_goto (tree);
3026 extern bool parse_output_constraint (const char **, int, int, int,
3027 bool *, bool *, bool *);
3028 extern bool parse_input_constraint (const char **, int, int, int, int,
3029 const char * const *, bool *, bool *);
3030 extern void expand_asm_operands (tree, tree, tree, tree, int, location_t);
3031 extern tree resolve_asm_operand_names (tree, tree, tree);
3032 extern int any_pending_cleanups (void);
3033 extern void init_stmt_for_function (void);
3034 extern void expand_start_target_temps (void);
3035 extern void expand_end_target_temps (void);
3036 extern void expand_elseif (tree);
3037 extern void save_stack_pointer (void);
3038 extern void expand_decl (tree);
3039 extern int expand_decl_cleanup (tree, tree);
3040 extern int expand_decl_cleanup_eh (tree, tree, int);
3041 extern void expand_anon_union_decl (tree, tree, tree);
3042 extern HOST_WIDE_INT all_cases_count (tree, int *);
3043 extern void check_for_full_enumeration_handling (tree);
3044 extern void declare_nonlocal_label (tree);
3046 /* If KIND=='I', return a suitable global initializer (constructor) name.
3047 If KIND=='D', return a suitable global clean-up (destructor) name. */
3048 extern tree get_file_function_name (int);
3050 /* Interface of the DWARF2 unwind info support. */
3052 /* Generate a new label for the CFI info to refer to. */
3054 extern char *dwarf2out_cfi_label (void);
3056 /* Entry point to update the canonical frame address (CFA). */
3058 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
3060 /* Add the CFI for saving a register window. */
3062 extern void dwarf2out_window_save (const char *);
3064 /* Add a CFI to update the running total of the size of arguments pushed
3067 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
3069 /* Entry point for saving a register to the stack. */
3071 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
3073 /* Entry point for saving the return address in the stack. */
3075 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
3077 /* Entry point for saving the return address in a register. */
3079 extern void dwarf2out_return_reg (const char *, unsigned);
3081 /* The type of a function that walks over tree structure. */
3083 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3085 /* In tree-dump.c */
3087 /* Different tree dump places. When you add new tree dump places,
3088 extend the DUMP_FILES array in tree-dump.c */
3089 enum tree_dump_index
3091 TDI_all, /* dump the whole translation unit */
3092 TDI_class, /* dump class hierarchy */
3093 TDI_original, /* dump each function before optimizing it */
3094 TDI_optimized, /* dump each function after optimizing it */
3095 TDI_inlined, /* dump each function after inlining
3100 /* Bit masks to control tree dumping. Not all values are applicable to
3101 all tree dumps. Add new ones at the end. When you define new
3102 values, extend the DUMP_OPTIONS array in tree-dump.c */
3103 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3104 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3106 typedef struct dump_info *dump_info_p;
3108 extern int dump_flag (dump_info_p, int, tree);
3109 extern int dump_enabled_p (enum tree_dump_index);
3110 extern FILE *dump_begin (enum tree_dump_index, int *);
3111 extern void dump_end (enum tree_dump_index, FILE *);
3112 extern void dump_node (tree, int, FILE *);
3113 extern int dump_switch_p (const char *);
3114 extern const char *dump_flag_name (enum tree_dump_index);
3115 /* Assign the RTX to declaration. */
3117 extern void set_decl_rtl (tree, rtx);
3118 extern void set_decl_incoming_rtl (tree, rtx);
3120 /* Redefine abort to report an internal error w/o coredump, and
3121 reporting the location of the error in the source file. This logic
3122 is duplicated in rtl.h and tree.h because every file that needs the
3123 special abort includes one or both. toplev.h gets too few files,
3124 system.h gets too many. */
3126 extern void fancy_abort (const char *, int, const char *)
3128 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3130 /* Enum and arrays used for tree allocation stats.
3131 Keep in sync with tree.c:tree_node_kind_names. */
3151 extern int tree_node_counts[];
3152 extern int tree_node_sizes[];
3154 #endif /* GCC_TREE_H */