| /rocksdb-6.9/util/ |
| D | crc32c.cc | 643 next += sizeof(uint32_t); in align_to_8()
647 next += sizeof(uint16_t); in align_to_8()
651 next++; in align_to_8()
1128 next += (count2 * 8); in crc32c_3way()
1185 CRCsinglet(crc0, next, -9 * 8); in crc32c_3way()
1188 CRCsinglet(crc0, next, -8 * 8); in crc32c_3way()
1191 CRCsinglet(crc0, next, -7 * 8); in crc32c_3way()
1194 CRCsinglet(crc0, next, -6 * 8); in crc32c_3way()
1197 CRCsinglet(crc0, next, -5 * 8); in crc32c_3way()
1200 CRCsinglet(crc0, next, -4 * 8); in crc32c_3way()
[all …]
|
| D | thread_local.cc | 43 next(nullptr), in ThreadData()
47 ThreadData* next; member
342 head_.next = &head_; in StaticMeta()
354 d->next = &head_; in AddThreadData()
356 head_.prev->next = 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()
442 for (ThreadData* t = head_.next; t != &head_; t = t->next) { in Scrape()
455 for (ThreadData* t = head_.next; t != &head_; t = t->next) { in Fold()
[all …]
|
| /rocksdb-6.9/memtable/ |
| D | inlineskiplist.h | 481 int cmp = (next == nullptr || next == last_bigger)
485 return next;
488 x = next;
522 if (next != last_not_after && KeyIsAfterNode(key_decoded, next)) {
525 x = next;
556 x = next;
574 if (next == nullptr || compare_(next->Key(), key_decoded) >= 0) {
583 x = next;
677 splice.next_ = next;
723 if (next == after || !KeyIsAfterNode(key, next)) {
[all …]
|
| D | skiplist.h | 315 assert(x == head_ || next == nullptr || KeyIsAfterNode(next->key, x));
318 int cmp = (next == nullptr || next == last_bigger)
321 return next;
324 x = next;
327 last_bigger = next;
343 assert(x == head_ || next == nullptr || KeyIsAfterNode(next->key, x));
345 if (next != last_not_after && KeyIsAfterNode(key, next)) {
347 x = next;
378 x = next;
392 if (next == nullptr || compare_(next->key, key) >= 0) {
[all …]
|
| D | hash_linklist_rep.cc | 31 Pointer next; member
35 : next(n), num_entries(count) {} in BucketHeader()
38 return next.load(std::memory_order_relaxed) == this; in IsSkipListBucket()
565 header->next.load(std::memory_order_acquire)); in GetLinkListFirstNode()
664 Node* next = cur->Next(); in Insert() local
667 assert((cur == first) || (next == nullptr) || in Insert()
668 KeyIsAfterNode(next->key, cur)); in Insert()
672 cur = next; in Insert()
809 Node* next = x->Next(); in FindGreaterOrEqualInBucket() local
812 assert((x == head) || (next == nullptr) || KeyIsAfterNode(next->key, x)); in FindGreaterOrEqualInBucket()
[all …]
|
| /rocksdb-6.9/cache/ |
| D | lru_cache.cc | 88 h = next; in Resize()
112 lru_.next = &lru_; in LRUCacheShard()
179 assert(e->next != nullptr); in LRU_Remove()
184 e->next->prev = e->prev; in LRU_Remove()
185 e->prev->next = e->next; in LRU_Remove()
202 e->next = &lru_; in LRU_Insert()
204 e->prev->next = e; in LRU_Insert()
205 e->next->prev = e; in LRU_Insert()
212 e->next = lru_low_pri_->next; in LRU_Insert()
214 e->prev->next = e; in LRU_Insert()
[all …]
|
| /rocksdb-6.9/table/ |
| D | iterator.cc | 19 cleanup_.next = nullptr; in Cleanable()
32 other.cleanup_.next = nullptr; in operator =()
60 c = c->next; in DelegateCleanupsTo()
62 Cleanup* next = c->next; in DelegateCleanupsTo() local
64 c = next; in DelegateCleanupsTo()
67 cleanup_.next = nullptr; in DelegateCleanupsTo()
78 c->next = cleanup_.next; in RegisterCleanup()
79 cleanup_.next = c; in RegisterCleanup()
90 c->next = cleanup_.next; in RegisterCleanup()
91 cleanup_.next = c; in RegisterCleanup()
|
| /rocksdb-6.9/third-party/folly/folly/synchronization/ |
| D | DistributedMutex-inl.h | 794 : next_{next},
1229 next = 0;
1310 std::uintptr_t next,
1341 return next;
1352 std::uintptr_t next,
1362 return next;
1406 return next;
1451 return next;
1481 next =
1486 if (!next) {
[all …]
|
| /rocksdb-6.9/include/rocksdb/ |
| D | cleanable.h | 40 cleanup_.next = nullptr; in Reset()
48 Cleanup* next; member
61 for (Cleanup* c = cleanup_.next; c != nullptr;) { in DoCleanup()
63 Cleanup* next = c->next; in DoCleanup() local
65 c = next; in DoCleanup()
|
| /rocksdb-6.9/java/src/test/java/org/rocksdb/ |
| D | BuiltinComparatorTest.java | 45 rocksIterator.next(); in builtinForwardComparator()
51 rocksIterator.next(); in builtinForwardComparator()
57 rocksIterator.next(); in builtinForwardComparator()
99 rocksIterator.next(); in builtinReverseComparator()
105 rocksIterator.next(); in builtinReverseComparator()
111 rocksIterator.next(); in builtinReverseComparator()
|
| D | SnapshotTest.java | 102 iterator.next(); in iteratorWithSnapshot()
105 iterator.next(); in iteratorWithSnapshot()
115 snapshotIterator.next(); in iteratorWithSnapshot()
147 iterator.next(); in iteratorWithSnapshotOnColumnFamily()
150 iterator.next(); in iteratorWithSnapshotOnColumnFamily()
160 snapshotIterator.next(); in iteratorWithSnapshotOnColumnFamily()
|
| D | TransactionLogIteratorTest.java | 95 transactionLogIterator.next(); in transactionLogIteratorStallAtLastRecord()
99 transactionLogIterator.next(); in transactionLogIteratorStallAtLastRecord()
133 transactionLogIterator.next(); in transactionLogIteratorCheckAfterRestart()
|
| D | TableFilterTest.java | 69 iterator.next(); in readOptions()
79 iterator.next(); in readOptions()
|
| /rocksdb-6.9/db/ |
| D | write_thread.cc | 284 Writer* next = head->link_older; in CreateMissingNewerLinks() local
285 if (next == nullptr || next->link_newer != nullptr) { in CreateMissingNewerLinks()
286 assert(next == nullptr || next->link_newer == head); in CreateMissingNewerLinks()
289 next->link_newer = head; in CreateMissingNewerLinks()
290 head = next; in CreateMissingNewerLinks()
564 Writer* next = w->link_newer; in ExitAsMemTableWriter() local
571 w = next; in ExitAsMemTableWriter()
631 Writer* next = w->link_older; in ExitAsBatchGroupLeader() local
636 w = next; in ExitAsBatchGroupLeader()
728 auto next = last_writer->link_older; in ExitAsBatchGroupLeader() local
[all …]
|
| D | flush_scheduler.cc | 27 node->next, node, std::memory_order_relaxed, std::memory_order_relaxed)) { in ScheduleWork()
44 head_.store(node->next, std::memory_order_relaxed); in TakeNextColumnFamily()
|
| /rocksdb-6.9/java/src/main/java/org/rocksdb/ |
| D | TransactionLogIterator.java | 26 public void next() { in next() method in TransactionLogIterator
27 next(nativeHandle_); in next()
108 private native void next(long handle); in next() method in TransactionLogIterator
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2016-01-29-compaction_pri.markdown | 10 … exceeds its target size, we pick one or more of its files, and merge the file into the next level.
20 …next level, it creates a hole. Over time, incoming compaction will fill data to the hole, but the …
22 …ause a file being picked covers a range whose last compaction time to the next level is the oldest…
28 …ntains 20 keys, we want to keep 150-160 all stay in level 1. Because when next level 0 -> 1 compac…
|
| D | 2015-07-15-rocksdb-2015-h2-roadmap.markdown | 10 …the results with the community. Here's what RocksDB team will be focusing on for the next 6 months:
35 …g in production at Parse [1] and we're seeing surprisingly few issues. Our plans for the next half:
51 … use-cases at Facebook that don't need expensive high-end storage. In the next six months, we plan…
|
| /rocksdb-6.9/table/block_based/ |
| D | block_prefix_index.cc | 67 PrefixRecord* next; member
108 current->next = prev; in Finish()
133 assert(prefixes_per_bucket[i]->next == nullptr); in Finish()
148 current = current->next; in Finish()
|
| /rocksdb-6.9/table/plain/ |
| D | plain_table_index.cc | 65 new_record.next = nullptr; in AddRecord()
136 index_record->next = prev_bucket_head; in BucketizeIndexes()
190 j--, record = record->next) { in FillIndexes()
|
| /rocksdb-6.9/db/compaction/ |
| D | compaction_picker_universal.cc | 225 InputFileInfo prev, curr, next; in IsInputFilesNonOverlapping() local
248 next.f = nullptr; in IsInputFilesNonOverlapping()
252 next.f = c->input(curr.level, curr.index + 1); in IsInputFilesNonOverlapping()
253 next.level = curr.level; in IsInputFilesNonOverlapping()
254 next.index = curr.index + 1; in IsInputFilesNonOverlapping()
257 if (next.f) { in IsInputFilesNonOverlapping()
258 smallest_key_priority_q.push(std::move(next)); in IsInputFilesNonOverlapping()
|
| /rocksdb-6.9/java/jmh/src/main/java/org/rocksdb/jmh/ |
| D | PutBenchmarks.java | 102 public int next() { in next() method in PutBenchmarks.Counter
109 final int i = counter.next(); in put()
|
| D | ComparatorBenchmarks.java | 128 public int next() { in next() method in ComparatorBenchmarks.Counter
136 final int i = counter.next(); in put()
|
| D | GetBenchmarks.java | 117 private int next() { in next() method in GetBenchmarks
136 final int keyIdx = next(); in get()
|
| D | MultiGetBenchmarks.java | 130 private int next(final int inc, final int limit) { in next() method in MultiGetBenchmarks
154 final int fromKeyIdx = next(multiGetSize, keyCount); in multiGet10()
|