Searched refs:NextInst (Results 1 – 5 of 5) sorted by relevance
285 if (Instruction *NextInst = I.getNextNode()) in collectInstructionsInBetween() local286 WorkList.insert(NextInst); in collectInstructionsInBetween()
708 auto NextInst = ++F->getIterator(); in AddFlushBeforeForkAndExec() local721 Parent->splitBasicBlock(NextInst); in AddFlushBeforeForkAndExec()733 auto NextInst = ++E->getIterator(); in AddFlushBeforeForkAndExec() local743 Builder.SetInsertPoint(&*NextInst); in AddFlushBeforeForkAndExec()749 Parent->splitBasicBlock(NextInst); in AddFlushBeforeForkAndExec()
1863 Instruction *NextInst = II->getNextNonDebugInstruction(); in visitCallInst() local1866 if (!isSafeToSpeculativelyExecute(NextInst)) in visitCallInst()1868 NextInst = NextInst->getNextNonDebugInstruction(); in visitCallInst()1871 if (match(NextInst, in visitCallInst()1879 while (MoveI != NextInst) { in visitCallInst()1886 eraseInstFromFunction(*NextInst); in visitCallInst()
891 auto NextInst = std::next(MI.getIterator()); in handleDebugInstr() local895 return NextInst; in handleDebugInstr()
7152 unsigned NextInst = 0, MaxInst = VL.size(); in tryToVectorizeList() local7153 for (unsigned VF = MaxVF; NextInst + 1 < MaxInst && VF >= MinVF; VF /= 2) { in tryToVectorizeList()7160 for (unsigned I = NextInst; I < MaxInst; ++I) { in tryToVectorizeList()7215 NextInst = I + 1; in tryToVectorizeList()