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