Searched refs:LiveIntervalUnion (Results 1 - 9 of 9) sorted by relevance
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/ |
H A D | LiveIntervalUnion.cpp | 1 //===-- LiveIntervalUnion.cpp - Live interval union data structure --------===// 10 // LiveIntervalUnion represents a coalesced set of live intervals. This may be 17 #include "llvm/CodeGen/LiveIntervalUnion.h" 28 void LiveIntervalUnion::unify(LiveInterval &VirtReg) { 55 void LiveIntervalUnion::extract(LiveInterval &VirtReg) { 81 LiveIntervalUnion::print(raw_ostream &OS, const TargetRegisterInfo *TRI) const { 95 void LiveIntervalUnion::verify(LiveVirtRegBitSet& VisitedVRegs) { 103 bool LiveIntervalUnion::Query::isSeenInterference(LiveInterval *VirtReg) const { 118 unsigned LiveIntervalUnion::Query:: 183 void LiveIntervalUnion [all...] |
H A D | 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) : VirtTag(LIU.getTag()), Fixed(0) { 112 void revalidate(LiveIntervalUnion *LIUArray, const TargetRegisterInfo *TRI); 115 bool valid(LiveIntervalUnion *LIUArray, const TargetRegisterInfo *TRI); 119 LiveIntervalUnion *LIUArray, 153 void init(MachineFunction*, LiveIntervalUnion*, SlotIndexes*, LiveIntervals*,
|
H A D | LiveRegMatrix.cpp | 57 Queries.reset(new LiveIntervalUnion::Query[NumRegUnits]); 130 LiveIntervalUnion::Query &LiveRegMatrix::query(LiveInterval &VirtReg, 132 LiveIntervalUnion::Query &Q = Queries[RegUnit];
|
H A D | InterferenceCache.cpp | 26 LiveIntervalUnion *liuarray, 64 void InterferenceCache::Entry::revalidate(LiveIntervalUnion *LIUArray, 76 LiveIntervalUnion *LIUArray, 94 bool InterferenceCache::Entry::valid(LiveIntervalUnion *LIUArray, 139 LiveIntervalUnion::SegmentIter &I = RegUnits[i].VirtI; 190 LiveIntervalUnion::SegmentIter &I = RegUnits[i].VirtI;
|
H A D | RegAllocBasic.cpp | 176 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, *Units);
|
H A D | RegAllocGreedy.cpp | 509 LiveIntervalUnion::Query subQ(&VirtReg, &Matrix->getLiveUnions()[*Units]); 579 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, *Units); 655 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, *Units); 1443 LiveIntervalUnion::SegmentIter IntI =
|
/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | 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 29 #include "llvm/CodeGen/LiveIntervalUnion.h" 49 // The matrix is represented as a LiveIntervalUnion per register unit. 50 LiveIntervalUnion::Allocator LIUAlloc; 51 LiveIntervalUnion::Array Matrix; 54 OwningArrayPtr<LiveIntervalUnion::Query> Queries; 139 LiveIntervalUnion::Query &query(LiveInterval &VirtReg, unsigned RegUnit); 143 LiveIntervalUnion *getLiveUnions() { return &Matrix[0]; }
|
H A D | 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 { class in namespace:llvm 66 explicit LiveIntervalUnion(Allocator &a) : Tag(0), Segments(a) {} function in class:llvm::LiveIntervalUnion 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 [all...] |
/freebsd-10.1-release/lib/clang/libllvmcodegen/ |
H A D | Makefile | 40 LiveIntervalUnion.cpp \
|
Completed in 161 milliseconds