Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 1 | //===- ExtractFunction.cpp - Extract a function from Program --------------===// |
John Criswell | 7c0e022 | 2003-10-20 17:47:21 +0000 | [diff] [blame] | 2 | // |
| 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. |
| 7 | // |
| 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" |
Misha Brukman | e49603d | 2003-08-07 21:19:30 +0000 | [diff] [blame] | 16 | #include "llvm/Constant.h" |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 17 | #include "llvm/Module.h" |
| 18 | #include "llvm/PassManager.h" |
Brian Gaeke | d1a85a7 | 2003-09-10 21:11:42 +0000 | [diff] [blame] | 19 | #include "llvm/Pass.h" |
Misha Brukman | e49603d | 2003-08-07 21:19:30 +0000 | [diff] [blame] | 20 | #include "llvm/Type.h" |
| 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 | c6b519d | 2003-11-23 04:51:05 +0000 | [diff] [blame] | 31 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 32 | |
| 33 | namespace llvm { |
Chris Lattner | c6b519d | 2003-11-23 04:51:05 +0000 | [diff] [blame] | 34 | bool DisableSimplifyCFG = false; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 35 | } // End llvm namespace |
| 36 | |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 37 | namespace { |
| 38 | cl::opt<bool> |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 39 | NoDCE ("disable-dce", |
| 40 | cl::desc("Do not use the -dce pass to reduce testcases")); |
Chris Lattner | 47ae4a1 | 2003-08-05 15:51:05 +0000 | [diff] [blame] | 41 | cl::opt<bool, true> |
| 42 | NoSCFG("disable-simplifycfg", cl::location(DisableSimplifyCFG), |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 43 | cl::desc("Do not use the -simplifycfg pass to reduce testcases")); |
| 44 | } |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 45 | |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 46 | /// deleteInstructionFromProgram - This method clones the current Program and |
| 47 | /// deletes the specified instruction from the cloned module. It then runs a |
| 48 | /// series of cleanup passes (ADCE and SimplifyCFG) to eliminate any code which |
| 49 | /// depends on the value. The modified module is then returned. |
| 50 | /// |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 51 | Module *BugDriver::deleteInstructionFromProgram(const Instruction *I, |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 52 | unsigned Simplification) const { |
| 53 | Module *Result = CloneModule(Program); |
| 54 | |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 55 | const BasicBlock *PBB = I->getParent(); |
| 56 | const Function *PF = PBB->getParent(); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 57 | |
| 58 | Module::iterator RFI = Result->begin(); // Get iterator to corresponding fn |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 59 | std::advance(RFI, std::distance(PF->getParent()->begin(), |
| 60 | Module::const_iterator(PF))); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 61 | |
| 62 | Function::iterator RBI = RFI->begin(); // Get iterator to corresponding BB |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 63 | std::advance(RBI, std::distance(PF->begin(), Function::const_iterator(PBB))); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 64 | |
| 65 | BasicBlock::iterator RI = RBI->begin(); // Get iterator to corresponding inst |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 66 | std::advance(RI, std::distance(PBB->begin(), BasicBlock::const_iterator(I))); |
| 67 | Instruction *TheInst = RI; // Got the corresponding instruction! |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 68 | |
| 69 | // If this instruction produces a value, replace any users with null values |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 70 | if (TheInst->getType() != Type::VoidTy) |
| 71 | TheInst->replaceAllUsesWith(Constant::getNullValue(TheInst->getType())); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 72 | |
| 73 | // Remove the instruction from the program. |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 74 | TheInst->getParent()->getInstList().erase(TheInst); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 75 | |
Chris Lattner | 44be257 | 2003-04-24 22:53:24 +0000 | [diff] [blame] | 76 | // Spiff up the output a little bit. |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 77 | PassManager Passes; |
Chris Lattner | 5da69c7 | 2003-10-23 15:42:55 +0000 | [diff] [blame] | 78 | // Make sure that the appropriate target data is always used... |
| 79 | Passes.add(new TargetData("bugpoint", Result)); |
| 80 | |
Chris Lattner | efdc0b5 | 2004-03-14 20:50:42 +0000 | [diff] [blame] | 81 | /// FIXME: If this used runPasses() like the methods below, we could get rid |
| 82 | /// of the -disable-* options! |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 83 | if (Simplification > 1 && !NoDCE) |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 84 | Passes.add(createDeadCodeEliminationPass()); |
Chris Lattner | 47ae4a1 | 2003-08-05 15:51:05 +0000 | [diff] [blame] | 85 | if (Simplification && !DisableSimplifyCFG) |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 86 | Passes.add(createCFGSimplificationPass()); // Delete dead control flow |
Chris Lattner | 10f22cb | 2003-03-07 18:17:13 +0000 | [diff] [blame] | 87 | |
| 88 | Passes.add(createVerifierPass()); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 89 | Passes.run(*Result); |
| 90 | return Result; |
| 91 | } |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 92 | |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 93 | static const PassInfo *getPI(Pass *P) { |
| 94 | const PassInfo *PI = P->getPassInfo(); |
| 95 | delete P; |
| 96 | return PI; |
| 97 | } |
| 98 | |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 99 | /// performFinalCleanups - This method clones the current Program and performs |
| 100 | /// a series of cleanups intended to get rid of extra cruft on the module |
| 101 | /// before handing it to the user... |
| 102 | /// |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 103 | Module *BugDriver::performFinalCleanups(Module *M, bool MayModifySemantics) { |
Chris Lattner | 28b8ed9 | 2003-05-21 19:41:31 +0000 | [diff] [blame] | 104 | // Make all functions external, so GlobalDCE doesn't delete them... |
| 105 | for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) |
| 106 | I->setLinkage(GlobalValue::ExternalLinkage); |
Chris Lattner | dbe48dc | 2003-05-21 20:38:59 +0000 | [diff] [blame] | 107 | |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 108 | std::vector<const PassInfo*> CleanupPasses; |
| 109 | CleanupPasses.push_back(getPI(createFunctionResolvingPass())); |
| 110 | CleanupPasses.push_back(getPI(createGlobalDCEPass())); |
| 111 | CleanupPasses.push_back(getPI(createDeadTypeEliminationPass())); |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 112 | |
Chris Lattner | c6b519d | 2003-11-23 04:51:05 +0000 | [diff] [blame] | 113 | if (MayModifySemantics) |
| 114 | CleanupPasses.push_back(getPI(createDeadArgHackingPass())); |
| 115 | else |
| 116 | CleanupPasses.push_back(getPI(createDeadArgEliminationPass())); |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 117 | |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 118 | Module *New = runPassesOn(M, CleanupPasses); |
| 119 | if (New == 0) { |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 120 | std::cerr << "Final cleanups failed. Sorry. :( Please report a bug!\n"; |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 121 | } |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 122 | delete M; |
| 123 | return New; |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 124 | } |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 125 | |
| 126 | |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 127 | /// ExtractLoop - Given a module, extract up to one loop from it into a new |
| 128 | /// function. This returns null if there are no extractable loops in the |
| 129 | /// program or if the loop extractor crashes. |
| 130 | Module *BugDriver::ExtractLoop(Module *M) { |
| 131 | std::vector<const PassInfo*> LoopExtractPasses; |
| 132 | LoopExtractPasses.push_back(getPI(createSingleLoopExtractorPass())); |
| 133 | |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 134 | Module *NewM = runPassesOn(M, LoopExtractPasses); |
| 135 | if (NewM == 0) { |
Chris Lattner | a1cf1c8 | 2004-03-14 22:08:00 +0000 | [diff] [blame] | 136 | Module *Old = swapProgramIn(M); |
| 137 | std::cout << "*** Loop extraction failed: "; |
| 138 | EmitProgressBytecode("loopextraction", true); |
| 139 | std::cout << "*** Sorry. :( Please report a bug!\n"; |
| 140 | swapProgramIn(Old); |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 141 | return 0; |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 142 | } |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 143 | |
| 144 | // 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^] | 145 | // extracted and we should return null. Limit the number of loops we extract |
| 146 | // to avoid taking forever. |
| 147 | static unsigned NumExtracted = 32; |
Chris Lattner | 90c18c5 | 2004-11-16 06:31:38 +0000 | [diff] [blame] | 148 | if (M->size() == NewM->size() || --NumExtracted == 0) { |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 149 | delete NewM; |
| 150 | return 0; |
Chris Lattner | 90c18c5 | 2004-11-16 06:31:38 +0000 | [diff] [blame] | 151 | } else { |
| 152 | assert(M->size() < NewM->size() && "Loop extract removed functions?"); |
| 153 | Module::iterator MI = NewM->begin(); |
| 154 | for (unsigned i = 0, e = M->size(); i != e; ++i) |
| 155 | ++MI; |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 156 | } |
| 157 | |
| 158 | return NewM; |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 159 | } |
| 160 | |
| 161 | |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 162 | // DeleteFunctionBody - "Remove" the function by deleting all of its basic |
| 163 | // blocks, making it external. |
| 164 | // |
| 165 | void llvm::DeleteFunctionBody(Function *F) { |
| 166 | // delete the body of the function... |
| 167 | F->deleteBody(); |
| 168 | assert(F->isExternal() && "This didn't make the function external!"); |
| 169 | } |
| 170 | |
| 171 | /// SplitFunctionsOutOfModule - Given a module and a list of functions in the |
| 172 | /// module, split the functions OUT of the specified module, and place them in |
| 173 | /// the new module. |
Chris Lattner | 5eda1f2 | 2004-03-14 19:31:00 +0000 | [diff] [blame] | 174 | /// |
| 175 | /// FIXME: this could be made DRAMATICALLY more efficient for large programs if |
| 176 | /// we just MOVED functions from one module to the other, instead of cloning the |
| 177 | /// whole module, then proceeding to delete an entire module's worth of stuff. |
| 178 | /// |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 179 | Module *llvm::SplitFunctionsOutOfModule(Module *M, |
| 180 | const std::vector<Function*> &F) { |
| 181 | // Make sure functions & globals are all external so that linkage |
| 182 | // between the two modules will work. |
| 183 | for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) |
| 184 | I->setLinkage(GlobalValue::ExternalLinkage); |
| 185 | for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I) |
| 186 | I->setLinkage(GlobalValue::ExternalLinkage); |
| 187 | |
| 188 | Module *New = CloneModule(M); |
| 189 | |
| 190 | // Make sure global initializers exist only in the safe module (CBE->.so) |
| 191 | for (Module::giterator I = New->gbegin(), E = New->gend(); I != E; ++I) |
| 192 | I->setInitializer(0); // Delete the initializer to make it external |
| 193 | |
| 194 | // Remove the Test functions from the Safe module |
Chris Lattner | fb4b96e | 2004-04-02 16:28:32 +0000 | [diff] [blame] | 195 | std::set<std::pair<std::string, const PointerType*> > TestFunctions; |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 196 | for (unsigned i = 0, e = F.size(); i != e; ++i) { |
Chris Lattner | fb4b96e | 2004-04-02 16:28:32 +0000 | [diff] [blame] | 197 | TestFunctions.insert(std::make_pair(F[i]->getName(), F[i]->getType())); |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 198 | Function *TNOF = M->getFunction(F[i]->getName(), F[i]->getFunctionType()); |
| 199 | DEBUG(std::cerr << "Removing function " << F[i]->getName() << "\n"); |
| 200 | assert(TNOF && "Function doesn't exist in module!"); |
| 201 | DeleteFunctionBody(TNOF); // Function is now external in this module! |
| 202 | } |
| 203 | |
| 204 | // Remove the Safe functions from the Test module |
Chris Lattner | fb4b96e | 2004-04-02 16:28:32 +0000 | [diff] [blame] | 205 | for (Module::iterator I = New->begin(), E = New->end(); I != E; ++I) |
| 206 | if (!TestFunctions.count(std::make_pair(I->getName(), I->getType()))) |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 207 | DeleteFunctionBody(I); |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 208 | return New; |
| 209 | } |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 210 | |
| 211 | //===----------------------------------------------------------------------===// |
| 212 | // Basic Block Extraction Code |
| 213 | //===----------------------------------------------------------------------===// |
| 214 | |
| 215 | namespace { |
| 216 | std::vector<BasicBlock*> BlocksToNotExtract; |
| 217 | |
| 218 | /// BlockExtractorPass - This pass is used by bugpoint to extract all blocks |
| 219 | /// from the module into their own functions except for those specified by the |
| 220 | /// BlocksToNotExtract list. |
Chris Lattner | b12914b | 2004-09-20 04:48:05 +0000 | [diff] [blame] | 221 | class BlockExtractorPass : public ModulePass { |
| 222 | bool runOnModule(Module &M); |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 223 | }; |
| 224 | RegisterOpt<BlockExtractorPass> |
| 225 | XX("extract-bbs", "Extract Basic Blocks From Module (for bugpoint use)"); |
| 226 | } |
| 227 | |
Chris Lattner | b12914b | 2004-09-20 04:48:05 +0000 | [diff] [blame] | 228 | bool BlockExtractorPass::runOnModule(Module &M) { |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 229 | std::set<BasicBlock*> TranslatedBlocksToNotExtract; |
| 230 | for (unsigned i = 0, e = BlocksToNotExtract.size(); i != e; ++i) { |
| 231 | BasicBlock *BB = BlocksToNotExtract[i]; |
| 232 | Function *F = BB->getParent(); |
| 233 | |
| 234 | // Map the corresponding function in this module. |
| 235 | Function *MF = M.getFunction(F->getName(), F->getFunctionType()); |
| 236 | |
| 237 | // Figure out which index the basic block is in its function. |
| 238 | Function::iterator BBI = MF->begin(); |
| 239 | std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); |
| 240 | TranslatedBlocksToNotExtract.insert(BBI); |
| 241 | } |
| 242 | |
| 243 | // Now that we know which blocks to not extract, figure out which ones we WANT |
| 244 | // to extract. |
| 245 | std::vector<BasicBlock*> BlocksToExtract; |
| 246 | for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) |
| 247 | for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) |
| 248 | if (!TranslatedBlocksToNotExtract.count(BB)) |
| 249 | BlocksToExtract.push_back(BB); |
| 250 | |
| 251 | for (unsigned i = 0, e = BlocksToExtract.size(); i != e; ++i) |
| 252 | ExtractBasicBlock(BlocksToExtract[i]); |
| 253 | |
| 254 | return !BlocksToExtract.empty(); |
| 255 | } |
| 256 | |
| 257 | /// ExtractMappedBlocksFromModule - Extract all but the specified basic blocks |
| 258 | /// into their own functions. The only detail is that M is actually a module |
| 259 | /// cloned from the one the BBs are in, so some mapping needs to be performed. |
| 260 | /// If this operation fails for some reason (ie the implementation is buggy), |
| 261 | /// this function should return null, otherwise it returns a new Module. |
| 262 | Module *BugDriver::ExtractMappedBlocksFromModule(const |
| 263 | std::vector<BasicBlock*> &BBs, |
| 264 | Module *M) { |
| 265 | // Set the global list so that pass will be able to access it. |
| 266 | BlocksToNotExtract = BBs; |
| 267 | |
| 268 | std::vector<const PassInfo*> PI; |
| 269 | PI.push_back(getPI(new BlockExtractorPass())); |
| 270 | Module *Ret = runPassesOn(M, PI); |
| 271 | BlocksToNotExtract.clear(); |
Chris Lattner | 891150f | 2004-08-12 02:36:50 +0000 | [diff] [blame] | 272 | if (Ret == 0) { |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 273 | std::cout << "*** Basic Block extraction failed, please report a bug!\n"; |
Chris Lattner | 891150f | 2004-08-12 02:36:50 +0000 | [diff] [blame] | 274 | M = swapProgramIn(M); |
| 275 | EmitProgressBytecode("basicblockextractfail", true); |
| 276 | M = swapProgramIn(M); |
| 277 | } |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 278 | return Ret; |
| 279 | } |