Searched refs:InternalKey (Results 1 – 11 of 11) sorted by relevance
| /leveldb-1.20/db/ |
| H A D | version_edit.h | 22 InternalKey smallest; // Smallest internal key served by table 23 InternalKey largest; // Largest internal key served by table 55 void SetCompactPointer(int level, const InternalKey& key) { in SetCompactPointer() 64 const InternalKey& smallest, in AddFile() 65 const InternalKey& largest) { in AddFile() 100 std::vector< std::pair<int, InternalKey> > compact_pointers_;
|
| H A D | dbformat.h | 46 class InternalKey; variable 127 int Compare(const InternalKey& a, const InternalKey& b) const; 144 class InternalKey { 148 InternalKey() { } // Leave rep_ as empty to indicate it is invalid in InternalKey() function 149 InternalKey(const Slice& user_key, SequenceNumber s, ValueType t) { in InternalKey() function 172 const InternalKey& a, const InternalKey& b) const { in Compare()
|
| H A D | version_set.h | 94 const InternalKey* begin, // NULL means before all keys 95 const InternalKey* end, // NULL means after all keys 239 const InternalKey* begin, 240 const InternalKey* end); 262 uint64_t ApproximateOffsetOf(Version* v, const InternalKey& key); 282 InternalKey* smallest, 283 InternalKey* largest); 287 InternalKey* smallest, 288 InternalKey* largest);
|
| H A D | version_edit_test.cc | 29 InternalKey("foo", kBig + 500 + i, kTypeValue), in TEST() 30 InternalKey("zoo", kBig + 600 + i, kTypeDeletion)); in TEST() 32 edit.SetCompactPointer(i, InternalKey("x", kBig + 900 + i, kTypeValue)); in TEST()
|
| H A D | version_set_test.cc | 30 f->smallest = InternalKey(smallest, smallest_seq, kTypeValue); in Add() 31 f->largest = InternalKey(largest, largest_seq, kTypeValue); in Add() 36 InternalKey target(key, 100, kTypeValue); in Find()
|
| H A D | db_impl.h | 165 const InternalKey* begin; // NULL means beginning of key range 166 const InternalKey* end; // NULL means end of key range 167 InternalKey tmp_storage; // Used to keep track of compaction progress
|
| H A D | version_set.cc | 533 const InternalKey* begin, in GetOverlappingInputs() 534 const InternalKey* end, in GetOverlappingInputs() 1112 InternalKey key; in WriteSnapshot() 1225 InternalKey* smallest, in GetRange() 1226 InternalKey* largest) { in GetRange() 1331 InternalKey smallest, largest; in PickCompaction() 1347 InternalKey smallest, largest; in SetupOtherInputs() 1353 InternalKey all_start, all_limit; in SetupOtherInputs() 1367 InternalKey new_start, new_limit; in SetupOtherInputs() 1415 const InternalKey* begin, in CompactRange() [all …]
|
| H A D | version_edit.cc | 88 static bool GetInternalKey(Slice* input, InternalKey* dst) { in GetInternalKey() 120 InternalKey key; in DecodeFrom()
|
| H A D | dbformat.cc | 34 std::string InternalKey::DebugString() const { in DebugString()
|
| H A D | db_impl.cc | 64 InternalKey smallest, largest; 588 InternalKey begin_storage, end_storage; in TEST_CompactRange() 596 begin_storage = InternalKey(*begin, kMaxSequenceNumber, kValueTypeForSeek); in TEST_CompactRange() 602 end_storage = InternalKey(*end, 0, static_cast<ValueType>(0)); in TEST_CompactRange() 696 InternalKey manual_end; in BackgroundCompaction() 1461 InternalKey k1(range[i].start, kMaxSequenceNumber, kValueTypeForSeek); in GetApproximateSizes() 1462 InternalKey k2(range[i].limit, kMaxSequenceNumber, kValueTypeForSeek); in GetApproximateSizes()
|
| H A D | db_test.cc | 343 InternalKey target(user_key, kMaxSequenceNumber, kTypeValue); in AllEntriesFor() 2121 InternalKey start(MakeKey(2*fnum), 1, kTypeValue); in BM_LogAndApply() 2122 InternalKey limit(MakeKey(2*fnum+1), 1, kTypeDeletion); in BM_LogAndApply() 2132 InternalKey start(MakeKey(2*fnum), 1, kTypeValue); in BM_LogAndApply() 2133 InternalKey limit(MakeKey(2*fnum+1), 1, kTypeDeletion); in BM_LogAndApply()
|