https://gcc.gnu.org/bugzilla/show_bug.cgi?id=111125
Richard Biener <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Assignee|unassigned at gcc dot gnu.org |rguenth at gcc dot
gnu.org
Status|UNCONFIRMED |ASSIGNED
Last reconfirmed| |2023-08-24
Ever confirmed|0 |1
--- Comment #1 from Richard Biener <rguenth at gcc dot gnu.org> ---
For gcc.dg/tree-ssa/slsr-11.c we vectorize the reduction to
<bb 2> [local count: 1073741824]:
_15 = {s_5(D), s_5(D)};
vect_a3_11.3_16 = _15 * { 6, 4 };
vect__3.4_17 = (vector(2) long int) vect_a3_11.3_16;
a1_6 = s_5(D) * 2;
_18 = VIEW_CONVERT_EXPR<vector(2) unsigned long>(vect__3.4_17);
_19 = .REDUC_PLUS (_18);
_20 = (unsigned long) a1_6;
_21 = (unsigned long) c_7(D);
_29 = _21 * 2;
_31 = _19 + _29;
_30 = _20 + _21;
_27 = _30 + _31;
_28 = (long int) _27;
return _28;
note: Cost model analysis for part in loop 0:
Vector cost: 9
Scalar cost: 9
doesn't look profitable. I think there's something off with the scalar
accounting, I'll have a look there.
