https://gcc.gnu.org/bugzilla/show_bug.cgi?id=116032
Richard Biener <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Last reconfirmed| |2025-01-24
Priority|P3 |P2
Ever confirmed|0 |1
Status|UNCONFIRMED |NEW
--- Comment #4 from Richard Biener <rguenth at gcc dot gnu.org> ---
So this should then be rejected by the vector cost model, anticipating a
store-multiple.
Also consider
void foo(int* p)
{
p[0] = 0;
p[1] = 1;
}
in case { 0, 1 } is cheaper to generate than { 1, 0 } (I'd have expected
there to be a load-scalar + pad zero vector insn, at least halving the
constant pool size).
