2002-11-20 22:28:10 +00:00
|
|
|
//===- ExtractFunction.cpp - Extract a function from Program --------------===//
|
2005-04-22 00:00:37 +00:00
|
|
|
//
|
2003-10-20 17:47:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
2005-04-22 00:00:37 +00:00
|
|
|
//
|
2003-10-20 17:47:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-11-20 22:28:10 +00:00
|
|
|
//
|
2004-03-14 20:50:42 +00:00
|
|
|
// This file implements several methods that are used to extract functions,
|
|
|
|
// loops, or portions of a module from the rest of the module.
|
2002-11-20 22:28:10 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "BugDriver.h"
|
2006-03-08 23:55:38 +00:00
|
|
|
#include "llvm/Constants.h"
|
|
|
|
#include "llvm/DerivedTypes.h"
|
2002-11-20 22:28:10 +00:00
|
|
|
#include "llvm/Module.h"
|
|
|
|
#include "llvm/PassManager.h"
|
2003-09-10 21:11:42 +00:00
|
|
|
#include "llvm/Pass.h"
|
2006-07-28 01:19:28 +00:00
|
|
|
#include "llvm/SymbolTable.h"
|
2003-08-07 21:19:30 +00:00
|
|
|
#include "llvm/Analysis/Verifier.h"
|
2002-11-20 22:28:10 +00:00
|
|
|
#include "llvm/Transforms/IPO.h"
|
2003-01-23 02:48:33 +00:00
|
|
|
#include "llvm/Transforms/Scalar.h"
|
2002-11-20 22:28:10 +00:00
|
|
|
#include "llvm/Transforms/Utils/Cloning.h"
|
2004-05-11 21:54:13 +00:00
|
|
|
#include "llvm/Transforms/Utils/FunctionUtils.h"
|
2003-10-23 15:42:55 +00:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/Support/CommandLine.h"
|
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/Support/FileUtilities.h"
|
2004-04-02 16:28:32 +00:00
|
|
|
#include <set>
|
2006-01-22 22:53:40 +00:00
|
|
|
#include <iostream>
|
2003-11-23 04:51:05 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
|
|
|
namespace llvm {
|
2003-11-23 04:51:05 +00:00
|
|
|
bool DisableSimplifyCFG = false;
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2003-04-25 22:08:12 +00:00
|
|
|
namespace {
|
|
|
|
cl::opt<bool>
|
|
|
|
NoDCE ("disable-dce",
|
|
|
|
cl::desc("Do not use the -dce pass to reduce testcases"));
|
2003-08-05 15:51:05 +00:00
|
|
|
cl::opt<bool, true>
|
|
|
|
NoSCFG("disable-simplifycfg", cl::location(DisableSimplifyCFG),
|
2003-04-25 22:08:12 +00:00
|
|
|
cl::desc("Do not use the -simplifycfg pass to reduce testcases"));
|
|
|
|
}
|
2002-11-20 22:28:10 +00:00
|
|
|
|
2003-01-23 02:48:33 +00:00
|
|
|
/// deleteInstructionFromProgram - This method clones the current Program and
|
|
|
|
/// deletes the specified instruction from the cloned module. It then runs a
|
|
|
|
/// series of cleanup passes (ADCE and SimplifyCFG) to eliminate any code which
|
|
|
|
/// depends on the value. The modified module is then returned.
|
|
|
|
///
|
2004-02-18 21:50:26 +00:00
|
|
|
Module *BugDriver::deleteInstructionFromProgram(const Instruction *I,
|
2003-01-23 02:48:33 +00:00
|
|
|
unsigned Simplification) const {
|
|
|
|
Module *Result = CloneModule(Program);
|
|
|
|
|
2004-02-18 21:50:26 +00:00
|
|
|
const BasicBlock *PBB = I->getParent();
|
|
|
|
const Function *PF = PBB->getParent();
|
2003-01-23 02:48:33 +00:00
|
|
|
|
|
|
|
Module::iterator RFI = Result->begin(); // Get iterator to corresponding fn
|
2004-02-18 21:50:26 +00:00
|
|
|
std::advance(RFI, std::distance(PF->getParent()->begin(),
|
|
|
|
Module::const_iterator(PF)));
|
2003-01-23 02:48:33 +00:00
|
|
|
|
|
|
|
Function::iterator RBI = RFI->begin(); // Get iterator to corresponding BB
|
2004-02-18 21:50:26 +00:00
|
|
|
std::advance(RBI, std::distance(PF->begin(), Function::const_iterator(PBB)));
|
2003-01-23 02:48:33 +00:00
|
|
|
|
|
|
|
BasicBlock::iterator RI = RBI->begin(); // Get iterator to corresponding inst
|
2004-02-18 21:50:26 +00:00
|
|
|
std::advance(RI, std::distance(PBB->begin(), BasicBlock::const_iterator(I)));
|
|
|
|
Instruction *TheInst = RI; // Got the corresponding instruction!
|
2003-01-23 02:48:33 +00:00
|
|
|
|
|
|
|
// If this instruction produces a value, replace any users with null values
|
2004-02-18 21:50:26 +00:00
|
|
|
if (TheInst->getType() != Type::VoidTy)
|
|
|
|
TheInst->replaceAllUsesWith(Constant::getNullValue(TheInst->getType()));
|
2003-01-23 02:48:33 +00:00
|
|
|
|
|
|
|
// Remove the instruction from the program.
|
2004-02-18 21:50:26 +00:00
|
|
|
TheInst->getParent()->getInstList().erase(TheInst);
|
2003-01-23 02:48:33 +00:00
|
|
|
|
2006-03-08 23:55:38 +00:00
|
|
|
|
|
|
|
//writeProgramToFile("current.bc", Result);
|
|
|
|
|
2003-04-24 22:53:24 +00:00
|
|
|
// Spiff up the output a little bit.
|
2003-01-23 02:48:33 +00:00
|
|
|
PassManager Passes;
|
2003-10-23 15:42:55 +00:00
|
|
|
// Make sure that the appropriate target data is always used...
|
2006-06-16 18:23:49 +00:00
|
|
|
Passes.add(new TargetData(Result));
|
2003-10-23 15:42:55 +00:00
|
|
|
|
2004-03-14 20:50:42 +00:00
|
|
|
/// FIXME: If this used runPasses() like the methods below, we could get rid
|
|
|
|
/// of the -disable-* options!
|
2003-04-25 22:08:12 +00:00
|
|
|
if (Simplification > 1 && !NoDCE)
|
2003-01-23 02:48:33 +00:00
|
|
|
Passes.add(createDeadCodeEliminationPass());
|
2003-08-05 15:51:05 +00:00
|
|
|
if (Simplification && !DisableSimplifyCFG)
|
2003-01-23 02:48:33 +00:00
|
|
|
Passes.add(createCFGSimplificationPass()); // Delete dead control flow
|
2003-03-07 18:17:13 +00:00
|
|
|
|
|
|
|
Passes.add(createVerifierPass());
|
2003-01-23 02:48:33 +00:00
|
|
|
Passes.run(*Result);
|
|
|
|
return Result;
|
|
|
|
}
|
2003-02-28 16:13:20 +00:00
|
|
|
|
2003-11-05 21:45:35 +00:00
|
|
|
static const PassInfo *getPI(Pass *P) {
|
|
|
|
const PassInfo *PI = P->getPassInfo();
|
|
|
|
delete P;
|
|
|
|
return PI;
|
|
|
|
}
|
|
|
|
|
2003-02-28 16:13:20 +00:00
|
|
|
/// performFinalCleanups - This method clones the current Program and performs
|
|
|
|
/// a series of cleanups intended to get rid of extra cruft on the module
|
2005-02-23 06:12:11 +00:00
|
|
|
/// before handing it to the user.
|
2003-02-28 16:13:20 +00:00
|
|
|
///
|
2003-11-05 21:45:35 +00:00
|
|
|
Module *BugDriver::performFinalCleanups(Module *M, bool MayModifySemantics) {
|
2003-05-21 19:41:31 +00:00
|
|
|
// Make all functions external, so GlobalDCE doesn't delete them...
|
|
|
|
for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
|
|
|
|
I->setLinkage(GlobalValue::ExternalLinkage);
|
2005-04-22 00:00:37 +00:00
|
|
|
|
2003-11-05 21:45:35 +00:00
|
|
|
std::vector<const PassInfo*> CleanupPasses;
|
|
|
|
CleanupPasses.push_back(getPI(createFunctionResolvingPass()));
|
|
|
|
CleanupPasses.push_back(getPI(createGlobalDCEPass()));
|
|
|
|
CleanupPasses.push_back(getPI(createDeadTypeEliminationPass()));
|
|
|
|
|
2003-11-23 04:51:05 +00:00
|
|
|
if (MayModifySemantics)
|
|
|
|
CleanupPasses.push_back(getPI(createDeadArgHackingPass()));
|
|
|
|
else
|
|
|
|
CleanupPasses.push_back(getPI(createDeadArgEliminationPass()));
|
2003-11-05 21:45:35 +00:00
|
|
|
|
2004-03-14 21:17:22 +00:00
|
|
|
Module *New = runPassesOn(M, CleanupPasses);
|
|
|
|
if (New == 0) {
|
2004-03-14 20:02:07 +00:00
|
|
|
std::cerr << "Final cleanups failed. Sorry. :( Please report a bug!\n";
|
2005-02-23 06:12:11 +00:00
|
|
|
return M;
|
2003-11-05 21:45:35 +00:00
|
|
|
}
|
2004-03-14 21:17:22 +00:00
|
|
|
delete M;
|
|
|
|
return New;
|
2003-02-28 16:13:20 +00:00
|
|
|
}
|
2004-03-14 19:27:19 +00:00
|
|
|
|
|
|
|
|
2004-03-14 20:02:07 +00:00
|
|
|
/// ExtractLoop - Given a module, extract up to one loop from it into a new
|
|
|
|
/// function. This returns null if there are no extractable loops in the
|
|
|
|
/// program or if the loop extractor crashes.
|
|
|
|
Module *BugDriver::ExtractLoop(Module *M) {
|
|
|
|
std::vector<const PassInfo*> LoopExtractPasses;
|
|
|
|
LoopExtractPasses.push_back(getPI(createSingleLoopExtractorPass()));
|
|
|
|
|
2004-03-14 21:17:22 +00:00
|
|
|
Module *NewM = runPassesOn(M, LoopExtractPasses);
|
|
|
|
if (NewM == 0) {
|
2004-03-14 22:08:00 +00:00
|
|
|
Module *Old = swapProgramIn(M);
|
|
|
|
std::cout << "*** Loop extraction failed: ";
|
|
|
|
EmitProgressBytecode("loopextraction", true);
|
|
|
|
std::cout << "*** Sorry. :( Please report a bug!\n";
|
|
|
|
swapProgramIn(Old);
|
2004-03-14 20:02:07 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2004-03-14 21:17:22 +00:00
|
|
|
|
|
|
|
// Check to see if we created any new functions. If not, no loops were
|
2004-11-18 19:40:13 +00:00
|
|
|
// extracted and we should return null. Limit the number of loops we extract
|
|
|
|
// to avoid taking forever.
|
|
|
|
static unsigned NumExtracted = 32;
|
2004-11-16 06:31:38 +00:00
|
|
|
if (M->size() == NewM->size() || --NumExtracted == 0) {
|
2004-03-14 21:17:22 +00:00
|
|
|
delete NewM;
|
|
|
|
return 0;
|
2004-11-16 06:31:38 +00:00
|
|
|
} else {
|
|
|
|
assert(M->size() < NewM->size() && "Loop extract removed functions?");
|
|
|
|
Module::iterator MI = NewM->begin();
|
|
|
|
for (unsigned i = 0, e = M->size(); i != e; ++i)
|
|
|
|
++MI;
|
2004-03-14 21:17:22 +00:00
|
|
|
}
|
2005-04-22 00:00:37 +00:00
|
|
|
|
2004-03-14 21:17:22 +00:00
|
|
|
return NewM;
|
2004-03-14 20:02:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-03-14 19:27:19 +00:00
|
|
|
// DeleteFunctionBody - "Remove" the function by deleting all of its basic
|
|
|
|
// blocks, making it external.
|
|
|
|
//
|
|
|
|
void llvm::DeleteFunctionBody(Function *F) {
|
|
|
|
// delete the body of the function...
|
|
|
|
F->deleteBody();
|
|
|
|
assert(F->isExternal() && "This didn't make the function external!");
|
|
|
|
}
|
|
|
|
|
2006-03-08 23:55:38 +00:00
|
|
|
/// GetTorInit - Given a list of entries for static ctors/dtors, return them
|
|
|
|
/// as a constant array.
|
|
|
|
static Constant *GetTorInit(std::vector<std::pair<Function*, int> > &TorList) {
|
|
|
|
assert(!TorList.empty() && "Don't create empty tor list!");
|
|
|
|
std::vector<Constant*> ArrayElts;
|
|
|
|
for (unsigned i = 0, e = TorList.size(); i != e; ++i) {
|
|
|
|
std::vector<Constant*> Elts;
|
|
|
|
Elts.push_back(ConstantSInt::get(Type::IntTy, TorList[i].second));
|
|
|
|
Elts.push_back(TorList[i].first);
|
|
|
|
ArrayElts.push_back(ConstantStruct::get(Elts));
|
|
|
|
}
|
|
|
|
return ConstantArray::get(ArrayType::get(ArrayElts[0]->getType(),
|
|
|
|
ArrayElts.size()),
|
|
|
|
ArrayElts);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// SplitStaticCtorDtor - A module was recently split into two parts, M1/M2, and
|
|
|
|
/// M1 has all of the global variables. If M2 contains any functions that are
|
|
|
|
/// static ctors/dtors, we need to add an llvm.global_[cd]tors global to M2, and
|
|
|
|
/// prune appropriate entries out of M1s list.
|
|
|
|
static void SplitStaticCtorDtor(const char *GlobalName, Module *M1, Module *M2){
|
|
|
|
GlobalVariable *GV = M1->getNamedGlobal(GlobalName);
|
|
|
|
if (!GV || GV->isExternal() || GV->hasInternalLinkage() ||
|
|
|
|
!GV->use_empty()) return;
|
|
|
|
|
|
|
|
std::vector<std::pair<Function*, int> > M1Tors, M2Tors;
|
|
|
|
ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
|
|
|
|
if (!InitList) return;
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i) {
|
|
|
|
if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
|
|
|
|
if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
|
|
|
|
|
|
|
|
if (CS->getOperand(1)->isNullValue())
|
|
|
|
break; // Found a null terminator, stop here.
|
|
|
|
|
|
|
|
ConstantSInt *CI = dyn_cast<ConstantSInt>(CS->getOperand(0));
|
|
|
|
int Priority = CI ? CI->getValue() : 0;
|
|
|
|
|
|
|
|
Constant *FP = CS->getOperand(1);
|
|
|
|
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
|
|
|
|
if (CE->getOpcode() == Instruction::Cast)
|
|
|
|
FP = CE->getOperand(0);
|
|
|
|
if (Function *F = dyn_cast<Function>(FP)) {
|
|
|
|
if (!F->isExternal())
|
|
|
|
M1Tors.push_back(std::make_pair(F, Priority));
|
|
|
|
else {
|
|
|
|
// Map to M2's version of the function.
|
|
|
|
F = M2->getFunction(F->getName(), F->getFunctionType());
|
|
|
|
M2Tors.push_back(std::make_pair(F, Priority));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
GV->eraseFromParent();
|
|
|
|
if (!M1Tors.empty()) {
|
|
|
|
Constant *M1Init = GetTorInit(M1Tors);
|
|
|
|
new GlobalVariable(M1Init->getType(), false, GlobalValue::AppendingLinkage,
|
|
|
|
M1Init, GlobalName, M1);
|
|
|
|
}
|
|
|
|
|
|
|
|
GV = M2->getNamedGlobal(GlobalName);
|
|
|
|
assert(GV && "Not a clone of M1?");
|
|
|
|
assert(GV->use_empty() && "llvm.ctors shouldn't have uses!");
|
|
|
|
|
|
|
|
GV->eraseFromParent();
|
|
|
|
if (!M2Tors.empty()) {
|
|
|
|
Constant *M2Init = GetTorInit(M2Tors);
|
|
|
|
new GlobalVariable(M2Init->getType(), false, GlobalValue::AppendingLinkage,
|
|
|
|
M2Init, GlobalName, M2);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-07-28 01:19:28 +00:00
|
|
|
//// RewriteUsesInNewModule - takes a Module and a reference to a globalvalue
|
|
|
|
//// (OrigVal) in that module and changes the reference to a different
|
|
|
|
//// globalvalue (NewVal) in a seperate module.
|
|
|
|
static void RewriteUsesInNewModule(Constant *OrigVal, Constant *NewVal,
|
|
|
|
Module *TargetMod) {
|
|
|
|
assert(OrigVal->getType() == NewVal->getType() &&
|
|
|
|
"Can't replace something with a different type");
|
|
|
|
for (Value::use_iterator UI = OrigVal->use_begin(), E = OrigVal->use_end();
|
|
|
|
UI != E; ) {
|
|
|
|
Value::use_iterator TmpUI = UI++;
|
|
|
|
User *U = *TmpUI;
|
|
|
|
if (Instruction *Inst = dyn_cast<Instruction>(U)) {
|
|
|
|
Module *InstM = Inst->getParent()->getParent()->getParent();
|
|
|
|
if (InstM != TargetMod) {
|
|
|
|
TmpUI.getUse() = NewVal;
|
|
|
|
}
|
|
|
|
} else if (GlobalVariable *GV = dyn_cast<GlobalVariable>(U)) {
|
|
|
|
if (GV->getParent() != TargetMod) {
|
|
|
|
TmpUI.getUse() = NewVal;
|
|
|
|
}
|
|
|
|
} else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(U)) {
|
|
|
|
// If nothing uses this, don't bother making a copy.
|
|
|
|
if (CE->use_empty()) continue;
|
|
|
|
Constant *NewCE = CE->getWithOperandReplaced(TmpUI.getOperandNo(),
|
|
|
|
NewVal);
|
|
|
|
RewriteUsesInNewModule(CE, NewCE, TargetMod);
|
|
|
|
} else if (ConstantStruct *CS = dyn_cast<ConstantStruct>(U)) {
|
|
|
|
// If nothing uses this, don't bother making a copy.
|
|
|
|
if (CS->use_empty()) continue;
|
|
|
|
unsigned OpNo = TmpUI.getOperandNo();
|
|
|
|
std::vector<Constant*> Ops;
|
|
|
|
for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i)
|
|
|
|
Ops.push_back(i == OpNo ? NewVal : CS->getOperand(i));
|
|
|
|
Constant *NewStruct = ConstantStruct::get(Ops);
|
|
|
|
RewriteUsesInNewModule(CS, NewStruct, TargetMod);
|
|
|
|
} else if (ConstantPacked *CP = dyn_cast<ConstantPacked>(U)) {
|
|
|
|
// If nothing uses this, don't bother making a copy.
|
|
|
|
if (CP->use_empty()) continue;
|
|
|
|
unsigned OpNo = TmpUI.getOperandNo();
|
|
|
|
std::vector<Constant*> Ops;
|
|
|
|
for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
|
|
|
|
Ops.push_back(i == OpNo ? NewVal : CP->getOperand(i));
|
|
|
|
Constant *NewPacked = ConstantPacked::get(Ops);
|
|
|
|
RewriteUsesInNewModule(CP, NewPacked, TargetMod);
|
|
|
|
} else if (ConstantArray *CA = dyn_cast<ConstantArray>(U)) {
|
|
|
|
// If nothing uses this, don't bother making a copy.
|
|
|
|
if (CA->use_empty()) continue;
|
|
|
|
unsigned OpNo = TmpUI.getOperandNo();
|
|
|
|
std::vector<Constant*> Ops;
|
|
|
|
for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i) {
|
|
|
|
Ops.push_back(i == OpNo ? NewVal : CA->getOperand(i));
|
|
|
|
}
|
|
|
|
Constant *NewArray = ConstantArray::get(CA->getType(), Ops);
|
|
|
|
RewriteUsesInNewModule(CA, NewArray, TargetMod);
|
|
|
|
} else {
|
|
|
|
assert(0 && "Unexpected user");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-03-14 19:27:19 +00:00
|
|
|
/// SplitFunctionsOutOfModule - Given a module and a list of functions in the
|
|
|
|
/// module, split the functions OUT of the specified module, and place them in
|
|
|
|
/// the new module.
|
|
|
|
Module *llvm::SplitFunctionsOutOfModule(Module *M,
|
|
|
|
const std::vector<Function*> &F) {
|
|
|
|
// Make sure functions & globals are all external so that linkage
|
|
|
|
// between the two modules will work.
|
|
|
|
for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
|
|
|
|
I->setLinkage(GlobalValue::ExternalLinkage);
|
2006-03-08 23:55:38 +00:00
|
|
|
for (Module::global_iterator I = M->global_begin(), E = M->global_end();
|
|
|
|
I != E; ++I)
|
2004-03-14 19:27:19 +00:00
|
|
|
I->setLinkage(GlobalValue::ExternalLinkage);
|
|
|
|
|
2006-07-28 01:19:28 +00:00
|
|
|
// First off, we need to create the new module...
|
|
|
|
Module *New = new Module(M->getModuleIdentifier());
|
|
|
|
New->setEndianness(M->getEndianness());
|
|
|
|
New->setPointerSize(M->getPointerSize());
|
|
|
|
New->setTargetTriple(M->getTargetTriple());
|
|
|
|
New->setModuleInlineAsm(M->getModuleInlineAsm());
|
2004-03-14 19:27:19 +00:00
|
|
|
|
2006-07-28 01:19:28 +00:00
|
|
|
// Copy all of the dependent libraries over.
|
|
|
|
for (Module::lib_iterator I = M->lib_begin(), E = M->lib_end(); I != E; ++I)
|
|
|
|
New->addLibrary(*I);
|
2004-03-14 19:27:19 +00:00
|
|
|
|
2006-07-28 01:19:28 +00:00
|
|
|
// build a set of the functions to search later...
|
2004-04-02 16:28:32 +00:00
|
|
|
std::set<std::pair<std::string, const PointerType*> > TestFunctions;
|
2004-03-14 19:27:19 +00:00
|
|
|
for (unsigned i = 0, e = F.size(); i != e; ++i) {
|
2006-07-28 01:19:28 +00:00
|
|
|
TestFunctions.insert(std::make_pair(F[i]->getName(), F[i]->getType()));
|
|
|
|
}
|
|
|
|
|
|
|
|
std::map<GlobalValue*, GlobalValue*> GlobalToPrototypeMap;
|
|
|
|
std::vector<GlobalValue*> OrigGlobals;
|
|
|
|
|
|
|
|
// Adding specified functions to new module...
|
|
|
|
for (Module::iterator I = M->begin(), E = M->end(); I != E;) {
|
|
|
|
OrigGlobals.push_back(I);
|
|
|
|
if(TestFunctions.count(std::make_pair(I->getName(), I->getType()))) {
|
|
|
|
Module::iterator tempI = I;
|
|
|
|
I++;
|
|
|
|
Function * func = new Function(tempI->getFunctionType(),
|
|
|
|
GlobalValue::ExternalLinkage);
|
|
|
|
M->getFunctionList().insert(tempI, func);
|
|
|
|
New->getFunctionList().splice(New->end(),
|
|
|
|
M->getFunctionList(),
|
|
|
|
tempI);
|
|
|
|
func->setName(tempI->getName());
|
|
|
|
func->setCallingConv(tempI->getCallingConv());
|
|
|
|
GlobalToPrototypeMap[tempI] = func;
|
|
|
|
// NEW TO OLD
|
|
|
|
} else {
|
|
|
|
Function * func = new Function(I->getFunctionType(),
|
|
|
|
GlobalValue::ExternalLinkage,
|
|
|
|
I->getName(),
|
|
|
|
New);
|
|
|
|
func->setCallingConv(I->getCallingConv());
|
|
|
|
GlobalToPrototypeMap[I] = func;
|
|
|
|
// NEW TO OLD
|
|
|
|
I++;
|
|
|
|
}
|
2004-03-14 19:27:19 +00:00
|
|
|
}
|
|
|
|
|
2006-07-28 01:19:28 +00:00
|
|
|
//copy over global list
|
|
|
|
for (Module::global_iterator I = M->global_begin(),
|
|
|
|
E = M->global_end(); I != E; ++I) {
|
|
|
|
OrigGlobals.push_back(I);
|
|
|
|
GlobalVariable *glob = new GlobalVariable (I->getType()->getElementType(),
|
|
|
|
I->isConstant(),
|
|
|
|
GlobalValue::ExternalLinkage,
|
|
|
|
0,
|
|
|
|
I->getName(),
|
|
|
|
New);
|
|
|
|
GlobalToPrototypeMap[I] = glob;
|
|
|
|
}
|
2006-03-08 23:55:38 +00:00
|
|
|
|
2006-07-28 01:19:28 +00:00
|
|
|
// Copy all of the type symbol table entries over.
|
|
|
|
const SymbolTable &SymTab = M->getSymbolTable();
|
|
|
|
SymbolTable::type_const_iterator TypeI = SymTab.type_begin();
|
|
|
|
SymbolTable::type_const_iterator TypeE = SymTab.type_end();
|
|
|
|
for (; TypeI != TypeE; ++TypeI)
|
|
|
|
New->addTypeName(TypeI->first, TypeI->second);
|
|
|
|
|
|
|
|
// Loop over globals, rewriting uses in the module the prototype is in to use
|
|
|
|
// the prototype.
|
|
|
|
for (unsigned i = 0, e = OrigGlobals.size(); i != e; ++i) {
|
|
|
|
assert(OrigGlobals[i]->getName() ==
|
|
|
|
GlobalToPrototypeMap[OrigGlobals[i]]->getName());
|
|
|
|
RewriteUsesInNewModule(OrigGlobals[i], GlobalToPrototypeMap[OrigGlobals[i]],
|
|
|
|
OrigGlobals[i]->getParent());
|
|
|
|
}
|
|
|
|
|
2006-03-08 23:55:38 +00:00
|
|
|
// Make sure that there is a global ctor/dtor array in both halves of the
|
|
|
|
// module if they both have static ctor/dtor functions.
|
|
|
|
SplitStaticCtorDtor("llvm.global_ctors", M, New);
|
|
|
|
SplitStaticCtorDtor("llvm.global_dtors", M, New);
|
|
|
|
|
2004-03-14 19:27:19 +00:00
|
|
|
return New;
|
|
|
|
}
|
2004-05-11 21:54:13 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Basic Block Extraction Code
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
std::vector<BasicBlock*> BlocksToNotExtract;
|
|
|
|
|
|
|
|
/// BlockExtractorPass - This pass is used by bugpoint to extract all blocks
|
|
|
|
/// from the module into their own functions except for those specified by the
|
|
|
|
/// BlocksToNotExtract list.
|
2004-09-20 04:48:05 +00:00
|
|
|
class BlockExtractorPass : public ModulePass {
|
|
|
|
bool runOnModule(Module &M);
|
2004-05-11 21:54:13 +00:00
|
|
|
};
|
|
|
|
RegisterOpt<BlockExtractorPass>
|
|
|
|
XX("extract-bbs", "Extract Basic Blocks From Module (for bugpoint use)");
|
|
|
|
}
|
|
|
|
|
2004-09-20 04:48:05 +00:00
|
|
|
bool BlockExtractorPass::runOnModule(Module &M) {
|
2004-05-11 21:54:13 +00:00
|
|
|
std::set<BasicBlock*> TranslatedBlocksToNotExtract;
|
|
|
|
for (unsigned i = 0, e = BlocksToNotExtract.size(); i != e; ++i) {
|
|
|
|
BasicBlock *BB = BlocksToNotExtract[i];
|
|
|
|
Function *F = BB->getParent();
|
|
|
|
|
|
|
|
// Map the corresponding function in this module.
|
|
|
|
Function *MF = M.getFunction(F->getName(), F->getFunctionType());
|
|
|
|
|
|
|
|
// Figure out which index the basic block is in its function.
|
|
|
|
Function::iterator BBI = MF->begin();
|
|
|
|
std::advance(BBI, std::distance(F->begin(), Function::iterator(BB)));
|
|
|
|
TranslatedBlocksToNotExtract.insert(BBI);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now that we know which blocks to not extract, figure out which ones we WANT
|
|
|
|
// to extract.
|
|
|
|
std::vector<BasicBlock*> BlocksToExtract;
|
|
|
|
for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)
|
|
|
|
for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
|
|
|
|
if (!TranslatedBlocksToNotExtract.count(BB))
|
|
|
|
BlocksToExtract.push_back(BB);
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = BlocksToExtract.size(); i != e; ++i)
|
|
|
|
ExtractBasicBlock(BlocksToExtract[i]);
|
2005-04-22 00:00:37 +00:00
|
|
|
|
2004-05-11 21:54:13 +00:00
|
|
|
return !BlocksToExtract.empty();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// ExtractMappedBlocksFromModule - Extract all but the specified basic blocks
|
|
|
|
/// into their own functions. The only detail is that M is actually a module
|
|
|
|
/// cloned from the one the BBs are in, so some mapping needs to be performed.
|
|
|
|
/// If this operation fails for some reason (ie the implementation is buggy),
|
|
|
|
/// this function should return null, otherwise it returns a new Module.
|
|
|
|
Module *BugDriver::ExtractMappedBlocksFromModule(const
|
|
|
|
std::vector<BasicBlock*> &BBs,
|
|
|
|
Module *M) {
|
|
|
|
// Set the global list so that pass will be able to access it.
|
|
|
|
BlocksToNotExtract = BBs;
|
|
|
|
|
|
|
|
std::vector<const PassInfo*> PI;
|
|
|
|
PI.push_back(getPI(new BlockExtractorPass()));
|
|
|
|
Module *Ret = runPassesOn(M, PI);
|
|
|
|
BlocksToNotExtract.clear();
|
2004-08-12 02:36:50 +00:00
|
|
|
if (Ret == 0) {
|
2004-05-11 21:54:13 +00:00
|
|
|
std::cout << "*** Basic Block extraction failed, please report a bug!\n";
|
2004-08-12 02:36:50 +00:00
|
|
|
M = swapProgramIn(M);
|
|
|
|
EmitProgressBytecode("basicblockextractfail", true);
|
2006-05-12 17:28:36 +00:00
|
|
|
swapProgramIn(M);
|
2004-08-12 02:36:50 +00:00
|
|
|
}
|
2004-05-11 21:54:13 +00:00
|
|
|
return Ret;
|
|
|
|
}
|