Home
last modified time | relevance | path

Searched refs:kSize2 (Results 1 – 3 of 3) sorted by relevance

/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_flat_map.h64 template <typename T, u64 kSize1, u64 kSize2,
83 UnmapOrDie(p, kSize2); in TestOnlyUnmap()
101 constexpr uptr size2() const { return kSize2; } in size2()
104 CHECK_LT(idx, kSize1 * kSize2); in contains()
105 return Get(idx / kSize2); in contains()
109 DCHECK_LT(idx, kSize1 * kSize2);
110 T *map2 = GetOrCreate(idx / kSize2);
111 return *AddressSpaceView::Load(&map2[idx % kSize2]);
115 DCHECK_LT(idx, kSize1 * kSize2);
116 T *map2 = GetOrCreate(idx / kSize2);
[all …]
/llvm-project-15.0.7/compiler-rt/test/msan/
H A Dqsort.cpp14 constexpr size_t kSize2 = 7; variable
51 long *p = new long[kSize2]; in compar1()
53 for (int i = 0; i < kSize2; ++i) in compar1()
56 __msan_check_mem_is_initialized(p, sizeof(long) * kSize2); in compar1()
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_flat_map_test.cpp40 const u64 kSize1 = 1 << 6, kSize2 = 1 << 12; in TYPED_TEST() local
41 const u64 n = kSize1 * kSize2; in TYPED_TEST()
42 TwoLevelMap<TypeParam, kSize1, kSize2> m; in TYPED_TEST()
46 for (u64 i = 0; i < kSize2; ++i) { in TYPED_TEST()
49 EXPECT_FALSE(m.contains(kSize2)); in TYPED_TEST()