Searched refs:kNumIterations (Results 1 – 4 of 4) sorted by relevance
53 static const uint32_t kNumIterations = 1000; variable126 service->benchmarkPingPong(kNumIterations); in TEST_F()129 while (numRoundTrips < kNumIterations) { in TEST_F()142 accumulatedTime /= kNumIterations; in TEST_F()158 for (uint32_t i = 0; i < kNumIterations; i++) { in TEST_F()176 accumulatedTime /= (numLoops * kNumIterations); in TEST_F()192 for (uint32_t i = 0; i < kNumIterations; i++) { in TEST_F()210 accumulatedTime /= (numLoops * kNumIterations); in TEST_F()225 for (uint32_t i = 0; i < kNumIterations; i++) { in TEST_F()243 accumulatedTime /= (numLoops * kNumIterations); in TEST_F()[all …]
130 constexpr int kNumIterations = 10; in TEST_F() local131 for (int i = 1; i <= kNumIterations; i++) { in TEST_F()166 constexpr int kNumIterations = 10; in TEST_F() local167 for (int i = 1; i <= kNumIterations; i++) { in TEST_F()
31 static constexpr size_t kNumIterations = 1000; member in art::gc::space::LargeObjectSpaceTest166 thread_pool.AddTask(self, new AllocRaceTask(i, kNumIterations, 16 * KB, los)); in RaceTest()
639 static const int32_t kNumIterations = 5000; in testSeek() local644 for (int32_t i = 0; i < kNumIterations; ++i) { in testSeek()