Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 1 | //===- ExtractFunction.cpp - Extract a function from Program --------------===// |
Misha Brukman | 3da94ae | 2005-04-22 00:00:37 +0000 | [diff] [blame] | 2 | // |
John Criswell | 7c0e022 | 2003-10-20 17:47:21 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by the LLVM research group and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
Misha Brukman | 3da94ae | 2005-04-22 00:00:37 +0000 | [diff] [blame] | 7 | // |
John Criswell | 7c0e022 | 2003-10-20 17:47:21 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 9 | // |
Chris Lattner | efdc0b5 | 2004-03-14 20:50:42 +0000 | [diff] [blame] | 10 | // This file implements several methods that are used to extract functions, |
| 11 | // loops, or portions of a module from the rest of the module. |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 12 | // |
| 13 | //===----------------------------------------------------------------------===// |
| 14 | |
| 15 | #include "BugDriver.h" |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 16 | #include "llvm/Constants.h" |
| 17 | #include "llvm/DerivedTypes.h" |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 18 | #include "llvm/Module.h" |
| 19 | #include "llvm/PassManager.h" |
Brian Gaeke | d1a85a7 | 2003-09-10 21:11:42 +0000 | [diff] [blame] | 20 | #include "llvm/Pass.h" |
Misha Brukman | e49603d | 2003-08-07 21:19:30 +0000 | [diff] [blame] | 21 | #include "llvm/Analysis/Verifier.h" |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 22 | #include "llvm/Transforms/IPO.h" |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 23 | #include "llvm/Transforms/Scalar.h" |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 24 | #include "llvm/Transforms/Utils/Cloning.h" |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 25 | #include "llvm/Transforms/Utils/FunctionUtils.h" |
Chris Lattner | 5da69c7 | 2003-10-23 15:42:55 +0000 | [diff] [blame] | 26 | #include "llvm/Target/TargetData.h" |
Reid Spencer | 551ccae | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 27 | #include "llvm/Support/CommandLine.h" |
| 28 | #include "llvm/Support/Debug.h" |
| 29 | #include "llvm/Support/FileUtilities.h" |
Chris Lattner | fb4b96e | 2004-04-02 16:28:32 +0000 | [diff] [blame] | 30 | #include <set> |
Chris Lattner | e31a9cc | 2006-01-22 22:53:40 +0000 | [diff] [blame] | 31 | #include <iostream> |
Chris Lattner | c6b519d | 2003-11-23 04:51:05 +0000 | [diff] [blame] | 32 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 33 | |
| 34 | namespace llvm { |
Chris Lattner | c6b519d | 2003-11-23 04:51:05 +0000 | [diff] [blame] | 35 | bool DisableSimplifyCFG = false; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 36 | } // End llvm namespace |
| 37 | |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 38 | namespace { |
| 39 | cl::opt<bool> |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 40 | NoDCE ("disable-dce", |
| 41 | cl::desc("Do not use the -dce pass to reduce testcases")); |
Chris Lattner | 47ae4a1 | 2003-08-05 15:51:05 +0000 | [diff] [blame] | 42 | cl::opt<bool, true> |
| 43 | NoSCFG("disable-simplifycfg", cl::location(DisableSimplifyCFG), |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 44 | cl::desc("Do not use the -simplifycfg pass to reduce testcases")); |
| 45 | } |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 46 | |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 47 | /// deleteInstructionFromProgram - This method clones the current Program and |
| 48 | /// deletes the specified instruction from the cloned module. It then runs a |
| 49 | /// series of cleanup passes (ADCE and SimplifyCFG) to eliminate any code which |
| 50 | /// depends on the value. The modified module is then returned. |
| 51 | /// |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 52 | Module *BugDriver::deleteInstructionFromProgram(const Instruction *I, |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 53 | unsigned Simplification) const { |
| 54 | Module *Result = CloneModule(Program); |
| 55 | |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 56 | const BasicBlock *PBB = I->getParent(); |
| 57 | const Function *PF = PBB->getParent(); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 58 | |
| 59 | Module::iterator RFI = Result->begin(); // Get iterator to corresponding fn |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 60 | std::advance(RFI, std::distance(PF->getParent()->begin(), |
| 61 | Module::const_iterator(PF))); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 62 | |
| 63 | Function::iterator RBI = RFI->begin(); // Get iterator to corresponding BB |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 64 | std::advance(RBI, std::distance(PF->begin(), Function::const_iterator(PBB))); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 65 | |
| 66 | BasicBlock::iterator RI = RBI->begin(); // Get iterator to corresponding inst |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 67 | std::advance(RI, std::distance(PBB->begin(), BasicBlock::const_iterator(I))); |
| 68 | Instruction *TheInst = RI; // Got the corresponding instruction! |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 69 | |
| 70 | // If this instruction produces a value, replace any users with null values |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 71 | if (TheInst->getType() != Type::VoidTy) |
| 72 | TheInst->replaceAllUsesWith(Constant::getNullValue(TheInst->getType())); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 73 | |
| 74 | // Remove the instruction from the program. |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 75 | TheInst->getParent()->getInstList().erase(TheInst); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 76 | |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 77 | |
| 78 | //writeProgramToFile("current.bc", Result); |
| 79 | |
Chris Lattner | 44be257 | 2003-04-24 22:53:24 +0000 | [diff] [blame] | 80 | // Spiff up the output a little bit. |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 81 | PassManager Passes; |
Chris Lattner | 5da69c7 | 2003-10-23 15:42:55 +0000 | [diff] [blame] | 82 | // Make sure that the appropriate target data is always used... |
Chris Lattner | 831b121 | 2006-06-16 18:23:49 +0000 | [diff] [blame] | 83 | Passes.add(new TargetData(Result)); |
Chris Lattner | 5da69c7 | 2003-10-23 15:42:55 +0000 | [diff] [blame] | 84 | |
Chris Lattner | efdc0b5 | 2004-03-14 20:50:42 +0000 | [diff] [blame] | 85 | /// FIXME: If this used runPasses() like the methods below, we could get rid |
| 86 | /// of the -disable-* options! |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 87 | if (Simplification > 1 && !NoDCE) |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 88 | Passes.add(createDeadCodeEliminationPass()); |
Chris Lattner | 47ae4a1 | 2003-08-05 15:51:05 +0000 | [diff] [blame] | 89 | if (Simplification && !DisableSimplifyCFG) |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 90 | Passes.add(createCFGSimplificationPass()); // Delete dead control flow |
Chris Lattner | 10f22cb | 2003-03-07 18:17:13 +0000 | [diff] [blame] | 91 | |
| 92 | Passes.add(createVerifierPass()); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 93 | Passes.run(*Result); |
| 94 | return Result; |
| 95 | } |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 96 | |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 97 | static const PassInfo *getPI(Pass *P) { |
| 98 | const PassInfo *PI = P->getPassInfo(); |
| 99 | delete P; |
| 100 | return PI; |
| 101 | } |
| 102 | |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 103 | /// performFinalCleanups - This method clones the current Program and performs |
| 104 | /// a series of cleanups intended to get rid of extra cruft on the module |
Chris Lattner | 9b5b190 | 2005-02-23 06:12:11 +0000 | [diff] [blame] | 105 | /// before handing it to the user. |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 106 | /// |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 107 | Module *BugDriver::performFinalCleanups(Module *M, bool MayModifySemantics) { |
Chris Lattner | 28b8ed9 | 2003-05-21 19:41:31 +0000 | [diff] [blame] | 108 | // Make all functions external, so GlobalDCE doesn't delete them... |
| 109 | for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) |
| 110 | I->setLinkage(GlobalValue::ExternalLinkage); |
Misha Brukman | 3da94ae | 2005-04-22 00:00:37 +0000 | [diff] [blame] | 111 | |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 112 | std::vector<const PassInfo*> CleanupPasses; |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 113 | CleanupPasses.push_back(getPI(createGlobalDCEPass())); |
| 114 | CleanupPasses.push_back(getPI(createDeadTypeEliminationPass())); |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 115 | |
Chris Lattner | c6b519d | 2003-11-23 04:51:05 +0000 | [diff] [blame] | 116 | if (MayModifySemantics) |
| 117 | CleanupPasses.push_back(getPI(createDeadArgHackingPass())); |
| 118 | else |
| 119 | CleanupPasses.push_back(getPI(createDeadArgEliminationPass())); |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 120 | |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 121 | Module *New = runPassesOn(M, CleanupPasses); |
| 122 | if (New == 0) { |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 123 | std::cerr << "Final cleanups failed. Sorry. :( Please report a bug!\n"; |
Chris Lattner | 9b5b190 | 2005-02-23 06:12:11 +0000 | [diff] [blame] | 124 | return M; |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 125 | } |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 126 | delete M; |
| 127 | return New; |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 128 | } |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 129 | |
| 130 | |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 131 | /// ExtractLoop - Given a module, extract up to one loop from it into a new |
| 132 | /// function. This returns null if there are no extractable loops in the |
| 133 | /// program or if the loop extractor crashes. |
| 134 | Module *BugDriver::ExtractLoop(Module *M) { |
| 135 | std::vector<const PassInfo*> LoopExtractPasses; |
| 136 | LoopExtractPasses.push_back(getPI(createSingleLoopExtractorPass())); |
| 137 | |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 138 | Module *NewM = runPassesOn(M, LoopExtractPasses); |
| 139 | if (NewM == 0) { |
Chris Lattner | a1cf1c8 | 2004-03-14 22:08:00 +0000 | [diff] [blame] | 140 | Module *Old = swapProgramIn(M); |
| 141 | std::cout << "*** Loop extraction failed: "; |
| 142 | EmitProgressBytecode("loopextraction", true); |
| 143 | std::cout << "*** Sorry. :( Please report a bug!\n"; |
| 144 | swapProgramIn(Old); |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 145 | return 0; |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 146 | } |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 147 | |
| 148 | // Check to see if we created any new functions. If not, no loops were |
Chris Lattner | a269ec7 | 2004-11-18 19:40:13 +0000 | [diff] [blame] | 149 | // extracted and we should return null. Limit the number of loops we extract |
| 150 | // to avoid taking forever. |
| 151 | static unsigned NumExtracted = 32; |
Chris Lattner | 90c18c5 | 2004-11-16 06:31:38 +0000 | [diff] [blame] | 152 | if (M->size() == NewM->size() || --NumExtracted == 0) { |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 153 | delete NewM; |
| 154 | return 0; |
Chris Lattner | 90c18c5 | 2004-11-16 06:31:38 +0000 | [diff] [blame] | 155 | } else { |
| 156 | assert(M->size() < NewM->size() && "Loop extract removed functions?"); |
| 157 | Module::iterator MI = NewM->begin(); |
| 158 | for (unsigned i = 0, e = M->size(); i != e; ++i) |
| 159 | ++MI; |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 160 | } |
Misha Brukman | 3da94ae | 2005-04-22 00:00:37 +0000 | [diff] [blame] | 161 | |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 162 | return NewM; |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 163 | } |
| 164 | |
| 165 | |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 166 | // DeleteFunctionBody - "Remove" the function by deleting all of its basic |
| 167 | // blocks, making it external. |
| 168 | // |
| 169 | void llvm::DeleteFunctionBody(Function *F) { |
| 170 | // delete the body of the function... |
| 171 | F->deleteBody(); |
Reid Spencer | 5cbf985 | 2007-01-30 20:08:39 +0000 | [diff] [blame] | 172 | assert(F->isDeclaration() && "This didn't make the function external!"); |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 173 | } |
| 174 | |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 175 | /// GetTorInit - Given a list of entries for static ctors/dtors, return them |
| 176 | /// as a constant array. |
| 177 | static Constant *GetTorInit(std::vector<std::pair<Function*, int> > &TorList) { |
| 178 | assert(!TorList.empty() && "Don't create empty tor list!"); |
| 179 | std::vector<Constant*> ArrayElts; |
| 180 | for (unsigned i = 0, e = TorList.size(); i != e; ++i) { |
| 181 | std::vector<Constant*> Elts; |
Reid Spencer | 71d2ec9 | 2006-12-31 06:02:26 +0000 | [diff] [blame] | 182 | Elts.push_back(ConstantInt::get(Type::Int32Ty, TorList[i].second)); |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 183 | Elts.push_back(TorList[i].first); |
| 184 | ArrayElts.push_back(ConstantStruct::get(Elts)); |
| 185 | } |
| 186 | return ConstantArray::get(ArrayType::get(ArrayElts[0]->getType(), |
| 187 | ArrayElts.size()), |
| 188 | ArrayElts); |
| 189 | } |
| 190 | |
| 191 | /// SplitStaticCtorDtor - A module was recently split into two parts, M1/M2, and |
| 192 | /// M1 has all of the global variables. If M2 contains any functions that are |
| 193 | /// static ctors/dtors, we need to add an llvm.global_[cd]tors global to M2, and |
| 194 | /// prune appropriate entries out of M1s list. |
| 195 | static void SplitStaticCtorDtor(const char *GlobalName, Module *M1, Module *M2){ |
| 196 | GlobalVariable *GV = M1->getNamedGlobal(GlobalName); |
Reid Spencer | 5cbf985 | 2007-01-30 20:08:39 +0000 | [diff] [blame] | 197 | if (!GV || GV->isDeclaration() || GV->hasInternalLinkage() || |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 198 | !GV->use_empty()) return; |
| 199 | |
| 200 | std::vector<std::pair<Function*, int> > M1Tors, M2Tors; |
| 201 | ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer()); |
| 202 | if (!InitList) return; |
| 203 | |
| 204 | for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i) { |
| 205 | if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){ |
| 206 | if (CS->getNumOperands() != 2) return; // Not array of 2-element structs. |
| 207 | |
| 208 | if (CS->getOperand(1)->isNullValue()) |
| 209 | break; // Found a null terminator, stop here. |
| 210 | |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 211 | ConstantInt *CI = dyn_cast<ConstantInt>(CS->getOperand(0)); |
| 212 | int Priority = CI ? CI->getSExtValue() : 0; |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 213 | |
| 214 | Constant *FP = CS->getOperand(1); |
| 215 | if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP)) |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 216 | if (CE->isCast()) |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 217 | FP = CE->getOperand(0); |
| 218 | if (Function *F = dyn_cast<Function>(FP)) { |
Reid Spencer | 5cbf985 | 2007-01-30 20:08:39 +0000 | [diff] [blame] | 219 | if (!F->isDeclaration()) |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 220 | M1Tors.push_back(std::make_pair(F, Priority)); |
| 221 | else { |
| 222 | // Map to M2's version of the function. |
Reid Spencer | ef9b9a7 | 2007-02-05 20:47:22 +0000 | [diff] [blame] | 223 | F = M2->getFunction(F->getName()); |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 224 | M2Tors.push_back(std::make_pair(F, Priority)); |
| 225 | } |
| 226 | } |
| 227 | } |
| 228 | } |
| 229 | |
| 230 | GV->eraseFromParent(); |
| 231 | if (!M1Tors.empty()) { |
| 232 | Constant *M1Init = GetTorInit(M1Tors); |
| 233 | new GlobalVariable(M1Init->getType(), false, GlobalValue::AppendingLinkage, |
| 234 | M1Init, GlobalName, M1); |
| 235 | } |
| 236 | |
| 237 | GV = M2->getNamedGlobal(GlobalName); |
| 238 | assert(GV && "Not a clone of M1?"); |
| 239 | assert(GV->use_empty() && "llvm.ctors shouldn't have uses!"); |
| 240 | |
| 241 | GV->eraseFromParent(); |
| 242 | if (!M2Tors.empty()) { |
| 243 | Constant *M2Init = GetTorInit(M2Tors); |
| 244 | new GlobalVariable(M2Init->getType(), false, GlobalValue::AppendingLinkage, |
| 245 | M2Init, GlobalName, M2); |
| 246 | } |
| 247 | } |
| 248 | |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 249 | |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 250 | /// SplitFunctionsOutOfModule - Given a module and a list of functions in the |
| 251 | /// module, split the functions OUT of the specified module, and place them in |
| 252 | /// the new module. |
| 253 | Module *llvm::SplitFunctionsOutOfModule(Module *M, |
| 254 | const std::vector<Function*> &F) { |
| 255 | // Make sure functions & globals are all external so that linkage |
| 256 | // between the two modules will work. |
| 257 | for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) |
| 258 | I->setLinkage(GlobalValue::ExternalLinkage); |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 259 | for (Module::global_iterator I = M->global_begin(), E = M->global_end(); |
| 260 | I != E; ++I) |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 261 | I->setLinkage(GlobalValue::ExternalLinkage); |
| 262 | |
Chris Lattner | fef0242 | 2006-11-09 06:24:56 +0000 | [diff] [blame] | 263 | Module *New = CloneModule(M); |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 264 | |
Chris Lattner | fef0242 | 2006-11-09 06:24:56 +0000 | [diff] [blame] | 265 | // Make sure global initializers exist only in the safe module (CBE->.so) |
| 266 | for (Module::global_iterator I = New->global_begin(), E = New->global_end(); |
| 267 | I != E; ++I) |
| 268 | I->setInitializer(0); // Delete the initializer to make it external |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 269 | |
Chris Lattner | fef0242 | 2006-11-09 06:24:56 +0000 | [diff] [blame] | 270 | // Remove the Test functions from the Safe module |
Chris Lattner | fb4b96e | 2004-04-02 16:28:32 +0000 | [diff] [blame] | 271 | std::set<std::pair<std::string, const PointerType*> > TestFunctions; |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 272 | for (unsigned i = 0, e = F.size(); i != e; ++i) { |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 273 | TestFunctions.insert(std::make_pair(F[i]->getName(), F[i]->getType())); |
Reid Spencer | ef9b9a7 | 2007-02-05 20:47:22 +0000 | [diff] [blame] | 274 | Function *TNOF = M->getFunction(F[i]->getName()); |
Chris Lattner | fef0242 | 2006-11-09 06:24:56 +0000 | [diff] [blame] | 275 | assert(TNOF && "Function doesn't exist in module!"); |
Reid Spencer | ef9b9a7 | 2007-02-05 20:47:22 +0000 | [diff] [blame] | 276 | assert(TNOF->getFunctionType() == F[i]->getFunctionType() && "wrong type?"); |
| 277 | DEBUG(std::cerr << "Removing function " << F[i]->getName() << "\n"); |
Chris Lattner | fef0242 | 2006-11-09 06:24:56 +0000 | [diff] [blame] | 278 | DeleteFunctionBody(TNOF); // Function is now external in this module! |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 279 | } |
| 280 | |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 281 | |
Chris Lattner | fef0242 | 2006-11-09 06:24:56 +0000 | [diff] [blame] | 282 | // Remove the Safe functions from the Test module |
| 283 | for (Module::iterator I = New->begin(), E = New->end(); I != E; ++I) |
| 284 | if (!TestFunctions.count(std::make_pair(I->getName(), I->getType()))) |
| 285 | DeleteFunctionBody(I); |
| 286 | |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 287 | |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 288 | // Make sure that there is a global ctor/dtor array in both halves of the |
| 289 | // module if they both have static ctor/dtor functions. |
| 290 | SplitStaticCtorDtor("llvm.global_ctors", M, New); |
| 291 | SplitStaticCtorDtor("llvm.global_dtors", M, New); |
| 292 | |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 293 | return New; |
| 294 | } |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 295 | |
| 296 | //===----------------------------------------------------------------------===// |
| 297 | // Basic Block Extraction Code |
| 298 | //===----------------------------------------------------------------------===// |
| 299 | |
| 300 | namespace { |
| 301 | std::vector<BasicBlock*> BlocksToNotExtract; |
| 302 | |
| 303 | /// BlockExtractorPass - This pass is used by bugpoint to extract all blocks |
| 304 | /// from the module into their own functions except for those specified by the |
| 305 | /// BlocksToNotExtract list. |
Chris Lattner | b12914b | 2004-09-20 04:48:05 +0000 | [diff] [blame] | 306 | class BlockExtractorPass : public ModulePass { |
| 307 | bool runOnModule(Module &M); |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 308 | }; |
Chris Lattner | 7f8897f | 2006-08-27 22:42:52 +0000 | [diff] [blame] | 309 | RegisterPass<BlockExtractorPass> |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 310 | XX("extract-bbs", "Extract Basic Blocks From Module (for bugpoint use)"); |
| 311 | } |
| 312 | |
Chris Lattner | b12914b | 2004-09-20 04:48:05 +0000 | [diff] [blame] | 313 | bool BlockExtractorPass::runOnModule(Module &M) { |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 314 | std::set<BasicBlock*> TranslatedBlocksToNotExtract; |
| 315 | for (unsigned i = 0, e = BlocksToNotExtract.size(); i != e; ++i) { |
| 316 | BasicBlock *BB = BlocksToNotExtract[i]; |
| 317 | Function *F = BB->getParent(); |
| 318 | |
| 319 | // Map the corresponding function in this module. |
Reid Spencer | ef9b9a7 | 2007-02-05 20:47:22 +0000 | [diff] [blame] | 320 | Function *MF = M.getFunction(F->getName()); |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 321 | |
| 322 | // Figure out which index the basic block is in its function. |
| 323 | Function::iterator BBI = MF->begin(); |
| 324 | std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); |
| 325 | TranslatedBlocksToNotExtract.insert(BBI); |
| 326 | } |
| 327 | |
| 328 | // Now that we know which blocks to not extract, figure out which ones we WANT |
| 329 | // to extract. |
| 330 | std::vector<BasicBlock*> BlocksToExtract; |
| 331 | for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) |
| 332 | for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) |
| 333 | if (!TranslatedBlocksToNotExtract.count(BB)) |
| 334 | BlocksToExtract.push_back(BB); |
| 335 | |
| 336 | for (unsigned i = 0, e = BlocksToExtract.size(); i != e; ++i) |
| 337 | ExtractBasicBlock(BlocksToExtract[i]); |
Misha Brukman | 3da94ae | 2005-04-22 00:00:37 +0000 | [diff] [blame] | 338 | |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 339 | return !BlocksToExtract.empty(); |
| 340 | } |
| 341 | |
| 342 | /// ExtractMappedBlocksFromModule - Extract all but the specified basic blocks |
| 343 | /// into their own functions. The only detail is that M is actually a module |
| 344 | /// cloned from the one the BBs are in, so some mapping needs to be performed. |
| 345 | /// If this operation fails for some reason (ie the implementation is buggy), |
| 346 | /// this function should return null, otherwise it returns a new Module. |
| 347 | Module *BugDriver::ExtractMappedBlocksFromModule(const |
| 348 | std::vector<BasicBlock*> &BBs, |
| 349 | Module *M) { |
| 350 | // Set the global list so that pass will be able to access it. |
| 351 | BlocksToNotExtract = BBs; |
| 352 | |
| 353 | std::vector<const PassInfo*> PI; |
| 354 | PI.push_back(getPI(new BlockExtractorPass())); |
| 355 | Module *Ret = runPassesOn(M, PI); |
| 356 | BlocksToNotExtract.clear(); |
Chris Lattner | 891150f | 2004-08-12 02:36:50 +0000 | [diff] [blame] | 357 | if (Ret == 0) { |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 358 | std::cout << "*** Basic Block extraction failed, please report a bug!\n"; |
Chris Lattner | 891150f | 2004-08-12 02:36:50 +0000 | [diff] [blame] | 359 | M = swapProgramIn(M); |
| 360 | EmitProgressBytecode("basicblockextractfail", true); |
Chris Lattner | b923b2e | 2006-05-12 17:28:36 +0000 | [diff] [blame] | 361 | swapProgramIn(M); |
Chris Lattner | 891150f | 2004-08-12 02:36:50 +0000 | [diff] [blame] | 362 | } |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 363 | return Ret; |
| 364 | } |