Searched refs:list_ (Results 1 – 11 of 11) sorted by relevance
| /rocksdb-6.9/db/ |
| D | snapshot_impl.h | 49 list_.prev_ = &list_; in SnapshotList()
50 list_.next_ = &list_; in SnapshotList()
53 list_.list_ = nullptr; in SnapshotList()
54 list_.unix_time_ = 0; in SnapshotList()
62 bool empty() const { return list_.next_ == &list_; } in empty()
71 s->list_ = this; in New()
72 s->next_ = &list_; in New()
73 s->prev_ = list_.prev_; in New()
82 assert(s->list_ == this); in Delete()
113 while (s->next_ != &list_) {
[all …]
|
| /rocksdb-6.9/utilities/persistent_cache/ |
| D | hash_table.h | 164 buckets_[i].list_.clear(); in Clear()
171 std::list<T> list_; member
186 auto it = Find(&bucket->list_, t); in Insert()
187 if (it != bucket->list_.end()) { in Insert()
192 bucket->list_.push_back(t); in Insert()
197 auto it = Find(&bucket->list_, t); in Find()
198 if (it != bucket->list_.end()) { in Find()
208 auto it = Find(&bucket->list_, t); in Erase()
209 if (it != bucket->list_.end()) { in Erase()
214 bucket->list_.erase(it); in Erase()
[all …]
|
| D | hash_table_evictable.h | 117 for (auto* t : bucket.list_) { in Clear()
121 bucket.list_.clear(); in Clear()
|
| /rocksdb-6.9/memtable/ |
| D | hash_skiplist_rep.cc | 85 : list_(list), iter_(list), own_list_(own_list), arena_(arena) {} in Iterator()
90 assert(list_ != nullptr); in ~Iterator()
91 delete list_; in ~Iterator()
96 bool Valid() const override { return list_ != nullptr && iter_.Valid(); } in Valid()
121 if (list_ != nullptr) { in Seek()
139 if (list_ != nullptr) { in SeekToFirst()
147 if (list_ != nullptr) { in SeekToLast()
155 assert(list_ != nullptr); in Reset()
156 delete list_; in Reset()
158 list_ = list; in Reset()
[all …]
|
| D | skiplist.h | 110 const SkipList* list_;
218 list_ = list;
244 node_ = list_->FindLessThan(node_->key);
245 if (node_ == list_->head_) {
252 node_ = list_->FindGreaterOrEqual(target);
262 while (Valid() && list_->LessThan(target, key())) {
269 node_ = list_->head_->Next(0);
274 node_ = list_->FindLast();
275 if (node_ == list_->head_) {
|
| D | inlineskiplist_test.cc | 398 InlineSkipList<TestComparator> list_; member in ROCKSDB_NAMESPACE::ConcurrentTest
401 ConcurrentTest() : list_(TestComparator(), &arena_) {} in ConcurrentTest()
408 char* buf = list_.AllocateKey(sizeof(Key)); in WriteStep()
410 list_.Insert(buf); in WriteStep()
418 char* buf = list_.AllocateKey(sizeof(Key)); in ConcurrentWriteStep()
422 list_.InsertWithHintConcurrently(buf, &hint); in ConcurrentWriteStep()
425 list_.InsertConcurrently(buf); in ConcurrentWriteStep()
439 InlineSkipList<TestComparator>::Iterator iter(&list_); in ReadStep()
|
| D | inlineskiplist.h | 189 const InlineSkipList* list_;
366 list_ = list;
392 node_ = list_->FindLessThan(node_->Key());
393 if (node_ == list_->head_) {
400 node_ = list_->FindGreaterOrEqual(target);
410 while (Valid() && list_->LessThan(target, key())) {
417 node_ = list_->head_->Next(0);
422 node_ = list_->FindLast();
423 if (node_ == list_->head_) {
|
| D | skiplist_test.cc | 223 SkipList<Key, TestComparator> list_; member in ROCKSDB_NAMESPACE::ConcurrentTest
226 ConcurrentTest() : list_(TestComparator(), &arena_) {} in ConcurrentTest()
233 list_.Insert(new_key); in WriteStep()
245 SkipList<Key, TestComparator>::Iterator iter(&list_); in ReadStep()
|
| /rocksdb-6.9/cache/ |
| D | clock_cache.cc | 358 std::deque<CacheHandle> list_; member in ROCKSDB_NAMESPACE::__anon9da5ff120111::ClockCacheShard
387 for (auto& handle : list_) { in ~ClockCacheShard()
411 for (auto& handle : list_) { in ApplyToAllCacheEntries()
532 assert(new_head < list_.size()); in EvictFromCache()
533 if (TryEvict(&list_[new_head], context)) { in EvictFromCache()
536 new_head = (new_head + 1 >= list_.size()) ? 0 : new_head + 1; in EvictFromCache()
587 list_.emplace_back(); in Insert()
588 handle = &list_.back(); in Insert()
695 for (auto& handle : list_) { in EraseUnRefEntries()
|
| D | lru_cache.cc | 21 LRUHandleTable::LRUHandleTable() : list_(nullptr), length_(0), elems_(0) { in LRUHandleTable()
31 delete[] list_; in ~LRUHandleTable()
65 LRUHandle** ptr = &list_[hash & (length_ - 1)]; in FindPointer()
81 LRUHandle* h = list_[i]; in Resize()
93 delete[] list_; in Resize()
94 list_ = new_list; in Resize()
|
| D | lru_cache.h | 168 LRUHandle* h = list_[i]; in ApplyToAllCacheEntries()
188 LRUHandle** list_; variable
|