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/Analysis/TargetLibraryInfo.h"
22 #include "llvm/Analysis/TargetTransformInfo.h"
23 #include "llvm/IR/CallSite.h"
24 #include "llvm/IR/Constants.h"
25 #include "llvm/IR/DataLayout.h"
26 #include "llvm/IR/DerivedTypes.h"
27 #include "llvm/IR/Dominators.h"
28 #include "llvm/IR/Function.h"
29 #include "llvm/IR/GetElementPtrTypeIterator.h"
30 #include "llvm/IR/IRBuilder.h"
31 #include "llvm/IR/InlineAsm.h"
32 #include "llvm/IR/Instructions.h"
33 #include "llvm/IR/IntrinsicInst.h"
34 #include "llvm/IR/MDBuilder.h"
35 #include "llvm/IR/PatternMatch.h"
36 #include "llvm/IR/Statepoint.h"
37 #include "llvm/IR/ValueHandle.h"
38 #include "llvm/IR/ValueMap.h"
39 #include "llvm/Pass.h"
40 #include "llvm/Support/CommandLine.h"
41 #include "llvm/Support/Debug.h"
42 #include "llvm/Support/raw_ostream.h"
43 #include "llvm/Target/TargetLowering.h"
44 #include "llvm/Target/TargetSubtargetInfo.h"
45 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
46 #include "llvm/Transforms/Utils/BuildLibCalls.h"
47 #include "llvm/Transforms/Utils/BypassSlowDivision.h"
48 #include "llvm/Transforms/Utils/Local.h"
49 #include "llvm/Transforms/Utils/SimplifyLibCalls.h"
51 using namespace llvm::PatternMatch;
53 #define DEBUG_TYPE "codegenprepare"
55 STATISTIC(NumBlocksElim, "Number of blocks eliminated");
56 STATISTIC(NumPHIsElim, "Number of trivial PHIs eliminated");
57 STATISTIC(NumGEPsElim, "Number of GEPs converted to casts");
58 STATISTIC(NumCmpUses, "Number of uses of Cmp expressions replaced with uses of "
60 STATISTIC(NumCastUses, "Number of uses of Cast expressions replaced with uses "
62 STATISTIC(NumMemoryInsts, "Number of memory instructions whose address "
63 "computations were sunk");
64 STATISTIC(NumExtsMoved, "Number of [s|z]ext instructions combined with loads");
65 STATISTIC(NumExtUses, "Number of uses of [s|z]ext instructions optimized");
66 STATISTIC(NumRetsDup, "Number of return instructions duplicated");
67 STATISTIC(NumDbgValueMoved, "Number of debug value instructions moved");
68 STATISTIC(NumSelectsExpanded, "Number of selects turned into branches");
69 STATISTIC(NumAndCmpsMoved, "Number of and/cmp's pushed into branches");
70 STATISTIC(NumStoreExtractExposed, "Number of store(extractelement) exposed");
72 static cl::opt<bool> DisableBranchOpts(
73 "disable-cgp-branch-opts", cl::Hidden, cl::init(false),
74 cl::desc("Disable branch optimizations in CodeGenPrepare"));
77 DisableGCOpts("disable-cgp-gc-opts", cl::Hidden, cl::init(false),
78 cl::desc("Disable GC optimizations in CodeGenPrepare"));
80 static cl::opt<bool> DisableSelectToBranch(
81 "disable-cgp-select2branch", cl::Hidden, cl::init(false),
82 cl::desc("Disable select to branch conversion."));
84 static cl::opt<bool> AddrSinkUsingGEPs(
85 "addr-sink-using-gep", cl::Hidden, cl::init(false),
86 cl::desc("Address sinking in CGP using GEPs."));
88 static cl::opt<bool> EnableAndCmpSinking(
89 "enable-andcmp-sinking", cl::Hidden, cl::init(true),
90 cl::desc("Enable sinkinig and/cmp into branches."));
92 static cl::opt<bool> DisableStoreExtract(
93 "disable-cgp-store-extract", cl::Hidden, cl::init(false),
94 cl::desc("Disable store(extract) optimizations in CodeGenPrepare"));
96 static cl::opt<bool> StressStoreExtract(
97 "stress-cgp-store-extract", cl::Hidden, cl::init(false),
98 cl::desc("Stress test store(extract) optimizations in CodeGenPrepare"));
100 static cl::opt<bool> DisableExtLdPromotion(
101 "disable-cgp-ext-ld-promotion", cl::Hidden, cl::init(false),
102 cl::desc("Disable ext(promotable(ld)) -> promoted(ext(ld)) optimization in "
105 static cl::opt<bool> StressExtLdPromotion(
106 "stress-cgp-ext-ld-promotion", cl::Hidden, cl::init(false),
107 cl::desc("Stress test ext(promotable(ld)) -> promoted(ext(ld)) "
108 "optimization in CodeGenPrepare"));
111 typedef SmallPtrSet<Instruction *, 16> SetOfInstrs;
115 TypeIsSExt(Type *Ty, bool IsSExt) : Ty(Ty), IsSExt(IsSExt) {}
117 typedef DenseMap<Instruction *, TypeIsSExt> InstrToOrigTy;
118 class TypePromotionTransaction;
120 class CodeGenPrepare : public FunctionPass {
121 /// TLI - Keep a pointer of a TargetLowering to consult for determining
122 /// transformation profitability.
123 const TargetMachine *TM;
124 const TargetLowering *TLI;
125 const TargetTransformInfo *TTI;
126 const TargetLibraryInfo *TLInfo;
129 /// CurInstIterator - As we scan instructions optimizing them, this is the
130 /// next instruction to optimize. Xforms that can invalidate this should
132 BasicBlock::iterator CurInstIterator;
134 /// Keeps track of non-local addresses that have been sunk into a block.
135 /// This allows us to avoid inserting duplicate code for blocks with
136 /// multiple load/stores of the same address.
137 ValueMap<Value*, Value*> SunkAddrs;
139 /// Keeps track of all truncates inserted for the current function.
140 SetOfInstrs InsertedTruncsSet;
141 /// Keeps track of the type of the related instruction before their
142 /// promotion for the current function.
143 InstrToOrigTy PromotedInsts;
145 /// ModifiedDT - If CFG is modified in anyway, dominator tree may need to
149 /// OptSize - True if optimizing for size.
153 static char ID; // Pass identification, replacement for typeid
154 explicit CodeGenPrepare(const TargetMachine *TM = nullptr)
155 : FunctionPass(ID), TM(TM), TLI(nullptr), TTI(nullptr) {
156 initializeCodeGenPreparePass(*PassRegistry::getPassRegistry());
158 bool runOnFunction(Function &F) override;
160 const char *getPassName() const override { return "CodeGen Prepare"; }
162 void getAnalysisUsage(AnalysisUsage &AU) const override {
163 AU.addPreserved<DominatorTreeWrapperPass>();
164 AU.addRequired<TargetLibraryInfoWrapperPass>();
165 AU.addRequired<TargetTransformInfoWrapperPass>();
169 bool EliminateFallThrough(Function &F);
170 bool EliminateMostlyEmptyBlocks(Function &F);
171 bool CanMergeBlocks(const BasicBlock *BB, const BasicBlock *DestBB) const;
172 void EliminateMostlyEmptyBlock(BasicBlock *BB);
173 bool OptimizeBlock(BasicBlock &BB, bool& ModifiedDT);
174 bool OptimizeInst(Instruction *I, bool& ModifiedDT);
175 bool OptimizeMemoryInst(Instruction *I, Value *Addr, Type *AccessTy);
176 bool OptimizeInlineAsmInst(CallInst *CS);
177 bool OptimizeCallInst(CallInst *CI, bool& ModifiedDT);
178 bool MoveExtToFormExtLoad(Instruction *&I);
179 bool OptimizeExtUses(Instruction *I);
180 bool OptimizeSelectInst(SelectInst *SI);
181 bool OptimizeShuffleVectorInst(ShuffleVectorInst *SI);
182 bool OptimizeExtractElementInst(Instruction *Inst);
183 bool DupRetToEnableTailCallOpts(BasicBlock *BB);
184 bool PlaceDbgValues(Function &F);
185 bool sinkAndCmp(Function &F);
186 bool ExtLdPromotion(TypePromotionTransaction &TPT, LoadInst *&LI,
188 const SmallVectorImpl<Instruction *> &Exts,
189 unsigned CreatedInst);
190 bool splitBranchCondition(Function &F);
191 bool simplifyOffsetableRelocate(Instruction &I);
195 char CodeGenPrepare::ID = 0;
196 INITIALIZE_TM_PASS(CodeGenPrepare, "codegenprepare",
197 "Optimize for code generation", false, false)
199 FunctionPass *llvm::createCodeGenPreparePass(const TargetMachine *TM) {
200 return new CodeGenPrepare(TM);
203 bool CodeGenPrepare::runOnFunction(Function &F) {
204 if (skipOptnoneFunction(F))
207 bool EverMadeChange = false;
208 // Clear per function information.
209 InsertedTruncsSet.clear();
210 PromotedInsts.clear();
214 TLI = TM->getSubtargetImpl(F)->getTargetLowering();
215 TLInfo = &getAnalysis<TargetLibraryInfoWrapperPass>().getTLI();
216 TTI = &getAnalysis<TargetTransformInfoWrapperPass>().getTTI(F);
217 DominatorTreeWrapperPass *DTWP =
218 getAnalysisIfAvailable<DominatorTreeWrapperPass>();
219 DT = DTWP ? &DTWP->getDomTree() : nullptr;
220 OptSize = F.hasFnAttribute(Attribute::OptimizeForSize);
222 /// This optimization identifies DIV instructions that can be
223 /// profitably bypassed and carried out with a shorter, faster divide.
224 if (!OptSize && TLI && TLI->isSlowDivBypassed()) {
225 const DenseMap<unsigned int, unsigned int> &BypassWidths =
226 TLI->getBypassSlowDivWidths();
227 for (Function::iterator I = F.begin(); I != F.end(); I++)
228 EverMadeChange |= bypassSlowDivision(F, I, BypassWidths);
231 // Eliminate blocks that contain only PHI nodes and an
232 // unconditional branch.
233 EverMadeChange |= EliminateMostlyEmptyBlocks(F);
235 // llvm.dbg.value is far away from the value then iSel may not be able
236 // handle it properly. iSel will drop llvm.dbg.value if it can not
237 // find a node corresponding to the value.
238 EverMadeChange |= PlaceDbgValues(F);
240 // If there is a mask, compare against zero, and branch that can be combined
241 // into a single target instruction, push the mask and compare into branch
242 // users. Do this before OptimizeBlock -> OptimizeInst ->
243 // OptimizeCmpExpression, which perturbs the pattern being searched for.
244 if (!DisableBranchOpts) {
245 EverMadeChange |= sinkAndCmp(F);
246 EverMadeChange |= splitBranchCondition(F);
249 bool MadeChange = true;
252 for (Function::iterator I = F.begin(); I != F.end(); ) {
253 BasicBlock *BB = I++;
254 bool ModifiedDTOnIteration = false;
255 MadeChange |= OptimizeBlock(*BB, ModifiedDTOnIteration);
257 // Restart BB iteration if the dominator tree of the Function was changed
258 ModifiedDT |= ModifiedDTOnIteration;
259 if (ModifiedDTOnIteration)
262 EverMadeChange |= MadeChange;
267 if (!DisableBranchOpts) {
269 SmallPtrSet<BasicBlock*, 8> WorkList;
270 for (BasicBlock &BB : F) {
271 SmallVector<BasicBlock *, 2> Successors(succ_begin(&BB), succ_end(&BB));
272 MadeChange |= ConstantFoldTerminator(&BB, true);
273 if (!MadeChange) continue;
275 for (SmallVectorImpl<BasicBlock*>::iterator
276 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
277 if (pred_begin(*II) == pred_end(*II))
278 WorkList.insert(*II);
281 // Delete the dead blocks and any of their dead successors.
282 MadeChange |= !WorkList.empty();
283 while (!WorkList.empty()) {
284 BasicBlock *BB = *WorkList.begin();
286 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB));
290 for (SmallVectorImpl<BasicBlock*>::iterator
291 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
292 if (pred_begin(*II) == pred_end(*II))
293 WorkList.insert(*II);
296 // Merge pairs of basic blocks with unconditional branches, connected by
298 if (EverMadeChange || MadeChange)
299 MadeChange |= EliminateFallThrough(F);
303 EverMadeChange |= MadeChange;
306 if (!DisableGCOpts) {
307 SmallVector<Instruction *, 2> Statepoints;
308 for (BasicBlock &BB : F)
309 for (Instruction &I : BB)
311 Statepoints.push_back(&I);
312 for (auto &I : Statepoints)
313 EverMadeChange |= simplifyOffsetableRelocate(*I);
316 if (ModifiedDT && DT)
319 return EverMadeChange;
322 /// EliminateFallThrough - Merge basic blocks which are connected
323 /// by a single edge, where one of the basic blocks has a single successor
324 /// pointing to the other basic block, which has a single predecessor.
325 bool CodeGenPrepare::EliminateFallThrough(Function &F) {
326 bool Changed = false;
327 // Scan all of the blocks in the function, except for the entry block.
328 for (Function::iterator I = std::next(F.begin()), E = F.end(); I != E;) {
329 BasicBlock *BB = I++;
330 // If the destination block has a single pred, then this is a trivial
331 // edge, just collapse it.
332 BasicBlock *SinglePred = BB->getSinglePredecessor();
334 // Don't merge if BB's address is taken.
335 if (!SinglePred || SinglePred == BB || BB->hasAddressTaken()) continue;
337 BranchInst *Term = dyn_cast<BranchInst>(SinglePred->getTerminator());
338 if (Term && !Term->isConditional()) {
340 DEBUG(dbgs() << "To merge:\n"<< *SinglePred << "\n\n\n");
341 // Remember if SinglePred was the entry block of the function.
342 // If so, we will need to move BB back to the entry position.
343 bool isEntry = SinglePred == &SinglePred->getParent()->getEntryBlock();
344 MergeBasicBlockIntoOnlyPred(BB, DT);
346 if (isEntry && BB != &BB->getParent()->getEntryBlock())
347 BB->moveBefore(&BB->getParent()->getEntryBlock());
349 // We have erased a block. Update the iterator.
356 /// EliminateMostlyEmptyBlocks - eliminate blocks that contain only PHI nodes,
357 /// debug info directives, and an unconditional branch. Passes before isel
358 /// (e.g. LSR/loopsimplify) often split edges in ways that are non-optimal for
359 /// isel. Start by eliminating these blocks so we can split them the way we
361 bool CodeGenPrepare::EliminateMostlyEmptyBlocks(Function &F) {
362 bool MadeChange = false;
363 // Note that this intentionally skips the entry block.
364 for (Function::iterator I = std::next(F.begin()), E = F.end(); I != E;) {
365 BasicBlock *BB = I++;
367 // If this block doesn't end with an uncond branch, ignore it.
368 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
369 if (!BI || !BI->isUnconditional())
372 // If the instruction before the branch (skipping debug info) isn't a phi
373 // node, then other stuff is happening here.
374 BasicBlock::iterator BBI = BI;
375 if (BBI != BB->begin()) {
377 while (isa<DbgInfoIntrinsic>(BBI)) {
378 if (BBI == BB->begin())
382 if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI))
386 // Do not break infinite loops.
387 BasicBlock *DestBB = BI->getSuccessor(0);
391 if (!CanMergeBlocks(BB, DestBB))
394 EliminateMostlyEmptyBlock(BB);
400 /// CanMergeBlocks - Return true if we can merge BB into DestBB if there is a
401 /// single uncond branch between them, and BB contains no other non-phi
403 bool CodeGenPrepare::CanMergeBlocks(const BasicBlock *BB,
404 const BasicBlock *DestBB) const {
405 // We only want to eliminate blocks whose phi nodes are used by phi nodes in
406 // the successor. If there are more complex condition (e.g. preheaders),
407 // don't mess around with them.
408 BasicBlock::const_iterator BBI = BB->begin();
409 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
410 for (const User *U : PN->users()) {
411 const Instruction *UI = cast<Instruction>(U);
412 if (UI->getParent() != DestBB || !isa<PHINode>(UI))
414 // If User is inside DestBB block and it is a PHINode then check
415 // incoming value. If incoming value is not from BB then this is
416 // a complex condition (e.g. preheaders) we want to avoid here.
417 if (UI->getParent() == DestBB) {
418 if (const PHINode *UPN = dyn_cast<PHINode>(UI))
419 for (unsigned I = 0, E = UPN->getNumIncomingValues(); I != E; ++I) {
420 Instruction *Insn = dyn_cast<Instruction>(UPN->getIncomingValue(I));
421 if (Insn && Insn->getParent() == BB &&
422 Insn->getParent() != UPN->getIncomingBlock(I))
429 // If BB and DestBB contain any common predecessors, then the phi nodes in BB
430 // and DestBB may have conflicting incoming values for the block. If so, we
431 // can't merge the block.
432 const PHINode *DestBBPN = dyn_cast<PHINode>(DestBB->begin());
433 if (!DestBBPN) return true; // no conflict.
435 // Collect the preds of BB.
436 SmallPtrSet<const BasicBlock*, 16> BBPreds;
437 if (const PHINode *BBPN = dyn_cast<PHINode>(BB->begin())) {
438 // It is faster to get preds from a PHI than with pred_iterator.
439 for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i)
440 BBPreds.insert(BBPN->getIncomingBlock(i));
442 BBPreds.insert(pred_begin(BB), pred_end(BB));
445 // Walk the preds of DestBB.
446 for (unsigned i = 0, e = DestBBPN->getNumIncomingValues(); i != e; ++i) {
447 BasicBlock *Pred = DestBBPN->getIncomingBlock(i);
448 if (BBPreds.count(Pred)) { // Common predecessor?
449 BBI = DestBB->begin();
450 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
451 const Value *V1 = PN->getIncomingValueForBlock(Pred);
452 const Value *V2 = PN->getIncomingValueForBlock(BB);
454 // If V2 is a phi node in BB, look up what the mapped value will be.
455 if (const PHINode *V2PN = dyn_cast<PHINode>(V2))
456 if (V2PN->getParent() == BB)
457 V2 = V2PN->getIncomingValueForBlock(Pred);
459 // If there is a conflict, bail out.
460 if (V1 != V2) return false;
469 /// EliminateMostlyEmptyBlock - Eliminate a basic block that have only phi's and
470 /// an unconditional branch in it.
471 void CodeGenPrepare::EliminateMostlyEmptyBlock(BasicBlock *BB) {
472 BranchInst *BI = cast<BranchInst>(BB->getTerminator());
473 BasicBlock *DestBB = BI->getSuccessor(0);
475 DEBUG(dbgs() << "MERGING MOSTLY EMPTY BLOCKS - BEFORE:\n" << *BB << *DestBB);
477 // If the destination block has a single pred, then this is a trivial edge,
479 if (BasicBlock *SinglePred = DestBB->getSinglePredecessor()) {
480 if (SinglePred != DestBB) {
481 // Remember if SinglePred was the entry block of the function. If so, we
482 // will need to move BB back to the entry position.
483 bool isEntry = SinglePred == &SinglePred->getParent()->getEntryBlock();
484 MergeBasicBlockIntoOnlyPred(DestBB, DT);
486 if (isEntry && BB != &BB->getParent()->getEntryBlock())
487 BB->moveBefore(&BB->getParent()->getEntryBlock());
489 DEBUG(dbgs() << "AFTER:\n" << *DestBB << "\n\n\n");
494 // Otherwise, we have multiple predecessors of BB. Update the PHIs in DestBB
495 // to handle the new incoming edges it is about to have.
497 for (BasicBlock::iterator BBI = DestBB->begin();
498 (PN = dyn_cast<PHINode>(BBI)); ++BBI) {
499 // Remove the incoming value for BB, and remember it.
500 Value *InVal = PN->removeIncomingValue(BB, false);
502 // Two options: either the InVal is a phi node defined in BB or it is some
503 // value that dominates BB.
504 PHINode *InValPhi = dyn_cast<PHINode>(InVal);
505 if (InValPhi && InValPhi->getParent() == BB) {
506 // Add all of the input values of the input PHI as inputs of this phi.
507 for (unsigned i = 0, e = InValPhi->getNumIncomingValues(); i != e; ++i)
508 PN->addIncoming(InValPhi->getIncomingValue(i),
509 InValPhi->getIncomingBlock(i));
511 // Otherwise, add one instance of the dominating value for each edge that
512 // we will be adding.
513 if (PHINode *BBPN = dyn_cast<PHINode>(BB->begin())) {
514 for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i)
515 PN->addIncoming(InVal, BBPN->getIncomingBlock(i));
517 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
518 PN->addIncoming(InVal, *PI);
523 // The PHIs are now updated, change everything that refers to BB to use
524 // DestBB and remove BB.
525 BB->replaceAllUsesWith(DestBB);
526 if (DT && !ModifiedDT) {
527 BasicBlock *BBIDom = DT->getNode(BB)->getIDom()->getBlock();
528 BasicBlock *DestBBIDom = DT->getNode(DestBB)->getIDom()->getBlock();
529 BasicBlock *NewIDom = DT->findNearestCommonDominator(BBIDom, DestBBIDom);
530 DT->changeImmediateDominator(DestBB, NewIDom);
533 BB->eraseFromParent();
536 DEBUG(dbgs() << "AFTER:\n" << *DestBB << "\n\n\n");
539 // Computes a map of base pointer relocation instructions to corresponding
540 // derived pointer relocation instructions given a vector of all relocate calls
541 static void computeBaseDerivedRelocateMap(
542 const SmallVectorImpl<User *> &AllRelocateCalls,
543 DenseMap<IntrinsicInst *, SmallVector<IntrinsicInst *, 2>> &
545 // Collect information in two maps: one primarily for locating the base object
546 // while filling the second map; the second map is the final structure holding
547 // a mapping between Base and corresponding Derived relocate calls
548 DenseMap<std::pair<unsigned, unsigned>, IntrinsicInst *> RelocateIdxMap;
549 for (auto &U : AllRelocateCalls) {
550 GCRelocateOperands ThisRelocate(U);
551 IntrinsicInst *I = cast<IntrinsicInst>(U);
552 auto K = std::make_pair(ThisRelocate.basePtrIndex(),
553 ThisRelocate.derivedPtrIndex());
554 RelocateIdxMap.insert(std::make_pair(K, I));
556 for (auto &Item : RelocateIdxMap) {
557 std::pair<unsigned, unsigned> Key = Item.first;
558 if (Key.first == Key.second)
559 // Base relocation: nothing to insert
562 IntrinsicInst *I = Item.second;
563 auto BaseKey = std::make_pair(Key.first, Key.first);
564 IntrinsicInst *Base = RelocateIdxMap[BaseKey];
566 // TODO: We might want to insert a new base object relocate and gep off
567 // that, if there are enough derived object relocates.
569 RelocateInstMap[Base].push_back(I);
573 // Accepts a GEP and extracts the operands into a vector provided they're all
574 // small integer constants
575 static bool getGEPSmallConstantIntOffsetV(GetElementPtrInst *GEP,
576 SmallVectorImpl<Value *> &OffsetV) {
577 for (unsigned i = 1; i < GEP->getNumOperands(); i++) {
578 // Only accept small constant integer operands
579 auto Op = dyn_cast<ConstantInt>(GEP->getOperand(i));
580 if (!Op || Op->getZExtValue() > 20)
584 for (unsigned i = 1; i < GEP->getNumOperands(); i++)
585 OffsetV.push_back(GEP->getOperand(i));
589 // Takes a RelocatedBase (base pointer relocation instruction) and Targets to
590 // replace, computes a replacement, and affects it.
592 simplifyRelocatesOffABase(IntrinsicInst *RelocatedBase,
593 const SmallVectorImpl<IntrinsicInst *> &Targets) {
594 bool MadeChange = false;
595 for (auto &ToReplace : Targets) {
596 GCRelocateOperands MasterRelocate(RelocatedBase);
597 GCRelocateOperands ThisRelocate(ToReplace);
599 assert(ThisRelocate.basePtrIndex() == MasterRelocate.basePtrIndex() &&
600 "Not relocating a derived object of the original base object");
601 if (ThisRelocate.basePtrIndex() == ThisRelocate.derivedPtrIndex()) {
602 // A duplicate relocate call. TODO: coalesce duplicates.
606 Value *Base = ThisRelocate.basePtr();
607 auto Derived = dyn_cast<GetElementPtrInst>(ThisRelocate.derivedPtr());
608 if (!Derived || Derived->getPointerOperand() != Base)
611 SmallVector<Value *, 2> OffsetV;
612 if (!getGEPSmallConstantIntOffsetV(Derived, OffsetV))
615 // Create a Builder and replace the target callsite with a gep
616 IRBuilder<> Builder(ToReplace);
617 Builder.SetCurrentDebugLocation(ToReplace->getDebugLoc());
619 Builder.CreateGEP(RelocatedBase, makeArrayRef(OffsetV));
620 Instruction *ReplacementInst = cast<Instruction>(Replacement);
621 ReplacementInst->removeFromParent();
622 ReplacementInst->insertAfter(RelocatedBase);
623 Replacement->takeName(ToReplace);
624 ToReplace->replaceAllUsesWith(Replacement);
625 ToReplace->eraseFromParent();
635 // %ptr = gep %base + 15
636 // %tok = statepoint (%fun, i32 0, i32 0, i32 0, %base, %ptr)
637 // %base' = relocate(%tok, i32 4, i32 4)
638 // %ptr' = relocate(%tok, i32 4, i32 5)
644 // %ptr = gep %base + 15
645 // %tok = statepoint (%fun, i32 0, i32 0, i32 0, %base, %ptr)
646 // %base' = gc.relocate(%tok, i32 4, i32 4)
647 // %ptr' = gep %base' + 15
649 bool CodeGenPrepare::simplifyOffsetableRelocate(Instruction &I) {
650 bool MadeChange = false;
651 SmallVector<User *, 2> AllRelocateCalls;
653 for (auto *U : I.users())
654 if (isGCRelocate(dyn_cast<Instruction>(U)))
655 // Collect all the relocate calls associated with a statepoint
656 AllRelocateCalls.push_back(U);
658 // We need atleast one base pointer relocation + one derived pointer
659 // relocation to mangle
660 if (AllRelocateCalls.size() < 2)
663 // RelocateInstMap is a mapping from the base relocate instruction to the
664 // corresponding derived relocate instructions
665 DenseMap<IntrinsicInst *, SmallVector<IntrinsicInst *, 2>> RelocateInstMap;
666 computeBaseDerivedRelocateMap(AllRelocateCalls, RelocateInstMap);
667 if (RelocateInstMap.empty())
670 for (auto &Item : RelocateInstMap)
671 // Item.first is the RelocatedBase to offset against
672 // Item.second is the vector of Targets to replace
673 MadeChange = simplifyRelocatesOffABase(Item.first, Item.second);
677 /// SinkCast - Sink the specified cast instruction into its user blocks
678 static bool SinkCast(CastInst *CI) {
679 BasicBlock *DefBB = CI->getParent();
681 /// InsertedCasts - Only insert a cast in each block once.
682 DenseMap<BasicBlock*, CastInst*> InsertedCasts;
684 bool MadeChange = false;
685 for (Value::user_iterator UI = CI->user_begin(), E = CI->user_end();
687 Use &TheUse = UI.getUse();
688 Instruction *User = cast<Instruction>(*UI);
690 // Figure out which BB this cast is used in. For PHI's this is the
691 // appropriate predecessor block.
692 BasicBlock *UserBB = User->getParent();
693 if (PHINode *PN = dyn_cast<PHINode>(User)) {
694 UserBB = PN->getIncomingBlock(TheUse);
697 // Preincrement use iterator so we don't invalidate it.
700 // If this user is in the same block as the cast, don't change the cast.
701 if (UserBB == DefBB) continue;
703 // If we have already inserted a cast into this block, use it.
704 CastInst *&InsertedCast = InsertedCasts[UserBB];
707 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
709 CastInst::Create(CI->getOpcode(), CI->getOperand(0), CI->getType(), "",
714 // Replace a use of the cast with a use of the new cast.
715 TheUse = InsertedCast;
719 // If we removed all uses, nuke the cast.
720 if (CI->use_empty()) {
721 CI->eraseFromParent();
728 /// OptimizeNoopCopyExpression - If the specified cast instruction is a noop
729 /// copy (e.g. it's casting from one pointer type to another, i32->i8 on PPC),
730 /// sink it into user blocks to reduce the number of virtual
731 /// registers that must be created and coalesced.
733 /// Return true if any changes are made.
735 static bool OptimizeNoopCopyExpression(CastInst *CI, const TargetLowering &TLI){
736 // If this is a noop copy,
737 EVT SrcVT = TLI.getValueType(CI->getOperand(0)->getType());
738 EVT DstVT = TLI.getValueType(CI->getType());
740 // This is an fp<->int conversion?
741 if (SrcVT.isInteger() != DstVT.isInteger())
744 // If this is an extension, it will be a zero or sign extension, which
746 if (SrcVT.bitsLT(DstVT)) return false;
748 // If these values will be promoted, find out what they will be promoted
749 // to. This helps us consider truncates on PPC as noop copies when they
751 if (TLI.getTypeAction(CI->getContext(), SrcVT) ==
752 TargetLowering::TypePromoteInteger)
753 SrcVT = TLI.getTypeToTransformTo(CI->getContext(), SrcVT);
754 if (TLI.getTypeAction(CI->getContext(), DstVT) ==
755 TargetLowering::TypePromoteInteger)
756 DstVT = TLI.getTypeToTransformTo(CI->getContext(), DstVT);
758 // If, after promotion, these are the same types, this is a noop copy.
765 /// OptimizeCmpExpression - sink the given CmpInst into user blocks to reduce
766 /// the number of virtual registers that must be created and coalesced. This is
767 /// a clear win except on targets with multiple condition code registers
768 /// (PowerPC), where it might lose; some adjustment may be wanted there.
770 /// Return true if any changes are made.
771 static bool OptimizeCmpExpression(CmpInst *CI) {
772 BasicBlock *DefBB = CI->getParent();
774 /// InsertedCmp - Only insert a cmp in each block once.
775 DenseMap<BasicBlock*, CmpInst*> InsertedCmps;
777 bool MadeChange = false;
778 for (Value::user_iterator UI = CI->user_begin(), E = CI->user_end();
780 Use &TheUse = UI.getUse();
781 Instruction *User = cast<Instruction>(*UI);
783 // Preincrement use iterator so we don't invalidate it.
786 // Don't bother for PHI nodes.
787 if (isa<PHINode>(User))
790 // Figure out which BB this cmp is used in.
791 BasicBlock *UserBB = User->getParent();
793 // If this user is in the same block as the cmp, don't change the cmp.
794 if (UserBB == DefBB) continue;
796 // If we have already inserted a cmp into this block, use it.
797 CmpInst *&InsertedCmp = InsertedCmps[UserBB];
800 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
802 CmpInst::Create(CI->getOpcode(),
803 CI->getPredicate(), CI->getOperand(0),
804 CI->getOperand(1), "", InsertPt);
808 // Replace a use of the cmp with a use of the new cmp.
809 TheUse = InsertedCmp;
813 // If we removed all uses, nuke the cmp.
815 CI->eraseFromParent();
820 /// isExtractBitsCandidateUse - Check if the candidates could
821 /// be combined with shift instruction, which includes:
822 /// 1. Truncate instruction
823 /// 2. And instruction and the imm is a mask of the low bits:
824 /// imm & (imm+1) == 0
825 static bool isExtractBitsCandidateUse(Instruction *User) {
826 if (!isa<TruncInst>(User)) {
827 if (User->getOpcode() != Instruction::And ||
828 !isa<ConstantInt>(User->getOperand(1)))
831 const APInt &Cimm = cast<ConstantInt>(User->getOperand(1))->getValue();
833 if ((Cimm & (Cimm + 1)).getBoolValue())
839 /// SinkShiftAndTruncate - sink both shift and truncate instruction
840 /// to the use of truncate's BB.
842 SinkShiftAndTruncate(BinaryOperator *ShiftI, Instruction *User, ConstantInt *CI,
843 DenseMap<BasicBlock *, BinaryOperator *> &InsertedShifts,
844 const TargetLowering &TLI) {
845 BasicBlock *UserBB = User->getParent();
846 DenseMap<BasicBlock *, CastInst *> InsertedTruncs;
847 TruncInst *TruncI = dyn_cast<TruncInst>(User);
848 bool MadeChange = false;
850 for (Value::user_iterator TruncUI = TruncI->user_begin(),
851 TruncE = TruncI->user_end();
852 TruncUI != TruncE;) {
854 Use &TruncTheUse = TruncUI.getUse();
855 Instruction *TruncUser = cast<Instruction>(*TruncUI);
856 // Preincrement use iterator so we don't invalidate it.
860 int ISDOpcode = TLI.InstructionOpcodeToISD(TruncUser->getOpcode());
864 // If the use is actually a legal node, there will not be an
865 // implicit truncate.
866 // FIXME: always querying the result type is just an
867 // approximation; some nodes' legality is determined by the
868 // operand or other means. There's no good way to find out though.
869 if (TLI.isOperationLegalOrCustom(
870 ISDOpcode, TLI.getValueType(TruncUser->getType(), true)))
873 // Don't bother for PHI nodes.
874 if (isa<PHINode>(TruncUser))
877 BasicBlock *TruncUserBB = TruncUser->getParent();
879 if (UserBB == TruncUserBB)
882 BinaryOperator *&InsertedShift = InsertedShifts[TruncUserBB];
883 CastInst *&InsertedTrunc = InsertedTruncs[TruncUserBB];
885 if (!InsertedShift && !InsertedTrunc) {
886 BasicBlock::iterator InsertPt = TruncUserBB->getFirstInsertionPt();
888 if (ShiftI->getOpcode() == Instruction::AShr)
890 BinaryOperator::CreateAShr(ShiftI->getOperand(0), CI, "", InsertPt);
893 BinaryOperator::CreateLShr(ShiftI->getOperand(0), CI, "", InsertPt);
896 BasicBlock::iterator TruncInsertPt = TruncUserBB->getFirstInsertionPt();
899 InsertedTrunc = CastInst::Create(TruncI->getOpcode(), InsertedShift,
900 TruncI->getType(), "", TruncInsertPt);
904 TruncTheUse = InsertedTrunc;
910 /// OptimizeExtractBits - sink the shift *right* instruction into user blocks if
911 /// the uses could potentially be combined with this shift instruction and
912 /// generate BitExtract instruction. It will only be applied if the architecture
913 /// supports BitExtract instruction. Here is an example:
915 /// %x.extract.shift = lshr i64 %arg1, 32
917 /// %x.extract.trunc = trunc i64 %x.extract.shift to i16
921 /// %x.extract.shift.1 = lshr i64 %arg1, 32
922 /// %x.extract.trunc = trunc i64 %x.extract.shift.1 to i16
924 /// CodeGen will recoginze the pattern in BB2 and generate BitExtract
926 /// Return true if any changes are made.
927 static bool OptimizeExtractBits(BinaryOperator *ShiftI, ConstantInt *CI,
928 const TargetLowering &TLI) {
929 BasicBlock *DefBB = ShiftI->getParent();
931 /// Only insert instructions in each block once.
932 DenseMap<BasicBlock *, BinaryOperator *> InsertedShifts;
934 bool shiftIsLegal = TLI.isTypeLegal(TLI.getValueType(ShiftI->getType()));
936 bool MadeChange = false;
937 for (Value::user_iterator UI = ShiftI->user_begin(), E = ShiftI->user_end();
939 Use &TheUse = UI.getUse();
940 Instruction *User = cast<Instruction>(*UI);
941 // Preincrement use iterator so we don't invalidate it.
944 // Don't bother for PHI nodes.
945 if (isa<PHINode>(User))
948 if (!isExtractBitsCandidateUse(User))
951 BasicBlock *UserBB = User->getParent();
953 if (UserBB == DefBB) {
954 // If the shift and truncate instruction are in the same BB. The use of
955 // the truncate(TruncUse) may still introduce another truncate if not
956 // legal. In this case, we would like to sink both shift and truncate
957 // instruction to the BB of TruncUse.
960 // i64 shift.result = lshr i64 opnd, imm
961 // trunc.result = trunc shift.result to i16
964 // ----> We will have an implicit truncate here if the architecture does
965 // not have i16 compare.
966 // cmp i16 trunc.result, opnd2
968 if (isa<TruncInst>(User) && shiftIsLegal
969 // If the type of the truncate is legal, no trucate will be
970 // introduced in other basic blocks.
971 && (!TLI.isTypeLegal(TLI.getValueType(User->getType()))))
973 SinkShiftAndTruncate(ShiftI, User, CI, InsertedShifts, TLI);
977 // If we have already inserted a shift into this block, use it.
978 BinaryOperator *&InsertedShift = InsertedShifts[UserBB];
980 if (!InsertedShift) {
981 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
983 if (ShiftI->getOpcode() == Instruction::AShr)
985 BinaryOperator::CreateAShr(ShiftI->getOperand(0), CI, "", InsertPt);
988 BinaryOperator::CreateLShr(ShiftI->getOperand(0), CI, "", InsertPt);
993 // Replace a use of the shift with a use of the new shift.
994 TheUse = InsertedShift;
997 // If we removed all uses, nuke the shift.
998 if (ShiftI->use_empty())
999 ShiftI->eraseFromParent();
1004 // ScalarizeMaskedLoad() translates masked load intrinsic, like
1005 // <16 x i32 > @llvm.masked.load( <16 x i32>* %addr, i32 align,
1006 // <16 x i1> %mask, <16 x i32> %passthru)
1007 // to a chain of basic blocks, whith loading element one-by-one if
1008 // the appropriate mask bit is set
1010 // %1 = bitcast i8* %addr to i32*
1011 // %2 = extractelement <16 x i1> %mask, i32 0
1012 // %3 = icmp eq i1 %2, true
1013 // br i1 %3, label %cond.load, label %else
1015 //cond.load: ; preds = %0
1016 // %4 = getelementptr i32* %1, i32 0
1017 // %5 = load i32* %4
1018 // %6 = insertelement <16 x i32> undef, i32 %5, i32 0
1021 //else: ; preds = %0, %cond.load
1022 // %res.phi.else = phi <16 x i32> [ %6, %cond.load ], [ undef, %0 ]
1023 // %7 = extractelement <16 x i1> %mask, i32 1
1024 // %8 = icmp eq i1 %7, true
1025 // br i1 %8, label %cond.load1, label %else2
1027 //cond.load1: ; preds = %else
1028 // %9 = getelementptr i32* %1, i32 1
1029 // %10 = load i32* %9
1030 // %11 = insertelement <16 x i32> %res.phi.else, i32 %10, i32 1
1033 //else2: ; preds = %else, %cond.load1
1034 // %res.phi.else3 = phi <16 x i32> [ %11, %cond.load1 ], [ %res.phi.else, %else ]
1035 // %12 = extractelement <16 x i1> %mask, i32 2
1036 // %13 = icmp eq i1 %12, true
1037 // br i1 %13, label %cond.load4, label %else5
1039 static void ScalarizeMaskedLoad(CallInst *CI) {
1040 Value *Ptr = CI->getArgOperand(0);
1041 Value *Src0 = CI->getArgOperand(3);
1042 Value *Mask = CI->getArgOperand(2);
1043 VectorType *VecType = dyn_cast<VectorType>(CI->getType());
1044 Type *EltTy = VecType->getElementType();
1046 assert(VecType && "Unexpected return type of masked load intrinsic");
1048 IRBuilder<> Builder(CI->getContext());
1049 Instruction *InsertPt = CI;
1050 BasicBlock *IfBlock = CI->getParent();
1051 BasicBlock *CondBlock = nullptr;
1052 BasicBlock *PrevIfBlock = CI->getParent();
1053 Builder.SetInsertPoint(InsertPt);
1055 Builder.SetCurrentDebugLocation(CI->getDebugLoc());
1057 // Bitcast %addr fron i8* to EltTy*
1059 EltTy->getPointerTo(cast<PointerType>(Ptr->getType())->getAddressSpace());
1060 Value *FirstEltPtr = Builder.CreateBitCast(Ptr, NewPtrType);
1061 Value *UndefVal = UndefValue::get(VecType);
1063 // The result vector
1064 Value *VResult = UndefVal;
1066 PHINode *Phi = nullptr;
1067 Value *PrevPhi = UndefVal;
1069 unsigned VectorWidth = VecType->getNumElements();
1070 for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) {
1072 // Fill the "else" block, created in the previous iteration
1074 // %res.phi.else3 = phi <16 x i32> [ %11, %cond.load1 ], [ %res.phi.else, %else ]
1075 // %mask_1 = extractelement <16 x i1> %mask, i32 Idx
1076 // %to_load = icmp eq i1 %mask_1, true
1077 // br i1 %to_load, label %cond.load, label %else
1080 Phi = Builder.CreatePHI(VecType, 2, "res.phi.else");
1081 Phi->addIncoming(VResult, CondBlock);
1082 Phi->addIncoming(PrevPhi, PrevIfBlock);
1087 Value *Predicate = Builder.CreateExtractElement(Mask, Builder.getInt32(Idx));
1088 Value *Cmp = Builder.CreateICmp(ICmpInst::ICMP_EQ, Predicate,
1089 ConstantInt::get(Predicate->getType(), 1));
1091 // Create "cond" block
1093 // %EltAddr = getelementptr i32* %1, i32 0
1094 // %Elt = load i32* %EltAddr
1095 // VResult = insertelement <16 x i32> VResult, i32 %Elt, i32 Idx
1097 CondBlock = IfBlock->splitBasicBlock(InsertPt, "cond.load");
1098 Builder.SetInsertPoint(InsertPt);
1100 Value* Gep = Builder.CreateInBoundsGEP(FirstEltPtr, Builder.getInt32(Idx));
1101 LoadInst* Load = Builder.CreateLoad(Gep, false);
1102 VResult = Builder.CreateInsertElement(VResult, Load, Builder.getInt32(Idx));
1104 // Create "else" block, fill it in the next iteration
1105 BasicBlock *NewIfBlock = CondBlock->splitBasicBlock(InsertPt, "else");
1106 Builder.SetInsertPoint(InsertPt);
1107 Instruction *OldBr = IfBlock->getTerminator();
1108 BranchInst::Create(CondBlock, NewIfBlock, Cmp, OldBr);
1109 OldBr->eraseFromParent();
1110 PrevIfBlock = IfBlock;
1111 IfBlock = NewIfBlock;
1114 Phi = Builder.CreatePHI(VecType, 2, "res.phi.select");
1115 Phi->addIncoming(VResult, CondBlock);
1116 Phi->addIncoming(PrevPhi, PrevIfBlock);
1117 Value *NewI = Builder.CreateSelect(Mask, Phi, Src0);
1118 CI->replaceAllUsesWith(NewI);
1119 CI->eraseFromParent();
1122 // ScalarizeMaskedStore() translates masked store intrinsic, like
1123 // void @llvm.masked.store(<16 x i32> %src, <16 x i32>* %addr, i32 align,
1125 // to a chain of basic blocks, that stores element one-by-one if
1126 // the appropriate mask bit is set
1128 // %1 = bitcast i8* %addr to i32*
1129 // %2 = extractelement <16 x i1> %mask, i32 0
1130 // %3 = icmp eq i1 %2, true
1131 // br i1 %3, label %cond.store, label %else
1133 // cond.store: ; preds = %0
1134 // %4 = extractelement <16 x i32> %val, i32 0
1135 // %5 = getelementptr i32* %1, i32 0
1136 // store i32 %4, i32* %5
1139 // else: ; preds = %0, %cond.store
1140 // %6 = extractelement <16 x i1> %mask, i32 1
1141 // %7 = icmp eq i1 %6, true
1142 // br i1 %7, label %cond.store1, label %else2
1144 // cond.store1: ; preds = %else
1145 // %8 = extractelement <16 x i32> %val, i32 1
1146 // %9 = getelementptr i32* %1, i32 1
1147 // store i32 %8, i32* %9
1150 static void ScalarizeMaskedStore(CallInst *CI) {
1151 Value *Ptr = CI->getArgOperand(1);
1152 Value *Src = CI->getArgOperand(0);
1153 Value *Mask = CI->getArgOperand(3);
1155 VectorType *VecType = dyn_cast<VectorType>(Src->getType());
1156 Type *EltTy = VecType->getElementType();
1158 assert(VecType && "Unexpected data type in masked store intrinsic");
1160 IRBuilder<> Builder(CI->getContext());
1161 Instruction *InsertPt = CI;
1162 BasicBlock *IfBlock = CI->getParent();
1163 Builder.SetInsertPoint(InsertPt);
1164 Builder.SetCurrentDebugLocation(CI->getDebugLoc());
1166 // Bitcast %addr fron i8* to EltTy*
1168 EltTy->getPointerTo(cast<PointerType>(Ptr->getType())->getAddressSpace());
1169 Value *FirstEltPtr = Builder.CreateBitCast(Ptr, NewPtrType);
1171 unsigned VectorWidth = VecType->getNumElements();
1172 for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) {
1174 // Fill the "else" block, created in the previous iteration
1176 // %mask_1 = extractelement <16 x i1> %mask, i32 Idx
1177 // %to_store = icmp eq i1 %mask_1, true
1178 // br i1 %to_load, label %cond.store, label %else
1180 Value *Predicate = Builder.CreateExtractElement(Mask, Builder.getInt32(Idx));
1181 Value *Cmp = Builder.CreateICmp(ICmpInst::ICMP_EQ, Predicate,
1182 ConstantInt::get(Predicate->getType(), 1));
1184 // Create "cond" block
1186 // %OneElt = extractelement <16 x i32> %Src, i32 Idx
1187 // %EltAddr = getelementptr i32* %1, i32 0
1188 // %store i32 %OneElt, i32* %EltAddr
1190 BasicBlock *CondBlock = IfBlock->splitBasicBlock(InsertPt, "cond.store");
1191 Builder.SetInsertPoint(InsertPt);
1193 Value *OneElt = Builder.CreateExtractElement(Src, Builder.getInt32(Idx));
1194 Value* Gep = Builder.CreateInBoundsGEP(FirstEltPtr, Builder.getInt32(Idx));
1195 Builder.CreateStore(OneElt, Gep);
1197 // Create "else" block, fill it in the next iteration
1198 BasicBlock *NewIfBlock = CondBlock->splitBasicBlock(InsertPt, "else");
1199 Builder.SetInsertPoint(InsertPt);
1200 Instruction *OldBr = IfBlock->getTerminator();
1201 BranchInst::Create(CondBlock, NewIfBlock, Cmp, OldBr);
1202 OldBr->eraseFromParent();
1203 IfBlock = NewIfBlock;
1205 CI->eraseFromParent();
1208 bool CodeGenPrepare::OptimizeCallInst(CallInst *CI, bool& ModifiedDT) {
1209 BasicBlock *BB = CI->getParent();
1211 // Lower inline assembly if we can.
1212 // If we found an inline asm expession, and if the target knows how to
1213 // lower it to normal LLVM code, do so now.
1214 if (TLI && isa<InlineAsm>(CI->getCalledValue())) {
1215 if (TLI->ExpandInlineAsm(CI)) {
1216 // Avoid invalidating the iterator.
1217 CurInstIterator = BB->begin();
1218 // Avoid processing instructions out of order, which could cause
1219 // reuse before a value is defined.
1223 // Sink address computing for memory operands into the block.
1224 if (OptimizeInlineAsmInst(CI))
1228 IntrinsicInst *II = dyn_cast<IntrinsicInst>(CI);
1230 switch (II->getIntrinsicID()) {
1232 case Intrinsic::objectsize: {
1233 // Lower all uses of llvm.objectsize.*
1234 bool Min = (cast<ConstantInt>(II->getArgOperand(1))->getZExtValue() == 1);
1235 Type *ReturnTy = CI->getType();
1236 Constant *RetVal = ConstantInt::get(ReturnTy, Min ? 0 : -1ULL);
1238 // Substituting this can cause recursive simplifications, which can
1239 // invalidate our iterator. Use a WeakVH to hold onto it in case this
1241 WeakVH IterHandle(CurInstIterator);
1243 replaceAndRecursivelySimplify(CI, RetVal,
1244 TLI ? TLI->getDataLayout() : nullptr,
1245 TLInfo, ModifiedDT ? nullptr : DT);
1247 // If the iterator instruction was recursively deleted, start over at the
1248 // start of the block.
1249 if (IterHandle != CurInstIterator) {
1250 CurInstIterator = BB->begin();
1255 case Intrinsic::masked_load: {
1256 // Scalarize unsupported vector masked load
1257 if (!TTI->isLegalMaskedLoad(CI->getType(), 1)) {
1258 ScalarizeMaskedLoad(CI);
1264 case Intrinsic::masked_store: {
1265 if (!TTI->isLegalMaskedStore(CI->getArgOperand(0)->getType(), 1)) {
1266 ScalarizeMaskedStore(CI);
1275 SmallVector<Value*, 2> PtrOps;
1277 if (TLI->GetAddrModeArguments(II, PtrOps, AccessTy))
1278 while (!PtrOps.empty())
1279 if (OptimizeMemoryInst(II, PtrOps.pop_back_val(), AccessTy))
1284 // From here on out we're working with named functions.
1285 if (!CI->getCalledFunction()) return false;
1287 // We'll need DataLayout from here on out.
1288 const DataLayout *TD = TLI ? TLI->getDataLayout() : nullptr;
1289 if (!TD) return false;
1291 // Lower all default uses of _chk calls. This is very similar
1292 // to what InstCombineCalls does, but here we are only lowering calls
1293 // to fortified library functions (e.g. __memcpy_chk) that have the default
1294 // "don't know" as the objectsize. Anything else should be left alone.
1295 FortifiedLibCallSimplifier Simplifier(TD, TLInfo, true);
1296 if (Value *V = Simplifier.optimizeCall(CI)) {
1297 CI->replaceAllUsesWith(V);
1298 CI->eraseFromParent();
1304 /// DupRetToEnableTailCallOpts - Look for opportunities to duplicate return
1305 /// instructions to the predecessor to enable tail call optimizations. The
1306 /// case it is currently looking for is:
1309 /// %tmp0 = tail call i32 @f0()
1310 /// br label %return
1312 /// %tmp1 = tail call i32 @f1()
1313 /// br label %return
1315 /// %tmp2 = tail call i32 @f2()
1316 /// br label %return
1318 /// %retval = phi i32 [ %tmp0, %bb0 ], [ %tmp1, %bb1 ], [ %tmp2, %bb2 ]
1326 /// %tmp0 = tail call i32 @f0()
1329 /// %tmp1 = tail call i32 @f1()
1332 /// %tmp2 = tail call i32 @f2()
1335 bool CodeGenPrepare::DupRetToEnableTailCallOpts(BasicBlock *BB) {
1339 ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator());
1343 PHINode *PN = nullptr;
1344 BitCastInst *BCI = nullptr;
1345 Value *V = RI->getReturnValue();
1347 BCI = dyn_cast<BitCastInst>(V);
1349 V = BCI->getOperand(0);
1351 PN = dyn_cast<PHINode>(V);
1356 if (PN && PN->getParent() != BB)
1359 // It's not safe to eliminate the sign / zero extension of the return value.
1360 // See llvm::isInTailCallPosition().
1361 const Function *F = BB->getParent();
1362 AttributeSet CallerAttrs = F->getAttributes();
1363 if (CallerAttrs.hasAttribute(AttributeSet::ReturnIndex, Attribute::ZExt) ||
1364 CallerAttrs.hasAttribute(AttributeSet::ReturnIndex, Attribute::SExt))
1367 // Make sure there are no instructions between the PHI and return, or that the
1368 // return is the first instruction in the block.
1370 BasicBlock::iterator BI = BB->begin();
1371 do { ++BI; } while (isa<DbgInfoIntrinsic>(BI));
1373 // Also skip over the bitcast.
1378 BasicBlock::iterator BI = BB->begin();
1379 while (isa<DbgInfoIntrinsic>(BI)) ++BI;
1384 /// Only dup the ReturnInst if the CallInst is likely to be emitted as a tail
1386 SmallVector<CallInst*, 4> TailCalls;
1388 for (unsigned I = 0, E = PN->getNumIncomingValues(); I != E; ++I) {
1389 CallInst *CI = dyn_cast<CallInst>(PN->getIncomingValue(I));
1390 // Make sure the phi value is indeed produced by the tail call.
1391 if (CI && CI->hasOneUse() && CI->getParent() == PN->getIncomingBlock(I) &&
1392 TLI->mayBeEmittedAsTailCall(CI))
1393 TailCalls.push_back(CI);
1396 SmallPtrSet<BasicBlock*, 4> VisitedBBs;
1397 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) {
1398 if (!VisitedBBs.insert(*PI).second)
1401 BasicBlock::InstListType &InstList = (*PI)->getInstList();
1402 BasicBlock::InstListType::reverse_iterator RI = InstList.rbegin();
1403 BasicBlock::InstListType::reverse_iterator RE = InstList.rend();
1404 do { ++RI; } while (RI != RE && isa<DbgInfoIntrinsic>(&*RI));
1408 CallInst *CI = dyn_cast<CallInst>(&*RI);
1409 if (CI && CI->use_empty() && TLI->mayBeEmittedAsTailCall(CI))
1410 TailCalls.push_back(CI);
1414 bool Changed = false;
1415 for (unsigned i = 0, e = TailCalls.size(); i != e; ++i) {
1416 CallInst *CI = TailCalls[i];
1419 // Conservatively require the attributes of the call to match those of the
1420 // return. Ignore noalias because it doesn't affect the call sequence.
1421 AttributeSet CalleeAttrs = CS.getAttributes();
1422 if (AttrBuilder(CalleeAttrs, AttributeSet::ReturnIndex).
1423 removeAttribute(Attribute::NoAlias) !=
1424 AttrBuilder(CalleeAttrs, AttributeSet::ReturnIndex).
1425 removeAttribute(Attribute::NoAlias))
1428 // Make sure the call instruction is followed by an unconditional branch to
1429 // the return block.
1430 BasicBlock *CallBB = CI->getParent();
1431 BranchInst *BI = dyn_cast<BranchInst>(CallBB->getTerminator());
1432 if (!BI || !BI->isUnconditional() || BI->getSuccessor(0) != BB)
1435 // Duplicate the return into CallBB.
1436 (void)FoldReturnIntoUncondBranch(RI, BB, CallBB);
1437 ModifiedDT = Changed = true;
1441 // If we eliminated all predecessors of the block, delete the block now.
1442 if (Changed && !BB->hasAddressTaken() && pred_begin(BB) == pred_end(BB))
1443 BB->eraseFromParent();
1448 //===----------------------------------------------------------------------===//
1449 // Memory Optimization
1450 //===----------------------------------------------------------------------===//
1454 /// ExtAddrMode - This is an extended version of TargetLowering::AddrMode
1455 /// which holds actual Value*'s for register values.
1456 struct ExtAddrMode : public TargetLowering::AddrMode {
1459 ExtAddrMode() : BaseReg(nullptr), ScaledReg(nullptr) {}
1460 void print(raw_ostream &OS) const;
1463 bool operator==(const ExtAddrMode& O) const {
1464 return (BaseReg == O.BaseReg) && (ScaledReg == O.ScaledReg) &&
1465 (BaseGV == O.BaseGV) && (BaseOffs == O.BaseOffs) &&
1466 (HasBaseReg == O.HasBaseReg) && (Scale == O.Scale);
1471 static inline raw_ostream &operator<<(raw_ostream &OS, const ExtAddrMode &AM) {
1477 void ExtAddrMode::print(raw_ostream &OS) const {
1478 bool NeedPlus = false;
1481 OS << (NeedPlus ? " + " : "")
1483 BaseGV->printAsOperand(OS, /*PrintType=*/false);
1488 OS << (NeedPlus ? " + " : "")
1494 OS << (NeedPlus ? " + " : "")
1496 BaseReg->printAsOperand(OS, /*PrintType=*/false);
1500 OS << (NeedPlus ? " + " : "")
1502 ScaledReg->printAsOperand(OS, /*PrintType=*/false);
1508 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1509 void ExtAddrMode::dump() const {
1515 /// \brief This class provides transaction based operation on the IR.
1516 /// Every change made through this class is recorded in the internal state and
1517 /// can be undone (rollback) until commit is called.
1518 class TypePromotionTransaction {
1520 /// \brief This represents the common interface of the individual transaction.
1521 /// Each class implements the logic for doing one specific modification on
1522 /// the IR via the TypePromotionTransaction.
1523 class TypePromotionAction {
1525 /// The Instruction modified.
1529 /// \brief Constructor of the action.
1530 /// The constructor performs the related action on the IR.
1531 TypePromotionAction(Instruction *Inst) : Inst(Inst) {}
1533 virtual ~TypePromotionAction() {}
1535 /// \brief Undo the modification done by this action.
1536 /// When this method is called, the IR must be in the same state as it was
1537 /// before this action was applied.
1538 /// \pre Undoing the action works if and only if the IR is in the exact same
1539 /// state as it was directly after this action was applied.
1540 virtual void undo() = 0;
1542 /// \brief Advocate every change made by this action.
1543 /// When the results on the IR of the action are to be kept, it is important
1544 /// to call this function, otherwise hidden information may be kept forever.
1545 virtual void commit() {
1546 // Nothing to be done, this action is not doing anything.
1550 /// \brief Utility to remember the position of an instruction.
1551 class InsertionHandler {
1552 /// Position of an instruction.
1553 /// Either an instruction:
1554 /// - Is the first in a basic block: BB is used.
1555 /// - Has a previous instructon: PrevInst is used.
1557 Instruction *PrevInst;
1560 /// Remember whether or not the instruction had a previous instruction.
1561 bool HasPrevInstruction;
1564 /// \brief Record the position of \p Inst.
1565 InsertionHandler(Instruction *Inst) {
1566 BasicBlock::iterator It = Inst;
1567 HasPrevInstruction = (It != (Inst->getParent()->begin()));
1568 if (HasPrevInstruction)
1569 Point.PrevInst = --It;
1571 Point.BB = Inst->getParent();
1574 /// \brief Insert \p Inst at the recorded position.
1575 void insert(Instruction *Inst) {
1576 if (HasPrevInstruction) {
1577 if (Inst->getParent())
1578 Inst->removeFromParent();
1579 Inst->insertAfter(Point.PrevInst);
1581 Instruction *Position = Point.BB->getFirstInsertionPt();
1582 if (Inst->getParent())
1583 Inst->moveBefore(Position);
1585 Inst->insertBefore(Position);
1590 /// \brief Move an instruction before another.
1591 class InstructionMoveBefore : public TypePromotionAction {
1592 /// Original position of the instruction.
1593 InsertionHandler Position;
1596 /// \brief Move \p Inst before \p Before.
1597 InstructionMoveBefore(Instruction *Inst, Instruction *Before)
1598 : TypePromotionAction(Inst), Position(Inst) {
1599 DEBUG(dbgs() << "Do: move: " << *Inst << "\nbefore: " << *Before << "\n");
1600 Inst->moveBefore(Before);
1603 /// \brief Move the instruction back to its original position.
1604 void undo() override {
1605 DEBUG(dbgs() << "Undo: moveBefore: " << *Inst << "\n");
1606 Position.insert(Inst);
1610 /// \brief Set the operand of an instruction with a new value.
1611 class OperandSetter : public TypePromotionAction {
1612 /// Original operand of the instruction.
1614 /// Index of the modified instruction.
1618 /// \brief Set \p Idx operand of \p Inst with \p NewVal.
1619 OperandSetter(Instruction *Inst, unsigned Idx, Value *NewVal)
1620 : TypePromotionAction(Inst), Idx(Idx) {
1621 DEBUG(dbgs() << "Do: setOperand: " << Idx << "\n"
1622 << "for:" << *Inst << "\n"
1623 << "with:" << *NewVal << "\n");
1624 Origin = Inst->getOperand(Idx);
1625 Inst->setOperand(Idx, NewVal);
1628 /// \brief Restore the original value of the instruction.
1629 void undo() override {
1630 DEBUG(dbgs() << "Undo: setOperand:" << Idx << "\n"
1631 << "for: " << *Inst << "\n"
1632 << "with: " << *Origin << "\n");
1633 Inst->setOperand(Idx, Origin);
1637 /// \brief Hide the operands of an instruction.
1638 /// Do as if this instruction was not using any of its operands.
1639 class OperandsHider : public TypePromotionAction {
1640 /// The list of original operands.
1641 SmallVector<Value *, 4> OriginalValues;
1644 /// \brief Remove \p Inst from the uses of the operands of \p Inst.
1645 OperandsHider(Instruction *Inst) : TypePromotionAction(Inst) {
1646 DEBUG(dbgs() << "Do: OperandsHider: " << *Inst << "\n");
1647 unsigned NumOpnds = Inst->getNumOperands();
1648 OriginalValues.reserve(NumOpnds);
1649 for (unsigned It = 0; It < NumOpnds; ++It) {
1650 // Save the current operand.
1651 Value *Val = Inst->getOperand(It);
1652 OriginalValues.push_back(Val);
1654 // We could use OperandSetter here, but that would implied an overhead
1655 // that we are not willing to pay.
1656 Inst->setOperand(It, UndefValue::get(Val->getType()));
1660 /// \brief Restore the original list of uses.
1661 void undo() override {
1662 DEBUG(dbgs() << "Undo: OperandsHider: " << *Inst << "\n");
1663 for (unsigned It = 0, EndIt = OriginalValues.size(); It != EndIt; ++It)
1664 Inst->setOperand(It, OriginalValues[It]);
1668 /// \brief Build a truncate instruction.
1669 class TruncBuilder : public TypePromotionAction {
1672 /// \brief Build a truncate instruction of \p Opnd producing a \p Ty
1674 /// trunc Opnd to Ty.
1675 TruncBuilder(Instruction *Opnd, Type *Ty) : TypePromotionAction(Opnd) {
1676 IRBuilder<> Builder(Opnd);
1677 Val = Builder.CreateTrunc(Opnd, Ty, "promoted");
1678 DEBUG(dbgs() << "Do: TruncBuilder: " << *Val << "\n");
1681 /// \brief Get the built value.
1682 Value *getBuiltValue() { return Val; }
1684 /// \brief Remove the built instruction.
1685 void undo() override {
1686 DEBUG(dbgs() << "Undo: TruncBuilder: " << *Val << "\n");
1687 if (Instruction *IVal = dyn_cast<Instruction>(Val))
1688 IVal->eraseFromParent();
1692 /// \brief Build a sign extension instruction.
1693 class SExtBuilder : public TypePromotionAction {
1696 /// \brief Build a sign extension instruction of \p Opnd producing a \p Ty
1698 /// sext Opnd to Ty.
1699 SExtBuilder(Instruction *InsertPt, Value *Opnd, Type *Ty)
1700 : TypePromotionAction(InsertPt) {
1701 IRBuilder<> Builder(InsertPt);
1702 Val = Builder.CreateSExt(Opnd, Ty, "promoted");
1703 DEBUG(dbgs() << "Do: SExtBuilder: " << *Val << "\n");
1706 /// \brief Get the built value.
1707 Value *getBuiltValue() { return Val; }
1709 /// \brief Remove the built instruction.
1710 void undo() override {
1711 DEBUG(dbgs() << "Undo: SExtBuilder: " << *Val << "\n");
1712 if (Instruction *IVal = dyn_cast<Instruction>(Val))
1713 IVal->eraseFromParent();
1717 /// \brief Build a zero extension instruction.
1718 class ZExtBuilder : public TypePromotionAction {
1721 /// \brief Build a zero extension instruction of \p Opnd producing a \p Ty
1723 /// zext Opnd to Ty.
1724 ZExtBuilder(Instruction *InsertPt, Value *Opnd, Type *Ty)
1725 : TypePromotionAction(InsertPt) {
1726 IRBuilder<> Builder(InsertPt);
1727 Val = Builder.CreateZExt(Opnd, Ty, "promoted");
1728 DEBUG(dbgs() << "Do: ZExtBuilder: " << *Val << "\n");
1731 /// \brief Get the built value.
1732 Value *getBuiltValue() { return Val; }
1734 /// \brief Remove the built instruction.
1735 void undo() override {
1736 DEBUG(dbgs() << "Undo: ZExtBuilder: " << *Val << "\n");
1737 if (Instruction *IVal = dyn_cast<Instruction>(Val))
1738 IVal->eraseFromParent();
1742 /// \brief Mutate an instruction to another type.
1743 class TypeMutator : public TypePromotionAction {
1744 /// Record the original type.
1748 /// \brief Mutate the type of \p Inst into \p NewTy.
1749 TypeMutator(Instruction *Inst, Type *NewTy)
1750 : TypePromotionAction(Inst), OrigTy(Inst->getType()) {
1751 DEBUG(dbgs() << "Do: MutateType: " << *Inst << " with " << *NewTy
1753 Inst->mutateType(NewTy);
1756 /// \brief Mutate the instruction back to its original type.
1757 void undo() override {
1758 DEBUG(dbgs() << "Undo: MutateType: " << *Inst << " with " << *OrigTy
1760 Inst->mutateType(OrigTy);
1764 /// \brief Replace the uses of an instruction by another instruction.
1765 class UsesReplacer : public TypePromotionAction {
1766 /// Helper structure to keep track of the replaced uses.
1767 struct InstructionAndIdx {
1768 /// The instruction using the instruction.
1770 /// The index where this instruction is used for Inst.
1772 InstructionAndIdx(Instruction *Inst, unsigned Idx)
1773 : Inst(Inst), Idx(Idx) {}
1776 /// Keep track of the original uses (pair Instruction, Index).
1777 SmallVector<InstructionAndIdx, 4> OriginalUses;
1778 typedef SmallVectorImpl<InstructionAndIdx>::iterator use_iterator;
1781 /// \brief Replace all the use of \p Inst by \p New.
1782 UsesReplacer(Instruction *Inst, Value *New) : TypePromotionAction(Inst) {
1783 DEBUG(dbgs() << "Do: UsersReplacer: " << *Inst << " with " << *New
1785 // Record the original uses.
1786 for (Use &U : Inst->uses()) {
1787 Instruction *UserI = cast<Instruction>(U.getUser());
1788 OriginalUses.push_back(InstructionAndIdx(UserI, U.getOperandNo()));
1790 // Now, we can replace the uses.
1791 Inst->replaceAllUsesWith(New);
1794 /// \brief Reassign the original uses of Inst to Inst.
1795 void undo() override {
1796 DEBUG(dbgs() << "Undo: UsersReplacer: " << *Inst << "\n");
1797 for (use_iterator UseIt = OriginalUses.begin(),
1798 EndIt = OriginalUses.end();
1799 UseIt != EndIt; ++UseIt) {
1800 UseIt->Inst->setOperand(UseIt->Idx, Inst);
1805 /// \brief Remove an instruction from the IR.
1806 class InstructionRemover : public TypePromotionAction {
1807 /// Original position of the instruction.
1808 InsertionHandler Inserter;
1809 /// Helper structure to hide all the link to the instruction. In other
1810 /// words, this helps to do as if the instruction was removed.
1811 OperandsHider Hider;
1812 /// Keep track of the uses replaced, if any.
1813 UsesReplacer *Replacer;
1816 /// \brief Remove all reference of \p Inst and optinally replace all its
1818 /// \pre If !Inst->use_empty(), then New != nullptr
1819 InstructionRemover(Instruction *Inst, Value *New = nullptr)
1820 : TypePromotionAction(Inst), Inserter(Inst), Hider(Inst),
1823 Replacer = new UsesReplacer(Inst, New);
1824 DEBUG(dbgs() << "Do: InstructionRemover: " << *Inst << "\n");
1825 Inst->removeFromParent();
1828 ~InstructionRemover() { delete Replacer; }
1830 /// \brief Really remove the instruction.
1831 void commit() override { delete Inst; }
1833 /// \brief Resurrect the instruction and reassign it to the proper uses if
1834 /// new value was provided when build this action.
1835 void undo() override {
1836 DEBUG(dbgs() << "Undo: InstructionRemover: " << *Inst << "\n");
1837 Inserter.insert(Inst);
1845 /// Restoration point.
1846 /// The restoration point is a pointer to an action instead of an iterator
1847 /// because the iterator may be invalidated but not the pointer.
1848 typedef const TypePromotionAction *ConstRestorationPt;
1849 /// Advocate every changes made in that transaction.
1851 /// Undo all the changes made after the given point.
1852 void rollback(ConstRestorationPt Point);
1853 /// Get the current restoration point.
1854 ConstRestorationPt getRestorationPoint() const;
1856 /// \name API for IR modification with state keeping to support rollback.
1858 /// Same as Instruction::setOperand.
1859 void setOperand(Instruction *Inst, unsigned Idx, Value *NewVal);
1860 /// Same as Instruction::eraseFromParent.
1861 void eraseInstruction(Instruction *Inst, Value *NewVal = nullptr);
1862 /// Same as Value::replaceAllUsesWith.
1863 void replaceAllUsesWith(Instruction *Inst, Value *New);
1864 /// Same as Value::mutateType.
1865 void mutateType(Instruction *Inst, Type *NewTy);
1866 /// Same as IRBuilder::createTrunc.
1867 Value *createTrunc(Instruction *Opnd, Type *Ty);
1868 /// Same as IRBuilder::createSExt.
1869 Value *createSExt(Instruction *Inst, Value *Opnd, Type *Ty);
1870 /// Same as IRBuilder::createZExt.
1871 Value *createZExt(Instruction *Inst, Value *Opnd, Type *Ty);
1872 /// Same as Instruction::moveBefore.
1873 void moveBefore(Instruction *Inst, Instruction *Before);
1877 /// The ordered list of actions made so far.
1878 SmallVector<std::unique_ptr<TypePromotionAction>, 16> Actions;
1879 typedef SmallVectorImpl<std::unique_ptr<TypePromotionAction>>::iterator CommitPt;
1882 void TypePromotionTransaction::setOperand(Instruction *Inst, unsigned Idx,
1885 make_unique<TypePromotionTransaction::OperandSetter>(Inst, Idx, NewVal));
1888 void TypePromotionTransaction::eraseInstruction(Instruction *Inst,
1891 make_unique<TypePromotionTransaction::InstructionRemover>(Inst, NewVal));
1894 void TypePromotionTransaction::replaceAllUsesWith(Instruction *Inst,
1896 Actions.push_back(make_unique<TypePromotionTransaction::UsesReplacer>(Inst, New));
1899 void TypePromotionTransaction::mutateType(Instruction *Inst, Type *NewTy) {
1900 Actions.push_back(make_unique<TypePromotionTransaction::TypeMutator>(Inst, NewTy));
1903 Value *TypePromotionTransaction::createTrunc(Instruction *Opnd,
1905 std::unique_ptr<TruncBuilder> Ptr(new TruncBuilder(Opnd, Ty));
1906 Value *Val = Ptr->getBuiltValue();
1907 Actions.push_back(std::move(Ptr));
1911 Value *TypePromotionTransaction::createSExt(Instruction *Inst,
1912 Value *Opnd, Type *Ty) {
1913 std::unique_ptr<SExtBuilder> Ptr(new SExtBuilder(Inst, Opnd, Ty));
1914 Value *Val = Ptr->getBuiltValue();
1915 Actions.push_back(std::move(Ptr));
1919 Value *TypePromotionTransaction::createZExt(Instruction *Inst,
1920 Value *Opnd, Type *Ty) {
1921 std::unique_ptr<ZExtBuilder> Ptr(new ZExtBuilder(Inst, Opnd, Ty));
1922 Value *Val = Ptr->getBuiltValue();
1923 Actions.push_back(std::move(Ptr));
1927 void TypePromotionTransaction::moveBefore(Instruction *Inst,
1928 Instruction *Before) {
1930 make_unique<TypePromotionTransaction::InstructionMoveBefore>(Inst, Before));
1933 TypePromotionTransaction::ConstRestorationPt
1934 TypePromotionTransaction::getRestorationPoint() const {
1935 return !Actions.empty() ? Actions.back().get() : nullptr;
1938 void TypePromotionTransaction::commit() {
1939 for (CommitPt It = Actions.begin(), EndIt = Actions.end(); It != EndIt;
1945 void TypePromotionTransaction::rollback(
1946 TypePromotionTransaction::ConstRestorationPt Point) {
1947 while (!Actions.empty() && Point != Actions.back().get()) {
1948 std::unique_ptr<TypePromotionAction> Curr = Actions.pop_back_val();
1953 /// \brief A helper class for matching addressing modes.
1955 /// This encapsulates the logic for matching the target-legal addressing modes.
1956 class AddressingModeMatcher {
1957 SmallVectorImpl<Instruction*> &AddrModeInsts;
1958 const TargetMachine &TM;
1959 const TargetLowering &TLI;
1961 /// AccessTy/MemoryInst - This is the type for the access (e.g. double) and
1962 /// the memory instruction that we're computing this address for.
1964 Instruction *MemoryInst;
1966 /// AddrMode - This is the addressing mode that we're building up. This is
1967 /// part of the return value of this addressing mode matching stuff.
1968 ExtAddrMode &AddrMode;
1970 /// The truncate instruction inserted by other CodeGenPrepare optimizations.
1971 const SetOfInstrs &InsertedTruncs;
1972 /// A map from the instructions to their type before promotion.
1973 InstrToOrigTy &PromotedInsts;
1974 /// The ongoing transaction where every action should be registered.
1975 TypePromotionTransaction &TPT;
1977 /// IgnoreProfitability - This is set to true when we should not do
1978 /// profitability checks. When true, IsProfitableToFoldIntoAddressingMode
1979 /// always returns true.
1980 bool IgnoreProfitability;
1982 AddressingModeMatcher(SmallVectorImpl<Instruction *> &AMI,
1983 const TargetMachine &TM, Type *AT, Instruction *MI,
1984 ExtAddrMode &AM, const SetOfInstrs &InsertedTruncs,
1985 InstrToOrigTy &PromotedInsts,
1986 TypePromotionTransaction &TPT)
1987 : AddrModeInsts(AMI), TM(TM),
1988 TLI(*TM.getSubtargetImpl(*MI->getParent()->getParent())
1989 ->getTargetLowering()),
1990 AccessTy(AT), MemoryInst(MI), AddrMode(AM),
1991 InsertedTruncs(InsertedTruncs), PromotedInsts(PromotedInsts), TPT(TPT) {
1992 IgnoreProfitability = false;
1996 /// Match - Find the maximal addressing mode that a load/store of V can fold,
1997 /// give an access type of AccessTy. This returns a list of involved
1998 /// instructions in AddrModeInsts.
1999 /// \p InsertedTruncs The truncate instruction inserted by other
2002 /// \p PromotedInsts maps the instructions to their type before promotion.
2003 /// \p The ongoing transaction where every action should be registered.
2004 static ExtAddrMode Match(Value *V, Type *AccessTy,
2005 Instruction *MemoryInst,
2006 SmallVectorImpl<Instruction*> &AddrModeInsts,
2007 const TargetMachine &TM,
2008 const SetOfInstrs &InsertedTruncs,
2009 InstrToOrigTy &PromotedInsts,
2010 TypePromotionTransaction &TPT) {
2013 bool Success = AddressingModeMatcher(AddrModeInsts, TM, AccessTy,
2014 MemoryInst, Result, InsertedTruncs,
2015 PromotedInsts, TPT).MatchAddr(V, 0);
2016 (void)Success; assert(Success && "Couldn't select *anything*?");
2020 bool MatchScaledValue(Value *ScaleReg, int64_t Scale, unsigned Depth);
2021 bool MatchAddr(Value *V, unsigned Depth);
2022 bool MatchOperationAddr(User *Operation, unsigned Opcode, unsigned Depth,
2023 bool *MovedAway = nullptr);
2024 bool IsProfitableToFoldIntoAddressingMode(Instruction *I,
2025 ExtAddrMode &AMBefore,
2026 ExtAddrMode &AMAfter);
2027 bool ValueAlreadyLiveAtInst(Value *Val, Value *KnownLive1, Value *KnownLive2);
2028 bool IsPromotionProfitable(unsigned MatchedSize, unsigned SizeWithPromotion,
2029 Value *PromotedOperand) const;
2032 /// MatchScaledValue - Try adding ScaleReg*Scale to the current addressing mode.
2033 /// Return true and update AddrMode if this addr mode is legal for the target,
2035 bool AddressingModeMatcher::MatchScaledValue(Value *ScaleReg, int64_t Scale,
2037 // If Scale is 1, then this is the same as adding ScaleReg to the addressing
2038 // mode. Just process that directly.
2040 return MatchAddr(ScaleReg, Depth);
2042 // If the scale is 0, it takes nothing to add this.
2046 // If we already have a scale of this value, we can add to it, otherwise, we
2047 // need an available scale field.
2048 if (AddrMode.Scale != 0 && AddrMode.ScaledReg != ScaleReg)
2051 ExtAddrMode TestAddrMode = AddrMode;
2053 // Add scale to turn X*4+X*3 -> X*7. This could also do things like
2054 // [A+B + A*7] -> [B+A*8].
2055 TestAddrMode.Scale += Scale;
2056 TestAddrMode.ScaledReg = ScaleReg;
2058 // If the new address isn't legal, bail out.
2059 if (!TLI.isLegalAddressingMode(TestAddrMode, AccessTy))
2062 // It was legal, so commit it.
2063 AddrMode = TestAddrMode;
2065 // Okay, we decided that we can add ScaleReg+Scale to AddrMode. Check now
2066 // to see if ScaleReg is actually X+C. If so, we can turn this into adding
2067 // X*Scale + C*Scale to addr mode.
2068 ConstantInt *CI = nullptr; Value *AddLHS = nullptr;
2069 if (isa<Instruction>(ScaleReg) && // not a constant expr.
2070 match(ScaleReg, m_Add(m_Value(AddLHS), m_ConstantInt(CI)))) {
2071 TestAddrMode.ScaledReg = AddLHS;
2072 TestAddrMode.BaseOffs += CI->getSExtValue()*TestAddrMode.Scale;
2074 // If this addressing mode is legal, commit it and remember that we folded
2075 // this instruction.
2076 if (TLI.isLegalAddressingMode(TestAddrMode, AccessTy)) {
2077 AddrModeInsts.push_back(cast<Instruction>(ScaleReg));
2078 AddrMode = TestAddrMode;
2083 // Otherwise, not (x+c)*scale, just return what we have.
2087 /// MightBeFoldableInst - This is a little filter, which returns true if an
2088 /// addressing computation involving I might be folded into a load/store
2089 /// accessing it. This doesn't need to be perfect, but needs to accept at least
2090 /// the set of instructions that MatchOperationAddr can.
2091 static bool MightBeFoldableInst(Instruction *I) {
2092 switch (I->getOpcode()) {
2093 case Instruction::BitCast:
2094 case Instruction::AddrSpaceCast:
2095 // Don't touch identity bitcasts.
2096 if (I->getType() == I->getOperand(0)->getType())
2098 return I->getType()->isPointerTy() || I->getType()->isIntegerTy();
2099 case Instruction::PtrToInt:
2100 // PtrToInt is always a noop, as we know that the int type is pointer sized.
2102 case Instruction::IntToPtr:
2103 // We know the input is intptr_t, so this is foldable.
2105 case Instruction::Add:
2107 case Instruction::Mul:
2108 case Instruction::Shl:
2109 // Can only handle X*C and X << C.
2110 return isa<ConstantInt>(I->getOperand(1));
2111 case Instruction::GetElementPtr:
2118 /// \brief Check whether or not \p Val is a legal instruction for \p TLI.
2119 /// \note \p Val is assumed to be the product of some type promotion.
2120 /// Therefore if \p Val has an undefined state in \p TLI, this is assumed
2121 /// to be legal, as the non-promoted value would have had the same state.
2122 static bool isPromotedInstructionLegal(const TargetLowering &TLI, Value *Val) {
2123 Instruction *PromotedInst = dyn_cast<Instruction>(Val);
2126 int ISDOpcode = TLI.InstructionOpcodeToISD(PromotedInst->getOpcode());
2127 // If the ISDOpcode is undefined, it was undefined before the promotion.
2130 // Otherwise, check if the promoted instruction is legal or not.
2131 return TLI.isOperationLegalOrCustom(
2132 ISDOpcode, TLI.getValueType(PromotedInst->getType()));
2135 /// \brief Hepler class to perform type promotion.
2136 class TypePromotionHelper {
2137 /// \brief Utility function to check whether or not a sign or zero extension
2138 /// of \p Inst with \p ConsideredExtType can be moved through \p Inst by
2139 /// either using the operands of \p Inst or promoting \p Inst.
2140 /// The type of the extension is defined by \p IsSExt.
2141 /// In other words, check if:
2142 /// ext (Ty Inst opnd1 opnd2 ... opndN) to ConsideredExtType.
2143 /// #1 Promotion applies:
2144 /// ConsideredExtType Inst (ext opnd1 to ConsideredExtType, ...).
2145 /// #2 Operand reuses:
2146 /// ext opnd1 to ConsideredExtType.
2147 /// \p PromotedInsts maps the instructions to their type before promotion.
2148 static bool canGetThrough(const Instruction *Inst, Type *ConsideredExtType,
2149 const InstrToOrigTy &PromotedInsts, bool IsSExt);
2151 /// \brief Utility function to determine if \p OpIdx should be promoted when
2152 /// promoting \p Inst.
2153 static bool shouldExtOperand(const Instruction *Inst, int OpIdx) {
2154 if (isa<SelectInst>(Inst) && OpIdx == 0)
2159 /// \brief Utility function to promote the operand of \p Ext when this
2160 /// operand is a promotable trunc or sext or zext.
2161 /// \p PromotedInsts maps the instructions to their type before promotion.
2162 /// \p CreatedInsts[out] contains how many non-free instructions have been
2163 /// created to promote the operand of Ext.
2164 /// Newly added extensions are inserted in \p Exts.
2165 /// Newly added truncates are inserted in \p Truncs.
2166 /// Should never be called directly.
2167 /// \return The promoted value which is used instead of Ext.
2168 static Value *promoteOperandForTruncAndAnyExt(
2169 Instruction *Ext, TypePromotionTransaction &TPT,
2170 InstrToOrigTy &PromotedInsts, unsigned &CreatedInsts,
2171 SmallVectorImpl<Instruction *> *Exts,
2172 SmallVectorImpl<Instruction *> *Truncs);
2174 /// \brief Utility function to promote the operand of \p Ext when this
2175 /// operand is promotable and is not a supported trunc or sext.
2176 /// \p PromotedInsts maps the instructions to their type before promotion.
2177 /// \p CreatedInsts[out] contains how many non-free instructions have been
2178 /// created to promote the operand of Ext.
2179 /// Newly added extensions are inserted in \p Exts.
2180 /// Newly added truncates are inserted in \p Truncs.
2181 /// Should never be called directly.
2182 /// \return The promoted value which is used instead of Ext.
2184 promoteOperandForOther(Instruction *Ext, TypePromotionTransaction &TPT,
2185 InstrToOrigTy &PromotedInsts, unsigned &CreatedInsts,
2186 SmallVectorImpl<Instruction *> *Exts,
2187 SmallVectorImpl<Instruction *> *Truncs, bool IsSExt);
2189 /// \see promoteOperandForOther.
2191 signExtendOperandForOther(Instruction *Ext, TypePromotionTransaction &TPT,
2192 InstrToOrigTy &PromotedInsts,
2193 unsigned &CreatedInsts,
2194 SmallVectorImpl<Instruction *> *Exts,
2195 SmallVectorImpl<Instruction *> *Truncs) {
2196 return promoteOperandForOther(Ext, TPT, PromotedInsts, CreatedInsts, Exts,
2200 /// \see promoteOperandForOther.
2202 zeroExtendOperandForOther(Instruction *Ext, TypePromotionTransaction &TPT,
2203 InstrToOrigTy &PromotedInsts,
2204 unsigned &CreatedInsts,
2205 SmallVectorImpl<Instruction *> *Exts,
2206 SmallVectorImpl<Instruction *> *Truncs) {
2207 return promoteOperandForOther(Ext, TPT, PromotedInsts, CreatedInsts, Exts,
2212 /// Type for the utility function that promotes the operand of Ext.
2213 typedef Value *(*Action)(Instruction *Ext, TypePromotionTransaction &TPT,
2214 InstrToOrigTy &PromotedInsts, unsigned &CreatedInsts,
2215 SmallVectorImpl<Instruction *> *Exts,
2216 SmallVectorImpl<Instruction *> *Truncs);
2217 /// \brief Given a sign/zero extend instruction \p Ext, return the approriate
2218 /// action to promote the operand of \p Ext instead of using Ext.
2219 /// \return NULL if no promotable action is possible with the current
2221 /// \p InsertedTruncs keeps track of all the truncate instructions inserted by
2222 /// the others CodeGenPrepare optimizations. This information is important
2223 /// because we do not want to promote these instructions as CodeGenPrepare
2224 /// will reinsert them later. Thus creating an infinite loop: create/remove.
2225 /// \p PromotedInsts maps the instructions to their type before promotion.
2226 static Action getAction(Instruction *Ext, const SetOfInstrs &InsertedTruncs,
2227 const TargetLowering &TLI,
2228 const InstrToOrigTy &PromotedInsts);
2231 bool TypePromotionHelper::canGetThrough(const Instruction *Inst,
2232 Type *ConsideredExtType,
2233 const InstrToOrigTy &PromotedInsts,
2235 // The promotion helper does not know how to deal with vector types yet.
2236 // To be able to fix that, we would need to fix the places where we
2237 // statically extend, e.g., constants and such.
2238 if (Inst->getType()->isVectorTy())
2241 // We can always get through zext.
2242 if (isa<ZExtInst>(Inst))
2245 // sext(sext) is ok too.
2246 if (IsSExt && isa<SExtInst>(Inst))
2249 // We can get through binary operator, if it is legal. In other words, the
2250 // binary operator must have a nuw or nsw flag.
2251 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst);
2252 if (BinOp && isa<OverflowingBinaryOperator>(BinOp) &&
2253 ((!IsSExt && BinOp->hasNoUnsignedWrap()) ||
2254 (IsSExt && BinOp->hasNoSignedWrap())))
2257 // Check if we can do the following simplification.
2258 // ext(trunc(opnd)) --> ext(opnd)
2259 if (!isa<TruncInst>(Inst))
2262 Value *OpndVal = Inst->getOperand(0);
2263 // Check if we can use this operand in the extension.
2264 // If the type is larger than the result type of the extension,
2266 if (!OpndVal->getType()->isIntegerTy() ||
2267 OpndVal->getType()->getIntegerBitWidth() >
2268 ConsideredExtType->getIntegerBitWidth())
2271 // If the operand of the truncate is not an instruction, we will not have
2272 // any information on the dropped bits.
2273 // (Actually we could for constant but it is not worth the extra logic).
2274 Instruction *Opnd = dyn_cast<Instruction>(OpndVal);
2278 // Check if the source of the type is narrow enough.
2279 // I.e., check that trunc just drops extended bits of the same kind of
2281 // #1 get the type of the operand and check the kind of the extended bits.
2282 const Type *OpndType;
2283 InstrToOrigTy::const_iterator It = PromotedInsts.find(Opnd);
2284 if (It != PromotedInsts.end() && It->second.IsSExt == IsSExt)
2285 OpndType = It->second.Ty;
2286 else if ((IsSExt && isa<SExtInst>(Opnd)) || (!IsSExt && isa<ZExtInst>(Opnd)))
2287 OpndType = Opnd->getOperand(0)->getType();
2291 // #2 check that the truncate just drop extended bits.
2292 if (Inst->getType()->getIntegerBitWidth() >= OpndType->getIntegerBitWidth())
2298 TypePromotionHelper::Action TypePromotionHelper::getAction(
2299 Instruction *Ext, const SetOfInstrs &InsertedTruncs,
2300 const TargetLowering &TLI, const InstrToOrigTy &PromotedInsts) {
2301 assert((isa<SExtInst>(Ext) || isa<ZExtInst>(Ext)) &&
2302 "Unexpected instruction type");
2303 Instruction *ExtOpnd = dyn_cast<Instruction>(Ext->getOperand(0));
2304 Type *ExtTy = Ext->getType();
2305 bool IsSExt = isa<SExtInst>(Ext);
2306 // If the operand of the extension is not an instruction, we cannot
2308 // If it, check we can get through.
2309 if (!ExtOpnd || !canGetThrough(ExtOpnd, ExtTy, PromotedInsts, IsSExt))
2312 // Do not promote if the operand has been added by codegenprepare.
2313 // Otherwise, it means we are undoing an optimization that is likely to be
2314 // redone, thus causing potential infinite loop.
2315 if (isa<TruncInst>(ExtOpnd) && InsertedTruncs.count(ExtOpnd))
2318 // SExt or Trunc instructions.
2319 // Return the related handler.
2320 if (isa<SExtInst>(ExtOpnd) || isa<TruncInst>(ExtOpnd) ||
2321 isa<ZExtInst>(ExtOpnd))
2322 return promoteOperandForTruncAndAnyExt;
2324 // Regular instruction.
2325 // Abort early if we will have to insert non-free instructions.
2326 if (!ExtOpnd->hasOneUse() && !TLI.isTruncateFree(ExtTy, ExtOpnd->getType()))
2328 return IsSExt ? signExtendOperandForOther : zeroExtendOperandForOther;
2331 Value *TypePromotionHelper::promoteOperandForTruncAndAnyExt(
2332 llvm::Instruction *SExt, TypePromotionTransaction &TPT,
2333 InstrToOrigTy &PromotedInsts, unsigned &CreatedInsts,
2334 SmallVectorImpl<Instruction *> *Exts,
2335 SmallVectorImpl<Instruction *> *Truncs) {
2336 // By construction, the operand of SExt is an instruction. Otherwise we cannot
2337 // get through it and this method should not be called.
2338 Instruction *SExtOpnd = cast<Instruction>(SExt->getOperand(0));
2339 Value *ExtVal = SExt;
2340 if (isa<ZExtInst>(SExtOpnd)) {
2341 // Replace s|zext(zext(opnd))
2344 TPT.createZExt(SExt, SExtOpnd->getOperand(0), SExt->getType());
2345 TPT.replaceAllUsesWith(SExt, ZExt);
2346 TPT.eraseInstruction(SExt);
2349 // Replace z|sext(trunc(opnd)) or sext(sext(opnd))
2351 TPT.setOperand(SExt, 0, SExtOpnd->getOperand(0));
2355 // Remove dead code.
2356 if (SExtOpnd->use_empty())
2357 TPT.eraseInstruction(SExtOpnd);
2359 // Check if the extension is still needed.
2360 Instruction *ExtInst = dyn_cast<Instruction>(ExtVal);
2361 if (!ExtInst || ExtInst->getType() != ExtInst->getOperand(0)->getType()) {
2362 if (ExtInst && Exts)
2363 Exts->push_back(ExtInst);
2367 // At this point we have: ext ty opnd to ty.
2368 // Reassign the uses of ExtInst to the opnd and remove ExtInst.
2369 Value *NextVal = ExtInst->getOperand(0);
2370 TPT.eraseInstruction(ExtInst, NextVal);
2374 Value *TypePromotionHelper::promoteOperandForOther(
2375 Instruction *Ext, TypePromotionTransaction &TPT,
2376 InstrToOrigTy &PromotedInsts, unsigned &CreatedInsts,
2377 SmallVectorImpl<Instruction *> *Exts,
2378 SmallVectorImpl<Instruction *> *Truncs, bool IsSExt) {
2379 // By construction, the operand of Ext is an instruction. Otherwise we cannot
2380 // get through it and this method should not be called.
2381 Instruction *ExtOpnd = cast<Instruction>(Ext->getOperand(0));
2383 if (!ExtOpnd->hasOneUse()) {
2384 // ExtOpnd will be promoted.
2385 // All its uses, but Ext, will need to use a truncated value of the
2386 // promoted version.
2387 // Create the truncate now.
2388 Value *Trunc = TPT.createTrunc(Ext, ExtOpnd->getType());
2389 if (Instruction *ITrunc = dyn_cast<Instruction>(Trunc)) {
2390 ITrunc->removeFromParent();
2391 // Insert it just after the definition.
2392 ITrunc->insertAfter(ExtOpnd);
2394 Truncs->push_back(ITrunc);
2397 TPT.replaceAllUsesWith(ExtOpnd, Trunc);
2398 // Restore the operand of Ext (which has been replace by the previous call
2399 // to replaceAllUsesWith) to avoid creating a cycle trunc <-> sext.
2400 TPT.setOperand(Ext, 0, ExtOpnd);
2403 // Get through the Instruction:
2404 // 1. Update its type.
2405 // 2. Replace the uses of Ext by Inst.
2406 // 3. Extend each operand that needs to be extended.
2408 // Remember the original type of the instruction before promotion.
2409 // This is useful to know that the high bits are sign extended bits.
2410 PromotedInsts.insert(std::pair<Instruction *, TypeIsSExt>(
2411 ExtOpnd, TypeIsSExt(ExtOpnd->getType(), IsSExt)));
2413 TPT.mutateType(ExtOpnd, Ext->getType());
2415 TPT.replaceAllUsesWith(Ext, ExtOpnd);
2417 Instruction *ExtForOpnd = Ext;
2419 DEBUG(dbgs() << "Propagate Ext to operands\n");
2420 for (int OpIdx = 0, EndOpIdx = ExtOpnd->getNumOperands(); OpIdx != EndOpIdx;
2422 DEBUG(dbgs() << "Operand:\n" << *(ExtOpnd->getOperand(OpIdx)) << '\n');
2423 if (ExtOpnd->getOperand(OpIdx)->getType() == Ext->getType() ||
2424 !shouldExtOperand(ExtOpnd, OpIdx)) {
2425 DEBUG(dbgs() << "No need to propagate\n");
2428 // Check if we can statically extend the operand.
2429 Value *Opnd = ExtOpnd->getOperand(OpIdx);
2430 if (const ConstantInt *Cst = dyn_cast<ConstantInt>(Opnd)) {
2431 DEBUG(dbgs() << "Statically extend\n");
2432 unsigned BitWidth = Ext->getType()->getIntegerBitWidth();
2433 APInt CstVal = IsSExt ? Cst->getValue().sext(BitWidth)
2434 : Cst->getValue().zext(BitWidth);
2435 TPT.setOperand(ExtOpnd, OpIdx, ConstantInt::get(Ext->getType(), CstVal));
2438 // UndefValue are typed, so we have to statically sign extend them.
2439 if (isa<UndefValue>(Opnd)) {
2440 DEBUG(dbgs() << "Statically extend\n");
2441 TPT.setOperand(ExtOpnd, OpIdx, UndefValue::get(Ext->getType()));
2445 // Otherwise we have to explicity sign extend the operand.
2446 // Check if Ext was reused to extend an operand.
2448 // If yes, create a new one.
2449 DEBUG(dbgs() << "More operands to ext\n");
2450 Value *ValForExtOpnd = IsSExt ? TPT.createSExt(Ext, Opnd, Ext->getType())
2451 : TPT.createZExt(Ext, Opnd, Ext->getType());
2452 if (!isa<Instruction>(ValForExtOpnd)) {
2453 TPT.setOperand(ExtOpnd, OpIdx, ValForExtOpnd);
2456 ExtForOpnd = cast<Instruction>(ValForExtOpnd);
2460 Exts->push_back(ExtForOpnd);
2461 TPT.setOperand(ExtForOpnd, 0, Opnd);
2463 // Move the sign extension before the insertion point.
2464 TPT.moveBefore(ExtForOpnd, ExtOpnd);
2465 TPT.setOperand(ExtOpnd, OpIdx, ExtForOpnd);
2466 // If more sext are required, new instructions will have to be created.
2467 ExtForOpnd = nullptr;
2469 if (ExtForOpnd == Ext) {
2470 DEBUG(dbgs() << "Extension is useless now\n");
2471 TPT.eraseInstruction(Ext);
2476 /// IsPromotionProfitable - Check whether or not promoting an instruction
2477 /// to a wider type was profitable.
2478 /// \p MatchedSize gives the number of instructions that have been matched
2479 /// in the addressing mode after the promotion was applied.
2480 /// \p SizeWithPromotion gives the number of created instructions for
2481 /// the promotion plus the number of instructions that have been
2482 /// matched in the addressing mode before the promotion.
2483 /// \p PromotedOperand is the value that has been promoted.
2484 /// \return True if the promotion is profitable, false otherwise.
2486 AddressingModeMatcher::IsPromotionProfitable(unsigned MatchedSize,
2487 unsigned SizeWithPromotion,
2488 Value *PromotedOperand) const {
2489 // We folded less instructions than what we created to promote the operand.
2490 // This is not profitable.
2491 if (MatchedSize < SizeWithPromotion)
2493 if (MatchedSize > SizeWithPromotion)
2495 // The promotion is neutral but it may help folding the sign extension in
2496 // loads for instance.
2497 // Check that we did not create an illegal instruction.
2498 return isPromotedInstructionLegal(TLI, PromotedOperand);
2501 /// MatchOperationAddr - Given an instruction or constant expr, see if we can
2502 /// fold the operation into the addressing mode. If so, update the addressing
2503 /// mode and return true, otherwise return false without modifying AddrMode.
2504 /// If \p MovedAway is not NULL, it contains the information of whether or
2505 /// not AddrInst has to be folded into the addressing mode on success.
2506 /// If \p MovedAway == true, \p AddrInst will not be part of the addressing
2507 /// because it has been moved away.
2508 /// Thus AddrInst must not be added in the matched instructions.
2509 /// This state can happen when AddrInst is a sext, since it may be moved away.
2510 /// Therefore, AddrInst may not be valid when MovedAway is true and it must
2511 /// not be referenced anymore.
2512 bool AddressingModeMatcher::MatchOperationAddr(User *AddrInst, unsigned Opcode,
2515 // Avoid exponential behavior on extremely deep expression trees.
2516 if (Depth >= 5) return false;
2518 // By default, all matched instructions stay in place.
2523 case Instruction::PtrToInt:
2524 // PtrToInt is always a noop, as we know that the int type is pointer sized.
2525 return MatchAddr(AddrInst->getOperand(0), Depth);
2526 case Instruction::IntToPtr:
2527 // This inttoptr is a no-op if the integer type is pointer sized.
2528 if (TLI.getValueType(AddrInst->getOperand(0)->getType()) ==
2529 TLI.getPointerTy(AddrInst->getType()->getPointerAddressSpace()))
2530 return MatchAddr(AddrInst->getOperand(0), Depth);
2532 case Instruction::BitCast:
2533 case Instruction::AddrSpaceCast:
2534 // BitCast is always a noop, and we can handle it as long as it is
2535 // int->int or pointer->pointer (we don't want int<->fp or something).
2536 if ((AddrInst->getOperand(0)->getType()->isPointerTy() ||
2537 AddrInst->getOperand(0)->getType()->isIntegerTy()) &&
2538 // Don't touch identity bitcasts. These were probably put here by LSR,
2539 // and we don't want to mess around with them. Assume it knows what it
2541 AddrInst->getOperand(0)->getType() != AddrInst->getType())
2542 return MatchAddr(AddrInst->getOperand(0), Depth);
2544 case Instruction::Add: {
2545 // Check to see if we can merge in the RHS then the LHS. If so, we win.
2546 ExtAddrMode BackupAddrMode = AddrMode;
2547 unsigned OldSize = AddrModeInsts.size();
2548 // Start a transaction at this point.
2549 // The LHS may match but not the RHS.
2550 // Therefore, we need a higher level restoration point to undo partially
2551 // matched operation.
2552 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
2553 TPT.getRestorationPoint();
2555 if (MatchAddr(AddrInst->getOperand(1), Depth+1) &&
2556 MatchAddr(AddrInst->getOperand(0), Depth+1))
2559 // Restore the old addr mode info.
2560 AddrMode = BackupAddrMode;
2561 AddrModeInsts.resize(OldSize);
2562 TPT.rollback(LastKnownGood);
2564 // Otherwise this was over-aggressive. Try merging in the LHS then the RHS.
2565 if (MatchAddr(AddrInst->getOperand(0), Depth+1) &&
2566 MatchAddr(AddrInst->getOperand(1), Depth+1))
2569 // Otherwise we definitely can't merge the ADD in.
2570 AddrMode = BackupAddrMode;
2571 AddrModeInsts.resize(OldSize);
2572 TPT.rollback(LastKnownGood);
2575 //case Instruction::Or:
2576 // TODO: We can handle "Or Val, Imm" iff this OR is equivalent to an ADD.
2578 case Instruction::Mul:
2579 case Instruction::Shl: {
2580 // Can only handle X*C and X << C.
2581 ConstantInt *RHS = dyn_cast<ConstantInt>(AddrInst->getOperand(1));
2584 int64_t Scale = RHS->getSExtValue();
2585 if (Opcode == Instruction::Shl)
2586 Scale = 1LL << Scale;
2588 return MatchScaledValue(AddrInst->getOperand(0), Scale, Depth);
2590 case Instruction::GetElementPtr: {
2591 // Scan the GEP. We check it if it contains constant offsets and at most
2592 // one variable offset.
2593 int VariableOperand = -1;
2594 unsigned VariableScale = 0;
2596 int64_t ConstantOffset = 0;
2597 const DataLayout *TD = TLI.getDataLayout();
2598 gep_type_iterator GTI = gep_type_begin(AddrInst);
2599 for (unsigned i = 1, e = AddrInst->getNumOperands(); i != e; ++i, ++GTI) {
2600 if (StructType *STy = dyn_cast<StructType>(*GTI)) {
2601 const StructLayout *SL = TD->getStructLayout(STy);
2603 cast<ConstantInt>(AddrInst->getOperand(i))->getZExtValue();
2604 ConstantOffset += SL->getElementOffset(Idx);
2606 uint64_t TypeSize = TD->getTypeAllocSize(GTI.getIndexedType());
2607 if (ConstantInt *CI = dyn_cast<ConstantInt>(AddrInst->getOperand(i))) {
2608 ConstantOffset += CI->getSExtValue()*TypeSize;
2609 } else if (TypeSize) { // Scales of zero don't do anything.
2610 // We only allow one variable index at the moment.
2611 if (VariableOperand != -1)
2614 // Remember the variable index.
2615 VariableOperand = i;
2616 VariableScale = TypeSize;
2621 // A common case is for the GEP to only do a constant offset. In this case,
2622 // just add it to the disp field and check validity.
2623 if (VariableOperand == -1) {
2624 AddrMode.BaseOffs += ConstantOffset;
2625 if (ConstantOffset == 0 || TLI.isLegalAddressingMode(AddrMode, AccessTy)){
2626 // Check to see if we can fold the base pointer in too.
2627 if (MatchAddr(AddrInst->getOperand(0), Depth+1))
2630 AddrMode.BaseOffs -= ConstantOffset;
2634 // Save the valid addressing mode in case we can't match.
2635 ExtAddrMode BackupAddrMode = AddrMode;
2636 unsigned OldSize = AddrModeInsts.size();
2638 // See if the scale and offset amount is valid for this target.
2639 AddrMode.BaseOffs += ConstantOffset;
2641 // Match the base operand of the GEP.
2642 if (!MatchAddr(AddrInst->getOperand(0), Depth+1)) {
2643 // If it couldn't be matched, just stuff the value in a register.
2644 if (AddrMode.HasBaseReg) {
2645 AddrMode = BackupAddrMode;
2646 AddrModeInsts.resize(OldSize);
2649 AddrMode.HasBaseReg = true;
2650 AddrMode.BaseReg = AddrInst->getOperand(0);
2653 // Match the remaining variable portion of the GEP.
2654 if (!MatchScaledValue(AddrInst->getOperand(VariableOperand), VariableScale,
2656 // If it couldn't be matched, try stuffing the base into a register
2657 // instead of matching it, and retrying the match of the scale.
2658 AddrMode = BackupAddrMode;
2659 AddrModeInsts.resize(OldSize);
2660 if (AddrMode.HasBaseReg)
2662 AddrMode.HasBaseReg = true;
2663 AddrMode.BaseReg = AddrInst->getOperand(0);
2664 AddrMode.BaseOffs += ConstantOffset;
2665 if (!MatchScaledValue(AddrInst->getOperand(VariableOperand),
2666 VariableScale, Depth)) {
2667 // If even that didn't work, bail.
2668 AddrMode = BackupAddrMode;
2669 AddrModeInsts.resize(OldSize);
2676 case Instruction::SExt:
2677 case Instruction::ZExt: {
2678 Instruction *Ext = dyn_cast<Instruction>(AddrInst);
2682 // Try to move this ext out of the way of the addressing mode.
2683 // Ask for a method for doing so.
2684 TypePromotionHelper::Action TPH =
2685 TypePromotionHelper::getAction(Ext, InsertedTruncs, TLI, PromotedInsts);
2689 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
2690 TPT.getRestorationPoint();
2691 unsigned CreatedInsts = 0;
2692 Value *PromotedOperand =
2693 TPH(Ext, TPT, PromotedInsts, CreatedInsts, nullptr, nullptr);
2694 // SExt has been moved away.
2695 // Thus either it will be rematched later in the recursive calls or it is
2696 // gone. Anyway, we must not fold it into the addressing mode at this point.
2700 // addr = gep base, idx
2702 // promotedOpnd = ext opnd <- no match here
2703 // op = promoted_add promotedOpnd, 1 <- match (later in recursive calls)
2704 // addr = gep base, op <- match
2708 assert(PromotedOperand &&
2709 "TypePromotionHelper should have filtered out those cases");
2711 ExtAddrMode BackupAddrMode = AddrMode;
2712 unsigned OldSize = AddrModeInsts.size();
2714 if (!MatchAddr(PromotedOperand, Depth) ||
2715 !IsPromotionProfitable(AddrModeInsts.size(), OldSize + CreatedInsts,
2717 AddrMode = BackupAddrMode;
2718 AddrModeInsts.resize(OldSize);
2719 DEBUG(dbgs() << "Sign extension does not pay off: rollback\n");
2720 TPT.rollback(LastKnownGood);
2729 /// MatchAddr - If we can, try to add the value of 'Addr' into the current
2730 /// addressing mode. If Addr can't be added to AddrMode this returns false and
2731 /// leaves AddrMode unmodified. This assumes that Addr is either a pointer type
2732 /// or intptr_t for the target.
2734 bool AddressingModeMatcher::MatchAddr(Value *Addr, unsigned Depth) {
2735 // Start a transaction at this point that we will rollback if the matching
2737 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
2738 TPT.getRestorationPoint();
2739 if (ConstantInt *CI = dyn_cast<ConstantInt>(Addr)) {
2740 // Fold in immediates if legal for the target.
2741 AddrMode.BaseOffs += CI->getSExtValue();
2742 if (TLI.isLegalAddressingMode(AddrMode, AccessTy))
2744 AddrMode.BaseOffs -= CI->getSExtValue();
2745 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(Addr)) {
2746 // If this is a global variable, try to fold it into the addressing mode.
2747 if (!AddrMode.BaseGV) {
2748 AddrMode.BaseGV = GV;
2749 if (TLI.isLegalAddressingMode(AddrMode, AccessTy))
2751 AddrMode.BaseGV = nullptr;
2753 } else if (Instruction *I = dyn_cast<Instruction>(Addr)) {
2754 ExtAddrMode BackupAddrMode = AddrMode;
2755 unsigned OldSize = AddrModeInsts.size();
2757 // Check to see if it is possible to fold this operation.
2758 bool MovedAway = false;
2759 if (MatchOperationAddr(I, I->getOpcode(), Depth, &MovedAway)) {
2760 // This instruction may have been move away. If so, there is nothing
2764 // Okay, it's possible to fold this. Check to see if it is actually
2765 // *profitable* to do so. We use a simple cost model to avoid increasing
2766 // register pressure too much.
2767 if (I->hasOneUse() ||
2768 IsProfitableToFoldIntoAddressingMode(I, BackupAddrMode, AddrMode)) {
2769 AddrModeInsts.push_back(I);
2773 // It isn't profitable to do this, roll back.
2774 //cerr << "NOT FOLDING: " << *I;
2775 AddrMode = BackupAddrMode;
2776 AddrModeInsts.resize(OldSize);
2777 TPT.rollback(LastKnownGood);
2779 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Addr)) {
2780 if (MatchOperationAddr(CE, CE->getOpcode(), Depth))
2782 TPT.rollback(LastKnownGood);
2783 } else if (isa<ConstantPointerNull>(Addr)) {
2784 // Null pointer gets folded without affecting the addressing mode.
2788 // Worse case, the target should support [reg] addressing modes. :)
2789 if (!AddrMode.HasBaseReg) {
2790 AddrMode.HasBaseReg = true;
2791 AddrMode.BaseReg = Addr;
2792 // Still check for legality in case the target supports [imm] but not [i+r].
2793 if (TLI.isLegalAddressingMode(AddrMode, AccessTy))
2795 AddrMode.HasBaseReg = false;
2796 AddrMode.BaseReg = nullptr;
2799 // If the base register is already taken, see if we can do [r+r].
2800 if (AddrMode.Scale == 0) {
2802 AddrMode.ScaledReg = Addr;
2803 if (TLI.isLegalAddressingMode(AddrMode, AccessTy))
2806 AddrMode.ScaledReg = nullptr;
2809 TPT.rollback(LastKnownGood);
2813 /// IsOperandAMemoryOperand - Check to see if all uses of OpVal by the specified
2814 /// inline asm call are due to memory operands. If so, return true, otherwise
2816 static bool IsOperandAMemoryOperand(CallInst *CI, InlineAsm *IA, Value *OpVal,
2817 const TargetMachine &TM) {
2818 const Function *F = CI->getParent()->getParent();
2819 const TargetLowering *TLI = TM.getSubtargetImpl(*F)->getTargetLowering();
2820 const TargetRegisterInfo *TRI = TM.getSubtargetImpl(*F)->getRegisterInfo();
2821 TargetLowering::AsmOperandInfoVector TargetConstraints =
2822 TLI->ParseConstraints(TRI, ImmutableCallSite(CI));
2823 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
2824 TargetLowering::AsmOperandInfo &OpInfo = TargetConstraints[i];
2826 // Compute the constraint code and ConstraintType to use.
2827 TLI->ComputeConstraintToUse(OpInfo, SDValue());
2829 // If this asm operand is our Value*, and if it isn't an indirect memory
2830 // operand, we can't fold it!
2831 if (OpInfo.CallOperandVal == OpVal &&
2832 (OpInfo.ConstraintType != TargetLowering::C_Memory ||
2833 !OpInfo.isIndirect))
2840 /// FindAllMemoryUses - Recursively walk all the uses of I until we find a
2841 /// memory use. If we find an obviously non-foldable instruction, return true.
2842 /// Add the ultimately found memory instructions to MemoryUses.
2843 static bool FindAllMemoryUses(
2845 SmallVectorImpl<std::pair<Instruction *, unsigned>> &MemoryUses,
2846 SmallPtrSetImpl<Instruction *> &ConsideredInsts, const TargetMachine &TM) {
2847 // If we already considered this instruction, we're done.
2848 if (!ConsideredInsts.insert(I).second)
2851 // If this is an obviously unfoldable instruction, bail out.
2852 if (!MightBeFoldableInst(I))
2855 // Loop over all the uses, recursively processing them.
2856 for (Use &U : I->uses()) {
2857 Instruction *UserI = cast<Instruction>(U.getUser());
2859 if (LoadInst *LI = dyn_cast<LoadInst>(UserI)) {
2860 MemoryUses.push_back(std::make_pair(LI, U.getOperandNo()));
2864 if (StoreInst *SI = dyn_cast<StoreInst>(UserI)) {
2865 unsigned opNo = U.getOperandNo();
2866 if (opNo == 0) return true; // Storing addr, not into addr.
2867 MemoryUses.push_back(std::make_pair(SI, opNo));
2871 if (CallInst *CI = dyn_cast<CallInst>(UserI)) {
2872 InlineAsm *IA = dyn_cast<InlineAsm>(CI->getCalledValue());
2873 if (!IA) return true;
2875 // If this is a memory operand, we're cool, otherwise bail out.
2876 if (!IsOperandAMemoryOperand(CI, IA, I, TM))
2881 if (FindAllMemoryUses(UserI, MemoryUses, ConsideredInsts, TM))
2888 /// ValueAlreadyLiveAtInst - Retrn true if Val is already known to be live at
2889 /// the use site that we're folding it into. If so, there is no cost to
2890 /// include it in the addressing mode. KnownLive1 and KnownLive2 are two values
2891 /// that we know are live at the instruction already.
2892 bool AddressingModeMatcher::ValueAlreadyLiveAtInst(Value *Val,Value *KnownLive1,
2893 Value *KnownLive2) {
2894 // If Val is either of the known-live values, we know it is live!
2895 if (Val == nullptr || Val == KnownLive1 || Val == KnownLive2)
2898 // All values other than instructions and arguments (e.g. constants) are live.
2899 if (!isa<Instruction>(Val) && !isa<Argument>(Val)) return true;
2901 // If Val is a constant sized alloca in the entry block, it is live, this is
2902 // true because it is just a reference to the stack/frame pointer, which is
2903 // live for the whole function.
2904 if (AllocaInst *AI = dyn_cast<AllocaInst>(Val))
2905 if (AI->isStaticAlloca())
2908 // Check to see if this value is already used in the memory instruction's
2909 // block. If so, it's already live into the block at the very least, so we
2910 // can reasonably fold it.
2911 return Val->isUsedInBasicBlock(MemoryInst->getParent());
2914 /// IsProfitableToFoldIntoAddressingMode - It is possible for the addressing
2915 /// mode of the machine to fold the specified instruction into a load or store
2916 /// that ultimately uses it. However, the specified instruction has multiple
2917 /// uses. Given this, it may actually increase register pressure to fold it
2918 /// into the load. For example, consider this code:
2922 /// use(Y) -> nonload/store
2926 /// In this case, Y has multiple uses, and can be folded into the load of Z
2927 /// (yielding load [X+2]). However, doing this will cause both "X" and "X+1" to
2928 /// be live at the use(Y) line. If we don't fold Y into load Z, we use one
2929 /// fewer register. Since Y can't be folded into "use(Y)" we don't increase the
2930 /// number of computations either.
2932 /// Note that this (like most of CodeGenPrepare) is just a rough heuristic. If
2933 /// X was live across 'load Z' for other reasons, we actually *would* want to
2934 /// fold the addressing mode in the Z case. This would make Y die earlier.
2935 bool AddressingModeMatcher::
2936 IsProfitableToFoldIntoAddressingMode(Instruction *I, ExtAddrMode &AMBefore,
2937 ExtAddrMode &AMAfter) {
2938 if (IgnoreProfitability) return true;
2940 // AMBefore is the addressing mode before this instruction was folded into it,
2941 // and AMAfter is the addressing mode after the instruction was folded. Get
2942 // the set of registers referenced by AMAfter and subtract out those
2943 // referenced by AMBefore: this is the set of values which folding in this
2944 // address extends the lifetime of.
2946 // Note that there are only two potential values being referenced here,
2947 // BaseReg and ScaleReg (global addresses are always available, as are any
2948 // folded immediates).
2949 Value *BaseReg = AMAfter.BaseReg, *ScaledReg = AMAfter.ScaledReg;
2951 // If the BaseReg or ScaledReg was referenced by the previous addrmode, their
2952 // lifetime wasn't extended by adding this instruction.
2953 if (ValueAlreadyLiveAtInst(BaseReg, AMBefore.BaseReg, AMBefore.ScaledReg))
2955 if (ValueAlreadyLiveAtInst(ScaledReg, AMBefore.BaseReg, AMBefore.ScaledReg))
2956 ScaledReg = nullptr;
2958 // If folding this instruction (and it's subexprs) didn't extend any live
2959 // ranges, we're ok with it.
2960 if (!BaseReg && !ScaledReg)
2963 // If all uses of this instruction are ultimately load/store/inlineasm's,
2964 // check to see if their addressing modes will include this instruction. If
2965 // so, we can fold it into all uses, so it doesn't matter if it has multiple
2967 SmallVector<std::pair<Instruction*,unsigned>, 16> MemoryUses;
2968 SmallPtrSet<Instruction*, 16> ConsideredInsts;
2969 if (FindAllMemoryUses(I, MemoryUses, ConsideredInsts, TM))
2970 return false; // Has a non-memory, non-foldable use!
2972 // Now that we know that all uses of this instruction are part of a chain of
2973 // computation involving only operations that could theoretically be folded
2974 // into a memory use, loop over each of these uses and see if they could
2975 // *actually* fold the instruction.
2976 SmallVector<Instruction*, 32> MatchedAddrModeInsts;
2977 for (unsigned i = 0, e = MemoryUses.size(); i != e; ++i) {
2978 Instruction *User = MemoryUses[i].first;
2979 unsigned OpNo = MemoryUses[i].second;
2981 // Get the access type of this use. If the use isn't a pointer, we don't
2982 // know what it accesses.
2983 Value *Address = User->getOperand(OpNo);
2984 if (!Address->getType()->isPointerTy())
2986 Type *AddressAccessTy = Address->getType()->getPointerElementType();
2988 // Do a match against the root of this address, ignoring profitability. This
2989 // will tell us if the addressing mode for the memory operation will
2990 // *actually* cover the shared instruction.
2992 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
2993 TPT.getRestorationPoint();
2994 AddressingModeMatcher Matcher(MatchedAddrModeInsts, TM, AddressAccessTy,
2995 MemoryInst, Result, InsertedTruncs,
2996 PromotedInsts, TPT);
2997 Matcher.IgnoreProfitability = true;
2998 bool Success = Matcher.MatchAddr(Address, 0);
2999 (void)Success; assert(Success && "Couldn't select *anything*?");
3001 // The match was to check the profitability, the changes made are not
3002 // part of the original matcher. Therefore, they should be dropped
3003 // otherwise the original matcher will not present the right state.
3004 TPT.rollback(LastKnownGood);
3006 // If the match didn't cover I, then it won't be shared by it.
3007 if (std::find(MatchedAddrModeInsts.begin(), MatchedAddrModeInsts.end(),
3008 I) == MatchedAddrModeInsts.end())
3011 MatchedAddrModeInsts.clear();
3017 } // end anonymous namespace
3019 /// IsNonLocalValue - Return true if the specified values are defined in a
3020 /// different basic block than BB.
3021 static bool IsNonLocalValue(Value *V, BasicBlock *BB) {
3022 if (Instruction *I = dyn_cast<Instruction>(V))
3023 return I->getParent() != BB;
3027 /// OptimizeMemoryInst - Load and Store Instructions often have
3028 /// addressing modes that can do significant amounts of computation. As such,
3029 /// instruction selection will try to get the load or store to do as much
3030 /// computation as possible for the program. The problem is that isel can only
3031 /// see within a single block. As such, we sink as much legal addressing mode
3032 /// stuff into the block as possible.
3034 /// This method is used to optimize both load/store and inline asms with memory
3036 bool CodeGenPrepare::OptimizeMemoryInst(Instruction *MemoryInst, Value *Addr,
3040 // Try to collapse single-value PHI nodes. This is necessary to undo
3041 // unprofitable PRE transformations.
3042 SmallVector<Value*, 8> worklist;
3043 SmallPtrSet<Value*, 16> Visited;
3044 worklist.push_back(Addr);
3046 // Use a worklist to iteratively look through PHI nodes, and ensure that
3047 // the addressing mode obtained from the non-PHI roots of the graph
3049 Value *Consensus = nullptr;
3050 unsigned NumUsesConsensus = 0;
3051 bool IsNumUsesConsensusValid = false;
3052 SmallVector<Instruction*, 16> AddrModeInsts;
3053 ExtAddrMode AddrMode;
3054 TypePromotionTransaction TPT;
3055 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
3056 TPT.getRestorationPoint();
3057 while (!worklist.empty()) {
3058 Value *V = worklist.back();
3059 worklist.pop_back();
3061 // Break use-def graph loops.
3062 if (!Visited.insert(V).second) {
3063 Consensus = nullptr;
3067 // For a PHI node, push all of its incoming values.
3068 if (PHINode *P = dyn_cast<PHINode>(V)) {
3069 for (unsigned i = 0, e = P->getNumIncomingValues(); i != e; ++i)
3070 worklist.push_back(P->getIncomingValue(i));
3074 // For non-PHIs, determine the addressing mode being computed.
3075 SmallVector<Instruction*, 16> NewAddrModeInsts;
3076 ExtAddrMode NewAddrMode = AddressingModeMatcher::Match(
3077 V, AccessTy, MemoryInst, NewAddrModeInsts, *TM, InsertedTruncsSet,
3078 PromotedInsts, TPT);
3080 // This check is broken into two cases with very similar code to avoid using
3081 // getNumUses() as much as possible. Some values have a lot of uses, so
3082 // calling getNumUses() unconditionally caused a significant compile-time
3086 AddrMode = NewAddrMode;
3087 AddrModeInsts = NewAddrModeInsts;
3089 } else if (NewAddrMode == AddrMode) {
3090 if (!IsNumUsesConsensusValid) {
3091 NumUsesConsensus = Consensus->getNumUses();
3092 IsNumUsesConsensusValid = true;
3095 // Ensure that the obtained addressing mode is equivalent to that obtained
3096 // for all other roots of the PHI traversal. Also, when choosing one
3097 // such root as representative, select the one with the most uses in order
3098 // to keep the cost modeling heuristics in AddressingModeMatcher
3100 unsigned NumUses = V->getNumUses();
3101 if (NumUses > NumUsesConsensus) {
3103 NumUsesConsensus = NumUses;
3104 AddrModeInsts = NewAddrModeInsts;
3109 Consensus = nullptr;
3113 // If the addressing mode couldn't be determined, or if multiple different
3114 // ones were determined, bail out now.
3116 TPT.rollback(LastKnownGood);
3121 // Check to see if any of the instructions supersumed by this addr mode are
3122 // non-local to I's BB.
3123 bool AnyNonLocal = false;
3124 for (unsigned i = 0, e = AddrModeInsts.size(); i != e; ++i) {
3125 if (IsNonLocalValue(AddrModeInsts[i], MemoryInst->getParent())) {
3131 // If all the instructions matched are already in this BB, don't do anything.
3133 DEBUG(dbgs() << "CGP: Found local addrmode: " << AddrMode << "\n");
3137 // Insert this computation right after this user. Since our caller is
3138 // scanning from the top of the BB to the bottom, reuse of the expr are
3139 // guaranteed to happen later.
3140 IRBuilder<> Builder(MemoryInst);
3142 // Now that we determined the addressing expression we want to use and know
3143 // that we have to sink it into this block. Check to see if we have already
3144 // done this for some other load/store instr in this block. If so, reuse the
3146 Value *&SunkAddr = SunkAddrs[Addr];
3148 DEBUG(dbgs() << "CGP: Reusing nonlocal addrmode: " << AddrMode << " for "
3149 << *MemoryInst << "\n");
3150 if (SunkAddr->getType() != Addr->getType())
3151 SunkAddr = Builder.CreateBitCast(SunkAddr, Addr->getType());
3152 } else if (AddrSinkUsingGEPs ||
3153 (!AddrSinkUsingGEPs.getNumOccurrences() && TM &&
3154 TM->getSubtargetImpl(*MemoryInst->getParent()->getParent())
3156 // By default, we use the GEP-based method when AA is used later. This
3157 // prevents new inttoptr/ptrtoint pairs from degrading AA capabilities.
3158 DEBUG(dbgs() << "CGP: SINKING nonlocal addrmode: " << AddrMode << " for "
3159 << *MemoryInst << "\n");
3160 Type *IntPtrTy = TLI->getDataLayout()->getIntPtrType(Addr->getType());
3161 Value *ResultPtr = nullptr, *ResultIndex = nullptr;
3163 // First, find the pointer.
3164 if (AddrMode.BaseReg && AddrMode.BaseReg->getType()->isPointerTy()) {
3165 ResultPtr = AddrMode.BaseReg;
3166 AddrMode.BaseReg = nullptr;
3169 if (AddrMode.Scale && AddrMode.ScaledReg->getType()->isPointerTy()) {
3170 // We can't add more than one pointer together, nor can we scale a
3171 // pointer (both of which seem meaningless).
3172 if (ResultPtr || AddrMode.Scale != 1)
3175 ResultPtr = AddrMode.ScaledReg;
3179 if (AddrMode.BaseGV) {
3183 ResultPtr = AddrMode.BaseGV;
3186 // If the real base value actually came from an inttoptr, then the matcher
3187 // will look through it and provide only the integer value. In that case,
3189 if (!ResultPtr && AddrMode.BaseReg) {
3191 Builder.CreateIntToPtr(AddrMode.BaseReg, Addr->getType(), "sunkaddr");
3192 AddrMode.BaseReg = nullptr;
3193 } else if (!ResultPtr && AddrMode.Scale == 1) {
3195 Builder.CreateIntToPtr(AddrMode.ScaledReg, Addr->getType(), "sunkaddr");
3200 !AddrMode.BaseReg && !AddrMode.Scale && !AddrMode.BaseOffs) {
3201 SunkAddr = Constant::getNullValue(Addr->getType());
3202 } else if (!ResultPtr) {
3206 Builder.getInt8PtrTy(Addr->getType()->getPointerAddressSpace());
3208 // Start with the base register. Do this first so that subsequent address
3209 // matching finds it last, which will prevent it from trying to match it
3210 // as the scaled value in case it happens to be a mul. That would be
3211 // problematic if we've sunk a different mul for the scale, because then
3212 // we'd end up sinking both muls.
3213 if (AddrMode.BaseReg) {
3214 Value *V = AddrMode.BaseReg;
3215 if (V->getType() != IntPtrTy)
3216 V = Builder.CreateIntCast(V, IntPtrTy, /*isSigned=*/true, "sunkaddr");
3221 // Add the scale value.
3222 if (AddrMode.Scale) {
3223 Value *V = AddrMode.ScaledReg;
3224 if (V->getType() == IntPtrTy) {
3226 } else if (cast<IntegerType>(IntPtrTy)->getBitWidth() <
3227 cast<IntegerType>(V->getType())->getBitWidth()) {
3228 V = Builder.CreateTrunc(V, IntPtrTy, "sunkaddr");
3230 // It is only safe to sign extend the BaseReg if we know that the math
3231 // required to create it did not overflow before we extend it. Since
3232 // the original IR value was tossed in favor of a constant back when
3233 // the AddrMode was created we need to bail out gracefully if widths
3234 // do not match instead of extending it.
3235 Instruction *I = dyn_cast_or_null<Instruction>(ResultIndex);
3236 if (I && (ResultIndex != AddrMode.BaseReg))
3237 I->eraseFromParent();
3241 if (AddrMode.Scale != 1)
3242 V = Builder.CreateMul(V, ConstantInt::get(IntPtrTy, AddrMode.Scale),
3245 ResultIndex = Builder.CreateAdd(ResultIndex, V, "sunkaddr");
3250 // Add in the Base Offset if present.
3251 if (AddrMode.BaseOffs) {
3252 Value *V = ConstantInt::get(IntPtrTy, AddrMode.BaseOffs);
3254 // We need to add this separately from the scale above to help with
3255 // SDAG consecutive load/store merging.
3256 if (ResultPtr->getType() != I8PtrTy)
3257 ResultPtr = Builder.CreateBitCast(ResultPtr, I8PtrTy);
3258 ResultPtr = Builder.CreateGEP(ResultPtr, ResultIndex, "sunkaddr");
3265 SunkAddr = ResultPtr;
3267 if (ResultPtr->getType() != I8PtrTy)
3268 ResultPtr = Builder.CreateBitCast(ResultPtr, I8PtrTy);
3269 SunkAddr = Builder.CreateGEP(ResultPtr, ResultIndex, "sunkaddr");
3272 if (SunkAddr->getType() != Addr->getType())
3273 SunkAddr = Builder.CreateBitCast(SunkAddr, Addr->getType());
3276 DEBUG(dbgs() << "CGP: SINKING nonlocal addrmode: " << AddrMode << " for "
3277 << *MemoryInst << "\n");
3278 Type *IntPtrTy = TLI->getDataLayout()->getIntPtrType(Addr->getType());
3279 Value *Result = nullptr;
3281 // Start with the base register. Do this first so that subsequent address
3282 // matching finds it last, which will prevent it from trying to match it
3283 // as the scaled value in case it happens to be a mul. That would be
3284 // problematic if we've sunk a different mul for the scale, because then
3285 // we'd end up sinking both muls.
3286 if (AddrMode.BaseReg) {
3287 Value *V = AddrMode.BaseReg;
3288 if (V->getType()->isPointerTy())
3289 V = Builder.CreatePtrToInt(V, IntPtrTy, "sunkaddr");
3290 if (V->getType() != IntPtrTy)
3291 V = Builder.CreateIntCast(V, IntPtrTy, /*isSigned=*/true, "sunkaddr");
3295 // Add the scale value.
3296 if (AddrMode.Scale) {
3297 Value *V = AddrMode.ScaledReg;
3298 if (V->getType() == IntPtrTy) {
3300 } else if (V->getType()->isPointerTy()) {
3301 V = Builder.CreatePtrToInt(V, IntPtrTy, "sunkaddr");
3302 } else if (cast<IntegerType>(IntPtrTy)->getBitWidth() <
3303 cast<IntegerType>(V->getType())->getBitWidth()) {
3304 V = Builder.CreateTrunc(V, IntPtrTy, "sunkaddr");
3306 // It is only safe to sign extend the BaseReg if we know that the math
3307 // required to create it did not overflow before we extend it. Since
3308 // the original IR value was tossed in favor of a constant back when
3309 // the AddrMode was created we need to bail out gracefully if widths
3310 // do not match instead of extending it.
3311 Instruction *I = dyn_cast_or_null<Instruction>(Result);
3312 if (I && (Result != AddrMode.BaseReg))
3313 I->eraseFromParent();
3316 if (AddrMode.Scale != 1)
3317 V = Builder.CreateMul(V, ConstantInt::get(IntPtrTy, AddrMode.Scale),
3320 Result = Builder.CreateAdd(Result, V, "sunkaddr");
3325 // Add in the BaseGV if present.
3326 if (AddrMode.BaseGV) {
3327 Value *V = Builder.CreatePtrToInt(AddrMode.BaseGV, IntPtrTy, "sunkaddr");
3329 Result = Builder.CreateAdd(Result, V, "sunkaddr");
3334 // Add in the Base Offset if present.
3335 if (AddrMode.BaseOffs) {
3336 Value *V = ConstantInt::get(IntPtrTy, AddrMode.BaseOffs);
3338 Result = Builder.CreateAdd(Result, V, "sunkaddr");
3344 SunkAddr = Constant::getNullValue(Addr->getType());
3346 SunkAddr = Builder.CreateIntToPtr(Result, Addr->getType(), "sunkaddr");
3349 MemoryInst->replaceUsesOfWith(Repl, SunkAddr);
3351 // If we have no uses, recursively delete the value and all dead instructions
3353 if (Repl->use_empty()) {
3354 // This can cause recursive deletion, which can invalidate our iterator.
3355 // Use a WeakVH to hold onto it in case this happens.
3356 WeakVH IterHandle(CurInstIterator);
3357 BasicBlock *BB = CurInstIterator->getParent();
3359 RecursivelyDeleteTriviallyDeadInstructions(Repl, TLInfo);
3361 if (IterHandle != CurInstIterator) {
3362 // If the iterator instruction was recursively deleted, start over at the
3363 // start of the block.
3364 CurInstIterator = BB->begin();
3372 /// OptimizeInlineAsmInst - If there are any memory operands, use
3373 /// OptimizeMemoryInst to sink their address computing into the block when
3374 /// possible / profitable.
3375 bool CodeGenPrepare::OptimizeInlineAsmInst(CallInst *CS) {
3376 bool MadeChange = false;
3378 const TargetRegisterInfo *TRI =
3379 TM->getSubtargetImpl(*CS->getParent()->getParent())->getRegisterInfo();
3380 TargetLowering::AsmOperandInfoVector
3381 TargetConstraints = TLI->ParseConstraints(TRI, CS);
3383 for (unsigned i = 0, e = TargetConstraints.size(); i != e; ++i) {
3384 TargetLowering::AsmOperandInfo &OpInfo = TargetConstraints[i];
3386 // Compute the constraint code and ConstraintType to use.
3387 TLI->ComputeConstraintToUse(OpInfo, SDValue());
3389 if (OpInfo.ConstraintType == TargetLowering::C_Memory &&
3390 OpInfo.isIndirect) {
3391 Value *OpVal = CS->getArgOperand(ArgNo++);
3392 MadeChange |= OptimizeMemoryInst(CS, OpVal, OpVal->getType());
3393 } else if (OpInfo.Type == InlineAsm::isInput)
3400 /// \brief Check if all the uses of \p Inst are equivalent (or free) zero or
3401 /// sign extensions.
3402 static bool hasSameExtUse(Instruction *Inst, const TargetLowering &TLI) {
3403 assert(!Inst->use_empty() && "Input must have at least one use");
3404 const Instruction *FirstUser = cast<Instruction>(*Inst->user_begin());
3405 bool IsSExt = isa<SExtInst>(FirstUser);
3406 Type *ExtTy = FirstUser->getType();
3407 for (const User *U : Inst->users()) {
3408 const Instruction *UI = cast<Instruction>(U);
3409 if ((IsSExt && !isa<SExtInst>(UI)) || (!IsSExt && !isa<ZExtInst>(UI)))
3411 Type *CurTy = UI->getType();
3412 // Same input and output types: Same instruction after CSE.
3416 // If IsSExt is true, we are in this situation:
3418 // b = sext ty1 a to ty2
3419 // c = sext ty1 a to ty3
3420 // Assuming ty2 is shorter than ty3, this could be turned into:
3422 // b = sext ty1 a to ty2
3423 // c = sext ty2 b to ty3
3424 // However, the last sext is not free.
3428 // This is a ZExt, maybe this is free to extend from one type to another.
3429 // In that case, we would not account for a different use.
3432 if (ExtTy->getScalarType()->getIntegerBitWidth() >
3433 CurTy->getScalarType()->getIntegerBitWidth()) {
3441 if (!TLI.isZExtFree(NarrowTy, LargeTy))
3444 // All uses are the same or can be derived from one another for free.
3448 /// \brief Try to form ExtLd by promoting \p Exts until they reach a
3449 /// load instruction.
3450 /// If an ext(load) can be formed, it is returned via \p LI for the load
3451 /// and \p Inst for the extension.
3452 /// Otherwise LI == nullptr and Inst == nullptr.
3453 /// When some promotion happened, \p TPT contains the proper state to
3456 /// \return true when promoting was necessary to expose the ext(load)
3457 /// opportunity, false otherwise.
3461 /// %ld = load i32* %addr
3462 /// %add = add nuw i32 %ld, 4
3463 /// %zext = zext i32 %add to i64
3467 /// %ld = load i32* %addr
3468 /// %zext = zext i32 %ld to i64
3469 /// %add = add nuw i64 %zext, 4
3471 /// Thanks to the promotion, we can match zext(load i32*) to i64.
3472 bool CodeGenPrepare::ExtLdPromotion(TypePromotionTransaction &TPT,
3473 LoadInst *&LI, Instruction *&Inst,
3474 const SmallVectorImpl<Instruction *> &Exts,
3475 unsigned CreatedInsts = 0) {
3476 // Iterate over all the extensions to see if one form an ext(load).
3477 for (auto I : Exts) {
3478 // Check if we directly have ext(load).
3479 if ((LI = dyn_cast<LoadInst>(I->getOperand(0)))) {
3481 // No promotion happened here.
3484 // Check whether or not we want to do any promotion.
3485 if (!TLI || !TLI->enableExtLdPromotion() || DisableExtLdPromotion)
3487 // Get the action to perform the promotion.
3488 TypePromotionHelper::Action TPH = TypePromotionHelper::getAction(
3489 I, InsertedTruncsSet, *TLI, PromotedInsts);
3490 // Check if we can promote.
3493 // Save the current state.
3494 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
3495 TPT.getRestorationPoint();
3496 SmallVector<Instruction *, 4> NewExts;
3497 unsigned NewCreatedInsts = 0;
3499 Value *PromotedVal =
3500 TPH(I, TPT, PromotedInsts, NewCreatedInsts, &NewExts, nullptr);
3501 assert(PromotedVal &&
3502 "TypePromotionHelper should have filtered out those cases");
3504 // We would be able to merge only one extension in a load.
3505 // Therefore, if we have more than 1 new extension we heuristically
3506 // cut this search path, because it means we degrade the code quality.
3507 // With exactly 2, the transformation is neutral, because we will merge
3508 // one extension but leave one. However, we optimistically keep going,
3509 // because the new extension may be removed too.
3510 unsigned TotalCreatedInsts = CreatedInsts + NewCreatedInsts;
3511 if (!StressExtLdPromotion &&
3512 (TotalCreatedInsts > 1 ||
3513 !isPromotedInstructionLegal(*TLI, PromotedVal))) {
3514 // The promotion is not profitable, rollback to the previous state.
3515 TPT.rollback(LastKnownGood);
3518 // The promotion is profitable.
3519 // Check if it exposes an ext(load).
3520 (void)ExtLdPromotion(TPT, LI, Inst, NewExts, TotalCreatedInsts);
3521 if (LI && (StressExtLdPromotion || NewCreatedInsts == 0 ||
3522 // If we have created a new extension, i.e., now we have two
3523 // extensions. We must make sure one of them is merged with
3524 // the load, otherwise we may degrade the code quality.
3525 (LI->hasOneUse() || hasSameExtUse(LI, *TLI))))
3526 // Promotion happened.
3528 // If this does not help to expose an ext(load) then, rollback.
3529 TPT.rollback(LastKnownGood);
3531 // None of the extension can form an ext(load).
3537 /// MoveExtToFormExtLoad - Move a zext or sext fed by a load into the same
3538 /// basic block as the load, unless conditions are unfavorable. This allows
3539 /// SelectionDAG to fold the extend into the load.
3540 /// \p I[in/out] the extension may be modified during the process if some
3541 /// promotions apply.
3543 bool CodeGenPrepare::MoveExtToFormExtLoad(Instruction *&I) {
3544 // Try to promote a chain of computation if it allows to form
3545 // an extended load.
3546 TypePromotionTransaction TPT;
3547 TypePromotionTransaction::ConstRestorationPt LastKnownGood =
3548 TPT.getRestorationPoint();
3549 SmallVector<Instruction *, 1> Exts;
3551 // Look for a load being extended.
3552 LoadInst *LI = nullptr;
3553 Instruction *OldExt = I;
3554 bool HasPromoted = ExtLdPromotion(TPT, LI, I, Exts);
3556 assert(!HasPromoted && !LI && "If we did not match any load instruction "
3557 "the code must remain the same");
3562 // If they're already in the same block, there's nothing to do.
3563 // Make the cheap checks first if we did not promote.
3564 // If we promoted, we need to check if it is indeed profitable.
3565 if (!HasPromoted && LI->getParent() == I->getParent())
3568 EVT VT = TLI->getValueType(I->getType());
3569 EVT LoadVT = TLI->getValueType(LI->getType());
3571 // If the load has other users and the truncate is not free, this probably
3572 // isn't worthwhile.
3573 if (!LI->hasOneUse() && TLI &&
3574 (TLI->isTypeLegal(LoadVT) || !TLI->isTypeLegal(VT)) &&
3575 !TLI->isTruncateFree(I->getType(), LI->getType())) {
3577 TPT.rollback(LastKnownGood);
3581 // Check whether the target supports casts folded into loads.
3583 if (isa<ZExtInst>(I))
3584 LType = ISD::ZEXTLOAD;
3586 assert(isa<SExtInst>(I) && "Unexpected ext type!");
3587 LType = ISD::SEXTLOAD;
3589 if (TLI && !TLI->isLoadExtLegal(LType, VT, LoadVT)) {
3591 TPT.rollback(LastKnownGood);
3595 // Move the extend into the same block as the load, so that SelectionDAG
3598 I->removeFromParent();
3604 bool CodeGenPrepare::OptimizeExtUses(Instruction *I) {
3605 BasicBlock *DefBB = I->getParent();
3607 // If the result of a {s|z}ext and its source are both live out, rewrite all
3608 // other uses of the source with result of extension.
3609 Value *Src = I->getOperand(0);
3610 if (Src->hasOneUse())
3613 // Only do this xform if truncating is free.
3614 if (TLI && !TLI->isTruncateFree(I->getType(), Src->getType()))
3617 // Only safe to perform the optimization if the source is also defined in
3619 if (!isa<Instruction>(Src) || DefBB != cast<Instruction>(Src)->getParent())
3622 bool DefIsLiveOut = false;
3623 for (User *U : I->users()) {
3624 Instruction *UI = cast<Instruction>(U);
3626 // Figure out which BB this ext is used in.
3627 BasicBlock *UserBB = UI->getParent();
3628 if (UserBB == DefBB) continue;
3629 DefIsLiveOut = true;
3635 // Make sure none of the uses are PHI nodes.
3636 for (User *U : Src->users()) {
3637 Instruction *UI = cast<Instruction>(U);
3638 BasicBlock *UserBB = UI->getParent();
3639 if (UserBB == DefBB) continue;
3640 // Be conservative. We don't want this xform to end up introducing
3641 // reloads just before load / store instructions.
3642 if (isa<PHINode>(UI) || isa<LoadInst>(UI) || isa<StoreInst>(UI))
3646 // InsertedTruncs - Only insert one trunc in each block once.
3647 DenseMap<BasicBlock*, Instruction*> InsertedTruncs;
3649 bool MadeChange = false;
3650 for (Use &U : Src->uses()) {
3651 Instruction *User = cast<Instruction>(U.getUser());
3653 // Figure out which BB this ext is used in.
3654 BasicBlock *UserBB = User->getParent();
3655 if (UserBB == DefBB) continue;
3657 // Both src and def are live in this block. Rewrite the use.
3658 Instruction *&InsertedTrunc = InsertedTruncs[UserBB];
3660 if (!InsertedTrunc) {
3661 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
3662 InsertedTrunc = new TruncInst(I, Src->getType(), "", InsertPt);
3663 InsertedTruncsSet.insert(InsertedTrunc);
3666 // Replace a use of the {s|z}ext source with a use of the result.
3675 /// isFormingBranchFromSelectProfitable - Returns true if a SelectInst should be
3676 /// turned into an explicit branch.
3677 static bool isFormingBranchFromSelectProfitable(SelectInst *SI) {
3678 // FIXME: This should use the same heuristics as IfConversion to determine
3679 // whether a select is better represented as a branch. This requires that
3680 // branch probability metadata is preserved for the select, which is not the
3683 CmpInst *Cmp = dyn_cast<CmpInst>(SI->getCondition());
3685 // If the branch is predicted right, an out of order CPU can avoid blocking on
3686 // the compare. Emit cmovs on compares with a memory operand as branches to
3687 // avoid stalls on the load from memory. If the compare has more than one use
3688 // there's probably another cmov or setcc around so it's not worth emitting a
3693 Value *CmpOp0 = Cmp->getOperand(0);
3694 Value *CmpOp1 = Cmp->getOperand(1);
3696 // We check that the memory operand has one use to avoid uses of the loaded
3697 // value directly after the compare, making branches unprofitable.
3698 return Cmp->hasOneUse() &&
3699 ((isa<LoadInst>(CmpOp0) && CmpOp0->hasOneUse()) ||
3700 (isa<LoadInst>(CmpOp1) && CmpOp1->hasOneUse()));
3704 /// If we have a SelectInst that will likely profit from branch prediction,
3705 /// turn it into a branch.
3706 bool CodeGenPrepare::OptimizeSelectInst(SelectInst *SI) {
3707 bool VectorCond = !SI->getCondition()->getType()->isIntegerTy(1);
3709 // Can we convert the 'select' to CF ?
3710 if (DisableSelectToBranch || OptSize || !TLI || VectorCond)
3713 TargetLowering::SelectSupportKind SelectKind;
3715 SelectKind = TargetLowering::VectorMaskSelect;
3716 else if (SI->getType()->isVectorTy())
3717 SelectKind = TargetLowering::ScalarCondVectorVal;
3719 SelectKind = TargetLowering::ScalarValSelect;
3721 // Do we have efficient codegen support for this kind of 'selects' ?
3722 if (TLI->isSelectSupported(SelectKind)) {
3723 // We have efficient codegen support for the select instruction.
3724 // Check if it is profitable to keep this 'select'.
3725 if (!TLI->isPredictableSelectExpensive() ||
3726 !isFormingBranchFromSelectProfitable(SI))
3732 // First, we split the block containing the select into 2 blocks.
3733 BasicBlock *StartBlock = SI->getParent();
3734 BasicBlock::iterator SplitPt = ++(BasicBlock::iterator(SI));
3735 BasicBlock *NextBlock = StartBlock->splitBasicBlock(SplitPt, "select.end");
3737 // Create a new block serving as the landing pad for the branch.
3738 BasicBlock *SmallBlock = BasicBlock::Create(SI->getContext(), "select.mid",
3739 NextBlock->getParent(), NextBlock);
3741 // Move the unconditional branch from the block with the select in it into our
3742 // landing pad block.
3743 StartBlock->getTerminator()->eraseFromParent();
3744 BranchInst::Create(NextBlock, SmallBlock);
3746 // Insert the real conditional branch based on the original condition.
3747 BranchInst::Create(NextBlock, SmallBlock, SI->getCondition(), SI);
3749 // The select itself is replaced with a PHI Node.
3750 PHINode *PN = PHINode::Create(SI->getType(), 2, "", NextBlock->begin());
3752 PN->addIncoming(SI->getTrueValue(), StartBlock);
3753 PN->addIncoming(SI->getFalseValue(), SmallBlock);
3754 SI->replaceAllUsesWith(PN);
3755 SI->eraseFromParent();
3757 // Instruct OptimizeBlock to skip to the next block.
3758 CurInstIterator = StartBlock->end();
3759 ++NumSelectsExpanded;
3763 static bool isBroadcastShuffle(ShuffleVectorInst *SVI) {
3764 SmallVector<int, 16> Mask(SVI->getShuffleMask());
3766 for (unsigned i = 0; i < Mask.size(); ++i) {
3767 if (SplatElem != -1 && Mask[i] != -1 && Mask[i] != SplatElem)
3769 SplatElem = Mask[i];
3775 /// Some targets have expensive vector shifts if the lanes aren't all the same
3776 /// (e.g. x86 only introduced "vpsllvd" and friends with AVX2). In these cases
3777 /// it's often worth sinking a shufflevector splat down to its use so that
3778 /// codegen can spot all lanes are identical.
3779 bool CodeGenPrepare::OptimizeShuffleVectorInst(ShuffleVectorInst *SVI) {
3780 BasicBlock *DefBB = SVI->getParent();
3782 // Only do this xform if variable vector shifts are particularly expensive.
3783 if (!TLI || !TLI->isVectorShiftByScalarCheap(SVI->getType()))
3786 // We only expect better codegen by sinking a shuffle if we can recognise a
3788 if (!isBroadcastShuffle(SVI))
3791 // InsertedShuffles - Only insert a shuffle in each block once.
3792 DenseMap<BasicBlock*, Instruction*> InsertedShuffles;
3794 bool MadeChange = false;
3795 for (User *U : SVI->users()) {
3796 Instruction *UI = cast<Instruction>(U);
3798 // Figure out which BB this ext is used in.
3799 BasicBlock *UserBB = UI->getParent();
3800 if (UserBB == DefBB) continue;
3802 // For now only apply this when the splat is used by a shift instruction.
3803 if (!UI->isShift()) continue;
3805 // Everything checks out, sink the shuffle if the user's block doesn't
3806 // already have a copy.
3807 Instruction *&InsertedShuffle = InsertedShuffles[UserBB];
3809 if (!InsertedShuffle) {
3810 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
3811 InsertedShuffle = new ShuffleVectorInst(SVI->getOperand(0),
3813 SVI->getOperand(2), "", InsertPt);
3816 UI->replaceUsesOfWith(SVI, InsertedShuffle);
3820 // If we removed all uses, nuke the shuffle.
3821 if (SVI->use_empty()) {
3822 SVI->eraseFromParent();
3830 /// \brief Helper class to promote a scalar operation to a vector one.
3831 /// This class is used to move downward extractelement transition.
3833 /// a = vector_op <2 x i32>
3834 /// b = extractelement <2 x i32> a, i32 0
3839 /// a = vector_op <2 x i32>
3840 /// c = vector_op a (equivalent to scalar_op on the related lane)
3841 /// * d = extractelement <2 x i32> c, i32 0
3843 /// Assuming both extractelement and store can be combine, we get rid of the
3845 class VectorPromoteHelper {
3846 /// Used to perform some checks on the legality of vector operations.
3847 const TargetLowering &TLI;
3849 /// Used to estimated the cost of the promoted chain.
3850 const TargetTransformInfo &TTI;
3852 /// The transition being moved downwards.
3853 Instruction *Transition;
3854 /// The sequence of instructions to be promoted.
3855 SmallVector<Instruction *, 4> InstsToBePromoted;
3856 /// Cost of combining a store and an extract.
3857 unsigned StoreExtractCombineCost;
3858 /// Instruction that will be combined with the transition.
3859 Instruction *CombineInst;
3861 /// \brief The instruction that represents the current end of the transition.
3862 /// Since we are faking the promotion until we reach the end of the chain
3863 /// of computation, we need a way to get the current end of the transition.
3864 Instruction *getEndOfTransition() const {
3865 if (InstsToBePromoted.empty())
3867 return InstsToBePromoted.back();
3870 /// \brief Return the index of the original value in the transition.
3871 /// E.g., for "extractelement <2 x i32> c, i32 1" the original value,
3872 /// c, is at index 0.
3873 unsigned getTransitionOriginalValueIdx() const {
3874 assert(isa<ExtractElementInst>(Transition) &&
3875 "Other kind of transitions are not supported yet");
3879 /// \brief Return the index of the index in the transition.
3880 /// E.g., for "extractelement <2 x i32> c, i32 0" the index
3882 unsigned getTransitionIdx() const {
3883 assert(isa<ExtractElementInst>(Transition) &&
3884 "Other kind of transitions are not supported yet");
3888 /// \brief Get the type of the transition.
3889 /// This is the type of the original value.
3890 /// E.g., for "extractelement <2 x i32> c, i32 1" the type of the
3891 /// transition is <2 x i32>.
3892 Type *getTransitionType() const {
3893 return Transition->getOperand(getTransitionOriginalValueIdx())->getType();
3896 /// \brief Promote \p ToBePromoted by moving \p Def downward through.
3897 /// I.e., we have the following sequence:
3898 /// Def = Transition <ty1> a to <ty2>
3899 /// b = ToBePromoted <ty2> Def, ...
3901 /// b = ToBePromoted <ty1> a, ...
3902 /// Def = Transition <ty1> ToBePromoted to <ty2>
3903 void promoteImpl(Instruction *ToBePromoted);
3905 /// \brief Check whether or not it is profitable to promote all the
3906 /// instructions enqueued to be promoted.
3907 bool isProfitableToPromote() {
3908 Value *ValIdx = Transition->getOperand(getTransitionOriginalValueIdx());
3909 unsigned Index = isa<ConstantInt>(ValIdx)
3910 ? cast<ConstantInt>(ValIdx)->getZExtValue()
3912 Type *PromotedType = getTransitionType();
3914 StoreInst *ST = cast<StoreInst>(CombineInst);
3915 unsigned AS = ST->getPointerAddressSpace();
3916 unsigned Align = ST->getAlignment();
3917 // Check if this store is supported.
3918 if (!TLI.allowsMisalignedMemoryAccesses(
3919 TLI.getValueType(ST->getValueOperand()->getType()), AS, Align)) {
3920 // If this is not supported, there is no way we can combine
3921 // the extract with the store.
3925 // The scalar chain of computation has to pay for the transition
3926 // scalar to vector.
3927 // The vector chain has to account for the combining cost.
3928 uint64_t ScalarCost =
3929 TTI.getVectorInstrCost(Transition->getOpcode(), PromotedType, Index);
3930 uint64_t VectorCost = StoreExtractCombineCost;
3931 for (const auto &Inst : InstsToBePromoted) {
3932 // Compute the cost.
3933 // By construction, all instructions being promoted are arithmetic ones.
3934 // Moreover, one argument is a constant that can be viewed as a splat
3936 Value *Arg0 = Inst->getOperand(0);
3937 bool IsArg0Constant = isa<UndefValue>(Arg0) || isa<ConstantInt>(Arg0) ||
3938 isa<ConstantFP>(Arg0);
3939 TargetTransformInfo::OperandValueKind Arg0OVK =
3940 IsArg0Constant ? TargetTransformInfo::OK_UniformConstantValue
3941 : TargetTransformInfo::OK_AnyValue;
3942 TargetTransformInfo::OperandValueKind Arg1OVK =
3943 !IsArg0Constant ? TargetTransformInfo::OK_UniformConstantValue
3944 : TargetTransformInfo::OK_AnyValue;
3945 ScalarCost += TTI.getArithmeticInstrCost(
3946 Inst->getOpcode(), Inst->getType(), Arg0OVK, Arg1OVK);
3947 VectorCost += TTI.getArithmeticInstrCost(Inst->getOpcode(), PromotedType,
3950 DEBUG(dbgs() << "Estimated cost of computation to be promoted:\nScalar: "
3951 << ScalarCost << "\nVector: " << VectorCost << '\n');
3952 return ScalarCost > VectorCost;
3955 /// \brief Generate a constant vector with \p Val with the same
3956 /// number of elements as the transition.
3957 /// \p UseSplat defines whether or not \p Val should be replicated
3958 /// accross the whole vector.
3959 /// In other words, if UseSplat == true, we generate <Val, Val, ..., Val>,
3960 /// otherwise we generate a vector with as many undef as possible:
3961 /// <undef, ..., undef, Val, undef, ..., undef> where \p Val is only
3962 /// used at the index of the extract.
3963 Value *getConstantVector(Constant *Val, bool UseSplat) const {
3964 unsigned ExtractIdx = UINT_MAX;
3966 // If we cannot determine where the constant must be, we have to
3967 // use a splat constant.
3968 Value *ValExtractIdx = Transition->getOperand(getTransitionIdx());
3969 if (ConstantInt *CstVal = dyn_cast<ConstantInt>(ValExtractIdx))
3970 ExtractIdx = CstVal->getSExtValue();
3975 unsigned End = getTransitionType()->getVectorNumElements();
3977 return ConstantVector::getSplat(End, Val);
3979 SmallVector<Constant *, 4> ConstVec;
3980 UndefValue *UndefVal = UndefValue::get(Val->getType());
3981 for (unsigned Idx = 0; Idx != End; ++Idx) {
3982 if (Idx == ExtractIdx)
3983 ConstVec.push_back(Val);
3985 ConstVec.push_back(UndefVal);
3987 return ConstantVector::get(ConstVec);
3990 /// \brief Check if promoting to a vector type an operand at \p OperandIdx
3991 /// in \p Use can trigger undefined behavior.
3992 static bool canCauseUndefinedBehavior(const Instruction *Use,
3993 unsigned OperandIdx) {
3994 // This is not safe to introduce undef when the operand is on
3995 // the right hand side of a division-like instruction.
3996 if (OperandIdx != 1)
3998 switch (Use->getOpcode()) {
4001 case Instruction::SDiv:
4002 case Instruction::UDiv:
4003 case Instruction::SRem:
4004 case Instruction::URem:
4006 case Instruction::FDiv:
4007 case Instruction::FRem:
4008 return !Use->hasNoNaNs();
4010 llvm_unreachable(nullptr);
4014 VectorPromoteHelper(const TargetLowering &TLI, const TargetTransformInfo &TTI,
4015 Instruction *Transition, unsigned CombineCost)
4016 : TLI(TLI), TTI(TTI), Transition(Transition),
4017 StoreExtractCombineCost(CombineCost), CombineInst(nullptr) {
4018 assert(Transition && "Do not know how to promote null");
4021 /// \brief Check if we can promote \p ToBePromoted to \p Type.
4022 bool canPromote(const Instruction *ToBePromoted) const {
4023 // We could support CastInst too.
4024 return isa<BinaryOperator>(ToBePromoted);
4027 /// \brief Check if it is profitable to promote \p ToBePromoted
4028 /// by moving downward the transition through.
4029 bool shouldPromote(const Instruction *ToBePromoted) const {
4030 // Promote only if all the operands can be statically expanded.
4031 // Indeed, we do not want to introduce any new kind of transitions.
4032 for (const Use &U : ToBePromoted->operands()) {
4033 const Value *Val = U.get();
4034 if (Val == getEndOfTransition()) {
4035 // If the use is a division and the transition is on the rhs,
4036 // we cannot promote the operation, otherwise we may create a
4037 // division by zero.
4038 if (canCauseUndefinedBehavior(ToBePromoted, U.getOperandNo()))
4042 if (!isa<ConstantInt>(Val) && !isa<UndefValue>(Val) &&
4043 !isa<ConstantFP>(Val))
4046 // Check that the resulting operation is legal.
4047 int ISDOpcode = TLI.InstructionOpcodeToISD(ToBePromoted->getOpcode());
4050 return StressStoreExtract ||
4051 TLI.isOperationLegalOrCustom(
4052 ISDOpcode, TLI.getValueType(getTransitionType(), true));
4055 /// \brief Check whether or not \p Use can be combined
4056 /// with the transition.
4057 /// I.e., is it possible to do Use(Transition) => AnotherUse?
4058 bool canCombine(const Instruction *Use) { return isa<StoreInst>(Use); }
4060 /// \brief Record \p ToBePromoted as part of the chain to be promoted.
4061 void enqueueForPromotion(Instruction *ToBePromoted) {
4062 InstsToBePromoted.push_back(ToBePromoted);
4065 /// \brief Set the instruction that will be combined with the transition.
4066 void recordCombineInstruction(Instruction *ToBeCombined) {
4067 assert(canCombine(ToBeCombined) && "Unsupported instruction to combine");
4068 CombineInst = ToBeCombined;
4071 /// \brief Promote all the instructions enqueued for promotion if it is
4073 /// \return True if the promotion happened, false otherwise.
4075 // Check if there is something to promote.
4076 // Right now, if we do not have anything to combine with,
4077 // we assume the promotion is not profitable.
4078 if (InstsToBePromoted.empty() || !CombineInst)
4082 if (!StressStoreExtract && !isProfitableToPromote())
4086 for (auto &ToBePromoted : InstsToBePromoted)
4087 promoteImpl(ToBePromoted);
4088 InstsToBePromoted.clear();
4092 } // End of anonymous namespace.
4094 void VectorPromoteHelper::promoteImpl(Instruction *ToBePromoted) {
4095 // At this point, we know that all the operands of ToBePromoted but Def
4096 // can be statically promoted.
4097 // For Def, we need to use its parameter in ToBePromoted:
4098 // b = ToBePromoted ty1 a
4099 // Def = Transition ty1 b to ty2
4100 // Move the transition down.
4101 // 1. Replace all uses of the promoted operation by the transition.
4102 // = ... b => = ... Def.
4103 assert(ToBePromoted->getType() == Transition->getType() &&
4104 "The type of the result of the transition does not match "
4106 ToBePromoted->replaceAllUsesWith(Transition);
4107 // 2. Update the type of the uses.
4108 // b = ToBePromoted ty2 Def => b = ToBePromoted ty1 Def.
4109 Type *TransitionTy = getTransitionType();
4110 ToBePromoted->mutateType(TransitionTy);
4111 // 3. Update all the operands of the promoted operation with promoted
4113 // b = ToBePromoted ty1 Def => b = ToBePromoted ty1 a.
4114 for (Use &U : ToBePromoted->operands()) {
4115 Value *Val = U.get();
4116 Value *NewVal = nullptr;
4117 if (Val == Transition)
4118 NewVal = Transition->getOperand(getTransitionOriginalValueIdx());
4119 else if (isa<UndefValue>(Val) || isa<ConstantInt>(Val) ||
4120 isa<ConstantFP>(Val)) {
4121 // Use a splat constant if it is not safe to use undef.
4122 NewVal = getConstantVector(
4123 cast<Constant>(Val),
4124 isa<UndefValue>(Val) ||
4125 canCauseUndefinedBehavior(ToBePromoted, U.getOperandNo()));
4127 llvm_unreachable("Did you modified shouldPromote and forgot to update "
4129 ToBePromoted->setOperand(U.getOperandNo(), NewVal);
4131 Transition->removeFromParent();
4132 Transition->insertAfter(ToBePromoted);
4133 Transition->setOperand(getTransitionOriginalValueIdx(), ToBePromoted);
4136 /// Some targets can do store(extractelement) with one instruction.
4137 /// Try to push the extractelement towards the stores when the target
4138 /// has this feature and this is profitable.
4139 bool CodeGenPrepare::OptimizeExtractElementInst(Instruction *Inst) {
4140 unsigned CombineCost = UINT_MAX;
4141 if (DisableStoreExtract || !TLI ||
4142 (!StressStoreExtract &&
4143 !TLI->canCombineStoreAndExtract(Inst->getOperand(0)->getType(),
4144 Inst->getOperand(1), CombineCost)))
4147 // At this point we know that Inst is a vector to scalar transition.
4148 // Try to move it down the def-use chain, until:
4149 // - We can combine the transition with its single use
4150 // => we got rid of the transition.
4151 // - We escape the current basic block
4152 // => we would need to check that we are moving it at a cheaper place and
4153 // we do not do that for now.
4154 BasicBlock *Parent = Inst->getParent();
4155 DEBUG(dbgs() << "Found an interesting transition: " << *Inst << '\n');
4156 VectorPromoteHelper VPH(*TLI, *TTI, Inst, CombineCost);
4157 // If the transition has more than one use, assume this is not going to be
4159 while (Inst->hasOneUse()) {
4160 Instruction *ToBePromoted = cast<Instruction>(*Inst->user_begin());
4161 DEBUG(dbgs() << "Use: " << *ToBePromoted << '\n');
4163 if (ToBePromoted->getParent() != Parent) {
4164 DEBUG(dbgs() << "Instruction to promote is in a different block ("
4165 << ToBePromoted->getParent()->getName()
4166 << ") than the transition (" << Parent->getName() << ").\n");
4170 if (VPH.canCombine(ToBePromoted)) {
4171 DEBUG(dbgs() << "Assume " << *Inst << '\n'
4172 << "will be combined with: " << *ToBePromoted << '\n');
4173 VPH.recordCombineInstruction(ToBePromoted);
4174 bool Changed = VPH.promote();
4175 NumStoreExtractExposed += Changed;
4179 DEBUG(dbgs() << "Try promoting.\n");
4180 if (!VPH.canPromote(ToBePromoted) || !VPH.shouldPromote(ToBePromoted))
4183 DEBUG(dbgs() << "Promoting is possible... Enqueue for promotion!\n");
4185 VPH.enqueueForPromotion(ToBePromoted);
4186 Inst = ToBePromoted;
4191 bool CodeGenPrepare::OptimizeInst(Instruction *I, bool& ModifiedDT) {
4192 if (PHINode *P = dyn_cast<PHINode>(I)) {
4193 // It is possible for very late stage optimizations (such as SimplifyCFG)
4194 // to introduce PHI nodes too late to be cleaned up. If we detect such a
4195 // trivial PHI, go ahead and zap it here.
4196 if (Value *V = SimplifyInstruction(P, TLI ? TLI->getDataLayout() : nullptr,
4198 P->replaceAllUsesWith(V);
4199 P->eraseFromParent();
4206 if (CastInst *CI = dyn_cast<CastInst>(I)) {
4207 // If the source of the cast is a constant, then this should have
4208 // already been constant folded. The only reason NOT to constant fold
4209 // it is if something (e.g. LSR) was careful to place the constant
4210 // evaluation in a block other than then one that uses it (e.g. to hoist
4211 // the address of globals out of a loop). If this is the case, we don't
4212 // want to forward-subst the cast.
4213 if (isa<Constant>(CI->getOperand(0)))
4216 if (TLI && OptimizeNoopCopyExpression(CI, *TLI))
4219 if (isa<ZExtInst>(I) || isa<SExtInst>(I)) {
4220 /// Sink a zext or sext into its user blocks if the target type doesn't
4221 /// fit in one register
4222 if (TLI && TLI->getTypeAction(CI->getContext(),
4223 TLI->getValueType(CI->getType())) ==
4224 TargetLowering::TypeExpandInteger) {
4225 return SinkCast(CI);
4227 bool MadeChange = MoveExtToFormExtLoad(I);
4228 return MadeChange | OptimizeExtUses(I);
4234 if (CmpInst *CI = dyn_cast<CmpInst>(I))
4235 if (!TLI || !TLI->hasMultipleConditionRegisters())
4236 return OptimizeCmpExpression(CI);
4238 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
4240 return OptimizeMemoryInst(I, I->getOperand(0), LI->getType());
4244 if (StoreInst *SI = dyn_cast<StoreInst>(I)) {
4246 return OptimizeMemoryInst(I, SI->getOperand(1),
4247 SI->getOperand(0)->getType());
4251 BinaryOperator *BinOp = dyn_cast<BinaryOperator>(I);
4253 if (BinOp && (BinOp->getOpcode() == Instruction::AShr ||
4254 BinOp->getOpcode() == Instruction::LShr)) {
4255 ConstantInt *CI = dyn_cast<ConstantInt>(BinOp->getOperand(1));
4256 if (TLI && CI && TLI->hasExtractBitsInsn())
4257 return OptimizeExtractBits(BinOp, CI, *TLI);
4262 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) {
4263 if (GEPI->hasAllZeroIndices()) {
4264 /// The GEP operand must be a pointer, so must its result -> BitCast
4265 Instruction *NC = new BitCastInst(GEPI->getOperand(0), GEPI->getType(),
4266 GEPI->getName(), GEPI);
4267 GEPI->replaceAllUsesWith(NC);
4268 GEPI->eraseFromParent();
4270 OptimizeInst(NC, ModifiedDT);
4276 if (CallInst *CI = dyn_cast<CallInst>(I))
4277 return OptimizeCallInst(CI, ModifiedDT);
4279 if (SelectInst *SI = dyn_cast<SelectInst>(I))
4280 return OptimizeSelectInst(SI);
4282 if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(I))
4283 return OptimizeShuffleVectorInst(SVI);
4285 if (isa<ExtractElementInst>(I))
4286 return OptimizeExtractElementInst(I);
4291 // In this pass we look for GEP and cast instructions that are used
4292 // across basic blocks and rewrite them to improve basic-block-at-a-time
4294 bool CodeGenPrepare::OptimizeBlock(BasicBlock &BB, bool& ModifiedDT) {
4296 bool MadeChange = false;
4298 CurInstIterator = BB.begin();
4299 while (CurInstIterator != BB.end()) {
4300 MadeChange |= OptimizeInst(CurInstIterator++, ModifiedDT);
4304 MadeChange |= DupRetToEnableTailCallOpts(&BB);
4309 // llvm.dbg.value is far away from the value then iSel may not be able
4310 // handle it properly. iSel will drop llvm.dbg.value if it can not
4311 // find a node corresponding to the value.
4312 bool CodeGenPrepare::PlaceDbgValues(Function &F) {
4313 bool MadeChange = false;
4314 for (BasicBlock &BB : F) {
4315 Instruction *PrevNonDbgInst = nullptr;
4316 for (BasicBlock::iterator BI = BB.begin(), BE = BB.end(); BI != BE;) {
4317 Instruction *Insn = BI++;
4318 DbgValueInst *DVI = dyn_cast<DbgValueInst>(Insn);
4319 // Leave dbg.values that refer to an alloca alone. These
4320 // instrinsics describe the address of a variable (= the alloca)
4321 // being taken. They should not be moved next to the alloca
4322 // (and to the beginning of the scope), but rather stay close to
4323 // where said address is used.
4324 if (!DVI || (DVI->getValue() && isa<AllocaInst>(DVI->getValue()))) {
4325 PrevNonDbgInst = Insn;
4329 Instruction *VI = dyn_cast_or_null<Instruction>(DVI->getValue());
4330 if (VI && VI != PrevNonDbgInst && !VI->isTerminator()) {
4331 DEBUG(dbgs() << "Moving Debug Value before :\n" << *DVI << ' ' << *VI);
4332 DVI->removeFromParent();
4333 if (isa<PHINode>(VI))
4334 DVI->insertBefore(VI->getParent()->getFirstInsertionPt());
4336 DVI->insertAfter(VI);
4345 // If there is a sequence that branches based on comparing a single bit
4346 // against zero that can be combined into a single instruction, and the
4347 // target supports folding these into a single instruction, sink the
4348 // mask and compare into the branch uses. Do this before OptimizeBlock ->
4349 // OptimizeInst -> OptimizeCmpExpression, which perturbs the pattern being
4351 bool CodeGenPrepare::sinkAndCmp(Function &F) {
4352 if (!EnableAndCmpSinking)
4354 if (!TLI || !TLI->isMaskAndBranchFoldingLegal())
4356 bool MadeChange = false;
4357 for (Function::iterator I = F.begin(), E = F.end(); I != E; ) {
4358 BasicBlock *BB = I++;
4360 // Does this BB end with the following?
4361 // %andVal = and %val, #single-bit-set
4362 // %icmpVal = icmp %andResult, 0
4363 // br i1 %cmpVal label %dest1, label %dest2"
4364 BranchInst *Brcc = dyn_cast<BranchInst>(BB->getTerminator());
4365 if (!Brcc || !Brcc->isConditional())
4367 ICmpInst *Cmp = dyn_cast<ICmpInst>(Brcc->getOperand(0));
4368 if (!Cmp || Cmp->getParent() != BB)
4370 ConstantInt *Zero = dyn_cast<ConstantInt>(Cmp->getOperand(1));
4371 if (!Zero || !Zero->isZero())
4373 Instruction *And = dyn_cast<Instruction>(Cmp->getOperand(0));
4374 if (!And || And->getOpcode() != Instruction::And || And->getParent() != BB)
4376 ConstantInt* Mask = dyn_cast<ConstantInt>(And->getOperand(1));
4377 if (!Mask || !Mask->getUniqueInteger().isPowerOf2())
4379 DEBUG(dbgs() << "found and; icmp ?,0; brcc\n"); DEBUG(BB->dump());
4381 // Push the "and; icmp" for any users that are conditional branches.
4382 // Since there can only be one branch use per BB, we don't need to keep
4383 // track of which BBs we insert into.
4384 for (Value::use_iterator UI = Cmp->use_begin(), E = Cmp->use_end();
4388 BranchInst *BrccUser = dyn_cast<BranchInst>(*UI);
4390 if (!BrccUser || !BrccUser->isConditional())
4392 BasicBlock *UserBB = BrccUser->getParent();
4393 if (UserBB == BB) continue;
4394 DEBUG(dbgs() << "found Brcc use\n");
4396 // Sink the "and; icmp" to use.
4398 BinaryOperator *NewAnd =
4399 BinaryOperator::CreateAnd(And->getOperand(0), And->getOperand(1), "",
4402 CmpInst::Create(Cmp->getOpcode(), Cmp->getPredicate(), NewAnd, Zero,
4406 DEBUG(BrccUser->getParent()->dump());
4412 /// \brief Retrieve the probabilities of a conditional branch. Returns true on
4413 /// success, or returns false if no or invalid metadata was found.
4414 static bool extractBranchMetadata(BranchInst *BI,
4415 uint64_t &ProbTrue, uint64_t &ProbFalse) {
4416 assert(BI->isConditional() &&
4417 "Looking for probabilities on unconditional branch?");
4418 auto *ProfileData = BI->getMetadata(LLVMContext::MD_prof);
4419 if (!ProfileData || ProfileData->getNumOperands() != 3)
4422 const auto *CITrue =
4423 mdconst::dyn_extract<ConstantInt>(ProfileData->getOperand(1));
4424 const auto *CIFalse =
4425 mdconst::dyn_extract<ConstantInt>(ProfileData->getOperand(2));
4426 if (!CITrue || !CIFalse)
4429 ProbTrue = CITrue->getValue().getZExtValue();
4430 ProbFalse = CIFalse->getValue().getZExtValue();
4435 /// \brief Scale down both weights to fit into uint32_t.
4436 static void scaleWeights(uint64_t &NewTrue, uint64_t &NewFalse) {
4437 uint64_t NewMax = (NewTrue > NewFalse) ? NewTrue : NewFalse;
4438 uint32_t Scale = (NewMax / UINT32_MAX) + 1;
4439 NewTrue = NewTrue / Scale;
4440 NewFalse = NewFalse / Scale;
4443 /// \brief Some targets prefer to split a conditional branch like:
4445 /// %0 = icmp ne i32 %a, 0
4446 /// %1 = icmp ne i32 %b, 0
4447 /// %or.cond = or i1 %0, %1
4448 /// br i1 %or.cond, label %TrueBB, label %FalseBB
4450 /// into multiple branch instructions like:
4453 /// %0 = icmp ne i32 %a, 0
4454 /// br i1 %0, label %TrueBB, label %bb2
4456 /// %1 = icmp ne i32 %b, 0
4457 /// br i1 %1, label %TrueBB, label %FalseBB
4459 /// This usually allows instruction selection to do even further optimizations
4460 /// and combine the compare with the branch instruction. Currently this is
4461 /// applied for targets which have "cheap" jump instructions.
4463 /// FIXME: Remove the (equivalent?) implementation in SelectionDAG.
4465 bool CodeGenPrepare::splitBranchCondition(Function &F) {
4466 if (!TM || TM->Options.EnableFastISel != true ||
4467 !TLI || TLI->isJumpExpensive())
4470 bool MadeChange = false;
4471 for (auto &BB : F) {
4472 // Does this BB end with the following?
4473 // %cond1 = icmp|fcmp|binary instruction ...
4474 // %cond2 = icmp|fcmp|binary instruction ...
4475 // %cond.or = or|and i1 %cond1, cond2
4476 // br i1 %cond.or label %dest1, label %dest2"
4477 BinaryOperator *LogicOp;
4478 BasicBlock *TBB, *FBB;
4479 if (!match(BB.getTerminator(), m_Br(m_OneUse(m_BinOp(LogicOp)), TBB, FBB)))
4483 Value *Cond1, *Cond2;
4484 if (match(LogicOp, m_And(m_OneUse(m_Value(Cond1)),
4485 m_OneUse(m_Value(Cond2)))))
4486 Opc = Instruction::And;
4487 else if (match(LogicOp, m_Or(m_OneUse(m_Value(Cond1)),
4488 m_OneUse(m_Value(Cond2)))))
4489 Opc = Instruction::Or;
4493 if (!match(Cond1, m_CombineOr(m_Cmp(), m_BinOp())) ||
4494 !match(Cond2, m_CombineOr(m_Cmp(), m_BinOp())) )
4497 DEBUG(dbgs() << "Before branch condition splitting\n"; BB.dump());
4500 auto *InsertBefore = std::next(Function::iterator(BB))
4501 .getNodePtrUnchecked();
4502 auto TmpBB = BasicBlock::Create(BB.getContext(),
4503 BB.getName() + ".cond.split",
4504 BB.getParent(), InsertBefore);
4506 // Update original basic block by using the first condition directly by the
4507 // branch instruction and removing the no longer needed and/or instruction.
4508 auto *Br1 = cast<BranchInst>(BB.getTerminator());
4509 Br1->setCondition(Cond1);
4510 LogicOp->eraseFromParent();
4512 // Depending on the conditon we have to either replace the true or the false
4513 // successor of the original branch instruction.
4514 if (Opc == Instruction::And)
4515 Br1->setSuccessor(0, TmpBB);
4517 Br1->setSuccessor(1, TmpBB);
4519 // Fill in the new basic block.
4520 auto *Br2 = IRBuilder<>(TmpBB).CreateCondBr(Cond2, TBB, FBB);
4521 if (auto *I = dyn_cast<Instruction>(Cond2)) {
4522 I->removeFromParent();
4523 I->insertBefore(Br2);
4526 // Update PHI nodes in both successors. The original BB needs to be
4527 // replaced in one succesor's PHI nodes, because the branch comes now from
4528 // the newly generated BB (NewBB). In the other successor we need to add one
4529 // incoming edge to the PHI nodes, because both branch instructions target
4530 // now the same successor. Depending on the original branch condition
4531 // (and/or) we have to swap the successors (TrueDest, FalseDest), so that
4532 // we perfrom the correct update for the PHI nodes.
4533 // This doesn't change the successor order of the just created branch
4534 // instruction (or any other instruction).
4535 if (Opc == Instruction::Or)
4536 std::swap(TBB, FBB);
4538 // Replace the old BB with the new BB.
4539 for (auto &I : *TBB) {
4540 PHINode *PN = dyn_cast<PHINode>(&I);
4544 while ((i = PN->getBasicBlockIndex(&BB)) >= 0)
4545 PN->setIncomingBlock(i, TmpBB);
4548 // Add another incoming edge form the new BB.
4549 for (auto &I : *FBB) {
4550 PHINode *PN = dyn_cast<PHINode>(&I);
4553 auto *Val = PN->getIncomingValueForBlock(&BB);
4554 PN->addIncoming(Val, TmpBB);
4557 // Update the branch weights (from SelectionDAGBuilder::
4558 // FindMergedConditions).
4559 if (Opc == Instruction::Or) {
4560 // Codegen X | Y as:
4569 // We have flexibility in setting Prob for BB1 and Prob for NewBB.
4570 // The requirement is that
4571 // TrueProb for BB1 + (FalseProb for BB1 * TrueProb for TmpBB)
4572 // = TrueProb for orignal BB.
4573 // Assuming the orignal weights are A and B, one choice is to set BB1's
4574 // weights to A and A+2B, and set TmpBB's weights to A and 2B. This choice
4576 // TrueProb for BB1 == FalseProb for BB1 * TrueProb for TmpBB.
4577 // Another choice is to assume TrueProb for BB1 equals to TrueProb for
4578 // TmpBB, but the math is more complicated.
4579 uint64_t TrueWeight, FalseWeight;
4580 if (extractBranchMetadata(Br1, TrueWeight, FalseWeight)) {
4581 uint64_t NewTrueWeight = TrueWeight;
4582 uint64_t NewFalseWeight = TrueWeight + 2 * FalseWeight;
4583 scaleWeights(NewTrueWeight, NewFalseWeight);
4584 Br1->setMetadata(LLVMContext::MD_prof, MDBuilder(Br1->getContext())
4585 .createBranchWeights(TrueWeight, FalseWeight));
4587 NewTrueWeight = TrueWeight;
4588 NewFalseWeight = 2 * FalseWeight;
4589 scaleWeights(NewTrueWeight, NewFalseWeight);
4590 Br2->setMetadata(LLVMContext::MD_prof, MDBuilder(Br2->getContext())
4591 .createBranchWeights(TrueWeight, FalseWeight));
4594 // Codegen X & Y as:
4602 // This requires creation of TmpBB after CurBB.
4604 // We have flexibility in setting Prob for BB1 and Prob for TmpBB.
4605 // The requirement is that
4606 // FalseProb for BB1 + (TrueProb for BB1 * FalseProb for TmpBB)
4607 // = FalseProb for orignal BB.
4608 // Assuming the orignal weights are A and B, one choice is to set BB1's
4609 // weights to 2A+B and B, and set TmpBB's weights to 2A and B. This choice
4611 // FalseProb for BB1 == TrueProb for BB1 * FalseProb for TmpBB.
4612 uint64_t TrueWeight, FalseWeight;
4613 if (extractBranchMetadata(Br1, TrueWeight, FalseWeight)) {
4614 uint64_t NewTrueWeight = 2 * TrueWeight + FalseWeight;
4615 uint64_t NewFalseWeight = FalseWeight;
4616 scaleWeights(NewTrueWeight, NewFalseWeight);
4617 Br1->setMetadata(LLVMContext::MD_prof, MDBuilder(Br1->getContext())
4618 .createBranchWeights(TrueWeight, FalseWeight));
4620 NewTrueWeight = 2 * TrueWeight;
4621 NewFalseWeight = FalseWeight;
4622 scaleWeights(NewTrueWeight, NewFalseWeight);
4623 Br2->setMetadata(LLVMContext::MD_prof, MDBuilder(Br2->getContext())
4624 .createBranchWeights(TrueWeight, FalseWeight));
4628 // Request DOM Tree update.
4629 // Note: No point in getting fancy here, since the DT info is never
4630 // available to CodeGenPrepare and the existing update code is broken
4636 DEBUG(dbgs() << "After branch condition splitting\n"; BB.dump();