CodeGenPrepare.cpp revision e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170
1dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner//===- CodeGenPrepare.cpp - Prepare a function for code generation --------===// 2dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner// 3dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner// The LLVM Compiler Infrastructure 4dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// License. See LICENSE.TXT for details. 7dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner// 8dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner//===----------------------------------------------------------------------===// 9dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner// 10dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner// This pass munges the code in the input function to better prepare it for 11a8a118b68fa3ca1632e7280cd6994aa0f8f1eec1Gordon Henriksen// SelectionDAG-based code generation. This works around limitations in it's 12a8a118b68fa3ca1632e7280cd6994aa0f8f1eec1Gordon Henriksen// basic-block-at-a-time approach. It should eventually be removed. 13dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner// 14dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner//===----------------------------------------------------------------------===// 15dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 16dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#define DEBUG_TYPE "codegenprepare" 17dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#include "llvm/Transforms/Scalar.h" 18dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#include "llvm/Constants.h" 19dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#include "llvm/DerivedTypes.h" 20dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#include "llvm/Function.h" 219bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng#include "llvm/InlineAsm.h" 22dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#include "llvm/Instructions.h" 236aae1d6582fe8519c42d9774d670bb93c78e9637Dale Johannesen#include "llvm/IntrinsicInst.h" 24dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#include "llvm/Pass.h" 25ad80981a106c9d0ec83351e63ee3ac75ed646bf4Andreas Neustifter#include "llvm/Analysis/ProfileInfo.h" 26dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#include "llvm/Target/TargetData.h" 27dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#include "llvm/Target/TargetLowering.h" 28a1fd5b386dd8eb4c86bfd2b9659c219a1c4f56dbEvan Cheng#include "llvm/Transforms/Utils/AddrModeMatcher.h" 29dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#include "llvm/Transforms/Utils/BasicBlockUtils.h" 30dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner#include "llvm/Transforms/Utils/Local.h" 31040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher#include "llvm/Transforms/Utils/BuildLibCalls.h" 32dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner#include "llvm/ADT/DenseMap.h" 33dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner#include "llvm/ADT/SmallSet.h" 3403ce042d70c423a41edca0714112a0e06b16493bDan Gohman#include "llvm/Assembly/Writer.h" 359bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng#include "llvm/Support/CallSite.h" 36e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng#include "llvm/Support/CommandLine.h" 37bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng#include "llvm/Support/Debug.h" 38dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner#include "llvm/Support/GetElementPtrTypeIterator.h" 39088a1e84ea985a22efcf907d7789064fee3a97b9Chris Lattner#include "llvm/Support/PatternMatch.h" 406c1980b3357207c4d756255bc5e32323eac278dcDan Gohman#include "llvm/Support/raw_ostream.h" 41040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher#include "llvm/Support/IRBuilder.h" 42dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattnerusing namespace llvm; 43088a1e84ea985a22efcf907d7789064fee3a97b9Chris Lattnerusing namespace llvm::PatternMatch; 44dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 45e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Chengstatic cl::opt<bool> 46e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan ChengCriticalEdgeSplit("cgp-critical-edge-splitting", 47e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng cl::desc("Split critical edges during codegen prepare"), 48e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng cl::init(true), cl::Hidden); 49e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng 50692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christophernamespace { 513e8b6631e67e01e4960a7ba4668a50c596607473Chris Lattner class CodeGenPrepare : public FunctionPass { 52dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner /// TLI - Keep a pointer of a TargetLowering to consult for determining 53dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner /// transformation profitability. 54dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner const TargetLowering *TLI; 5504149f7ffd033773adfe85e4acf3f560e29bd47dEvan Cheng ProfileInfo *PFI; 56ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng 57ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng /// BackEdges - Keep a set of all the loop back edges. 58ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng /// 59fe095f39e7009c51d1c86769792ccbcad8cdd2ecMike Stump SmallSet<std::pair<const BasicBlock*, const BasicBlock*>, 8> BackEdges; 60dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner public: 61ecd94c804a563f2a86572dcf1d2e81f397e19daaNick Lewycky static char ID; // Pass identification, replacement for typeid 62c2bbfc18e9adbbdcf5b3375d8d25e2452f7df7f1Dan Gohman explicit CodeGenPrepare(const TargetLowering *tli = 0) 6390c579de5a383cee278acc3f7e7b9d0a656e6a35Owen Anderson : FunctionPass(ID), TLI(tli) {} 64dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner bool runOnFunction(Function &F); 65692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 66ad80981a106c9d0ec83351e63ee3ac75ed646bf4Andreas Neustifter virtual void getAnalysisUsage(AnalysisUsage &AU) const { 67ad80981a106c9d0ec83351e63ee3ac75ed646bf4Andreas Neustifter AU.addPreserved<ProfileInfo>(); 68ad80981a106c9d0ec83351e63ee3ac75ed646bf4Andreas Neustifter } 69ad80981a106c9d0ec83351e63ee3ac75ed646bf4Andreas Neustifter 70aa0e52328747d982d6c6e501a205832ad724ff62Dan Gohman virtual void releaseMemory() { 71aa0e52328747d982d6c6e501a205832ad724ff62Dan Gohman BackEdges.clear(); 72aa0e52328747d982d6c6e501a205832ad724ff62Dan Gohman } 73aa0e52328747d982d6c6e501a205832ad724ff62Dan Gohman 74dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner private: 75d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner bool EliminateMostlyEmptyBlocks(Function &F); 76d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner bool CanMergeBlocks(const BasicBlock *BB, const BasicBlock *DestBB) const; 77d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner void EliminateMostlyEmptyBlock(BasicBlock *BB); 78dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner bool OptimizeBlock(BasicBlock &BB); 7988a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner bool OptimizeMemoryInst(Instruction *I, Value *Addr, const Type *AccessTy, 8088a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner DenseMap<Value*,Value*> &SunkAddrs); 819bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng bool OptimizeInlineAsmInst(Instruction *I, CallSite CS, 829bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng DenseMap<Value*,Value*> &SunkAddrs); 83040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher bool OptimizeCallInst(CallInst *CI); 84b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman bool MoveExtToFormExtLoad(Instruction *I); 85bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng bool OptimizeExtUses(Instruction *I); 86fe095f39e7009c51d1c86769792ccbcad8cdd2ecMike Stump void findLoopBackEdges(const Function &F); 87dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner }; 88dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner} 89794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 901997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar CodeGenPrepare::ID = 0; 91d13db2c59cc94162d6cf0a04187d408bfef6d4a7Owen AndersonINITIALIZE_PASS(CodeGenPrepare, "codegenprepare", 92d13db2c59cc94162d6cf0a04187d408bfef6d4a7Owen Anderson "Optimize for code generation", false, false); 93dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 94dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris LattnerFunctionPass *llvm::createCodeGenPreparePass(const TargetLowering *TLI) { 95dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner return new CodeGenPrepare(TLI); 96dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner} 97dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 98ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng/// findLoopBackEdges - Do a DFS walk to find loop back edges. 99ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng/// 100fe095f39e7009c51d1c86769792ccbcad8cdd2ecMike Stumpvoid CodeGenPrepare::findLoopBackEdges(const Function &F) { 101fe095f39e7009c51d1c86769792ccbcad8cdd2ecMike Stump SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; 102fe095f39e7009c51d1c86769792ccbcad8cdd2ecMike Stump FindFunctionBackedges(F, Edges); 103fe095f39e7009c51d1c86769792ccbcad8cdd2ecMike Stump 104fe095f39e7009c51d1c86769792ccbcad8cdd2ecMike Stump BackEdges.insert(Edges.begin(), Edges.end()); 105ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng} 106ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng 107dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 108dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattnerbool CodeGenPrepare::runOnFunction(Function &F) { 109dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner bool EverMadeChange = false; 110692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 11104149f7ffd033773adfe85e4acf3f560e29bd47dEvan Cheng PFI = getAnalysisIfAvailable<ProfileInfo>(); 112d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // First pass, eliminate blocks that contain only PHI nodes and an 113d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // unconditional branch. 114d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner EverMadeChange |= EliminateMostlyEmptyBlocks(F); 115692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 1167e66c0d43aefce78948f0b73422f6e5bb28e2077Evan Cheng // Now find loop back edges. 1177e66c0d43aefce78948f0b73422f6e5bb28e2077Evan Cheng findLoopBackEdges(F); 1187e66c0d43aefce78948f0b73422f6e5bb28e2077Evan Cheng 119d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner bool MadeChange = true; 120dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner while (MadeChange) { 121dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner MadeChange = false; 122dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) 123dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner MadeChange |= OptimizeBlock(*BB); 124dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner EverMadeChange |= MadeChange; 125dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner } 126dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner return EverMadeChange; 127dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner} 128dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 1292d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen/// EliminateMostlyEmptyBlocks - eliminate blocks that contain only PHI nodes, 1302d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen/// debug info directives, and an unconditional branch. Passes before isel 1312d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen/// (e.g. LSR/loopsimplify) often split edges in ways that are non-optimal for 1322d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen/// isel. Start by eliminating these blocks so we can split them the way we 1332d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen/// want them. 134d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattnerbool CodeGenPrepare::EliminateMostlyEmptyBlocks(Function &F) { 135d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner bool MadeChange = false; 136d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // Note that this intentionally skips the entry block. 137d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner for (Function::iterator I = ++F.begin(), E = F.end(); I != E; ) { 138d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BasicBlock *BB = I++; 139d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner 140d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // If this block doesn't end with an uncond branch, ignore it. 141d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); 142d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (!BI || !BI->isUnconditional()) 143d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner continue; 144692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 1452d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen // If the instruction before the branch (skipping debug info) isn't a phi 1462d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen // node, then other stuff is happening here. 147d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BasicBlock::iterator BBI = BI; 148d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (BBI != BB->begin()) { 149d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner --BBI; 1502d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen while (isa<DbgInfoIntrinsic>(BBI)) { 1512d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen if (BBI == BB->begin()) 1522d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen break; 1532d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen --BBI; 1542d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen } 1552d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI)) 1562d69724938e67ec248e0ba42f86287923b3a5171Dale Johannesen continue; 157d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 158692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 159d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // Do not break infinite loops. 160d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BasicBlock *DestBB = BI->getSuccessor(0); 161d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (DestBB == BB) 162d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner continue; 163692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 164d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (!CanMergeBlocks(BB, DestBB)) 165d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner continue; 166692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 167d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner EliminateMostlyEmptyBlock(BB); 168d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner MadeChange = true; 169d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 170d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner return MadeChange; 171d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner} 172d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner 173d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner/// CanMergeBlocks - Return true if we can merge BB into DestBB if there is a 174d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner/// single uncond branch between them, and BB contains no other non-phi 175d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner/// instructions. 176d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattnerbool CodeGenPrepare::CanMergeBlocks(const BasicBlock *BB, 177d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner const BasicBlock *DestBB) const { 178d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // We only want to eliminate blocks whose phi nodes are used by phi nodes in 179d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // the successor. If there are more complex condition (e.g. preheaders), 180d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // don't mess around with them. 181d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BasicBlock::const_iterator BBI = BB->begin(); 182d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) { 18360ad781c61815ca5b8dc2a45a102e1c8af65992fGabor Greif for (Value::const_use_iterator UI = PN->use_begin(), E = PN->use_end(); 184d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner UI != E; ++UI) { 185d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner const Instruction *User = cast<Instruction>(*UI); 186d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (User->getParent() != DestBB || !isa<PHINode>(User)) 187d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner return false; 188692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher // If User is inside DestBB block and it is a PHINode then check 189692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher // incoming value. If incoming value is not from BB then this is 19075abc1ed0618048c3cf6c5b71c9868c10d6c1478Devang Patel // a complex condition (e.g. preheaders) we want to avoid here. 19175abc1ed0618048c3cf6c5b71c9868c10d6c1478Devang Patel if (User->getParent() == DestBB) { 19275abc1ed0618048c3cf6c5b71c9868c10d6c1478Devang Patel if (const PHINode *UPN = dyn_cast<PHINode>(User)) 19375abc1ed0618048c3cf6c5b71c9868c10d6c1478Devang Patel for (unsigned I = 0, E = UPN->getNumIncomingValues(); I != E; ++I) { 19475abc1ed0618048c3cf6c5b71c9868c10d6c1478Devang Patel Instruction *Insn = dyn_cast<Instruction>(UPN->getIncomingValue(I)); 19575abc1ed0618048c3cf6c5b71c9868c10d6c1478Devang Patel if (Insn && Insn->getParent() == BB && 19675abc1ed0618048c3cf6c5b71c9868c10d6c1478Devang Patel Insn->getParent() != UPN->getIncomingBlock(I)) 19775abc1ed0618048c3cf6c5b71c9868c10d6c1478Devang Patel return false; 19875abc1ed0618048c3cf6c5b71c9868c10d6c1478Devang Patel } 19975abc1ed0618048c3cf6c5b71c9868c10d6c1478Devang Patel } 200d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 201d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 202692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 203d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // If BB and DestBB contain any common predecessors, then the phi nodes in BB 204d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // and DestBB may have conflicting incoming values for the block. If so, we 205d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // can't merge the block. 206d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner const PHINode *DestBBPN = dyn_cast<PHINode>(DestBB->begin()); 207d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (!DestBBPN) return true; // no conflict. 208692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 209d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // Collect the preds of BB. 210f67f73a519eac94b6c1f98dbce7d251a3a4aea07Chris Lattner SmallPtrSet<const BasicBlock*, 16> BBPreds; 211d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (const PHINode *BBPN = dyn_cast<PHINode>(BB->begin())) { 212d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // It is faster to get preds from a PHI than with pred_iterator. 213d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i) 214d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BBPreds.insert(BBPN->getIncomingBlock(i)); 215d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } else { 216d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BBPreds.insert(pred_begin(BB), pred_end(BB)); 217d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 218692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 219d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // Walk the preds of DestBB. 220d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner for (unsigned i = 0, e = DestBBPN->getNumIncomingValues(); i != e; ++i) { 221d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BasicBlock *Pred = DestBBPN->getIncomingBlock(i); 222d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (BBPreds.count(Pred)) { // Common predecessor? 223d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BBI = DestBB->begin(); 224d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) { 225d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner const Value *V1 = PN->getIncomingValueForBlock(Pred); 226d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner const Value *V2 = PN->getIncomingValueForBlock(BB); 227692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 228d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // If V2 is a phi node in BB, look up what the mapped value will be. 229d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (const PHINode *V2PN = dyn_cast<PHINode>(V2)) 230d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (V2PN->getParent() == BB) 231d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner V2 = V2PN->getIncomingValueForBlock(Pred); 232692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 233d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // If there is a conflict, bail out. 234d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (V1 != V2) return false; 235d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 236d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 237d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 238d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner 239d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner return true; 240d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner} 241d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner 242d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner 243d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner/// EliminateMostlyEmptyBlock - Eliminate a basic block that have only phi's and 244d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner/// an unconditional branch in it. 245d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattnervoid CodeGenPrepare::EliminateMostlyEmptyBlock(BasicBlock *BB) { 246d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BranchInst *BI = cast<BranchInst>(BB->getTerminator()); 247d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BasicBlock *DestBB = BI->getSuccessor(0); 248692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 24968d67fdf203ff2d5b0eeb925befd0866bce3aceeDavid Greene DEBUG(dbgs() << "MERGING MOSTLY EMPTY BLOCKS - BEFORE:\n" << *BB << *DestBB); 250692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 251d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // If the destination block has a single pred, then this is a trivial edge, 252d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // just collapse it. 2539918fb5631974f2201a640384b7ebe672c749e43Chris Lattner if (BasicBlock *SinglePred = DestBB->getSinglePredecessor()) { 254f5102a0f088e7c96f7028bf7ca1c24975c314fffChris Lattner if (SinglePred != DestBB) { 255f5102a0f088e7c96f7028bf7ca1c24975c314fffChris Lattner // Remember if SinglePred was the entry block of the function. If so, we 256f5102a0f088e7c96f7028bf7ca1c24975c314fffChris Lattner // will need to move BB back to the entry position. 257f5102a0f088e7c96f7028bf7ca1c24975c314fffChris Lattner bool isEntry = SinglePred == &SinglePred->getParent()->getEntryBlock(); 258ad80981a106c9d0ec83351e63ee3ac75ed646bf4Andreas Neustifter MergeBasicBlockIntoOnlyPred(DestBB, this); 259f5102a0f088e7c96f7028bf7ca1c24975c314fffChris Lattner 260f5102a0f088e7c96f7028bf7ca1c24975c314fffChris Lattner if (isEntry && BB != &BB->getParent()->getEntryBlock()) 261f5102a0f088e7c96f7028bf7ca1c24975c314fffChris Lattner BB->moveBefore(&BB->getParent()->getEntryBlock()); 262f5102a0f088e7c96f7028bf7ca1c24975c314fffChris Lattner 26368d67fdf203ff2d5b0eeb925befd0866bce3aceeDavid Greene DEBUG(dbgs() << "AFTER:\n" << *DestBB << "\n\n\n"); 264f5102a0f088e7c96f7028bf7ca1c24975c314fffChris Lattner return; 265f5102a0f088e7c96f7028bf7ca1c24975c314fffChris Lattner } 266d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 267692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 268d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // Otherwise, we have multiple predecessors of BB. Update the PHIs in DestBB 269d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // to handle the new incoming edges it is about to have. 270d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner PHINode *PN; 271d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner for (BasicBlock::iterator BBI = DestBB->begin(); 272d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner (PN = dyn_cast<PHINode>(BBI)); ++BBI) { 273d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // Remove the incoming value for BB, and remember it. 274d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner Value *InVal = PN->removeIncomingValue(BB, false); 275692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 276d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // Two options: either the InVal is a phi node defined in BB or it is some 277d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // value that dominates BB. 278d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner PHINode *InValPhi = dyn_cast<PHINode>(InVal); 279d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (InValPhi && InValPhi->getParent() == BB) { 280d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // Add all of the input values of the input PHI as inputs of this phi. 281d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner for (unsigned i = 0, e = InValPhi->getNumIncomingValues(); i != e; ++i) 282d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner PN->addIncoming(InValPhi->getIncomingValue(i), 283d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner InValPhi->getIncomingBlock(i)); 284d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } else { 285d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // Otherwise, add one instance of the dominating value for each edge that 286d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // we will be adding. 287d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner if (PHINode *BBPN = dyn_cast<PHINode>(BB->begin())) { 288d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i) 289d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner PN->addIncoming(InVal, BBPN->getIncomingBlock(i)); 290d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } else { 291d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 292d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner PN->addIncoming(InVal, *PI); 293d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 294d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 295d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner } 296692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 297d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // The PHIs are now updated, change everything that refers to BB to use 298d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner // DestBB and remove BB. 299d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BB->replaceAllUsesWith(DestBB); 30004149f7ffd033773adfe85e4acf3f560e29bd47dEvan Cheng if (PFI) { 30104149f7ffd033773adfe85e4acf3f560e29bd47dEvan Cheng PFI->replaceAllUses(BB, DestBB); 30204149f7ffd033773adfe85e4acf3f560e29bd47dEvan Cheng PFI->removeEdge(ProfileInfo::getEdge(BB, DestBB)); 303ad80981a106c9d0ec83351e63ee3ac75ed646bf4Andreas Neustifter } 304d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner BB->eraseFromParent(); 305692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 30668d67fdf203ff2d5b0eeb925befd0866bce3aceeDavid Greene DEBUG(dbgs() << "AFTER:\n" << *DestBB << "\n\n\n"); 307d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner} 308d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner 30998d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner/// FindReusablePredBB - Check all of the predecessors of the block DestPHI 31098d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner/// lives in to see if there is a block that we can reuse as a critical edge 31198d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner/// from TIBB. 31298d5c3141eddc84a8bcf7db57332967695585e42Chris Lattnerstatic BasicBlock *FindReusablePredBB(PHINode *DestPHI, BasicBlock *TIBB) { 31398d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner BasicBlock *Dest = DestPHI->getParent(); 31498d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner 31598d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner /// TIPHIValues - This array is lazily computed to determine the values of 31698d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner /// PHIs in Dest that TI would provide. 31798d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner SmallVector<Value*, 32> TIPHIValues; 31898d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner 31998d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner /// TIBBEntryNo - This is a cache to speed up pred queries for TIBB. 32098d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner unsigned TIBBEntryNo = 0; 32198d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner 32298d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner // Check to see if Dest has any blocks that can be used as a split edge for 32398d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner // this terminator. 32498d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner for (unsigned pi = 0, e = DestPHI->getNumIncomingValues(); pi != e; ++pi) { 32598d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner BasicBlock *Pred = DestPHI->getIncomingBlock(pi); 32698d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner // To be usable, the pred has to end with an uncond branch to the dest. 32798d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner BranchInst *PredBr = dyn_cast<BranchInst>(Pred->getTerminator()); 32898d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner if (!PredBr || !PredBr->isUnconditional()) 32998d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner continue; 33098d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner // Must be empty other than the branch and debug info. 33198d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner BasicBlock::iterator I = Pred->begin(); 33298d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner while (isa<DbgInfoIntrinsic>(I)) 33398d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner I++; 33498d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner if (&*I != PredBr) 33598d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner continue; 33698d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner // Cannot be the entry block; its label does not get emitted. 33798d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner if (Pred == &Dest->getParent()->getEntryBlock()) 33898d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner continue; 33998d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner 34098d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner // Finally, since we know that Dest has phi nodes in it, we have to make 34198d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner // sure that jumping to Pred will have the same effect as going to Dest in 34298d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner // terms of PHI values. 34398d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner PHINode *PN; 34498d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner unsigned PHINo = 0; 34598d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner unsigned PredEntryNo = pi; 34698d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner 34798d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner bool FoundMatch = true; 34898d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner for (BasicBlock::iterator I = Dest->begin(); 34998d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I, ++PHINo) { 35098d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner if (PHINo == TIPHIValues.size()) { 35198d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner if (PN->getIncomingBlock(TIBBEntryNo) != TIBB) 35298d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner TIBBEntryNo = PN->getBasicBlockIndex(TIBB); 35398d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner TIPHIValues.push_back(PN->getIncomingValue(TIBBEntryNo)); 35498d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner } 35598d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner 35698d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner // If the PHI entry doesn't work, we can't use this pred. 35798d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner if (PN->getIncomingBlock(PredEntryNo) != Pred) 35898d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner PredEntryNo = PN->getBasicBlockIndex(Pred); 35998d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner 36098d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner if (TIPHIValues[PHINo] != PN->getIncomingValue(PredEntryNo)) { 36198d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner FoundMatch = false; 36298d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner break; 36398d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner } 36498d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner } 36598d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner 36698d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner // If we found a workable predecessor, change TI to branch to Succ. 36798d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner if (FoundMatch) 36898d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner return Pred; 36998d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner } 37098d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner return 0; 37198d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner} 37298d5c3141eddc84a8bcf7db57332967695585e42Chris Lattner 373d9c3a0d7cce72ac802516483c4a325b3b31bbc0eChris Lattner 374ebe807597f3ee67f6c5f9cd462ba325b579a2680Chris Lattner/// SplitEdgeNicely - Split the critical edge from TI to its specified 375dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner/// successor if it will improve codegen. We only do this if the successor has 376dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner/// phi nodes (otherwise critical edges are ok). If there is already another 377dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner/// predecessor of the succ that is empty (and thus has no phi nodes), use it 378dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner/// instead of introducing a new block. 379ab63152871f4144050d0a58d592a95e089fe40d4Evan Chengstatic void SplitEdgeNicely(TerminatorInst *TI, unsigned SuccNum, 380fe095f39e7009c51d1c86769792ccbcad8cdd2ecMike Stump SmallSet<std::pair<const BasicBlock*, 381fe095f39e7009c51d1c86769792ccbcad8cdd2ecMike Stump const BasicBlock*>, 8> &BackEdges, 382ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng Pass *P) { 383dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner BasicBlock *TIBB = TI->getParent(); 384dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner BasicBlock *Dest = TI->getSuccessor(SuccNum); 385dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner assert(isa<PHINode>(Dest->begin()) && 386dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner "This should only be called if Dest has a PHI!"); 3873f65b5e733e01faeb9db825515ca00e544fb988aChris Lattner PHINode *DestPHI = cast<PHINode>(Dest->begin()); 388692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 389fc0b80d9746e5fd4b45057ab814c67371fb0f9eaEvan Cheng // Do not split edges to EH landing pads. 3903f65b5e733e01faeb9db825515ca00e544fb988aChris Lattner if (InvokeInst *Invoke = dyn_cast<InvokeInst>(TI)) 391fc0b80d9746e5fd4b45057ab814c67371fb0f9eaEvan Cheng if (Invoke->getSuccessor(1) == Dest) 392fc0b80d9746e5fd4b45057ab814c67371fb0f9eaEvan Cheng return; 393fc0b80d9746e5fd4b45057ab814c67371fb0f9eaEvan Cheng 394ebe807597f3ee67f6c5f9cd462ba325b579a2680Chris Lattner // As a hack, never split backedges of loops. Even though the copy for any 395ebe807597f3ee67f6c5f9cd462ba325b579a2680Chris Lattner // PHIs inserted on the backedge would be dead for exits from the loop, we 396ebe807597f3ee67f6c5f9cd462ba325b579a2680Chris Lattner // assume that the cost of *splitting* the backedge would be too high. 397ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng if (BackEdges.count(std::make_pair(TIBB, Dest))) 398ebe807597f3ee67f6c5f9cd462ba325b579a2680Chris Lattner return; 399692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 400c09687bb7ea35e0dc9d709460c83a58e6076e4d2Chris Lattner if (BasicBlock *ReuseBB = FindReusablePredBB(DestPHI, TIBB)) { 401c09687bb7ea35e0dc9d709460c83a58e6076e4d2Chris Lattner ProfileInfo *PFI = P->getAnalysisIfAvailable<ProfileInfo>(); 402c09687bb7ea35e0dc9d709460c83a58e6076e4d2Chris Lattner if (PFI) 403c09687bb7ea35e0dc9d709460c83a58e6076e4d2Chris Lattner PFI->splitEdge(TIBB, Dest, ReuseBB); 404c09687bb7ea35e0dc9d709460c83a58e6076e4d2Chris Lattner Dest->removePredecessor(TIBB); 405c09687bb7ea35e0dc9d709460c83a58e6076e4d2Chris Lattner TI->setSuccessor(SuccNum, ReuseBB); 406ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng return; 407ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng } 408ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng 409c09687bb7ea35e0dc9d709460c83a58e6076e4d2Chris Lattner SplitCriticalEdge(TI, SuccNum, P, true); 410dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner} 411dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 412ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng 413dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner/// OptimizeNoopCopyExpression - If the specified cast instruction is a noop 414a119de86a064414622562cfe32953de7f9b0ee40Dan Gohman/// copy (e.g. it's casting from one pointer type to another, i32->i8 on PPC), 415a119de86a064414622562cfe32953de7f9b0ee40Dan Gohman/// sink it into user blocks to reduce the number of virtual 416ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen/// registers that must be created and coalesced. 417dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner/// 418dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner/// Return true if any changes are made. 41985fa13c02d383bb87dd9b8b9081a4d34a3e9c52cChris Lattner/// 420dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattnerstatic bool OptimizeNoopCopyExpression(CastInst *CI, const TargetLowering &TLI){ 421692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher // If this is a noop copy, 422e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT SrcVT = TLI.getValueType(CI->getOperand(0)->getType()); 423e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT DstVT = TLI.getValueType(CI->getType()); 424692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 425dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // This is an fp<->int conversion? 42683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (SrcVT.isInteger() != DstVT.isInteger()) 427dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner return false; 4288e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands 429dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // If this is an extension, it will be a zero or sign extension, which 430dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // isn't a noop. 4318e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (SrcVT.bitsLT(DstVT)) return false; 432692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 433dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // If these values will be promoted, find out what they will be promoted 434dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // to. This helps us consider truncates on PPC as noop copies when they 435dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // are. 43623b9b19b1a5a00faa9fce0788155c7dbfd00bfb1Owen Anderson if (TLI.getTypeAction(CI->getContext(), SrcVT) == TargetLowering::Promote) 43723b9b19b1a5a00faa9fce0788155c7dbfd00bfb1Owen Anderson SrcVT = TLI.getTypeToTransformTo(CI->getContext(), SrcVT); 43823b9b19b1a5a00faa9fce0788155c7dbfd00bfb1Owen Anderson if (TLI.getTypeAction(CI->getContext(), DstVT) == TargetLowering::Promote) 43923b9b19b1a5a00faa9fce0788155c7dbfd00bfb1Owen Anderson DstVT = TLI.getTypeToTransformTo(CI->getContext(), DstVT); 440692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 441dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // If, after promotion, these are the same types, this is a noop copy. 442dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (SrcVT != DstVT) 443dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner return false; 444692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 445dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner BasicBlock *DefBB = CI->getParent(); 446692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 447dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner /// InsertedCasts - Only insert a cast in each block once. 448ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen DenseMap<BasicBlock*, CastInst*> InsertedCasts; 449692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 450dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner bool MadeChange = false; 451692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher for (Value::use_iterator UI = CI->use_begin(), E = CI->use_end(); 452dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner UI != E; ) { 453dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner Use &TheUse = UI.getUse(); 454dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner Instruction *User = cast<Instruction>(*UI); 455692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 456dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // Figure out which BB this cast is used in. For PHI's this is the 457dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // appropriate predecessor block. 458dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner BasicBlock *UserBB = User->getParent(); 459dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner if (PHINode *PN = dyn_cast<PHINode>(User)) { 460a36791da41cf4f635e50077b290676b873836bdaGabor Greif UserBB = PN->getIncomingBlock(UI); 461dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner } 462692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 463dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // Preincrement use iterator so we don't invalidate it. 464dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner ++UI; 465692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 466dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // If this user is in the same block as the cast, don't change the cast. 467dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner if (UserBB == DefBB) continue; 468692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 469dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // If we have already inserted a cast into this block, use it. 470dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner CastInst *&InsertedCast = InsertedCasts[UserBB]; 471dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 472dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner if (!InsertedCast) { 47302dea8b39f3acad5de1df36273444d149145e7fcDan Gohman BasicBlock::iterator InsertPt = UserBB->getFirstNonPHI(); 474692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 475692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher InsertedCast = 476692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher CastInst::Create(CI->getOpcode(), CI->getOperand(0), CI->getType(), "", 477dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner InsertPt); 478dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner MadeChange = true; 479dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner } 480692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 481ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen // Replace a use of the cast with a use of the new cast. 482dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner TheUse = InsertedCast; 483dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner } 484692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 485dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // If we removed all uses, nuke the cast. 486e003813e9613f41ff2c6a10cb1d3ae3a5b8eab1fDuncan Sands if (CI->use_empty()) { 487dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner CI->eraseFromParent(); 488e003813e9613f41ff2c6a10cb1d3ae3a5b8eab1fDuncan Sands MadeChange = true; 489e003813e9613f41ff2c6a10cb1d3ae3a5b8eab1fDuncan Sands } 490692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 491dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner return MadeChange; 492dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner} 493dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 494692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher/// OptimizeCmpExpression - sink the given CmpInst into user blocks to reduce 495ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen/// the number of virtual registers that must be created and coalesced. This is 496684b22df79c51114a12289e10a4063d5f02259a9Chris Lattner/// a clear win except on targets with multiple condition code registers 497684b22df79c51114a12289e10a4063d5f02259a9Chris Lattner/// (PowerPC), where it might lose; some adjustment may be wanted there. 498ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen/// 499ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen/// Return true if any changes are made. 50085fa13c02d383bb87dd9b8b9081a4d34a3e9c52cChris Lattnerstatic bool OptimizeCmpExpression(CmpInst *CI) { 501ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen BasicBlock *DefBB = CI->getParent(); 502692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 503ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen /// InsertedCmp - Only insert a cmp in each block once. 504ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen DenseMap<BasicBlock*, CmpInst*> InsertedCmps; 505692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 506ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen bool MadeChange = false; 507692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher for (Value::use_iterator UI = CI->use_begin(), E = CI->use_end(); 508ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen UI != E; ) { 509ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen Use &TheUse = UI.getUse(); 510ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen Instruction *User = cast<Instruction>(*UI); 511692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 512ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen // Preincrement use iterator so we don't invalidate it. 513ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen ++UI; 514692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 515ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen // Don't bother for PHI nodes. 516ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen if (isa<PHINode>(User)) 517ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen continue; 518ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen 519ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen // Figure out which BB this cmp is used in. 520ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen BasicBlock *UserBB = User->getParent(); 521692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 522ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen // If this user is in the same block as the cmp, don't change the cmp. 523ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen if (UserBB == DefBB) continue; 524692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 525ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen // If we have already inserted a cmp into this block, use it. 526ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen CmpInst *&InsertedCmp = InsertedCmps[UserBB]; 527ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen 528ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen if (!InsertedCmp) { 52902dea8b39f3acad5de1df36273444d149145e7fcDan Gohman BasicBlock::iterator InsertPt = UserBB->getFirstNonPHI(); 530692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 531692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher InsertedCmp = 5321c8a23c440b1665ba422778cdc74a0c59ecaf39eDan Gohman CmpInst::Create(CI->getOpcode(), 533333c40096561218bc3597cf153c0a3895274414cOwen Anderson CI->getPredicate(), CI->getOperand(0), 534ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen CI->getOperand(1), "", InsertPt); 535ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen MadeChange = true; 536ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen } 537692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 538ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen // Replace a use of the cmp with a use of the new cmp. 539ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen TheUse = InsertedCmp; 540ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen } 541692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 542ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen // If we removed all uses, nuke the cmp. 543ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen if (CI->use_empty()) 544ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen CI->eraseFromParent(); 545692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 546ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen return MadeChange; 547ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen} 548ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen 5490b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramernamespace { 5500b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramerclass CodeGenPrepareFortifiedLibCalls : public SimplifyFortifiedLibCalls { 5510b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramerprotected: 5520b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer void replaceCall(Value *With) { 5530b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer CI->replaceAllUsesWith(With); 5540b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer CI->eraseFromParent(); 5550b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer } 5560b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer bool isFoldable(unsigned SizeCIOp, unsigned, bool) const { 557a6aac4c5bc22bb10c7adb11eee3f82c703af7002Gabor Greif if (ConstantInt *SizeCI = 558a6aac4c5bc22bb10c7adb11eee3f82c703af7002Gabor Greif dyn_cast<ConstantInt>(CI->getArgOperand(SizeCIOp))) 559a6aac4c5bc22bb10c7adb11eee3f82c703af7002Gabor Greif return SizeCI->isAllOnesValue(); 5600b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer return false; 5610b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer } 5620b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer}; 5630b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer} // end anonymous namespace 5640b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer 565040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopherbool CodeGenPrepare::OptimizeCallInst(CallInst *CI) { 566040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher // Lower all uses of llvm.objectsize.* 567040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher IntrinsicInst *II = dyn_cast<IntrinsicInst>(CI); 568040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher if (II && II->getIntrinsicID() == Intrinsic::objectsize) { 569de9f5452d3ae894bb7fdd455cec5af50e2560aa5Gabor Greif bool Min = (cast<ConstantInt>(II->getArgOperand(1))->getZExtValue() == 1); 570040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher const Type *ReturnTy = CI->getType(); 571040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher Constant *RetVal = ConstantInt::get(ReturnTy, Min ? 0 : -1ULL); 572040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher CI->replaceAllUsesWith(RetVal); 573040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher CI->eraseFromParent(); 574040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher return true; 575040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher } 576040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher 577040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher // From here on out we're working with named functions. 578040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher if (CI->getCalledFunction() == 0) return false; 579040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher 580040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher // We'll need TargetData from here on out. 581040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher const TargetData *TD = TLI ? TLI->getTargetData() : 0; 582040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher if (!TD) return false; 583040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher 5840b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer // Lower all default uses of _chk calls. This is very similar 5850b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer // to what InstCombineCalls does, but here we are only lowering calls 586040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher // that have the default "don't know" as the objectsize. Anything else 587040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher // should be left alone. 5880b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer CodeGenPrepareFortifiedLibCalls Simplifier; 5890b6cb507385c8bd10b6a51b5e45a9b99d8d94798Benjamin Kramer return Simplifier.fold(CI, TD); 590040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher} 59188a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner//===----------------------------------------------------------------------===// 59288a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner// Memory Optimization 59388a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner//===----------------------------------------------------------------------===// 59488a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner 595dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner/// IsNonLocalValue - Return true if the specified values are defined in a 596dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner/// different basic block than BB. 597dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattnerstatic bool IsNonLocalValue(Value *V, BasicBlock *BB) { 598dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (Instruction *I = dyn_cast<Instruction>(V)) 599dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner return I->getParent() != BB; 600dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner return false; 601dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner} 602dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner 6034a8ee23a8181f668dc294b417f67e1675ad391abBob Wilson/// OptimizeMemoryInst - Load and Store Instructions often have 604dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner/// addressing modes that can do significant amounts of computation. As such, 605dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner/// instruction selection will try to get the load or store to do as much 606dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner/// computation as possible for the program. The problem is that isel can only 607dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner/// see within a single block. As such, we sink as much legal addressing mode 608dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner/// stuff into the block as possible. 60988a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner/// 61088a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner/// This method is used to optimize both load/store and inline asms with memory 61188a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner/// operands. 612896617b776e7b015346160645b19be776cbe3805Chris Lattnerbool CodeGenPrepare::OptimizeMemoryInst(Instruction *MemoryInst, Value *Addr, 61388a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner const Type *AccessTy, 61488a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner DenseMap<Value*,Value*> &SunkAddrs) { 615dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // Figure out what addressing mode will be built up for this operation. 616dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner SmallVector<Instruction*, 16> AddrModeInsts; 617896617b776e7b015346160645b19be776cbe3805Chris Lattner ExtAddrMode AddrMode = AddressingModeMatcher::Match(Addr, AccessTy,MemoryInst, 618896617b776e7b015346160645b19be776cbe3805Chris Lattner AddrModeInsts, *TLI); 619692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 620dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // Check to see if any of the instructions supersumed by this addr mode are 621dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // non-local to I's BB. 622dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner bool AnyNonLocal = false; 623dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner for (unsigned i = 0, e = AddrModeInsts.size(); i != e; ++i) { 624896617b776e7b015346160645b19be776cbe3805Chris Lattner if (IsNonLocalValue(AddrModeInsts[i], MemoryInst->getParent())) { 625dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner AnyNonLocal = true; 626dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner break; 627dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } 628dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } 629692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 630dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // If all the instructions matched are already in this BB, don't do anything. 631dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (!AnyNonLocal) { 63268d67fdf203ff2d5b0eeb925befd0866bce3aceeDavid Greene DEBUG(dbgs() << "CGP: Found local addrmode: " << AddrMode << "\n"); 633dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner return false; 634dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } 635692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 636dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // Insert this computation right after this user. Since our caller is 637dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // scanning from the top of the BB to the bottom, reuse of the expr are 638dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // guaranteed to happen later. 639896617b776e7b015346160645b19be776cbe3805Chris Lattner BasicBlock::iterator InsertPt = MemoryInst; 640692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 641dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // Now that we determined the addressing expression we want to use and know 642dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // that we have to sink it into this block. Check to see if we have already 643dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // done this for some other load/store instr in this block. If so, reuse the 644dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // computation. 645dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner Value *&SunkAddr = SunkAddrs[Addr]; 646dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (SunkAddr) { 64768d67fdf203ff2d5b0eeb925befd0866bce3aceeDavid Greene DEBUG(dbgs() << "CGP: Reusing nonlocal addrmode: " << AddrMode << " for " 6486c1980b3357207c4d756255bc5e32323eac278dcDan Gohman << *MemoryInst); 649dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (SunkAddr->getType() != Addr->getType()) 650dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner SunkAddr = new BitCastInst(SunkAddr, Addr->getType(), "tmp", InsertPt); 651dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } else { 65268d67fdf203ff2d5b0eeb925befd0866bce3aceeDavid Greene DEBUG(dbgs() << "CGP: SINKING nonlocal addrmode: " << AddrMode << " for " 6536c1980b3357207c4d756255bc5e32323eac278dcDan Gohman << *MemoryInst); 6541d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson const Type *IntPtrTy = 6551d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson TLI->getTargetData()->getIntPtrType(AccessTy->getContext()); 656692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 657dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner Value *Result = 0; 658d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman 659d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman // Start with the base register. Do this first so that subsequent address 660d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman // matching finds it last, which will prevent it from trying to match it 661d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman // as the scaled value in case it happens to be a mul. That would be 662d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman // problematic if we've sunk a different mul for the scale, because then 663d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman // we'd end up sinking both muls. 664d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman if (AddrMode.BaseReg) { 665d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman Value *V = AddrMode.BaseReg; 6661df9859c40492511b8aa4321eb76496005d3b75bDuncan Sands if (V->getType()->isPointerTy()) 667d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman V = new PtrToIntInst(V, IntPtrTy, "sunkaddr", InsertPt); 668d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman if (V->getType() != IntPtrTy) 669d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman V = CastInst::CreateIntegerCast(V, IntPtrTy, /*isSigned=*/true, 670d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman "sunkaddr", InsertPt); 671d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman Result = V; 672d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman } 673d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman 674d8d0b6a42c09f1c5b00a4e7029b08074a3da5acdDan Gohman // Add the scale value. 675dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (AddrMode.Scale) { 676dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner Value *V = AddrMode.ScaledReg; 677dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (V->getType() == IntPtrTy) { 678dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // done. 6791df9859c40492511b8aa4321eb76496005d3b75bDuncan Sands } else if (V->getType()->isPointerTy()) { 680dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner V = new PtrToIntInst(V, IntPtrTy, "sunkaddr", InsertPt); 681dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } else if (cast<IntegerType>(IntPtrTy)->getBitWidth() < 682dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner cast<IntegerType>(V->getType())->getBitWidth()) { 683dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner V = new TruncInst(V, IntPtrTy, "sunkaddr", InsertPt); 684dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } else { 685dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner V = new SExtInst(V, IntPtrTy, "sunkaddr", InsertPt); 686dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } 687dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (AddrMode.Scale != 1) 688eed707b1e6097aac2bb6b3d47271f6300ace7f2eOwen Anderson V = BinaryOperator::CreateMul(V, ConstantInt::get(IntPtrTy, 689d672ecb0178c6247a5eaa5b0fb0c3b23cd25bd7cOwen Anderson AddrMode.Scale), 690dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner "sunkaddr", InsertPt); 691dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (Result) 6927cbd8a3e92221437048b484d5ef9c0a22d0f8c58Gabor Greif Result = BinaryOperator::CreateAdd(Result, V, "sunkaddr", InsertPt); 693dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner else 694dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner Result = V; 695dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } 696692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 697dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // Add in the BaseGV if present. 698dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (AddrMode.BaseGV) { 699dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner Value *V = new PtrToIntInst(AddrMode.BaseGV, IntPtrTy, "sunkaddr", 700dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner InsertPt); 701dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (Result) 7027cbd8a3e92221437048b484d5ef9c0a22d0f8c58Gabor Greif Result = BinaryOperator::CreateAdd(Result, V, "sunkaddr", InsertPt); 703dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner else 704dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner Result = V; 705dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } 706692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 707dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // Add in the Base Offset if present. 708dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (AddrMode.BaseOffs) { 709eed707b1e6097aac2bb6b3d47271f6300ace7f2eOwen Anderson Value *V = ConstantInt::get(IntPtrTy, AddrMode.BaseOffs); 710dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (Result) 7117cbd8a3e92221437048b484d5ef9c0a22d0f8c58Gabor Greif Result = BinaryOperator::CreateAdd(Result, V, "sunkaddr", InsertPt); 712dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner else 713dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner Result = V; 714dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } 715dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 716dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (Result == 0) 717a7235ea7245028a0723e8ab7fd011386b3900777Owen Anderson SunkAddr = Constant::getNullValue(Addr->getType()); 718dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner else 719dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner SunkAddr = new IntToPtrInst(Result, Addr->getType(), "sunkaddr",InsertPt); 720dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } 721692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 722896617b776e7b015346160645b19be776cbe3805Chris Lattner MemoryInst->replaceUsesOfWith(Addr, SunkAddr); 723692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 724536d31b5b391ee76eae33f4756f6442bf10b2d72Dale Johannesen if (Addr->use_empty()) { 7253481f24c06b3c9de48bdd99c37547471ca8e761eChris Lattner RecursivelyDeleteTriviallyDeadInstructions(Addr); 726536d31b5b391ee76eae33f4756f6442bf10b2d72Dale Johannesen // This address is now available for reassignment, so erase the table entry; 727536d31b5b391ee76eae33f4756f6442bf10b2d72Dale Johannesen // we don't want to match some completely different instruction. 728536d31b5b391ee76eae33f4756f6442bf10b2d72Dale Johannesen SunkAddrs[Addr] = 0; 729536d31b5b391ee76eae33f4756f6442bf10b2d72Dale Johannesen } 730dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner return true; 731dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner} 732dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner 7339bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng/// OptimizeInlineAsmInst - If there are any memory operands, use 73488a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner/// OptimizeMemoryInst to sink their address computing into the block when 7359bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng/// possible / profitable. 7369bf12b5583104c810cfadcdce91edf9efad79973Evan Chengbool CodeGenPrepare::OptimizeInlineAsmInst(Instruction *I, CallSite CS, 7379bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng DenseMap<Value*,Value*> &SunkAddrs) { 7389bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng bool MadeChange = false; 7399bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 7409bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng 7419bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng // Do a prepass over the constraints, canonicalizing them, and building up the 7429bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng // ConstraintOperands list. 7439bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng std::vector<InlineAsm::ConstraintInfo> 7449bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng ConstraintInfos = IA->ParseConstraints(); 7459bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng 7469bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng /// ConstraintOperands - Information about all of the constraints. 7479bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng std::vector<TargetLowering::AsmOperandInfo> ConstraintOperands; 7489bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 7499bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 7509bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng ConstraintOperands. 7519bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng push_back(TargetLowering::AsmOperandInfo(ConstraintInfos[i])); 7529bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng TargetLowering::AsmOperandInfo &OpInfo = ConstraintOperands.back(); 7539bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng 7549bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng // Compute the value type for each operand. 7559bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng switch (OpInfo.Type) { 7569bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng case InlineAsm::isOutput: 7579bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng if (OpInfo.isIndirect) 7589bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 7599bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng break; 7609bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng case InlineAsm::isInput: 7619bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 7629bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng break; 7639bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng case InlineAsm::isClobber: 7649bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng // Nothing to do. 7659bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng break; 7669bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng } 7679bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng 7689bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng // Compute the constraint code and ConstraintType to use. 7691784d160e4efa75782884d451d0788b9457e67dcDale Johannesen TLI->ComputeConstraintToUse(OpInfo, SDValue()); 7709bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng 7719ec8095485c994522c9a50e16fc029de94c20476Eli Friedman if (OpInfo.ConstraintType == TargetLowering::C_Memory && 7729ec8095485c994522c9a50e16fc029de94c20476Eli Friedman OpInfo.isIndirect) { 7739bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng Value *OpVal = OpInfo.CallOperandVal; 77488a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner MadeChange |= OptimizeMemoryInst(I, OpVal, OpVal->getType(), SunkAddrs); 7759bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng } 7769bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng } 7779bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng 7789bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng return MadeChange; 7799bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng} 7809bf12b5583104c810cfadcdce91edf9efad79973Evan Cheng 781b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman/// MoveExtToFormExtLoad - Move a zext or sext fed by a load into the same 782b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman/// basic block as the load, unless conditions are unfavorable. This allows 783b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman/// SelectionDAG to fold the extend into the load. 784b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman/// 785b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohmanbool CodeGenPrepare::MoveExtToFormExtLoad(Instruction *I) { 786b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman // Look for a load being extended. 787b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman LoadInst *LI = dyn_cast<LoadInst>(I->getOperand(0)); 788b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman if (!LI) return false; 789b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman 790b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman // If they're already in the same block, there's nothing to do. 791b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman if (LI->getParent() == I->getParent()) 792b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman return false; 793b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman 794b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman // If the load has other users and the truncate is not free, this probably 795b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman // isn't worthwhile. 796b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman if (!LI->hasOneUse() && 797b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman TLI && !TLI->isTruncateFree(I->getType(), LI->getType())) 798b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman return false; 799b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman 800b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman // Check whether the target supports casts folded into loads. 801b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman unsigned LType; 802b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman if (isa<ZExtInst>(I)) 803b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman LType = ISD::ZEXTLOAD; 804b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman else { 805b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman assert(isa<SExtInst>(I) && "Unexpected ext type!"); 806b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman LType = ISD::SEXTLOAD; 807b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman } 808b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman if (TLI && !TLI->isLoadExtLegal(LType, TLI->getValueType(LI->getType()))) 809b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman return false; 810b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman 811b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman // Move the extend into the same block as the load, so that SelectionDAG 812b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman // can fold it. 813b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman I->removeFromParent(); 814b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman I->insertAfter(LI); 815b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman return true; 816b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman} 817b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman 818bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Chengbool CodeGenPrepare::OptimizeExtUses(Instruction *I) { 819bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng BasicBlock *DefBB = I->getParent(); 820bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 821bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng // If both result of the {s|z}xt and its source are live out, rewrite all 822bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng // other uses of the source with result of extension. 823bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng Value *Src = I->getOperand(0); 824bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng if (Src->hasOneUse()) 825bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng return false; 826bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 827696e5c047bd06bf6b7b5471b3f4dec319b43628bEvan Cheng // Only do this xform if truncating is free. 82853bdbd756581a9a1d6d381059f103c5f3c687bb6Gabor Greif if (TLI && !TLI->isTruncateFree(I->getType(), Src->getType())) 829f9785f92b630e69262c395b2fc0893451169d68bEvan Cheng return false; 830f9785f92b630e69262c395b2fc0893451169d68bEvan Cheng 831772de516b6851e679d3da9e5171712b9c3122019Evan Cheng // Only safe to perform the optimization if the source is also defined in 832765dff258545f019502023045b471443ff9ef6c4Evan Cheng // this block. 833765dff258545f019502023045b471443ff9ef6c4Evan Cheng if (!isa<Instruction>(Src) || DefBB != cast<Instruction>(Src)->getParent()) 834772de516b6851e679d3da9e5171712b9c3122019Evan Cheng return false; 835772de516b6851e679d3da9e5171712b9c3122019Evan Cheng 836bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng bool DefIsLiveOut = false; 837692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); 838bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng UI != E; ++UI) { 839bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng Instruction *User = cast<Instruction>(*UI); 840bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 841bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng // Figure out which BB this ext is used in. 842bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng BasicBlock *UserBB = User->getParent(); 843bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng if (UserBB == DefBB) continue; 844bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng DefIsLiveOut = true; 845bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng break; 846bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng } 847bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng if (!DefIsLiveOut) 848bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng return false; 849bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 850765dff258545f019502023045b471443ff9ef6c4Evan Cheng // Make sure non of the uses are PHI nodes. 851692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher for (Value::use_iterator UI = Src->use_begin(), E = Src->use_end(); 852765dff258545f019502023045b471443ff9ef6c4Evan Cheng UI != E; ++UI) { 853765dff258545f019502023045b471443ff9ef6c4Evan Cheng Instruction *User = cast<Instruction>(*UI); 854f9785f92b630e69262c395b2fc0893451169d68bEvan Cheng BasicBlock *UserBB = User->getParent(); 855f9785f92b630e69262c395b2fc0893451169d68bEvan Cheng if (UserBB == DefBB) continue; 856f9785f92b630e69262c395b2fc0893451169d68bEvan Cheng // Be conservative. We don't want this xform to end up introducing 857f9785f92b630e69262c395b2fc0893451169d68bEvan Cheng // reloads just before load / store instructions. 858f9785f92b630e69262c395b2fc0893451169d68bEvan Cheng if (isa<PHINode>(User) || isa<LoadInst>(User) || isa<StoreInst>(User)) 859765dff258545f019502023045b471443ff9ef6c4Evan Cheng return false; 860765dff258545f019502023045b471443ff9ef6c4Evan Cheng } 861765dff258545f019502023045b471443ff9ef6c4Evan Cheng 862bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng // InsertedTruncs - Only insert one trunc in each block once. 863bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng DenseMap<BasicBlock*, Instruction*> InsertedTruncs; 864bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 865bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng bool MadeChange = false; 866692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher for (Value::use_iterator UI = Src->use_begin(), E = Src->use_end(); 867bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng UI != E; ++UI) { 868bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng Use &TheUse = UI.getUse(); 869bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng Instruction *User = cast<Instruction>(*UI); 870bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 871bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng // Figure out which BB this ext is used in. 872bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng BasicBlock *UserBB = User->getParent(); 873bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng if (UserBB == DefBB) continue; 874bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 875bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng // Both src and def are live in this block. Rewrite the use. 876bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng Instruction *&InsertedTrunc = InsertedTruncs[UserBB]; 877bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 878bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng if (!InsertedTrunc) { 87902dea8b39f3acad5de1df36273444d149145e7fcDan Gohman BasicBlock::iterator InsertPt = UserBB->getFirstNonPHI(); 880692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 881bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng InsertedTrunc = new TruncInst(I, Src->getType(), "", InsertPt); 882bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng } 883bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 884bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng // Replace a use of the {s|z}ext source with a use of the result. 885bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng TheUse = InsertedTrunc; 886bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 887bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng MadeChange = true; 888bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng } 889bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 890bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng return MadeChange; 891bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng} 892bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 893dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner// In this pass we look for GEP and cast instructions that are used 894dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner// across basic blocks and rewrite them to improve basic-block-at-a-time 895dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner// selection. 896dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattnerbool CodeGenPrepare::OptimizeBlock(BasicBlock &BB) { 897dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner bool MadeChange = false; 898692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 899ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng // Split all critical edges where the dest block has a PHI. 900e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng if (CriticalEdgeSplit) { 901e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng TerminatorInst *BBTI = BB.getTerminator(); 902e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng if (BBTI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(BBTI)) { 903e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng for (unsigned i = 0, e = BBTI->getNumSuccessors(); i != e; ++i) { 904e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng BasicBlock *SuccBB = BBTI->getSuccessor(i); 905e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng if (isa<PHINode>(SuccBB->begin()) && isCriticalEdge(BBTI, i, true)) 906e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng SplitEdgeNicely(BBTI, i, BackEdges, this); 907e1bcb440dc0ca3c41fda1c0c581abfc4f38ca170Evan Cheng } 908ab63152871f4144050d0a58d592a95e089fe40d4Evan Cheng } 909dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner } 910692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 911dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // Keep track of non-local addresses that have been sunk into this block. 912dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // This allows us to avoid inserting duplicate code for blocks with multiple 913dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // load/stores of the same address. 914dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner DenseMap<Value*, Value*> SunkAddrs; 915692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 916dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner for (BasicBlock::iterator BBI = BB.begin(), E = BB.end(); BBI != E; ) { 917dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner Instruction *I = BBI++; 918692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 919dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (CastInst *CI = dyn_cast<CastInst>(I)) { 920dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // If the source of the cast is a constant, then this should have 921dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // already been constant folded. The only reason NOT to constant fold 922dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // it is if something (e.g. LSR) was careful to place the constant 923dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // evaluation in a block other than then one that uses it (e.g. to hoist 924dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // the address of globals out of a loop). If this is the case, we don't 925dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner // want to forward-subst the cast. 926dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner if (isa<Constant>(CI->getOperand(0))) 927dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner continue; 928692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 929bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng bool Change = false; 930bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng if (TLI) { 931bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng Change = OptimizeNoopCopyExpression(CI, *TLI); 932bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng MadeChange |= Change; 933bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng } 934bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng 935b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman if (!Change && (isa<ZExtInst>(I) || isa<SExtInst>(I))) { 936b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman MadeChange |= MoveExtToFormExtLoad(I); 937bdcb726fcad1e3fddc70847a2b91d4d4f9396938Evan Cheng MadeChange |= OptimizeExtUses(I); 938b00f236b03ea57520f94823780896ebdbc5d8bdcDan Gohman } 939ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen } else if (CmpInst *CI = dyn_cast<CmpInst>(I)) { 940ce0b23721e434789f9600c0fd13f0ca17444264fDale Johannesen MadeChange |= OptimizeCmpExpression(CI); 941dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } else if (LoadInst *LI = dyn_cast<LoadInst>(I)) { 942dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (TLI) 94388a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner MadeChange |= OptimizeMemoryInst(I, I->getOperand(0), LI->getType(), 94488a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner SunkAddrs); 945dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } else if (StoreInst *SI = dyn_cast<StoreInst>(I)) { 946dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner if (TLI) 94788a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner MadeChange |= OptimizeMemoryInst(I, SI->getOperand(1), 94888a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner SI->getOperand(0)->getType(), 94988a5c832ac71eb31d2b1bc143817af9248f4c549Chris Lattner SunkAddrs); 950dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } else if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) { 951f25646bfb375b614cddcc8b6fda2b524feae1efaChris Lattner if (GEPI->hasAllZeroIndices()) { 952dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner /// The GEP operand must be a pointer, so must its result -> BitCast 953692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher Instruction *NC = new BitCastInst(GEPI->getOperand(0), GEPI->getType(), 954dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner GEPI->getName(), GEPI); 955dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner GEPI->replaceAllUsesWith(NC); 956dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner GEPI->eraseFromParent(); 957dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner MadeChange = true; 958dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner BBI = NC; 959dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } 960dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner } else if (CallInst *CI = dyn_cast<CallInst>(I)) { 961dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // If we found an inline asm expession, and if the target knows how to 962dd77df3cbc2301c14f56c9d2cfd412a032c27241Chris Lattner // lower it to normal LLVM code, do so now. 9638850b36d0fdd2ddde3cc409a8496ace544e42185Chris Lattner if (TLI && isa<InlineAsm>(CI->getCalledValue())) { 9648850b36d0fdd2ddde3cc409a8496ace544e42185Chris Lattner if (TLI->ExpandInlineAsm(CI)) { 9658850b36d0fdd2ddde3cc409a8496ace544e42185Chris Lattner BBI = BB.begin(); 9668850b36d0fdd2ddde3cc409a8496ace544e42185Chris Lattner // Avoid processing instructions out of order, which could cause 9678850b36d0fdd2ddde3cc409a8496ace544e42185Chris Lattner // reuse before a value is defined. 9688850b36d0fdd2ddde3cc409a8496ace544e42185Chris Lattner SunkAddrs.clear(); 9698850b36d0fdd2ddde3cc409a8496ace544e42185Chris Lattner } else 9708850b36d0fdd2ddde3cc409a8496ace544e42185Chris Lattner // Sink address computing for memory operands into the block. 9718850b36d0fdd2ddde3cc409a8496ace544e42185Chris Lattner MadeChange |= OptimizeInlineAsmInst(I, &(*CI), SunkAddrs); 972040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher } else { 973040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher // Other CallInst optimizations that don't need to muck with the 974040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher // enclosing iterator here. 975040056fd11693ffc41ce9b777281c71705d0dc1fEric Christopher MadeChange |= OptimizeCallInst(CI); 9768850b36d0fdd2ddde3cc409a8496ace544e42185Chris Lattner } 977dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner } 978dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner } 979692bf6b85e0eaed549cd47d67289ab7b28e32651Eric Christopher 980dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner return MadeChange; 981dbe0deca339585dfbaed5951ef0ca2c6a0df173cChris Lattner} 982