Lines Matching refs:tasks
42 std::vector<sp<TrivialTask> > tasks; in BM_TaskManager_allocateTask() local
43 tasks.reserve(state.max_iterations); in BM_TaskManager_allocateTask()
46 tasks.emplace_back(new TrivialTask); in BM_TaskManager_allocateTask()
47 benchmark::DoNotOptimize(tasks.back()); in BM_TaskManager_allocateTask()
55 std::vector<sp<TrivialTask> > tasks; in BM_TaskManager_enqueueTask() local
56 tasks.reserve(state.max_iterations); in BM_TaskManager_enqueueTask()
59 tasks.emplace_back(new TrivialTask); in BM_TaskManager_enqueueTask()
60 benchmark::DoNotOptimize(tasks.back()); in BM_TaskManager_enqueueTask()
61 processor->add(tasks.back()); in BM_TaskManager_enqueueTask()
64 for (sp<TrivialTask>& task : tasks) { in BM_TaskManager_enqueueTask()
73 std::vector<sp<TrivialTask> > tasks; in BM_TaskManager_enqueueRunDeleteTask() local
74 tasks.reserve(state.max_iterations); in BM_TaskManager_enqueueRunDeleteTask()
77 tasks.emplace_back(new TrivialTask); in BM_TaskManager_enqueueRunDeleteTask()
78 benchmark::DoNotOptimize(tasks.back()); in BM_TaskManager_enqueueRunDeleteTask()
79 processor->add(tasks.back()); in BM_TaskManager_enqueueRunDeleteTask()
82 for (sp<TrivialTask>& task : tasks) { in BM_TaskManager_enqueueRunDeleteTask()
85 tasks.clear(); in BM_TaskManager_enqueueRunDeleteTask()