Home
last modified time | relevance | path

Searched refs:start_key (Results 1 – 22 of 22) sorted by relevance

/rocksdb-6.9/db/compaction/
Dcompaction_job_stats_test.cc667 for (uint64_t start_key = key_base; in TEST_P() local
671 &rnd, start_key, start_key + key_base - 1, in TEST_P()
684 for (uint64_t start_key = key_base; in TEST_P() local
724 for (uint64_t start_key = key_base; in TEST_P() local
728 &rnd, start_key, start_key + key_base * sparseness - 1, in TEST_P()
886 for (uint64_t start_key = key_base; in TEST_P() local
890 &rnd, start_key, start_key + key_base - 1, in TEST_P()
902 for (uint64_t start_key = key_base; in TEST_P() local
906 &rnd, start_key, start_key + key_base - 1, in TEST_P()
1008 for (uint64_t start_key = key_base; in TEST_P() local
[all …]
/rocksdb-6.9/db/
Drange_tombstone_fragmenter.h30 : start_key(start), in RangeTombstoneStack()
35 Slice start_key; member
152 return RangeTombstone(start_key(), end_key(), seq()); in Tombstone()
154 Slice start_key() const { return pos_->start_key; } in start_key() function
158 return ParsedInternalKey(pos_->start_key, kMaxSequenceNumber, in parsed_start_key()
191 return cmp->Compare(a.start_key, b.start_key) < 0; in operator()
195 return cmp->Compare(a.start_key, b) < 0; in operator()
199 return cmp->Compare(a, b.start_key) < 0; in operator()
227 current_start_key_.Set(pos_->start_key, *seq_pos_, kTypeRangeDeletion); in MaybePinKey()
Drange_del_aggregator_bench.cc99 std::string start_key; member
105 : start_key(std::move(start)), end_key(std::move(end)) { in PersistentRangeTombstone()
106 tombstone = RangeTombstone(start_key, end_key, seq); in PersistentRangeTombstone()
114 start_key = t.start_key; in operator =()
116 tombstone = RangeTombstone(start_key, end_key, t.tombstone.seq_); in operator =()
124 start_key = std::move(t.start_key); in operator =()
126 tombstone = RangeTombstone(start_key, end_key, t.tombstone.seq_); in operator =()
Drange_del_aggregator.cc178 icmp_->Compare(inactive_iters_.top()->start_key(), parsed) <= 0) { in ShouldDelete()
210 icmp_->Compare(parsed, (*active_iters_.top())->start_key()) < 0) { in ShouldDelete()
214 } while (iter->Valid() && icmp_->Compare(parsed, iter->start_key()) < 0); in ShouldDelete()
223 while (iter->Valid() && icmp_->Compare(parsed, iter->start_key()) < 0) { in ShouldDelete()
291 iter->Valid() && icmp_->Compare(iter->start_key(), end_ikey) <= 0; in IsRangeOverlapped()
295 icmp_->Compare(iter->start_key(), end_ikey) <= 0) { in IsRangeOverlapped()
306 icmp_->Compare(iter->start_key(), end_ikey) <= 0) { in IsRangeOverlapped()
425 cur_start_key_.Set(top->start_key().user_key, top->seq(), in key()
447 int cmp = icmp_->user_comparator()->Compare(iter->start_key().user_key, in BeforeEndKey()
Drange_del_aggregator.h59 ParsedInternalKey start_key() const { in start_key() function
105 return icmp->Compare(a->start_key(), b->start_key()) > 0; in operator()
150 int cmp = icmp_->Compare(parsed, iter->start_key()); in PushIter()
224 return icmp->Compare((*a)->start_key(), (*b)->start_key()) < 0; in operator()
Dc.cc1197 const char* start_key, size_t start_key_len, in rocksdb_compact_range() argument
1203 (start_key ? (a = Slice(start_key, start_key_len), &a) : nullptr), in rocksdb_compact_range()
1210 const char* start_key, size_t start_key_len, in rocksdb_compact_range_cf() argument
1216 (start_key ? (a = Slice(start_key, start_key_len), &a) : nullptr), in rocksdb_compact_range_cf()
1227 (start_key ? (a = Slice(start_key, start_key_len), &a) : nullptr), in rocksdb_compact_range_opt()
1240 (start_key ? (a = Slice(start_key, start_key_len), &a) : nullptr), in rocksdb_compact_range_cf_opt()
1500 const char* start_key, in rocksdb_writebatch_delete_range() argument
1503 b->rep.DeleteRange(Slice(start_key, start_key_len), in rocksdb_writebatch_delete_range()
1760 b->rep->DeleteRange(Slice(start_key, start_key_len), in rocksdb_writebatch_wi_delete_range()
3736 (start_key ? (a = Slice(start_key, start_key_len), &a) : nullptr), in rocksdb_delete_file_in_range()
[all …]
Dmanual_compaction_test.cc157 std::string start_key = Key1(0); in TEST_F() local
159 Slice least(start_key.data(), start_key.size()); in TEST_F()
Drange_del_aggregator_test.cc89 EXPECT_EQ(0, icmp.Compare(iter->start_key(), expected_range_dels[i].start)); in VerifyIterator()
102 EXPECT_EQ(0, icmp.Compare(iter->start_key(), in VerifyIterator()
120 EXPECT_EQ(0, icmp.Compare(iter->start_key(), test_case.start)); in VerifySeek()
136 EXPECT_EQ(0, icmp.Compare(iter->start_key(), test_case.start)); in VerifySeekForPrev()
177 EXPECT_EQ(tombstone.start_key_, iter->start_key()); in CheckIterPosition()
Dexternal_sst_file_ingestion_job.cc503 InternalKey start_key = tombstone.SerializeKey(); in GetIngestedFileInfo() local
505 sstableKeyCompare(ucmp, start_key, in GetIngestedFileInfo()
507 file_to_ingest->smallest_internal_key = start_key; in GetIngestedFileInfo()
Dexternal_sst_file_basic_test.cc64 std::string start_key = Key(range_deletions[i].first); in GenerateAndAddExternalFile() local
66 s = sst_file_writer.DeleteRange(start_key, end_key); in GenerateAndAddExternalFile()
71 auto start_key_it = true_data->find(start_key); in GenerateAndAddExternalFile()
73 start_key_it = true_data->upper_bound(start_key); in GenerateAndAddExternalFile()
Ddb_tailing_iter_test.cc372 std::string start_key = "00001"; in TEST_F() local
373 iter->Seek(start_key); in TEST_F()
Drange_tombstone_fragmenter_test.cc40 EXPECT_EQ(tombstone.start_key_, iter->start_key()); in CheckIterPosition()
Drange_tombstone_fragmenter.cc412 return ValidPos() && ucmp_->Compare(start_key(), target_user_key) <= 0 ? seq() in MaxCoveringTombstoneSeqnum()
Ddb_with_timestamp_basic_test.cc838 std::string start_key = Key1(targets[j]); in TEST_P() local
850 pe->Transform(saved_prev_key) != pe->Transform(start_key)) { in TEST_P()
Dversion_set.cc1304 ss << "start: " << tombstone_iter->start_key().ToString(true) in TablesRangeTombstoneSummary()
/rocksdb-6.9/db/db_impl/
Ddb_impl_experimental.cc27 InternalKey start_key, end_key; in SuggestCompactRange() local
29 start_key.SetMinPossibleForUserKey(*begin); in SuggestCompactRange()
40 level, begin == nullptr ? nullptr : &start_key, in SuggestCompactRange()
Ddb_impl.cc2169 const ReadOptions& read_options, size_t start_key, size_t num_keys, in MultiGetImpl() argument
2185 MultiGetContext ctx(sorted_keys, start_key + num_keys - keys_left, in MultiGetImpl()
2224 for (size_t i = start_key; i < start_key + num_keys; ++i) { in MultiGetImpl()
Ddb_impl.h1767 const ReadOptions& read_options, size_t start_key, size_t num_keys,
/rocksdb-6.9/include/rocksdb/
Dc.h272 rocksdb_column_family_handle_t* column_family, const char* start_key,
377 const char* start_key,
384 const char* start_key, size_t start_key_len, const char* limit_key,
388 rocksdb_t* db, rocksdb_compactoptions_t* opt, const char* start_key,
393 rocksdb_compactoptions_t* opt, const char* start_key, size_t start_key_len,
508 rocksdb_writebatch_t* b, const char* start_key, size_t start_key_len,
512 const char* start_key, size_t start_key_len, const char* end_key,
597 rocksdb_writebatch_wi_t* b, const char* start_key, size_t start_key_len,
602 const char* start_key, size_t start_key_len, const char* end_key,
1504 rocksdb_t* db, const char* start_key, size_t start_key_len,
[all …]
/rocksdb-6.9/table/
Dtable_reader_bench.cc196 std::string start_key = MakeKey(r1, r2, through_db); in TableReaderBenchmark() local
210 for (through_db ? iter->Seek(start_key) : iiter->Seek(start_key); in TableReaderBenchmark()
/rocksdb-6.9/db_stress_tool/
Ddb_stress_test_base.h110 const Slice& start_key,
117 const Slice& start_key, const Slice& end_key);
Ddb_stress_test_base.cc1539 const Slice& start_key, in TestCompactRange() argument
1571 GetRangeHash(thread, pre_snapshot, column_family, start_key, end_key); in TestCompactRange()
1574 Status status = db_->CompactRange(cro, column_family, &start_key, &end_key); in TestCompactRange()
1583 GetRangeHash(thread, pre_snapshot, column_family, start_key, end_key); in TestCompactRange()
1588 start_key.ToString(true).c_str(), end_key.ToString(true).c_str()); in TestCompactRange()
1599 const Slice& start_key, in GetRangeHash() argument
1607 for (it->Seek(start_key); in GetRangeHash()