+2017-10-02 Richard Sandiford <richard.sandiford@linaro.org>
+
+ * tree.h (wi::int_traits <const_tree>::decompose): Assert that the
+ requested precision matches the type's.
+ * calls.c (alloc_max_size): Calculate the new candidate size as
+ a widest_int and use wi::to_widest when comparing it with the
+ current candidate size.
+ * gimple-ssa-warn-alloca.c (pass_walloca::execute): Compare with
+ zero rather than integer_zero_node.
+ * match.pd: Check for a no-op conversion before using wi::add
+ rather than after. Use tree_to_uhwi when summing small shift
+ counts into an unsigned int.
+
2017-10-02 Richard Sandiford <richard.sandiford@linaro.org>
Alan Hayward <alan.hayward@arm.com>
David Sherwood <david.sherwood@arm.com>
+2017-10-02 Richard Sandiford <richard.sandiford@linaro.org>
+
+ * gcc-interface/decl.c (annotate_value): Use wi::to_widest when
+ handling the form (plus/mult (convert @0) @1).
+
2017-09-29 Bob Duff <duff@adacore.com>
* exp_ch6.adb (Expand_Call_Helper): Replace with code more similar to
{
tree inner_op_op1 = TREE_OPERAND (inner_op, 1);
tree gnu_size_op1 = TREE_OPERAND (gnu_size, 1);
- wide_int op1;
+ widest_int op1;
if (TREE_CODE (gnu_size) == MULT_EXPR)
- op1 = wi::mul (inner_op_op1, gnu_size_op1);
+ op1 = (wi::to_widest (inner_op_op1)
+ * wi::to_widest (gnu_size_op1));
else
- op1 = wi::add (inner_op_op1, gnu_size_op1);
+ op1 = (wi::to_widest (inner_op_op1)
+ + wi::to_widest (gnu_size_op1));
ops[1] = UI_From_gnu (wide_int_to_tree (sizetype, op1));
ops[0] = annotate_value (TREE_OPERAND (inner_op, 0));
}
+2017-10-02 Richard Sandiford <richard.sandiford@linaro.org>
+
+ * c-warn.c (warn_tautological_bitwise_comparison): Use wi::to_widest
+ when combining the original unconverted comparison operands.
+
2017-09-29 Jakub Jelinek <jakub@redhat.com>
* c-attribs.c (handle_noipa_attribute): Don't add "stack_protect"
else
return;
- wide_int res;
+ /* Note that the two operands are from before the usual integer
+ conversions, so their types might not be the same. */
+ widest_int res;
if (TREE_CODE (bitop) == BIT_AND_EXPR)
- res = wi::bit_and (bitopcst, cst);
+ res = wi::to_widest (bitopcst) & wi::to_widest (cst);
else
- res = wi::bit_or (bitopcst, cst);
+ res = wi::to_widest (bitopcst) | wi::to_widest (cst);
/* For BIT_AND only warn if (CST2 & CST1) != CST1, and
for BIT_OR only if (CST2 | CST1) != CST1. */
- if (res == cst)
+ if (res == wi::to_widest (cst))
return;
if (code == EQ_EXPR)
if (unit)
{
- wide_int w = wi::uhwi (limit, HOST_BITS_PER_WIDE_INT + 64);
- w *= unit;
- if (wi::ltu_p (w, alloc_object_size_limit))
+ widest_int w = wi::mul (limit, unit);
+ if (w < wi::to_widest (alloc_object_size_limit))
alloc_object_size_limit = wide_int_to_tree (ssizetype, w);
}
}
+2017-10-02 Richard Sandiford <richard.sandiford@linaro.org>
+
+ * constexpr.c (cxx_eval_store_expression): Use wi::to_widest
+ when comparing the array bounds with an ARRAY_REF index.
+
2017-09-30 Paolo Carlini <paolo.carlini@oracle.com>
PR c++/68754
VERIFY_CONSTANT (nelts);
gcc_assert (TREE_CODE (nelts) == INTEGER_CST
&& TREE_CODE (TREE_OPERAND (probe, 1)) == INTEGER_CST);
- if (wi::eq_p (TREE_OPERAND (probe, 1), nelts))
+ if (wi::to_widest (TREE_OPERAND (probe, 1)) == wi::to_widest (nelts))
{
diag_array_subscript (ctx, ary, TREE_OPERAND (probe, 1));
*non_constant_p = true;
is_vla ? G_("argument to variable-length array "
"may be too large")
: G_("argument to %<alloca%> may be too large"))
- && t.limit != integer_zero_node)
+ && t.limit != 0)
{
print_decu (t.limit, buff);
inform (loc, G_("limit is %u bytes, but argument "
is_vla ? G_("argument to variable-length array "
"is too large")
: G_("argument to %<alloca%> is too large"))
- && t.limit != integer_zero_node)
+ && t.limit != 0)
{
print_decu (t.limit, buff);
inform (loc, G_("limit is %u bytes, but argument is %s"),
(div (convert? (bit_and @0 INTEGER_CST@1)) INTEGER_CST@2)
(if (integer_pow2p (@2)
&& tree_int_cst_sgn (@2) > 0
- && wi::add (@2, @1) == 0
- && tree_nop_conversion_p (type, TREE_TYPE (@0)))
+ && tree_nop_conversion_p (type, TREE_TYPE (@0))
+ && wi::add (@2, @1) == 0)
(rshift (convert @0) { build_int_cst (integer_type_node,
wi::exact_log2 (@2)); }))))
&& wi::lt_p (@1, prec, TYPE_SIGN (TREE_TYPE (@1)))
&& wi::ge_p (@2, 0, TYPE_SIGN (TREE_TYPE (@2)))
&& wi::lt_p (@2, prec, TYPE_SIGN (TREE_TYPE (@2))))
- (with { unsigned int low = wi::add (@1, @2).to_uhwi (); }
+ (with { unsigned int low = (tree_to_uhwi (@1)
+ + tree_to_uhwi (@2)); }
/* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
being well defined. */
(if (low >= prec)
wi::int_traits <const_tree>::decompose (HOST_WIDE_INT *,
unsigned int precision, const_tree x)
{
+ gcc_checking_assert (precision == TYPE_PRECISION (TREE_TYPE (x)));
return wi::storage_ref (&TREE_INT_CST_ELT (x, 0), TREE_INT_CST_NUNITS (x),
precision);
}