Home
last modified time | relevance | path

Searched refs:smallest (Results 1 – 25 of 37) sorted by relevance

12

/rocksdb-6.9/db/compaction/
Dcompaction_picker.cc172 smallest->Clear(); in GetRange()
179 *smallest = f->smallest; in GetRange()
182 if (icmp_->Compare(f->smallest, *smallest) < 0) { in GetRange()
183 *smallest = f->smallest; in GetRange()
191 *smallest = inputs[0]->smallest; in GetRange()
209 *smallest = in GetRange()
227 *smallest = current_smallest; in GetRange()
256 InternalKey smallest, largest; in ExpandInputsToCleanCut() local
314 InternalKey smallest, largest; in FilesRangeOverlapWithCompaction() local
461 InternalKey smallest, largest; in SetupOtherInputs() local
[all …]
Dcompaction.cc88 const Slice& start_user_key = f->smallest.user_key(); in GetBoundaryKeys()
102 const Slice& start_user_key = inputs[i].files[0]->smallest.user_key(); in GetBoundaryKeys()
137 cur_boundary.smallest = &f->smallest; in PopulateWithAtomicBoundaries()
139 } else if (sstableKeyCompare(ucmp, *cur_boundary.largest, f->smallest) == in PopulateWithAtomicBoundaries()
148 cur_boundary.smallest = &f->smallest; in PopulateWithAtomicBoundaries()
336 input_vstorage_->GetOverlappingInputs(output_level_ + 1, &file->smallest, in IsTrivialMove()
374 if (user_cmp->Compare(user_key, f->smallest.user_key()) >= 0) { in KeyNotExistsBeyondOutputLevel()
Dcompaction_picker.h140 void GetRange(const CompactionInputFiles& inputs, InternalKey* smallest,
147 const CompactionInputFiles& inputs2, InternalKey* smallest,
154 InternalKey* smallest, InternalKey* largest) const;
175 const InternalKey* smallest,
Dcompaction_job_stats_test.cc354 Random* rnd, uint64_t smallest, uint64_t largest, in MakeTableWithKeyValues() argument
357 for (auto key = smallest; key < largest; key += interval) { in MakeTableWithKeyValues()
367 void SelectivelyDeleteKeys(uint64_t smallest, uint64_t largest, in SelectivelyDeleteKeys() argument
380 for (auto key = smallest; key <= largest; key += interval, ctr++) { in SelectivelyDeleteKeys()
394 ASSERT_OK(Delete(cf, Key(smallest+1, key_size))); in SelectivelyDeleteKeys()
397 ASSERT_OK(Delete(cf, Key(smallest-1, key_size))); in SelectivelyDeleteKeys()
401 ASSERT_OK(Delete(cf, Key(smallest-9, key_size))); in SelectivelyDeleteKeys()
Dcompaction_picker_level.cc509 InternalKey smallest, largest; in PickFileToCompact() local
510 compaction_picker_->GetRange(start_level_inputs_, &smallest, &largest); in PickFileToCompact()
513 vstorage_->GetOverlappingInputs(output_level_, &smallest, &largest, in PickFileToCompact()
Dcompaction_job.cc219 grandparents[grandparent_index + 1]->smallest.Encode()) <= 0); in ShouldStopBefore()
264 return sub_compact_state.outputs[0].meta.smallest.user_key(); in SmallestUserKey()
1148 } else if (meta->smallest.size() > 0) { in FinishCompactionOutputFile()
1152 smallest_user_key = meta->smallest.user_key().ToString(false /*hex*/); in FinishCompactionOutputFile()
1282 if (meta->smallest.size() > 0) { in FinishCompactionOutputFile()
1283 smallest_ikey_seqnum = GetInternalKeySeqno(meta->smallest.Encode()); in FinishCompactionOutputFile()
1295 ExtractInternalKeyFooter(meta->smallest.Encode()) != in FinishCompactionOutputFile()
Dcompaction_picker_universal.cc153 return (ucmp_->Compare(i1.f->smallest.user_key(), in operator ()()
154 i2.f->smallest.user_key()) > 0); in operator ()()
239 curr.f->smallest.user_key()) >= 0) { in IsInputFilesNonOverlapping()
Dcompaction.h47 const InternalKey* smallest = nullptr; member
Dcompaction_job_test.cc136 std::string smallest, largest; in AddMockFile() local
152 cfd_->user_comparator()->Compare(key.user_key, smallest) < 0) { in AddMockFile()
153 smallest.assign(key.user_key.data(), key.user_key.size()); in AddMockFile()
/rocksdb-6.9/db/
Dversion_edit.cc95 if (smallest.size() == 0) { in UpdateBoundaries()
96 smallest.DecodeFrom(key); in UpdateBoundaries()
197 if (!f.smallest.Valid() || !f.largest.Valid()) { in EncodeTo()
203 PutLengthPrefixedSlice(dst, f.smallest.Encode()); in EncodeTo()
345 GetVarint64(input, &file_size) && GetInternalKey(input, &f.smallest) && in DecodeNewFile4From()
532 GetInternalKey(&input, &f.smallest) && in DecodeFrom()
550 GetInternalKey(&input, &f.smallest) && in DecodeFrom()
573 GetInternalKey(&input, &f.smallest) && in DecodeFrom()
728 r.append(f.smallest.DebugString(hex_key)); in DebugString()
826 jw << "SmallestIKey" << f.smallest.DebugString(hex_key); in DebugJSON()
Drange_del_aggregator.cc27 const InternalKeyComparator* icmp, const InternalKey* smallest, in TruncatedRangeDelIterator() argument
31 smallest_ikey_(smallest), in TruncatedRangeDelIterator()
33 if (smallest != nullptr) { in TruncatedRangeDelIterator()
36 if (!ParseInternalKey(smallest->Encode(), &parsed_smallest)) { in TruncatedRangeDelIterator()
316 const InternalKey* smallest, const InternalKey* largest) { in AddTombstones() argument
322 std::move(input_iter), icmp_, smallest, largest))); in AddTombstones()
338 const InternalKey* smallest, const InternalKey* largest) { in AddTombstones() argument
345 std::move(input_iter), icmp_, smallest, largest)); in AddTombstones()
Dversion_edit.h98 InternalKey smallest; // Smallest internal key served by table member
157 smallest(smallest_key), in FileMetaData()
178 if (smallest.size() == 0 || icmp.Compare(start, smallest) < 0) { in UpdateBoundariesForRange()
179 smallest = start; in UpdateBoundariesForRange()
326 uint64_t file_size, const InternalKey& smallest, in AddFile() argument
334 level, FileMetaData(file, file_path_id, file_size, smallest, largest, in AddFile()
Dfile_indexer.cc112 return ucmp_->CompareWithoutTimestamp(a->smallest.user_key(), in UpdateIndex()
126 return ucmp_->CompareWithoutTimestamp(a->smallest.user_key(), in UpdateIndex()
127 b->smallest.user_key()); in UpdateIndex()
134 b->smallest.user_key()); in UpdateIndex()
Dversion_builder.cc51 int r = cmp->Compare(a->smallest, b->smallest); in BySmallestKey()
286 f2->smallest) >= 0) { in CheckConsistency()
289 (f2->smallest).DebugString(true).c_str()); in CheckConsistency()
293 (f2->smallest).DebugString(true)); in CheckConsistency()
613 prev_added_file->smallest, added->smallest) <= 0); in SaveTo()
Drange_del_aggregator.h36 const InternalKeyComparator* icmp, const InternalKey* smallest,
281 const InternalKey* smallest = nullptr,
365 const InternalKey* smallest = nullptr,
398 const InternalKey* smallest = nullptr,
Dfile_indexer_test.cc55 void AddFile(int level, int64_t smallest, int64_t largest) { in AddFile() argument
57 f->smallest = IntKey(smallest); in AddFile()
Dversion_set_test.cc36 void Add(const char* smallest, const char* largest, in Add() argument
41 InternalKey(smallest, smallest_seq, kTypeValue), in Add()
133 void Add(int level, uint32_t file_number, const char* smallest, in Add() argument
137 file_number, 0, file_size, GetInternalKey(smallest, 0), in Add()
146 void Add(int level, uint32_t file_number, const InternalKey& smallest, in Add() argument
150 file_number, 0, file_size, smallest, largest, /* smallest_seq */ 0, in Add()
432 void Add(const char* smallest, const char* largest, in Add() argument
435 InternalKey smallest_key = InternalKey(smallest, smallest_seq, kTypeValue); in Add()
463 bool Overlaps(const char* smallest, const char* largest) { in Overlaps() argument
465 Slice s(smallest != nullptr ? smallest : ""); in Overlaps()
[all …]
Drange_del_aggregator_test.cc289 InternalKey smallest("d", 7, kTypeValue); in TEST_F() local
292 &smallest, &largest); in TEST_F()
325 InternalKey smallest("f", 7, kTypeValue); in TEST_F() local
328 &smallest, &largest); in TEST_F()
Dtable_cache.cc234 const InternalKey* smallest = &file_meta.smallest; in NewIterator() local
237 smallest = smallest_compaction_key; in NewIterator()
242 range_del_agg->AddTombstones(std::move(range_del_iter), smallest, in NewIterator()
Dflush_job_test.cc237 ASSERT_EQ(ToString(0), file_meta.smallest.user_key().ToString()); in TEST_F()
303 ASSERT_EQ(ToString(0), file_meta.smallest.user_key().ToString()); in TEST_F()
407 ASSERT_EQ(ToString(0), file_meta.smallest.user_key().ToString()); in TEST_F()
Dversion_set.cc780 Slice smallest_key = files[i]->smallest.Encode(); in DoGenerateLevelFilesBrief()
2587 f->fd.GetNumber(), f->smallest.DebugString(true).c_str(), in AddFile()
2589 f2->smallest.DebugString(true).c_str(), in AddFile()
3023 auto& file_key = within_interval ? f.file_metadata->smallest in GetOverlappingInputsRangeBinarySearch()
3051 : f.file_metadata->smallest; in GetOverlappingInputsRangeBinarySearch()
3062 auto& next_start = files[end_index].file_metadata->smallest; in GetOverlappingInputsRangeBinarySearch()
3096 **next_smallest = files_[level][end_index]->smallest; in GetOverlappingInputsRangeBinarySearch()
3361 ranges.end() : ranges.lower_bound(&file->smallest); in EstimateLiveDataSize()
3364 file->largest, (*lb).second->smallest) < 0) { in EstimateLiveDataSize()
3440 r.append(files[i]->smallest.DebugString(hex)); in DebugString()
[all …]
Dversion_builder_test.cc57 void Add(int level, uint32_t file_number, const char* smallest, in Add() argument
66 file_number, path_id, file_size, GetInternalKey(smallest, smallest_seq), in Add()
/rocksdb-6.9/docs/_posts/
D2014-04-21-indexing-sst-files-for-better-lookup-performance.markdown12 … the time they are flushed. Their key range (as defined by FileMetaData.smallest and FileMetaData.…
22 …leMetaData.smallest and FileMetaData.largest to decide if it falls into the range. The comparison …
24 …le 2's range shows the target key is smaller than file 2's FileMetaData.smallest 300. Even though,…
D2017-09-28-rocksdb-5-8-released.markdown25 * Fix potentially wrong file smallest key when range deletions separated by snapshot are written to…
/rocksdb-6.9/db/db_impl/
Ddb_impl_experimental.cc103 if (icmp->Compare(prev_f->largest, f->smallest) >= 0) { in PromoteL0()
129 f->fd.GetFileSize(), f->smallest, f->largest, in PromoteL0()

12