On Tue, Nov 22, 2022 at 12:06 PM Eric Botcazou via Gcc-patches <gcc-patches@gcc.gnu.org> wrote: > > Hi, > > when two arrays of scalars have a different storage order in Ada, the > front-end makes sure that the conversion is performed component-wise > so that each component can be reversed. So it's a little bit counter > productive that the ldist pass performs the opposite transformation > and synthesizes a memcpy/memmove in this case. > > Tested on x86-64/Linux, OK for the mainline?
OK for trunk and branches. Richard. > > 2022-11-22 Eric Botcazou <ebotca...@adacore.com> > > * tree-loop-distribution.cc > (loop_distribution::classify_builtin_ldst): > Bail out if source and destination do not have the same storage order. > > > 2022-11-22 Eric Botcazou <ebotca...@adacore.com> > > * gnat.dg/sso18.adb: New test. > > -- > Eric Botcazou
