LowerSwitch.cpp revision 24473120a253a05f3601cd3373403b47e6d03d41
114383485ac546e369b11797b42bc20831b6db57bChris Lattner//===- LowerSwitch.cpp - Eliminate Switch instructions --------------------===// 2fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 3b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// The LLVM Compiler Infrastructure 4b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// License. See LICENSE.TXT for details. 7fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 8b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell//===----------------------------------------------------------------------===// 914383485ac546e369b11797b42bc20831b6db57bChris Lattner// 10c86b67742a3298c0a5a715b57a64f11107b8a3f2Gordon Henriksen// The LowerSwitch transformation rewrites switch instructions with a sequence 11c86b67742a3298c0a5a715b57a64f11107b8a3f2Gordon Henriksen// of branches, which allows targets to get away with not implementing the 12c86b67742a3298c0a5a715b57a64f11107b8a3f2Gordon Henriksen// switch instruction until it is convenient. 1314383485ac546e369b11797b42bc20831b6db57bChris Lattner// 1414383485ac546e369b11797b42bc20831b6db57bChris Lattner//===----------------------------------------------------------------------===// 1514383485ac546e369b11797b42bc20831b6db57bChris Lattner 1614383485ac546e369b11797b42bc20831b6db57bChris Lattner#include "llvm/Transforms/Scalar.h" 178d89e7bdbcea38fe2ab3c85d91359712cd45714bChris Lattner#include "llvm/Transforms/Utils/UnifyFunctionExitNodes.h" 18ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner#include "llvm/Constants.h" 1914383485ac546e369b11797b42bc20831b6db57bChris Lattner#include "llvm/Function.h" 20d8e1eea678833cc2b15e4ea69a5a403ba9c3b013Misha Brukman#include "llvm/Instructions.h" 210a205a459884ec745df1c529396dd921f029dafdOwen Anderson#include "llvm/LLVMContext.h" 2214383485ac546e369b11797b42bc20831b6db57bChris Lattner#include "llvm/Pass.h" 23b61f2f061feefd79623fadd21eee4f195b0b8e56Dan Gohman#include "llvm/ADT/STLExtras.h" 24a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 25f5a86f45e75ec744c203270ffa03659eb0a220c1Nick Lewycky#include "llvm/Support/Debug.h" 26944fac71e082cc2664cc71b4d3f6c72bab7143fbChris Lattner#include "llvm/Support/raw_ostream.h" 2720aa474f8fbebde588edc101b90e834df28ce4ceAlkis Evlogimenos#include <algorithm> 28d7456026629fc1760a45e6e955e9834246493147Chris Lattnerusing namespace llvm; 29d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 3014383485ac546e369b11797b42bc20831b6db57bChris Lattnernamespace { 3114383485ac546e369b11797b42bc20831b6db57bChris Lattner /// LowerSwitch Pass - Replace all SwitchInst instructions with chained branch 32473fc96889ff8d0862a8fea16c4a5b9252e2d44dChris Lattner /// instructions. 336726b6d75a8b679068a58cb954ba97cf9d1690baNick Lewycky class LowerSwitch : public FunctionPass { 34ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner public: 35ecd94c804a563f2a86572dcf1d2e81f397e19daaNick Lewycky static char ID; // Pass identification, replacement for typeid 36081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson LowerSwitch() : FunctionPass(ID) { 37081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson initializeLowerSwitchPass(*PassRegistry::getPassRegistry()); 38081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson } 39794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 408d89e7bdbcea38fe2ab3c85d91359712cd45714bChris Lattner virtual bool runOnFunction(Function &F); 41ed96fe8c79b36a38bd9280438656ee539276fb41Chris Lattner 428d89e7bdbcea38fe2ab3c85d91359712cd45714bChris Lattner virtual void getAnalysisUsage(AnalysisUsage &AU) const { 43bed2946a96ecb15b0b636fa74cb26ce61b1c648eAnton Korobeynikov // This is a cluster of orthogonal Transforms 448d89e7bdbcea38fe2ab3c85d91359712cd45714bChris Lattner AU.addPreserved<UnifyFunctionExitNodes>(); 4560493c3f4ff9b20f43a3abc605bc64642de75b59Dan Gohman AU.addPreserved("mem2reg"); 46ed96fe8c79b36a38bd9280438656ee539276fb41Chris Lattner AU.addPreservedID(LowerInvokePassID); 478d89e7bdbcea38fe2ab3c85d91359712cd45714bChris Lattner } 48e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 49e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov struct CaseRange { 50e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov Constant* Low; 51e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov Constant* High; 52e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov BasicBlock* BB; 53e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 54473fc96889ff8d0862a8fea16c4a5b9252e2d44dChris Lattner CaseRange(Constant *low = 0, Constant *high = 0, BasicBlock *bb = 0) : 55c4558fde76bdb17bff28375fe20ee02e027095b8Jeff Cohen Low(low), High(high), BB(bb) { } 56e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov }; 57e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 58e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov typedef std::vector<CaseRange> CaseVector; 59e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov typedef std::vector<CaseRange>::iterator CaseItr; 60ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner private: 6114383485ac546e369b11797b42bc20831b6db57bChris Lattner void processSwitchInst(SwitchInst *SI); 62ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 63ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner BasicBlock* switchConvert(CaseItr Begin, CaseItr End, Value* Val, 64ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner BasicBlock* OrigBlock, BasicBlock* Default); 65e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov BasicBlock* newLeafBlock(CaseRange& Leaf, Value* Val, 66ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner BasicBlock* OrigBlock, BasicBlock* Default); 67e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, SwitchInst *SI); 68ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner }; 69ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 70ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner /// The comparison function for sorting the switch case values in the vector. 71e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 72ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner struct CaseCmp { 73e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov bool operator () (const LowerSwitch::CaseRange& C1, 74e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov const LowerSwitch::CaseRange& C2) { 75ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 76e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 77e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 78e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 79ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner } 8014383485ac546e369b11797b42bc20831b6db57bChris Lattner }; 8114383485ac546e369b11797b42bc20831b6db57bChris Lattner} 8214383485ac546e369b11797b42bc20831b6db57bChris Lattner 83844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanchar LowerSwitch::ID = 0; 8402dd53e1c5b941ca5f60fca1b95ebcaf9ccd1dfcOwen AndersonINITIALIZE_PASS(LowerSwitch, "lowerswitch", 85ce665bd2e2b581ab0858d1afe359192bac96b868Owen Anderson "Lower SwitchInst's to branches", false, false) 86844731a7f1909f55935e3514c9e713a62d67662eDan Gohman 877a2bdde0a0eebcd2125055e0eacaca040f0b766cChris Lattner// Publicly exposed interface to pass... 8890c579de5a383cee278acc3f7e7b9d0a656e6a35Owen Andersonchar &llvm::LowerSwitchID = LowerSwitch::ID; 8914383485ac546e369b11797b42bc20831b6db57bChris Lattner// createLowerSwitchPass - Interface to this file... 90d7456026629fc1760a45e6e955e9834246493147Chris LattnerFunctionPass *llvm::createLowerSwitchPass() { 9114383485ac546e369b11797b42bc20831b6db57bChris Lattner return new LowerSwitch(); 9214383485ac546e369b11797b42bc20831b6db57bChris Lattner} 9314383485ac546e369b11797b42bc20831b6db57bChris Lattner 9414383485ac546e369b11797b42bc20831b6db57bChris Lattnerbool LowerSwitch::runOnFunction(Function &F) { 9514383485ac546e369b11797b42bc20831b6db57bChris Lattner bool Changed = false; 9614383485ac546e369b11797b42bc20831b6db57bChris Lattner 9714383485ac546e369b11797b42bc20831b6db57bChris Lattner for (Function::iterator I = F.begin(), E = F.end(); I != E; ) { 9814383485ac546e369b11797b42bc20831b6db57bChris Lattner BasicBlock *Cur = I++; // Advance over block so we don't traverse new blocks 9914383485ac546e369b11797b42bc20831b6db57bChris Lattner 10014383485ac546e369b11797b42bc20831b6db57bChris Lattner if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) { 10114383485ac546e369b11797b42bc20831b6db57bChris Lattner Changed = true; 10214383485ac546e369b11797b42bc20831b6db57bChris Lattner processSwitchInst(SI); 10314383485ac546e369b11797b42bc20831b6db57bChris Lattner } 10414383485ac546e369b11797b42bc20831b6db57bChris Lattner } 10514383485ac546e369b11797b42bc20831b6db57bChris Lattner 10614383485ac546e369b11797b42bc20831b6db57bChris Lattner return Changed; 10714383485ac546e369b11797b42bc20831b6db57bChris Lattner} 10814383485ac546e369b11797b42bc20831b6db57bChris Lattner 109ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// operator<< - Used for debugging purposes. 110ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// 1111cd1d98232c3c3a0bd3810c3bf6c2572ea02f208Daniel Dunbarstatic raw_ostream& operator<<(raw_ostream &O, 112100c267249d1d03c4f96eede9877a4f9f54f2247Chandler Carruth const LowerSwitch::CaseVector &C) 113100c267249d1d03c4f96eede9877a4f9f54f2247Chandler Carruth LLVM_ATTRIBUTE_USED; 11466ad89cebaecd7d88d9e723170c2b55fadd76b71Mike Stumpstatic raw_ostream& operator<<(raw_ostream &O, 1151cd1d98232c3c3a0bd3810c3bf6c2572ea02f208Daniel Dunbar const LowerSwitch::CaseVector &C) { 116ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner O << "["; 117ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 118e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov for (LowerSwitch::CaseVector::const_iterator B = C.begin(), 119d7456026629fc1760a45e6e955e9834246493147Chris Lattner E = C.end(); B != E; ) { 120e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov O << *B->Low << " -" << *B->High; 121ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner if (++B != E) O << ", "; 122ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner } 123ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 124ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner return O << "]"; 125ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner} 126e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 127ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// switchConvert - Convert the switch statement into a binary lookup of 128ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// the case values. The function recursively builds this tree. 129ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// 130ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris LattnerBasicBlock* LowerSwitch::switchConvert(CaseItr Begin, CaseItr End, 131ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner Value* Val, BasicBlock* OrigBlock, 132ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner BasicBlock* Default) 133ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner{ 134ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner unsigned Size = End - Begin; 135ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 136ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner if (Size == 1) 137ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner return newLeafBlock(*Begin, Val, OrigBlock, Default); 138ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 139ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner unsigned Mid = Size / 2; 140e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov std::vector<CaseRange> LHS(Begin, Begin + Mid); 1410f4c988a27d5723d723b7c8e7c4ca9fc6777f20dDavid Greene DEBUG(dbgs() << "LHS: " << LHS << "\n"); 142e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov std::vector<CaseRange> RHS(Begin + Mid, End); 1430f4c988a27d5723d723b7c8e7c4ca9fc6777f20dDavid Greene DEBUG(dbgs() << "RHS: " << RHS << "\n"); 144ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 145e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov CaseRange& Pivot = *(Begin + Mid); 1460f4c988a27d5723d723b7c8e7c4ca9fc6777f20dDavid Greene DEBUG(dbgs() << "Pivot ==> " 147944fac71e082cc2664cc71b4d3f6c72bab7143fbChris Lattner << cast<ConstantInt>(Pivot.Low)->getValue() << " -" 148f871ccb853a2ccbe8675c912330c041b318be8cdDan Gohman << cast<ConstantInt>(Pivot.High)->getValue() << "\n"); 149ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 150ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner BasicBlock* LBranch = switchConvert(LHS.begin(), LHS.end(), Val, 151ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner OrigBlock, Default); 152ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner BasicBlock* RBranch = switchConvert(RHS.begin(), RHS.end(), Val, 153ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner OrigBlock, Default); 154ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 155ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner // Create a new node that checks if the value is < pivot. Go to the 156ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner // left branch if it is and right branch if not. 157ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner Function* F = OrigBlock->getParent(); 1581d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); 159261cdfbe5e6e11d56ca1c49a75f26fece3b139c8Chris Lattner Function::iterator FI = OrigBlock; 160261cdfbe5e6e11d56ca1c49a75f26fece3b139c8Chris Lattner F->getBasicBlockList().insert(++FI, NewNode); 161ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 1621c8a23c440b1665ba422778cdc74a0c59ecaf39eDan Gohman ICmpInst* Comp = new ICmpInst(ICmpInst::ICMP_SLT, 163333c40096561218bc3597cf153c0a3895274414cOwen Anderson Val, Pivot.Low, "Pivot"); 164ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner NewNode->getInstList().push_back(Comp); 165051a950000e21935165db56695e35bade668193bGabor Greif BranchInst::Create(LBranch, RBranch, Comp, NewNode); 166ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner return NewNode; 167ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner} 168ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 169ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// newLeafBlock - Create a new leaf block for the binary lookup tree. It 170ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// checks if the switch's value == the case's value. If not, then it 171ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// jumps to the default branch. At this point in the tree, the value 172ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// can't be another valid case value, so the jump to the "default" branch 173ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// is warranted. 174ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// 175e2ff29c17c1a7c121e22789cf1654d923467b472Anton KorobeynikovBasicBlock* LowerSwitch::newLeafBlock(CaseRange& Leaf, Value* Val, 176ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner BasicBlock* OrigBlock, 177ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner BasicBlock* Default) 178ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner{ 179ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner Function* F = OrigBlock->getParent(); 1801d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson BasicBlock* NewLeaf = BasicBlock::Create(Val->getContext(), "LeafBlock"); 181261cdfbe5e6e11d56ca1c49a75f26fece3b139c8Chris Lattner Function::iterator FI = OrigBlock; 182261cdfbe5e6e11d56ca1c49a75f26fece3b139c8Chris Lattner F->getBasicBlockList().insert(++FI, NewLeaf); 183ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 184e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // Emit comparison 185e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov ICmpInst* Comp = NULL; 186e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov if (Leaf.Low == Leaf.High) { 187e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // Make the seteq instruction... 188333c40096561218bc3597cf153c0a3895274414cOwen Anderson Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_EQ, Val, 189333c40096561218bc3597cf153c0a3895274414cOwen Anderson Leaf.Low, "SwitchLeaf"); 190e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov } else { 191e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // Make range comparison 192e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov if (cast<ConstantInt>(Leaf.Low)->isMinValue(true /*isSigned*/)) { 193e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // Val >= Min && Val <= Hi --> Val <= Hi 194333c40096561218bc3597cf153c0a3895274414cOwen Anderson Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, 195333c40096561218bc3597cf153c0a3895274414cOwen Anderson "SwitchLeaf"); 196e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov } else if (cast<ConstantInt>(Leaf.Low)->isZero()) { 197e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // Val >= 0 && Val <= Hi --> Val <=u Hi 198333c40096561218bc3597cf153c0a3895274414cOwen Anderson Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, 199333c40096561218bc3597cf153c0a3895274414cOwen Anderson "SwitchLeaf"); 200e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov } else { 201e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // Emit V-Lo <=u Hi-Lo 202baf3c404409d5e47b13984a7f95bfbd6d1f2e79eOwen Anderson Constant* NegLo = ConstantExpr::getNeg(Leaf.Low); 2037cbd8a3e92221437048b484d5ef9c0a22d0f8c58Gabor Greif Instruction* Add = BinaryOperator::CreateAdd(Val, NegLo, 204e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov Val->getName()+".off", 205e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov NewLeaf); 206baf3c404409d5e47b13984a7f95bfbd6d1f2e79eOwen Anderson Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High); 207333c40096561218bc3597cf153c0a3895274414cOwen Anderson Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound, 208333c40096561218bc3597cf153c0a3895274414cOwen Anderson "SwitchLeaf"); 209e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov } 210e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov } 211ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 212ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner // Make the conditional branch... 213e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov BasicBlock* Succ = Leaf.BB; 214051a950000e21935165db56695e35bade668193bGabor Greif BranchInst::Create(Succ, Default, Comp, NewLeaf); 215ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 216ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner // If there were any PHI nodes in this successor, rewrite one entry 217ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner // from OrigBlock to come from NewLeaf. 2182da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) { 2192da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer PHINode* PN = cast<PHINode>(I); 220e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // Remove all but one incoming entries from the cluster 221e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov uint64_t Range = cast<ConstantInt>(Leaf.High)->getSExtValue() - 222e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov cast<ConstantInt>(Leaf.Low)->getSExtValue(); 223e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov for (uint64_t j = 0; j < Range; ++j) { 224e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov PN->removeIncomingValue(OrigBlock); 225e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov } 226e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 227ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner int BlockIdx = PN->getBasicBlockIndex(OrigBlock); 228ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner assert(BlockIdx != -1 && "Switch didn't go to this successor??"); 229ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner PN->setIncomingBlock((unsigned)BlockIdx, NewLeaf); 230ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner } 231ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 232ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner return NewLeaf; 233ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner} 234ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 235e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov// Clusterify - Transform simple list of Cases into list of CaseRange's 236e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikovunsigned LowerSwitch::Clusterify(CaseVector& Cases, SwitchInst *SI) { 237e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov unsigned numCmps = 0; 238e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 239e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // Start with "simple" cases 24024473120a253a05f3601cd3373403b47e6d03d41Stepan Dyatkovskiy for (unsigned i = 0; i < SI->getNumCases(); ++i) 24124473120a253a05f3601cd3373403b47e6d03d41Stepan Dyatkovskiy Cases.push_back(CaseRange(SI->getCaseValue(i), 24224473120a253a05f3601cd3373403b47e6d03d41Stepan Dyatkovskiy SI->getCaseValue(i), 24324473120a253a05f3601cd3373403b47e6d03d41Stepan Dyatkovskiy SI->getCaseSuccessor(i))); 244111c4f897eb9a42eac6aceea830b8e76058afd73Dan Gohman std::sort(Cases.begin(), Cases.end(), CaseCmp()); 245e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 246e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // Merge case into clusters 247e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov if (Cases.size()>=2) 2487896c9f436a4eda5ec15e882a7505ba482a2fcd0Chris Lattner for (CaseItr I=Cases.begin(), J=llvm::next(Cases.begin()); J!=Cases.end(); ) { 249e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 250e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 251e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov BasicBlock* nextBB = J->BB; 252e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov BasicBlock* currentBB = I->BB; 253e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 254e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 255e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // into a single case. 256e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 257e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov I->High = J->High; 258e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov J = Cases.erase(J); 259e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov } else { 260e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov I = J++; 261e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov } 262e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov } 263e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 264e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 265e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov if (I->Low != I->High) 266e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // A range counts double, since it requires two compares. 267e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov ++numCmps; 268e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov } 269e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 270e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov return numCmps; 271e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov} 272e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 27314383485ac546e369b11797b42bc20831b6db57bChris Lattner// processSwitchInst - Replace the specified switch instruction with a sequence 274ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner// of chained if-then insts in a balanced binary search. 27514383485ac546e369b11797b42bc20831b6db57bChris Lattner// 27614383485ac546e369b11797b42bc20831b6db57bChris Lattnervoid LowerSwitch::processSwitchInst(SwitchInst *SI) { 27714383485ac546e369b11797b42bc20831b6db57bChris Lattner BasicBlock *CurBlock = SI->getParent(); 27814383485ac546e369b11797b42bc20831b6db57bChris Lattner BasicBlock *OrigBlock = CurBlock; 27914383485ac546e369b11797b42bc20831b6db57bChris Lattner Function *F = CurBlock->getParent(); 280bb5a7442e362776621112dc9453e546a55878e79Eli Friedman Value *Val = SI->getCondition(); // The value we are switching on... 281ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner BasicBlock* Default = SI->getDefaultDest(); 28214383485ac546e369b11797b42bc20831b6db57bChris Lattner 28344bb541c011bcae84759ed194ec7cb4139775fcbChris Lattner // If there is only the default destination, don't bother with the code below. 28424473120a253a05f3601cd3373403b47e6d03d41Stepan Dyatkovskiy if (!SI->getNumCases()) { 285051a950000e21935165db56695e35bade668193bGabor Greif BranchInst::Create(SI->getDefaultDest(), CurBlock); 286bf9eaddfb0642e49bc2f3835765a9782ff48c76eChris Lattner CurBlock->getInstList().erase(SI); 28744bb541c011bcae84759ed194ec7cb4139775fcbChris Lattner return; 28844bb541c011bcae84759ed194ec7cb4139775fcbChris Lattner } 28944bb541c011bcae84759ed194ec7cb4139775fcbChris Lattner 290ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner // Create a new, empty default block so that the new hierarchy of 291ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner // if-then statements go to this and the PHI nodes are happy. 2921d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson BasicBlock* NewDefault = BasicBlock::Create(SI->getContext(), "NewDefault"); 293ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner F->getBasicBlockList().insert(Default, NewDefault); 29414383485ac546e369b11797b42bc20831b6db57bChris Lattner 295051a950000e21935165db56695e35bade668193bGabor Greif BranchInst::Create(Default, NewDefault); 29620af3222da5dea65246ecd9f64a53ea3e3cc1b8aChris Lattner 297ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner // If there is an entry in any PHI nodes for the default edge, make sure 298ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner // to update them as well. 2992da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer for (BasicBlock::iterator I = Default->begin(); isa<PHINode>(I); ++I) { 3002da5c3dda6f5b9c4ec6d55008d33327764364bd4Reid Spencer PHINode *PN = cast<PHINode>(I); 301ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner int BlockIdx = PN->getBasicBlockIndex(OrigBlock); 302ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner assert(BlockIdx != -1 && "Switch didn't go to this successor??"); 303ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner PN->setIncomingBlock((unsigned)BlockIdx, NewDefault); 30414383485ac546e369b11797b42bc20831b6db57bChris Lattner } 30514383485ac546e369b11797b42bc20831b6db57bChris Lattner 306e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov // Prepare cases vector. 307e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov CaseVector Cases; 308e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 309ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 3100f4c988a27d5723d723b7c8e7c4ca9fc6777f20dDavid Greene DEBUG(dbgs() << "Clusterify finished. Total clusters: " << Cases.size() 3116c1980b3357207c4d756255bc5e32323eac278dcDan Gohman << ". Total compares: " << numCmps << "\n"); 3120f4c988a27d5723d723b7c8e7c4ca9fc6777f20dDavid Greene DEBUG(dbgs() << "Cases: " << Cases << "\n"); 31302efa786d40fabae6dbbb3de5ab057359701e337Mike Stump (void)numCmps; 314e2ff29c17c1a7c121e22789cf1654d923467b472Anton Korobeynikov 315ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner BasicBlock* SwitchBlock = switchConvert(Cases.begin(), Cases.end(), Val, 316ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner OrigBlock, NewDefault); 317ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 318ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner // Branch to our shiny new if-then stuff... 319051a950000e21935165db56695e35bade668193bGabor Greif BranchInst::Create(SwitchBlock, OrigBlock); 320ebbc1a5aa0c37ab29d14ae56c176b3bfd25658cbChris Lattner 32114383485ac546e369b11797b42bc20831b6db57bChris Lattner // We are now done with the switch instruction, delete it. 322bf9eaddfb0642e49bc2f3835765a9782ff48c76eChris Lattner CurBlock->getInstList().erase(SI); 32314383485ac546e369b11797b42bc20831b6db57bChris Lattner} 324