| /rocksdb-6.9/db/compaction/ |
| D | compaction_picker.cc | 173 largest->Clear(); in GetRange()
180 *largest = f->largest; in GetRange()
185 if (icmp_->Compare(f->largest, *largest) > 0) { in GetRange()
186 *largest = f->largest; in GetRange()
192 *largest = inputs[inputs.size() - 1]->largest; in GetRange()
228 *largest = current_largest; in GetRange()
235 *largest = current_largest; in GetRange()
256 InternalKey smallest, largest; in ExpandInputsToCleanCut() local
314 InternalKey smallest, largest; in FilesRangeOverlapWithCompaction() local
461 InternalKey smallest, largest; in SetupOtherInputs() local
[all …]
|
| D | compaction.cc | 93 const Slice& end_user_key = f->largest.user_key(); in GetBoundaryKeys()
107 const Slice& end_user_key = inputs[i].files.back()->largest.user_key(); in GetBoundaryKeys()
138 cur_boundary.largest = &f->largest; in PopulateWithAtomicBoundaries()
139 } else if (sstableKeyCompare(ucmp, *cur_boundary.largest, f->smallest) == in PopulateWithAtomicBoundaries()
144 cur_boundary.largest = &f->largest; in PopulateWithAtomicBoundaries()
149 cur_boundary.largest = &f->largest; in PopulateWithAtomicBoundaries()
337 &file->largest, &file_grand_parents); in IsTrivialMove()
372 if (user_cmp->Compare(user_key, f->largest.user_key()) <= 0) { in KeyNotExistsBeyondOutputLevel()
|
| D | compaction_picker.h | 141 InternalKey* largest) const;
148 InternalKey* largest) const;
154 InternalKey* smallest, InternalKey* largest) const;
176 const InternalKey* largest, int level, int* index);
|
| D | compaction_picker_level.cc | 509 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()
|
| D | compaction_job_stats_test.cc | 354 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()
|
| D | compaction_picker_universal.cc | 238 if (comparator->Compare(prev.f->largest.user_key(), in IsInputFilesNonOverlapping()
243 assert(comparator->Compare(curr.f->largest.user_key(), in IsInputFilesNonOverlapping()
244 prev.f->largest.user_key()) > 0); in IsInputFilesNonOverlapping()
|
| D | compaction_job.cc | 211 grandparents[grandparent_index]->largest.Encode()) > in ShouldStopBefore()
218 grandparents[grandparent_index]->largest.Encode(), in ShouldStopBefore()
276 return it->current_output()->meta.largest.user_key(); in LargestUserKey()
1182 if (upper_bound != nullptr && meta->largest.size() > 0) { in FinishCompactionOutputFile()
1184 ucmp->Compare(meta->largest.user_key(), *upper_bound) == 0; in FinishCompactionOutputFile()
|
| D | compaction.h | 48 const InternalKey* largest = nullptr; member
|
| D | compaction_job_test.cc | 136 std::string smallest, largest; in AddMockFile() local
157 cfd_->user_comparator()->Compare(key.user_key, largest) > 0) { in AddMockFile()
158 largest.assign(key.user_key.data(), key.user_key.size()); in AddMockFile()
|
| /rocksdb-6.9/db/ |
| D | range_del_aggregator.cc | 28 const InternalKey* largest) in TruncatedRangeDelIterator() argument
32 largest_ikey_(largest) { in TruncatedRangeDelIterator()
41 if (largest != nullptr) { in TruncatedRangeDelIterator()
44 if (!ParseInternalKey(largest->Encode(), &parsed_largest)) { 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()
|
| D | version_edit.h | 99 InternalKey largest; // Largest internal key served by table member
158 largest(largest_key), in FileMetaData()
181 if (largest.size() == 0 || icmp.Compare(largest, end) < 0) { in UpdateBoundariesForRange()
182 largest = end; in UpdateBoundariesForRange()
327 const InternalKey& largest, const SequenceNumber& smallest_seqno, in AddFile() argument
334 level, FileMetaData(file, file_path_id, file_size, smallest, largest, in AddFile()
|
| D | version_edit.cc | 98 largest.DecodeFrom(key); in UpdateBoundaries()
197 if (!f.smallest.Valid() || !f.largest.Valid()) { in EncodeTo()
204 PutLengthPrefixedSlice(dst, f.largest.Encode()); in EncodeTo()
346 GetInternalKey(input, &f.largest) && in DecodeNewFile4From()
533 GetInternalKey(&input, &f.largest)) { in DecodeFrom()
551 GetInternalKey(&input, &f.largest) && in DecodeFrom()
574 GetInternalKey(&input, &f.largest) && in DecodeFrom()
730 r.append(f.largest.DebugString(hex_key)); in DebugString()
827 jw << "LargestIKey" << f.largest.DebugString(hex_key); in DebugJSON()
|
| D | file_indexer.cc | 113 b->largest.user_key()); in UpdateIndex()
119 return ucmp_->CompareWithoutTimestamp(a->largest.user_key(), in UpdateIndex()
120 b->largest.user_key()); in UpdateIndex()
133 return ucmp_->CompareWithoutTimestamp(a->largest.user_key(), in UpdateIndex()
|
| D | range_del_aggregator.h | 37 const InternalKey* largest);
282 const InternalKey* largest = nullptr) = 0;
366 const InternalKey* largest = nullptr) override;
399 const InternalKey* largest = nullptr) override;
|
| D | file_indexer_test.cc | 55 void AddFile(int level, int64_t smallest, int64_t largest) { in AddFile() argument
58 f->largest = IntKey(largest); in AddFile()
|
| D | version_set_test.cc | 36 void Add(const char* smallest, const char* largest, in Add() argument
42 InternalKey(largest, largest_seq, kTypeValue), smallest_seq, in Add()
134 const char* largest, uint64_t file_size = 0) { in Add() argument
138 GetInternalKey(largest, 0), /* smallest_seq */ 0, /* largest_seq */ 0, in Add()
147 const InternalKey& largest, uint64_t file_size = 0) { 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
436 InternalKey largest_key = InternalKey(largest, largest_seq, kTypeValue); in Add()
463 bool Overlaps(const char* smallest, const char* largest) { in Overlaps() argument
466 Slice l(largest != nullptr ? largest : ""); in Overlaps()
[all …]
|
| D | range_del_aggregator_test.cc | 290 InternalKey largest("m", 9, kTypeValue); in TEST_F() local
292 &smallest, &largest); in TEST_F()
326 InternalKey largest("i", 9, kTypeValue); in TEST_F() local
328 &smallest, &largest); in TEST_F()
|
| D | table_cache.cc | 235 const InternalKey* largest = &file_meta.largest; in NewIterator() local
240 largest = largest_compaction_key; in NewIterator()
243 largest); in NewIterator()
|
| D | version_set.cc | 781 Slice largest_key = files[i]->largest.Encode(); in DoGenerateLevelFilesBrief()
1443 file->largest.user_key().ToString(), in GetColumnFamilyMetaData()
2590 f2->largest.DebugString(true).c_str()); in AddFile()
2693 if (icmp.Compare((*next_level_it)->largest, file->largest) > 0) { in SortFileByOverlappingRatio()
3024 : f.file_metadata->largest; in GetOverlappingInputsRangeBinarySearch()
3050 auto& file_key = within_interval ? f.file_metadata->largest in GetOverlappingInputsRangeBinarySearch()
3063 auto& cur_limit = files[end_index - 1].file_metadata->largest; in GetOverlappingInputsRangeBinarySearch()
3364 file->largest, (*lb).second->smallest) < 0) { in EstimateLiveDataSize()
3365 ranges.emplace_hint(lb, &file->largest, file); in EstimateLiveDataSize()
3442 r.append(files[i]->largest.DebugString(hex)); in DebugString()
[all …]
|
| D | flush_job_test.cc | 238 ASSERT_EQ("9999a", file_meta.largest.user_key().ToString()); in TEST_F()
304 ASSERT_EQ("99", file_meta.largest.user_key().ToString()); in TEST_F()
408 ASSERT_EQ("999", file_meta.largest.user_key() in TEST_F()
|
| D | version_builder.cc | 285 if (vstorage->InternalComparator()->Compare(f1->largest, in CheckConsistency()
288 (f1->largest).DebugString(true).c_str(), in CheckConsistency()
292 (f1->largest).DebugString(true) + " vs. " + in CheckConsistency()
|
| /rocksdb-6.9/db/db_impl/ |
| D | db_impl_experimental.cc | 86 return icmp->Compare(f1->largest, f2->largest) < 0; in PromoteL0()
103 if (icmp->Compare(prev_f->largest, f->smallest) >= 0) { in PromoteL0()
129 f->fd.GetFileSize(), f->smallest, f->largest, in PromoteL0()
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2014-04-21-indexing-sst-files-for-better-lookup-performance.markdown | 12 …d. Their key range (as defined by FileMetaData.smallest and FileMetaData.largest) are mostly overl…
16 …s into its range, RocksDB performs a binary search based on FileMetaData.largest to locate a candi…
22 …d FileMetaData.largest tells you file 1 is the candidate. Then key 80 is compared with its FileMet…
24 …o file 2 (this also implies key 230 is larger than file 1's FileMetaData.largest 200). A compariso…
|
| D | 2017-06-26-17-level-based-changes.markdown | 20 …ing which L0 file to compact was the same as every other level: pick the largest file in the level…
30 …largest, and let's say the top two files are created after the compaction started. When the compac…
48 …largest L0 file for compaction. This didn't fit well with L0->L0 compaction, which operates on a s…
|
| D | 2016-04-26-rocksdb-4-5-1-released.markdown | 60 …* When options.db_write_buffer_size triggers, only the column family with the largest column famil…
|