[Bug tree-optimization/113441] [14 Regression] Fail to fold the last element with multiple loop since g:2efe3a7de0107618397264017fb045f237764cc7

[rguenth at gcc dot gnu.org]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=113441

--- Comment #40 from Richard Biener <rguenth at gcc dot gnu.org> ---
So I wonder if we can use "local costing" to decide a gather is always OK
compared to the alternative with peeling for gaps.  On x86 gather tends
to be slow compared to open-coding it.

In the future we might want to explore whether we can re-do costing for
alternatives without re-running all of the analysis at least for decisions
we know have only "local" effect.