Local.h revision 3333e668221f52f8c708df0037ee9c4bf2417929
148486893f46d2e12e926682a3ecb908716bc66c4Chris Lattner//===-- Local.h - Functions to perform local transformations ----*- C++ -*-===// 234695381d626485a560594f162701088079589dfMisha Brukman// 36fbcc26f1460eaee4e0eb8b426fc1ff0c7af11beJohn Criswell// The LLVM Compiler Infrastructure 46fbcc26f1460eaee4e0eb8b426fc1ff0c7af11beJohn Criswell// 57ed47a13356daed2a34cd2209a31f92552e3bdd8Chris Lattner// This file is distributed under the University of Illinois Open Source 67ed47a13356daed2a34cd2209a31f92552e3bdd8Chris Lattner// License. See LICENSE.TXT for details. 734695381d626485a560594f162701088079589dfMisha Brukman// 86fbcc26f1460eaee4e0eb8b426fc1ff0c7af11beJohn Criswell//===----------------------------------------------------------------------===// 9148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner// 10148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner// This family of functions perform various local transformations to the 11148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner// program. 12148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner// 13148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner//===----------------------------------------------------------------------===// 14148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner 15148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner#ifndef LLVM_TRANSFORMS_UTILS_LOCAL_H 16148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner#define LLVM_TRANSFORMS_UTILS_LOCAL_H 17148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner 18255f89faee13dc491cb64fbeae3c763e7e2ea4e6Chandler Carruth#include "llvm/DataLayout.h" 1906cb8ed00696eb14d1b831921452e50ec0568ea2Chandler Carruth#include "llvm/IRBuilder.h" 2006cb8ed00696eb14d1b831921452e50ec0568ea2Chandler Carruth#include "llvm/Operator.h" 215c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes#include "llvm/Support/GetElementPtrTypeIterator.h" 225c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes 23d0fde30ce850b78371fd1386338350591f9ff494Brian Gaekenamespace llvm { 24d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 25c79e1182470ed12f1f3d0d35c1725366519a9af7Devang Patelclass User; 26d68a07650cdb2e18f18f362ba533459aa10e01b6Dan Gohmanclass BasicBlock; 27813c9a0f19c0d27085a3ea81eb44033747007741Devang Patelclass Function; 284b35f83b91a1a313f0730c600e5178aaf7df98d6Dan Gohmanclass BranchInst; 29d68a07650cdb2e18f18f362ba533459aa10e01b6Dan Gohmanclass Instruction; 305ee20680c7ebc765950983633e19fafab5235245Devang Patelclass DbgDeclareInst; 315ee20680c7ebc765950983633e19fafab5235245Devang Patelclass StoreInst; 3236fae67831517f132255118b45b21a8cf199a012Devang Patelclass LoadInst; 33d68a07650cdb2e18f18f362ba533459aa10e01b6Dan Gohmanclass Value; 343e57cb98bde04a65623493738d51f2a41e601748Chris Lattnerclass Pass; 35abbc2dd77908f146f73f4cd1abfdfe47faacf43dChris Lattnerclass PHINode; 36cbf99ee973b6c6e6cd9537dae12031382783bc61Chris Lattnerclass AllocaInst; 37c5406b55d58b7378822d5f6316bf253ad0eaa82dChris Lattnerclass ConstantExpr; 383574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmowclass DataLayout; 398e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramerclass TargetLibraryInfo; 4004d7d13d301df66f6c232e41611145c062183bf3Hans Wennborgclass TargetTransformInfo; 415ee20680c7ebc765950983633e19fafab5235245Devang Patelclass DIBuilder; 42d68a07650cdb2e18f18f362ba533459aa10e01b6Dan Gohman 43d68a07650cdb2e18f18f362ba533459aa10e01b6Dan Gohmantemplate<typename T> class SmallVectorImpl; 444f02c74a8ec8f4ca83b823146cb9c987ed79b3f6Chris Lattner 45148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner//===----------------------------------------------------------------------===// 463481f24c06b3c9de48bdd99c37547471ca8e761eChris Lattner// Local constant propagation. 47148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner// 48148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner 493e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// ConstantFoldTerminator - If a terminator instruction is predicated on a 503e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// constant value, convert it into an unconditional branch to the constant 513e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// destination. This is a nontrivial operation because the successors of this 523e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// basic block must have their PHI nodes updated. 535649ba70fb39f2fda4791d255ae8bb373071874fFrits van Bommel/// Also calls RecursivelyDeleteTriviallyDeadInstructions() on any branch/switch 545649ba70fb39f2fda4791d255ae8bb373071874fFrits van Bommel/// conditions and indirectbr addresses this might make dead if 555649ba70fb39f2fda4791d255ae8bb373071874fFrits van Bommel/// DeleteDeadConditions is true. 568e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramerbool ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions = false, 578e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramer const TargetLibraryInfo *TLI = 0); 58148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner 59148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner//===----------------------------------------------------------------------===// 603481f24c06b3c9de48bdd99c37547471ca8e761eChris Lattner// Local dead code elimination. 61148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner// 62148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner 633e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// isInstructionTriviallyDead - Return true if the result produced by the 643e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// instruction is not used, and the instruction has no side effects. 653e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// 668e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramerbool isInstructionTriviallyDead(Instruction *I, const TargetLibraryInfo *TLI=0); 67148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner 683481f24c06b3c9de48bdd99c37547471ca8e761eChris Lattner/// RecursivelyDeleteTriviallyDeadInstructions - If the specified value is a 693481f24c06b3c9de48bdd99c37547471ca8e761eChris Lattner/// trivially dead instruction, delete it. If that makes any of its operands 7090fe0bd68cdbeb980c08628c4992dffad0dc728fDan Gohman/// trivially dead, delete them too, recursively. Return true if any 7190fe0bd68cdbeb980c08628c4992dffad0dc728fDan Gohman/// instructions were deleted. 728e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramerbool RecursivelyDeleteTriviallyDeadInstructions(Value *V, 738e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramer const TargetLibraryInfo *TLI=0); 74afc36a9520971832dfbebc0333593bf5d3098296Dan Gohman 75afc36a9520971832dfbebc0333593bf5d3098296Dan Gohman/// RecursivelyDeleteDeadPHINode - If the specified value is an effectively 76afc36a9520971832dfbebc0333593bf5d3098296Dan Gohman/// dead PHI node, due to being a def-use chain of single-use nodes that 77afc36a9520971832dfbebc0333593bf5d3098296Dan Gohman/// either forms a cycle or is terminated by a trivially dead instruction, 78afc36a9520971832dfbebc0333593bf5d3098296Dan Gohman/// delete it. If that makes any of its operands trivially dead, delete them 792cfbf018a938d14126b9cb10c600e025f9831d2dDuncan Sands/// too, recursively. Return true if a change was made. 808e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramerbool RecursivelyDeleteDeadPHINode(PHINode *PN, const TargetLibraryInfo *TLI=0); 81afc36a9520971832dfbebc0333593bf5d3098296Dan Gohman 82e234a30a282f1aaec4aa63460fe8bba6416832a8Chris Lattner 83e234a30a282f1aaec4aa63460fe8bba6416832a8Chris Lattner/// SimplifyInstructionsInBlock - Scan the specified basic block and try to 84e234a30a282f1aaec4aa63460fe8bba6416832a8Chris Lattner/// simplify any instructions in it and recursively delete dead instructions. 85e234a30a282f1aaec4aa63460fe8bba6416832a8Chris Lattner/// 86e234a30a282f1aaec4aa63460fe8bba6416832a8Chris Lattner/// This returns true if it changed the code, note that it can delete 87e234a30a282f1aaec4aa63460fe8bba6416832a8Chris Lattner/// instructions in other blocks as well in this block. 883574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmowbool SimplifyInstructionsInBlock(BasicBlock *BB, const DataLayout *TD = 0, 898e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramer const TargetLibraryInfo *TLI = 0); 90e234a30a282f1aaec4aa63460fe8bba6416832a8Chris Lattner 91abbc2dd77908f146f73f4cd1abfdfe47faacf43dChris Lattner//===----------------------------------------------------------------------===// 9229874e0dc6c4e55bc384611273343bb358982cc3Chris Lattner// Control Flow Graph Restructuring. 93148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner// 94148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner 9540d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// RemovePredecessorAndSimplify - Like BasicBlock::removePredecessor, this 9640d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// method is called when we're about to delete Pred as a predecessor of BB. If 9740d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// BB contains any PHI nodes, this drops the entries in the PHI nodes for Pred. 9840d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// 9940d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// Unlike the removePredecessor method, this attempts to simplify uses of PHI 10040d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// nodes that collapse into identity values. For example, if we have: 10140d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// x = phi(1, 0, 0, 0) 10240d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// y = and x, z 10340d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// 10440d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// .. and delete the predecessor corresponding to the '1', this will attempt to 10540d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner/// recursively fold the 'and' to 0. 10640d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattnervoid RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred, 1073574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow DataLayout *TD = 0); 10840d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner 10940d8c28b27377199b7465ba2c5a2c59c6fd12fa9Chris Lattner 110b29714a10af94b6daae437e48a82ae32675f79cbChris Lattner/// MergeBasicBlockIntoOnlyPred - BB is a block with one predecessor and its 111b29714a10af94b6daae437e48a82ae32675f79cbChris Lattner/// predecessor is known to have one successor (BB!). Eliminate the edge 112b29714a10af94b6daae437e48a82ae32675f79cbChris Lattner/// between them, moving the instructions in the predecessor into BB. This 113b29714a10af94b6daae437e48a82ae32675f79cbChris Lattner/// deletes the predecessor block. 114b29714a10af94b6daae437e48a82ae32675f79cbChris Lattner/// 115ad80981a106c9d0ec83351e63ee3ac75ed646bf4Andreas Neustiftervoid MergeBasicBlockIntoOnlyPred(BasicBlock *BB, Pass *P = 0); 116b29714a10af94b6daae437e48a82ae32675f79cbChris Lattner 117dce94d92df77da125a1c1256a9294db891a9db9cChris Lattner 118dce94d92df77da125a1c1256a9294db891a9db9cChris Lattner/// TryToSimplifyUncondBranchFromEmptyBlock - BB is known to contain an 119dce94d92df77da125a1c1256a9294db891a9db9cChris Lattner/// unconditional branch, and contains no instructions other than PHI nodes, 120dce94d92df77da125a1c1256a9294db891a9db9cChris Lattner/// potential debug intrinsics and the branch. If possible, eliminate BB by 121dce94d92df77da125a1c1256a9294db891a9db9cChris Lattner/// rewriting all the predecessors to branch to the successor block and return 122dce94d92df77da125a1c1256a9294db891a9db9cChris Lattner/// true. If we can't transform, return false. 123dce94d92df77da125a1c1256a9294db891a9db9cChris Lattnerbool TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB); 12420f4d34fe3609cda8b70956a36080e9cbcd327d4Jim Grosbach 12520f4d34fe3609cda8b70956a36080e9cbcd327d4Jim Grosbach/// EliminateDuplicatePHINodes - Check for and eliminate duplicate PHI 12620f4d34fe3609cda8b70956a36080e9cbcd327d4Jim Grosbach/// nodes in this block. This doesn't try to be clever about PHI nodes 12720f4d34fe3609cda8b70956a36080e9cbcd327d4Jim Grosbach/// which differ only in the order of the incoming values, but instcombine 12820f4d34fe3609cda8b70956a36080e9cbcd327d4Jim Grosbach/// orders them so it usually won't matter. 12920f4d34fe3609cda8b70956a36080e9cbcd327d4Jim Grosbach/// 13020f4d34fe3609cda8b70956a36080e9cbcd327d4Jim Grosbachbool EliminateDuplicatePHINodes(BasicBlock *BB); 13120f4d34fe3609cda8b70956a36080e9cbcd327d4Jim Grosbach 1323e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// SimplifyCFG - This function is used to do simplification of a CFG. For 1333e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// example, it adjusts branches to branches to eliminate the extra hop, it 1343e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// eliminates unreachable basic blocks, and does other "peephole" optimization 1353e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// of the CFG. It returns true if a modification was made, possibly deleting 1363e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// the basic block that was pointed to. 1373e57cb98bde04a65623493738d51f2a41e601748Chris Lattner/// 13804d7d13d301df66f6c232e41611145c062183bf3Hans Wennborgbool SimplifyCFG(BasicBlock *BB, const DataLayout *TD = 0, 13904d7d13d301df66f6c232e41611145c062183bf3Hans Wennborg const TargetTransformInfo *TTI = 0); 140148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner 1414b35f83b91a1a313f0730c600e5178aaf7df98d6Dan Gohman/// FoldBranchToCommonDest - If this basic block is ONLY a setcc and a branch, 1424b35f83b91a1a313f0730c600e5178aaf7df98d6Dan Gohman/// and if a predecessor branches to us and one of our successors, fold the 1434b35f83b91a1a313f0730c600e5178aaf7df98d6Dan Gohman/// setcc into the predecessor and use logical operations to pick the right 1444b35f83b91a1a313f0730c600e5178aaf7df98d6Dan Gohman/// destination. 1454b35f83b91a1a313f0730c600e5178aaf7df98d6Dan Gohmanbool FoldBranchToCommonDest(BranchInst *BI); 1464b35f83b91a1a313f0730c600e5178aaf7df98d6Dan Gohman 147cbf99ee973b6c6e6cd9537dae12031382783bc61Chris Lattner/// DemoteRegToStack - This function takes a virtual register computed by an 1488f71b63bead24de7acc6fe7f0487bf56da22d745Chris Lattner/// Instruction and replaces it with a slot in the stack frame, allocated via 149cbf99ee973b6c6e6cd9537dae12031382783bc61Chris Lattner/// alloca. This allows the CFG to be changed around without fear of 150cbf99ee973b6c6e6cd9537dae12031382783bc61Chris Lattner/// invalidating the SSA information for the value. It returns the pointer to 151cbf99ee973b6c6e6cd9537dae12031382783bc61Chris Lattner/// the alloca inserted to create a stack slot for X. 152cbf99ee973b6c6e6cd9537dae12031382783bc61Chris Lattner/// 15350dead06ffc107edb7e84857baaeeb09039c631cOwen AndersonAllocaInst *DemoteRegToStack(Instruction &X, 1549adc0abad3c3ed40a268ccbcee0c74cb9e1359feOwen Anderson bool VolatileLoads = false, 155d68a07650cdb2e18f18f362ba533459aa10e01b6Dan Gohman Instruction *AllocaPoint = 0); 156cbf99ee973b6c6e6cd9537dae12031382783bc61Chris Lattner 15708d14d2469c4f0465f610a204353220ee2ccde9cTanya Lattner/// DemotePHIToStack - This function takes a virtual register computed by a phi 15808d14d2469c4f0465f610a204353220ee2ccde9cTanya Lattner/// node and replaces it with a slot in the stack frame, allocated via alloca. 15908d14d2469c4f0465f610a204353220ee2ccde9cTanya Lattner/// The phi node is deleted and it returns the pointer to the alloca inserted. 16050dead06ffc107edb7e84857baaeeb09039c631cOwen AndersonAllocaInst *DemotePHIToStack(PHINode *P, Instruction *AllocaPoint = 0); 16108d14d2469c4f0465f610a204353220ee2ccde9cTanya Lattner 162687140c818ba4b896329a83324714140b6580ef8Chris Lattner/// getOrEnforceKnownAlignment - If the specified pointer has an alignment that 163687140c818ba4b896329a83324714140b6580ef8Chris Lattner/// we can determine, return it, otherwise return 0. If PrefAlign is specified, 164687140c818ba4b896329a83324714140b6580ef8Chris Lattner/// and it is more than the alignment of the ultimate object, see if we can 165687140c818ba4b896329a83324714140b6580ef8Chris Lattner/// increase the alignment of the ultimate object, making this check succeed. 166687140c818ba4b896329a83324714140b6580ef8Chris Lattnerunsigned getOrEnforceKnownAlignment(Value *V, unsigned PrefAlign, 1673574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow const DataLayout *TD = 0); 168687140c818ba4b896329a83324714140b6580ef8Chris Lattner 169687140c818ba4b896329a83324714140b6580ef8Chris Lattner/// getKnownAlignment - Try to infer an alignment for the specified pointer. 1703574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmowstatic inline unsigned getKnownAlignment(Value *V, const DataLayout *TD = 0) { 171687140c818ba4b896329a83324714140b6580ef8Chris Lattner return getOrEnforceKnownAlignment(V, 0, TD); 172687140c818ba4b896329a83324714140b6580ef8Chris Lattner} 173687140c818ba4b896329a83324714140b6580ef8Chris Lattner 1745c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes/// EmitGEPOffset - Given a getelementptr instruction/constantexpr, emit the 1755c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes/// code necessary to compute the offset from the base pointer (without adding 1765c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes/// in the base pointer). Return the result as a signed integer of intptr size. 177c606c3ff911eddcbf8bab95e67c7d8c1f69a493eNuno Lopes/// When NoAssumptions is true, no assumptions about index computation not 178c606c3ff911eddcbf8bab95e67c7d8c1f69a493eNuno Lopes/// overflowing is made. 1795c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopestemplate<typename IRBuilderTy> 1803574eca1b02600bac4e625297f4ecf745f4c4f32Micah VillmowValue *EmitGEPOffset(IRBuilderTy *Builder, const DataLayout &TD, User *GEP, 181c606c3ff911eddcbf8bab95e67c7d8c1f69a493eNuno Lopes bool NoAssumptions = false) { 1825c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes gep_type_iterator GTI = gep_type_begin(GEP); 183ece6c6bb6329748b92403c06ac87f45c43485911Chandler Carruth Type *IntPtrTy = TD.getIntPtrType(GEP->getContext()); 1845c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Value *Result = Constant::getNullValue(IntPtrTy); 1855c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes 1865c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes // If the GEP is inbounds, we know that none of the addressing operations will 1875c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes // overflow in an unsigned sense. 188c606c3ff911eddcbf8bab95e67c7d8c1f69a493eNuno Lopes bool isInBounds = cast<GEPOperator>(GEP)->isInBounds() && !NoAssumptions; 1895c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes 1905c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes // Build a mask for high order bits. 191426c2bf5cdd2173e4a33aea8cb92cf684a724f4bChandler Carruth unsigned IntPtrWidth = TD.getPointerSizeInBits(); 1925c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth); 1935c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes 1945c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes for (User::op_iterator i = GEP->op_begin() + 1, e = GEP->op_end(); i != e; 1955c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes ++i, ++GTI) { 1965c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Value *Op = *i; 1975c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes uint64_t Size = TD.getTypeAllocSize(GTI.getIndexedType()) & PtrSizeMask; 1985c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes if (ConstantInt *OpC = dyn_cast<ConstantInt>(Op)) { 1995c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes if (OpC->isZero()) continue; 2005c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes 2015c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes // Handle a struct index, which adds its field offset to the pointer. 2025c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes if (StructType *STy = dyn_cast<StructType>(*GTI)) { 2035c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Size = TD.getStructLayout(STy)->getElementOffset(OpC->getZExtValue()); 2045c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes 2055c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes if (Size) 2065c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Result = Builder->CreateAdd(Result, ConstantInt::get(IntPtrTy, Size), 2075c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes GEP->getName()+".offs"); 2085c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes continue; 2095c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes } 2105c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes 2115c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Constant *Scale = ConstantInt::get(IntPtrTy, Size); 2125c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Constant *OC = ConstantExpr::getIntegerCast(OpC, IntPtrTy, true /*SExt*/); 2135c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Scale = ConstantExpr::getMul(OC, Scale, isInBounds/*NUW*/); 2145c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes // Emit an add instruction. 2155c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Result = Builder->CreateAdd(Result, Scale, GEP->getName()+".offs"); 2165c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes continue; 2175c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes } 2185c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes // Convert to correct type. 2195c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes if (Op->getType() != IntPtrTy) 2205c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Op = Builder->CreateIntCast(Op, IntPtrTy, true, Op->getName()+".c"); 2215c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes if (Size != 1) { 2225c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes // We'll let instcombine(mul) convert this to a shl if possible. 2235c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Op = Builder->CreateMul(Op, ConstantInt::get(IntPtrTy, Size), 2245c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes GEP->getName()+".idx", isInBounds /*NUW*/); 2255c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes } 2265c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes 2275c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes // Emit an add instruction. 2285c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes Result = Builder->CreateAdd(Op, Result, GEP->getName()+".offs"); 2295c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes } 2305c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes return Result; 2315c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes} 2325c525b59d5e0036a778d278eeff4832edfd41357Nuno Lopes 2335ee20680c7ebc765950983633e19fafab5235245Devang Patel///===---------------------------------------------------------------------===// 2345ee20680c7ebc765950983633e19fafab5235245Devang Patel/// Dbg Intrinsic utilities 2355ee20680c7ebc765950983633e19fafab5235245Devang Patel/// 2365ee20680c7ebc765950983633e19fafab5235245Devang Patel 2375ee20680c7ebc765950983633e19fafab5235245Devang Patel/// Inserts a llvm.dbg.value instrinsic before the stores to an alloca'd value 2385ee20680c7ebc765950983633e19fafab5235245Devang Patel/// that has an associated llvm.dbg.decl intrinsic. 2395ee20680c7ebc765950983633e19fafab5235245Devang Patelbool ConvertDebugDeclareToDebugValue(DbgDeclareInst *DDI, 2405ee20680c7ebc765950983633e19fafab5235245Devang Patel StoreInst *SI, DIBuilder &Builder); 2415ee20680c7ebc765950983633e19fafab5235245Devang Patel 24236fae67831517f132255118b45b21a8cf199a012Devang Patel/// Inserts a llvm.dbg.value instrinsic before the stores to an alloca'd value 24336fae67831517f132255118b45b21a8cf199a012Devang Patel/// that has an associated llvm.dbg.decl intrinsic. 24436fae67831517f132255118b45b21a8cf199a012Devang Patelbool ConvertDebugDeclareToDebugValue(DbgDeclareInst *DDI, 24536fae67831517f132255118b45b21a8cf199a012Devang Patel LoadInst *LI, DIBuilder &Builder); 24636fae67831517f132255118b45b21a8cf199a012Devang Patel 247813c9a0f19c0d27085a3ea81eb44033747007741Devang Patel/// LowerDbgDeclare - Lowers llvm.dbg.declare intrinsics into appropriate set 248813c9a0f19c0d27085a3ea81eb44033747007741Devang Patel/// of llvm.dbg.value intrinsics. 249813c9a0f19c0d27085a3ea81eb44033747007741Devang Patelbool LowerDbgDeclare(Function &F); 250813c9a0f19c0d27085a3ea81eb44033747007741Devang Patel 251c827939046670a9800659b83e2048f1d3a79a531Cameron Zwarich/// FindAllocaDbgDeclare - Finds the llvm.dbg.declare intrinsic corresponding to 252c827939046670a9800659b83e2048f1d3a79a531Cameron Zwarich/// an alloca, if any. 253c827939046670a9800659b83e2048f1d3a79a531Cameron ZwarichDbgDeclareInst *FindAllocaDbgDeclare(Value *V); 254c827939046670a9800659b83e2048f1d3a79a531Cameron Zwarich 2551afbb517965e29b07cb42e2335d5eadd87de6535Alexey Samsonov/// replaceDbgDeclareForAlloca - Replaces llvm.dbg.declare instruction when 2561afbb517965e29b07cb42e2335d5eadd87de6535Alexey Samsonov/// alloca is replaced with a new value. 2571afbb517965e29b07cb42e2335d5eadd87de6535Alexey Samsonovbool replaceDbgDeclareForAlloca(AllocaInst *AI, Value *NewAllocaAddress, 2581afbb517965e29b07cb42e2335d5eadd87de6535Alexey Samsonov DIBuilder &Builder); 2591afbb517965e29b07cb42e2335d5eadd87de6535Alexey Samsonov 2603333e668221f52f8c708df0037ee9c4bf2417929Evgeniy Stepanov/// \brief Remove all blocks that can not be reached from the function's entry. 2613333e668221f52f8c708df0037ee9c4bf2417929Evgeniy Stepanov/// 2623333e668221f52f8c708df0037ee9c4bf2417929Evgeniy Stepanov/// Returns true if any basic block was removed. 2633333e668221f52f8c708df0037ee9c4bf2417929Evgeniy Stepanovbool removeUnreachableBlocks(Function &F); 2643333e668221f52f8c708df0037ee9c4bf2417929Evgeniy Stepanov 265d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke} // End llvm namespace 266d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 267148a0bfcea5d3267eac02613cfcc8b5fe8894f2cChris Lattner#endif 268