1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
27 #include "statistics.h"
30 /* Codes of tree nodes */
32 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
37 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
43 /* Number of language-independent tree codes. */
44 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
46 /* Indexed by enum tree_code, contains a character which is
47 `<' for a comparison expression, `1', for a unary arithmetic
48 expression, `2' for a binary arithmetic expression, `e' for
49 other types of expressions, `r' for a reference, `c' for a
50 constant, `d' for a decl, `t' for a type, `s' for a statement,
51 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
53 #define MAX_TREE_CODES 256
54 extern const char tree_code_type[];
55 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
57 /* Returns nonzero iff CLASS is not the tree code of a type. */
59 #define IS_NON_TYPE_CODE_CLASS(CLASS) (strchr ("xbcdr<12se", (CLASS)) != 0)
61 /* Returns nonzero iff CLASS is the tree-code class of an
64 #define IS_EXPR_CODE_CLASS(CLASS) (strchr ("<12ers", (CLASS)) != 0)
66 /* Returns nonzero iff NODE is an expression of some kind. */
68 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
70 /* Number of argument-words in each kind of tree-node. */
72 extern const unsigned char tree_code_length[];
73 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
75 /* Names of tree components. */
77 extern const char *const tree_code_name[];
79 /* A vector of trees. */
83 /* Classify which part of the compiler has defined a given builtin function.
84 Note that we assume below that this is no more than two bits. */
93 /* Names for the above. */
94 extern const char *const built_in_class_names[4];
96 /* Codes that identify the various built in functions
97 so that expand_call can identify them quickly. */
99 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM,
100 enum built_in_function
102 #include "builtins.def"
104 /* Upper bound on non-language-specific builtins. */
109 /* Names for the above. */
110 extern const char *const built_in_names[(int) END_BUILTINS];
112 /* Helper macros for math builtins. */
114 #define BUILTIN_EXP10_P(FN) \
115 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
116 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
118 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
119 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
120 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
122 #define BUILTIN_SQRT_P(FN) \
123 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
125 #define BUILTIN_CBRT_P(FN) \
126 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
128 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
130 /* An array of _DECL trees for the above. */
131 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
132 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
134 /* The definition of tree nodes fills the next several pages. */
136 /* A tree node can represent a data type, a variable, an expression
137 or a statement. Each node has a TREE_CODE which says what kind of
138 thing it represents. Some common codes are:
139 INTEGER_TYPE -- represents a type of integers.
140 ARRAY_TYPE -- represents a type of pointer.
141 VAR_DECL -- represents a declared variable.
142 INTEGER_CST -- represents a constant integer value.
143 PLUS_EXPR -- represents a sum (an expression).
145 As for the contents of a tree node: there are some fields
146 that all nodes share. Each TREE_CODE has various special-purpose
147 fields as well. The fields of a node are never accessed directly,
148 always through accessor macros. */
150 /* Every kind of tree node starts with this structure,
151 so all nodes have these fields.
153 See the accessor macros, defined below, for documentation of the
157 struct tree_common GTY(())
161 union tree_ann_d *ann;
163 ENUM_BITFIELD(tree_code) code : 8;
165 unsigned side_effects_flag : 1;
166 unsigned constant_flag : 1;
167 unsigned addressable_flag : 1;
168 unsigned volatile_flag : 1;
169 unsigned readonly_flag : 1;
170 unsigned unsigned_flag : 1;
171 unsigned asm_written_flag: 1;
172 unsigned nowarning_flag : 1;
174 unsigned used_flag : 1;
175 unsigned nothrow_flag : 1;
176 unsigned static_flag : 1;
177 unsigned public_flag : 1;
178 unsigned private_flag : 1;
179 unsigned protected_flag : 1;
180 unsigned deprecated_flag : 1;
181 unsigned invariant_flag : 1;
183 unsigned lang_flag_0 : 1;
184 unsigned lang_flag_1 : 1;
185 unsigned lang_flag_2 : 1;
186 unsigned lang_flag_3 : 1;
187 unsigned lang_flag_4 : 1;
188 unsigned lang_flag_5 : 1;
189 unsigned lang_flag_6 : 1;
190 unsigned visited : 1;
193 /* The following table lists the uses of each of the above flags and
194 for which types of nodes they are defined. Note that expressions
200 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
201 ..._TYPE, IDENTIFIER_NODE.
202 In a STMT_EXPR, it means we want the result of the enclosed
204 CALL_EXPR_TAILCALL in CALL_EXPR
209 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
212 TREE_CONSTANT_OVERFLOW in
213 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
214 TREE_SYMBOL_REFERENCED in
217 TARGET_EXPR, WITH_CLEANUP_EXPR
220 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
221 TYPE_REF_CAN_ALIAS_ALL in
222 POINTER_TYPE, REFERENCE_TYPE
227 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
228 ??? and other expressions?
230 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
232 TREE_LIST or TREE_VEC
240 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
243 PARM_DECL, RESULT_DECL
265 TREE_THIS_VOLATILE in
290 BIT_FIELD_REF_UNSIGNED in
296 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
302 expressions, IDENTIFIER_NODE
307 CALL_EXPR, FUNCTION_DECL
313 INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
322 Used in tree traversals to mark visited nodes.
335 /* Define accessors for the fields that all tree nodes have
336 (though some fields are not used for all kinds of nodes). */
338 /* The tree-code says what kind of node it is.
339 Codes are defined in tree.def. */
340 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
341 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
343 /* When checking is enabled, errors will be generated if a tree node
344 is accessed incorrectly. The macros abort with a fatal error. */
345 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
347 #define TREE_CHECK(T, CODE) __extension__ \
348 ({ const tree __t = (T); \
349 if (TREE_CODE (__t) != (CODE)) \
350 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
354 #define TREE_NOT_CHECK(T, CODE) __extension__ \
355 ({ const tree __t = (T); \
356 if (TREE_CODE (__t) == (CODE)) \
357 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
361 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
362 ({ const tree __t = (T); \
363 if (TREE_CODE (__t) != (CODE1) \
364 && TREE_CODE (__t) != (CODE2)) \
365 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
366 (CODE1), (CODE2), 0); \
369 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
370 ({ const tree __t = (T); \
371 if (TREE_CODE (__t) == (CODE1) \
372 || TREE_CODE (__t) == (CODE2)) \
373 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
374 (CODE1), (CODE2), 0); \
377 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
378 ({ const tree __t = (T); \
379 if (TREE_CODE (__t) != (CODE1) \
380 && TREE_CODE (__t) != (CODE2) \
381 && TREE_CODE (__t) != (CODE3)) \
382 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
383 (CODE1), (CODE2), (CODE3), 0); \
386 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
387 ({ const tree __t = (T); \
388 if (TREE_CODE (__t) == (CODE1) \
389 || TREE_CODE (__t) == (CODE2) \
390 || TREE_CODE (__t) == (CODE3)) \
391 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
392 (CODE1), (CODE2), (CODE3), 0); \
395 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
396 ({ const tree __t = (T); \
397 if (TREE_CODE (__t) != (CODE1) \
398 && TREE_CODE (__t) != (CODE2) \
399 && TREE_CODE (__t) != (CODE3) \
400 && TREE_CODE (__t) != (CODE4)) \
401 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
402 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
405 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
406 ({ const tree __t = (T); \
407 if (TREE_CODE (__t) == (CODE1) \
408 || TREE_CODE (__t) == (CODE2) \
409 || TREE_CODE (__t) == (CODE3) \
410 || TREE_CODE (__t) == (CODE4)) \
411 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
412 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
415 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
416 ({ const tree __t = (T); \
417 if (TREE_CODE (__t) != (CODE1) \
418 && TREE_CODE (__t) != (CODE2) \
419 && TREE_CODE (__t) != (CODE3) \
420 && TREE_CODE (__t) != (CODE4) \
421 && TREE_CODE (__t) != (CODE5)) \
422 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
423 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
426 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
427 ({ const tree __t = (T); \
428 if (TREE_CODE (__t) == (CODE1) \
429 || TREE_CODE (__t) == (CODE2) \
430 || TREE_CODE (__t) == (CODE3) \
431 || TREE_CODE (__t) == (CODE4) \
432 || TREE_CODE (__t) == (CODE5)) \
433 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
434 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
437 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
438 ({ const tree __t = (T); \
439 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
440 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
444 /* These checks have to be special cased. */
445 #define EXPR_CHECK(T) __extension__ \
446 ({ const tree __t = (T); \
447 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
448 if (!IS_EXPR_CODE_CLASS (__c)) \
449 tree_class_check_failed (__t, 'E', __FILE__, __LINE__, \
453 /* These checks have to be special cased. */
454 #define NON_TYPE_CHECK(T) __extension__ \
455 ({ const tree __t = (T); \
456 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
457 if (!IS_NON_TYPE_CODE_CLASS (__c)) \
458 tree_class_check_failed (__t, 'T', __FILE__, __LINE__, \
462 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
463 (*({const tree __t = (T); \
464 const int __i = (I); \
465 if (TREE_CODE (__t) != TREE_VEC) \
466 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
468 if (__i < 0 || __i >= __t->vec.length) \
469 tree_vec_elt_check_failed (__i, __t->vec.length, \
470 __FILE__, __LINE__, __FUNCTION__); \
471 &__t->vec.a[__i]; }))
473 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
474 (*({const tree __t = t; \
475 const int __i = (i); \
476 if (TREE_CODE (__t) != PHI_NODE) \
477 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
479 if (__i < 0 || __i >= __t->phi.capacity) \
480 phi_node_elt_check_failed (__i, __t->phi.num_args, \
481 __FILE__, __LINE__, __FUNCTION__); \
482 &__t->phi.a[__i]; }))
484 /* Special checks for TREE_OPERANDs. */
485 #define TREE_OPERAND_CHECK(T, I) __extension__ \
486 (*({const tree __t = EXPR_CHECK (T); \
487 const int __i = (I); \
488 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
489 tree_operand_check_failed (__i, TREE_CODE (__t), \
490 __FILE__, __LINE__, __FUNCTION__); \
491 &__t->exp.operands[__i]; }))
493 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
494 (*({const tree __t = (T); \
495 const int __i = (I); \
496 if (TREE_CODE (__t) != CODE) \
497 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
498 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
499 tree_operand_check_failed (__i, (CODE), \
500 __FILE__, __LINE__, __FUNCTION__); \
501 &__t->exp.operands[__i]; }))
503 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
505 ({const tree __t = (T); \
506 const int __i = (I); \
507 if (TREE_CODE (__t) != (CODE)) \
508 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
509 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
510 tree_operand_check_failed (__i, (CODE), \
511 __FILE__, __LINE__, __FUNCTION__); \
512 &__t->exp.operands[__i]; }))
514 extern void tree_check_failed (const tree, const char *, int, const char *,
515 ...) ATTRIBUTE_NORETURN;
516 extern void tree_not_check_failed (const tree, const char *, int, const char *,
517 ...) ATTRIBUTE_NORETURN;
518 extern void tree_class_check_failed (const tree, int,
519 const char *, int, const char *)
521 extern void tree_vec_elt_check_failed (int, int, const char *,
524 extern void phi_node_elt_check_failed (int, int, const char *,
527 extern void tree_operand_check_failed (int, enum tree_code,
528 const char *, int, const char *)
531 #else /* not ENABLE_TREE_CHECKING, or not gcc */
533 #define TREE_CHECK(T, CODE) (T)
534 #define TREE_NOT_CHECK(T, CODE) (T)
535 #define TREE_CHECK2(T, CODE1, CODE2) (T)
536 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
537 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
538 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
539 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
540 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
541 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
542 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
543 #define TREE_CLASS_CHECK(T, CODE) (T)
544 #define EXPR_CHECK(T) (T)
545 #define NON_TYPE_CHECK(T) (T)
546 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
547 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
548 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
549 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
550 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
554 #define TREE_BLOCK(NODE) ((NODE)->exp.block)
556 #include "tree-check.h"
558 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't')
559 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd')
560 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c')
561 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's')
562 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
563 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
565 #define SET_OR_ARRAY_CHECK(T) \
566 TREE_CHECK2 (T, ARRAY_TYPE, SET_TYPE)
568 #define RECORD_OR_UNION_CHECK(T) \
569 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
570 #define NOT_RECORD_OR_UNION_CHECK(T) \
571 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
573 #define NUMERICAL_TYPE_CHECK(T) \
574 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \
575 CHAR_TYPE, REAL_TYPE)
577 /* In all nodes that are expressions, this is the data type of the expression.
578 In POINTER_TYPE nodes, this is the type that the pointer points to.
579 In ARRAY_TYPE nodes, this is the type of the elements.
580 In VECTOR_TYPE nodes, this is the type of the elements. */
581 #define TREE_TYPE(NODE) ((NODE)->common.type)
583 /* Here is how primitive or already-canonicalized types' hash codes
585 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
587 /* A simple hash function for an arbitrary tree node. This must not be
588 used in hash tables which are saved to a PCH. */
589 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
591 /* Nodes are chained together for many purposes.
592 Types are chained together to record them for being output to the debugger
593 (see the function `chain_type').
594 Decls in the same scope are chained together to record the contents
596 Statement nodes for successive statements used to be chained together.
597 Often lists of things are represented by TREE_LIST nodes that
598 are chained together. */
600 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
602 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
603 that don't change the machine mode. */
605 #define STRIP_NOPS(EXP) \
606 while ((TREE_CODE (EXP) == NOP_EXPR \
607 || TREE_CODE (EXP) == CONVERT_EXPR \
608 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
609 && TREE_OPERAND (EXP, 0) != error_mark_node \
610 && (TYPE_MODE (TREE_TYPE (EXP)) \
611 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
612 (EXP) = TREE_OPERAND (EXP, 0)
614 /* Like STRIP_NOPS, but don't let the signedness change either. */
616 #define STRIP_SIGN_NOPS(EXP) \
617 while ((TREE_CODE (EXP) == NOP_EXPR \
618 || TREE_CODE (EXP) == CONVERT_EXPR \
619 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
620 && TREE_OPERAND (EXP, 0) != error_mark_node \
621 && (TYPE_MODE (TREE_TYPE (EXP)) \
622 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
623 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
624 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
625 (EXP) = TREE_OPERAND (EXP, 0)
627 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */
629 #define STRIP_MAIN_TYPE_NOPS(EXP) \
630 while ((TREE_CODE (EXP) == NOP_EXPR \
631 || TREE_CODE (EXP) == CONVERT_EXPR \
632 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
633 && TREE_OPERAND (EXP, 0) != error_mark_node \
634 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \
635 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
636 (EXP) = TREE_OPERAND (EXP, 0)
638 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
640 #define STRIP_TYPE_NOPS(EXP) \
641 while ((TREE_CODE (EXP) == NOP_EXPR \
642 || TREE_CODE (EXP) == CONVERT_EXPR \
643 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
644 && TREE_OPERAND (EXP, 0) != error_mark_node \
645 && (TREE_TYPE (EXP) \
646 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
647 (EXP) = TREE_OPERAND (EXP, 0)
649 /* Remove unnecessary type conversions according to
650 tree_ssa_useless_type_conversion. */
652 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
653 while (tree_ssa_useless_type_conversion (EXP)) \
654 EXP = TREE_OPERAND (EXP, 0)
656 /* Nonzero if TYPE represents an integral type. Note that we do not
657 include COMPLEX types here. */
659 #define INTEGRAL_TYPE_P(TYPE) \
660 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
661 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
663 /* Nonzero if TYPE represents a scalar floating-point type. */
665 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
667 /* Nonzero if TYPE represents a complex floating-point type. */
669 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
670 (TREE_CODE (TYPE) == COMPLEX_TYPE \
671 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
673 /* Nonzero if TYPE represents a floating-point type, including complex
674 floating-point types. */
676 #define FLOAT_TYPE_P(TYPE) \
677 (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE))
679 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
681 #define AGGREGATE_TYPE_P(TYPE) \
682 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
683 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
684 || TREE_CODE (TYPE) == SET_TYPE)
686 /* Nonzero if TYPE represents a pointer or reference type.
687 (It should be renamed to INDIRECT_TYPE_P.) */
689 #define POINTER_TYPE_P(TYPE) \
690 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
692 /* Nonzero if this type is a complete type. */
693 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
695 /* Nonzero if this type is the (possibly qualified) void type. */
696 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
698 /* Nonzero if this type is complete or is cv void. */
699 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
700 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
702 /* Nonzero if this type is complete or is an array with unspecified bound. */
703 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
704 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
706 /* Nonzero if TYPE represents a type. */
708 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
710 /* Define many boolean fields that all tree nodes have. */
712 /* In VAR_DECL nodes, nonzero means address of this is needed.
713 So it cannot be in a register.
714 In a FUNCTION_DECL, nonzero means its address is needed.
715 So it must be compiled even if it is an inline function.
716 In a FIELD_DECL node, it means that the programmer is permitted to
717 construct the address of this field. This is used for aliasing
718 purposes: see record_component_aliases.
719 In CONSTRUCTOR nodes, it means object constructed must be in memory.
720 In LABEL_DECL nodes, it means a goto for this label has been seen
721 from a place outside all binding contours that restore stack levels.
722 In ..._TYPE nodes, it means that objects of this type must
723 be fully addressable. This means that pieces of this
724 object cannot go into register parameters, for example.
725 In IDENTIFIER_NODEs, this means that some extern decl for this name
726 had its address taken. That matters for inline functions. */
727 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
729 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
731 /* In a VAR_DECL, nonzero means allocate static storage.
732 In a FUNCTION_DECL, nonzero if function has been defined.
733 In a CONSTRUCTOR, nonzero means allocate static storage.
735 ??? This is also used in lots of other nodes in unclear ways which
736 should be cleaned up some day. */
737 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
739 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
740 should only be executed if an exception is thrown, not on normal exit
742 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
744 /* In an expr node (usually a conversion) this means the node was made
745 implicitly and should not lead to any sort of warning. */
746 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
748 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
749 there was an overflow in folding. This is distinct from
750 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
751 occur in constant expressions. */
752 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
754 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
755 this string as an argument. */
756 #define TREE_SYMBOL_REFERENCED(NODE) \
757 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
759 /* Nonzero in a pointer or reference type means the data pointed to
760 by this type can alias anything. */
761 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
762 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
764 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
765 there was an overflow in folding, and no warning has been issued
766 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
769 ??? Apparently, lots of code assumes this is defined in all
771 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
773 /* In a VAR_DECL or FUNCTION_DECL,
774 nonzero means name is to be accessible from outside this module.
775 In an IDENTIFIER_NODE, nonzero means an external declaration
776 accessible from outside this module was previously seen
777 for this name in an inner scope. */
778 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
780 /* In any expression, decl, or constant, nonzero means it has side effects or
781 reevaluation of the whole expression could produce a different value.
782 This is set if any subexpression is a function call, a side effect or a
783 reference to a volatile variable. In a ..._DECL, this is set only if the
784 declaration said `volatile'. This will never be set for a constant. */
785 #define TREE_SIDE_EFFECTS(NODE) \
786 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
788 /* In a LABEL_DECL, nonzero means this label had its address taken
789 and therefore can never be deleted and is a jump target for
791 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
793 /* Nonzero means this expression is volatile in the C sense:
794 its address should be of type `volatile WHATEVER *'.
795 In other words, the declared item is volatile qualified.
796 This is used in _DECL nodes and _REF nodes.
798 In a ..._TYPE node, means this type is volatile-qualified.
799 But use TYPE_VOLATILE instead of this macro when the node is a type,
800 because eventually we may make that a different bit.
802 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
803 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
805 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
806 accessing the memory pointed to won't generate a trap. However,
807 this only applies to an object when used appropriately: it doesn't
808 mean that writing a READONLY mem won't trap.
810 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
811 (or slice of the array) always belongs to the range of the array.
812 I.e. that the access will not trap, provided that the access to
813 the base to the array will not trap. */
814 #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag)
816 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
817 nonzero means it may not be the lhs of an assignment. */
818 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
820 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
821 #define TREE_READONLY_DECL_P(NODE) (DECL_P (NODE) && TREE_READONLY (NODE))
823 /* Value of expression is constant. Always on in all ..._CST nodes. May
824 also appear in an expression or decl where the value is constant. */
825 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
827 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
828 #define DECL_UNSIGNED(NODE) (DECL_CHECK (NODE)->common.unsigned_flag)
830 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
831 #define BIT_FIELD_REF_UNSIGNED(NODE) \
832 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
834 /* In integral and pointer types, means an unsigned type. */
835 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
837 #define TYPE_TRAP_SIGNED(NODE) \
838 (flag_trapv && ! TYPE_UNSIGNED (NODE))
840 /* Nonzero in a VAR_DECL means assembler code has been written.
841 Nonzero in a FUNCTION_DECL means that the function has been compiled.
842 This is interesting in an inline function, since it might not need
843 to be compiled separately.
844 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
845 if the sdb debugging info for the type has been written.
846 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
847 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
849 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
851 /* Nonzero in a _DECL if the name is used in its scope.
852 Nonzero in an expr node means inhibit warning if value is unused.
853 In IDENTIFIER_NODEs, this means that some extern decl for this name
855 #define TREE_USED(NODE) ((NODE)->common.used_flag)
857 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
858 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
859 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
861 /* In a CALL_EXPR, means that the address of the return slot is part of the
863 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
865 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
866 reference (and the TREE_TYPE is a pointer to the true type). */
867 #define DECL_BY_REFERENCE(NODE) (DECL_CHECK (NODE)->common.private_flag)
869 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
870 thunked-to function. */
871 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag)
873 /* In a type, nonzero means that all objects of the type are guaranteed by the
874 language or front-end to be properly aligned, so we can indicate that a MEM
875 of this type is aligned at least to the alignment of the type, even if it
876 doesn't appear that it is. We see this, for example, in object-oriented
877 languages where a tag field may show this is an object of a more-aligned
878 variant of the more generic type.
880 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
882 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
884 /* Used in classes in C++. */
885 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
886 /* Used in classes in C++.
887 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
888 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
890 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
891 deprecated feature by __attribute__((deprecated)). */
892 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
894 /* Value of expression is function invariant. A strict subset of
895 TREE_CONSTANT, such an expression is constant over any one function
896 invocation, though not across different invocations. May appear in
897 any expression node. */
898 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
900 /* These flags are available for each language front end to use internally. */
901 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
902 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
903 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
904 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
905 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
906 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
907 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
909 /* Define additional fields and accessors for nodes representing constants. */
911 /* In an INTEGER_CST node. These two together make a 2-word integer.
912 If the data type is signed, the value is sign-extended to 2 words
913 even though not all of them may really be in use.
914 In an unsigned constant shorter than 2 words, the extra bits are 0. */
915 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
916 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
917 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
919 #define INT_CST_LT(A, B) \
920 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
921 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
922 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
924 #define INT_CST_LT_UNSIGNED(A, B) \
925 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
926 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
927 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
928 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
929 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
931 struct tree_int_cst GTY(())
933 struct tree_common common;
934 /* A sub-struct is necessary here because the function `const_hash'
935 wants to scan both words as a unit and taking the address of the
936 sub-struct yields the properly inclusive bounded pointer. */
937 struct tree_int_cst_lowhi {
938 unsigned HOST_WIDE_INT low;
943 /* In a REAL_CST node. struct real_value is an opaque entity, with
944 manipulators defined in real.h. We don't want tree.h depending on
945 real.h and transitively on tm.h. */
948 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
949 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
951 struct tree_real_cst GTY(())
953 struct tree_common common;
954 struct real_value * real_cst_ptr;
957 /* In a STRING_CST */
958 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
959 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
961 struct tree_string GTY(())
963 struct tree_common common;
968 /* In a COMPLEX_CST node. */
969 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
970 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
972 struct tree_complex GTY(())
974 struct tree_common common;
979 /* In a VECTOR_CST node. */
980 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
982 struct tree_vector GTY(())
984 struct tree_common common;
990 /* Define fields and accessors for some special-purpose tree nodes. */
992 #define IDENTIFIER_LENGTH(NODE) \
993 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
994 #define IDENTIFIER_POINTER(NODE) \
995 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
996 #define IDENTIFIER_HASH_VALUE(NODE) \
997 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
999 /* Translate a hash table identifier pointer to a tree_identifier
1000 pointer, and vice versa. */
1002 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1003 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1004 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1006 struct tree_identifier GTY(())
1008 struct tree_common common;
1009 struct ht_identifier id;
1012 /* In a TREE_LIST node. */
1013 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1014 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1016 struct tree_list GTY(())
1018 struct tree_common common;
1023 /* In a TREE_VEC node. */
1024 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1025 #define TREE_VEC_END(NODE) \
1026 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1028 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1030 struct tree_vec GTY(())
1032 struct tree_common common;
1034 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1037 /* Define fields and accessors for some nodes that represent expressions. */
1039 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1040 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1041 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1042 && integer_zerop (TREE_OPERAND (NODE, 0)))
1044 /* In a CONSTRUCTOR node. */
1045 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0)
1047 /* In ordinary expression nodes. */
1048 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1049 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1051 /* In a LABELED_BLOCK_EXPR node. */
1052 #define LABELED_BLOCK_LABEL(NODE) \
1053 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0)
1054 #define LABELED_BLOCK_BODY(NODE) \
1055 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1)
1057 /* In an EXIT_BLOCK_EXPR node. */
1058 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
1059 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0)
1060 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1)
1062 /* In a LOOP_EXPR node. */
1063 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1065 #ifdef USE_MAPPED_LOCATION
1066 /* The source location of this expression. Non-tree_exp nodes such as
1067 decls and constants can be shared among multiple locations, so
1069 #define EXPR_LOCATION(NODE) \
1070 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1071 ? (NODE)->exp.locus \
1073 #define SET_EXPR_LOCATION(NODE, FROM) \
1074 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1075 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1076 /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */
1077 #define EXPR_LOCUS(NODE) \
1078 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1079 ? &(NODE)->exp.locus \
1080 : (location_t *)NULL)
1081 #define SET_EXPR_LOCUS(NODE, FROM) \
1082 do { source_location *loc_tmp = FROM; \
1083 EXPR_CHECK (NODE)->exp.locus \
1084 = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0)
1085 #define EXPR_FILENAME(NODE) \
1086 LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus)
1087 #define EXPR_LINENO(NODE) \
1088 LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1090 /* The source location of this expression. Non-tree_exp nodes such as
1091 decls and constants can be shared among multiple locations, so
1093 #define EXPR_LOCUS(NODE) \
1094 (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \
1095 ? (NODE)->exp.locus \
1096 : (location_t *)NULL)
1097 #define SET_EXPR_LOCUS(NODE, FROM) \
1098 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1099 #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM)
1100 #define EXPR_FILENAME(NODE) \
1101 (EXPR_CHECK (NODE)->exp.locus->file)
1102 #define EXPR_LINENO(NODE) \
1103 (EXPR_CHECK (NODE)->exp.locus->line)
1104 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1105 #define EXPR_LOCATION(NODE) \
1106 (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION)
1109 /* In a TARGET_EXPR node. */
1110 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1111 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1112 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1114 /* DECL_EXPR accessor. This gives access to the DECL associated with
1115 the given declaration statement. */
1116 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1118 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1120 /* SWITCH_EXPR accessors. These give access to the condition, body and
1121 original condition type (before any compiler conversions)
1122 of the switch statement, respectively. */
1123 #define SWITCH_COND(NODE) TREE_OPERAND ((NODE), 0)
1124 #define SWITCH_BODY(NODE) TREE_OPERAND ((NODE), 1)
1125 #define SWITCH_LABELS(NODE) TREE_OPERAND ((NODE), 2)
1127 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1128 of a case label, respectively. */
1129 #define CASE_LOW(NODE) TREE_OPERAND ((NODE), 0)
1130 #define CASE_HIGH(NODE) TREE_OPERAND ((NODE), 1)
1131 #define CASE_LABEL(NODE) TREE_OPERAND ((NODE), 2)
1133 /* The operands of a BIND_EXPR. */
1134 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1135 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1136 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1138 /* GOTO_EXPR accessor. This gives access to the label associated with
1139 a goto statement. */
1140 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1142 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1143 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1144 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1146 #define ASM_STRING(NODE) TREE_OPERAND ((NODE), 0)
1147 #define ASM_OUTPUTS(NODE) TREE_OPERAND ((NODE), 1)
1148 #define ASM_INPUTS(NODE) TREE_OPERAND ((NODE), 2)
1149 #define ASM_CLOBBERS(NODE) TREE_OPERAND ((NODE), 3)
1150 /* Nonzero if we want to create an ASM_INPUT instead of an
1151 ASM_OPERAND with no operands. */
1152 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1153 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1155 /* COND_EXPR accessors. */
1156 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1157 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1158 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1160 /* LABEL_EXPR accessor. This gives access to the label associated with
1161 the given label expression. */
1162 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1164 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1165 accessors for SSA operands. */
1167 /* CATCH_EXPR accessors. */
1168 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1169 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1171 /* EH_FILTER_EXPR accessors. */
1172 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1173 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1174 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1176 /* OBJ_TYPE_REF accessors. */
1177 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1178 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1179 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1181 struct tree_exp GTY(())
1183 struct tree_common common;
1187 tree GTY ((special ("tree_exp"),
1188 desc ("TREE_CODE ((tree) &%0)")))
1192 /* SSA_NAME accessors. */
1194 /* Returns the variable being referenced. Once released, this is the
1195 only field that can be relied upon. */
1196 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1198 /* Returns the statement which defines this reference. Note that
1199 we use the same field when chaining SSA_NAME nodes together on
1200 the SSA_NAME freelist. */
1201 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1203 /* Returns the SSA version number of this SSA name. Note that in
1204 tree SSA, version numbers are not per variable and may be recycled. */
1205 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1207 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1208 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1210 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1211 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1213 /* Nonzero if this SSA_NAME expression is currently on the free list of
1214 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1215 has no meaning for an SSA_NAME. */
1216 #define SSA_NAME_IN_FREE_LIST(NODE) \
1217 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1219 /* Attributes for SSA_NAMEs for pointer-type variables. */
1220 #define SSA_NAME_PTR_INFO(N) \
1221 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1223 /* Get the value of this SSA_NAME, if available. */
1224 #define SSA_NAME_VALUE(N) \
1225 SSA_NAME_CHECK (N)->ssa_name.value_handle
1227 /* Auxiliary pass-specific data. */
1228 #define SSA_NAME_AUX(N) \
1229 SSA_NAME_CHECK (N)->ssa_name.aux
1231 #ifndef _TREE_FLOW_H
1232 struct ptr_info_def;
1235 struct tree_ssa_name GTY(())
1237 struct tree_common common;
1239 /* _DECL wrapped by this SSA name. */
1242 /* SSA version number. */
1243 unsigned int version;
1245 /* Pointer attributes used for alias analysis. */
1246 struct ptr_info_def *ptr_info;
1248 /* Value for SSA name used by GVN. */
1249 tree GTY((skip)) value_handle;
1251 /* Auxiliary information stored with the ssa name. */
1252 PTR GTY((skip)) aux;
1255 /* In a PHI_NODE node. */
1256 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1257 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1259 /* PHI_NODEs for each basic block are chained together in a single linked
1260 list. The head of the list is linked from the block annotation, and
1261 the link to the next PHI is in PHI_CHAIN. */
1262 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1264 /* Nonzero if the PHI node was rewritten by a previous pass through the
1266 #define PHI_REWRITTEN(NODE) PHI_NODE_CHECK (NODE)->phi.rewritten
1267 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1268 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1269 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1270 #define PHI_ARG_EDGE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).e
1271 #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero
1275 struct phi_arg_d GTY(())
1278 struct edge_def * GTY((skip (""))) e;
1282 struct tree_phi_node GTY(())
1284 struct tree_common common;
1289 /* Nonzero if the PHI node was rewritten by a previous pass through the
1293 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.capacity"))) a[1];
1297 struct varray_head_tag;
1299 /* In a BLOCK node. */
1300 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1301 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1302 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1303 /* Note: when changing this, make sure to find the places
1304 that use chainon or nreverse. */
1305 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1306 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1307 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1309 /* Nonzero means that this block is prepared to handle exceptions
1310 listed in the BLOCK_VARS slot. */
1311 #define BLOCK_HANDLER_BLOCK(NODE) \
1312 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1314 /* An index number for this block. These values are not guaranteed to
1315 be unique across functions -- whether or not they are depends on
1316 the debugging output format in use. */
1317 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1319 /* If block reordering splits a lexical block into discontiguous
1320 address ranges, we'll make a copy of the original block.
1322 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1323 In that case, we have one source block that has been replicated
1324 (through inlining or unrolling) into many logical blocks, and that
1325 these logical blocks have different physical variables in them.
1327 In this case, we have one logical block split into several
1328 non-contiguous address ranges. Most debug formats can't actually
1329 represent this idea directly, so we fake it by creating multiple
1330 logical blocks with the same variables in them. However, for those
1331 that do support non-contiguous regions, these allow the original
1332 logical block to be reconstructed, along with the set of address
1335 One of the logical block fragments is arbitrarily chosen to be
1336 the ORIGIN. The other fragments will point to the origin via
1337 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1338 be null. The list of fragments will be chained through
1339 BLOCK_FRAGMENT_CHAIN from the origin. */
1341 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1342 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1344 struct tree_block GTY(())
1346 struct tree_common common;
1348 unsigned handler_block_flag : 1;
1349 unsigned abstract_flag : 1;
1350 unsigned block_num : 30;
1355 tree abstract_origin;
1356 tree fragment_origin;
1357 tree fragment_chain;
1360 /* Define fields and accessors for nodes representing data types. */
1362 /* See tree.def for documentation of the use of these fields.
1363 Look at the documentation of the various ..._TYPE tree codes.
1365 Note that the type.values, type.minval, and type.maxval fields are
1366 overloaded and used for different macros in different kinds of types.
1367 Each macro must check to ensure the tree node is of the proper kind of
1368 type. Note also that some of the front-ends also overload these fields,
1369 so they must be checked as well. */
1371 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1372 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1373 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1374 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1375 #define TYPE_ORIG_SIZE_TYPE(NODE) (INTEGER_TYPE_CHECK (NODE)->type.values)
1376 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1377 #define TYPE_DOMAIN(NODE) (SET_OR_ARRAY_CHECK (NODE)->type.values)
1378 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
1379 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
1380 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
1381 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1382 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1383 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1384 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1385 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1386 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1387 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1388 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1389 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1390 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1391 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1392 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1393 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1394 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1395 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1396 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1397 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1398 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1400 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1401 in the debugging output. We use this to describe a vector as a
1402 structure containing an array. */
1403 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1405 /* For record and union types, information about this type, as a base type
1407 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1409 /* For non record and union types, used in a language-dependent way. */
1410 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1412 /* The (language-specific) typed-based alias set for this type.
1413 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1414 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1415 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1416 type can alias objects of any type. */
1417 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1419 /* Nonzero iff the typed-based alias set for this type has been
1421 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1423 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1425 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1427 /* The alignment necessary for objects of this type.
1428 The value is an int, measured in bits. */
1429 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1431 /* 1 if the alignment for this type was requested by "aligned" attribute,
1432 0 if it is the default for this type. */
1433 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1435 /* The alignment for NODE, in bytes. */
1436 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1438 /* If your language allows you to declare types, and you want debug info
1439 for them, then you need to generate corresponding TYPE_DECL nodes.
1440 These "stub" TYPE_DECL nodes have no name, and simply point at the
1441 type node. You then set the TYPE_STUB_DECL field of the type node
1442 to point back at the TYPE_DECL node. This allows the debug routines
1443 to know that the two nodes represent the same type, so that we only
1444 get one debug info record for them. */
1445 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1447 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1448 has BLKmode only because it lacks the alignment requirement for
1450 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1452 /* In an INTEGER_TYPE, it means the type represents a size. We use
1453 this both for validity checking and to permit optimizations that
1454 are unsafe for other types. Note that the C `size_t' type should
1455 *not* have this flag set. The `size_t' type is simply a typedef
1456 for an ordinary integer type that happens to be the type of an
1457 expression returned by `sizeof'; `size_t' has no special
1458 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1459 always actual sizes. */
1460 #define TYPE_IS_SIZETYPE(NODE) \
1461 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1463 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1464 pointer depressed. */
1465 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1466 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1468 /* Nonzero in a type considered volatile as a whole. */
1469 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1471 /* Means this type is const-qualified. */
1472 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1474 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1476 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1478 /* There is a TYPE_QUAL value for each type qualifier. They can be
1479 combined by bitwise-or to form the complete set of qualifiers for a
1482 #define TYPE_UNQUALIFIED 0x0
1483 #define TYPE_QUAL_CONST 0x1
1484 #define TYPE_QUAL_VOLATILE 0x2
1485 #define TYPE_QUAL_RESTRICT 0x4
1487 /* The set of type qualifiers for this type. */
1488 #define TYPE_QUALS(NODE) \
1489 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1490 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1491 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1493 /* These flags are available for each language front end to use internally. */
1494 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1495 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1496 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1497 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1498 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1499 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1500 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1502 /* Used to keep track of visited nodes in tree traversals. This is set to
1503 0 by copy_node and make_node. */
1504 #define TREE_VISITED(NODE) ((NODE)->common.visited)
1506 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1507 that distinguish string from array of char).
1508 If set in a SET_TYPE, indicates a bitstring type. */
1509 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1511 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1512 object of the given ARRAY_TYPE. This allows temporaries to be
1514 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1515 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
1517 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1518 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1519 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
1521 /* Indicates that objects of this type must be initialized by calling a
1522 function when they are created. */
1523 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1524 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1526 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1527 the same way that the first union alternative would be passed. */
1528 #define TYPE_TRANSPARENT_UNION(NODE) \
1529 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1531 /* For an ARRAY_TYPE, indicates that it is not permitted to
1532 take the address of a component of the type. */
1533 #define TYPE_NONALIASED_COMPONENT(NODE) \
1534 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1536 /* Indicated that objects of this type should be laid out in as
1537 compact a way as possible. */
1538 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1542 struct tree_type GTY(())
1544 struct tree_common common;
1551 unsigned int precision : 9;
1552 ENUM_BITFIELD(machine_mode) mode : 7;
1554 unsigned string_flag : 1;
1555 unsigned no_force_blk_flag : 1;
1556 unsigned needs_constructing_flag : 1;
1557 unsigned transparent_union_flag : 1;
1558 unsigned packed_flag : 1;
1559 unsigned restrict_flag : 1;
1562 unsigned lang_flag_0 : 1;
1563 unsigned lang_flag_1 : 1;
1564 unsigned lang_flag_2 : 1;
1565 unsigned lang_flag_3 : 1;
1566 unsigned lang_flag_4 : 1;
1567 unsigned lang_flag_5 : 1;
1568 unsigned lang_flag_6 : 1;
1569 unsigned user_align : 1;
1574 union tree_type_symtab {
1575 int GTY ((tag ("0"))) address;
1576 char * GTY ((tag ("1"))) pointer;
1577 struct die_struct * GTY ((tag ("2"))) die;
1578 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1579 descbits ("2"))) symtab;
1587 HOST_WIDE_INT alias_set;
1588 /* Points to a structure whose details depend on the language in use. */
1589 struct lang_type *lang_specific;
1592 /* Define accessor macros for information about type inheritance
1595 A "basetype" means a particular usage of a data type for inheritance
1596 in another type. Each such basetype usage has its own "binfo"
1597 object to describe it. The binfo object is a TREE_VEC node.
1599 Inheritance is represented by the binfo nodes allocated for a
1600 given type. For example, given types C and D, such that D is
1601 inherited by C, 3 binfo nodes will be allocated: one for describing
1602 the binfo properties of C, similarly one for D, and one for
1603 describing the binfo properties of D as a base type for C.
1604 Thus, given a pointer to class C, one can get a pointer to the binfo
1605 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1607 /* BINFO specific flags. */
1609 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1610 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag)
1612 /* Flags for language dependent use. */
1613 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
1614 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
1615 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
1616 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
1617 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
1618 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
1619 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
1621 /* The actual data type node being inherited in this basetype. */
1622 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
1624 /* The offset where this basetype appears in its containing type.
1625 BINFO_OFFSET slot holds the offset (in bytes)
1626 from the base of the complete object to the base of the part of the
1627 object that is allocated on behalf of this `type'.
1628 This is always 0 except when there is multiple inheritance. */
1630 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
1631 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1633 /* The virtual function table belonging to this basetype. Virtual
1634 function tables provide a mechanism for run-time method dispatching.
1635 The entries of a virtual function table are language-dependent. */
1637 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
1639 /* The virtual functions in the virtual function table. This is
1640 a TREE_LIST that is used as an initial approximation for building
1641 a virtual function table for this basetype. */
1642 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
1644 /* A vector of binfos for the direct basetypes inherited by this
1647 If this basetype describes type D as inherited in C, and if the
1648 basetypes of D are E and F, then this vector contains binfos for
1649 inheritance of E and F by C. */
1650 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
1652 /* The number of basetypes for NODE. */
1653 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
1655 /* Accessor macro to get to the Nth base binfo of this binfo. */
1656 #define BINFO_BASE_BINFO(NODE,N) \
1657 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
1658 #define BINFO_BASE_ITERATE(NODE,N,B) \
1659 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
1660 #define BINFO_BASE_APPEND(NODE,T) \
1661 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
1663 /* For a BINFO record describing a virtual base class, i.e., one where
1664 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1665 base. The actual contents are language-dependent. In the C++
1666 front-end this field is an INTEGER_CST giving an offset into the
1667 vtable where the offset to the virtual base can be found. */
1668 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
1670 /* Indicates the accesses this binfo has to its bases. The values are
1671 access_public_node, access_protected_node or access_private_node.
1672 If this array is not present, public access is implied. */
1673 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
1675 #define BINFO_BASE_ACCESS(NODE,N) \
1676 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
1677 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1678 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
1680 /* The index in the VTT where this subobject's sub-VTT can be found.
1681 NULL_TREE if there is no sub-VTT. */
1682 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
1684 /* The index in the VTT where the vptr for this subobject can be
1685 found. NULL_TREE if there is no secondary vptr in the VTT. */
1686 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
1688 /* The binfo of which NODE is a primary base. (This is different from
1689 BINFO_INHERITANCE_CHAIN for virtual base because a virtual base is
1690 sometimes a primary base for a class for which it is not an
1692 #define BINFO_PRIMARY_BASE_OF(NODE) (TREE_BINFO_CHECK(NODE)->binfo.primary)
1694 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1695 inheriting this base for non-virtual bases. For virtual bases it
1696 points to the binfo of the most derived type. */
1697 #define BINFO_INHERITANCE_CHAIN(NODE) \
1698 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
1700 struct tree_binfo GTY (())
1702 struct tree_common common;
1708 VEC(tree) *base_accesses;
1715 VEC(tree) base_binfos;
1719 /* Define fields and accessors for nodes representing declared names. */
1721 /* Nonzero if DECL represents a decl. */
1722 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1724 /* Nonzero if DECL represents a variable for the SSA passes. */
1725 #define SSA_VAR_P(DECL) \
1726 (TREE_CODE (DECL) == VAR_DECL \
1727 || TREE_CODE (DECL) == PARM_DECL \
1728 || TREE_CODE (DECL) == RESULT_DECL \
1729 || (TREE_CODE (DECL) == SSA_NAME \
1730 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
1731 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
1732 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
1734 /* This is the name of the object as written by the user.
1735 It is an IDENTIFIER_NODE. */
1736 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1738 /* The name of the object as the assembler will see it (but before any
1739 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1740 as DECL_NAME. It is an IDENTIFIER_NODE. */
1741 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1743 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1744 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1746 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1747 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1749 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1750 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1751 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1753 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1754 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1755 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1756 semantics of using this macro, are different than saying:
1758 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1760 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1762 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1763 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1764 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1765 DECL_ASSEMBLER_NAME (DECL1)) \
1768 /* Records the section name in a section attribute. Used to pass
1769 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1770 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1772 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1773 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1774 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
1775 points to either the FUNCTION_DECL for the containing function,
1776 the RECORD_TYPE or UNION_TYPE for the containing type, or
1777 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1779 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1780 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1781 /* In a DECL this is the field where attributes are stored. */
1782 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1783 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1784 byte containing the bit closest to the beginning of the structure. */
1785 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1786 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1787 field from DECL_FIELD_OFFSET. */
1788 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1789 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1790 if so, the type that was originally specified for it.
1791 TREE_TYPE may have been modified (in finish_struct). */
1792 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1793 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1794 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1796 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1797 /* This field is used to reference anything in decl.result and is meant only
1798 for use by the garbage collector. */
1799 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1800 /* In FUNCTION_DECL, holds the decl for the return value. */
1801 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1802 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1803 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1804 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1805 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1806 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1807 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1808 For a VAR_DECL, holds the initial value.
1809 For a PARM_DECL, not used--default
1810 values for parameters are encoded in the type of the function,
1811 not in the PARM_DECL slot.
1813 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1814 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1815 /* For a PARM_DECL, records the data type used to pass the argument,
1816 which may be different from the type seen in the program. */
1817 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1818 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1819 if nonzero, indicates that the field occupies the type. */
1820 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1821 /* These two fields describe where in the source code the declaration
1822 was. If the declaration appears in several places (as for a C
1823 function that is declared first and then defined later), this
1824 information should refer to the definition. */
1825 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1826 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1827 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1828 #ifdef USE_MAPPED_LOCATION
1829 #define DECL_IS_BUILTIN(DECL) \
1830 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
1832 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
1834 /* Holds the size of the datum, in bits, as a tree expression.
1835 Need not be constant. */
1836 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1837 /* Likewise for the size in bytes. */
1838 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1839 /* Holds the alignment required for the datum, in bits. */
1840 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1841 /* The alignment of NODE, in bytes. */
1842 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1843 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1844 DECL_FIELD_OFFSET which are known to be always zero.
1845 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1847 #define DECL_OFFSET_ALIGN(NODE) \
1848 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1849 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1850 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1851 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1852 /* 1 if the alignment for this type was requested by "aligned" attribute,
1853 0 if it is the default for this type. */
1854 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1855 /* Holds the machine mode corresponding to the declaration of a variable or
1856 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1858 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1859 /* Holds the RTL expression for the value of a variable or function.
1860 This value can be evaluated lazily for functions, variables with
1861 static storage duration, and labels. */
1862 #define DECL_RTL(NODE) \
1863 (DECL_CHECK (NODE)->decl.rtl \
1864 ? (NODE)->decl.rtl \
1865 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1866 /* Set the DECL_RTL for NODE to RTL. */
1867 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1868 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1869 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1870 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1871 NODE1, it will not be set for NODE2; this is a lazy copy. */
1872 #define COPY_DECL_RTL(NODE1, NODE2) \
1873 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1874 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1875 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1877 /* For PARM_DECL, holds an RTL for the stack slot or register
1878 where the data was actually passed. */
1879 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1881 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
1882 that describes the status of this function. */
1883 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1885 /* For FUNCTION_DECL, if it is built-in,
1886 this identifies which built-in operation it is. */
1887 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1889 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1890 Before the struct containing the FUNCTION_DECL is laid out,
1891 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1892 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1893 function. When the class is laid out, this pointer is changed
1894 to an INTEGER_CST node which is suitable for use as an index
1895 into the virtual function table. */
1896 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1898 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1899 which this FIELD_DECL is defined. This information is needed when
1900 writing debugging information about vfield and vbase decls for C++. */
1901 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1903 /* Every ..._DECL node gets a unique number. */
1904 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1906 /* For any sort of a ..._DECL node, this points to the original (abstract)
1907 decl node which this decl is an instance of, or else it is NULL indicating
1908 that this decl is not an instance of some other decl. For example,
1909 in a nested declaration of an inline function, this points back to the
1911 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1913 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1914 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1915 #define DECL_ORIGIN(NODE) \
1916 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1918 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1919 inline instance of some original (abstract) decl from an inline function;
1920 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1921 nodes can also have their abstract origin set to themselves. */
1922 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1923 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1925 /* Nonzero if a _DECL means that the name of this decl should be ignored
1926 for symbolic debug purposes. */
1927 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1929 /* Nonzero for a given ..._DECL node means that this node represents an
1930 "abstract instance" of the given declaration (e.g. in the original
1931 declaration of an inline function). When generating symbolic debugging
1932 information, we mustn't try to generate any address information for nodes
1933 marked as "abstract instances" because we don't actually generate
1934 any code or allocate any data space for such instances. */
1935 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1937 /* Nonzero if a _DECL means that no warnings should be generated just
1938 because this decl is unused. */
1939 #define DECL_IN_SYSTEM_HEADER(NODE) \
1940 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1942 /* Nonzero for a given ..._DECL node means that this node should be
1943 put in .common, if possible. If a DECL_INITIAL is given, and it
1944 is not error_mark_node, then the decl cannot be put in .common. */
1945 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1947 /* Language-specific decl information. */
1948 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1950 /* In a VAR_DECL or FUNCTION_DECL,
1951 nonzero means external reference:
1952 do not allocate storage, and refer to a definition elsewhere. */
1953 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1955 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1957 #define DEFAULT_INIT_PRIORITY 65535
1958 #define MAX_INIT_PRIORITY 65535
1959 #define MAX_RESERVED_INIT_PRIORITY 100
1962 nonzero means the detail info about this type is not dumped into stabs.
1963 Instead it will generate cross reference ('x') of names.
1964 This uses the same flag as DECL_EXTERNAL. */
1965 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1966 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1968 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1969 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1971 /* In LABEL_DECL nodes, nonzero means that an error message about
1972 jumping into such a binding contour has been printed for this label. */
1973 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1975 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1976 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1978 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1979 static chain is not needed. */
1980 #define DECL_NO_STATIC_CHAIN(NODE) \
1981 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1983 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1984 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1986 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1988 Also set in some languages for variables, etc., outside the normal
1989 lexical scope, such as class instance variables. */
1990 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1992 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1993 where it is called. */
1994 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1996 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
1997 such as via the `inline' keyword in C/C++. This flag controls the linkage
1998 semantics of 'inline'; whether or not the function is inlined is
1999 controlled by DECL_INLINE. */
2000 #define DECL_DECLARED_INLINE_P(NODE) \
2001 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag)
2003 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2004 this variable in a BIND_EXPR. */
2005 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2006 (DECL_CHECK (NODE)->decl.seen_in_bind_expr)
2008 /* In a VAR_DECL, nonzero if the decl is a register variable with
2009 an explicit asm specification. */
2010 #define DECL_HARD_REGISTER(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
2012 /* Value of the decls's visibility attribute */
2013 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility)
2015 /* Nonzero means that the decl had its visibility specified rather than
2017 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_CHECK (NODE)->decl.visibility_specified)
2019 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2020 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
2022 /* In a VAR_DECL, nonzero if the data should be allocated from
2023 thread-local storage. */
2024 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
2026 /* In a FUNCTION_DECL, the saved representation of the body of the
2028 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
2030 /* List of FUNCTION_DECLs inlined into this function's body. */
2031 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
2033 /* Nonzero in a FUNCTION_DECL means this function should be treated
2034 as if it were a malloc, meaning it returns a pointer that is
2036 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
2038 /* Nonzero in a FUNCTION_DECL means this function should be treated
2039 as "pure" function (like const function, but may read global memory). */
2040 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
2042 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2044 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
2046 /* Unused in FUNCTION_DECL. */
2048 /* In a VAR_DECL that's static,
2049 nonzero if the space is in the text section. */
2050 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
2052 /* In a FUNCTION_DECL, nonzero means a built in function. */
2053 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2055 /* For a builtin function, identify which part of the compiler defined it. */
2056 #define DECL_BUILT_IN_CLASS(NODE) \
2057 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
2059 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2060 Used in FIELD_DECLs for vtable pointers.
2061 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2062 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
2064 /* Used to indicate that the linkage status of this DECL is not yet known,
2065 so it should not be output now. */
2066 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
2068 /* Used in PARM_DECLs whose type are unions to indicate that the
2069 argument should be passed in the same way that the first union
2070 alternative would be passed. */
2071 #define DECL_TRANSPARENT_UNION(NODE) \
2072 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
2074 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2075 at the beginning or end of execution. */
2076 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2077 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
2079 #define DECL_STATIC_DESTRUCTOR(NODE) \
2080 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
2082 /* Used to indicate that this DECL represents a compiler-generated entity. */
2083 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
2085 /* Used to indicate that this DECL has weak linkage. */
2086 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
2088 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2089 multiple translation units should be merged. */
2090 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
2092 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2093 not be put out unless it is needed in this translation unit.
2094 Entities like this are shared across translation units (like weak
2095 entities), but are guaranteed to be generated by any translation
2096 unit that needs them, and therefore need not be put out anywhere
2097 where they are not needed. DECL_COMDAT is just a hint to the
2098 back-end; it is up to front-ends which set this flag to ensure
2099 that there will never be any harm, other than bloat, in putting out
2100 something which is DECL_COMDAT. */
2101 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
2103 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2104 be instrumented with calls to support routines. */
2105 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2106 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
2108 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2109 disabled in this function. */
2110 #define DECL_NO_LIMIT_STACK(NODE) \
2111 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
2113 /* Additional flags for language-specific uses. */
2114 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
2115 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
2116 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
2117 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
2118 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
2119 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
2120 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
2121 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
2123 /* Used to indicate that the pointer to this DECL cannot be treated as
2124 an address constant. */
2125 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
2127 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2129 #define DECL_NONADDRESSABLE_P(NODE) \
2130 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
2132 /* Used to indicate an alias set for the memory pointed to by this
2133 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2134 pointer (or reference) type. */
2135 #define DECL_POINTER_ALIAS_SET(NODE) \
2136 (DECL_CHECK (NODE)->decl.pointer_alias_set)
2138 /* Used to store the alias_var for a DECL node. */
2139 #define DECL_PTA_ALIASVAR(NODE) \
2140 (DECL_CHECK (NODE)->decl.alias_var)
2142 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2143 dense, unique within any one function, and may be used to index arrays.
2144 If the value is -1, then no UID has been assigned. */
2145 #define LABEL_DECL_UID(NODE) \
2146 (LABEL_DECL_CHECK (NODE)->decl.pointer_alias_set)
2148 /* Nonzero if an alias set has been assigned to this declaration. */
2149 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2150 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2152 /* Nonzero for a decl which is at file scope. */
2153 #define DECL_FILE_SCOPE_P(EXP) \
2154 (! DECL_CONTEXT (EXP) \
2155 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2157 /* Nonzero for a decl that has been marked as needing a memory slot.
2158 NOTE: Never use this macro directly. It will give you incomplete
2159 information. Most of the time this bit will only be set after alias
2160 analysis in the tree optimizers. It's always better to call
2161 needs_to_live_in_memory instead. To mark memory variables use
2162 mark_call_clobbered. */
2163 #define DECL_NEEDS_TO_LIVE_IN_MEMORY_INTERNAL(DECL) \
2164 DECL_CHECK (DECL)->decl.needs_to_live_in_memory
2166 /* Nonzero for a decl that cgraph has decided should be inlined into
2167 at least one call site. It is not meaningful to look at this
2168 directly; always use cgraph_function_possibly_inlined_p. */
2169 #define DECL_POSSIBLY_INLINED(DECL) \
2170 FUNCTION_DECL_CHECK (DECL)->decl.possibly_inlined
2172 /* Enumerate visibility settings. */
2173 #ifndef SYMBOL_VISIBILITY_DEFINED
2174 #define SYMBOL_VISIBILITY_DEFINED
2175 enum symbol_visibility
2178 VISIBILITY_INTERNAL,
2180 VISIBILITY_PROTECTED
2185 union alias_var_def;
2186 struct tree_decl GTY(())
2188 struct tree_common common;
2192 ENUM_BITFIELD(machine_mode) mode : 8;
2194 unsigned external_flag : 1;
2195 unsigned nonlocal_flag : 1;
2196 unsigned regdecl_flag : 1;
2197 unsigned inline_flag : 1;
2198 unsigned bit_field_flag : 1;
2199 unsigned virtual_flag : 1;
2200 unsigned ignored_flag : 1;
2201 unsigned abstract_flag : 1;
2203 unsigned in_system_header_flag : 1;
2204 unsigned common_flag : 1;
2205 unsigned defer_output : 1;
2206 unsigned transparent_union : 1;
2207 unsigned static_ctor_flag : 1;
2208 unsigned static_dtor_flag : 1;
2209 unsigned artificial_flag : 1;
2210 unsigned weak_flag : 1;
2212 unsigned non_addr_const_p : 1;
2213 unsigned no_instrument_function_entry_exit : 1;
2214 unsigned comdat_flag : 1;
2215 unsigned malloc_flag : 1;
2216 unsigned no_limit_stack : 1;
2217 ENUM_BITFIELD(built_in_class) built_in_class : 2;
2218 unsigned pure_flag : 1;
2220 unsigned non_addressable : 1;
2221 unsigned user_align : 1;
2222 unsigned uninlinable : 1;
2223 unsigned thread_local_flag : 1;
2224 unsigned declared_inline_flag : 1;
2225 unsigned seen_in_bind_expr : 1;
2226 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2227 unsigned visibility_specified : 1;
2229 unsigned lang_flag_0 : 1;
2230 unsigned lang_flag_1 : 1;
2231 unsigned lang_flag_2 : 1;
2232 unsigned lang_flag_3 : 1;
2233 unsigned lang_flag_4 : 1;
2234 unsigned lang_flag_5 : 1;
2235 unsigned lang_flag_6 : 1;
2236 unsigned lang_flag_7 : 1;
2238 unsigned needs_to_live_in_memory : 1;
2239 unsigned possibly_inlined : 1;
2240 /* 14 unused bits. */
2242 union tree_decl_u1 {
2243 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2244 DECL_FUNCTION_CODE. */
2245 enum built_in_function f;
2246 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2247 is used by language-dependent code. */
2249 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2251 struct tree_decl_u1_a {
2252 unsigned int align : 24;
2253 unsigned int off_align : 8;
2260 tree arguments; /* Also used for DECL_FIELD_OFFSET */
2261 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
2262 tree initial; /* Also used for DECL_QUALIFIER */
2263 tree abstract_origin;
2264 tree assembler_name;
2267 rtx rtl; /* RTL representation for object. */
2269 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
2270 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
2271 In PARM_DECL, holds an RTL for the stack slot
2272 of register where the data was actually passed.
2273 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
2274 union tree_decl_u2 {
2275 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
2276 rtx GTY ((tag ("PARM_DECL"))) r;
2277 tree GTY ((tag ("FIELD_DECL"))) t;
2278 int GTY ((tag ("VAR_DECL"))) i;
2279 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
2281 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
2284 /* In a FUNCTION_DECL, these are function data which is to be kept
2285 as long as FUNCTION_DECL is kept. */
2289 HOST_WIDE_INT pointer_alias_set;
2290 union alias_var_def *GTY ((skip(""))) alias_var;
2291 /* Points to a structure whose details depend on the language in use. */
2292 struct lang_decl *lang_specific;
2296 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2297 To reduce overhead, the nodes containing the statements are not trees.
2298 This avoids the overhead of tree_common on all linked list elements.
2300 Use the interface in tree-iterator.h to access this node. */
2302 #define STATEMENT_LIST_HEAD(NODE) \
2303 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2304 #define STATEMENT_LIST_TAIL(NODE) \
2305 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2307 struct tree_statement_list_node
2308 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
2310 struct tree_statement_list_node *prev;
2311 struct tree_statement_list_node *next;
2315 struct tree_statement_list
2318 struct tree_common common;
2319 struct tree_statement_list_node *head;
2320 struct tree_statement_list_node *tail;
2323 #define VALUE_HANDLE_ID(NODE) \
2324 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
2326 #define VALUE_HANDLE_EXPR_SET(NODE) \
2327 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
2329 /* Defined and used in tree-ssa-pre.c. */
2332 struct tree_value_handle GTY(())
2334 struct tree_common common;
2336 /* The set of expressions represented by this handle. */
2337 struct value_set * GTY ((skip)) expr_set;
2339 /* Unique ID for this value handle. IDs are handed out in a
2340 conveniently dense form starting at 0, so that we can make
2341 bitmaps of value handles. */
2345 enum tree_node_structure_enum {
2367 /* Define the overall contents of a tree node.
2368 It may be any of the structures declared above
2369 for various types of node. */
2371 union tree_node GTY ((ptr_alias (union lang_tree_node),
2372 desc ("tree_node_structure (&%h)")))
2374 struct tree_common GTY ((tag ("TS_COMMON"))) common;
2375 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
2376 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
2377 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
2378 struct tree_string GTY ((tag ("TS_STRING"))) string;
2379 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
2380 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
2381 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
2382 struct tree_type GTY ((tag ("TS_TYPE"))) type;
2383 struct tree_list GTY ((tag ("TS_LIST"))) list;
2384 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
2385 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
2386 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
2387 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
2388 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
2389 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
2390 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
2391 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
2394 /* Standard named or nameless data types of the C compiler. */
2413 TI_INTEGER_MINUS_ONE,
2430 TI_COMPLEX_INTEGER_TYPE,
2431 TI_COMPLEX_FLOAT_TYPE,
2432 TI_COMPLEX_DOUBLE_TYPE,
2433 TI_COMPLEX_LONG_DOUBLE_TYPE,
2437 TI_LONG_DOUBLE_TYPE,
2441 TI_LONG_DOUBLE_PTR_TYPE,
2442 TI_INTEGER_PTR_TYPE,
2461 extern GTY(()) tree global_trees[TI_MAX];
2463 #define error_mark_node global_trees[TI_ERROR_MARK]
2465 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2466 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2467 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2468 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2469 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2471 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2472 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2473 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2474 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2475 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2477 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2478 #define integer_one_node global_trees[TI_INTEGER_ONE]
2479 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2480 #define size_zero_node global_trees[TI_SIZE_ZERO]
2481 #define size_one_node global_trees[TI_SIZE_ONE]
2482 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2483 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2484 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2486 /* Base access nodes. */
2487 #define access_public_node global_trees[TI_PUBLIC]
2488 #define access_protected_node global_trees[TI_PROTECTED]
2489 #define access_private_node global_trees[TI_PRIVATE]
2491 #define null_pointer_node global_trees[TI_NULL_POINTER]
2493 #define float_type_node global_trees[TI_FLOAT_TYPE]
2494 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2495 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2497 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
2498 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
2499 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
2500 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
2502 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2503 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2504 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2505 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2507 #define void_type_node global_trees[TI_VOID_TYPE]
2508 /* The C type `void *'. */
2509 #define ptr_type_node global_trees[TI_PTR_TYPE]
2510 /* The C type `const void *'. */
2511 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2512 /* The C type `size_t'. */
2513 #define size_type_node global_trees[TI_SIZE_TYPE]
2514 #define pid_type_node global_trees[TI_PID_TYPE]
2515 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2516 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2517 /* The C type `FILE *'. */
2518 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
2520 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
2521 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
2522 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
2524 /* The node that should be placed at the end of a parameter list to
2525 indicate that the function does not take a variable number of
2526 arguments. The TREE_VALUE will be void_type_node and there will be
2527 no TREE_CHAIN. Language-independent code should not assume
2528 anything else about this node. */
2529 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2531 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2532 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2534 /* An enumeration of the standard C integer types. These must be
2535 ordered so that shorter types appear before longer ones, and so
2536 that signed types appear before unsigned ones, for the correct
2537 functioning of interpret_integer() in c-lex.c. */
2538 enum integer_type_kind
2550 itk_unsigned_long_long,
2554 typedef enum integer_type_kind integer_type_kind;
2556 /* The standard C integer types. Use integer_type_kind to index into
2558 extern GTY(()) tree integer_types[itk_none];
2560 #define char_type_node integer_types[itk_char]
2561 #define signed_char_type_node integer_types[itk_signed_char]
2562 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2563 #define short_integer_type_node integer_types[itk_short]
2564 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2565 #define integer_type_node integer_types[itk_int]
2566 #define unsigned_type_node integer_types[itk_unsigned_int]
2567 #define long_integer_type_node integer_types[itk_long]
2568 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2569 #define long_long_integer_type_node integer_types[itk_long_long]
2570 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2572 /* Set to the default thread-local storage (tls) model to use. */
2574 extern enum tls_model flag_tls_default;
2577 /* A pointer-to-function member type looks like:
2584 If __pfn is NULL, it is a NULL pointer-to-member-function.
2586 (Because the vtable is always the first thing in the object, we
2587 don't need its offset.) If the function is virtual, then PFN is
2588 one plus twice the index into the vtable; otherwise, it is just a
2589 pointer to the function.
2591 Unfortunately, using the lowest bit of PFN doesn't work in
2592 architectures that don't impose alignment requirements on function
2593 addresses, or that use the lowest bit to tell one ISA from another,
2594 for example. For such architectures, we use the lowest bit of
2595 DELTA instead of the lowest bit of the PFN, and DELTA will be
2598 enum ptrmemfunc_vbit_where_t
2600 ptrmemfunc_vbit_in_pfn,
2601 ptrmemfunc_vbit_in_delta
2604 #define NULL_TREE (tree) NULL
2606 extern GTY(()) tree frame_base_decl;
2607 extern tree decl_assembler_name (tree);
2609 /* Compute the number of bytes occupied by 'node'. This routine only
2610 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2612 extern size_t tree_size (tree);
2614 /* Lowest level primitive for allocating a node.
2615 The TREE_CODE is the only argument. Contents are initialized
2616 to zero except for a few of the common fields. */
2618 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
2619 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
2621 /* Make a copy of a node, with all the same contents. */
2623 extern tree copy_node_stat (tree MEM_STAT_DECL);
2624 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
2626 /* Make a copy of a chain of TREE_LIST nodes. */
2628 extern tree copy_list (tree);
2631 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
2632 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
2634 /* Make a TREE_VEC. */
2636 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
2637 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
2639 /* Tree nodes for SSA analysis. */
2641 extern tree make_phi_node (tree, int);
2642 extern void init_phinodes (void);
2643 extern void fini_phinodes (void);
2644 extern void release_phi_node (tree);
2645 #ifdef GATHER_STATISTICS
2646 extern void phinodes_print_statistics (void);
2649 extern void init_ssanames (void);
2650 extern void fini_ssanames (void);
2651 extern tree make_ssa_name (tree, tree);
2652 extern tree duplicate_ssa_name (tree, tree);
2653 extern void release_ssa_name (tree);
2654 extern void release_defs (tree);
2655 extern void replace_ssa_name_symbol (tree, tree);
2657 #ifdef GATHER_STATISTICS
2658 extern void ssanames_print_statistics (void);
2661 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2662 The name is supplied as a char *. */
2664 extern tree get_identifier (const char *);
2666 #if GCC_VERSION >= 3000
2667 #define get_identifier(str) \
2668 (__builtin_constant_p (str) \
2669 ? get_identifier_with_length ((str), strlen (str)) \
2670 : get_identifier (str))
2674 /* Identical to get_identifier, except that the length is assumed
2677 extern tree get_identifier_with_length (const char *, size_t);
2679 /* If an identifier with the name TEXT (a null-terminated string) has
2680 previously been referred to, return that node; otherwise return
2683 extern tree maybe_get_identifier (const char *);
2685 /* Construct various types of nodes. */
2687 extern tree build (enum tree_code, tree, ...);
2688 extern tree build_nt (enum tree_code, ...);
2690 #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L
2691 /* Use preprocessor trickery to map "build" to "buildN" where N is the
2692 expected number of arguments. This is used for both efficiency (no
2693 varargs), and checking (verifying number of passed arguments). */
2694 #define build(code, ...) \
2695 _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__)
2696 #define _buildN1(BASE, X) _buildN2(BASE, X)
2697 #define _buildN2(BASE, X) BASE##X
2698 #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0)
2699 #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c
2702 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
2703 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
2704 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2705 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
2706 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
2707 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
2708 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
2709 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
2710 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
2711 tree MEM_STAT_DECL);
2712 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
2714 extern tree build_int_2 (unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2715 extern tree build_vector (tree, tree);
2716 extern tree build_constructor (tree, tree);
2717 extern tree build_real_from_int_cst (tree, tree);
2718 extern tree build_complex (tree, tree, tree);
2719 extern tree build_string (int, const char *);
2720 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
2721 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
2722 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
2723 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
2724 extern tree build_block (tree, tree, tree, tree, tree);
2725 #ifndef USE_MAPPED_LOCATION
2726 extern void annotate_with_file_line (tree, const char *, int);
2727 extern void annotate_with_locus (tree, location_t);
2729 extern tree build_empty_stmt (void);
2731 /* Construct various nodes representing data types. */
2733 extern tree make_signed_type (int);
2734 extern tree make_unsigned_type (int);
2735 extern void initialize_sizetypes (void);
2736 extern void set_sizetype (tree);
2737 extern void fixup_unsigned_type (tree);
2738 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
2739 extern tree build_pointer_type (tree);
2740 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
2741 extern tree build_reference_type (tree);
2742 extern tree build_vector_type_for_mode (tree, enum machine_mode);
2743 extern tree build_vector_type (tree innertype, int nunits);
2744 extern tree build_type_no_quals (tree);
2745 extern tree build_index_type (tree);
2746 extern tree build_index_2_type (tree, tree);
2747 extern tree build_array_type (tree, tree);
2748 extern tree build_function_type (tree, tree);
2749 extern tree build_function_type_list (tree, ...);
2750 extern tree build_method_type_directly (tree, tree, tree);
2751 extern tree build_method_type (tree, tree);
2752 extern tree build_offset_type (tree, tree);
2753 extern tree build_complex_type (tree);
2754 extern tree array_type_nelts (tree);
2755 extern bool in_array_bounds_p (tree);
2757 extern tree value_member (tree, tree);
2758 extern tree purpose_member (tree, tree);
2760 extern int attribute_list_equal (tree, tree);
2761 extern int attribute_list_contained (tree, tree);
2762 extern int tree_int_cst_equal (tree, tree);
2763 extern int tree_int_cst_lt (tree, tree);
2764 extern int tree_int_cst_compare (tree, tree);
2765 extern int host_integerp (tree, int);
2766 extern HOST_WIDE_INT tree_low_cst (tree, int);
2767 extern int tree_int_cst_msb (tree);
2768 extern int tree_int_cst_sgn (tree);
2769 extern int tree_expr_nonnegative_p (tree);
2770 extern int rtl_expr_nonnegative_p (rtx);
2771 extern tree get_inner_array_type (tree);
2773 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2774 put the prototype here. Rtl.h does declare the prototype if
2775 tree.h had been included. */
2777 extern tree make_tree (tree, rtx);
2779 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2782 Such modified types already made are recorded so that duplicates
2785 extern tree build_type_attribute_variant (tree, tree);
2786 extern tree build_decl_attribute_variant (tree, tree);
2788 /* Structure describing an attribute and a function to handle it. */
2789 struct attribute_spec
2791 /* The name of the attribute (without any leading or trailing __),
2792 or NULL to mark the end of a table of attributes. */
2793 const char *const name;
2794 /* The minimum length of the list of arguments of the attribute. */
2795 const int min_length;
2796 /* The maximum length of the list of arguments of the attribute
2797 (-1 for no maximum). */
2798 const int max_length;
2799 /* Whether this attribute requires a DECL. If it does, it will be passed
2800 from types of DECLs, function return types and array element types to
2801 the DECLs, function types and array types respectively; but when
2802 applied to a type in any other circumstances, it will be ignored with
2803 a warning. (If greater control is desired for a given attribute,
2804 this should be false, and the flags argument to the handler may be
2805 used to gain greater control in that case.) */
2806 const bool decl_required;
2807 /* Whether this attribute requires a type. If it does, it will be passed
2808 from a DECL to the type of that DECL. */
2809 const bool type_required;
2810 /* Whether this attribute requires a function (or method) type. If it does,
2811 it will be passed from a function pointer type to the target type,
2812 and from a function return type (which is not itself a function
2813 pointer type) to the function type. */
2814 const bool function_type_required;
2815 /* Function to handle this attribute. NODE points to the node to which
2816 the attribute is to be applied. If a DECL, it should be modified in
2817 place; if a TYPE, a copy should be created. NAME is the name of the
2818 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2819 of the arguments (which may be NULL). FLAGS gives further information
2820 about the context of the attribute. Afterwards, the attributes will
2821 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2822 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2823 as well as in any other cases when the attributes should not be added
2824 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2825 applied to another type or DECL later may be returned;
2826 otherwise the return value should be NULL_TREE. This pointer may be
2827 NULL if no special handling is required beyond the checks implied
2828 by the rest of this structure. */
2829 tree (*const handler) (tree *node, tree name, tree args,
2830 int flags, bool *no_add_attrs);
2833 /* Flags that may be passed in the third argument of decl_attributes, and
2834 to handler functions for attributes. */
2835 enum attribute_flags
2837 /* The type passed in is the type of a DECL, and any attributes that
2838 should be passed in again to be applied to the DECL rather than the
2839 type should be returned. */
2840 ATTR_FLAG_DECL_NEXT = 1,
2841 /* The type passed in is a function return type, and any attributes that
2842 should be passed in again to be applied to the function type rather
2843 than the return type should be returned. */
2844 ATTR_FLAG_FUNCTION_NEXT = 2,
2845 /* The type passed in is an array element type, and any attributes that
2846 should be passed in again to be applied to the array type rather
2847 than the element type should be returned. */
2848 ATTR_FLAG_ARRAY_NEXT = 4,
2849 /* The type passed in is a structure, union or enumeration type being
2850 created, and should be modified in place. */
2851 ATTR_FLAG_TYPE_IN_PLACE = 8,
2852 /* The attributes are being applied by default to a library function whose
2853 name indicates known behavior, and should be silently ignored if they
2854 are not in fact compatible with the function type. */
2855 ATTR_FLAG_BUILT_IN = 16
2858 /* Default versions of target-overridable functions. */
2860 extern tree merge_decl_attributes (tree, tree);
2861 extern tree merge_type_attributes (tree, tree);
2862 extern void default_register_cpp_builtins (struct cpp_reader *);
2864 /* Split a list of declspecs and attributes into two. */
2866 extern void split_specs_attrs (tree, tree *, tree *);
2868 /* Strip attributes from a list of combined specs and attrs. */
2870 extern tree strip_attrs (tree);
2872 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2874 extern int valid_machine_attribute (tree, tree, tree, tree);
2876 /* Given a tree node and a string, return nonzero if the tree node is
2877 a valid attribute name for the string. */
2879 extern int is_attribute_p (const char *, tree);
2881 /* Given an attribute name and a list of attributes, return the list element
2882 of the attribute or NULL_TREE if not found. */
2884 extern tree lookup_attribute (const char *, tree);
2886 /* Given two attributes lists, return a list of their union. */
2888 extern tree merge_attributes (tree, tree);
2890 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2891 /* Given two Windows decl attributes lists, possibly including
2892 dllimport, return a list of their union . */
2893 extern tree merge_dllimport_decl_attributes (tree, tree);
2896 /* Check whether CAND is suitable to be returned from get_qualified_type
2897 (BASE, TYPE_QUALS). */
2899 extern bool check_qualified_type (tree, tree, int);
2901 /* Return a version of the TYPE, qualified as indicated by the
2902 TYPE_QUALS, if one exists. If no qualified version exists yet,
2903 return NULL_TREE. */
2905 extern tree get_qualified_type (tree, int);
2907 /* Like get_qualified_type, but creates the type if it does not
2908 exist. This function never returns NULL_TREE. */
2910 extern tree build_qualified_type (tree, int);
2912 /* Like build_qualified_type, but only deals with the `const' and
2913 `volatile' qualifiers. This interface is retained for backwards
2914 compatibility with the various front-ends; new code should use
2915 build_qualified_type instead. */
2917 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2918 build_qualified_type ((TYPE), \
2919 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2920 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2922 /* Make a copy of a type node. */
2924 extern tree build_type_copy (tree);
2926 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2927 fields. Optionally specify an alignment, and then lay it out. */
2929 extern void finish_builtin_struct (tree, const char *,
2932 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2933 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2934 node, does nothing except for the first time. */
2936 extern void layout_type (tree);
2938 /* These functions allow a front-end to perform a manual layout of a
2939 RECORD_TYPE. (For instance, if the placement of subsequent fields
2940 depends on the placement of fields so far.) Begin by calling
2941 start_record_layout. Then, call place_field for each of the
2942 fields. Then, call finish_record_layout. See layout_type for the
2943 default way in which these functions are used. */
2945 typedef struct record_layout_info_s
2947 /* The RECORD_TYPE that we are laying out. */
2949 /* The offset into the record so far, in bytes, not including bits in
2952 /* The last known alignment of SIZE. */
2953 unsigned int offset_align;
2954 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2956 /* The alignment of the record so far, in bits. */
2957 unsigned int record_align;
2958 /* The alignment of the record so far, ignoring #pragma pack and
2959 __attribute__ ((packed)), in bits. */
2960 unsigned int unpacked_align;
2961 /* The previous field layed out. */
2963 /* The static variables (i.e., class variables, as opposed to
2964 instance variables) encountered in T. */
2965 tree pending_statics;
2966 /* Bits remaining in the current alignment group */
2967 int remaining_in_alignment;
2968 /* True if we've seen a packed field that didn't have normal
2969 alignment anyway. */
2970 int packed_maybe_necessary;
2971 } *record_layout_info;
2973 extern void set_lang_adjust_rli (void (*) (record_layout_info));
2974 extern record_layout_info start_record_layout (tree);
2975 extern tree bit_from_pos (tree, tree);
2976 extern tree byte_from_pos (tree, tree);
2977 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
2978 extern void normalize_offset (tree *, tree *, unsigned int);
2979 extern tree rli_size_unit_so_far (record_layout_info);
2980 extern tree rli_size_so_far (record_layout_info);
2981 extern void normalize_rli (record_layout_info);
2982 extern void place_field (record_layout_info, tree);
2983 extern void compute_record_mode (tree);
2984 extern void finish_record_layout (record_layout_info, int);
2986 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2987 return a canonicalized ..._TYPE node, so that duplicates are not made.
2988 How the hash code is computed is up to the caller, as long as any two
2989 callers that could hash identical-looking type nodes agree. */
2991 extern tree type_hash_canon (unsigned int, tree);
2993 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2994 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2995 fields. Call this only once for any given decl node.
2997 Second argument is the boundary that this field can be assumed to
2998 be starting at (in bits). Zero means it can be assumed aligned
2999 on any boundary that may be needed. */
3001 extern void layout_decl (tree, unsigned);
3003 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3004 a previous call to layout_decl and calls it again. */
3006 extern void relayout_decl (tree);
3008 /* Return the mode for data of a given size SIZE and mode class CLASS.
3009 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3010 The value is BLKmode if no other mode is found. This is like
3011 mode_for_size, but is passed a tree. */
3013 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
3015 /* Return an expr equal to X but certainly not valid as an lvalue. */
3017 extern tree non_lvalue (tree);
3018 extern tree pedantic_non_lvalue (tree);
3020 extern tree convert (tree, tree);
3021 extern unsigned int expr_align (tree);
3022 extern tree expr_first (tree);
3023 extern tree expr_last (tree);
3024 extern tree expr_only (tree);
3025 extern tree size_in_bytes (tree);
3026 extern HOST_WIDE_INT int_size_in_bytes (tree);
3027 extern tree bit_position (tree);
3028 extern HOST_WIDE_INT int_bit_position (tree);
3029 extern tree byte_position (tree);
3030 extern HOST_WIDE_INT int_byte_position (tree);
3032 /* Define data structures, macros, and functions for handling sizes
3033 and the various types used to represent sizes. */
3037 SIZETYPE, /* Normal representation of sizes in bytes. */
3038 SSIZETYPE, /* Signed representation of sizes in bytes. */
3039 USIZETYPE, /* Unsigned representation of sizes in bytes. */
3040 BITSIZETYPE, /* Normal representation of sizes in bits. */
3041 SBITSIZETYPE, /* Signed representation of sizes in bits. */
3042 UBITSIZETYPE, /* Unsigned representation of sizes in bits. */
3045 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
3047 #define sizetype sizetype_tab[(int) SIZETYPE]
3048 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
3049 #define ssizetype sizetype_tab[(int) SSIZETYPE]
3050 #define usizetype sizetype_tab[(int) USIZETYPE]
3051 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
3052 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
3054 extern tree size_binop (enum tree_code, tree, tree);
3055 extern tree size_diffop (tree, tree);
3056 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
3057 extern tree size_int_type (HOST_WIDE_INT, tree);
3059 #define size_int(L) size_int_kind (L, SIZETYPE)
3060 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
3061 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
3062 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
3064 extern tree round_up (tree, int);
3065 extern tree round_down (tree, int);
3066 extern tree get_pending_sizes (void);
3067 extern void put_pending_size (tree);
3068 extern void put_pending_sizes (tree);
3070 /* Type for sizes of data-type. */
3072 #define BITS_PER_UNIT_LOG \
3073 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3074 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3075 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3077 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
3078 extern unsigned int maximum_field_alignment;
3080 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
3081 extern unsigned int set_alignment;
3083 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3084 by making the last node in X point to Y.
3085 Returns X, except if X is 0 returns Y. */
3087 extern tree chainon (tree, tree);
3089 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3091 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3092 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3094 /* Return the last tree node in a chain. */
3096 extern tree tree_last (tree);
3098 /* Reverse the order of elements in a chain, and return the new head. */
3100 extern tree nreverse (tree);
3102 /* Returns the length of a chain of nodes
3103 (number of chain pointers to follow before reaching a null pointer). */
3105 extern int list_length (tree);
3107 /* Returns the number of FIELD_DECLs in a type. */
3109 extern int fields_length (tree);
3111 /* Given an initializer INIT, return TRUE if INIT is zero or some
3112 aggregate of zeros. Otherwise return FALSE. */
3114 extern bool initializer_zerop (tree);
3116 extern void categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *);
3117 extern HOST_WIDE_INT count_type_elements (tree);
3118 extern int mostly_zeros_p (tree);
3120 /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */
3122 extern void add_var_to_bind_expr (tree, tree);
3124 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
3126 extern int integer_zerop (tree);
3128 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
3130 extern int integer_onep (tree);
3132 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3133 all of whose significant bits are 1. */
3135 extern int integer_all_onesp (tree);
3137 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3138 exactly one bit 1. */
3140 extern int integer_pow2p (tree);
3142 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3143 with a nonzero value. */
3145 extern int integer_nonzerop (tree);
3147 /* staticp (tree x) is true if X is a reference to data allocated
3148 at a fixed address in memory. */
3150 extern bool staticp (tree);
3152 /* save_expr (EXP) returns an expression equivalent to EXP
3153 but it can be used multiple times within context CTX
3154 and only evaluate EXP once. */
3156 extern tree save_expr (tree);
3158 /* Look inside EXPR and into any simple arithmetic operations. Return
3159 the innermost non-arithmetic node. */
3161 extern tree skip_simple_arithmetic (tree);
3163 /* Returns the index of the first non-tree operand for CODE, or the number
3164 of operands if all are trees. */
3166 extern int first_rtl_op (enum tree_code);
3168 /* Return which tree structure is used by T. */
3170 enum tree_node_structure_enum tree_node_structure (tree);
3172 /* Reset EXP in place so that it can be expanded again. Does not
3173 recurse into subtrees. */
3175 extern void unsave_expr_1 (tree);
3177 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
3178 or offset that depends on a field within a record.
3180 Note that we only allow such expressions within simple arithmetic
3183 extern bool contains_placeholder_p (tree);
3185 /* This macro calls the above function but short-circuits the common
3186 case of a constant to save time. Also check for null. */
3188 #define CONTAINS_PLACEHOLDER_P(EXP) \
3189 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
3191 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
3192 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
3195 extern bool type_contains_placeholder_p (tree);
3197 /* Return 1 if EXP contains any expressions that produce cleanups for an
3198 outer scope to deal with. Used by fold. */
3200 extern int has_cleanups (tree);
3202 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3203 return a tree with all occurrences of references to F in a
3204 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
3205 contains only arithmetic expressions. */
3207 extern tree substitute_in_expr (tree, tree, tree);
3209 /* This macro calls the above function but short-circuits the common
3210 case of a constant to save time and also checks for NULL. */
3212 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
3213 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
3215 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3216 for it within OBJ, a tree that is an object or a chain of references. */
3218 extern tree substitute_placeholder_in_expr (tree, tree);
3220 /* This macro calls the above function but short-circuits the common
3221 case of a constant to save time and also checks for NULL. */
3223 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
3224 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
3225 : substitute_placeholder_in_expr (EXP, OBJ))
3227 /* variable_size (EXP) is like save_expr (EXP) except that it
3228 is for the special case of something that is part of a
3229 variable size for a data type. It makes special arrangements
3230 to compute the value at the right time when the data type
3231 belongs to a function parameter. */
3233 extern tree variable_size (tree);
3235 /* stabilize_reference (EXP) returns a reference equivalent to EXP
3236 but it can be used multiple times
3237 and only evaluate the subexpressions once. */
3239 extern tree stabilize_reference (tree);
3241 /* Subroutine of stabilize_reference; this is called for subtrees of
3242 references. Any expression with side-effects must be put in a SAVE_EXPR
3243 to ensure that it is only evaluated once. */
3245 extern tree stabilize_reference_1 (tree);
3247 /* Return EXP, stripped of any conversions to wider types
3248 in such a way that the result of converting to type FOR_TYPE
3249 is the same as if EXP were converted to FOR_TYPE.
3250 If FOR_TYPE is 0, it signifies EXP's type. */
3252 extern tree get_unwidened (tree, tree);
3254 /* Return OP or a simpler expression for a narrower value
3255 which can be sign-extended or zero-extended to give back OP.
3256 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3257 or 0 if the value should be sign-extended. */
3259 extern tree get_narrower (tree, int *);
3261 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
3262 look for nested component-refs or array-refs at constant positions
3263 and find the ultimate containing object, which is returned. */
3265 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
3266 tree *, enum machine_mode *, int *, int *);
3268 /* Return 1 if T is an expression that get_inner_reference handles. */
3270 extern int handled_component_p (tree);
3272 /* Return a tree of sizetype representing the size, in bytes, of the element
3273 of EXP, an ARRAY_REF. */
3275 extern tree array_ref_element_size (tree);
3277 /* Return a tree representing the lower bound of the array mentioned in
3278 EXP, an ARRAY_REF. */
3280 extern tree array_ref_low_bound (tree);
3282 /* Return a tree representing the upper bound of the array mentioned in
3283 EXP, an ARRAY_REF. */
3285 extern tree array_ref_up_bound (tree);
3287 /* Return a tree representing the offset, in bytes, of the field referenced
3288 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
3290 extern tree component_ref_field_offset (tree);
3292 /* Given a DECL or TYPE, return the scope in which it was declared, or
3293 NUL_TREE if there is no containing scope. */
3295 extern tree get_containing_scope (tree);
3297 /* Return the FUNCTION_DECL which provides this _DECL with its context,
3299 extern tree decl_function_context (tree);
3301 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
3302 this _DECL with its context, or zero if none. */
3303 extern tree decl_type_context (tree);
3305 /* Return 1 if EXPR is the real constant zero. */
3306 extern int real_zerop (tree);
3308 /* Declare commonly used variables for tree structure. */
3310 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
3311 Zero means allow extended lvalues. */
3313 extern int pedantic_lvalues;
3315 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
3317 extern GTY(()) tree current_function_decl;
3319 /* Nonzero means a FUNC_BEGIN label was emitted. */
3320 extern GTY(()) tree current_function_func_begin_label;
3322 /* A DECL for the current file-scope context. When using IMA, this heads a
3323 chain of FILE_DECLs; currently only C uses it. */
3325 extern GTY(()) tree current_file_decl;
3328 extern unsigned crc32_string (unsigned, const char *);
3329 extern void clean_symbol_name (char *);
3330 extern tree get_file_function_name_long (const char *);
3331 extern tree get_set_constructor_bits (tree, char *, int);
3332 extern tree get_set_constructor_bytes (tree, unsigned char *, int);
3333 extern tree get_callee_fndecl (tree);
3334 extern void change_decl_assembler_name (tree, tree);
3335 extern int type_num_arguments (tree);
3336 extern tree lhd_unsave_expr_now (tree);
3337 extern bool associative_tree_code (enum tree_code);
3338 extern bool commutative_tree_code (enum tree_code);
3343 extern void expand_expr_stmt (tree);
3344 extern void expand_expr_stmt_value (tree, int, int);
3345 extern int warn_if_unused_value (tree, location_t);
3346 extern void expand_decl_init (tree);
3347 extern void expand_label (tree);
3348 extern void expand_goto (tree);
3349 extern void expand_asm (tree, int);
3350 extern void expand_start_cond (tree, int);
3351 extern void expand_end_cond (void);
3352 extern void expand_start_else (void);
3353 extern void expand_start_elseif (tree);
3355 extern void expand_stack_alloc (tree, tree);
3356 extern rtx expand_stack_save (void);
3357 extern void expand_stack_restore (tree);
3358 extern void expand_return (tree);
3359 extern int is_body_block (tree);
3361 extern struct nesting * current_nesting_level (void);
3362 extern void expand_start_case (tree);
3363 extern void expand_end_case_type (tree, tree);
3364 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
3365 extern void add_case_node (tree, tree, tree);
3368 extern void using_eh_for_cleanups (void);
3370 /* In fold-const.c */
3372 /* Fold constants as much as possible in an expression.
3373 Returns the simplified expression.
3374 Acts only on the top level of the expression;
3375 if the argument itself cannot be simplified, its
3376 subexpressions are not changed. */
3378 extern tree fold (tree);
3379 extern tree fold_initializer (tree);
3380 extern tree fold_convert (tree, tree);
3381 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
3382 extern tree fold_ignored_result (tree);
3383 extern tree fold_abs_const (tree, tree);
3385 extern int force_fit_type (tree, int);
3386 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3387 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3388 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3389 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3390 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3391 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3392 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3393 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3394 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3395 HOST_WIDE_INT, unsigned int,
3396 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3397 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3398 HOST_WIDE_INT, unsigned int,
3399 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
3400 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3401 HOST_WIDE_INT, unsigned int,
3402 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3403 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
3404 HOST_WIDE_INT, unsigned int,
3405 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
3407 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
3408 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
3409 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
3410 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
3413 enum operand_equal_flag
3419 extern int operand_equal_p (tree, tree, unsigned int);
3421 extern tree omit_one_operand (tree, tree, tree);
3422 extern tree omit_two_operands (tree, tree, tree, tree);
3423 extern tree invert_truthvalue (tree);
3424 extern tree nondestructive_fold_unary_to_constant (enum tree_code, tree, tree);
3425 extern tree nondestructive_fold_binary_to_constant (enum tree_code, tree, tree, tree);
3426 extern tree fold_read_from_constant_string (tree);
3427 extern tree int_const_binop (enum tree_code, tree, tree, int);
3428 extern tree build_fold_addr_expr (tree);
3429 extern tree build_fold_addr_expr_with_type (tree, tree);
3430 extern tree build_fold_indirect_ref (tree);
3431 extern tree constant_boolean_node (int, tree);
3433 extern bool tree_swap_operands_p (tree, tree, bool);
3434 extern enum tree_code swap_tree_comparison (enum tree_code);
3437 extern tree fold_builtin (tree, bool);
3438 extern tree fold_builtin_fputs (tree, bool, bool, tree);
3439 extern tree fold_builtin_strcpy (tree, tree);
3440 extern tree fold_builtin_strncpy (tree, tree);
3441 extern enum built_in_function builtin_mathfn_code (tree);
3442 extern tree build_function_call_expr (tree, tree);
3443 extern tree mathfn_built_in (tree, enum built_in_function fn);
3444 extern tree strip_float_extensions (tree);
3445 extern tree simplify_builtin (tree, int);
3446 extern tree c_strlen (tree, int);
3447 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
3450 extern tree strip_float_extensions (tree);
3453 extern void record_component_aliases (tree);
3454 extern HOST_WIDE_INT get_alias_set (tree);
3455 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3456 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
3457 extern int readonly_fields_p (tree);
3458 extern int objects_must_conflict_p (tree, tree);
3461 extern int really_constant_p (tree);
3462 extern int int_fits_type_p (tree, tree);
3463 extern bool variably_modified_type_p (tree, tree);
3464 extern int tree_log2 (tree);
3465 extern int tree_floor_log2 (tree);
3466 extern int simple_cst_equal (tree, tree);
3467 extern unsigned int iterative_hash_expr (tree, unsigned int);
3468 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
3469 extern int type_list_equal (tree, tree);
3470 extern int chain_member (tree, tree);
3471 extern tree type_hash_lookup (unsigned int, tree);
3472 extern void type_hash_add (unsigned int, tree);
3473 extern int simple_cst_list_equal (tree, tree);
3474 extern void dump_tree_statistics (void);
3475 extern void expand_function_end (void);
3476 extern void expand_function_start (tree);
3477 extern void expand_pending_sizes (tree);
3478 extern void recompute_tree_invarant_for_addr_expr (tree);
3479 extern bool needs_to_live_in_memory (tree);
3480 extern tree reconstruct_complex_type (tree, tree);
3482 extern int real_onep (tree);
3483 extern int real_twop (tree);
3484 extern int real_minus_onep (tree);
3485 extern void init_ttree (void);
3486 extern void build_common_tree_nodes (int);
3487 extern void build_common_tree_nodes_2 (int);
3488 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
3489 extern tree build_range_type (tree, tree, tree);
3490 extern HOST_WIDE_INT int_cst_value (tree);
3491 extern tree tree_fold_gcd (tree, tree);
3493 extern bool fields_compatible_p (tree, tree);
3494 extern tree find_compatible_field (tree, tree);
3497 extern void expand_main_function (void);
3498 extern void init_dummy_function_start (void);
3499 extern void expand_dummy_function_end (void);
3500 extern void init_function_for_compilation (void);
3501 extern void allocate_struct_function (tree);
3502 extern void init_function_start (tree);
3503 extern bool use_register_for_decl (tree);
3504 extern void assign_parms (tree);
3505 extern void setjmp_vars_warning (tree);
3506 extern void setjmp_args_warning (void);
3507 extern void init_temp_slots (void);
3508 extern void combine_temp_slots (void);
3509 extern void free_temp_slots (void);
3510 extern void pop_temp_slots (void);
3511 extern void push_temp_slots (void);
3512 extern void preserve_temp_slots (rtx);
3513 extern void preserve_rtl_expr_temps (tree);
3514 extern int aggregate_value_p (tree, tree);
3515 extern void push_function_context (void);
3516 extern void pop_function_context (void);
3517 extern void push_function_context_to (tree);
3518 extern void pop_function_context_from (tree);
3520 /* In print-rtl.c */
3522 extern void print_rtl (FILE *, rtx);
3525 /* In print-tree.c */
3526 extern void debug_tree (tree);
3528 extern void print_node (FILE *, const char *, tree, int);
3529 extern void print_node_brief (FILE *, const char *, tree, int);
3530 extern void indent_to (FILE *, int);
3533 /* In tree-inline.c: */
3534 extern bool debug_find_tree (tree, tree);
3537 extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx);
3538 extern void check_max_integer_computation_mode (tree);
3541 extern rtx emit_line_note (location_t);
3545 /* Nonzero if this is a call to a `const' function. */
3547 /* Nonzero if this is a call to a `volatile' function. */
3548 #define ECF_NORETURN 2
3549 /* Nonzero if this is a call to malloc or a related function. */
3550 #define ECF_MALLOC 4
3551 /* Nonzero if it is plausible that this is a call to alloca. */
3552 #define ECF_MAY_BE_ALLOCA 8
3553 /* Nonzero if this is a call to a function that won't throw an exception. */
3554 #define ECF_NOTHROW 16
3555 /* Nonzero if this is a call to setjmp or a related function. */
3556 #define ECF_RETURNS_TWICE 32
3557 /* Nonzero if this is a call to `longjmp'. */
3558 #define ECF_LONGJMP 64
3559 /* Nonzero if this is a syscall that makes a new process in the image of
3561 #define ECF_SIBCALL 128
3562 /* Nonzero if this is a call to "pure" function (like const function,
3563 but may read memory. */
3564 #define ECF_PURE 256
3565 /* Nonzero if this is a call to a function that returns with the stack
3566 pointer depressed. */
3567 #define ECF_SP_DEPRESSED 512
3568 /* Nonzero if this call is known to always return. */
3569 #define ECF_ALWAYS_RETURN 1024
3570 /* Create libcall block around the call. */
3571 #define ECF_LIBCALL_BLOCK 2048
3573 extern int flags_from_decl_or_type (tree);
3574 extern int call_expr_flags (tree);
3576 extern int setjmp_call_p (tree);
3577 extern bool alloca_call_p (tree);
3578 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
3579 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
3583 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3584 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3585 it should be modified in place; if a TYPE, a copy should be created
3586 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3587 information, in the form of a bitwise OR of flags in enum attribute_flags
3588 from tree.h. Depending on these flags, some attributes may be
3589 returned to be applied at a later stage (for example, to apply
3590 a decl attribute to the declaration rather than to its type). */
3591 extern tree decl_attributes (tree *, tree, int);
3593 /* In integrate.c */
3594 extern void set_decl_abstract_flags (tree, int);
3595 extern void set_decl_origin_self (tree);
3597 /* In stor-layout.c */
3598 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
3599 extern void fixup_signed_type (tree);
3600 extern void internal_reference_types (void);
3601 extern unsigned int update_alignment_for_field (record_layout_info, tree,
3604 extern void make_decl_rtl (tree, const char *);
3605 extern void make_decl_one_only (tree);
3606 extern int supports_one_only (void);
3607 extern void variable_section (tree, int);
3608 enum tls_model decl_tls_model (tree);
3609 extern void resolve_unique_section (tree, int, int);
3610 extern void mark_referenced (tree);
3611 extern void mark_decl_referenced (tree);
3612 extern void notice_global_symbol (tree);
3615 extern void emit_nop (void);
3616 extern void expand_computed_goto (tree);
3617 extern bool parse_output_constraint (const char **, int, int, int,
3618 bool *, bool *, bool *);
3619 extern bool parse_input_constraint (const char **, int, int, int, int,
3620 const char * const *, bool *, bool *);
3621 extern void expand_asm_operands (tree, tree, tree, tree, int, location_t);
3622 extern void expand_asm_expr (tree);
3623 extern bool asm_op_is_mem_input (tree, tree);
3624 extern tree resolve_asm_operand_names (tree, tree, tree);
3625 extern void init_stmt_for_function (void);
3626 extern void expand_elseif (tree);
3627 extern void expand_decl (tree);
3628 extern void expand_anon_union_decl (tree, tree, tree);
3630 /* In gimplify.c. */
3631 extern tree create_artificial_label (void);
3632 extern void gimplify_function_tree (tree);
3633 extern const char *get_name (tree);
3634 extern tree unshare_expr (tree);
3635 extern void sort_case_labels (tree);
3637 /* If KIND=='I', return a suitable global initializer (constructor) name.
3638 If KIND=='D', return a suitable global clean-up (destructor) name. */
3639 extern tree get_file_function_name (int);
3641 /* Interface of the DWARF2 unwind info support. */
3643 /* Generate a new label for the CFI info to refer to. */
3645 extern char *dwarf2out_cfi_label (void);
3647 /* Entry point to update the canonical frame address (CFA). */
3649 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
3651 /* Add the CFI for saving a register window. */
3653 extern void dwarf2out_window_save (const char *);
3655 /* Add a CFI to update the running total of the size of arguments pushed
3658 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
3660 /* Entry point for saving a register to the stack. */
3662 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
3664 /* Entry point for saving the return address in the stack. */
3666 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
3668 /* Entry point for saving the return address in a register. */
3670 extern void dwarf2out_return_reg (const char *, unsigned);
3672 /* In tree-inline.c */
3674 /* The type of a callback function for walking over tree structure. */
3676 typedef tree (*walk_tree_fn) (tree *, int *, void *);
3677 extern tree walk_tree (tree*, walk_tree_fn, void*, void*);
3678 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
3680 /* In tree-dump.c */
3682 /* Different tree dump places. When you add new tree dump places,
3683 extend the DUMP_FILES array in tree-dump.c. */
3684 enum tree_dump_index
3686 TDI_none, /* No dump */
3687 TDI_tu, /* dump the whole translation unit. */
3688 TDI_class, /* dump class hierarchy. */
3689 TDI_original, /* dump each function before optimizing it */
3690 TDI_generic, /* dump each function after genericizing it */
3691 TDI_nested, /* dump each function after unnesting it */
3692 TDI_inlined, /* dump each function after inlining
3694 TDI_vcg, /* create a VCG graph file for each
3695 function's flowgraph. */
3696 TDI_xml, /* dump function call graph. */
3697 TDI_all, /* enable all the dumps. */
3701 /* Bit masks to control tree dumping. Not all values are applicable to
3702 all tree dumps. Add new ones at the end. When you define new
3703 values, extend the DUMP_OPTIONS array in tree-dump.c */
3704 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3705 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3706 #define TDF_RAW (1 << 2) /* don't unparse the function */
3707 #define TDF_DETAILS (1 << 3) /* show more detailed info about
3709 #define TDF_STATS (1 << 4) /* dump various statistics about
3711 #define TDF_BLOCKS (1 << 5) /* display basic block boundaries */
3712 #define TDF_VOPS (1 << 6) /* display virtual operands */
3713 #define TDF_LINENO (1 << 7) /* display statement line numbers */
3714 #define TDF_UID (1 << 8) /* display decl UIDs */
3717 typedef struct dump_info *dump_info_p;
3719 extern int dump_flag (dump_info_p, int, tree);
3720 extern int dump_enabled_p (enum tree_dump_index);
3721 extern FILE *dump_begin (enum tree_dump_index, int *);
3722 extern void dump_end (enum tree_dump_index, FILE *);
3723 extern void dump_node (tree, int, FILE *);
3724 extern int dump_switch_p (const char *);
3725 extern const char *dump_flag_name (enum tree_dump_index);
3726 /* Assign the RTX to declaration. */
3728 extern void set_decl_rtl (tree, rtx);
3729 extern void set_decl_incoming_rtl (tree, rtx);
3731 /* Redefine abort to report an internal error w/o coredump, and
3732 reporting the location of the error in the source file. This logic
3733 is duplicated in rtl.h and tree.h because every file that needs the
3734 special abort includes one or both. toplev.h gets too few files,
3735 system.h gets too many. */
3737 extern void fancy_abort (const char *, int, const char *)
3739 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3741 /* Enum and arrays used for tree allocation stats.
3742 Keep in sync with tree.c:tree_node_kind_names. */
3765 extern int tree_node_counts[];
3766 extern int tree_node_sizes[];
3768 /* True if we are in gimple form and the actions of the folders need to
3769 be restricted. False if we are not in gimple form and folding is not
3770 restricted to creating gimple expressions. */
3771 extern bool in_gimple_form;
3773 /* In tree-ssa-loop-niter.c. */
3775 tree lower_bound_in_type (tree, tree);
3776 tree upper_bound_in_type (tree, tree);
3778 #endif /* GCC_TREE_H */
OSDN Git Service
