diff options
| author | Vasileios Porpodas <vporpodas@google.com> | 2022-05-05 15:03:31 -0700 |
|---|---|---|
| committer | Vasileios Porpodas <vporpodas@google.com> | 2022-05-10 15:25:35 -0700 |
| commit | 71bcead98b2e655031208e5ad0ce89f8971a6343 (patch) | |
| tree | 5f6141d8d9986b6da11ff046191e3a0a9c5bd74d /llvm/lib/Bitcode/Writer/BitcodeWriter.cpp | |
| parent | 7731935ffc96db2ceea9638d395439df814b5839 (diff) | |
| download | llvm-71bcead98b2e655031208e5ad0ce89f8971a6343.zip llvm-71bcead98b2e655031208e5ad0ce89f8971a6343.tar.gz llvm-71bcead98b2e655031208e5ad0ce89f8971a6343.tar.bz2 | |
[SLP] Make reordering aware of external vectorizable scalar stores.
The current reordering scheme only checks the ordering of in-tree operands.
There are some cases, however, where we need to adjust the ordering based on
the ordering of a future SLP-tree who's instructions are not part of the
current tree, but are external users.
This patch is a simple implementation of this. We keep track of scalar stores
that are users of TreeEntries and if they look profitable to vectorize, then
we keep track of their ordering. During the reordering step we take this new
index order into account. This can remove some shuffles in cases like in the
lit test.
Differential Revision: https://reviews.llvm.org/D125111
Diffstat (limited to 'llvm/lib/Bitcode/Writer/BitcodeWriter.cpp')
0 files changed, 0 insertions, 0 deletions