From 9367c79e62307421f28ba92174f3792a6360f37b Mon Sep 17 00:00:00 2001 From: Nadav Rotem Date: Thu, 27 Jun 2013 00:14:13 +0000 Subject: [PATCH] No need to use a Set when a vector would do. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@185047 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Transforms/Vectorize/SLPVectorizer.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lib/Transforms/Vectorize/SLPVectorizer.cpp b/lib/Transforms/Vectorize/SLPVectorizer.cpp index 6ffd34bbf5a..35df6684f84 100644 --- a/lib/Transforms/Vectorize/SLPVectorizer.cpp +++ b/lib/Transforms/Vectorize/SLPVectorizer.cpp @@ -1300,7 +1300,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 Visited; - SmallPtrSet ToRemove; + SmallVector ToRemove; ReversePostOrderTraversal RPOT(F); for (ReversePostOrderTraversal::rpo_iterator I = RPOT.begin(), E = RPOT.end(); I != E; ++I) { @@ -1318,7 +1318,7 @@ void FuncSLP::optimizeGatherSequence() { if (Insert->isIdenticalTo(*v) && DT->dominates((*v)->getParent(), Insert->getParent())) { Insert->replaceAllUsesWith(*v); - ToRemove.insert(Insert); + ToRemove.push_back(Insert); Insert = 0; break; } @@ -1329,7 +1329,7 @@ void FuncSLP::optimizeGatherSequence() { } // Erase all of the instructions that we RAUWed. - for (SmallPtrSet::iterator v = ToRemove.begin(), + for (SmallVector::iterator v = ToRemove.begin(), ve = ToRemove.end(); v != ve; ++v) { assert((*v)->getNumUses() == 0 && "Can't remove instructions with uses"); (*v)->eraseFromParent();