Home
last modified time | relevance | path

Searched refs:bits (Results 1 – 9 of 9) sorted by relevance

/rocksdb-6.9/table/block_based/
Dfilter_policy.cc492 uint32_t bits = static_cast<uint32_t>(n * whole_bits_per_key_); in CreateFilter() local
496 if (bits < 64) bits = 64; in CreateFilter()
498 uint32_t bytes = (bits + 7) / 8; in CreateFilter()
499 bits = bytes * 8; in CreateFilter()
509 LegacyNoLocalityBloomImpl::AddHash(BloomHash(keys[i]), bits, num_probes, in CreateFilter()
522 const uint32_t bits = static_cast<uint32_t>(len - 1) * 8; in KeyMayMatch() local
533 return LegacyNoLocalityBloomImpl::HashMayMatch(BloomHash(key), bits, k, in KeyMayMatch()
/rocksdb-6.9/third-party/folly/folly/synchronization/
DParkingLot.h244 const Key bits, in park_until() argument
249 auto key = hash::twang_mix64(uint64_t(bits)); in park_until()
286 void ParkingLot<Data>::unpark(const Key bits, Func&& func) { in unpark() argument
287 auto key = hash::twang_mix64(uint64_t(bits)); in unpark()
/rocksdb-6.9/tools/advisor/advisor/
Drules.ini158 suggestions=inc-bloom-bits-per-key
169 suggestions=inc-bloom-bits-per-key
178 [Suggestion "inc-bloom-bits-per-key"]
/rocksdb-6.9/docs/_posts/
D2017-03-02-rocksdb-5-2-1-released.markdown9 * NewLRUCache() will determine number of shard bits automatically based on capacity, if the user do…
D2014-09-12-new-bloom-filter-format.markdown19 In brief, [bloom filter](https://github.com/facebook/rocksdb/wiki/RocksDB-Bloom-Filter) is a bits a…
/rocksdb-6.9/tools/
Dldb_cmd.cc602 int bits; in PrepareOptionsForOpenDB() local
603 if (ParseIntOption(option_map_, ARG_BLOOM_BITS, bits, exec_state_)) { in PrepareOptionsForOpenDB()
604 if (bits > 0) { in PrepareOptionsForOpenDB()
606 table_options.filter_policy.reset(NewBloomFilterPolicy(bits)); in PrepareOptionsForOpenDB()
/rocksdb-6.9/
DHISTORY.md108bits per key or millions of keys in a single (full) filter. For example, the new Bloom filter has …
191 …e include_flags doesn't have either of INCLUDE_MEMTABLES or INCLUDE_FILES bits set. It's recommend…
677 * NewLRUCache() will determine number of shard bits automatically based on capacity, if the user do…
/rocksdb-6.9/third-party/gtest-1.8.1/fused-src/gtest/
Dgtest-all.cc3248 inline UInt32 ChopLowBits(UInt32* bits, int n) { in ChopLowBits() argument
3249 const UInt32 low_bits = *bits & ((static_cast<UInt32>(1) << n) - 1); in ChopLowBits()
3250 *bits >>= n; in ChopLowBits()
Dgtest.h8192 static RawType ReinterpretBits(const Bits bits) {
8194 fp.u_.bits_ = bits;
8209 const Bits &bits() const { return u_.bits_; }