llvm-mirror/lib/Transforms/Scalar/ConstantProp.cpp

91 lines
2.8 KiB
C++
Raw Normal View History

//===- ConstantProp.cpp - Code to perform Simple Constant Propagation -----===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
2001-06-06 20:29:01 +00:00
//
// This file implements constant propagation and merging:
2001-06-06 20:29:01 +00:00
//
// Specifically, this:
// * Converts instructions like "add int 1, 2" into 3
2001-06-06 20:29:01 +00:00
//
// Notice that:
// * This pass has a habit of making definitions be dead. It is a good idea
// to to run a DIE pass sometime after running this pass.
2001-06-06 20:29:01 +00:00
//
//===----------------------------------------------------------------------===//
#define DEBUG_TYPE "constprop"
#include "llvm/Transforms/Scalar.h"
#include "llvm/Analysis/ConstantFolding.h"
#include "llvm/Constant.h"
#include "llvm/Instruction.h"
#include "llvm/Pass.h"
#include "llvm/Support/Compiler.h"
#include "llvm/Support/InstIterator.h"
#include "llvm/ADT/Statistic.h"
#include <set>
using namespace llvm;
STATISTIC(NumInstKilled, "Number of instructions killed");
namespace {
struct VISIBILITY_HIDDEN ConstantPropagation : public FunctionPass {
2007-05-06 13:37:16 +00:00
static char ID; // Pass identification, replacement for typeid
ConstantPropagation() : FunctionPass((intptr_t)&ID) {}
bool runOnFunction(Function &F);
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesCFG();
}
};
}
2001-06-06 20:29:01 +00:00
char ConstantPropagation::ID = 0;
static RegisterPass<ConstantPropagation>
X("constprop", "Simple constant propagation");
FunctionPass *llvm::createConstantPropagationPass() {
return new ConstantPropagation();
2001-06-06 20:29:01 +00:00
}
bool ConstantPropagation::runOnFunction(Function &F) {
// Initialize the worklist to all of the instructions ready to process...
std::set<Instruction*> WorkList;
for(inst_iterator i = inst_begin(F), e = inst_end(F); i != e; ++i) {
WorkList.insert(&*i);
}
bool Changed = false;
while (!WorkList.empty()) {
Instruction *I = *WorkList.begin();
WorkList.erase(WorkList.begin()); // Get an element from the worklist...
if (!I->use_empty()) // Don't muck with dead instructions...
if (Constant *C = ConstantFoldInstruction(I)) {
// Add all of the users of this instruction to the worklist, they might
// be constant propagatable now...
for (Value::use_iterator UI = I->use_begin(), UE = I->use_end();
UI != UE; ++UI)
WorkList.insert(cast<Instruction>(*UI));
// Replace all of the uses of a variable with uses of the constant.
I->replaceAllUsesWith(C);
// Remove the dead instruction.
WorkList.erase(I);
I->getParent()->getInstList().erase(I);
// We made a change to the function...
Changed = true;
++NumInstKilled;
}
}
return Changed;
}