#include <iostream>
using std::cerr;
-#include "llvm/Assembly/Writer.h"
-
//#define DEBUG_EXPR_CONVERT 1
static bool OperandConvertableToType(User *U, Value *V, const Type *Ty,
#include "llvm/iTerminators.h"
#include "llvm/iPHINode.h"
#include "llvm/iOther.h"
+#include "llvm/Type.h"
#include <algorithm>
#include <map>
#include <iostream>
using std::cerr;
-#include "llvm/Assembly/Writer.h"
-
// RemapInstruction - Convert the instruction operands from referencing the
// current values into those specified by ValueMap.
//
// To enable debugging, uncomment this...
//#define DEBUG_MST(x) x
-#ifdef DEBUG_MST
-#include "llvm/Assembly/Writer.h"
-#else
+#ifndef DEBUG_MST
#define DEBUG_MST(x) // Disable debug code
#endif
using std::set;
using std::pair;
-#include "llvm/Assembly/Writer.h"
-
namespace {
class SimpleStructMutation : public MutateStructTypes {
public:
//This is determined from cond (1-6)
void getEdgeCode::getCode(Instruction *rInst,
Instruction *countInst,
- Method *M,
+ Function *M,
BasicBlock *BB){
BasicBlock::InstListType& instList=BB->getInstList();
#include "Support/STLExtras.h"
#include <algorithm>
-#include "llvm/Assembly/Writer.h"
-
//#define DEBUG_PEEPHOLE_INSTS 1
#ifdef DEBUG_PEEPHOLE_INSTS
static bool DoRaisePass(Function *F) {
bool Changed = false;
- for (Method::iterator MI = F->begin(), ME = F->end(); MI != ME; ++MI) {
+ for (Function::iterator MI = F->begin(), ME = F->end(); MI != ME; ++MI) {
BasicBlock *BB = *MI;
BasicBlock::InstListType &BIL = BB->getInstList();
// It's public interface consists of a constructor and a doADCE() method.
//
class ADCE {
- Method *M; // The method that we are working on...
+ Function *M; // The method that we are working on...
std::vector<Instruction*> WorkList; // Instructions that just became live
std::set<Instruction*> LiveSet; // The set of live instructions
bool MadeChanges;
//
public:
// ADCE Ctor - Save the method to operate on...
- inline ADCE(Method *m) : M(m), MadeChanges(false) {}
+ inline ADCE(Function *m) : M(m), MadeChanges(false) {}
// doADCE() - Run the Agressive Dead Code Elimination algorithm, returning
// true if the method was modified.
//
bool ADCE::doADCE(cfg::DominanceFrontier &CDG) {
#ifdef DEBUG_ADCE
- cerr << "Method: " << M;
+ cerr << "Function: " << M;
#endif
// Iterate over all of the instructions in the method, eliminating trivially
// instructions live in basic blocks that are unreachable. These blocks will
// be eliminated later, along with the instructions inside.
//
- for (df_iterator<Method*> BBI = df_begin(M),
- BBE = df_end(M);
+ for (df_iterator<Function*> BBI = df_begin(M),
+ BBE = df_end(M);
BBI != BBE; ++BBI) {
BasicBlock *BB = *BBI;
for (BasicBlock::iterator II = BB->begin(), EI = BB->end(); II != EI; ) {
}
#ifdef DEBUG_ADCE
- cerr << "Current Method: X = Live\n";
- for (Method::iterator I = M->begin(), E = M->end(); I != E; ++I)
+ cerr << "Current Function: X = Live\n";
+ for (Function::iterator I = M->begin(), E = M->end(); I != E; ++I)
for (BasicBlock::iterator BI = (*I)->begin(), BE = (*I)->end();
BI != BE; ++BI) {
if (LiveSet.count(*BI)) cerr << "X ";
} else {
// We need to move the new entry block to be the first bb of the method.
- Method::iterator EBI = find(M->begin(), M->end(), EntryBlock);
+ Function::iterator EBI = find(M->begin(), M->end(), EntryBlock);
std::swap(*EBI, *M->begin());// Exchange old location with start of method
MadeChanges = true;
}
// Now go through and tell dead blocks to drop all of their references so they
// can be safely deleted.
//
- for (Method::iterator BI = M->begin(), BE = M->end(); BI != BE; ++BI) {
+ for (Function::iterator BI = M->begin(), BE = M->end(); BI != BE; ++BI) {
BasicBlock *BB = *BI;
if (!AliveBlocks.count(BB)) {
BB->dropAllReferences();
// now because we know that there are no references to dead blocks (because
// they have dropped all of their references...
//
- for (Method::iterator BI = M->begin(); BI != M->end();) {
+ for (Function::iterator BI = M->begin(); BI != M->end();) {
if (!AliveBlocks.count(*BI)) {
delete M->getBasicBlocks().remove(BI);
MadeChanges = true;
struct AgressiveDCE : public MethodPass {
// doADCE - Execute the Agressive Dead Code Elimination Algorithm
//
- virtual bool runOnMethod(Method *M) {
+ virtual bool runOnMethod(Function *M) {
return ADCE(M).doADCE(
getAnalysis<cfg::DominanceFrontier>(cfg::DominanceFrontier::PostDomID));
}
static bool DoConstPropPass(Function *F) {
bool SomethingChanged = false;
- for (Method::iterator BBI = F->begin(); BBI != F->end(); ++BBI) {
+ for (Function::iterator BBI = F->begin(); BBI != F->end(); ++BBI) {
BasicBlock *BB = *BBI;
for (BasicBlock::iterator I = BB->begin(); I != BB->end(); )
if (doConstantPropogation(BB, I))
#include "llvm/BasicBlock.h"
#include "llvm/iTerminators.h"
#include "llvm/iPHINode.h"
-#include "llvm/Assembly/Writer.h"
#include "llvm/Support/CFG.h"
#include "llvm/Pass.h"
#include "Support/STLExtras.h"
{
bool changed = false;
- for (Method::iterator BI = F->begin(), BE = F->end(); BI != BE; ++BI)
+ for (Function::iterator BI = F->begin(), BE = F->end(); BI != BE; ++BI)
for (BasicBlock::iterator newI, II = (*BI)->begin();
II != (*BI)->end(); II = ++newI)
{
return Changed;
}
-static bool doit(Method *M, cfg::LoopInfo &Loops) {
+static bool doit(Function *M, cfg::LoopInfo &Loops) {
// Induction Variables live in the header nodes of the loops of the method...
return reduce_apply_bool(Loops.getTopLevelLoops().begin(),
Loops.getTopLevelLoops().end(),
namespace {
struct InductionVariableSimplify : public MethodPass {
- virtual bool runOnMethod(Method *M) {
- return doit(M, getAnalysis<cfg::LoopInfo>());
+ virtual bool runOnMethod(Function *F) {
+ return doit(F, getAnalysis<cfg::LoopInfo>());
}
virtual void getAnalysisUsageInfo(Pass::AnalysisSet &Required,
#include "llvm/Transforms/Scalar/InductionVars.h"
#include "llvm/ConstantVals.h"
#include "llvm/Analysis/IntervalPartition.h"
-#include "llvm/Assembly/Writer.h"
-#include "llvm/SymbolTable.h"
#include "llvm/iPHINode.h"
#include "llvm/Function.h"
#include "llvm/BasicBlock.h"
#include "llvm/InstrTypes.h"
+#include "llvm/Type.h"
#include "llvm/Support/CFG.h"
#include "Support/STLExtras.h"
#include <algorithm>
if (M->hasSymbolTable()) {
// Only name the induction variable if the method isn't stripped.
- PHIName = M->getSymbolTable()->getUniqueName(Type::UIntTy, "ind_var");
- AddName = M->getSymbolTable()->getUniqueName(Type::UIntTy, "ind_var_next");
+ PHIName = "ind_var";
+ AddName = "ind_var_next";
}
// Create the neccesary instructions...
#include "llvm/iTerminators.h"
#include "llvm/iOther.h"
#include "llvm/Pass.h"
-#include "llvm/Assembly/Writer.h"
#include "Support/STLExtras.h"
#include <algorithm>
#include <map>
#include "llvm/Pass.h"
#include "llvm/Function.h"
#include "llvm/BasicBlock.h"
-#include "llvm/Assembly/Writer.h" // For debugging
#include "llvm/iPHINode.h"
#include "llvm/iTerminators.h"