Home
last modified time | relevance | path

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

/openbmc/linux/Documentation/translations/zh_CN/scheduler/
H A Dsched-design-CFS.rst58 CFS同样维护了rq->cfs.min_vruntime值，它是单调递增的，跟踪运行队列中的所有任务的最小
62 运行队列中正在运行的任务的总数由rq->cfs.load计数，它是运行队列中的任务的权值之和。
/openbmc/linux/drivers/pci/endpoint/
H A DMakefile6 obj-$(CONFIG_PCI_ENDPOINT_CONFIGFS) += pci-ep-cfs.o
/openbmc/linux/Documentation/PCI/endpoint/
H A Dindex.rst11 pci-endpoint-cfs
H A Dpci-endpoint.rst124 the EPF device with EPC device. pci-ep-cfs.c can be used as reference for
212 pci-ep-cfs.c can be used as reference for using these APIs.
/openbmc/linux/kernel/sched/
H A Dfair.c512 for (cfs_rq = &rq->cfs, pos = NULL; cfs_rq; cfs_rq = pos)
2090 ns->nr_running += rq->cfs.h_nr_running; in update_numa_stats()
4060 if (&rq->cfs == cfs_rq) { in cfs_rq_util_change()
5454 rq_of(cfs_rq)->cfs.load.weight >= 2*se->load.weight) { in set_next_entity()
5935 if (rq->curr == rq->idle && rq->cfs.nr_running) in unthrottle_cfs_rq()
6634 if (rq->cfs.h_nr_running > 1) { in hrtick_start_fair()
6717 return unlikely(rq->nr_running == rq->cfs.idle_h_nr_running && in sched_idle_rq()
6747 util_est_enqueue(&rq->cfs, p); in enqueue_task_fair()
6835 util_est_dequeue(&rq->cfs, p); in dequeue_task_fair()
6893 util_est_update(&rq->cfs, p, task_sleep); in dequeue_task_fair()
[all …]
H A Dpelt.h136 u32 util_sum = rq->cfs.avg.util_sum; in update_idle_rq_clock_pelt()
H A Dsched.h998 struct cfs_rq cfs; member
1184 return container_of(cfs_rq, struct rq, cfs); in rq_of()
1450 return &task_rq(p)->cfs; in task_cfs_rq()
1458 return &rq->cfs; in cfs_rq_of()
2366 return rq->cfs.nr_running > 0; in sched_fair_runnable()
H A Dcore.c5533 struct sched_entity *curr = (&task_rq(p)->cfs)->curr; in prefetch_curr_exec_start()
6003 rq->nr_running == rq->cfs.h_nr_running)) { in __pick_next_task()
7393 * cpu_util_{cfs,rt,dl,irq}()
7396 * Where the cfs,rt and dl util numbers are tracked with the same metric and
7399 * The cfs,rt,dl utilization are the running times measured with rq->clock_task
10007 init_cfs_rq(&rq->cfs); in sched_init()
10030 * directly in rq->cfs (i.e root_task_group->se[] = NULL). in sched_init()
10032 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, NULL); in sched_init()
/openbmc/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, \
/openbmc/linux/Documentation/scheduler/
H A Dsched-design-CFS.rst61 CFS also maintains the rq->cfs.min_vruntime value, which is a monotonic
68 rq->cfs.load value, which is the sum of the weights of the tasks queued on the
/openbmc/linux/
H A Dopengrok2.0.log[all...]
H A Dopengrok1.0.log[all...]
H A Dopengrok0.0.log[all...]