Lines Matching refs:memlist_
32 memlist_.push_front(m); in AddMemTable()
53 memlist_ = old->memlist_; in MemTableListVersion()
54 for (auto& m : memlist_) { in MemTableListVersion()
83 for (const auto& m : memlist_) { in Unref()
94 int size = static_cast<int>(current_->memlist_.size()); in NumNotFlushed()
112 return GetFromList(&memlist_, key, value, timestamp, s, merge_context, in Get()
120 for (auto memtable : memlist_) { in MultiGet()
131 for (MemTable* memtable : memlist_) { in GetMergeOperands()
195 for (auto& m : memlist_) { in AddRangeTombstoneIterators()
206 for (auto& m : memlist_) { in AddIterators()
213 for (auto& m : memlist_) { in AddIterators()
221 for (auto& m : memlist_) { in GetTotalNumEntries()
230 for (auto& m : memlist_) { in ApproximateStats()
240 for (auto& m : memlist_) { in GetTotalNumDeletes()
250 } else if (!memlist_.empty()) { in GetEarliestSequenceNumber()
251 return memlist_.back()->GetEarliestSequenceNumber(); in GetEarliestSequenceNumber()
269 memlist_.remove(m); in Remove()
286 for (auto& memtable : memlist_) { in ApproximateMemoryUsageExcludingLast()
306 return memlist_.size() + memlist_history_.size() > in MemtableLimitExceeded()
340 const auto& memlist = current_->memlist_; in PickMemtablesToFlush()
423 auto& memlist = current_->memlist_; in TryInstallMemtableFlushResults()
504 MemTable* m = current_->memlist_.back(); in TryInstallMemtableFlushResults()
515 for (auto it = current_->memlist_.rbegin(); batch_count-- > 0; ++it) { in TryInstallMemtableFlushResults()
538 assert(static_cast<int>(current_->memlist_.size()) >= num_flush_not_started_); in Add()
565 for (auto& memtable : current_->memlist_) { in ApproximateUnflushedMemTablesMemoryUsage()
595 if (!current_->memlist_.empty()) { in ApproximateOldestKeyTime()
596 return current_->memlist_.back()->ApproximateOldestKeyTime(); in ApproximateOldestKeyTime()
617 for (auto& m : current_->memlist_) { in PrecomputeMinLogContainingPrepSection()
752 auto& memlist = current_->memlist_; in RemoveOldMemTables()