1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
42 /* Number of language-independent tree codes. */
43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern const char tree_code_type[];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns nonzero iff CLASS is the tree-code class of an
59 #define IS_EXPR_CODE_CLASS(CLASS) \
60 ((CLASS) == '<' || (CLASS) == '1' || (CLASS) == '2' || (CLASS) == 'e')
62 /* Number of argument-words in each kind of tree-node. */
64 extern const unsigned char tree_code_length[];
65 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
67 /* Names of tree components. */
69 extern const char *const tree_code_name[];
71 /* Classify which part of the compiler has defined a given builtin function.
72 Note that we assume below that this is no more than two bits. */
81 /* Names for the above. */
82 extern const char *const built_in_class_names[4];
84 /* Codes that identify the various built in functions
85 so that expand_call can identify them quickly. */
87 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
88 enum built_in_function
90 #include "builtins.def"
92 /* Upper bound on non-language-specific builtins. */
97 /* Names for the above. */
98 extern const char *const built_in_names[(int) END_BUILTINS];
100 /* An array of _DECL trees for the above. */
101 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
102 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
104 /* The definition of tree nodes fills the next several pages. */
106 /* A tree node can represent a data type, a variable, an expression
107 or a statement. Each node has a TREE_CODE which says what kind of
108 thing it represents. Some common codes are:
109 INTEGER_TYPE -- represents a type of integers.
110 ARRAY_TYPE -- represents a type of pointer.
111 VAR_DECL -- represents a declared variable.
112 INTEGER_CST -- represents a constant integer value.
113 PLUS_EXPR -- represents a sum (an expression).
115 As for the contents of a tree node: there are some fields
116 that all nodes share. Each TREE_CODE has various special-purpose
117 fields as well. The fields of a node are never accessed directly,
118 always through accessor macros. */
120 /* Every kind of tree node starts with this structure,
121 so all nodes have these fields.
123 See the accessor macros, defined below, for documentation of the
126 struct tree_common GTY(())
131 ENUM_BITFIELD(tree_code) code : 8;
133 unsigned side_effects_flag : 1;
134 unsigned constant_flag : 1;
135 unsigned addressable_flag : 1;
136 unsigned volatile_flag : 1;
137 unsigned readonly_flag : 1;
138 unsigned unsigned_flag : 1;
139 unsigned asm_written_flag: 1;
140 unsigned unused_0 : 1;
142 unsigned used_flag : 1;
143 unsigned nothrow_flag : 1;
144 unsigned static_flag : 1;
145 unsigned public_flag : 1;
146 unsigned private_flag : 1;
147 unsigned protected_flag : 1;
148 unsigned deprecated_flag : 1;
149 unsigned unused_1 : 1;
151 unsigned lang_flag_0 : 1;
152 unsigned lang_flag_1 : 1;
153 unsigned lang_flag_2 : 1;
154 unsigned lang_flag_3 : 1;
155 unsigned lang_flag_4 : 1;
156 unsigned lang_flag_5 : 1;
157 unsigned lang_flag_6 : 1;
158 unsigned unused_2 : 1;
161 /* The following table lists the uses of each of the above flags and
162 for which types of nodes they are defined. Note that expressions
168 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
169 ..._TYPE, IDENTIFIER_NODE.
170 In a STMT_EXPR, it means we want the result of the enclosed
176 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
177 TREE_NO_UNUSED_WARNING in
178 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
180 TREE_LIST or TREE_VEC
181 TREE_CONSTANT_OVERFLOW in
182 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
183 TREE_SYMBOL_REFERENCED in
186 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
187 TREE_LIST elements of a block's cleanup list.
192 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
194 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
195 EXPR_WFL_EMIT_LINE_NOTE in
196 EXPR_WITH_FILE_LOCATION
202 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
218 TREE_THIS_VOLATILE in
238 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
239 SAVE_EXPR_NOPLACEHOLDER in
245 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
251 expressions, IDENTIFIER_NODE
256 CALL_EXPR, FUNCTION_DECL
264 /* Define accessors for the fields that all tree nodes have
265 (though some fields are not used for all kinds of nodes). */
267 /* The tree-code says what kind of node it is.
268 Codes are defined in tree.def. */
269 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
270 #define TREE_SET_CODE(NODE, VALUE) \
271 ((NODE)->common.code = (ENUM_BITFIELD (tree_code)) (VALUE))
273 /* When checking is enabled, errors will be generated if a tree node
274 is accessed incorrectly. The macros abort with a fatal error. */
275 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
277 #define TREE_CHECK(T, CODE) __extension__ \
278 ({ const tree __t = (T); \
279 if (TREE_CODE (__t) != (CODE)) \
280 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
283 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
284 ({ const tree __t = (T); \
285 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
286 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
290 /* These checks have to be special cased. */
291 #define EXPR_CHECK(T) __extension__ \
292 ({ const tree __t = (T); \
293 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
294 if (!IS_EXPR_CODE_CLASS (__c) && __c != 'r' && __c != 's') \
295 tree_class_check_failed (__t, 'e', __FILE__, __LINE__, \
299 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
300 (*({const tree __t = (T); \
301 const int __i = (I); \
302 if (TREE_CODE (__t) != TREE_VEC) \
303 tree_check_failed (__t, TREE_VEC, \
304 __FILE__, __LINE__, __FUNCTION__); \
305 if (__i < 0 || __i >= __t->vec.length) \
306 tree_vec_elt_check_failed (__i, __t->vec.length, \
307 __FILE__, __LINE__, __FUNCTION__); \
308 &__t->vec.a[__i]; }))
310 /* Special checks for TREE_OPERANDs. */
311 #define TREE_OPERAND_CHECK(T, I) __extension__ \
312 (*({const tree __t = EXPR_CHECK (T); \
313 const int __i = (I); \
314 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
315 tree_operand_check_failed (__i, TREE_CODE (__t), \
316 __FILE__, __LINE__, __FUNCTION__); \
317 &__t->exp.operands[__i]; }))
319 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
320 (*({const tree __t = (T); \
321 const int __i = (I); \
322 if (TREE_CODE (__t) != CODE) \
323 tree_check_failed (__t, CODE, __FILE__, __LINE__, __FUNCTION__); \
324 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
325 tree_operand_check_failed (__i, (CODE), \
326 __FILE__, __LINE__, __FUNCTION__); \
327 &__t->exp.operands[__i]; }))
329 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
331 ({const tree __t = (T); \
332 const int __i = (I); \
333 if (TREE_CODE (__t) != (CODE)) \
334 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \
335 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
336 tree_operand_check_failed (__i, (CODE), \
337 __FILE__, __LINE__, __FUNCTION__); \
338 &__t->exp.operands[__i]; }))
340 extern void tree_check_failed (const tree, enum tree_code,
341 const char *, int, const char *)
343 extern void tree_class_check_failed (const tree, int,
344 const char *, int, const char *)
346 extern void tree_vec_elt_check_failed (int, int, const char *,
350 extern void tree_operand_check_failed (int, enum tree_code,
351 const char *, int, const char *)
354 #else /* not ENABLE_TREE_CHECKING, or not gcc */
356 #define TREE_CHECK(T, CODE) (T)
357 #define TREE_CLASS_CHECK(T, CODE) (T)
358 #define EXPR_CHECK(T) (T)
359 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
360 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
361 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
362 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
366 #include "tree-check.h"
368 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't')
369 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd')
370 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c')
371 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's')
373 /* In all nodes that are expressions, this is the data type of the expression.
374 In POINTER_TYPE nodes, this is the type that the pointer points to.
375 In ARRAY_TYPE nodes, this is the type of the elements.
376 In VECTOR_TYPE nodes, this is the type of the elements. */
377 #define TREE_TYPE(NODE) ((NODE)->common.type)
379 /* Here is how primitive or already-canonicalized types' hash codes
381 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777)
383 /* Nodes are chained together for many purposes.
384 Types are chained together to record them for being output to the debugger
385 (see the function `chain_type').
386 Decls in the same scope are chained together to record the contents
388 Statement nodes for successive statements used to be chained together.
389 Often lists of things are represented by TREE_LIST nodes that
390 are chained together. */
392 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
394 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
395 that don't change the machine mode. */
397 #define STRIP_NOPS(EXP) \
398 while ((TREE_CODE (EXP) == NOP_EXPR \
399 || TREE_CODE (EXP) == CONVERT_EXPR \
400 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
401 && TREE_OPERAND (EXP, 0) != error_mark_node \
402 && (TYPE_MODE (TREE_TYPE (EXP)) \
403 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
404 (EXP) = TREE_OPERAND (EXP, 0)
406 /* Like STRIP_NOPS, but don't let the signedness change either. */
408 #define STRIP_SIGN_NOPS(EXP) \
409 while ((TREE_CODE (EXP) == NOP_EXPR \
410 || TREE_CODE (EXP) == CONVERT_EXPR \
411 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
412 && TREE_OPERAND (EXP, 0) != error_mark_node \
413 && (TYPE_MODE (TREE_TYPE (EXP)) \
414 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
415 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
416 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
417 (EXP) = TREE_OPERAND (EXP, 0)
419 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
421 #define STRIP_MAIN_TYPE_NOPS(EXP) \
422 while ((TREE_CODE (EXP) == NOP_EXPR \
423 || TREE_CODE (EXP) == CONVERT_EXPR \
424 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
425 && TREE_OPERAND (EXP, 0) != error_mark_node \
426 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
427 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
428 (EXP) = TREE_OPERAND (EXP, 0)
430 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
432 #define STRIP_TYPE_NOPS(EXP) \
433 while ((TREE_CODE (EXP) == NOP_EXPR \
434 || TREE_CODE (EXP) == CONVERT_EXPR \
435 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
436 && TREE_OPERAND (EXP, 0) != error_mark_node \
437 && (TREE_TYPE (EXP) \
438 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
439 (EXP) = TREE_OPERAND (EXP, 0)
441 /* Nonzero if TYPE represents an integral type. Note that we do not
442 include COMPLEX types here. */
444 #define INTEGRAL_TYPE_P(TYPE) \
445 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
446 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
448 /* Nonzero if TYPE represents a floating-point type, including complex
449 floating-point types. */
451 #define FLOAT_TYPE_P(TYPE) \
452 (TREE_CODE (TYPE) == REAL_TYPE \
453 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
454 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
456 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
458 #define AGGREGATE_TYPE_P(TYPE) \
459 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
460 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
461 || TREE_CODE (TYPE) == SET_TYPE)
463 /* Nonzero if TYPE represents a pointer or reference type.
464 (It should be renamed to INDIRECT_TYPE_P.) */
466 #define POINTER_TYPE_P(TYPE) \
467 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
469 /* Nonzero if this type is a complete type. */
470 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
472 /* Nonzero if this type is the (possibly qualified) void type. */
473 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
475 /* Nonzero if this type is complete or is cv void. */
476 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
477 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
479 /* Nonzero if this type is complete or is an array with unspecified bound. */
480 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
481 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
483 /* Nonzero if TYPE represents a type. */
485 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
487 /* Define many boolean fields that all tree nodes have. */
489 /* In VAR_DECL nodes, nonzero means address of this is needed.
490 So it cannot be in a register.
491 In a FUNCTION_DECL, nonzero means its address is needed.
492 So it must be compiled even if it is an inline function.
493 In a FIELD_DECL node, it means that the programmer is permitted to
494 construct the address of this field. This is used for aliasing
495 purposes: see record_component_aliases.
496 In CONSTRUCTOR nodes, it means object constructed must be in memory.
497 In LABEL_DECL nodes, it means a goto for this label has been seen
498 from a place outside all binding contours that restore stack levels.
499 In ..._TYPE nodes, it means that objects of this type must
500 be fully addressable. This means that pieces of this
501 object cannot go into register parameters, for example.
502 In IDENTIFIER_NODEs, this means that some extern decl for this name
503 had its address taken. That matters for inline functions. */
504 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
506 /* In a VAR_DECL, nonzero means allocate static storage.
507 In a FUNCTION_DECL, nonzero if function has been defined.
508 In a CONSTRUCTOR, nonzero means allocate static storage. */
509 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
511 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
512 block's cleanup list, means that the pertinent cleanup should only be
513 executed if an exception is thrown, not on normal exit of its scope. */
514 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
516 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
517 made implicitly and should not lead to an "unused value" warning. */
518 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
520 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
521 chain is via a `virtual' declaration. */
522 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
524 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
525 there was an overflow in folding. This is distinct from
526 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
527 occur in constant expressions. */
528 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
530 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
531 this string as an argument. */
532 #define TREE_SYMBOL_REFERENCED(NODE) \
533 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
535 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
536 there was an overflow in folding, and no warning has been issued
537 for this subexpression. TREE_OVERFLOW implies
538 TREE_CONSTANT_OVERFLOW, but not vice versa. */
539 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
541 /* In a VAR_DECL or FUNCTION_DECL,
542 nonzero means name is to be accessible from outside this module.
543 In an IDENTIFIER_NODE, nonzero means an external declaration
544 accessible from outside this module was previously seen
545 for this name in an inner scope. */
546 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
548 /* In any expression, nonzero means it has side effects or reevaluation
549 of the whole expression could produce a different value.
550 This is set if any subexpression is a function call, a side effect
551 or a reference to a volatile variable.
552 In a ..._DECL, this is set only if the declaration said `volatile'. */
553 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
555 /* Nonzero means this expression is volatile in the C sense:
556 its address should be of type `volatile WHATEVER *'.
557 In other words, the declared item is volatile qualified.
558 This is used in _DECL nodes and _REF nodes.
560 In a ..._TYPE node, means this type is volatile-qualified.
561 But use TYPE_VOLATILE instead of this macro when the node is a type,
562 because eventually we may make that a different bit.
564 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
565 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
567 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
568 nonzero means it may not be the lhs of an assignment.
569 In a ..._TYPE node, means this type is const-qualified
570 (but the macro TYPE_READONLY should be used instead of this macro
571 when the node is a type). */
572 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
574 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
575 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE))
577 /* Value of expression is constant.
578 Always appears in all ..._CST nodes.
579 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
580 if the value is constant. */
581 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
583 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
584 In FIELD_DECL nodes, means an unsigned bit field. */
585 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
587 #define TYPE_TRAP_SIGNED(NODE) \
588 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE)))
590 /* Nonzero in a VAR_DECL means assembler code has been written.
591 Nonzero in a FUNCTION_DECL means that the function has been compiled.
592 This is interesting in an inline function, since it might not need
593 to be compiled separately.
594 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
595 if the sdb debugging info for the type has been written.
596 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
597 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
599 /* Nonzero in a _DECL if the name is used in its scope.
600 Nonzero in an expr node means inhibit warning if value is unused.
601 In IDENTIFIER_NODEs, this means that some extern decl for this name
603 #define TREE_USED(NODE) ((NODE)->common.used_flag)
605 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
606 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
607 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
609 /* In a CALL_EXPR, means that the address of the return slot is part of the
611 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
613 /* In a type, nonzero means that all objects of the type are guaranteed by the
614 language or front-end to be properly aligned, so we can indicate that a MEM
615 of this type is aligned at least to the alignment of the type, even if it
616 doesn't appear that it is. We see this, for example, in object-oriented
617 languages where a tag field may show this is an object of a more-aligned
618 variant of the more generic type. */
619 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
621 /* Used in classes in C++. */
622 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
623 /* Used in classes in C++.
624 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
625 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
627 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
628 deprecated feature by __attribute__((deprecated)). */
629 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
631 /* These flags are available for each language front end to use internally. */
632 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
633 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
634 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
635 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
636 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
637 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
638 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
640 /* Define additional fields and accessors for nodes representing constants. */
642 /* In an INTEGER_CST node. These two together make a 2-word integer.
643 If the data type is signed, the value is sign-extended to 2 words
644 even though not all of them may really be in use.
645 In an unsigned constant shorter than 2 words, the extra bits are 0. */
646 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
647 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
648 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
650 #define INT_CST_LT(A, B) \
651 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
652 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
653 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
655 #define INT_CST_LT_UNSIGNED(A, B) \
656 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
657 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
658 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
659 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
660 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
662 struct tree_int_cst GTY(())
664 struct tree_common common;
665 /* A sub-struct is necessary here because the function `const_hash'
666 wants to scan both words as a unit and taking the address of the
667 sub-struct yields the properly inclusive bounded pointer. */
668 struct tree_int_cst_lowhi {
669 unsigned HOST_WIDE_INT low;
674 /* In a REAL_CST node. struct real_value is an opaque entity, with
675 manipulators defined in real.h. We don't want tree.h depending on
676 real.h and transitively on tm.h. */
679 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
680 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
682 struct tree_real_cst GTY(())
684 struct tree_common common;
685 struct real_value * real_cst_ptr;
688 /* In a STRING_CST */
689 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
690 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
692 struct tree_string GTY(())
694 struct tree_common common;
699 /* In a COMPLEX_CST node. */
700 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
701 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
703 struct tree_complex GTY(())
705 struct tree_common common;
710 /* In a VECTOR_CST node. */
711 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
713 struct tree_vector GTY(())
715 struct tree_common common;
719 #include "hashtable.h"
721 /* Define fields and accessors for some special-purpose tree nodes. */
723 #define IDENTIFIER_LENGTH(NODE) \
724 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
725 #define IDENTIFIER_POINTER(NODE) \
726 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
727 #define IDENTIFIER_HASH_VALUE(NODE) \
728 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
730 /* Translate a hash table identifier pointer to a tree_identifier
731 pointer, and vice versa. */
733 #define HT_IDENT_TO_GCC_IDENT(NODE) \
734 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
735 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
737 struct tree_identifier GTY(())
739 struct tree_common common;
740 struct ht_identifier id;
743 /* In a TREE_LIST node. */
744 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
745 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
747 struct tree_list GTY(())
749 struct tree_common common;
754 /* In a TREE_VEC node. */
755 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
756 #define TREE_VEC_END(NODE) \
757 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
759 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
761 struct tree_vec GTY(())
763 struct tree_common common;
765 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
768 /* Define fields and accessors for some nodes that represent expressions. */
770 /* In a SAVE_EXPR node. */
771 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1)
772 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2)
774 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE))
775 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
776 both in normal code and in a handler. (Normally, in a handler, all
777 SAVE_EXPRs are unsaved, meaning that their values are
779 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
781 /* In a RTL_EXPR node. */
782 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0)
783 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1)
785 /* In a WITH_CLEANUP_EXPR node. */
786 #define WITH_CLEANUP_EXPR_RTL(NODE) \
787 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2)
789 /* In a CONSTRUCTOR node. */
790 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
792 /* In ordinary expression nodes. */
793 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
794 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
796 /* In a LABELED_BLOCK_EXPR node. */
797 #define LABELED_BLOCK_LABEL(NODE) \
798 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
799 #define LABELED_BLOCK_BODY(NODE) \
800 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
802 /* In an EXIT_BLOCK_EXPR node. */
803 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
804 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
805 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
807 /* In a LOOP_EXPR node. */
808 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
810 /* In an EXPR_WITH_FILE_LOCATION node. */
811 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
812 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
813 #define EXPR_WFL_NODE(NODE) \
814 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 0)
815 #define EXPR_WFL_FILENAME_NODE(NODE) \
816 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 1)
817 #define EXPR_WFL_FILENAME(NODE) \
818 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE))
819 /* ??? Java uses this in all expressions. */
820 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
821 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
822 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
823 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
824 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
826 /* In a TARGET_EXPR node. */
827 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
828 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
829 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
831 struct tree_exp GTY(())
833 struct tree_common common;
835 tree GTY ((special ("tree_exp"),
836 desc ("TREE_CODE ((tree) &%0)")))
840 /* In a BLOCK node. */
841 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
842 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
843 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
844 /* Note: when changing this, make sure to find the places
845 that use chainon or nreverse. */
846 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
847 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
848 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
850 /* Nonzero means that this block is prepared to handle exceptions
851 listed in the BLOCK_VARS slot. */
852 #define BLOCK_HANDLER_BLOCK(NODE) \
853 (BLOCK_CHECK (NODE)->block.handler_block_flag)
855 /* An index number for this block. These values are not guaranteed to
856 be unique across functions -- whether or not they are depends on
857 the debugging output format in use. */
858 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
860 /* If block reordering splits a lexical block into discontiguous
861 address ranges, we'll make a copy of the original block.
863 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
864 In that case, we have one source block that has been replicated
865 (through inlining or unrolling) into many logical blocks, and that
866 these logical blocks have different physical variables in them.
868 In this case, we have one logical block split into several
869 non-contiguous address ranges. Most debug formats can't actually
870 represent this idea directly, so we fake it by creating multiple
871 logical blocks with the same variables in them. However, for those
872 that do support non-contiguous regions, these allow the original
873 logical block to be reconstructed, along with the set of address
876 One of the logical block fragments is arbitrarily chosen to be
877 the ORIGIN. The other fragments will point to the origin via
878 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
879 be null. The list of fragments will be chained through
880 BLOCK_FRAGMENT_CHAIN from the origin. */
882 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
883 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
885 struct tree_block GTY(())
887 struct tree_common common;
889 unsigned handler_block_flag : 1;
890 unsigned abstract_flag : 1;
891 unsigned block_num : 30;
896 tree abstract_origin;
897 tree fragment_origin;
901 /* Define fields and accessors for nodes representing data types. */
903 /* See tree.def for documentation of the use of these fields.
904 Look at the documentation of the various ..._TYPE tree codes. */
906 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
907 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
908 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
909 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
910 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
911 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
912 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
913 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
914 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
915 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
916 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
917 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
918 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
919 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
920 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
921 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
922 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
923 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
924 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
925 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
926 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
927 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
928 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
929 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
930 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
932 /* For a VECTOR_TYPE node, this describes a different type which is emitted
933 in the debugging output. We use this to describe a vector as a
934 structure containing an array. */
935 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
937 /* For aggregate types, information about this type, as a base type
938 for itself. Used in a language-dependent way for types that are
939 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
940 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
942 /* The (language-specific) typed-based alias set for this type.
943 Objects whose TYPE_ALIAS_SETs are different cannot alias each
944 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
945 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
946 type can alias objects of any type. */
947 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
949 /* Nonzero iff the typed-based alias set for this type has been
951 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
953 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
955 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
957 /* The alignment necessary for objects of this type.
958 The value is an int, measured in bits. */
959 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
961 /* 1 if the alignment for this type was requested by "aligned" attribute,
962 0 if it is the default for this type. */
963 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
965 /* The alignment for NODE, in bytes. */
966 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
968 /* If your language allows you to declare types, and you want debug info
969 for them, then you need to generate corresponding TYPE_DECL nodes.
970 These "stub" TYPE_DECL nodes have no name, and simply point at the
971 type node. You then set the TYPE_STUB_DECL field of the type node
972 to point back at the TYPE_DECL node. This allows the debug routines
973 to know that the two nodes represent the same type, so that we only
974 get one debug info record for them. */
975 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
977 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
978 has BLKmode only because it lacks the alignment requirement for
980 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
982 /* In an INTEGER_TYPE, it means the type represents a size. We use
983 this both for validity checking and to permit optimizations that
984 are unsafe for other types. Note that the C `size_t' type should
985 *not* have this flag set. The `size_t' type is simply a typedef
986 for an ordinary integer type that happens to be the type of an
987 expression returned by `sizeof'; `size_t' has no special
988 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
989 always actual sizes. */
990 #define TYPE_IS_SIZETYPE(NODE) \
991 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
993 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
994 pointer depressed. */
995 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
996 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
998 /* Nonzero in a type considered volatile as a whole. */
999 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1001 /* Means this type is const-qualified. */
1002 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1004 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1006 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1008 /* There is a TYPE_QUAL value for each type qualifier. They can be
1009 combined by bitwise-or to form the complete set of qualifiers for a
1012 #define TYPE_UNQUALIFIED 0x0
1013 #define TYPE_QUAL_CONST 0x1
1014 #define TYPE_QUAL_VOLATILE 0x2
1015 #define TYPE_QUAL_RESTRICT 0x4
1017 /* The set of type qualifiers for this type. */
1018 #define TYPE_QUALS(NODE) \
1019 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1020 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1021 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1023 /* These flags are available for each language front end to use internally. */
1024 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1025 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1026 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1027 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1028 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1029 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1030 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1032 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1033 that distinguish string from array of char).
1034 If set in a SET_TYPE, indicates a bitstring type. */
1035 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1037 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1038 object of the given ARRAY_TYPE. This allows temporaries to be
1040 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1041 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE))
1043 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1044 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1045 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1047 /* Indicates that objects of this type must be initialized by calling a
1048 function when they are created. */
1049 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1050 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1052 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1053 the same way that the first union alternative would be passed. */
1054 #define TYPE_TRANSPARENT_UNION(NODE) \
1055 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1057 /* For an ARRAY_TYPE, indicates that it is not permitted to
1058 take the address of a component of the type. */
1059 #define TYPE_NONALIASED_COMPONENT(NODE) \
1060 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1062 /* Indicated that objects of this type should be laid out in as
1063 compact a way as possible. */
1064 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1068 struct tree_type GTY(())
1070 struct tree_common common;
1077 unsigned int precision : 9;
1078 ENUM_BITFIELD(machine_mode) mode : 7;
1080 unsigned string_flag : 1;
1081 unsigned no_force_blk_flag : 1;
1082 unsigned needs_constructing_flag : 1;
1083 unsigned transparent_union_flag : 1;
1084 unsigned packed_flag : 1;
1085 unsigned restrict_flag : 1;
1088 unsigned lang_flag_0 : 1;
1089 unsigned lang_flag_1 : 1;
1090 unsigned lang_flag_2 : 1;
1091 unsigned lang_flag_3 : 1;
1092 unsigned lang_flag_4 : 1;
1093 unsigned lang_flag_5 : 1;
1094 unsigned lang_flag_6 : 1;
1095 unsigned user_align : 1;
1100 union tree_type_symtab {
1101 int GTY ((tag ("0"))) address;
1102 char * GTY ((tag ("1"))) pointer;
1103 struct die_struct * GTY ((tag ("2"))) die;
1104 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1105 descbits ("2"))) symtab;
1113 HOST_WIDE_INT alias_set;
1114 /* Points to a structure whose details depend on the language in use. */
1115 struct lang_type *lang_specific;
1118 /* Define accessor macros for information about type inheritance
1121 A "basetype" means a particular usage of a data type for inheritance
1122 in another type. Each such basetype usage has its own "binfo"
1123 object to describe it. The binfo object is a TREE_VEC node.
1125 Inheritance is represented by the binfo nodes allocated for a
1126 given type. For example, given types C and D, such that D is
1127 inherited by C, 3 binfo nodes will be allocated: one for describing
1128 the binfo properties of C, similarly one for D, and one for
1129 describing the binfo properties of D as a base type for C.
1130 Thus, given a pointer to class C, one can get a pointer to the binfo
1131 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1133 /* The actual data type node being inherited in this basetype. */
1134 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1136 /* The offset where this basetype appears in its containing type.
1137 BINFO_OFFSET slot holds the offset (in bytes)
1138 from the base of the complete object to the base of the part of the
1139 object that is allocated on behalf of this `type'.
1140 This is always 0 except when there is multiple inheritance. */
1142 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1143 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1144 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1146 /* The virtual function table belonging to this basetype. Virtual
1147 function tables provide a mechanism for run-time method dispatching.
1148 The entries of a virtual function table are language-dependent. */
1150 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1151 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1153 /* The virtual functions in the virtual function table. This is
1154 a TREE_LIST that is used as an initial approximation for building
1155 a virtual function table for this basetype. */
1156 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1157 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1159 /* A vector of binfos for the direct basetypes inherited by this
1162 If this basetype describes type D as inherited in C, and if the
1163 basetypes of D are E and F, then this vector contains binfos for
1164 inheritance of E and F by C.
1166 ??? This could probably be done by just allocating the
1167 base types at the end of this TREE_VEC (instead of using
1168 another TREE_VEC). This would simplify the calculation
1169 of how many basetypes a given type had. */
1170 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1171 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1173 /* The number of basetypes for NODE. */
1174 #define BINFO_N_BASETYPES(NODE) \
1175 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1177 /* Accessor macro to get to the Nth basetype of this basetype. */
1178 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1179 #define TYPE_BINFO_BASETYPE(NODE,N) \
1180 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1182 /* For a BINFO record describing a virtual base class, i.e., one where
1183 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1184 base. The actual contents are language-dependent. In the C++
1185 front-end this field is an INTEGER_CST giving an offset into the
1186 vtable where the offset to the virtual base can be found. */
1187 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1189 /* Indicates the accesses this binfo has to its bases. The values are
1190 access_public_node, access_protected_node or access_private_node.
1191 If this array is not present, public access is implied. */
1192 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1193 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1195 /* Number of language independent elements in a binfo. Languages may
1196 add additional trailing elements. */
1198 #define BINFO_ELTS 7
1200 /* Slot used to build a chain that represents a use of inheritance.
1201 For example, if X is derived from Y, and Y is derived from Z,
1202 then this field can be used to link the binfo node for X to
1203 the binfo node for X's Y to represent the use of inheritance
1204 from X to Y. Similarly, this slot of the binfo node for X's Y
1205 can point to the Z from which Y is inherited (in X's inheritance
1206 hierarchy). In this fashion, one can represent and traverse specific
1207 uses of inheritance using the binfo nodes themselves (instead of
1208 consing new space pointing to binfo nodes).
1209 It is up to the language-dependent front-ends to maintain
1210 this information as necessary. */
1211 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1213 /* Define fields and accessors for nodes representing declared names. */
1215 /* Nonzero if DECL represents a decl. */
1216 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1218 /* This is the name of the object as written by the user.
1219 It is an IDENTIFIER_NODE. */
1220 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1222 /* The name of the object as the assembler will see it (but before any
1223 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1224 as DECL_NAME. It is an IDENTIFIER_NODE. */
1225 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1227 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1228 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1230 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1231 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1233 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1234 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1235 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1237 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1238 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1239 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1240 semantics of using this macro, are different than saying:
1242 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1244 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1246 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1247 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1248 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1249 DECL_ASSEMBLER_NAME (DECL1)) \
1252 /* Records the section name in a section attribute. Used to pass
1253 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1254 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1256 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1257 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1258 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1259 points to either the FUNCTION_DECL for the containing function,
1260 the RECORD_TYPE or UNION_TYPE for the containing type, or
1261 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1263 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1264 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1265 /* In a DECL this is the field where attributes are stored. */
1266 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1267 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1268 byte containing the bit closest to the beginning of the structure. */
1269 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1270 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1271 field from DECL_FIELD_OFFSET. */
1272 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1273 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1274 if so, the type that was originally specified for it.
1275 TREE_TYPE may have been modified (in finish_struct). */
1276 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1277 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1278 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1280 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1281 /* This field is used to reference anything in decl.result and is meant only
1282 for use by the garbage collector. */
1283 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1284 /* In FUNCTION_DECL, holds the decl for the return value. */
1285 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1286 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1287 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1288 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1289 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1290 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1291 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1292 For a VAR_DECL, holds the initial value.
1293 For a PARM_DECL, not used--default
1294 values for parameters are encoded in the type of the function,
1295 not in the PARM_DECL slot. */
1296 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1297 /* For a PARM_DECL, records the data type used to pass the argument,
1298 which may be different from the type seen in the program. */
1299 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1300 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1301 if nonzero, indicates that the field occupies the type. */
1302 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1303 /* These two fields describe where in the source code the declaration
1304 was. If the declaration appears in several places (as for a C
1305 function that is declared first and then defined later), this
1306 information should refer to the definition. */
1307 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1308 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1309 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1310 /* Holds the size of the datum, in bits, as a tree expression.
1311 Need not be constant. */
1312 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1313 /* Likewise for the size in bytes. */
1314 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1315 /* Holds the alignment required for the datum, in bits. */
1316 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1317 /* The alignment of NODE, in bytes. */
1318 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1319 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1320 DECL_FIELD_OFFSET which are known to be always zero.
1321 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1323 #define DECL_OFFSET_ALIGN(NODE) \
1324 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1325 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1326 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1327 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1328 /* 1 if the alignment for this type was requested by "aligned" attribute,
1329 0 if it is the default for this type. */
1330 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1331 /* Holds the machine mode corresponding to the declaration of a variable or
1332 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1334 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1335 /* Holds the RTL expression for the value of a variable or function. If
1336 PROMOTED_MODE is defined, the mode of this expression may not be same
1337 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1338 to the variable's data type, while the mode
1339 of DECL_RTL is the mode actually used to contain the data.
1341 This value can be evaluated lazily for functions, variables with
1342 static storage duration, and labels. */
1343 #define DECL_RTL(NODE) \
1344 (DECL_CHECK (NODE)->decl.rtl \
1345 ? (NODE)->decl.rtl \
1346 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1347 /* Set the DECL_RTL for NODE to RTL. */
1348 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1349 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1350 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1351 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1352 NODE1, it will not be set for NODE2; this is a lazy copy. */
1353 #define COPY_DECL_RTL(NODE1, NODE2) \
1354 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1355 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1356 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1358 /* For PARM_DECL, holds an RTL for the stack slot or register
1359 where the data was actually passed. */
1360 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1362 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1363 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1365 /* For FUNCTION_DECL, if it is built-in,
1366 this identifies which built-in operation it is. */
1367 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1369 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1370 Before the struct containing the FUNCTION_DECL is laid out,
1371 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1372 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1373 function. When the class is laid out, this pointer is changed
1374 to an INTEGER_CST node which is suitable for use as an index
1375 into the virtual function table. */
1376 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1378 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1379 which this FIELD_DECL is defined. This information is needed when
1380 writing debugging information about vfield and vbase decls for C++. */
1381 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1383 /* Every ..._DECL node gets a unique number. */
1384 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1386 /* For any sort of a ..._DECL node, this points to the original (abstract)
1387 decl node which this decl is an instance of, or else it is NULL indicating
1388 that this decl is not an instance of some other decl. For example,
1389 in a nested declaration of an inline function, this points back to the
1391 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1393 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1394 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1395 #define DECL_ORIGIN(NODE) \
1396 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1398 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1399 inline instance of some original (abstract) decl from an inline function;
1400 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1401 nodes can also have their abstract origin set to themselves. */
1402 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1403 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1405 /* Nonzero if a _DECL means that the name of this decl should be ignored
1406 for symbolic debug purposes. */
1407 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1409 /* Nonzero for a given ..._DECL node means that this node represents an
1410 "abstract instance" of the given declaration (e.g. in the original
1411 declaration of an inline function). When generating symbolic debugging
1412 information, we mustn't try to generate any address information for nodes
1413 marked as "abstract instances" because we don't actually generate
1414 any code or allocate any data space for such instances. */
1415 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1417 /* Nonzero if a _DECL means that no warnings should be generated just
1418 because this decl is unused. */
1419 #define DECL_IN_SYSTEM_HEADER(NODE) \
1420 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1422 /* Nonzero for a given ..._DECL node means that this node should be
1423 put in .common, if possible. If a DECL_INITIAL is given, and it
1424 is not error_mark_node, then the decl cannot be put in .common. */
1425 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1427 /* Language-specific decl information. */
1428 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1430 /* In a VAR_DECL or FUNCTION_DECL,
1431 nonzero means external reference:
1432 do not allocate storage, and refer to a definition elsewhere. */
1433 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1435 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1437 #define DEFAULT_INIT_PRIORITY 65535
1438 #define MAX_INIT_PRIORITY 65535
1439 #define MAX_RESERVED_INIT_PRIORITY 100
1442 nonzero means the detail info about this type is not dumped into stabs.
1443 Instead it will generate cross reference ('x') of names.
1444 This uses the same flag as DECL_EXTERNAL. */
1445 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1446 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1448 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1449 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1451 /* In LABEL_DECL nodes, nonzero means that an error message about
1452 jumping into such a binding contour has been printed for this label. */
1453 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1455 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1456 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1458 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1459 static chain is not needed. */
1460 #define DECL_NO_STATIC_CHAIN(NODE) \
1461 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1463 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1464 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1466 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1468 Also set in some languages for variables, etc., outside the normal
1469 lexical scope, such as class instance variables. */
1470 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1472 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1473 where it is called. */
1474 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1476 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
1477 such as via the `inline' keyword in C/C++. This flag controls the linkage
1478 semantics of 'inline'; whether or not the function is inlined is
1479 controlled by DECL_INLINE. */
1480 #define DECL_DECLARED_INLINE_P(NODE) \
1481 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
1483 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1484 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1486 /* In a VAR_DECL, nonzero if the data should be allocated from
1487 thread-local storage. */
1488 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1490 /* In a FUNCTION_DECL, the saved representation of the body of the
1491 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1492 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1493 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1495 /* List of FUNCTION_DECLs inlined into this function's body. */
1496 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1498 /* Nonzero in a FUNCTION_DECL means this function should be treated
1499 as if it were a malloc, meaning it returns a pointer that is
1501 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1503 /* Nonzero in a FUNCTION_DECL means this function should be treated
1504 as "pure" function (like const function, but may read global memory). */
1505 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1507 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1509 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1511 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1512 contour that restored a stack level and which is now exited. */
1513 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1515 /* Unused in FUNCTION_DECL. */
1517 /* In a VAR_DECL that's static,
1518 nonzero if the space is in the text section. */
1519 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1521 /* In a FUNCTION_DECL, nonzero means a built in function. */
1522 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1524 /* For a builtin function, identify which part of the compiler defined it. */
1525 #define DECL_BUILT_IN_CLASS(NODE) \
1526 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1528 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1529 Used in FIELD_DECLs for vtable pointers.
1530 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1531 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1533 /* Used to indicate that the linkage status of this DECL is not yet known,
1534 so it should not be output now. */
1535 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1537 /* Used in PARM_DECLs whose type are unions to indicate that the
1538 argument should be passed in the same way that the first union
1539 alternative would be passed. */
1540 #define DECL_TRANSPARENT_UNION(NODE) \
1541 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1543 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1544 at the beginning or end of execution. */
1545 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1546 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1548 #define DECL_STATIC_DESTRUCTOR(NODE) \
1549 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1551 /* Used to indicate that this DECL represents a compiler-generated entity. */
1552 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1554 /* Used to indicate that this DECL has weak linkage. */
1555 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1557 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1558 multiple translation units should be merged. */
1559 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1561 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1562 not be put out unless it is needed in this translation unit.
1563 Entities like this are shared across translation units (like weak
1564 entities), but are guaranteed to be generated by any translation
1565 unit that needs them, and therefore need not be put out anywhere
1566 where they are not needed. DECL_COMDAT is just a hint to the
1567 back-end; it is up to front-ends which set this flag to ensure
1568 that there will never be any harm, other than bloat, in putting out
1569 something which is DECL_COMDAT. */
1570 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1572 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1573 be instrumented with calls to support routines. */
1574 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1575 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1577 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1578 disabled in this function. */
1579 #define DECL_NO_LIMIT_STACK(NODE) \
1580 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1582 /* Additional flags for language-specific uses. */
1583 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1584 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1585 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1586 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1587 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1588 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1589 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1590 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1592 /* Used to indicate that the pointer to this DECL cannot be treated as
1593 an address constant. */
1594 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1596 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1598 #define DECL_NONADDRESSABLE_P(NODE) \
1599 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1601 /* Used to indicate an alias set for the memory pointed to by this
1602 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1603 pointer (or reference) type. */
1604 #define DECL_POINTER_ALIAS_SET(NODE) \
1605 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1607 /* Nonzero if an alias set has been assigned to this declaration. */
1608 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1609 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1611 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this is
1612 the approximate number of statements in this function. There is
1613 no need for this number to be exact; it is only used in various
1614 heuristics regarding optimization. */
1615 #define DECL_ESTIMATED_INSNS(NODE) \
1616 (FUNCTION_DECL_CHECK (NODE)->decl.u1.i)
1620 struct tree_decl GTY(())
1622 struct tree_common common;
1626 ENUM_BITFIELD(machine_mode) mode : 8;
1628 unsigned external_flag : 1;
1629 unsigned nonlocal_flag : 1;
1630 unsigned regdecl_flag : 1;
1631 unsigned inline_flag : 1;
1632 unsigned bit_field_flag : 1;
1633 unsigned virtual_flag : 1;
1634 unsigned ignored_flag : 1;
1635 unsigned abstract_flag : 1;
1637 unsigned in_system_header_flag : 1;
1638 unsigned common_flag : 1;
1639 unsigned defer_output : 1;
1640 unsigned transparent_union : 1;
1641 unsigned static_ctor_flag : 1;
1642 unsigned static_dtor_flag : 1;
1643 unsigned artificial_flag : 1;
1644 unsigned weak_flag : 1;
1646 unsigned non_addr_const_p : 1;
1647 unsigned no_instrument_function_entry_exit : 1;
1648 unsigned comdat_flag : 1;
1649 unsigned malloc_flag : 1;
1650 unsigned no_limit_stack : 1;
1651 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1652 unsigned pure_flag : 1;
1654 unsigned non_addressable : 1;
1655 unsigned user_align : 1;
1656 unsigned uninlinable : 1;
1657 unsigned thread_local_flag : 1;
1658 unsigned declared_inline_flag : 1;
1659 unsigned unused : 3;
1660 /* three unused bits. */
1662 unsigned lang_flag_0 : 1;
1663 unsigned lang_flag_1 : 1;
1664 unsigned lang_flag_2 : 1;
1665 unsigned lang_flag_3 : 1;
1666 unsigned lang_flag_4 : 1;
1667 unsigned lang_flag_5 : 1;
1668 unsigned lang_flag_6 : 1;
1669 unsigned lang_flag_7 : 1;
1671 union tree_decl_u1 {
1672 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1673 DECL_FUNCTION_CODE. */
1674 enum built_in_function f;
1675 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
1676 is used by language-dependent code. */
1678 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1680 struct tree_decl_u1_a {
1681 unsigned int align : 24;
1682 unsigned int off_align : 8;
1684 } GTY ((skip (""))) u1;
1689 tree arguments; /* Also used for DECL_FIELD_OFFSET */
1690 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
1691 tree initial; /* Also used for DECL_QUALIFIER */
1692 tree abstract_origin;
1693 tree assembler_name;
1696 rtx rtl; /* RTL representation for object. */
1698 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1699 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1700 In PARM_DECL, holds an RTL for the stack slot
1701 of register where the data was actually passed.
1702 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1703 union tree_decl_u2 {
1704 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
1705 rtx GTY ((tag ("PARM_DECL"))) r;
1706 tree GTY ((tag ("FIELD_DECL"))) t;
1707 int GTY ((tag ("VAR_DECL"))) i;
1708 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
1710 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1713 /* In a FUNCTION_DECL, these are function data which is to be kept
1714 as long as FUNCTION_DECL is kept. */
1718 HOST_WIDE_INT pointer_alias_set;
1719 /* Points to a structure whose details depend on the language in use. */
1720 struct lang_decl *lang_specific;
1723 enum tree_node_structure_enum {
1740 /* Define the overall contents of a tree node.
1741 It may be any of the structures declared above
1742 for various types of node. */
1744 union tree_node GTY ((ptr_alias (union lang_tree_node),
1745 desc ("tree_node_structure (&%h)")))
1747 struct tree_common GTY ((tag ("TS_COMMON"))) common;
1748 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
1749 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
1750 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
1751 struct tree_string GTY ((tag ("TS_STRING"))) string;
1752 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
1753 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
1754 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
1755 struct tree_type GTY ((tag ("TS_TYPE"))) type;
1756 struct tree_list GTY ((tag ("TS_LIST"))) list;
1757 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
1758 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
1759 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
1762 /* Standard named or nameless data types of the C compiler. */
1781 TI_INTEGER_MINUS_ONE,
1794 TI_COMPLEX_INTEGER_TYPE,
1795 TI_COMPLEX_FLOAT_TYPE,
1796 TI_COMPLEX_DOUBLE_TYPE,
1797 TI_COMPLEX_LONG_DOUBLE_TYPE,
1801 TI_LONG_DOUBLE_TYPE,
1845 extern GTY(()) tree global_trees[TI_MAX];
1847 #define error_mark_node global_trees[TI_ERROR_MARK]
1849 #define intQI_type_node global_trees[TI_INTQI_TYPE]
1850 #define intHI_type_node global_trees[TI_INTHI_TYPE]
1851 #define intSI_type_node global_trees[TI_INTSI_TYPE]
1852 #define intDI_type_node global_trees[TI_INTDI_TYPE]
1853 #define intTI_type_node global_trees[TI_INTTI_TYPE]
1855 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
1856 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
1857 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
1858 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
1859 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
1861 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
1862 #define integer_one_node global_trees[TI_INTEGER_ONE]
1863 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
1864 #define size_zero_node global_trees[TI_SIZE_ZERO]
1865 #define size_one_node global_trees[TI_SIZE_ONE]
1866 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
1867 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
1868 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
1870 /* Base access nodes. */
1871 #define access_public_node NULL_TREE
1872 #define access_protected_node size_zero_node
1873 #define access_private_node size_one_node
1875 #define null_pointer_node global_trees[TI_NULL_POINTER]
1877 #define float_type_node global_trees[TI_FLOAT_TYPE]
1878 #define double_type_node global_trees[TI_DOUBLE_TYPE]
1879 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
1881 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
1882 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
1883 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
1884 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
1886 #define void_type_node global_trees[TI_VOID_TYPE]
1887 /* The C type `void *'. */
1888 #define ptr_type_node global_trees[TI_PTR_TYPE]
1889 /* The C type `const void *'. */
1890 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
1891 /* The C type `size_t'. */
1892 #define size_type_node global_trees[TI_SIZE_TYPE]
1893 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
1894 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
1896 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
1897 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
1898 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
1900 /* The node that should be placed at the end of a parameter list to
1901 indicate that the function does not take a variable number of
1902 arguments. The TREE_VALUE will be void_type_node and there will be
1903 no TREE_CHAIN. Language-independent code should not assume
1904 anything else about this node. */
1905 #define void_list_node global_trees[TI_VOID_LIST_NODE]
1907 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
1908 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
1910 #define unsigned_V16QI_type_node global_trees[TI_UV16QI_TYPE]
1911 #define unsigned_V4SI_type_node global_trees[TI_UV4SI_TYPE]
1912 #define unsigned_V8QI_type_node global_trees[TI_UV8QI_TYPE]
1913 #define unsigned_V8HI_type_node global_trees[TI_UV8HI_TYPE]
1914 #define unsigned_V4HI_type_node global_trees[TI_UV4HI_TYPE]
1915 #define unsigned_V2HI_type_node global_trees[TI_UV2HI_TYPE]
1916 #define unsigned_V2SI_type_node global_trees[TI_UV2SI_TYPE]
1917 #define unsigned_V2DI_type_node global_trees[TI_UV2DI_TYPE]
1918 #define unsigned_V1DI_type_node global_trees[TI_UV1DI_TYPE]
1920 #define V16QI_type_node global_trees[TI_V16QI_TYPE]
1921 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
1922 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
1923 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
1924 #define V8HI_type_node global_trees[TI_V8HI_TYPE]
1925 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
1926 #define V2HI_type_node global_trees[TI_V2HI_TYPE]
1927 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
1928 #define V2SF_type_node global_trees[TI_V2SF_TYPE]
1929 #define V2DI_type_node global_trees[TI_V2DI_TYPE]
1930 #define V2DF_type_node global_trees[TI_V2DF_TYPE]
1931 #define V16SF_type_node global_trees[TI_V16SF_TYPE]
1932 #define V1DI_type_node global_trees[TI_V1DI_TYPE]
1933 #define V4DF_type_node global_trees[TI_V4DF_TYPE]
1935 /* An enumeration of the standard C integer types. These must be
1936 ordered so that shorter types appear before longer ones, and so
1937 that signed types appear before unsigned ones, for the correct
1938 functioning of interpret_integer() in c-lex.c. */
1939 enum integer_type_kind
1951 itk_unsigned_long_long,
1955 typedef enum integer_type_kind integer_type_kind;
1957 /* The standard C integer types. Use integer_type_kind to index into
1959 extern GTY(()) tree integer_types[itk_none];
1961 #define char_type_node integer_types[itk_char]
1962 #define signed_char_type_node integer_types[itk_signed_char]
1963 #define unsigned_char_type_node integer_types[itk_unsigned_char]
1964 #define short_integer_type_node integer_types[itk_short]
1965 #define short_unsigned_type_node integer_types[itk_unsigned_short]
1966 #define integer_type_node integer_types[itk_int]
1967 #define unsigned_type_node integer_types[itk_unsigned_int]
1968 #define long_integer_type_node integer_types[itk_long]
1969 #define long_unsigned_type_node integer_types[itk_unsigned_long]
1970 #define long_long_integer_type_node integer_types[itk_long_long]
1971 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
1973 /* Set to the default thread-local storage (tls) model to use. */
1976 TLS_MODEL_GLOBAL_DYNAMIC = 1,
1977 TLS_MODEL_LOCAL_DYNAMIC,
1978 TLS_MODEL_INITIAL_EXEC,
1979 TLS_MODEL_LOCAL_EXEC
1982 extern enum tls_model flag_tls_default;
1984 /* Enumerate visibility settings. */
1986 enum symbol_visibility
1989 VISIBILITY_INTERNAL,
1991 VISIBILITY_PROTECTED
1994 /* A pointer-to-function member type looks like:
2001 If __pfn is NULL, it is a NULL pointer-to-member-function.
2003 (Because the vtable is always the first thing in the object, we
2004 don't need its offset.) If the function is virtual, then PFN is
2005 one plus twice the index into the vtable; otherwise, it is just a
2006 pointer to the function.
2008 Unfortunately, using the lowest bit of PFN doesn't work in
2009 architectures that don't impose alignment requirements on function
2010 addresses, or that use the lowest bit to tell one ISA from another,
2011 for example. For such architectures, we use the lowest bit of
2012 DELTA instead of the lowest bit of the PFN, and DELTA will be
2015 enum ptrmemfunc_vbit_where_t
2017 ptrmemfunc_vbit_in_pfn,
2018 ptrmemfunc_vbit_in_delta
2021 #define NULL_TREE (tree) NULL
2023 extern tree decl_assembler_name (tree);
2025 /* Compute the number of bytes occupied by 'node'. This routine only
2026 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2028 extern size_t tree_size (tree);
2030 /* Lowest level primitive for allocating a node.
2031 The TREE_CODE is the only argument. Contents are initialized
2032 to zero except for a few of the common fields. */
2034 extern tree make_node (enum tree_code);
2036 /* Make a copy of a node, with all the same contents. */
2038 extern tree copy_node (tree);
2040 /* Make a copy of a chain of TREE_LIST nodes. */
2042 extern tree copy_list (tree);
2044 /* Make a TREE_VEC. */
2046 extern tree make_tree_vec (int);
2048 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2049 The name is supplied as a char *. */
2051 extern tree get_identifier (const char *);
2053 #if GCC_VERSION >= 3000
2054 #define get_identifier(str) \
2055 (__builtin_constant_p (str) \
2056 ? get_identifier_with_length ((str), strlen (str)) \
2057 : get_identifier (str))
2061 /* Identical to get_identifier, except that the length is assumed
2064 extern tree get_identifier_with_length (const char *, size_t);
2066 /* If an identifier with the name TEXT (a null-terminated string) has
2067 previously been referred to, return that node; otherwise return
2070 extern tree maybe_get_identifier (const char *);
2072 /* Construct various types of nodes. */
2074 #define build_int_2(LO, HI) \
2075 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2077 extern tree build (enum tree_code, tree, ...);
2078 extern tree build_nt (enum tree_code, ...);
2080 extern tree build_int_2_wide (unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2081 extern tree build_vector (tree, tree);
2082 extern tree build_constructor (tree, tree);
2083 extern tree build_real_from_int_cst (tree, tree);
2084 extern tree build_complex (tree, tree, tree);
2085 extern tree build_string (int, const char *);
2086 extern tree build1 (enum tree_code, tree, tree);
2087 extern tree build_tree_list (tree, tree);
2088 extern tree build_decl (enum tree_code, tree, tree);
2089 extern tree build_block (tree, tree, tree, tree, tree);
2090 extern tree build_expr_wfl (tree, const char *, int, int);
2092 /* Construct various nodes representing data types. */
2094 extern tree make_signed_type (int);
2095 extern tree make_unsigned_type (int);
2096 extern void initialize_sizetypes (void);
2097 extern void set_sizetype (tree);
2098 extern void fixup_unsigned_type (tree);
2099 extern tree build_pointer_type_for_mode (tree, enum machine_mode);
2100 extern tree build_pointer_type (tree);
2101 extern tree build_reference_type_for_mode (tree, enum machine_mode);
2102 extern tree build_reference_type (tree);
2103 extern tree build_type_no_quals (tree);
2104 extern tree build_index_type (tree);
2105 extern tree build_index_2_type (tree, tree);
2106 extern tree build_array_type (tree, tree);
2107 extern tree build_function_type (tree, tree);
2108 extern tree build_function_type_list (tree, ...);
2109 extern tree build_method_type (tree, tree);
2110 extern tree build_offset_type (tree, tree);
2111 extern tree build_complex_type (tree);
2112 extern tree array_type_nelts (tree);
2114 extern tree value_member (tree, tree);
2115 extern tree purpose_member (tree, tree);
2116 extern tree binfo_member (tree, tree);
2117 extern unsigned int attribute_hash_list (tree);
2118 extern int attribute_list_equal (tree, tree);
2119 extern int attribute_list_contained (tree, tree);
2120 extern int tree_int_cst_equal (tree, tree);
2121 extern int tree_int_cst_lt (tree, tree);
2122 extern int tree_int_cst_compare (tree, tree);
2123 extern int host_integerp (tree, int);
2124 extern HOST_WIDE_INT tree_low_cst (tree, int);
2125 extern int tree_int_cst_msb (tree);
2126 extern int tree_int_cst_sgn (tree);
2127 extern int tree_expr_nonnegative_p (tree);
2128 extern int rtl_expr_nonnegative_p (rtx);
2129 extern tree get_inner_array_type (tree);
2131 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2132 put the prototype here. Rtl.h does declare the prototype if
2133 tree.h had been included. */
2135 extern tree make_tree (tree, rtx);
2137 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2140 Such modified types already made are recorded so that duplicates
2143 extern tree build_type_attribute_variant (tree, tree);
2144 extern tree build_decl_attribute_variant (tree, tree);
2146 /* Structure describing an attribute and a function to handle it. */
2147 struct attribute_spec
2149 /* The name of the attribute (without any leading or trailing __),
2150 or NULL to mark the end of a table of attributes. */
2151 const char *const name;
2152 /* The minimum length of the list of arguments of the attribute. */
2153 const int min_length;
2154 /* The maximum length of the list of arguments of the attribute
2155 (-1 for no maximum). */
2156 const int max_length;
2157 /* Whether this attribute requires a DECL. If it does, it will be passed
2158 from types of DECLs, function return types and array element types to
2159 the DECLs, function types and array types respectively; but when
2160 applied to a type in any other circumstances, it will be ignored with
2161 a warning. (If greater control is desired for a given attribute,
2162 this should be false, and the flags argument to the handler may be
2163 used to gain greater control in that case.) */
2164 const bool decl_required;
2165 /* Whether this attribute requires a type. If it does, it will be passed
2166 from a DECL to the type of that DECL. */
2167 const bool type_required;
2168 /* Whether this attribute requires a function (or method) type. If it does,
2169 it will be passed from a function pointer type to the target type,
2170 and from a function return type (which is not itself a function
2171 pointer type) to the function type. */
2172 const bool function_type_required;
2173 /* Function to handle this attribute. NODE points to the node to which
2174 the attribute is to be applied. If a DECL, it should be modified in
2175 place; if a TYPE, a copy should be created. NAME is the name of the
2176 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2177 of the arguments (which may be NULL). FLAGS gives further information
2178 about the context of the attribute. Afterwards, the attributes will
2179 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2180 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2181 as well as in any other cases when the attributes should not be added
2182 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2183 applied to another type or DECL later may be returned;
2184 otherwise the return value should be NULL_TREE. This pointer may be
2185 NULL if no special handling is required beyond the checks implied
2186 by the rest of this structure. */
2187 tree (*const handler) (tree *node, tree name, tree args,
2188 int flags, bool *no_add_attrs);
2191 /* Flags that may be passed in the third argument of decl_attributes, and
2192 to handler functions for attributes. */
2193 enum attribute_flags
2195 /* The type passed in is the type of a DECL, and any attributes that
2196 should be passed in again to be applied to the DECL rather than the
2197 type should be returned. */
2198 ATTR_FLAG_DECL_NEXT = 1,
2199 /* The type passed in is a function return type, and any attributes that
2200 should be passed in again to be applied to the function type rather
2201 than the return type should be returned. */
2202 ATTR_FLAG_FUNCTION_NEXT = 2,
2203 /* The type passed in is an array element type, and any attributes that
2204 should be passed in again to be applied to the array type rather
2205 than the element type should be returned. */
2206 ATTR_FLAG_ARRAY_NEXT = 4,
2207 /* The type passed in is a structure, union or enumeration type being
2208 created, and should be modified in place. */
2209 ATTR_FLAG_TYPE_IN_PLACE = 8,
2210 /* The attributes are being applied by default to a library function whose
2211 name indicates known behavior, and should be silently ignored if they
2212 are not in fact compatible with the function type. */
2213 ATTR_FLAG_BUILT_IN = 16
2216 /* Default versions of target-overridable functions. */
2218 extern tree merge_decl_attributes (tree, tree);
2219 extern tree merge_type_attributes (tree, tree);
2220 extern void default_register_cpp_builtins (struct cpp_reader *);
2222 /* Split a list of declspecs and attributes into two. */
2224 extern void split_specs_attrs (tree, tree *, tree *);
2226 /* Strip attributes from a list of combined specs and attrs. */
2228 extern tree strip_attrs (tree);
2230 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2232 extern int valid_machine_attribute (tree, tree, tree, tree);
2234 /* Given a tree node and a string, return nonzero if the tree node is
2235 a valid attribute name for the string. */
2237 extern int is_attribute_p (const char *, tree);
2239 /* Given an attribute name and a list of attributes, return the list element
2240 of the attribute or NULL_TREE if not found. */
2242 extern tree lookup_attribute (const char *, tree);
2244 /* Given two attributes lists, return a list of their union. */
2246 extern tree merge_attributes (tree, tree);
2248 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2249 /* Given two Windows decl attributes lists, possibly including
2250 dllimport, return a list of their union . */
2251 extern tree merge_dllimport_decl_attributes (tree, tree);
2254 /* Return a version of the TYPE, qualified as indicated by the
2255 TYPE_QUALS, if one exists. If no qualified version exists yet,
2256 return NULL_TREE. */
2258 extern tree get_qualified_type (tree, int);
2260 /* Like get_qualified_type, but creates the type if it does not
2261 exist. This function never returns NULL_TREE. */
2263 extern tree build_qualified_type (tree, int);
2265 /* Like build_qualified_type, but only deals with the `const' and
2266 `volatile' qualifiers. This interface is retained for backwards
2267 compatibility with the various front-ends; new code should use
2268 build_qualified_type instead. */
2270 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2271 build_qualified_type ((TYPE), \
2272 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2273 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2275 /* Make a copy of a type node. */
2277 extern tree build_type_copy (tree);
2279 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2280 fields. Optionally specify an alignment, and then lsy it out. */
2282 extern void finish_builtin_struct (tree, const char *,
2285 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2286 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2287 node, does nothing except for the first time. */
2289 extern void layout_type (tree);
2291 /* These functions allow a front-end to perform a manual layout of a
2292 RECORD_TYPE. (For instance, if the placement of subsequent fields
2293 depends on the placement of fields so far.) Begin by calling
2294 start_record_layout. Then, call place_field for each of the
2295 fields. Then, call finish_record_layout. See layout_type for the
2296 default way in which these functions are used. */
2298 typedef struct record_layout_info_s
2300 /* The RECORD_TYPE that we are laying out. */
2302 /* The offset into the record so far, in bytes, not including bits in
2305 /* The last known alignment of SIZE. */
2306 unsigned int offset_align;
2307 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2309 /* The alignment of the record so far, in bits. */
2310 unsigned int record_align;
2311 /* The alignment of the record so far, ignoring #pragma pack and
2312 __attribute__ ((packed)), in bits. */
2313 unsigned int unpacked_align;
2314 /* The previous field layed out. */
2316 /* The static variables (i.e., class variables, as opposed to
2317 instance variables) encountered in T. */
2318 tree pending_statics;
2319 /* Bits remaining in the current alignment group */
2320 int remaining_in_alignment;
2321 /* True if we've seen a packed field that didn't have normal
2322 alignment anyway. */
2323 int packed_maybe_necessary;
2324 } *record_layout_info;
2326 extern void set_lang_adjust_rli (void (*) (record_layout_info));
2327 extern record_layout_info start_record_layout (tree);
2328 extern tree bit_from_pos (tree, tree);
2329 extern tree byte_from_pos (tree, tree);
2330 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
2331 extern void normalize_offset (tree *, tree *, unsigned int);
2332 extern tree rli_size_unit_so_far (record_layout_info);
2333 extern tree rli_size_so_far (record_layout_info);
2334 extern void normalize_rli (record_layout_info);
2335 extern void place_field (record_layout_info, tree);
2336 extern void compute_record_mode (tree);
2337 extern void finish_record_layout (record_layout_info, int);
2339 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2340 return a canonicalized ..._TYPE node, so that duplicates are not made.
2341 How the hash code is computed is up to the caller, as long as any two
2342 callers that could hash identical-looking type nodes agree. */
2344 extern tree type_hash_canon (unsigned int, tree);
2346 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2347 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2348 fields. Call this only once for any given decl node.
2350 Second argument is the boundary that this field can be assumed to
2351 be starting at (in bits). Zero means it can be assumed aligned
2352 on any boundary that may be needed. */
2354 extern void layout_decl (tree, unsigned);
2356 /* Return the mode for data of a given size SIZE and mode class CLASS.
2357 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2358 The value is BLKmode if no other mode is found. This is like
2359 mode_for_size, but is passed a tree. */
2361 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
2363 /* Return an expr equal to X but certainly not valid as an lvalue. */
2365 extern tree non_lvalue (tree);
2366 extern tree pedantic_non_lvalue (tree);
2368 extern tree convert (tree, tree);
2369 extern unsigned int expr_align (tree);
2370 extern tree expr_first (tree);
2371 extern tree expr_last (tree);
2372 extern int expr_length (tree);
2373 extern tree size_in_bytes (tree);
2374 extern HOST_WIDE_INT int_size_in_bytes (tree);
2375 extern tree bit_position (tree);
2376 extern HOST_WIDE_INT int_bit_position (tree);
2377 extern tree byte_position (tree);
2378 extern HOST_WIDE_INT int_byte_position (tree);
2380 /* Define data structures, macros, and functions for handling sizes
2381 and the various types used to represent sizes. */
2385 SIZETYPE, /* Normal representation of sizes in bytes. */
2386 SSIZETYPE, /* Signed representation of sizes in bytes. */
2387 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2388 BITSIZETYPE, /* Normal representation of sizes in bits. */
2389 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2390 UBITSIZETYPE, /* Unsigned representation of sizes in bits. */
2393 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
2395 #define sizetype sizetype_tab[(int) SIZETYPE]
2396 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2397 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2398 #define usizetype sizetype_tab[(int) USIZETYPE]
2399 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2400 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2402 extern tree size_binop (enum tree_code, tree, tree);
2403 extern tree size_diffop (tree, tree);
2404 extern tree size_int_wide (HOST_WIDE_INT, enum size_type_kind);
2405 extern tree size_int_type_wide (HOST_WIDE_INT, tree);
2407 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2408 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2409 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2410 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2411 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2413 extern tree round_up (tree, int);
2414 extern tree round_down (tree, int);
2415 extern tree get_pending_sizes (void);
2416 extern int is_pending_size (tree);
2417 extern void put_pending_size (tree);
2418 extern void put_pending_sizes (tree);
2420 /* Type for sizes of data-type. */
2422 #define BITS_PER_UNIT_LOG \
2423 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2424 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2425 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2427 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2428 extern unsigned int maximum_field_alignment;
2430 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2431 extern unsigned int set_alignment;
2433 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2434 by making the last node in X point to Y.
2435 Returns X, except if X is 0 returns Y. */
2437 extern tree chainon (tree, tree);
2439 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2441 extern tree tree_cons (tree, tree, tree);
2443 /* Return the last tree node in a chain. */
2445 extern tree tree_last (tree);
2447 /* Reverse the order of elements in a chain, and return the new head. */
2449 extern tree nreverse (tree);
2451 /* Returns the length of a chain of nodes
2452 (number of chain pointers to follow before reaching a null pointer). */
2454 extern int list_length (tree);
2456 /* Returns the number of FIELD_DECLs in a type. */
2458 extern int fields_length (tree);
2460 /* Given an initializer INIT, return TRUE if INIT is zero or some
2461 aggregate of zeros. Otherwise return FALSE. */
2463 extern bool initializer_zerop (tree);
2465 /* Given an initializer INIT, return TRUE if INIT is at least 3/4 zeros.
2466 Otherwise return FALSE. */
2468 extern int mostly_zeros_p (tree);
2470 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2472 extern int integer_zerop (tree);
2474 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2476 extern int integer_onep (tree);
2478 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2479 all of whose significant bits are 1. */
2481 extern int integer_all_onesp (tree);
2483 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2484 exactly one bit 1. */
2486 extern int integer_pow2p (tree);
2488 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
2489 with a nonzero value. */
2491 extern int integer_nonzerop (tree);
2493 /* staticp (tree x) is nonzero if X is a reference to data allocated
2494 at a fixed address in memory. */
2496 extern int staticp (tree);
2498 /* Gets an error if argument X is not an lvalue.
2499 Also returns 1 if X is an lvalue, 0 if not. */
2501 extern int lvalue_or_else (tree, const char *);
2503 /* save_expr (EXP) returns an expression equivalent to EXP
2504 but it can be used multiple times within context CTX
2505 and only evaluate EXP once. */
2507 extern tree save_expr (tree);
2509 /* Look inside EXPR and into any simple arithmetic operations. Return
2510 the innermost non-arithmetic node. */
2512 extern tree skip_simple_arithmetic (tree);
2514 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
2515 SAVE_EXPR. Return FALSE otherwise. */
2517 extern bool saved_expr_p (tree);
2519 /* Returns the index of the first non-tree operand for CODE, or the number
2520 of operands if all are trees. */
2522 extern int first_rtl_op (enum tree_code);
2524 /* Return which tree structure is used by T. */
2526 enum tree_node_structure_enum tree_node_structure (tree);
2528 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2529 can be used multiple times and will evaluate EXP in its entirety
2532 extern tree unsave_expr (tree);
2534 /* Reset EXP in place so that it can be expanded again. Does not
2535 recurse into subtrees. */
2537 extern void unsave_expr_1 (tree);
2539 /* Return 0 if it is safe to evaluate EXPR multiple times,
2540 return 1 if it is safe if EXPR is unsaved afterward, or
2541 return 2 if it is completely unsafe. */
2542 extern int unsafe_for_reeval (tree);
2544 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2545 or offset that depends on a field within a record.
2547 Note that we only allow such expressions within simple arithmetic
2550 extern bool contains_placeholder_p (tree);
2552 /* This macro calls the above function but short-circuits the common
2553 case of a constant to save time. Also check for null. */
2555 #define CONTAINS_PLACEHOLDER_P(EXP) \
2556 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
2558 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
2559 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
2562 extern bool type_contains_placeholder_p (tree);
2564 /* Return 1 if EXP contains any expressions that produce cleanups for an
2565 outer scope to deal with. Used by fold. */
2567 extern int has_cleanups (tree);
2569 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2570 return a tree with all occurrences of references to F in a
2571 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2572 contains only arithmetic expressions. */
2574 extern tree substitute_in_expr (tree, tree, tree);
2576 /* variable_size (EXP) is like save_expr (EXP) except that it
2577 is for the special case of something that is part of a
2578 variable size for a data type. It makes special arrangements
2579 to compute the value at the right time when the data type
2580 belongs to a function parameter. */
2582 extern tree variable_size (tree);
2584 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2585 but it can be used multiple times
2586 and only evaluate the subexpressions once. */
2588 extern tree stabilize_reference (tree);
2590 /* Subroutine of stabilize_reference; this is called for subtrees of
2591 references. Any expression with side-effects must be put in a SAVE_EXPR
2592 to ensure that it is only evaluated once. */
2594 extern tree stabilize_reference_1 (tree);
2596 /* Return EXP, stripped of any conversions to wider types
2597 in such a way that the result of converting to type FOR_TYPE
2598 is the same as if EXP were converted to FOR_TYPE.
2599 If FOR_TYPE is 0, it signifies EXP's type. */
2601 extern tree get_unwidened (tree, tree);
2603 /* Return OP or a simpler expression for a narrower value
2604 which can be sign-extended or zero-extended to give back OP.
2605 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2606 or 0 if the value should be sign-extended. */
2608 extern tree get_narrower (tree, int *);
2610 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2611 look for nested component-refs or array-refs at constant positions
2612 and find the ultimate containing object, which is returned. */
2614 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
2615 tree *, enum machine_mode *, int *, int *);
2617 /* Return 1 if T is an expression that get_inner_reference handles. */
2619 extern int handled_component_p (tree);
2621 /* Given a DECL or TYPE, return the scope in which it was declared, or
2622 NUL_TREE if there is no containing scope. */
2624 extern tree get_containing_scope (tree);
2626 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2628 extern tree decl_function_context (tree);
2630 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2631 this _DECL with its context, or zero if none. */
2632 extern tree decl_type_context (tree);
2634 /* Given the FUNCTION_DECL for the current function,
2635 return zero if it is ok for this function to be inline.
2636 Otherwise return a warning message with a single %s
2637 for the function's name. */
2639 extern const char *function_cannot_inline_p (tree);
2641 /* Return 1 if EXPR is the real constant zero. */
2642 extern int real_zerop (tree);
2644 /* Declare commonly used variables for tree structure. */
2646 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2647 Zero means allow extended lvalues. */
2649 extern int pedantic_lvalues;
2651 /* Nonzero means can safely call expand_expr now;
2652 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2654 extern int immediate_size_expand;
2656 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2658 extern GTY(()) tree current_function_decl;
2660 /* Nonzero means a FUNC_BEGIN label was emitted. */
2661 extern GTY(()) tree current_function_func_begin_label;
2663 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2665 extern int all_types_permanent;
2667 /* Exit a binding level. This function is provided by each language
2669 extern tree poplevel (int, int, int);
2671 /* Declare a predefined function. Return the declaration. This function is
2672 provided by each language frontend. */
2673 extern tree builtin_function (const char *, tree, int, enum built_in_class,
2674 const char *, tree);
2677 extern unsigned crc32_string (unsigned, const char *);
2678 extern void clean_symbol_name (char *);
2679 extern tree get_file_function_name_long (const char *);
2680 extern tree get_set_constructor_bits (tree, char *, int);
2681 extern tree get_set_constructor_bytes (tree, unsigned char *, int);
2682 extern tree get_callee_fndecl (tree);
2683 extern void set_decl_assembler_name (tree);
2684 extern int type_num_arguments (tree);
2685 extern tree lhd_unsave_expr_now (tree);
2690 extern void expand_fixups (rtx);
2691 extern tree expand_start_stmt_expr (int);
2692 extern tree expand_end_stmt_expr (tree);
2693 extern void expand_expr_stmt (tree);
2694 extern void expand_expr_stmt_value (tree, int, int);
2695 extern int warn_if_unused_value (tree);
2696 extern void expand_decl_init (tree);
2697 extern void clear_last_expr (void);
2698 extern void expand_label (tree);
2699 extern void expand_goto (tree);
2700 extern void expand_asm (tree, int);
2701 extern void expand_start_cond (tree, int);
2702 extern void expand_end_cond (void);
2703 extern void expand_start_else (void);
2704 extern void expand_start_elseif (tree);
2705 extern struct nesting *expand_start_loop (int);
2706 extern struct nesting *expand_start_loop_continue_elsewhere (int);
2707 extern struct nesting *expand_start_null_loop (void);
2708 extern void expand_loop_continue_here (void);
2709 extern void expand_end_loop (void);
2710 extern void expand_end_null_loop (void);
2711 extern int expand_continue_loop (struct nesting *);
2712 extern int expand_exit_loop (struct nesting *);
2713 extern int expand_exit_loop_if_false (struct nesting *,tree);
2714 extern int expand_exit_loop_top_cond (struct nesting *, tree);
2715 extern int expand_exit_something (void);
2717 extern void expand_return (tree);
2718 extern int optimize_tail_recursion (tree, rtx);
2719 extern void expand_start_bindings_and_block (int, tree);
2720 #define expand_start_bindings(flags) \
2721 expand_start_bindings_and_block(flags, NULL_TREE)
2722 extern void expand_end_bindings (tree, int, int);
2723 extern void warn_about_unused_variables (tree);
2724 extern void start_cleanup_deferral (void);
2725 extern void end_cleanup_deferral (void);
2726 extern int is_body_block (tree);
2728 extern int conditional_context (void);
2729 extern struct nesting * current_nesting_level (void);
2730 extern tree last_cleanup_this_contour (void);
2731 extern void expand_start_case (int, tree, tree, const char *);
2732 extern void expand_end_case_type (tree, tree);
2733 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
2734 extern int add_case_node (tree, tree, tree, tree *);
2735 extern int pushcase (tree, tree (*) (tree, tree), tree, tree *);
2736 extern int pushcase_range (tree, tree, tree (*) (tree, tree), tree, tree *);
2737 extern void using_eh_for_cleanups (void);
2739 /* In fold-const.c */
2741 /* Fold constants as much as possible in an expression.
2742 Returns the simplified expression.
2743 Acts only on the top level of the expression;
2744 if the argument itself cannot be simplified, its
2745 subexpressions are not changed. */
2747 extern tree fold (tree);
2748 extern tree fold_initializer (tree);
2749 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
2751 extern int force_fit_type (tree, int);
2752 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2753 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2754 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2755 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2756 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2757 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2758 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2759 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2760 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2761 HOST_WIDE_INT, unsigned int,
2762 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
2763 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2764 HOST_WIDE_INT, unsigned int,
2765 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
2766 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2767 HOST_WIDE_INT, unsigned int,
2768 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2769 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2770 HOST_WIDE_INT, unsigned int,
2771 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
2773 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
2774 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
2775 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
2776 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
2779 extern int operand_equal_p (tree, tree, int);
2780 extern tree omit_one_operand (tree, tree, tree);
2781 extern tree invert_truthvalue (tree);
2784 extern tree fold_builtin (tree);
2785 extern enum built_in_function builtin_mathfn_code (tree);
2786 extern tree build_function_call_expr (tree, tree);
2787 extern tree mathfn_built_in (tree, enum built_in_function fn);
2790 extern tree strip_float_extensions (tree);
2793 extern void record_component_aliases (tree);
2794 extern HOST_WIDE_INT get_alias_set (tree);
2795 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
2796 extern int readonly_fields_p (tree);
2797 extern int objects_must_conflict_p (tree, tree);
2800 extern int really_constant_p (tree);
2801 extern int int_fits_type_p (tree, tree);
2802 extern bool variably_modified_type_p (tree);
2803 extern int tree_log2 (tree);
2804 extern int tree_floor_log2 (tree);
2805 extern int simple_cst_equal (tree, tree);
2806 extern unsigned int iterative_hash_expr (tree, unsigned int);
2807 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
2808 extern int type_list_equal (tree, tree);
2809 extern int chain_member (tree, tree);
2810 extern tree type_hash_lookup (unsigned int, tree);
2811 extern void type_hash_add (unsigned int, tree);
2812 extern unsigned int type_hash_list (tree);
2813 extern int simple_cst_list_equal (tree, tree);
2814 extern void dump_tree_statistics (void);
2815 extern void expand_function_end (void);
2816 extern void expand_function_start (tree, int);
2817 extern void expand_pending_sizes (tree);
2819 extern int real_onep (tree);
2820 extern int real_twop (tree);
2821 extern int real_minus_onep (tree);
2822 extern void init_ttree (void);
2823 extern void build_common_tree_nodes (int);
2824 extern void build_common_tree_nodes_2 (int);
2825 extern tree build_range_type (tree, tree, tree);
2828 extern void setjmp_protect_args (void);
2829 extern void setjmp_protect (tree);
2830 extern void expand_main_function (void);
2831 extern void init_dummy_function_start (void);
2832 extern void expand_dummy_function_end (void);
2833 extern void init_function_for_compilation (void);
2834 extern void init_function_start (tree);
2835 extern void assign_parms (tree);
2836 extern void put_var_into_stack (tree, int);
2837 extern void flush_addressof (tree);
2838 extern void uninitialized_vars_warning (tree);
2839 extern void setjmp_args_warning (void);
2840 extern void mark_all_temps_used (void);
2841 extern void init_temp_slots (void);
2842 extern void combine_temp_slots (void);
2843 extern void free_temp_slots (void);
2844 extern void pop_temp_slots (void);
2845 extern void push_temp_slots (void);
2846 extern void preserve_temp_slots (rtx);
2847 extern void preserve_rtl_expr_temps (tree);
2848 extern int aggregate_value_p (tree);
2849 extern void free_temps_for_rtl_expr (tree);
2850 extern void instantiate_virtual_regs (tree, rtx);
2851 extern void unshare_all_rtl (tree, rtx);
2852 extern void push_function_context (void);
2853 extern void pop_function_context (void);
2854 extern void push_function_context_to (tree);
2855 extern void pop_function_context_from (tree);
2857 /* In print-rtl.c */
2859 extern void print_rtl (FILE *, rtx);
2862 /* In print-tree.c */
2863 extern void debug_tree (tree);
2865 extern void print_node (FILE *, const char *, tree, int);
2866 extern void print_node_brief (FILE *, const char *, tree, int);
2867 extern void indent_to (FILE *, int);
2871 extern int apply_args_register_offset (int);
2872 extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx);
2873 extern void check_max_integer_computation_mode (tree);
2876 extern void start_sequence_for_rtl_expr (tree);
2877 extern rtx emit_line_note (location_t);
2881 /* Nonzero if this is a call to a `const' function. */
2883 /* Nonzero if this is a call to a `volatile' function. */
2884 #define ECF_NORETURN 2
2885 /* Nonzero if this is a call to malloc or a related function. */
2886 #define ECF_MALLOC 4
2887 /* Nonzero if it is plausible that this is a call to alloca. */
2888 #define ECF_MAY_BE_ALLOCA 8
2889 /* Nonzero if this is a call to a function that won't throw an exception. */
2890 #define ECF_NOTHROW 16
2891 /* Nonzero if this is a call to setjmp or a related function. */
2892 #define ECF_RETURNS_TWICE 32
2893 /* Nonzero if this is a call to `longjmp'. */
2894 #define ECF_LONGJMP 64
2895 /* Nonzero if this is a syscall that makes a new process in the image of
2897 #define ECF_FORK_OR_EXEC 128
2898 #define ECF_SIBCALL 256
2899 /* Nonzero if this is a call to "pure" function (like const function,
2900 but may read memory. */
2901 #define ECF_PURE 512
2902 /* Nonzero if this is a call to a function that returns with the stack
2903 pointer depressed. */
2904 #define ECF_SP_DEPRESSED 1024
2905 /* Nonzero if this call is known to always return. */
2906 #define ECF_ALWAYS_RETURN 2048
2907 /* Create libcall block around the call. */
2908 #define ECF_LIBCALL_BLOCK 4096
2910 extern int flags_from_decl_or_type (tree);
2912 extern int setjmp_call_p (tree);
2913 extern bool alloca_call_p (tree);
2917 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
2918 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
2919 it should be modified in place; if a TYPE, a copy should be created
2920 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
2921 information, in the form of a bitwise OR of flags in enum attribute_flags
2922 from tree.h. Depending on these flags, some attributes may be
2923 returned to be applied at a later stage (for example, to apply
2924 a decl attribute to the declaration rather than to its type). */
2925 extern tree decl_attributes (tree *, tree, int);
2927 /* In integrate.c */
2928 extern void save_for_inline (tree);
2929 extern void set_decl_abstract_flags (tree, int);
2930 extern void output_inline_function (tree);
2931 extern void set_decl_origin_self (tree);
2933 /* In stor-layout.c */
2934 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
2935 extern void fixup_signed_type (tree);
2936 extern void internal_reference_types (void);
2939 extern void make_decl_rtl (tree, const char *);
2940 extern void make_decl_one_only (tree);
2941 extern int supports_one_only (void);
2942 extern void variable_section (tree, int);
2943 enum tls_model decl_tls_model (tree);
2944 enum symbol_visibility decl_visibility (tree);
2945 extern void resolve_unique_section (tree, int, int);
2946 extern void mark_referenced (tree);
2947 extern void notice_global_symbol (tree);
2950 extern void emit_nop (void);
2951 extern void expand_computed_goto (tree);
2952 extern bool parse_output_constraint (const char **, int, int, int,
2953 bool *, bool *, bool *);
2954 extern void expand_asm_operands (tree, tree, tree, tree, int,
2956 extern tree resolve_asm_operand_names (tree, tree, tree);
2957 extern int any_pending_cleanups (void);
2958 extern void init_stmt_for_function (void);
2959 extern void expand_start_target_temps (void);
2960 extern void expand_end_target_temps (void);
2961 extern void expand_elseif (tree);
2962 extern void save_stack_pointer (void);
2963 extern void expand_decl (tree);
2964 extern int expand_decl_cleanup (tree, tree);
2965 extern int expand_decl_cleanup_eh (tree, tree, int);
2966 extern void expand_anon_union_decl (tree, tree, tree);
2967 extern void expand_start_case_dummy (void);
2968 extern HOST_WIDE_INT all_cases_count (tree, int *);
2969 extern void check_for_full_enumeration_handling (tree);
2970 extern void declare_nonlocal_label (tree);
2972 /* If KIND=='I', return a suitable global initializer (constructor) name.
2973 If KIND=='D', return a suitable global clean-up (destructor) name. */
2974 extern tree get_file_function_name (int);
2976 /* Interface of the DWARF2 unwind info support. */
2978 /* Generate a new label for the CFI info to refer to. */
2980 extern char *dwarf2out_cfi_label (void);
2982 /* Entry point to update the canonical frame address (CFA). */
2984 extern void dwarf2out_def_cfa (const char *, unsigned, long);
2986 /* Add the CFI for saving a register window. */
2988 extern void dwarf2out_window_save (const char *);
2990 /* Add a CFI to update the running total of the size of arguments pushed
2993 extern void dwarf2out_args_size (const char *, long);
2995 /* Entry point for saving a register to the stack. */
2997 extern void dwarf2out_reg_save (const char *, unsigned, long);
2999 /* Entry point for saving the return address in the stack. */
3001 extern void dwarf2out_return_save (const char *, long);
3003 /* Entry point for saving the return address in a register. */
3005 extern void dwarf2out_return_reg (const char *, unsigned);
3007 /* The type of a function that walks over tree structure. */
3009 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3011 /* In tree-dump.c */
3013 /* Different tree dump places. When you add new tree dump places,
3014 extend the DUMP_FILES array in tree-dump.c */
3015 enum tree_dump_index
3017 TDI_all, /* dump the whole translation unit */
3018 TDI_class, /* dump class hierarchy */
3019 TDI_original, /* dump each function before optimizing it */
3020 TDI_optimized, /* dump each function after optimizing it */
3021 TDI_inlined, /* dump each function after inlining
3026 /* Bit masks to control tree dumping. Not all values are applicable to
3027 all tree dumps. Add new ones at the end. When you define new
3028 values, extend the DUMP_OPTIONS array in tree-dump.c */
3029 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3030 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3032 typedef struct dump_info *dump_info_p;
3034 extern int dump_flag (dump_info_p, int, tree);
3035 extern int dump_enabled_p (enum tree_dump_index);
3036 extern FILE *dump_begin (enum tree_dump_index, int *);
3037 extern void dump_end (enum tree_dump_index, FILE *);
3038 extern void dump_node (tree, int, FILE *);
3039 extern int dump_switch_p (const char *);
3040 extern const char *dump_flag_name (enum tree_dump_index);
3041 /* Assign the RTX to declaration. */
3043 extern void set_decl_rtl (tree, rtx);
3045 /* Redefine abort to report an internal error w/o coredump, and
3046 reporting the location of the error in the source file. This logic
3047 is duplicated in rtl.h and tree.h because every file that needs the
3048 special abort includes one or both. toplev.h gets too few files,
3049 system.h gets too many. */
3051 extern void fancy_abort (const char *, int, const char *)
3053 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3055 /* Enum and arrays used for tree allocation stats.
3056 Keep in sync with tree.c:tree_node_kind_names. */
3076 extern int tree_node_counts[];
3077 extern int tree_node_sizes[];
3079 #endif /* GCC_TREE_H */
OSDN Git Service
