Lines Matching refs:i
106 for (size_t i = 0; i < 3; ++i) { in TEST_F() local
107 ASSERT_OK(db->Put(WriteOptions(), keys[i], vals[i])); in TEST_F()
110 for (size_t i = 0; i < 3; ++i) { in TEST_F() local
112 ASSERT_OK(db->Get(ReadOptions(), keys[i], &res)); in TEST_F()
113 ASSERT_TRUE(res == vals[i]); in TEST_F()
118 for (size_t i = 0; i < 3; ++i) { in TEST_F() local
120 ASSERT_TRUE(keys[i] == iterator->key()); in TEST_F()
121 ASSERT_TRUE(vals[i] == iterator->value()); in TEST_F()
132 for (size_t i = 0; i < 3; ++i) { in TEST_F() local
134 ASSERT_OK(db->Get(ReadOptions(), keys[i], &res)); in TEST_F()
135 ASSERT_TRUE(res == vals[i]); in TEST_F()
156 for (size_t i = 0; i < 3; ++i) { in TEST_F() local
157 ASSERT_OK(db->Put(WriteOptions(), keys[i], vals[i])); in TEST_F()
160 for (size_t i = 0; i < 3; ++i) { in TEST_F() local
162 ASSERT_OK(db->Get(ReadOptions(), keys[i], &res)); in TEST_F()
163 ASSERT_TRUE(res == vals[i]); in TEST_F()
168 for (size_t i = 0; i < 3; ++i) { in TEST_F() local
170 ASSERT_TRUE(keys[i] == iterator->key()); in TEST_F()
171 ASSERT_TRUE(vals[i] == iterator->value()); in TEST_F()
180 for (size_t i = 0; i < 3; ++i) { in TEST_F() local
182 ASSERT_OK(db->Get(ReadOptions(), keys[i], &res)); in TEST_F()
183 ASSERT_TRUE(res == vals[i]); in TEST_F()
190 for (size_t i = 0; i < 3; ++i) { in TEST_F() local
192 ASSERT_OK(db->Get(ReadOptions(), keys[i], &res)); in TEST_F()
193 ASSERT_TRUE(res == vals[i]); in TEST_F()
297 for (int i = 0; i < 2; ++i) { in TEST_F() local
300 for (int i = 0; i < 2; ++i) { in TEST_F() local
351 for (int i = 0; i < 2; ++i) { in TEST_F() local
419 for (int i = 0; i < 2; ++i) { in TEST_F() local
422 for (int i = 0; i < 2; ++i) { in TEST_F() local
459 int i = 0; in TEST_F() local
461 ASSERT_OK(Put(1, Key(i++), value)); in TEST_F()
864 for (int i = 0; i < 1000; i++) { in TEST_F() local
921 for (int i = 0; i < 10; ++i) { in TEST_F() local
1030 for (size_t i = 0; i < cf_meta.levels.size(); ++i) { in CheckColumnFamilyMeta() local
1031 const auto& level_meta_from_cf = cf_meta.levels[i]; in CheckColumnFamilyMeta()
1032 const auto& level_meta_from_files = files_by_level[i]; in CheckColumnFamilyMeta()
1034 ASSERT_EQ(level_meta_from_cf.level, i); in CheckColumnFamilyMeta()
1090 int i = 0; in CheckLiveFilesMeta() local
1095 i = 0; in CheckLiveFilesMeta()
1098 ASSERT_LT(i, files_by_level[level].size()); in CheckLiveFilesMeta()
1100 const auto& expected_meta = files_by_level[level][i]; in CheckLiveFilesMeta()
1113 ++i; in CheckLiveFilesMeta()
1131 for (int i = 0; i < 100; ++i) { in TEST_F() local
1134 BlobIndex::EncodeBlob(&blob_index, /* blob_file_number */ i + 1000, in TEST_F()
1173 for (int i = 0; i < 12; i++) { in MinLevelHelper() local
1175 ASSERT_OK(self->Put(DBTestBase::Key(i), values[i])); in MinLevelHelper()
1183 for (int i = 0; i < 12; i++) { in MinLevelHelper() local
1185 ASSERT_OK(self->Put(DBTestBase::Key(i), values[i])); in MinLevelHelper()
1231 for (int i = 0; i < 1; i++) { in MinLevelToCompress() local
1232 options.compression_per_level[i] = kNoCompression; in MinLevelToCompress()
1234 for (int i = 1; i < options.num_levels; i++) { in MinLevelToCompress() local
1235 options.compression_per_level[i] = type; in MinLevelToCompress()
1251 for (int i = 0; i < 2; i++) { in TEST_F() local
1252 options.compression_per_level[i] = kNoCompression; in TEST_F()
1254 for (int i = 2; i < options.num_levels; i++) { in TEST_F() local
1255 options.compression_per_level[i] = type; in TEST_F()
1271 for (int i = 0; i < 2; i++) { in TEST_F() local
1272 options.compression_per_level[i] = kNoCompression; in TEST_F()
1274 for (int i = 2; i < options.num_levels; i++) { in TEST_F() local
1275 options.compression_per_level[i] = type; in TEST_F()
1298 for (int i = 0; i < 5 * kMaxFiles; i++) { in TEST_F() local
1323 for (int i = 0; i < 100000; i++) { in TEST_F() local
1325 snprintf(key, sizeof(key), "B%010d", i); in TEST_F()
1372 for (int i = 0; i < N; i++) { in TEST_F() local
1373 ASSERT_OK(Put(Key(i), RandomString(&rnd, 1024))); in TEST_F()
1396 for (int i = 0; i < N; i++) { in TEST_F() local
1397 ASSERT_OK(Put(Key(1000 + i), RandomString(&rnd, 1024))); in TEST_F()
1419 for (int i = 0; i < N; i++) { in TEST_F() local
1420 keys[i * 3] = i * 5; in TEST_F()
1421 keys[i * 3 + 1] = i * 5 + 1; in TEST_F()
1422 keys[i * 3 + 2] = i * 5 + 2; in TEST_F()
1426 for (int i = 0; i < N * 3; i++) { in TEST_F() local
1427 ASSERT_OK(Put(Key(keys[i] + 1000), RandomString(&rnd, 1024))); in TEST_F()
1460 for (int i = 0; i < N; i++) { in TEST_F() local
1461 ASSERT_OK(Put(Key(i + 1000), RandomString(&rnd, 1024))); in TEST_F()
1502 for (int i = 0; i < N; i++) { in TEST_F() local
1503 ASSERT_OK(Put(Key(i), RandomString(&rnd, 1024))); in TEST_F()
1511 for (int i = N; i < (N + N / 4); i++) { in TEST_F() local
1512 ASSERT_OK(Put(Key(i), RandomString(&rnd, 1024))); in TEST_F()
1552 for (int i = 0; i < N; i++) { in TEST_F() local
1553 ASSERT_OK(Put(Key(i), RandomString(&rnd, 1024))); in TEST_F()
1584 for (int i = 0; i < N; i++) { in TEST_F() local
1585 ASSERT_OK(Put(Key(1000 + i), RandomString(&rnd, 1024))); in TEST_F()
1615 for (int i = 0; i < N; i++) { in TEST_F() local
1616 ASSERT_OK(Put(1, Key(i), RandomString(&rnd, S1))); in TEST_F()
1627 for (int i = 0; i < N; i += 10) { in TEST_F() local
1628 ASSERT_TRUE(Between(Size("", Key(i), 1), S1 * i, S2 * i)); in TEST_F()
1629 ASSERT_TRUE(Between(Size("", Key(i) + ".suffix", 1), S1 * (i + 1), in TEST_F()
1630 S2 * (i + 1))); in TEST_F()
1631 ASSERT_TRUE(Between(Size(Key(i), Key(i + 10), 1), S1 * 10, S2 * 10)); in TEST_F()
2033 for (int i = 0; i < 2; i++) { in TEST_F() local
2044 for (int i = 0; i < 1000; i++) { in TEST_F() local
2046 snprintf(buf, sizeof(buf), "[%d]", i * 10); in TEST_F()
2161 for (int i = 0; i < 80; i++) { in TEST_F() local
2163 ASSERT_OK(Put((i < 40), Key(i), values[i])); in TEST_F()
2186 for (size_t i = 0; i < files.size(); i++) { in TEST_F() local
2189 ASSERT_EQ(files[i][0], '/'); in TEST_F()
2190 std::string src = dbname_ + files[i]; in TEST_F()
2191 std::string dest = snapdir + files[i]; in TEST_F()
2198 if (ParseFileName(files[i].substr(1), &number, &type)) { in TEST_F()
2214 for (unsigned int i = 0; i < 1; i++) { in TEST_F() local
2216 ASSERT_OK(Put(0, Key(i), extras[i])); in TEST_F()
2234 for (unsigned int i = 0; i < 80; i++) { in TEST_F() local
2235 stat = snapdb->Get(roptions, cf_handles[i < 40], Key(i), &val); in TEST_F()
2236 ASSERT_EQ(values[i].compare(val), 0); in TEST_F()
2255 for (size_t i = 0; i < newfiles.size(); i++) { in TEST_F() local
2256 std::string src = dbname_ + "/" + newfiles[i]; in TEST_F()
2259 if (ParseFileName(newfiles[i].substr(1), &number, &type)) { in TEST_F()
2325 for (int i = 0; i < 8; i++) { in TEST_F() local
2452 for (size_t i = 1; i < statuses.size(); ++i) { in MTThreadBody() local
2454 ASSERT_TRUE((s.ok() && statuses[i].ok()) || in MTThreadBody()
2455 (s.IsNotFound() && statuses[i].IsNotFound())); in MTThreadBody()
2463 for (int i = 0; i < kColumnFamilies; ++i) { in MTThreadBody() local
2465 ASSERT_EQ(5, sscanf(values[i].c_str(), "%d.%d.%d.%d.%d", &k, &w, &c, in MTThreadBody()
2467 << values[i]; in MTThreadBody()
2472 ASSERT_EQ(cf, i); in MTThreadBody()
2473 if (i == 0) { in MTThreadBody()
2516 for (int i = 1; i < kColumnFamilies; ++i) { in TEST_P() local
2517 cfs.push_back(ToString(i)); in TEST_P()
2579 for (int i = 0; i < kGCNumKeys; ++i) { in GCThreadBody() local
2580 std::string kv(ToString(i + id * kGCNumKeys)); in GCThreadBody()
2615 for (int i = 0; i < kGCNumThreads * kGCNumKeys; ++i) { in TEST_F() local
2616 expected_db.push_back(ToString(i)); in TEST_F()
2838 for (int i = 0; i < n; i++) { in GetApproximateSizes() local
2839 sizes[i] = 0; in GetApproximateSizes()
3139 for (int i = 0; i < num; i++) { in TEST_P() local
3140 if (i == 0 || !rnd.OneIn(10)) { in TEST_P()
3315 for (int i = 0; i < 6; ++i) { in TEST_P() local
3317 ASSERT_OK(Put(ToString(i * 100 + j), RandomString(&rnd, 980))); in TEST_P()
3331 for (int i = 0; i < 50; ++i) { in TEST_P() local
3333 ASSERT_EQ("NOT_FOUND", Get(ToString(i))); in TEST_P()
3352 for (int i = 0; i < 60; i++) { in TEST_F() local
3355 ASSERT_OK(Put(ToString(i * 20 + j), RandomString(&rnd, 980))); in TEST_F()
3363 for (int i = 0; i < 60; i++) { in TEST_F() local
3366 ASSERT_OK(Put(ToString(i * 20 + j + 2000), RandomString(&rnd, 980))); in TEST_F()
3394 for (int i = 0; i < 3; i++) { in TEST_F() local
3396 ASSERT_OK(Put("a" + ToString(i), RandomString(&rnd, 500))); in TEST_F()
3397 ASSERT_OK(Put("key" + ToString(i), "")); in TEST_F()
3398 ASSERT_OK(Put("z" + ToString(i), RandomString(&rnd, 500))); in TEST_F()
3403 for (int i = 0; i < 3; i++) { in TEST_F() local
3404 ASSERT_EQ("", Get("key" + ToString(i))); in TEST_F()
3406 for (int i = 0; i < 3; i++) { in TEST_F() local
3408 ASSERT_OK(Put("a" + ToString(i), RandomString(&rnd, 500))); in TEST_F()
3409 ASSERT_OK(Delete("key" + ToString(i))); in TEST_F()
3410 ASSERT_OK(Put("z" + ToString(i), RandomString(&rnd, 500))); in TEST_F()
3415 for (int i = 0; i < 3; i++) { in TEST_F() local
3416 ASSERT_EQ("NOT_FOUND", Get("key" + ToString(i))); in TEST_F()
3477 for (int i = 0; i < 10; i++) { in TEST_F() local
3480 ASSERT_OK(Put(ToString(i * 20 + j), RandomString(&rnd, 980))); in TEST_F()
3512 for (int i = 0; i < 10; i++) { in TEST_F() local
3515 ASSERT_OK(Put(ToString(i * 20 + j), RandomString(&rnd, 980))); in TEST_F()
3529 for (int i = 0; i < 1; i++) { in TEST_F() local
3531 ASSERT_OK(Put(ToString(i * 20 + j), RandomString(&rnd, 980))); in TEST_F()
3554 for (int i = 0; i < 3; i++) { in TEST_F() local
3557 ASSERT_OK(Put(ToString(i * 20 + j), RandomString(&rnd, 980))); in TEST_F()
3570 for (int i = 0; i < 5; i++) { in TEST_F() local
3572 ASSERT_OK(Put(ToString(i * 20 + j), RandomString(&rnd, 980))); in TEST_F()
3592 for (int i = 0; i < 10; i++) { in TEST_F() local
3595 ASSERT_OK(Put(ToString(i * 20 + j), RandomString(&rnd, 980))); in TEST_F()
3612 for (int i = 0; i < 10; i++) { in TEST_F() local
3614 ASSERT_OK(Put(ToString(i * 20 + j), RandomString(&rnd, 980))); in TEST_F()
3636 for (int i = 0; i < 60; i++) { in TEST_F() local
3639 ASSERT_OK(Put(ToString(i * 20 + j), RandomString(&rnd, 980))); in TEST_F()
3647 for (int i = 0; i < 60; i++) { in TEST_F() local
3650 ASSERT_OK(Put(ToString(i * 20 + j + 2000), RandomString(&rnd, 980))); in TEST_F()
3692 for (int64_t i = 0; i < (96 << 10); ++i) { in TEST_F() local
3711 for (int64_t i = 0; i < (96 << 10); ++i) { in TEST_F() local
3737 for (int64_t i = 0; i < (96 << 10); ++i) { in TEST_F() local
3815 for (size_t i = 0; i < kTotalTasks; i++) { in TEST_F() local
3818 &sleeping_tasks[i], in TEST_F()
3819 (i < 4) ? Env::Priority::LOW : Env::Priority::HIGH); in TEST_F()
3823 for (int i = 0; i < 10000; i++) { in TEST_F() local
3836 for (size_t i = 0; i < kTotalTasks; i++) { in TEST_F() local
3837 sleeping_tasks[i].WakeUp(); in TEST_F()
3838 sleeping_tasks[i].WaitUntilDone(); in TEST_F()
3879 for (size_t i = 0; i < cnt; i++) { in TEST_F() local
3880 auto istr = ToString(i); in TEST_F()
3886 for (size_t i = cnt; i < 2 * cnt; i++) { in TEST_F() local
3887 auto istr = ToString(i); in TEST_F()
3895 for (size_t i = 0; i < cnt * 100; i++) { // FlushWAL is faster than Put in TEST_F() local
3905 for (size_t i = 0; i < cnt; i++) { in TEST_F() local
3907 auto istr = ToString(i); in TEST_F()
3938 for (int i = 0; i < size; i++) { in TEST_F() local
3939 ASSERT_OK(Put(Key(i), RandomString(&rnd, 1024))); in TEST_F()
3946 if (i % kNumPutsBeforeWaitForFlush == kNumPutsBeforeWaitForFlush - 1) { in TEST_F()
4097 for (int i = 0; i < 2; ++i) { in TEST_F() local
4142 if (i == 0) { in TEST_F()
4417 for (int i = 0; i < ThreadStatus::NUM_OP_TYPES; ++i) { in TEST_P() local
4418 operation_count[i] = 0; in TEST_P()
4504 for (int i = 0; i < ThreadStatus::NUM_OP_TYPES; ++i) { in TEST_P() local
4505 operation_count[i] = 0; in TEST_P()
4530 for (int i = 0; i < kNKeys; i++) { in TEST_F() local
4531 keys[i] = i; in TEST_F()
4563 for (int i = 0; i < 20; i++) { in TEST_F() local
4564 ASSERT_OK(Put(Key(keys[i]), CompressibleString(&rnd, 4000))); in TEST_F()
4576 for (int i = 21; i < 120; i++) { in TEST_F() local
4577 ASSERT_OK(Put(Key(keys[i]), CompressibleString(&rnd, 4000))); in TEST_F()
4613 for (int i = 0; i < kNKeys; i++) { in TEST_F() local
4614 keys[i] = i; in TEST_F()
4664 for (int i = 0; i < 100; i++) { in TEST_F() local
4666 ASSERT_OK(Put(Key(keys[i]), value)); in TEST_F()
4667 if (i % 25 == 24) { in TEST_F()
4709 for (int i = 101; i < 500; i++) { in TEST_F() local
4711 ASSERT_OK(Put(Key(keys[i]), value)); in TEST_F()
4712 if (i % 100 == 99) { in TEST_F()
4761 for (int i = 0; i < size; i++) { in TEST_F() local
4762 ASSERT_OK(Put(Key(start + stride * i), RandomString(&rnd, 1024))); in TEST_F()
4813 for (int i = 0; i < 96; ++i) { in TEST_F() local
4814 gen_l0_kb(i, 64, 96); in TEST_F()
4834 for (int i = 0; i < 20; ++i) { in TEST_F() local
4835 gen_l0_kb(i, 64, 32); in TEST_F()
4906 for (int i = 0; i < 4; ++i) { in TEST_F() local
4907 ASSERT_OK(Put(Key(i), RandomString(&rnd, 1024))); in TEST_F()
4920 for (int i = 0; i < 4; ++i) { in TEST_F() local
4921 ASSERT_OK(Put(Key(i), RandomString(&rnd, 1024))); in TEST_F()
5085 for (int i = 0; i < kTestSize; ++i) { in TEST_F() local
5144 for (int i = 0; i < 10; ++i) { in TEST_F() local
5231 for (int i = 0; i < numkeys; i++) { in TEST_F() local
5232 ASSERT_OK(Put(1, Key(i), "val")); in TEST_F()
5241 for (int i = 0; i < numkeys; i++) { in TEST_F() local
5242 ASSERT_EQ(Get(1, Key(i)), "val"); in TEST_F()
5285 for (int i = 0; i < kNumKeysWritten; ++i) { in TEST_F() local
5287 ASSERT_OK(Put(Key(i), RandomString(&rnd, 128) + std::string(128, 'a'))); in TEST_F()
5293 for (int i = 0; i < kNumKeysWritten; ++i) { in TEST_F() local
5294 auto r = Get(Key(i)); in TEST_F()
5324 for (size_t i = 0; i < filenames.size(); ++i) { in TEST_F() local
5325 env_->DeleteFile(dbname_ + "/" + filenames[i]); in TEST_F()
5435 for (int i = 0; i < 1000; i++) { in TEST_P() local
5458 for (int i = 0; i < 10 + table; ++i) { in TEST_P() local
5459 Put(ToString(table * 100 + i), "val"); in TEST_P()
5485 for (int i = 0; i < 100000; ++i) { in TEST_F() local
5486 Put(Key(i), "val"); in TEST_F()
5582 for (int i = 0; i < 3; ++i) { in TEST_F() local
5690 for (int i = 0; i < kNumL0Files; ++i) { in TEST_F() local
5727 for (int i = 0; i < 2; ++i) { in TEST_F() local
5741 for (int i = 0; i < kNumL0Files; ++i) { in TEST_F() local
5751 for (int i = 0; i < 2; ++i) { in TEST_F() local
5752 ASSERT_NE("NOT_FOUND", Get(Key(i))); in TEST_F()
5770 for (int i = 0; i < 2; ++i) { in TEST_F() local
5801 for (int i = 0; i < 20; ++i) { in TEST_F() local
5830 for (int i = 0; i < 5; i++) { in TEST_F() local
5833 size_t write_size = 1024 * 1024 * (5 + i); in TEST_F()
5942 for (int i = 0; i < 3; i++) { in TEST_F() local
5943 Put(Key(i), std::string(10000, 'x')); in TEST_F()
5952 for (int i = 0; i < kTotalFlushes; i++) { in TEST_F() local
5959 Put(Key(i), std::string(entry_size, 'x'), wo); in TEST_F()
6107 for (int i = 0; i < 72; i++) { in TEST_F() local
6108 Put(Key(i), std::string(5000, 'x')); in TEST_F()
6109 if (i % 10 == 0) { in TEST_F()
6117 for (int i = 0; i < 72; i++) { in TEST_F() local
6118 Put(Key(i), std::string(5000, 'x')); in TEST_F()
6119 if (i % 10 == 0) { in TEST_F()
6135 for (int i = 0; i < 3; i++) { in TEST_F() local
6136 Put(Key(i), std::string(5000, 'x')); in TEST_F()
6137 Put(Key(100 - i), std::string(5000, 'x')); in TEST_F()
6170 for (int i = 0; i < 3; i++) { in TEST_F() local
6171 Put(Key(10 + i), std::string(5000, 'x')); in TEST_F()
6172 Put(Key(90 - i), std::string(5000, 'x')); in TEST_F()
6193 for (int i = 0; i < 3; i++) { in TEST_F() local
6194 Put(Key(20 + i), std::string(5000, 'x')); in TEST_F()
6195 Put(Key(80 - i), std::string(5000, 'x')); in TEST_F()
6257 for (int i = 0; i < 3; i++) { in TEST_F() local
6413 for (int i = 0; i < 10000; ++i) { in TEST_F() local
6440 for (int i = 0; !done(); ++i) { in TEST_F() local
6442 Slice(std::to_string(i).c_str()))); in TEST_F()
6541 for (int i = 0; i < kNumLevelFiles; ++i) { in TEST_F() local
6544 Put(Key(i * kNumKeysPerFile + j), RandomString(&rnd, kValueSize))); in TEST_F()
6566 for (int i = 0; i < kNumLevelFiles; ++i) { in TEST_F() local
6569 Put(Key(i * kNumKeysPerFile + j), RandomString(&rnd, kValueSize))); in TEST_F()