| /rocksdb-6.9/util/ |
| D | hash_map.h | 32 auto& bucket = table_[key % size]; in Contains() local
34 bucket.begin(), bucket.end(), in Contains()
36 return it != bucket.end(); in Contains()
40 auto& bucket = table_[key % size]; in Insert() local
41 bucket.push_back({key, value}); in Insert()
45 auto& bucket = table_[key % size]; in Delete() local
47 bucket.begin(), bucket.end(), in Delete()
49 if (it != bucket.end()) { in Delete()
50 auto last = bucket.end() - 1; in Delete()
54 bucket.pop_back(); in Delete()
[all …]
|
| /rocksdb-6.9/utilities/persistent_cache/ |
| D | hash_table.h | 106 return Insert(&bucket, t); in Insert()
123 if (Find(&bucket, t, ret)) { in Find()
143 return Erase(&bucket, t, ret); in Erase()
186 auto it = Find(&bucket->list_, t); in Insert()
187 if (it != bucket->list_.end()) { in Insert()
192 bucket->list_.push_back(t); in Insert()
197 auto it = Find(&bucket->list_, t); in Find()
198 if (it != bucket->list_.end()) { in Find()
208 auto it = Find(&bucket->list_, t); in Erase()
209 if (it != bucket->list_.end()) { in Erase()
[all …]
|
| D | hash_table_evictable.h | 44 typename hash_table::Bucket& bucket = GetBucket(h); in Insert() local
49 if (hash_table::Insert(&bucket, t)) { in Insert()
64 typename hash_table::Bucket& bucket = GetBucket(h); in Find() local
69 if (hash_table::Find(&bucket, t, ret)) { in Find()
95 typename hash_table::Bucket& bucket = GetBucket(h); variable
97 bool status = hash_table::Erase(&bucket, t, &tmp);
116 auto& bucket = hash_table::buckets_[i]; in Clear() local
117 for (auto* t : bucket.list_) { in Clear()
121 bucket.list_.clear(); in Clear()
|
| /rocksdb-6.9/memtable/ |
| D | hash_skiplist_rep.cc | 258 auto bucket = GetBucket(hash); in GetInitializedBucket() local
259 if (bucket == nullptr) { in GetInitializedBucket()
265 return bucket; in GetInitializedBucket()
273 bucket->Insert(key); in Insert()
279 if (bucket == nullptr) { in Contains()
282 return bucket->Contains(key); in Contains()
293 if (bucket != nullptr) { in Get()
294 Bucket::Iterator iter(bucket); in Get()
307 auto bucket = GetBucket(i); in GetIterator() local
308 if (bucket != nullptr) { in GetIterator()
[all …]
|
| D | hash_linklist_rep.cc | 416 auto* bucket = memtable_rep_.GetBucket(transformed); in Seek() local
419 memtable_rep_.GetSkipListBucketHeader(bucket); in Seek()
576 auto& bucket = buckets_[GetHash(transformed)]; in Insert() local
585 bucket.store(x, std::memory_order_release); in Insert()
601 bucket.store(header, std::memory_order_release); in Insert()
697 auto bucket = GetBucket(transformed); in Contains() local
698 if (bucket == nullptr) { in Contains()
718 auto bucket = GetBucket(transformed); in Get() local
729 auto* link_list_head = GetLinkListFirstNode(bucket); in Get()
748 auto* bucket = GetBucket(i); in GetIterator() local
[all …]
|
| D | vectorrep.cc | 58 std::shared_ptr<std::vector<const char*>> bucket,
147 std::shared_ptr<std::vector<const char*>> bucket, in Iterator() argument
150 bucket_(bucket), in Iterator()
254 std::shared_ptr<Bucket> bucket; in Get() local
259 bucket.reset(new Bucket(*bucket_)); // make a copy in Get()
261 VectorRep::Iterator iter(vector_rep, immutable_ ? bucket_ : bucket, compare_); in Get()
|
| /rocksdb-6.9/third-party/folly/folly/synchronization/ |
| D | ParkingLot.h | 250 auto& bucket = parking_lot_detail::Bucket::bucketFor(key); in park_until() local
255 bucket.count_.fetch_add(1, std::memory_order_seq_cst); in park_until()
257 std::unique_lock<std::mutex> bucketLock(bucket.mutex_); in park_until()
261 bucket.count_.fetch_sub(1, std::memory_order_relaxed); in park_until()
265 bucket.push_back(&node); in park_until()
274 std::lock_guard<std::mutex> bucketLock(bucket.mutex_); in park_until()
276 bucket.erase(&node); in park_until()
292 if (bucket.count_.load(std::memory_order_seq_cst) == 0) { in unpark()
296 std::lock_guard<std::mutex> bucketLock(bucket.mutex_); in unpark()
298 for (auto iter = bucket.head_; iter != nullptr;) { in unpark()
[all …]
|
| /rocksdb-6.9/table/block_based/ |
| D | block_prefix_index.cc | 94 uint32_t bucket = PrefixToBucket(current->prefix, num_buckets); in Finish() local
97 PrefixRecord* prev = prefixes_per_bucket[bucket]; in Finish()
104 num_blocks_per_bucket[bucket] += (current->num_blocks + distance - 1); in Finish()
109 prefixes_per_bucket[bucket] = current; in Finish()
110 num_blocks_per_bucket[bucket] += current->num_blocks; in Finish()
213 uint32_t bucket = PrefixToBucket(prefix, num_buckets_); in GetBlocks() local
214 uint32_t block_id = buckets_[bucket]; in GetBlocks()
219 *blocks = &buckets_[bucket]; in GetBlocks()
|
| /rocksdb-6.9/table/cuckoo/ |
| D | cuckoo_table_reader.cc | 154 const char* bucket = &file_data_.data()[offset]; in Get() local
156 ++block_idx, bucket += bucket_length_) { in Get()
158 Slice(bucket, user_key.size()))) { in Get()
163 if (ucomp_->Equal(user_key, Slice(bucket, user_key.size()))) { in Get()
164 Slice value(bucket + key_length_, value_length_); in Get()
173 Slice full_key(bucket, key_length_); in Get()
276 const char* bucket = reader_->file_data_.data(); in InitIfNeeded() local
278 if (Slice(bucket, reader_->key_length_) != Slice(reader_->unused_key_)) { in InitIfNeeded()
281 bucket += reader_->bucket_length_; in InitIfNeeded()
|
| D | cuckoo_table_builder.cc | 302 for (auto& bucket : buckets) { in Finish() local
303 if (bucket.vector_idx == kMaxVectorIdx) { in Finish()
307 io_status_ = file_->Append(GetKey(bucket.vector_idx)); in Finish()
310 io_status_ = file_->Append(GetValue(bucket.vector_idx)); in Finish()
|
| /rocksdb-6.9/table/plain/ |
| D | plain_table_index.cc | 42 int bucket = GetBucketIdFromHash(prefix_hash, index_size_); in GetOffset() local
43 GetUnaligned(index_ + bucket, bucket_value); in GetOffset()
134 uint32_t bucket = GetBucketIdFromHash(cur_hash, index_size_); in BucketizeIndexes() local
135 IndexRecord* prev_bucket_head = (*hash_to_offsets)[bucket]; in BucketizeIndexes()
137 (*hash_to_offsets)[bucket] = index_record; in BucketizeIndexes()
138 (*entries_per_bucket)[bucket]++; in BucketizeIndexes()
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2014-09-12-cuckoo.markdown | 52 …able and there is an edge from bucket _A_ to bucket _B_ if the element stored in bucket _A_ can be…
|
| D | 2014-07-29-rocksdb-3-3-release.markdown | 17 …sed performance outlier of HashLinkList caused by skewed bucket by switching data in the bucket fr…
|
| D | 2018-08-23-data-block-hash-index.markdown | 52 …bucket when storing the location of a key (or more precisely, the restart index of the restart int…
54 …zation ratio is 0.5 and there are 100 buckets, 50 keys are stored in the bucket. The less the util…
56 Space overhead depends on the util ratio. Each bucket is a `uint8_t` (i.e. one byte). For a util r…
|
| D | 2014-06-27-rocksdb-3-2-release.markdown | 27 …mters to NewHashLinkListRepFactory() for logging on too many entries in a hash bucket when flushing
|
| D | 2017-09-28-rocksdb-5-8-released.markdown | 9 * Users of `Statistics::getHistogramString()` will see fewer histogram buckets and different bucket…
|
| D | 2017-05-14-core-local-stats.markdown | 10 …stogram consists of several atomics to represent things like min/max/per-bucket counters. These st…
|
| /rocksdb-6.9/tools/block_cache_analyzer/ |
| D | block_cache_trace_analyzer.cc | 991 for (auto const& bucket : distance_buckets) { in WriteReuseDistance() local
992 std::string row(std::to_string(bucket)); in WriteReuseDistance()
994 auto const& it = label_it.second.find(bucket); in WriteReuseDistance()
1057 for (auto const& bucket : time_buckets) { in WriteStatsToFile() local
1058 std::string row(std::to_string(bucket)); in WriteStatsToFile()
1060 auto const& it = label_it.second.find(bucket); in WriteStatsToFile()
2100 std::string bucket; in parse_buckets() local
2101 getline(ss, bucket, ','); in parse_buckets()
2102 buckets.push_back(ParseUint64(bucket)); in parse_buckets()
|
| /rocksdb-6.9/tools/ |
| D | ldb_cmd.cc | 1362 int bucket = (timekv - ttl_start) / bucket_size; in IncBucketCounts() local
1363 bucket_counts[bucket]++; in IncBucketCounts()
|
| /rocksdb-6.9/ |
| D | HISTORY.md | 581 * Users of `Statistics::getHistogramString()` will see fewer histogram buckets and different bucket…
1043 * HashLinklist reduces performance outlier caused by skewed bucket by switching data in the bucket …
1059 …ters to NewHashLinkListRepFactory() for logging on too many entries in a hash bucket when flushing.
|