Home
last modified time | relevance | path

Searched refs:SparseSet (Results 1 – 24 of 24) sorted by relevance

/external/llvm/include/llvm/ADT/
DSparseSet.h120 class SparseSet {
136 SparseSet(const SparseSet&) LLVM_DELETED_FUNCTION;
137 SparseSet &operator=(const SparseSet&) LLVM_DELETED_FUNCTION;
146 SparseSet() : Sparse(nullptr), Universe(0) {}
147 ~SparseSet() { free(Sparse); }
229 return const_cast<SparseSet*>(this)->findIndex(KeyIndexOf(Key));
/external/regex-re2/util/
Dsparse_set.h54 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/chromium_org/third_party/re2/util/
Dsparse_set.h54 class SparseSet {
56 SparseSet() in SparseSet() function
60 SparseSet(int max_size) { in SparseSet() function
76 ~SparseSet() { in ~SparseSet()
175 DISALLOW_EVIL_CONSTRUCTORS(SparseSet);
/external/chromium_org/third_party/re2/patches/
Dre2-msan.patch29 class SparseSet {
31 SparseSet()
36 SparseSet(int max_size) {
/external/llvm/include/llvm/CodeGen/
DLivePhysRegs.h45 SparseSet<unsigned> LiveRegs;
128 typedef SparseSet<unsigned>::const_iterator const_iterator;
DRegisterPressure.h212 SparseSet<unsigned> PhysRegs;
213 SparseSet<unsigned, VirtReg2IndexFunctor> VirtRegs;
282 SparseSet<unsigned, VirtReg2IndexFunctor> UntiedDefs;
DScheduleDAGInstrs.h67 typedef SparseSet<VReg2SUnit, VirtReg2IndexFunctor> VReg2SUnitMap;
/external/llvm/lib/CodeGen/
DVirtRegMap.cpp165 SparseSet<unsigned> PhysRegs;
409 for (SparseSet<unsigned>::iterator in rewrite()
414 for (SparseSet<unsigned>::iterator in rewrite()
DLivePhysRegs.cpp25 SparseSet<unsigned>::iterator LRI = LiveRegs.begin(); in removeRegsInMask()
DMachineTraceMetrics.cpp700 SparseSet<LiveRegUnit> &RegUnits, in updatePhysDepsDownwards()
723 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units); in updatePhysDepsDownwards()
801 SparseSet<LiveRegUnit> RegUnits; in computeInstrDepths()
874 SparseSet<LiveRegUnit> &RegUnits, in updatePhysDepsUpwards()
892 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units); in updatePhysDepsUpwards()
999 SparseSet<LiveRegUnit> RegUnits; in computeInstrHeights()
1122 for (SparseSet<LiveRegUnit>::const_iterator in computeInstrHeights()
DEarlyIfConversion.cpp134 SparseSet<unsigned> LiveRegUnits;
318 for (SparseSet<unsigned>::const_iterator in findInsertionPoint()
DRegisterPressure.cpp246 for (SparseSet<unsigned>::const_iterator I = in closeTop()
264 for (SparseSet<unsigned>::const_iterator I = in closeBottom()
DRegAllocFast.cpp86 typedef SparseSet<LiveReg> LiveRegMap;
118 typedef SparseSet<unsigned> UsedInInstrSet;
DScheduleDAGInstrs.cpp1243 SparseSet<RootData> RootSet;
1330 for (SparseSet<RootData>::const_iterator in finalize()
/external/llvm/unittests/ADT/
DSparseSetTest.cpp17 typedef SparseSet<unsigned> USet;
168 typedef SparseSet<Alt> ASet; in TEST()
/external/chromium_org/third_party/re2/re2/
Ddfa.cc386 class DFA::Workq : public SparseSet {
390 SparseSet(n+maxmark), in Workq()
402 SparseSet::clear(); in clear()
410 SparseSet::insert_new(nextmark_++); in mark()
425 SparseSet::insert_new(id); in insert_new()
Dprog.cc127 typedef SparseSet Workq;
Donepass.cc348 typedef SparseSet Instq;
Dnfa.cc629 typedef SparseSet Workq; in ComputeFirstByte()
/external/regex-re2/re2/
Ddfa.cc384 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()
Dprog.cc127 typedef SparseSet Workq;
Donepass.cc348 typedef SparseSet Instq;
Dnfa.cc629 typedef SparseSet Workq; in ComputeFirstByte()
/external/llvm/docs/
DProgrammersManual.rst1146 llvm/ADT/SparseSet.h
1149 SparseSet holds a small number of objects identified by unsigned keys of
1154 SparseSet is useful for algorithms that need very fast clear/find/insert/erase
1163 SparseMultiSet adds multiset behavior to SparseSet, while retaining SparseSet's
1164 desirable attributes. Like SparseSet, it typically uses a lot of memory, but