RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-11-29 22:50:47 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Use efficient container SmallPtrSet

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@34640 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Devang Patel 2007-02-26 20:22:50 +00:00
parent caddd44be7
commit fb688d4d1c
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
lib/Transforms/Scalar/LoopUnswitch.cpp
View File

@ -38,6 +38,7 @@
#include "llvm/Transforms/Utils/Local.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/PostOrderIterator.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Compiler.h"
@ -62,7 +63,7 @@ namespace {
// LoopProcessWorklist - List of loops we need to process.
std::vector<Loop*> LoopProcessWorklist;
std::set<Value *> UnswitchedVals;
SmallPtrSet<Value *,8> UnswitchedVals;
public:
virtual bool runOnFunction(Function &F);
@ -129,6 +130,7 @@ bool LoopUnswitch::runOnFunction(Function &F) {
Changed |= visitLoop(L);
}
UnswitchedVals.clear();
return Changed;
}
@ -189,9 +191,8 @@ bool LoopUnswitch::visitLoop(Loop *L) {
// FIXME: this should chose the most expensive case!
Constant *UnswitchVal = SI->getCaseValue(1);
// Do not process same value again and again.
if (UnswitchedVals.count(UnswitchVal) != 0)
if (!UnswitchedVals.insert(UnswitchVal))
continue;
UnswitchedVals.insert(UnswitchVal);
if (UnswitchIfProfitable(LoopCond, UnswitchVal, L)) {
++NumSwitches;