2001-06-06 20:29:01 +00:00
|
|
|
//===- DCE.cpp - Code to perform dead code elimination --------------------===//
|
|
|
|
//
|
2002-05-07 04:24:11 +00:00
|
|
|
// This file implements dead inst elimination and dead code elimination.
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
2002-05-07 04:24:11 +00:00
|
|
|
// Dead Inst Elimination performs a single pass over the function removing
|
|
|
|
// instructions that are obviously dead. Dead Code Elimination is similar, but
|
|
|
|
// it rechecks instructions that were used by removed instructions to see if
|
|
|
|
// they are newly dead.
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-01-21 23:17:48 +00:00
|
|
|
#include "llvm/Transforms/Scalar/DCE.h"
|
2002-05-07 18:10:55 +00:00
|
|
|
#include "llvm/Transforms/Utils/Local.h"
|
|
|
|
#include "llvm/Instruction.h"
|
2002-02-26 21:46:54 +00:00
|
|
|
#include "llvm/Pass.h"
|
2002-05-07 04:24:11 +00:00
|
|
|
#include "llvm/Support/InstIterator.h"
|
|
|
|
#include <set>
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// DeadInstElimination pass implementation
|
|
|
|
//
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2002-05-07 04:24:11 +00:00
|
|
|
namespace {
|
|
|
|
struct DeadInstElimination : public BasicBlockPass {
|
|
|
|
const char *getPassName() const { return "Dead Instruction Elimination"; }
|
|
|
|
|
|
|
|
virtual bool runOnBasicBlock(BasicBlock *BB) {
|
|
|
|
BasicBlock::InstListType &Vals = BB->getInstList();
|
|
|
|
bool Changed = false;
|
|
|
|
for (BasicBlock::iterator DI = Vals.begin(); DI != Vals.end(); )
|
|
|
|
if (dceInstruction(Vals, DI))
|
|
|
|
Changed = true;
|
|
|
|
else
|
|
|
|
++DI;
|
|
|
|
return Changed;
|
|
|
|
}
|
2002-04-29 14:57:45 +00:00
|
|
|
|
2002-05-07 04:24:11 +00:00
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.preservesCFG();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
2002-02-26 21:46:54 +00:00
|
|
|
|
|
|
|
Pass *createDeadInstEliminationPass() {
|
|
|
|
return new DeadInstElimination();
|
2002-01-23 05:48:24 +00:00
|
|
|
}
|
|
|
|
|
2001-06-07 16:59:26 +00:00
|
|
|
|
|
|
|
|
2002-05-07 04:24:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// DeadCodeElimination pass implementation
|
2001-06-07 16:59:26 +00:00
|
|
|
//
|
|
|
|
|
2002-05-07 04:24:11 +00:00
|
|
|
namespace {
|
|
|
|
struct DCE : public FunctionPass {
|
|
|
|
const char *getPassName() const { return "Dead Code Elimination"; }
|
2001-11-03 21:30:22 +00:00
|
|
|
|
2002-05-07 04:24:11 +00:00
|
|
|
virtual bool runOnFunction(Function *F);
|
2001-06-27 23:41:11 +00:00
|
|
|
|
2002-05-07 04:24:11 +00:00
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.preservesCFG();
|
2001-06-27 23:41:11 +00:00
|
|
|
}
|
2002-05-07 04:24:11 +00:00
|
|
|
};
|
2001-06-07 16:59:26 +00:00
|
|
|
}
|
|
|
|
|
2002-05-07 04:24:11 +00:00
|
|
|
bool DCE::runOnFunction(Function *F) {
|
|
|
|
// Start out with all of the instructions in the worklist...
|
|
|
|
std::vector<Instruction*> WorkList(inst_begin(F), inst_end(F));
|
|
|
|
std::set<Instruction*> DeadInsts;
|
2002-05-06 03:02:02 +00:00
|
|
|
|
2002-05-07 04:24:11 +00:00
|
|
|
// Loop over the worklist finding instructions that are dead. If they are
|
|
|
|
// dead make them drop all of their uses, making other instructions
|
|
|
|
// potentially dead, and work until the worklist is empty.
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
2002-05-07 04:24:11 +00:00
|
|
|
while (!WorkList.empty()) {
|
|
|
|
Instruction *I = WorkList.back();
|
|
|
|
WorkList.pop_back();
|
|
|
|
|
2002-05-07 18:10:55 +00:00
|
|
|
if (isInstructionTriviallyDead(I)) { // If the instruction is dead...
|
2002-05-07 04:24:11 +00:00
|
|
|
// Loop over all of the values that the instruction uses, if there are
|
|
|
|
// instructions being used, add them to the worklist, because they might
|
|
|
|
// go dead after this one is removed.
|
|
|
|
//
|
|
|
|
for (User::use_iterator UI = I->use_begin(), UE = I->use_end();
|
|
|
|
UI != UE; ++UI)
|
|
|
|
if (Instruction *Used = dyn_cast<Instruction>(*UI))
|
|
|
|
WorkList.push_back(Used);
|
|
|
|
|
|
|
|
// Tell the instruction to let go of all of the values it uses...
|
|
|
|
I->dropAllReferences();
|
|
|
|
|
|
|
|
// Keep track of this instruction, because we are going to delete it later
|
|
|
|
DeadInsts.insert(I);
|
2001-07-28 17:51:49 +00:00
|
|
|
}
|
|
|
|
}
|
2001-06-30 04:36:40 +00:00
|
|
|
|
2002-05-07 04:24:11 +00:00
|
|
|
// If we found no dead instructions, we haven't changed the function...
|
|
|
|
if (DeadInsts.empty()) return false;
|
|
|
|
|
|
|
|
// Otherwise, loop over the program, removing and deleting the instructions...
|
|
|
|
for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I) {
|
|
|
|
BasicBlock::InstListType &BBIL = (*I)->getInstList();
|
|
|
|
for (BasicBlock::iterator BI = BBIL.begin(); BI != BBIL.end(); )
|
|
|
|
if (DeadInsts.count(*BI)) { // Is this instruction dead?
|
|
|
|
delete BBIL.remove(BI); // Yup, remove and delete inst
|
|
|
|
} else { // This instruction is not dead
|
|
|
|
++BI; // Continue on to the next one...
|
|
|
|
}
|
2001-10-18 01:32:34 +00:00
|
|
|
}
|
|
|
|
|
2002-05-07 04:24:11 +00:00
|
|
|
return true;
|
2002-02-26 21:46:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Pass *createDeadCodeEliminationPass() {
|
2002-05-07 04:24:11 +00:00
|
|
|
return new DCE();
|
2002-02-26 21:46:54 +00:00
|
|
|
}
|