| /rocksdb-6.9/tools/block_cache_analyzer/ |
| D | block_cache_pysim_test.py | 473 k.get_id = 2 483 k.get_id = 3 485 k.key_id = 2 491 k.get_id = 3 494 k.key_id = 1 500 k.get_id = 3 503 k.key_id = 3 511 k.get_id = 4 513 k.key_id = 4 525 k.get_id = 4 [all …]
|
| /rocksdb-6.9/utilities/persistent_cache/ |
| D | hash_table_test.cc | 87 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local 88 map_.Insert(Node(k, std::string(1000, k % 255))); in TEST_F() 92 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local 104 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local 105 map_.Insert(Node(k, std::string(1000, k % 255))); in TEST_F() 112 uint64_t k = rand.Next() % max_keys; in TEST_F() local 117 erased.insert(k); in TEST_F() 121 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local 139 for (uint64_t k = 0; k < max_keys; ++k) { in TEST_F() local 140 map_.Insert(new Node(k, std::string(1000, k % 255))); in TEST_F() [all …]
|
| D | persistent_cache_bench.cc | 191 uint64_t k[3]; in InsertKey() local 192 Slice block_key = FillKey(k, key); in InsertKey() 226 uint64_t k[3]; in ReadKey() local 227 Slice key = FillKey(k, val); in ReadKey() 275 Slice FillKey(uint64_t (&k)[3], const uint64_t val) { in FillKey() 276 k[0] = k[1] = 0; in FillKey() 277 k[2] = val; in FillKey() 278 void* p = static_cast<void*>(&k); in FillKey() 279 return Slice(static_cast<char*>(p), sizeof(k)); in FillKey()
|
| D | hash_table_bench.cc | 101 size_t k = insert_key_++; in RunWrite() local 102 std::string tmp(1000, k % 255); in RunWrite() 103 bool status = impl_->Insert(k, tmp); in RunWrite() 113 size_t k = rgen.Next() % max_prepop_key; in RunRead() local 114 bool status = impl_->Lookup(k, &s); in RunRead() 116 assert(s == std::string(1000, k % 255)); in RunRead() 123 size_t k = erase_key_++; in RunErase() local 124 bool status = impl_->Erase(k); in RunErase()
|
| /rocksdb-6.9/db/ |
| D | external_sst_file_test.cc | 299 for (int k = 0; k < 100; k++) { in TEST_F() local 323 for (int k = 100; k < 200; k++) { in TEST_F() local 341 for (int k = 195; k < 300; k++) { in TEST_F() local 359 for (int k = 30; k < 40; k++) { in TEST_F() local 373 for (int k = 400; k < 500; k++) { in TEST_F() local 447 for (int k = 0; k < 100; k++) { in TEST_F() local 461 for (int k = 0; k < 200; k++) { in TEST_F() local 608 for (int k = 0; k < 100; k++) { in TEST_F() local 658 for (int k = 30; k < 40; k++) { in TEST_F() local 737 for (int k = 0; k < 200; k++) { in TEST_F() local [all …]
|
| D | dbformat_test.cc | 62 for (unsigned int k = 0; k < sizeof(keys) / sizeof(keys[0]); k++) { in TEST_F() local 138 IterKey k; in TEST_F() local 142 ASSERT_EQ(std::string(k.GetUserKey().data(), k.GetUserKey().size()), in TEST_F() 145 k.TrimAppend(0, p, 3); in TEST_F() 146 ASSERT_EQ(std::string(k.GetUserKey().data(), k.GetUserKey().size()), in TEST_F() 150 ASSERT_EQ(std::string(k.GetUserKey().data(), k.GetUserKey().size()), in TEST_F() 154 ASSERT_EQ(std::string(k.GetUserKey().data(), k.GetUserKey().size()), in TEST_F() 158 ASSERT_EQ(std::string(k.GetUserKey().data(), k.GetUserKey().size()), in TEST_F() 162 ASSERT_EQ(std::string(k.GetUserKey().data(), k.GetUserKey().size()), in TEST_F() 166 ASSERT_EQ(std::string(k.GetUserKey().data(), k.GetUserKey().size()), in TEST_F() [all …]
|
| D | external_sst_file_basic_test.cc | 160 for (int k = 0; k < 100; k++) { in TEST_F() local 161 ASSERT_OK(sst_file_writer.Put(Key(k), Key(k) + "_val")); in TEST_F() 188 for (int k = 0; k < 100; k++) { in TEST_F() local 189 ASSERT_EQ(Get(Key(k)), Key(k) + "_val"); in TEST_F() 204 for (int k = 0; k < 100; k++) { in TEST_F() local 205 ASSERT_OK(sst_file_writer.Put(Key(k), Key(k) + "_val")); in TEST_F() 218 for (int k = 100; k < 300; k++) { in TEST_F() local 219 ASSERT_OK(sst_file_writer.Put(Key(k), Key(k) + "_val")); in TEST_F() 232 for (int k = 110; k < 125; k++) { in TEST_F() local 256 for (int k = 0; k < 300; k++) { in TEST_F() local [all …]
|
| D | db_compaction_test.cc | 297 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local 305 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local 345 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local 350 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local 410 for (int k = 0; k < kTestSize; ++k) { in TEST_F() local 557 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local 571 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local 675 for (int k = 0; k < kTestSize; ++k) { in TEST_F() local 4152 for (int k = 0; k < 2; ++k) { in TEST_F() local 4254 for (int k = 0; k < 2; ++k) { in TEST_F() local [all …]
|
| D | memtable_list.cc | 659 for (size_t k = 0; k != num; ++k) { in InstallMemtableAtomicFlushResults() local 662 (imm_lists == nullptr) ? cfds[k]->imm() : imm_lists->at(k); in InstallMemtableAtomicFlushResults() 663 if (!mems_list[k]->empty()) { in InstallMemtableAtomicFlushResults() 664 assert((*mems_list[k])[0]->GetID() == imm->GetEarliestMemTableID()); in InstallMemtableAtomicFlushResults() 667 assert(nullptr != file_metas[k]); in InstallMemtableAtomicFlushResults() 668 for (size_t i = 0; i != mems_list[k]->size(); ++i) { in InstallMemtableAtomicFlushResults() 669 assert(i == 0 || (*mems_list[k])[i]->GetEdits()->NumEntries() == 0); in InstallMemtableAtomicFlushResults() 670 (*mems_list[k])[i]->SetFlushCompleted(true); in InstallMemtableAtomicFlushResults() 671 (*mems_list[k])[i]->SetFileNumber(file_metas[k]->fd.GetNumber()); in InstallMemtableAtomicFlushResults() 701 for (size_t k = 0; k != cfds.size(); ++k) { in InstallMemtableAtomicFlushResults() local [all …]
|
| D | db_test_util.cc | 706 return db_->Merge(wo, k, v); in Put() 708 return db_->Put(wo, k, v); in Put() 717 return db_->Put(wo, handles_[cf], k, v); in Put() 722 return db_->Merge(wo, k, v); in Merge() 727 return db_->Merge(wo, handles_[cf], k, v); in Merge() 731 return db_->Delete(WriteOptions(), k); in Delete() 755 Status s = db_->Get(options, k, &result); in Get() 792 keys.push_back(k[i]); in MultiGet() 830 std::vector<Status> statuses(k.size()); in MultiGet() 834 keys.push_back(k[i]); in MultiGet() [all …]
|
| D | flush_job_test.cc | 331 size_t k = 0; in TEST_F() local 334 for (size_t i = 0; i != num_memtables[k]; ++i) { in TEST_F() 349 memtable_ids.push_back(num_memtables[k++] - 1); in TEST_F() 355 k = 0; in TEST_F() 366 k++; in TEST_F() 405 k = 0; in TEST_F() 410 ASSERT_EQ(smallest_seqs[k], file_meta.fd.smallest_seqno); in TEST_F() 411 ASSERT_EQ(largest_seqs[k], file_meta.fd.largest_seqno); in TEST_F() 414 all_cfds[k]->imm()->GetEarliestMemTableID()); in TEST_F() 415 ASSERT_EQ(0, all_cfds[k]->imm()->GetLatestMemTableID()); in TEST_F() [all …]
|
| D | db_merge_operator_test.cc | 244 for (int k = 0; k < kOperandsPerKeyPerFile; k++) { in TEST_P() local 329 std::string k = Key(j); in TEST_P() local 331 ASSERT_OK(db_->Merge(WriteOptions(), k, v)); in TEST_P() 333 true_data[k] = std::max(true_data[k], v); in TEST_P() 384 int k = 0; in TEST_P() local 386 db_->Merge(WriteOptions(), Key(k), Key(k)); in TEST_P() 389 k++; in TEST_P()
|
| /rocksdb-6.9/util/ |
| D | murmurhash.cc | 45 k *= m; in MurmurHash64A() 46 k ^= k >> r; in MurmurHash64A() 47 k *= m; in MurmurHash64A() 49 h ^= k; in MurmurHash64A() 109 k *= m; in MurmurHash2() 110 k ^= k >> r; in MurmurHash2() 111 k *= m; in MurmurHash2() 114 h ^= k; in MurmurHash2() 165 k *= m; in MurmurHashNeutral2() 166 k ^= k >> r; in MurmurHashNeutral2() [all …]
|
| D | file_reader_writer_test.cc | 288 for (int k = 0; k < 100; ++k) { in TEST_P() local 289 size_t strLen = k * GetReadaheadSize() + in TEST_P() 383 for (int k = 0; k < 100; ++k) { in TEST_P() local 384 size_t strLen = k * GetReadaheadSize() + in TEST_P() 406 for (int k = 0; k < 100; ++k) { in TEST_P() local 407 size_t strLen = k * GetReadaheadSize() + in TEST_P()
|
| /rocksdb-6.9/memtable/ |
| D | skiplist_test.cc | 172 uint64_t data[2] = { k, g }; in HashNumbers() 180 return ((k << 40) | (g << 8) | (HashNumbers(k, g) & 0xff)); in MakeKey() 184 return hash(k) == (HashNumbers(key(k), gen(k)) & 0xff); in IsValidKey() 204 void Set(int k, int v) { in Set() 207 int Get(int k) { return generation[k].load(std::memory_order_acquire); } in Get() 210 for (unsigned int k = 0; k < K; k++) { in State() local 211 Set(k, 0); in State() 234 current_.Set(k, g); in WriteStep() 240 for (unsigned int k = 0; k < K; k++) { in ReadStep() local 241 initial_state.Set(k, current_.Get(k)); in ReadStep() [all …]
|
| D | inlineskiplist_test.cc | 355 return ((k << 40) | (g << 8) | (HashNumbers(k, g) & 0xff)); in MakeKey() 359 return hash(k) == (HashNumbers(key(k), gen(k)) & 0xff); in IsValidKey() 382 int Get(int k) { return generation[k].load(std::memory_order_acquire); } in Get() 385 for (unsigned int k = 0; k < K; k++) { in State() local 386 Set(k, 0); in State() 411 current_.Set(k, g); in WriteStep() 428 current_.Set(k, g); in ConcurrentWriteStep() 434 for (unsigned int k = 0; k < K; k++) { in ReadStep() local 435 initial_state.Set(k, current_.Get(k)); in ReadStep() 602 for (int k = 0; k < kSize; ++k) { in RunConcurrentRead() local [all …]
|
| /rocksdb-6.9/tools/ |
| D | analyze_txn_stress_test.sh | 44 k=`echo $l | awk '{print $1}'`; 47 exp=`grep "\<$k\>" /tmp/changes.txt | tail -1 | cut -d= -f2`; 50 k=`echo $l | awk '{print $1}'`; 51 grep "\<$k\>" /tmp/changes.txt 58 k=`echo $l | awk '{print $1}'`; 59 grep "\<$k\>" /tmp/vb.txt > /dev/null 61 echo missing key $k 67 for k in `cat /tmp/keys.txt`; 69 grep "\<$k\>" /tmp/changes.txt > /tmp/adds.txt; 76 …if [[ $END -ne $EXP ]]; then echo inconsistent txn: $k $START+$ADDS=$END; cat /tmp/adds.txt; retur…
|
| D | db_crashtest.py | 207 dest_params = dict([(k, v() if callable(v) else v) 208 for (k, v) in src_params.items()]) 269 for k, v in vars(args).items(): 271 params[k] = v 278 '--{0}={1}'.format(k, v) 279 for k, v in [(k, finalzied_params[k]) for k in sorted(finalzied_params)] 280 if k not in set(['test_type', 'simple', 'duration', 'interval', 493 for k, v in all_params.items(): 494 parser.add_argument("--" + k, type=type(v() if callable(v) else v))
|
| D | check_format_compatible.sh | 32 k = "" 34 k=k + symbols[random.randint(0, len(symbols) - 1)] 41 print >> f, k + " ==> " + v 51 k = str(i) 52 v = "value" + k 53 print >> f, k + " ==> " + v
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2019-03-08-format-version-4.markdown | 31 restart_point 0: k, v (off, sz), k, v (delta-sz), ..., k, v (delta-sz) 32 restart_point 1: k, v (off, sz), k, v (delta-sz), ..., k, v (delta-sz) 34 restart_point n-1: k, v (off, sz), k, v (delta-sz), ..., k, v (delta-sz) 35 where, k is key, v is value, and its encoding is in parenthesis.
|
| /rocksdb-6.9/examples/ |
| D | multi_processes_example.cc | 77 ret.append(reinterpret_cast<char*>(&k), sizeof(k)); in Key() 79 char buf[sizeof(k)]; in Key() 80 buf[0] = k & 0xff; in Key() 81 buf[1] = (k >> 8) & 0xff; in Key() 82 buf[2] = (k >> 16) & 0xff; in Key() 83 buf[3] = (k >> 24) & 0xff; in Key() 84 buf[4] = (k >> 32) & 0xff; in Key() 85 buf[5] = (k >> 40) & 0xff; in Key() 86 buf[6] = (k >> 48) & 0xff; in Key() 87 buf[7] = (k >> 56) & 0xff; in Key() [all …]
|
| /rocksdb-6.9/table/block_based/ |
| D | block_test.cc | 42 std::string k(p); in GenerateKey() local 47 return k; in GenerateKey() 104 Slice k = iter->key(); in TEST_F() local 119 Slice k(keys[index]); in TEST_F() local 122 iter->Seek(k); in TEST_F() 420 Slice k(keys[i]); in TEST_F() local 423 iter->Seek(k); in TEST_F() 457 Slice k(keys[index]); in TEST_F() local 459 iter->Seek(k); in TEST_F() 584 Slice k = iter->key(); in TEST_P() local [all …]
|
| /rocksdb-6.9/utilities/transactions/ |
| D | transaction_test.h | 393 auto k = Slice("foo-" + istr).ToString(); in CrossCompatibilityTest() local 400 committed_kvs[k] = v; in CrossCompatibilityTest() 402 committed_kvs[k] = v2; in CrossCompatibilityTest() 407 committed_kvs[k] = v; in CrossCompatibilityTest() 408 wb.Put(k, v); in CrossCompatibilityTest() 409 committed_kvs[k] = v2; in CrossCompatibilityTest() 410 wb.Put(k, v2); in CrossCompatibilityTest() 418 committed_kvs[k] = v; in CrossCompatibilityTest() 419 ASSERT_OK(txn->Put(k, v)); in CrossCompatibilityTest() 420 committed_kvs[k] = v2; in CrossCompatibilityTest() [all …]
|
| /rocksdb-6.9/db/compaction/ |
| D | compaction_iterator_test.cc | 48 last_seen.store(k); in FilterV2() 62 stall_at.store(k); in WaitForStall() 386 if (k == "a") { in TEST_P() 391 if (k == "b") { in TEST_P() 397 if (k == "e") { in TEST_P() 402 if (k == "f") { in TEST_P() 413 if (k == "h") { in TEST_P() 418 if (k == "i") { in TEST_P() 569 if (k == "a") { in TEST_P() 573 } else if (k == "b") { in TEST_P() [all …]
|
| /rocksdb-6.9/ |
| D | WINDOWS_PORT.md | 127 * Fillseq: 4.944 micros/op 202k ops/sec; 157.4 MB/s 144 * Overwrite: 52.661 micros/op 18.9k ops/sec; 157 * Readrandom: 15.548 micros/op 64.3k ops/sec; 180 * Write Rate Achieved: 40.5k write/sec; 185 * Write Rate Achieved: 50.6k write/sec 193 * Write Rate Achieved: 5.8k/s write/sec 198 * Write Rate Achieved: 5.8k/s write/sec 207 * Write Rate Achieved: 46.3k/s write/sec 212 * Write Rate Achieved: 45.8k/s write/sec 218 * Write Rate Achieved: 5.78k write/sec [all …]
|