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" |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 21 | #include "llvm/SymbolTable.h" |
Misha Brukman | e49603d | 2003-08-07 21:19:30 +0000 | [diff] [blame] | 22 | #include "llvm/Analysis/Verifier.h" |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 23 | #include "llvm/Transforms/IPO.h" |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 24 | #include "llvm/Transforms/Scalar.h" |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 25 | #include "llvm/Transforms/Utils/Cloning.h" |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 26 | #include "llvm/Transforms/Utils/FunctionUtils.h" |
Chris Lattner | 5da69c7 | 2003-10-23 15:42:55 +0000 | [diff] [blame] | 27 | #include "llvm/Target/TargetData.h" |
Reid Spencer | 551ccae | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 28 | #include "llvm/Support/CommandLine.h" |
| 29 | #include "llvm/Support/Debug.h" |
| 30 | #include "llvm/Support/FileUtilities.h" |
Chris Lattner | fb4b96e | 2004-04-02 16:28:32 +0000 | [diff] [blame] | 31 | #include <set> |
Chris Lattner | e31a9cc | 2006-01-22 22:53:40 +0000 | [diff] [blame] | 32 | #include <iostream> |
Chris Lattner | c6b519d | 2003-11-23 04:51:05 +0000 | [diff] [blame] | 33 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 34 | |
| 35 | namespace llvm { |
Chris Lattner | c6b519d | 2003-11-23 04:51:05 +0000 | [diff] [blame] | 36 | bool DisableSimplifyCFG = false; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 37 | } // End llvm namespace |
| 38 | |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 39 | namespace { |
| 40 | cl::opt<bool> |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 41 | NoDCE ("disable-dce", |
| 42 | cl::desc("Do not use the -dce pass to reduce testcases")); |
Chris Lattner | 47ae4a1 | 2003-08-05 15:51:05 +0000 | [diff] [blame] | 43 | cl::opt<bool, true> |
| 44 | NoSCFG("disable-simplifycfg", cl::location(DisableSimplifyCFG), |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 45 | cl::desc("Do not use the -simplifycfg pass to reduce testcases")); |
| 46 | } |
Chris Lattner | afade92 | 2002-11-20 22:28:10 +0000 | [diff] [blame] | 47 | |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 48 | /// deleteInstructionFromProgram - This method clones the current Program and |
| 49 | /// deletes the specified instruction from the cloned module. It then runs a |
| 50 | /// series of cleanup passes (ADCE and SimplifyCFG) to eliminate any code which |
| 51 | /// depends on the value. The modified module is then returned. |
| 52 | /// |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 53 | Module *BugDriver::deleteInstructionFromProgram(const Instruction *I, |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 54 | unsigned Simplification) const { |
| 55 | Module *Result = CloneModule(Program); |
| 56 | |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 57 | const BasicBlock *PBB = I->getParent(); |
| 58 | const Function *PF = PBB->getParent(); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 59 | |
| 60 | Module::iterator RFI = Result->begin(); // Get iterator to corresponding fn |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 61 | std::advance(RFI, std::distance(PF->getParent()->begin(), |
| 62 | Module::const_iterator(PF))); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 63 | |
| 64 | Function::iterator RBI = RFI->begin(); // Get iterator to corresponding BB |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 65 | std::advance(RBI, std::distance(PF->begin(), Function::const_iterator(PBB))); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 66 | |
| 67 | BasicBlock::iterator RI = RBI->begin(); // Get iterator to corresponding inst |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 68 | std::advance(RI, std::distance(PBB->begin(), BasicBlock::const_iterator(I))); |
| 69 | Instruction *TheInst = RI; // Got the corresponding instruction! |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 70 | |
| 71 | // If this instruction produces a value, replace any users with null values |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 72 | if (TheInst->getType() != Type::VoidTy) |
| 73 | TheInst->replaceAllUsesWith(Constant::getNullValue(TheInst->getType())); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 74 | |
| 75 | // Remove the instruction from the program. |
Chris Lattner | 0cc8807 | 2004-02-18 21:50:26 +0000 | [diff] [blame] | 76 | TheInst->getParent()->getInstList().erase(TheInst); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 77 | |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 78 | |
| 79 | //writeProgramToFile("current.bc", Result); |
| 80 | |
Chris Lattner | 44be257 | 2003-04-24 22:53:24 +0000 | [diff] [blame] | 81 | // Spiff up the output a little bit. |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 82 | PassManager Passes; |
Chris Lattner | 5da69c7 | 2003-10-23 15:42:55 +0000 | [diff] [blame] | 83 | // Make sure that the appropriate target data is always used... |
Chris Lattner | 831b121 | 2006-06-16 18:23:49 +0000 | [diff] [blame] | 84 | Passes.add(new TargetData(Result)); |
Chris Lattner | 5da69c7 | 2003-10-23 15:42:55 +0000 | [diff] [blame] | 85 | |
Chris Lattner | efdc0b5 | 2004-03-14 20:50:42 +0000 | [diff] [blame] | 86 | /// FIXME: If this used runPasses() like the methods below, we could get rid |
| 87 | /// of the -disable-* options! |
Chris Lattner | 6db70ef | 2003-04-25 22:08:12 +0000 | [diff] [blame] | 88 | if (Simplification > 1 && !NoDCE) |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 89 | Passes.add(createDeadCodeEliminationPass()); |
Chris Lattner | 47ae4a1 | 2003-08-05 15:51:05 +0000 | [diff] [blame] | 90 | if (Simplification && !DisableSimplifyCFG) |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 91 | Passes.add(createCFGSimplificationPass()); // Delete dead control flow |
Chris Lattner | 10f22cb | 2003-03-07 18:17:13 +0000 | [diff] [blame] | 92 | |
| 93 | Passes.add(createVerifierPass()); |
Chris Lattner | 6520785 | 2003-01-23 02:48:33 +0000 | [diff] [blame] | 94 | Passes.run(*Result); |
| 95 | return Result; |
| 96 | } |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 97 | |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 98 | static const PassInfo *getPI(Pass *P) { |
| 99 | const PassInfo *PI = P->getPassInfo(); |
| 100 | delete P; |
| 101 | return PI; |
| 102 | } |
| 103 | |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 104 | /// performFinalCleanups - This method clones the current Program and performs |
| 105 | /// 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] | 106 | /// before handing it to the user. |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 107 | /// |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 108 | Module *BugDriver::performFinalCleanups(Module *M, bool MayModifySemantics) { |
Chris Lattner | 28b8ed9 | 2003-05-21 19:41:31 +0000 | [diff] [blame] | 109 | // Make all functions external, so GlobalDCE doesn't delete them... |
| 110 | for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) |
| 111 | I->setLinkage(GlobalValue::ExternalLinkage); |
Misha Brukman | 3da94ae | 2005-04-22 00:00:37 +0000 | [diff] [blame] | 112 | |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 113 | std::vector<const PassInfo*> CleanupPasses; |
| 114 | CleanupPasses.push_back(getPI(createFunctionResolvingPass())); |
| 115 | CleanupPasses.push_back(getPI(createGlobalDCEPass())); |
| 116 | CleanupPasses.push_back(getPI(createDeadTypeEliminationPass())); |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 117 | |
Chris Lattner | c6b519d | 2003-11-23 04:51:05 +0000 | [diff] [blame] | 118 | if (MayModifySemantics) |
| 119 | CleanupPasses.push_back(getPI(createDeadArgHackingPass())); |
| 120 | else |
| 121 | CleanupPasses.push_back(getPI(createDeadArgEliminationPass())); |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 122 | |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 123 | Module *New = runPassesOn(M, CleanupPasses); |
| 124 | if (New == 0) { |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 125 | std::cerr << "Final cleanups failed. Sorry. :( Please report a bug!\n"; |
Chris Lattner | 9b5b190 | 2005-02-23 06:12:11 +0000 | [diff] [blame] | 126 | return M; |
Chris Lattner | fcb6ec0 | 2003-11-05 21:45:35 +0000 | [diff] [blame] | 127 | } |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 128 | delete M; |
| 129 | return New; |
Chris Lattner | ba386d9 | 2003-02-28 16:13:20 +0000 | [diff] [blame] | 130 | } |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 131 | |
| 132 | |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 133 | /// ExtractLoop - Given a module, extract up to one loop from it into a new |
| 134 | /// function. This returns null if there are no extractable loops in the |
| 135 | /// program or if the loop extractor crashes. |
| 136 | Module *BugDriver::ExtractLoop(Module *M) { |
| 137 | std::vector<const PassInfo*> LoopExtractPasses; |
| 138 | LoopExtractPasses.push_back(getPI(createSingleLoopExtractorPass())); |
| 139 | |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 140 | Module *NewM = runPassesOn(M, LoopExtractPasses); |
| 141 | if (NewM == 0) { |
Chris Lattner | a1cf1c8 | 2004-03-14 22:08:00 +0000 | [diff] [blame] | 142 | Module *Old = swapProgramIn(M); |
| 143 | std::cout << "*** Loop extraction failed: "; |
| 144 | EmitProgressBytecode("loopextraction", true); |
| 145 | std::cout << "*** Sorry. :( Please report a bug!\n"; |
| 146 | swapProgramIn(Old); |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 147 | return 0; |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 148 | } |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 149 | |
| 150 | // 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] | 151 | // extracted and we should return null. Limit the number of loops we extract |
| 152 | // to avoid taking forever. |
| 153 | static unsigned NumExtracted = 32; |
Chris Lattner | 90c18c5 | 2004-11-16 06:31:38 +0000 | [diff] [blame] | 154 | if (M->size() == NewM->size() || --NumExtracted == 0) { |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 155 | delete NewM; |
| 156 | return 0; |
Chris Lattner | 90c18c5 | 2004-11-16 06:31:38 +0000 | [diff] [blame] | 157 | } else { |
| 158 | assert(M->size() < NewM->size() && "Loop extract removed functions?"); |
| 159 | Module::iterator MI = NewM->begin(); |
| 160 | for (unsigned i = 0, e = M->size(); i != e; ++i) |
| 161 | ++MI; |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 162 | } |
Misha Brukman | 3da94ae | 2005-04-22 00:00:37 +0000 | [diff] [blame] | 163 | |
Chris Lattner | a75766a | 2004-03-14 21:17:22 +0000 | [diff] [blame] | 164 | return NewM; |
Chris Lattner | 7546c38 | 2004-03-14 20:02:07 +0000 | [diff] [blame] | 165 | } |
| 166 | |
| 167 | |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 168 | // DeleteFunctionBody - "Remove" the function by deleting all of its basic |
| 169 | // blocks, making it external. |
| 170 | // |
| 171 | void llvm::DeleteFunctionBody(Function *F) { |
| 172 | // delete the body of the function... |
| 173 | F->deleteBody(); |
| 174 | assert(F->isExternal() && "This didn't make the function external!"); |
| 175 | } |
| 176 | |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 177 | /// GetTorInit - Given a list of entries for static ctors/dtors, return them |
| 178 | /// as a constant array. |
| 179 | static Constant *GetTorInit(std::vector<std::pair<Function*, int> > &TorList) { |
| 180 | assert(!TorList.empty() && "Don't create empty tor list!"); |
| 181 | std::vector<Constant*> ArrayElts; |
| 182 | for (unsigned i = 0, e = TorList.size(); i != e; ++i) { |
| 183 | std::vector<Constant*> Elts; |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 184 | Elts.push_back(ConstantInt::get(Type::IntTy, TorList[i].second)); |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 185 | Elts.push_back(TorList[i].first); |
| 186 | ArrayElts.push_back(ConstantStruct::get(Elts)); |
| 187 | } |
| 188 | return ConstantArray::get(ArrayType::get(ArrayElts[0]->getType(), |
| 189 | ArrayElts.size()), |
| 190 | ArrayElts); |
| 191 | } |
| 192 | |
| 193 | /// SplitStaticCtorDtor - A module was recently split into two parts, M1/M2, and |
| 194 | /// M1 has all of the global variables. If M2 contains any functions that are |
| 195 | /// static ctors/dtors, we need to add an llvm.global_[cd]tors global to M2, and |
| 196 | /// prune appropriate entries out of M1s list. |
| 197 | static void SplitStaticCtorDtor(const char *GlobalName, Module *M1, Module *M2){ |
| 198 | GlobalVariable *GV = M1->getNamedGlobal(GlobalName); |
| 199 | if (!GV || GV->isExternal() || GV->hasInternalLinkage() || |
| 200 | !GV->use_empty()) return; |
| 201 | |
| 202 | std::vector<std::pair<Function*, int> > M1Tors, M2Tors; |
| 203 | ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer()); |
| 204 | if (!InitList) return; |
| 205 | |
| 206 | for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i) { |
| 207 | if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){ |
| 208 | if (CS->getNumOperands() != 2) return; // Not array of 2-element structs. |
| 209 | |
| 210 | if (CS->getOperand(1)->isNullValue()) |
| 211 | break; // Found a null terminator, stop here. |
| 212 | |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 213 | ConstantInt *CI = dyn_cast<ConstantInt>(CS->getOperand(0)); |
| 214 | int Priority = CI ? CI->getSExtValue() : 0; |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 215 | |
| 216 | Constant *FP = CS->getOperand(1); |
| 217 | if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP)) |
| 218 | if (CE->getOpcode() == Instruction::Cast) |
| 219 | FP = CE->getOperand(0); |
| 220 | if (Function *F = dyn_cast<Function>(FP)) { |
| 221 | if (!F->isExternal()) |
| 222 | M1Tors.push_back(std::make_pair(F, Priority)); |
| 223 | else { |
| 224 | // Map to M2's version of the function. |
| 225 | F = M2->getFunction(F->getName(), F->getFunctionType()); |
| 226 | M2Tors.push_back(std::make_pair(F, Priority)); |
| 227 | } |
| 228 | } |
| 229 | } |
| 230 | } |
| 231 | |
| 232 | GV->eraseFromParent(); |
| 233 | if (!M1Tors.empty()) { |
| 234 | Constant *M1Init = GetTorInit(M1Tors); |
| 235 | new GlobalVariable(M1Init->getType(), false, GlobalValue::AppendingLinkage, |
| 236 | M1Init, GlobalName, M1); |
| 237 | } |
| 238 | |
| 239 | GV = M2->getNamedGlobal(GlobalName); |
| 240 | assert(GV && "Not a clone of M1?"); |
| 241 | assert(GV->use_empty() && "llvm.ctors shouldn't have uses!"); |
| 242 | |
| 243 | GV->eraseFromParent(); |
| 244 | if (!M2Tors.empty()) { |
| 245 | Constant *M2Init = GetTorInit(M2Tors); |
| 246 | new GlobalVariable(M2Init->getType(), false, GlobalValue::AppendingLinkage, |
| 247 | M2Init, GlobalName, M2); |
| 248 | } |
| 249 | } |
| 250 | |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 251 | /// RewriteUsesInNewModule - Given a constant 'OrigVal' and a module 'OrigMod', |
| 252 | /// find all uses of the constant. If they are not in the specified module, |
| 253 | /// replace them with uses of another constant 'NewVal'. |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 254 | static void RewriteUsesInNewModule(Constant *OrigVal, Constant *NewVal, |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 255 | Module *OrigMod) { |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 256 | assert(OrigVal->getType() == NewVal->getType() && |
| 257 | "Can't replace something with a different type"); |
| 258 | for (Value::use_iterator UI = OrigVal->use_begin(), E = OrigVal->use_end(); |
| 259 | UI != E; ) { |
| 260 | Value::use_iterator TmpUI = UI++; |
| 261 | User *U = *TmpUI; |
| 262 | if (Instruction *Inst = dyn_cast<Instruction>(U)) { |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 263 | if (Inst->getParent()->getParent()->getParent() != OrigMod) |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 264 | TmpUI.getUse() = NewVal; |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 265 | } else if (GlobalVariable *GV = dyn_cast<GlobalVariable>(U)) { |
| 266 | if (GV->getParent() != OrigMod) |
| 267 | TmpUI.getUse() = NewVal; |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 268 | } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(U)) { |
| 269 | // If nothing uses this, don't bother making a copy. |
| 270 | if (CE->use_empty()) continue; |
| 271 | Constant *NewCE = CE->getWithOperandReplaced(TmpUI.getOperandNo(), |
| 272 | NewVal); |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 273 | RewriteUsesInNewModule(CE, NewCE, OrigMod); |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 274 | } else if (ConstantStruct *CS = dyn_cast<ConstantStruct>(U)) { |
| 275 | // If nothing uses this, don't bother making a copy. |
| 276 | if (CS->use_empty()) continue; |
| 277 | unsigned OpNo = TmpUI.getOperandNo(); |
| 278 | std::vector<Constant*> Ops; |
| 279 | for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i) |
| 280 | Ops.push_back(i == OpNo ? NewVal : CS->getOperand(i)); |
| 281 | Constant *NewStruct = ConstantStruct::get(Ops); |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 282 | RewriteUsesInNewModule(CS, NewStruct, OrigMod); |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 283 | } else if (ConstantPacked *CP = dyn_cast<ConstantPacked>(U)) { |
| 284 | // If nothing uses this, don't bother making a copy. |
| 285 | if (CP->use_empty()) continue; |
| 286 | unsigned OpNo = TmpUI.getOperandNo(); |
| 287 | std::vector<Constant*> Ops; |
| 288 | for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i) |
| 289 | Ops.push_back(i == OpNo ? NewVal : CP->getOperand(i)); |
| 290 | Constant *NewPacked = ConstantPacked::get(Ops); |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 291 | RewriteUsesInNewModule(CP, NewPacked, OrigMod); |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 292 | } else if (ConstantArray *CA = dyn_cast<ConstantArray>(U)) { |
| 293 | // If nothing uses this, don't bother making a copy. |
| 294 | if (CA->use_empty()) continue; |
| 295 | unsigned OpNo = TmpUI.getOperandNo(); |
| 296 | std::vector<Constant*> Ops; |
| 297 | for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i) { |
| 298 | Ops.push_back(i == OpNo ? NewVal : CA->getOperand(i)); |
| 299 | } |
| 300 | Constant *NewArray = ConstantArray::get(CA->getType(), Ops); |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 301 | RewriteUsesInNewModule(CA, NewArray, OrigMod); |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 302 | } else { |
| 303 | assert(0 && "Unexpected user"); |
| 304 | } |
| 305 | } |
| 306 | } |
| 307 | |
| 308 | |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 309 | /// SplitFunctionsOutOfModule - Given a module and a list of functions in the |
| 310 | /// module, split the functions OUT of the specified module, and place them in |
| 311 | /// the new module. |
| 312 | Module *llvm::SplitFunctionsOutOfModule(Module *M, |
| 313 | const std::vector<Function*> &F) { |
| 314 | // Make sure functions & globals are all external so that linkage |
| 315 | // between the two modules will work. |
| 316 | for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) |
| 317 | I->setLinkage(GlobalValue::ExternalLinkage); |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 318 | for (Module::global_iterator I = M->global_begin(), E = M->global_end(); |
| 319 | I != E; ++I) |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 320 | I->setLinkage(GlobalValue::ExternalLinkage); |
| 321 | |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 322 | // First off, we need to create the new module... |
| 323 | Module *New = new Module(M->getModuleIdentifier()); |
| 324 | New->setEndianness(M->getEndianness()); |
| 325 | New->setPointerSize(M->getPointerSize()); |
| 326 | New->setTargetTriple(M->getTargetTriple()); |
| 327 | New->setModuleInlineAsm(M->getModuleInlineAsm()); |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 328 | |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 329 | // Copy all of the dependent libraries over. |
| 330 | for (Module::lib_iterator I = M->lib_begin(), E = M->lib_end(); I != E; ++I) |
| 331 | New->addLibrary(*I); |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 332 | |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 333 | // build a set of the functions to search later... |
Chris Lattner | fb4b96e | 2004-04-02 16:28:32 +0000 | [diff] [blame] | 334 | std::set<std::pair<std::string, const PointerType*> > TestFunctions; |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 335 | for (unsigned i = 0, e = F.size(); i != e; ++i) { |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 336 | TestFunctions.insert(std::make_pair(F[i]->getName(), F[i]->getType())); |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 337 | } |
| 338 | |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 339 | std::map<GlobalValue*, GlobalValue*> GlobalToPrototypeMap; |
| 340 | std::vector<GlobalValue*> OrigGlobals; |
| 341 | |
| 342 | // Adding specified functions to new module... |
| 343 | for (Module::iterator I = M->begin(), E = M->end(); I != E;) { |
| 344 | OrigGlobals.push_back(I); |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 345 | if (TestFunctions.count(std::make_pair(I->getName(), I->getType()))) { |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 346 | Module::iterator tempI = I; |
| 347 | I++; |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 348 | Function *Func = new Function(tempI->getFunctionType(), |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 349 | GlobalValue::ExternalLinkage); |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 350 | M->getFunctionList().insert(tempI, Func); |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 351 | New->getFunctionList().splice(New->end(), |
| 352 | M->getFunctionList(), |
| 353 | tempI); |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 354 | Func->setName(tempI->getName()); |
| 355 | Func->setCallingConv(tempI->getCallingConv()); |
| 356 | GlobalToPrototypeMap[tempI] = Func; |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 357 | } else { |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 358 | Function *Func = new Function(I->getFunctionType(), |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 359 | GlobalValue::ExternalLinkage, |
| 360 | I->getName(), |
| 361 | New); |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 362 | Func->setCallingConv(I->getCallingConv()); |
| 363 | GlobalToPrototypeMap[I] = Func; |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 364 | I++; |
| 365 | } |
| 366 | } |
| 367 | |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 368 | // Copy over global variable list. |
| 369 | for (Module::global_iterator I = M->global_begin(), E = M->global_end(); |
| 370 | I != E; ++I) { |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 371 | OrigGlobals.push_back(I); |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 372 | GlobalVariable *G = new GlobalVariable(I->getType()->getElementType(), |
| 373 | I->isConstant(), |
| 374 | GlobalValue::ExternalLinkage, |
| 375 | 0, I->getName(), New); |
| 376 | GlobalToPrototypeMap[I] = G; |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 377 | } |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 378 | |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 379 | // Copy all of the type symbol table entries over. |
| 380 | const SymbolTable &SymTab = M->getSymbolTable(); |
| 381 | SymbolTable::type_const_iterator TypeI = SymTab.type_begin(); |
| 382 | SymbolTable::type_const_iterator TypeE = SymTab.type_end(); |
| 383 | for (; TypeI != TypeE; ++TypeI) |
| 384 | New->addTypeName(TypeI->first, TypeI->second); |
| 385 | |
| 386 | // Loop over globals, rewriting uses in the module the prototype is in to use |
| 387 | // the prototype. |
| 388 | for (unsigned i = 0, e = OrigGlobals.size(); i != e; ++i) { |
| 389 | assert(OrigGlobals[i]->getName() == |
Chris Lattner | 1bb6f06 | 2006-08-29 23:38:20 +0000 | [diff] [blame] | 390 | GlobalToPrototypeMap[OrigGlobals[i]]->getName() && |
| 391 | "Something got renamed?"); |
Patrick Jenkins | e47863e | 2006-07-28 01:19:28 +0000 | [diff] [blame] | 392 | RewriteUsesInNewModule(OrigGlobals[i], GlobalToPrototypeMap[OrigGlobals[i]], |
| 393 | OrigGlobals[i]->getParent()); |
| 394 | } |
| 395 | |
Chris Lattner | 5a7a9e5 | 2006-03-08 23:55:38 +0000 | [diff] [blame] | 396 | // Make sure that there is a global ctor/dtor array in both halves of the |
| 397 | // module if they both have static ctor/dtor functions. |
| 398 | SplitStaticCtorDtor("llvm.global_ctors", M, New); |
| 399 | SplitStaticCtorDtor("llvm.global_dtors", M, New); |
| 400 | |
Chris Lattner | be21ca5 | 2004-03-14 19:27:19 +0000 | [diff] [blame] | 401 | return New; |
| 402 | } |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 403 | |
| 404 | //===----------------------------------------------------------------------===// |
| 405 | // Basic Block Extraction Code |
| 406 | //===----------------------------------------------------------------------===// |
| 407 | |
| 408 | namespace { |
| 409 | std::vector<BasicBlock*> BlocksToNotExtract; |
| 410 | |
| 411 | /// BlockExtractorPass - This pass is used by bugpoint to extract all blocks |
| 412 | /// from the module into their own functions except for those specified by the |
| 413 | /// BlocksToNotExtract list. |
Chris Lattner | b12914b | 2004-09-20 04:48:05 +0000 | [diff] [blame] | 414 | class BlockExtractorPass : public ModulePass { |
| 415 | bool runOnModule(Module &M); |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 416 | }; |
Chris Lattner | 7f8897f | 2006-08-27 22:42:52 +0000 | [diff] [blame] | 417 | RegisterPass<BlockExtractorPass> |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 418 | XX("extract-bbs", "Extract Basic Blocks From Module (for bugpoint use)"); |
| 419 | } |
| 420 | |
Chris Lattner | b12914b | 2004-09-20 04:48:05 +0000 | [diff] [blame] | 421 | bool BlockExtractorPass::runOnModule(Module &M) { |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 422 | std::set<BasicBlock*> TranslatedBlocksToNotExtract; |
| 423 | for (unsigned i = 0, e = BlocksToNotExtract.size(); i != e; ++i) { |
| 424 | BasicBlock *BB = BlocksToNotExtract[i]; |
| 425 | Function *F = BB->getParent(); |
| 426 | |
| 427 | // Map the corresponding function in this module. |
| 428 | Function *MF = M.getFunction(F->getName(), F->getFunctionType()); |
| 429 | |
| 430 | // Figure out which index the basic block is in its function. |
| 431 | Function::iterator BBI = MF->begin(); |
| 432 | std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); |
| 433 | TranslatedBlocksToNotExtract.insert(BBI); |
| 434 | } |
| 435 | |
| 436 | // Now that we know which blocks to not extract, figure out which ones we WANT |
| 437 | // to extract. |
| 438 | std::vector<BasicBlock*> BlocksToExtract; |
| 439 | for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) |
| 440 | for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) |
| 441 | if (!TranslatedBlocksToNotExtract.count(BB)) |
| 442 | BlocksToExtract.push_back(BB); |
| 443 | |
| 444 | for (unsigned i = 0, e = BlocksToExtract.size(); i != e; ++i) |
| 445 | ExtractBasicBlock(BlocksToExtract[i]); |
Misha Brukman | 3da94ae | 2005-04-22 00:00:37 +0000 | [diff] [blame] | 446 | |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 447 | return !BlocksToExtract.empty(); |
| 448 | } |
| 449 | |
| 450 | /// ExtractMappedBlocksFromModule - Extract all but the specified basic blocks |
| 451 | /// into their own functions. The only detail is that M is actually a module |
| 452 | /// cloned from the one the BBs are in, so some mapping needs to be performed. |
| 453 | /// If this operation fails for some reason (ie the implementation is buggy), |
| 454 | /// this function should return null, otherwise it returns a new Module. |
| 455 | Module *BugDriver::ExtractMappedBlocksFromModule(const |
| 456 | std::vector<BasicBlock*> &BBs, |
| 457 | Module *M) { |
| 458 | // Set the global list so that pass will be able to access it. |
| 459 | BlocksToNotExtract = BBs; |
| 460 | |
| 461 | std::vector<const PassInfo*> PI; |
| 462 | PI.push_back(getPI(new BlockExtractorPass())); |
| 463 | Module *Ret = runPassesOn(M, PI); |
| 464 | BlocksToNotExtract.clear(); |
Chris Lattner | 891150f | 2004-08-12 02:36:50 +0000 | [diff] [blame] | 465 | if (Ret == 0) { |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 466 | std::cout << "*** Basic Block extraction failed, please report a bug!\n"; |
Chris Lattner | 891150f | 2004-08-12 02:36:50 +0000 | [diff] [blame] | 467 | M = swapProgramIn(M); |
| 468 | EmitProgressBytecode("basicblockextractfail", true); |
Chris Lattner | b923b2e | 2006-05-12 17:28:36 +0000 | [diff] [blame] | 469 | swapProgramIn(M); |
Chris Lattner | 891150f | 2004-08-12 02:36:50 +0000 | [diff] [blame] | 470 | } |
Chris Lattner | 5e783ab | 2004-05-11 21:54:13 +0000 | [diff] [blame] | 471 | return Ret; |
| 472 | } |