| /leveldb-1.20/db/ |
| H A D | dbformat.cc | 19 result->append(key.user_key.data(), key.user_key.size()); in AppendInternalKey()
29 result += EscapeString(user_key.ToString()); in DebugString()
88 Slice user_key = ExtractUserKey(*key); in FindShortSuccessor() local
89 std::string tmp(user_key.data(), user_key.size()); in FindShortSuccessor()
91 if (tmp.size() < user_key.size() && in FindShortSuccessor()
92 user_comparator_->Compare(user_key, tmp) < 0) { in FindShortSuccessor()
121 LookupKey::LookupKey(const Slice& user_key, SequenceNumber s) { in LookupKey() argument
122 size_t usize = user_key.size(); in LookupKey()
133 memcpy(dst, user_key.data(), usize); in LookupKey()
|
| H A D | dbformat.h | 71 Slice user_key; member
77 : user_key(u), sequence(seq), type(t) { } in ParsedInternalKey()
83 return key.user_key.size() + 8; in InternalKeyEncodingLength()
149 InternalKey(const Slice& user_key, SequenceNumber s, ValueType t) { in InternalKey() argument
150 AppendInternalKey(&rep_, ParsedInternalKey(user_key, s, t)); in InternalKey()
159 Slice user_key() const { return ExtractUserKey(rep_); } in user_key() function
184 result->user_key = Slice(internal_key.data(), n - 8); in ParseInternalKey()
193 LookupKey(const Slice& user_key, SequenceNumber sequence);
204 Slice user_key() const { return Slice(kstart_, end_ - kstart_ - 8); } in user_key() function
|
| H A D | version_set.cc | 111 ucmp->Compare(*user_key, f->largest.user_key()) > 0); in AfterFile()
118 ucmp->Compare(*user_key, f->smallest.user_key()) < 0); in BeforeFile()
264 Slice user_key; member
274 if (s->ucmp->Compare(parsed_key.user_key, s->user_key) == 0) { in SaveValue()
298 if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 && in ForEachOverlapping()
299 ucmp->Compare(user_key, f->largest.user_key()) <= 0) { in ForEachOverlapping()
321 if (ucmp->Compare(user_key, f->smallest.user_key()) < 0) { in ForEachOverlapping()
337 Slice user_key = k.user_key(); in Get() local
363 if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 && in Get()
364 ucmp->Compare(user_key, f->largest.user_key()) <= 0) { in Get()
[all …]
|
| H A D | dbformat_test.cc | 11 static std::string IKey(const std::string& user_key, in IKey() argument
15 AppendInternalKey(&encoded, ParsedInternalKey(user_key, seq, vt)); in IKey()
40 ASSERT_EQ(key, decoded.user_key.ToString()); in TestKey()
|
| H A D | write_batch_test.cc | 29 state.append(ikey.user_key.ToString()); in PrintContents()
37 state.append(ikey.user_key.ToString()); in PrintContents()
|
| H A D | db_iter.cc | 184 SaveKey(ikey.user_key, skip); in FindNextUserEntry()
189 user_comparator_->Compare(ikey.user_key, *skip) <= 0) { in FindNextUserEntry()
241 user_comparator_->Compare(ikey.user_key, saved_key_) < 0) { in FindPrevUserEntry()
|
| H A D | version_set.h | 128 void ForEachOverlapping(Slice user_key, Slice internal_key,
355 bool IsBaseLevelForKey(const Slice& user_key);
|
| H A D | db_impl.cc | 518 const Slice min_user_key = meta.smallest.user_key(); in WriteLevel0Table()
519 const Slice max_user_key = meta.largest.user_key(); in WriteLevel0Table()
947 user_comparator()->Compare(ikey.user_key, in DoCompactionWork()
950 current_user_key.assign(ikey.user_key.data(), ikey.user_key.size()); in DoCompactionWork()
960 compact->compaction->IsBaseLevelForKey(ikey.user_key)) { in DoCompactionWork()
977 ikey.user_key.ToString().c_str(), in DoCompactionWork()
979 compact->compaction->IsBaseLevelForKey(ikey.user_key), in DoCompactionWork()
|
| H A D | memtable.cc | 127 key.user_key()) == 0) { in Get()
|
| H A D | dumpfile.cc | 180 AppendEscapedStringTo(&r, key.user_key); in DumpTable()
|
| H A D | db_test.cc | 341 std::string AllEntriesFor(const Slice& user_key) { in AllEntriesFor() argument
343 InternalKey target(user_key, kMaxSequenceNumber, kTypeValue); in AllEntriesFor()
356 if (last_options_.comparator->Compare(ikey.user_key, user_key) != 0) { in AllEntriesFor()
|
| /leveldb-1.20/table/ |
| H A D | table_test.cc | 299 return key.user_key; in key()
|