| /rocksdb-6.9/cache/ |
| D | lru_cache.cc | 113 lru_.prev = &lru_; in LRUCacheShard()
180 assert(e->prev != nullptr); in LRU_Remove()
182 lru_low_pri_ = e->prev; in LRU_Remove()
184 e->next->prev = e->prev; in LRU_Remove()
185 e->prev->next = e->next; in LRU_Remove()
203 e->prev = lru_.prev; in LRU_Insert()
204 e->prev->next = e; in LRU_Insert()
205 e->next->prev = e; in LRU_Insert()
213 e->prev = lru_low_pri_; in LRU_Insert()
214 e->prev->next = e; in LRU_Insert()
[all …]
|
| D | lru_cache.h | 57 LRUHandle* prev; member
|
| /rocksdb-6.9/table/block_based/ |
| D | block_prefix_index.cc | 97 PrefixRecord* prev = prefixes_per_bucket[bucket]; in Finish() local
98 if (prev) { in Finish()
99 assert(current->start_block >= prev->end_block); in Finish()
100 auto distance = current->start_block - prev->end_block; in Finish()
102 prev->end_block = current->end_block; in Finish()
103 prev->num_blocks = prev->end_block - prev->start_block + 1; in Finish()
108 current->next = prev; in Finish()
|
| D | block_based_filter_block.cc | 103 Slice prev; in AddPrefix() local
105 prev = Slice(entries_.data() + prev_prefix_start_, prev_prefix_size_); in AddPrefix()
110 if (prev.size() == 0 || prefix != prev) { in AddPrefix()
|
| /rocksdb-6.9/util/ |
| D | thread_local.cc | 44 prev(nullptr), in ThreadData()
48 ThreadData* prev; member
343 head_.prev = &head_; in StaticMeta()
355 d->prev = head_.prev; in AddThreadData()
356 head_.prev->next = d; in AddThreadData()
357 head_.prev = d; in AddThreadData()
363 d->next->prev = d->prev; in RemoveThreadData()
364 d->prev->next = d->next; in RemoveThreadData()
365 d->next = d->prev = d; in RemoveThreadData()
|
| /rocksdb-6.9/memtable/ |
| D | inlineskiplist.h | 242 Node* FindLessThan(const char* key, Node** prev = nullptr) const;
248 Node* FindLessThan(const char* key, Node** prev, Node* root, int top_level,
344 void InsertAfter(Node* prev, int level) {
347 NoBarrier_SetNext(level, prev->NoBarrier_Next(level));
348 prev->SetNext(level, this);
500 return FindLessThan(key, prev, head_, GetMaxHeight(), 0);
505 InlineSkipList<Comparator>::FindLessThan(const char* key, Node** prev,
527 if (prev != nullptr) {
528 prev[level] = x;
673 Node* prev[kMaxPossibleHeight];
[all …]
|
| D | skiplist.h | 159 Node* FindLessThan(const Key& key, Node** prev = nullptr) const;
335 SkipList<Key, Comparator>::FindLessThan(const Key& key, Node** prev) const {
349 if (prev != nullptr) {
350 prev[level] = x;
|
| D | hash_linklist_rep.cc | 659 Node* prev = nullptr; in Insert() local
671 prev = cur; in Insert()
685 if (prev) { in Insert()
686 prev->SetNext(x); in Insert()
|
| /rocksdb-6.9/db/ |
| D | write_thread.cc | 341 Writer* prev = &write_stall_dummy_; in BeginWriteStall() local
344 prev->link_older = w->link_older; in BeginWriteStall()
347 if (prev->link_older) { in BeginWriteStall()
348 prev->link_older->link_newer = prev; in BeginWriteStall()
350 w = prev->link_older; in BeginWriteStall()
352 prev = w; in BeginWriteStall()
|
| D | range_tombstone_fragmenter.cc | 143 next_snapshot = *std::prev(upper_bound_it); in FragmentTombstones()
201 ParsedInternalKey last_end_key = *std::prev(cur_end_keys.end()); in FragmentTombstones()
266 pos_ = std::prev(tombstones_->end()); in SeekToLast()
267 seq_pos_ = std::prev(tombstones_->seq_end()); in SeekToLast()
275 pos_ = std::prev(tombstones_->end()); in SeekToTopLast()
|
| D | column_family.cc | 593 auto prev = prev_; in ~ColumnFamilyData() local
595 prev->next_ = next; in ~ColumnFamilyData()
596 next->prev_ = prev; in ~ColumnFamilyData()
1487 auto prev = dummy_cfd_->prev_; in CreateColumnFamily() local
1488 new_cfd->prev_ = prev; in CreateColumnFamily()
1489 prev->next_ = new_cfd; in CreateColumnFamily()
|
| D | job_context.h | 66 notif.write_stall_info.condition.prev = old_cond; in PushWriteStallNotification()
|
| /rocksdb-6.9/hdfs/ |
| D | env_hdfs.h | 222 size_t prev = 0; in split() local
225 elems.push_back(s.substr(prev, pos)); in split()
226 prev = pos + 1; in split()
227 pos = s.find(delim, prev); in split()
229 elems.push_back(s.substr(prev, s.size())); in split()
|
| /rocksdb-6.9/db/compaction/ |
| D | compaction_picker_universal.cc | 225 InputFileInfo prev, curr, next; in IsInputFilesNonOverlapping() local
235 prev = curr; in IsInputFilesNonOverlapping()
238 if (comparator->Compare(prev.f->largest.user_key(), in IsInputFilesNonOverlapping()
244 prev.f->largest.user_key()) > 0); in IsInputFilesNonOverlapping()
245 prev = curr; in IsInputFilesNonOverlapping()
|
| D | compaction_iterator.cc | 699 *prev_snapshot = *std::prev(snapshots_iter); in findEarliestVisibleSnapshot()
|
| /rocksdb-6.9/java/src/test/java/org/rocksdb/util/ |
| D | BytewiseComparatorTest.java | 307 iter.prev(); in doRandomIterationTest()
308 result_iter.prev(); in doRandomIterationTest()
469 public void prev() {
|
| /rocksdb-6.9/java/src/main/java/org/rocksdb/ |
| D | RocksIteratorInterface.java | 106 void prev(); in prev() method
|
| D | AbstractRocksIterator.java | 90 public void prev() { in prev() method in AbstractRocksIterator
|
| /rocksdb-6.9/java/samples/src/main/java/ |
| D | RocksDBSample.java | 259 for (iterator.seekToLast(); iterator.isValid(); iterator.prev()) { in main()
282 for (iterator.seekToLast(); iterator.isValid(); iterator.prev()) { in main()
|
| /rocksdb-6.9/include/rocksdb/ |
| D | listener.h | 134 WriteStallCondition prev; member
|
| /rocksdb-6.9/java/src/test/java/org/rocksdb/ |
| D | RocksIteratorTest.java | 79 iterator.prev(); in rocksIterator()
|
| D | WriteBatchWithIndexTest.java | 242 for (it.seekToLast(); it.isValid(); it.prev()) { in iterator()
|
| /rocksdb-6.9/CMakeFiles/rocksdb-shared.dir/util/ |
| D | compaction_job_stats_impl.cc.o.d | 124 /usr/include/c++/v1/__iterator/prev.h \
|
| /rocksdb-6.9/CMakeFiles/rocksdb.dir/util/ |
| D | compaction_job_stats_impl.cc.o.d | 124 /usr/include/c++/v1/__iterator/prev.h \
|
| /rocksdb-6.9/CMakeFiles/rocksdb-shared.dir/db/blob/ |
| D | blob_file_meta.cc.o.d | 97 /usr/include/c++/v1/__iterator/prev.h \
|