stion remains on whether we want to use graphds or whether
we want a (lazily filled?) SLP_TREE_PARENTS array and compute the
RPO on the reverse graph on the SLP data structure (we only need
an iteration order that has at least one child visited before
visiting parents, but we still need the reverse
On Fri, 2 Oct 2020, Richard Sandiford wrote:
> Richard Biener writes:
> > This introduces a permute optimization phase for SLP which is
> > intended to cover the existing permute eliding for SLP reductions
> > plus handling commonizing the easy cases.
> >
> > It currently uses graphds to compute
Richard Biener writes:
> This introduces a permute optimization phase for SLP which is
> intended to cover the existing permute eliding for SLP reductions
> plus handling commonizing the easy cases.
>
> It currently uses graphds to compute a postorder on the reverse
> SLP graph and it handles all
This introduces a permute optimization phase for SLP which is
intended to cover the existing permute eliding for SLP reductions
plus handling commonizing the easy cases.
It currently uses graphds to compute a postorder on the reverse
SLP graph and it handles all cases vect_attempt_slp_rearrange_st
