Lines Matching refs:k

95     int k = static_cast<int>(info.compaction_reason);  in OnCompactionCompleted()  local
97 assert(k >= 0 && k < num_of_reasons); in OnCompactionCompleted()
98 compaction_completed_[k]++; in OnCompactionCompleted()
103 int k = static_cast<int>(CompactionReason::kExternalSstIngestion); in OnExternalFileIngested() local
104 compaction_completed_[k]++; in OnExternalFileIngested()
108 int k = static_cast<int>(CompactionReason::kFlush); in OnFlushCompleted() local
109 compaction_completed_[k]++; in OnFlushCompleted()
114 int k = static_cast<int>(reason); in NumberOfCompactions() local
115 assert(k >= 0 && k < num_of_reasons); in NumberOfCompactions()
116 return compaction_completed_.at(k).load(); in NumberOfCompactions()
297 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local
299 ASSERT_OK(Put(Key(k), values[k])); in TEST_P()
305 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local
306 ASSERT_OK(Delete(Key(k))); in TEST_P()
345 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local
347 ASSERT_OK(Put(Key(k), values[k])); in TEST_P()
350 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local
351 ASSERT_OK(Delete(Key(k))); in TEST_P()
410 for (int k = 0; k < kTestSize; ++k) { in TEST_F() local
412 ASSERT_OK(Put(Key(k), values[k])); in TEST_F()
468 for (int k = 0; k < options.level0_file_num_compaction_trigger; ++k) { in TEST_F() local
469 ASSERT_OK(Put(Key(k), Key(k))); in TEST_F()
470 ASSERT_OK(Put(Key(10 - k), "bar")); in TEST_F()
471 if (k < options.level0_file_num_compaction_trigger - 1) { in TEST_F()
483 ASSERT_EQ(Key(k), Get(Key(k))); in TEST_F()
557 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local
559 ASSERT_OK(Put(Key(k), values[k])); in TEST_P()
571 for (int k = 0; k < kTestSize; ++k) { in TEST_P() local
572 ASSERT_OK(Delete(Key(k))); in TEST_P()
585 for (int k = 0; k < kTestSize / 10; ++k) { in TEST_P() local
586 ASSERT_OK(Put(Key(k), values[k])); in TEST_P()
675 for (int k = 0; k < kTestSize; ++k) { in TEST_F() local
677 ASSERT_OK(Put(Key(k), values[k])); in TEST_F()
691 for (int k = 0; k < kTestSize; ++k) { in TEST_F() local
692 ASSERT_OK(Delete(Key(k))); in TEST_F()
1744 auto k = i * 100 + j; in TEST_F() local
1745 values[k] = RandomString(&rnd, value_size); in TEST_F()
1746 ASSERT_OK(Put(Key(k), values[k])); in TEST_F()
1760 auto k = i * 100 + j; in TEST_F() local
1761 ASSERT_OK(Put(Key(k), values[k])); in TEST_F()
2760 for (int k = 0; k < kNumInsertedKeys; ++k) { in TEST_P() local
2763 ASSERT_OK(Put(Slice(keys[k]), Slice(values[k]))); in TEST_P()
2790 for (int k = 0; k < kNumInsertedKeys; ++k) { in TEST_P() local
2791 ASSERT_EQ(values[k], Get(keys[k])); in TEST_P()
2800 for (int k = 0; k < kNumInsertedKeys; ++k) { in TEST_P() local
2801 ASSERT_EQ(values[k], Get(keys[k])); in TEST_P()
4152 for (int k = 0; k < 2; ++k) { in TEST_F() local
4153 ASSERT_OK(Put(Key(k), RandomString(&rnd, 1024))); in TEST_F()
4254 for (int k = 0; k < 2; ++k) { in TEST_F() local
4255 ASSERT_OK(Put(1, Key(k), RandomString(&rnd, 1024))); in TEST_F()
5042 for (int k = 0; k < 2; ++k) { in TEST_F() local