|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/STLExtras.h 561 return std::tuple<Iters...>(std::next(std::get<Ns>(iterators))...);
675 return std::next(I);
include/llvm/ADT/TinyPtrVector.h 341 if (std::next(From) == To) {
include/llvm/ADT/ilist.h 371 auto Next = std::next(N.getIterator());
include/llvm/ADT/iterator_range.h 65 return make_range(std::next(adl_begin(t), n), adl_end(t));
include/llvm/ADT/simple_ilist.h 213 auto Next = std::next(I);
244 splice(I, L2, Node, std::next(Node));
294 if (empty() || std::next(begin()) == end())
include/llvm/Analysis/BlockFrequencyInfoImpl.h 1144 auto Next = std::next(L);
include/llvm/CodeGen/MachineBasicBlock.h 672 return erase(I, std::next(I));
711 splice(Where, Other, From, std::next(From));
929 E(std::next(I)) {
934 return B == MBB.end() ? MBB.begin() : std::next(B);
include/llvm/CodeGen/MachineInstrBundleIterator.h 70 I = std::next(getBundleFinal(I));
96 I = getBundleBegin(std::next(I));
include/llvm/CodeGen/MachineOutliner.h 156 std::for_each(front(), std::next(back()),
include/llvm/CodeGen/SelectionDAGNodes.h 746 return !use_empty() && std::next(use_begin()) == use_end();
include/llvm/CodeGen/SlotIndexes.h 557 nextItr = std::next(prevItr);
608 std::next(MachineFunction::iterator(mbb));
include/llvm/IR/BasicBlock.h 318 PN = dyn_cast<PHINodeT>(std::next(BBIteratorT(PN)));
include/llvm/IR/Instructions.h 3087 succ_op_iterator(std::next(value_op_begin(), isConditional() ? 1 : 0)),
3093 std::next(value_op_begin(), isConditional() ? 1 : 0)),
3625 return make_range(succ_op_iterator(std::next(value_op_begin())),
3630 return make_range(const_succ_op_iterator(std::next(value_op_begin())),
include/llvm/Support/Allocator.h 209 DeallocateSlabs(std::next(Slabs.begin()), Slabs.end());
210 Slabs.erase(std::next(Slabs.begin()), Slabs.end());
include/llvm/Support/Automaton.h 111 Heads.erase(Heads.begin(), std::next(Heads.begin(), NumHeads));
lib/Analysis/AliasSetTracker.cpp 271 if (std::next(begin()) != end())
277 if (std::next(Addr->user_begin()) != Addr->user_end())
lib/Analysis/BlockFrequencyInfoImpl.cpp 789 return make_range(std::next(Prev), Insert);
lib/Analysis/CGSCCPassManager.cpp 408 for (SCC &NewC : llvm::reverse(make_range(std::next(NewSCCRange.begin()),
565 for (RefSCC *NewRC : llvm::reverse(make_range(std::next(NewRefSCCs.begin()),
lib/Analysis/LazyValueInfo.cpp 846 for (Instruction &I : make_range(std::next(BBI->getIterator().getReverse()),
lib/Analysis/LoopAccessAnalysis.cpp 1661 (AIIsWrite ? AI : std::next(AI));
1669 I2 = (OI == AI ? std::next(I1) : Accesses[*OI].begin()),
lib/Analysis/MemorySSA.cpp 785 for (auto I = std::next(Dom), E = Paths.end(); I != E; ++I)
1213 auto Next = std::next(AI);
lib/Analysis/MustExecute.cpp 60 for (Loop::block_iterator BB = std::next(CurLoop->block_begin()),
lib/Analysis/OrderedBasicBlock.cpp 46 II = std::next(LastInstFound);
lib/Analysis/ScalarEvolution.cpp 305 if (std::next(I) != E)
lib/Analysis/ScalarEvolutionExpander.cpp 990 BasicBlock::iterator NewInsertPt = std::next(It);
1856 InsertPt = &*std::next(InsertPt->getIterator());
lib/Analysis/ValueTracking.cpp 555 for (auto I = std::next(BasicBlock::const_iterator(Inv)),
570 std::next(BasicBlock::const_iterator(CxtI)), IE(Inv);
lib/Analysis/VectorUtils.cpp 938 for (auto AI = std::next(BI); AI != E; ++AI) {
lib/Bitcode/Reader/MetadataLoader.cpp 540 Ops.append(std::next(DIExpr->elements_begin()),
566 std::move(std::next(Expr.begin()), End, Expr.begin());
lib/Bitcode/Writer/ValueEnumerator.cpp 249 if (!V->use_empty() && std::next(V->use_begin()) != V->use_end())
lib/CodeGen/AsmPrinter/AsmPrinter.cpp 960 auto I = std::next(MI.getIterator());
lib/CodeGen/AsmPrinter/DwarfDebug.cpp 556 auto I = std::next(CallMI->getReverseIterator());
1411 if (std::next(EI) == Entries.end()) {
1416 else if (std::next(EI)->isClobber())
1417 EndLabel = getLabelAfterInsn(std::next(EI)->getInstr());
1419 EndLabel = getLabelBeforeInsn(std::next(EI)->getInstr());
1476 auto PrevEntry = std::next(CurEntry);
lib/CodeGen/AsmPrinter/WinException.cpp 598 MachineFunction::const_iterator Stop = std::next(MF->begin());
lib/CodeGen/BranchFolding.cpp 518 MachineFunction::iterator I = std::next(MachineFunction::iterator(CurMBB));
1121 for (MachineFunction::iterator I = std::next(MF.begin()), E = MF.end();
1279 for (MachineFunction::iterator I = std::next(MF.begin()), E = MF.end();
1767 MachineBasicBlock *NextBB = &*std::next(MBB->getIterator());
lib/CodeGen/BranchRelaxation.cpp 384 MachineBasicBlock &NextBB = *std::next(MachineFunction::iterator(MBB));
403 FBB = &(*std::next(MachineFunction::iterator(MBB)));
512 Next = std::next(J);
lib/CodeGen/CodeGenPrepare.cpp 568 for (auto &Block : llvm::make_range(std::next(F.begin()), F.end()))
645 for (auto &Block : llvm::make_range(std::next(F.begin()), F.end()))
5352 NewBaseInsertPt = std::next(BaseI->getIterator());
5818 CurInstIterator = std::next(And->getIterator());
5954 CurInstIterator = std::next(LastSI->getIterator());
lib/CodeGen/GlobalISel/CombinerHelper.cpp 331 MachineOperand *PredBB = std::next(&UseMO);
339 Inserter(InsertBB, std::next(InsertPt), UseMO);
758 assert(std::next(BrIt) == MBB->end() && "expected G_BR to be a terminator");
1060 const auto &SrcMMO = **std::next(MI.memoperands_begin());
1164 const auto &SrcMMO = **std::next(MI.memoperands_begin());
lib/CodeGen/GlobalISel/IRTranslator.cpp 1128 for (auto AI = CI.arg_begin(), AE = CI.arg_end(); std::next(AI) != AE; ++AI)
lib/CodeGen/GlobalISel/InstructionSelect.cpp 114 const auto AfterIt = std::next(MII);
144 auto InsertedBegin = ReachedBegin ? MBB->begin() : std::next(MII);
lib/CodeGen/GlobalISel/InstructionSelector.cpp 78 std::next(MI.getIterator()) == IntoMI.getIterator())
lib/CodeGen/GlobalISel/Utils.cpp 62 BuildMI(MBB, std::next(InsertIt), InsertPt.getDebugLoc(),
lib/CodeGen/IfConversion.cpp 768 MachineBasicBlock::reverse_iterator RTIE = std::next(TIE.getReverse());
769 MachineBasicBlock::reverse_iterator RFIE = std::next(FIE.getReverse());
770 const MachineBasicBlock::reverse_iterator RTIB = std::next(TIB.getReverse());
771 const MachineBasicBlock::reverse_iterator RFIB = std::next(FIB.getReverse());
799 TIE = std::next(RTIE.getReverse());
800 FIE = std::next(RFIE.getReverse());
1438 MachineFunction::iterator I = std::next(PI);
lib/CodeGen/IndirectBrExpandPass.cpp 130 assert(std::find_if(std::next(BlockAddressUseIt), BB.use_end(),
lib/CodeGen/InlineSpiller.cpp 758 if (std::next(B) == E) {
945 BuildMI(MBB, std::next(MI), MI->getDebugLoc(), TII.get(TargetOpcode::KILL))
949 TII.storeRegToStackSlot(MBB, std::next(MI), NewVReg, isKill, StackSlot,
952 LIS.InsertMachineInstrRangeInMaps(std::next(MI), MIS.end());
954 LLVM_DEBUG(dumpMachineInstrRangeWithSlotIndex(std::next(MI), MIS.end(), LIS,
958 HSpiller.addToMergeableSpills(*std::next(MI), StackSlot, Original);
lib/CodeGen/InterleavedLoadCombinePass.cpp 1290 std::next(InterleavedLoad.begin()),
lib/CodeGen/LatencyPriorityQueue.cpp 123 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()),
lib/CodeGen/LiveDebugValues.cpp 881 auto NextI = std::next(MI.getIterator());
lib/CodeGen/LiveDebugVariables.cpp 1256 std::next(MachineBasicBlock::iterator(MI));
1278 return std::next(I);
lib/CodeGen/LiveInterval.cpp 164 iterator MergeTo = std::next(I);
180 segments().erase(std::next(I), MergeTo);
215 segments().erase(std::next(MergeTo), std::next(I));
215 segments().erase(std::next(MergeTo), std::next(I));
627 segments.insert(std::next(I), Segment(End, OldEnd, ValNo));
667 for (iterator I = std::next(OutIt), E = end(); I != E; ++I) {
1068 if (std::next(I) != E) {
1069 assert(I->end <= std::next(I)->start);
1070 if (I->end == std::next(I)->start)
1071 assert(I->valno != std::next(I)->valno);
lib/CodeGen/LiveIntervals.cpp 799 LiveRange::const_iterator N = std::next(RI);
1069 LiveRange::iterator Next = std::next(OldIdxIn);
1140 LiveRange::iterator INext = std::next(OldIdxOut);
1156 std::copy(std::next(OldIdxOut), E, OldIdxOut);
1170 std::copy(std::next(OldIdxOut), std::next(AfterNewIdx), OldIdxOut);
1170 std::copy(std::next(OldIdxOut), std::next(AfterNewIdx), OldIdxOut);
1206 std::copy(std::next(OldIdxOut), AfterNewIdx, OldIdxOut);
1245 OldIdxOut = std::next(OldIdxIn);
1291 SlotIndex NewDefEndPoint = std::next(NewIdxIn)->end;
1302 std::next(NewIdxOut)->start);
1317 LiveRange::iterator Next = std::next(NewSegment);
1349 std::copy_backward(NewIdxOut, OldIdxOut, std::next(OldIdxOut));
1374 std::copy_backward(NewIdxOut, OldIdxOut, std::next(OldIdxOut));
1394 assert((std::next(RI) == LIS.RegMaskSlots.end() ||
1395 SlotIndex::isEarlierInstr(*RI, *std::next(RI))) &&
lib/CodeGen/LiveRangeShrink.cpp 218 MachineBasicBlock::iterator I = std::next(Insert->getIterator());
221 I = std::next(I);
233 MachineBasicBlock::iterator EndIter = std::next(MI.getIterator());
lib/CodeGen/MIRParser/MIRParser.cpp 354 auto CallB = std::next(MF.begin(), MILoc.BlockNum);
360 auto CallI = std::next(CallB->instr_begin(), MILoc.Offset);
lib/CodeGen/MIRPrinter.cpp 593 MachineFunction::const_iterator NextI = std::next(MBB.getIterator());
lib/CodeGen/MachineBasicBlock.cpp 484 for (J = std::next(I); J != LiveIns.end() && J->PhysReg == PhysReg; ++J)
823 return std::next(I) == MachineFunction::const_iterator(MBB);
883 MF->insert(std::next(MachineFunction::iterator(this)), NMBB);
1018 std::next(MachineFunction::iterator(NMBB)) == getParent()->end();
lib/CodeGen/MachineBlockPlacement.cpp 962 auto SecondBestA = std::next(BestA);
963 auto SecondBestB = std::next(BestB);
2262 assert(std::next(ExitIt) != LoopChain.end() &&
2264 MachineBasicBlock *NextBlockInChain = *std::next(ExitIt);
2272 std::rotate(LoopChain.begin(), std::next(ExitIt), LoopChain.end());
2574 MachineFunction::iterator NextFI = std::next(FI);
2980 if (std::next(MF.begin()) == MF.end())
3071 for (auto MBI = std::next(MF.begin()), MBE = MF.end(); MBI != MBE; ++MBI) {
3136 if (std::next(F.begin()) == F.end())
lib/CodeGen/MachineCSE.cpp 299 MachineBasicBlock::const_iterator I = MI; I = std::next(I);
352 MachineBasicBlock::const_iterator I = CSMI; I = std::next(I);
lib/CodeGen/MachineCopyPropagation.cpp 453 make_range(Copy->getIterator(), std::next(MI.getIterator())))
lib/CodeGen/MachineFunction.cpp 506 if (std::next(I) != E)
lib/CodeGen/MachineInstrBundle.cpp 247 MachineBasicBlock::instr_iterator LastMI = std::next(FirstMI);
lib/CodeGen/MachineLoopInfo.cpp 73 MachineBasicBlock *NextMBB = &*std::next(BotMBB->getIterator());
76 if (BotMBB == &*std::next(BotMBB->getIterator()))
78 NextMBB = &*std::next(BotMBB->getIterator());
lib/CodeGen/MachineLoopUtils.cpp 22 return *std::next(BB->instr_begin(), Offset);
33 Preheader = *std::next(Loop->pred_begin());
36 Exit = *std::next(Loop->succ_begin());
42 MF.insert(std::next(Loop->getIterator()), NewBB);
lib/CodeGen/MachineOutliner.cpp 1138 for (auto I = FirstCand.front(), E = std::next(FirstCand.back()); I != E;
1267 std::for_each(CallInst, std::next(EndIt), CopyDefsAndUpdateCalls);
1273 MBB.erase(std::next(StartIt), std::next(EndIt));
1273 MBB.erase(std::next(StartIt), std::next(EndIt));
lib/CodeGen/MachinePipeliner.cpp 1606 RecRPTracker.setPos(std::next(CurInstI));
lib/CodeGen/MachineRegisterInfo.cpp 403 assert((I.atEnd() || std::next(I) == def_instr_end()) &&
414 if (std::next(I) != def_instr_end())
550 nextI = std::next(I); // I is invalidated by the setReg
lib/CodeGen/MachineScheduler.cpp 979 LiveRegionEnd = (RegionEnd == bb->end()) ? RegionEnd : std::next(RegionEnd);
lib/CodeGen/MachineSink.cpp 1151 MachineBasicBlock::iterator NI = std::next(MI->getIterator());
lib/CodeGen/MachineVerifier.cpp 2064 std::next(MRI->def_begin(Reg)) != MRI->def_end())
lib/CodeGen/ModuloSchedule.cpp 70 Preheader = *std::next(BB->pred_begin());
1286 PreheaderBB = *std::next(BB->pred_begin());
1657 I != std::next(B->getFirstNonPHI()->getReverseIterator());) {
1672 Exit = *std::next(BB->succ_begin());
1675 MF.insert(std::next(BB->getIterator()), NewBB);
lib/CodeGen/PHIElimination.cpp 244 MachineBasicBlock::iterator AfterPHIsIt = std::next(LastPHIIt);
lib/CodeGen/RegisterCoalescer.cpp 1280 std::next(MachineBasicBlock::iterator(CopyMI));
1489 MBB->splice(std::next(NewMI.getIterator()), UseMI->getParent(), UseMI);
lib/CodeGen/RegisterPressure.cpp 697 for (J = std::next(I); J != E && J->isValid(); ++J, ++I)
943 CurrPos = skipDebugInstructionsForward(std::next(CurrPos), MBB->end());
lib/CodeGen/RegisterScavenging.cpp 182 MBBI = std::next(MBBI);
411 Used.accumulate(*std::next(From));
606 RestoreAfter ? std::next(MBBI) : MBBI;
607 MachineBasicBlock::iterator ReloadBefore = std::next(ReloadAfter);
692 MachineBasicBlock::iterator N = std::next(I);
lib/CodeGen/ScheduleDAG.cpp 331 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E;
lib/CodeGen/ScheduleDAGInstrs.cpp 1142 MachineBasicBlock::instr_iterator I = std::next(Bundle);
lib/CodeGen/SelectionDAG/DAGCombiner.cpp17853 if (std::all_of(std::next(N->op_begin()), N->op_end(), [](const SDValue &Op) {
19644 std::all_of(std::next(Concat->op_begin()), Concat->op_end(),
lib/CodeGen/SelectionDAG/LegalizeVectorOps.cpp 182 E = std::prev(DAG.allnodes_end()); I != std::next(E); ++I) {
206 E = std::prev(DAG.allnodes_end()); I != std::next(E); ++I)
lib/CodeGen/SelectionDAG/ResourcePriorityQueue.cpp 593 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) {
603 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I)
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 1842 for (auto I = std::next(Q.begin()), E = Q.end(); I != E; ++I)
lib/CodeGen/SelectionDAG/ScheduleDAGSDNodes.cpp 863 MI = &*std::next(Before);
lib/CodeGen/SelectionDAG/SelectionDAGDumper.cpp 551 if (std::next(i) != e)
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 582 Def->getParent()->insert(std::next(InsertPos), MI);
1483 BI = std::next(BasicBlock::const_iterator(BeforeInst));
lib/CodeGen/SjLjEHPrepare.cpp 161 IRBuilder<> Builder(SelI->getParent(), std::next(SelI->getIterator()));
lib/CodeGen/SlotIndexes.cpp 135 MachineBasicBlock::instr_iterator Next = std::next(MI.getIterator());
lib/CodeGen/SplitKit.cpp 723 std::next(MachineBasicBlock::iterator(MI)));
785 std::next(MachineBasicBlock::iterator(MI)));
lib/CodeGen/StackMaps.cpp 276 for (auto II = std::next(I); II != E; ++II) {
310 parseOperand(MI.operands_begin(), std::next(MI.operands_begin()), Locations,
368 recordStackMapOpers(MI, ID, std::next(MI.operands_begin(), opers.getVarIdx()),
377 auto MOI = std::next(MI.operands_begin(), opers.getStackMapStartIdx());
lib/CodeGen/StackSlotColoring.cpp 442 MachineBasicBlock::iterator NextMI = std::next(I);
lib/CodeGen/TwoAddressInstructionPass.cpp 291 for (MachineInstr &OtherMI : make_range(std::next(OldPos), KillPos)) {
487 if (std::next(Begin) != MRI->def_end())
759 nmi = std::next(mi);
928 MachineBasicBlock::iterator AfterMI = std::next(Begin);
1003 End = std::next(MachineBasicBlock::iterator(MI));
1168 MachineBasicBlock::iterator To = std::next(From);
1705 MachineBasicBlock::iterator nmi = std::next(mi);
1859 std::next(MachineBasicBlock::iterator(MI));
lib/CodeGen/VirtRegMap.cpp 412 std::next(MI.getReverseIterator()), E = MBB.instr_rend();
458 BundleStart = &*std::next(BundledMI->getIterator());
lib/CodeGen/WasmEHPrepare.cpp 192 InstList.erase(std::next(BasicBlock::iterator(ThrowI)), InstList.end());
lib/DebugInfo/DWARF/DWARFUnit.cpp 116 I = std::next(this->insert(I, std::move(U)));
209 if (I != R.end() && std::next(I) == R.end())
lib/DebugInfo/PDB/Native/NativeEnumInjectedSources.cpp 108 return std::make_unique<NativeInjectedSource>(std::next(Stream.begin(), N)->second,
lib/ExecutionEngine/Orc/CompileOnDemandLayer.cpp 183 NewSearchOrder.insert(std::next(NewSearchOrder.begin()), {&ImplD, true});
lib/ExecutionEngine/Orc/Core.cpp 214 for (auto &KV : make_range(std::next(JDs.begin()), JDs.end())) {
lib/IR/AsmWriter.cpp 254 if (!V->use_empty() && std::next(V->use_begin()) != V->use_end())
lib/IR/Constants.cpp 594 I = std::next(LastNonDeadUser);
1188 User::const_op_iterator OI = std::next(this->op_begin());
lib/MC/WasmObjectWriter.cpp 1518 IT = std::next(IT);
1525 const MCFragment &Frag = *std::next(IT);
lib/Remarks/Remark.cpp 127 auto Next = std::next(It);
lib/Support/FileCheck.cpp 1701 if (std::next(PatItr) == PatEnd ||
1702 std::next(PatItr)->getCheckTy() == Check::CheckNot) {
lib/Support/TargetRegistry.cpp 78 auto J = std::find_if(std::next(I), targets().end(), ArchMatch);
lib/Target/AArch64/AArch64AdvSIMDScalarPass.cpp 211 assert(std::next(Def) == MRI->def_instr_end() && "Multiple def in SSA!");
224 assert(std::next(Def) == MRI->def_instr_end() && "Multiple def in SSA!");
304 assert(std::next(Def) == MRI->def_instr_end() && "Multiple def in SSA!");
323 assert(std::next(Def) == MRI->def_instr_end() && "Multiple def in SSA!");
lib/Target/AArch64/AArch64CondBrTuning.cpp 198 for (I = std::next(I); I != E; ++I) {
257 for (I = std::next(I); I != E; ++I) {
lib/Target/AArch64/AArch64ExpandPseudoInsts.cpp 128 bool LastItem = std::next(I) == E;
717 MachineBasicBlock::iterator NMBBI = std::next(MBBI);
lib/Target/AArch64/AArch64FalkorHWPFFix.cpp 784 BuildMI(*MBB, std::next(MachineBasicBlock::iterator(MI)), DL,
lib/Target/AArch64/AArch64FastISel.cpp 2054 removeDeadCode(I, std::next(I));
2076 removeDeadCode(I, std::next(I));
4572 removeDeadCode(I, std::next(I));
lib/Target/AArch64/AArch64FrameLowering.cpp 688 auto SEH = std::next(MBBI);
776 auto MBBI = std::next(MachineBasicBlock::iterator(MI));
lib/Target/AArch64/AArch64ISelLowering.cpp 1354 EndBB->splice(EndBB->begin(), MBB, std::next(MachineBasicBlock::iterator(MI)),
lib/Target/AArch64/AArch64InstrInfo.cpp 1418 for (auto I = std::next(CmpInstr->getIterator()),
1489 FirstEpilogSEH = std::next(FirstEpilogSEH);
5045 std::accumulate(FirstCand.front(), std::next(FirstCand.back()), 0,
5168 FirstCand.front(), std::next(FirstCand.back()), IsSafeToFixup);
lib/Target/AArch64/AArch64InstructionSelector.cpp 1555 MIB.setInsertPt(MIB.getMBB(), std::next(I.getIterator()));
1629 MIB.setInsertPt(MIB.getMBB(), std::next(I.getIterator()));
1809 MIB.setInsertPt(MIB.getMBB(), std::next(I.getIterator()));
lib/Target/AArch64/AArch64LoadStoreOptimizer.cpp 876 for (MachineInstr &MI : make_range(std::next(I), Paired))
lib/Target/AArch64/AArch64RedundantCopyElimination.cpp 168 for (MachineInstr &PredI : make_range(std::next(RIt), PredMBB->rend())) {
306 MachineBasicBlock::iterator Itr = std::next(CondBr);
lib/Target/AArch64/AArch64SpeculationHardening.cpp 349 MBB, std::next((MachineBasicBlock::iterator)MI_Reg.first));
470 NextMBBI = std::next(MBBI);
622 MachineBasicBlock::iterator NMBBI = std::next(MBBI);
lib/Target/AMDGPU/AMDGPUCodeGenPrepare.cpp 566 IRBuilder<> Builder(FDiv.getParent(), std::next(FDiv.getIterator()), FPMath);
1042 Next = std::next(I);
lib/Target/AMDGPU/AMDGPUInline.cpp 168 if (isa<ReturnInst>(*std::next(I->getIterator()))) {
lib/Target/AMDGPU/AMDGPURegisterBankInfo.cpp 987 return executeInWaterfallLoop(B, make_range(I, std::next(I)),
lib/Target/AMDGPU/AMDILCFGStructurizer.cpp 1131 Num += serialPatternMatch(*std::next(HeadMBB->succ_begin()));
1613 MachineBasicBlock *MBB2 = *std::next(MBB->succ_begin());
lib/Target/AMDGPU/GCNHazardRecognizer.cpp 206 MachineBasicBlock::instr_iterator MI = std::next(CurrCycleInstr->getIterator());
414 std::next(MI->getReverseIterator()),
lib/Target/AMDGPU/GCNILPSched.cpp 245 for (auto I = std::next(AvailQueue.begin()), E = AvailQueue.end(); I != E; ++I) {
lib/Target/AMDGPU/GCNIterativeScheduler.cpp 259 auto AfterBottomMI = std::next(BottomMI);
402 Top = std::next(MI->getIterator());
lib/Target/AMDGPU/R600ExpandSpecialInstrs.cpp 94 I = std::next(I);
lib/Target/AMDGPU/R600ISelLowering.cpp 284 if (std::next(I) == I->getParent()->end())
286 return std::next(I)->getOpcode() == R600::RETURN;
431 for (MachineBasicBlock::iterator NextExportInst = std::next(I),
433 NextExportInst = std::next(NextExportInst)) {
lib/Target/AMDGPU/R600Packetizer.cpp 314 endPacket(std::next(It)->getParent(), std::next(It));
314 endPacket(std::next(It)->getParent(), std::next(It));
lib/Target/AMDGPU/SIAddIMGInit.cpp 74 Next = std::next(I);
lib/Target/AMDGPU/SIFixSGPRCopies.cpp 458 for (auto I2 = std::next(I1); I2 != E; ) {
568 auto R = std::next(MI->getReverseIterator());
lib/Target/AMDGPU/SIFixupVectorISel.cpp 166 Next = std::next(I);
lib/Target/AMDGPU/SIFoldOperands.cpp 569 Next = std::next(RSUse);
632 NextUse = std::next(Use);
1132 NextUse = std::next(Use);
1464 Next = std::next(I);
lib/Target/AMDGPU/SIFormMemoryClauses.cpp 329 Next = std::next(I);
lib/Target/AMDGPU/SIISelLowering.cpp 3084 auto Next = std::next(I);
3105 auto E = std::next(I);
lib/Target/AMDGPU/SIInsertSkips.cpp 329 MachineBasicBlock::iterator InsPt = std::next(MI.getIterator());
385 auto M = std::next(A);
447 NextBB = std::next(BI);
464 Next = std::next(I);
495 NextBB = std::next(BI);
lib/Target/AMDGPU/SIInsertWaitcnts.cpp 1066 for (auto II = OldWaitcntInstr->getIterator(), NextI = std::next(II);
1107 for (auto II = OldWaitcntInstr->getIterator(), NextI = std::next(II);
lib/Target/AMDGPU/SIInstrInfo.cpp 2020 MachineBasicBlock::iterator Next = std::next(I);
5723 make_range(std::next(MachineBasicBlock::iterator(SCCDefInst)),
6470 for (auto I = std::next(DefMI.getIterator()); I != E; ++I) {
6509 for (auto I = std::next(DefMI.getIterator()); ; ++I) {
lib/Target/AMDGPU/SILowerControlFlow.cpp 153 std::next(U) != MRI->use_instr_nodbg_end() ||
189 MachineBasicBlock::iterator J = std::next(I);
424 Def && Def->getParent() == &MBB ? std::next(MachineBasicBlock::iterator(Def))
527 NextBB = std::next(BI);
533 Next = std::next(I);
lib/Target/AMDGPU/SILowerSGPRSpills.cpp 273 Next = std::next(I);
lib/Target/AMDGPU/SIModeRegister.cpp 340 for (P = std::next(P); P != E; P = std::next(P)) {
340 for (P = std::next(P); P != E; P = std::next(P)) {
352 S != E; S = std::next(S)) {
lib/Target/AMDGPU/SIOptimizeExecMasking.cpp 301 auto PrepareExecInst = std::next(I);
330 = std::next(CopyFromExecInst->getIterator()), JE = I->getIterator();
lib/Target/AMDGPU/SIOptimizeExecMaskingPreRA.cpp 272 std::none_of(std::next(Cmp->getIterator()), Andn2->getIterator(),
345 I = std::next(I);
361 auto Next = std::next(I);
388 auto NextLead = skipIgnoreExecInstsTrivialSucc(TmpMBB, std::next(Lead));
lib/Target/AMDGPU/SIPeepholeSDWA.cpp 917 for (auto I = std::next(MI.getIterator()), E = MISucc.getIterator();
lib/Target/AMDGPU/SIShrinkInstructions.cpp 492 auto I = std::next(MovT.getIterator()), E = MovT.getParent()->instr_end();
537 MachineInstr *Next = &*std::next(MovT.getIterator());
566 Next = std::next(I);
lib/Target/ARC/ARCExpandPseudos.cpp 83 MachineBasicBlock::iterator NMBBI = std::next(MBBI);
lib/Target/ARC/ARCInstrInfo.cpp 231 MachineBasicBlock::iterator DI = std::next(I);
lib/Target/ARM/ARMBaseInstrInfo.cpp 378 MachineBasicBlock::iterator DI = std::next(I);
lib/Target/ARM/ARMConstantIslandPass.cpp 597 MF->insert(std::next(MachineFunction::iterator(MBB)), JumpTableBB);
621 if (std::next(MBBI) == MBB->getParent()->end())
624 MachineBasicBlock *NextBB = &*std::next(MBBI);
946 WaterList.insert(std::next(IP), NewBB);
1371 Offset += TII->getInstSizeInBytes(*I), I = std::next(I)) {
1387 Offset += TII->getInstSizeInBytes(*MI), MI = std::next(MI)) {
1672 if (std::next(MachineBasicBlock::iterator(MI)) == std::prev(MBB->end()) &&
1705 std::next(MBB->getIterator())->removeSuccessor(DestBB);
lib/Target/ARM/ARMExpandPseudoInsts.cpp 1962 MachineBasicBlock::iterator NMBBI = std::next(MBBI);
lib/Target/ARM/ARMFastISel.cpp 2944 removeDeadCode(I, std::next(I));
lib/Target/ARM/ARMFrameLowering.cpp 262 BuildMI(MBB, std::next(Info.I), dl,
595 MachineBasicBlock::iterator AfterPush = std::next(GPRCS1Push);
622 MachineBasicBlock::iterator Pos = std::next(GPRCS1Push);
656 MachineBasicBlock::iterator Pos = std::next(GPRCS2Push);
683 MachineBasicBlock::iterator Pos = std::next(LastPush);
lib/Target/ARM/ARMISelLowering.cpp 7057 std::all_of(std::next(Op->op_begin()), Op->op_end(),
10125 std::next(MachineBasicBlock::iterator(MI)), BB->end());
10339 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
10370 MachineBasicBlock::iterator miI(std::next(SelectItr));
10507 std::next(MachineBasicBlock::iterator(MI)), BB->end());
10543 BB->erase(std::next(MachineBasicBlock::iterator(MI)), BB->end());
10634 std::next(MachineBasicBlock::iterator(MI)), BB->end());
lib/Target/ARM/ARMInstructionSelector.cpp 483 : MBB(*MIB->getParent()), InsertBefore(std::next(MIB->getIterator())),
692 auto InsertBefore = std::next(MIB->getIterator());
769 auto InsertBefore = std::next(MIB->getIterator());
882 auto InsertBefore = std::next(I.getIterator());
931 auto InsertBefore = std::next(I.getIterator());
lib/Target/ARM/ARMLoadStoreOptimizer.cpp 893 iterator InsertBefore = std::next(iterator(LatestMI));
930 EarliestI = std::next(EarliestI);
1236 MachineBasicBlock::iterator NextMBBI = std::next(MBBI);
lib/Target/ARM/MVEVPTBlockPass.cpp 159 if (registerDefinedBetween(CmpMI->getOperand(1).getReg(), std::next(CmpMI),
162 if (registerDefinedBetween(CmpMI->getOperand(2).getReg(), std::next(CmpMI),
lib/Target/ARM/Thumb2SizeReduction.cpp 1058 NextMII = std::next(MII);
lib/Target/AVR/AVRExpandPseudoInsts.cpp 102 BlockIt NMBBI = std::next(MBBI);
lib/Target/AVR/AVRFrameLowering.cpp 119 for (MachineFunction::iterator I = std::next(MF.begin()), E = MF.end();
313 MachineBasicBlock::iterator NextMI = std::next(I);
lib/Target/AVR/AVRISelLowering.cpp 1508 RemBB->splice(RemBB->begin(), BB, std::next(MachineBasicBlock::iterator(MI)),
1659 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
lib/Target/AVR/AVRInstrInfo.cpp 302 while (std::next(I) != MBB.end()) {
303 std::next(I)->eraseFromParent();
lib/Target/AVR/AVRRegisterInfo.cpp 230 BuildMI(MBB, std::next(II), dl, TII.get(AVR::OUTARr))
236 BuildMI(MBB, std::next(II), dl, TII.get(SubOpc), AVR::R29R28)
lib/Target/AVR/AVRRelaxMemOperations.cpp 79 BlockIt NMBBI = std::next(MBBI);
lib/Target/BPF/BPFISelLowering.cpp 670 std::next(MachineBasicBlock::iterator(MI)), BB->end());
lib/Target/BPF/BPFInstrInfo.cpp 195 while (std::next(I) != MBB.end())
196 std::next(I)->eraseFromParent();
lib/Target/BPF/BPFMISimplifyPatchable.cpp 134 NextI = std::next(I);
lib/Target/Hexagon/BitTracker.cpp 967 MachineFunction::const_iterator Next = std::next(BIt);
1088 MachineFunction::const_iterator Next = std::next(BIt);
lib/Target/Hexagon/HexagonBitSimplify.cpp 361 NextI = std::next(I);
376 NextI = std::next(I);
392 NextI = std::next(I);
1307 NextI = std::next(I);
1592 NextI = std::next(I);
lib/Target/Hexagon/HexagonBlockRanges.cpp 91 iterator Next = std::next(Iter);
151 Next = std::next(I);
lib/Target/Hexagon/HexagonBranchRelaxation.cpp 179 auto SecondTerm = std::next(FirstTerm);
lib/Target/Hexagon/HexagonCommonGEP.cpp 564 for (NodeSet::iterator NJ = std::next(NI); NJ != NE; ++NJ)
lib/Target/Hexagon/HexagonConstExtenders.cpp 1383 It = (N != 0) ? std::next(It) : CandSet.erase(It);
lib/Target/Hexagon/HexagonConstPropagation.cpp 758 MachineFunction::const_iterator Next = std::next(BI);
833 MachineFunction::const_iterator NextI = std::next(BI);
1036 auto Next = std::next(I);
lib/Target/Hexagon/HexagonCopyToCombine.cpp 334 End = std::next(MachineBasicBlock::iterator(I2));
527 MachineBasicBlock::iterator I2 = std::next(MachineBasicBlock::iterator(I1));
lib/Target/Hexagon/HexagonEarlyIfConv.cpp 256 MachineFunction::iterator NextBI = std::next(MachineFunction::iterator(B));
260 MachineBasicBlock::const_iterator T2I = std::next(T1I);
768 NextI = std::next(I);
987 NextI = std::next(I);
lib/Target/Hexagon/HexagonExpandCondsets.cpp 339 auto NextI = std::next(I);
834 for (MachineBasicBlock::iterator I = std::next(StartI); I != EndI; ++I) {
910 MachineBasicBlock::iterator End = std::next(Last);
974 for (MachineBasicBlock::iterator I = std::next(DefIt); I != TfrIt; ++I) {
981 for (MachineBasicBlock::iterator I = std::next(DefIt); I != TfrIt; ++I) {
1049 MachineBasicBlock::iterator PastDefIt = std::next(DefIt);
1073 NextI = std::next(I);
lib/Target/Hexagon/HexagonFrameLowering.cpp 853 return std::next(It);
866 return HasCall ? It : std::next(It);
1315 assert(It->isReturn() && std::next(It) == MBB.end());
1893 NextI = std::next(I);
2295 auto EndIt = std::next(EI.getIterator());
2298 NextIt = std::next(It);
lib/Target/Hexagon/HexagonGenMux.cpp 238 NextI = std::next(I);
lib/Target/Hexagon/HexagonGenPredicate.cpp 274 BuildMI(B, std::next(DefIt), DL, TII->get(TargetOpcode::COPY), NewPR)
lib/Target/Hexagon/HexagonHardwareLoops.cpp 1052 if (std::next(I) != End || !I->getParent()->isPHI())
1065 nextJ = std::next(J);
1099 nextI = std::next(I); // I is invalidated by the setReg
1338 instr_iterator CmpIt = CmpI->getIterator(), NextIt = std::next(CmpIt);
lib/Target/Hexagon/HexagonInstrInfo.cpp 3619 MachineBasicBlock::const_instr_iterator NextIt = std::next(It);
lib/Target/Hexagon/HexagonLoopIdiomRecognition.cpp 627 BasicBlock *PB = (*PI == BB) ? *std::next(PI) : *PI;
1474 N = std::next(I);
lib/Target/Hexagon/HexagonNewValueJump.cpp 655 for (auto I = std::next(MI.getIterator()); I != jmpPos; ++I) {
lib/Target/Hexagon/HexagonPeephole.cpp 131 NextI = std::next(I);
lib/Target/Hexagon/HexagonVExtract.cpp 128 MachineBasicBlock::iterator At = std::next(DefI->getIterator());
lib/Target/Hexagon/HexagonVLIWPacketizer.cpp 166 InsertPt = std::next(BundleIt).getInstrIterator();
196 MachineBasicBlock::iterator NextIt = std::next(BundleIt);
235 auto NextI = std::next(MI);
1153 NextI = std::next(I);
1787 MachineBasicBlock::instr_iterator NextMI = std::next(MI->getIterator());
lib/Target/Hexagon/RDFGraph.cpp 1014 NextI = std::next(I);
lib/Target/Hexagon/RDFLiveness.cpp 537 UI = UI->second.empty() ? RealUses.erase(UI) : std::next(UI);
1117 I = I->second.empty() ? M.erase(I) : std::next(I);
lib/Target/Lanai/LanaiDelaySlotFiller.cpp 120 MBB.splice(std::next(I), &MBB, FI, I);
124 MBB.splice(std::next(I), &MBB, J);
126 BuildMI(MBB, std::next(I), DebugLoc(), TII->get(Lanai::NOP));
138 MIBundleBuilder(MBB, InstrWithSlot, std::next(LastFiller));
lib/Target/Lanai/LanaiInstrInfo.cpp 597 while (std::next(Instruction) != MBB.end()) {
598 std::next(Instruction)->eraseFromParent();
lib/Target/MSP430/MSP430BranchSelector.cpp 146 if (MI->getOpcode() == MSP430::JCC && std::next(MI) != EE) {
154 MF->insert(std::next(MBB), NewBB);
157 NewBB->splice(NewBB->end(), &*MBB, std::next(MI), MBB->end());
184 MachineBasicBlock *NextMBB = &*std::next(MBB);
lib/Target/MSP430/MSP430FrameLowering.cpp 74 for (MachineFunction::iterator I = std::next(MF.begin()), E = MF.end();
lib/Target/MSP430/MSP430ISelLowering.cpp 1475 RemBB->splice(RemBB->begin(), BB, std::next(MachineBasicBlock::iterator(MI)),
1578 std::next(MachineBasicBlock::iterator(MI)), BB->end());
lib/Target/MSP430/MSP430InstrInfo.cpp 211 while (std::next(I) != MBB.end())
212 std::next(I)->eraseFromParent();
lib/Target/MSP430/MSP430RegisterInfo.cpp 144 BuildMI(MBB, std::next(II), dl, TII.get(MSP430::SUB16ri), DstReg)
147 BuildMI(MBB, std::next(II), dl, TII.get(MSP430::ADD16ri), DstReg)
lib/Target/Mips/MicroMipsSizeReduction.cpp 490 NextMII = std::next(NextMII);
650 NextMII = std::next(NextMII);
679 NextMII = std::next(MII);
lib/Target/Mips/Mips16ISelLowering.cpp 539 std::next(MachineBasicBlock::iterator(MI)), BB->end());
602 std::next(MachineBasicBlock::iterator(MI)), BB->end());
668 std::next(MachineBasicBlock::iterator(MI)), BB->end());
lib/Target/Mips/Mips16InstrInfo.cpp 428 II = std::next(II);
lib/Target/Mips/MipsBranchExpansion.cpp 256 ReverseIter FirstBr = getNonDebugInstr(std::next(LastBr), End);
277 MFp->insert(std::next(MachineFunction::iterator(MBB)), NewMBB);
748 std::next(I) == FI->end() && std::next(FI) == MFp->end();
748 std::next(I) == FI->end() && std::next(FI) == MFp->end();
750 std::pair<Iter, bool> Res = getNextMachineInstr(std::next(I), &*FI);
758 if (std::next(Iit) == FI->end() ||
759 std::next(Iit)->getOpcode() != Mips::NOP) {
lib/Target/Mips/MipsConstantIslandPass.cpp 593 if (std::next(MBBI) == MBB->getParent()->end())
596 MachineBasicBlock *NextBB = &*std::next(MBBI);
891 WaterList.insert(std::next(IP), NewBB);
1284 Offset += TII->getInstSizeInBytes(*MI), MI = std::next(MI)) {
1576 if (std::next(MachineBasicBlock::iterator(MI)) == std::prev(MBB->end()) &&
lib/Target/Mips/MipsDelaySlotFiller.cpp 564 std::next(Branch)->eraseFromParent();
630 if (InMicroMipsMode && TII->getInstSizeInBytes(*std::next(DSI)) == 2 &&
666 BuildMI(MBB, std::next(I), I->getDebugLoc(), TII->get(Mips::NOP));
667 MIBundleBuilder(MBB, I, std::next(I, 2));
758 MBB.splice(std::next(SlotI), &MBB, Filler.getReverse());
759 MIBundleBuilder(MBB, SlotI, std::next(SlotI, 2));
776 if (!searchRange(MBB, std::next(Slot), MBB.end(), RegDU, NM, Slot, Filler))
779 MBB.splice(std::next(Slot), &MBB, Filler);
780 MIBundleBuilder(MBB, Slot, std::next(Slot, 2));
lib/Target/Mips/MipsExpandPseudo.cpp 126 std::next(MachineBasicBlock::iterator(I)), BB.end());
261 std::next(MachineBasicBlock::iterator(I)), BB.end());
396 exitMBB->splice(exitMBB->begin(), &BB, std::next(I), BB.end());
584 exitMBB->splice(exitMBB->begin(), &BB, std::next(I), BB.end());
674 MachineBasicBlock::iterator NMBBI = std::next(MBBI);
lib/Target/Mips/MipsISelLowering.cpp 1274 MIB = BuildMI(MBB, std::next(I), MI.getDebugLoc(),
1654 std::next(MachineBasicBlock::iterator(MI)), BB->end());
1832 std::next(MachineBasicBlock::iterator(MI)), BB->end());
4448 std::next(MachineBasicBlock::iterator(MI)), BB->end());
4524 std::next(MachineBasicBlock::iterator(MI)), BB->end());
lib/Target/Mips/MipsSEISelLowering.cpp 3041 MachineFunction::iterator It = std::next(MachineFunction::iterator(BB));
3051 Sink->splice(Sink->begin(), BB, std::next(MachineBasicBlock::iterator(MI)),
3110 MachineFunction::iterator It = std::next(MachineFunction::iterator(BB));
3120 Sink->splice(Sink->begin(), BB, std::next(MachineBasicBlock::iterator(MI)),
lib/Target/NVPTX/NVPTXGenericToNVVM.cpp 138 auto Next = std::next(I);
lib/Target/PowerPC/PPCAsmPrinter.cpp 1229 make_range(std::next(MI->operands_begin()), MI->operands_end())) {
lib/Target/PowerPC/PPCExpandISEL.cpp 380 std::next(MachineBasicBlock::iterator(BIL.back())),
lib/Target/PowerPC/PPCFastISel.cpp 2362 removeDeadCode(I, std::next(I));
lib/Target/PowerPC/PPCISelDAGToDAG.cpp 1655 assert(std::next(I) == BitGroups.end() &&
lib/Target/PowerPC/PPCISelLowering.cpp 5301 Ops.insert(std::next(Ops.begin()), AddTOC);
10350 std::next(MachineBasicBlock::iterator(MI)), BB->end());
10454 std::next(MachineBasicBlock::iterator(MI)), BB->end());
10657 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
10949 std::next(MachineBasicBlock::iterator(MI)), BB->end());
11017 std::next(MachineBasicBlock::iterator(MI)), BB->end());
11190 std::next(MachineBasicBlock::iterator(MI)), BB->end());
11269 std::next(MachineBasicBlock::iterator(MI)), BB->end());
lib/Target/PowerPC/PPCInstrInfo.cpp 1913 BuildMI(*MI->getParent(), std::next(MII), MI->getDebugLoc(),
4233 Preheader = *std::next(LoopBB->pred_begin());
lib/Target/PowerPC/PPCLoopPreIncPrep.cpp 416 for (auto I = std::next(BucketChain.Elements.begin()),
lib/Target/PowerPC/PPCPreEmitPeephole.cpp 107 for (auto AfterBBI = std::next(BBI); AfterBBI != MBB.instr_end();
lib/Target/RISCV/RISCVExpandPseudoInsts.cpp 90 MachineBasicBlock::iterator NMBBI = std::next(MBBI);
650 NewMBB->splice(NewMBB->end(), &MBB, std::next(MBBI), MBB.end());
lib/Target/RISCV/RISCVFrameLowering.cpp 288 BuildMI(MBB, std::next(I), DL,
lib/Target/RISCV/RISCVISelLowering.cpp 1116 std::next(MachineBasicBlock::iterator(MI)), BB->end());
1307 std::next(LastSelectPseudo->getIterator()), HeadMBB->end());
1328 auto SelectEnd = std::next(LastSelectPseudo->getIterator());
1331 auto Next = std::next(SelectMBBI);
lib/Target/RISCV/RISCVInstrInfo.cpp 262 while (std::next(FirstUncondOrIndirectBr) != MBB.end()) {
263 std::next(FirstUncondOrIndirectBr)->eraseFromParent();
lib/Target/Sparc/LeonPasses.cpp 52 MachineBasicBlock::iterator NMBBI = std::next(MBBI);
147 MachineBasicBlock::iterator NMBBI = std::next(MBBI);
lib/Target/Sparc/SparcISelLowering.cpp 3146 std::next(MachineBasicBlock::iterator(MI)), ThisMBB->end());
lib/Target/SystemZ/SystemZElimCompare.cpp 434 std::next(MachineBasicBlock::reverse_iterator(&Compare)),
470 std::next(MachineBasicBlock::iterator(&Compare)), MBBE = MBB.end();
lib/Target/SystemZ/SystemZFrameLowering.cpp 431 for (auto I = std::next(MF.begin()), E = MF.end(); I != E; ++I)
lib/Target/SystemZ/SystemZISelLowering.cpp 6477 MF.insert(std::next(MachineFunction::iterator(MBB)), NewMBB);
6487 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
6524 MachineBasicBlock::iterator miI(std::next(MachineBasicBlock::iterator(MI)));
6636 std::next(MachineBasicBlock::iterator(MI));
lib/Target/SystemZ/SystemZInstrInfo.cpp 395 while (std::next(I) != MBB.end())
396 std::next(I)->eraseFromParent();
lib/Target/SystemZ/SystemZMachineScheduler.cpp 65 std::next(LastEmittedMI) : MBB->begin());
lib/Target/SystemZ/SystemZPostRewrite.cpp 178 MF.insert(std::next(MachineFunction::iterator(MBB)), RestMBB);
186 MF.insert(std::next(MachineFunction::iterator(MBB)), MoveMBB);
255 MachineBasicBlock::iterator NMBBI = std::next(MBBI);
lib/Target/WebAssembly/WebAssemblyCFGStackify.cpp 251 I = std::next(ScopeTop->getIterator());
385 auto Iter = std::next(Bottom->getIterator());
388 Iter = std::next(Bottom->getIterator());
466 auto Iter = std::next(Bottom->getIterator());
469 Iter = std::next(Bottom->getIterator());
482 I = std::next(ScopeTop->getIterator());
690 for (auto B = Try->getIterator(), E = std::next(EndTry->getIterator());
1026 auto SplitPos = std::next(Catch->getIterator());
1034 MF.insert(std::next(EHPad->getIterator()), BrDest);
1117 if (std::next(RangeEnd->getIterator()) != MBB->end() &&
1118 std::next(RangeEnd->getIterator())->isEHLabel())
1119 RangeEnd = &*std::next(RangeEnd->getIterator());
1137 MF.insert(std::next(MBB->getIterator()), NestedEHPad);
1147 MF.insert(std::next(NestedEHPad->getIterator()), NestedCont);
1154 std::next(RangeEnd->getIterator()), MBB->end());
lib/Target/WebAssembly/WebAssemblyExplicitLocals.cpp 277 auto InsertPt = std::next(MI.getIterator());
lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp 343 auto BNum = (*(std::next(I)))->getNumber();
lib/Target/WebAssembly/WebAssemblyISelLowering.cpp 366 DoneMBB->splice(DoneMBB->begin(), BB, std::next(MI.getIterator()), BB->end());
lib/Target/WebAssembly/WebAssemblyLateEHPrepare.cpp 198 MBB.erase(std::next(MI.getIterator()), MBB.end());
300 MF.insert(std::next(MachineFunction::iterator(EHPad)), ElseMBB);
301 MF.insert(std::next(MachineFunction::iterator(ElseMBB)), ThenMBB);
lib/Target/WebAssembly/WebAssemblyLowerEmscriptenEHSjLj.cpp 984 for (auto I = std::next(BasicBlock::iterator(CI)), IE = BB->end();
995 for (auto I = std::next(BasicBlock::iterator(ThrewLI)), IE = BB->end();
lib/Target/WebAssembly/WebAssemblyRegStackify.cpp 325 auto NextI = std::next(MachineBasicBlock::const_iterator(Def));
lib/Target/X86/X86AvoidStoreForwardingBlocks.cpp 341 for (auto PBInst = std::next(MachineBasicBlock::reverse_iterator(LoadInst)),
lib/Target/X86/X86AvoidTrailingCall.cpp 100 MachineBasicBlock::iterator MBBI = std::next(LastRealInstr.getReverse());
lib/Target/X86/X86CallFrameOptimization.cpp 582 MBB, std::next(Push), DL,
lib/Target/X86/X86CmovConversion.cpp 574 for (auto I = std::next(ItrMI), E = BB->end(); I != E; ++I) {
683 std::next(MachineBasicBlock::iterator(LastCMOV)), MBB->end());
699 std::next(MachineBasicBlock::iterator(LastCMOV));
798 std::next(MachineBasicBlock::iterator(MI)));
lib/Target/X86/X86ExpandPseudo.cpp 389 MachineBasicBlock::iterator NMBBI = std::next(MBBI);
lib/Target/X86/X86FastISel.cpp 3970 removeDeadCode(I, std::next(I));
lib/Target/X86/X86FlagsCopyLowering.cpp 279 MF.insert(std::next(MachineFunction::iterator(&MBB)), &NewMBB);
463 std::accumulate(std::next(TestMBB->pred_begin()), TestMBB->pred_end(),
536 ? std::next(CopyI->getIterator())
lib/Target/X86/X86FloatingPoint.cpp 490 while (++Start != std::next(I)) {
lib/Target/X86/X86FrameLowering.cpp 516 MachineBasicBlock::iterator MBBI = std::next(ChkStkStub->getIterator());
568 MachineFunction::iterator MBBIter = std::next(MBB.getIterator());
lib/Target/X86/X86ISelLowering.cpp29208 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
29368 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
29535 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
29596 MachineBasicBlock::iterator miI(std::next(SelectItr));
29819 std::next(MachineBasicBlock::iterator(FirstCMOV)),
29858 BuildMI(*SinkMBB, std::next(MachineBasicBlock::iterator(MIB.getInstr())), DL,
29976 auto Next = std::next(DbgIt);
29984 std::next(MachineBasicBlock::iterator(LastCMOV)),
30003 std::next(MachineBasicBlock::iterator(LastCMOV));
30067 std::next(MachineBasicBlock::iterator(MI)), BB->end());
30167 MF->insert(std::next(BB->getIterator()), RestoreMBB);
30527 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
lib/Target/X86/X86IndirectBranchTracking.cpp 134 Changed |= addENDBR(MBB, std::next(I));
lib/Target/X86/X86InstrInfo.cpp 2536 while (std::next(I) != MBB.end())
2537 std::next(I)->eraseFromParent();
2701 for (auto I = std::next(MBB.rbegin()), E = MBB.rend(); I != E; ++I) {
3973 TFL->BuildCFI(MBB, std::next(I), DL,
7994 std::next(RepeatedSequenceLocs[0].back()), 0,
lib/Target/X86/X86OptimizeLEAs.cpp 599 auto I2 = std::next(I1);
lib/Target/X86/X86RetpolineThunks.cpp 247 MF.erase(std::next(MF.begin()));
lib/Target/X86/X86SpeculativeLoadHardening.cpp 236 MF.insert(std::next(MachineFunction::iterator(&MBB)), &NewMBB);
249 *std::next(MachineFunction::iterator(&NewMBB));
713 : &*std::next(MachineFunction::iterator(&MBB));
2348 UnhardenedReg, MBB, std::next(MI.getIterator()), Loc);
2444 BuildMI(MBB, std::next(InsertPt), Loc, TII->get(X86::LFENCE));
2459 if (MI.isReturn() || (std::next(InsertPt) == MBB.end() && MBB.succ_empty()))
lib/Target/XCore/XCoreISelLowering.cpp 1552 std::next(MachineBasicBlock::iterator(MI)), BB->end());
lib/Transforms/Coroutines/CoroSplit.cpp 424 for (auto I = std::next(NewF->arg_begin()), E = NewF->arg_end(); I != E; ++I)
1237 auto NextF = std::next(F.getIterator());
lib/Transforms/IPO/FunctionAttrs.cpp 404 Uses.push_back(&*std::next(F->arg_begin(), UseIndex));
535 !SCCNodes.count(&*std::next(F->arg_begin(), UseIndex))) {
lib/Transforms/IPO/MergeFunctions.cpp 411 (std::next(I) != IE && std::next(I)->first == I->first) ) {
411 (std::next(I) != IE && std::next(I)->first == I->first) ) {
531 for (Function::iterator BBI = std::next(G->begin()), BBE = G->end();
lib/Transforms/IPO/ThinLTOBitcodeWriter.cpp 262 for (auto &Arg : make_range(std::next(F->arg_begin()), F->arg_end())) {
lib/Transforms/InstCombine/InstCombineCompares.cpp 626 I = &*std::next(I->getIterator());
lib/Transforms/Instrumentation/ControlHeightReduction.cpp 1000 auto NextIt = std::next(It);
lib/Transforms/ObjCARC/ObjCARCAPElim.cpp 170 if (std::next(F->begin()) != F->end())
lib/Transforms/ObjCARC/ObjCARCContract.cpp 218 for (auto I = std::next(BasicBlock::iterator(Load)),
lib/Transforms/ObjCARC/PtrState.cpp 276 InsertAfter = std::next(Inst->getIterator());
lib/Transforms/Scalar/CallSiteSplitting.cpp 244 auto II = std::next(CI->getIterator());
331 TailBB, PredBB, &*std::next(Instr->getIterator()), ValueToValueMaps[i],
lib/Transforms/Scalar/ConstantHoisting.cpp 659 for (auto CC = std::next(ConstCandVec.begin()), E = ConstCandVec.end();
lib/Transforms/Scalar/DeadStoreElimination.cpp 806 if (std::next(I) != E)
lib/Transforms/Scalar/GVNSink.cpp 539 for (auto I = std::next(Inst->getIterator()), E = BB->end();
lib/Transforms/Scalar/GuardWidening.cpp 739 !std::all_of(std::next(CurrentChecks.begin()), CurrentChecks.end(),
lib/Transforms/Scalar/InferAddressSpaces.cpp 1006 BasicBlock::iterator InsertPos = std::next(Inst->getIterator());
lib/Transforms/Scalar/LICM.cpp 1188 if (std::next(Begin) != CurAST->end())
lib/Transforms/Scalar/LoopDistribute.cpp 401 for (auto PartJ : make_range(std::next(ToBeMerged.member_begin(I)),
465 for (auto I = std::next(PartitionContainer.rbegin()),
485 Next = std::next(PartitionContainer.cbegin()),
lib/Transforms/Scalar/LoopRerollPass.cpp 237 return std::next(Instructions.begin());
242 return std::next(Instructions.begin());
lib/Transforms/Scalar/LoopStrengthReduce.cpp 1879 return std::next(Incs.begin());
2680 std::next(I); NewStrideIter != E; ++NewStrideIter) {
3075 IVOpIter = findIVOperand(std::next(IVOpIter), IVOpEnd, L, SE);
3163 IVOpIter = findIVOperand(std::next(IVOpIter), IVOpEnd, L, SE);
3605 InnerAddOps.append(std::next(J),
5027 BetterPos = &*std::next(BasicBlock::iterator(Inst));
lib/Transforms/Scalar/PlaceSafepoints.cpp 664 BasicBlock::iterator Start = IsBegin ? OrigBB->begin() : std::next(Before);
lib/Transforms/Scalar/SROA.cpp 2576 IRB.SetInsertPoint(&*std::next(BasicBlock::iterator(&LI)));
lib/Transforms/Scalar/Scalarizer.cpp 346 return Scatterer(BB, std::next(BasicBlock::iterator(VOp)),
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 653 std::all_of(std::next(SI.case_begin()), SI.case_end(),
lib/Transforms/Scalar/TailRecursionElimination.cpp 482 firstNonDbg(std::next(BB->begin())) == TI && CI->getCalledFunction() &&
lib/Transforms/Utils/CallPromotionUtils.cpp 176 InsertBefore = &*std::next(CS.getInstruction()->getIterator());
lib/Transforms/Utils/CodeExtractor.cpp 1249 InsertPt = std::next(OutI->getIterator());
lib/Transforms/Utils/Evaluator.cpp 153 ConstantInt *CI = dyn_cast<ConstantInt>(*std::next(CE->op_begin()));
lib/Transforms/Utils/GuardUtils.cpp 29 SmallVector<Value *, 4> Args(std::next(Guard->arg_begin()), Guard->arg_end());
lib/Transforms/Utils/Local.cpp 2742 P.erase(P.begin(), std::next(P.begin(), BitShift));
2948 for (auto E = std::next(It, OpIdx); It != E; ++It)
lib/Transforms/Utils/LoopRotationUtils.cpp 316 for (auto I = std::next(OrigPreheader->rbegin()), E = OrigPreheader->rend();
lib/Transforms/Utils/LowerSwitch.cpp 416 for (CaseItr J = std::next(I), E = Cases.end(); J != E; ++J) {
432 Cases.erase(std::next(I), Cases.end());
lib/Transforms/Utils/SimplifyCFG.cpp 3033 if (std::next(pred_begin(PostBB), 2) != pred_end(PostBB)) {
lib/Transforms/Vectorize/LoopVectorize.cpp 2029 auto NewIP = std::next(BasicBlock::iterator(LastInst));
lib/Transforms/Vectorize/SLPVectorizer.cpp 3446 std::next(VectorizableTree.begin(), I + 1), VectorizableTree.end(),
4302 std::next(VecI->getIterator()));
4327 std::next(VecI->getIterator()));
lib/Transforms/Vectorize/VPlan.cpp 288 std::next(InsertPos->getIterator()), getParent()->getRecipeList(),
lib/Transforms/Vectorize/VPlanValue.h 115 auto Current = std::next(user_begin());
tools/clang/include/clang/AST/OpenMPClause.h 4680 if (std::next(ListSizeCur) == ListSizeEnd) {
tools/clang/include/clang/AST/StmtOpenMP.h 209 assert(std::next(Clauses.begin()) == Clauses.end() &&
488 &(*(std::next(child_begin(), getArraysOffset(getDirectiveKind())))));
494 Expr **Storage = reinterpret_cast<Expr **>(&*std::next(
502 &*std::next(child_begin(),
510 &*std::next(child_begin(),
518 &*std::next(child_begin(),
526 &*std::next(child_begin(),
534 &*std::next(child_begin(),
542 &*std::next(child_begin(),
588 *std::next(child_begin(), IterationVariableOffset) = IV;
591 *std::next(child_begin(), LastIterationOffset) = LI;
594 *std::next(child_begin(), CalcLastIterationOffset) = CLI;
597 *std::next(child_begin(), PreConditionOffset) = PC;
600 *std::next(child_begin(), CondOffset) = Cond;
602 void setInit(Expr *Init) { *std::next(child_begin(), InitOffset) = Init; }
603 void setInc(Expr *Inc) { *std::next(child_begin(), IncOffset) = Inc; }
605 *std::next(child_begin(), PreInitsOffset) = PreInits;
612 *std::next(child_begin(), IsLastIterVariableOffset) = IL;
619 *std::next(child_begin(), LowerBoundVariableOffset) = LB;
626 *std::next(child_begin(), UpperBoundVariableOffset) = UB;
633 *std::next(child_begin(), StrideVariableOffset) = ST;
640 *std::next(child_begin(), EnsureUpperBoundOffset) = EUB;
647 *std::next(child_begin(), NextLowerBoundOffset) = NLB;
654 *std::next(child_begin(), NextUpperBoundOffset) = NUB;
661 *std::next(child_begin(), NumIterationsOffset) = NI;
666 *std::next(child_begin(), PrevLowerBoundVariableOffset) = PrevLB;
671 *std::next(child_begin(), PrevUpperBoundVariableOffset) = PrevUB;
676 *std::next(child_begin(), DistIncOffset) = DistInc;
681 *std::next(child_begin(), PrevEnsureUpperBoundOffset) = PrevEUB;
686 *std::next(child_begin(), CombinedLowerBoundVariableOffset) = CombLB;
691 *std::next(child_begin(), CombinedUpperBoundVariableOffset) = CombUB;
696 *std::next(child_begin(), CombinedEnsureUpperBoundOffset) = CombEUB;
701 *std::next(child_begin(), CombinedInitOffset) = CombInit;
706 *std::next(child_begin(), CombinedConditionOffset) = CombCond;
711 *std::next(child_begin(), CombinedNextLowerBoundOffset) = CombNLB;
716 *std::next(child_begin(), CombinedNextUpperBoundOffset) = CombNUB;
721 *std::next(child_begin(), CombinedDistConditionOffset) = CombDistCond;
726 *std::next(child_begin(),
915 *std::next(child_begin(), IterationVariableOffset)));
919 *std::next(child_begin(), LastIterationOffset)));
923 *std::next(child_begin(), CalcLastIterationOffset)));
927 *std::next(child_begin(), PreConditionOffset)));
931 reinterpret_cast<const Expr *>(*std::next(child_begin(), CondOffset)));
935 reinterpret_cast<const Expr *>(*std::next(child_begin(), InitOffset)));
939 reinterpret_cast<const Expr *>(*std::next(child_begin(), IncOffset)));
942 return *std::next(child_begin(), PreInitsOffset);
944 Stmt *getPreInits() { return *std::next(child_begin(), PreInitsOffset); }
951 *std::next(child_begin(), IsLastIterVariableOffset)));
959 *std::next(child_begin(), LowerBoundVariableOffset)));
967 *std::next(child_begin(), UpperBoundVariableOffset)));
975 *std::next(child_begin(), StrideVariableOffset)));
983 *std::next(child_begin(), EnsureUpperBoundOffset)));
991 *std::next(child_begin(), NextLowerBoundOffset)));
999 *std::next(child_begin(), NextUpperBoundOffset)));
1007 *std::next(child_begin(), NumIterationsOffset)));
1013 *std::next(child_begin(), PrevLowerBoundVariableOffset)));
1019 *std::next(child_begin(), PrevUpperBoundVariableOffset)));
1025 *std::next(child_begin(), DistIncOffset)));
1031 *std::next(child_begin(), PrevEnsureUpperBoundOffset)));
1037 *std::next(child_begin(), CombinedLowerBoundVariableOffset)));
1043 *std::next(child_begin(), CombinedUpperBoundVariableOffset)));
1049 *std::next(child_begin(), CombinedEnsureUpperBoundOffset)));
1055 *std::next(child_begin(), CombinedInitOffset)));
1061 *std::next(child_begin(), CombinedConditionOffset)));
1067 *std::next(child_begin(), CombinedNextLowerBoundOffset)));
1073 *std::next(child_begin(), CombinedNextUpperBoundOffset)));
1079 *std::next(child_begin(), CombinedDistConditionOffset)));
1085 *std::next(child_begin(), CombinedParForInDistConditionOffset)));
2155 *std::next(child_begin(), 1) = RR;
2184 return static_cast<const Expr *>(*std::next(child_begin(), 1));
2187 return static_cast<Expr *>(*std::next(child_begin(), 1));
2360 void setX(Expr *X) { *std::next(child_begin()) = X; }
2364 void setUpdateExpr(Expr *UE) { *std::next(child_begin(), 2) = UE; }
2366 void setV(Expr *V) { *std::next(child_begin(), 3) = V; }
2368 void setExpr(Expr *E) { *std::next(child_begin(), 4) = E; }
2405 Expr *getX() { return cast_or_null<Expr>(*std::next(child_begin())); }
2407 return cast_or_null<Expr>(*std::next(child_begin()));
2413 return cast_or_null<Expr>(*std::next(child_begin(), 2));
2416 return cast_or_null<Expr>(*std::next(child_begin(), 2));
2426 Expr *getV() { return cast_or_null<Expr>(*std::next(child_begin(), 3)); }
2428 return cast_or_null<Expr>(*std::next(child_begin(), 3));
2431 Expr *getExpr() { return cast_or_null<Expr>(*std::next(child_begin(), 4)); }
2433 return cast_or_null<Expr>(*std::next(child_begin(), 4));
tools/clang/include/clang/Driver/Compilation.h 168 assert(std::next(TCs.first) == TCs.second &&
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/SMTConstraintManager.h 231 if (std::next(I) != Constraints.end())
tools/clang/lib/AST/OpenMPClause.cpp 854 auto It = std::next(getVarRefs().end(), NumLoop);
864 auto It = std::next(getVarRefs().end(), NumLoop);
874 auto It = std::next(getVarRefs().end(), NumLoop);
tools/clang/lib/Analysis/ThreadSafety.cpp 2079 examineArguments(FD, std::next(OE->arg_begin()), OE->arg_end(),
tools/clang/lib/CodeGen/CGCleanup.cpp 463 InsertBefore = std::next(Inst->getIterator());
tools/clang/lib/CodeGen/CGObjC.cpp 3637 ConstructorArgs.append(std::next(CXXConstExpr->arg_begin()),
tools/clang/lib/CodeGen/CGOpenMPRuntime.cpp 1663 CGF.EmitLValueForField(Base, *std::next(Fields, IdentField_PSource));
4538 auto PartIdFI = std::next(KmpTaskTQTyRD->field_begin(), KmpTaskTPartId);
4542 auto SharedsFI = std::next(KmpTaskTQTyRD->field_begin(), KmpTaskTShareds);
4548 auto PrivatesFI = std::next(KmpTaskTWithPrivatesQTyRD->field_begin(), 1);
4567 auto LBFI = std::next(KmpTaskTQTyRD->field_begin(), KmpTaskTLowerBound);
4570 auto UBFI = std::next(KmpTaskTQTyRD->field_begin(), KmpTaskTUpperBound);
4573 auto StFI = std::next(KmpTaskTQTyRD->field_begin(), KmpTaskTStride);
4576 auto LIFI = std::next(KmpTaskTQTyRD->field_begin(), KmpTaskTLastIter);
4579 auto RFI = std::next(KmpTaskTQTyRD->field_begin(), KmpTaskTReductions);
4633 auto FI = std::next(KmpTaskTWithPrivatesQTyRD->field_begin());
4755 auto FI = std::next(KmpTaskTWithPrivatesQTyRD->field_begin());
4915 auto LIFI = std::next(KmpTaskTQTyRD->field_begin(), KmpTaskTLastIter);
4935 Base, *std::next(KmpTaskTQTyRD->field_begin(),
4951 auto FI = std::next(KmpTaskTWithPrivatesQTyRD->field_begin(), 1);
5040 std::next(TaskFunction->arg_begin(), 3)->getType();
5042 auto FI = std::next(KmpTaskTWithPrivatesQTyRD->field_begin());
5126 TDBase, *std::next(KmpTaskTQTyRD->field_begin(),
5151 auto FI = std::next(KmpTaskTQTyRD->field_begin(), Data1);
5160 Data1LV, *std::next(KmpCmplrdataUD->field_begin(), Destructors));
5168 TDBase, *std::next(KmpTaskTQTyRD->field_begin(), Data2));
5170 Data2LV, *std::next(KmpCmplrdataUD->field_begin(), Priority));
5250 Base, *std::next(KmpDependInfoRD->field_begin(), BaseAddr));
5256 Base, *std::next(KmpDependInfoRD->field_begin(), Len));
5278 Base, *std::next(KmpDependInfoRD->field_begin(), Flags));
5309 auto PartIdFI = std::next(KmpTaskTQTyRD->field_begin(), KmpTaskTPartId);
5403 *std::next(Result.KmpTaskTQTyRD->field_begin(), KmpTaskTLowerBound));
5410 *std::next(Result.KmpTaskTQTyRD->field_begin(), KmpTaskTUpperBound));
5417 *std::next(Result.KmpTaskTQTyRD->field_begin(), KmpTaskTStride));
5425 *std::next(Result.KmpTaskTQTyRD->field_begin(), KmpTaskTReductions));
7535 if (Ty->isAnyPointerType() && std::next(I) != CE) {
7579 auto Next = std::next(I);
10843 DimsLVal, *std::next(RD->field_begin(), UpperFD));
10851 DimsLVal, *std::next(RD->field_begin(), StrideFD));
tools/clang/lib/CodeGen/CGOpenMPRuntimeNVPTX.cpp 4516 TargetArgs.append(std::next(Args.begin(), I), Args.end());
tools/clang/lib/CodeGen/CGStmtOpenMP.cpp 400 std::next(CD->param_begin(), CD->getContextParamPosition()));
403 std::next(CD->param_begin(), CD->getContextParamPosition()));
461 std::next(CD->param_begin(), CD->getContextParamPosition() + 1),
464 std::next(CD->param_begin(), CD->getContextParamPosition() + 1),
2881 auto PartId = std::next(I);
2882 auto TaskT = std::next(I, 4);
3170 auto PartId = std::next(I);
3171 auto TaskT = std::next(I, 4);
5027 auto *LBP = std::next(I, LowerBound);
5028 auto *UBP = std::next(I, UpperBound);
5029 auto *STP = std::next(I, Stride);
5030 auto *LIP = std::next(I, LastIter);
tools/clang/lib/Driver/ToolChains/Arch/RISCV.cpp 298 if (std::next(I) != E) {
300 std::string Next = std::string(std::next(I), E);
tools/clang/lib/Sema/SemaInit.cpp 2114 while (std::next(F) != Field)
tools/clang/lib/Sema/SemaOpenMP.cpp 745 SE = std::next(SI);
2843 std::next(StackComponents.rbegin()),
7775 for (Stmt *SectionStmt : llvm::make_range(std::next(S.begin()), S.end())) {
8018 for (Stmt *SectionStmt : llvm::make_range(std::next(S.begin()), S.end())) {
tools/clang/lib/Sema/SemaTemplate.cpp 3055 auto Nth = std::next(Ts.pack_begin(), Index.getExtValue());
tools/clang/lib/StaticAnalyzer/Core/BugReporter.cpp 538 PathPieces::iterator Next = std::next(I);
tools/clang/lib/StaticAnalyzer/Core/DynamicType.cpp 166 if (std::next(I) != Map.end())
204 if (std::next(SI) != Set.end())
213 if (std::next(I) != Map.end())
tools/clang/lib/StaticAnalyzer/Core/PlistDiagnostics.cpp 997 auto N = std::next(It);
1034 auto N = std::next(ArgIt);
tools/clang/lib/StaticAnalyzer/Core/RangeConstraintManager.cpp 782 if (std::next(I) != Constraints.end())
tools/clang/lib/StaticAnalyzer/Core/RegionStore.cpp 246 if (std::next(CI) != CB.end())
253 if (std::next(I) != end())
tools/clang/lib/Tooling/Core/Replacement.cpp 325 auto MergeEnd = std::next(I);
tools/clang/lib/Tooling/Syntax/BuildTree.cpp 81 return llvm::makeArrayRef(findToken(First), std::next(findToken(Last)));
117 assert((std::next(It) == Trees.end() ||
118 std::next(It)->first == Range.end()) &&
162 ? (std::next(It)->first - It->first)
tools/clang/tools/extra/clang-tidy/modernize/ConcatNestedNamespacesCheck.cpp 55 std::for_each(std::next(Namespaces.begin()), Namespaces.end(),
tools/clang/unittests/Tooling/RefactoringTest.cpp 416 EXPECT_EQ(Replacement("x.cc", 10, 3, ""), *std::next(Replaces.begin()));
tools/clang/utils/TableGen/ClangAttrEmitter.cpp 1583 llvm::make_range(std::next(Spellings.begin()), Spellings.end())) {
tools/lld/COFF/DriverUtils.cpp 895 argv.insert(std::next(argv.begin()), v.begin(), v.end());
899 argv.insert(std::next(argv.begin()), v.begin(), v.end());
tools/lld/ELF/AArch64ErrataFix.cpp 593 auto dataSym = std::next(codeSym);
606 codeSym = std::next(dataSym);
tools/lld/ELF/ARMErrataFix.cpp 488 auto nonThumbSym = std::next(thumbSym);
500 thumbSym = std::next(nonThumbSym);
tools/lld/include/lld/Core/Simple.h 197 it = reinterpret_cast<const void *>(std::next(ref).getNodePtr());
tools/lldb/source/Breakpoint/BreakpointResolver.cpp 276 std::remove_if(std::next(first), worklist_end,
tools/lldb/source/Plugins/ObjectFile/ELF/ObjectFileELF.cpp 1796 for (SectionHeaderCollIter I = std::next(m_section_headers.begin());
tools/lldb/unittests/TestingSupport/Host/NativeProcessTestUtils.h 130 auto Begin = std::next(Data.begin(), Addr);
131 return std::vector<uint8_t>(Begin, std::next(Begin, Size));
tools/llvm-ar/llvm-ar.cpp 852 std::inserter(Ret, std::next(Ret.begin(), InsertPos)));
tools/llvm-xray/xray-account.cpp 209 auto I = std::next(Parent).base();
tools/opt/Debugify.cpp 329 return applyDebugifyMetadata(M, make_range(FuncIt, std::next(FuncIt)),
373 return checkDebugifyMetadata(M, make_range(FuncIt, std::next(FuncIt)),
tools/polly/lib/Analysis/ScopBuilder.cpp 1282 assert(std::next(LoopData) != LoopStack.rend());
tools/verify-uselistorder/verify-uselistorder.cpp 393 if (V->use_empty() || std::next(V->use_begin()) == V->use_end())
435 if (V->use_empty() || std::next(V->use_begin()) == V->use_end())
unittests/ADT/IListTest.cpp 85 EXPECT_TRUE(std::next(List.begin()) == List.end());
90 List.splice(std::next(List.begin()), List, List.begin());
93 EXPECT_EQ(2, std::next(List.begin())->Value);
272 L1.splice(L1.begin(), L1, std::next(L1.begin()), L1.end());
unittests/ADT/IteratorTest.cpp 86 EXPECT_EQ(I, std::next(Begin, i));
128 EXPECT_EQ(I, std::next(Begin, i));
287 EXPECT_EQ(A + 1, std::next(*Begin, 1));
288 EXPECT_EQ(A + 2, std::next(*Begin, 2));
289 EXPECT_EQ(A + 3, std::next(*Begin, 3));
290 EXPECT_EQ(A + 4, std::next(*Begin, 4));
unittests/ADT/STLExtrasTest.cpp 422 L.insert(std::next(L.begin(), 2), -1);
unittests/ADT/SetVectorTest.cpp 24 auto I = S.erase(std::next(S.begin()));
28 EXPECT_EQ(std::next(S.begin()), I);
31 EXPECT_EQ(2, *std::next(S.begin()));
unittests/ADT/SmallPtrSetTest.cpp 254 auto M = std::next(B);
259 int *Removable = *std::next(M);
269 EXPECT_EQ(M, std::next(B));
271 EXPECT_EQ(std::next(M), E);
unittests/ADT/TinyPtrVectorTest.cpp 77 EXPECT_EQ(Values[i], *std::next(V.begin(), i));
79 EXPECT_EQ(V.end(), std::next(V.begin(), Values.size()));
311 this->V.erase(std::next(this->V.begin(), 1));
312 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 1));
314 this->V.erase(std::next(this->V.begin(), 2));
315 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 2));
317 this->V.erase(std::next(this->V.begin(), 5));
318 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 5));
320 this->V.erase(std::next(this->V.begin(), 13));
321 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 13));
343 this->V.erase(this->V.begin(), std::next(this->V.begin(), 1));
345 std::next(this->TestPtrs.begin(), 1));
347 this->V.erase(std::next(this->V.begin(), 1), std::next(this->V.begin(), 2));
347 this->V.erase(std::next(this->V.begin(), 1), std::next(this->V.begin(), 2));
348 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 1),
349 std::next(this->TestPtrs.begin(), 2));
351 this->V.erase(std::next(this->V.begin(), 2), std::next(this->V.begin(), 4));
351 this->V.erase(std::next(this->V.begin(), 2), std::next(this->V.begin(), 4));
352 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 2),
353 std::next(this->TestPtrs.begin(), 4));
355 this->V.erase(std::next(this->V.begin(), 5), std::next(this->V.begin(), 10));
355 this->V.erase(std::next(this->V.begin(), 5), std::next(this->V.begin(), 10));
356 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 5),
357 std::next(this->TestPtrs.begin(), 10));
359 this->V.erase(std::next(this->V.begin(), 13), std::next(this->V.begin(), 26));
359 this->V.erase(std::next(this->V.begin(), 13), std::next(this->V.begin(), 26));
360 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 13),
361 std::next(this->TestPtrs.begin(), 26));
363 this->V.erase(std::next(this->V.begin(), 7), this->V.end());
380 this->V.insert(std::next(this->V.begin(), 3), this->TestPtrs[43]);
381 this->TestPtrs.insert(std::next(this->TestPtrs.begin(), 3),
395 std::next(this->TestPtrs.begin()));
399 std::next(this->TestPtrs.begin(), 2));
403 std::next(this->TestPtrs.begin(), 42));
407 std::next(this->TestPtrs.begin(), 5),
408 std::next(this->TestPtrs.begin(), 13));
410 std::next(this->TestPtrs.begin(), 0),
411 std::next(this->TestPtrs.begin(), 3));
412 this->V.insert(std::next(this->V.begin(), 2),
413 std::next(this->TestPtrs.begin(), 2),
414 std::next(this->TestPtrs.begin(), 4));
415 this->V.erase(std::next(this->V.begin(), 4));
416 this->V.insert(std::next(this->V.begin(), 4),
417 std::next(this->TestPtrs.begin(), 4),
418 std::next(this->TestPtrs.begin(), 5));
unittests/Analysis/LazyCallGraphTest.cpp 275 EXPECT_EQ(A2->end(), std::next(A2->begin()));
278 EXPECT_EQ(A3->end(), std::next(A3->begin()));
289 EXPECT_EQ(B2->end(), std::next(B2->begin()));
292 EXPECT_EQ(B3->end(), std::next(B3->begin()));
303 EXPECT_EQ(C2->end(), std::next(C2->begin()));
306 EXPECT_EQ(C3->end(), std::next(C3->begin()));
310 EXPECT_EQ(D1->end(), std::next(D1->begin()));
313 EXPECT_EQ(D2->end(), std::next(D2->begin()));
316 EXPECT_EQ(D3->end(), std::next(D3->begin()));
353 EXPECT_EQ(&C, &*std::next(CG.postorder_ref_scc_begin()));
371 EXPECT_EQ(&B, &*std::next(CG.postorder_ref_scc_begin(), 2));
389 EXPECT_EQ(&A, &*std::next(CG.postorder_ref_scc_begin(), 3));
392 EXPECT_EQ(J, std::next(CG.postorder_ref_scc_begin(), 4));
440 EXPECT_EQ(&C, &std::next(C->begin())->getNode());
1166 EXPECT_EQ(NewCs.end(), std::next(NewCs.begin()));
1333 EXPECT_EQ(E, std::next(I));
1353 EXPECT_EQ(E, std::next(J));
1411 EXPECT_EQ(E, std::next(I));
1478 EXPECT_EQ(E, std::next(I));
1481 EXPECT_EQ(RC.end(), std::next(RC.begin()));
1506 EXPECT_EQ(E, std::next(J));
1522 EXPECT_EQ(E, std::next(J));
unittests/Analysis/ScalarEvolutionTest.cpp 411 Value *Y = &*std::next(F->arg_begin());
448 Argument *A2 = &*(std::next(F->arg_begin()));
554 auto *L1 = *std::next(LI.begin());
555 auto *L0 = *std::next(LI.begin(), 2);
574 const SCEV *V1 = SE.getSCEV(&*std::next(F.arg_begin(), 1));
575 const SCEV *V2 = SE.getSCEV(&*std::next(F.arg_begin(), 2));
576 const SCEV *V3 = SE.getSCEV(&*std::next(F.arg_begin(), 3));
1424 Argument *B = &*std::next(F->arg_begin());
unittests/Analysis/SparsePropagation.cpp 466 Argument *B = std::next(G->arg_begin());
unittests/ExecutionEngine/Orc/IndirectionUtilsTest.cpp 40 auto *Call = dyn_cast<CallInst>(std::next(II));
unittests/FuzzMutate/OperationsTest.cpp 234 BasicBlock &BB = *std::next(M->getFunction("test")->begin(), 2);
326 ASSERT_TRUE(Descr.SourcePreds[0].matches({}, &*std::next(BB.begin())));
unittests/FuzzMutate/RandomIRBuilderTest.cpp 110 Instruction *Src = &*std::next(BB.begin());
156 SmallVector<Instruction *, 1> Sinks = {&*std::next(BB.begin())};
189 Instruction *Source = &*std::next(BB.begin());
260 Instruction *OpaquePtr = &*std::next(BB.begin());
unittests/IR/InstructionsTest.cpp 134 EXPECT_EQ(b0->op_end(), std::next(b0->op_begin()));
136 EXPECT_EQ(b0->op_end(), std::next(b0->op_begin()));
674 ASSERT_EQ(GEPI->idx_end(), std::next(GEPI->idx_begin(), 3));
683 ASSERT_EQ(CGEPI->idx_end(), std::next(CGEPI->idx_begin(), 3));
721 EXPECT_EQ(CI + 1, std::next(CI));
722 EXPECT_EQ(CI + 2, std::next(CI, 2));
723 EXPECT_EQ(CI + 3, std::next(CI, 3));
740 EXPECT_EQ(CCI + 1, std::next(CCI));
741 EXPECT_EQ(CCI + 2, std::next(CCI, 2));
742 EXPECT_EQ(CCI + 3, std::next(CCI, 3));
unittests/IR/UserTest.cpp 104 EXPECT_EQ(std::next(P.value_op_begin(), 3), I);
113 EXPECT_EQ(std::next(IP->value_op_begin(), 3), CI);
unittests/IR/ValueTest.cpp 42 EXPECT_TRUE(std::next(F->arg_begin())->isUsedInBasicBlock(&F->front()));
unittests/Transforms/Vectorize/VPlanPredicatorTest.cpp 185 &*std::next(InnerIfFSucc->getEntryBasicBlock()->begin(), 1));
unittests/Transforms/Vectorize/VPlanSlpTest.cpp 104 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(Body->begin(), 12));
105 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(Body->begin(), 14));
171 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(Body->begin(), 12));
172 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(Body->begin(), 14));
190 VPInstruction *GetA = cast<VPInstruction>(&*std::next(Body->begin(), 1));
191 VPInstruction *GetB = cast<VPInstruction>(&*std::next(Body->begin(), 3));
238 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(Body->begin(), 8));
239 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(Body->begin(), 10));
297 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(Body->begin(), 5));
298 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(Body->begin(), 10));
329 VPInstruction *LoadvA0 = cast<VPInstruction>(&*std::next(Body->begin(), 2));
330 VPInstruction *LoadvA1 = cast<VPInstruction>(&*std::next(Body->begin(), 12));
337 VPInstruction *LoadvB0 = cast<VPInstruction>(&*std::next(Body->begin(), 4));
338 VPInstruction *LoadvB1 = cast<VPInstruction>(&*std::next(Body->begin(), 14));
347 VPInstruction *LoadvC0 = cast<VPInstruction>(&*std::next(Body->begin(), 7));
348 VPInstruction *LoadvC1 = cast<VPInstruction>(&*std::next(Body->begin(), 17));
355 VPInstruction *LoadvD0 = cast<VPInstruction>(&*std::next(Body->begin(), 9));
356 VPInstruction *LoadvD1 = cast<VPInstruction>(&*std::next(Body->begin(), 19));
425 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(Body->begin(), 24));
426 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(Body->begin(), 26));
497 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(Body->begin(), 24));
498 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(Body->begin(), 26));
569 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(Body->begin(), 24));
570 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(Body->begin(), 26));
645 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(Body->begin(), 24));
646 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(Body->begin(), 26));
707 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(BB2->begin(), 3));
708 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(BB2->begin(), 5));
770 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(BB2->begin(), 1));
771 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(BB2->begin(), 3));
829 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(Body->begin(), 12));
830 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(Body->begin(), 14));
888 VPInstruction *Store1 = cast<VPInstruction>(&*std::next(Body->begin(), 12));
889 VPInstruction *Store2 = cast<VPInstruction>(&*std::next(Body->begin(), 14));
utils/FileCheck/FileCheck.cpp 309 auto DiagNext = std::next(DiagItr);
utils/TableGen/AsmMatcherEmitter.cpp 3162 for (auto J = std::next(I); J != E; ++J) {
utils/TableGen/CodeGenRegisters.cpp 964 for (auto I2 = std::next(I); I2 != E && testSubClass(&RC, &*I2); ++I2)
1607 for (auto I = std::next(Regs.begin()), E = Regs.end(); I != E; ++I) {
1647 for (std::vector<UberRegSet>::iterator I = std::next(UberSets.begin()),
2133 I != std::next(E); ++I) {
2249 I != std::next(E); ++I) {
2318 for (auto I2 = RegClasses.begin(), E2 = std::next(FirstNewRC); I2 != E2;
utils/TableGen/GlobalISelEmitter.cpp 583 const auto &NextI = std::next(I);
utils/TableGen/RegisterInfoEmitter.cpp 936 if (std::next(I) != Regs.end() &&
937 std::next(I)->getNativeRegUnits().count() == RUs.count())
938 ScaleA = *std::next(I)->getNativeRegUnits().begin() - *RUs.begin();