Searched refs:SparseSet (Results 1 – 16 of 16) sorted by relevance
120 class SparseSet {136 SparseSet(const SparseSet&) = delete;137 SparseSet &operator=(const SparseSet&) = delete;146 SparseSet() : Sparse(nullptr), Universe(0) {}147 ~SparseSet() { free(Sparse); }229 return const_cast<SparseSet*>(this)->findIndex(KeyIndexOf(Key));
54 class SparseSet {56 SparseSet() in SparseSet() function59 SparseSet(int max_size) { in SparseSet() function75 ~SparseSet() { in ~SparseSet()174 DISALLOW_EVIL_CONSTRUCTORS(SparseSet);
45 SparseSet<unsigned> LiveRegs;129 typedef SparseSet<unsigned>::const_iterator const_iterator;
202 SparseSet<unsigned> Regs;297 SparseSet<unsigned, VirtReg2IndexFunctor> UntiedDefs;
77 typedef SparseSet<VReg2SUnit, VirtReg2IndexFunctor> VReg2SUnitMap;
17 typedef SparseSet<unsigned> USet;168 typedef SparseSet<Alt> ASet; in TEST()
692 SparseSet<LiveRegUnit> &RegUnits, in updatePhysDepsDownwards()717 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units); in updatePhysDepsDownwards()793 SparseSet<LiveRegUnit> RegUnits; in computeInstrDepths()865 SparseSet<LiveRegUnit> &RegUnits, in updatePhysDepsUpwards()886 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units); in updatePhysDepsUpwards()993 SparseSet<LiveRegUnit> RegUnits; in computeInstrHeights()1114 for (SparseSet<LiveRegUnit>::const_iterator in computeInstrHeights()
31 SparseSet<unsigned>::iterator LRI = LiveRegs.begin(); in removeRegsInMask()
134 SparseSet<unsigned> LiveRegUnits;318 for (SparseSet<unsigned>::const_iterator in findInsertionPoint()
85 typedef SparseSet<LiveReg> LiveRegMap;117 typedef SparseSet<unsigned> UsedInInstrSet;
1396 SparseSet<RootData> RootSet;1483 for (SparseSet<RootData>::const_iterator in finalize()
384 class DFA::Workq : public SparseSet {388 SparseSet(n+maxmark), in Workq()400 SparseSet::clear(); in clear()408 SparseSet::insert_new(nextmark_++); in mark()423 SparseSet::insert_new(id); in insert_new()
127 typedef SparseSet Workq;
348 typedef SparseSet Instq;
629 typedef SparseSet Workq; in ComputeFirstByte()
1155 llvm/ADT/SparseSet.h1158 SparseSet holds a small number of objects identified by unsigned keys of1163 SparseSet is useful for algorithms that need very fast clear/find/insert/erase1172 SparseMultiSet adds multiset behavior to SparseSet, while retaining SparseSet's1173 desirable attributes. Like SparseSet, it typically uses a lot of memory, but