diff options
| author | Sanjay Patel <spatel@rotateright.com> | 2020-09-17 08:39:23 -0400 |
|---|---|---|
| committer | Sanjay Patel <spatel@rotateright.com> | 2020-09-17 08:49:27 -0400 |
| commit | 03783f19dc78fc45fd987f892c314578b5e52d78 (patch) | |
| tree | eef2370174e0359bddcd49edd453f381eb731666 /llvm/lib/CodeGen/SafeStackLayout.cpp | |
| parent | 788c7d2ec11dfc868a5b03478c922dc9699c6d47 (diff) | |
| download | llvm-03783f19dc78fc45fd987f892c314578b5e52d78.zip llvm-03783f19dc78fc45fd987f892c314578b5e52d78.tar.gz llvm-03783f19dc78fc45fd987f892c314578b5e52d78.tar.bz2 | |
[SLP] sort candidates to increase chance of optimal compare reduction
This is one (small) part of improving PR41312:
https://llvm.org/PR41312
As shown there and in the smaller tests here, if we have some member of the
reduction values that does not match the others, we want to push it to the
end (bring the matching members forward and together).
In the regression tests, we have 5 candidates for the 4 slots of the reduction.
If the one "wrong" compare is grouped with the others, it prevents forming the
ideal v4i1 compare reduction.
Differential Revision: https://reviews.llvm.org/D87772
Diffstat (limited to 'llvm/lib/CodeGen/SafeStackLayout.cpp')
0 files changed, 0 insertions, 0 deletions