Home
last modified time | relevance | path

Searched refs:cfs (Results 1 – 7 of 7) sorted by relevance

/linux/Documentation/translations/zh_CN/scheduler/
H A Dsched-design-CFS.rst58 CFS同样维护了rq->cfs.min_vruntime值，它是单调递增的，跟踪运行队列中的所有任务的最小
62 运行队列中正在运行的任务的总数由rq->cfs.load计数，它是运行队列中的任务的权值之和。
/linux/drivers/pci/endpoint/
H A DMakefile6 obj-$(CONFIG_PCI_ENDPOINT_CONFIGFS) += pci-ep-cfs.o
/linux/kernel/sched/
H A Dfair.c491 for (cfs_rq = &rq->cfs, pos = NULL; cfs_rq; cfs_rq = pos)
2113 ns->nr_running += rq->cfs.h_nr_runnable; in update_numa_stats()
3950 if (&rq->cfs == cfs_rq) { in cfs_rq_util_change()
5458 rq_of(cfs_rq)->cfs.load.weight >= 2*se->load.weight) { in set_next_entity()
6028 if (rq->curr == rq->idle && rq->cfs.nr_queued) in unthrottle_cfs_rq()
6747 if (rq->cfs.h_nr_queued > 1) { in hrtick_start_fair()
6831 return unlikely(rq->nr_running == rq->cfs.h_nr_idle && in sched_idle_rq()
6884 int rq_h_nr_queued = rq->cfs.h_nr_queued; in enqueue_task_fair()
6897 util_est_enqueue(&rq->cfs, p); in enqueue_task_fair()
6965 if (!rq_h_nr_queued && rq->cfs.h_nr_queued) in enqueue_task_fair()
[all …]
H A Dpelt.h141 u32 util_sum = rq->cfs.avg.util_sum; in update_idle_rq_clock_pelt()
H A Dsched.h1149 struct cfs_rq cfs; member
1337 return container_of(cfs_rq, struct rq, cfs); in rq_of()
1638 return &task_rq(p)->cfs; in task_cfs_rq()
1646 return &rq->cfs; in cfs_rq_of()
2720 return rq->cfs.nr_queued > 0; in sched_fair_runnable()
H A Dcore.c1370 if (rq->cfs.h_nr_queued > 1) in sched_can_stop_tick()
5405 struct sched_entity *curr = task_rq(p)->cfs.curr; in prefetch_curr_exec_start()
5884 rq->nr_running == rq->cfs.h_nr_queued)) { in __pick_next_task()
8616 init_cfs_rq(&rq->cfs); in sched_init()
8641 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, NULL); in sched_init()
/linux/net/netfilter/
H A Dxt_set.c38 #define ADT_OPT(n, f, d, fs, cfs, t, p, b, po, bo) \ argument
43 .cmdflags = cfs, \