Lines Matching defs:Uses

2098   ArrayRef<SlotIndex> Uses = SA->getUseSlots();
2099 if (Uses.size() <= 1)
2102 LLVM_DEBUG(dbgs() << "Split around " << Uses.size()
2112 for (unsigned i = 0; i != Uses.size(); ++i) {
2113 if (const MachineInstr *MI = Indexes->getInstructionFromIndex(Uses[i]))
2118 LLVM_DEBUG(dbgs() << " skip:\t" << Uses[i] << '\t' << *MI);
2122 SlotIndex SegStart = SE->enterIntvBefore(Uses[i]);
2123 SlotIndex SegStop = SE->leaveIntvAfter(Uses[i]);
2155 ArrayRef<SlotIndex> Uses = SA->getUseSlots();
2156 const unsigned NumGaps = Uses.size()-1;
2183 while (Uses[Gap+1].getBoundaryIndex() < IntI.start())
2193 if (Uses[Gap+1].getBaseIndex() >= IntI.stop())
2209 while (Uses[Gap+1].getBoundaryIndex() < I->start)
2217 if (Uses[Gap+1].getBaseIndex() >= I->end)
2245 ArrayRef<SlotIndex> Uses = SA->getUseSlots();
2246 if (Uses.size() <= 2)
2248 const unsigned NumGaps = Uses.size()-1;
2252 for (unsigned i = 0, e = Uses.size(); i != e; ++i)
2253 dbgs() << ' ' << Uses[i];
2266 llvm::lower_bound(RMS, Uses.front().getRegSlot()) - RMS.begin();
2269 // Look for Uses[i] <= RMS <= Uses[i+1].
2270 assert(!SlotIndex::isEarlierInstr(RMS[ri], Uses[i]));
2271 if (SlotIndex::isEarlierInstr(Uses[i+1], RMS[ri]))
2275 if (SlotIndex::isSameInstr(Uses[i+1], RMS[ri]) && i+1 == NumGaps)
2277 LLVM_DEBUG(dbgs() << ' ' << RMS[ri] << ':' << Uses[i] << '-'
2278 << Uses[i + 1]);
2282 while (ri != re && SlotIndex::isEarlierInstr(RMS[ri], Uses[i+1]))
2332 // We will split before Uses[SplitBefore] and after Uses[SplitAfter].
2344 LLVM_DEBUG(dbgs() << printReg(PhysReg, TRI) << ' ' << Uses[SplitBefore]
2345 << '-' << Uses[SplitAfter] << " i=" << MaxGap);
2369 Uses[SplitBefore].distance(Uses[SplitAfter]) +
2417 LLVM_DEBUG(dbgs() << "Best local split range: " << Uses[BestBefore] << '-'
2418 << Uses[BestAfter] << ", " << BestDiff << ", "
2425 SlotIndex SegStart = SE->enterIntvBefore(Uses[BestBefore]);
2426 SlotIndex SegStop = SE->leaveIntvAfter(Uses[BestAfter]);