Home
last modified time | relevance | path

Searched refs:kL2Size (Results 1 – 2 of 2) sorted by relevance

/freebsd/contrib/llvm-project/compiler-rt/lib/tsan/rtl/
H A Dtsan_dense_alloc.h35 template <typename T, uptr kL1Size, uptr kL2Size, u64 kReserved = 0>
43 static_assert((kL2Size & (kL2Size - 1)) == 0,
45 static_assert((kL1Size * kL2Size) <= (1ull << (sizeof(IndexT) * 8)),
47 static_assert(((kL1Size * kL2Size - 1) & kReserved) == 0,
64 UnmapOrDie(map_[i], kL2Size * sizeof(T)); in ~DenseSlabAlloc()
83 DCHECK_LE(idx, kL1Size * kL2Size); in Map()
84 return &map_[idx / kL2Size][idx % kL2Size]; in Map()
97 return atomic_load_relaxed(&fillpos_) * kL2Size * sizeof(T); in AllocatedMemory()
105 for (IndexT l2 = l1 == 0 ? 1 : 0; l2 < kL2Size; l2++) func(&map_[l1][l2]); in ForEach()
175 kL2Size); in AllocSuperBlock()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_deadlock_detector2.cpp28 const int kL2Size = 1024; variable
29 const int kMaxMutex = kL1Size * kL2Size;
155 MutexState *DD::getMutex(u32 id) { return &mutex[id / kL2Size][id % kL2Size]; } in getMutex()
162 if (m >= tab && m < tab + kL2Size) in getMutexId()
163 return i * kL2Size + (m - tab); in getMutexId()
176 if ((id_gen % kL2Size) == 0) { in allocateId()
177 mutex[id_gen / kL2Size] = (MutexState *)MmapOrDie( in allocateId()
178 kL2Size * sizeof(MutexState), "deadlock detector (mutex table)"); in allocateId()