Home
last modified time | relevance | path

Searched refs:kNumBlocks (Results 1 – 5 of 5) sorted by relevance

/rocksdb-6.9/table/plain/
Dplain_table_bloom.h54 uint32_t GetNumBlocks() const { return kNumBlocks; } in GetNumBlocks()
62 bool IsInitialized() const { return kNumBlocks > 0 || kTotalBits > 0; } in IsInitialized()
66 uint32_t kNumBlocks; variable
81 if (kNumBlocks != 0) { in Prefetch()
84 h, kNumBlocks, data_, &ignored, LOG2_CACHE_LINE_SIZE); in Prefetch()
93 if (kNumBlocks != 0) { in MayContainHash()
95 h, kNumBlocks, kNumProbes, data_, LOG2_CACHE_LINE_SIZE); in MayContainHash()
104 if (kNumBlocks != 0) { in AddHash()
105 LegacyLocalityBloomImpl<true>::AddHash(h, kNumBlocks, kNumProbes, data_, in AddHash()
Dplain_table_bloom.cc33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
39 kNumBlocks = num_blocks; in SetRawData()
48 kNumBlocks = (locality > 0) ? (kTotalBits / (CACHE_LINE_SIZE * 8)) : 0; in SetTotalBits()
50 assert(kNumBlocks > 0 || kTotalBits > 0); in SetTotalBits()
54 if (kNumBlocks > 0) { in SetTotalBits()
62 if (kNumBlocks > 0 && cache_line_offset > 0) { in SetTotalBits()
/rocksdb-6.9/utilities/simulator_cache/
Dsim_cache_test.cc21 const size_t kNumBlocks = 5; member in ROCKSDB_NAMESPACE::SimCacheTest
44 for (size_t i = 0; i < kNumBlocks * 2; i++) { in InitTable()
91 std::vector<std::unique_ptr<Iterator>> iterators(kNumBlocks); in TEST_F()
95 for (size_t i = 0; i < kNumBlocks; i++) { in TEST_F()
102 ASSERT_EQ(kNumBlocks, in TEST_F()
114 iter->Seek(ToString(kNumBlocks * 2 - 1)); in TEST_F()
121 for (size_t i = 0; i < kNumBlocks; i++) { in TEST_F()
126 for (size_t i = 0; i < kNumBlocks; i++) { in TEST_F()
133 for (size_t i = kNumBlocks; i < kNumBlocks * 2; i++) { in TEST_F()
140 ASSERT_EQ(3 * kNumBlocks + 1, in TEST_F()
Dcache_simulator_test.cc27 const size_t kNumBlocks = 5; member in ROCKSDB_NAMESPACE::CacheSimulatorTest
/rocksdb-6.9/db/
Ddb_block_cache_test.cc32 const size_t kNumBlocks = 10; member in ROCKSDB_NAMESPACE::DBBlockCacheTest
56 for (size_t i = 0; i < kNumBlocks; i++) { in InitTable()
162 std::vector<std::unique_ptr<Iterator>> iterators(kNumBlocks - 1); in TEST_F()
186 std::vector<std::unique_ptr<Iterator>> iterators(kNumBlocks - 1); in TEST_F()
190 for (size_t i = 0; i < kNumBlocks - 1; i++) { in TEST_F()
205 iter->Seek(ToString(kNumBlocks - 1)); in TEST_F()
212 for (size_t i = 0; i < kNumBlocks - 1; i++) { in TEST_F()
217 for (size_t i = 0; i < kNumBlocks - 1; i++) { in TEST_F()
246 for (size_t i = 0; i < kNumBlocks - 1; i++) { in TEST_F()
268 iter->Seek(ToString(kNumBlocks - 1)); in TEST_F()
[all …]