Home
last modified time | relevance | path

Searched refs:num_keys (Results 1 – 25 of 55) sorted by relevance

123

/rocksdb-6.9/util/
Ddynamic_bloom_test.cc190 const uint32_t num_keys = m * 8 * 1024 * 1024; in TEST_F() local
193 DynamicBloom std_bloom(&arena, num_keys * 10, num_probes); in TEST_F()
196 for (uint64_t i = 1; i <= num_keys; ++i) { in TEST_F()
202 static_cast<double>(elapsed) / num_keys); in TEST_F()
206 for (uint64_t i = 1; i <= num_keys; ++i) { in TEST_F()
211 ASSERT_EQ(count, num_keys); in TEST_F()
232 const uint32_t num_keys = m * 8 * 1024 * 1024; in TEST_F() local
235 DynamicBloom std_bloom(&arena, num_keys * 10, num_probes); in TEST_F()
243 for (uint64_t i = 1 + t; i <= num_keys; i += num_threads) { in TEST_F()
291 for (uint64_t i = num_keys + 1 + t; i <= 2 * num_keys; i += num_threads) { in TEST_F()
[all …]
Ddynamic_bloom.h68 void MayContain(int num_keys, Slice** keys, bool* may_match) const;
123 inline void DynamicBloom::MayContain(int num_keys, Slice** keys, in MayContain() argument
127 for (int i = 0; i < num_keys; ++i) { in MayContain()
134 for (int i = 0; i < num_keys; i++) { in MayContain()
/rocksdb-6.9/tools/
Dbenchmark.sh58 num_keys=${NUM_KEYS:-8000000000}
67 --num=$num_keys \
178 echo "Bulk loading $num_keys random keys"
316 echo "Loading $num_keys keys sequentially"
337 echo "Do $num_keys random $operation"
353 echo "Loading $num_keys unique keys randomly"
367 echo "Reading $num_keys random keys"
382 echo "Reading $num_keys random keys while $operation"
439 --num=$num_keys \
510 num_keys=1000; # debug
[all …]
Dbenchmark_leveldb.sh43 num_keys=${NUM_KEYS:-$((1 * G))}
51 --num=$num_keys \
84 echo "Loading $num_keys keys sequentially"
99 echo "Do $num_keys random $operation"
114 echo "Reading $num_keys random keys"
129 echo "Reading $num_keys random keys while $operation"
172 num_keys=1000; # debug
173 echo "Setting num_keys to $num_keys"
Drun_leveldb.sh52 num_keys=${NKEYS:-$((1 * G))}
79 NUM_KEYS=$num_keys \
102 env $ARGS BLOCK_SIZE=$((1 * M)) VALUE_SIZE=$((32 * K)) NUM_KEYS=$(( num_keys / 64 )) \
Drun_flash_bench.sh69 num_keys=${NKEYS:-$((1 * G))}
110 NUM_KEYS=$num_keys \
140 env $ARGS BLOCK_SIZE=$((1 * M)) VALUE_SIZE=$((32 * K)) NUM_KEYS=$(( num_keys / 64 )) \
147 env $ARGS BLOCK_SIZE=$((1 * M)) VALUE_SIZE=$((32 * K)) NUM_KEYS=$(( num_keys / 64 )) \
/rocksdb-6.9/db/
Dc.cc285 int num_keys,
943 std::vector<Slice> keys(num_keys); in rocksdb_multi_get()
974 std::vector<Slice> keys(num_keys); in rocksdb_multi_get_cf()
1381 for (int i = 0; i < num_keys; i++) { in rocksdb_writebatch_putv()
1400 for (int i = 0; i < num_keys; i++) { in rocksdb_writebatch_putv_cf()
1433 for (int i = 0; i < num_keys; i++) { in rocksdb_writebatch_mergev()
1452 for (int i = 0; i < num_keys; i++) { in rocksdb_writebatch_mergev_cf()
1481 for (int i = 0; i < num_keys; i++) { in rocksdb_writebatch_deletev()
1493 for (int i = 0; i < num_keys; i++) { in rocksdb_writebatch_deletev_cf()
1522 for (int i = 0; i < num_keys; i++) { in rocksdb_writebatch_delete_rangev()
[all …]
Ddb_basic_test.cc1347 num_keys++; in TEST_F()
1355 num_keys = 0; in TEST_F()
1361 num_keys++; in TEST_F()
1369 num_keys = 0; in TEST_F()
1375 num_keys++; in TEST_F()
1383 num_keys = 0; in TEST_F()
1426 num_keys++; in TEST_F()
1434 num_keys = 0; in TEST_F()
1440 num_keys++; in TEST_F()
1448 num_keys = 0; in TEST_F()
[all …]
Ddb_universal_compaction_test.cc691 int num_keys = 100000; in TEST_P() local
698 for (int i = num_keys; i < num_keys * 2; i++) { in TEST_P()
736 int num_keys = 150000; in TEST_P() local
802 int num_keys = 30000; in TEST_P() local
812 for (int i = num_keys; i < num_keys * 2; i++) { in TEST_P()
818 for (int i = num_keys; i < num_keys * 2; i++) { in TEST_P()
872 int num_keys = 1000; in TEST_P() local
879 num_keys -= 100; in TEST_P()
916 num_keys = 1000; in TEST_P()
923 num_keys -= 100; in TEST_P()
[all …]
Dmanual_compaction_test.cc167 int num_keys = 0; in TEST_F() local
169 num_keys++; in TEST_F()
172 ASSERT_EQ(kNumKeys, num_keys) << "Bad number of keys"; in TEST_F()
/rocksdb-6.9/table/
Dmultiget_context.h95 size_t begin, size_t num_keys, SequenceNumber snapshot) in MultiGetContext() argument
96 : num_keys_(num_keys), in MultiGetContext()
99 if (num_keys > MAX_LOOKUP_KEYS_ON_STACK) { in MultiGetContext()
100 lookup_key_heap_buf.reset(new char[sizeof(LookupKey) * num_keys]); in MultiGetContext()
253 Range(MultiGetContext* ctx, size_t num_keys) in Range() argument
254 : ctx_(ctx), start_(0), end_(num_keys), skip_mask_(0) {} in Range()
/rocksdb-6.9/utilities/transactions/
Dtransaction_base.cc310 size_t num_keys = keys.size(); in MultiGet() local
311 values->resize(num_keys); in MultiGet()
313 std::vector<Status> stat_list(num_keys); in MultiGet()
314 for (size_t i = 0; i < num_keys; ++i) { in MultiGet()
328 num_keys, keys, values, statuses, in MultiGet()
337 size_t num_keys = keys.size(); in MultiGetForUpdate() local
338 values->resize(num_keys); in MultiGetForUpdate()
341 for (size_t i = 0; i < num_keys; ++i) { in MultiGetForUpdate()
346 return std::vector<Status>(num_keys, s); in MultiGetForUpdate()
351 std::vector<Status> stat_list(num_keys); in MultiGetForUpdate()
[all …]
/rocksdb-6.9/include/rocksdb/
Dc.h312 rocksdb_t* db, const rocksdb_readoptions_t* options, size_t num_keys,
319 size_t num_keys, const char* const* keys_list,
470 rocksdb_writebatch_t* b, int num_keys, const char* const* keys_list,
487 rocksdb_writebatch_t* b, int num_keys, const char* const* keys_list,
502 rocksdb_writebatch_t* b, int num_keys, const char* const* keys_list,
520 int num_keys, const char* const* start_keys_list,
558 rocksdb_writebatch_wi_t* b, int num_keys, const char* const* keys_list,
575 rocksdb_writebatch_wi_t* b, int num_keys, const char* const* keys_list,
590 rocksdb_writebatch_wi_t* b, int num_keys, const char* const* keys_list,
612 int num_keys, const char* const* start_keys_list,
[all …]
Dfilter_policy.h79 virtual void MayMatch(int num_keys, Slice** keys, bool* may_match) { in MayMatch() argument
80 for (int i = 0; i < num_keys; ++i) { in MayMatch()
Ddb.h523 const size_t num_keys, const Slice* keys,
531 for (size_t i = 0; i < num_keys; ++i) {
545 const size_t num_keys, const Slice* keys,
554 for (size_t i = 0; i < num_keys; ++i) {
586 virtual void MultiGet(const ReadOptions& options, const size_t num_keys,
595 for (size_t i = 0; i < num_keys; ++i) {
606 virtual void MultiGet(const ReadOptions& options, const size_t num_keys,
616 for (size_t i = 0; i < num_keys; ++i) {
/rocksdb-6.9/table/block_based/
Dpartitioned_filter_block_test.cc87 int num_keys = sizeof(keys) / sizeof(*keys); in MaxIndexSize() local
89 for (int i = 1; i < num_keys; i++) { in MaxIndexSize()
92 uint64_t max_index_size = num_keys * (max_key_size + 8 /*handle*/); in MaxIndexSize()
97 int num_keys = sizeof(keys) / sizeof(*keys); in MaxFilterSize() local
99 return num_keys * bits_per_key_ + (CACHE_LINE_SIZE * 8 + /*metadata*/ 5); in MaxFilterSize()
407 int num_keys = sizeof(keys) / sizeof(*keys); in TEST_P() local
415 ASSERT_EQ(partitions, num_keys - 1 /* last two keys make one flush */); in TEST_P()
Dfull_filter_block.cc243 int num_keys = 0; in MayMatch() local
247 keys[num_keys++] = &iter->ukey; in MayMatch()
250 keys[num_keys++] = &prefixes.back(); in MayMatch()
256 filter_bits_reader->MayMatch(num_keys, &keys[0], &may_match[0]); in MayMatch()
Dfilter_policy.cc177 virtual void MayMatch(int num_keys, Slice** keys, bool* may_match) override { in MayMatch() argument
180 for (int i = 0; i < num_keys; ++i) { in MayMatch()
186 for (int i = 0; i < num_keys; ++i) { in MayMatch()
411 virtual void MayMatch(int num_keys, Slice** keys, bool* may_match) override { in MayMatch() argument
414 for (int i = 0; i < num_keys; ++i) { in MayMatch()
420 for (int i = 0; i < num_keys; ++i) { in MayMatch()
/rocksdb-6.9/db_stress_tool/
Dno_batched_ops_stress.cc166 size_t num_keys = rand_keys.size(); in TestMultiGet() local
169 key_str.reserve(num_keys); in TestMultiGet()
170 keys.reserve(num_keys); in TestMultiGet()
171 std::vector<PinnableSlice> values(num_keys); in TestMultiGet()
172 std::vector<Status> statuses(num_keys); in TestMultiGet()
192 for (size_t i = 0; i < num_keys; ++i) { in TestMultiGet()
234 db_->MultiGet(read_opts, cfh, num_keys, keys.data(), values.data(), in TestMultiGet()
238 txn->MultiGet(read_opts, cfh, num_keys, keys.data(), values.data(), in TestMultiGet()
Dcf_consistency_stress.cc206 size_t num_keys = rand_keys.size(); in TestMultiGet() local
209 keys.reserve(num_keys); in TestMultiGet()
210 key_str.reserve(num_keys); in TestMultiGet()
211 std::vector<PinnableSlice> values(num_keys); in TestMultiGet()
212 std::vector<Status> statuses(num_keys); in TestMultiGet()
215 for (size_t i = 0; i < num_keys; ++i) { in TestMultiGet()
219 db_->MultiGet(read_opts, cfh, num_keys, keys.data(), values.data(), in TestMultiGet()
Ddb_stress_common.cc185 std::vector<int64_t> GenerateNKeys(ThreadState* thread, int num_keys, in GenerateNKeys() argument
192 keys.reserve(num_keys); in GenerateNKeys()
195 for (int i = 1; i < num_keys; ++i) { in GenerateNKeys()
/rocksdb-6.9/db/db_impl/
Ddb_impl.cc1745 size_t num_keys = keys.size(); in MultiGet() local
1747 values->resize(num_keys); in MultiGet()
1749 timestamps->resize(num_keys); in MultiGet()
1761 for (size_t i = 0; i < num_keys; ++i) { in MultiGet()
1965 if (num_keys == 0) { in MultiGet()
1970 sorted_keys.resize(num_keys); in MultiGet()
1971 for (size_t i = 0; i < num_keys; ++i) { in MultiGet()
2054 size_t num_keys, bool sorted_input, in PrepareMultiGetKeys() argument
2104 sorted_keys.resize(num_keys); in MultiGet()
2130 size_t num_keys = sorted_keys->size(); in MultiGetWithCallback() local
[all …]
Ddb_impl.h206 const size_t num_keys, const Slice* keys,
211 const size_t num_keys, const Slice* keys,
216 virtual void MultiGet(const ReadOptions& options, const size_t num_keys,
220 virtual void MultiGet(const ReadOptions& options, const size_t num_keys,
1700 const size_t num_keys, bool sorted,
1717 size_t num_keys; member
1727 num_keys(0), in MultiGetColumnFamilyData()
1735 num_keys(count), in MultiGetColumnFamilyData()
1767 const ReadOptions& read_options, size_t start_key, size_t num_keys,
/rocksdb-6.9/tools/block_cache_analyzer/
Dblock_cache_trace_analyzer.h42 uint64_t num_keys = 0; member
72 if (num_keys != 0 && access.num_keys_in_block != 0) { in AddAccess()
73 assert(num_keys == access.num_keys_in_block); in AddAccess()
96 num_keys = access.num_keys_in_block; in AddAccess()
/rocksdb-6.9/utilities/
Ddebug.cc54 size_t num_keys = 0; in GetAllKeyVersions() local
71 if (++num_keys >= max_num_ikeys) { in GetAllKeyVersions()

123