| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_addrhashmap.h | 25 // T must be a POD type, kSize is preferably a prime but can be any number.
43 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)
[all...] |
| sanitizer_bitvector.h | 25 enum SizeEnum : uptr { kSize = sizeof(basic_int_t) * 8 };
27 uptr size() const { return kSize; }
107 // Fixed size bit vector of (kLevel1Size*BV::kSize**2) bits.
118 enum SizeEnum : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size };
121 uptr size() const { return kSize; }
131 for (uptr i1 = 0; i1 < BV::kSize; i1++)
189 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2
[all...] |
| sanitizer_allocator_bytemap.h | 17 // Maps integers in rage [0, kSize) to u8 values.
18 template <u64 kSize, typename AddressSpaceViewTy = LocalAddressSpaceView>
27 CHECK_LT(idx, kSize);
32 CHECK_LT(idx, kSize);
37 u8 map_[kSize];
|
| sanitizer_bvgraph.h | 28 enum SizeEnum : uptr { kSize = BV::kSize };
29 uptr size() const { return kSize; }
158 BV v[kSize];
|
| sanitizer_quarantine.h | 29 static const uptr kSize = 1021;
33 void *batch[kSize];
47 CHECK_LT(count, kSize);
53 return count + from->count <= kSize;
57 CHECK_LE(count + from->count, kSize);
223 if (list_.empty() || list_.back()->count == QuarantineBatch::kSize) {
288 uptr quarantine_chunks_capacity = batch_count * QuarantineBatch::kSize;
|
| sanitizer_deadlock_detector.h | 70 // lock_id < BV::kSize, can cast to a smaller int.
409 uptr data_[BV::kSize];
410 Edge edges_[BV::kSize * 32];
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| sanitizer_mutex_test.cc | 29 for (int i = 0; i < kSize; i++)
36 for (int i = 0; i < kSize; i++) {
46 for (int i = 0; i < kSize; i++) {
54 volatile T data[kSize] = {};
55 for (int i = 0; i < kSize; i++) {
63 static const int kSize = 64;
67 T data_[kSize];
|
| sanitizer_common_test.cc | 230 static const uptr kSize = 5;
231 int arr[kSize];
238 EXPECT_EQ(0u, InternalLowerBound(arr, 0, kSize, 0, UptrLess));
239 EXPECT_EQ(0u, InternalLowerBound(arr, 0, kSize, 1, UptrLess));
240 EXPECT_EQ(1u, InternalLowerBound(arr, 0, kSize, 2, UptrLess));
241 EXPECT_EQ(1u, InternalLowerBound(arr, 0, kSize, 3, UptrLess));
242 EXPECT_EQ(2u, InternalLowerBound(arr, 0, kSize, 4, UptrLess));
243 EXPECT_EQ(2u, InternalLowerBound(arr, 0, kSize, 5, UptrLess));
244 EXPECT_EQ(3u, InternalLowerBound(arr, 0, kSize, 6, UptrLess));
245 EXPECT_EQ(3u, InternalLowerBound(arr, 0, kSize, 7, UptrLess))
[all...] |
| sanitizer_quarantine_test.cc | 63 for (uptr i = 2; i < QuarantineBatch::kSize; ++i)
65 ASSERT_TRUE(into.count + from.count == QuarantineBatch::kSize);
69 ASSERT_TRUE(into.count == QuarantineBatch::kSize);
125 const uptr kNumBlocks = QuarantineBatch::kSize - 1;
151 const uptr kNumBlocks = QuarantineBatch::kSize * kNumBatchesAfterMerge;
|
| sanitizer_deadlock_detector_test.cc | 458 vector<uptr> node(BV::kSize);
461 for (size_t i = 0; i < BV::kSize; i++)
464 for (size_t i = 0; i < BV::kSize; i++)
466 for (size_t i = 0; i < BV::kSize; i++) {
467 for (uptr j = i + 1; j < BV::kSize; j++) {
476 for (uptr i = 1; i < BV::kSize; i += 2)
478 for (uptr i = 1; i < BV::kSize; i += 2)
482 for (size_t i = 0; i < BV::kSize; i++) {
483 for (uptr j = i + 1; j < BV::kSize; j++) {
|
| sanitizer_bvgraph_test.cc | 93 uptr path[BV::kSize];
95 for (len = 1; len < BV::kSize; len++) {
99 EXPECT_LT(len, BV::kSize);
|
| sanitizer_bitvector_test.cc | 81 EXPECT_EQ(expected_size, BV::kSize);
|
| sanitizer_allocator_test.cc | 891 const int kSize = 512;
893 InternalMmapVector<int> int_buf(kSize);
894 EXPECT_EQ((uptr)kSize, int_buf.size()); // NOLINT
896 InternalMmapVector<char> char_buf(kSize);
897 EXPECT_EQ((uptr)kSize, char_buf.size()); // NOLINT
898 internal_memset(char_buf.data(), 'c', kSize);
899 for (int i = 0; i < kSize; i++) {
|
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/tests/unit/ |
| tsan_mutex_test.cc | 27 for (int i = 0; i < kSize; i++)
34 for (int i = 0; i < kSize; i++) {
43 for (int i = 0; i < kSize; i++) {
49 volatile T data[kSize] = {};
50 for (int i = 0; i < kSize; i++) {
58 static const int kSize = 64;
62 T data_[kSize];
|
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/tests/rtl/ |
| tsan_bench.cc | 19 const int kSize = 128;
26 volatile T data[kSize];
28 for (int j = 0; j < kSize; j++) {
85 for (int j = 0; j < kSize; j++)
87 for (int j = 0; j < kSize; j++)
|
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/tests/unit/ |
| buffer_queue_test.cc | 25 static constexpr size_t kSize = 4096;
31 BufferQueue Buffers(kSize, 1, Success);
37 BufferQueue Buffers(kSize, 1, Success);
48 BufferQueue Buffers(kSize, 1, Success);
59 BufferQueue Buffers(kSize, 1, Success);
63 Buf.Size = kSize;
75 BufferQueue Buffers(kSize, 2, Success);
90 BufferQueue Buffers(kSize, 100, Success);
112 BufferQueue Buffers(kSize, 10, Success);
126 BufferQueue Buffers(kSize, 10, Success)
[all...] |
| fdr_log_writer_test.cc | 27 static constexpr size_t kSize = 4096;
42 BufferQueue Buffers(kSize, 1, Success);
80 BufferQueue Buffers(kSize, 1, Success);
130 BufferQueue Buffers(kSize, 1, Success);
|
| /src/sys/external/bsd/compiler_rt/dist/lib/asan/tests/ |
| asan_interface_test.cc | 243 const size_t kSize = 24;
244 bool expected[kSize];
245 char *arr = Ident((char*)malloc(kSize));
246 for (size_t l1 = 0; l1 < kSize; l1++) {
247 for (size_t s1 = 1; l1 + s1 <= kSize; s1++) {
248 for (size_t l2 = 0; l2 < kSize; l2++) {
249 for (size_t s2 = 1; l2 + s2 <= kSize; s2++) {
251 __asan_unpoison_memory_region(arr, kSize);
254 memset(expected, false, kSize);
256 MakeShadowValid(expected, kSize, /*granularity*/ 3)
[all...] |
| asan_test.cc | 487 template<int kSize>
489 char a[kSize];
492 for (size_t i = 0; i < kSize; i++)
496 EXPECT_DEATH(A[kSize] = 0, expected_death);
497 EXPECT_DEATH(A[kSize + 1] = 0, expected_death);
498 EXPECT_DEATH(A[kSize + 5] = 0, expected_death);
499 if (kSize > 16)
500 EXPECT_DEATH(A[kSize + 31] = 0, expected_death);
1081 template <int kSize>
1083 char x[kSize];
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/rtl/ |
| tsan_dense_alloc.h | 29 static const uptr kSize = 128;
32 IndexT cache[kSize];
70 if (c->pos == Cache::kSize)
123 for (uptr i = 0; i < Cache::kSize / 2 && freelist_ != 0; i++) {
132 for (uptr i = 0; i < Cache::kSize / 2; i++) {
|
| tsan_defs.h | 50 static const uptr kSize = 512;
51 static const uptr kTableSize = kSize / sizeof(u32);
52 static const uptr kClockCount = kSize / sizeof(ClockElem);
|
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerTracePC.h | 33 static const size_t kSize = kSizeT;
39 Idx = Idx % kSize;
44 Pair Get(size_t I) { return Table[I % kSize]; }
46 Pair Table[kSize];
51 static const size_t kSize = kSizeT;
52 Word MemMemWords[kSize];
58 size_t Idx = SimpleFastHash(Data, Size) % kSize;
62 for (size_t i = 0; i < kSize; i++) {
63 const Word &W = MemMemWords[(Idx + i) % kSize];
|
