HomeSort by relevance Sort by last modified time
    Searched refs:RegMaskSlots (Results 1 - 3 of 3) sorted by null

  /external/llvm/lib/CodeGen/
InterferenceCache.cpp 131 ArrayRef<SlotIndex> RegMaskSlots;
163 RegMaskSlots = LIS->getRegMaskSlotsInBlock(MBBNum);
166 for (unsigned i = 0, e = RegMaskSlots.size();
167 i != e && RegMaskSlots[i] < Limit; ++i)
170 BI->First = RegMaskSlots[i];
223 for (unsigned i = RegMaskSlots.size();
224 i && RegMaskSlots[i-1].getDeadSlot() > Limit; --i)
228 BI->Last = RegMaskSlots[i-1].getDeadSlot();
LiveIntervalAnalysis.cpp 94 RegMaskSlots.clear();
154 for (unsigned i = 0, e = RegMaskSlots.size(); i != e; ++i)
155 OS << ' ' << RegMaskSlots[i];
207 RMB.first = RegMaskSlots.size();
213 RegMaskSlots.push_back(Indexes->getInstructionIndex(MI).getRegSlot());
217 RMB.second = RegMaskSlots.size() - RMB.first;
665 // Start with a binary search of RegMaskSlots to find a starting point.
    [all...]
  /external/llvm/include/llvm/CodeGen/
LiveIntervalAnalysis.h 67 /// RegMaskSlots - Sorted list of instructions with register mask operands.
70 SmallVector<SlotIndex, 8> RegMaskSlots;
72 /// RegMaskBits - This vector is parallel to RegMaskSlots, it holds a
82 /// improve locality when searching in RegMaskSlots.
87 /// RegMaskSlots and RegMaskBits arrays.
221 RegMaskBlocks.push_back(std::make_pair(RegMaskSlots.size(), 0));
312 ArrayRef<SlotIndex> getRegMaskSlots() const { return RegMaskSlots; }
379 /// Compute RegMaskSlots and RegMaskBits.

Completed in 44 milliseconds