Searched refs:buckets (Results 1 – 11 of 11) sorted by relevance
| /rocksdb-6.9/table/cuckoo/ |
| D | cuckoo_table_builder.cc | 186 Status CuckooTableBuilder::MakeHashTable(std::vector<CuckooBucket>* buckets) { in MakeHashTable() argument
187 buckets->resize(static_cast<size_t>(hash_table_size_ + cuckoo_block_size_ - 1)); in MakeHashTable()
217 ++make_space_for_key_call_id, buckets, &bucket_id)) { in MakeHashTable()
238 (*buckets)[static_cast<size_t>(bucket_id)].vector_idx = vector_idx; in MakeHashTable()
246 std::vector<CuckooBucket> buckets; in Finish() local
255 status_ = MakeHashTable(&buckets); in Finish()
302 for (auto& bucket : buckets) { in Finish()
323 uint64_t offset = buckets.size() * bucket_size; in Finish()
443 std::vector<CuckooBucket>* buckets, uint64_t* bucket_id) { in MakeSpaceForKey() argument
510 (*buckets)[static_cast<size_t>(curr_node.bucket_id)] = in MakeSpaceForKey()
[all …]
|
| D | cuckoo_table_builder.h | 92 std::vector<CuckooBucket>* buckets, uint64_t* bucket_id);
93 Status MakeHashTable(std::vector<CuckooBucket>* buckets);
|
| /rocksdb-6.9/table/block_based/ |
| D | data_block_hash_index.cc | 43 std::vector<uint8_t> buckets(num_buckets, kNoEntry); in Finish() local
49 if (buckets[buck_idx] == kNoEntry) { in Finish()
50 buckets[buck_idx] = restart_index; in Finish()
51 } else if (buckets[buck_idx] != restart_index) { in Finish()
53 buckets[buck_idx] = kCollision; in Finish()
57 for (uint8_t restart_index : buckets) { in Finish()
|
| D | block_prefix_index.cc | 124 uint32_t* buckets = new uint32_t[num_buckets]; in Finish() local
130 buckets[i] = kNoneBlock; in Finish()
134 buckets[i] = prefixes_per_bucket[i]->start_block; in Finish()
138 buckets[i] = EncodeIndex(offset); in Finish()
158 buckets, total_block_array_entries, in Finish()
|
| D | block_prefix_index.h | 50 uint32_t num_buckets, uint32_t* buckets, in BlockPrefixIndex() argument
56 buckets_(buckets), in BlockPrefixIndex()
|
| /rocksdb-6.9/tools/block_cache_analyzer/ |
| D | block_cache_trace_analyzer.cc | 2097 std::vector<uint64_t> buckets; in parse_buckets() local
2102 buckets.push_back(ParseUint64(bucket)); in parse_buckets()
2104 buckets.push_back(port::kMaxUint64); in parse_buckets()
2105 return buckets; in parse_buckets()
2220 analyzer.WriteReuseDistance(label, buckets); in block_cache_trace_analyzer_tool()
2231 analyzer.WriteReuseInterval(label, buckets); in block_cache_trace_analyzer_tool()
2242 analyzer.WriteReuseLifetime(label, buckets); in block_cache_trace_analyzer_tool()
2262 std::vector<uint64_t> buckets = in block_cache_trace_analyzer_tool() local
2268 analyzer.WriteGetSpatialLocality(label, buckets); in block_cache_trace_analyzer_tool()
2291 analyzer.WriteSkewness(label, buckets, in block_cache_trace_analyzer_tool()
[all …]
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2014-09-12-cuckoo.markdown | 52 …buckets of hash table and there is an edge from bucket _A_ to bucket _B_ if the element stored in …
71 …buckets, _h1(k)+1, _h1(k)+2, _..., h1(k)+t-1_. If all of these _t_ locations are occupied, we skip…
|
| D | 2018-08-23-data-block-hash-index.markdown | 32 // #entries/#buckets. It is valid only when data_block_hash_index_type is
54 … hash table utilization ratio as the #keys/#buckets. If a utilization ratio is 0.5 and there are 1…
|
| D | 2017-09-28-rocksdb-5-8-released.markdown | 9 * Users of `Statistics::getHistogramString()` will see fewer histogram buckets and different bucket…
|
| D | 2014-06-23-plaintable-a-new-file-format.markdown | 35 1. Since our file is immutable, we can accurately estimate the number of hash buckets needed.
|
| /rocksdb-6.9/ |
| D | HISTORY.md | 581 * Users of `Statistics::getHistogramString()` will see fewer histogram buckets and different bucket…
|