llvm.org GIT mirror llvm / 5013c51
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). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@252371 91177308-0d34-0410-b5e6-96231b3b80d8 Duncan P. N. Exon Smith 3 years ago
6 changed file(s) with 12 addition(s) and 11 deletion(s). Raw diff Collapse all Expand all
100100 if (isa(IP) || isa(IP)) {
101101 ++IP;
102102 } else if (auto *TPI = dyn_cast(IP)) {
103 IP = TPI->getUnwindDest()->getFirstNonPHI();
103 IP = TPI->getUnwindDest()->getFirstNonPHI()->getIterator();
104104 } else if (auto *CEPI = dyn_cast(IP)) {
105 IP = CEPI->getUnwindDest()->getFirstNonPHI();
105 IP = CEPI->getUnwindDest()->getFirstNonPHI()->getIterator();
106106 } else if (auto *CEPI = dyn_cast(IP)) {
107 IP = CEPI->getUnwindDest()->getFirstNonPHI();
107 IP = CEPI->getUnwindDest()->getFirstNonPHI()->getIterator();
108108 } else if (isa(IP)) {
109109 IP = MustDominate->getFirstInsertionPt();
110110 } else {
11051105 if (It == End) {
11061106 MachineFunction::const_iterator BIt = B.getIterator();
11071107 MachineFunction::const_iterator Next = std::next(BIt);
1108 if (Next != MF.end() && B.isSuccessor(Next)) {
1108 if (Next != MF.end() && B.isSuccessor(&*Next)) {
11091109 int ThisN = B.getNumber();
11101110 int NextN = Next->getNumber();
11111111 FlowQ.push(CFGEdge(ThisN, NextN));
334334 return true;
335335 }
336336
337 Uses.push_back(std::next(F->arg_begin(), UseIndex));
337 Uses.push_back(&*std::next(F->arg_begin(), UseIndex));
338338 return false;
339339 }
340340
372372 Value *Initial =
373373 new LoadInst(InitialPtr, "load_initial", PH->getTerminator());
374374 PHINode *PHI = PHINode::Create(Initial->getType(), 2, "store_forwarded",
375 L->getHeader()->begin());
375 &L->getHeader()->front());
376376 PHI->addIncoming(Initial, PH);
377377 PHI->addIncoming(Cand.Store->getOperand(0), L->getLoopLatch());
378378
23992399 if (PHI)
24002400 return PHI;
24012401
2402 PHI = PHINode::Create(V->getType(), 2, "simplifycfg.merge", Succ->begin());
2402 PHI = PHINode::Create(V->getType(), 2, "simplifycfg.merge", &Succ->front());
24032403 PHI->addIncoming(V, BB);
24042404 for (BasicBlock *PredBB : predecessors(Succ))
24052405 if (PredBB != BB)
24992499 Value *QPHI = ensureValueAvailableInSuccessor(QStore->getValueOperand(),
25002500 QStore->getParent(), PPHI);
25012501
2502 IRBuilder<> QB(PostBB->getFirstInsertionPt());
2503
2502 IRBuilder<> QB(&*PostBB->getFirstInsertionPt());
2503
25042504 Value *PPred = PStore->getParent() == PTB ? PCond : QB.CreateNot(PCond);
25052505 Value *QPred = QStore->getParent() == QTB ? QCond : QB.CreateNot(QCond);
25062506
25102510 QPred = QB.CreateNot(QPred);
25112511 Value *CombinedPred = QB.CreateOr(PPred, QPred);
25122512
2513 auto *T = SplitBlockAndInsertIfThen(CombinedPred, QB.GetInsertPoint(), false);
2513 auto *T =
2514 SplitBlockAndInsertIfThen(CombinedPred, &*QB.GetInsertPoint(), false);
25142515 QB.SetInsertPoint(T);
25152516 StoreInst *SI = cast(QB.CreateStore(QPHI, Address));
25162517 AAMDNodes AAMD;
665665
666666 for (auto *Instr : BoolInst) {
667667 BasicBlock *Curr = Instr->getParent();
668 BasicBlock::iterator Loc = Instr;
668 BasicBlock::iterator Loc = Instr->getIterator();
669669 BasicBlock *Next = Curr->splitBasicBlock(Loc, "CF");
670670 Instr->moveBefore(Curr->getTerminator());
671671 if (Curr != &F->getEntryBlock()) {