Lines Matching refs:counter
32 RecursiveTask(TaskProcessor* task_processor, Atomic<size_t>* counter, size_t max_recursion) in RecursiveTask() argument
33 : HeapTask(NanoTime() + MsToNs(10)), task_processor_(task_processor), counter_(counter), in RecursiveTask()
71 Atomic<size_t> counter(0); in TEST_F() local
72 task_processor.AddTask(self, new RecursiveTask(&task_processor, &counter, kRecursion)); in TEST_F()
79 while (counter.LoadSequentiallyConsistent() != kRecursion) { in TEST_F()
90 counter.StoreSequentiallyConsistent(0); in TEST_F()
95 task_processor.AddTask(self, new RecursiveTask(&task_processor, &counter, kRecursion)); in TEST_F()
100 ASSERT_EQ(counter.LoadSequentiallyConsistent(), kRecursion); in TEST_F()
105 explicit TestOrderTask(uint64_t expected_time, size_t expected_counter, size_t* counter) in TestOrderTask() argument
106 : HeapTask(expected_time), expected_counter_(expected_counter), counter_(counter) { in TestOrderTask()
125 size_t counter = 0; in TEST_F() local
134 auto* task = new TestOrderTask(pair.first, pair.second, &counter); in TEST_F()
145 ASSERT_EQ(counter, kNumTasks); in TEST_F()