mirror of
https://github.com/RPCSX/llvm.git
synced 2025-01-22 20:26:31 +00:00
remove some dead code.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@111344 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
0d857cf8d1
commit
473fc96889
@ -275,12 +275,12 @@ public:
|
|||||||
return I->second;
|
return I->second;
|
||||||
}
|
}
|
||||||
|
|
||||||
LatticeVal getStructLatticeValueFor(Value *V, unsigned i) const {
|
/*LatticeVal getStructLatticeValueFor(Value *V, unsigned i) const {
|
||||||
DenseMap<std::pair<Value*, unsigned>, LatticeVal>::const_iterator I =
|
DenseMap<std::pair<Value*, unsigned>, LatticeVal>::const_iterator I =
|
||||||
StructValueState.find(std::make_pair(V, i));
|
StructValueState.find(std::make_pair(V, i));
|
||||||
assert(I != StructValueState.end() && "V is not in valuemap!");
|
assert(I != StructValueState.end() && "V is not in valuemap!");
|
||||||
return I->second;
|
return I->second;
|
||||||
}
|
}*/
|
||||||
|
|
||||||
/// getTrackedRetVals - Get the inferred return value map.
|
/// getTrackedRetVals - Get the inferred return value map.
|
||||||
///
|
///
|
||||||
@ -518,7 +518,6 @@ private:
|
|||||||
void visitUnwindInst (TerminatorInst &I) { /*returns void*/ }
|
void visitUnwindInst (TerminatorInst &I) { /*returns void*/ }
|
||||||
void visitUnreachableInst(TerminatorInst &I) { /*returns void*/ }
|
void visitUnreachableInst(TerminatorInst &I) { /*returns void*/ }
|
||||||
void visitAllocaInst (Instruction &I) { markOverdefined(&I); }
|
void visitAllocaInst (Instruction &I) { markOverdefined(&I); }
|
||||||
void visitVANextInst (Instruction &I) { markOverdefined(&I); }
|
|
||||||
void visitVAArgInst (Instruction &I) { markAnythingOverdefined(&I); }
|
void visitVAArgInst (Instruction &I) { markAnythingOverdefined(&I); }
|
||||||
|
|
||||||
void visitInstruction(Instruction &I) {
|
void visitInstruction(Instruction &I) {
|
||||||
|
@ -29,8 +29,7 @@ using namespace llvm;
|
|||||||
|
|
||||||
namespace {
|
namespace {
|
||||||
/// LowerSwitch Pass - Replace all SwitchInst instructions with chained branch
|
/// LowerSwitch Pass - Replace all SwitchInst instructions with chained branch
|
||||||
/// instructions. Note that this cannot be a BasicBlock pass because it
|
/// instructions.
|
||||||
/// modifies the CFG!
|
|
||||||
class LowerSwitch : public FunctionPass {
|
class LowerSwitch : public FunctionPass {
|
||||||
public:
|
public:
|
||||||
static char ID; // Pass identification, replacement for typeid
|
static char ID; // Pass identification, replacement for typeid
|
||||||
@ -50,8 +49,7 @@ namespace {
|
|||||||
Constant* High;
|
Constant* High;
|
||||||
BasicBlock* BB;
|
BasicBlock* BB;
|
||||||
|
|
||||||
CaseRange() : Low(0), High(0), BB(0) { }
|
CaseRange(Constant *low = 0, Constant *high = 0, BasicBlock *bb = 0) :
|
||||||
CaseRange(Constant* low, Constant* high, BasicBlock* bb) :
|
|
||||||
Low(low), High(high), BB(bb) { }
|
Low(low), High(high), BB(bb) { }
|
||||||
};
|
};
|
||||||
|
|
||||||
|
@ -228,14 +228,6 @@ namespace {
|
|||||||
|
|
||||||
void run();
|
void run();
|
||||||
|
|
||||||
/// properlyDominates - Return true if I1 properly dominates I2.
|
|
||||||
///
|
|
||||||
bool properlyDominates(Instruction *I1, Instruction *I2) const {
|
|
||||||
if (InvokeInst *II = dyn_cast<InvokeInst>(I1))
|
|
||||||
I1 = II->getNormalDest()->begin();
|
|
||||||
return DT.properlyDominates(I1->getParent(), I2->getParent());
|
|
||||||
}
|
|
||||||
|
|
||||||
/// dominates - Return true if BB1 dominates BB2 using the DominatorTree.
|
/// dominates - Return true if BB1 dominates BB2 using the DominatorTree.
|
||||||
///
|
///
|
||||||
bool dominates(BasicBlock *BB1, BasicBlock *BB2) const {
|
bool dominates(BasicBlock *BB1, BasicBlock *BB2) const {
|
||||||
|
Loading…
x
Reference in New Issue
Block a user