diff options
Diffstat (limited to 'llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp')
-rw-r--r-- | llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp index bb37994e9ff..33d1100ebc7 100644 --- a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp +++ b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp @@ -1302,6 +1302,7 @@ void FuncSLP::optimizeGatherSequence() { // instructions. TODO: We can further optimize this scan if we split the // instructions into different buckets based on the insert lane. SmallPtrSet<Instruction*, 16> Visited; + SmallPtrSet<Instruction*, 16> ToRemove; ReversePostOrderTraversal<Function*> RPOT(F); for (ReversePostOrderTraversal<Function*>::rpo_iterator I = RPOT.begin(), E = RPOT.end(); I != E; ++I) { @@ -1319,6 +1320,7 @@ void FuncSLP::optimizeGatherSequence() { if (Insert->isIdenticalTo(*v) && DT->dominates((*v)->getParent(), Insert->getParent())) { Insert->replaceAllUsesWith(*v); + ToRemove.insert(Insert); Insert = 0; break; } @@ -1327,6 +1329,13 @@ void FuncSLP::optimizeGatherSequence() { Visited.insert(Insert); } } + + // Erase all of the instructions that we RAUWed. + for (SmallPtrSet<Instruction*, 16>::iterator v = ToRemove.begin(), + ve = ToRemove.end(); v != ve; ++v) { + assert((*v)->getNumUses() == 0 && "Can't remove instructions with uses"); + (*v)->eraseFromParent(); + } } /// The SLPVectorizer Pass. |