Home
last modified time | relevance | path

Searched refs:nr_tasks (Results 1 – 9 of 9) sorted by relevance

/linux/samples/bpf/
H A Dtest_lru_dist.c308 int nr_tasks, unsigned int lru_size) in test_parallel_lru_dist() argument
321 nr_tasks * lru_size); in test_parallel_lru_dist()
327 run_parallel(nr_tasks, do_test_lru_dist, child_data); in test_parallel_lru_dist()
465 static void test_parallel_lru_loss(int map_type, int map_flags, int nr_tasks) in test_parallel_lru_loss() argument
478 nr_tasks * (1000 + 200)); in test_parallel_lru_loss()
482 run_parallel(nr_tasks, do_test_parallel_lru_loss, &map_fd); in test_parallel_lru_loss()
491 int nr_tasks = 1; in main() local
503 nr_tasks = atoi(argv[3]); in main()
513 nr_tasks = min(nr_tasks, nr_cpus); in main()
525 nr_tasks); in main()
[all …]
/linux/tools/perf/bench/
H A Dnuma.c121 int nr_tasks; member
598 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks); in parse_setup_cpu_list()
680 if (t >= g->p.nr_tasks) { in parse_setup_cpu_list()
712 if (t < g->p.nr_tasks) in parse_setup_cpu_list()
713 printf("# NOTE: %d tasks bound, %d tasks unbound\n", t, g->p.nr_tasks - t); in parse_setup_cpu_list()
746 dprintf("g->p.nr_tasks: %d\n", g->p.nr_tasks); in parse_setup_node_list()
807 if (t >= g->p.nr_tasks || !node_has_cpus(bind_node)) { in parse_setup_node_list()
827 if (t < g->p.nr_tasks) in parse_setup_node_list()
828 printf("# NOTE: %d tasks mem-bound, %d tasks unbound\n", t, g->p.nr_tasks - t); in parse_setup_node_list()
1101 for (t = 0; t < g->p.nr_tasks; t++) { in calc_convergence()
[all …]
/linux/kernel/cgroup/
H A Ddebug.c55 if (refcnt > cset->nr_tasks) in current_css_set_read()
56 seq_printf(seq, " +%d", refcnt - cset->nr_tasks); in current_css_set_read()
145 if (refcnt - cset->nr_tasks > 0) { in cgroup_css_links_read()
146 int extra = refcnt - cset->nr_tasks; in cgroup_css_links_read()
181 WARN_ON(count != cset->nr_tasks); in cgroup_css_links_read()
H A Dcgroup-internal.h115 int nr_tasks; member
H A Dcgroup.c656 count += link->cset->nr_tasks; in __cgroup_task_count()
2612 mgctx->tset.nr_tasks++; in cgroup_migrate_add_task()
2703 if (tset->nr_tasks) { in cgroup_migrate_execute()
2728 to_cset->nr_tasks++; in cgroup_migrate_execute()
2730 from_cset->nr_tasks--; in cgroup_migrate_execute()
2750 if (tset->nr_tasks) { in cgroup_migrate_execute()
2763 if (tset->nr_tasks) { in cgroup_migrate_execute()
2787 tset->nr_tasks = 0; in cgroup_migrate_execute()
6912 cset->nr_tasks++; in cgroup_post_fork()
6992 cset->nr_tasks--; in cgroup_exit()
/linux/tools/perf/
H A Dbuiltin-sched.c168 unsigned long nr_tasks; member
466 task->nr = sched->nr_tasks; in register_pid()
475 sched->nr_tasks++; in register_pid()
476 sched->tasks = realloc(sched->tasks, sched->nr_tasks * sizeof(struct task_desc *)); in register_pid()
481 printf("registered task #%ld, PID %ld (%s)\n", sched->nr_tasks, pid, comm); in register_pid()
492 for (i = 0; i < sched->nr_tasks; i++) { in print_task_traces()
504 for (i = 0; i < sched->nr_tasks; i++) { in add_cross_task_wakeups()
507 if (j == sched->nr_tasks) in add_cross_task_wakeups()
574 limit.rlim_cur += sched->nr_tasks - cur_task; in self_open_counters()
669 for (i = 0; i < sched->nr_tasks; i++) { in create_tasks()
[all …]
/linux/include/linux/
H A Dcgroup-defs.h295 int nr_tasks; member
/linux/kernel/sched/
H A Dfair.c1453 int nr_tasks; member
3031 grp->nr_tasks++; in task_numa_group()
3053 if (my_grp->nr_tasks > grp->nr_tasks) in task_numa_group()
3059 if (my_grp->nr_tasks == grp->nr_tasks && my_grp > grp) in task_numa_group()
3091 my_grp->nr_tasks--; in task_numa_group()
3092 grp->nr_tasks++; in task_numa_group()
3131 grp->nr_tasks--; in task_numa_free()
H A Dext.c114 u32 nr_tasks; member
2023 dspc->nr_tasks += dspc->cursor; in flush_dispatch_buf()
2106 dspc->nr_tasks = 0; in balance_one()
2135 } while (dspc->nr_tasks); in balance_one()
5680 dspc->nr_tasks++; in scx_bpf_dsq_move_to_local()