diff options
| author | Duncan P. N. Exon Smith <dexonsmith@apple.com> | 2015-11-07 00:01:16 +0000 |
|---|---|---|
| committer | Duncan P. N. Exon Smith <dexonsmith@apple.com> | 2015-11-07 00:01:16 +0000 |
| commit | 83c4b687205e4e81da0602865fbc24350831cf6a (patch) | |
| tree | 0f99c9543b34f6f8a3133666c196ad2686fcdb1b /llvm/lib | |
| parent | 27f2447fb32ed08b45dba7bad8260cd5312a5132 (diff) | |
| download | bcm5719-llvm-83c4b687205e4e81da0602865fbc24350831cf6a.tar.gz bcm5719-llvm-83c4b687205e4e81da0602865fbc24350831cf6a.zip | |
ADT: Remove last implicit ilist iterator conversions, NFC
Some implicit ilist iterator conversions have crept back into Analysis,
Transforms, Hexagon, and llvm-stress. This removes them.
I'll commit a patch immediately after this to disallow them (in a
separate patch so that it's easy to revert if necessary).
llvm-svn: 252371
Diffstat (limited to 'llvm/lib')
| -rw-r--r-- | llvm/lib/Analysis/ScalarEvolutionExpander.cpp | 6 | ||||
| -rw-r--r-- | llvm/lib/Target/Hexagon/BitTracker.cpp | 2 | ||||
| -rw-r--r-- | llvm/lib/Transforms/IPO/FunctionAttrs.cpp | 2 | ||||
| -rw-r--r-- | llvm/lib/Transforms/Scalar/LoopLoadElimination.cpp | 2 | ||||
| -rw-r--r-- | llvm/lib/Transforms/Utils/SimplifyCFG.cpp | 9 |
5 files changed, 11 insertions, 10 deletions
diff --git a/llvm/lib/Analysis/ScalarEvolutionExpander.cpp b/llvm/lib/Analysis/ScalarEvolutionExpander.cpp index b3b04ad148f..d763ca4c132 100644 --- a/llvm/lib/Analysis/ScalarEvolutionExpander.cpp +++ b/llvm/lib/Analysis/ScalarEvolutionExpander.cpp @@ -101,11 +101,11 @@ static BasicBlock::iterator findInsertPointAfter(Instruction *I, if (isa<LandingPadInst>(IP) || isa<CleanupPadInst>(IP)) { ++IP; } else if (auto *TPI = dyn_cast<TerminatePadInst>(IP)) { - IP = TPI->getUnwindDest()->getFirstNonPHI(); + IP = TPI->getUnwindDest()->getFirstNonPHI()->getIterator(); } else if (auto *CEPI = dyn_cast<CatchEndPadInst>(IP)) { - IP = CEPI->getUnwindDest()->getFirstNonPHI(); + IP = CEPI->getUnwindDest()->getFirstNonPHI()->getIterator(); } else if (auto *CEPI = dyn_cast<CleanupEndPadInst>(IP)) { - IP = CEPI->getUnwindDest()->getFirstNonPHI(); + IP = CEPI->getUnwindDest()->getFirstNonPHI()->getIterator(); } else if (isa<CatchPadInst>(IP)) { IP = MustDominate->getFirstInsertionPt(); } else { diff --git a/llvm/lib/Target/Hexagon/BitTracker.cpp b/llvm/lib/Target/Hexagon/BitTracker.cpp index 23336b6546e..ea96eb0ee10 100644 --- a/llvm/lib/Target/Hexagon/BitTracker.cpp +++ b/llvm/lib/Target/Hexagon/BitTracker.cpp @@ -1106,7 +1106,7 @@ void BT::run() { if (It == End) { MachineFunction::const_iterator BIt = B.getIterator(); MachineFunction::const_iterator Next = std::next(BIt); - if (Next != MF.end() && B.isSuccessor(Next)) { + if (Next != MF.end() && B.isSuccessor(&*Next)) { int ThisN = B.getNumber(); int NextN = Next->getNumber(); FlowQ.push(CFGEdge(ThisN, NextN)); diff --git a/llvm/lib/Transforms/IPO/FunctionAttrs.cpp b/llvm/lib/Transforms/IPO/FunctionAttrs.cpp index bc7c98e2890..a9bc8e4c6de 100644 --- a/llvm/lib/Transforms/IPO/FunctionAttrs.cpp +++ b/llvm/lib/Transforms/IPO/FunctionAttrs.cpp @@ -335,7 +335,7 @@ struct ArgumentUsesTracker : public CaptureTracker { return true; } - Uses.push_back(std::next(F->arg_begin(), UseIndex)); + Uses.push_back(&*std::next(F->arg_begin(), UseIndex)); return false; } diff --git a/llvm/lib/Transforms/Scalar/LoopLoadElimination.cpp b/llvm/lib/Transforms/Scalar/LoopLoadElimination.cpp index eb64fbff1d3..e0456a2110d 100644 --- a/llvm/lib/Transforms/Scalar/LoopLoadElimination.cpp +++ b/llvm/lib/Transforms/Scalar/LoopLoadElimination.cpp @@ -373,7 +373,7 @@ public: Value *Initial = new LoadInst(InitialPtr, "load_initial", PH->getTerminator()); PHINode *PHI = PHINode::Create(Initial->getType(), 2, "store_forwarded", - L->getHeader()->begin()); + &L->getHeader()->front()); PHI->addIncoming(Initial, PH); PHI->addIncoming(Cand.Store->getOperand(0), L->getLoopLatch()); diff --git a/llvm/lib/Transforms/Utils/SimplifyCFG.cpp b/llvm/lib/Transforms/Utils/SimplifyCFG.cpp index 25b83e256a6..e0c598f92e2 100644 --- a/llvm/lib/Transforms/Utils/SimplifyCFG.cpp +++ b/llvm/lib/Transforms/Utils/SimplifyCFG.cpp @@ -2400,7 +2400,7 @@ static Value *ensureValueAvailableInSuccessor(Value *V, BasicBlock *BB, if (PHI) return PHI; - PHI = PHINode::Create(V->getType(), 2, "simplifycfg.merge", Succ->begin()); + PHI = PHINode::Create(V->getType(), 2, "simplifycfg.merge", &Succ->front()); PHI->addIncoming(V, BB); for (BasicBlock *PredBB : predecessors(Succ)) if (PredBB != BB) @@ -2500,8 +2500,8 @@ static bool mergeConditionalStoreToAddress(BasicBlock *PTB, BasicBlock *PFB, Value *QPHI = ensureValueAvailableInSuccessor(QStore->getValueOperand(), QStore->getParent(), PPHI); - IRBuilder<> QB(PostBB->getFirstInsertionPt()); - + IRBuilder<> QB(&*PostBB->getFirstInsertionPt()); + Value *PPred = PStore->getParent() == PTB ? PCond : QB.CreateNot(PCond); Value *QPred = QStore->getParent() == QTB ? QCond : QB.CreateNot(QCond); @@ -2511,7 +2511,8 @@ static bool mergeConditionalStoreToAddress(BasicBlock *PTB, BasicBlock *PFB, QPred = QB.CreateNot(QPred); Value *CombinedPred = QB.CreateOr(PPred, QPred); - auto *T = SplitBlockAndInsertIfThen(CombinedPred, QB.GetInsertPoint(), false); + auto *T = + SplitBlockAndInsertIfThen(CombinedPred, &*QB.GetInsertPoint(), false); QB.SetInsertPoint(T); StoreInst *SI = cast<StoreInst>(QB.CreateStore(QPHI, Address)); AAMDNodes AAMD; |

