Searched refs:tasks (Results 1 – 5 of 5) sorted by relevance
603 tasks[1].WakeUp(); in TEST_P()621 tasks[2].WakeUp(); in TEST_P()659 tasks[0].WakeUp(); in TEST_P()660 tasks[3].WakeUp(); in TEST_P()661 tasks[4].WakeUp(); in TEST_P()679 tasks[6].WakeUp(); in TEST_P()686 tasks[7].WakeUp(); in TEST_P()697 ASSERT_TRUE(!tasks[8].IsSleeping() || !tasks[9].IsSleeping()); in TEST_P()710 tasks[9].WakeUp(); in TEST_P()716 tasks[8].WakeUp(); in TEST_P()[all …]
46 int32_t tasks = outstanding_tasks_.load(std::memory_order_relaxed); in GetToken() local49 while (force || limit < 0 || tasks < limit) { in GetToken()50 if (outstanding_tasks_.compare_exchange_weak(tasks, tasks + 1)) { in GetToken()
634 List<Callable<Stats>> tasks = new ArrayList<Callable<Stats>>(); in run() local645 tasks.add(new WriteSequentialTask( in run()649 tasks.add( in run()653 tasks.add(new WriteRandomTask( in run()657 tasks.add(new WriteUniqueRandomTask( in run()662 tasks.add(new WriteRandomTask( in run()668 tasks.add(new ReadSequentialTask( in run()674 tasks.add(new ReadRandomTask( in run()684 tasks.add(new ReadRandomTask( in run()690 tasks.add(new ReadRandomTask( in run()[all …]
4515 int tasks; in TEST_F() member4586 ASSERT_GE(iter->second->limit_tasks, ++iter->second->tasks); in TEST_F()4598 ASSERT_GE(--iter->second->tasks, 0); in TEST_F()
465 …PU priority of background (esp. compaction) threads to minimize interference with foreground tasks.