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

  /external/llvm/include/llvm/CodeGen/
LiveRegMatrix.h 17 // LiveRegMatrix is represented as a LiveIntervalUnion per register unit. When
19 // the virtual register is inserted into the LiveIntervalUnion for each regunit
28 #include "llvm/CodeGen/LiveIntervalUnion.h"
48 // The matrix is represented as a LiveIntervalUnion per register unit.
49 LiveIntervalUnion::Allocator LIUAlloc;
50 LiveIntervalUnion::Array Matrix;
53 std::unique_ptr<LiveIntervalUnion::Query[]> Queries;
138 LiveIntervalUnion::Query &query(LiveInterval &VirtReg, unsigned RegUnit);
142 LiveIntervalUnion *getLiveUnions() { return &Matrix[0]; }
LiveIntervalUnion.h 1 //===-- LiveIntervalUnion.h - Live interval union data struct --*- C++ -*--===//
10 // LiveIntervalUnion is a union of live segments across multiple live virtual
33 /// Compare a live virtual register segment to a LiveIntervalUnion segment.
44 class LiveIntervalUnion {
66 explicit LiveIntervalUnion(Allocator &a) : Tag(0), Segments(a) {}
106 LiveIntervalUnion *LiveUnion;
119 Query(LiveInterval *VReg, LiveIntervalUnion *LIU):
135 void init(unsigned UTag, LiveInterval *VReg, LiveIntervalUnion *LIU) {
183 LiveIntervalUnion *LIUs;
190 void init(LiveIntervalUnion::Allocator&, unsigned Size)
    [all...]
  /external/llvm/lib/CodeGen/
LiveIntervalUnion.cpp 1 //===-- LiveIntervalUnion.cpp - Live interval union data structure --------===//
10 // LiveIntervalUnion represents a coalesced set of live intervals. This may be
16 #include "llvm/CodeGen/LiveIntervalUnion.h"
29 void LiveIntervalUnion::unify(LiveInterval &VirtReg) {
56 void LiveIntervalUnion::extract(LiveInterval &VirtReg) {
82 LiveIntervalUnion::print(raw_ostream &OS, const TargetRegisterInfo *TRI) const {
96 void LiveIntervalUnion::verify(LiveVirtRegBitSet& VisitedVRegs) {
104 bool LiveIntervalUnion::Query::isSeenInterference(LiveInterval *VirtReg) const {
119 unsigned LiveIntervalUnion::Query::
184 void LiveIntervalUnion::Array::init(LiveIntervalUnion::Allocator &Alloc
    [all...]
InterferenceCache.h 18 #include "llvm/CodeGen/LiveIntervalUnion.h"
26 LiveIntervalUnion *LIUArray;
67 /// Iterator pointing into the LiveIntervalUnion containing virtual
69 LiveIntervalUnion::SegmentIter VirtI;
80 RegUnitInfo(LiveIntervalUnion &LIU)
113 void revalidate(LiveIntervalUnion *LIUArray, const TargetRegisterInfo *TRI);
116 bool valid(LiveIntervalUnion *LIUArray, const TargetRegisterInfo *TRI);
120 LiveIntervalUnion *LIUArray,
163 void init(MachineFunction*, LiveIntervalUnion*, SlotIndexes*, LiveIntervals*,
LiveRegMatrix.cpp 58 Queries.reset(new LiveIntervalUnion::Query[NumRegUnits]);
69 // No need to clear Queries here, since LiveIntervalUnion::Query doesn't
133 LiveIntervalUnion::Query &LiveRegMatrix::query(LiveInterval &VirtReg,
135 LiveIntervalUnion::Query &Q = Queries[RegUnit];
InterferenceCache.cpp 43 LiveIntervalUnion *liuarray,
81 void InterferenceCache::Entry::revalidate(LiveIntervalUnion *LIUArray,
93 LiveIntervalUnion *LIUArray,
111 bool InterferenceCache::Entry::valid(LiveIntervalUnion *LIUArray,
156 LiveIntervalUnion::SegmentIter &I = RegUnits[i].VirtI;
207 LiveIntervalUnion::SegmentIter &I = RegUnits[i].VirtI;
Android.mk 39 LiveIntervalUnion.cpp \
RegAllocBasic.cpp 175 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, *Units);
RegAllocGreedy.cpp 622 LiveIntervalUnion::Query subQ(&VirtReg, &Matrix->getLiveUnions()[*Units]);
696 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, *Units);
772 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, *Units);
    [all...]

Completed in 547 milliseconds