https://gcc.gnu.org/bugzilla/show_bug.cgi?id=109072
--- Comment #8 from rsandifo at gcc dot gnu.org <rsandifo at gcc dot gnu.org> --- (In reply to Richard Biener from comment #7) > Whatever you do with cost heuristics you'll find a testcase where that > regresses. Yep. That's the one true invariant of costing :-) I think a heuristic based on vld1 does make sense though. Code like the example is the recommended endian-agnostic way of initialising an ACLE vector, so we should try extra hard to vectorise stores that are later reloaded using vld1. A longer-term fix that avoids the need for costing would be good too. But costing seems like the easiest way of avoiding this particular regression (in a way that's suitable for GCC 12 and 13).
