Home
last modified time | relevance | path

Searched refs:node (Results 1 – 11 of 11) sorted by relevance

/rocksdb-6.9/third-party/folly/folly/synchronization/
DParkingLot.h77 node->prev_ = tail_; in push_back()
78 tail_->next_ = node; in push_back()
79 tail_ = node; in push_back()
81 tail_ = node; in push_back()
82 head_ = node; in push_back()
88 if (head_ == node && tail_ == node) { in erase()
95 assert(node->next_); in erase()
106 node->next_->prev_ = node->prev_; in erase()
107 node->prev_->next_ = node->next_; in erase()
301 if (node->key_ == key && node->lotid_ == lotid_) { in unpark()
[all …]
/rocksdb-6.9/db/
Dflush_scheduler.cc25 Node* node = new Node{cfd, head_.load(std::memory_order_relaxed)}; in ScheduleWork() local
27 node->next, node, std::memory_order_relaxed, std::memory_order_relaxed)) { in ScheduleWork()
43 Node* node = head_.load(std::memory_order_relaxed); in TakeNextColumnFamily() local
44 head_.store(node->next, std::memory_order_relaxed); in TakeNextColumnFamily()
45 ColumnFamilyData* cfd = node->column_family; in TakeNextColumnFamily()
46 delete node; in TakeNextColumnFamily()
/rocksdb-6.9/tools/rdb/
DREADME.md12 * node (tested onv0.10.33, no guarantees on anything else!)
13 * node-gyp
14 * python2 (for node-gyp; tested with 2.7.8)
19 the arguments `--python /path/to/python2` to the `node-gyp` commands.
25 2. Run `node-gyp configure` to generate the build.
27 3. Run `node-gyp build` to compile RDB.
35 just a shell script that runs the node shell and loads the constructor for the
Drdb3 node -e "RDB = require('./build/Release/rdb').DBWrapper; console.log('Loaded rocksdb in variable RD…
Ddb_wrapper.h19 class DBWrapper : public node::ObjectWrap {
/rocksdb-6.9/utilities/persistent_cache/
Dhash_table_test.cc41 uint64_t operator()(const Node& node) { in operator ()()
42 return std::hash<uint64_t>()(node.key_); in operator ()()
73 uint64_t operator()(const Node* node) { in operator ()()
74 return std::hash<uint64_t>()(node->key_); in operator ()()
Dblock_cache_tier_metadata.h106 size_t operator()(BlockInfo* node) const { in operator()
107 return std::hash<std::string>()(node->key_); in operator()
Dhash_table_bench.cc258 uint64_t operator()(const Node& node) { in operator ()()
259 return std::hash<uint64_t>()(node.key_); in operator ()()
/rocksdb-6.9/docs/_posts/
D2017-05-12-partitioned-index-filter.markdown28 …a DB of size 86G on HDD and emulate the small memory that is present to a node with 100TB of data …
32 …small memory that would be available in presence of other DBs on the same node by by using direct …
D2014-04-02-the-1st-rocksdb-local-meetup-held-on-march-27-2014.markdown39 …ations need a resilient and distributed storage solution, not just single-node storage. We are con…
/rocksdb-6.9/db/db_impl/
Ddb_impl.cc1842 auto node = iter_deref_func(cf_iter); in MultiCFSnapshot() local
1843 node->super_version = GetAndRefSuperVersion(node->cfd); in MultiCFSnapshot()
1886 auto node = iter_deref_func(cf_iter); in MultiCFSnapshot() local
1887 SuperVersion* super_version = node->super_version; in MultiCFSnapshot()
1888 ColumnFamilyData* cfd = node->cfd; in MultiCFSnapshot()
1892 node->super_version = nullptr; in MultiCFSnapshot()
1911 auto node = iter_deref_func(cf_iter); in MultiCFSnapshot() local
1913 node->super_version = GetAndRefSuperVersion(node->cfd); in MultiCFSnapshot()
1915 node->super_version = node->cfd->GetSuperVersion()->Ref(); in MultiCFSnapshot()
1931 node->super_version->mem->GetEarliestSequenceNumber(); in MultiCFSnapshot()