2002-11-20 23:28:10 +01:00
|
|
|
//===- ExtractFunction.cpp - Extract a function from Program --------------===//
|
2005-04-22 02:00:37 +02:00
|
|
|
//
|
2003-10-20 19:47:21 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 21:44:31 +01:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-22 02:00:37 +02:00
|
|
|
//
|
2003-10-20 19:47:21 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-11-20 23:28:10 +01:00
|
|
|
//
|
2004-03-14 21:50:42 +01: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 23:28:10 +01:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "BugDriver.h"
|
2006-03-09 00:55:38 +01:00
|
|
|
#include "llvm/Constants.h"
|
|
|
|
#include "llvm/DerivedTypes.h"
|
2002-11-20 23:28:10 +01:00
|
|
|
#include "llvm/Module.h"
|
|
|
|
#include "llvm/PassManager.h"
|
2003-09-10 23:11:42 +02:00
|
|
|
#include "llvm/Pass.h"
|
2003-08-07 23:19:30 +02:00
|
|
|
#include "llvm/Analysis/Verifier.h"
|
2002-11-20 23:28:10 +01:00
|
|
|
#include "llvm/Transforms/IPO.h"
|
2003-01-23 03:48:33 +01:00
|
|
|
#include "llvm/Transforms/Scalar.h"
|
2002-11-20 23:28:10 +01:00
|
|
|
#include "llvm/Transforms/Utils/Cloning.h"
|
2004-05-11 23:54:13 +02:00
|
|
|
#include "llvm/Transforms/Utils/FunctionUtils.h"
|
2003-10-23 17:42:55 +02:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2004-09-02 00:55:40 +02:00
|
|
|
#include "llvm/Support/CommandLine.h"
|
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/Support/FileUtilities.h"
|
2007-11-14 07:47:06 +01:00
|
|
|
#include "llvm/System/Path.h"
|
|
|
|
#include "llvm/System/Signals.h"
|
2004-04-02 18:28:32 +02:00
|
|
|
#include <set>
|
2007-11-14 07:47:06 +01:00
|
|
|
#include <fstream>
|
2006-01-22 23:53:40 +01:00
|
|
|
#include <iostream>
|
2003-11-23 05:51:05 +01:00
|
|
|
using namespace llvm;
|
2003-11-11 23:41:34 +01:00
|
|
|
|
|
|
|
namespace llvm {
|
2003-11-23 05:51:05 +01:00
|
|
|
bool DisableSimplifyCFG = false;
|
2003-11-11 23:41:34 +01:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2003-04-26 00:08:12 +02:00
|
|
|
namespace {
|
|
|
|
cl::opt<bool>
|
|
|
|
NoDCE ("disable-dce",
|
|
|
|
cl::desc("Do not use the -dce pass to reduce testcases"));
|
2003-08-05 17:51:05 +02:00
|
|
|
cl::opt<bool, true>
|
|
|
|
NoSCFG("disable-simplifycfg", cl::location(DisableSimplifyCFG),
|
2003-04-26 00:08:12 +02:00
|
|
|
cl::desc("Do not use the -simplifycfg pass to reduce testcases"));
|
|
|
|
}
|
2002-11-20 23:28:10 +01:00
|
|
|
|
2003-01-23 03:48:33 +01: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 22:50:26 +01:00
|
|
|
Module *BugDriver::deleteInstructionFromProgram(const Instruction *I,
|
2003-01-23 03:48:33 +01:00
|
|
|
unsigned Simplification) const {
|
|
|
|
Module *Result = CloneModule(Program);
|
|
|
|
|
2004-02-18 22:50:26 +01:00
|
|
|
const BasicBlock *PBB = I->getParent();
|
|
|
|
const Function *PF = PBB->getParent();
|
2003-01-23 03:48:33 +01:00
|
|
|
|
|
|
|
Module::iterator RFI = Result->begin(); // Get iterator to corresponding fn
|
2004-02-18 22:50:26 +01:00
|
|
|
std::advance(RFI, std::distance(PF->getParent()->begin(),
|
|
|
|
Module::const_iterator(PF)));
|
2003-01-23 03:48:33 +01:00
|
|
|
|
|
|
|
Function::iterator RBI = RFI->begin(); // Get iterator to corresponding BB
|
2004-02-18 22:50:26 +01:00
|
|
|
std::advance(RBI, std::distance(PF->begin(), Function::const_iterator(PBB)));
|
2003-01-23 03:48:33 +01:00
|
|
|
|
|
|
|
BasicBlock::iterator RI = RBI->begin(); // Get iterator to corresponding inst
|
2004-02-18 22:50:26 +01:00
|
|
|
std::advance(RI, std::distance(PBB->begin(), BasicBlock::const_iterator(I)));
|
|
|
|
Instruction *TheInst = RI; // Got the corresponding instruction!
|
2003-01-23 03:48:33 +01:00
|
|
|
|
|
|
|
// If this instruction produces a value, replace any users with null values
|
2008-04-28 02:04:58 +02:00
|
|
|
if (isa<StructType>(TheInst->getType()))
|
|
|
|
TheInst->replaceAllUsesWith(UndefValue::get(TheInst->getType()));
|
|
|
|
else if (TheInst->getType() != Type::VoidTy)
|
2004-02-18 22:50:26 +01:00
|
|
|
TheInst->replaceAllUsesWith(Constant::getNullValue(TheInst->getType()));
|
2003-01-23 03:48:33 +01:00
|
|
|
|
|
|
|
// Remove the instruction from the program.
|
2004-02-18 22:50:26 +01:00
|
|
|
TheInst->getParent()->getInstList().erase(TheInst);
|
2003-01-23 03:48:33 +01:00
|
|
|
|
2006-03-09 00:55:38 +01:00
|
|
|
|
|
|
|
//writeProgramToFile("current.bc", Result);
|
|
|
|
|
2003-04-25 00:53:24 +02:00
|
|
|
// Spiff up the output a little bit.
|
2003-01-23 03:48:33 +01:00
|
|
|
PassManager Passes;
|
2003-10-23 17:42:55 +02:00
|
|
|
// Make sure that the appropriate target data is always used...
|
2006-06-16 20:23:49 +02:00
|
|
|
Passes.add(new TargetData(Result));
|
2003-10-23 17:42:55 +02:00
|
|
|
|
2004-03-14 21:50:42 +01:00
|
|
|
/// FIXME: If this used runPasses() like the methods below, we could get rid
|
|
|
|
/// of the -disable-* options!
|
2003-04-26 00:08:12 +02:00
|
|
|
if (Simplification > 1 && !NoDCE)
|
2003-01-23 03:48:33 +01:00
|
|
|
Passes.add(createDeadCodeEliminationPass());
|
2003-08-05 17:51:05 +02:00
|
|
|
if (Simplification && !DisableSimplifyCFG)
|
2003-01-23 03:48:33 +01:00
|
|
|
Passes.add(createCFGSimplificationPass()); // Delete dead control flow
|
2003-03-07 19:17:13 +01:00
|
|
|
|
|
|
|
Passes.add(createVerifierPass());
|
2003-01-23 03:48:33 +01:00
|
|
|
Passes.run(*Result);
|
|
|
|
return Result;
|
|
|
|
}
|
2003-02-28 17:13:20 +01:00
|
|
|
|
2003-11-05 22:45:35 +01:00
|
|
|
static const PassInfo *getPI(Pass *P) {
|
|
|
|
const PassInfo *PI = P->getPassInfo();
|
|
|
|
delete P;
|
|
|
|
return PI;
|
|
|
|
}
|
|
|
|
|
2003-02-28 17:13:20 +01: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 07:12:11 +01:00
|
|
|
/// before handing it to the user.
|
2003-02-28 17:13:20 +01:00
|
|
|
///
|
2003-11-05 22:45:35 +01:00
|
|
|
Module *BugDriver::performFinalCleanups(Module *M, bool MayModifySemantics) {
|
2003-05-21 21:41:31 +02: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 02:00:37 +02:00
|
|
|
|
2003-11-05 22:45:35 +01:00
|
|
|
std::vector<const PassInfo*> CleanupPasses;
|
|
|
|
CleanupPasses.push_back(getPI(createGlobalDCEPass()));
|
|
|
|
CleanupPasses.push_back(getPI(createDeadTypeEliminationPass()));
|
|
|
|
|
2003-11-23 05:51:05 +01:00
|
|
|
if (MayModifySemantics)
|
|
|
|
CleanupPasses.push_back(getPI(createDeadArgHackingPass()));
|
|
|
|
else
|
|
|
|
CleanupPasses.push_back(getPI(createDeadArgEliminationPass()));
|
2003-11-05 22:45:35 +01:00
|
|
|
|
2004-03-14 22:17:22 +01:00
|
|
|
Module *New = runPassesOn(M, CleanupPasses);
|
|
|
|
if (New == 0) {
|
2004-03-14 21:02:07 +01:00
|
|
|
std::cerr << "Final cleanups failed. Sorry. :( Please report a bug!\n";
|
2005-02-23 07:12:11 +01:00
|
|
|
return M;
|
2003-11-05 22:45:35 +01:00
|
|
|
}
|
2004-03-14 22:17:22 +01:00
|
|
|
delete M;
|
|
|
|
return New;
|
2003-02-28 17:13:20 +01:00
|
|
|
}
|
2004-03-14 20:27:19 +01:00
|
|
|
|
|
|
|
|
2004-03-14 21:02:07 +01: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 22:17:22 +01:00
|
|
|
Module *NewM = runPassesOn(M, LoopExtractPasses);
|
|
|
|
if (NewM == 0) {
|
2004-03-14 23:08:00 +01:00
|
|
|
Module *Old = swapProgramIn(M);
|
|
|
|
std::cout << "*** Loop extraction failed: ";
|
2007-07-04 23:55:50 +02:00
|
|
|
EmitProgressBitcode("loopextraction", true);
|
2004-03-14 23:08:00 +01:00
|
|
|
std::cout << "*** Sorry. :( Please report a bug!\n";
|
|
|
|
swapProgramIn(Old);
|
2004-03-14 21:02:07 +01:00
|
|
|
return 0;
|
|
|
|
}
|
2004-03-14 22:17:22 +01:00
|
|
|
|
|
|
|
// Check to see if we created any new functions. If not, no loops were
|
2004-11-18 20:40:13 +01: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 07:31:38 +01:00
|
|
|
if (M->size() == NewM->size() || --NumExtracted == 0) {
|
2004-03-14 22:17:22 +01:00
|
|
|
delete NewM;
|
|
|
|
return 0;
|
2004-11-16 07:31:38 +01: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 22:17:22 +01:00
|
|
|
}
|
2005-04-22 02:00:37 +02:00
|
|
|
|
2004-03-14 22:17:22 +01:00
|
|
|
return NewM;
|
2004-03-14 21:02:07 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-03-14 20:27:19 +01: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();
|
2007-01-30 21:08:39 +01:00
|
|
|
assert(F->isDeclaration() && "This didn't make the function external!");
|
2004-03-14 20:27:19 +01:00
|
|
|
}
|
|
|
|
|
2006-03-09 00:55:38 +01: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;
|
2006-12-31 07:02:26 +01:00
|
|
|
Elts.push_back(ConstantInt::get(Type::Int32Ty, TorList[i].second));
|
2006-03-09 00:55:38 +01:00
|
|
|
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.
|
2009-04-22 17:57:18 +02:00
|
|
|
static void SplitStaticCtorDtor(const char *GlobalName, Module *M1, Module *M2,
|
|
|
|
DenseMap<const Value*, Value*> ValueMap) {
|
2006-03-09 00:55:38 +01:00
|
|
|
GlobalVariable *GV = M1->getNamedGlobal(GlobalName);
|
2009-01-15 21:18:42 +01:00
|
|
|
if (!GV || GV->isDeclaration() || GV->hasLocalLinkage() ||
|
2006-03-09 00:55:38 +01:00
|
|
|
!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.
|
|
|
|
|
2006-10-20 09:07:24 +02:00
|
|
|
ConstantInt *CI = dyn_cast<ConstantInt>(CS->getOperand(0));
|
|
|
|
int Priority = CI ? CI->getSExtValue() : 0;
|
2006-03-09 00:55:38 +01:00
|
|
|
|
|
|
|
Constant *FP = CS->getOperand(1);
|
|
|
|
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
|
2006-11-27 02:05:10 +01:00
|
|
|
if (CE->isCast())
|
2006-03-09 00:55:38 +01:00
|
|
|
FP = CE->getOperand(0);
|
|
|
|
if (Function *F = dyn_cast<Function>(FP)) {
|
2007-01-30 21:08:39 +01:00
|
|
|
if (!F->isDeclaration())
|
2006-03-09 00:55:38 +01:00
|
|
|
M1Tors.push_back(std::make_pair(F, Priority));
|
|
|
|
else {
|
|
|
|
// Map to M2's version of the function.
|
2009-04-22 17:57:18 +02:00
|
|
|
F = cast<Function>(ValueMap[F]);
|
2006-03-09 00:55:38 +01:00
|
|
|
M2Tors.push_back(std::make_pair(F, Priority));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
GV->eraseFromParent();
|
|
|
|
if (!M1Tors.empty()) {
|
|
|
|
Constant *M1Init = GetTorInit(M1Tors);
|
2009-07-08 03:26:06 +02:00
|
|
|
new GlobalVariable(M1->getContext(), M1Init->getType(), false,
|
|
|
|
GlobalValue::AppendingLinkage,
|
2006-03-09 00:55:38 +01:00
|
|
|
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);
|
2009-07-08 03:26:06 +02:00
|
|
|
new GlobalVariable(M2->getContext(), M2Init->getType(), false,
|
|
|
|
GlobalValue::AppendingLinkage,
|
2006-03-09 00:55:38 +01:00
|
|
|
M2Init, GlobalName, M2);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-07-28 03:19:28 +02:00
|
|
|
|
2004-03-14 20:27:19 +01: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.
|
2009-04-22 17:57:18 +02:00
|
|
|
Module *
|
|
|
|
llvm::SplitFunctionsOutOfModule(Module *M,
|
|
|
|
const std::vector<Function*> &F,
|
|
|
|
DenseMap<const Value*, Value*> &ValueMap) {
|
2004-03-14 20:27:19 +01:00
|
|
|
// 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-09 00:55:38 +01:00
|
|
|
for (Module::global_iterator I = M->global_begin(), E = M->global_end();
|
2008-07-08 18:38:42 +02:00
|
|
|
I != E; ++I) {
|
|
|
|
if (I->hasName() && *I->getNameStart() == '\01')
|
|
|
|
I->setName(I->getNameStart()+1, I->getNameLen()-1);
|
2004-03-14 20:27:19 +01:00
|
|
|
I->setLinkage(GlobalValue::ExternalLinkage);
|
2008-07-08 18:38:42 +02:00
|
|
|
}
|
2004-03-14 20:27:19 +01:00
|
|
|
|
2009-04-22 17:57:18 +02:00
|
|
|
DenseMap<const Value*, Value*> NewValueMap;
|
|
|
|
Module *New = CloneModule(M, NewValueMap);
|
2004-03-14 20:27:19 +01:00
|
|
|
|
2006-11-09 07:24:56 +01:00
|
|
|
// Make sure global initializers exist only in the safe module (CBE->.so)
|
|
|
|
for (Module::global_iterator I = New->global_begin(), E = New->global_end();
|
|
|
|
I != E; ++I)
|
|
|
|
I->setInitializer(0); // Delete the initializer to make it external
|
2004-03-14 20:27:19 +01:00
|
|
|
|
2006-11-09 07:24:56 +01:00
|
|
|
// Remove the Test functions from the Safe module
|
2009-04-22 17:57:18 +02:00
|
|
|
std::set<Function *> TestFunctions;
|
2004-03-14 20:27:19 +01:00
|
|
|
for (unsigned i = 0, e = F.size(); i != e; ++i) {
|
2009-04-22 17:57:18 +02:00
|
|
|
Function *TNOF = cast<Function>(ValueMap[F[i]]);
|
|
|
|
DEBUG(std::cerr << "Removing function ");
|
|
|
|
DEBUG(WriteAsOperand(std::cerr, TNOF, false));
|
|
|
|
DEBUG(std::cerr << "\n");
|
|
|
|
TestFunctions.insert(cast<Function>(NewValueMap[TNOF]));
|
2006-11-09 07:24:56 +01:00
|
|
|
DeleteFunctionBody(TNOF); // Function is now external in this module!
|
2006-07-28 03:19:28 +02:00
|
|
|
}
|
|
|
|
|
2006-03-09 00:55:38 +01:00
|
|
|
|
2006-11-09 07:24:56 +01:00
|
|
|
// Remove the Safe functions from the Test module
|
|
|
|
for (Module::iterator I = New->begin(), E = New->end(); I != E; ++I)
|
2009-04-22 17:57:18 +02:00
|
|
|
if (!TestFunctions.count(I))
|
2006-11-09 07:24:56 +01:00
|
|
|
DeleteFunctionBody(I);
|
|
|
|
|
2006-07-28 03:19:28 +02:00
|
|
|
|
2006-03-09 00:55:38 +01: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.
|
2009-04-22 17:57:18 +02:00
|
|
|
SplitStaticCtorDtor("llvm.global_ctors", M, New, NewValueMap);
|
|
|
|
SplitStaticCtorDtor("llvm.global_dtors", M, New, NewValueMap);
|
2006-03-09 00:55:38 +01:00
|
|
|
|
2004-03-14 20:27:19 +01:00
|
|
|
return New;
|
|
|
|
}
|
2004-05-11 23:54:13 +02:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Basic Block Extraction Code
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
/// 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) {
|
2007-11-14 07:47:06 +01:00
|
|
|
char *ExtraArg = NULL;
|
|
|
|
|
|
|
|
sys::Path uniqueFilename("bugpoint-extractblocks");
|
|
|
|
std::string ErrMsg;
|
|
|
|
if (uniqueFilename.createTemporaryFileOnDisk(true, &ErrMsg)) {
|
|
|
|
std::cout << "*** Basic Block extraction failed!\n";
|
|
|
|
std::cerr << "Error creating temporary file: " << ErrMsg << "\n";
|
|
|
|
M = swapProgramIn(M);
|
|
|
|
EmitProgressBitcode("basicblockextractfail", true);
|
|
|
|
swapProgramIn(M);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
sys::RemoveFileOnSignal(uniqueFilename);
|
|
|
|
|
|
|
|
std::ofstream BlocksToNotExtractFile(uniqueFilename.c_str());
|
|
|
|
if (!BlocksToNotExtractFile) {
|
|
|
|
std::cout << "*** Basic Block extraction failed!\n";
|
|
|
|
std::cerr << "Error writing list of blocks to not extract: " << ErrMsg
|
|
|
|
<< "\n";
|
|
|
|
M = swapProgramIn(M);
|
|
|
|
EmitProgressBitcode("basicblockextractfail", true);
|
|
|
|
swapProgramIn(M);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
for (std::vector<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end();
|
|
|
|
I != E; ++I) {
|
|
|
|
BasicBlock *BB = *I;
|
2008-01-08 05:26:20 +01:00
|
|
|
// If the BB doesn't have a name, give it one so we have something to key
|
|
|
|
// off of.
|
|
|
|
if (!BB->hasName()) BB->setName("tmpbb");
|
2007-11-14 07:47:06 +01:00
|
|
|
BlocksToNotExtractFile << BB->getParent()->getName() << " "
|
|
|
|
<< BB->getName() << "\n";
|
|
|
|
}
|
|
|
|
BlocksToNotExtractFile.close();
|
|
|
|
|
|
|
|
const char *uniqueFN = uniqueFilename.c_str();
|
|
|
|
ExtraArg = (char*)malloc(23 + strlen(uniqueFN));
|
|
|
|
strcat(strcpy(ExtraArg, "--extract-blocks-file="), uniqueFN);
|
|
|
|
|
2004-05-11 23:54:13 +02:00
|
|
|
std::vector<const PassInfo*> PI;
|
2007-11-14 07:47:06 +01:00
|
|
|
std::vector<BasicBlock *> EmptyBBs; // This parameter is ignored.
|
|
|
|
PI.push_back(getPI(createBlockExtractorPass(EmptyBBs)));
|
|
|
|
Module *Ret = runPassesOn(M, PI, false, 1, &ExtraArg);
|
|
|
|
|
|
|
|
if (uniqueFilename.exists())
|
|
|
|
uniqueFilename.eraseFromDisk(); // Free disk space
|
|
|
|
free(ExtraArg);
|
|
|
|
|
2004-08-12 04:36:50 +02:00
|
|
|
if (Ret == 0) {
|
2004-05-11 23:54:13 +02:00
|
|
|
std::cout << "*** Basic Block extraction failed, please report a bug!\n";
|
2004-08-12 04:36:50 +02:00
|
|
|
M = swapProgramIn(M);
|
2007-07-04 23:55:50 +02:00
|
|
|
EmitProgressBitcode("basicblockextractfail", true);
|
2006-05-12 19:28:36 +02:00
|
|
|
swapProgramIn(M);
|
2004-08-12 04:36:50 +02:00
|
|
|
}
|
2004-05-11 23:54:13 +02:00
|
|
|
return Ret;
|
|
|
|
}
|