2002-11-20 22:28:10 +00:00
|
|
|
//===- ExtractFunction.cpp - Extract a function from Program --------------===//
|
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.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
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"
|
2003-08-07 21:19:30 +00:00
|
|
|
#include "llvm/Constant.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"
|
2003-08-07 21:19:30 +00:00
|
|
|
#include "llvm/Type.h"
|
|
|
|
#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"
|
2003-04-25 22:08:12 +00:00
|
|
|
#include "Support/CommandLine.h"
|
2004-03-14 19:27:19 +00:00
|
|
|
#include "Support/Debug.h"
|
2003-12-07 02:31:03 +00:00
|
|
|
#include "Support/FileUtilities.h"
|
2004-04-02 16:28:32 +00:00
|
|
|
#include <set>
|
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
|
|
|
|
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...
|
|
|
|
Passes.add(new TargetData("bugpoint", Result));
|
|
|
|
|
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
|
|
|
|
/// before handing it to the user...
|
|
|
|
///
|
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);
|
2003-05-21 20:38:59 +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";
|
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
|
|
|
|
// extracted and we should return null.
|
2004-03-17 17:37:18 +00:00
|
|
|
if (M->size() == NewM->size()) {
|
2004-03-14 21:17:22 +00:00
|
|
|
delete NewM;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
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!");
|
|
|
|
}
|
|
|
|
|
|
|
|
/// 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.
|
2004-03-14 19:31:00 +00:00
|
|
|
///
|
|
|
|
/// FIXME: this could be made DRAMATICALLY more efficient for large programs if
|
|
|
|
/// we just MOVED functions from one module to the other, instead of cloning the
|
|
|
|
/// whole module, then proceeding to delete an entire module's worth of stuff.
|
|
|
|
///
|
2004-03-14 19:27:19 +00:00
|
|
|
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);
|
|
|
|
for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
|
|
|
|
I->setLinkage(GlobalValue::ExternalLinkage);
|
|
|
|
|
|
|
|
Module *New = CloneModule(M);
|
|
|
|
|
|
|
|
// Make sure global initializers exist only in the safe module (CBE->.so)
|
|
|
|
for (Module::giterator I = New->gbegin(), E = New->gend(); I != E; ++I)
|
|
|
|
I->setInitializer(0); // Delete the initializer to make it external
|
|
|
|
|
|
|
|
// Remove the Test functions from the Safe module
|
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) {
|
2004-04-02 16:28:32 +00:00
|
|
|
TestFunctions.insert(std::make_pair(F[i]->getName(), F[i]->getType()));
|
2004-03-14 19:27:19 +00:00
|
|
|
Function *TNOF = M->getFunction(F[i]->getName(), F[i]->getFunctionType());
|
|
|
|
DEBUG(std::cerr << "Removing function " << F[i]->getName() << "\n");
|
|
|
|
assert(TNOF && "Function doesn't exist in module!");
|
|
|
|
DeleteFunctionBody(TNOF); // Function is now external in this module!
|
|
|
|
}
|
|
|
|
|
|
|
|
// Remove the Safe functions from the Test module
|
2004-04-02 16:28:32 +00:00
|
|
|
for (Module::iterator I = New->begin(), E = New->end(); I != E; ++I)
|
|
|
|
if (!TestFunctions.count(std::make_pair(I->getName(), I->getType())))
|
2004-03-14 19:27:19 +00:00
|
|
|
DeleteFunctionBody(I);
|
|
|
|
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.
|
|
|
|
class BlockExtractorPass : public Pass {
|
|
|
|
bool run(Module &M);
|
|
|
|
};
|
|
|
|
RegisterOpt<BlockExtractorPass>
|
|
|
|
XX("extract-bbs", "Extract Basic Blocks From Module (for bugpoint use)");
|
|
|
|
}
|
|
|
|
|
|
|
|
bool BlockExtractorPass::run(Module &M) {
|
|
|
|
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]);
|
|
|
|
|
|
|
|
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);
|
|
|
|
M = swapProgramIn(M);
|
|
|
|
}
|
2004-05-11 21:54:13 +00:00
|
|
|
return Ret;
|
|
|
|
}
|