/linux/drivers/gpu/drm/xe/ |
H A D | xe_gt_sriov_pf_config.c | 621 u64 fair; in pf_estimate_fair_ggtt() local 631 fair = div_u64(available, num_vfs); in pf_estimate_fair_ggtt() 632 fair = ALIGN_DOWN(fair, alignment); in pf_estimate_fair_ggtt() 634 available / SZ_1K, num_vfs, fair / SZ_1K); in pf_estimate_fair_ggtt() 635 return fair; in pf_estimate_fair_ggtt() 651 u64 fair; in xe_gt_sriov_pf_config_set_fair_ggtt() local 658 fair = pf_estimate_fair_ggtt(gt, num_vfs); in xe_gt_sriov_pf_config_set_fair_ggtt() 661 if (!fair) in xe_gt_sriov_pf_config_set_fair_ggtt() 664 return xe_gt_sriov_pf_config_bulk_set_ggtt(gt, vfid, num_vfs, fair); in xe_gt_sriov_pf_config_set_fair_ggtt() 923 u32 fair = (idm->total - spare) / num_vfs; in pf_estimate_fair_ctxs() local [all …]
|
/linux/net/dccp/ccids/ |
H A D | Kconfig | 20 be reasonably fair when competing for bandwidth with TCP-like flows, 21 where a flow is "reasonably fair" if its sending rate is generally
|
/linux/Documentation/ABI/testing/ |
H A D | sysfs-class-bdi | 71 be trusted to play fair. 84 which cannot be trusted to play fair. 112 trusted to play fair, or a nbd device.
|
/linux/kernel/sched/ |
H A D | Makefile | 32 obj-y += fair.o
|
/linux/Documentation/scheduler/ |
H A D | sched-design-CFS.rst | 159 sched/fair.c implements the CFS scheduler described above. 216 fair CPU time to each task. Sometimes, it may be desirable to group tasks and 217 provide fair CPU time to each such task group. For example, it may be 218 desirable to first provide fair CPU time to each user on the system and then to
|
H A D | sched-eevdf.rst | 16 whether a task has received its fair share of CPU time. In this way, a task
|
H A D | schedutil.rst | 108 For more detail see: kernel/sched/fair.c:util_est_dequeue()
|
/linux/Documentation/translations/zh_CN/scheduler/ |
H A D | schedutil.rst | 106 更多细节见: kernel/sched/fair.c:util_est_dequeue()
|
H A D | sched-design-CFS.rst | 125 sched/fair.c 实现了上文描述的CFS调度器。
|
/linux/Documentation/driver-api/ |
H A D | basics.rst | 30 .. kernel-doc:: kernel/sched/fair.c
|
/linux/Documentation/process/ |
H A D | code-of-conduct.rst | 45 and are expected to take appropriate and fair corrective action in response to
|
/linux/Documentation/core-api/ |
H A D | genalloc.rst | 101 naturally, write a special-purpose algorithm, but there is a fair set
|
/linux/Documentation/locking/ |
H A D | locktypes.rst | 137 On non-PREEMPT_RT kernels the implementation is fair, thus preventing 302 suffix rules of spinlock_t apply accordingly. The implementation is fair,
|
H A D | pi-futex.rst | 53 apps have a very fair expectation of being able to use locks, we've got
|
H A D | mutex-design.rst | 53 with the desirable properties of being fair and with each cpu trying
|
/linux/Documentation/arch/arm/ |
H A D | vlocks.rst | 85 * vlocks are not intended to be fair. In the contended case, it is the
|
/linux/Documentation/admin-guide/sysctl/ |
H A D | net.rst | 172 fair queue (sfq), CoDel (codel) or fair queue CoDel (fq_codel). Don't use
|
/linux/Documentation/block/ |
H A D | biovecs.rst | 66 - again, this was being done in a fair number of places.
|
/linux/LICENSES/dual/ |
H A D | CC-BY-4.0 | 113 e. Exceptions and Limitations means fair use, fair dealing, and/or
|
/linux/Documentation/fb/ |
H A D | modedb.rst | 11 - one generic video mode database with a fair amount of standard videomodes
|
/linux/Documentation/ |
H A D | atomic_t.txt | 322 a fair amount of code also requires forward progress from the conditional
|
/linux/Documentation/admin-guide/media/ |
H A D | dvb_intro.rst | 39 frames per second - a fair amount of data is generated and must be
|
/linux/Documentation/trace/ |
H A D | tracepoint-analysis.rst | 34 will give a fair indication of the number of events available.
|
/linux/Documentation/networking/ |
H A D | eql.rst | 43 I suggest to ISPs out there that it would probably be fair to charge
|
/linux/mm/ |
H A D | Kconfig.debug | 117 a fair amount of memory if enabled. See tools/mm/page_owner_sort.c
|