118 	int			nr_tasks;  member
500 	dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks);  in parse_setup_cpu_list()
576 				if (t >= g->p.nr_tasks) {  in parse_setup_cpu_list()
603 	if (t < g->p.nr_tasks)  in parse_setup_cpu_list()
604 		printf("# NOTE: %d tasks bound, %d tasks unbound\n", t, g->p.nr_tasks - t);  in parse_setup_cpu_list()
637 	dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks);  in parse_setup_node_list()
698 				if (t >= g->p.nr_tasks || !node_has_cpus(bind_node)) {  in parse_setup_node_list()
718 	if (t < g->p.nr_tasks)  in parse_setup_node_list()
719 		printf("# NOTE: %d tasks mem-bound, %d tasks unbound\n", t, g->p.nr_tasks - t);  in parse_setup_node_list()
989 	for (t = 0; t < g->p.nr_tasks; t++) {  in calc_convergence()
1009 	nr_min = g->p.nr_tasks;  in calc_convergence()
1022 	BUG_ON(sum > g->p.nr_tasks);  in calc_convergence()
1024 	if (0 && (sum < g->p.nr_tasks))  in calc_convergence()
1145 		if (g->nr_tasks_working == g->p.nr_tasks)  in worker_thread()
1346 		g->p.nr_tasks, g->p.nr_tasks == 1 ? "task" : "tasks", nr_numa_nodes(), g->p.nr_cpus);  in print_summary()
1361 	ssize_t size = sizeof(*g->threads)*g->p.nr_tasks;  in init_thread_data()
1366 	for (t = 0; t < g->p.nr_tasks; t++) {  in init_thread_data()
1382 	ssize_t size = sizeof(*g->threads)*g->p.nr_tasks;  in deinit_thread_data()
1432 	g->p.nr_tasks = g->p.nr_proc*g->p.nr_threads;  in init()
1529 	while (g->nr_tasks_started != g->p.nr_tasks)  in __bench_numa()
1532 	BUG_ON(g->nr_tasks_started != g->p.nr_tasks);  in __bench_numa()
1575 	for (t = 0; t < g->p.nr_tasks; t++) {  in __bench_numa()
1597 	runtime_avg = (double)runtime_ns_sum / g->p.nr_tasks / NSEC_PER_SEC;  in __bench_numa()
1617 	print_res(name, bytes / g->p.nr_tasks / 1e9,  in __bench_numa()
1623 	print_res(name, runtime_sec_max * NSEC_PER_SEC / (bytes / g->p.nr_tasks),  in __bench_numa()
1626 	print_res(name, bytes / g->p.nr_tasks / 1e9 / runtime_sec_max,  in __bench_numa()