Lines Matching full:nr_tasks
103 int nr_tasks;
441 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks);
513 if (t >= g->p.nr_tasks) {
540 if (t < g->p.nr_tasks)
541 printf("# NOTE: %d tasks bound, %d tasks unbound\n", t, g->p.nr_tasks - t);
573 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks);
630 if (t >= g->p.nr_tasks) {
650 if (t < g->p.nr_tasks)
651 printf("# NOTE: %d tasks mem-bound, %d tasks unbound\n", t, g->p.nr_tasks - t);
912 for (t = 0; t < g->p.nr_tasks; t++) {
932 nr_min = g->p.nr_tasks;
943 BUG_ON(sum > g->p.nr_tasks);
945 if (0 && (sum < g->p.nr_tasks))
1062 if (g->nr_tasks_working == g->p.nr_tasks)
1255 g->p.nr_tasks, g->p.nr_tasks == 1 ? "task" : "tasks", g->p.nr_nodes, g->p.nr_cpus);
1270 ssize_t size = sizeof(*g->threads)*g->p.nr_tasks;
1275 for (t = 0; t < g->p.nr_tasks; t++) {
1291 ssize_t size = sizeof(*g->threads)*g->p.nr_tasks;
1341 g->p.nr_tasks = g->p.nr_proc*g->p.nr_threads;
1438 nr_tasks)
1441 BUG_ON(g->nr_tasks_started != g->p.nr_tasks);
1484 for (t = 0; t < g->p.nr_tasks; t++) {
1506 runtime_avg = (double)runtime_ns_sum / g->p.nr_tasks / 1e9;
1526 print_res(name, bytes / g->p.nr_tasks / 1e9,
1532 print_res(name, runtime_sec_max * 1e9 / (bytes / g->p.nr_tasks),
1535 print_res(name, bytes / g->p.nr_tasks / 1e9 / runtime_sec_max,
