Home
last modified time | relevance | path

Searched refs:Insert (Results 1 – 25 of 57) sorted by relevance

123

/rocksdb-6.9/cache/
Dlru_cache_test.cc38 void Insert(const std::string& key, in Insert() function in ROCKSDB_NAMESPACE::LRUCacheTest
97 Insert(ch); in TEST_F()
101 Insert(ch); in TEST_F()
114 Insert("u"); in TEST_F()
116 Insert("v"); in TEST_F()
124 Insert("a", Cache::Priority::LOW); in TEST_F()
125 Insert("b", Cache::Priority::LOW); in TEST_F()
126 Insert("c", Cache::Priority::LOW); in TEST_F()
133 Insert("d", Cache::Priority::LOW); in TEST_F()
147 Insert("a", Cache::Priority::LOW); in TEST_F()
[all …]
Dcache_test.cc283 Insert(100, 101); in TEST_P()
288 Insert(200, 201); in TEST_P()
293 Insert(100, 102); in TEST_P()
304 Insert(1, 1); in TEST_P()
305 Insert(1, 2); in TEST_P()
313 Insert(100, 101); in TEST_P()
314 Insert(200, 201); in TEST_P()
329 Insert(100, 101); in TEST_P()
334 Insert(100, 102); in TEST_P()
359 Insert(100, 101); in TEST_P()
[all …]
Dclock_cache.cc272 Status Insert(const Slice& key, uint32_t hash, void* value, size_t charge,
342 CacheHandle* Insert(const Slice& key, uint32_t hash, void* value,
564 CacheHandle* ClockCacheShard::Insert(const Slice& key, uint32_t hash, in Insert() function in ROCKSDB_NAMESPACE::__anon9da5ff120111::ClockCacheShard
612 Status ClockCacheShard::Insert(const Slice& key, uint32_t hash, void* value, in Insert() function in ROCKSDB_NAMESPACE::__anon9da5ff120111::ClockCacheShard
621 CacheHandle* handle = Insert(key_copy, hash, value, charge, deleter, in Insert()
Dsharded_cache.h29 virtual Status Insert(const Slice& key, uint32_t hash, void* value,
73 virtual Status Insert(const Slice& key, void* value, size_t charge,
Dsharded_cache.cc46 Status ShardedCache::Insert(const Slice& key, void* value, size_t charge, in Insert() function in ROCKSDB_NAMESPACE::ShardedCache
51 ->Insert(key, hash, value, charge, deleter, handle, priority); in Insert()
/rocksdb-6.9/utilities/persistent_cache/
Dhash_table_bench.cc46 virtual bool Insert(const Key& key, const Value& val) = 0;
103 bool status = impl_->Insert(k, tmp); in RunWrite()
142 bool status = impl_->Insert(i, std::string(1000, i % 255)); in Prepop()
149 bool status = impl_->Insert(insert_key_++, std::string(1000, 'x')); in Prepop()
192 bool Insert(const size_t& key, const string& val) override { in Insert() function in ROCKSDB_NAMESPACE::SimpleImpl
228 bool Insert(const size_t& key, const string& val) override { in Insert() function in ROCKSDB_NAMESPACE::GranularLockImpl
230 return impl_.Insert(n); in Insert()
Dpersistent_cache_test.h72 void Insert(const size_t nthreads, const size_t max_keys) { in Insert() function
137 Status status = cache_->Insert(key, data, sizeof(data)); in InsertImpl()
180 Insert(nthreads, max_keys); in RunInsertTest()
191 Insert(nthreads, max_keys); in RunNegativeInsertTest()
202 Insert(nthreads, max_keys); in RunInsertTestWithEviction()
235 void Insert(const Options& options, in Insert() function
Dblock_cache_tier_metadata.cc13 bool BlockCacheTierMetadata::Insert(BlockCacheFile* file) { in Insert() function in ROCKSDB_NAMESPACE::BlockCacheTierMetadata
14 return cache_file_index_.Insert(file); in Insert()
39 BlockInfo* BlockCacheTierMetadata::Insert(const Slice& key, const LBA& lba) { in Insert() function in ROCKSDB_NAMESPACE::BlockCacheTierMetadata
41 if (!block_index_.Insert(binfo.get())) { in Insert()
Dvolatile_tier_impl.cc41 Status VolatileCacheTier::Insert(const Slice& page_key, const char* data, in Insert() function in ROCKSDB_NAMESPACE::VolatileCacheTier
68 bool ok = index_.Insert(cache_data.get()); in Insert()
125 next_tier()->Insert(Slice(edata->key), edata->value.c_str(), in Evict()
Dhash_table_test.cc88 map_.Insert(Node(k, std::string(1000, k % 255))); in TEST_F()
105 map_.Insert(Node(k, std::string(1000, k % 255))); in TEST_F()
140 map_.Insert(new Node(k, std::string(1000, k % 255))); in TEST_F()
Dhash_table.h99 bool Insert(const T& t) { in Insert() function
106 return Insert(&bucket, t); in Insert()
184 bool Insert(Bucket* bucket, const T& t) { in Insert() function
Dblock_cache_tier_metadata.h57 bool Insert(BlockCacheFile* file);
63 BlockInfo* Insert(const Slice& key, const LBA& lba);
Dpersistent_cache_tier.cc136 Status PersistentTieredCache::Insert(const Slice& page_key, const char* data, in Insert() function in ROCKSDB_NAMESPACE::PersistentTieredCache
139 return tiers_.front()->Insert(page_key, data, size); in Insert()
Dpersistent_cache_tier.h257 virtual Status Insert(const Slice& page_key, const char* data,
302 Status Insert(const Slice& page_key, const char* data,
Dblock_cache_tier.cc174 Status BlockCacheTier::Insert(const Slice& key, const char* data, in Insert() function in ROCKSDB_NAMESPACE::BlockCacheTier
251 BlockInfo* info = metadata_.Insert(key, lba); in InsertImpl()
346 status = metadata_.Insert(cache_file_); in NewCacheFile()
/rocksdb-6.9/tools/
Danalyze_txn_stress_test.sh30 cat /tmp/changes.txt | grep Insert | awk '{print $12}' | cut -d= -f1 | cut -d+ -f2 | awk '{sum+=$1}…
66 grep Insert /tmp/changes.txt | cut -d' ' -f 10 | sort | uniq > /tmp/keys.txt
73 …ADDS=`cat /tmp/adds.txt | grep Insert | awk '{print $12}' | cut -d= -f1 | cut -d+ -f2 | awk '{sum+…
/rocksdb-6.9/memtable/
Dhash_linklist_rep.cc173 void Insert(KeyHandle handle) override;
571 void HashLinkListRep::Insert(KeyHandle handle) { in Insert() function in ROCKSDB_NAMESPACE::__anoncfd1c5190111::HashLinkListRep
612 skip_list_bucket_header->skip_list.Insert(x->key); in Insert()
640 skip_list.Insert(bucket_iter.key()); in Insert()
644 skip_list.Insert(x->key); in Insert()
755 list->Insert(itr.key()); in GetIterator()
763 list->Insert(itr.key()); in GetIterator()
Dhash_skiplist_rep.cc31 void Insert(KeyHandle handle) override;
268 void HashSkipListRep::Insert(KeyHandle handle) { in Insert() function in ROCKSDB_NAMESPACE::__anon252bdc020111::HashSkipListRep
273 bucket->Insert(key); in Insert()
311 list->Insert(itr.key()); in GetIterator()
Dinlineskiplist.h97 bool Insert(const char* key);
136 bool Insert(const char* key, Splice* splice, bool allow_partial_splice_fix);
667 bool InlineSkipList<Comparator>::Insert(const char* key) {
668 return Insert<false>(key, seq_splice_, false);
678 return Insert<true>(key, &splice, false);
689 return Insert<false>(key, splice, true);
701 return Insert<true>(key, splice, true);
747 bool InlineSkipList<Comparator>::Insert(const char* key, Splice* splice,
Dskiplistrep.cc37 void Insert(KeyHandle handle) override { in Insert() function in ROCKSDB_NAMESPACE::__anon1cbf76c00111::SkipListRep
38 skip_list_.Insert(static_cast<char*>(handle)); in Insert()
42 return skip_list_.Insert(static_cast<char*>(handle)); in InsertKey()
Dinlineskiplist_test.cc66 void Insert(TestInlineSkipList* list, Key key) { in Insert() function in ROCKSDB_NAMESPACE::InlineSkipTest
69 list->Insert(buf); in Insert()
139 list.Insert(buf); in TEST_F()
306 Insert(&list, key); in TEST_F()
410 list_.Insert(buf); in WriteStep()
/rocksdb-6.9/utilities/simulator_cache/
Dcache_simulator.cc25 sim_cache_->Insert(lookup_key, /*value=*/nullptr, lookup_key.size(), in Admit()
48 sim_cache_->Insert(access.block_key, /*value=*/nullptr, access.block_size, in Access()
103 sim_cache_->Insert(key, /*value=*/nullptr, value_size, /*deleter=*/nullptr, in AccessKVPair()
179 sim_cache_->Insert(row_key, /*value=*/nullptr, in Access()
Dsim_cache.cc171 Status Insert(const Slice& key, void* value, size_t charge, Deleter* deleter, in Insert() function in ROCKSDB_NAMESPACE::__anona55187990111::SimCacheImpl
179 key_only_cache_->Insert(key, nullptr, charge, nullptr, nullptr, priority); in Insert()
188 return cache_->Insert(key, value, charge, deleter, handle, priority); in Insert()
/rocksdb-6.9/include/rocksdb/
Dmemtablerep.h94 virtual void Insert(KeyHandle handle) = 0;
100 Insert(handle); in InsertKey()
112 Insert(handle); in InsertWithHint()
/rocksdb-6.9/table/
Dpersistent_cache_helper.cc24 cache_options.persistent_cache->Insert(key, data, size); in InsertRawPage()
42 cache_options.persistent_cache->Insert(key, contents.data.data(), in InsertUncompressedPage()

123