| /rocksdb-6.9/db/compaction/ |
| D | compaction_picker.h | 77 const InternalKey* begin, const InternalKey* end, 78 InternalKey** compaction_end, bool* manual_conflict, 140 void GetRange(const CompactionInputFiles& inputs, InternalKey* smallest, 141 InternalKey* largest) const; 148 InternalKey* largest) const; 154 InternalKey* smallest, InternalKey* largest) const; 171 InternalKey** next_smallest = nullptr); 175 const InternalKey* smallest, 264 const InternalKey* /*begin*/, in CompactRange() argument 265 const InternalKey* /*end*/, in CompactRange() [all …]
|
| D | compaction_picker.cc | 218 InternalKey current_smallest; in GetRange() 219 InternalKey current_largest; in GetRange() 256 InternalKey smallest, largest; in ExpandInputsToCleanCut() 314 InternalKey smallest, largest; in FilesRangeOverlapWithCompaction() 461 InternalKey smallest, largest; in SetupOtherInputs() 495 InternalKey all_start, all_limit; in SetupOtherInputs() 508 InternalKey new_start, new_limit; in SetupOtherInputs() 554 InternalKey start, limit; in GetGrandparents() 568 const InternalKey* end, InternalKey** compaction_end, bool* manual_conflict, in CompactRange() 722 InternalKey key_storage; in CompactRange() [all …]
|
| D | compaction.h | 33 int sstableKeyCompare(const Comparator* user_cmp, const InternalKey& a, 34 const InternalKey& b); 35 int sstableKeyCompare(const Comparator* user_cmp, const InternalKey* a, 36 const InternalKey& b); 37 int sstableKeyCompare(const Comparator* user_cmp, const InternalKey& a, 38 const InternalKey* b); 47 const InternalKey* smallest = nullptr; 48 const InternalKey* largest = nullptr;
|
| D | compaction_picker_fifo.h | 31 const InternalKey* begin, const InternalKey* end, 32 InternalKey** compaction_end, bool* manual_conflict,
|
| D | compaction.cc | 24 int sstableKeyCompare(const Comparator* user_cmp, const InternalKey& a, in sstableKeyCompare() 25 const InternalKey& b) { in sstableKeyCompare() 42 int sstableKeyCompare(const Comparator* user_cmp, const InternalKey* a, in sstableKeyCompare() 43 const InternalKey& b) { in sstableKeyCompare() 50 int sstableKeyCompare(const Comparator* user_cmp, const InternalKey& a, in sstableKeyCompare() 51 const InternalKey* b) { in sstableKeyCompare()
|
| D | compaction_picker_fifo.cc | 220 const InternalKey* /*begin*/, const InternalKey* /*end*/, in CompactRange() argument 221 InternalKey** compaction_end, bool* /*manual_conflict*/, in CompactRange()
|
| /rocksdb-6.9/db/ |
| D | version_edit_test.cc | 38 InternalKey("foo", kBig + 500 + i, kTypeValue), in TEST_F() 39 InternalKey("zoo", kBig + 600 + i, kTypeDeletion), in TEST_F() 56 edit.AddFile(3, 300, 3, 100, InternalKey("foo", kBig + 500, kTypeValue), in TEST_F() 57 InternalKey("zoo", kBig + 600, kTypeDeletion), kBig + 500, in TEST_F() 61 edit.AddFile(4, 301, 3, 100, InternalKey("foo", kBig + 501, kTypeValue), in TEST_F() 62 InternalKey("zoo", kBig + 601, kTypeDeletion), kBig + 501, in TEST_F() 66 edit.AddFile(5, 302, 0, 100, InternalKey("foo", kBig + 502, kTypeValue), in TEST_F() 67 InternalKey("zoo", kBig + 602, kTypeDeletion), kBig + 502, in TEST_F() 71 InternalKey("zoo", kBig + 603, kTypeBlobIndex), kBig + 503, in TEST_F() 112 InternalKey("zoo", kBig + 600, kTypeDeletion), kBig + 500, in TEST_F() [all …]
|
| D | range_del_aggregator_test.cc | 289 InternalKey smallest("d", 7, kTypeValue); in TEST_F() 290 InternalKey largest("m", 9, kTypeValue); in TEST_F() 326 InternalKey largest("i", 9, kTypeValue); in TEST_F() 437 std::vector<std::pair<InternalKey, InternalKey>> iter_bounds = { in TEST_F() 438 {InternalKey("a", 4, kTypeValue), in TEST_F() 440 {InternalKey("m", 20, kTypeValue), in TEST_F() 442 {InternalKey("x", 5, kTypeValue), InternalKey("zz", 30, kTypeValue)}}; in TEST_F() 477 std::vector<std::pair<InternalKey, InternalKey>> iter_bounds = { in TEST_F() 478 {InternalKey("a", 4, kTypeValue), in TEST_F() 480 {InternalKey("m", 20, kTypeValue), in TEST_F() [all …]
|
| D | dbformat.h | 37 class InternalKey; variable 220 int Compare(const InternalKey& a, const InternalKey& b) const; 228 class InternalKey { 233 InternalKey() {} // Leave rep_ as empty to indicate it is invalid in InternalKey() function 234 InternalKey(const Slice& _user_key, SequenceNumber s, ValueType t) { in InternalKey() function 290 inline int InternalKeyComparator::Compare(const InternalKey& a, in Compare() 617 std::pair<InternalKey, Slice> Serialize() const { in Serialize() 618 auto key = InternalKey(start_key_, seq_, kTypeRangeDeletion); in Serialize() 624 InternalKey SerializeKey() const { in SerializeKey() 625 return InternalKey(start_key_, seq_, kTypeRangeDeletion); in SerializeKey() [all …]
|
| D | table_properties_collector_test.cc | 280 InternalKey ikey(kv.first.first, seqNum++, kv.first.second); in TestCustomizedTablePropertiesCollector() 379 InternalKey keys[] = { in TestInternalKeyPropertiesCollector() 380 InternalKey("A ", 0, ValueType::kTypeValue), in TestInternalKeyPropertiesCollector() 381 InternalKey("B ", 1, ValueType::kTypeValue), in TestInternalKeyPropertiesCollector() 382 InternalKey("C ", 2, ValueType::kTypeValue), in TestInternalKeyPropertiesCollector() 383 InternalKey("W ", 3, ValueType::kTypeDeletion), in TestInternalKeyPropertiesCollector() 384 InternalKey("X ", 4, ValueType::kTypeDeletion), in TestInternalKeyPropertiesCollector() 385 InternalKey("Y ", 5, ValueType::kTypeDeletion), in TestInternalKeyPropertiesCollector() 386 InternalKey("Z ", 6, ValueType::kTypeDeletion), in TestInternalKeyPropertiesCollector() 388 InternalKey("b ", 8, ValueType::kTypeMerge), in TestInternalKeyPropertiesCollector() [all …]
|
| D | range_del_aggregator.h | 36 const InternalKeyComparator* icmp, const InternalKey* smallest, 37 const InternalKey* largest); 89 const InternalKey* smallest_ikey_; 90 const InternalKey* largest_ikey_; 281 const InternalKey* smallest = nullptr, 282 const InternalKey* largest = nullptr) = 0; 365 const InternalKey* smallest = nullptr, 366 const InternalKey* largest = nullptr) override; 398 const InternalKey* smallest = nullptr, 399 const InternalKey* largest = nullptr) override;
|
| D | version_edit.h | 98 InternalKey smallest; // Smallest internal key served by table 99 InternalKey largest; // Largest internal key served by table 150 const InternalKey& smallest_key, const InternalKey& largest_key, in FileMetaData() 175 void UpdateBoundariesForRange(const InternalKey& start, in UpdateBoundariesForRange() 176 const InternalKey& end, SequenceNumber seqno, in UpdateBoundariesForRange() 326 uint64_t file_size, const InternalKey& smallest, in AddFile() 327 const InternalKey& largest, const SequenceNumber& smallest_seqno, in AddFile()
|
| D | range_del_aggregator.cc | 27 const InternalKeyComparator* icmp, const InternalKey* smallest, in TruncatedRangeDelIterator() 28 const InternalKey* largest) in TruncatedRangeDelIterator() 316 const InternalKey* smallest, const InternalKey* largest) { in AddTombstones() 338 const InternalKey* smallest, const InternalKey* largest) { in AddTombstones() 459 mutable InternalKey cur_start_key_;
|
| D | version_set.h | 213 int level, const InternalKey* begin, // nullptr means before all keys 214 const InternalKey* end, // nullptr means after all keys 221 InternalKey** next_smallest = nullptr) // if non-null, returns the 224 int level, const InternalKey* begin, // nullptr means before all keys 225 const InternalKey* end, // nullptr means after all keys 233 const InternalKey* begin, // nullptr means before all keys 234 const InternalKey* end, // nullptr means after all keys 239 InternalKey** next_smallest = nullptr) // if non-null, returns the
|
| D | version_set_test.cc | 41 InternalKey(smallest, smallest_seq, kTypeValue), in Add() 42 InternalKey(largest, largest_seq, kTypeValue), smallest_seq, in Add() 109 InternalKey GetInternalKey(const char* ukey, in GetInternalKey() 111 return InternalKey(ukey, smallest_seq, kTypeValue); in GetInternalKey() 147 const InternalKey& largest, uint64_t file_size = 0) { in Add() 159 std::string GetOverlappingFiles(int level, const InternalKey& begin, in GetOverlappingFiles() 160 const InternalKey& end) { in GetOverlappingFiles() 435 InternalKey smallest_key = InternalKey(smallest, smallest_seq, kTypeValue); in Add() 436 InternalKey largest_key = InternalKey(largest, largest_seq, kTypeValue); in Add() 458 InternalKey target(key, 100, kTypeValue); in Find() [all …]
|
| D | column_family.h | 39 class InternalKey; variable 417 const InternalKey* begin, const InternalKey* end, 418 InternalKey** compaction_end, bool* manual_conflict,
|
| D | external_sst_file_ingestion_job.h | 30 InternalKey smallest_internal_key; 32 InternalKey largest_internal_key;
|
| D | table_cache.h | 75 bool skip_filters, int level, const InternalKey* smallest_compaction_key, 76 const InternalKey* largest_compaction_key);
|
| D | flush_job_test.cc | 169 InternalKey internal_key(key, SequenceNumber(i), kTypeValue); in TEST_F() 176 InternalKey internal_key("9995", SequenceNumber(10000), kTypeRangeDeletion); in TEST_F() 205 InternalKey internal_key(key, seq, kTypeBlobIndex); in TEST_F() 460 InternalKey internal_key(key, seqno, kTypeValue); in TEST_F()
|
| D | external_sst_file_ingestion_job.cc | 466 InternalKey("", 0, ValueType::kTypeValue); in GetIngestedFileInfo() 468 InternalKey("", 0, ValueType::kTypeValue); in GetIngestedFileInfo() 503 InternalKey start_key = tombstone.SerializeKey(); in GetIngestedFileInfo() 509 InternalKey end_key = tombstone.SerializeEndKey(); in GetIngestedFileInfo()
|
| D | table_cache.cc | 181 const InternalKey* smallest_compaction_key, in NewIterator() 182 const InternalKey* largest_compaction_key) { in NewIterator() 234 const InternalKey* smallest = &file_meta.smallest; in NewIterator() 235 const InternalKey* largest = &file_meta.largest; in NewIterator()
|
| /rocksdb-6.9/table/block_based/ |
| D | data_block_hash_index_test.cc | 276 InternalKey ikey(ukey, 0, kTypeValue); in TEST() 298 InternalKey ikey(ukey, 0, kTypeValue); in TEST() 319 InternalKey ikey(ukey, 0, kTypeValue); in TEST() 382 InternalKey ikey(ukey, 10, kTypeValue); in TEST() 463 InternalKey ikey(ukey, 0, kTypeValue); in TEST() 483 InternalKey ikey(ukey, 0, kTypeValue); in TEST() 537 void TestBoundary(InternalKey& ik1, std::string& v1, InternalKey& ik2, in TestBoundary() 626 InternalKey ik2(uk2, 10, kTypeValue); in TEST() 651 InternalKey ik2(uk2, 10, kTypeValue); in TEST() 676 InternalKey ik2(uk2, 10, kTypeValue); in TEST() [all …]
|
| D | partitioned_filter_block_test.cc | 169 auto ikey = InternalKey(key, 0, ValueType::kTypeValue); in VerifyReader() 177 auto ikey = InternalKey(keys[0], 0, ValueType::kTypeValue); in VerifyReader() 185 auto ikey = InternalKey(key, 0, ValueType::kTypeValue); in VerifyReader() 263 std::string(*InternalKey(user_key, 0, ValueType::kTypeValue).rep()); in CutABlock() 272 std::string(*InternalKey(user_key, 0, ValueType::kTypeValue).rep()); in CutABlock() 274 *InternalKey(next_user_key, 0, ValueType::kTypeValue).rep()); in CutABlock() 341 auto ikey = InternalKey(key, 0, ValueType::kTypeValue); in TEST_P() 351 auto ikey = InternalKey(key, 0, ValueType::kTypeValue); in TEST_P() 389 auto ikey = InternalKey(prefix, 0, ValueType::kTypeValue); in TEST_P()
|
| /rocksdb-6.9/table/ |
| D | table_test.cc | 1500 std::pair<InternalKey, Slice> p = t.Serialize(); in TEST_P() 1607 std::unique_ptr<InternalKey> i_begin, i_end; in PrefetchRange() 1813 InternalKey key("a", 1, kTypeValue); in TEST_P() 1851 InternalKey key("abcdefghijk", 1, kTypeValue); in TEST_P() 2527 InternalKey internal_key(user_key, 0, kTypeValue); in TEST_P() 4077 InternalKey ik(key, 0, kTypeValue); in TEST_P() 4178 InternalKey ik(k, 10, kValueTypeForSeek); in TEST_P() 4216 InternalKey ik(k, 4, kValueTypeForSeek); in TEST_P() 4260 InternalKey ik(key, 0, kTypeValue); in TEST_P() 4354 InternalKey ik(key, 0, kTypeValue); in TEST_P() [all …]
|
| D | merger_test.cc | 27 InternalKey ik(test::RandomHumanReadableString(&rnd_, string_len), 0, in GenerateStrings() 47 InternalKey ik(test::RandomHumanReadableString(&rnd_, 5), 0, in SeekToRandom()
|