HomeSort by: relevance | last modified time | path
    Searched defs:Sparse (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
SparseSet.h 1 //===- llvm/ADT/SparseSet.h - Sparse set ------------------------*- C++ -*-===//
10 // Briggs, Torczon, "An efficient representation for sparse sets", ACM Letters
13 // A sparse set holds a small number of objects identified by integer keys from
14 // a moderately sized universe. The sparse set uses more memory than other
100 /// SparseSet contains a dense vector holding all the objects and a sparse
102 /// the sparse array which is the size of the key universe. The SparseT
106 /// When SparseT is uint32_t, find() only touches 2 cache lines, but the sparse
110 /// lines, but the sparse array is 4x smaller. N is the number of elements in
132 SparseT *Sparse = nullptr;
147 ~SparseSet() { free(Sparse); }
    [all...]
SparseMultiSet.h 1 //===- llvm/ADT/SparseMultiSet.h - Sparse multiset --------------*- C++ -*-===//
12 // A sparse multiset holds a small number of objects identified by integer keys
13 // from a moderately sized universe. The sparse multiset uses more memory than
54 /// SparseMultiSet contains a dense vector holding all the objects and a sparse
56 /// the sparse array which is the size of the key universe. The SparseT template
60 /// sparse array uses 4 x Universe bytes.
63 /// lines, but the sparse array is 4x smaller. N is the number of elements in
123 SparseT *Sparse = nullptr;
195 ~SparseMultiSet() { free(Sparse); }
209 free(Sparse);
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/
InstrProfWriter.h 40 bool Sparse;
48 InstrProfWriter(bool Sparse = false, bool InstrEntryBBEnabled = false);
108 void setOutputSparse(bool Sparse);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachineVerifier.cpp 2368 unsigned SparseUniverse = Sparse.size();
2377 if (Index < SparseUniverse && Sparse.test(Index))
2394 Sparse.resize(NewSparseUniverse);
2400 Sparse.set(Index);
2409 // VRegs indexed within SparseUniverseMax are tracked by Sparse, those beyound
2412 // number of very sparse VRegFilter instances live at the same time). In
2414 // tracked by Sparse (very large SparseUniverseMax scenario) tends to be more
2418 BitVector Sparse;

Completed in 18 milliseconds