Searched refs:LastInstr (Results 1 - 4 of 4) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DSplitKit.h124 SlotIndex LastInstr; ///< Last instr accessing current reg. member in struct:llvm::SplitAnalysis::BlockInfo
132 return SlotIndex::isSameInstr(FirstInstr, LastInstr);
H A DSplitKit.cpp257 BI.LastInstr = UseI[-1];
258 assert(BI.LastInstr < Stop);
276 BI.LastInstr = LastStop;
288 UseBlocks.back().LastInstr = LastStop;
1587 if (!BI.LiveOut || BI.LastInstr < LastSplitPoint) {
1588 useIntv(SegStart, leaveIntvAfter(BI.LastInstr));
1593 overlapIntv(SegStop, BI.LastInstr);
1718 << BI.LastInstr << ", reg-in " << IntvIn
1726 if (!BI.LiveOut && (!LeaveBefore || LeaveBefore >= BI.LastInstr)) {
1734 useIntv(Start, BI.LastInstr);
[all...]
H A DRegAllocGreedy.cpp1194 !LIS->getInstructionFromIndex(BI.LastInstr)->isImplicitDef())
1213 } else if (Intf.first() < BI.LastInstr) {
1230 } else if (Intf.last() > BI.LastInstr) {
2144 BI.LiveOut ? BI.LastInstr.getBoundaryIndex() : BI.LastInstr;
2155 // LastInstr, so we don't need InterferenceQuery.
2224 // that the interval is continuous from FirstInstr to LastInstr. We should
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoadStoreVectorizer.cpp587 BasicBlock::iterator LastInstr = C0->getIterator(); local
600 LastInstr = I.getIterator();
606 return std::make_pair(FirstInstr, ++LastInstr);

Completed in 137 milliseconds