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()
517 if (t >= g->p.nr_tasks) { in parse_setup_cpu_list()
544 if (t < g->p.nr_tasks) in parse_setup_cpu_list()
545 printf("# NOTE: %d tasks bound, %d tasks unbound\n", t, g->p.nr_tasks - t); in parse_setup_cpu_list()
578 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks); in parse_setup_node_list()
639 if (t >= g->p.nr_tasks) { in parse_setup_node_list()
659 if (t < g->p.nr_tasks) in parse_setup_node_list()
660 printf("# NOTE: %d tasks mem-bound, %d tasks unbound\n", t, g->p.nr_tasks - t); in parse_setup_node_list()
930 for (t = 0; t < g->p.nr_tasks; t++) { in calc_convergence()
950 nr_min = g->p.nr_tasks; in calc_convergence()
961 BUG_ON(sum > g->p.nr_tasks); in calc_convergence()
963 if (0 && (sum < g->p.nr_tasks)) in calc_convergence()
1080 if (g->nr_tasks_working == g->p.nr_tasks) in worker_thread()
1273 g->p.nr_tasks, g->p.nr_tasks == 1 ? "task" : "tasks", g->p.nr_nodes, g->p.nr_cpus); in print_summary()
1288 ssize_t size = sizeof(*g->threads)*g->p.nr_tasks; in init_thread_data()
1293 for (t = 0; t < g->p.nr_tasks; t++) { in init_thread_data()
1309 ssize_t size = sizeof(*g->threads)*g->p.nr_tasks; in deinit_thread_data()
1359 g->p.nr_tasks = g->p.nr_proc*g->p.nr_threads; in init()
1456 while (g->nr_tasks_started != g->p.nr_tasks) in __bench_numa()
1459 BUG_ON(g->nr_tasks_started != g->p.nr_tasks); in __bench_numa()
1502 for (t = 0; t < g->p.nr_tasks; t++) { in __bench_numa()
1524 runtime_avg = (double)runtime_ns_sum / g->p.nr_tasks / 1e9; in __bench_numa()
1544 print_res(name, bytes / g->p.nr_tasks / 1e9, in __bench_numa()
1550 print_res(name, runtime_sec_max * 1e9 / (bytes / g->p.nr_tasks), in __bench_numa()
1553 print_res(name, bytes / g->p.nr_tasks / 1e9 / runtime_sec_max, in __bench_numa()