mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-16 11:30:51 +00:00
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
This commit is contained in:
parent
bb77593765
commit
9367c79e62
@ -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();
|
||||
|
Loading…
Reference in New Issue
Block a user