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 #include "llvm/CodeGen/Passes.h"
17 #include "llvm/ADT/DenseMap.h"
18 #include "llvm/ADT/SmallSet.h"
19 #include "llvm/ADT/Statistic.h"
20 #include "llvm/Analysis/InstructionSimplify.h"
21 #include "llvm/IR/CallSite.h"
22 #include "llvm/IR/Constants.h"
23 #include "llvm/IR/DataLayout.h"
24 #include "llvm/IR/DerivedTypes.h"
25 #include "llvm/IR/Dominators.h"
26 #include "llvm/IR/Function.h"
27 #include "llvm/IR/GetElementPtrTypeIterator.h"
28 #include "llvm/IR/IRBuilder.h"
29 #include "llvm/IR/InlineAsm.h"
30 #include "llvm/IR/Instructions.h"
31 #include "llvm/IR/IntrinsicInst.h"
32 #include "llvm/IR/PatternMatch.h"
33 #include "llvm/IR/ValueHandle.h"
34 #include "llvm/IR/ValueMap.h"
35 #include "llvm/Pass.h"
36 #include "llvm/Support/CommandLine.h"
37 #include "llvm/Support/Debug.h"
38 #include "llvm/Support/raw_ostream.h"
39 #include "llvm/Target/TargetLibraryInfo.h"
40 #include "llvm/Target/TargetLowering.h"
41 #include "llvm/Target/TargetSubtargetInfo.h"
42 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
43 #include "llvm/Transforms/Utils/BuildLibCalls.h"
44 #include "llvm/Transforms/Utils/BypassSlowDivision.h"
45 #include "llvm/Transforms/Utils/Local.h"
47 using namespace llvm::PatternMatch;
49 #define DEBUG_TYPE "codegenprepare"
51 STATISTIC(NumBlocksElim, "Number of blocks eliminated");
52 STATISTIC(NumPHIsElim, "Number of trivial PHIs eliminated");
53 STATISTIC(NumGEPsElim, "Number of GEPs converted to casts");
54 STATISTIC(NumCmpUses, "Number of uses of Cmp expressions replaced with uses of "
56 STATISTIC(NumCastUses, "Number of uses of Cast expressions replaced with uses "
58 STATISTIC(NumMemoryInsts, "Number of memory instructions whose address "
59 "computations were sunk");
60 STATISTIC(NumExtsMoved, "Number of [s|z]ext instructions combined with loads");
61 STATISTIC(NumExtUses, "Number of uses of [s|z]ext instructions optimized");
62 STATISTIC(NumRetsDup, "Number of return instructions duplicated");
63 STATISTIC(NumDbgValueMoved, "Number of debug value instructions moved");
64 STATISTIC(NumSelectsExpanded, "Number of selects turned into branches");
65 STATISTIC(NumAndCmpsMoved, "Number of and/cmp's pushed into branches");
67 static cl::opt<bool> DisableBranchOpts(
68 "disable-cgp-branch-opts", cl::Hidden, cl::init(false),
69 cl::desc("Disable branch optimizations in CodeGenPrepare"));
71 static cl::opt<bool> DisableSelectToBranch(
72 "disable-cgp-select2branch", cl::Hidden, cl::init(false),
73 cl::desc("Disable select to branch conversion."));
75 static cl::opt<bool> AddrSinkUsingGEPs(
76 "addr-sink-using-gep", cl::Hidden, cl::init(false),
77 cl::desc("Address sinking in CGP using GEPs."));
79 static cl::opt<bool> EnableAndCmpSinking(
80 "enable-andcmp-sinking", cl::Hidden, cl::init(true),
81 cl::desc("Enable sinkinig and/cmp into branches."));
84 typedef SmallPtrSet<Instruction *, 16> SetOfInstrs;
85 typedef DenseMap<Instruction *, Type *> InstrToOrigTy;
87 class CodeGenPrepare : public FunctionPass {
88 /// TLI - Keep a pointer of a TargetLowering to consult for determining
89 /// transformation profitability.
90 const TargetMachine *TM;
91 const TargetLowering *TLI;
92 const TargetLibraryInfo *TLInfo;
95 /// CurInstIterator - As we scan instructions optimizing them, this is the
96 /// next instruction to optimize. Xforms that can invalidate this should
98 BasicBlock::iterator CurInstIterator;
100 /// Keeps track of non-local addresses that have been sunk into a block.
101 /// This allows us to avoid inserting duplicate code for blocks with
102 /// multiple load/stores of the same address.
103 ValueMap<Value*, Value*> SunkAddrs;
105 /// Keeps track of all truncates inserted for the current function.
106 SetOfInstrs InsertedTruncsSet;
107 /// Keeps track of the type of the related instruction before their
108 /// promotion for the current function.
109 InstrToOrigTy PromotedInsts;
111 /// ModifiedDT - If CFG is modified in anyway, dominator tree may need to
115 /// OptSize - True if optimizing for size.
119 static char ID; // Pass identification, replacement for typeid
120 explicit CodeGenPrepare(const TargetMachine *TM = nullptr)
121 : FunctionPass(ID), TM(TM), TLI(nullptr) {
122 initializeCodeGenPreparePass(*PassRegistry::getPassRegistry());
124 bool runOnFunction(Function &F) override;
126 const char *getPassName() const override { return "CodeGen Prepare"; }
128 void getAnalysisUsage(AnalysisUsage &AU) const override {
129 AU.addPreserved<DominatorTreeWrapperPass>();
130 AU.addRequired<TargetLibraryInfo>();
134 bool EliminateFallThrough(Function &F);
135 bool EliminateMostlyEmptyBlocks(Function &F);
136 bool CanMergeBlocks(const BasicBlock *BB, const BasicBlock *DestBB) const;
137 void EliminateMostlyEmptyBlock(BasicBlock *BB);
138 bool OptimizeBlock(BasicBlock &BB);
139 bool OptimizeInst(Instruction *I);
140 bool OptimizeMemoryInst(Instruction *I, Value *Addr, Type *AccessTy);
141 bool OptimizeInlineAsmInst(CallInst *CS);
142 bool OptimizeCallInst(CallInst *CI);
143 bool MoveExtToFormExtLoad(Instruction *I);
144 bool OptimizeExtUses(Instruction *I);
145 bool OptimizeSelectInst(SelectInst *SI);
146 bool OptimizeShuffleVectorInst(ShuffleVectorInst *SI);
147 bool DupRetToEnableTailCallOpts(BasicBlock *BB);
148 bool PlaceDbgValues(Function &F);
149 bool sinkAndCmp(Function &F);
153 char CodeGenPrepare::ID = 0;
154 INITIALIZE_TM_PASS(CodeGenPrepare, "codegenprepare",
155 "Optimize for code generation", false, false)
157 FunctionPass *llvm::createCodeGenPreparePass(const TargetMachine *TM) {
158 return new CodeGenPrepare(TM);
161 bool CodeGenPrepare::runOnFunction(Function &F) {
162 if (skipOptnoneFunction(F))
165 bool EverMadeChange = false;
166 // Clear per function information.
167 InsertedTruncsSet.clear();
168 PromotedInsts.clear();
171 if (TM) TLI = TM->getTargetLowering();
172 TLInfo = &getAnalysis<TargetLibraryInfo>();
173 DominatorTreeWrapperPass *DTWP =
174 getAnalysisIfAvailable<DominatorTreeWrapperPass>();
175 DT = DTWP ? &DTWP->getDomTree() : nullptr;
176 OptSize = F.getAttributes().hasAttribute(AttributeSet::FunctionIndex,
177 Attribute::OptimizeForSize);
179 /// This optimization identifies DIV instructions that can be
180 /// profitably bypassed and carried out with a shorter, faster divide.
181 if (!OptSize && TLI && TLI->isSlowDivBypassed()) {
182 const DenseMap<unsigned int, unsigned int> &BypassWidths =
183 TLI->getBypassSlowDivWidths();
184 for (Function::iterator I = F.begin(); I != F.end(); I++)
185 EverMadeChange |= bypassSlowDivision(F, I, BypassWidths);
188 // Eliminate blocks that contain only PHI nodes and an
189 // unconditional branch.
190 EverMadeChange |= EliminateMostlyEmptyBlocks(F);
192 // llvm.dbg.value is far away from the value then iSel may not be able
193 // handle it properly. iSel will drop llvm.dbg.value if it can not
194 // find a node corresponding to the value.
195 EverMadeChange |= PlaceDbgValues(F);
197 // If there is a mask, compare against zero, and branch that can be combined
198 // into a single target instruction, push the mask and compare into branch
199 // users. Do this before OptimizeBlock -> OptimizeInst ->
200 // OptimizeCmpExpression, which perturbs the pattern being searched for.
201 if (!DisableBranchOpts)
202 EverMadeChange |= sinkAndCmp(F);
204 bool MadeChange = true;
207 for (Function::iterator I = F.begin(); I != F.end(); ) {
208 BasicBlock *BB = I++;
209 MadeChange |= OptimizeBlock(*BB);
211 EverMadeChange |= MadeChange;
216 if (!DisableBranchOpts) {
218 SmallPtrSet<BasicBlock*, 8> WorkList;
219 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
220 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB));
221 MadeChange |= ConstantFoldTerminator(BB, true);
222 if (!MadeChange) continue;
224 for (SmallVectorImpl<BasicBlock*>::iterator
225 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
226 if (pred_begin(*II) == pred_end(*II))
227 WorkList.insert(*II);
230 // Delete the dead blocks and any of their dead successors.
231 MadeChange |= !WorkList.empty();
232 while (!WorkList.empty()) {
233 BasicBlock *BB = *WorkList.begin();
235 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB));
239 for (SmallVectorImpl<BasicBlock*>::iterator
240 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
241 if (pred_begin(*II) == pred_end(*II))
242 WorkList.insert(*II);
245 // Merge pairs of basic blocks with unconditional branches, connected by
247 if (EverMadeChange || MadeChange)
248 MadeChange |= EliminateFallThrough(F);
252 EverMadeChange |= MadeChange;
255 if (ModifiedDT && DT)
258 return EverMadeChange;
261 /// EliminateFallThrough - Merge basic blocks which are connected
262 /// by a single edge, where one of the basic blocks has a single successor
263 /// pointing to the other basic block, which has a single predecessor.
264 bool CodeGenPrepare::EliminateFallThrough(Function &F) {
265 bool Changed = false;
266 // Scan all of the blocks in the function, except for the entry block.
267 for (Function::iterator I = std::next(F.begin()), E = F.end(); I != E;) {
268 BasicBlock *BB = I++;
269 // If the destination block has a single pred, then this is a trivial
270 // edge, just collapse it.
271 BasicBlock *SinglePred = BB->getSinglePredecessor();
273 // Don't merge if BB's address is taken.
274 if (!SinglePred || SinglePred == BB || BB->hasAddressTaken()) continue;
276 BranchInst *Term = dyn_cast<BranchInst>(SinglePred->getTerminator());
277 if (Term && !Term->isConditional()) {
279 DEBUG(dbgs() << "To merge:\n"<< *SinglePred << "\n\n\n");
280 // Remember if SinglePred was the entry block of the function.
281 // If so, we will need to move BB back to the entry position.
282 bool isEntry = SinglePred == &SinglePred->getParent()->getEntryBlock();
283 MergeBasicBlockIntoOnlyPred(BB, this);
285 if (isEntry && BB != &BB->getParent()->getEntryBlock())
286 BB->moveBefore(&BB->getParent()->getEntryBlock());
288 // We have erased a block. Update the iterator.
295 /// EliminateMostlyEmptyBlocks - eliminate blocks that contain only PHI nodes,
296 /// debug info directives, and an unconditional branch. Passes before isel
297 /// (e.g. LSR/loopsimplify) often split edges in ways that are non-optimal for
298 /// isel. Start by eliminating these blocks so we can split them the way we
300 bool CodeGenPrepare::EliminateMostlyEmptyBlocks(Function &F) {
301 bool MadeChange = false;
302 // Note that this intentionally skips the entry block.
303 for (Function::iterator I = std::next(F.begin()), E = F.end(); I != E;) {
304 BasicBlock *BB = I++;
306 // If this block doesn't end with an uncond branch, ignore it.
307 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
308 if (!BI || !BI->isUnconditional())
311 // If the instruction before the branch (skipping debug info) isn't a phi
312 // node, then other stuff is happening here.
313 BasicBlock::iterator BBI = BI;
314 if (BBI != BB->begin()) {
316 while (isa<DbgInfoIntrinsic>(BBI)) {
317 if (BBI == BB->begin())
321 if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI))
325 // Do not break infinite loops.
326 BasicBlock *DestBB = BI->getSuccessor(0);
330 if (!CanMergeBlocks(BB, DestBB))
333 EliminateMostlyEmptyBlock(BB);
339 /// CanMergeBlocks - Return true if we can merge BB into DestBB if there is a
340 /// single uncond branch between them, and BB contains no other non-phi
342 bool CodeGenPrepare::CanMergeBlocks(const BasicBlock *BB,
343 const BasicBlock *DestBB) const {
344 // We only want to eliminate blocks whose phi nodes are used by phi nodes in
345 // the successor. If there are more complex condition (e.g. preheaders),
346 // don't mess around with them.
347 BasicBlock::const_iterator BBI = BB->begin();
348 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
349 for (const User *U : PN->users()) {
350 const Instruction *UI = cast<Instruction>(U);
351 if (UI->getParent() != DestBB || !isa<PHINode>(UI))
353 // If User is inside DestBB block and it is a PHINode then check
354 // incoming value. If incoming value is not from BB then this is
355 // a complex condition (e.g. preheaders) we want to avoid here.
356 if (UI->getParent() == DestBB) {
357 if (const PHINode *UPN = dyn_cast<PHINode>(UI))
358 for (unsigned I = 0, E = UPN->getNumIncomingValues(); I != E; ++I) {
359 Instruction *Insn = dyn_cast<Instruction>(UPN->getIncomingValue(I));
360 if (Insn && Insn->getParent() == BB &&
361 Insn->getParent() != UPN->getIncomingBlock(I))
368 // If BB and DestBB contain any common predecessors, then the phi nodes in BB
369 // and DestBB may have conflicting incoming values for the block. If so, we
370 // can't merge the block.
371 const PHINode *DestBBPN = dyn_cast<PHINode>(DestBB->begin());
372 if (!DestBBPN) return true; // no conflict.
374 // Collect the preds of BB.
375 SmallPtrSet<const BasicBlock*, 16> BBPreds;
376 if (const PHINode *BBPN = dyn_cast<PHINode>(BB->begin())) {
377 // It is faster to get preds from a PHI than with pred_iterator.
378 for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i)
379 BBPreds.insert(BBPN->getIncomingBlock(i));
381 BBPreds.insert(pred_begin(BB), pred_end(BB));
384 // Walk the preds of DestBB.
385 for (unsigned i = 0, e = DestBBPN->getNumIncomingValues(); i != e; ++i) {
386 BasicBlock *Pred = DestBBPN->getIncomingBlock(i);
387 if (BBPreds.count(Pred)) { // Common predecessor?
388 BBI = DestBB->begin();
389 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
390 const Value *V1 = PN->getIncomingValueForBlock(Pred);
391 const Value *V2 = PN->getIncomingValueForBlock(BB);
393 // If V2 is a phi node in BB, look up what the mapped value will be.
394 if (const PHINode *V2PN = dyn_cast<PHINode>(V2))
395 if (V2PN->getParent() == BB)
396 V2 = V2PN->getIncomingValueForBlock(Pred);
398 // If there is a conflict, bail out.
399 if (V1 != V2) return false;
408 /// EliminateMostlyEmptyBlock - Eliminate a basic block that have only phi's and
409 /// an unconditional branch in it.
410 void CodeGenPrepare::EliminateMostlyEmptyBlock(BasicBlock *BB) {
411 BranchInst *BI = cast<BranchInst>(BB->getTerminator());
412 BasicBlock *DestBB = BI->getSuccessor(0);
414 DEBUG(dbgs() << "MERGING MOSTLY EMPTY BLOCKS - BEFORE:\n" << *BB << *DestBB);
416 // If the destination block has a single pred, then this is a trivial edge,
418 if (BasicBlock *SinglePred = DestBB->getSinglePredecessor()) {
419 if (SinglePred != DestBB) {
420 // Remember if SinglePred was the entry block of the function. If so, we
421 // will need to move BB back to the entry position.
422 bool isEntry = SinglePred == &SinglePred->getParent()->getEntryBlock();
423 MergeBasicBlockIntoOnlyPred(DestBB, this);
425 if (isEntry && BB != &BB->getParent()->getEntryBlock())
426 BB->moveBefore(&BB->getParent()->getEntryBlock());
428 DEBUG(dbgs() << "AFTER:\n" << *DestBB << "\n\n\n");
433 // Otherwise, we have multiple predecessors of BB. Update the PHIs in DestBB
434 // to handle the new incoming edges it is about to have.
436 for (BasicBlock::iterator BBI = DestBB->begin();
437 (PN = dyn_cast<PHINode>(BBI)); ++BBI) {
438 // Remove the incoming value for BB, and remember it.
439 Value *InVal = PN->removeIncomingValue(BB, false);
441 // Two options: either the InVal is a phi node defined in BB or it is some
442 // value that dominates BB.
443 PHINode *InValPhi = dyn_cast<PHINode>(InVal);
444 if (InValPhi && InValPhi->getParent() == BB) {
445 // Add all of the input values of the input PHI as inputs of this phi.
446 for (unsigned i = 0, e = InValPhi->getNumIncomingValues(); i != e; ++i)
447 PN->addIncoming(InValPhi->getIncomingValue(i),
448 InValPhi->getIncomingBlock(i));
450 // Otherwise, add one instance of the dominating value for each edge that
451 // we will be adding.
452 if (PHINode *BBPN = dyn_cast<PHINode>(BB->begin())) {
453 for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i)
454 PN->addIncoming(InVal, BBPN->getIncomingBlock(i));
456 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
457 PN->addIncoming(InVal, *PI);
462 // The PHIs are now updated, change everything that refers to BB to use
463 // DestBB and remove BB.
464 BB->replaceAllUsesWith(DestBB);
465 if (DT && !ModifiedDT) {
466 BasicBlock *BBIDom = DT->getNode(BB)->getIDom()->getBlock();
467 BasicBlock *DestBBIDom = DT->getNode(DestBB)->getIDom()->getBlock();
468 BasicBlock *NewIDom = DT->findNearestCommonDominator(BBIDom, DestBBIDom);
469 DT->changeImmediateDominator(DestBB, NewIDom);
472 BB->eraseFromParent();
475 DEBUG(dbgs() << "AFTER:\n" << *DestBB << "\n\n\n");
478 /// SinkCast - Sink the specified cast instruction into its user blocks
479 static bool SinkCast(CastInst *CI) {
480 BasicBlock *DefBB = CI->getParent();
482 /// InsertedCasts - Only insert a cast in each block once.
483 DenseMap<BasicBlock*, CastInst*> InsertedCasts;
485 bool MadeChange = false;
486 for (Value::user_iterator UI = CI->user_begin(), E = CI->user_end();
488 Use &TheUse = UI.getUse();
489 Instruction *User = cast<Instruction>(*UI);
491 // Figure out which BB this cast is used in. For PHI's this is the
492 // appropriate predecessor block.
493 BasicBlock *UserBB = User->getParent();
494 if (PHINode *PN = dyn_cast<PHINode>(User)) {
495 UserBB = PN->getIncomingBlock(TheUse);
498 // Preincrement use iterator so we don't invalidate it.
501 // If this user is in the same block as the cast, don't change the cast.
502 if (UserBB == DefBB) continue;
504 // If we have already inserted a cast into this block, use it.
505 CastInst *&InsertedCast = InsertedCasts[UserBB];
508 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
510 CastInst::Create(CI->getOpcode(), CI->getOperand(0), CI->getType(), "",
515 // Replace a use of the cast with a use of the new cast.
516 TheUse = InsertedCast;
520 // If we removed all uses, nuke the cast.
521 if (CI->use_empty()) {
522 CI->eraseFromParent();
529 /// OptimizeNoopCopyExpression - If the specified cast instruction is a noop
530 /// copy (e.g. it's casting from one pointer type to another, i32->i8 on PPC),
531 /// sink it into user blocks to reduce the number of virtual
532 /// registers that must be created and coalesced.
534 /// Return true if any changes are made.
536 static bool OptimizeNoopCopyExpression(CastInst *CI, const TargetLowering &TLI){
537 // If this is a noop copy,
538 EVT SrcVT = TLI.getValueType(CI->getOperand(0)->getType());
539 EVT DstVT = TLI.getValueType(CI->getType());
541 // This is an fp<->int conversion?
542 if (SrcVT.isInteger() != DstVT.isInteger())
545 // If this is an extension, it will be a zero or sign extension, which
547 if (SrcVT.bitsLT(DstVT)) return false;
549 // If these values will be promoted, find out what they will be promoted
550 // to. This helps us consider truncates on PPC as noop copies when they
552 if (TLI.getTypeAction(CI->getContext(), SrcVT) ==
553 TargetLowering::TypePromoteInteger)
554 SrcVT = TLI.getTypeToTransformTo(CI->getContext(), SrcVT);
555 if (TLI.getTypeAction(CI->getContext(), DstVT) ==
556 TargetLowering::TypePromoteInteger)
557 DstVT = TLI.getTypeToTransformTo(CI->getContext(), DstVT);
559 // If, after promotion, these are the same types, this is a noop copy.
566 /// OptimizeCmpExpression - sink the given CmpInst into user blocks to reduce
567 /// the number of virtual registers that must be created and coalesced. This is
568 /// a clear win except on targets with multiple condition code registers
569 /// (PowerPC), where it might lose; some adjustment may be wanted there.
571 /// Return true if any changes are made.
572 static bool OptimizeCmpExpression(CmpInst *CI) {
573 BasicBlock *DefBB = CI->getParent();
575 /// InsertedCmp - Only insert a cmp in each block once.
576 DenseMap<BasicBlock*, CmpInst*> InsertedCmps;
578 bool MadeChange = false;
579 for (Value::user_iterator UI = CI->user_begin(), E = CI->user_end();
581 Use &TheUse = UI.getUse();
582 Instruction *User = cast<Instruction>(*UI);
584 // Preincrement use iterator so we don't invalidate it.
587 // Don't bother for PHI nodes.
588 if (isa<PHINode>(User))
591 // Figure out which BB this cmp is used in.
592 BasicBlock *UserBB = User->getParent();
594 // If this user is in the same block as the cmp, don't change the cmp.
595 if (UserBB == DefBB) continue;
597 // If we have already inserted a cmp into this block, use it.
598 CmpInst *&InsertedCmp = InsertedCmps[UserBB];
601 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
603 CmpInst::Create(CI->getOpcode(),
604 CI->getPredicate(), CI->getOperand(0),
605 CI->getOperand(1), "", InsertPt);
609 // Replace a use of the cmp with a use of the new cmp.
610 TheUse = InsertedCmp;
614 // If we removed all uses, nuke the cmp.
616 CI->eraseFromParent();
621 /// isExtractBitsCandidateUse - Check if the candidates could
622 /// be combined with shift instruction, which includes:
623 /// 1. Truncate instruction
624 /// 2. And instruction and the imm is a mask of the low bits:
625 /// imm & (imm+1) == 0
626 static bool isExtractBitsCandidateUse(Instruction *User) {
627 if (!isa<TruncInst>(User)) {
628 if (User->getOpcode() != Instruction::And ||
629 !isa<ConstantInt>(User->getOperand(1)))
632 const APInt &Cimm = cast<ConstantInt>(User->getOperand(1))->getValue();
634 if ((Cimm & (Cimm + 1)).getBoolValue())
640 /// SinkShiftAndTruncate - sink both shift and truncate instruction
641 /// to the use of truncate's BB.
643 SinkShiftAndTruncate(BinaryOperator *ShiftI, Instruction *User, ConstantInt *CI,
644 DenseMap<BasicBlock *, BinaryOperator *> &InsertedShifts,
645 const TargetLowering &TLI) {
646 BasicBlock *UserBB = User->getParent();
647 DenseMap<BasicBlock *, CastInst *> InsertedTruncs;
648 TruncInst *TruncI = dyn_cast<TruncInst>(User);
649 bool MadeChange = false;
651 for (Value::user_iterator TruncUI = TruncI->user_begin(),
652 TruncE = TruncI->user_end();
653 TruncUI != TruncE;) {
655 Use &TruncTheUse = TruncUI.getUse();
656 Instruction *TruncUser = cast<Instruction>(*TruncUI);
657 // Preincrement use iterator so we don't invalidate it.
661 int ISDOpcode = TLI.InstructionOpcodeToISD(TruncUser->getOpcode());
665 // If the use is actually a legal node, there will not be an
666 // implicit truncate.
667 // FIXME: always querying the result type is just an
668 // approximation; some nodes' legality is determined by the
669 // operand or other means. There's no good way to find out though.
670 if (TLI.isOperationLegalOrCustom(ISDOpcode,
671 EVT::getEVT(TruncUser->getType(), true)))
674 // Don't bother for PHI nodes.
675 if (isa<PHINode>(TruncUser))
678 BasicBlock *TruncUserBB = TruncUser->getParent();
680 if (UserBB == TruncUserBB)
683 BinaryOperator *&InsertedShift = InsertedShifts[TruncUserBB];
684 CastInst *&InsertedTrunc = InsertedTruncs[TruncUserBB];
686 if (!InsertedShift && !InsertedTrunc) {
687 BasicBlock::iterator InsertPt = TruncUserBB->getFirstInsertionPt();
689 if (ShiftI->getOpcode() == Instruction::AShr)
691 BinaryOperator::CreateAShr(ShiftI->getOperand(0), CI, "", InsertPt);
694 BinaryOperator::CreateLShr(ShiftI->getOperand(0), CI, "", InsertPt);
697 BasicBlock::iterator TruncInsertPt = TruncUserBB->getFirstInsertionPt();
700 InsertedTrunc = CastInst::Create(TruncI->getOpcode(), InsertedShift,
701 TruncI->getType(), "", TruncInsertPt);
705 TruncTheUse = InsertedTrunc;
711 /// OptimizeExtractBits - sink the shift *right* instruction into user blocks if
712 /// the uses could potentially be combined with this shift instruction and
713 /// generate BitExtract instruction. It will only be applied if the architecture
714 /// supports BitExtract instruction. Here is an example:
716 /// %x.extract.shift = lshr i64 %arg1, 32
718 /// %x.extract.trunc = trunc i64 %x.extract.shift to i16
722 /// %x.extract.shift.1 = lshr i64 %arg1, 32
723 /// %x.extract.trunc = trunc i64 %x.extract.shift.1 to i16
725 /// CodeGen will recoginze the pattern in BB2 and generate BitExtract
727 /// Return true if any changes are made.
728 static bool OptimizeExtractBits(BinaryOperator *ShiftI, ConstantInt *CI,
729 const TargetLowering &TLI) {
730 BasicBlock *DefBB = ShiftI->getParent();
732 /// Only insert instructions in each block once.
733 DenseMap<BasicBlock *, BinaryOperator *> InsertedShifts;
735 bool shiftIsLegal = TLI.isTypeLegal(TLI.getValueType(ShiftI->getType()));
737 bool MadeChange = false;
738 for (Value::user_iterator UI = ShiftI->user_begin(), E = ShiftI->user_end();
740 Use &TheUse = UI.getUse();
741 Instruction *User = cast<Instruction>(*UI);
742 // Preincrement use iterator so we don't invalidate it.
745 // Don't bother for PHI nodes.
746 if (isa<PHINode>(User))
749 if (!isExtractBitsCandidateUse(User))
752 BasicBlock *UserBB = User->getParent();
754 if (UserBB == DefBB) {
755 // If the shift and truncate instruction are in the same BB. The use of
756 // the truncate(TruncUse) may still introduce another truncate if not
757 // legal. In this case, we would like to sink both shift and truncate
758 // instruction to the BB of TruncUse.
761 // i64 shift.result = lshr i64 opnd, imm
762 // trunc.result = trunc shift.result to i16
765 // ----> We will have an implicit truncate here if the architecture does
766 // not have i16 compare.
767 // cmp i16 trunc.result, opnd2
769 if (isa<TruncInst>(User) && shiftIsLegal
770 // If the type of the truncate is legal, no trucate will be
771 // introduced in other basic blocks.
772 && (!TLI.isTypeLegal(TLI.getValueType(User->getType()))))
774 SinkShiftAndTruncate(ShiftI, User, CI, InsertedShifts, TLI);
778 // If we have already inserted a shift into this block, use it.
779 BinaryOperator *&InsertedShift = InsertedShifts[UserBB];
781 if (!InsertedShift) {
782 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
784 if (ShiftI->getOpcode() == Instruction::AShr)
786 BinaryOperator::CreateAShr(ShiftI->getOperand(0), CI, "", InsertPt);
789 BinaryOperator::CreateLShr(ShiftI->getOperand(0), CI, "", InsertPt);
794 // Replace a use of the shift with a use of the new shift.
795 TheUse = InsertedShift;
798 // If we removed all uses, nuke the shift.
799 if (ShiftI->use_empty())
800 ShiftI->eraseFromParent();
806 class CodeGenPrepareFortifiedLibCalls : public SimplifyFortifiedLibCalls {
808 void replaceCall(Value *With) override {
809 CI->replaceAllUsesWith(With);
810 CI->eraseFromParent();
812 bool isFoldable(unsigned SizeCIOp, unsigned, bool) const override {
813 if (ConstantInt *SizeCI =
814 dyn_cast<ConstantInt>(CI->getArgOperand(SizeCIOp)))
815 return SizeCI->isAllOnesValue();
819 } // end anonymous namespace
821 bool CodeGenPrepare::OptimizeCallInst(CallInst *CI) {
822 BasicBlock *BB = CI->getParent();
824 // Lower inline assembly if we can.
825 // If we found an inline asm expession, and if the target knows how to
826 // lower it to normal LLVM code, do so now.
827 if (TLI && isa<InlineAsm>(CI->getCalledValue())) {
828 if (TLI->ExpandInlineAsm(CI)) {
829 // Avoid invalidating the iterator.
830 CurInstIterator = BB->begin();
831 // Avoid processing instructions out of order, which could cause
832 // reuse before a value is defined.
836 // Sink address computing for memory operands into the block.
837 if (OptimizeInlineAsmInst(CI))
841 // Lower all uses of llvm.objectsize.*
842 IntrinsicInst *II = dyn_cast<IntrinsicInst>(CI);
843 if (II && II->getIntrinsicID() == Intrinsic::objectsize) {
844 bool Min = (cast<ConstantInt>(II->getArgOperand(1))->getZExtValue() == 1);
845 Type *ReturnTy = CI->getType();
846 Constant *RetVal = ConstantInt::get(ReturnTy, Min ? 0 : -1ULL);
848 // Substituting this can cause recursive simplifications, which can
849 // invalidate our iterator. Use a WeakVH to hold onto it in case this
851 WeakVH IterHandle(CurInstIterator);
853 replaceAndRecursivelySimplify(CI, RetVal,
854 TLI ? TLI->getDataLayout() : nullptr,
855 TLInfo, ModifiedDT ? nullptr : DT);
857 // If the iterator instruction was recursively deleted, start over at the
858 // start of the block.
859 if (IterHandle != CurInstIterator) {
860 CurInstIterator = BB->begin();
867 SmallVector<Value*, 2> PtrOps;
869 if (TLI->GetAddrModeArguments(II, PtrOps, AccessTy))
870 while (!PtrOps.empty())
871 if (OptimizeMemoryInst(II, PtrOps.pop_back_val(), AccessTy))
875 // From here on out we're working with named functions.
876 if (!CI->getCalledFunction()) return false;
878 // We'll need DataLayout from here on out.
879 const DataLayout *TD = TLI ? TLI->getDataLayout() : nullptr;
880 if (!TD) return false;
882 // Lower all default uses of _chk calls. This is very similar
883 // to what InstCombineCalls does, but here we are only lowering calls
884 // that have the default "don't know" as the objectsize. Anything else
885 // should be left alone.
886 CodeGenPrepareFortifiedLibCalls Simplifier;
887 return Simplifier.fold(CI, TD, TLInfo);
890 /// DupRetToEnableTailCallOpts - Look for opportunities to duplicate return
891 /// instructions to the predecessor to enable tail call optimizations. The
892 /// case it is currently looking for is:
895 /// %tmp0 = tail call i32 @f0()
898 /// %tmp1 = tail call i32 @f1()
901 /// %tmp2 = tail call i32 @f2()
904 /// %retval = phi i32 [ %tmp0, %bb0 ], [ %tmp1, %bb1 ], [ %tmp2, %bb2 ]
912 /// %tmp0 = tail call i32 @f0()
915 /// %tmp1 = tail call i32 @f1()
918 /// %tmp2 = tail call i32 @f2()
921 bool CodeGenPrepare::DupRetToEnableTailCallOpts(BasicBlock *BB) {
925 ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator());
929 PHINode *PN = nullptr;
930 BitCastInst *BCI = nullptr;
931 Value *V = RI->getReturnValue();
933 BCI = dyn_cast<BitCastInst>(V);
935 V = BCI->getOperand(0);
937 PN = dyn_cast<PHINode>(V);
942 if (PN && PN->getParent() != BB)
945 // It's not safe to eliminate the sign / zero extension of the return value.
946 // See llvm::isInTailCallPosition().
947 const Function *F = BB->getParent();
948 AttributeSet CallerAttrs = F->getAttributes();
949 if (CallerAttrs.hasAttribute(AttributeSet::ReturnIndex, Attribute::ZExt) ||
950 CallerAttrs.hasAttribute(AttributeSet::ReturnIndex, Attribute::SExt))
953 // Make sure there are no instructions between the PHI and return, or that the
954 // return is the first instruction in the block.
956 BasicBlock::iterator BI = BB->begin();
957 do { ++BI; } while (isa<DbgInfoIntrinsic>(BI));
959 // Also skip over the bitcast.
964 BasicBlock::iterator BI = BB->begin();
965 while (isa<DbgInfoIntrinsic>(BI)) ++BI;
970 /// Only dup the ReturnInst if the CallInst is likely to be emitted as a tail
972 SmallVector<CallInst*, 4> TailCalls;
974 for (unsigned I = 0, E = PN->getNumIncomingValues(); I != E; ++I) {
975 CallInst *CI = dyn_cast<CallInst>(PN->getIncomingValue(I));
976 // Make sure the phi value is indeed produced by the tail call.
977 if (CI && CI->hasOneUse() && CI->getParent() == PN->getIncomingBlock(I) &&
978 TLI->mayBeEmittedAsTailCall(CI))
979 TailCalls.push_back(CI);
982 SmallPtrSet<BasicBlock*, 4> VisitedBBs;
983 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) {
984 if (!VisitedBBs.insert(*PI))
987 BasicBlock::InstListType &InstList = (*PI)->getInstList();
988 BasicBlock::InstListType::reverse_iterator RI = InstList.rbegin();
989 BasicBlock::InstListType::reverse_iterator RE = InstList.rend();
990 do { ++RI; } while (RI != RE && isa<DbgInfoIntrinsic>(&*RI));
994 CallInst *CI = dyn_cast<CallInst>(&*RI);
995 if (CI && CI->use_empty() && TLI->mayBeEmittedAsTailCall(CI))
996 TailCalls.push_back(CI);
1000 bool Changed = false;
1001 for (unsigned i = 0, e = TailCalls.size(); i != e; ++i) {
1002 CallInst *CI = TailCalls[i];
1005 // Conservatively require the attributes of the call to match those of the
1006 // return. Ignore noalias because it doesn't affect the call sequence.
1007 AttributeSet CalleeAttrs = CS.getAttributes();
1008 if (AttrBuilder(CalleeAttrs, AttributeSet::ReturnIndex).
1009 removeAttribute(Attribute::NoAlias) !=
1010 AttrBuilder(CalleeAttrs, AttributeSet::ReturnIndex).
1011 removeAttribute(Attribute::NoAlias))
1014 // Make sure the call instruction is followed by an unconditional branch to
1015 // the return block.
1016 BasicBlock *CallBB = CI->getParent();
1017 BranchInst *BI = dyn_cast<BranchInst>(CallBB->getTerminator());
1018 if (!BI || !BI->isUnconditional() || BI->getSuccessor(0) != BB)
1021 // Duplicate the return into CallBB.
1022 (void)FoldReturnIntoUncondBranch(RI, BB, CallBB);
1023 ModifiedDT = Changed = true;
1027 // If we eliminated all predecessors of the block, delete the block now.
1028 if (Changed && !BB->hasAddressTaken() && pred_begin(BB) == pred_end(BB))
1029 BB->eraseFromParent();
1034 //===----------------------------------------------------------------------===//
1035 // Memory Optimization
1036 //===----------------------------------------------------------------------===//
1040 /// ExtAddrMode - This is an extended version of TargetLowering::AddrMode
1041 /// which holds actual Value*'s for register values.
1042 struct ExtAddrMode : public TargetLowering::AddrMode {
1045 ExtAddrMode() : BaseReg(nullptr), ScaledReg(nullptr) {}
1046 void print(raw_ostream &OS) const;
1049 bool operator==(const ExtAddrMode& O) const {
1050 return (BaseReg == O.BaseReg) && (ScaledReg == O.ScaledReg) &&
1051 (BaseGV == O.BaseGV) && (BaseOffs == O.BaseOffs) &&
1052 (HasBaseReg == O.HasBaseReg) && (Scale == O.Scale);
1057 static inline raw_ostream &operator<<(raw_ostream &OS, const ExtAddrMode &AM) {
1063 void ExtAddrMode::print(raw_ostream &OS) const {
1064 bool NeedPlus = false;
1067 OS << (NeedPlus ? " + " : "")
1069 BaseGV->printAsOperand(OS, /*PrintType=*/false);
1074 OS << (NeedPlus ? " + " : "")
1080 OS << (NeedPlus ? " + " : "")
1082 BaseReg->printAsOperand(OS, /*PrintType=*/false);
1086 OS << (NeedPlus ? " + " : "")
1088 ScaledReg->printAsOperand(OS, /*PrintType=*/false);
1094 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1095 void ExtAddrMode::dump() const {
1101 /// \brief This class provides transaction based operation on the IR.
1102 /// Every change made through this class is recorded in the internal state and
1103 /// can be undone (rollback) until commit is called.
1104 class TypePromotionTransaction {
1106 /// \brief This represents the common interface of the individual transaction.
1107 /// Each class implements the logic for doing one specific modification on
1108 /// the IR via the TypePromotionTransaction.
1109 class TypePromotionAction {
1111 /// The Instruction modified.
1115 /// \brief Constructor of the action.
1116 /// The constructor performs the related action on the IR.
1117 TypePromotionAction(Instruction *Inst) : Inst(Inst) {}
1119 virtual ~TypePromotionAction() {}
1121 /// \brief Undo the modification done by this action.
1122 /// When this method is called, the IR must be in the same state as it was
1123 /// before this action was applied.
1124 /// \pre Undoing the action works if and only if the IR is in the exact same
1125 /// state as it was directly after this action was applied.
1126 virtual void undo() = 0;
1128 /// \brief Advocate every change made by this action.
1129 /// When the results on the IR of the action are to be kept, it is important
1130 /// to call this function, otherwise hidden information may be kept forever.
1131 virtual void commit() {
1132 // Nothing to be done, this action is not doing anything.
1136 /// \brief Utility to remember the position of an instruction.
1137 class InsertionHandler {
1138 /// Position of an instruction.
1139 /// Either an instruction:
1140 /// - Is the first in a basic block: BB is used.
1141 /// - Has a previous instructon: PrevInst is used.
1143 Instruction *PrevInst;
1146 /// Remember whether or not the instruction had a previous instruction.
1147 bool HasPrevInstruction;
1150 /// \brief Record the position of \p Inst.
1151 InsertionHandler(Instruction *Inst) {
1152 BasicBlock::iterator It = Inst;
1153 HasPrevInstruction = (It != (Inst->getParent()->begin()));
1154 if (HasPrevInstruction)
1155 Point.PrevInst = --It;
1157 Point.BB = Inst->getParent();
1160 /// \brief Insert \p Inst at the recorded position.
1161 void insert(Instruction *Inst) {
1162 if (HasPrevInstruction) {
1163 if (Inst->getParent())
1164 Inst->removeFromParent();
1165 Inst->insertAfter(Point.PrevInst);
1167 Instruction *Position = Point.BB->getFirstInsertionPt();
1168 if (Inst->getParent())
1169 Inst->moveBefore(Position);
1171 Inst->insertBefore(Position);
1176 /// \brief Move an instruction before another.
1177 class InstructionMoveBefore : public TypePromotionAction {
1178 /// Original position of the instruction.
1179 InsertionHandler Position;
1182 /// \brief Move \p Inst before \p Before.
1183 InstructionMoveBefore(Instruction *Inst, Instruction *Before)
1184 : TypePromotionAction(Inst), Position(Inst) {
1185 DEBUG(dbgs() << "Do: move: " << *Inst << "\nbefore: " << *Before << "\n");
1186 Inst->moveBefore(Before);
1189 /// \brief Move the instruction back to its original position.
1190 void undo() override {
1191 DEBUG(dbgs() << "Undo: moveBefore: " << *Inst << "\n");
1192 Position.insert(Inst);
1196 /// \brief Set the operand of an instruction with a new value.
1197 class OperandSetter : public TypePromotionAction {
1198 /// Original operand of the instruction.
1200 /// Index of the modified instruction.
1204 /// \brief Set \p Idx operand of \p Inst with \p NewVal.
1205 OperandSetter(Instruction *Inst, unsigned Idx, Value *NewVal)
1206 : TypePromotionAction(Inst), Idx(Idx) {
1207 DEBUG(dbgs() << "Do: setOperand: " << Idx << "\n"
1208 << "for:" << *Inst << "\n"
1209 << "with:" << *NewVal << "\n");
1210 Origin = Inst->getOperand(Idx);
1211 Inst->setOperand(Idx, NewVal);
1214 /// \brief Restore the original value of the instruction.
1215 void undo() override {
1216 DEBUG(dbgs() << "Undo: setOperand:" << Idx << "\n"
1217 << "for: " << *Inst << "\n"
1218 << "with: " << *Origin << "\n");
1219 Inst->setOperand(Idx, Origin);
1223 /// \brief Hide the operands of an instruction.
1224 /// Do as if this instruction was not using any of its operands.
1225 class OperandsHider : public TypePromotionAction {
1226 /// The list of original operands.
1227 SmallVector<Value *, 4> OriginalValues;
1230 /// \brief Remove \p Inst from the uses of the operands of \p Inst.
1231 OperandsHider(Instruction *Inst) : TypePromotionAction(Inst) {
1232 DEBUG(dbgs() << "Do: OperandsHider: " << *Inst << "\n");
1233 unsigned NumOpnds = Inst->getNumOperands();
1234 OriginalValues.reserve(NumOpnds);
1235 for (unsigned It = 0; It < NumOpnds; ++It) {
1236 // Save the current operand.
1237 Value *Val = Inst->getOperand(It);
1238 OriginalValues.push_back(Val);
1240 // We could use OperandSetter here, but that would implied an overhead
1241 // that we are not willing to pay.
1242 Inst->setOperand(It, UndefValue::get(Val->getType()));
1246 /// \brief Restore the original list of uses.
1247 void undo() override {
1248 DEBUG(dbgs() << "Undo: OperandsHider: " << *Inst << "\n");
1249 for (unsigned It = 0, EndIt = OriginalValues.size(); It != EndIt; ++It)
1250 Inst->setOperand(It, OriginalValues[It]);
1254 /// \brief Build a truncate instruction.
1255 class TruncBuilder : public TypePromotionAction {
1257 /// \brief Build a truncate instruction of \p Opnd producing a \p Ty
1259 /// trunc Opnd to Ty.
1260 TruncBuilder(Instruction *Opnd, Type *Ty) : TypePromotionAction(Opnd) {
1261 IRBuilder<> Builder(Opnd);
1262 Inst = cast<Instruction>(Builder.CreateTrunc(Opnd, Ty, "promoted"));
1263 DEBUG(dbgs() << "Do: TruncBuilder: " << *Inst << "\n");
1266 /// \brief Get the built instruction.
1267 Instruction *getBuiltInstruction() { return Inst; }
1269 /// \brief Remove the built instruction.
1270 void undo() override {
1271 DEBUG(dbgs() << "Undo: TruncBuilder: " << *Inst << "\n");
1272 Inst->eraseFromParent();
1276 /// \brief Build a sign extension instruction.
1277 class SExtBuilder : public TypePromotionAction {
1279 /// \brief Build a sign extension instruction of \p Opnd producing a \p Ty
1281 /// sext Opnd to Ty.
1282 SExtBuilder(Instruction *InsertPt, Value *Opnd, Type *Ty)
1283 : TypePromotionAction(Inst) {
1284 IRBuilder<> Builder(InsertPt);
1285 Inst = cast<Instruction>(Builder.CreateSExt(Opnd, Ty, "promoted"));
1286 DEBUG(dbgs() << "Do: SExtBuilder: " << *Inst << "\n");
1289 /// \brief Get the built instruction.
1290 Instruction *getBuiltInstruction() { return Inst; }
1292 /// \brief Remove the built instruction.
1293 void undo() override {
1294 DEBUG(dbgs() << "Undo: SExtBuilder: " << *Inst << "\n");
1295 Inst->eraseFromParent();
1299 /// \brief Mutate an instruction to another type.
1300 class TypeMutator : public TypePromotionAction {
1301 /// Record the original type.
1305 /// \brief Mutate the type of \p Inst into \p NewTy.
1306 TypeMutator(Instruction *Inst, Type *NewTy)
1307 : TypePromotionAction(Inst), OrigTy(Inst->getType()) {
1308 DEBUG(dbgs() << "Do: MutateType: " << *Inst << " with " << *NewTy
1310 Inst->mutateType(NewTy);
1313 /// \brief Mutate the instruction back to its original type.
1314 void undo() override {
1315 DEBUG(dbgs() << "Undo: MutateType: " << *Inst << " with " << *OrigTy
1317 Inst->mutateType(OrigTy);
1321 /// \brief Replace the uses of an instruction by another instruction.
1322 class UsesReplacer : public TypePromotionAction {
1323 /// Helper structure to keep track of the replaced uses.
1324 struct InstructionAndIdx {
1325 /// The instruction using the instruction.
1327 /// The index where this instruction is used for Inst.
1329 InstructionAndIdx(Instruction *Inst, unsigned Idx)
1330 : Inst(Inst), Idx(Idx) {}
1333 /// Keep track of the original uses (pair Instruction, Index).
1334 SmallVector<InstructionAndIdx, 4> OriginalUses;
1335 typedef SmallVectorImpl<InstructionAndIdx>::iterator use_iterator;
1338 /// \brief Replace all the use of \p Inst by \p New.
1339 UsesReplacer(Instruction *Inst, Value *New) : TypePromotionAction(Inst) {
1340 DEBUG(dbgs() << "Do: UsersReplacer: " << *Inst << " with " << *New
1342 // Record the original uses.
1343 for (Use &U : Inst->uses()) {
1344 Instruction *UserI = cast<Instruction>(U.getUser());
1345 OriginalUses.push_back(InstructionAndIdx(UserI, U.getOperandNo()));
1347 // Now, we can replace the uses.
1348 Inst->replaceAllUsesWith(New);
1351 /// \brief Reassign the original uses of Inst to Inst.
1352 void undo() override {
1353 DEBUG(dbgs() << "Undo: UsersReplacer: " << *Inst << "\n");
1354 for (use_iterator UseIt = OriginalUses.begin(),
1355 EndIt = OriginalUses.end();
1356 UseIt != EndIt; ++UseIt) {
1357 UseIt->Inst->setOperand(UseIt->Idx, Inst);
1362 /// \brief Remove an instruction from the IR.
1363 class InstructionRemover : public TypePromotionAction {
1364 /// Original position of the instruction.
1365 InsertionHandler Inserter;
1366 /// Helper structure to hide all the link to the instruction. In other
1367 /// words, this helps to do as if the instruction was removed.
1368 OperandsHider Hider;
1369 /// Keep track of the uses replaced, if any.
1370 UsesReplacer *Replacer;
1373 /// \brief Remove all reference of \p Inst and optinally replace all its
1375 /// \pre If !Inst->use_empty(), then New != nullptr
1376 InstructionRemover(Instruction *Inst, Value *New = nullptr)
1377 : TypePromotionAction(Inst), Inserter(Inst), Hider(Inst),
1380 Replacer = new UsesReplacer(Inst, New);
1381 DEBUG(dbgs() << "Do: InstructionRemover: " << *Inst << "\n");
1382 Inst->removeFromParent();
1385 ~InstructionRemover() { delete Replacer; }
1387 /// \brief Really remove the instruction.
1388 void commit() override { delete Inst; }
1390 /// \brief Resurrect the instruction and reassign it to the proper uses if
1391 /// new value was provided when build this action.
1392 void undo() override {
1393 DEBUG(dbgs() << "Undo: InstructionRemover: " << *Inst << "\n");
1394 Inserter.insert(Inst);
1402 /// Restoration point.
1403 /// The restoration point is a pointer to an action instead of an iterator
1404 /// because the iterator may be invalidated but not the pointer.
1405 typedef const TypePromotionAction *ConstRestorationPt;
1406 /// Advocate every changes made in that transaction.
1408 /// Undo all the changes made after the given point.
1409 void rollback(ConstRestorationPt Point);
1410 /// Get the current restoration point.
1411 ConstRestorationPt getRestorationPoint() const;
1413 /// \name API for IR modification with state keeping to support rollback.
1415 /// Same as Instruction::setOperand.
1416 void setOperand(Instruction *Inst, unsigned Idx, Value *NewVal);
1417 /// Same as Instruction::eraseFromParent.
1418 void eraseInstruction(Instruction *Inst, Value *NewVal = nullptr);
1419 /// Same as Value::replaceAllUsesWith.
1420 void replaceAllUsesWith(Instruction *Inst, Value *New);
1421 /// Same as Value::mutateType.
1422 void mutateType(Instruction *Inst, Type *NewTy);
1423 /// Same as IRBuilder::createTrunc.
1424 Instruction *createTrunc(Instruction *Opnd, Type *Ty);
1425 /// Same as IRBuilder::createSExt.
1426 Instruction *createSExt(Instruction *Inst, Value *Opnd, Type *Ty);
1427 /// Same as Instruction::moveBefore.
1428 void moveBefore(Instruction *Inst, Instruction *Before);
1432 /// The ordered list of actions made so far.
1433 SmallVector<std::unique_ptr<TypePromotionAction>, 16> Actions;
1434 typedef SmallVectorImpl<std::unique_ptr<TypePromotionAction>>::iterator CommitPt;
1437 void TypePromotionTransaction::setOperand(Instruction *Inst, unsigned Idx,
1440 make_unique<TypePromotionTransaction::OperandSetter>(Inst, Idx, NewVal));
1443 void TypePromotionTransaction::eraseInstruction(Instruction *Inst,
1446 make_unique<TypePromotionTransaction::InstructionRemover>(Inst, NewVal));
1449 void TypePromotionTransaction::replaceAllUsesWith(Instruction *Inst,
1451 Actions.push_back(make_unique<TypePromotionTransaction::UsesReplacer>(Inst, New));
1454 void TypePromotionTransaction::mutateType(Instruction *Inst, Type *NewTy) {
1455 Actions.push_back(make_unique<TypePromotionTransaction::TypeMutator>(Inst, NewTy));
1458 Instruction *TypePromotionTransaction::createTrunc(Instruction *Opnd,
1460 std::unique_ptr<TruncBuilder> Ptr(new TruncBuilder(Opnd, Ty));
1461 Instruction *I = Ptr->getBuiltInstruction();
1462 Actions.push_back(std::move(Ptr));
1466 Instruction *TypePromotionTransaction::createSExt(Instruction *Inst,
1467 Value *Opnd, Type *Ty) {
1468 std::unique_ptr<SExtBuilder> Ptr(new SExtBuilder(Inst, Opnd, Ty));
1469 Instruction *I = Ptr->getBuiltInstruction();
1470 Actions.push_back(std::move(Ptr));
1474 void TypePromotionTransaction::moveBefore(Instruction *Inst,
1475 Instruction *Before) {
1477 make_unique<TypePromotionTransaction::InstructionMoveBefore>(Inst, Before));
1480 TypePromotionTransaction::ConstRestorationPt
1481 TypePromotionTransaction::getRestorationPoint() const {
1482 return !Actions.empty() ? Actions.back().get() : nullptr;
1485 void TypePromotionTransaction::commit() {
1486 for (CommitPt It = Actions.begin(), EndIt = Actions.end(); It != EndIt;
1492 void TypePromotionTransaction::rollback(
1493 TypePromotionTransaction::ConstRestorationPt Point) {
1494 while (!Actions.empty() && Point != Actions.back().get()) {
1495 std::unique_ptr<TypePromotionAction> Curr = Actions.pop_back_val();
1500 /// \brief A helper class for matching addressing modes.
1502 /// This encapsulates the logic for matching the target-legal addressing modes.
1503 class AddressingModeMatcher {
1504 SmallVectorImpl<Instruction*> &AddrModeInsts;
1505 const TargetLowering &TLI;
1507 /// AccessTy/MemoryInst - This is the type for the access (e.g. double) and
1508 /// the memory instruction that we're computing this address for.
1510 Instruction *MemoryInst;
1512 /// AddrMode - This is the addressing mode that we're building up. This is
1513 /// part of the return value of this addressing mode matching stuff.
1514 ExtAddrMode &AddrMode;
1516 /// The truncate instruction inserted by other CodeGenPrepare optimizations.
1517 const SetOfInstrs &InsertedTruncs;
1518 /// A map from the instructions to their type before promotion.
1519 InstrToOrigTy &PromotedInsts;
1520 /// The ongoing transaction where every action should be registered.
1521 TypePromotionTransaction &TPT;
1523 /// IgnoreProfitability - This is set to true when we should not do
1524 /// profitability checks. When true, IsProfitableToFoldIntoAddressingMode
1525 /// always returns true.
1526 bool IgnoreProfitability;
1528 AddressingModeMatcher(SmallVectorImpl<Instruction*> &AMI,
1529 const TargetLowering &T, Type *AT,
1530 Instruction *MI, ExtAddrMode &AM,
1531 const SetOfInstrs &InsertedTruncs,
1532 InstrToOrigTy &PromotedInsts,
1533 TypePromotionTransaction &TPT)
1534 : AddrModeInsts(AMI), TLI(T), AccessTy(AT), MemoryInst(MI), AddrMode(AM),
1535 InsertedTruncs(InsertedTruncs), PromotedInsts(PromotedInsts), TPT(TPT) {
1536 IgnoreProfitability = false;
1540 /// Match - Find the maximal addressing mode that a load/store of V can fold,
1541 /// give an access type of AccessTy. This returns a list of involved
1542 /// instructions in AddrModeInsts.
1543 /// \p InsertedTruncs The truncate instruction inserted by other
1546 /// \p PromotedInsts maps the instructions to their type before promotion.
1547 /// \p The ongoing transaction where every action should be registered.
1548 static ExtAddrMode Match(Value *V, Type *AccessTy,
1549 Instruction *MemoryInst,
1550 SmallVectorImpl<Instruction*> &AddrModeInsts,
1551 const TargetLowering &TLI,
1552 const SetOfInstrs &InsertedTruncs,
1553 InstrToOrigTy &PromotedInsts,
1554 TypePromotionTransaction &TPT) {
1557 bool Success = AddressingModeMatcher(AddrModeInsts, TLI, AccessTy,
1558 MemoryInst, Result, InsertedTruncs,
1559 PromotedInsts, TPT).MatchAddr(V, 0);
1560 (void)Success; assert(Success && "Couldn't select *anything*?");
1564 bool MatchScaledValue(Value *ScaleReg, int64_t Scale, unsigned Depth);
1565 bool MatchAddr(Value *V, unsigned Depth);
1566 bool MatchOperationAddr(User *Operation, unsigned Opcode, unsigned Depth,
1567 bool *MovedAway = nullptr);
1568 bool IsProfitableToFoldIntoAddressingMode(Instruction *I,
1569 ExtAddrMode &AMBefore,
1570 ExtAddrMode &AMAfter);
1571 bool ValueAlreadyLiveAtInst(Value *Val, Value *KnownLive1, Value *KnownLive2);
1572 bool IsPromotionProfitable(unsigned MatchedSize, unsigned SizeWithPromotion,
1573 Value *PromotedOperand) const;
1576 /// MatchScaledValue - Try adding ScaleReg*Scale to the current addressing mode.
1577 /// Return true and update AddrMode if this addr mode is legal for the target,
1579 bool AddressingModeMatcher::MatchScaledValue(Value *ScaleReg, int64_t Scale,
1581 // If Scale is 1, then this is the same as adding ScaleReg to the addressing
1582 // mode. Just process that directly.
1584 return MatchAddr(ScaleReg, Depth);
1586 // If the scale is 0, it takes nothing to add this.
1590 // If we already have a scale of this value, we can add to it, otherwise, we
1591 // need an available scale field.
1592 if (AddrMode.Scale != 0 && AddrMode.ScaledReg != ScaleReg)
1595 ExtAddrMode TestAddrMode = AddrMode;
1597 // Add scale to turn X*4+X*3 -> X*7. This could also do things like
1598 // [A+B + A*7] -> [B+A*8].
1599 TestAddrMode.Scale += Scale;
1600 TestAddrMode.ScaledReg = ScaleReg;
1602 // If the new address isn't legal, bail out.
1603 if (!TLI.isLegalAddressingMode(TestAddrMode, AccessTy))
1606 // It was legal, so commit it.
1607 AddrMode = TestAddrMode;
1609 // Okay, we decided that we can add ScaleReg+Scale to AddrMode. Check now
1610 // to see if ScaleReg is actually X+C. If so, we can turn this into adding
1611 // X*Scale + C*Scale to addr mode.
1612 ConstantInt *CI = nullptr; Value *AddLHS = nullptr;
1613 if (isa<Instruction>(ScaleReg) && // not a constant expr.
1614 match(ScaleReg, m_Add(m_Value(AddLHS), m_ConstantInt(CI)))) {
1615 TestAddrMode.ScaledReg = AddLHS;
1616 TestAddrMode.BaseOffs += CI->getSExtValue()*TestAddrMode.Scale;
1618 // If this addressing mode is legal, commit it and remember that we folded
1619 // this instruction.
1620 if (TLI.isLegalAddressingMode(TestAddrMode, AccessTy)) {
1621 AddrModeInsts.push_back(cast<Instruction>(ScaleReg));
1622 AddrMode = TestAddrMode;
1627 // Otherwise, not (x+c)*scale, just return what we have.
1631 /// MightBeFoldableInst - This is a little filter, which returns true if an
1632 /// addressing computation involving I might be folded into a load/store
1633 /// accessing it. This doesn't need to be perfect, but needs to accept at least
1634 /// the set of instructions that MatchOperationAddr can.
1635 static bool MightBeFoldableInst(Instruction *I) {
1636 switch (I->getOpcode()) {
1637 case Instruction::BitCast:
1638 case Instruction::AddrSpaceCast:
1639 // Don't touch identity bitcasts.
1640 if (I->getType() == I->getOperand(0)->getType())
1642 return I->getType()->isPointerTy() || I->getType()->isIntegerTy();
1643 case Instruction::PtrToInt:
1644 // PtrToInt is always a noop, as we know that the int type is pointer sized.
1646 case Instruction::IntToPtr:
1647 // We know the input is intptr_t, so this is foldable.
1649 case Instruction::Add:
1651 case Instruction::Mul:
1652 case Instruction::Shl:
1653 // Can only handle X*C and X << C.
1654 return isa<ConstantInt>(I->getOperand(1));
1655 case Instruction::GetElementPtr:
1662 /// \brief Hepler class to perform type promotion.
1663 class TypePromotionHelper {
1664 /// \brief Utility function to check whether or not a sign extension of
1665 /// \p Inst with \p ConsideredSExtType can be moved through \p Inst by either
1666 /// using the operands of \p Inst or promoting \p Inst.
1667 /// In other words, check if:
1668 /// sext (Ty Inst opnd1 opnd2 ... opndN) to ConsideredSExtType.
1669 /// #1 Promotion applies:
1670 /// ConsideredSExtType Inst (sext opnd1 to ConsideredSExtType, ...).
1671 /// #2 Operand reuses:
1672 /// sext opnd1 to ConsideredSExtType.
1673 /// \p PromotedInsts maps the instructions to their type before promotion.
1674 static bool canGetThrough(const Instruction *Inst, Type *ConsideredSExtType,
1675 const InstrToOrigTy &PromotedInsts);
1677 /// \brief Utility function to determine if \p OpIdx should be promoted when
1678 /// promoting \p Inst.
1679 static bool shouldSExtOperand(const Instruction *Inst, int OpIdx) {
1680 if (isa<SelectInst>(Inst) && OpIdx == 0)
1685 /// \brief Utility function to promote the operand of \p SExt when this
1686 /// operand is a promotable trunc or sext.
1687 /// \p PromotedInsts maps the instructions to their type before promotion.
1688 /// \p CreatedInsts[out] contains how many non-free instructions have been
1689 /// created to promote the operand of SExt.
1690 /// Should never be called directly.
1691 /// \return The promoted value which is used instead of SExt.
1692 static Value *promoteOperandForTruncAndSExt(Instruction *SExt,
1693 TypePromotionTransaction &TPT,
1694 InstrToOrigTy &PromotedInsts,
1695 unsigned &CreatedInsts);
1697 /// \brief Utility function to promote the operand of \p SExt when this
1698 /// operand is promotable and is not a supported trunc or sext.
1699 /// \p PromotedInsts maps the instructions to their type before promotion.
1700 /// \p CreatedInsts[out] contains how many non-free instructions have been
1701 /// created to promote the operand of SExt.
1702 /// Should never be called directly.
1703 /// \return The promoted value which is used instead of SExt.
1704 static Value *promoteOperandForOther(Instruction *SExt,
1705 TypePromotionTransaction &TPT,
1706 InstrToOrigTy &PromotedInsts,
1707 unsigned &CreatedInsts);
1710 /// Type for the utility function that promotes the operand of SExt.
1711 typedef Value *(*Action)(Instruction *SExt, TypePromotionTransaction &TPT,
1712 InstrToOrigTy &PromotedInsts,
1713 unsigned &CreatedInsts);
1714 /// \brief Given a sign extend instruction \p SExt, return the approriate
1715 /// action to promote the operand of \p SExt instead of using SExt.
1716 /// \return NULL if no promotable action is possible with the current
1718 /// \p InsertedTruncs keeps track of all the truncate instructions inserted by
1719 /// the others CodeGenPrepare optimizations. This information is important
1720 /// because we do not want to promote these instructions as CodeGenPrepare
1721 /// will reinsert them later. Thus creating an infinite loop: create/remove.
1722 /// \p PromotedInsts maps the instructions to their type before promotion.
1723 static Action getAction(Instruction *SExt, const SetOfInstrs &InsertedTruncs,
1724 const TargetLowering &TLI,
1725 const InstrToOrigTy &PromotedInsts);
1728 bool TypePromotionHelper::canGetThrough(const Instruction *Inst,
1729 Type *ConsideredSExtType,
1730 const InstrToOrigTy &PromotedInsts) {
1731 // We can always get through sext.
1732 if (isa<SExtInst>(Inst))
1735 // We can get through binary operator, if it is legal. In other words, the
1736 // binary operator must have a nuw or nsw flag.
1737 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst);
1738 if (BinOp && isa<OverflowingBinaryOperator>(BinOp) &&
1739 (BinOp->hasNoUnsignedWrap() || BinOp->hasNoSignedWrap()))
1742 // Check if we can do the following simplification.
1743 // sext(trunc(sext)) --> sext
1744 if (!isa<TruncInst>(Inst))
1747 Value *OpndVal = Inst->getOperand(0);
1748 // Check if we can use this operand in the sext.
1749 // If the type is larger than the result type of the sign extension,
1751 if (OpndVal->getType()->getIntegerBitWidth() >
1752 ConsideredSExtType->getIntegerBitWidth())
1755 // If the operand of the truncate is not an instruction, we will not have
1756 // any information on the dropped bits.
1757 // (Actually we could for constant but it is not worth the extra logic).
1758 Instruction *Opnd = dyn_cast<Instruction>(OpndVal);
1762 // Check if the source of the type is narrow enough.
1763 // I.e., check that trunc just drops sign extended bits.
1764 // #1 get the type of the operand.
1765 const Type *OpndType;
1766 InstrToOrigTy::const_iterator It = PromotedInsts.find(Opnd);
1767 if (It != PromotedInsts.end())
1768 OpndType = It->second;
1769 else if (isa<SExtInst>(Opnd))
1770 OpndType = cast<Instruction>(Opnd)->getOperand(0)->getType();
1774 // #2 check that the truncate just drop sign extended bits.
1775 if (Inst->getType()->getIntegerBitWidth() >= OpndType->getIntegerBitWidth())
1781 TypePromotionHelper::Action TypePromotionHelper::getAction(
1782 Instruction *SExt, const SetOfInstrs &InsertedTruncs,
1783 const TargetLowering &TLI, const InstrToOrigTy &PromotedInsts) {
1784 Instruction *SExtOpnd = dyn_cast<Instruction>(SExt->getOperand(0));
1785 Type *SExtTy = SExt->getType();
1786 // If the operand of the sign extension is not an instruction, we cannot
1788 // If it, check we can get through.
1789 if (!SExtOpnd || !canGetThrough(SExtOpnd, SExtTy, PromotedInsts))
1792 // Do not promote if the operand has been added by codegenprepare.
1793 // Otherwise, it means we are undoing an optimization that is likely to be
1794 // redone, thus causing potential infinite loop.
1795 if (isa<TruncInst>(SExtOpnd) && InsertedTruncs.count(SExtOpnd))
1798 // SExt or Trunc instructions.
1799 // Return the related handler.
1800 if (isa<SExtInst>(SExtOpnd) || isa<TruncInst>(SExtOpnd))
1801 return promoteOperandForTruncAndSExt;
1803 // Regular instruction.
1804 // Abort early if we will have to insert non-free instructions.
1805 if (!SExtOpnd->hasOneUse() &&
1806 !TLI.isTruncateFree(SExtTy, SExtOpnd->getType()))
1808 return promoteOperandForOther;
1811 Value *TypePromotionHelper::promoteOperandForTruncAndSExt(
1812 llvm::Instruction *SExt, TypePromotionTransaction &TPT,
1813 InstrToOrigTy &PromotedInsts, unsigned &CreatedInsts) {
1814 // By construction, the operand of SExt is an instruction. Otherwise we cannot
1815 // get through it and this method should not be called.
1816 Instruction *SExtOpnd = cast<Instruction>(SExt->getOperand(0));
1817 // Replace sext(trunc(opnd)) or sext(sext(opnd))
1819 TPT.setOperand(SExt, 0, SExtOpnd->getOperand(0));
1822 // Remove dead code.
1823 if (SExtOpnd->use_empty())
1824 TPT.eraseInstruction(SExtOpnd);
1826 // Check if the sext is still needed.
1827 if (SExt->getType() != SExt->getOperand(0)->getType())
1830 // At this point we have: sext ty opnd to ty.
1831 // Reassign the uses of SExt to the opnd and remove SExt.
1832 Value *NextVal = SExt->getOperand(0);
1833 TPT.eraseInstruction(SExt, NextVal);
1838 TypePromotionHelper::promoteOperandForOther(Instruction *SExt,
1839 TypePromotionTransaction &TPT,
1840 InstrToOrigTy &PromotedInsts,
1841 unsigned &CreatedInsts) {
1842 // By construction, the operand of SExt is an instruction. Otherwise we cannot
1843 // get through it and this method should not be called.
1844 Instruction *SExtOpnd = cast<Instruction>(SExt->getOperand(0));
1846 if (!SExtOpnd->hasOneUse()) {
1847 // SExtOpnd will be promoted.
1848 // All its uses, but SExt, will need to use a truncated value of the
1849 // promoted version.
1850 // Create the truncate now.
1851 Instruction *Trunc = TPT.createTrunc(SExt, SExtOpnd->getType());
1852 Trunc->removeFromParent();
1853 // Insert it just after the definition.
1854 Trunc->insertAfter(SExtOpnd);
1856 TPT.replaceAllUsesWith(SExtOpnd, Trunc);
1857 // Restore the operand of SExt (which has been replace by the previous call
1858 // to replaceAllUsesWith) to avoid creating a cycle trunc <-> sext.
1859 TPT.setOperand(SExt, 0, SExtOpnd);
1862 // Get through the Instruction:
1863 // 1. Update its type.
1864 // 2. Replace the uses of SExt by Inst.
1865 // 3. Sign extend each operand that needs to be sign extended.
1867 // Remember the original type of the instruction before promotion.
1868 // This is useful to know that the high bits are sign extended bits.
1869 PromotedInsts.insert(
1870 std::pair<Instruction *, Type *>(SExtOpnd, SExtOpnd->getType()));
1872 TPT.mutateType(SExtOpnd, SExt->getType());
1874 TPT.replaceAllUsesWith(SExt, SExtOpnd);
1876 Instruction *SExtForOpnd = SExt;
1878 DEBUG(dbgs() << "Propagate SExt to operands\n");
1879 for (int OpIdx = 0, EndOpIdx = SExtOpnd->getNumOperands(); OpIdx != EndOpIdx;
1881 DEBUG(dbgs() << "Operand:\n" << *(SExtOpnd->getOperand(OpIdx)) << '\n');
1882 if (SExtOpnd->getOperand(OpIdx)->getType() == SExt->getType() ||
1883 !shouldSExtOperand(SExtOpnd, OpIdx)) {
1884 DEBUG(dbgs() << "No need to propagate\n");
1887 // Check if we can statically sign extend the operand.
1888 Value *Opnd = SExtOpnd->getOperand(OpIdx);
1889 if (const ConstantInt *Cst = dyn_cast<ConstantInt>(Opnd)) {
1890 DEBUG(dbgs() << "Statically sign extend\n");
1893 ConstantInt::getSigned(SExt->getType(), Cst->getSExtValue()));
1896 // UndefValue are typed, so we have to statically sign extend them.
1897 if (isa<UndefValue>(Opnd)) {
1898 DEBUG(dbgs() << "Statically sign extend\n");
1899 TPT.setOperand(SExtOpnd, OpIdx, UndefValue::get(SExt->getType()));
1903 // Otherwise we have to explicity sign extend the operand.
1904 // Check if SExt was reused to sign extend an operand.
1906 // If yes, create a new one.
1907 DEBUG(dbgs() << "More operands to sext\n");
1908 SExtForOpnd = TPT.createSExt(SExt, Opnd, SExt->getType());
1912 TPT.setOperand(SExtForOpnd, 0, Opnd);
1914 // Move the sign extension before the insertion point.
1915 TPT.moveBefore(SExtForOpnd, SExtOpnd);
1916 TPT.setOperand(SExtOpnd, OpIdx, SExtForOpnd);
1917 // If more sext are required, new instructions will have to be created.
1918 SExtForOpnd = nullptr;
1920 if (SExtForOpnd == SExt) {
1921 DEBUG(dbgs() << "Sign extension is useless now\n");
1922 TPT.eraseInstruction(SExt);
1927 /// IsPromotionProfitable - Check whether or not promoting an instruction
1928 /// to a wider type was profitable.
1929 /// \p MatchedSize gives the number of instructions that have been matched
1930 /// in the addressing mode after the promotion was applied.
1931 /// \p SizeWithPromotion gives the number of created instructions for
1932 /// the promotion plus the number of instructions that have been
1933 /// matched in the addressing mode before the promotion.
1934 /// \p PromotedOperand is the value that has been promoted.
1935 /// \return True if the promotion is profitable, false otherwise.
1937 AddressingModeMatcher::IsPromotionProfitable(unsigned MatchedSize,
1938 unsigned SizeWithPromotion,
1939 Value *PromotedOperand) const {
1940 // We folded less instructions than what we created to promote the operand.
1941 // This is not profitable.
1942 if (MatchedSize < SizeWithPromotion)
1944 if (MatchedSize > SizeWithPromotion)
1946 // The promotion is neutral but it may help folding the sign extension in
1947 // loads for instance.
1948 // Check that we did not create an illegal instruction.
1949 Instruction *PromotedInst = dyn_cast<Instruction>(PromotedOperand);
1952 int ISDOpcode = TLI.InstructionOpcodeToISD(PromotedInst->getOpcode());
1953 // If the ISDOpcode is undefined, it was undefined before the promotion.
1956 // Otherwise, check if the promoted instruction is legal or not.
1957 return TLI.isOperationLegalOrCustom(ISDOpcode,
1958 EVT::getEVT(PromotedInst->getType()));
1961 /// MatchOperationAddr - Given an instruction or constant expr, see if we can
1962 /// fold the operation into the addressing mode. If so, update the addressing
1963 /// mode and return true, otherwise return false without modifying AddrMode.
1964 /// If \p MovedAway is not NULL, it contains the information of whether or
1965 /// not AddrInst has to be folded into the addressing mode on success.
1966 /// If \p MovedAway == true, \p AddrInst will not be part of the addressing
1967 /// because it has been moved away.
1968 /// Thus AddrInst must not be added in the matched instructions.
1969 /// This state can happen when AddrInst is a sext, since it may be moved away.
1970 /// Therefore, AddrInst may not be valid when MovedAway is true and it must
1971 /// not be referenced anymore.
1972 bool AddressingModeMatcher::MatchOperationAddr(User *AddrInst, unsigned Opcode,
1975 // Avoid exponential behavior on extremely deep expression trees.
1976 if (Depth >= 5) return false;
1978 // By default, all matched instructions stay in place.
1983 case Instruction::PtrToInt:
1984 // PtrToInt is always a noop, as we know that the int type is pointer sized.
1985 return MatchAddr(AddrInst->getOperand(0), Depth);
1986 case Instruction::IntToPtr:
1987 // This inttoptr is a no-op if the integer type is pointer sized.
1988 if (TLI.getValueType(AddrInst->getOperand(0)->getType()) ==
1989 TLI.getPointerTy(AddrInst->getType()->getPointerAddressSpace()))
1990 return MatchAddr(AddrInst->getOperand(0), Depth);
1992 case Instruction::BitCast:
1993 case Instruction::AddrSpaceCast:
1994 // BitCast is always a noop, and we can handle it as long as it is
1995 // int->int or pointer->pointer (we don't want int<->fp or something).
1996 if ((AddrInst->getOperand(0)->getType()->isPointerTy() ||
1997 AddrInst->getOperand(0)->getType()->isIntegerTy()) &&
1998 // Don't touch identity bitcasts. These were probably put here by LSR,
1999 // and we don't want to mess around with them. Assume it knows what it
2001 AddrInst->getOperand(0)->getType() != AddrInst->getType())
2002 return MatchAddr(AddrInst->getOperand(0), Depth);
2004 case Instruction::Add: {
2005 // Check to see if we can merge in the RHS then the LHS. If so, we win.
2006 ExtAddrMode BackupAddrMode = AddrMode;
2007 unsigned OldSize = AddrModeInsts.size();
2008 // Start a transaction at this point.
2009 // The LHS may match but not the RHS.
2010 // Therefore, we need a higher level restoration point to undo partially
2011 // matched operation.
2012 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
2013 TPT.getRestorationPoint();
2015 if (MatchAddr(AddrInst->getOperand(1), Depth+1) &&
2016 MatchAddr(AddrInst->getOperand(0), Depth+1))
2019 // Restore the old addr mode info.
2020 AddrMode = BackupAddrMode;
2021 AddrModeInsts.resize(OldSize);
2022 TPT.rollback(LastKnownGood);
2024 // Otherwise this was over-aggressive. Try merging in the LHS then the RHS.
2025 if (MatchAddr(AddrInst->getOperand(0), Depth+1) &&
2026 MatchAddr(AddrInst->getOperand(1), Depth+1))
2029 // Otherwise we definitely can't merge the ADD in.
2030 AddrMode = BackupAddrMode;
2031 AddrModeInsts.resize(OldSize);
2032 TPT.rollback(LastKnownGood);
2035 //case Instruction::Or:
2036 // TODO: We can handle "Or Val, Imm" iff this OR is equivalent to an ADD.
2038 case Instruction::Mul:
2039 case Instruction::Shl: {
2040 // Can only handle X*C and X << C.
2041 ConstantInt *RHS = dyn_cast<ConstantInt>(AddrInst->getOperand(1));
2044 int64_t Scale = RHS->getSExtValue();
2045 if (Opcode == Instruction::Shl)
2046 Scale = 1LL << Scale;
2048 return MatchScaledValue(AddrInst->getOperand(0), Scale, Depth);
2050 case Instruction::GetElementPtr: {
2051 // Scan the GEP. We check it if it contains constant offsets and at most
2052 // one variable offset.
2053 int VariableOperand = -1;
2054 unsigned VariableScale = 0;
2056 int64_t ConstantOffset = 0;
2057 const DataLayout *TD = TLI.getDataLayout();
2058 gep_type_iterator GTI = gep_type_begin(AddrInst);
2059 for (unsigned i = 1, e = AddrInst->getNumOperands(); i != e; ++i, ++GTI) {
2060 if (StructType *STy = dyn_cast<StructType>(*GTI)) {
2061 const StructLayout *SL = TD->getStructLayout(STy);
2063 cast<ConstantInt>(AddrInst->getOperand(i))->getZExtValue();
2064 ConstantOffset += SL->getElementOffset(Idx);
2066 uint64_t TypeSize = TD->getTypeAllocSize(GTI.getIndexedType());
2067 if (ConstantInt *CI = dyn_cast<ConstantInt>(AddrInst->getOperand(i))) {
2068 ConstantOffset += CI->getSExtValue()*TypeSize;
2069 } else if (TypeSize) { // Scales of zero don't do anything.
2070 // We only allow one variable index at the moment.
2071 if (VariableOperand != -1)
2074 // Remember the variable index.
2075 VariableOperand = i;
2076 VariableScale = TypeSize;
2081 // A common case is for the GEP to only do a constant offset. In this case,
2082 // just add it to the disp field and check validity.
2083 if (VariableOperand == -1) {
2084 AddrMode.BaseOffs += ConstantOffset;
2085 if (ConstantOffset == 0 || TLI.isLegalAddressingMode(AddrMode, AccessTy)){
2086 // Check to see if we can fold the base pointer in too.
2087 if (MatchAddr(AddrInst->getOperand(0), Depth+1))
2090 AddrMode.BaseOffs -= ConstantOffset;
2094 // Save the valid addressing mode in case we can't match.
2095 ExtAddrMode BackupAddrMode = AddrMode;
2096 unsigned OldSize = AddrModeInsts.size();
2098 // See if the scale and offset amount is valid for this target.
2099 AddrMode.BaseOffs += ConstantOffset;
2101 // Match the base operand of the GEP.
2102 if (!MatchAddr(AddrInst->getOperand(0), Depth+1)) {
2103 // If it couldn't be matched, just stuff the value in a register.
2104 if (AddrMode.HasBaseReg) {
2105 AddrMode = BackupAddrMode;
2106 AddrModeInsts.resize(OldSize);
2109 AddrMode.HasBaseReg = true;
2110 AddrMode.BaseReg = AddrInst->getOperand(0);
2113 // Match the remaining variable portion of the GEP.
2114 if (!MatchScaledValue(AddrInst->getOperand(VariableOperand), VariableScale,
2116 // If it couldn't be matched, try stuffing the base into a register
2117 // instead of matching it, and retrying the match of the scale.
2118 AddrMode = BackupAddrMode;
2119 AddrModeInsts.resize(OldSize);
2120 if (AddrMode.HasBaseReg)
2122 AddrMode.HasBaseReg = true;
2123 AddrMode.BaseReg = AddrInst->getOperand(0);
2124 AddrMode.BaseOffs += ConstantOffset;
2125 if (!MatchScaledValue(AddrInst->getOperand(VariableOperand),
2126 VariableScale, Depth)) {
2127 // If even that didn't work, bail.
2128 AddrMode = BackupAddrMode;
2129 AddrModeInsts.resize(OldSize);
2136 case Instruction::SExt: {
2137 Instruction *SExt = dyn_cast<Instruction>(AddrInst);
2141 // Try to move this sext out of the way of the addressing mode.
2142 // Ask for a method for doing so.
2143 TypePromotionHelper::Action TPH = TypePromotionHelper::getAction(
2144 SExt, InsertedTruncs, TLI, PromotedInsts);
2148 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
2149 TPT.getRestorationPoint();
2150 unsigned CreatedInsts = 0;
2151 Value *PromotedOperand = TPH(SExt, TPT, PromotedInsts, CreatedInsts);
2152 // SExt has been moved away.
2153 // Thus either it will be rematched later in the recursive calls or it is
2154 // gone. Anyway, we must not fold it into the addressing mode at this point.
2158 // addr = gep base, idx
2160 // promotedOpnd = sext opnd <- no match here
2161 // op = promoted_add promotedOpnd, 1 <- match (later in recursive calls)
2162 // addr = gep base, op <- match
2166 assert(PromotedOperand &&
2167 "TypePromotionHelper should have filtered out those cases");
2169 ExtAddrMode BackupAddrMode = AddrMode;
2170 unsigned OldSize = AddrModeInsts.size();
2172 if (!MatchAddr(PromotedOperand, Depth) ||
2173 !IsPromotionProfitable(AddrModeInsts.size(), OldSize + CreatedInsts,
2175 AddrMode = BackupAddrMode;
2176 AddrModeInsts.resize(OldSize);
2177 DEBUG(dbgs() << "Sign extension does not pay off: rollback\n");
2178 TPT.rollback(LastKnownGood);
2187 /// MatchAddr - If we can, try to add the value of 'Addr' into the current
2188 /// addressing mode. If Addr can't be added to AddrMode this returns false and
2189 /// leaves AddrMode unmodified. This assumes that Addr is either a pointer type
2190 /// or intptr_t for the target.
2192 bool AddressingModeMatcher::MatchAddr(Value *Addr, unsigned Depth) {
2193 // Start a transaction at this point that we will rollback if the matching
2195 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
2196 TPT.getRestorationPoint();
2197 if (ConstantInt *CI = dyn_cast<ConstantInt>(Addr)) {
2198 // Fold in immediates if legal for the target.
2199 AddrMode.BaseOffs += CI->getSExtValue();
2200 if (TLI.isLegalAddressingMode(AddrMode, AccessTy))
2202 AddrMode.BaseOffs -= CI->getSExtValue();
2203 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(Addr)) {
2204 // If this is a global variable, try to fold it into the addressing mode.
2205 if (!AddrMode.BaseGV) {
2206 AddrMode.BaseGV = GV;
2207 if (TLI.isLegalAddressingMode(AddrMode, AccessTy))
2209 AddrMode.BaseGV = nullptr;
2211 } else if (Instruction *I = dyn_cast<Instruction>(Addr)) {
2212 ExtAddrMode BackupAddrMode = AddrMode;
2213 unsigned OldSize = AddrModeInsts.size();
2215 // Check to see if it is possible to fold this operation.
2216 bool MovedAway = false;
2217 if (MatchOperationAddr(I, I->getOpcode(), Depth, &MovedAway)) {
2218 // This instruction may have been move away. If so, there is nothing
2222 // Okay, it's possible to fold this. Check to see if it is actually
2223 // *profitable* to do so. We use a simple cost model to avoid increasing
2224 // register pressure too much.
2225 if (I->hasOneUse() ||
2226 IsProfitableToFoldIntoAddressingMode(I, BackupAddrMode, AddrMode)) {
2227 AddrModeInsts.push_back(I);
2231 // It isn't profitable to do this, roll back.
2232 //cerr << "NOT FOLDING: " << *I;
2233 AddrMode = BackupAddrMode;
2234 AddrModeInsts.resize(OldSize);
2235 TPT.rollback(LastKnownGood);
2237 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Addr)) {
2238 if (MatchOperationAddr(CE, CE->getOpcode(), Depth))
2240 TPT.rollback(LastKnownGood);
2241 } else if (isa<ConstantPointerNull>(Addr)) {
2242 // Null pointer gets folded without affecting the addressing mode.
2246 // Worse case, the target should support [reg] addressing modes. :)
2247 if (!AddrMode.HasBaseReg) {
2248 AddrMode.HasBaseReg = true;
2249 AddrMode.BaseReg = Addr;
2250 // Still check for legality in case the target supports [imm] but not [i+r].
2251 if (TLI.isLegalAddressingMode(AddrMode, AccessTy))
2253 AddrMode.HasBaseReg = false;
2254 AddrMode.BaseReg = nullptr;
2257 // If the base register is already taken, see if we can do [r+r].
2258 if (AddrMode.Scale == 0) {
2260 AddrMode.ScaledReg = Addr;
2261 if (TLI.isLegalAddressingMode(AddrMode, AccessTy))
2264 AddrMode.ScaledReg = nullptr;
2267 TPT.rollback(LastKnownGood);
2271 /// IsOperandAMemoryOperand - Check to see if all uses of OpVal by the specified
2272 /// inline asm call are due to memory operands. If so, return true, otherwise
2274 static bool IsOperandAMemoryOperand(CallInst *CI, InlineAsm *IA, Value *OpVal,
2275 const TargetLowering &TLI) {
2276 TargetLowering::AsmOperandInfoVector TargetConstraints = TLI.ParseConstraints(ImmutableCallSite(CI));
2277 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
2278 TargetLowering::AsmOperandInfo &OpInfo = TargetConstraints[i];
2280 // Compute the constraint code and ConstraintType to use.
2281 TLI.ComputeConstraintToUse(OpInfo, SDValue());
2283 // If this asm operand is our Value*, and if it isn't an indirect memory
2284 // operand, we can't fold it!
2285 if (OpInfo.CallOperandVal == OpVal &&
2286 (OpInfo.ConstraintType != TargetLowering::C_Memory ||
2287 !OpInfo.isIndirect))
2294 /// FindAllMemoryUses - Recursively walk all the uses of I until we find a
2295 /// memory use. If we find an obviously non-foldable instruction, return true.
2296 /// Add the ultimately found memory instructions to MemoryUses.
2297 static bool FindAllMemoryUses(Instruction *I,
2298 SmallVectorImpl<std::pair<Instruction*,unsigned> > &MemoryUses,
2299 SmallPtrSet<Instruction*, 16> &ConsideredInsts,
2300 const TargetLowering &TLI) {
2301 // If we already considered this instruction, we're done.
2302 if (!ConsideredInsts.insert(I))
2305 // If this is an obviously unfoldable instruction, bail out.
2306 if (!MightBeFoldableInst(I))
2309 // Loop over all the uses, recursively processing them.
2310 for (Use &U : I->uses()) {
2311 Instruction *UserI = cast<Instruction>(U.getUser());
2313 if (LoadInst *LI = dyn_cast<LoadInst>(UserI)) {
2314 MemoryUses.push_back(std::make_pair(LI, U.getOperandNo()));
2318 if (StoreInst *SI = dyn_cast<StoreInst>(UserI)) {
2319 unsigned opNo = U.getOperandNo();
2320 if (opNo == 0) return true; // Storing addr, not into addr.
2321 MemoryUses.push_back(std::make_pair(SI, opNo));
2325 if (CallInst *CI = dyn_cast<CallInst>(UserI)) {
2326 InlineAsm *IA = dyn_cast<InlineAsm>(CI->getCalledValue());
2327 if (!IA) return true;
2329 // If this is a memory operand, we're cool, otherwise bail out.
2330 if (!IsOperandAMemoryOperand(CI, IA, I, TLI))
2335 if (FindAllMemoryUses(UserI, MemoryUses, ConsideredInsts, TLI))
2342 /// ValueAlreadyLiveAtInst - Retrn true if Val is already known to be live at
2343 /// the use site that we're folding it into. If so, there is no cost to
2344 /// include it in the addressing mode. KnownLive1 and KnownLive2 are two values
2345 /// that we know are live at the instruction already.
2346 bool AddressingModeMatcher::ValueAlreadyLiveAtInst(Value *Val,Value *KnownLive1,
2347 Value *KnownLive2) {
2348 // If Val is either of the known-live values, we know it is live!
2349 if (Val == nullptr || Val == KnownLive1 || Val == KnownLive2)
2352 // All values other than instructions and arguments (e.g. constants) are live.
2353 if (!isa<Instruction>(Val) && !isa<Argument>(Val)) return true;
2355 // If Val is a constant sized alloca in the entry block, it is live, this is
2356 // true because it is just a reference to the stack/frame pointer, which is
2357 // live for the whole function.
2358 if (AllocaInst *AI = dyn_cast<AllocaInst>(Val))
2359 if (AI->isStaticAlloca())
2362 // Check to see if this value is already used in the memory instruction's
2363 // block. If so, it's already live into the block at the very least, so we
2364 // can reasonably fold it.
2365 return Val->isUsedInBasicBlock(MemoryInst->getParent());
2368 /// IsProfitableToFoldIntoAddressingMode - It is possible for the addressing
2369 /// mode of the machine to fold the specified instruction into a load or store
2370 /// that ultimately uses it. However, the specified instruction has multiple
2371 /// uses. Given this, it may actually increase register pressure to fold it
2372 /// into the load. For example, consider this code:
2376 /// use(Y) -> nonload/store
2380 /// In this case, Y has multiple uses, and can be folded into the load of Z
2381 /// (yielding load [X+2]). However, doing this will cause both "X" and "X+1" to
2382 /// be live at the use(Y) line. If we don't fold Y into load Z, we use one
2383 /// fewer register. Since Y can't be folded into "use(Y)" we don't increase the
2384 /// number of computations either.
2386 /// Note that this (like most of CodeGenPrepare) is just a rough heuristic. If
2387 /// X was live across 'load Z' for other reasons, we actually *would* want to
2388 /// fold the addressing mode in the Z case. This would make Y die earlier.
2389 bool AddressingModeMatcher::
2390 IsProfitableToFoldIntoAddressingMode(Instruction *I, ExtAddrMode &AMBefore,
2391 ExtAddrMode &AMAfter) {
2392 if (IgnoreProfitability) return true;
2394 // AMBefore is the addressing mode before this instruction was folded into it,
2395 // and AMAfter is the addressing mode after the instruction was folded. Get
2396 // the set of registers referenced by AMAfter and subtract out those
2397 // referenced by AMBefore: this is the set of values which folding in this
2398 // address extends the lifetime of.
2400 // Note that there are only two potential values being referenced here,
2401 // BaseReg and ScaleReg (global addresses are always available, as are any
2402 // folded immediates).
2403 Value *BaseReg = AMAfter.BaseReg, *ScaledReg = AMAfter.ScaledReg;
2405 // If the BaseReg or ScaledReg was referenced by the previous addrmode, their
2406 // lifetime wasn't extended by adding this instruction.
2407 if (ValueAlreadyLiveAtInst(BaseReg, AMBefore.BaseReg, AMBefore.ScaledReg))
2409 if (ValueAlreadyLiveAtInst(ScaledReg, AMBefore.BaseReg, AMBefore.ScaledReg))
2410 ScaledReg = nullptr;
2412 // If folding this instruction (and it's subexprs) didn't extend any live
2413 // ranges, we're ok with it.
2414 if (!BaseReg && !ScaledReg)
2417 // If all uses of this instruction are ultimately load/store/inlineasm's,
2418 // check to see if their addressing modes will include this instruction. If
2419 // so, we can fold it into all uses, so it doesn't matter if it has multiple
2421 SmallVector<std::pair<Instruction*,unsigned>, 16> MemoryUses;
2422 SmallPtrSet<Instruction*, 16> ConsideredInsts;
2423 if (FindAllMemoryUses(I, MemoryUses, ConsideredInsts, TLI))
2424 return false; // Has a non-memory, non-foldable use!
2426 // Now that we know that all uses of this instruction are part of a chain of
2427 // computation involving only operations that could theoretically be folded
2428 // into a memory use, loop over each of these uses and see if they could
2429 // *actually* fold the instruction.
2430 SmallVector<Instruction*, 32> MatchedAddrModeInsts;
2431 for (unsigned i = 0, e = MemoryUses.size(); i != e; ++i) {
2432 Instruction *User = MemoryUses[i].first;
2433 unsigned OpNo = MemoryUses[i].second;
2435 // Get the access type of this use. If the use isn't a pointer, we don't
2436 // know what it accesses.
2437 Value *Address = User->getOperand(OpNo);
2438 if (!Address->getType()->isPointerTy())
2440 Type *AddressAccessTy = Address->getType()->getPointerElementType();
2442 // Do a match against the root of this address, ignoring profitability. This
2443 // will tell us if the addressing mode for the memory operation will
2444 // *actually* cover the shared instruction.
2446 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
2447 TPT.getRestorationPoint();
2448 AddressingModeMatcher Matcher(MatchedAddrModeInsts, TLI, AddressAccessTy,
2449 MemoryInst, Result, InsertedTruncs,
2450 PromotedInsts, TPT);
2451 Matcher.IgnoreProfitability = true;
2452 bool Success = Matcher.MatchAddr(Address, 0);
2453 (void)Success; assert(Success && "Couldn't select *anything*?");
2455 // The match was to check the profitability, the changes made are not
2456 // part of the original matcher. Therefore, they should be dropped
2457 // otherwise the original matcher will not present the right state.
2458 TPT.rollback(LastKnownGood);
2460 // If the match didn't cover I, then it won't be shared by it.
2461 if (std::find(MatchedAddrModeInsts.begin(), MatchedAddrModeInsts.end(),
2462 I) == MatchedAddrModeInsts.end())
2465 MatchedAddrModeInsts.clear();
2471 } // end anonymous namespace
2473 /// IsNonLocalValue - Return true if the specified values are defined in a
2474 /// different basic block than BB.
2475 static bool IsNonLocalValue(Value *V, BasicBlock *BB) {
2476 if (Instruction *I = dyn_cast<Instruction>(V))
2477 return I->getParent() != BB;
2481 /// OptimizeMemoryInst - Load and Store Instructions often have
2482 /// addressing modes that can do significant amounts of computation. As such,
2483 /// instruction selection will try to get the load or store to do as much
2484 /// computation as possible for the program. The problem is that isel can only
2485 /// see within a single block. As such, we sink as much legal addressing mode
2486 /// stuff into the block as possible.
2488 /// This method is used to optimize both load/store and inline asms with memory
2490 bool CodeGenPrepare::OptimizeMemoryInst(Instruction *MemoryInst, Value *Addr,
2494 // Try to collapse single-value PHI nodes. This is necessary to undo
2495 // unprofitable PRE transformations.
2496 SmallVector<Value*, 8> worklist;
2497 SmallPtrSet<Value*, 16> Visited;
2498 worklist.push_back(Addr);
2500 // Use a worklist to iteratively look through PHI nodes, and ensure that
2501 // the addressing mode obtained from the non-PHI roots of the graph
2503 Value *Consensus = nullptr;
2504 unsigned NumUsesConsensus = 0;
2505 bool IsNumUsesConsensusValid = false;
2506 SmallVector<Instruction*, 16> AddrModeInsts;
2507 ExtAddrMode AddrMode;
2508 TypePromotionTransaction TPT;
2509 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
2510 TPT.getRestorationPoint();
2511 while (!worklist.empty()) {
2512 Value *V = worklist.back();
2513 worklist.pop_back();
2515 // Break use-def graph loops.
2516 if (!Visited.insert(V)) {
2517 Consensus = nullptr;
2521 // For a PHI node, push all of its incoming values.
2522 if (PHINode *P = dyn_cast<PHINode>(V)) {
2523 for (unsigned i = 0, e = P->getNumIncomingValues(); i != e; ++i)
2524 worklist.push_back(P->getIncomingValue(i));
2528 // For non-PHIs, determine the addressing mode being computed.
2529 SmallVector<Instruction*, 16> NewAddrModeInsts;
2530 ExtAddrMode NewAddrMode = AddressingModeMatcher::Match(
2531 V, AccessTy, MemoryInst, NewAddrModeInsts, *TLI, InsertedTruncsSet,
2532 PromotedInsts, TPT);
2534 // This check is broken into two cases with very similar code to avoid using
2535 // getNumUses() as much as possible. Some values have a lot of uses, so
2536 // calling getNumUses() unconditionally caused a significant compile-time
2540 AddrMode = NewAddrMode;
2541 AddrModeInsts = NewAddrModeInsts;
2543 } else if (NewAddrMode == AddrMode) {
2544 if (!IsNumUsesConsensusValid) {
2545 NumUsesConsensus = Consensus->getNumUses();
2546 IsNumUsesConsensusValid = true;
2549 // Ensure that the obtained addressing mode is equivalent to that obtained
2550 // for all other roots of the PHI traversal. Also, when choosing one
2551 // such root as representative, select the one with the most uses in order
2552 // to keep the cost modeling heuristics in AddressingModeMatcher
2554 unsigned NumUses = V->getNumUses();
2555 if (NumUses > NumUsesConsensus) {
2557 NumUsesConsensus = NumUses;
2558 AddrModeInsts = NewAddrModeInsts;
2563 Consensus = nullptr;
2567 // If the addressing mode couldn't be determined, or if multiple different
2568 // ones were determined, bail out now.
2570 TPT.rollback(LastKnownGood);
2575 // Check to see if any of the instructions supersumed by this addr mode are
2576 // non-local to I's BB.
2577 bool AnyNonLocal = false;
2578 for (unsigned i = 0, e = AddrModeInsts.size(); i != e; ++i) {
2579 if (IsNonLocalValue(AddrModeInsts[i], MemoryInst->getParent())) {
2585 // If all the instructions matched are already in this BB, don't do anything.
2587 DEBUG(dbgs() << "CGP: Found local addrmode: " << AddrMode << "\n");
2591 // Insert this computation right after this user. Since our caller is
2592 // scanning from the top of the BB to the bottom, reuse of the expr are
2593 // guaranteed to happen later.
2594 IRBuilder<> Builder(MemoryInst);
2596 // Now that we determined the addressing expression we want to use and know
2597 // that we have to sink it into this block. Check to see if we have already
2598 // done this for some other load/store instr in this block. If so, reuse the
2600 Value *&SunkAddr = SunkAddrs[Addr];
2602 DEBUG(dbgs() << "CGP: Reusing nonlocal addrmode: " << AddrMode << " for "
2603 << *MemoryInst << "\n");
2604 if (SunkAddr->getType() != Addr->getType())
2605 SunkAddr = Builder.CreateBitCast(SunkAddr, Addr->getType());
2606 } else if (AddrSinkUsingGEPs || (!AddrSinkUsingGEPs.getNumOccurrences() &&
2607 TM && TM->getSubtarget<TargetSubtargetInfo>().useAA())) {
2608 // By default, we use the GEP-based method when AA is used later. This
2609 // prevents new inttoptr/ptrtoint pairs from degrading AA capabilities.
2610 DEBUG(dbgs() << "CGP: SINKING nonlocal addrmode: " << AddrMode << " for "
2611 << *MemoryInst << "\n");
2612 Type *IntPtrTy = TLI->getDataLayout()->getIntPtrType(Addr->getType());
2613 Value *ResultPtr = nullptr, *ResultIndex = nullptr;
2615 // First, find the pointer.
2616 if (AddrMode.BaseReg && AddrMode.BaseReg->getType()->isPointerTy()) {
2617 ResultPtr = AddrMode.BaseReg;
2618 AddrMode.BaseReg = nullptr;
2621 if (AddrMode.Scale && AddrMode.ScaledReg->getType()->isPointerTy()) {
2622 // We can't add more than one pointer together, nor can we scale a
2623 // pointer (both of which seem meaningless).
2624 if (ResultPtr || AddrMode.Scale != 1)
2627 ResultPtr = AddrMode.ScaledReg;
2631 if (AddrMode.BaseGV) {
2635 ResultPtr = AddrMode.BaseGV;
2638 // If the real base value actually came from an inttoptr, then the matcher
2639 // will look through it and provide only the integer value. In that case,
2641 if (!ResultPtr && AddrMode.BaseReg) {
2643 Builder.CreateIntToPtr(AddrMode.BaseReg, Addr->getType(), "sunkaddr");
2644 AddrMode.BaseReg = nullptr;
2645 } else if (!ResultPtr && AddrMode.Scale == 1) {
2647 Builder.CreateIntToPtr(AddrMode.ScaledReg, Addr->getType(), "sunkaddr");
2652 !AddrMode.BaseReg && !AddrMode.Scale && !AddrMode.BaseOffs) {
2653 SunkAddr = Constant::getNullValue(Addr->getType());
2654 } else if (!ResultPtr) {
2658 Builder.getInt8PtrTy(Addr->getType()->getPointerAddressSpace());
2660 // Start with the base register. Do this first so that subsequent address
2661 // matching finds it last, which will prevent it from trying to match it
2662 // as the scaled value in case it happens to be a mul. That would be
2663 // problematic if we've sunk a different mul for the scale, because then
2664 // we'd end up sinking both muls.
2665 if (AddrMode.BaseReg) {
2666 Value *V = AddrMode.BaseReg;
2667 if (V->getType() != IntPtrTy)
2668 V = Builder.CreateIntCast(V, IntPtrTy, /*isSigned=*/true, "sunkaddr");
2673 // Add the scale value.
2674 if (AddrMode.Scale) {
2675 Value *V = AddrMode.ScaledReg;
2676 if (V->getType() == IntPtrTy) {
2678 } else if (cast<IntegerType>(IntPtrTy)->getBitWidth() <
2679 cast<IntegerType>(V->getType())->getBitWidth()) {
2680 V = Builder.CreateTrunc(V, IntPtrTy, "sunkaddr");
2682 // It is only safe to sign extend the BaseReg if we know that the math
2683 // required to create it did not overflow before we extend it. Since
2684 // the original IR value was tossed in favor of a constant back when
2685 // the AddrMode was created we need to bail out gracefully if widths
2686 // do not match instead of extending it.
2687 Instruction *I = dyn_cast_or_null<Instruction>(ResultIndex);
2688 if (I && (ResultIndex != AddrMode.BaseReg))
2689 I->eraseFromParent();
2693 if (AddrMode.Scale != 1)
2694 V = Builder.CreateMul(V, ConstantInt::get(IntPtrTy, AddrMode.Scale),
2697 ResultIndex = Builder.CreateAdd(ResultIndex, V, "sunkaddr");
2702 // Add in the Base Offset if present.
2703 if (AddrMode.BaseOffs) {
2704 Value *V = ConstantInt::get(IntPtrTy, AddrMode.BaseOffs);
2706 // We need to add this separately from the scale above to help with
2707 // SDAG consecutive load/store merging.
2708 if (ResultPtr->getType() != I8PtrTy)
2709 ResultPtr = Builder.CreateBitCast(ResultPtr, I8PtrTy);
2710 ResultPtr = Builder.CreateGEP(ResultPtr, ResultIndex, "sunkaddr");
2717 SunkAddr = ResultPtr;
2719 if (ResultPtr->getType() != I8PtrTy)
2720 ResultPtr = Builder.CreateBitCast(ResultPtr, I8PtrTy);
2721 SunkAddr = Builder.CreateGEP(ResultPtr, ResultIndex, "sunkaddr");
2724 if (SunkAddr->getType() != Addr->getType())
2725 SunkAddr = Builder.CreateBitCast(SunkAddr, Addr->getType());
2728 DEBUG(dbgs() << "CGP: SINKING nonlocal addrmode: " << AddrMode << " for "
2729 << *MemoryInst << "\n");
2730 Type *IntPtrTy = TLI->getDataLayout()->getIntPtrType(Addr->getType());
2731 Value *Result = nullptr;
2733 // Start with the base register. Do this first so that subsequent address
2734 // matching finds it last, which will prevent it from trying to match it
2735 // as the scaled value in case it happens to be a mul. That would be
2736 // problematic if we've sunk a different mul for the scale, because then
2737 // we'd end up sinking both muls.
2738 if (AddrMode.BaseReg) {
2739 Value *V = AddrMode.BaseReg;
2740 if (V->getType()->isPointerTy())
2741 V = Builder.CreatePtrToInt(V, IntPtrTy, "sunkaddr");
2742 if (V->getType() != IntPtrTy)
2743 V = Builder.CreateIntCast(V, IntPtrTy, /*isSigned=*/true, "sunkaddr");
2747 // Add the scale value.
2748 if (AddrMode.Scale) {
2749 Value *V = AddrMode.ScaledReg;
2750 if (V->getType() == IntPtrTy) {
2752 } else if (V->getType()->isPointerTy()) {
2753 V = Builder.CreatePtrToInt(V, IntPtrTy, "sunkaddr");
2754 } else if (cast<IntegerType>(IntPtrTy)->getBitWidth() <
2755 cast<IntegerType>(V->getType())->getBitWidth()) {
2756 V = Builder.CreateTrunc(V, IntPtrTy, "sunkaddr");
2758 // It is only safe to sign extend the BaseReg if we know that the math
2759 // required to create it did not overflow before we extend it. Since
2760 // the original IR value was tossed in favor of a constant back when
2761 // the AddrMode was created we need to bail out gracefully if widths
2762 // do not match instead of extending it.
2763 Instruction *I = dyn_cast_or_null<Instruction>(Result);
2764 if (I && (Result != AddrMode.BaseReg))
2765 I->eraseFromParent();
2768 if (AddrMode.Scale != 1)
2769 V = Builder.CreateMul(V, ConstantInt::get(IntPtrTy, AddrMode.Scale),
2772 Result = Builder.CreateAdd(Result, V, "sunkaddr");
2777 // Add in the BaseGV if present.
2778 if (AddrMode.BaseGV) {
2779 Value *V = Builder.CreatePtrToInt(AddrMode.BaseGV, IntPtrTy, "sunkaddr");
2781 Result = Builder.CreateAdd(Result, V, "sunkaddr");
2786 // Add in the Base Offset if present.
2787 if (AddrMode.BaseOffs) {
2788 Value *V = ConstantInt::get(IntPtrTy, AddrMode.BaseOffs);
2790 Result = Builder.CreateAdd(Result, V, "sunkaddr");
2796 SunkAddr = Constant::getNullValue(Addr->getType());
2798 SunkAddr = Builder.CreateIntToPtr(Result, Addr->getType(), "sunkaddr");
2801 MemoryInst->replaceUsesOfWith(Repl, SunkAddr);
2803 // If we have no uses, recursively delete the value and all dead instructions
2805 if (Repl->use_empty()) {
2806 // This can cause recursive deletion, which can invalidate our iterator.
2807 // Use a WeakVH to hold onto it in case this happens.
2808 WeakVH IterHandle(CurInstIterator);
2809 BasicBlock *BB = CurInstIterator->getParent();
2811 RecursivelyDeleteTriviallyDeadInstructions(Repl, TLInfo);
2813 if (IterHandle != CurInstIterator) {
2814 // If the iterator instruction was recursively deleted, start over at the
2815 // start of the block.
2816 CurInstIterator = BB->begin();
2824 /// OptimizeInlineAsmInst - If there are any memory operands, use
2825 /// OptimizeMemoryInst to sink their address computing into the block when
2826 /// possible / profitable.
2827 bool CodeGenPrepare::OptimizeInlineAsmInst(CallInst *CS) {
2828 bool MadeChange = false;
2830 TargetLowering::AsmOperandInfoVector
2831 TargetConstraints = TLI->ParseConstraints(CS);
2833 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
2834 TargetLowering::AsmOperandInfo &OpInfo = TargetConstraints[i];
2836 // Compute the constraint code and ConstraintType to use.
2837 TLI->ComputeConstraintToUse(OpInfo, SDValue());
2839 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
2840 OpInfo.isIndirect) {
2841 Value *OpVal = CS->getArgOperand(ArgNo++);
2842 MadeChange |= OptimizeMemoryInst(CS, OpVal, OpVal->getType());
2843 } else if (OpInfo.Type == InlineAsm::isInput)
2850 /// MoveExtToFormExtLoad - Move a zext or sext fed by a load into the same
2851 /// basic block as the load, unless conditions are unfavorable. This allows
2852 /// SelectionDAG to fold the extend into the load.
2854 bool CodeGenPrepare::MoveExtToFormExtLoad(Instruction *I) {
2855 // Look for a load being extended.
2856 LoadInst *LI = dyn_cast<LoadInst>(I->getOperand(0));
2857 if (!LI) return false;
2859 // If they're already in the same block, there's nothing to do.
2860 if (LI->getParent() == I->getParent())
2863 // If the load has other users and the truncate is not free, this probably
2864 // isn't worthwhile.
2865 if (!LI->hasOneUse() &&
2866 TLI && (TLI->isTypeLegal(TLI->getValueType(LI->getType())) ||
2867 !TLI->isTypeLegal(TLI->getValueType(I->getType()))) &&
2868 !TLI->isTruncateFree(I->getType(), LI->getType()))
2871 // Check whether the target supports casts folded into loads.
2873 if (isa<ZExtInst>(I))
2874 LType = ISD::ZEXTLOAD;
2876 assert(isa<SExtInst>(I) && "Unexpected ext type!");
2877 LType = ISD::SEXTLOAD;
2879 if (TLI && !TLI->isLoadExtLegal(LType, TLI->getValueType(LI->getType())))
2882 // Move the extend into the same block as the load, so that SelectionDAG
2884 I->removeFromParent();
2890 bool CodeGenPrepare::OptimizeExtUses(Instruction *I) {
2891 BasicBlock *DefBB = I->getParent();
2893 // If the result of a {s|z}ext and its source are both live out, rewrite all
2894 // other uses of the source with result of extension.
2895 Value *Src = I->getOperand(0);
2896 if (Src->hasOneUse())
2899 // Only do this xform if truncating is free.
2900 if (TLI && !TLI->isTruncateFree(I->getType(), Src->getType()))
2903 // Only safe to perform the optimization if the source is also defined in
2905 if (!isa<Instruction>(Src) || DefBB != cast<Instruction>(Src)->getParent())
2908 bool DefIsLiveOut = false;
2909 for (User *U : I->users()) {
2910 Instruction *UI = cast<Instruction>(U);
2912 // Figure out which BB this ext is used in.
2913 BasicBlock *UserBB = UI->getParent();
2914 if (UserBB == DefBB) continue;
2915 DefIsLiveOut = true;
2921 // Make sure none of the uses are PHI nodes.
2922 for (User *U : Src->users()) {
2923 Instruction *UI = cast<Instruction>(U);
2924 BasicBlock *UserBB = UI->getParent();
2925 if (UserBB == DefBB) continue;
2926 // Be conservative. We don't want this xform to end up introducing
2927 // reloads just before load / store instructions.
2928 if (isa<PHINode>(UI) || isa<LoadInst>(UI) || isa<StoreInst>(UI))
2932 // InsertedTruncs - Only insert one trunc in each block once.
2933 DenseMap<BasicBlock*, Instruction*> InsertedTruncs;
2935 bool MadeChange = false;
2936 for (Use &U : Src->uses()) {
2937 Instruction *User = cast<Instruction>(U.getUser());
2939 // Figure out which BB this ext is used in.
2940 BasicBlock *UserBB = User->getParent();
2941 if (UserBB == DefBB) continue;
2943 // Both src and def are live in this block. Rewrite the use.
2944 Instruction *&InsertedTrunc = InsertedTruncs[UserBB];
2946 if (!InsertedTrunc) {
2947 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
2948 InsertedTrunc = new TruncInst(I, Src->getType(), "", InsertPt);
2949 InsertedTruncsSet.insert(InsertedTrunc);
2952 // Replace a use of the {s|z}ext source with a use of the result.
2961 /// isFormingBranchFromSelectProfitable - Returns true if a SelectInst should be
2962 /// turned into an explicit branch.
2963 static bool isFormingBranchFromSelectProfitable(SelectInst *SI) {
2964 // FIXME: This should use the same heuristics as IfConversion to determine
2965 // whether a select is better represented as a branch. This requires that
2966 // branch probability metadata is preserved for the select, which is not the
2969 CmpInst *Cmp = dyn_cast<CmpInst>(SI->getCondition());
2971 // If the branch is predicted right, an out of order CPU can avoid blocking on
2972 // the compare. Emit cmovs on compares with a memory operand as branches to
2973 // avoid stalls on the load from memory. If the compare has more than one use
2974 // there's probably another cmov or setcc around so it's not worth emitting a
2979 Value *CmpOp0 = Cmp->getOperand(0);
2980 Value *CmpOp1 = Cmp->getOperand(1);
2982 // We check that the memory operand has one use to avoid uses of the loaded
2983 // value directly after the compare, making branches unprofitable.
2984 return Cmp->hasOneUse() &&
2985 ((isa<LoadInst>(CmpOp0) && CmpOp0->hasOneUse()) ||
2986 (isa<LoadInst>(CmpOp1) && CmpOp1->hasOneUse()));
2990 /// If we have a SelectInst that will likely profit from branch prediction,
2991 /// turn it into a branch.
2992 bool CodeGenPrepare::OptimizeSelectInst(SelectInst *SI) {
2993 bool VectorCond = !SI->getCondition()->getType()->isIntegerTy(1);
2995 // Can we convert the 'select' to CF ?
2996 if (DisableSelectToBranch || OptSize || !TLI || VectorCond)
2999 TargetLowering::SelectSupportKind SelectKind;
3001 SelectKind = TargetLowering::VectorMaskSelect;
3002 else if (SI->getType()->isVectorTy())
3003 SelectKind = TargetLowering::ScalarCondVectorVal;
3005 SelectKind = TargetLowering::ScalarValSelect;
3007 // Do we have efficient codegen support for this kind of 'selects' ?
3008 if (TLI->isSelectSupported(SelectKind)) {
3009 // We have efficient codegen support for the select instruction.
3010 // Check if it is profitable to keep this 'select'.
3011 if (!TLI->isPredictableSelectExpensive() ||
3012 !isFormingBranchFromSelectProfitable(SI))
3018 // First, we split the block containing the select into 2 blocks.
3019 BasicBlock *StartBlock = SI->getParent();
3020 BasicBlock::iterator SplitPt = ++(BasicBlock::iterator(SI));
3021 BasicBlock *NextBlock = StartBlock->splitBasicBlock(SplitPt, "select.end");
3023 // Create a new block serving as the landing pad for the branch.
3024 BasicBlock *SmallBlock = BasicBlock::Create(SI->getContext(), "select.mid",
3025 NextBlock->getParent(), NextBlock);
3027 // Move the unconditional branch from the block with the select in it into our
3028 // landing pad block.
3029 StartBlock->getTerminator()->eraseFromParent();
3030 BranchInst::Create(NextBlock, SmallBlock);
3032 // Insert the real conditional branch based on the original condition.
3033 BranchInst::Create(NextBlock, SmallBlock, SI->getCondition(), SI);
3035 // The select itself is replaced with a PHI Node.
3036 PHINode *PN = PHINode::Create(SI->getType(), 2, "", NextBlock->begin());
3038 PN->addIncoming(SI->getTrueValue(), StartBlock);
3039 PN->addIncoming(SI->getFalseValue(), SmallBlock);
3040 SI->replaceAllUsesWith(PN);
3041 SI->eraseFromParent();
3043 // Instruct OptimizeBlock to skip to the next block.
3044 CurInstIterator = StartBlock->end();
3045 ++NumSelectsExpanded;
3049 static bool isBroadcastShuffle(ShuffleVectorInst *SVI) {
3050 SmallVector<int, 16> Mask(SVI->getShuffleMask());
3052 for (unsigned i = 0; i < Mask.size(); ++i) {
3053 if (SplatElem != -1 && Mask[i] != -1 && Mask[i] != SplatElem)
3055 SplatElem = Mask[i];
3061 /// Some targets have expensive vector shifts if the lanes aren't all the same
3062 /// (e.g. x86 only introduced "vpsllvd" and friends with AVX2). In these cases
3063 /// it's often worth sinking a shufflevector splat down to its use so that
3064 /// codegen can spot all lanes are identical.
3065 bool CodeGenPrepare::OptimizeShuffleVectorInst(ShuffleVectorInst *SVI) {
3066 BasicBlock *DefBB = SVI->getParent();
3068 // Only do this xform if variable vector shifts are particularly expensive.
3069 if (!TLI || !TLI->isVectorShiftByScalarCheap(SVI->getType()))
3072 // We only expect better codegen by sinking a shuffle if we can recognise a
3074 if (!isBroadcastShuffle(SVI))
3077 // InsertedShuffles - Only insert a shuffle in each block once.
3078 DenseMap<BasicBlock*, Instruction*> InsertedShuffles;
3080 bool MadeChange = false;
3081 for (User *U : SVI->users()) {
3082 Instruction *UI = cast<Instruction>(U);
3084 // Figure out which BB this ext is used in.
3085 BasicBlock *UserBB = UI->getParent();
3086 if (UserBB == DefBB) continue;
3088 // For now only apply this when the splat is used by a shift instruction.
3089 if (!UI->isShift()) continue;
3091 // Everything checks out, sink the shuffle if the user's block doesn't
3092 // already have a copy.
3093 Instruction *&InsertedShuffle = InsertedShuffles[UserBB];
3095 if (!InsertedShuffle) {
3096 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
3097 InsertedShuffle = new ShuffleVectorInst(SVI->getOperand(0),
3099 SVI->getOperand(2), "", InsertPt);
3102 UI->replaceUsesOfWith(SVI, InsertedShuffle);
3106 // If we removed all uses, nuke the shuffle.
3107 if (SVI->use_empty()) {
3108 SVI->eraseFromParent();
3115 bool CodeGenPrepare::OptimizeInst(Instruction *I) {
3116 if (PHINode *P = dyn_cast<PHINode>(I)) {
3117 // It is possible for very late stage optimizations (such as SimplifyCFG)
3118 // to introduce PHI nodes too late to be cleaned up. If we detect such a
3119 // trivial PHI, go ahead and zap it here.
3120 if (Value *V = SimplifyInstruction(P, TLI ? TLI->getDataLayout() : nullptr,
3122 P->replaceAllUsesWith(V);
3123 P->eraseFromParent();
3130 if (CastInst *CI = dyn_cast<CastInst>(I)) {
3131 // If the source of the cast is a constant, then this should have
3132 // already been constant folded. The only reason NOT to constant fold
3133 // it is if something (e.g. LSR) was careful to place the constant
3134 // evaluation in a block other than then one that uses it (e.g. to hoist
3135 // the address of globals out of a loop). If this is the case, we don't
3136 // want to forward-subst the cast.
3137 if (isa<Constant>(CI->getOperand(0)))
3140 if (TLI && OptimizeNoopCopyExpression(CI, *TLI))
3143 if (isa<ZExtInst>(I) || isa<SExtInst>(I)) {
3144 /// Sink a zext or sext into its user blocks if the target type doesn't
3145 /// fit in one register
3146 if (TLI && TLI->getTypeAction(CI->getContext(),
3147 TLI->getValueType(CI->getType())) ==
3148 TargetLowering::TypeExpandInteger) {
3149 return SinkCast(CI);
3151 bool MadeChange = MoveExtToFormExtLoad(I);
3152 return MadeChange | OptimizeExtUses(I);
3158 if (CmpInst *CI = dyn_cast<CmpInst>(I))
3159 if (!TLI || !TLI->hasMultipleConditionRegisters())
3160 return OptimizeCmpExpression(CI);
3162 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
3164 return OptimizeMemoryInst(I, I->getOperand(0), LI->getType());
3168 if (StoreInst *SI = dyn_cast<StoreInst>(I)) {
3170 return OptimizeMemoryInst(I, SI->getOperand(1),
3171 SI->getOperand(0)->getType());
3175 BinaryOperator *BinOp = dyn_cast<BinaryOperator>(I);
3177 if (BinOp && (BinOp->getOpcode() == Instruction::AShr ||
3178 BinOp->getOpcode() == Instruction::LShr)) {
3179 ConstantInt *CI = dyn_cast<ConstantInt>(BinOp->getOperand(1));
3180 if (TLI && CI && TLI->hasExtractBitsInsn())
3181 return OptimizeExtractBits(BinOp, CI, *TLI);
3186 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) {
3187 if (GEPI->hasAllZeroIndices()) {
3188 /// The GEP operand must be a pointer, so must its result -> BitCast
3189 Instruction *NC = new BitCastInst(GEPI->getOperand(0), GEPI->getType(),
3190 GEPI->getName(), GEPI);
3191 GEPI->replaceAllUsesWith(NC);
3192 GEPI->eraseFromParent();
3200 if (CallInst *CI = dyn_cast<CallInst>(I))
3201 return OptimizeCallInst(CI);
3203 if (SelectInst *SI = dyn_cast<SelectInst>(I))
3204 return OptimizeSelectInst(SI);
3206 if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(I))
3207 return OptimizeShuffleVectorInst(SVI);
3212 // In this pass we look for GEP and cast instructions that are used
3213 // across basic blocks and rewrite them to improve basic-block-at-a-time
3215 bool CodeGenPrepare::OptimizeBlock(BasicBlock &BB) {
3217 bool MadeChange = false;
3219 CurInstIterator = BB.begin();
3220 while (CurInstIterator != BB.end())
3221 MadeChange |= OptimizeInst(CurInstIterator++);
3223 MadeChange |= DupRetToEnableTailCallOpts(&BB);
3228 // llvm.dbg.value is far away from the value then iSel may not be able
3229 // handle it properly. iSel will drop llvm.dbg.value if it can not
3230 // find a node corresponding to the value.
3231 bool CodeGenPrepare::PlaceDbgValues(Function &F) {
3232 bool MadeChange = false;
3233 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
3234 Instruction *PrevNonDbgInst = nullptr;
3235 for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE;) {
3236 Instruction *Insn = BI; ++BI;
3237 DbgValueInst *DVI = dyn_cast<DbgValueInst>(Insn);
3238 // Leave dbg.values that refer to an alloca alone. These
3239 // instrinsics describe the address of a variable (= the alloca)
3240 // being taken. They should not be moved next to the alloca
3241 // (and to the beginning of the scope), but rather stay close to
3242 // where said address is used.
3243 if (!DVI || (DVI->getValue() && isa<AllocaInst>(DVI->getValue()))) {
3244 PrevNonDbgInst = Insn;
3248 Instruction *VI = dyn_cast_or_null<Instruction>(DVI->getValue());
3249 if (VI && VI != PrevNonDbgInst && !VI->isTerminator()) {
3250 DEBUG(dbgs() << "Moving Debug Value before :\n" << *DVI << ' ' << *VI);
3251 DVI->removeFromParent();
3252 if (isa<PHINode>(VI))
3253 DVI->insertBefore(VI->getParent()->getFirstInsertionPt());
3255 DVI->insertAfter(VI);
3264 // If there is a sequence that branches based on comparing a single bit
3265 // against zero that can be combined into a single instruction, and the
3266 // target supports folding these into a single instruction, sink the
3267 // mask and compare into the branch uses. Do this before OptimizeBlock ->
3268 // OptimizeInst -> OptimizeCmpExpression, which perturbs the pattern being
3270 bool CodeGenPrepare::sinkAndCmp(Function &F) {
3271 if (!EnableAndCmpSinking)
3273 if (!TLI || !TLI->isMaskAndBranchFoldingLegal())
3275 bool MadeChange = false;
3276 for (Function::iterator I = F.begin(), E = F.end(); I != E; ) {
3277 BasicBlock *BB = I++;
3279 // Does this BB end with the following?
3280 // %andVal = and %val, #single-bit-set
3281 // %icmpVal = icmp %andResult, 0
3282 // br i1 %cmpVal label %dest1, label %dest2"
3283 BranchInst *Brcc = dyn_cast<BranchInst>(BB->getTerminator());
3284 if (!Brcc || !Brcc->isConditional())
3286 ICmpInst *Cmp = dyn_cast<ICmpInst>(Brcc->getOperand(0));
3287 if (!Cmp || Cmp->getParent() != BB)
3289 ConstantInt *Zero = dyn_cast<ConstantInt>(Cmp->getOperand(1));
3290 if (!Zero || !Zero->isZero())
3292 Instruction *And = dyn_cast<Instruction>(Cmp->getOperand(0));
3293 if (!And || And->getOpcode() != Instruction::And || And->getParent() != BB)
3295 ConstantInt* Mask = dyn_cast<ConstantInt>(And->getOperand(1));
3296 if (!Mask || !Mask->getUniqueInteger().isPowerOf2())
3298 DEBUG(dbgs() << "found and; icmp ?,0; brcc\n"); DEBUG(BB->dump());
3300 // Push the "and; icmp" for any users that are conditional branches.
3301 // Since there can only be one branch use per BB, we don't need to keep
3302 // track of which BBs we insert into.
3303 for (Value::use_iterator UI = Cmp->use_begin(), E = Cmp->use_end();
3307 BranchInst *BrccUser = dyn_cast<BranchInst>(*UI);
3309 if (!BrccUser || !BrccUser->isConditional())
3311 BasicBlock *UserBB = BrccUser->getParent();
3312 if (UserBB == BB) continue;
3313 DEBUG(dbgs() << "found Brcc use\n");
3315 // Sink the "and; icmp" to use.
3317 BinaryOperator *NewAnd =
3318 BinaryOperator::CreateAnd(And->getOperand(0), And->getOperand(1), "",
3321 CmpInst::Create(Cmp->getOpcode(), Cmp->getPredicate(), NewAnd, Zero,
3325 DEBUG(BrccUser->getParent()->dump());