Lines Matching refs:tasks
45 std::vector<sp<TrivialTask>> tasks;
46 tasks.reserve(state.max_iterations);
49 tasks.emplace_back(new TrivialTask);
50 benchmark::DoNotOptimize(tasks.back());
58 std::vector<sp<TrivialTask>> tasks;
59 tasks.reserve(state.max_iterations);
62 tasks.emplace_back(new TrivialTask);
63 benchmark::DoNotOptimize(tasks.back());
64 processor->add(tasks.back());
67 for (sp<TrivialTask>& task : tasks) {
76 std::vector<sp<TrivialTask>> tasks;
77 tasks.reserve(state.max_iterations);
80 tasks.emplace_back(new TrivialTask);
81 benchmark::DoNotOptimize(tasks.back());
82 processor->add(tasks.back());
85 for (sp<TrivialTask>& task : tasks) {
88 tasks.clear();
116 std::vector<std::future<int>> tasks;
117 tasks.reserve(state.max_iterations);
121 tasks.emplace_back(thread->queue().async([expected]() -> int { return expected + 1; }));
126 for (auto& future : tasks) {
131 tasks.clear();
