Searched refs:SparseSet (Results 1 - 14 of 14) sorted by relevance

/external/llvm/include/llvm/ADT/
H A DSparseSet.h1 //===--- 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
141 SparseSet() : Sparse(0), Universe(0) {} function in class:llvm::SparseSet
[all...]
/external/regex-re2/util/
H A Dsparse_set.h7 // 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
74 ~SparseSet() {
172 DISALLOW_EVIL_CONSTRUCTORS(SparseSet);
/external/llvm/include/llvm/CodeGen/
H A DRegisterPressure.h20 #include "llvm/ADT/SparseSet.h"
160 SparseSet<unsigned> LivePhysRegs;
161 SparseSet<unsigned, VirtReg2IndexFunctor> LiveVirtRegs;
H A DScheduleDAGInstrs.h24 #include "llvm/ADT/SparseSet.h"
120 /// Combine a SparseSet with a 1x1 vector to track physical registers.
121 /// The SparseSet allows iterating over the (few) live registers for quickly
127 SparseSet<unsigned> PhysRegSet;
130 typedef SparseSet<unsigned>::const_iterator const_iterator;
166 /// Use SparseSet as a SparseMap by relying on the fact that it never
170 typedef SparseSet<VReg2SUnit, VirtReg2IndexFunctor> VReg2SUnitMap;
/external/llvm/unittests/ADT/
H A DSparseSetTest.cpp1 //===------ ADT/SparseSetTest.cpp - SparseSet unit tests - -----*- C++ -*-===//
10 #include "llvm/ADT/SparseSet.h"
17 typedef SparseSet<unsigned> USet;
168 typedef SparseSet<Alt> ASet;
/external/llvm/lib/CodeGen/
H A DMachineTraceMetrics.cpp23 #include "llvm/ADT/SparseSet.h"
605 SparseSet<LiveRegUnit> &RegUnits,
628 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units);
706 SparseSet<LiveRegUnit> RegUnits;
771 SparseSet<LiveRegUnit> &RegUnits,
789 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units);
901 SparseSet<LiveRegUnit> RegUnits;
1012 for (SparseSet<LiveRegUnit>::const_iterator
H A DEarlyIfConversion.cpp25 #include "llvm/ADT/SparseSet.h"
133 SparseSet<unsigned> LiveRegUnits;
317 for (SparseSet<unsigned>::const_iterator
H A DRegisterPressure.cpp228 for (SparseSet<unsigned>::const_iterator I =
250 for (SparseSet<unsigned>::const_iterator I =
272 /// Return true if Reg aliases a register in Regs SparseSet.
273 static bool hasRegAlias(unsigned Reg, SparseSet<unsigned> &Regs,
H A DRegAllocFast.cpp35 #include "llvm/ADT/SparseSet.h"
85 typedef SparseSet<LiveReg> LiveRegMap;
/external/regex-re2/re2/
H A Ddfa.cc357 class DFA::Workq : public SparseSet {
361 SparseSet(n+maxmark),
373 SparseSet::clear();
381 SparseSet::insert_new(nextmark_++);
396 SparseSet::insert_new(id);
H A Dprog.cc127 typedef SparseSet Workq;
H A Donepass.cc348 typedef SparseSet Instq;
H A Dnfa.cc629 typedef SparseSet Workq;
/external/v8/src/
H A Dhydrogen.cc1367 class SparseSet { class in namespace:v8::internal
1369 SparseSet(Zone* zone, int capacity) function in class:v8::internal::SparseSet
1402 DISALLOW_COPY_AND_ASSIGN(SparseSet);
1457 SparseSet visited_on_paths_;

Completed in 272 milliseconds