/external/llvm/include/llvm/ADT/ |
D | SparseSet.h | 120 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/ |
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/chromium_org/third_party/re2/util/ |
D | sparse_set.h | 54 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/ |
D | re2-msan.patch | 29 class SparseSet { 31 SparseSet() 36 SparseSet(int max_size) {
|
/external/llvm/include/llvm/CodeGen/ |
D | LivePhysRegs.h | 45 SparseSet<unsigned> LiveRegs; 128 typedef SparseSet<unsigned>::const_iterator const_iterator;
|
D | RegisterPressure.h | 212 SparseSet<unsigned> PhysRegs; 213 SparseSet<unsigned, VirtReg2IndexFunctor> VirtRegs; 282 SparseSet<unsigned, VirtReg2IndexFunctor> UntiedDefs;
|
D | ScheduleDAGInstrs.h | 67 typedef SparseSet<VReg2SUnit, VirtReg2IndexFunctor> VReg2SUnitMap;
|
/external/llvm/lib/CodeGen/ |
D | VirtRegMap.cpp | 165 SparseSet<unsigned> PhysRegs; 409 for (SparseSet<unsigned>::iterator in rewrite() 414 for (SparseSet<unsigned>::iterator in rewrite()
|
D | LivePhysRegs.cpp | 25 SparseSet<unsigned>::iterator LRI = LiveRegs.begin(); in removeRegsInMask()
|
D | MachineTraceMetrics.cpp | 700 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()
|
D | EarlyIfConversion.cpp | 134 SparseSet<unsigned> LiveRegUnits; 318 for (SparseSet<unsigned>::const_iterator in findInsertionPoint()
|
D | RegisterPressure.cpp | 246 for (SparseSet<unsigned>::const_iterator I = in closeTop() 264 for (SparseSet<unsigned>::const_iterator I = in closeBottom()
|
D | RegAllocFast.cpp | 86 typedef SparseSet<LiveReg> LiveRegMap; 118 typedef SparseSet<unsigned> UsedInInstrSet;
|
D | ScheduleDAGInstrs.cpp | 1243 SparseSet<RootData> RootSet; 1330 for (SparseSet<RootData>::const_iterator in finalize()
|
/external/llvm/unittests/ADT/ |
D | SparseSetTest.cpp | 17 typedef SparseSet<unsigned> USet; 168 typedef SparseSet<Alt> ASet; in TEST()
|
/external/chromium_org/third_party/re2/re2/ |
D | dfa.cc | 386 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()
|
D | prog.cc | 127 typedef SparseSet Workq;
|
D | onepass.cc | 348 typedef SparseSet Instq;
|
D | nfa.cc | 629 typedef SparseSet Workq; in ComputeFirstByte()
|
/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 | 1146 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
|