We're now consistently building SLP operations with only
scalar defs from scalars which makes the testcase no longer
testing multiplication vectorization. The following smuggles
in a constant making the vector variant profitable for SLP build.
2020-02-05 Richard Biener <rguenther@suse.de>
PR testsuite/92177
* gcc.dg/vect/bb-slp-22.c: Adjust.
+2020-02-05 Richard Biener <rguenther@suse.de>
+
+ PR testsuite/92177
+ * gcc.dg/vect/bb-slp-22.c: Adjust.
+
2020-02-05 Richard Biener <rguenther@suse.de>
PR middle-end/90648
- * genmatch.c (dt_node::gen_kids_1): Emit number of argument
- checks before matching calls.
+ * gcc.dg/pr90648.c: New testcase.
2020-02-05 Jakub Jelinek <jakub@redhat.com>
}
else
{
- out[0] = a0 * x;
- out[1] = a1 * y;
- out[2] = a2 * x;
- out[3] = a3 * y;
+ out[0] = a0 * (x + 1);
+ out[1] = a1 * (y + 1);
+ out[2] = a2 * (x + 1);
+ out[3] = a3 * (y + 1);
}
if (x)
/* Check results. */
if ((x <= y
- && (out[0] != (in[0] + 23) * x
- || out[1] != (in[1] + 142) * y
- || out[2] != (in[2] + 2) * x
- || out[3] != (in[3] + 31) * y))
+ && (out[0] != (in[0] + 23) * (x + 1)
+ || out[1] != (in[1] + 142) * (y + 1)
+ || out[2] != (in[2] + 2) * (x + 1)
+ || out[3] != (in[3] + 31) * (y + 1)))
|| (x > y
&& (b[0] != (in[0] + 23)
|| b[1] != (in[1] + 142)