//
// The LLVM Compiler Infrastructure
//
-// This file was developed by the LLVM research group and is distributed under
+// This file was developed by Owen Anderson and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
bool FDSE::runOnBasicBlock(BasicBlock &BB) {
MemoryDependenceAnalysis& MD = getAnalysis<MemoryDependenceAnalysis>();
+ // Record the last-seen store to this pointer
DenseMap<Value*, StoreInst*> lastStore;
+ // Record instructions possibly made dead by deleting a store
SetVector<Instruction*> possiblyDead;
bool MadeChange = false;
for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ++BBI) {
// If we find a store...
if (StoreInst* S = dyn_cast<StoreInst>(BBI)) {
+ StoreInst*& last = lastStore[S->getPointerOperand()];
// ... to a pointer that has been stored to before...
- if (lastStore.count(S->getPointerOperand())) {
- StoreInst* last = lastStore[S->getPointerOperand()];
+ if (last) {
// ... and no other memory dependencies are between them....
if (MD.getDependency(S) == last) {
}
// Update our most-recent-store map
- lastStore.insert(std::make_pair(S->getPointerOperand(), S));
+ last = S;
}
}
// instruction uses the same operand twice. We don't want to delete a
// value then reference it.
for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {
- if (Instruction *Op = dyn_cast<Instruction>(I->getOperand(i)))
- DeadInsts.insert(Op); // Attempt to nuke it later.
+ if (I->getOperand(i)->hasOneUse())
+ if (Instruction* Op = dyn_cast<Instruction>(I->getOperand(i)))
+ DeadInsts.insert(Op); // Attempt to nuke it later.
+
I->setOperand(i, 0); // Drop from the operand list.
}