On Wed, 10 Jul 2024, Richard Sandiford wrote:
> Richard Biener writes:
> > The following is a prototype for how to represent load/store-lanes
> > within SLP. I've for now settled with having a single load node
> > with multiple permute nodes acting as selection, one for each loaded lane
> > and
Richard Biener writes:
> The following is a prototype for how to represent load/store-lanes
> within SLP. I've for now settled with having a single load node
> with multiple permute nodes acting as selection, one for each loaded lane
> and a single store node fed from all stored lanes. For
>
>
The following is a prototype for how to represent load/store-lanes
within SLP. I've for now settled with having a single load node
with multiple permute nodes acting as selection, one for each loaded lane
and a single store node fed from all stored lanes. For
for (int i = 0; i < 1024; ++i)
As promised this is the rework of SLP load/store-lane support with
a simpler representation. It builds ontop the load-permute lowering
series which I've squashed to two patches (already tested separately
in the CI yesterday). The load/store-permute work hasn't seen much
testing, I hope the CI w
