case REAL_CST:
if (const void *bytes = buf (sizeof (real_value)))
- TREE_REAL_CST_PTR (t)
- = reinterpret_cast<real_value *> (memcpy (ggc_alloc<real_value> (),
- bytes, sizeof (real_value)));
+ memcpy (TREE_REAL_CST_PTR (t), bytes, sizeof (real_value));
break;
case STRING_CST:
struct GTY(()) tree_real_cst {
struct tree_typed typed;
- struct real_value * real_cst_ptr;
+ struct real_value value;
};
struct GTY(()) tree_fixed_cst {
{
unsigned i;
REAL_VALUE_TYPE r;
- REAL_VALUE_TYPE *rp;
/* Clear all bits of the real value type so that we can later do
bitwise comparisons to see if two values are the same. */
for (i = 0; i < SIGSZ; i++)
r.sig[i] = (unsigned long) bp_unpack_value (bp, HOST_BITS_PER_LONG);
- rp = ggc_alloc<real_value> ();
- memcpy (rp, &r, sizeof (REAL_VALUE_TYPE));
- TREE_REAL_CST_PTR (expr) = rp;
+ memcpy (TREE_REAL_CST_PTR (expr), &r, sizeof (REAL_VALUE_TYPE));
}
build_real (tree type, REAL_VALUE_TYPE d)
{
tree v;
- REAL_VALUE_TYPE *dp;
int overflow = 0;
/* dconst{1,2,m1,half} are used in various places in
Consider doing it via real_convert now. */
v = make_node (REAL_CST);
- dp = ggc_alloc<real_value> ();
- memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
-
TREE_TYPE (v) = type;
- TREE_REAL_CST_PTR (v) = dp;
+ memcpy (TREE_REAL_CST_PTR (v), &d, sizeof (REAL_VALUE_TYPE));
TREE_OVERFLOW (v) = overflow;
return v;
}
#define POLY_INT_CST_COEFF(NODE, I) \
(POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I])
-#define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
+#define TREE_REAL_CST_PTR(NODE) (&REAL_CST_CHECK (NODE)->real_cst.value)
#define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
#define TREE_FIXED_CST_PTR(NODE) \