CodeExtractor.cpp revision a670c684a637e9922be87d8b459d2e052675f0e4
1e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman//===- CodeExtractor.cpp - Pull code region into a new function -----------===// 2e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// 3e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// The LLVM Compiler Infrastructure 4e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// 5e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// This file was developed by the LLVM research group and is distributed under 6e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// the University of Illinois Open Source License. See LICENSE.TXT for details. 7e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// 8e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman//===----------------------------------------------------------------------===// 9e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// 10e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// This file implements the interface to tear out a code region, such as an 11e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// individual loop or a parallel section, into a new function, replacing it with 12e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// a call to the new function. 13e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman// 14e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman//===----------------------------------------------------------------------===// 15e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 1633e197b7778c92acc732c3255dc8fbb99923e8ccChris Lattner#include "llvm/Transforms/Utils/FunctionUtils.h" 17e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman#include "llvm/Constants.h" 18e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman#include "llvm/DerivedTypes.h" 19e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman#include "llvm/Instructions.h" 20bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner#include "llvm/Intrinsics.h" 21e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman#include "llvm/Module.h" 22e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman#include "llvm/Pass.h" 23b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner#include "llvm/Analysis/Dominators.h" 24e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman#include "llvm/Analysis/LoopInfo.h" 25ffada9327301094411146627cf6bc16cd517585dChris Lattner#include "llvm/Analysis/Verifier.h" 26e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman#include "llvm/Transforms/Utils/BasicBlockUtils.h" 2722108fac63eac53d1a23b781a9963fab99700135Misha Brukman#include "Support/CommandLine.h" 28e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman#include "Support/Debug.h" 29e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman#include "Support/StringExtras.h" 30e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman#include <algorithm> 310e06674287b15696f66a65f20f2ba99137b29213Chris Lattner#include <set> 32e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukmanusing namespace llvm; 33e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 3422108fac63eac53d1a23b781a9963fab99700135Misha Brukman// Provide a command-line option to aggregate function arguments into a struct 3522108fac63eac53d1a23b781a9963fab99700135Misha Brukman// for functions produced by the code extrator. This is useful when converting 3622108fac63eac53d1a23b781a9963fab99700135Misha Brukman// extracted functions to pthread-based code, as only one argument (void*) can 3722108fac63eac53d1a23b781a9963fab99700135Misha Brukman// be passed in to pthread_create(). 3822108fac63eac53d1a23b781a9963fab99700135Misha Brukmanstatic cl::opt<bool> 3922108fac63eac53d1a23b781a9963fab99700135Misha BrukmanAggregateArgsOpt("aggregate-extracted-args", cl::Hidden, 4022108fac63eac53d1a23b781a9963fab99700135Misha Brukman cl::desc("Aggregate arguments to code-extracted functions")); 4122108fac63eac53d1a23b781a9963fab99700135Misha Brukman 42e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukmannamespace { 43b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner class CodeExtractor { 44e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman typedef std::vector<Value*> Values; 450e06674287b15696f66a65f20f2ba99137b29213Chris Lattner std::set<BasicBlock*> BlocksToExtract; 46b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner DominatorSet *DS; 4722108fac63eac53d1a23b781a9963fab99700135Misha Brukman bool AggregateArgs; 48346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner unsigned NumExitBlocks; 49346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner const Type *RetTy; 50e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman public: 5122108fac63eac53d1a23b781a9963fab99700135Misha Brukman CodeExtractor(DominatorSet *ds = 0, bool AggArgs = false) 52346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner : DS(ds), AggregateArgs(AggregateArgsOpt), NumExitBlocks(~0U) {} 53b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner 54e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman Function *ExtractCodeRegion(const std::vector<BasicBlock*> &code); 55e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 5622108fac63eac53d1a23b781a9963fab99700135Misha Brukman bool isEligible(const std::vector<BasicBlock*> &code); 5722108fac63eac53d1a23b781a9963fab99700135Misha Brukman 58e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman private: 59bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner /// definedInRegion - Return true if the specified value is defined in the 60bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner /// extracted region. 61bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner bool definedInRegion(Value *V) const { 62bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner if (Instruction *I = dyn_cast<Instruction>(V)) 63bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner if (BlocksToExtract.count(I->getParent())) 64bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner return true; 65bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner return false; 66bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner } 67bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner 68bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner /// definedInCaller - Return true if the specified value is defined in the 69bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner /// function being code extracted, but not in the region being extracted. 70bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner /// These values must be passed in as live-ins to the function. 71bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner bool definedInCaller(Value *V) const { 72bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner if (isa<Argument>(V)) return true; 73bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner if (Instruction *I = dyn_cast<Instruction>(V)) 74bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner if (!BlocksToExtract.count(I->getParent())) 75bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner return true; 76bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner return false; 77bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner } 78bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner 79bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner void severSplitPHINodes(BasicBlock *&Header); 80d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner void splitReturnBlocks(); 81bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner void findInputsOutputs(Values &inputs, Values &outputs); 82e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 83e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman Function *constructFunction(const Values &inputs, 84e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman const Values &outputs, 855cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner BasicBlock *header, 86e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman BasicBlock *newRootNode, BasicBlock *newHeader, 87e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman Function *oldFunction, Module *M); 88e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 890e06674287b15696f66a65f20f2ba99137b29213Chris Lattner void moveCodeToFunction(Function *newFunction); 90e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 91e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman void emitCallAndSwitchStatement(Function *newFunction, 92e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman BasicBlock *newHeader, 93e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman Values &inputs, 94e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman Values &outputs); 95e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 96e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman }; 97e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman} 98e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 99bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner/// severSplitPHINodes - If a PHI node has multiple inputs from outside of the 100bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner/// region, we need to split the entry block of the region so that the PHI node 101bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner/// is easier to deal with. 102bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattnervoid CodeExtractor::severSplitPHINodes(BasicBlock *&Header) { 103e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner bool HasPredsFromRegion = false; 104e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner unsigned NumPredsOutsideRegion = 0; 105e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 106e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner if (Header != &Header->getParent()->front()) { 107e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner PHINode *PN = dyn_cast<PHINode>(Header->begin()); 108e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner if (!PN) return; // No PHI nodes. 109e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 110e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // If the header node contains any PHI nodes, check to see if there is more 111e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // than one entry from outside the region. If so, we need to sever the 112e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // header block into two. 113e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) 114e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner if (BlocksToExtract.count(PN->getIncomingBlock(i))) 115e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner HasPredsFromRegion = true; 116e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner else 117e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner ++NumPredsOutsideRegion; 118e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 119e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // If there is one (or fewer) predecessor from outside the region, we don't 120e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // need to do anything special. 121e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner if (NumPredsOutsideRegion <= 1) return; 122e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner } 123bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner 124e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // Otherwise, we need to split the header block into two pieces: one 125e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // containing PHI nodes merging values from outside of the region, and a 126e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // second that contains all of the code for the block and merges back any 127e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // incoming values from inside of the region. 128e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner BasicBlock::iterator AfterPHIs = Header->begin(); 129e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner while (isa<PHINode>(AfterPHIs)) ++AfterPHIs; 130e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner BasicBlock *NewBB = Header->splitBasicBlock(AfterPHIs, 131e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner Header->getName()+".ce"); 132e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 133e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // We only want to code extract the second block now, and it becomes the new 134e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // header of the region. 135e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner BasicBlock *OldPred = Header; 136e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner BlocksToExtract.erase(OldPred); 137e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner BlocksToExtract.insert(NewBB); 138e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner Header = NewBB; 139e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 140e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // Okay, update dominator sets. The blocks that dominate the new one are the 141e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // blocks that dominate TIBB plus the new block itself. 142e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner if (DS) { 143e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner DominatorSet::DomSetType DomSet = DS->getDominators(OldPred); 144e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner DomSet.insert(NewBB); // A block always dominates itself. 145e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner DS->addBasicBlock(NewBB, DomSet); 146e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 147e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // Additionally, NewBB dominates all blocks in the function that are 148e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // dominated by OldPred. 149e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner Function *F = Header->getParent(); 150e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I) 151e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner if (DS->properlyDominates(OldPred, I)) 152e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner DS->addDominator(I, NewBB); 153e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner } 154bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner 155e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // Okay, now we need to adjust the PHI nodes and any branches from within the 156e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // region to go to the new header block instead of the old header block. 157e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner if (HasPredsFromRegion) { 158e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner PHINode *PN = cast<PHINode>(OldPred->begin()); 159e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // Loop over all of the predecessors of OldPred that are in the region, 160e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // changing them to branch to NewBB instead. 161e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) 162e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner if (BlocksToExtract.count(PN->getIncomingBlock(i))) { 163e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator(); 164e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner TI->replaceUsesOfWith(OldPred, NewBB); 165e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner } 166e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 167e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // Okay, everthing within the region is now branching to the right block, we 168e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // just have to update the PHI nodes now, inserting PHI nodes into NewBB. 169e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner for (AfterPHIs = OldPred->begin(); 170e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner PHINode *PN = dyn_cast<PHINode>(AfterPHIs); ++AfterPHIs) { 171e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // Create a new PHI node in the new region, which has an incoming value 172e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // from OldPred of PN. 173e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner PHINode *NewPN = new PHINode(PN->getType(), PN->getName()+".ce", 174e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner NewBB->begin()); 175e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner NewPN->addIncoming(PN, OldPred); 176e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 177e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // Loop over all of the incoming value in PN, moving them to NewPN if they 178e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // are from the extracted region. 179e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner for (unsigned i = 0; i != PN->getNumIncomingValues(); ++i) { 180e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner if (BlocksToExtract.count(PN->getIncomingBlock(i))) { 181e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner NewPN->addIncoming(PN->getIncomingValue(i), PN->getIncomingBlock(i)); 182e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner PN->removeIncomingValue(i); 183e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner --i; 184e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner } 185e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner } 186e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner } 187e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner } 188d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner} 189e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 190d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattnervoid CodeExtractor::splitReturnBlocks() { 191d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner for (std::set<BasicBlock*>::iterator I = BlocksToExtract.begin(), 192d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner E = BlocksToExtract.end(); I != E; ++I) 193d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner if (ReturnInst *RI = dyn_cast<ReturnInst>((*I)->getTerminator())) 194d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner (*I)->splitBasicBlock(RI, (*I)->getName()+".ret"); 195bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner} 196bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner 197bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner// findInputsOutputs - Find inputs to, outputs from the code region. 198bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner// 199bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattnervoid CodeExtractor::findInputsOutputs(Values &inputs, Values &outputs) { 200346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner std::set<BasicBlock*> ExitBlocks; 2010e06674287b15696f66a65f20f2ba99137b29213Chris Lattner for (std::set<BasicBlock*>::const_iterator ci = BlocksToExtract.begin(), 2020e06674287b15696f66a65f20f2ba99137b29213Chris Lattner ce = BlocksToExtract.end(); ci != ce; ++ci) { 203e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman BasicBlock *BB = *ci; 204bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner 2050de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) { 2060de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner // If a used value is defined outside the region, it's an input. If an 2070de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner // instruction is used outside the region, it's an output. 208bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner for (User::op_iterator O = I->op_begin(), E = I->op_end(); O != E; ++O) 209bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner if (definedInCaller(*O)) 210bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner inputs.push_back(*O); 2110de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner 212bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner // Consider uses of this instruction (outputs). 2130de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); 2140de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner UI != E; ++UI) 215bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner if (!definedInRegion(*UI)) { 216b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner outputs.push_back(I); 217b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner break; 218b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner } 2190de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner } // for: insts 220346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner 221bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner // Keep track of the exit blocks from the region. 222346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner TerminatorInst *TI = BB->getTerminator(); 223346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 224346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner if (!BlocksToExtract.count(TI->getSuccessor(i))) 225346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner ExitBlocks.insert(TI->getSuccessor(i)); 2260de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner } // for: basic blocks 227346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner 228346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner NumExitBlocks = ExitBlocks.size(); 229587992721c3112c94000722941748cf46cd0bce6Chris Lattner 230587992721c3112c94000722941748cf46cd0bce6Chris Lattner // Eliminate duplicates. 231587992721c3112c94000722941748cf46cd0bce6Chris Lattner std::sort(inputs.begin(), inputs.end()); 232587992721c3112c94000722941748cf46cd0bce6Chris Lattner inputs.erase(std::unique(inputs.begin(), inputs.end()), inputs.end()); 233587992721c3112c94000722941748cf46cd0bce6Chris Lattner std::sort(outputs.begin(), outputs.end()); 234587992721c3112c94000722941748cf46cd0bce6Chris Lattner outputs.erase(std::unique(outputs.begin(), outputs.end()), outputs.end()); 235e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman} 236e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 237e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// constructFunction - make a function based on inputs and outputs, as follows: 238e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// f(in0, ..., inN, out0, ..., outN) 239e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// 240e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha BrukmanFunction *CodeExtractor::constructFunction(const Values &inputs, 241e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman const Values &outputs, 2425cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner BasicBlock *header, 243e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman BasicBlock *newRootNode, 244e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman BasicBlock *newHeader, 2455cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner Function *oldFunction, 2465cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner Module *M) { 247e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman DEBUG(std::cerr << "inputs: " << inputs.size() << "\n"); 248e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman DEBUG(std::cerr << "outputs: " << outputs.size() << "\n"); 249e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 250e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // This function returns unsigned, outputs will go back by reference. 251346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner switch (NumExitBlocks) { 252346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner case 0: 253346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner case 1: RetTy = Type::VoidTy; break; 254346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner case 2: RetTy = Type::BoolTy; break; 255346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner default: RetTy = Type::UShortTy; break; 256346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner } 257346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner 258e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman std::vector<const Type*> paramTy; 259e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 260e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // Add the types of the input values to the function's argument list 261e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman for (Values::const_iterator i = inputs.begin(), 262e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman e = inputs.end(); i != e; ++i) { 263e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman const Value *value = *i; 26430b434476796cd4a85c02914687d22f2e5ec95caChris Lattner DEBUG(std::cerr << "value used in func: " << *value << "\n"); 265e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman paramTy.push_back(value->getType()); 266e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman } 267e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 268b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner // Add the types of the output values to the function's argument list. 269b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner for (Values::const_iterator I = outputs.begin(), E = outputs.end(); 270b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner I != E; ++I) { 27130b434476796cd4a85c02914687d22f2e5ec95caChris Lattner DEBUG(std::cerr << "instr used in func: " << **I << "\n"); 27222108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (AggregateArgs) 27322108fac63eac53d1a23b781a9963fab99700135Misha Brukman paramTy.push_back((*I)->getType()); 27422108fac63eac53d1a23b781a9963fab99700135Misha Brukman else 27522108fac63eac53d1a23b781a9963fab99700135Misha Brukman paramTy.push_back(PointerType::get((*I)->getType())); 276e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman } 277e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 27830b434476796cd4a85c02914687d22f2e5ec95caChris Lattner DEBUG(std::cerr << "Function type: " << *RetTy << " f("); 27922108fac63eac53d1a23b781a9963fab99700135Misha Brukman DEBUG(for (std::vector<const Type*>::iterator i = paramTy.begin(), 28030b434476796cd4a85c02914687d22f2e5ec95caChris Lattner e = paramTy.end(); i != e; ++i) std::cerr << **i << ", "); 281e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman DEBUG(std::cerr << ")\n"); 282e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 28322108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (AggregateArgs && (inputs.size() + outputs.size() > 0)) { 28422108fac63eac53d1a23b781a9963fab99700135Misha Brukman PointerType *StructPtr = PointerType::get(StructType::get(paramTy)); 28522108fac63eac53d1a23b781a9963fab99700135Misha Brukman paramTy.clear(); 28622108fac63eac53d1a23b781a9963fab99700135Misha Brukman paramTy.push_back(StructPtr); 28722108fac63eac53d1a23b781a9963fab99700135Misha Brukman } 288346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner const FunctionType *funcType = FunctionType::get(RetTy, paramTy, false); 289e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 290e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // Create the new function 291e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman Function *newFunction = new Function(funcType, 292e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman GlobalValue::InternalLinkage, 293587992721c3112c94000722941748cf46cd0bce6Chris Lattner oldFunction->getName() + "_" + 294587992721c3112c94000722941748cf46cd0bce6Chris Lattner header->getName(), M); 295e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman newFunction->getBasicBlockList().push_back(newRootNode); 296e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 297b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner // Create an iterator to name all of the arguments we inserted. 298b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner Function::aiterator AI = newFunction->abegin(); 299b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner 300b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner // Rewrite all users of the inputs in the extracted region to use the 30122108fac63eac53d1a23b781a9963fab99700135Misha Brukman // arguments (or appropriate addressing into struct) instead. 30222108fac63eac53d1a23b781a9963fab99700135Misha Brukman for (unsigned i = 0, e = inputs.size(); i != e; ++i) { 30322108fac63eac53d1a23b781a9963fab99700135Misha Brukman Value *RewriteVal; 30422108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (AggregateArgs) { 30522108fac63eac53d1a23b781a9963fab99700135Misha Brukman std::vector<Value*> Indices; 30622108fac63eac53d1a23b781a9963fab99700135Misha Brukman Indices.push_back(Constant::getNullValue(Type::UIntTy)); 30722108fac63eac53d1a23b781a9963fab99700135Misha Brukman Indices.push_back(ConstantUInt::get(Type::UIntTy, i)); 30822108fac63eac53d1a23b781a9963fab99700135Misha Brukman std::string GEPname = "gep_" + inputs[i]->getName(); 30922108fac63eac53d1a23b781a9963fab99700135Misha Brukman TerminatorInst *TI = newFunction->begin()->getTerminator(); 31022108fac63eac53d1a23b781a9963fab99700135Misha Brukman GetElementPtrInst *GEP = new GetElementPtrInst(AI, Indices, GEPname, TI); 31122108fac63eac53d1a23b781a9963fab99700135Misha Brukman RewriteVal = new LoadInst(GEP, "load" + GEPname, TI); 31222108fac63eac53d1a23b781a9963fab99700135Misha Brukman } else 31322108fac63eac53d1a23b781a9963fab99700135Misha Brukman RewriteVal = AI++; 31422108fac63eac53d1a23b781a9963fab99700135Misha Brukman 315e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman std::vector<User*> Users(inputs[i]->use_begin(), inputs[i]->use_end()); 316e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman for (std::vector<User*>::iterator use = Users.begin(), useE = Users.end(); 317ffada9327301094411146627cf6bc16cd517585dChris Lattner use != useE; ++use) 318ffada9327301094411146627cf6bc16cd517585dChris Lattner if (Instruction* inst = dyn_cast<Instruction>(*use)) 3190e06674287b15696f66a65f20f2ba99137b29213Chris Lattner if (BlocksToExtract.count(inst->getParent())) 32022108fac63eac53d1a23b781a9963fab99700135Misha Brukman inst->replaceUsesOfWith(inputs[i], RewriteVal); 321e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman } 322e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 32322108fac63eac53d1a23b781a9963fab99700135Misha Brukman // Set names for input and output arguments. 32422108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (!AggregateArgs) { 32522108fac63eac53d1a23b781a9963fab99700135Misha Brukman AI = newFunction->abegin(); 32622108fac63eac53d1a23b781a9963fab99700135Misha Brukman for (unsigned i = 0, e = inputs.size(); i != e; ++i, ++AI) 32722108fac63eac53d1a23b781a9963fab99700135Misha Brukman AI->setName(inputs[i]->getName()); 32822108fac63eac53d1a23b781a9963fab99700135Misha Brukman for (unsigned i = 0, e = outputs.size(); i != e; ++i, ++AI) 32922108fac63eac53d1a23b781a9963fab99700135Misha Brukman AI->setName(outputs[i]->getName()+".out"); 33022108fac63eac53d1a23b781a9963fab99700135Misha Brukman } 331b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner 332e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // Rewrite branches to basic blocks outside of the loop to new dummy blocks 333e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // within the new function. This must be done before we lose track of which 334e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // blocks were originally in the code region. 335e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman std::vector<User*> Users(header->use_begin(), header->use_end()); 3365cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner for (unsigned i = 0, e = Users.size(); i != e; ++i) 3375cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner // The BasicBlock which contains the branch is not in the region 3385cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner // modify the branch target to a new block 3395cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner if (TerminatorInst *TI = dyn_cast<TerminatorInst>(Users[i])) 3405cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner if (!BlocksToExtract.count(TI->getParent()) && 3415cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner TI->getParent()->getParent() == oldFunction) 3425cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner TI->replaceUsesOfWith(header, newHeader); 343e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 344e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman return newFunction; 345e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman} 346e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 347bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner/// emitCallAndSwitchStatement - This method sets up the caller side by adding 348bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner/// the call instruction, splitting any PHI nodes in the header block as 349bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner/// necessary. 350bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattnervoid CodeExtractor:: 351bf749367cb2aef7072ee36a9eb681b35aab51921Chris LattneremitCallAndSwitchStatement(Function *newFunction, BasicBlock *codeReplacer, 352bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner Values &inputs, Values &outputs) { 353bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner // Emit a call to the new function, passing in: *pointer to struct (if 354bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner // aggregating parameters), or plan inputs and allocated memory for outputs 35522108fac63eac53d1a23b781a9963fab99700135Misha Brukman std::vector<Value*> params, StructValues, ReloadOutputs; 35622108fac63eac53d1a23b781a9963fab99700135Misha Brukman 35722108fac63eac53d1a23b781a9963fab99700135Misha Brukman // Add inputs as params, or to be filled into the struct 35822108fac63eac53d1a23b781a9963fab99700135Misha Brukman for (Values::iterator i = inputs.begin(), e = inputs.end(); i != e; ++i) 35922108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (AggregateArgs) 36022108fac63eac53d1a23b781a9963fab99700135Misha Brukman StructValues.push_back(*i); 36122108fac63eac53d1a23b781a9963fab99700135Misha Brukman else 36222108fac63eac53d1a23b781a9963fab99700135Misha Brukman params.push_back(*i); 36322108fac63eac53d1a23b781a9963fab99700135Misha Brukman 36422108fac63eac53d1a23b781a9963fab99700135Misha Brukman // Create allocas for the outputs 36522108fac63eac53d1a23b781a9963fab99700135Misha Brukman for (Values::iterator i = outputs.begin(), e = outputs.end(); i != e; ++i) { 36622108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (AggregateArgs) { 36722108fac63eac53d1a23b781a9963fab99700135Misha Brukman StructValues.push_back(*i); 36822108fac63eac53d1a23b781a9963fab99700135Misha Brukman } else { 36922108fac63eac53d1a23b781a9963fab99700135Misha Brukman AllocaInst *alloca = 37022108fac63eac53d1a23b781a9963fab99700135Misha Brukman new AllocaInst((*i)->getType(), 0, (*i)->getName()+".loc", 37122108fac63eac53d1a23b781a9963fab99700135Misha Brukman codeReplacer->getParent()->begin()->begin()); 37222108fac63eac53d1a23b781a9963fab99700135Misha Brukman ReloadOutputs.push_back(alloca); 37322108fac63eac53d1a23b781a9963fab99700135Misha Brukman params.push_back(alloca); 37422108fac63eac53d1a23b781a9963fab99700135Misha Brukman } 37522108fac63eac53d1a23b781a9963fab99700135Misha Brukman } 37622108fac63eac53d1a23b781a9963fab99700135Misha Brukman 37722108fac63eac53d1a23b781a9963fab99700135Misha Brukman AllocaInst *Struct = 0; 37822108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (AggregateArgs && (inputs.size() + outputs.size() > 0)) { 37922108fac63eac53d1a23b781a9963fab99700135Misha Brukman std::vector<const Type*> ArgTypes; 38022108fac63eac53d1a23b781a9963fab99700135Misha Brukman for (Values::iterator v = StructValues.begin(), 38122108fac63eac53d1a23b781a9963fab99700135Misha Brukman ve = StructValues.end(); v != ve; ++v) 38222108fac63eac53d1a23b781a9963fab99700135Misha Brukman ArgTypes.push_back((*v)->getType()); 38322108fac63eac53d1a23b781a9963fab99700135Misha Brukman 38422108fac63eac53d1a23b781a9963fab99700135Misha Brukman // Allocate a struct at the beginning of this function 38522108fac63eac53d1a23b781a9963fab99700135Misha Brukman Type *StructArgTy = StructType::get(ArgTypes); 38622108fac63eac53d1a23b781a9963fab99700135Misha Brukman Struct = 38722108fac63eac53d1a23b781a9963fab99700135Misha Brukman new AllocaInst(StructArgTy, 0, "structArg", 38822108fac63eac53d1a23b781a9963fab99700135Misha Brukman codeReplacer->getParent()->begin()->begin()); 38922108fac63eac53d1a23b781a9963fab99700135Misha Brukman params.push_back(Struct); 39022108fac63eac53d1a23b781a9963fab99700135Misha Brukman 39122108fac63eac53d1a23b781a9963fab99700135Misha Brukman for (unsigned i = 0, e = inputs.size(); i != e; ++i) { 39222108fac63eac53d1a23b781a9963fab99700135Misha Brukman std::vector<Value*> Indices; 39322108fac63eac53d1a23b781a9963fab99700135Misha Brukman Indices.push_back(Constant::getNullValue(Type::UIntTy)); 39422108fac63eac53d1a23b781a9963fab99700135Misha Brukman Indices.push_back(ConstantUInt::get(Type::UIntTy, i)); 39522108fac63eac53d1a23b781a9963fab99700135Misha Brukman GetElementPtrInst *GEP = 39622108fac63eac53d1a23b781a9963fab99700135Misha Brukman new GetElementPtrInst(Struct, Indices, 397fe3a093bc61ab11dd2c6c9e1e60f42f0a7ef48f3Alkis Evlogimenos "gep_" + StructValues[i]->getName()); 39822108fac63eac53d1a23b781a9963fab99700135Misha Brukman codeReplacer->getInstList().push_back(GEP); 39922108fac63eac53d1a23b781a9963fab99700135Misha Brukman StoreInst *SI = new StoreInst(StructValues[i], GEP); 40022108fac63eac53d1a23b781a9963fab99700135Misha Brukman codeReplacer->getInstList().push_back(SI); 40122108fac63eac53d1a23b781a9963fab99700135Misha Brukman } 40222108fac63eac53d1a23b781a9963fab99700135Misha Brukman } 40322108fac63eac53d1a23b781a9963fab99700135Misha Brukman 40422108fac63eac53d1a23b781a9963fab99700135Misha Brukman // Emit the call to the function 405346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner CallInst *call = new CallInst(newFunction, params, 406346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner NumExitBlocks > 1 ? "targetBlock": ""); 40722108fac63eac53d1a23b781a9963fab99700135Misha Brukman codeReplacer->getInstList().push_back(call); 40822108fac63eac53d1a23b781a9963fab99700135Misha Brukman 40904229c192bc153210e8ee8a18eb28d7f1ec21bfeChris Lattner Function::aiterator OutputArgBegin = newFunction->abegin(); 41022108fac63eac53d1a23b781a9963fab99700135Misha Brukman unsigned FirstOut = inputs.size(); 41122108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (!AggregateArgs) 41222108fac63eac53d1a23b781a9963fab99700135Misha Brukman std::advance(OutputArgBegin, inputs.size()); 41304229c192bc153210e8ee8a18eb28d7f1ec21bfeChris Lattner 41422108fac63eac53d1a23b781a9963fab99700135Misha Brukman // Reload the outputs passed in by reference 415b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner for (unsigned i = 0, e = outputs.size(); i != e; ++i) { 41622108fac63eac53d1a23b781a9963fab99700135Misha Brukman Value *Output = 0; 41722108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (AggregateArgs) { 41822108fac63eac53d1a23b781a9963fab99700135Misha Brukman std::vector<Value*> Indices; 41922108fac63eac53d1a23b781a9963fab99700135Misha Brukman Indices.push_back(Constant::getNullValue(Type::UIntTy)); 42022108fac63eac53d1a23b781a9963fab99700135Misha Brukman Indices.push_back(ConstantUInt::get(Type::UIntTy, FirstOut + i)); 42122108fac63eac53d1a23b781a9963fab99700135Misha Brukman GetElementPtrInst *GEP 42222108fac63eac53d1a23b781a9963fab99700135Misha Brukman = new GetElementPtrInst(Struct, Indices, 423fe3a093bc61ab11dd2c6c9e1e60f42f0a7ef48f3Alkis Evlogimenos "gep_reload_" + outputs[i]->getName()); 42422108fac63eac53d1a23b781a9963fab99700135Misha Brukman codeReplacer->getInstList().push_back(GEP); 42522108fac63eac53d1a23b781a9963fab99700135Misha Brukman Output = GEP; 42622108fac63eac53d1a23b781a9963fab99700135Misha Brukman } else { 42722108fac63eac53d1a23b781a9963fab99700135Misha Brukman Output = ReloadOutputs[i]; 42822108fac63eac53d1a23b781a9963fab99700135Misha Brukman } 42922108fac63eac53d1a23b781a9963fab99700135Misha Brukman LoadInst *load = new LoadInst(Output, outputs[i]->getName()+".reload"); 430b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner codeReplacer->getInstList().push_back(load); 431b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner std::vector<User*> Users(outputs[i]->use_begin(), outputs[i]->use_end()); 432b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner for (unsigned u = 0, e = Users.size(); u != e; ++u) { 433b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner Instruction *inst = cast<Instruction>(Users[u]); 434b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner if (!BlocksToExtract.count(inst->getParent())) 435b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris Lattner inst->replaceUsesOfWith(outputs[i], load); 436e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman } 437e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman } 43812f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner 439e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // Now we can emit a switch statement using the call as a value. 440346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner SwitchInst *TheSwitch = 441346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner new SwitchInst(ConstantUInt::getNullValue(Type::UShortTy), 442346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner codeReplacer, codeReplacer); 443e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 444e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // Since there may be multiple exits from the original region, make the new 44512f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner // function return an unsigned, switch on that number. This loop iterates 44612f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner // over all of the blocks in the extracted region, updating any terminator 44712f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner // instructions in the to-be-extracted region that branch to blocks that are 44812f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner // not in the region to be extracted. 44912f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner std::map<BasicBlock*, BasicBlock*> ExitBlockMap; 45012f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner 451e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman unsigned switchVal = 0; 4520e06674287b15696f66a65f20f2ba99137b29213Chris Lattner for (std::set<BasicBlock*>::const_iterator i = BlocksToExtract.begin(), 4530e06674287b15696f66a65f20f2ba99137b29213Chris Lattner e = BlocksToExtract.end(); i != e; ++i) { 45412f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner TerminatorInst *TI = (*i)->getTerminator(); 45512f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 45612f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner if (!BlocksToExtract.count(TI->getSuccessor(i))) { 45712f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner BasicBlock *OldTarget = TI->getSuccessor(i); 45812f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner // add a new basic block which returns the appropriate value 45912f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner BasicBlock *&NewTarget = ExitBlockMap[OldTarget]; 46012f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner if (!NewTarget) { 46112f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner // If we don't already have an exit stub for this non-extracted 46212f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner // destination, create one now! 46312f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner NewTarget = new BasicBlock(OldTarget->getName() + ".exitStub", 46412f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner newFunction); 465346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner unsigned SuccNum = switchVal++; 466346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner 467346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner Value *brVal = 0; 468346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner switch (NumExitBlocks) { 469346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner case 0: 470346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner case 1: break; // No value needed. 471346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner case 2: // Conditional branch, return a bool 472346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner brVal = SuccNum ? ConstantBool::False : ConstantBool::True; 473346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner break; 474346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner default: 475346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner brVal = ConstantUInt::get(Type::UShortTy, SuccNum); 476346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner break; 477346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner } 47812f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner 47912f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner ReturnInst *NTRet = new ReturnInst(brVal, NewTarget); 48012f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner 48112f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner // Update the switch instruction. 482346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner TheSwitch->addCase(ConstantUInt::get(Type::UShortTy, SuccNum), 483346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner OldTarget); 48412f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner 48512f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner // Restore values just before we exit 48604229c192bc153210e8ee8a18eb28d7f1ec21bfeChris Lattner Function::aiterator OAI = OutputArgBegin; 48722108fac63eac53d1a23b781a9963fab99700135Misha Brukman for (unsigned out = 0, e = outputs.size(); out != e; ++out) { 48822108fac63eac53d1a23b781a9963fab99700135Misha Brukman // For an invoke, the normal destination is the only one that is 48922108fac63eac53d1a23b781a9963fab99700135Misha Brukman // dominated by the result of the invocation 49022108fac63eac53d1a23b781a9963fab99700135Misha Brukman BasicBlock *DefBlock = cast<Instruction>(outputs[out])->getParent(); 49122108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (InvokeInst *Invoke = dyn_cast<InvokeInst>(outputs[out])) 49222108fac63eac53d1a23b781a9963fab99700135Misha Brukman DefBlock = Invoke->getNormalDest(); 49322108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (!DS || DS->dominates(DefBlock, TI->getParent())) 49422108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (AggregateArgs) { 49522108fac63eac53d1a23b781a9963fab99700135Misha Brukman std::vector<Value*> Indices; 49622108fac63eac53d1a23b781a9963fab99700135Misha Brukman Indices.push_back(Constant::getNullValue(Type::UIntTy)); 49722108fac63eac53d1a23b781a9963fab99700135Misha Brukman Indices.push_back(ConstantUInt::get(Type::UIntTy,FirstOut+out)); 49822108fac63eac53d1a23b781a9963fab99700135Misha Brukman GetElementPtrInst *GEP = 49922108fac63eac53d1a23b781a9963fab99700135Misha Brukman new GetElementPtrInst(OAI, Indices, 50022108fac63eac53d1a23b781a9963fab99700135Misha Brukman "gep_" + outputs[out]->getName(), 50122108fac63eac53d1a23b781a9963fab99700135Misha Brukman NTRet); 50222108fac63eac53d1a23b781a9963fab99700135Misha Brukman new StoreInst(outputs[out], GEP, NTRet); 50322108fac63eac53d1a23b781a9963fab99700135Misha Brukman } else 50422108fac63eac53d1a23b781a9963fab99700135Misha Brukman new StoreInst(outputs[out], OAI, NTRet); 50522108fac63eac53d1a23b781a9963fab99700135Misha Brukman // Advance output iterator even if we don't emit a store 50622108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (!AggregateArgs) ++OAI; 50722108fac63eac53d1a23b781a9963fab99700135Misha Brukman } 508e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman } 5090e06674287b15696f66a65f20f2ba99137b29213Chris Lattner 51012f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner // rewrite the original branch instruction with this new target 51112f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner TI->setSuccessor(i, NewTarget); 51212f390e9c03d5439fd84c26d7cbd451cda80601aChris Lattner } 513e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman } 51465826bf435620824763af926270cf0efdc82ea5aChris Lattner 5155b01e298ed42d5ce6aaf7634618b5e1769766b21Chris Lattner // Now that we've done the deed, simplify the switch instruction. 516b519efbafedb356a30a04a32c15a6b406779a997Chris Lattner const Type *OldFnRetTy = TheSwitch->getParent()->getParent()->getReturnType(); 517346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner switch (NumExitBlocks) { 518346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner case 0: 519b519efbafedb356a30a04a32c15a6b406779a997Chris Lattner // There are no successors (the block containing the switch itself), which 52022108fac63eac53d1a23b781a9963fab99700135Misha Brukman // means that previously this was the last part of the function, and hence 52122108fac63eac53d1a23b781a9963fab99700135Misha Brukman // this should be rewritten as a `ret' 52222108fac63eac53d1a23b781a9963fab99700135Misha Brukman 52322108fac63eac53d1a23b781a9963fab99700135Misha Brukman // Check if the function should return a value 524b519efbafedb356a30a04a32c15a6b406779a997Chris Lattner if (OldFnRetTy == Type::VoidTy) { 525b519efbafedb356a30a04a32c15a6b406779a997Chris Lattner new ReturnInst(0, TheSwitch); // Return void 526b519efbafedb356a30a04a32c15a6b406779a997Chris Lattner } else if (OldFnRetTy == TheSwitch->getCondition()->getType()) { 52722108fac63eac53d1a23b781a9963fab99700135Misha Brukman // return what we have 52822108fac63eac53d1a23b781a9963fab99700135Misha Brukman new ReturnInst(TheSwitch->getCondition(), TheSwitch); 529b519efbafedb356a30a04a32c15a6b406779a997Chris Lattner } else { 530b519efbafedb356a30a04a32c15a6b406779a997Chris Lattner // Otherwise we must have code extracted an unwind or something, just 531b519efbafedb356a30a04a32c15a6b406779a997Chris Lattner // return whatever we want. 532b519efbafedb356a30a04a32c15a6b406779a997Chris Lattner new ReturnInst(Constant::getNullValue(OldFnRetTy), TheSwitch); 533b519efbafedb356a30a04a32c15a6b406779a997Chris Lattner } 53422108fac63eac53d1a23b781a9963fab99700135Misha Brukman 53522108fac63eac53d1a23b781a9963fab99700135Misha Brukman TheSwitch->getParent()->getInstList().erase(TheSwitch); 536346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner break; 537346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner case 1: 538346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner // Only a single destination, change the switch into an unconditional 539346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner // branch. 540346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner new BranchInst(TheSwitch->getSuccessor(1), TheSwitch); 541346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner TheSwitch->getParent()->getInstList().erase(TheSwitch); 542346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner break; 543346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner case 2: 544346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner new BranchInst(TheSwitch->getSuccessor(1), TheSwitch->getSuccessor(2), 545346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner call, TheSwitch); 546346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner TheSwitch->getParent()->getInstList().erase(TheSwitch); 547346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner break; 548346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner default: 549346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner // Otherwise, make the default destination of the switch instruction be one 550346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner // of the other successors. 551346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner TheSwitch->setOperand(0, call); 552346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner TheSwitch->setSuccessor(0, TheSwitch->getSuccessor(NumExitBlocks)); 553346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner TheSwitch->removeCase(NumExitBlocks); // Remove redundant case 554346be7f5bc1bab5768b9fa0a01a015d2fdca19c5Chris Lattner break; 55565826bf435620824763af926270cf0efdc82ea5aChris Lattner } 556e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman} 557e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 558bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattnervoid CodeExtractor::moveCodeToFunction(Function *newFunction) { 559bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner Function *oldFunc = (*BlocksToExtract.begin())->getParent(); 560bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner Function::BasicBlockListType &oldBlocks = oldFunc->getBasicBlockList(); 561bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner Function::BasicBlockListType &newBlocks = newFunction->getBasicBlockList(); 562bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner 563bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner for (std::set<BasicBlock*>::const_iterator i = BlocksToExtract.begin(), 564bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner e = BlocksToExtract.end(); i != e; ++i) { 565bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner // Delete the basic block from the old function, and the list of blocks 566bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner oldBlocks.remove(*i); 567bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner 568bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner // Insert this basic block into the new function 569bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner newBlocks.push_back(*i); 570bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner } 571bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner} 572e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 573e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// ExtractRegion - Removes a loop from a function, replaces it with a call to 574e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// new function. Returns pointer to the new function. 575e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// 576e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// algorithm: 577e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// 578e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// find inputs and outputs for the region 579e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// 580e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// for inputs: add to function as args, map input instr* to arg# 581e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// for outputs: add allocas for scalars, 582e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// add to func as args, map output instr* to arg# 583e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// 584e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// rewrite func to use argument #s instead of instr* 585e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// 586e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// for each scalar output in the function: at every exit, store intermediate 587e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// computed result back into memory. 588e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman/// 589b519efbafedb356a30a04a32c15a6b406779a997Chris LattnerFunction *CodeExtractor:: 590b519efbafedb356a30a04a32c15a6b406779a997Chris LattnerExtractCodeRegion(const std::vector<BasicBlock*> &code) { 59122108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (!isEligible(code)) 59222108fac63eac53d1a23b781a9963fab99700135Misha Brukman return 0; 59322108fac63eac53d1a23b781a9963fab99700135Misha Brukman 594e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // 1) Find inputs, outputs 595e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // 2) Construct new function 596e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // * Add allocas for defs, pass as args by reference 597e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // * Pass in uses as args 598e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // 3) Move code region, add call instr to func 5990e06674287b15696f66a65f20f2ba99137b29213Chris Lattner // 6000e06674287b15696f66a65f20f2ba99137b29213Chris Lattner BlocksToExtract.insert(code.begin(), code.end()); 601e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 602e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman Values inputs, outputs; 603e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 604e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // Assumption: this is a single-entry code region, and the header is the first 6050de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner // block in the region. 606e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman BasicBlock *header = code[0]; 607bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner 6080de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner for (unsigned i = 1, e = code.size(); i != e; ++i) 6090de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner for (pred_iterator PI = pred_begin(code[i]), E = pred_end(code[i]); 6100de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner PI != E; ++PI) 6110de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner assert(BlocksToExtract.count(*PI) && 6120de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner "No blocks in this region may have entries from outside the region" 6130de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner " except for the first block!"); 6140de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner 615d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner // If we have to split PHI nodes or the entry block, do so now. 616e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner severSplitPHINodes(header); 617e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 618d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner // If we have any return instructions in the region, split those blocks so 619d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner // that the return is not in the region. 620d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner splitReturnBlocks(); 621d99e1d3afbe664694ee04a5db5e4a7a8104858a1Chris Lattner 622e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman Function *oldFunction = header->getParent(); 623e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 624e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // This takes place of the original loop 625337772832bb93ed98ee1e93c584ac3f82d9ea959Chris Lattner BasicBlock *codeReplacer = new BasicBlock("codeRepl", oldFunction, header); 626e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 627e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman // The new function needs a root node because other nodes can branch to the 628bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner // head of the region, but the entry node of a function cannot have preds. 629e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman BasicBlock *newFuncRoot = new BasicBlock("newFuncRoot"); 630e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman newFuncRoot->getInstList().push_back(new BranchInst(header)); 631e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 632bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner // Find inputs to, outputs from the code region. 633bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner findInputsOutputs(inputs, outputs); 634bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner 635bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner // Construct new function based on inputs/outputs & add allocas for all defs. 636e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner Function *newFunction = constructFunction(inputs, outputs, header, 6375cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner newFuncRoot, 6380de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner codeReplacer, oldFunction, 6390de632bfaedf07b5ae6fd616864716bd5427cb17Chris Lattner oldFunction->getParent()); 640e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 6410e06674287b15696f66a65f20f2ba99137b29213Chris Lattner emitCallAndSwitchStatement(newFunction, codeReplacer, inputs, outputs); 642e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 6430e06674287b15696f66a65f20f2ba99137b29213Chris Lattner moveCodeToFunction(newFunction); 644e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 645e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // Loop over all of the PHI nodes in the header block, and change any 6465cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner // references to the old incoming edge to be the new incoming edge. 647e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner for (BasicBlock::iterator I = header->begin(); 6485cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner PHINode *PN = dyn_cast<PHINode>(I); ++I) 6495cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) 6505cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner if (!BlocksToExtract.count(PN->getIncomingBlock(i))) 6515cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner PN->setIncomingBlock(i, newFuncRoot); 6525cc8ca642095e5d6af377ce0709fa29512c40ad5Chris Lattner 653d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner // Look at all successors of the codeReplacer block. If any of these blocks 654d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner // had PHI nodes in them, we need to update the "from" block to be the code 655d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner // replacer, not the original block in the extracted region. 656d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner std::vector<BasicBlock*> Succs(succ_begin(codeReplacer), 657d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner succ_end(codeReplacer)); 658d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner for (unsigned i = 0, e = Succs.size(); i != e; ++i) 659d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner for (BasicBlock::iterator I = Succs[i]->begin(); 660a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner PHINode *PN = dyn_cast<PHINode>(I); ++I) { 661a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner std::set<BasicBlock*> ProcessedPreds; 662d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) 663d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner if (BlocksToExtract.count(PN->getIncomingBlock(i))) 664a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner if (ProcessedPreds.insert(PN->getIncomingBlock(i)).second) 665a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner PN->setIncomingBlock(i, codeReplacer); 666a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner else { 667a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner // There were multiple entries in the PHI for this block, now there 668a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner // is only one, so remove the duplicated entries. 669a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner PN->removeIncomingValue(i, false); 670a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner --i; --e; 671a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner } 672a670c684a637e9922be87d8b459d2e052675f0e4Chris Lattner } 673d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner 674e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner //std::cerr << "NEW FUNCTION: " << *newFunction; 675e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // verifyFunction(*newFunction); 676e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner 677e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // std::cerr << "OLD FUNCTION: " << *oldFunction; 678e746ad512efc447f352f9580a82c808c2d32ab26Chris Lattner // verifyFunction(*oldFunction); 679d07f89969166750f96c0e3055e387ec82bba88c5Chris Lattner 680ffada9327301094411146627cf6bc16cd517585dChris Lattner DEBUG(if (verifyFunction(*newFunction)) abort()); 681e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman return newFunction; 682e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman} 683e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 68422108fac63eac53d1a23b781a9963fab99700135Misha Brukmanbool CodeExtractor::isEligible(const std::vector<BasicBlock*> &code) { 685bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner // Deny code region if it contains allocas or vastarts. 68622108fac63eac53d1a23b781a9963fab99700135Misha Brukman for (std::vector<BasicBlock*>::const_iterator BB = code.begin(), e=code.end(); 68722108fac63eac53d1a23b781a9963fab99700135Misha Brukman BB != e; ++BB) 68822108fac63eac53d1a23b781a9963fab99700135Misha Brukman for (BasicBlock::const_iterator I = (*BB)->begin(), Ie = (*BB)->end(); 68922108fac63eac53d1a23b781a9963fab99700135Misha Brukman I != Ie; ++I) 69022108fac63eac53d1a23b781a9963fab99700135Misha Brukman if (isa<AllocaInst>(*I)) 69122108fac63eac53d1a23b781a9963fab99700135Misha Brukman return false; 692bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner else if (const CallInst *CI = dyn_cast<CallInst>(I)) 693bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner if (const Function *F = CI->getCalledFunction()) 694bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner if (F->getIntrinsicID() == Intrinsic::vastart) 695bf749367cb2aef7072ee36a9eb681b35aab51921Chris Lattner return false; 69622108fac63eac53d1a23b781a9963fab99700135Misha Brukman return true; 69722108fac63eac53d1a23b781a9963fab99700135Misha Brukman} 69822108fac63eac53d1a23b781a9963fab99700135Misha Brukman 69922108fac63eac53d1a23b781a9963fab99700135Misha Brukman 7000256e4bbf9d8108912d3015634bc1a6f78366d16Misha Brukman/// ExtractCodeRegion - slurp a sequence of basic blocks into a brand new 7010256e4bbf9d8108912d3015634bc1a6f78366d16Misha Brukman/// function 7020256e4bbf9d8108912d3015634bc1a6f78366d16Misha Brukman/// 703b5c1dbf50388c4efe26c9e7ba81e514a109c65d7Chris LattnerFunction* llvm::ExtractCodeRegion(DominatorSet &DS, 70422108fac63eac53d1a23b781a9963fab99700135Misha Brukman const std::vector<BasicBlock*> &code, 70522108fac63eac53d1a23b781a9963fab99700135Misha Brukman bool AggregateArgs) { 70622108fac63eac53d1a23b781a9963fab99700135Misha Brukman return CodeExtractor(&DS, AggregateArgs).ExtractCodeRegion(code); 7070256e4bbf9d8108912d3015634bc1a6f78366d16Misha Brukman} 7080256e4bbf9d8108912d3015634bc1a6f78366d16Misha Brukman 709b97fce52528eb5d9a6e86c3c0e92a73a07341c83Misha Brukman/// ExtractBasicBlock - slurp a natural loop into a brand new function 710b97fce52528eb5d9a6e86c3c0e92a73a07341c83Misha Brukman/// 71122108fac63eac53d1a23b781a9963fab99700135Misha BrukmanFunction* llvm::ExtractLoop(DominatorSet &DS, Loop *L, bool AggregateArgs) { 71222108fac63eac53d1a23b781a9963fab99700135Misha Brukman return CodeExtractor(&DS, AggregateArgs).ExtractCodeRegion(L->getBlocks()); 713e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman} 714e6336031b8b85a438e2fcaa9e56e7392afbbb7dcMisha Brukman 715b97fce52528eb5d9a6e86c3c0e92a73a07341c83Misha Brukman/// ExtractBasicBlock - slurp a basic block into a brand new function 716b97fce52528eb5d9a6e86c3c0e92a73a07341c83Misha Brukman/// 71722108fac63eac53d1a23b781a9963fab99700135Misha BrukmanFunction* llvm::ExtractBasicBlock(BasicBlock *BB, bool AggregateArgs) { 718b97fce52528eb5d9a6e86c3c0e92a73a07341c83Misha Brukman std::vector<BasicBlock*> Blocks; 719b97fce52528eb5d9a6e86c3c0e92a73a07341c83Misha Brukman Blocks.push_back(BB); 72022108fac63eac53d1a23b781a9963fab99700135Misha Brukman return CodeExtractor(0, AggregateArgs).ExtractCodeRegion(Blocks); 721b97fce52528eb5d9a6e86c3c0e92a73a07341c83Misha Brukman} 722