replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

No need to use a Set when a vector would do. 

llvm-svn: 185047
This commit is contained in:
Nadav Rotem 2013-06-27 00:14:13 +00:00
parent 70cac8fd81
commit 8edefb3665
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -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<Instruction*, 16> Visited;
SmallPtrSet<Instruction*, 16> ToRemove;
SmallVector<Instruction*, 16> ToRemove;
ReversePostOrderTraversal<Function*> RPOT(F);
for (ReversePostOrderTraversal<Function*>::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<Instruction*, 16>::iterator v = ToRemove.begin(),
for (SmallVector<Instruction*, 16>::iterator v = ToRemove.begin(),
ve = ToRemove.end(); v != ve; ++v) {
assert((*v)->getNumUses() == 0 && "Can't remove instructions with uses");
(*v)->eraseFromParent();