Lines Matching defs:nr_tasks
119 int nr_tasks;
545 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks);
627 if (t >= g->p.nr_tasks) {
659 if (t < g->p.nr_tasks)
660 printf("# NOTE: %d tasks bound, %d tasks unbound\n", t, g->p.nr_tasks - t);
693 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks);
754 if (t >= g->p.nr_tasks || !node_has_cpus(bind_node)) {
774 if (t < g->p.nr_tasks)
775 printf("# NOTE: %d tasks mem-bound, %d tasks unbound\n", t, g->p.nr_tasks - t);
1048 for (t = 0; t < g->p.nr_tasks; t++) {
1068 nr_min = g->p.nr_tasks;
1081 BUG_ON(sum > g->p.nr_tasks);
1083 if (0 && (sum < g->p.nr_tasks)) {
1202 if (g->nr_tasks_started == g->p.nr_tasks)
1413 g->p.nr_tasks, g->p.nr_tasks == 1 ? "task" : "tasks", nr_numa_nodes(), g->p.nr_cpus);
1428 ssize_t size = sizeof(*g->threads)*g->p.nr_tasks;
1433 for (t = 0; t < g->p.nr_tasks; t++) {
1452 ssize_t size = sizeof(*g->threads)*g->p.nr_tasks;
1456 for (t = 0; t < g->p.nr_tasks; t++) {
1509 g->p.nr_tasks = g->p.nr_proc*g->p.nr_threads;
1613 while (g->nr_tasks_started != g->p.nr_tasks)
1621 threads_ready = (g->nr_tasks_working == g->p.nr_tasks);
1661 for (t = 0; t < g->p.nr_tasks; t++) {
1683 runtime_avg = (double)runtime_ns_sum / g->p.nr_tasks / NSEC_PER_SEC;
1703 print_res(name, bytes / g->p.nr_tasks / 1e9,
1709 print_res(name, runtime_sec_max * NSEC_PER_SEC / (bytes / g->p.nr_tasks),
1712 print_res(name, bytes / g->p.nr_tasks / 1e9 / runtime_sec_max,