Searched refs:SparseSet (Results 1 – 18 of 18) sorted by relevance
| /external/llvm/include/llvm/ADT/ |
| D | SparseSet.h | 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));
|
| /external/regex-re2/util/ |
| D | sparse_set.h | 54 class SparseSet {
56 SparseSet() in SparseSet() function
59 SparseSet(int max_size) { in SparseSet() function
75 ~SparseSet() { in ~SparseSet()
174 DISALLOW_EVIL_CONSTRUCTORS(SparseSet);
|
| /external/llvm/include/llvm/CodeGen/ |
| D | LivePhysRegs.h | 45 SparseSet<unsigned> LiveRegs;
128 typedef SparseSet<unsigned>::const_iterator const_iterator;
|
| D | RegisterPressure.h | 197 SparseSet<unsigned> PhysRegs;
198 SparseSet<unsigned, VirtReg2IndexFunctor> VirtRegs;
267 SparseSet<unsigned, VirtReg2IndexFunctor> UntiedDefs;
|
| D | ScheduleDAGInstrs.h | 67 typedef SparseSet<VReg2SUnit, VirtReg2IndexFunctor> VReg2SUnitMap;
|
| /external/llvm/unittests/ADT/ |
| D | SparseSetTest.cpp | 17 typedef SparseSet<unsigned> USet;
168 typedef SparseSet<Alt> ASet; in TEST()
|
| /external/llvm/lib/CodeGen/ |
| D | VirtRegMap.cpp | 166 SparseSet<unsigned> PhysRegs;
434 for (SparseSet<unsigned>::iterator in rewrite()
439 for (SparseSet<unsigned>::iterator in rewrite()
|
| D | LivePhysRegs.cpp | 26 SparseSet<unsigned>::iterator LRI = LiveRegs.begin(); in removeRegsInMask()
|
| D | MachineTraceMetrics.cpp | 692 SparseSet<LiveRegUnit> &RegUnits, in updatePhysDepsDownwards()
715 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units); in updatePhysDepsDownwards()
793 SparseSet<LiveRegUnit> RegUnits; in computeInstrDepths()
866 SparseSet<LiveRegUnit> &RegUnits, in updatePhysDepsUpwards()
884 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units); in updatePhysDepsUpwards()
991 SparseSet<LiveRegUnit> RegUnits; in computeInstrHeights()
1114 for (SparseSet<LiveRegUnit>::const_iterator in computeInstrHeights()
|
| D | EarlyIfConversion.cpp | 134 SparseSet<unsigned> LiveRegUnits;
318 for (SparseSet<unsigned>::const_iterator in findInsertionPoint()
|
| D | RegisterPressure.cpp | 245 for (SparseSet<unsigned>::const_iterator I = in closeTop()
263 for (SparseSet<unsigned>::const_iterator I = in closeBottom()
|
| D | RegAllocFast.cpp | 85 typedef SparseSet<LiveReg> LiveRegMap;
117 typedef SparseSet<unsigned> UsedInInstrSet;
|
| D | ScheduleDAGInstrs.cpp | 1261 SparseSet<RootData> RootSet;
1348 for (SparseSet<RootData>::const_iterator in finalize()
|
| /external/regex-re2/re2/ |
| D | dfa.cc | 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()
|
| D | prog.cc | 127 typedef SparseSet Workq;
|
| D | onepass.cc | 348 typedef SparseSet Instq;
|
| D | nfa.cc | 629 typedef SparseSet Workq; in ComputeFirstByte()
|
| /external/llvm/docs/ |
| D | ProgrammersManual.rst | 1148 llvm/ADT/SparseSet.h
1151 SparseSet holds a small number of objects identified by unsigned keys of
1156 SparseSet is useful for algorithms that need very fast clear/find/insert/erase
1165 SparseMultiSet adds multiset behavior to SparseSet, while retaining SparseSet's
1166 desirable attributes. Like SparseSet, it typically uses a lot of memory, but
|