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