| /external/llvm/include/llvm/ADT/ |
| D | SparseSet.h | 120 class SparseSet {
131 SparseSet(const SparseSet&) LLVM_DELETED_FUNCTION;
132 SparseSet &operator=(const SparseSet&) LLVM_DELETED_FUNCTION;
141 SparseSet() : Sparse(0), Universe(0) {}
142 ~SparseSet() { free(Sparse); }
227 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
59 SparseSet(int max_size) { in SparseSet() function
75 ~SparseSet() { in ~SparseSet()
174 DISALLOW_EVIL_CONSTRUCTORS(SparseSet);
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegisterPressure.h | 135 SparseSet<unsigned> PhysRegs;
136 SparseSet<unsigned, VirtReg2IndexFunctor> VirtRegs;
205 SparseSet<unsigned, VirtReg2IndexFunctor> UntiedDefs;
|
| D | ScheduleDAGInstrs.h | 65 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 | MachineTraceMetrics.cpp | 701 SparseSet<LiveRegUnit> &RegUnits, in updatePhysDepsDownwards()
724 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units); in updatePhysDepsDownwards()
802 SparseSet<LiveRegUnit> RegUnits; in computeInstrDepths()
878 SparseSet<LiveRegUnit> &RegUnits, in updatePhysDepsUpwards()
896 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units); in updatePhysDepsUpwards()
1003 SparseSet<LiveRegUnit> RegUnits; in computeInstrHeights()
1126 for (SparseSet<LiveRegUnit>::const_iterator in computeInstrHeights()
|
| D | EarlyIfConversion.cpp | 133 SparseSet<unsigned> LiveRegUnits;
317 for (SparseSet<unsigned>::const_iterator in findInsertionPoint()
|
| D | RegisterPressure.cpp | 280 for (SparseSet<unsigned>::const_iterator I = in closeTop()
298 for (SparseSet<unsigned>::const_iterator I = in closeBottom()
|
| D | RegAllocFast.cpp | 85 typedef SparseSet<LiveReg> LiveRegMap;
117 typedef SparseSet<unsigned> UsedInInstrSet;
|
| D | ScheduleDAGInstrs.cpp | 1030 SparseSet<RootData> RootSet;
1117 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/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/llvm/docs/ |
| D | ProgrammersManual.rst | 1072 llvm/ADT/SparseSet.h
1075 SparseSet holds a small number of objects identified by unsigned keys of
1080 SparseSet is useful for algorithms that need very fast clear/find/insert/erase
1089 SparseMultiSet adds multiset behavior to SparseSet, while retaining SparseSet's
1090 desirable attributes. Like SparseSet, it typically uses a lot of memory, but
|
| /external/v8/src/ |
| D | hydrogen.cc | 1367 class SparseSet { class
1369 SparseSet(Zone* zone, int capacity) in SparseSet() function in v8::internal::SparseSet
1402 DISALLOW_COPY_AND_ASSIGN(SparseSet);
1457 SparseSet visited_on_paths_;
|