1 //===- CodeGenPrepare.cpp - Prepare a function for code generation --------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass munges the code in the input function to better prepare it for
11 // SelectionDAG-based code generation. This works around limitations in it's
12 // basic-block-at-a-time approach. It should eventually be removed.
14 //===----------------------------------------------------------------------===//
16 #define DEBUG_TYPE "codegenprepare"
17 #include "llvm/Transforms/Scalar.h"
18 #include "llvm/Constants.h"
19 #include "llvm/DerivedTypes.h"
20 #include "llvm/Function.h"
21 #include "llvm/InlineAsm.h"
22 #include "llvm/Instructions.h"
23 #include "llvm/Pass.h"
24 #include "llvm/Target/TargetAsmInfo.h"
25 #include "llvm/Target/TargetData.h"
26 #include "llvm/Target/TargetLowering.h"
27 #include "llvm/Target/TargetMachine.h"
28 #include "llvm/Transforms/Utils/AddrModeMatcher.h"
29 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
30 #include "llvm/Transforms/Utils/Local.h"
31 #include "llvm/ADT/DenseMap.h"
32 #include "llvm/ADT/SmallSet.h"
33 #include "llvm/Assembly/Writer.h"
34 #include "llvm/Support/CallSite.h"
35 #include "llvm/Support/CommandLine.h"
36 #include "llvm/Support/Compiler.h"
37 #include "llvm/Support/Debug.h"
38 #include "llvm/Support/GetElementPtrTypeIterator.h"
39 #include "llvm/Support/PatternMatch.h"
41 using namespace llvm::PatternMatch;
43 static cl::opt<bool> FactorCommonPreds("split-critical-paths-tweak",
44 cl::init(false), cl::Hidden);
47 class VISIBILITY_HIDDEN CodeGenPrepare : public FunctionPass {
48 /// TLI - Keep a pointer of a TargetLowering to consult for determining
49 /// transformation profitability.
50 const TargetLowering *TLI;
52 /// BackEdges - Keep a set of all the loop back edges.
54 SmallSet<std::pair<BasicBlock*,BasicBlock*>, 8> BackEdges;
56 static char ID; // Pass identification, replacement for typeid
57 explicit CodeGenPrepare(const TargetLowering *tli = 0)
58 : FunctionPass(&ID), TLI(tli) {}
59 bool runOnFunction(Function &F);
62 bool EliminateMostlyEmptyBlocks(Function &F);
63 bool CanMergeBlocks(const BasicBlock *BB, const BasicBlock *DestBB) const;
64 void EliminateMostlyEmptyBlock(BasicBlock *BB);
65 bool OptimizeBlock(BasicBlock &BB);
66 bool OptimizeMemoryInst(Instruction *I, Value *Addr, const Type *AccessTy,
67 DenseMap<Value*,Value*> &SunkAddrs);
68 bool OptimizeInlineAsmInst(Instruction *I, CallSite CS,
69 DenseMap<Value*,Value*> &SunkAddrs);
70 bool OptimizeExtUses(Instruction *I);
71 void findLoopBackEdges(Function &F);
75 char CodeGenPrepare::ID = 0;
76 static RegisterPass<CodeGenPrepare> X("codegenprepare",
77 "Optimize for code generation");
79 FunctionPass *llvm::createCodeGenPreparePass(const TargetLowering *TLI) {
80 return new CodeGenPrepare(TLI);
83 /// findLoopBackEdges - Do a DFS walk to find loop back edges.
85 void CodeGenPrepare::findLoopBackEdges(Function &F) {
86 SmallPtrSet<BasicBlock*, 8> Visited;
87 SmallVector<std::pair<BasicBlock*, succ_iterator>, 8> VisitStack;
88 SmallPtrSet<BasicBlock*, 8> InStack;
90 BasicBlock *BB = &F.getEntryBlock();
91 if (succ_begin(BB) == succ_end(BB))
94 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
97 std::pair<BasicBlock*, succ_iterator> &Top = VisitStack.back();
98 BasicBlock *ParentBB = Top.first;
99 succ_iterator &I = Top.second;
101 bool FoundNew = false;
102 while (I != succ_end(ParentBB)) {
104 if (Visited.insert(BB)) {
108 // Successor is in VisitStack, it's a back edge.
109 if (InStack.count(BB))
110 BackEdges.insert(std::make_pair(ParentBB, BB));
114 // Go down one level if there is a unvisited successor.
116 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
119 std::pair<BasicBlock*, succ_iterator> &Pop = VisitStack.back();
120 InStack.erase(Pop.first);
121 VisitStack.pop_back();
123 } while (!VisitStack.empty());
127 bool CodeGenPrepare::runOnFunction(Function &F) {
128 bool EverMadeChange = false;
130 // First pass, eliminate blocks that contain only PHI nodes and an
131 // unconditional branch.
132 EverMadeChange |= EliminateMostlyEmptyBlocks(F);
134 // Now find loop back edges.
135 findLoopBackEdges(F);
137 bool MadeChange = true;
140 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
141 MadeChange |= OptimizeBlock(*BB);
142 EverMadeChange |= MadeChange;
144 return EverMadeChange;
147 /// EliminateMostlyEmptyBlocks - eliminate blocks that contain only PHI nodes
148 /// and an unconditional branch. Passes before isel (e.g. LSR/loopsimplify)
149 /// often split edges in ways that are non-optimal for isel. Start by
150 /// eliminating these blocks so we can split them the way we want them.
151 bool CodeGenPrepare::EliminateMostlyEmptyBlocks(Function &F) {
152 bool MadeChange = false;
153 // Note that this intentionally skips the entry block.
154 for (Function::iterator I = ++F.begin(), E = F.end(); I != E; ) {
155 BasicBlock *BB = I++;
157 // If this block doesn't end with an uncond branch, ignore it.
158 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
159 if (!BI || !BI->isUnconditional())
162 // If the instruction before the branch isn't a phi node, then other stuff
163 // is happening here.
164 BasicBlock::iterator BBI = BI;
165 if (BBI != BB->begin()) {
167 if (!isa<PHINode>(BBI)) continue;
170 // Do not break infinite loops.
171 BasicBlock *DestBB = BI->getSuccessor(0);
175 if (!CanMergeBlocks(BB, DestBB))
178 EliminateMostlyEmptyBlock(BB);
184 /// CanMergeBlocks - Return true if we can merge BB into DestBB if there is a
185 /// single uncond branch between them, and BB contains no other non-phi
187 bool CodeGenPrepare::CanMergeBlocks(const BasicBlock *BB,
188 const BasicBlock *DestBB) const {
189 // We only want to eliminate blocks whose phi nodes are used by phi nodes in
190 // the successor. If there are more complex condition (e.g. preheaders),
191 // don't mess around with them.
192 BasicBlock::const_iterator BBI = BB->begin();
193 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
194 for (Value::use_const_iterator UI = PN->use_begin(), E = PN->use_end();
196 const Instruction *User = cast<Instruction>(*UI);
197 if (User->getParent() != DestBB || !isa<PHINode>(User))
199 // If User is inside DestBB block and it is a PHINode then check
200 // incoming value. If incoming value is not from BB then this is
201 // a complex condition (e.g. preheaders) we want to avoid here.
202 if (User->getParent() == DestBB) {
203 if (const PHINode *UPN = dyn_cast<PHINode>(User))
204 for (unsigned I = 0, E = UPN->getNumIncomingValues(); I != E; ++I) {
205 Instruction *Insn = dyn_cast<Instruction>(UPN->getIncomingValue(I));
206 if (Insn && Insn->getParent() == BB &&
207 Insn->getParent() != UPN->getIncomingBlock(I))
214 // If BB and DestBB contain any common predecessors, then the phi nodes in BB
215 // and DestBB may have conflicting incoming values for the block. If so, we
216 // can't merge the block.
217 const PHINode *DestBBPN = dyn_cast<PHINode>(DestBB->begin());
218 if (!DestBBPN) return true; // no conflict.
220 // Collect the preds of BB.
221 SmallPtrSet<const BasicBlock*, 16> BBPreds;
222 if (const PHINode *BBPN = dyn_cast<PHINode>(BB->begin())) {
223 // It is faster to get preds from a PHI than with pred_iterator.
224 for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i)
225 BBPreds.insert(BBPN->getIncomingBlock(i));
227 BBPreds.insert(pred_begin(BB), pred_end(BB));
230 // Walk the preds of DestBB.
231 for (unsigned i = 0, e = DestBBPN->getNumIncomingValues(); i != e; ++i) {
232 BasicBlock *Pred = DestBBPN->getIncomingBlock(i);
233 if (BBPreds.count(Pred)) { // Common predecessor?
234 BBI = DestBB->begin();
235 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
236 const Value *V1 = PN->getIncomingValueForBlock(Pred);
237 const Value *V2 = PN->getIncomingValueForBlock(BB);
239 // If V2 is a phi node in BB, look up what the mapped value will be.
240 if (const PHINode *V2PN = dyn_cast<PHINode>(V2))
241 if (V2PN->getParent() == BB)
242 V2 = V2PN->getIncomingValueForBlock(Pred);
244 // If there is a conflict, bail out.
245 if (V1 != V2) return false;
254 /// EliminateMostlyEmptyBlock - Eliminate a basic block that have only phi's and
255 /// an unconditional branch in it.
256 void CodeGenPrepare::EliminateMostlyEmptyBlock(BasicBlock *BB) {
257 BranchInst *BI = cast<BranchInst>(BB->getTerminator());
258 BasicBlock *DestBB = BI->getSuccessor(0);
260 DOUT << "MERGING MOSTLY EMPTY BLOCKS - BEFORE:\n" << *BB << *DestBB;
262 // If the destination block has a single pred, then this is a trivial edge,
264 if (BasicBlock *SinglePred = DestBB->getSinglePredecessor()) {
265 if (SinglePred != DestBB) {
266 // Remember if SinglePred was the entry block of the function. If so, we
267 // will need to move BB back to the entry position.
268 bool isEntry = SinglePred == &SinglePred->getParent()->getEntryBlock();
269 MergeBasicBlockIntoOnlyPred(DestBB);
271 if (isEntry && BB != &BB->getParent()->getEntryBlock())
272 BB->moveBefore(&BB->getParent()->getEntryBlock());
274 DOUT << "AFTER:\n" << *DestBB << "\n\n\n";
279 // Otherwise, we have multiple predecessors of BB. Update the PHIs in DestBB
280 // to handle the new incoming edges it is about to have.
282 for (BasicBlock::iterator BBI = DestBB->begin();
283 (PN = dyn_cast<PHINode>(BBI)); ++BBI) {
284 // Remove the incoming value for BB, and remember it.
285 Value *InVal = PN->removeIncomingValue(BB, false);
287 // Two options: either the InVal is a phi node defined in BB or it is some
288 // value that dominates BB.
289 PHINode *InValPhi = dyn_cast<PHINode>(InVal);
290 if (InValPhi && InValPhi->getParent() == BB) {
291 // Add all of the input values of the input PHI as inputs of this phi.
292 for (unsigned i = 0, e = InValPhi->getNumIncomingValues(); i != e; ++i)
293 PN->addIncoming(InValPhi->getIncomingValue(i),
294 InValPhi->getIncomingBlock(i));
296 // Otherwise, add one instance of the dominating value for each edge that
297 // we will be adding.
298 if (PHINode *BBPN = dyn_cast<PHINode>(BB->begin())) {
299 for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i)
300 PN->addIncoming(InVal, BBPN->getIncomingBlock(i));
302 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
303 PN->addIncoming(InVal, *PI);
308 // The PHIs are now updated, change everything that refers to BB to use
309 // DestBB and remove BB.
310 BB->replaceAllUsesWith(DestBB);
311 BB->eraseFromParent();
313 DOUT << "AFTER:\n" << *DestBB << "\n\n\n";
317 /// SplitEdgeNicely - Split the critical edge from TI to its specified
318 /// successor if it will improve codegen. We only do this if the successor has
319 /// phi nodes (otherwise critical edges are ok). If there is already another
320 /// predecessor of the succ that is empty (and thus has no phi nodes), use it
321 /// instead of introducing a new block.
322 static void SplitEdgeNicely(TerminatorInst *TI, unsigned SuccNum,
323 SmallSet<std::pair<BasicBlock*,BasicBlock*>, 8> &BackEdges,
325 BasicBlock *TIBB = TI->getParent();
326 BasicBlock *Dest = TI->getSuccessor(SuccNum);
327 assert(isa<PHINode>(Dest->begin()) &&
328 "This should only be called if Dest has a PHI!");
330 // Do not split edges to EH landing pads.
331 if (InvokeInst *Invoke = dyn_cast<InvokeInst>(TI)) {
332 if (Invoke->getSuccessor(1) == Dest)
336 // As a hack, never split backedges of loops. Even though the copy for any
337 // PHIs inserted on the backedge would be dead for exits from the loop, we
338 // assume that the cost of *splitting* the backedge would be too high.
339 if (BackEdges.count(std::make_pair(TIBB, Dest)))
342 if (!FactorCommonPreds) {
343 /// TIPHIValues - This array is lazily computed to determine the values of
344 /// PHIs in Dest that TI would provide.
345 SmallVector<Value*, 32> TIPHIValues;
347 // Check to see if Dest has any blocks that can be used as a split edge for
349 for (pred_iterator PI = pred_begin(Dest), E = pred_end(Dest); PI != E; ++PI) {
350 BasicBlock *Pred = *PI;
351 // To be usable, the pred has to end with an uncond branch to the dest.
352 BranchInst *PredBr = dyn_cast<BranchInst>(Pred->getTerminator());
353 if (!PredBr || !PredBr->isUnconditional() ||
354 // Must be empty other than the branch.
355 &Pred->front() != PredBr ||
356 // Cannot be the entry block; its label does not get emitted.
357 Pred == &(Dest->getParent()->getEntryBlock()))
360 // Finally, since we know that Dest has phi nodes in it, we have to make
361 // sure that jumping to Pred will have the same affect as going to Dest in
362 // terms of PHI values.
365 bool FoundMatch = true;
366 for (BasicBlock::iterator I = Dest->begin();
367 (PN = dyn_cast<PHINode>(I)); ++I, ++PHINo) {
368 if (PHINo == TIPHIValues.size())
369 TIPHIValues.push_back(PN->getIncomingValueForBlock(TIBB));
371 // If the PHI entry doesn't work, we can't use this pred.
372 if (TIPHIValues[PHINo] != PN->getIncomingValueForBlock(Pred)) {
378 // If we found a workable predecessor, change TI to branch to Succ.
380 Dest->removePredecessor(TIBB);
381 TI->setSuccessor(SuccNum, Pred);
386 SplitCriticalEdge(TI, SuccNum, P, true);
391 SmallVector<Value*, 8> TIPHIValues;
392 for (BasicBlock::iterator I = Dest->begin();
393 (PN = dyn_cast<PHINode>(I)); ++I)
394 TIPHIValues.push_back(PN->getIncomingValueForBlock(TIBB));
396 SmallVector<BasicBlock*, 8> IdenticalPreds;
397 for (pred_iterator PI = pred_begin(Dest), E = pred_end(Dest); PI != E; ++PI) {
398 BasicBlock *Pred = *PI;
399 if (BackEdges.count(std::make_pair(Pred, Dest)))
402 IdenticalPreds.push_back(Pred);
404 bool Identical = true;
406 for (BasicBlock::iterator I = Dest->begin();
407 (PN = dyn_cast<PHINode>(I)); ++I, ++PHINo)
408 if (TIPHIValues[PHINo] != PN->getIncomingValueForBlock(Pred)) {
413 IdenticalPreds.push_back(Pred);
417 assert(!IdenticalPreds.empty());
418 SplitBlockPredecessors(Dest, &IdenticalPreds[0], IdenticalPreds.size(),
423 /// OptimizeNoopCopyExpression - If the specified cast instruction is a noop
424 /// copy (e.g. it's casting from one pointer type to another, int->uint, or
425 /// int->sbyte on PPC), sink it into user blocks to reduce the number of virtual
426 /// registers that must be created and coalesced.
428 /// Return true if any changes are made.
430 static bool OptimizeNoopCopyExpression(CastInst *CI, const TargetLowering &TLI){
431 // If this is a noop copy,
432 MVT SrcVT = TLI.getValueType(CI->getOperand(0)->getType());
433 MVT DstVT = TLI.getValueType(CI->getType());
435 // This is an fp<->int conversion?
436 if (SrcVT.isInteger() != DstVT.isInteger())
439 // If this is an extension, it will be a zero or sign extension, which
441 if (SrcVT.bitsLT(DstVT)) return false;
443 // If these values will be promoted, find out what they will be promoted
444 // to. This helps us consider truncates on PPC as noop copies when they
446 if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote)
447 SrcVT = TLI.getTypeToTransformTo(SrcVT);
448 if (TLI.getTypeAction(DstVT) == TargetLowering::Promote)
449 DstVT = TLI.getTypeToTransformTo(DstVT);
451 // If, after promotion, these are the same types, this is a noop copy.
455 BasicBlock *DefBB = CI->getParent();
457 /// InsertedCasts - Only insert a cast in each block once.
458 DenseMap<BasicBlock*, CastInst*> InsertedCasts;
460 bool MadeChange = false;
461 for (Value::use_iterator UI = CI->use_begin(), E = CI->use_end();
463 Use &TheUse = UI.getUse();
464 Instruction *User = cast<Instruction>(*UI);
466 // Figure out which BB this cast is used in. For PHI's this is the
467 // appropriate predecessor block.
468 BasicBlock *UserBB = User->getParent();
469 if (PHINode *PN = dyn_cast<PHINode>(User)) {
470 UserBB = PN->getIncomingBlock(UI);
473 // Preincrement use iterator so we don't invalidate it.
476 // If this user is in the same block as the cast, don't change the cast.
477 if (UserBB == DefBB) continue;
479 // If we have already inserted a cast into this block, use it.
480 CastInst *&InsertedCast = InsertedCasts[UserBB];
483 BasicBlock::iterator InsertPt = UserBB->getFirstNonPHI();
486 CastInst::Create(CI->getOpcode(), CI->getOperand(0), CI->getType(), "",
491 // Replace a use of the cast with a use of the new cast.
492 TheUse = InsertedCast;
495 // If we removed all uses, nuke the cast.
496 if (CI->use_empty()) {
497 CI->eraseFromParent();
504 /// OptimizeCmpExpression - sink the given CmpInst into user blocks to reduce
505 /// the number of virtual registers that must be created and coalesced. This is
506 /// a clear win except on targets with multiple condition code registers
507 /// (PowerPC), where it might lose; some adjustment may be wanted there.
509 /// Return true if any changes are made.
510 static bool OptimizeCmpExpression(CmpInst *CI) {
511 BasicBlock *DefBB = CI->getParent();
513 /// InsertedCmp - Only insert a cmp in each block once.
514 DenseMap<BasicBlock*, CmpInst*> InsertedCmps;
516 bool MadeChange = false;
517 for (Value::use_iterator UI = CI->use_begin(), E = CI->use_end();
519 Use &TheUse = UI.getUse();
520 Instruction *User = cast<Instruction>(*UI);
522 // Preincrement use iterator so we don't invalidate it.
525 // Don't bother for PHI nodes.
526 if (isa<PHINode>(User))
529 // Figure out which BB this cmp is used in.
530 BasicBlock *UserBB = User->getParent();
532 // If this user is in the same block as the cmp, don't change the cmp.
533 if (UserBB == DefBB) continue;
535 // If we have already inserted a cmp into this block, use it.
536 CmpInst *&InsertedCmp = InsertedCmps[UserBB];
539 BasicBlock::iterator InsertPt = UserBB->getFirstNonPHI();
542 CmpInst::Create(CI->getOpcode(), CI->getPredicate(), CI->getOperand(0),
543 CI->getOperand(1), "", InsertPt);
547 // Replace a use of the cmp with a use of the new cmp.
548 TheUse = InsertedCmp;
551 // If we removed all uses, nuke the cmp.
553 CI->eraseFromParent();
558 //===----------------------------------------------------------------------===//
559 // Addressing Mode Analysis and Optimization
560 //===----------------------------------------------------------------------===//
562 //===----------------------------------------------------------------------===//
563 // Memory Optimization
564 //===----------------------------------------------------------------------===//
566 /// IsNonLocalValue - Return true if the specified values are defined in a
567 /// different basic block than BB.
568 static bool IsNonLocalValue(Value *V, BasicBlock *BB) {
569 if (Instruction *I = dyn_cast<Instruction>(V))
570 return I->getParent() != BB;
574 /// OptimizeMemoryInst - Load and Store Instructions have often have
575 /// addressing modes that can do significant amounts of computation. As such,
576 /// instruction selection will try to get the load or store to do as much
577 /// computation as possible for the program. The problem is that isel can only
578 /// see within a single block. As such, we sink as much legal addressing mode
579 /// stuff into the block as possible.
581 /// This method is used to optimize both load/store and inline asms with memory
583 bool CodeGenPrepare::OptimizeMemoryInst(Instruction *MemoryInst, Value *Addr,
584 const Type *AccessTy,
585 DenseMap<Value*,Value*> &SunkAddrs) {
586 // Figure out what addressing mode will be built up for this operation.
587 SmallVector<Instruction*, 16> AddrModeInsts;
588 ExtAddrMode AddrMode = AddressingModeMatcher::Match(Addr, AccessTy,MemoryInst,
589 AddrModeInsts, *TLI);
591 // Check to see if any of the instructions supersumed by this addr mode are
592 // non-local to I's BB.
593 bool AnyNonLocal = false;
594 for (unsigned i = 0, e = AddrModeInsts.size(); i != e; ++i) {
595 if (IsNonLocalValue(AddrModeInsts[i], MemoryInst->getParent())) {
601 // If all the instructions matched are already in this BB, don't do anything.
603 DEBUG(cerr << "CGP: Found local addrmode: " << AddrMode << "\n");
607 // Insert this computation right after this user. Since our caller is
608 // scanning from the top of the BB to the bottom, reuse of the expr are
609 // guaranteed to happen later.
610 BasicBlock::iterator InsertPt = MemoryInst;
612 // Now that we determined the addressing expression we want to use and know
613 // that we have to sink it into this block. Check to see if we have already
614 // done this for some other load/store instr in this block. If so, reuse the
616 Value *&SunkAddr = SunkAddrs[Addr];
618 DEBUG(cerr << "CGP: Reusing nonlocal addrmode: " << AddrMode << " for "
620 if (SunkAddr->getType() != Addr->getType())
621 SunkAddr = new BitCastInst(SunkAddr, Addr->getType(), "tmp", InsertPt);
623 DEBUG(cerr << "CGP: SINKING nonlocal addrmode: " << AddrMode << " for "
625 const Type *IntPtrTy = TLI->getTargetData()->getIntPtrType();
628 // Start with the scale value.
629 if (AddrMode.Scale) {
630 Value *V = AddrMode.ScaledReg;
631 if (V->getType() == IntPtrTy) {
633 } else if (isa<PointerType>(V->getType())) {
634 V = new PtrToIntInst(V, IntPtrTy, "sunkaddr", InsertPt);
635 } else if (cast<IntegerType>(IntPtrTy)->getBitWidth() <
636 cast<IntegerType>(V->getType())->getBitWidth()) {
637 V = new TruncInst(V, IntPtrTy, "sunkaddr", InsertPt);
639 V = new SExtInst(V, IntPtrTy, "sunkaddr", InsertPt);
641 if (AddrMode.Scale != 1)
642 V = BinaryOperator::CreateMul(V, ConstantInt::get(IntPtrTy,
644 "sunkaddr", InsertPt);
648 // Add in the base register.
649 if (AddrMode.BaseReg) {
650 Value *V = AddrMode.BaseReg;
651 if (V->getType() != IntPtrTy)
652 V = new PtrToIntInst(V, IntPtrTy, "sunkaddr", InsertPt);
654 Result = BinaryOperator::CreateAdd(Result, V, "sunkaddr", InsertPt);
659 // Add in the BaseGV if present.
660 if (AddrMode.BaseGV) {
661 Value *V = new PtrToIntInst(AddrMode.BaseGV, IntPtrTy, "sunkaddr",
664 Result = BinaryOperator::CreateAdd(Result, V, "sunkaddr", InsertPt);
669 // Add in the Base Offset if present.
670 if (AddrMode.BaseOffs) {
671 Value *V = ConstantInt::get(IntPtrTy, AddrMode.BaseOffs);
673 Result = BinaryOperator::CreateAdd(Result, V, "sunkaddr", InsertPt);
679 SunkAddr = Constant::getNullValue(Addr->getType());
681 SunkAddr = new IntToPtrInst(Result, Addr->getType(), "sunkaddr",InsertPt);
684 MemoryInst->replaceUsesOfWith(Addr, SunkAddr);
686 if (Addr->use_empty())
687 RecursivelyDeleteTriviallyDeadInstructions(Addr);
691 /// OptimizeInlineAsmInst - If there are any memory operands, use
692 /// OptimizeMemoryInst to sink their address computing into the block when
693 /// possible / profitable.
694 bool CodeGenPrepare::OptimizeInlineAsmInst(Instruction *I, CallSite CS,
695 DenseMap<Value*,Value*> &SunkAddrs) {
696 bool MadeChange = false;
697 InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue());
699 // Do a prepass over the constraints, canonicalizing them, and building up the
700 // ConstraintOperands list.
701 std::vector<InlineAsm::ConstraintInfo>
702 ConstraintInfos = IA->ParseConstraints();
704 /// ConstraintOperands - Information about all of the constraints.
705 std::vector<TargetLowering::AsmOperandInfo> ConstraintOperands;
706 unsigned ArgNo = 0; // ArgNo - The argument of the CallInst.
707 for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) {
709 push_back(TargetLowering::AsmOperandInfo(ConstraintInfos[i]));
710 TargetLowering::AsmOperandInfo &OpInfo = ConstraintOperands.back();
712 // Compute the value type for each operand.
713 switch (OpInfo.Type) {
714 case InlineAsm::isOutput:
715 if (OpInfo.isIndirect)
716 OpInfo.CallOperandVal = CS.getArgument(ArgNo++);
718 case InlineAsm::isInput:
719 OpInfo.CallOperandVal = CS.getArgument(ArgNo++);
721 case InlineAsm::isClobber:
726 // Compute the constraint code and ConstraintType to use.
727 TLI->ComputeConstraintToUse(OpInfo, SDValue(),
728 OpInfo.ConstraintType == TargetLowering::C_Memory);
730 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
732 Value *OpVal = OpInfo.CallOperandVal;
733 MadeChange |= OptimizeMemoryInst(I, OpVal, OpVal->getType(), SunkAddrs);
740 bool CodeGenPrepare::OptimizeExtUses(Instruction *I) {
741 BasicBlock *DefBB = I->getParent();
743 // If both result of the {s|z}xt and its source are live out, rewrite all
744 // other uses of the source with result of extension.
745 Value *Src = I->getOperand(0);
746 if (Src->hasOneUse())
749 // Only do this xform if truncating is free.
750 if (TLI && !TLI->isTruncateFree(I->getType(), Src->getType()))
753 // Only safe to perform the optimization if the source is also defined in
755 if (!isa<Instruction>(Src) || DefBB != cast<Instruction>(Src)->getParent())
758 bool DefIsLiveOut = false;
759 for (Value::use_iterator UI = I->use_begin(), E = I->use_end();
761 Instruction *User = cast<Instruction>(*UI);
763 // Figure out which BB this ext is used in.
764 BasicBlock *UserBB = User->getParent();
765 if (UserBB == DefBB) continue;
772 // Make sure non of the uses are PHI nodes.
773 for (Value::use_iterator UI = Src->use_begin(), E = Src->use_end();
775 Instruction *User = cast<Instruction>(*UI);
776 BasicBlock *UserBB = User->getParent();
777 if (UserBB == DefBB) continue;
778 // Be conservative. We don't want this xform to end up introducing
779 // reloads just before load / store instructions.
780 if (isa<PHINode>(User) || isa<LoadInst>(User) || isa<StoreInst>(User))
784 // InsertedTruncs - Only insert one trunc in each block once.
785 DenseMap<BasicBlock*, Instruction*> InsertedTruncs;
787 bool MadeChange = false;
788 for (Value::use_iterator UI = Src->use_begin(), E = Src->use_end();
790 Use &TheUse = UI.getUse();
791 Instruction *User = cast<Instruction>(*UI);
793 // Figure out which BB this ext is used in.
794 BasicBlock *UserBB = User->getParent();
795 if (UserBB == DefBB) continue;
797 // Both src and def are live in this block. Rewrite the use.
798 Instruction *&InsertedTrunc = InsertedTruncs[UserBB];
800 if (!InsertedTrunc) {
801 BasicBlock::iterator InsertPt = UserBB->getFirstNonPHI();
803 InsertedTrunc = new TruncInst(I, Src->getType(), "", InsertPt);
806 // Replace a use of the {s|z}ext source with a use of the result.
807 TheUse = InsertedTrunc;
815 // In this pass we look for GEP and cast instructions that are used
816 // across basic blocks and rewrite them to improve basic-block-at-a-time
818 bool CodeGenPrepare::OptimizeBlock(BasicBlock &BB) {
819 bool MadeChange = false;
821 // Split all critical edges where the dest block has a PHI.
822 TerminatorInst *BBTI = BB.getTerminator();
823 if (BBTI->getNumSuccessors() > 1) {
824 for (unsigned i = 0, e = BBTI->getNumSuccessors(); i != e; ++i) {
825 BasicBlock *SuccBB = BBTI->getSuccessor(i);
826 if (isa<PHINode>(SuccBB->begin()) && isCriticalEdge(BBTI, i, true))
827 SplitEdgeNicely(BBTI, i, BackEdges, this);
831 // Keep track of non-local addresses that have been sunk into this block.
832 // This allows us to avoid inserting duplicate code for blocks with multiple
833 // load/stores of the same address.
834 DenseMap<Value*, Value*> SunkAddrs;
836 for (BasicBlock::iterator BBI = BB.begin(), E = BB.end(); BBI != E; ) {
837 Instruction *I = BBI++;
839 if (CastInst *CI = dyn_cast<CastInst>(I)) {
840 // If the source of the cast is a constant, then this should have
841 // already been constant folded. The only reason NOT to constant fold
842 // it is if something (e.g. LSR) was careful to place the constant
843 // evaluation in a block other than then one that uses it (e.g. to hoist
844 // the address of globals out of a loop). If this is the case, we don't
845 // want to forward-subst the cast.
846 if (isa<Constant>(CI->getOperand(0)))
851 Change = OptimizeNoopCopyExpression(CI, *TLI);
852 MadeChange |= Change;
855 if (!Change && (isa<ZExtInst>(I) || isa<SExtInst>(I)))
856 MadeChange |= OptimizeExtUses(I);
857 } else if (CmpInst *CI = dyn_cast<CmpInst>(I)) {
858 MadeChange |= OptimizeCmpExpression(CI);
859 } else if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
861 MadeChange |= OptimizeMemoryInst(I, I->getOperand(0), LI->getType(),
863 } else if (StoreInst *SI = dyn_cast<StoreInst>(I)) {
865 MadeChange |= OptimizeMemoryInst(I, SI->getOperand(1),
866 SI->getOperand(0)->getType(),
868 } else if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) {
869 if (GEPI->hasAllZeroIndices()) {
870 /// The GEP operand must be a pointer, so must its result -> BitCast
871 Instruction *NC = new BitCastInst(GEPI->getOperand(0), GEPI->getType(),
872 GEPI->getName(), GEPI);
873 GEPI->replaceAllUsesWith(NC);
874 GEPI->eraseFromParent();
878 } else if (CallInst *CI = dyn_cast<CallInst>(I)) {
879 // If we found an inline asm expession, and if the target knows how to
880 // lower it to normal LLVM code, do so now.
881 if (TLI && isa<InlineAsm>(CI->getCalledValue()))
882 if (const TargetAsmInfo *TAI =
883 TLI->getTargetMachine().getTargetAsmInfo()) {
884 if (TAI->ExpandInlineAsm(CI)) {
886 // Avoid processing instructions out of order, which could cause
887 // reuse before a value is defined.
890 // Sink address computing for memory operands into the block.
891 MadeChange |= OptimizeInlineAsmInst(I, &(*CI), SunkAddrs);