| /external/llvm/include/llvm/ADT/ |
| H A D | SparseSet.h | 1 //===--- llvm/ADT/SparseSet.h - Sparse set ----------------------*- C++ -*-===//
10 // This file defines the SparseSet class derived from the version described in
30 /// SparseSetValTraits - Objects in a SparseSet are identified by keys that can
33 /// long as an index can still be derived from the value. SparseSet never
36 /// object. To compute the index from a key, SparseSet uses a separate
39 /// A simple type declaration, SparseSet<Type>, handles these cases:
43 /// The type declaration SparseSet<Type, UnaryFunction> handles:
79 /// SparseSet - Fast set implmentation for objects that can be identified by
82 /// SparseSet allocates memory proportional to the size of the key universe, so
86 /// Compared to DenseSet and DenseMap, SparseSet provide
120 class SparseSet { class in namespace:llvm
146 SparseSet() : Sparse(nullptr), Universe(0) {} function in class:llvm::SparseSet
[all...] |
| /external/chromium_org/third_party/re2/util/ |
| H A D | sparse_set.h | 7 // SparseSet<T>(m) is a set of integers in [0, m).
26 // change after visiting. Thus SparseSet can be a convenient
29 // The SparseSet implementation is NOT thread-safe. It is up to the
34 // The SparseSet interface does not present all the usual STL bells and
54 class SparseSet { class in namespace:re2
56 SparseSet() function in class:re2::SparseSet
60 SparseSet(int max_size) { function in class:re2::SparseSet
76 ~SparseSet() {
175 DISALLOW_EVIL_CONSTRUCTORS(SparseSet);
|
| /external/regex-re2/util/ |
| H A D | sparse_set.h | 7 // SparseSet<T>(m) is a set of integers in [0, m).
26 // change after visiting. Thus SparseSet can be a convenient
29 // The SparseSet implementation is NOT thread-safe. It is up to the
34 // The SparseSet interface does not present all the usual STL bells and
54 class SparseSet { class in namespace:re2
56 SparseSet() function in class:re2::SparseSet
59 SparseSet(int max_size) { function in class:re2::SparseSet
75 ~SparseSet() {
174 DISALLOW_EVIL_CONSTRUCTORS(SparseSet);
|
| /external/llvm/include/llvm/CodeGen/ |
| H A D | LivePhysRegs.h | 32 #include "llvm/ADT/SparseSet.h"
45 SparseSet<unsigned> LiveRegs;
128 typedef SparseSet<unsigned>::const_iterator const_iterator;
|
| H A D | RegisterPressure.h | 18 #include "llvm/ADT/SparseSet.h"
212 SparseSet<unsigned> PhysRegs;
213 SparseSet<unsigned, VirtReg2IndexFunctor> VirtRegs;
282 SparseSet<unsigned, VirtReg2IndexFunctor> UntiedDefs;
|
| H A D | ScheduleDAGInstrs.h | 19 #include "llvm/ADT/SparseSet.h"
63 /// Use SparseSet as a SparseMap by relying on the fact that it never
67 typedef SparseSet<VReg2SUnit, VirtReg2IndexFunctor> VReg2SUnitMap;
|
| /external/llvm/lib/CodeGen/ |
| H A D | LivePhysRegs.cpp | 25 SparseSet<unsigned>::iterator LRI = LiveRegs.begin();
|
| H A D | VirtRegMap.cpp | 22 #include "llvm/ADT/SparseSet.h"
165 SparseSet<unsigned> PhysRegs;
273 // Here we have a SparseSet to hold which PhysRegs are actually encountered
409 for (SparseSet<unsigned>::iterator
414 for (SparseSet<unsigned>::iterator
|
| H A D | MachineTraceMetrics.cpp | 12 #include "llvm/ADT/SparseSet.h"
700 SparseSet<LiveRegUnit> &RegUnits,
723 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units);
801 SparseSet<LiveRegUnit> RegUnits;
874 SparseSet<LiveRegUnit> &RegUnits,
892 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units);
999 SparseSet<LiveRegUnit> RegUnits;
1122 for (SparseSet<LiveRegUnit>::const_iterator
|
| H A D | EarlyIfConversion.cpp | 23 #include "llvm/ADT/SparseSet.h"
134 SparseSet<unsigned> LiveRegUnits;
318 for (SparseSet<unsigned>::const_iterator
|
| H A D | RegAllocFast.cpp | 21 #include "llvm/ADT/SparseSet.h"
86 typedef SparseSet<LiveReg> LiveRegMap;
118 typedef SparseSet<unsigned> UsedInInstrSet;
|
| H A D | RegisterPressure.cpp | 246 for (SparseSet<unsigned>::const_iterator I =
264 for (SparseSet<unsigned>::const_iterator I =
|
| H A D | ScheduleDAGInstrs.cpp | 1243 SparseSet<RootData> RootSet;
1330 for (SparseSet<RootData>::const_iterator
|
| /external/llvm/unittests/ADT/ |
| H A D | SparseSetTest.cpp | 1 //===------ ADT/SparseSetTest.cpp - SparseSet unit tests - -----*- C++ -*-===//
10 #include "llvm/ADT/SparseSet.h"
17 typedef SparseSet<unsigned> USet;
168 typedef SparseSet<Alt> ASet;
|
| /external/chromium_org/third_party/re2/re2/ |
| H A D | dfa.cc | 386 class DFA::Workq : public SparseSet {
390 SparseSet(n+maxmark),
402 SparseSet::clear();
410 SparseSet::insert_new(nextmark_++);
425 SparseSet::insert_new(id);
|
| H A D | prog.cc | 127 typedef SparseSet Workq;
|
| H A D | onepass.cc | 348 typedef SparseSet Instq;
|
| H A D | nfa.cc | 629 typedef SparseSet Workq;
|
| /external/regex-re2/re2/ |
| H A D | dfa.cc | 384 class DFA::Workq : public SparseSet {
388 SparseSet(n+maxmark),
400 SparseSet::clear();
408 SparseSet::insert_new(nextmark_++);
423 SparseSet::insert_new(id);
|
| H A D | prog.cc | 127 typedef SparseSet Workq;
|
| H A D | onepass.cc | 348 typedef SparseSet Instq;
|
| H A D | nfa.cc | 629 typedef SparseSet Workq;
|