HomeSort by: relevance | last modified time | path
    Searched refs:IndexT (Results 1 - 6 of 6) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/lib/tsan/rtl/
tsan_dense_alloc.h 30 typedef u32 IndexT;
32 IndexT cache[kSize];
40 typedef typename Cache::IndexT IndexT;
46 CHECK_GE(1ull << (sizeof(IndexT) * 8), kL1Size * kL2Size);
48 CHECK_GE(sizeof(T), sizeof(IndexT));
62 IndexT Alloc(Cache *c) {
68 void Free(Cache *c, IndexT idx) {
75 T *Map(IndexT idx) {
84 IndexT idx = c->cache[--c->pos]
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/tsan/tests/unit/
tsan_dense_alloc_test.cc 27 typedef Alloc::IndexT IndexT;
34 IndexT blocks[N];
37 IndexT idx = alloc.Alloc(&cache);
45 IndexT idx = blocks[i];
  /src/external/gpl3/gcc.old/dist/libsanitizer/tsan/
tsan_dense_alloc.h 28 typedef u32 IndexT;
30 IndexT cache[kSize];
39 typedef typename Cache::IndexT IndexT;
45 static_assert((kL1Size * kL2Size) <= (1ull << (sizeof(IndexT) * 8)),
49 static_assert(sizeof(T) > sizeof(IndexT),
68 IndexT Alloc(Cache *c) {
74 void Free(Cache *c, IndexT idx) {
81 T *Map(IndexT idx) {
92 IndexT idx = c->cache[--c->pos]
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
CoalescingBitVector.h 36 /// \tparam IndexT - The type of the index into the bitvector.
37 template <typename IndexT> class CoalescingBitVector {
38 static_assert(std::is_unsigned<IndexT>::value,
41 using ThisT = CoalescingBitVector<IndexT>;
44 using MapT = IntervalMap<IndexT, char>;
48 using IntervalT = std::pair<IndexT, IndexT>;
53 /// Construct by passing in a CoalescingBitVector<IndexT>::Allocator
96 void set(IndexT Index) {
113 void set(std::initializer_list<IndexT> Indices)
    [all...]
IndexedMap.h 30 using IndexT = typename ToIndexT::argument_type;
45 typename StorageT::reference operator[](IndexT n) {
50 typename StorageT::const_reference operator[](IndexT n) const {
67 void grow(IndexT n) {
73 bool inBounds(IndexT n) const {
  /src/external/gpl3/gcc/dist/libsanitizer/tsan/
tsan_dense_alloc.h 28 typedef u32 IndexT;
30 IndexT cache[kSize];
39 typedef typename Cache::IndexT IndexT;
45 static_assert((kL1Size * kL2Size) <= (1ull << (sizeof(IndexT) * 8)),
49 static_assert(sizeof(T) > sizeof(IndexT),
68 IndexT Alloc(Cache *c) {
74 void Free(Cache *c, IndexT idx) {
81 T *Map(IndexT idx) {
105 for (IndexT l2 = l1 == 0 ? 1 : 0; l2 < kL2Size; l2++) func(&map_[l1][l2])
    [all...]

Completed in 24 milliseconds