#undef DEFTREECODE
-/* Number of tree codes. */
-#define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE)
+/* Number of language-independent tree codes. */
+#define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
/* Indexed by enum tree_code, contains a character which is
`<' for a comparison expression, `1', for a unary arithmetic
/* Number of argument-words in each kind of tree-node. */
extern int tree_code_length[MAX_TREE_CODES];
+#define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
/* Names of tree components. */
/* Names for the above. */
extern const char *const built_in_names[(int) END_BUILTINS];
+
+/* An array of _DECL trees for the above. */
+extern union tree_node *built_in_decls[(int) END_BUILTINS];
\f
/* The definition of tree nodes fills the next several pages. */
unsigned public_flag : 1;
unsigned private_flag : 1;
unsigned protected_flag : 1;
+ unsigned bounded_flag : 1;
unsigned lang_flag_0 : 1;
unsigned lang_flag_1 : 1;
unsigned lang_flag_4 : 1;
unsigned lang_flag_5 : 1;
unsigned lang_flag_6 : 1;
-
- /* There is room for three more flags. */
};
/* The following table lists the uses of each of the above flags and
addressable_flag:
TREE_ADDRESSABLE in
- VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
- IDENTIFIER_NODE
+ VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
+ ..._TYPE, IDENTIFIER_NODE
static_flag:
TREE_READONLY in
all expressions
- ITERATOR_BOUND_P in
- VAR_DECL if iterator (C)
TYPE_READONLY in
..._TYPE
TREE_NOTHROW in
CALL_EXPR, FUNCTION_DECL
- */
+ bounded_flag:
+
+ TREE_BOUNDED in
+ expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL
+ TYPE_BOUNDED in
+ ..._TYPE
+*/
+
/* Define accessors for the fields that all tree nodes have
(though some fields are not used for all kinds of nodes). */
is accessed incorrectly. The macros abort with a fatal error. */
#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
-#define TREE_CHECK(t, code) \
+#define TREE_CHECK(t, code) __extension__ \
({ const tree __t = t; \
if (TREE_CODE(__t) != (code)) \
- tree_check_failed (__t, code, __FILE__, \
- __LINE__, __PRETTY_FUNCTION__); \
+ tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
__t; })
-#define TREE_CLASS_CHECK(t, class) \
+#define TREE_CLASS_CHECK(t, class) __extension__ \
({ const tree __t = t; \
if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
- tree_class_check_failed (__t, class, __FILE__, \
- __LINE__, __PRETTY_FUNCTION__); \
+ tree_class_check_failed (__t, class, __FILE__, __LINE__, __FUNCTION__); \
__t; })
/* These checks have to be special cased. */
-#define CST_OR_CONSTRUCTOR_CHECK(t) \
+#define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
({ const tree __t = t; \
enum tree_code __c = TREE_CODE(__t); \
if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
- tree_check_failed (__t, CONSTRUCTOR, __FILE__, \
- __LINE__, __PRETTY_FUNCTION__); \
+ tree_check_failed (__t, CONSTRUCTOR, __FILE__, __LINE__, __FUNCTION__); \
__t; })
-#define EXPR_CHECK(t) \
+#define EXPR_CHECK(t) __extension__ \
({ const tree __t = t; \
char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
if (__c != 'r' && __c != 's' && __c != '<' \
&& __c != '1' && __c != '2' && __c != 'e') \
- tree_class_check_failed(__t, 'e', __FILE__, \
- __LINE__, __PRETTY_FUNCTION__); \
+ tree_class_check_failed(__t, 'e', __FILE__, __LINE__, __FUNCTION__); \
__t; })
extern void tree_check_failed PARAMS ((const tree, enum tree_code,
- const char *, int, const char *))
+ const char *, int, const char *))
ATTRIBUTE_NORETURN;
-extern void tree_class_check_failed PARAMS ((const tree, char,
- const char *, int, const char *))
+extern void tree_class_check_failed PARAMS ((const tree, int,
+ const char *, int, const char *))
ATTRIBUTE_NORETURN;
#else /* not ENABLE_TREE_CHECKING, or not gcc */
/* In all nodes that are expressions, this is the data type of the expression.
In POINTER_TYPE nodes, this is the type that the pointer points to.
- In ARRAY_TYPE nodes, this is the type of the elements. */
+ In ARRAY_TYPE nodes, this is the type of the elements.
+ In VECTOR_TYPE nodes, this is the type of the elements. */
#define TREE_TYPE(NODE) ((NODE)->common.type)
/* Nodes are chained together for many purposes.
/* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
that don't change the machine mode. */
-#define STRIP_NOPS(EXP) \
+#define STRIP_NOPS(EXP) \
while ((TREE_CODE (EXP) == NOP_EXPR \
|| TREE_CODE (EXP) == CONVERT_EXPR \
|| TREE_CODE (EXP) == NON_LVALUE_EXPR) \
+ && TREE_OPERAND (EXP, 0) != error_mark_node \
&& (TYPE_MODE (TREE_TYPE (EXP)) \
== TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
(EXP) = TREE_OPERAND (EXP, 0);
while ((TREE_CODE (EXP) == NOP_EXPR \
|| TREE_CODE (EXP) == CONVERT_EXPR \
|| TREE_CODE (EXP) == NON_LVALUE_EXPR) \
+ && TREE_OPERAND (EXP, 0) != error_mark_node \
&& (TYPE_MODE (TREE_TYPE (EXP)) \
== TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
&& (TREE_UNSIGNED (TREE_TYPE (EXP)) \
while ((TREE_CODE (EXP) == NOP_EXPR \
|| TREE_CODE (EXP) == CONVERT_EXPR \
|| TREE_CODE (EXP) == NON_LVALUE_EXPR) \
+ && TREE_OPERAND (EXP, 0) != error_mark_node \
&& (TREE_TYPE (EXP) \
== TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
(EXP) = TREE_OPERAND (EXP, 0);
|| TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
|| TREE_CODE (TYPE) == SET_TYPE)
-/* Nonzero if TYPE represents a pointer type. */
+/* Nonzero if TYPE represents an unbounded pointer or unbounded
+ reference type. (It should be renamed to INDIRECT_TYPE_P.) */
#define POINTER_TYPE_P(TYPE) \
(TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
+/* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
+
+#define BOUNDED_INDIRECT_TYPE_P(TYPE) \
+ (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
+
+/* Nonzero if TYPE represents a bounded pointer type. */
+
+#define BOUNDED_POINTER_TYPE_P(TYPE) \
+ (BOUNDED_INDIRECT_TYPE_P (TYPE) \
+ && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
+
+/* Nonzero if TYPE represents a bounded reference type. Bounded
+ reference types have two specific uses: (1) When a reference is
+ seated to a variable-length RECORD_TYPE that has an array of
+ indeterminate length as its final field. For all other objects, it
+ is sufficient to check bounds at the time the reference is seated,
+ and assume that all future uses of the reference are safe, since
+ the address of references cannot change. (2) When a reference
+ supertype is seated to an subtype object. The bounds "remember"
+ the true size of the complete object, so that subsequent upcasts of
+ the address of the reference will be checked properly (is such a
+ thing valid C++?). */
+
+#define BOUNDED_REFERENCE_TYPE_P(TYPE) \
+ (BOUNDED_INDIRECT_TYPE_P (TYPE) \
+ && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
+
+/* Nonzero if TYPE represents a pointer or reference type, either
+ bounded or unbounded. */
+
+#define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
+ (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
+
+/* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
+
+#define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
+ (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
+
+/* Nonzero if TYPE represents a reference type, either bounded or unbounded. */
+
+#define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
+ (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
+
/* Nonzero if this type is a complete type. */
#define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
+/* Nonzero if this type is the (possibly qualified) void type. */
+#define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
+
/* Nonzero if this type is complete or is cv void. */
#define COMPLETE_OR_VOID_TYPE_P(NODE) \
- (COMPLETE_TYPE_P (NODE) || TREE_CODE (NODE) == VOID_TYPE)
+ (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
/* Nonzero if this type is complete or is an array with unspecified bound. */
#define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
So it cannot be in a register.
In a FUNCTION_DECL, nonzero means its address is needed.
So it must be compiled even if it is an inline function.
+ In a FIELD_DECL node, it means that the programmer is permitted to
+ construct the address of this field. This is used for aliasing
+ purposes: see record_component_aliases.
In CONSTRUCTOR nodes, it means object constructed must be in memory.
In LABEL_DECL nodes, it means a goto for this label has been seen
from a place outside all binding contours that restore stack levels.
In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
#define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
+/* In a ..._TYPE node, nonzero means that the type's size and layout,
+ (or the size and layout of its arguments and/or return value in the
+ case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
+ of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
+ node is a type, because eventually we may make that a different
+ bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
+ type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
+ BOUNDED_INDIRECT_TYPE_P to test for that.
+
+ In a FUNCTION_DECL, nonzero means that the size and layout of one
+ of its arguments and/or return value was changed by the presence of
+ pointer bounds. This value can differ from the value of
+ TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
+ declared, then later called with pointer args, or was declared with
+ a variable argument list and is later called with pointer values in
+ the variable argument list.
+
+ In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
+ of the decl's type's BOUNDED_POINTER_TYPE_P.
+
+ In a CONSTRUCTOR or other expression, nonzero means the value is a
+ bounded pointer. It is insufficient to determine the boundedness
+ of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
+ since we allow pointer to be temporarily cast to integer for
+ rounding up to an alignment boudary in a way that preserves the
+ pointer's bounds.
+
+ In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
+ BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
+ of a function that has bounded pointer(s) for its return type and/or
+ argument type(s). */
+
+#define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
+
/* These flags are available for each language front end to use internally. */
#define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
#define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
If the data type is signed, the value is sign-extended to 2 words
even though not all of them may really be in use.
In an unsigned constant shorter than 2 words, the extra bits are 0. */
-#define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
-#define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
+#define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
+#define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
+#define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
#define INT_CST_LT(A, B) \
(TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
struct tree_int_cst
{
- char common[sizeof (struct tree_common)];
+ struct tree_common common;
struct rtx_def *rtl; /* acts as link to register transfer language
(rtl) info */
- unsigned HOST_WIDE_INT int_cst_low;
- HOST_WIDE_INT int_cst_high;
+ /* A sub-struct is necessary here because the function `const_hash'
+ wants to scan both words as a unit and taking the address of the
+ sub-struct yields the properly inclusive bounded pointer. */
+ struct {
+ unsigned HOST_WIDE_INT low;
+ HOST_WIDE_INT high;
+ } int_cst;
};
/* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
struct tree_real_cst
{
- char common[sizeof (struct tree_common)];
+ struct tree_common common;
struct rtx_def *rtl; /* acts as link to register transfer language
(rtl) info */
REAL_VALUE_TYPE real_cst;
struct tree_string
{
- char common[sizeof (struct tree_common)];
+ struct tree_common common;
struct rtx_def *rtl; /* acts as link to register transfer language
(rtl) info */
int length;
struct tree_complex
{
- char common[sizeof (struct tree_common)];
+ struct tree_common common;
struct rtx_def *rtl; /* acts as link to register transfer language
(rtl) info */
union tree_node *real;
struct tree_identifier
{
- char common[sizeof (struct tree_common)];
+ struct tree_common common;
int length;
- char *pointer;
+ const char *pointer;
};
/* In a TREE_LIST node. */
struct tree_list
{
- char common[sizeof (struct tree_common)];
+ struct tree_common common;
union tree_node *purpose;
union tree_node *value;
};
struct tree_vec
{
- char common[sizeof (struct tree_common)];
+ struct tree_common common;
int length;
union tree_node *a[1];
};
struct tree_exp
{
- char common[sizeof (struct tree_common)];
+ struct tree_common common;
int complexity;
union tree_node *operands[1];
};
struct tree_block
{
- char common[sizeof (struct tree_common)];
+ struct tree_common common;
unsigned handler_block_flag : 1;
unsigned abstract_flag : 1;
#define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
#define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
+/* For a VECTOR_TYPE node, this describes a different type which is emitted
+ in the debugging output. We use this to describe a vector as a
+ structure containing an array. */
+#define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
+
+/* Indirect types present difficulties because they may be represented
+ as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
+ RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
+ be logically equivalent, but physically different. Simple
+ comparison of the main variant only tells if the types are
+ logically equivalent. Use this predicate to compare for physical
+ equivalency. */
+
+/* Types have the same main variant, and have the same boundedness. */
+#define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
+ (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
+ && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
+
+/* Return the type variant that has no qualifiers (i.e., the main variant),
+ except that the boundedness qualifier is preserved. */
+#define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
+ (BOUNDED_POINTER_TYPE_P (TYPE) \
+ ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
+ : TYPE_MAIN_VARIANT (TYPE))
+
/* For aggregate types, information about this type, as a base type
for itself. Used in a language-dependent way for types that are
neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
The value is an int, measured in bits. */
#define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
+/* 1 if the alignment for this type was requested by "aligned" attribute,
+ 0 if it is the default for this type. */
+#define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
+
/* The alignment for NODE, in bytes. */
#define TYPE_ALIGN_UNIT(NODE) \
(TYPE_ALIGN (NODE) / BITS_PER_UNIT)
/* In an INTEGER_TYPE, it means the type represents a size. We use this
both for validity checking and to permit optimziations that are unsafe
for other types. */
-#define TYPE_IS_SIZETYPE(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
+#define TYPE_IS_SIZETYPE(NODE) \
+ (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
+
+/* In a FUNCTION_TYPE, indicates that the function returns with the stack
+ pointer depressed. */
+#define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
+ (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
/* Nonzero in a type considered volatile as a whole. */
#define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
the term. */
#define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
+/* If nonzero, this type's size and layout, (or the size and layout of
+ its arguments and/or return value in the case of a FUNCTION_TYPE or
+ METHOD_TYPE) was changed by the presence of pointer bounds. */
+#define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
+
/* There is a TYPE_QUAL value for each type qualifier. They can be
combined by bitwise-or to form the complete set of qualifiers for a
type. */
#define TYPE_QUAL_CONST 0x1
#define TYPE_QUAL_VOLATILE 0x2
#define TYPE_QUAL_RESTRICT 0x4
+#define TYPE_QUAL_BOUNDED 0x8
/* The set of type qualifiers for this type. */
-#define TYPE_QUALS(NODE) \
- ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) \
- | (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) \
- | (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT))
+#define TYPE_QUALS(NODE) \
+ ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
+ | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
+ | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
+ | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
+
+/* The set of qualifiers pertinent to an expression node. */
+#define TREE_EXPR_QUALS(NODE) \
+ ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
+ | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
+ | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
+
+/* The set of qualifiers pertinent to a FUNCTION_DECL node. */
+#define TREE_FUNC_QUALS(NODE) \
+ ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
+ | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
/* These flags are available for each language front end to use internally. */
#define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
#define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
-/* Indicates that objects of this type must be initialized by calling a
+/* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
+#define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) (GET_MODE_NUNITS (TYPE_CHECK (VECTOR_TYPE)->type.mode))
+
+ /* Indicates that objects of this type must be initialized by calling a
function when they are created. */
-#define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
+#define TYPE_NEEDS_CONSTRUCTING(NODE) \
+ (TYPE_CHECK (NODE)->type.needs_constructing_flag)
/* Indicates that objects of this type (a UNION_TYPE), should be passed
the same way that the first union alternative would be passed. */
-#define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
+#define TYPE_TRANSPARENT_UNION(NODE) \
+ (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
+
+/* For an ARRAY_TYPE, indicates that it is not permitted to
+ take the address of a component of the type. */
+#define TYPE_NONALIASED_COMPONENT(NODE) \
+ (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
/* Indicated that objects of this type should be laid out in as
compact a way as possible. */
#define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
+/* A bounded pointer or bounded reference type (collectively called
+ indirect types) is represented as a RECORD_TYPE node containing
+ three pointer fields whose type is the corresponding unbounded
+ POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
+ a bounded indirect type differs from a normal RECORD_TYPE node in
+ that its TREE_TYPE is non-NULL and has the pointed-to type just as
+ a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
+ nodes are stored on the same type variant chain alongside the
+ variants of the underlaying indirect types nodes. The main variant
+ of such chains is always the unbounded type. */
+
+/* Access the field decls of a bounded-pointer type. */
+#define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
+#define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
+#define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
+
+/* Access the simple-pointer subtype of a bounded-pointer type. */
+#define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
+
+/* Find the unbounded counterpart to a type, or return TYPE if it is
+ already unbounded. */
+#define TYPE_UNBOUNDED_VARIANT(TYPE) \
+ (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
+
+/* This field comprises two bits, for values in the range 0..3:
+
+ depth=0 means that type is a scalar, or an aggregate that contains
+ only depth=0 types, or a function that has only depth=0 types for
+ its return value and argument types.
+
+ depth=1 means that type is a pointer to a depth=0 type, or an
+ aggregate that contains only depth=0 and depth=1 types, or a
+ function that has only depth=0 and depth=1 types for its return
+ value and argument types.
+
+ The meanings of depth=2 and depth=3 are obvious by induction.
+ Varargs functions are depth=3. The type `va_list' is depth=3.
+
+ The purpose of measuring pointer depth of a type is to determine
+ the eligibility of a function for an automatically-generated
+ bounded-pointer thunk. A depth=0 functions needs no thunk. A
+ depth=1 function is eligible for an automatic thunk. Functions
+ with depth 2 or more are too complex to get automatic thunks.
+
+ Function decls also have a pointer_depth field, since we also
+ consider the actual argument types for functions. */
+
+#define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
+
+/* In a FUNCTION_TYPE node, this bit stores the value of
+ default_pointer_boundedness at the time TYPE was created. It is
+ useful for choosing default boundedness of function arguments for
+ non-prototype function decls and for varargs/stdarg lists. */
+#define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
+ (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
+
+#define MAX_POINTER_DEPTH 2
+#define VA_LIST_POINTER_DEPTH 3
+
struct tree_type
{
- char common[sizeof (struct tree_common)];
+ struct tree_common common;
union tree_node *values;
union tree_node *size;
union tree_node *size_unit;
unsigned transparent_union_flag : 1;
unsigned packed_flag : 1;
unsigned restrict_flag : 1;
+ unsigned pointer_depth : 2;
unsigned lang_flag_0 : 1;
unsigned lang_flag_1 : 1;
unsigned lang_flag_4 : 1;
unsigned lang_flag_5 : 1;
unsigned lang_flag_6 : 1;
- /* room for 3 more bits */
+ unsigned user_align : 1;
unsigned int align;
union tree_node *pointer_to;
union tree_node *noncopied_parts;
union tree_node *context;
struct obstack *obstack;
- int alias_set;
+ HOST_WIDE_INT alias_set;
/* Points to a structure whose details depend on the language in use. */
struct lang_type *lang_specific;
};
#define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
/* Holds the alignment required for the datum. */
#define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
-/* For FIELD_DECLs, holds the alignment that DECL_FIELD_OFFSET has. */
-#define DECL_OFFSET_ALIGN(NODE) (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
+/* For FIELD_DECLs, off_align holds the number of low-order bits of
+ DECL_FIELD_OFFSET which are known to be always zero.
+ DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
+ has. */
+#define DECL_OFFSET_ALIGN(NODE) \
+ (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
+/* Specify that DECL_ALIGN(NODE) is a multiple of X. */
+#define SET_DECL_OFFSET_ALIGN(NODE, X) \
+ (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
+/* 1 if the alignment for this type was requested by "aligned" attribute,
+ 0 if it is the default for this type. */
+#define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
/* Holds the machine mode corresponding to the declaration of a variable or
field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
FIELD_DECL. */
#define DECL_ORIGIN(NODE) \
(DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
-/* Nonzero for any sort of ..._DECL node means this decl node represents
- an inline instance of some original (abstract) decl from an inline function;
- suppress any warnings about shadowing some other variable.
- FUNCTION_DECL nodes can also have their abstract origin set to themselves
- (see save_for_inline_copying). */
+/* Nonzero for any sort of ..._DECL node means this decl node represents an
+ inline instance of some original (abstract) decl from an inline function;
+ suppress any warnings about shadowing some other variable. FUNCTION_DECL
+ nodes can also have their abstract origin set to themselves. */
#define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \
&& DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
an address constant. */
#define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
+/* Used in a FIELD_DECL to indicate that we cannot form the address of
+ this component. */
+#define DECL_NONADDRESSABLE_P(NODE) \
+ (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
+
/* Used to indicate an alias set for the memory pointed to by this
particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
pointer (or reference) type. */
#define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
(DECL_POINTER_ALIAS_SET (NODE) != - 1)
+/* The pointer_depth field comprises two bits for values in the range
+ 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
+ type node, but for functions it migth be greater. For example,
+ this can happen when the function is declared to accept a parameter
+ of type void* (depth=1), but is actually called with an argument of
+ type foo** (depth=2). The function type will get the formal
+ parameter's depth, but the function decl will get the actual
+ argument's depth. */
+#define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
+
struct tree_decl
{
- char common[sizeof (struct tree_common)];
- char *filename;
+ struct tree_common common;
+ const char *filename;
int linenum;
unsigned int uid;
union tree_node *size;
unsigned comdat_flag : 1;
unsigned malloc_flag : 1;
unsigned no_limit_stack : 1;
- unsigned pure_flag : 1;
ENUM_BITFIELD(built_in_class) built_in_class : 2;
+ unsigned pure_flag : 1;
+ unsigned pointer_depth : 2;
+ unsigned non_addressable : 1;
+ unsigned user_align : 1;
+ /* Three unused bits. */
+
unsigned lang_flag_0 : 1;
unsigned lang_flag_1 : 1;
unsigned lang_flag_2 : 1;
} u2;
union tree_node *vindex;
- int pointer_alias_set;
+ HOST_WIDE_INT pointer_alias_set;
/* Points to a structure whose details depend on the language in use. */
struct lang_decl *lang_specific;
};
TI_PTRDIFF_TYPE,
TI_VA_LIST_TYPE,
+ TI_V4SF_TYPE,
+ TI_V4SI_TYPE,
+ TI_V8QI_TYPE,
+ TI_V4HI_TYPE,
+ TI_V2SI_TYPE,
+
+ TI_MAIN_IDENTIFIER,
+
TI_MAX
};
#define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
#define va_list_type_node global_trees[TI_VA_LIST_TYPE]
+#define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
+#define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
+
+#define V4SF_type_node global_trees[TI_V4SF_TYPE]
+#define V4SI_type_node global_trees[TI_V4SI_TYPE]
+#define V8QI_type_node global_trees[TI_V8QI_TYPE]
+#define V4HI_type_node global_trees[TI_V4HI_TYPE]
+#define V2SI_type_node global_trees[TI_V2SI_TYPE]
+
/* An enumeration of the standard C integer types. These must be
ordered so that shorter types appear before longer ones. */
enum integer_type_kind
extern char *savealloc PARAMS ((int));
extern char *expralloc PARAMS ((int));
+/* Compute the number of bytes occupied by 'node'. This routine only
+ looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
+
+extern size_t tree_size PARAMS ((tree));
+
/* Lowest level primitive for allocating a node.
The TREE_CODE is the only argument. Contents are initialized
to zero except for a few of the common fields. */
/* Construct various types of nodes. */
#define build_int_2(LO,HI) \
- build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
+ build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
extern tree build PARAMS ((enum tree_code, tree, ...));
extern tree build_nt PARAMS ((enum tree_code, ...));
extern tree build_parse_node PARAMS ((enum tree_code, ...));
-extern tree build_int_2_wide PARAMS ((HOST_WIDE_INT, HOST_WIDE_INT));
+extern tree build_int_2_wide PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT));
extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE));
extern tree build_real_from_int_cst PARAMS ((tree, tree));
extern tree build_complex PARAMS ((tree, tree, tree));
extern int attribute_list_contained PARAMS ((tree, tree));
extern int tree_int_cst_equal PARAMS ((tree, tree));
extern int tree_int_cst_lt PARAMS ((tree, tree));
+extern int tree_int_cst_compare PARAMS ((tree, tree));
extern int host_integerp PARAMS ((tree, int));
extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
extern int tree_int_cst_msb PARAMS ((tree));
extern int tree_int_cst_sgn PARAMS ((tree));
-extern int tree_expr_nonnegative_p PARAMS ((tree));
+extern int tree_expr_nonnegative_p PARAMS ((tree));
+extern int rtl_expr_nonnegative_p PARAMS ((struct rtx_def *));
extern int index_type_equal PARAMS ((tree, tree));
extern tree get_inner_array_type PARAMS ((tree));
fields. Then, call finish_record_layout. See layout_type for the
default way in which these functions are used. */
-typedef struct record_layout_info
+typedef struct record_layout_info_s
{
/* The RECORD_TYPE that we are laying out. */
tree t;
#define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
extern tree round_up PARAMS ((tree, int));
+extern tree round_down PARAMS ((tree, int));
extern tree get_pending_sizes PARAMS ((void));
extern void put_pending_sizes PARAMS ((tree));
/* Points to the name of the input file from which the current input
being parsed originally came (before it went into cpp). */
-extern char *input_filename;
+extern const char *input_filename;
/* Current line number in input file. */
extern int lineno;
extern void (*incomplete_decl_finalize_hook) PARAMS ((tree));
-extern char *init_parse PARAMS ((char *));
+extern const char *init_parse PARAMS ((const char *));
extern void finish_parse PARAMS ((void));
extern const char * const language_string;
\f
/* In tree.c */
extern char *perm_calloc PARAMS ((int, long));
-extern tree get_file_function_name PARAMS ((int));
+extern void clean_symbol_name PARAMS ((char *));
extern tree get_file_function_name_long PARAMS ((const char *));
extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
extern tree get_set_constructor_bytes PARAMS ((tree,
unsigned char *, int));
-extern int get_alias_set PARAMS ((tree));
-extern int new_alias_set PARAMS ((void));
-extern int (*lang_get_alias_set) PARAMS ((tree));
extern tree get_callee_fndecl PARAMS ((tree));
\f
/* In stmt.c */
extern void expand_start_case PARAMS ((int, tree, tree,
const char *));
extern void expand_end_case PARAMS ((tree));
+extern int add_case_node PARAMS ((tree, tree,
+ tree, tree *));
extern int pushcase PARAMS ((tree,
tree (*) (tree, tree),
tree, tree *));
extern tree (*lang_type_promotes_to) PARAMS ((tree));
\f
-/* Interface of the DWARF2 unwind info support. */
-
-/* Decide whether we want to emit frame unwind information for the current
- translation unit. */
-
-extern int dwarf2out_do_frame PARAMS ((void));
-
-/* Generate a new label for the CFI info to refer to. */
-
-extern char *dwarf2out_cfi_label PARAMS ((void));
-
-/* Entry point to update the canonical frame address (CFA). */
-
-extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
-
-/* Add the CFI for saving a register window. */
-
-extern void dwarf2out_window_save PARAMS ((char *));
-
-/* Add a CFI to update the running total of the size of arguments pushed
- onto the stack. */
-
-extern void dwarf2out_args_size PARAMS ((char *, long));
-
-/* Entry point for saving a register to the stack. */
-
-extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
-
-/* Entry point for saving the return address in the stack. */
-
-extern void dwarf2out_return_save PARAMS ((char *, long));
-
-/* Entry point for saving the return address in a register. */
-
-extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
-
-/* Output a marker (i.e. a label) for the beginning of a function, before
- the prologue. */
-
-extern void dwarf2out_begin_prologue PARAMS ((void));
-
-/* Output a marker (i.e. a label) for the absolute end of the generated
- code for a function definition. */
-
-extern void dwarf2out_end_epilogue PARAMS ((void));
-\f
/* The language front-end must define these functions. */
/* Function of no arguments for initializing options. */
extern void push_obstacks_nochange PARAMS ((void));
extern void permanent_allocation PARAMS ((int));
-
extern void push_momentary PARAMS ((void));
-
extern void clear_momentary PARAMS ((void));
-
extern void pop_momentary PARAMS ((void));
-
extern void end_temporary_allocation PARAMS ((void));
/* Pop the obstack selection stack. */
extern void pop_obstacks PARAMS ((void));
+/* In alias.c */
+extern void record_component_aliases PARAMS ((tree));
+extern HOST_WIDE_INT get_alias_set PARAMS ((tree));
+
+/* In c-common.c */
+extern HOST_WIDE_INT lang_get_alias_set PARAMS ((tree));
+
/* In tree.c */
extern int really_constant_p PARAMS ((tree));
extern void push_obstacks PARAMS ((struct obstack *,
extern void saveable_allocation PARAMS ((void));
extern void temporary_allocation PARAMS ((void));
extern void resume_temporary_allocation PARAMS ((void));
-extern tree get_file_function_name PARAMS ((int));
extern void set_identifier_size PARAMS ((int));
extern int int_fits_type_p PARAMS ((tree, tree));
extern int tree_log2 PARAMS ((tree));
extern void print_obstack_statistics PARAMS ((const char *,
struct obstack *));
#ifdef BUFSIZ
-extern void print_obstack_name PARAMS ((char *, FILE *, const char *));
+extern void print_obstack_name PARAMS ((char *, FILE *,
+ const char *));
#endif
-extern void expand_function_end PARAMS ((char *, int, int));
+extern void expand_function_end PARAMS ((const char *, int, int));
extern void expand_function_start PARAMS ((tree, int));
+
extern int real_onep PARAMS ((tree));
extern int real_twop PARAMS ((tree));
extern void start_identifier_warnings PARAMS ((void));
extern void init_dummy_function_start PARAMS ((void));
extern void expand_dummy_function_end PARAMS ((void));
extern void init_function_for_compilation PARAMS ((void));
-extern void init_function_start PARAMS ((tree, char *, int));
+extern void init_function_start PARAMS ((tree, const char *, int));
extern void assign_parms PARAMS ((tree));
extern void put_var_into_stack PARAMS ((tree));
extern void flush_addressof PARAMS ((tree));
/* In print-tree.c */
extern void debug_tree PARAMS ((tree));
#ifdef BUFSIZ
-extern void print_node PARAMS ((FILE *, const char *, tree, int));
-extern void print_node_brief PARAMS ((FILE *, const char *, tree, int));
+extern void print_node PARAMS ((FILE *, const char *, tree,
+ int));
+extern void print_node_brief PARAMS ((FILE *, const char *, tree,
+ int));
extern void indent_to PARAMS ((FILE *, int));
#endif
extern struct rtx_def *expand_builtin_return_addr
PARAMS ((enum built_in_function, int, struct rtx_def *));
extern void do_pending_stack_adjust PARAMS ((void));
-extern struct rtx_def *expand_assignment PARAMS ((tree, tree, int, int));
-extern struct rtx_def *store_expr PARAMS ((tree, struct rtx_def *,
+extern struct rtx_def *expand_assignment PARAMS ((tree, tree, int,
+ int));
+extern struct rtx_def *store_expr PARAMS ((tree,
+ struct rtx_def *,
int));
extern void check_max_integer_computation_mode PARAMS ((tree));
/* In calls.c */
-/* Flags used by special_function_p. */
extern int setjmp_call_p PARAMS ((tree));
-/* In c-typeck.c */
+/* In front end. */
+
extern int mark_addressable PARAMS ((tree));
extern void incomplete_type_error PARAMS ((tree, tree));
-
-/* In c-lang.c */
extern void print_lang_statistics PARAMS ((void));
-
-/* In c-common.c */
extern tree truthvalue_conversion PARAMS ((tree));
extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
-
-/* In c-decl.c */
#ifdef BUFSIZ
extern void print_lang_decl PARAMS ((FILE *, tree, int));
extern void print_lang_type PARAMS ((FILE *, tree, int));
extern void insert_block PARAMS ((tree));
/* In integrate.c */
-extern void save_for_inline_nocopy PARAMS ((tree));
-extern void save_for_inline_copying PARAMS ((tree));
+extern void save_for_inline PARAMS ((tree));
extern void set_decl_abstract_flags PARAMS ((tree, int));
extern void output_inline_function PARAMS ((tree));
+extern void set_decl_origin_self PARAMS ((tree));
-/* In c-lex.c */
+/* In front end. */
extern void set_yydebug PARAMS ((int));
/* In stor-layout.c */
extern void expand_computed_goto PARAMS ((tree));
extern struct rtx_def *label_rtx PARAMS ((tree));
extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
- char *, int));
+ const char *, int));
extern int any_pending_cleanups PARAMS ((int));
extern void init_stmt PARAMS ((void));
extern void init_stmt_for_function PARAMS ((void));
extern void expand_start_target_temps PARAMS ((void));
extern void expand_end_target_temps PARAMS ((void));
extern void expand_elseif PARAMS ((tree));
+extern void save_stack_pointer PARAMS ((void));
extern void expand_decl PARAMS ((tree));
extern int expand_decl_cleanup PARAMS ((tree, tree));
extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
/* Entry point to update the canonical frame address (CFA). */
-extern void dwarf2out_def_cfa PARAMS ((char *, unsigned, long));
+extern void dwarf2out_def_cfa PARAMS ((const char *, unsigned, long));
/* Add the CFI for saving a register window. */
-extern void dwarf2out_window_save PARAMS ((char *));
+extern void dwarf2out_window_save PARAMS ((const char *));
/* Add a CFI to update the running total of the size of arguments pushed
onto the stack. */
-extern void dwarf2out_args_size PARAMS ((char *, long));
+extern void dwarf2out_args_size PARAMS ((const char *, long));
/* Entry point for saving a register to the stack. */
-extern void dwarf2out_reg_save PARAMS ((char *, unsigned, long));
+extern void dwarf2out_reg_save PARAMS ((const char *, unsigned, long));
/* Entry point for saving the return address in the stack. */
-extern void dwarf2out_return_save PARAMS ((char *, long));
+extern void dwarf2out_return_save PARAMS ((const char *, long));
/* Entry point for saving the return address in a register. */
-extern void dwarf2out_return_reg PARAMS ((char *, unsigned));
+extern void dwarf2out_return_reg PARAMS ((const char *, unsigned));
/* Output a marker (i.e. a label) for the beginning of a function, before
the prologue. */
code for a function definition. */
extern void dwarf2out_end_epilogue PARAMS ((void));
-
+\f
/* Redefine abort to report an internal error w/o coredump, and
reporting the location of the error in the source file. This logic
is duplicated in rtl.h and tree.h because every file that needs the
extern void fancy_abort PARAMS ((const char *, int, const char *))
ATTRIBUTE_NORETURN;
-#if (GCC_VERSION >= 2007)
-#define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__)
-#else
-#define abort() fancy_abort (__FILE__, __LINE__, 0)
-#endif
+#define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)