HomeSort by: relevance | last modified time | path
    Searched refs:kSize (Results 1 - 25 of 53) sorted by relevancy

1 2 3

  /src/external/bsd/zstd/dist/contrib/pzstd/
SkippableFrame.h 39 static constexpr std::size_t kSize = 12;
43 std::array<std::uint8_t, kSize> data_;
46 static constexpr std::uint32_t kFrameContentsSize = kSize - 8;
SkippableFrame.cpp 24 if (bytes.size() < SkippableFrame::kSize ||
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_addrhashmap.h 24 // T must be a POD type, kSize is preferably a prime but can be any number.
47 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) {
114 for (uptr n = 0; n < kSize; n++)
    [all...]
sanitizer_flat_map.h 24 // Maps integers in rage [0, kSize) to values.
25 template <typename T, u64 kSize,
32 constexpr uptr size() const { return kSize; }
35 CHECK_LT(idx, kSize);
40 DCHECK_LT(idx, kSize);
45 DCHECK_LT(idx, kSize);
50 T map_[kSize];
154 template <u64 kSize, typename AddressSpaceViewTy = LocalAddressSpaceView>
155 using FlatByteMap = FlatMap<u8, kSize, AddressSpaceViewTy>;
sanitizer_bitvector.h 24 enum SizeEnum : uptr { kSize = sizeof(basic_int_t) * 8 };
26 uptr size() const { return kSize; }
106 // Fixed size bit vector of (kLevel1Size*BV::kSize**2) bits.
117 enum SizeEnum : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size };
120 uptr size() const { return kSize; }
130 for (uptr i1 = 0; i1 < BV::kSize; i1++)
188 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2
    [all...]
sanitizer_bvgraph.h 27 enum SizeEnum : uptr { kSize = BV::kSize };
28 uptr size() const { return kSize; }
157 BV v[kSize];
  /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
sanitizer_addrhashmap.h 24 // T must be a POD type, kSize is preferably a prime but can be any number.
47 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) {
114 for (uptr n = 0; n < kSize; n++)
    [all...]
sanitizer_flat_map.h 30 // Maps integers in rage [0, kSize) to values.
31 template <typename T, u64 kSize,
38 constexpr uptr size() const { return kSize; }
41 CHECK_LT(idx, kSize);
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>;
sanitizer_bitvector.h 24 enum SizeEnum : uptr { kSize = sizeof(basic_int_t) * 8 };
26 uptr size() const { return kSize; }
106 // Fixed size bit vector of (kLevel1Size*BV::kSize**2) bits.
117 enum SizeEnum : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size };
120 uptr size() const { return kSize; }
130 for (uptr i1 = 0; i1 < BV::kSize; i1++)
188 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2
    [all...]
sanitizer_bvgraph.h 27 enum SizeEnum : uptr { kSize = BV::kSize };
28 uptr size() const { return kSize; }
157 BV v[kSize];
  /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];
  /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...]
  /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/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
BenchmarkRunner.h 50 static constexpr const size_t kSize = 1 << 20; // 1MB.
52 : UnalignedPtr(std::make_unique<char[]>(kSize + kAlignment)),
57 void clear() { std::memset(ptr(), 0, kSize); }
  /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...]
  /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...]
  /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/external/gpl3/gcc.old/dist/libsanitizer/tsan/
tsan_dense_alloc.h 27 static const uptr kSize = 128;
30 IndexT cache[kSize];
76 if (c->pos == Cache::kSize)
137 for (uptr i = 0; i < Cache::kSize / 2 && freelist_ != 0; i++) {
146 for (uptr i = 0; i < Cache::kSize / 2; i++) {
  /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];

Completed in 85 milliseconds

1 2 3