Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:kernel\sched\fair.c Create Date:2022-07-28 09:38:27
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:place_entity

Proto:static void place_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int initial)

Type:void

Parameter:

TypeParameterName
struct cfs_rq *cfs_rq
struct sched_entity *se
intinitial
3895  vruntime = min_vruntime
3903  If initial && sched_feat(START_DEBIT) Then vruntime += We calculate the vruntime slice of a to-be-inserted task.* vs = s/w
3907  If Not initial Then
3908  thresh = Targeted preemption latency for CPU-bound tasks:* NOTE: this latency value is not the same as the concept of* 'timeslice length' - timeslices in CFS are of variable length* and have no persistent notion like in traditional, time-slice
3914  If sched_feat(GENTLE_FAIR_SLEEPERS) Then thresh >>= 1
3917  vruntime -= thresh
3921  vruntime = Scheduling class tree data structure manipulation methods:
Caller
NameDescribe
enqueue_entityMIGRATION* dequeue* update_curr()* update_min_vruntime()* vruntime -= min_vruntime* enqueue* update_curr()* update_min_vruntime()* vruntime += min_vruntime* this way the vruntime transition between RQs is done when both* min_vruntime are up-to-date
task_fork_fairalled on fork with the child task as argument from the parent's context* - child not yet on the tasklist* - preemption disabled
detach_task_cfs_rq