Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/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.h25 template <typename T, u64 kSize,
32 constexpr uptr size() const { return kSize; } in size()
35 CHECK_LT(idx, kSize); in contains()
40 DCHECK_LT(idx, kSize);
45 DCHECK_LT(idx, kSize);
50 T map_[kSize];
158 template <u64 kSize, typename AddressSpaceViewTy = LocalAddressSpaceView>
159 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()
218 if (list_.empty() || list_.back()->count == QuarantineBatch::kSize) { in Enqueue()
283 uptr quarantine_chunks_capacity = batch_count * QuarantineBatch::kSize; in PrintStats()
H A Dsanitizer_bvgraph.h27 enum SizeEnum : uptr { kSize = BV::kSize }; enumerator
28 uptr size() const { return kSize; } in size()
157 BV v[kSize];
H A Dsanitizer_deadlock_detector.h403 uptr data_[BV::kSize];
404 Edge edges_[BV::kSize * 32];
/freebsd-14.2/contrib/llvm-project/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()
/freebsd-14.2/contrib/llvm-project/compiler-rt/lib/memprof/tests/
H A Drawprofile.cpp25 constexpr int kSize = 5; in PopulateFakeMap() local
26 uintptr_t array[kSize]; in PopulateFakeMap()
27 for (int i = 0; i < kSize; i++) { in PopulateFakeMap()
30 StackTrace St(array, kSize); in PopulateFakeMap()
/freebsd-14.2/contrib/llvm-project/compiler-rt/lib/tsan/benchmarks/
H A Dmop.cpp17 const int kSize = 2 << 10; in thread() local
18 static volatile long data[kSize]; in thread()
29 for (int j = 0; j < kSize; j++) { in thread()
/freebsd-14.2/contrib/llvm-project/compiler-rt/lib/tsan/rtl/
H A Dtsan_dense_alloc.h27 static const uptr kSize = 128; variable
30 IndexT cache[kSize];
76 if (c->pos == Cache::kSize) in Free()
153 for (uptr i = 0; i < Cache::kSize / 2 && c->pos; i++) { in Drain()
186 if (c->pos == Cache::kSize) in AllocSuperBlock()
H A Dtsan_trace.h175 static constexpr uptr kSize = member
183 Event events[kSize];
H A Dtsan_rtl.cpp172 reinterpret_cast<uptr>(&part->events[TracePart::kSize])); in DoResetImpl()
922 Event* end = &part->events[TracePart::kSize]; in TraceSkipGap()
987 static_assert(kMaxFrames < TracePart::kSize / 2, "kMaxFrames is too big"); in TraceSwitchPartImpl()
H A Dtsan_rtl.h713 DCHECK_LE(pos, &current->events[TracePart::kSize]); in TraceAcquire()
730 DCHECK_LE(evp + 1, &thr->tctx->trace.parts.Back()->events[TracePart::kSize]); in TraceRelease()
H A Dtsan_rtl_report.cpp365 Event *end = &part->events[TracePart::kSize - 1]; in TraceReplay()
/freebsd-14.2/contrib/googletest/googletest/test/
H A Dgoogletest-list-tests-unittest_.cc110 template <typename T, int kSize>
H A Dgoogletest-printers-test.cc1096 const int kSize = 5; local
1097 int a[kSize] = {1, 1, 2, 5, 1};
1098 ::std::unordered_multiset<int> set1(a, a + kSize);
1120 std::sort(a, a + kSize);
1121 EXPECT_TRUE(std::equal(a, a + kSize, numbers.begin()));
/freebsd-14.2/contrib/libarchive/libarchive/
H A Darchive_write_set_format_7zip.c78 #define kSize 0x09 macro
929 r = enc_uint64(a, kSize); in make_substreamsInfo()
1007 r = enc_uint64(a, kSize); in make_streamsInfo()
H A Darchive_read_support_format_7zip.c102 #define kSize 0x09 macro
1921 if (*p != kSize) in read_PackInfo()
2329 if (type == kSize) { in read_SubStreamsInfo()
2344 if (type == kSize) { in read_SubStreamsInfo()
/freebsd-14.2/contrib/googletest/googletest/src/
H A Dgtest.cc2325 template <size_t kSize>
2326 std::vector<std::string> ArrayAsVector(const char* const (&array)[kSize]) { in ArrayAsVector() argument
2327 return std::vector<std::string>(array, array + kSize); in ArrayAsVector()