• Home
  • Raw
  • Download

Lines Matching refs:LSP

61   std::pair<SlotIndex, SlotIndex> &LSP = LastSplitPoint[Num];  in computeLastSplitPoint()  local
66 if (!LSP.first.isValid()) { in computeLastSplitPoint()
69 LSP.first = MBBEnd; in computeLastSplitPoint()
71 LSP.first = LIS.getInstructionIndex(FirstTerm); in computeLastSplitPoint()
75 return LSP.first; in computeLastSplitPoint()
77 LSP.second = LSP.first; in computeLastSplitPoint()
82 LSP.second = LIS.getInstructionIndex(I); in computeLastSplitPoint()
90 if (!LPad || !LSP.second || !LIS.isLiveInToMBB(*CurLI, LPad)) in computeLastSplitPoint()
91 return LSP.first; in computeLastSplitPoint()
96 return LSP.first; in computeLastSplitPoint()
102 if (!SlotIndex::isEarlierInstr(VNI->def, LSP.second) && VNI->def < MBBEnd) in computeLastSplitPoint()
103 return LSP.first; in computeLastSplitPoint()
107 return LSP.second; in computeLastSplitPoint()
112 SlotIndex LSP = getLastSplitPoint(MBB->getNumber()); in getLastSplitPointIter() local
113 if (LSP == LIS.getMBBEndIdx(MBB)) in getLastSplitPointIter()
115 return LIS.getInstructionFromIndex(LSP); in getLastSplitPointIter()
1214 SlotIndex LSP = SA.getLastSplitPoint(MBBNum); in splitLiveThroughBlock() local
1215 assert((!IntvOut || !EnterAfter || EnterAfter < LSP) && "Impossible intf"); in splitLiveThroughBlock()
1227 if (LeaveBefore && LeaveBefore < LSP) { in splitLiveThroughBlock()
1286 SlotIndex LSP = SA.getLastSplitPoint(BI.MBB->getNumber()); in splitRegInBlock() local
1299 if (BI.LastInstr < LSP) { in splitRegInBlock()
1308 SlotIndex Idx = leaveIntvBefore(LSP); in splitRegInBlock()
1323 if (!BI.LiveOut || BI.LastInstr < LSP) { in splitRegInBlock()
1343 SlotIndex To = leaveIntvBefore(LSP); in splitRegInBlock()
1362 SlotIndex LSP = SA.getLastSplitPoint(BI.MBB->getNumber()); in splitRegOutBlock() local
1366 assert((!EnterAfter || EnterAfter < LSP) && "Bad interference"); in splitRegOutBlock()
1388 SlotIndex Idx = enterIntvBefore(std::min(LSP, BI.FirstInstr)); in splitRegOutBlock()