Home
last modified time | relevance | path

Searched refs:prefix (Results 1 – 25 of 63) sorted by relevance

123

/rocksdb-6.9/db/
Dprefix_test.cc62 uint64_t prefix; member
72 PutFixed64(&s, test_key.prefix); in TestKeyToSlice()
92 if (key_a->prefix != key_b->prefix) { in Compare()
93 if (key_a->prefix < key_b->prefix) return -1; in Compare()
94 if (key_a->prefix > key_b->prefix) return 1; in Compare()
96 EXPECT_TRUE(key_a->prefix == key_b->prefix); in Compare()
137 TestKey test_key(prefix, suffix); in PutKey()
164 TestKey test_key(prefix, suffix); in SeekIterator()
195 : prefix_(prefix), name_("rocksdb.SamePrefix." + prefix.ToString()) {} in SamePrefixTransform()
656 prefix++) { in TEST_F()
[all …]
Ddb_iter.cc149 Slice prefix; in Next() local
152 prefix = prefix_.GetUserKey(); in Next()
186 const Slice* prefix) { in FindNextUserEntryInternal() argument
236 assert(prefix == nullptr || prefix_extractor_ != nullptr); in FindNextUserEntryInternal()
237 if (prefix != nullptr && in FindNextUserEntryInternal()
571 Slice prefix; in Prev() local
574 prefix = prefix_.GetUserKey(); in Prev()
576 PrevInternal(prefix_same_as_start_ ? &prefix : nullptr); in Prev()
655 void DBIter::PrevInternal(const Slice* prefix) { in PrevInternal() argument
662 if (prefix != nullptr && in PrevInternal()
[all …]
Ddb_iter.h224 bool FindNextUserEntry(bool skipping_saved_key, const Slice* prefix);
226 bool FindNextUserEntryInternal(bool skipping_saved_key, const Slice* prefix);
232 void PrevInternal(const Slice* prefix);
Ddb_iter_test.cc307 Slice prefix("d"); in TEST_F() local
310 ro.iterate_upper_bound = &prefix; in TEST_F()
340 Slice prefix("z"); in TEST_F() local
343 ro.iterate_upper_bound = &prefix; in TEST_F()
376 Slice prefix("a"); in TEST_F() local
379 ro.iterate_upper_bound = &prefix; in TEST_F()
406 Slice prefix("c"); in TEST_F() local
444 Slice prefix("c"); in TEST_F() local
470 Slice prefix("a"); in TEST_F() local
493 Slice prefix("c"); in TEST_F() local
[all …]
/rocksdb-6.9/table/block_based/
Dfull_filter_block.cc61 Slice prefix = prefix_extractor_->Transform(key); in AddPrefix() local
68 if (!last_prefix_recorded_ || last_prefix.compare(prefix) != 0) { in AddPrefix()
69 AddKey(prefix); in AddPrefix()
71 last_prefix_str_.assign(prefix.data(), prefix.size()); in AddPrefix()
74 AddKey(prefix); in AddPrefix()
148 const Slice& prefix, const SliceTransform* /* prefix_extractor */, in PrefixMayMatch() argument
156 return MayMatch(prefix, no_io, get_context, lookup_context); in PrefixMayMatch()
294 Slice prefix = prefix_extractor->Transform(user_key); in RangeMayExist() local
308 const Slice* iterate_upper_bound, const Slice& prefix, in IsFilterCompatible() argument
320 if (!comparator->Equal(prefix, upper_bound_xform)) { in IsFilterCompatible()
[all …]
Dblock_prefix_index.cc23 inline uint32_t PrefixToBucket(const Slice& prefix, uint32_t num_buckets) { in PrefixToBucket() argument
24 return Hash(prefix) % num_buckets; in PrefixToBucket()
63 Slice prefix; member
78 record->prefix = key_prefix; in Add()
94 uint32_t bucket = PrefixToBucket(current->prefix, num_buckets); in Finish()
193 Slice prefix(prefixes.data() + pos, prefix_size); in Create() local
194 builder.Add(prefix, entry_index, num_blocks); in Create()
211 Slice prefix = internal_prefix_extractor_->Transform(key); in GetBlocks() local
213 uint32_t bucket = PrefixToBucket(prefix, num_buckets_); in GetBlocks()
Dblock_based_filter_block.cc108 Slice prefix = prefix_extractor_->Transform(key); in AddPrefix() local
110 if (prev.size() == 0 || prefix != prev) { in AddPrefix()
112 prev_prefix_size_ = prefix.size(); in AddPrefix()
113 AddKey(prefix); in AddPrefix()
212 const Slice& prefix, const SliceTransform* /* prefix_extractor */, in PrefixMayMatch() argument
217 return MayMatch(prefix, block_offset, no_io, get_context, lookup_context); in PrefixMayMatch()
Dfilter_block.h124 virtual bool PrefixMayMatch(const Slice& prefix,
170 Slice prefix = prefix_extractor->Transform(user_key); in RangeMayExist() local
171 return PrefixMayMatch(prefix, prefix_extractor, kNotValid, no_io, in RangeMayExist()
Dfull_filter_block.h101 bool PrefixMayMatch(const Slice& prefix,
131 bool IsFilterCompatible(const Slice* iterate_upper_bound, const Slice& prefix,
Dpartitioned_filter_block_test.cc388 auto prefix = prefix_extractor->Transform(key); in TEST_P() local
389 auto ikey = InternalKey(prefix, 0, ValueType::kTypeValue); in TEST_P()
392 prefix, prefix_extractor.get(), kNotValid, in TEST_P()
/rocksdb-6.9/include/rocksdb/
Denv_encryption.h145 virtual Status CreateNewPrefix(const std::string& fname, char* prefix,
151 const std::string& fname, const EnvOptions& options, Slice& prefix,
178 virtual Status CreateNewPrefix(const std::string& fname, char* prefix,
184 const std::string& fname, const EnvOptions& options, Slice& prefix,
193 virtual size_t PopulateSecretPrefixPart(char* prefix, size_t prefixLength,
200 uint64_t initialCounter, const Slice& iv, const Slice& prefix,
/rocksdb-6.9/env/
Denv_encryption.cc851 initialCounter = DecodeFixed64(prefix); in decodeCTRParameters()
853 iv = Slice(prefix + blockSize, blockSize); in decodeCTRParameters()
859 char* prefix, in CreateNewPrefix() argument
865 prefix[i] = rnd.Uniform(256) & 0xFF; in CreateNewPrefix()
871 decodeCTRParameters(prefix, blockSize, initialCounter, prefixIV); in CreateNewPrefix()
897 const std::string& fname, const EnvOptions& options, Slice& prefix, in CreateCipherStream() argument
903 decodeCTRParameters(prefix.data(), blockSize, initialCounter, iv); in CreateCipherStream()
907 assert(prefix.size() >= 2 * blockSize); in CreateCipherStream()
908 if (prefix.size() < 2 * blockSize) { in CreateCipherStream()
915 …auto status = cipherStream.Decrypt(0, (char*)prefix.data() + (2 * blockSize), prefix.size() - (2 *… in CreateCipherStream()
[all …]
/rocksdb-6.9/docs/_posts/
D2014-06-27-rocksdb-3-2-release.markdown14 …* PlainTable now supports a new key encoding: for keys of the same prefix, the prefix is only writ…
30 …ns::hash_index_allow_collision. When enabled, prefix hash index for block-based table will not sto…
D2014-04-07-rocksdb-2-8-release.markdown21 …ormat HashLinkedList, which is optimized for cases where there are only a few keys for each prefix.
27 …* Added a V2 compaction filter interface. It buffers the kv-pairs sharing the same key prefix, pro…
D2017-01-06-rocksdb-5-0-1-released.markdown24 …e for inserting keys into memtable, if keys can be group by prefix and insert for each prefix are …
/rocksdb-6.9/java/src/main/java/org/rocksdb/
DAbstractSlice.java167 public boolean startsWith(final AbstractSlice<?> prefix) { in startsWith() argument
168 if (prefix != null) { in startsWith()
169 return startsWith0(getNativeHandle(), prefix.getNativeHandle()); in startsWith()
/rocksdb-6.9/util/
Dslice.cc55 bool SameResultWhenAppended(const Slice& prefix) const override { in SameResultWhenAppended()
56 return InDomain(prefix); in SameResultWhenAppended()
93 bool SameResultWhenAppended(const Slice& prefix) const override { in SameResultWhenAppended()
94 return prefix.size() >= cap_len_; in SameResultWhenAppended()
/rocksdb-6.9/db_stress_tool/
Dno_batched_ops_stress.cc38 Slice prefix; in VerifyDb() local
43 prefix = Slice(seek_key.data(), prefix_to_use); in VerifyDb()
53 if (prefix_to_use > 0 && prefix.compare(pfx) != 0) { in VerifyDb()
56 prefix = Slice(seek_key.data(), prefix_to_use); in VerifyDb()
269 Slice prefix = Slice(key.data(), FLAGS_prefix_size); in TestPrefixScan() local
276 if (GetNextPrefix(prefix, &upper_bound) && thread->rand.OneIn(2)) { in TestPrefixScan()
284 for (iter->Seek(prefix); iter->Valid() && iter->key().starts_with(prefix); in TestPrefixScan()
289 assert(count <= GetPrefixKeyCount(prefix.ToString(), upper_bound)); in TestPrefixScan()
Dcf_consistency_stress.cc245 Slice prefix = Slice(key.data(), prefix_to_use); in TestPrefixScan() local
252 if (GetNextPrefix(prefix, &upper_bound) && thread->rand.OneIn(2)) { in TestPrefixScan()
261 for (iter->Seek(prefix); iter->Valid() && iter->key().starts_with(prefix); in TestPrefixScan()
266 count <= GetPrefixKeyCount(prefix.ToString(), upper_bound)); in TestPrefixScan()
/rocksdb-6.9/tools/
Dwrite_stress.cc170 std::string prefix; in WriteThread() local
171 prefix.resize(kPrefixSize); in WriteThread()
173 prefix[i] = key_prefix_[i].load(std::memory_order_relaxed); in WriteThread()
175 auto key = prefix + random_string(rng, FLAGS_key_size - kPrefixSize); in WriteThread()
Dtrace_analyzer_tool.cc664 std::string prefix = "0"; in MakeStatisticKeyStatsOrPrefix() local
697 if (record.first.compare(0, FLAGS_output_prefix_cut, prefix) != 0) { in MakeStatisticKeyStatsOrPrefix()
699 ROCKSDB_NAMESPACE::LDBCommand::StringToHex(prefix); in MakeStatisticKeyStatsOrPrefix()
751 prefix = record.first.substr(0, FLAGS_output_prefix_cut); in MakeStatisticKeyStatsOrPrefix()
1051 std::vector<std::string> prefix(kTaTypeNum); in ReProcessing() local
1105 prefix[type] = input_key.substr(0, FLAGS_output_prefix_cut); in ReProcessing()
1202 std::string prefix; in KeyStatsInsertion() local
1204 prefix = key.substr(0, FLAGS_output_prefix_cut); in KeyStatsInsertion()
1241 tmp_qps_map[prefix] = 1; in KeyStatsInsertion()
1299 found_stats->second.a_qps_prefix_stats[time_in_sec][prefix] = 1; in KeyStatsInsertion()
[all …]
/rocksdb-6.9/utilities/persistent_cache/
Dpersistent_cache_test.h124 const std::string prefix = "key_prefix_"; in InsertImpl() local
134 auto k = prefix + PaddedNumber(i, /*count=*/8); in InsertImpl()
149 const std::string prefix = "key_prefix_"; variable
158 auto k = prefix + PaddedNumber(i, /*count=*/8);
/rocksdb-6.9/table/plain/
Dplain_table_key_coding.cc113 Slice prefix = in AppendKey() local
115 if (key_count_for_prefix_ == 0 || prefix != pre_prefix_.GetUserKey() || in AppendKey()
118 pre_prefix_.SetUserKey(prefix); in AppendKey()
Dplain_table_builder.cc138 Slice prefix = in Add() local
140 keys_or_prefixes_hashes_.push_back(GetSliceHash(prefix)); in Add()
/rocksdb-6.9/file/
Dfilename.cc180 prefix = Slice(buf, sizeof(kInfoLogPrefix) - 1); in InfoLogPrefix()
183 prefix = Slice(buf, len); in InfoLogPrefix()
448 if (ParseFileName(f, &number, info_log_prefix.prefix, &type) && in GetInfoLogFiles()

123