Home
last modified time | relevance | path

Searched refs:InternalKey (Results 1 – 11 of 11) sorted by relevance

/external/chromium_org/third_party/leveldatabase/src/db/
Dversion_edit.h22 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_;
Ddbformat.h46 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()
Dversion_set.h94 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);
280 InternalKey* smallest,
281 InternalKey* largest);
285 InternalKey* smallest,
286 InternalKey* largest);
Dversion_edit_test.cc29 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()
Dversion_set.cc137 InternalKey small(*smallest_user_key, kMaxSequenceNumber,kValueTypeForSeek); in SomeFileOverlapsRange()
500 InternalKey start(smallest_user_key, kMaxSequenceNumber, kValueTypeForSeek); in PickLevelForMemTableOutput()
501 InternalKey limit(largest_user_key, 0, static_cast<ValueType>(0)); in PickLevelForMemTableOutput()
524 const InternalKey* begin, in GetOverlappingInputs()
525 const InternalKey* end, in GetOverlappingInputs()
736 const InternalKey& prev_end = v->files_[level][i-1]->largest; in SaveTo()
737 const InternalKey& this_begin = v->files_[level][i]->smallest; in SaveTo()
1064 InternalKey key; in WriteSnapshot()
1105 uint64_t VersionSet::ApproximateOffsetOf(Version* v, const InternalKey& ikey) { in ApproximateOffsetOf()
1177 InternalKey* smallest, in GetRange()
[all …]
Ddb_impl.h165 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
Dversion_set_test.cc30 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()
Dversion_edit.cc88 static bool GetInternalKey(Slice* input, InternalKey* dst) { in GetInternalKey()
120 InternalKey key; in DecodeFrom()
Ddb_impl.cc64 InternalKey smallest, largest;
557 InternalKey begin_storage, end_storage; in TEST_CompactRange()
565 begin_storage = InternalKey(*begin, kMaxSequenceNumber, kValueTypeForSeek); in TEST_CompactRange()
571 end_storage = InternalKey(*end, 0, static_cast<ValueType>(0)); in TEST_CompactRange()
665 InternalKey manual_end; in BackgroundCompaction()
1416 InternalKey k1(range[i].start, kMaxSequenceNumber, kValueTypeForSeek); in GetApproximateSizes()
1417 InternalKey k2(range[i].limit, kMaxSequenceNumber, kValueTypeForSeek); in GetApproximateSizes()
Ddbformat.cc34 std::string InternalKey::DebugString() const { in DebugString()
Ddb_test.cc338 InternalKey target(user_key, kMaxSequenceNumber, kTypeValue); in AllEntriesFor()
2091 InternalKey start(MakeKey(2*fnum), 1, kTypeValue); in BM_LogAndApply()
2092 InternalKey limit(MakeKey(2*fnum+1), 1, kTypeDeletion); in BM_LogAndApply()
2102 InternalKey start(MakeKey(2*fnum), 1, kTypeValue); in BM_LogAndApply()
2103 InternalKey limit(MakeKey(2*fnum+1), 1, kTypeDeletion); in BM_LogAndApply()