Searched refs:kNumEntries (Results 1 – 5 of 5) sorted by relevance
89 const int kNumEntries = 2000; in TEST_F() local90 CacheAddr entries[kNumEntries]; in TEST_F()94 for (int i = 0; i < kNumEntries; i++) { in TEST_F()101 for (int i = 0; i < kNumEntries; i++) { in TEST_F()102 int source1 = rand() % kNumEntries; in TEST_F()103 int source2 = rand() % kNumEntries; in TEST_F()109 for (int i = 0; i < kNumEntries / 2; i++) { in TEST_F()117 Addr address(entries[kNumEntries / 2]); in TEST_F()
477 const int kNumEntries = 100; in BackendInvalidEntryWithLoad() local478 disk_cache::Entry* entries[kNumEntries]; in BackendInvalidEntryWithLoad()479 for (int i = 0; i < kNumEntries; i++) { in BackendInvalidEntryWithLoad()483 EXPECT_EQ(kNumEntries, cache_->GetEntryCount()); in BackendInvalidEntryWithLoad()485 for (int i = 0; i < kNumEntries; i++) { in BackendInvalidEntryWithLoad()486 int source1 = rand() % kNumEntries; in BackendInvalidEntryWithLoad()487 int source2 = rand() % kNumEntries; in BackendInvalidEntryWithLoad()493 std::string keys[kNumEntries]; in BackendInvalidEntryWithLoad()494 for (int i = 0; i < kNumEntries; i++) { in BackendInvalidEntryWithLoad()496 if (i < kNumEntries / 2) in BackendInvalidEntryWithLoad()[all …]
216 const int kNumEntries = 60000; in TEST_F() local217 disk_cache::Addr* address = new disk_cache::Addr[kNumEntries]; in TEST_F()222 for (int i = 0; i < kNumEntries; i++) { in TEST_F()231 int entry = rand() * (kNumEntries / RAND_MAX + 1); in TEST_F()232 if (entry >= kNumEntries) in TEST_F()
95 const int kNumEntries = 30; in StressTheCache() local97 disk_cache::Entry* entries[kNumEntries] = {0}; in StressTheCache()108 int slot = rand() % kNumEntries; in StressTheCache()
433 const int kNumEntries = 1 << 14; in TEST() local434 int** p = reinterpret_cast<int**>(malloc(sizeof(*p) * kNumEntries)); in TEST()436 for (int i = 0; i < kNumEntries; i++) { in TEST()441 for (int i = 0; i < kNumEntries; i++) { in TEST()444 for (int i = 0; i < kNumEntries; i++) { in TEST()448 EXPECT_EQ(kNumEntries/2 * (kNumEntries - 1), sum); // assume kNE is even in TEST()