Home
last modified time | relevance | path

Searched refs:total_bits (Results 1 – 7 of 7) sorted by relevance

/rocksdb-6.9/table/block_based/
Dfilter_policy.cc266 uint32_t total_bits, num_lines; in Finish() local
272 if (total_bits != 0 && num_lines != 0) { in Finish()
274 AddHash(h, data, num_lines, total_bits); in Finish()
284 num_entries, total_bits / 8, num_probes_); in Finish()
309 return Slice(data, total_bits / 8 + 5); in Finish()
332 *num_lines = *total_bits / (CACHE_LINE_SIZE * 8); in CalculateSpace()
333 assert(*total_bits > 0 && *total_bits % 8 == 0); in CalculateSpace()
336 *total_bits = 0; in CalculateSpace()
341 uint32_t sz = *total_bits / 8; in CalculateSpace()
374 static_cast<void>(total_bits); in AddHash()
[all …]
Dblock_test.cc340 size_t total_bits = 0; in TEST_F() local
342 total_bits += read_amp_slow_and_accurate.IsPinMarked( in TEST_F()
345 size_t expected_estimate_useful = total_bits * kBytesPerBit; in TEST_F()
/rocksdb-6.9/table/plain/
Dplain_table_bloom.cc18 uint32_t GetTotalBitsForLocality(uint32_t total_bits) { in GetTotalBitsForLocality() argument
20 (total_bits + CACHE_LINE_SIZE * 8 - 1) / (CACHE_LINE_SIZE * 8); in GetTotalBitsForLocality()
35 void PlainTableBloomV1::SetRawData(char* raw_data, uint32_t total_bits, in SetRawData() argument
38 kTotalBits = total_bits; in SetRawData()
42 void PlainTableBloomV1::SetTotalBits(Allocator* allocator, uint32_t total_bits, in SetTotalBits() argument
46 kTotalBits = (locality > 0) ? GetTotalBitsForLocality(total_bits) in SetTotalBits()
47 : (total_bits + 7) / 8 * 8; in SetTotalBits()
Dplain_table_bloom.h40 void SetTotalBits(Allocator* allocator, uint32_t total_bits,
58 void SetRawData(char* raw_data, uint32_t total_bits, uint32_t num_blocks = 0);
118 void SetTotalBits(Allocator* allocator, uint32_t total_bits, in SetTotalBits() argument
121 bloom_.SetTotalBits(allocator, total_bits, locality, huge_page_tlb_size, in SetTotalBits()
/rocksdb-6.9/util/
Dbloom_impl.h358 static inline void AddHash(uint32_t h, uint32_t total_bits, int num_probes, in AddHash() argument
362 const uint32_t bitpos = h % total_bits; in AddHash()
368 static inline bool HashMayMatch(uint32_t h, uint32_t total_bits, in HashMayMatch() argument
372 const uint32_t bitpos = h % total_bits; in HashMayMatch()
Ddynamic_bloom.cc28 DynamicBloom::DynamicBloom(Allocator* allocator, uint32_t total_bits, in DynamicBloom() argument
42 uint32_t blocks = (total_bits + block_bits - 1) / block_bits; in DynamicBloom()
Ddynamic_bloom.h47 explicit DynamicBloom(Allocator* allocator, uint32_t total_bits,