https://gcc.gnu.org/bugzilla/show_bug.cgi?id=101474
Richard Biener <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |jamborm at gcc dot gnu.org
--- Comment #2 from Richard Biener <rguenth at gcc dot gnu.org> ---
Yes, when SRA decomposes a copy it leaves out padding which means we later fail
to apply store-merging and thus end up generating worse code for a simple
aggregate copy. SRA assumes the total scalarization transform allow followup
optimizations, if this doesn't happen it's hardly a profitable transform.