Home
last modified time | relevance | path

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

123

/llvm-project-15.0.7/compiler-rt/test/dfsan/
H A Dinterceptors.c23 const int kSize = 16; variable
28 ASSERT_READ_ZERO_LABEL(p, kSize); in test_aligned_alloc()
35 ASSERT_READ_ZERO_LABEL(p, kSize); in test_calloc()
44 char *p = (char *) malloc(kSize); in test_free()
45 dfsan_set_label(1, p, kSize); in test_free()
47 ASSERT_READ_ZERO_LABEL(p, kSize); in test_free()
74 assert(s == kSize); in test_malloc_usable_size()
98 memset(p, val, kSize); in test_mmap()
102 munmap(p, kSize); in test_mmap()
114 memset(p, val, kSize); in test_unmmap()
[all …]
/llvm-project-15.0.7/libcxx/test/libcxx/algorithms/
H A Dnth_element_stability.pass.cpp31 static constexpr int kSize = 100; in deterministic() local
33 v.resize(kSize); in deterministic()
34 for (int i = 0; i < kSize; ++i) { in deterministic()
42 static constexpr int kSize = 100; in test_randomization() local
44 v.resize(kSize); in test_randomization()
45 for (int i = 0; i < kSize; ++i) { in test_randomization()
51 for (int i = 0; i < kSize; ++i) { in test_randomization()
60 static constexpr int kSize = 100; in test_same() local
62 v.resize(kSize); in test_same()
63 for (int i = 0; i < kSize; ++i) { in test_same()
[all …]
H A Dpartial_sort_stability.pass.cpp31 static constexpr int kSize = 100; in deterministic() local
33 v.resize(kSize); in deterministic()
34 for (int i = 0; i < kSize; ++i) { in deterministic()
43 static constexpr int kSize = 100; in test_randomization() local
45 v.resize(kSize); in test_randomization()
46 for (int i = 0; i < kSize; ++i) { in test_randomization()
52 for (int i = 0; i < kSize; ++i) { in test_randomization()
61 static constexpr int kSize = 100; in test_same() local
63 v.resize(kSize); in test_same()
64 for (int i = 0; i < kSize; ++i) { in test_same()
[all …]
H A Dsort_stability.pass.cpp31 static constexpr int kSize = 100; in deterministic() local
33 v.resize(kSize); in deterministic()
34 for (int i = 0; i < kSize; ++i) { in deterministic()
42 static constexpr int kSize = 100; in test_randomization() local
44 v.resize(kSize); in test_randomization()
45 for (int i = 0; i < kSize; ++i) { in test_randomization()
51 for (int i = 0; i < kSize; ++i) { in test_randomization()
60 static constexpr int kSize = 100; in test_same() local
62 v.resize(kSize); in test_same()
63 for (int i = 0; i < kSize; ++i) { in test_same()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_addrhashmap.h47 template<typename T, uptr kSize>
86 friend AddrHashMap<T, kSize>;
87 AddrHashMap<T, kSize> *map_;
139 template<typename T, uptr kSize>
140 AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr) { in Handle()
148 template<typename T, uptr kSize>
149 AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr, in Handle()
158 template<typename T, uptr kSize>
159 AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr, in Handle()
168 template<typename T, uptr kSize>
[all …]
H A Dsanitizer_bitvector.h26 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()
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()
339 uptr res = idx % BV::kSize; in idx2()
340 CHECK_LE(res, BV::kSize); in idx2()
[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()
/llvm-project-15.0.7/compiler-rt/test/builtins/Unit/
H A Dclear_cache_test.c50 const int kSize = 128; in main() local
53 uint8_t *write_buffer = mmap(0, kSize, in main()
59 uint8_t *execution_buffer = mremap(write_buffer, kSize, NULL, kSize, in main()
64 if (mprotect(write_buffer, kSize, PROT_READ | PROT_WRITE) == -1) in main()
69 uint8_t *execution_buffer = mmap(0, kSize, in main()
89 memcpy_f(write_buffer, func1, kSize); in main()
90 pfunc f1 = (pfunc)realign_f(execution_buffer, func1, kSize); in main()
91 __clear_cache(execution_buffer, execution_buffer + kSize); in main()
96 memcpy_f(write_buffer, func2, kSize); in main()
97 pfunc f2 = (pfunc)realign_f(execution_buffer, func2, kSize); in main()
[all …]
/llvm-project-15.0.7/compiler-rt/test/tsan/
H A Dbarrier.cpp13 const int kSize = 4; variable
15 int data[2][kSize];
24 int right = idx + 1 < kSize ? prev[idx + 1] : 0; in thr()
32 pthread_barrier_init(&barrier, 0, kSize); in main()
33 pthread_t th[kSize]; in main()
34 for (int i = 0; i < kSize; i++) in main()
36 for (int i = 0; i < kSize; i++) in main()
H A Dlarge_malloc_meta.cpp18 const int kSize = 1 << 20; in main() local
20 volatile int *p = new int[kSize]; in main()
21 for (int j = 0; j < kSize; j += kPageSize / sizeof(*p)) in main()
24 mmap(0, kSize * sizeof(*p) + kPageSize, PROT_NONE, MAP_PRIVATE | MAP_ANON, in main()
H A Drestore_stack.cpp6 const int kSize = 64 << 10; variable
7 volatile long data[kSize];
10 for (int i = 0; i < kSize; i++) in foo()
33 for (int i = 0; i < kSize; i++) in main()
/llvm-project-15.0.7/llvm/unittests/Support/
H A DCompressionTest.cpp51 const size_t kSize = 1024; in TEST() local
52 char BinaryData[kSize]; in TEST()
53 for (size_t i = 0; i < kSize; ++i) in TEST()
55 StringRef BinaryDataStr(BinaryData, kSize); in TEST()
90 const size_t kSize = 1024; in TEST() local
91 char BinaryData[kSize]; in TEST()
92 for (size_t i = 0; i < kSize; ++i) in TEST()
94 StringRef BinaryDataStr(BinaryData, kSize); in TEST()
/llvm-project-15.0.7/compiler-rt/lib/xray/tests/unit/
H A Dbuffer_queue_test.cpp24 static constexpr size_t kSize = 4096; variable
30 BufferQueue Buffers(kSize, 1, Success); in TEST()
36 BufferQueue Buffers(kSize, 1, Success); in TEST()
47 BufferQueue Buffers(kSize, 1, Success); in TEST()
58 BufferQueue Buffers(kSize, 1, Success); in TEST()
62 Buf.Size = kSize; in TEST()
74 BufferQueue Buffers(kSize, 2, Success); in TEST()
89 BufferQueue Buffers(kSize, 100, Success); in TEST()
111 BufferQueue Buffers(kSize, 10, Success); in TEST()
125 BufferQueue Buffers(kSize, 10, Success); in TEST()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/asan/tests/
H A Dasan_interface_test.cpp239 const size_t kSize = 24; in TEST() local
240 bool expected[kSize]; in TEST()
241 char *arr = Ident((char*)malloc(kSize)); in TEST()
242 for (size_t l1 = 0; l1 < kSize; l1++) { in TEST()
243 for (size_t s1 = 1; l1 + s1 <= kSize; s1++) { in TEST()
244 for (size_t l2 = 0; l2 < kSize; l2++) { in TEST()
250 memset(expected, false, kSize); in TEST()
255 for (size_t i = 0; i < kSize; i++) { in TEST()
259 __asan_poison_memory_region(arr, kSize); in TEST()
262 memset(expected, true, kSize); in TEST()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_mutex_test.cpp28 for (int i = 0; i < kSize; i++) in TestData()
35 for (int i = 0; i < kSize; i++) { in Write()
46 for (int i = 0; i < kSize; i++) { in TryWrite()
57 for (int i = 0; i < kSize; i++) { in Read()
64 volatile T data[kSize] = {}; in Backoff()
65 for (int i = 0; i < kSize; i++) { in Backoff()
74 static const int kSize = 64; member in __sanitizer::TestData
78 T data_[kSize];
H A Dsanitizer_quarantine_test.cpp62 for (uptr i = 2; i < QuarantineBatch::kSize; ++i) in TEST()
64 ASSERT_TRUE(into.count + from.count == QuarantineBatch::kSize); in TEST()
68 ASSERT_TRUE(into.count == QuarantineBatch::kSize); in TEST()
124 const uptr kNumBlocks = QuarantineBatch::kSize - 1; in TEST()
150 const uptr kNumBlocks = QuarantineBatch::kSize * kNumBatchesAfterMerge; in TEST()
/llvm-project-15.0.7/compiler-rt/lib/tsan/tests/rtl/
H A Dtsan_bench.cpp18 const int kSize = 128; variable
25 volatile T data[kSize]; in Benchmark()
27 for (int j = 0; j < kSize; j++) { in Benchmark()
84 for (int j = 0; j < kSize; j++) in TEST()
86 for (int j = 0; j < kSize; j++) in TEST()
/llvm-project-15.0.7/compiler-rt/test/asan/TestCases/Linux/
H A Dauto_memory_profile_test.cpp19 const size_t kSize = 13000000; in main() local
20 char *x = new char[kSize]; in main()
21 memset(x, 0, kSize); in main()
/llvm-project-15.0.7/compiler-rt/lib/fuzzer/
H A DFuzzerTracePC.h32 static const size_t kSize = kSizeT; member
38 Idx = Idx % kSize; in Insert()
43 Pair Get(size_t I) { return Table[I % kSize]; } in Get()
45 Pair Table[kSize];
50 static const size_t kSize = kSizeT; member
51 Word MemMemWords[kSize];
57 auto Idx = SimpleFastHash(Data, Size) % kSize; in Add()
61 for (size_t i = 0; i < kSize; i++) { in Get()
62 const Word &W = MemMemWords[(Idx + i) % kSize]; in Get()
/llvm-project-15.0.7/compiler-rt/test/fuzzer/
H A DOneHugeAllocTest.cpp19 size_t kSize = (size_t)1 << 31; in LLVMFuzzerTestOneInput() local
20 char *p = new char[kSize]; in LLVMFuzzerTestOneInput()
21 memset(p, 0, kSize); in LLVMFuzzerTestOneInput()
H A DOutOfMemoryTest.cpp21 size_t kSize = 1 << 28; in LLVMFuzzerTestOneInput() local
22 char *p = new char[kSize]; in LLVMFuzzerTestOneInput()
23 memset(p, 0, kSize); in LLVMFuzzerTestOneInput()
/llvm-project-15.0.7/compiler-rt/lib/tsan/rtl-old/
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()
/llvm-project-15.0.7/compiler-rt/test/asan/TestCases/Posix/
H A Dstack-use-after-return.cpp46 #ifndef kSize
47 # define kSize 1 macro
66 char local[kSize]; in Func1()
/llvm-project-15.0.7/llvm/tools/llvm-exegesis/lib/
H A DBenchmarkRunner.h51 static constexpr const size_t kSize = 1 << 20; // 1MB. member
53 : UnalignedPtr(std::make_unique<char[]>(kSize + kAlignment)), in ScratchSpace()
58 void clear() { std::memset(ptr(), 0, kSize); } in clear()

123