Lines Matching refs:policy
51 ASSERT_FALSE(concurrentTimes->policy.empty()); in TEST()
54 for (const auto &policyTimeVec : concurrentTimes->policy) policyEntries += policyTimeVec.size(); in TEST()
60 for (const auto &vec : concurrentTime.policy) { in TestConcurrentTimesConsistent()
65 for (const auto &vec : concurrentTime.policy) { in TestConcurrentTimesConsistent()
73 for (const auto &vec : concurrentTime.policy) { in TestConcurrentTimesConsistent()
89 ASSERT_EQ(timeInState.size(), concurrentTime.policy.size()); in TestUidTimesConsistent()
94 uint64_t concurrentSum = std::accumulate(concurrentTime.policy[i].begin(), in TestUidTimesConsistent()
95 concurrentTime.policy[i].end(), (uint64_t)0); in TestUidTimesConsistent()
221 ASSERT_EQ(kv.second.policy.size(), firstEntry.policy.size()); in TEST()
222 for (size_t i = 0; i < kv.second.policy.size(); ++i) { in TEST()
223 ASSERT_EQ(kv.second.policy[i].size(), firstEntry.policy[i].size()); in TEST()
260 ASSERT_NO_FATAL_FAILURE(TestCheckUpdate((*map1)[uid].policy, newTimes.policy)); in TEST()
277 for (uint32_t i = 0; i < times1.policy.size(); ++i) { in TEST()
278 for (uint32_t j = 0; j < times1.policy[i].size(); ++j) { in TEST()
279 ASSERT_LE(times2->policy[i][j] - times1.policy[i][j], NSEC_PER_SEC); in TEST()
304 for (uint32_t policy = 0; policy < times.size(); ++policy) { in TEST() local
305 for (uint32_t freqIdx = 0; freqIdx < times[policy].size(); ++freqIdx) { in TEST()
306 auto before = times[policy][freqIdx]; in TEST()
307 auto after = (*map2)[uid][policy][freqIdx]; in TEST()
332 for (uint32_t policy = 0; policy < times.policy.size(); ++policy) { in TEST() local
333 for (uint32_t idx = 0; idx < times.policy[policy].size(); ++idx) { in TEST()
334 auto before = times.policy[policy][idx]; in TEST()
335 auto after = (*map2)[uid].policy[policy][idx]; in TEST()
376 for (const auto &policyTimeVec : kv.second.policy) { in TEST()
447 ASSERT_FALSE(concurrentTimes->policy.empty()); in TEST()