Lines Matching defs:nr_tasks
118 int nr_tasks;
517 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks);
593 if (t >= g->p.nr_tasks) {
620 if (t < g->p.nr_tasks)
621 printf("# NOTE: %d tasks bound, %d tasks unbound\n", t, g->p.nr_tasks - t);
654 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks);
715 if (t >= g->p.nr_tasks || !node_has_cpus(bind_node)) {
735 if (t < g->p.nr_tasks)
736 printf("# NOTE: %d tasks mem-bound, %d tasks unbound\n", t, g->p.nr_tasks - t);
1003 for (t = 0; t < g->p.nr_tasks; t++) {
1023 nr_min = g->p.nr_tasks;
1036 BUG_ON(sum > g->p.nr_tasks);
1038 if (0 && (sum < g->p.nr_tasks))
1153 if (g->nr_tasks_started == g->p.nr_tasks)
1363 g->p.nr_tasks, g->p.nr_tasks == 1 ? "task" : "tasks", nr_numa_nodes(), g->p.nr_cpus);
1378 ssize_t size = sizeof(*g->threads)*g->p.nr_tasks;
1383 for (t = 0; t < g->p.nr_tasks; t++) {
1399 ssize_t size = sizeof(*g->threads)*g->p.nr_tasks;
1449 g->p.nr_tasks = g->p.nr_proc*g->p.nr_threads;
1553 while (g->nr_tasks_started != g->p.nr_tasks)
1561 threads_ready = (g->nr_tasks_working == g->p.nr_tasks);
1601 for (t = 0; t < g->p.nr_tasks; t++) {
1623 runtime_avg = (double)runtime_ns_sum / g->p.nr_tasks / NSEC_PER_SEC;
1643 print_res(name, bytes / g->p.nr_tasks / 1e9,
1649 print_res(name, runtime_sec_max * NSEC_PER_SEC / (bytes / g->p.nr_tasks),
1652 print_res(name, bytes / g->p.nr_tasks / 1e9 / runtime_sec_max,