Home
last modified time | relevance | path

Searched refs:kSize (Results 1 – 25 of 45) sorted by relevance

12

/netbsd-src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
H A Dsanitizer_addrhashmap.h41 template<typename T, uptr kSize>
68 Handle(AddrHashMap<T, kSize> *map, uptr addr);
69 Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove);
70 Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove, bool create);
80 friend AddrHashMap<T, kSize>;
81 AddrHashMap<T, kSize> *map_;
100 template<typename T, uptr kSize>
101 AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr) { in Handle()
109 template<typename T, uptr kSize>
110 AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr, in Handle()
[all …]
H A Dsanitizer_bitvector.h23 enum SizeEnum : uptr { kSize = sizeof(basic_int_t) * 8 }; enumerator
25 uptr size() const { return kSize; } in size()
116 enum SizeEnum : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size }; enumerator
119 uptr size() const { return kSize; } in size()
129 for (uptr i1 = 0; i1 < BV::kSize; i1++) in setAll()
187 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2; in getAndClearFirstOne()
308 uptr res = i0_ * BV::kSize * BV::kSize + i1_ * BV::kSize + i2; in next()
326 uptr res = idx / (BV::kSize * BV::kSize); in idx0()
332 uptr res = (idx / BV::kSize) % BV::kSize; in idx1()
333 CHECK_LE(res, BV::kSize); in idx1()
[all …]
H A Dsanitizer_quarantine.h27 static const uptr kSize = 1021; member
31 void *batch[kSize];
45 CHECK_LT(count, kSize); in push_back()
51 return count + from->count <= kSize; in can_merge()
55 CHECK_LE(count + from->count, kSize); in merge()
221 if (list_.empty() || list_.back()->count == QuarantineBatch::kSize) { in Enqueue()
286 uptr quarantine_chunks_capacity = batch_count * QuarantineBatch::kSize; in PrintStats()
H A Dsanitizer_allocator_bytemap.h16 template<u64 kSize>
24 CHECK_LT(idx, kSize); in set()
29 CHECK_LT(idx, kSize);
34 u8 map_[kSize];
H A Dsanitizer_bvgraph.h26 enum SizeEnum : uptr { kSize = BV::kSize }; enumerator
27 uptr size() const { return kSize; } in size()
156 BV v[kSize];
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
H A Dsanitizer_addrhashmap.h43 template<typename T, uptr kSize>
70 Handle(AddrHashMap<T, kSize> *map, uptr addr);
71 Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove);
72 Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove, bool create);
82 friend AddrHashMap<T, kSize>;
83 AddrHashMap<T, kSize> *map_;
102 template<typename T, uptr kSize>
103 AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr) { in Handle()
111 template<typename T, uptr kSize>
112 AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr, in Handle()
[all …]
H A Dsanitizer_bitvector.h25 enum SizeEnum : uptr { kSize = sizeof(basic_int_t) * 8 }; enumerator
27 uptr size() const { return kSize; } in size()
118 enum SizeEnum : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size }; enumerator
121 uptr size() const { return kSize; } in size()
131 for (uptr i1 = 0; i1 < BV::kSize; i1++) in setAll()
189 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2; in getAndClearFirstOne()
310 uptr res = i0_ * BV::kSize * BV::kSize + i1_ * BV::kSize + i2; in next()
328 uptr res = idx / (BV::kSize * BV::kSize); in idx0()
334 uptr res = (idx / BV::kSize) % BV::kSize; in idx1()
335 CHECK_LE(res, BV::kSize); in idx1()
[all …]
H A Dsanitizer_quarantine.h29 static const uptr kSize = 1021; member
33 void *batch[kSize];
47 CHECK_LT(count, kSize); in push_back()
53 return count + from->count <= kSize; in can_merge()
57 CHECK_LE(count + from->count, kSize); in merge()
223 if (list_.empty() || list_.back()->count == QuarantineBatch::kSize) { in Enqueue()
288 uptr quarantine_chunks_capacity = batch_count * QuarantineBatch::kSize; in PrintStats()
H A Dsanitizer_allocator_bytemap.h18 template <u64 kSize, typename AddressSpaceViewTy = LocalAddressSpaceView>
27 CHECK_LT(idx, kSize); in set()
32 CHECK_LT(idx, kSize);
37 u8 map_[kSize];
/netbsd-src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
H A Dsanitizer_addrhashmap.h47 template<typename T, uptr kSize>
74 Handle(AddrHashMap<T, kSize> *map, uptr addr);
75 Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove);
76 Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove, bool create);
86 friend AddrHashMap<T, kSize>;
87 AddrHashMap<T, kSize> *map_;
112 template <typename T, uptr kSize>
113 void AddrHashMap<T, kSize>::ForEach(ForEachCallback cb, void *arg) { in ForEach()
114 for (uptr n = 0; n < kSize; n++) { in ForEach()
139 template<typename T, uptr kSize>
[all …]
H A Dsanitizer_bitvector.h24 enum SizeEnum : uptr { kSize = sizeof(basic_int_t) * 8 }; enumerator
26 uptr size() const { return kSize; } in size()
117 enum SizeEnum : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size }; enumerator
120 uptr size() const { return kSize; } in size()
130 for (uptr i1 = 0; i1 < BV::kSize; i1++) in setAll()
188 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2; in getAndClearFirstOne()
309 uptr res = i0_ * BV::kSize * BV::kSize + i1_ * BV::kSize + i2; in next()
327 uptr res = idx / (BV::kSize * BV::kSize); in idx0()
333 uptr res = (idx / BV::kSize) % BV::kSize; in idx1()
334 CHECK_LE(res, BV::kSize); in idx1()
[all …]
H A Dsanitizer_flat_map.h31 template <typename T, u64 kSize,
38 constexpr uptr size() const { return kSize; } in size()
41 CHECK_LT(idx, kSize); in contains()
46 DCHECK_LT(idx, kSize);
51 DCHECK_LT(idx, kSize);
56 T map_[kSize];
163 template <u64 kSize, typename AddressSpaceViewTy = LocalAddressSpaceView>
164 using FlatByteMap = FlatMap<u8, kSize, AddressSpaceViewTy>;
H A Dsanitizer_quarantine.h28 static const uptr kSize = 1021; member
32 void *batch[kSize];
46 CHECK_LT(count, kSize); in push_back()
52 return count + from->count <= kSize; in can_merge()
56 CHECK_LE(count + from->count, kSize); in merge()
223 if (list_.empty() || list_.back()->count == QuarantineBatch::kSize) { in Enqueue()
288 uptr quarantine_chunks_capacity = batch_count * QuarantineBatch::kSize; in PrintStats()
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/xray/tests/unit/
H A Dbuffer_queue_test.cc25 static constexpr size_t kSize = 4096; variable
31 BufferQueue Buffers(kSize, 1, Success); in TEST()
37 BufferQueue Buffers(kSize, 1, Success); in TEST()
48 BufferQueue Buffers(kSize, 1, Success); in TEST()
59 BufferQueue Buffers(kSize, 1, Success); in TEST()
63 Buf.Size = kSize; in TEST()
75 BufferQueue Buffers(kSize, 2, Success); in TEST()
90 BufferQueue Buffers(kSize, 100, Success); in TEST()
112 BufferQueue Buffers(kSize, 10, Success); in TEST()
126 BufferQueue Buffers(kSize, 10, Success); in TEST()
[all …]
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/asan/tests/
H A Dasan_interface_test.cc243 const size_t kSize = 24; in TEST() local
244 bool expected[kSize]; in TEST()
245 char *arr = Ident((char*)malloc(kSize)); in TEST()
246 for (size_t l1 = 0; l1 < kSize; l1++) { in TEST()
247 for (size_t s1 = 1; l1 + s1 <= kSize; s1++) { in TEST()
248 for (size_t l2 = 0; l2 < kSize; l2++) { in TEST()
249 for (size_t s2 = 1; l2 + s2 <= kSize; s2++) { in TEST()
251 __asan_unpoison_memory_region(arr, kSize); in TEST()
254 memset(expected, false, kSize); in TEST()
256 MakeShadowValid(expected, kSize, /*granularity*/ 3); in TEST()
[all …]
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/tsan/tests/unit/
H A Dtsan_mutex_test.cc27 for (int i = 0; i < kSize; i++) in TestData()
34 for (int i = 0; i < kSize; i++) { in Write()
43 for (int i = 0; i < kSize; i++) { in Read()
49 volatile T data[kSize] = {}; in Backoff()
50 for (int i = 0; i < kSize; i++) { in Backoff()
58 static const int kSize = 64; member in __tsan::TestData
62 T data_[kSize];
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
H A Dsanitizer_mutex_test.cc29 for (int i = 0; i < kSize; i++) in TestData()
36 for (int i = 0; i < kSize; i++) { in Write()
46 for (int i = 0; i < kSize; i++) { in TryWrite()
54 volatile T data[kSize] = {}; in Backoff()
55 for (int i = 0; i < kSize; i++) { in Backoff()
63 static const int kSize = 64; member in __sanitizer::TestData
67 T data_[kSize];
H A Dsanitizer_common_test.cc230 static const uptr kSize = 5; in TEST() local
231 int arr[kSize]; in TEST()
238 EXPECT_EQ(0u, InternalLowerBound(arr, 0, kSize, 0, UptrLess)); in TEST()
239 EXPECT_EQ(0u, InternalLowerBound(arr, 0, kSize, 1, UptrLess)); in TEST()
240 EXPECT_EQ(1u, InternalLowerBound(arr, 0, kSize, 2, UptrLess)); in TEST()
241 EXPECT_EQ(1u, InternalLowerBound(arr, 0, kSize, 3, UptrLess)); in TEST()
242 EXPECT_EQ(2u, InternalLowerBound(arr, 0, kSize, 4, UptrLess)); in TEST()
243 EXPECT_EQ(2u, InternalLowerBound(arr, 0, kSize, 5, UptrLess)); in TEST()
244 EXPECT_EQ(3u, InternalLowerBound(arr, 0, kSize, 6, UptrLess)); in TEST()
245 EXPECT_EQ(3u, InternalLowerBound(arr, 0, kSize, 7, UptrLess)); in TEST()
[all …]
H A Dsanitizer_quarantine_test.cc63 for (uptr i = 2; i < QuarantineBatch::kSize; ++i) in TEST()
65 ASSERT_TRUE(into.count + from.count == QuarantineBatch::kSize); in TEST()
69 ASSERT_TRUE(into.count == QuarantineBatch::kSize); in TEST()
125 const uptr kNumBlocks = QuarantineBatch::kSize - 1; in TEST()
151 const uptr kNumBlocks = QuarantineBatch::kSize * kNumBatchesAfterMerge; in TEST()
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/tsan/tests/rtl/
H A Dtsan_bench.cc19 const int kSize = 128; variable
26 volatile T data[kSize]; in Benchmark()
28 for (int j = 0; j < kSize; j++) { in Benchmark()
85 for (int j = 0; j < kSize; j++) in TEST()
87 for (int j = 0; j < kSize; j++) in TEST()
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
H A DFuzzerTracePC.h33 static const size_t kSize = kSizeT; member
39 Idx = Idx % kSize; in Insert()
44 Pair Get(size_t I) { return Table[I % kSize]; } in Get()
46 Pair Table[kSize];
51 static const size_t kSize = kSizeT; member
52 Word MemMemWords[kSize];
58 size_t Idx = SimpleFastHash(Data, Size) % kSize; in Add()
62 for (size_t i = 0; i < kSize; i++) { in Get()
63 const Word &W = MemMemWords[(Idx + i) % kSize]; in Get()
/netbsd-src/external/gpl3/gcc.old/dist/libsanitizer/tsan/
H A Dtsan_dense_alloc.h27 static const uptr kSize = 128; variable
30 IndexT cache[kSize];
68 if (c->pos == Cache::kSize) in Free()
121 for (uptr i = 0; i < Cache::kSize / 2 && freelist_ != 0; i++) { in Refill()
130 for (uptr i = 0; i < Cache::kSize / 2; i++) { in Drain()
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/tsan/rtl/
H A Dtsan_dense_alloc.h29 static const uptr kSize = 128; variable
32 IndexT cache[kSize];
70 if (c->pos == Cache::kSize) in Free()
123 for (uptr i = 0; i < Cache::kSize / 2 && freelist_ != 0; i++) { in Refill()
132 for (uptr i = 0; i < Cache::kSize / 2; i++) { in Drain()
/netbsd-src/external/gpl3/gcc/dist/libsanitizer/tsan/
H A Dtsan_dense_alloc.h27 static const uptr kSize = 128; variable
30 IndexT cache[kSize];
76 if (c->pos == Cache::kSize) in Free()
137 for (uptr i = 0; i < Cache::kSize / 2 && freelist_ != 0; i++) { in Refill()
146 for (uptr i = 0; i < Cache::kSize / 2; i++) { in Drain()
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
H A DBenchmarkRunner.h50 static constexpr const size_t kSize = 1 << 20; // 1MB. member
52 : UnalignedPtr(std::make_unique<char[]>(kSize + kAlignment)), in ScratchSpace()
57 void clear() { std::memset(ptr(), 0, kSize); } in clear()

12