maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

[SLPVectorizer] Get rid of IndexQueue array from vectorizeStores. NFCI. 

Indices are checked as they are generated. No need to fill the whole array of indices.

Differential Revision: https://reviews.llvm.org/D57144

llvm-svn: 352839
This commit is contained in:
Yevgeny Rouban 2019-02-01 06:44:08 +00:00
parent 5ef88bdb68
commit 4cdd783955
1 changed files with 18 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

45
llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp
View File

@ -4746,38 +4746,29 @@ bool SLPVectorizerPass::vectorizeStores(ArrayRef<StoreInst *> Stores,
BoUpSLP::ValueSet VectorizedStores;
bool Changed = false;
// Do a quadratic search on all of the given stores in reverse order and find
// all of the pairs of stores that follow each other.
SmallVector<unsigned, 16> IndexQueue;
unsigned E = Stores.size();
IndexQueue.resize(E - 1);
for (unsigned I = E; I > 0; --I) {
unsigned Idx = I - 1;
// If a store has multiple consecutive store candidates, search Stores
// array according to the sequence: Idx-1, Idx+1, Idx-2, Idx+2, ...
// This is because usually pairing with immediate succeeding or preceding
// candidate create the best chance to find slp vectorization opportunity.
unsigned Offset = 1;
unsigned Cnt = 0;
for (unsigned J = 0; J < E - 1; ++J, ++Offset) {
if (Idx >= Offset) {
IndexQueue[Cnt] = Idx - Offset;
++Cnt;
}
if (Idx + Offset < E) {
IndexQueue[Cnt] = Idx + Offset;
++Cnt;
}
}
auto &&FindConsecutiveAccess =
[this, &Stores, &Heads, &Tails, &ConsecutiveChain] (int K, int Idx) {
if (!isConsecutiveAccess(Stores[K], Stores[Idx], *DL, *SE))
return false;
for (auto K : IndexQueue) {
if (isConsecutiveAccess(Stores[K], Stores[Idx], *DL, *SE)) {
Tails.insert(Stores[Idx]);
Heads.insert(Stores[K]);
ConsecutiveChain[Stores[K]] = Stores[Idx];
return true;
};
// Do a quadratic search on all of the given stores in reverse order and find
// all of the pairs of stores that follow each other.
int E = Stores.size();
for (int Idx = E - 1; Idx >= 0; --Idx) {
// If a store has multiple consecutive store candidates, search according
// to the sequence: Idx-1, Idx+1, Idx-2, Idx+2, ...
// This is because usually pairing with immediate succeeding or preceding
// candidate create the best chance to find slp vectorization opportunity.
for (int Offset = 1, F = std::max(E - Idx, Idx + 1); Offset < F; ++Offset)
if ((Idx >= Offset && FindConsecutiveAccess(Idx - Offset, Idx)) ||
(Idx + Offset < E && FindConsecutiveAccess(Idx + Offset, Idx)))
break;
}
}
}
// For stores that start but don't end a link in the chain: