1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
42 /* Number of language-independent tree codes. */
43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern const char tree_code_type[];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns nonzero iff CLASS is the tree-code class of an
59 #define IS_EXPR_CODE_CLASS(CLASS) \
60 ((CLASS) == '<' || (CLASS) == '1' || (CLASS) == '2' || (CLASS) == 'e' \
61 || (CLASS) == 'r' || (CLASS) == 's')
63 /* Number of argument-words in each kind of tree-node. */
65 extern const unsigned char tree_code_length[];
66 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
68 /* Names of tree components. */
70 extern const char *const tree_code_name[];
72 /* Classify which part of the compiler has defined a given builtin function.
73 Note that we assume below that this is no more than two bits. */
82 /* Names for the above. */
83 extern const char *const built_in_class_names[4];
85 /* Codes that identify the various built in functions
86 so that expand_call can identify them quickly. */
88 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
89 enum built_in_function
91 #include "builtins.def"
93 /* Upper bound on non-language-specific builtins. */
98 /* Names for the above. */
99 extern const char *const built_in_names[(int) END_BUILTINS];
101 /* An array of _DECL trees for the above. */
102 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
103 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
105 /* The definition of tree nodes fills the next several pages. */
107 /* A tree node can represent a data type, a variable, an expression
108 or a statement. Each node has a TREE_CODE which says what kind of
109 thing it represents. Some common codes are:
110 INTEGER_TYPE -- represents a type of integers.
111 ARRAY_TYPE -- represents a type of pointer.
112 VAR_DECL -- represents a declared variable.
113 INTEGER_CST -- represents a constant integer value.
114 PLUS_EXPR -- represents a sum (an expression).
116 As for the contents of a tree node: there are some fields
117 that all nodes share. Each TREE_CODE has various special-purpose
118 fields as well. The fields of a node are never accessed directly,
119 always through accessor macros. */
121 /* Every kind of tree node starts with this structure,
122 so all nodes have these fields.
124 See the accessor macros, defined below, for documentation of the
127 struct tree_common GTY(())
132 ENUM_BITFIELD(tree_code) code : 8;
134 unsigned side_effects_flag : 1;
135 unsigned constant_flag : 1;
136 unsigned addressable_flag : 1;
137 unsigned volatile_flag : 1;
138 unsigned readonly_flag : 1;
139 unsigned unsigned_flag : 1;
140 unsigned asm_written_flag: 1;
141 unsigned unused_0 : 1;
143 unsigned used_flag : 1;
144 unsigned nothrow_flag : 1;
145 unsigned static_flag : 1;
146 unsigned public_flag : 1;
147 unsigned private_flag : 1;
148 unsigned protected_flag : 1;
149 unsigned deprecated_flag : 1;
150 unsigned unused_1 : 1;
152 unsigned lang_flag_0 : 1;
153 unsigned lang_flag_1 : 1;
154 unsigned lang_flag_2 : 1;
155 unsigned lang_flag_3 : 1;
156 unsigned lang_flag_4 : 1;
157 unsigned lang_flag_5 : 1;
158 unsigned lang_flag_6 : 1;
159 unsigned unused_2 : 1;
162 /* The following table lists the uses of each of the above flags and
163 for which types of nodes they are defined. Note that expressions
169 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
170 ..._TYPE, IDENTIFIER_NODE.
171 In a STMT_EXPR, it means we want the result of the enclosed
177 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
178 TREE_NO_UNUSED_WARNING in
179 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
181 TREE_LIST or TREE_VEC
182 TREE_CONSTANT_OVERFLOW in
183 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
184 TREE_SYMBOL_REFERENCED in
187 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
188 TREE_LIST elements of a block's cleanup list.
193 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
195 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
196 EXPR_WFL_EMIT_LINE_NOTE in
197 EXPR_WITH_FILE_LOCATION
203 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
219 TREE_THIS_VOLATILE in
239 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
240 SAVE_EXPR_NOPLACEHOLDER in
246 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
252 expressions, IDENTIFIER_NODE
257 CALL_EXPR, FUNCTION_DECL
265 /* Define accessors for the fields that all tree nodes have
266 (though some fields are not used for all kinds of nodes). */
268 /* The tree-code says what kind of node it is.
269 Codes are defined in tree.def. */
270 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
271 #define TREE_SET_CODE(NODE, VALUE) \
272 ((NODE)->common.code = (ENUM_BITFIELD (tree_code)) (VALUE))
274 /* When checking is enabled, errors will be generated if a tree node
275 is accessed incorrectly. The macros abort with a fatal error. */
276 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
278 #define TREE_CHECK(T, CODE) __extension__ \
279 ({ const tree __t = (T); \
280 if (TREE_CODE (__t) != (CODE)) \
281 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
284 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
285 ({ const tree __t = (T); \
286 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
287 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
291 /* These checks have to be special cased. */
292 #define EXPR_CHECK(T) __extension__ \
293 ({ const tree __t = (T); \
294 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
295 if (!IS_EXPR_CODE_CLASS (__c)) \
296 tree_class_check_failed (__t, 'e', __FILE__, __LINE__, \
300 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
301 (*({const tree __t = (T); \
302 const int __i = (I); \
303 if (TREE_CODE (__t) != TREE_VEC) \
304 tree_check_failed (__t, TREE_VEC, \
305 __FILE__, __LINE__, __FUNCTION__); \
306 if (__i < 0 || __i >= __t->vec.length) \
307 tree_vec_elt_check_failed (__i, __t->vec.length, \
308 __FILE__, __LINE__, __FUNCTION__); \
309 &__t->vec.a[__i]; }))
311 /* Special checks for TREE_OPERANDs. */
312 #define TREE_OPERAND_CHECK(T, I) __extension__ \
313 (*({const tree __t = EXPR_CHECK (T); \
314 const int __i = (I); \
315 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
316 tree_operand_check_failed (__i, TREE_CODE (__t), \
317 __FILE__, __LINE__, __FUNCTION__); \
318 &__t->exp.operands[__i]; }))
320 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
321 (*({const tree __t = (T); \
322 const int __i = (I); \
323 if (TREE_CODE (__t) != CODE) \
324 tree_check_failed (__t, CODE, __FILE__, __LINE__, __FUNCTION__); \
325 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
326 tree_operand_check_failed (__i, (CODE), \
327 __FILE__, __LINE__, __FUNCTION__); \
328 &__t->exp.operands[__i]; }))
330 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
332 ({const tree __t = (T); \
333 const int __i = (I); \
334 if (TREE_CODE (__t) != (CODE)) \
335 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
336 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
337 tree_operand_check_failed (__i, (CODE), \
338 __FILE__, __LINE__, __FUNCTION__); \
339 &__t->exp.operands[__i]; }))
341 extern void tree_check_failed (const tree, enum tree_code,
342 const char *, int, const char *)
344 extern void tree_class_check_failed (const tree, int,
345 const char *, int, const char *)
347 extern void tree_vec_elt_check_failed (int, int, const char *,
351 extern void tree_operand_check_failed (int, enum tree_code,
352 const char *, int, const char *)
355 #else /* not ENABLE_TREE_CHECKING, or not gcc */
357 #define TREE_CHECK(T, CODE) (T)
358 #define TREE_CLASS_CHECK(T, CODE) (T)
359 #define EXPR_CHECK(T) (T)
360 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
361 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
362 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
363 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
367 #include "tree-check.h"
369 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't')
370 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd')
371 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c')
372 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's')
374 /* In all nodes that are expressions, this is the data type of the expression.
375 In POINTER_TYPE nodes, this is the type that the pointer points to.
376 In ARRAY_TYPE nodes, this is the type of the elements.
377 In VECTOR_TYPE nodes, this is the type of the elements. */
378 #define TREE_TYPE(NODE) ((NODE)->common.type)
380 /* Here is how primitive or already-canonicalized types' hash codes
382 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777)
384 /* Nodes are chained together for many purposes.
385 Types are chained together to record them for being output to the debugger
386 (see the function `chain_type').
387 Decls in the same scope are chained together to record the contents
389 Statement nodes for successive statements used to be chained together.
390 Often lists of things are represented by TREE_LIST nodes that
391 are chained together. */
393 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
395 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
396 that don't change the machine mode. */
398 #define STRIP_NOPS(EXP) \
399 while ((TREE_CODE (EXP) == NOP_EXPR \
400 || TREE_CODE (EXP) == CONVERT_EXPR \
401 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
402 && TREE_OPERAND (EXP, 0) != error_mark_node \
403 && (TYPE_MODE (TREE_TYPE (EXP)) \
404 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
405 (EXP) = TREE_OPERAND (EXP, 0)
407 /* Like STRIP_NOPS, but don't let the signedness change either. */
409 #define STRIP_SIGN_NOPS(EXP) \
410 while ((TREE_CODE (EXP) == NOP_EXPR \
411 || TREE_CODE (EXP) == CONVERT_EXPR \
412 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
413 && TREE_OPERAND (EXP, 0) != error_mark_node \
414 && (TYPE_MODE (TREE_TYPE (EXP)) \
415 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
416 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
417 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
418 (EXP) = TREE_OPERAND (EXP, 0)
420 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
422 #define STRIP_MAIN_TYPE_NOPS(EXP) \
423 while ((TREE_CODE (EXP) == NOP_EXPR \
424 || TREE_CODE (EXP) == CONVERT_EXPR \
425 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
426 && TREE_OPERAND (EXP, 0) != error_mark_node \
427 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
428 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
429 (EXP) = TREE_OPERAND (EXP, 0)
431 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
433 #define STRIP_TYPE_NOPS(EXP) \
434 while ((TREE_CODE (EXP) == NOP_EXPR \
435 || TREE_CODE (EXP) == CONVERT_EXPR \
436 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
437 && TREE_OPERAND (EXP, 0) != error_mark_node \
438 && (TREE_TYPE (EXP) \
439 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
440 (EXP) = TREE_OPERAND (EXP, 0)
442 /* Nonzero if TYPE represents an integral type. Note that we do not
443 include COMPLEX types here. */
445 #define INTEGRAL_TYPE_P(TYPE) \
446 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
447 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
449 /* Nonzero if TYPE represents a floating-point type, including complex
450 floating-point types. */
452 #define FLOAT_TYPE_P(TYPE) \
453 (TREE_CODE (TYPE) == REAL_TYPE \
454 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
455 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
457 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
459 #define AGGREGATE_TYPE_P(TYPE) \
460 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
461 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
462 || TREE_CODE (TYPE) == SET_TYPE)
464 /* Nonzero if TYPE represents a pointer or reference type.
465 (It should be renamed to INDIRECT_TYPE_P.) */
467 #define POINTER_TYPE_P(TYPE) \
468 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
470 /* Nonzero if this type is a complete type. */
471 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
473 /* Nonzero if this type is the (possibly qualified) void type. */
474 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
476 /* Nonzero if this type is complete or is cv void. */
477 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
478 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
480 /* Nonzero if this type is complete or is an array with unspecified bound. */
481 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
482 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
484 /* Nonzero if TYPE represents a type. */
486 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
488 /* Define many boolean fields that all tree nodes have. */
490 /* In VAR_DECL nodes, nonzero means address of this is needed.
491 So it cannot be in a register.
492 In a FUNCTION_DECL, nonzero means its address is needed.
493 So it must be compiled even if it is an inline function.
494 In a FIELD_DECL node, it means that the programmer is permitted to
495 construct the address of this field. This is used for aliasing
496 purposes: see record_component_aliases.
497 In CONSTRUCTOR nodes, it means object constructed must be in memory.
498 In LABEL_DECL nodes, it means a goto for this label has been seen
499 from a place outside all binding contours that restore stack levels.
500 In ..._TYPE nodes, it means that objects of this type must
501 be fully addressable. This means that pieces of this
502 object cannot go into register parameters, for example.
503 In IDENTIFIER_NODEs, this means that some extern decl for this name
504 had its address taken. That matters for inline functions. */
505 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
507 /* In a VAR_DECL, nonzero means allocate static storage.
508 In a FUNCTION_DECL, nonzero if function has been defined.
509 In a CONSTRUCTOR, nonzero means allocate static storage. */
510 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
512 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
513 block's cleanup list, means that the pertinent cleanup should only be
514 executed if an exception is thrown, not on normal exit of its scope. */
515 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
517 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
518 made implicitly and should not lead to an "unused value" warning. */
519 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
521 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
522 chain is via a `virtual' declaration. */
523 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
525 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
526 there was an overflow in folding. This is distinct from
527 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
528 occur in constant expressions. */
529 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
531 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
532 this string as an argument. */
533 #define TREE_SYMBOL_REFERENCED(NODE) \
534 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
536 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
537 there was an overflow in folding, and no warning has been issued
538 for this subexpression. TREE_OVERFLOW implies
539 TREE_CONSTANT_OVERFLOW, but not vice versa. */
540 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
542 /* In a VAR_DECL or FUNCTION_DECL,
543 nonzero means name is to be accessible from outside this module.
544 In an IDENTIFIER_NODE, nonzero means an external declaration
545 accessible from outside this module was previously seen
546 for this name in an inner scope. */
547 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
549 /* In any expression, nonzero means it has side effects or reevaluation
550 of the whole expression could produce a different value.
551 This is set if any subexpression is a function call, a side effect
552 or a reference to a volatile variable.
553 In a ..._DECL, this is set only if the declaration said `volatile'. */
554 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
556 /* Nonzero means this expression is volatile in the C sense:
557 its address should be of type `volatile WHATEVER *'.
558 In other words, the declared item is volatile qualified.
559 This is used in _DECL nodes and _REF nodes.
561 In a ..._TYPE node, means this type is volatile-qualified.
562 But use TYPE_VOLATILE instead of this macro when the node is a type,
563 because eventually we may make that a different bit.
565 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
566 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
568 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
569 nonzero means it may not be the lhs of an assignment.
570 In a ..._TYPE node, means this type is const-qualified
571 (but the macro TYPE_READONLY should be used instead of this macro
572 when the node is a type). */
573 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
575 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
576 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE))
578 /* Value of expression is constant.
579 Always appears in all ..._CST nodes.
580 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
581 if the value is constant. */
582 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
584 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
585 In FIELD_DECL nodes, means an unsigned bit field. */
586 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
588 #define TYPE_TRAP_SIGNED(NODE) \
589 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE)))
591 /* Nonzero in a VAR_DECL means assembler code has been written.
592 Nonzero in a FUNCTION_DECL means that the function has been compiled.
593 This is interesting in an inline function, since it might not need
594 to be compiled separately.
595 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
596 if the sdb debugging info for the type has been written.
597 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
598 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
600 /* Nonzero in a _DECL if the name is used in its scope.
601 Nonzero in an expr node means inhibit warning if value is unused.
602 In IDENTIFIER_NODEs, this means that some extern decl for this name
604 #define TREE_USED(NODE) ((NODE)->common.used_flag)
606 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
607 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
608 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
610 /* In a CALL_EXPR, means that the address of the return slot is part of the
612 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
614 /* In a type, nonzero means that all objects of the type are guaranteed by the
615 language or front-end to be properly aligned, so we can indicate that a MEM
616 of this type is aligned at least to the alignment of the type, even if it
617 doesn't appear that it is. We see this, for example, in object-oriented
618 languages where a tag field may show this is an object of a more-aligned
619 variant of the more generic type. */
620 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
622 /* Used in classes in C++. */
623 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
624 /* Used in classes in C++.
625 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
626 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
628 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
629 deprecated feature by __attribute__((deprecated)). */
630 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
632 /* These flags are available for each language front end to use internally. */
633 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
634 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
635 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
636 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
637 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
638 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
639 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
641 /* Define additional fields and accessors for nodes representing constants. */
643 /* In an INTEGER_CST node. These two together make a 2-word integer.
644 If the data type is signed, the value is sign-extended to 2 words
645 even though not all of them may really be in use.
646 In an unsigned constant shorter than 2 words, the extra bits are 0. */
647 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
648 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
649 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
651 #define INT_CST_LT(A, B) \
652 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
653 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
654 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
656 #define INT_CST_LT_UNSIGNED(A, B) \
657 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
658 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
659 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
660 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
661 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
663 struct tree_int_cst GTY(())
665 struct tree_common common;
666 /* A sub-struct is necessary here because the function `const_hash'
667 wants to scan both words as a unit and taking the address of the
668 sub-struct yields the properly inclusive bounded pointer. */
669 struct tree_int_cst_lowhi {
670 unsigned HOST_WIDE_INT low;
675 /* In a REAL_CST node. struct real_value is an opaque entity, with
676 manipulators defined in real.h. We don't want tree.h depending on
677 real.h and transitively on tm.h. */
680 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
681 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
683 struct tree_real_cst GTY(())
685 struct tree_common common;
686 struct real_value * real_cst_ptr;
689 /* In a STRING_CST */
690 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
691 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
693 struct tree_string GTY(())
695 struct tree_common common;
700 /* In a COMPLEX_CST node. */
701 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
702 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
704 struct tree_complex GTY(())
706 struct tree_common common;
711 /* In a VECTOR_CST node. */
712 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
714 struct tree_vector GTY(())
716 struct tree_common common;
720 #include "hashtable.h"
722 /* Define fields and accessors for some special-purpose tree nodes. */
724 #define IDENTIFIER_LENGTH(NODE) \
725 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
726 #define IDENTIFIER_POINTER(NODE) \
727 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
728 #define IDENTIFIER_HASH_VALUE(NODE) \
729 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
731 /* Translate a hash table identifier pointer to a tree_identifier
732 pointer, and vice versa. */
734 #define HT_IDENT_TO_GCC_IDENT(NODE) \
735 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
736 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
738 struct tree_identifier GTY(())
740 struct tree_common common;
741 struct ht_identifier id;
744 /* In a TREE_LIST node. */
745 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
746 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
748 struct tree_list GTY(())
750 struct tree_common common;
755 /* In a TREE_VEC node. */
756 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
757 #define TREE_VEC_END(NODE) \
758 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
760 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
762 struct tree_vec GTY(())
764 struct tree_common common;
766 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
769 /* Define fields and accessors for some nodes that represent expressions. */
771 /* In a SAVE_EXPR node. */
772 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1)
773 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2)
775 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE))
776 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
777 both in normal code and in a handler. (Normally, in a handler, all
778 SAVE_EXPRs are unsaved, meaning that their values are
780 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
782 /* In a RTL_EXPR node. */
783 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0)
784 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1)
786 /* In a WITH_CLEANUP_EXPR node. */
787 #define WITH_CLEANUP_EXPR_RTL(NODE) \
788 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2)
790 /* In a CONSTRUCTOR node. */
791 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
793 /* In ordinary expression nodes. */
794 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
795 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
797 /* In a LABELED_BLOCK_EXPR node. */
798 #define LABELED_BLOCK_LABEL(NODE) \
799 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
800 #define LABELED_BLOCK_BODY(NODE) \
801 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
803 /* In an EXIT_BLOCK_EXPR node. */
804 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
805 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
806 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
808 /* In a LOOP_EXPR node. */
809 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
811 /* In an EXPR_WITH_FILE_LOCATION node. */
812 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
813 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
814 #define EXPR_WFL_NODE(NODE) \
815 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 0)
816 #define EXPR_WFL_FILENAME_NODE(NODE) \
817 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 1)
818 #define EXPR_WFL_FILENAME(NODE) \
819 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE))
820 /* ??? Java uses this in all expressions. */
821 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
822 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
823 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
824 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
825 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
827 /* In a TARGET_EXPR node. */
828 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
829 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
830 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
832 struct tree_exp GTY(())
834 struct tree_common common;
836 tree GTY ((special ("tree_exp"),
837 desc ("TREE_CODE ((tree) &%0)")))
841 /* In a BLOCK node. */
842 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
843 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
844 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
845 /* Note: when changing this, make sure to find the places
846 that use chainon or nreverse. */
847 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
848 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
849 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
851 /* Nonzero means that this block is prepared to handle exceptions
852 listed in the BLOCK_VARS slot. */
853 #define BLOCK_HANDLER_BLOCK(NODE) \
854 (BLOCK_CHECK (NODE)->block.handler_block_flag)
856 /* An index number for this block. These values are not guaranteed to
857 be unique across functions -- whether or not they are depends on
858 the debugging output format in use. */
859 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
861 /* If block reordering splits a lexical block into discontiguous
862 address ranges, we'll make a copy of the original block.
864 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
865 In that case, we have one source block that has been replicated
866 (through inlining or unrolling) into many logical blocks, and that
867 these logical blocks have different physical variables in them.
869 In this case, we have one logical block split into several
870 non-contiguous address ranges. Most debug formats can't actually
871 represent this idea directly, so we fake it by creating multiple
872 logical blocks with the same variables in them. However, for those
873 that do support non-contiguous regions, these allow the original
874 logical block to be reconstructed, along with the set of address
877 One of the logical block fragments is arbitrarily chosen to be
878 the ORIGIN. The other fragments will point to the origin via
879 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
880 be null. The list of fragments will be chained through
881 BLOCK_FRAGMENT_CHAIN from the origin. */
883 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
884 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
886 struct tree_block GTY(())
888 struct tree_common common;
890 unsigned handler_block_flag : 1;
891 unsigned abstract_flag : 1;
892 unsigned block_num : 30;
897 tree abstract_origin;
898 tree fragment_origin;
902 /* Define fields and accessors for nodes representing data types. */
904 /* See tree.def for documentation of the use of these fields.
905 Look at the documentation of the various ..._TYPE tree codes. */
907 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
908 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
909 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
910 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
911 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
912 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
913 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
914 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
915 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
916 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
917 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
918 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
919 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
920 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
921 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
922 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
923 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
924 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
925 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
926 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
927 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
928 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
929 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
930 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
931 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
933 /* For a VECTOR_TYPE node, this describes a different type which is emitted
934 in the debugging output. We use this to describe a vector as a
935 structure containing an array. */
936 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
938 /* For aggregate types, information about this type, as a base type
939 for itself. Used in a language-dependent way for types that are
940 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
941 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
943 /* The (language-specific) typed-based alias set for this type.
944 Objects whose TYPE_ALIAS_SETs are different cannot alias each
945 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
946 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
947 type can alias objects of any type. */
948 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
950 /* Nonzero iff the typed-based alias set for this type has been
952 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
954 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
956 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
958 /* The alignment necessary for objects of this type.
959 The value is an int, measured in bits. */
960 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
962 /* 1 if the alignment for this type was requested by "aligned" attribute,
963 0 if it is the default for this type. */
964 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
966 /* The alignment for NODE, in bytes. */
967 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
969 /* If your language allows you to declare types, and you want debug info
970 for them, then you need to generate corresponding TYPE_DECL nodes.
971 These "stub" TYPE_DECL nodes have no name, and simply point at the
972 type node. You then set the TYPE_STUB_DECL field of the type node
973 to point back at the TYPE_DECL node. This allows the debug routines
974 to know that the two nodes represent the same type, so that we only
975 get one debug info record for them. */
976 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
978 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
979 has BLKmode only because it lacks the alignment requirement for
981 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
983 /* In an INTEGER_TYPE, it means the type represents a size. We use
984 this both for validity checking and to permit optimizations that
985 are unsafe for other types. Note that the C `size_t' type should
986 *not* have this flag set. The `size_t' type is simply a typedef
987 for an ordinary integer type that happens to be the type of an
988 expression returned by `sizeof'; `size_t' has no special
989 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
990 always actual sizes. */
991 #define TYPE_IS_SIZETYPE(NODE) \
992 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
994 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
995 pointer depressed. */
996 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
997 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
999 /* Nonzero in a type considered volatile as a whole. */
1000 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1002 /* Means this type is const-qualified. */
1003 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1005 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1007 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1009 /* There is a TYPE_QUAL value for each type qualifier. They can be
1010 combined by bitwise-or to form the complete set of qualifiers for a
1013 #define TYPE_UNQUALIFIED 0x0
1014 #define TYPE_QUAL_CONST 0x1
1015 #define TYPE_QUAL_VOLATILE 0x2
1016 #define TYPE_QUAL_RESTRICT 0x4
1018 /* The set of type qualifiers for this type. */
1019 #define TYPE_QUALS(NODE) \
1020 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1021 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1022 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1024 /* These flags are available for each language front end to use internally. */
1025 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1026 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1027 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1028 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1029 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1030 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1031 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1033 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1034 that distinguish string from array of char).
1035 If set in a SET_TYPE, indicates a bitstring type. */
1036 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1038 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1039 object of the given ARRAY_TYPE. This allows temporaries to be
1041 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1042 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE))
1044 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1045 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1046 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1048 /* Indicates that objects of this type must be initialized by calling a
1049 function when they are created. */
1050 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1051 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1053 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1054 the same way that the first union alternative would be passed. */
1055 #define TYPE_TRANSPARENT_UNION(NODE) \
1056 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1058 /* For an ARRAY_TYPE, indicates that it is not permitted to
1059 take the address of a component of the type. */
1060 #define TYPE_NONALIASED_COMPONENT(NODE) \
1061 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1063 /* Indicated that objects of this type should be laid out in as
1064 compact a way as possible. */
1065 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1069 struct tree_type GTY(())
1071 struct tree_common common;
1078 unsigned int precision : 9;
1079 ENUM_BITFIELD(machine_mode) mode : 7;
1081 unsigned string_flag : 1;
1082 unsigned no_force_blk_flag : 1;
1083 unsigned needs_constructing_flag : 1;
1084 unsigned transparent_union_flag : 1;
1085 unsigned packed_flag : 1;
1086 unsigned restrict_flag : 1;
1089 unsigned lang_flag_0 : 1;
1090 unsigned lang_flag_1 : 1;
1091 unsigned lang_flag_2 : 1;
1092 unsigned lang_flag_3 : 1;
1093 unsigned lang_flag_4 : 1;
1094 unsigned lang_flag_5 : 1;
1095 unsigned lang_flag_6 : 1;
1096 unsigned user_align : 1;
1101 union tree_type_symtab {
1102 int GTY ((tag ("0"))) address;
1103 char * GTY ((tag ("1"))) pointer;
1104 struct die_struct * GTY ((tag ("2"))) die;
1105 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1106 descbits ("2"))) symtab;
1114 HOST_WIDE_INT alias_set;
1115 /* Points to a structure whose details depend on the language in use. */
1116 struct lang_type *lang_specific;
1119 /* Define accessor macros for information about type inheritance
1122 A "basetype" means a particular usage of a data type for inheritance
1123 in another type. Each such basetype usage has its own "binfo"
1124 object to describe it. The binfo object is a TREE_VEC node.
1126 Inheritance is represented by the binfo nodes allocated for a
1127 given type. For example, given types C and D, such that D is
1128 inherited by C, 3 binfo nodes will be allocated: one for describing
1129 the binfo properties of C, similarly one for D, and one for
1130 describing the binfo properties of D as a base type for C.
1131 Thus, given a pointer to class C, one can get a pointer to the binfo
1132 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1134 /* The actual data type node being inherited in this basetype. */
1135 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1137 /* The offset where this basetype appears in its containing type.
1138 BINFO_OFFSET slot holds the offset (in bytes)
1139 from the base of the complete object to the base of the part of the
1140 object that is allocated on behalf of this `type'.
1141 This is always 0 except when there is multiple inheritance. */
1143 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1144 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1145 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1147 /* The virtual function table belonging to this basetype. Virtual
1148 function tables provide a mechanism for run-time method dispatching.
1149 The entries of a virtual function table are language-dependent. */
1151 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1152 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1154 /* The virtual functions in the virtual function table. This is
1155 a TREE_LIST that is used as an initial approximation for building
1156 a virtual function table for this basetype. */
1157 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1158 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1160 /* A vector of binfos for the direct basetypes inherited by this
1163 If this basetype describes type D as inherited in C, and if the
1164 basetypes of D are E and F, then this vector contains binfos for
1165 inheritance of E and F by C.
1167 ??? This could probably be done by just allocating the
1168 base types at the end of this TREE_VEC (instead of using
1169 another TREE_VEC). This would simplify the calculation
1170 of how many basetypes a given type had. */
1171 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1172 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1174 /* The number of basetypes for NODE. */
1175 #define BINFO_N_BASETYPES(NODE) \
1176 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1178 /* Accessor macro to get to the Nth basetype of this basetype. */
1179 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1180 #define TYPE_BINFO_BASETYPE(NODE,N) \
1181 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1183 /* For a BINFO record describing a virtual base class, i.e., one where
1184 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1185 base. The actual contents are language-dependent. In the C++
1186 front-end this field is an INTEGER_CST giving an offset into the
1187 vtable where the offset to the virtual base can be found. */
1188 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1190 /* Indicates the accesses this binfo has to its bases. The values are
1191 access_public_node, access_protected_node or access_private_node.
1192 If this array is not present, public access is implied. */
1193 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1194 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1196 /* Number of language independent elements in a binfo. Languages may
1197 add additional trailing elements. */
1199 #define BINFO_ELTS 7
1201 /* Slot used to build a chain that represents a use of inheritance.
1202 For example, if X is derived from Y, and Y is derived from Z,
1203 then this field can be used to link the binfo node for X to
1204 the binfo node for X's Y to represent the use of inheritance
1205 from X to Y. Similarly, this slot of the binfo node for X's Y
1206 can point to the Z from which Y is inherited (in X's inheritance
1207 hierarchy). In this fashion, one can represent and traverse specific
1208 uses of inheritance using the binfo nodes themselves (instead of
1209 consing new space pointing to binfo nodes).
1210 It is up to the language-dependent front-ends to maintain
1211 this information as necessary. */
1212 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1214 /* Define fields and accessors for nodes representing declared names. */
1216 /* Nonzero if DECL represents a decl. */
1217 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1219 /* This is the name of the object as written by the user.
1220 It is an IDENTIFIER_NODE. */
1221 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1223 /* The name of the object as the assembler will see it (but before any
1224 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1225 as DECL_NAME. It is an IDENTIFIER_NODE. */
1226 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1228 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1229 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1231 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1232 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1234 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1235 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1236 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1238 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1239 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1240 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1241 semantics of using this macro, are different than saying:
1243 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1245 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1247 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1248 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1249 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1250 DECL_ASSEMBLER_NAME (DECL1)) \
1253 /* Records the section name in a section attribute. Used to pass
1254 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1255 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1257 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1258 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1259 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1260 points to either the FUNCTION_DECL for the containing function,
1261 the RECORD_TYPE or UNION_TYPE for the containing type, or
1262 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1264 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1265 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1266 /* In a DECL this is the field where attributes are stored. */
1267 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1268 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1269 byte containing the bit closest to the beginning of the structure. */
1270 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1271 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1272 field from DECL_FIELD_OFFSET. */
1273 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1274 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1275 if so, the type that was originally specified for it.
1276 TREE_TYPE may have been modified (in finish_struct). */
1277 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1278 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1279 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1281 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1282 /* This field is used to reference anything in decl.result and is meant only
1283 for use by the garbage collector. */
1284 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1285 /* In FUNCTION_DECL, holds the decl for the return value. */
1286 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1287 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1288 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1289 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1290 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1291 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1292 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1293 For a VAR_DECL, holds the initial value.
1294 For a PARM_DECL, not used--default
1295 values for parameters are encoded in the type of the function,
1296 not in the PARM_DECL slot. */
1297 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1298 /* For a PARM_DECL, records the data type used to pass the argument,
1299 which may be different from the type seen in the program. */
1300 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1301 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1302 if nonzero, indicates that the field occupies the type. */
1303 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1304 /* These two fields describe where in the source code the declaration
1305 was. If the declaration appears in several places (as for a C
1306 function that is declared first and then defined later), this
1307 information should refer to the definition. */
1308 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1309 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1310 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1311 /* Holds the size of the datum, in bits, as a tree expression.
1312 Need not be constant. */
1313 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1314 /* Likewise for the size in bytes. */
1315 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1316 /* Holds the alignment required for the datum, in bits. */
1317 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1318 /* The alignment of NODE, in bytes. */
1319 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1320 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1321 DECL_FIELD_OFFSET which are known to be always zero.
1322 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1324 #define DECL_OFFSET_ALIGN(NODE) \
1325 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1326 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1327 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1328 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1329 /* 1 if the alignment for this type was requested by "aligned" attribute,
1330 0 if it is the default for this type. */
1331 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1332 /* Holds the machine mode corresponding to the declaration of a variable or
1333 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1335 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1336 /* Holds the RTL expression for the value of a variable or function. If
1337 PROMOTED_MODE is defined, the mode of this expression may not be same
1338 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1339 to the variable's data type, while the mode
1340 of DECL_RTL is the mode actually used to contain the data.
1342 This value can be evaluated lazily for functions, variables with
1343 static storage duration, and labels. */
1344 #define DECL_RTL(NODE) \
1345 (DECL_CHECK (NODE)->decl.rtl \
1346 ? (NODE)->decl.rtl \
1347 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1348 /* Set the DECL_RTL for NODE to RTL. */
1349 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1350 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1351 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1352 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1353 NODE1, it will not be set for NODE2; this is a lazy copy. */
1354 #define COPY_DECL_RTL(NODE1, NODE2) \
1355 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1356 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1357 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1359 /* For PARM_DECL, holds an RTL for the stack slot or register
1360 where the data was actually passed. */
1361 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1363 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1364 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1366 /* For FUNCTION_DECL, if it is built-in,
1367 this identifies which built-in operation it is. */
1368 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1370 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1371 Before the struct containing the FUNCTION_DECL is laid out,
1372 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1373 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1374 function. When the class is laid out, this pointer is changed
1375 to an INTEGER_CST node which is suitable for use as an index
1376 into the virtual function table. */
1377 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1379 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1380 which this FIELD_DECL is defined. This information is needed when
1381 writing debugging information about vfield and vbase decls for C++. */
1382 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1384 /* Every ..._DECL node gets a unique number. */
1385 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1387 /* For any sort of a ..._DECL node, this points to the original (abstract)
1388 decl node which this decl is an instance of, or else it is NULL indicating
1389 that this decl is not an instance of some other decl. For example,
1390 in a nested declaration of an inline function, this points back to the
1392 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1394 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1395 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1396 #define DECL_ORIGIN(NODE) \
1397 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1399 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1400 inline instance of some original (abstract) decl from an inline function;
1401 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1402 nodes can also have their abstract origin set to themselves. */
1403 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1404 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1406 /* Nonzero if a _DECL means that the name of this decl should be ignored
1407 for symbolic debug purposes. */
1408 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1410 /* Nonzero for a given ..._DECL node means that this node represents an
1411 "abstract instance" of the given declaration (e.g. in the original
1412 declaration of an inline function). When generating symbolic debugging
1413 information, we mustn't try to generate any address information for nodes
1414 marked as "abstract instances" because we don't actually generate
1415 any code or allocate any data space for such instances. */
1416 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1418 /* Nonzero if a _DECL means that no warnings should be generated just
1419 because this decl is unused. */
1420 #define DECL_IN_SYSTEM_HEADER(NODE) \
1421 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1423 /* Nonzero for a given ..._DECL node means that this node should be
1424 put in .common, if possible. If a DECL_INITIAL is given, and it
1425 is not error_mark_node, then the decl cannot be put in .common. */
1426 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1428 /* Language-specific decl information. */
1429 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1431 /* In a VAR_DECL or FUNCTION_DECL,
1432 nonzero means external reference:
1433 do not allocate storage, and refer to a definition elsewhere. */
1434 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1436 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1438 #define DEFAULT_INIT_PRIORITY 65535
1439 #define MAX_INIT_PRIORITY 65535
1440 #define MAX_RESERVED_INIT_PRIORITY 100
1443 nonzero means the detail info about this type is not dumped into stabs.
1444 Instead it will generate cross reference ('x') of names.
1445 This uses the same flag as DECL_EXTERNAL. */
1446 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1447 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1449 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1450 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1452 /* In LABEL_DECL nodes, nonzero means that an error message about
1453 jumping into such a binding contour has been printed for this label. */
1454 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1456 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1457 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1459 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1460 static chain is not needed. */
1461 #define DECL_NO_STATIC_CHAIN(NODE) \
1462 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1464 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1465 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1467 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1469 Also set in some languages for variables, etc., outside the normal
1470 lexical scope, such as class instance variables. */
1471 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1473 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1474 where it is called. */
1475 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1477 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
1478 such as via the `inline' keyword in C/C++. This flag controls the linkage
1479 semantics of 'inline'; whether or not the function is inlined is
1480 controlled by DECL_INLINE. */
1481 #define DECL_DECLARED_INLINE_P(NODE) \
1482 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
1484 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1485 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1487 /* In a VAR_DECL, nonzero if the data should be allocated from
1488 thread-local storage. */
1489 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1491 /* In a FUNCTION_DECL, the saved representation of the body of the
1492 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1493 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1494 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1496 /* List of FUNCTION_DECLs inlined into this function's body. */
1497 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1499 /* Nonzero in a FUNCTION_DECL means this function should be treated
1500 as if it were a malloc, meaning it returns a pointer that is
1502 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1504 /* Nonzero in a FUNCTION_DECL means this function should be treated
1505 as "pure" function (like const function, but may read global memory). */
1506 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1508 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1510 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1512 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1513 contour that restored a stack level and which is now exited. */
1514 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1516 /* Unused in FUNCTION_DECL. */
1518 /* In a VAR_DECL that's static,
1519 nonzero if the space is in the text section. */
1520 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1522 /* In a FUNCTION_DECL, nonzero means a built in function. */
1523 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1525 /* For a builtin function, identify which part of the compiler defined it. */
1526 #define DECL_BUILT_IN_CLASS(NODE) \
1527 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1529 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1530 Used in FIELD_DECLs for vtable pointers.
1531 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1532 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1534 /* Used to indicate that the linkage status of this DECL is not yet known,
1535 so it should not be output now. */
1536 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1538 /* Used in PARM_DECLs whose type are unions to indicate that the
1539 argument should be passed in the same way that the first union
1540 alternative would be passed. */
1541 #define DECL_TRANSPARENT_UNION(NODE) \
1542 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1544 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1545 at the beginning or end of execution. */
1546 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1547 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1549 #define DECL_STATIC_DESTRUCTOR(NODE) \
1550 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1552 /* Used to indicate that this DECL represents a compiler-generated entity. */
1553 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1555 /* Used to indicate that this DECL has weak linkage. */
1556 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1558 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1559 multiple translation units should be merged. */
1560 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1562 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1563 not be put out unless it is needed in this translation unit.
1564 Entities like this are shared across translation units (like weak
1565 entities), but are guaranteed to be generated by any translation
1566 unit that needs them, and therefore need not be put out anywhere
1567 where they are not needed. DECL_COMDAT is just a hint to the
1568 back-end; it is up to front-ends which set this flag to ensure
1569 that there will never be any harm, other than bloat, in putting out
1570 something which is DECL_COMDAT. */
1571 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1573 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1574 be instrumented with calls to support routines. */
1575 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1576 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1578 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1579 disabled in this function. */
1580 #define DECL_NO_LIMIT_STACK(NODE) \
1581 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1583 /* Additional flags for language-specific uses. */
1584 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1585 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1586 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1587 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1588 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1589 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1590 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1591 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1593 /* Used to indicate that the pointer to this DECL cannot be treated as
1594 an address constant. */
1595 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1597 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1599 #define DECL_NONADDRESSABLE_P(NODE) \
1600 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1602 /* Used to indicate an alias set for the memory pointed to by this
1603 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1604 pointer (or reference) type. */
1605 #define DECL_POINTER_ALIAS_SET(NODE) \
1606 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1608 /* Nonzero if an alias set has been assigned to this declaration. */
1609 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1610 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1612 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this is
1613 the approximate number of statements in this function. There is
1614 no need for this number to be exact; it is only used in various
1615 heuristics regarding optimization. */
1616 #define DECL_ESTIMATED_INSNS(NODE) \
1617 (FUNCTION_DECL_CHECK (NODE)->decl.u1.i)
1621 struct tree_decl GTY(())
1623 struct tree_common common;
1627 ENUM_BITFIELD(machine_mode) mode : 8;
1629 unsigned external_flag : 1;
1630 unsigned nonlocal_flag : 1;
1631 unsigned regdecl_flag : 1;
1632 unsigned inline_flag : 1;
1633 unsigned bit_field_flag : 1;
1634 unsigned virtual_flag : 1;
1635 unsigned ignored_flag : 1;
1636 unsigned abstract_flag : 1;
1638 unsigned in_system_header_flag : 1;
1639 unsigned common_flag : 1;
1640 unsigned defer_output : 1;
1641 unsigned transparent_union : 1;
1642 unsigned static_ctor_flag : 1;
1643 unsigned static_dtor_flag : 1;
1644 unsigned artificial_flag : 1;
1645 unsigned weak_flag : 1;
1647 unsigned non_addr_const_p : 1;
1648 unsigned no_instrument_function_entry_exit : 1;
1649 unsigned comdat_flag : 1;
1650 unsigned malloc_flag : 1;
1651 unsigned no_limit_stack : 1;
1652 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1653 unsigned pure_flag : 1;
1655 unsigned non_addressable : 1;
1656 unsigned user_align : 1;
1657 unsigned uninlinable : 1;
1658 unsigned thread_local_flag : 1;
1659 unsigned declared_inline_flag : 1;
1660 unsigned unused : 3;
1661 /* three unused bits. */
1663 unsigned lang_flag_0 : 1;
1664 unsigned lang_flag_1 : 1;
1665 unsigned lang_flag_2 : 1;
1666 unsigned lang_flag_3 : 1;
1667 unsigned lang_flag_4 : 1;
1668 unsigned lang_flag_5 : 1;
1669 unsigned lang_flag_6 : 1;
1670 unsigned lang_flag_7 : 1;
1672 union tree_decl_u1 {
1673 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1674 DECL_FUNCTION_CODE. */
1675 enum built_in_function f;
1676 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
1677 is used by language-dependent code. */
1679 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1681 struct tree_decl_u1_a {
1682 unsigned int align : 24;
1683 unsigned int off_align : 8;
1685 } GTY ((skip (""))) u1;
1690 tree arguments; /* Also used for DECL_FIELD_OFFSET */
1691 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
1692 tree initial; /* Also used for DECL_QUALIFIER */
1693 tree abstract_origin;
1694 tree assembler_name;
1697 rtx rtl; /* RTL representation for object. */
1699 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1700 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1701 In PARM_DECL, holds an RTL for the stack slot
1702 of register where the data was actually passed.
1703 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1704 union tree_decl_u2 {
1705 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
1706 rtx GTY ((tag ("PARM_DECL"))) r;
1707 tree GTY ((tag ("FIELD_DECL"))) t;
1708 int GTY ((tag ("VAR_DECL"))) i;
1709 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
1711 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1714 /* In a FUNCTION_DECL, these are function data which is to be kept
1715 as long as FUNCTION_DECL is kept. */
1719 HOST_WIDE_INT pointer_alias_set;
1720 /* Points to a structure whose details depend on the language in use. */
1721 struct lang_decl *lang_specific;
1724 enum tree_node_structure_enum {
1741 /* Define the overall contents of a tree node.
1742 It may be any of the structures declared above
1743 for various types of node. */
1745 union tree_node GTY ((ptr_alias (union lang_tree_node),
1746 desc ("tree_node_structure (&%h)")))
1748 struct tree_common GTY ((tag ("TS_COMMON"))) common;
1749 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
1750 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
1751 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
1752 struct tree_string GTY ((tag ("TS_STRING"))) string;
1753 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
1754 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
1755 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
1756 struct tree_type GTY ((tag ("TS_TYPE"))) type;
1757 struct tree_list GTY ((tag ("TS_LIST"))) list;
1758 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
1759 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
1760 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
1763 /* Standard named or nameless data types of the C compiler. */
1782 TI_INTEGER_MINUS_ONE,
1795 TI_COMPLEX_INTEGER_TYPE,
1796 TI_COMPLEX_FLOAT_TYPE,
1797 TI_COMPLEX_DOUBLE_TYPE,
1798 TI_COMPLEX_LONG_DOUBLE_TYPE,
1802 TI_LONG_DOUBLE_TYPE,
1846 extern GTY(()) tree global_trees[TI_MAX];
1848 #define error_mark_node global_trees[TI_ERROR_MARK]
1850 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1851 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1852 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1853 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1854 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1856 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1857 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1858 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1859 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1860 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1862 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1863 #define integer_one_node global_trees[TI_INTEGER_ONE]
1864 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
1865 #define size_zero_node global_trees[TI_SIZE_ZERO]
1866 #define size_one_node global_trees[TI_SIZE_ONE]
1867 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1868 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1869 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1871 /* Base access nodes. */
1872 #define access_public_node NULL_TREE
1873 #define access_protected_node size_zero_node
1874 #define access_private_node size_one_node
1876 #define null_pointer_node global_trees[TI_NULL_POINTER]
1878 #define float_type_node global_trees[TI_FLOAT_TYPE]
1879 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1880 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1882 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1883 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1884 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1885 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1887 #define void_type_node global_trees[TI_VOID_TYPE]
1888 /* The C type `void *'. */
1889 #define ptr_type_node global_trees[TI_PTR_TYPE]
1890 /* The C type `const void *'. */
1891 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1892 /* The C type `size_t'. */
1893 #define size_type_node global_trees[TI_SIZE_TYPE]
1894 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1895 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1897 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
1898 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
1899 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
1901 /* The node that should be placed at the end of a parameter list to
1902 indicate that the function does not take a variable number of
1903 arguments. The TREE_VALUE will be void_type_node and there will be
1904 no TREE_CHAIN. Language-independent code should not assume
1905 anything else about this node. */
1906 #define void_list_node global_trees[TI_VOID_LIST_NODE]
1908 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
1909 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
1911 #define unsigned_V16QI_type_node global_trees[TI_UV16QI_TYPE]
1912 #define unsigned_V4SI_type_node global_trees[TI_UV4SI_TYPE]
1913 #define unsigned_V8QI_type_node global_trees[TI_UV8QI_TYPE]
1914 #define unsigned_V8HI_type_node global_trees[TI_UV8HI_TYPE]
1915 #define unsigned_V4HI_type_node global_trees[TI_UV4HI_TYPE]
1916 #define unsigned_V2HI_type_node global_trees[TI_UV2HI_TYPE]
1917 #define unsigned_V2SI_type_node global_trees[TI_UV2SI_TYPE]
1918 #define unsigned_V2DI_type_node global_trees[TI_UV2DI_TYPE]
1919 #define unsigned_V1DI_type_node global_trees[TI_UV1DI_TYPE]
1921 #define V16QI_type_node global_trees[TI_V16QI_TYPE]
1922 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
1923 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
1924 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
1925 #define V8HI_type_node global_trees[TI_V8HI_TYPE]
1926 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
1927 #define V2HI_type_node global_trees[TI_V2HI_TYPE]
1928 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
1929 #define V2SF_type_node global_trees[TI_V2SF_TYPE]
1930 #define V2DI_type_node global_trees[TI_V2DI_TYPE]
1931 #define V2DF_type_node global_trees[TI_V2DF_TYPE]
1932 #define V16SF_type_node global_trees[TI_V16SF_TYPE]
1933 #define V1DI_type_node global_trees[TI_V1DI_TYPE]
1934 #define V4DF_type_node global_trees[TI_V4DF_TYPE]
1936 /* An enumeration of the standard C integer types. These must be
1937 ordered so that shorter types appear before longer ones, and so
1938 that signed types appear before unsigned ones, for the correct
1939 functioning of interpret_integer() in c-lex.c. */
1940 enum integer_type_kind
1952 itk_unsigned_long_long,
1956 typedef enum integer_type_kind integer_type_kind;
1958 /* The standard C integer types. Use integer_type_kind to index into
1960 extern GTY(()) tree integer_types[itk_none];
1962 #define char_type_node integer_types[itk_char]
1963 #define signed_char_type_node integer_types[itk_signed_char]
1964 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1965 #define short_integer_type_node integer_types[itk_short]
1966 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1967 #define integer_type_node integer_types[itk_int]
1968 #define unsigned_type_node integer_types[itk_unsigned_int]
1969 #define long_integer_type_node integer_types[itk_long]
1970 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1971 #define long_long_integer_type_node integer_types[itk_long_long]
1972 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1974 /* Set to the default thread-local storage (tls) model to use. */
1977 TLS_MODEL_GLOBAL_DYNAMIC = 1,
1978 TLS_MODEL_LOCAL_DYNAMIC,
1979 TLS_MODEL_INITIAL_EXEC,
1980 TLS_MODEL_LOCAL_EXEC
1983 extern enum tls_model flag_tls_default;
1985 /* Enumerate visibility settings. */
1987 enum symbol_visibility
1990 VISIBILITY_INTERNAL,
1992 VISIBILITY_PROTECTED
1995 /* A pointer-to-function member type looks like:
2002 If __pfn is NULL, it is a NULL pointer-to-member-function.
2004 (Because the vtable is always the first thing in the object, we
2005 don't need its offset.) If the function is virtual, then PFN is
2006 one plus twice the index into the vtable; otherwise, it is just a
2007 pointer to the function.
2009 Unfortunately, using the lowest bit of PFN doesn't work in
2010 architectures that don't impose alignment requirements on function
2011 addresses, or that use the lowest bit to tell one ISA from another,
2012 for example. For such architectures, we use the lowest bit of
2013 DELTA instead of the lowest bit of the PFN, and DELTA will be
2016 enum ptrmemfunc_vbit_where_t
2018 ptrmemfunc_vbit_in_pfn,
2019 ptrmemfunc_vbit_in_delta
2022 #define NULL_TREE (tree) NULL
2024 extern tree decl_assembler_name (tree);
2026 /* Compute the number of bytes occupied by 'node'. This routine only
2027 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2029 extern size_t tree_size (tree);
2031 /* Lowest level primitive for allocating a node.
2032 The TREE_CODE is the only argument. Contents are initialized
2033 to zero except for a few of the common fields. */
2035 extern tree make_node (enum tree_code);
2037 /* Make a copy of a node, with all the same contents. */
2039 extern tree copy_node (tree);
2041 /* Make a copy of a chain of TREE_LIST nodes. */
2043 extern tree copy_list (tree);
2045 /* Make a TREE_VEC. */
2047 extern tree make_tree_vec (int);
2049 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2050 The name is supplied as a char *. */
2052 extern tree get_identifier (const char *);
2054 #if GCC_VERSION >= 3000
2055 #define get_identifier(str) \
2056 (__builtin_constant_p (str) \
2057 ? get_identifier_with_length ((str), strlen (str)) \
2058 : get_identifier (str))
2062 /* Identical to get_identifier, except that the length is assumed
2065 extern tree get_identifier_with_length (const char *, size_t);
2067 /* If an identifier with the name TEXT (a null-terminated string) has
2068 previously been referred to, return that node; otherwise return
2071 extern tree maybe_get_identifier (const char *);
2073 /* Construct various types of nodes. */
2075 #define build_int_2(LO, HI) \
2076 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2078 extern tree build (enum tree_code, tree, ...);
2079 extern tree build_nt (enum tree_code, ...);
2081 extern tree build_int_2_wide (unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2082 extern tree build_vector (tree, tree);
2083 extern tree build_constructor (tree, tree);
2084 extern tree build_real_from_int_cst (tree, tree);
2085 extern tree build_complex (tree, tree, tree);
2086 extern tree build_string (int, const char *);
2087 extern tree build1 (enum tree_code, tree, tree);
2088 extern tree build_tree_list (tree, tree);
2089 extern tree build_decl (enum tree_code, tree, tree);
2090 extern tree build_block (tree, tree, tree, tree, tree);
2091 extern tree build_expr_wfl (tree, const char *, int, int);
2093 /* Construct various nodes representing data types. */
2095 extern tree make_signed_type (int);
2096 extern tree make_unsigned_type (int);
2097 extern void initialize_sizetypes (void);
2098 extern void set_sizetype (tree);
2099 extern void fixup_unsigned_type (tree);
2100 extern tree build_pointer_type_for_mode (tree, enum machine_mode);
2101 extern tree build_pointer_type (tree);
2102 extern tree build_reference_type_for_mode (tree, enum machine_mode);
2103 extern tree build_reference_type (tree);
2104 extern tree build_type_no_quals (tree);
2105 extern tree build_index_type (tree);
2106 extern tree build_index_2_type (tree, tree);
2107 extern tree build_array_type (tree, tree);
2108 extern tree build_function_type (tree, tree);
2109 extern tree build_function_type_list (tree, ...);
2110 extern tree build_method_type_directly (tree, tree, tree);
2111 extern tree build_method_type (tree, tree);
2112 extern tree build_offset_type (tree, tree);
2113 extern tree build_complex_type (tree);
2114 extern tree array_type_nelts (tree);
2116 extern tree value_member (tree, tree);
2117 extern tree purpose_member (tree, tree);
2118 extern tree binfo_member (tree, tree);
2119 extern unsigned int attribute_hash_list (tree);
2120 extern int attribute_list_equal (tree, tree);
2121 extern int attribute_list_contained (tree, tree);
2122 extern int tree_int_cst_equal (tree, tree);
2123 extern int tree_int_cst_lt (tree, tree);
2124 extern int tree_int_cst_compare (tree, tree);
2125 extern int host_integerp (tree, int);
2126 extern HOST_WIDE_INT tree_low_cst (tree, int);
2127 extern int tree_int_cst_msb (tree);
2128 extern int tree_int_cst_sgn (tree);
2129 extern int tree_expr_nonnegative_p (tree);
2130 extern int rtl_expr_nonnegative_p (rtx);
2131 extern tree get_inner_array_type (tree);
2133 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2134 put the prototype here. Rtl.h does declare the prototype if
2135 tree.h had been included. */
2137 extern tree make_tree (tree, rtx);
2139 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2142 Such modified types already made are recorded so that duplicates
2145 extern tree build_type_attribute_variant (tree, tree);
2146 extern tree build_decl_attribute_variant (tree, tree);
2148 /* Structure describing an attribute and a function to handle it. */
2149 struct attribute_spec
2151 /* The name of the attribute (without any leading or trailing __),
2152 or NULL to mark the end of a table of attributes. */
2153 const char *const name;
2154 /* The minimum length of the list of arguments of the attribute. */
2155 const int min_length;
2156 /* The maximum length of the list of arguments of the attribute
2157 (-1 for no maximum). */
2158 const int max_length;
2159 /* Whether this attribute requires a DECL. If it does, it will be passed
2160 from types of DECLs, function return types and array element types to
2161 the DECLs, function types and array types respectively; but when
2162 applied to a type in any other circumstances, it will be ignored with
2163 a warning. (If greater control is desired for a given attribute,
2164 this should be false, and the flags argument to the handler may be
2165 used to gain greater control in that case.) */
2166 const bool decl_required;
2167 /* Whether this attribute requires a type. If it does, it will be passed
2168 from a DECL to the type of that DECL. */
2169 const bool type_required;
2170 /* Whether this attribute requires a function (or method) type. If it does,
2171 it will be passed from a function pointer type to the target type,
2172 and from a function return type (which is not itself a function
2173 pointer type) to the function type. */
2174 const bool function_type_required;
2175 /* Function to handle this attribute. NODE points to the node to which
2176 the attribute is to be applied. If a DECL, it should be modified in
2177 place; if a TYPE, a copy should be created. NAME is the name of the
2178 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2179 of the arguments (which may be NULL). FLAGS gives further information
2180 about the context of the attribute. Afterwards, the attributes will
2181 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2182 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2183 as well as in any other cases when the attributes should not be added
2184 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2185 applied to another type or DECL later may be returned;
2186 otherwise the return value should be NULL_TREE. This pointer may be
2187 NULL if no special handling is required beyond the checks implied
2188 by the rest of this structure. */
2189 tree (*const handler) (tree *node, tree name, tree args,
2190 int flags, bool *no_add_attrs);
2193 /* Flags that may be passed in the third argument of decl_attributes, and
2194 to handler functions for attributes. */
2195 enum attribute_flags
2197 /* The type passed in is the type of a DECL, and any attributes that
2198 should be passed in again to be applied to the DECL rather than the
2199 type should be returned. */
2200 ATTR_FLAG_DECL_NEXT = 1,
2201 /* The type passed in is a function return type, and any attributes that
2202 should be passed in again to be applied to the function type rather
2203 than the return type should be returned. */
2204 ATTR_FLAG_FUNCTION_NEXT = 2,
2205 /* The type passed in is an array element type, and any attributes that
2206 should be passed in again to be applied to the array type rather
2207 than the element type should be returned. */
2208 ATTR_FLAG_ARRAY_NEXT = 4,
2209 /* The type passed in is a structure, union or enumeration type being
2210 created, and should be modified in place. */
2211 ATTR_FLAG_TYPE_IN_PLACE = 8,
2212 /* The attributes are being applied by default to a library function whose
2213 name indicates known behavior, and should be silently ignored if they
2214 are not in fact compatible with the function type. */
2215 ATTR_FLAG_BUILT_IN = 16
2218 /* Default versions of target-overridable functions. */
2220 extern tree merge_decl_attributes (tree, tree);
2221 extern tree merge_type_attributes (tree, tree);
2222 extern void default_register_cpp_builtins (struct cpp_reader *);
2224 /* Split a list of declspecs and attributes into two. */
2226 extern void split_specs_attrs (tree, tree *, tree *);
2228 /* Strip attributes from a list of combined specs and attrs. */
2230 extern tree strip_attrs (tree);
2232 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2234 extern int valid_machine_attribute (tree, tree, tree, tree);
2236 /* Given a tree node and a string, return nonzero if the tree node is
2237 a valid attribute name for the string. */
2239 extern int is_attribute_p (const char *, tree);
2241 /* Given an attribute name and a list of attributes, return the list element
2242 of the attribute or NULL_TREE if not found. */
2244 extern tree lookup_attribute (const char *, tree);
2246 /* Given two attributes lists, return a list of their union. */
2248 extern tree merge_attributes (tree, tree);
2250 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2251 /* Given two Windows decl attributes lists, possibly including
2252 dllimport, return a list of their union . */
2253 extern tree merge_dllimport_decl_attributes (tree, tree);
2256 /* Return a version of the TYPE, qualified as indicated by the
2257 TYPE_QUALS, if one exists. If no qualified version exists yet,
2258 return NULL_TREE. */
2260 extern tree get_qualified_type (tree, int);
2262 /* Like get_qualified_type, but creates the type if it does not
2263 exist. This function never returns NULL_TREE. */
2265 extern tree build_qualified_type (tree, int);
2267 /* Like build_qualified_type, but only deals with the `const' and
2268 `volatile' qualifiers. This interface is retained for backwards
2269 compatibility with the various front-ends; new code should use
2270 build_qualified_type instead. */
2272 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2273 build_qualified_type ((TYPE), \
2274 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2275 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2277 /* Make a copy of a type node. */
2279 extern tree build_type_copy (tree);
2281 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2282 fields. Optionally specify an alignment, and then lsy it out. */
2284 extern void finish_builtin_struct (tree, const char *,
2287 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2288 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2289 node, does nothing except for the first time. */
2291 extern void layout_type (tree);
2293 /* These functions allow a front-end to perform a manual layout of a
2294 RECORD_TYPE. (For instance, if the placement of subsequent fields
2295 depends on the placement of fields so far.) Begin by calling
2296 start_record_layout. Then, call place_field for each of the
2297 fields. Then, call finish_record_layout. See layout_type for the
2298 default way in which these functions are used. */
2300 typedef struct record_layout_info_s
2302 /* The RECORD_TYPE that we are laying out. */
2304 /* The offset into the record so far, in bytes, not including bits in
2307 /* The last known alignment of SIZE. */
2308 unsigned int offset_align;
2309 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2311 /* The alignment of the record so far, in bits. */
2312 unsigned int record_align;
2313 /* The alignment of the record so far, ignoring #pragma pack and
2314 __attribute__ ((packed)), in bits. */
2315 unsigned int unpacked_align;
2316 /* The previous field layed out. */
2318 /* The static variables (i.e., class variables, as opposed to
2319 instance variables) encountered in T. */
2320 tree pending_statics;
2321 /* Bits remaining in the current alignment group */
2322 int remaining_in_alignment;
2323 /* True if we've seen a packed field that didn't have normal
2324 alignment anyway. */
2325 int packed_maybe_necessary;
2326 } *record_layout_info;
2328 extern void set_lang_adjust_rli (void (*) (record_layout_info));
2329 extern record_layout_info start_record_layout (tree);
2330 extern tree bit_from_pos (tree, tree);
2331 extern tree byte_from_pos (tree, tree);
2332 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
2333 extern void normalize_offset (tree *, tree *, unsigned int);
2334 extern tree rli_size_unit_so_far (record_layout_info);
2335 extern tree rli_size_so_far (record_layout_info);
2336 extern void normalize_rli (record_layout_info);
2337 extern void place_field (record_layout_info, tree);
2338 extern void compute_record_mode (tree);
2339 extern void finish_record_layout (record_layout_info, int);
2341 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2342 return a canonicalized ..._TYPE node, so that duplicates are not made.
2343 How the hash code is computed is up to the caller, as long as any two
2344 callers that could hash identical-looking type nodes agree. */
2346 extern tree type_hash_canon (unsigned int, tree);
2348 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2349 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2350 fields. Call this only once for any given decl node.
2352 Second argument is the boundary that this field can be assumed to
2353 be starting at (in bits). Zero means it can be assumed aligned
2354 on any boundary that may be needed. */
2356 extern void layout_decl (tree, unsigned);
2358 /* Return the mode for data of a given size SIZE and mode class CLASS.
2359 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2360 The value is BLKmode if no other mode is found. This is like
2361 mode_for_size, but is passed a tree. */
2363 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
2365 /* Return an expr equal to X but certainly not valid as an lvalue. */
2367 extern tree non_lvalue (tree);
2368 extern tree pedantic_non_lvalue (tree);
2370 extern tree convert (tree, tree);
2371 extern unsigned int expr_align (tree);
2372 extern tree expr_first (tree);
2373 extern tree expr_last (tree);
2374 extern int expr_length (tree);
2375 extern tree size_in_bytes (tree);
2376 extern HOST_WIDE_INT int_size_in_bytes (tree);
2377 extern tree bit_position (tree);
2378 extern HOST_WIDE_INT int_bit_position (tree);
2379 extern tree byte_position (tree);
2380 extern HOST_WIDE_INT int_byte_position (tree);
2382 /* Define data structures, macros, and functions for handling sizes
2383 and the various types used to represent sizes. */
2387 SIZETYPE, /* Normal representation of sizes in bytes. */
2388 SSIZETYPE, /* Signed representation of sizes in bytes. */
2389 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2390 BITSIZETYPE, /* Normal representation of sizes in bits. */
2391 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2392 UBITSIZETYPE, /* Unsigned representation of sizes in bits. */
2395 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
2397 #define sizetype sizetype_tab[(int) SIZETYPE]
2398 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2399 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2400 #define usizetype sizetype_tab[(int) USIZETYPE]
2401 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2402 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2404 extern tree size_binop (enum tree_code, tree, tree);
2405 extern tree size_diffop (tree, tree);
2406 extern tree size_int_wide (HOST_WIDE_INT, enum size_type_kind);
2407 extern tree size_int_type_wide (HOST_WIDE_INT, tree);
2409 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2410 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2411 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2412 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2413 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2415 extern tree round_up (tree, int);
2416 extern tree round_down (tree, int);
2417 extern tree get_pending_sizes (void);
2418 extern int is_pending_size (tree);
2419 extern void put_pending_size (tree);
2420 extern void put_pending_sizes (tree);
2422 /* Type for sizes of data-type. */
2424 #define BITS_PER_UNIT_LOG \
2425 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2426 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2427 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2429 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2430 extern unsigned int maximum_field_alignment;
2432 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2433 extern unsigned int set_alignment;
2435 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2436 by making the last node in X point to Y.
2437 Returns X, except if X is 0 returns Y. */
2439 extern tree chainon (tree, tree);
2441 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2443 extern tree tree_cons (tree, tree, tree);
2445 /* Return the last tree node in a chain. */
2447 extern tree tree_last (tree);
2449 /* Reverse the order of elements in a chain, and return the new head. */
2451 extern tree nreverse (tree);
2453 /* Returns the length of a chain of nodes
2454 (number of chain pointers to follow before reaching a null pointer). */
2456 extern int list_length (tree);
2458 /* Returns the number of FIELD_DECLs in a type. */
2460 extern int fields_length (tree);
2462 /* Given an initializer INIT, return TRUE if INIT is zero or some
2463 aggregate of zeros. Otherwise return FALSE. */
2465 extern bool initializer_zerop (tree);
2467 /* Given an initializer INIT, return TRUE if INIT is at least 3/4 zeros.
2468 Otherwise return FALSE. */
2470 extern int mostly_zeros_p (tree);
2472 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2474 extern int integer_zerop (tree);
2476 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2478 extern int integer_onep (tree);
2480 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2481 all of whose significant bits are 1. */
2483 extern int integer_all_onesp (tree);
2485 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2486 exactly one bit 1. */
2488 extern int integer_pow2p (tree);
2490 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
2491 with a nonzero value. */
2493 extern int integer_nonzerop (tree);
2495 /* staticp (tree x) is nonzero if X is a reference to data allocated
2496 at a fixed address in memory. */
2498 extern int staticp (tree);
2500 /* Gets an error if argument X is not an lvalue.
2501 Also returns 1 if X is an lvalue, 0 if not. */
2503 extern int lvalue_or_else (tree, const char *);
2505 /* save_expr (EXP) returns an expression equivalent to EXP
2506 but it can be used multiple times within context CTX
2507 and only evaluate EXP once. */
2509 extern tree save_expr (tree);
2511 /* Look inside EXPR and into any simple arithmetic operations. Return
2512 the innermost non-arithmetic node. */
2514 extern tree skip_simple_arithmetic (tree);
2516 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
2517 SAVE_EXPR. Return FALSE otherwise. */
2519 extern bool saved_expr_p (tree);
2521 /* Returns the index of the first non-tree operand for CODE, or the number
2522 of operands if all are trees. */
2524 extern int first_rtl_op (enum tree_code);
2526 /* Return which tree structure is used by T. */
2528 enum tree_node_structure_enum tree_node_structure (tree);
2530 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2531 can be used multiple times and will evaluate EXP in its entirety
2534 extern tree unsave_expr (tree);
2536 /* Reset EXP in place so that it can be expanded again. Does not
2537 recurse into subtrees. */
2539 extern void unsave_expr_1 (tree);
2541 /* Return 0 if it is safe to evaluate EXPR multiple times,
2542 return 1 if it is safe if EXPR is unsaved afterward, or
2543 return 2 if it is completely unsafe. */
2544 extern int unsafe_for_reeval (tree);
2546 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2547 or offset that depends on a field within a record.
2549 Note that we only allow such expressions within simple arithmetic
2552 extern bool contains_placeholder_p (tree);
2554 /* This macro calls the above function but short-circuits the common
2555 case of a constant to save time. Also check for null. */
2557 #define CONTAINS_PLACEHOLDER_P(EXP) \
2558 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
2560 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
2561 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
2564 extern bool type_contains_placeholder_p (tree);
2566 /* Return 1 if EXP contains any expressions that produce cleanups for an
2567 outer scope to deal with. Used by fold. */
2569 extern int has_cleanups (tree);
2571 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2572 return a tree with all occurrences of references to F in a
2573 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2574 contains only arithmetic expressions. */
2576 extern tree substitute_in_expr (tree, tree, tree);
2578 /* variable_size (EXP) is like save_expr (EXP) except that it
2579 is for the special case of something that is part of a
2580 variable size for a data type. It makes special arrangements
2581 to compute the value at the right time when the data type
2582 belongs to a function parameter. */
2584 extern tree variable_size (tree);
2586 /* stabilize_reference (EXP) returns a reference equivalent to EXP
2587 but it can be used multiple times
2588 and only evaluate the subexpressions once. */
2590 extern tree stabilize_reference (tree);
2592 /* Subroutine of stabilize_reference; this is called for subtrees of
2593 references. Any expression with side-effects must be put in a SAVE_EXPR
2594 to ensure that it is only evaluated once. */
2596 extern tree stabilize_reference_1 (tree);
2598 /* Return EXP, stripped of any conversions to wider types
2599 in such a way that the result of converting to type FOR_TYPE
2600 is the same as if EXP were converted to FOR_TYPE.
2601 If FOR_TYPE is 0, it signifies EXP's type. */
2603 extern tree get_unwidened (tree, tree);
2605 /* Return OP or a simpler expression for a narrower value
2606 which can be sign-extended or zero-extended to give back OP.
2607 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2608 or 0 if the value should be sign-extended. */
2610 extern tree get_narrower (tree, int *);
2612 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2613 look for nested component-refs or array-refs at constant positions
2614 and find the ultimate containing object, which is returned. */
2616 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
2617 tree *, enum machine_mode *, int *, int *);
2619 /* Return 1 if T is an expression that get_inner_reference handles. */
2621 extern int handled_component_p (tree);
2623 /* Given a DECL or TYPE, return the scope in which it was declared, or
2624 NUL_TREE if there is no containing scope. */
2626 extern tree get_containing_scope (tree);
2628 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2630 extern tree decl_function_context (tree);
2632 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2633 this _DECL with its context, or zero if none. */
2634 extern tree decl_type_context (tree);
2636 /* Given the FUNCTION_DECL for the current function,
2637 return zero if it is ok for this function to be inline.
2638 Otherwise return a warning message with a single %s
2639 for the function's name. */
2641 extern const char *function_cannot_inline_p (tree);
2643 /* Return 1 if EXPR is the real constant zero. */
2644 extern int real_zerop (tree);
2646 /* Declare commonly used variables for tree structure. */
2648 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2649 Zero means allow extended lvalues. */
2651 extern int pedantic_lvalues;
2653 /* Nonzero means can safely call expand_expr now;
2654 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2656 extern int immediate_size_expand;
2658 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2660 extern GTY(()) tree current_function_decl;
2662 /* Nonzero means a FUNC_BEGIN label was emitted. */
2663 extern GTY(()) tree current_function_func_begin_label;
2665 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2667 extern int all_types_permanent;
2669 /* Exit a binding level. This function is provided by each language
2671 extern tree poplevel (int, int, int);
2673 /* Declare a predefined function. Return the declaration. This function is
2674 provided by each language frontend. */
2675 extern tree builtin_function (const char *, tree, int, enum built_in_class,
2676 const char *, tree);
2679 extern unsigned crc32_string (unsigned, const char *);
2680 extern void clean_symbol_name (char *);
2681 extern tree get_file_function_name_long (const char *);
2682 extern tree get_set_constructor_bits (tree, char *, int);
2683 extern tree get_set_constructor_bytes (tree, unsigned char *, int);
2684 extern tree get_callee_fndecl (tree);
2685 extern void set_decl_assembler_name (tree);
2686 extern int type_num_arguments (tree);
2687 extern tree lhd_unsave_expr_now (tree);
2692 extern void expand_fixups (rtx);
2693 extern tree expand_start_stmt_expr (int);
2694 extern tree expand_end_stmt_expr (tree);
2695 extern void expand_expr_stmt (tree);
2696 extern void expand_expr_stmt_value (tree, int, int);
2697 extern int warn_if_unused_value (tree);
2698 extern void expand_decl_init (tree);
2699 extern void clear_last_expr (void);
2700 extern void expand_label (tree);
2701 extern void expand_goto (tree);
2702 extern void expand_asm (tree, int);
2703 extern void expand_start_cond (tree, int);
2704 extern void expand_end_cond (void);
2705 extern void expand_start_else (void);
2706 extern void expand_start_elseif (tree);
2707 extern struct nesting *expand_start_loop (int);
2708 extern struct nesting *expand_start_loop_continue_elsewhere (int);
2709 extern struct nesting *expand_start_null_loop (void);
2710 extern void expand_loop_continue_here (void);
2711 extern void expand_end_loop (void);
2712 extern void expand_end_null_loop (void);
2713 extern int expand_continue_loop (struct nesting *);
2714 extern int expand_exit_loop (struct nesting *);
2715 extern int expand_exit_loop_if_false (struct nesting *,tree);
2716 extern int expand_exit_loop_top_cond (struct nesting *, tree);
2717 extern int expand_exit_something (void);
2719 extern void expand_return (tree);
2720 extern int optimize_tail_recursion (tree, rtx);
2721 extern void expand_start_bindings_and_block (int, tree);
2722 #define expand_start_bindings(flags) \
2723 expand_start_bindings_and_block(flags, NULL_TREE)
2724 extern void expand_end_bindings (tree, int, int);
2725 extern void warn_about_unused_variables (tree);
2726 extern void start_cleanup_deferral (void);
2727 extern void end_cleanup_deferral (void);
2728 extern int is_body_block (tree);
2730 extern int conditional_context (void);
2731 extern struct nesting * current_nesting_level (void);
2732 extern tree last_cleanup_this_contour (void);
2733 extern void expand_start_case (int, tree, tree, const char *);
2734 extern void expand_end_case_type (tree, tree);
2735 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
2736 extern int add_case_node (tree, tree, tree, tree *);
2737 extern int pushcase (tree, tree (*) (tree, tree), tree, tree *);
2738 extern int pushcase_range (tree, tree, tree (*) (tree, tree), tree, tree *);
2739 extern void using_eh_for_cleanups (void);
2741 /* In fold-const.c */
2743 /* Fold constants as much as possible in an expression.
2744 Returns the simplified expression.
2745 Acts only on the top level of the expression;
2746 if the argument itself cannot be simplified, its
2747 subexpressions are not changed. */
2749 extern tree fold (tree);
2750 extern tree fold_initializer (tree);
2751 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
2753 extern int force_fit_type (tree, int);
2754 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2755 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2756 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2757 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2758 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2759 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2760 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2761 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2762 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2763 HOST_WIDE_INT, unsigned int,
2764 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
2765 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2766 HOST_WIDE_INT, unsigned int,
2767 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
2768 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2769 HOST_WIDE_INT, unsigned int,
2770 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2771 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2772 HOST_WIDE_INT, unsigned int,
2773 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2775 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
2776 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
2777 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
2778 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
2781 extern int operand_equal_p (tree, tree, int);
2782 extern tree omit_one_operand (tree, tree, tree);
2783 extern tree invert_truthvalue (tree);
2786 extern tree fold_builtin (tree);
2787 extern enum built_in_function builtin_mathfn_code (tree);
2788 extern tree build_function_call_expr (tree, tree);
2789 extern tree mathfn_built_in (tree, enum built_in_function fn);
2792 extern tree strip_float_extensions (tree);
2795 extern void record_component_aliases (tree);
2796 extern HOST_WIDE_INT get_alias_set (tree);
2797 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
2798 extern int readonly_fields_p (tree);
2799 extern int objects_must_conflict_p (tree, tree);
2802 extern int really_constant_p (tree);
2803 extern int int_fits_type_p (tree, tree);
2804 extern bool variably_modified_type_p (tree);
2805 extern int tree_log2 (tree);
2806 extern int tree_floor_log2 (tree);
2807 extern int simple_cst_equal (tree, tree);
2808 extern unsigned int iterative_hash_expr (tree, unsigned int);
2809 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
2810 extern int type_list_equal (tree, tree);
2811 extern int chain_member (tree, tree);
2812 extern tree type_hash_lookup (unsigned int, tree);
2813 extern void type_hash_add (unsigned int, tree);
2814 extern unsigned int type_hash_list (tree);
2815 extern int simple_cst_list_equal (tree, tree);
2816 extern void dump_tree_statistics (void);
2817 extern void expand_function_end (void);
2818 extern void expand_function_start (tree, int);
2819 extern void expand_pending_sizes (tree);
2821 extern int real_onep (tree);
2822 extern int real_twop (tree);
2823 extern int real_minus_onep (tree);
2824 extern void init_ttree (void);
2825 extern void build_common_tree_nodes (int);
2826 extern void build_common_tree_nodes_2 (int);
2827 extern tree build_range_type (tree, tree, tree);
2830 extern void setjmp_protect_args (void);
2831 extern void setjmp_protect (tree);
2832 extern void expand_main_function (void);
2833 extern void init_dummy_function_start (void);
2834 extern void expand_dummy_function_end (void);
2835 extern void init_function_for_compilation (void);
2836 extern void init_function_start (tree);
2837 extern void assign_parms (tree);
2838 extern void put_var_into_stack (tree, int);
2839 extern void flush_addressof (tree);
2840 extern void uninitialized_vars_warning (tree);
2841 extern void setjmp_args_warning (void);
2842 extern void mark_all_temps_used (void);
2843 extern void init_temp_slots (void);
2844 extern void combine_temp_slots (void);
2845 extern void free_temp_slots (void);
2846 extern void pop_temp_slots (void);
2847 extern void push_temp_slots (void);
2848 extern void preserve_temp_slots (rtx);
2849 extern void preserve_rtl_expr_temps (tree);
2850 extern int aggregate_value_p (tree);
2851 extern void free_temps_for_rtl_expr (tree);
2852 extern void instantiate_virtual_regs (tree, rtx);
2853 extern void unshare_all_rtl (tree, rtx);
2854 extern void push_function_context (void);
2855 extern void pop_function_context (void);
2856 extern void push_function_context_to (tree);
2857 extern void pop_function_context_from (tree);
2859 /* In print-rtl.c */
2861 extern void print_rtl (FILE *, rtx);
2864 /* In print-tree.c */
2865 extern void debug_tree (tree);
2867 extern void print_node (FILE *, const char *, tree, int);
2868 extern void print_node_brief (FILE *, const char *, tree, int);
2869 extern void indent_to (FILE *, int);
2873 extern int apply_args_register_offset (int);
2874 extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx);
2875 extern void check_max_integer_computation_mode (tree);
2878 extern void start_sequence_for_rtl_expr (tree);
2879 extern rtx emit_line_note (location_t);
2883 /* Nonzero if this is a call to a `const' function. */
2885 /* Nonzero if this is a call to a `volatile' function. */
2886 #define ECF_NORETURN 2
2887 /* Nonzero if this is a call to malloc or a related function. */
2888 #define ECF_MALLOC 4
2889 /* Nonzero if it is plausible that this is a call to alloca. */
2890 #define ECF_MAY_BE_ALLOCA 8
2891 /* Nonzero if this is a call to a function that won't throw an exception. */
2892 #define ECF_NOTHROW 16
2893 /* Nonzero if this is a call to setjmp or a related function. */
2894 #define ECF_RETURNS_TWICE 32
2895 /* Nonzero if this is a call to `longjmp'. */
2896 #define ECF_LONGJMP 64
2897 /* Nonzero if this is a syscall that makes a new process in the image of
2899 #define ECF_FORK_OR_EXEC 128
2900 #define ECF_SIBCALL 256
2901 /* Nonzero if this is a call to "pure" function (like const function,
2902 but may read memory. */
2903 #define ECF_PURE 512
2904 /* Nonzero if this is a call to a function that returns with the stack
2905 pointer depressed. */
2906 #define ECF_SP_DEPRESSED 1024
2907 /* Nonzero if this call is known to always return. */
2908 #define ECF_ALWAYS_RETURN 2048
2909 /* Create libcall block around the call. */
2910 #define ECF_LIBCALL_BLOCK 4096
2912 extern int flags_from_decl_or_type (tree);
2914 extern int setjmp_call_p (tree);
2915 extern bool alloca_call_p (tree);
2919 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
2920 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
2921 it should be modified in place; if a TYPE, a copy should be created
2922 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
2923 information, in the form of a bitwise OR of flags in enum attribute_flags
2924 from tree.h. Depending on these flags, some attributes may be
2925 returned to be applied at a later stage (for example, to apply
2926 a decl attribute to the declaration rather than to its type). */
2927 extern tree decl_attributes (tree *, tree, int);
2929 /* In integrate.c */
2930 extern void save_for_inline (tree);
2931 extern void set_decl_abstract_flags (tree, int);
2932 extern void output_inline_function (tree);
2933 extern void set_decl_origin_self (tree);
2935 /* In stor-layout.c */
2936 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
2937 extern void fixup_signed_type (tree);
2938 extern void internal_reference_types (void);
2941 extern void make_decl_rtl (tree, const char *);
2942 extern void make_decl_one_only (tree);
2943 extern int supports_one_only (void);
2944 extern void variable_section (tree, int);
2945 enum tls_model decl_tls_model (tree);
2946 enum symbol_visibility decl_visibility (tree);
2947 extern void resolve_unique_section (tree, int, int);
2948 extern void mark_referenced (tree);
2949 extern void notice_global_symbol (tree);
2952 extern void emit_nop (void);
2953 extern void expand_computed_goto (tree);
2954 extern bool parse_output_constraint (const char **, int, int, int,
2955 bool *, bool *, bool *);
2956 extern void expand_asm_operands (tree, tree, tree, tree, int,
2958 extern tree resolve_asm_operand_names (tree, tree, tree);
2959 extern int any_pending_cleanups (void);
2960 extern void init_stmt_for_function (void);
2961 extern void expand_start_target_temps (void);
2962 extern void expand_end_target_temps (void);
2963 extern void expand_elseif (tree);
2964 extern void save_stack_pointer (void);
2965 extern void expand_decl (tree);
2966 extern int expand_decl_cleanup (tree, tree);
2967 extern int expand_decl_cleanup_eh (tree, tree, int);
2968 extern void expand_anon_union_decl (tree, tree, tree);
2969 extern void expand_start_case_dummy (void);
2970 extern HOST_WIDE_INT all_cases_count (tree, int *);
2971 extern void check_for_full_enumeration_handling (tree);
2972 extern void declare_nonlocal_label (tree);
2974 /* If KIND=='I', return a suitable global initializer (constructor) name.
2975 If KIND=='D', return a suitable global clean-up (destructor) name. */
2976 extern tree get_file_function_name (int);
2978 /* Interface of the DWARF2 unwind info support. */
2980 /* Generate a new label for the CFI info to refer to. */
2982 extern char *dwarf2out_cfi_label (void);
2984 /* Entry point to update the canonical frame address (CFA). */
2986 extern void dwarf2out_def_cfa (const char *, unsigned, long);
2988 /* Add the CFI for saving a register window. */
2990 extern void dwarf2out_window_save (const char *);
2992 /* Add a CFI to update the running total of the size of arguments pushed
2995 extern void dwarf2out_args_size (const char *, long);
2997 /* Entry point for saving a register to the stack. */
2999 extern void dwarf2out_reg_save (const char *, unsigned, long);
3001 /* Entry point for saving the return address in the stack. */
3003 extern void dwarf2out_return_save (const char *, long);
3005 /* Entry point for saving the return address in a register. */
3007 extern void dwarf2out_return_reg (const char *, unsigned);
3009 /* The type of a function that walks over tree structure. */
3011 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3013 /* In tree-dump.c */
3015 /* Different tree dump places. When you add new tree dump places,
3016 extend the DUMP_FILES array in tree-dump.c */
3017 enum tree_dump_index
3019 TDI_all, /* dump the whole translation unit */
3020 TDI_class, /* dump class hierarchy */
3021 TDI_original, /* dump each function before optimizing it */
3022 TDI_optimized, /* dump each function after optimizing it */
3023 TDI_inlined, /* dump each function after inlining
3028 /* Bit masks to control tree dumping. Not all values are applicable to
3029 all tree dumps. Add new ones at the end. When you define new
3030 values, extend the DUMP_OPTIONS array in tree-dump.c */
3031 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3032 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3034 typedef struct dump_info *dump_info_p;
3036 extern int dump_flag (dump_info_p, int, tree);
3037 extern int dump_enabled_p (enum tree_dump_index);
3038 extern FILE *dump_begin (enum tree_dump_index, int *);
3039 extern void dump_end (enum tree_dump_index, FILE *);
3040 extern void dump_node (tree, int, FILE *);
3041 extern int dump_switch_p (const char *);
3042 extern const char *dump_flag_name (enum tree_dump_index);
3043 /* Assign the RTX to declaration. */
3045 extern void set_decl_rtl (tree, rtx);
3047 /* Redefine abort to report an internal error w/o coredump, and
3048 reporting the location of the error in the source file. This logic
3049 is duplicated in rtl.h and tree.h because every file that needs the
3050 special abort includes one or both. toplev.h gets too few files,
3051 system.h gets too many. */
3053 extern void fancy_abort (const char *, int, const char *)
3055 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3057 /* Enum and arrays used for tree allocation stats.
3058 Keep in sync with tree.c:tree_node_kind_names. */
3078 extern int tree_node_counts[];
3079 extern int tree_node_sizes[];
3081 #endif /* GCC_TREE_H */
OSDN Git Service
