| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVPushPopOptimizer.cpp | 34 MachineBasicBlock::iterator &NextI, bool IsReturnZero); 59 MachineBasicBlock::iterator &NextI, in usePopRet() argument 63 DebugLoc DL = NextI->getDebugLoc(); in usePopRet() 65 BuildMI(*NextI->getParent(), NextI, DL, TII->get(Opc)) in usePopRet() 70 NextI->eraseFromParent(); in usePopRet() 131 MachineBasicBlock::iterator NextI = next_nodbg(MBBI, MBB.end()); in runOnMachineFunction() local 132 if (MBBI != MBB.end() && NextI != MBB.end() && in runOnMachineFunction() 133 NextI->getOpcode() == RISCV::PseudoRET) in runOnMachineFunction() 134 Modified |= usePopRet(MBBI, NextI, adjustRetVal(MBBI)); in runOnMachineFunction()
|
| H A D | RISCVMoveMerger.cpp | 87 MachineBasicBlock::iterator NextI = next_nodbg(I, E); in mergePairedInsns() local 94 if (NextI == Paired) in mergePairedInsns() 95 NextI = next_nodbg(NextI, E); in mergePairedInsns() 119 return NextI; in mergePairedInsns()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Object/ |
| H A D | SymbolSize.cpp | 97 for (unsigned I = 0, NextI = 0, N = Addresses.size() - 1; I < N; ++I) { in computeSymbolSizes() local 103 if (NextI <= I) { in computeSymbolSizes() 104 NextI = I + 1; in computeSymbolSizes() 105 while (NextI < N && Addresses[NextI].Address == P.Address) in computeSymbolSizes() 106 ++NextI; in computeSymbolSizes() 109 uint64_t Size = Addresses[NextI].Address - P.Address; in computeSymbolSizes()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/BPF/ |
| H A D | BPFMISimplifyPatchable.cpp | 201 decltype(End) NextI; in processCandidate() local 202 for (auto I = Begin; I != End; I = NextI) { in processCandidate() 203 NextI = std::next(I); in processCandidate() 228 decltype(End) NextI; in processDstReg() local 229 for (auto I = Begin; I != End; I = NextI) { in processDstReg() 230 NextI = std::next(I); in processDstReg()
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | BugReporter.cpp | 1516 PathPieces::iterator NextI = I; ++NextI; in simplifySimpleBranches() local 1517 if (NextI == E) in simplifySimpleBranches() 1523 if (NextI == E) in simplifySimpleBranches() 1531 ++NextI; in simplifySimpleBranches() 1636 PathPieces::iterator NextI = I; ++NextI; in removeContextCycles() local 1637 if (NextI == E) in removeContextCycles() 1645 ++NextI; in removeContextCycles() 1748 PathPieces::iterator NextI = I; ++NextI; in removeIdenticalEvents() local 1749 if (NextI == E) in removeIdenticalEvents() 1799 PathPieces::iterator NextI = I; ++NextI; in optimizeEdges() local [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonGenExtract.cpp | 234 BasicBlock::iterator I = std::prev(B->end()), NextI, Begin = B->begin(); in visitBlock() local 240 NextI = std::prev(I); in visitBlock() 248 I = NextI; in visitBlock()
|
| H A D | HexagonEarlyIfConv.cpp | 763 MachineBasicBlock::iterator I, NextI; in predicateBlockNB() local 765 for (I = FromB->begin(); I != End; I = NextI) { in predicateBlockNB() 767 NextI = std::next(I); in predicateBlockNB() 984 MachineBasicBlock::iterator I, NextI, NonPHI = B->getFirstNonPHI(); in eliminatePhis() local 985 for (I = B->begin(); I != NonPHI; I = NextI) { in eliminatePhis() 986 NextI = std::next(I); in eliminatePhis()
|
| H A D | HexagonExpandCondsets.cpp | 343 auto NextI = std::next(I); in updateKillFlags() local 344 if (NextI != E && NextI->start.isRegister()) { in updateKillFlags() 345 MachineInstr *DefI = LIS->getInstructionFromIndex(NextI->start); in updateKillFlags()
|
| H A D | HexagonBitSimplify.cpp | 388 decltype(End) NextI; in replaceReg() local 389 for (auto I = Begin; I != End; I = NextI) { in replaceReg() 390 NextI = std::next(I); in replaceReg() 404 decltype(End) NextI; in replaceRegWithSub() local 405 for (auto I = Begin; I != End; I = NextI) { in replaceRegWithSub() 406 NextI = std::next(I); in replaceRegWithSub() 421 decltype(End) NextI; in replaceSubWithSub() local 422 for (auto I = Begin; I != End; I = NextI) { in replaceSubWithSub() 423 NextI = std::next(I); in replaceSubWithSub()
|
| H A D | HexagonFrameLowering.cpp | 2041 MachineBasicBlock::iterator NextI; in expandSpillMacros() local 2042 for (auto I = B.begin(), E = B.end(); I != E; I = NextI) { in expandSpillMacros() 2044 NextI = std::next(I); in expandSpillMacros()
|
| H A D | HexagonConstPropagation.cpp | 847 MachineFunction::const_iterator NextI = std::next(BI); in computeBlockSuccessors() local 848 if (NextI != MB->getParent()->end()) in computeBlockSuccessors() 849 Targets.insert(&*NextI); in computeBlockSuccessors()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64LoadStoreOptimizer.cpp | 748 if (NextI == MergeMI) in mergeNarrowZeroStores() 749 NextI = next_nodbg(NextI, E); in mergeNarrowZeroStores() 815 return NextI; in mergeNarrowZeroStores() 865 if (NextI == Paired) in mergePairedInsns() 866 NextI = next_nodbg(NextI, E); in mergePairedInsns() 1133 return NextI; in mergePairedInsns() 1169 return NextI; in promoteLoadFromStore() 1183 return NextI; in promoteLoadFromStore() 1253 return NextI; in promoteLoadFromStore() 1991 NextI = next_nodbg(NextI, E); in mergeUpdateInsn() [all …]
|
| H A D | AArch64FrameLowering.cpp | 3977 MachineBasicBlock::iterator NextI = ++II; in tryMergeAdjacentSTG() local 3989 NextI != E && Count < kScanLimit; ++NextI) { in tryMergeAdjacentSTG() 3990 MachineInstr &MI = *NextI; in tryMergeAdjacentSTG() 4052 return NextI; in tryMergeAdjacentSTG()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyRegStackify.cpp | 355 auto NextI = std::next(MachineBasicBlock::const_iterator(DefI)); in isSafeToMove() local 356 for (auto E = MBB->end(); NextI != E && NextI->isDebugInstr(); ++NextI) in isSafeToMove() 358 if (NextI == Insert) in isSafeToMove()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | MemCpyOptimizer.cpp | 243 range_iterator NextI = I; in addRange() local 244 while (++NextI != Ranges.end() && End >= NextI->Start) { in addRange() 246 I->TheStores.append(NextI->TheStores.begin(), NextI->TheStores.end()); in addRange() 247 if (NextI->End > I->End) in addRange() 248 I->End = NextI->End; in addRange() 249 Ranges.erase(NextI); in addRange() 250 NextI = I; in addRange()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SparseMultiSet.h | 472 iterator NextI = unlink(Dense[I.Idx]); in erase() local 477 return NextI; in erase()
|
| /freebsd-14.2/contrib/googletest/googletest/include/gtest/internal/ |
| H A D | gtest-param-util.h | 907 constexpr size_t NextI = ThisI - (ThisI != 0); in GTEST_DISABLE_MSC_WARNINGS_POP_() local 909 ++std::get<NextI>(current_); in GTEST_DISABLE_MSC_WARNINGS_POP_() 910 AdvanceIfEnd<NextI>(); in GTEST_DISABLE_MSC_WARNINGS_POP_()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MIRPrinter.cpp | 666 MachineFunction::const_iterator NextI = std::next(MBB.getIterator()); in canPredictSuccessors() local 667 if (NextI != MF.end()) { in canPredictSuccessors() 668 MachineBasicBlock *Next = const_cast<MachineBasicBlock*>(&*NextI); in canPredictSuccessors()
|
| H A D | RDFGraph.cpp | 1017 for (auto I = DefM.begin(), E = DefM.end(), NextI = I; I != E; I = NextI) { in releaseBlock() local 1018 NextI = std::next(I); in releaseBlock()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/MCTargetDesc/ |
| H A D | HexagonMCCodeEmitter.cpp | 474 const MCInst &NextI = *(I+1)->getInst(); in getFixupNoBits() local 475 const MCInstrDesc &NextD = HexagonMCInstrInfo::getDesc(MCII, NextI); in getFixupNoBits() 477 HexagonMCInstrInfo::getType(MCII, NextI) == HexagonII::TypeCR) in getFixupNoBits()
|
| /freebsd-14.2/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | GlobalISelMatchTable.cpp | 310 const auto &NextI = std::next(I); in emitDeclaration() local 312 if (NextI != E) { in emitDeclaration() 313 if (NextI->EmitStr == "" && in emitDeclaration() 314 NextI->Flags == MatchTableRecord::MTRF_LineBreakFollows) in emitDeclaration()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIWholeQuadMode.cpp | 1161 auto NextI = std::next(EndMI->getIterator()); in prepareInsertion() local 1162 if (NextI == MBB.end()) in prepareInsertion() 1164 SlotIndex Next = LIS->getInstructionIndex(*NextI); in prepareInsertion()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/LiveDebugValues/ |
| H A D | VarLocBasedImpl.cpp | 1705 auto NextI = std::next(MI.getIterator()); in isLocationSpill() local 1707 if (MI.getParent()->end() == NextI) in isLocationSpill() 1710 for (const MachineOperand &MONext : NextI->operands()) { in isLocationSpill()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MemoryDependenceAnalysis.cpp | 1647 if (Instruction *NextI = NewDirtyVal.getInst()) in removeInstruction() local 1648 ReverseDepsToAdd.push_back(std::make_pair(NextI, I)); in removeInstruction()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVInstructionSelector.cpp | 1472 const MachineInstr *NextI = I.getNextNode(); in selectBranchCond() local 1474 if (NextI != nullptr && NextI->getOpcode() == SPIRV::OpBranchConditional) in selectBranchCond()
|