Skip to content
Navigation Menu
Toggle navigation
Sign in
In this repository
All GitHub Enterprise
↵
Jump to
↵
No suggested jump to results
In this repository
All GitHub Enterprise
↵
Jump to
↵
In this organization
All GitHub Enterprise
↵
Jump to
↵
In this repository
All GitHub Enterprise
↵
Jump to
↵
Sign in
Reseting focus
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
mariux64
/
linux
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
2
Pull requests
0
Actions
Projects
0
Wiki
Security
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Wiki
Security
Insights
Files
cad60d9
Documentation
arch
block
crypto
drivers
fs
include
init
ipc
kernel
irq
power
time
.gitignore
Kconfig.hz
Kconfig.preempt
Makefile
acct.c
audit.c
audit.h
auditfilter.c
auditsc.c
capability.c
compat.c
configs.c
cpu.c
cpuset.c
delayacct.c
die_notifier.c
dma.c
exec_domain.c
exit.c
extable.c
fork.c
futex.c
futex_compat.c
hrtimer.c
itimer.c
kallsyms.c
kexec.c
kfifo.c
kmod.c
kprobes.c
ksysfs.c
kthread.c
latency.c
lockdep.c
lockdep_internals.h
lockdep_proc.c
module.c
mutex-debug.c
mutex-debug.h
mutex.c
mutex.h
nsproxy.c
panic.c
params.c
pid.c
posix-cpu-timers.c
posix-timers.c
printk.c
profile.c
ptrace.c
rcupdate.c
rcutorture.c
relay.c
resource.c
rtmutex-debug.c
rtmutex-debug.h
rtmutex-tester.c
rtmutex.c
rtmutex.h
rtmutex_common.h
rwsem.c
sched.c
sched_debug.c
sched_fair.c
sched_idletask.c
sched_rt.c
sched_stats.h
seccomp.c
signal.c
softirq.c
softlockup.c
spinlock.c
srcu.c
stacktrace.c
stop_machine.c
sys.c
sys_ni.c
sysctl.c
taskstats.c
time.c
timer.c
tsacct.c
uid16.c
user.c
user_namespace.c
utsname.c
utsname_sysctl.c
wait.c
workqueue.c
lib
mm
net
scripts
security
sound
usr
.gitignore
.mailmap
COPYING
CREDITS
Kbuild
MAINTAINERS
Makefile
README
REPORTING-BUGS
Breadcrumbs
linux
/
kernel
/
sched_rt.c
Blame
Blame
Latest commit
History
History
245 lines (194 loc) · 5.77 KB
Breadcrumbs
linux
/
kernel
/
sched_rt.c
Top
File metadata and controls
Code
Blame
245 lines (194 loc) · 5.77 KB
Raw
/* * Real-Time Scheduling Class (mapped to the SCHED_FIFO and SCHED_RR * policies) */ /* * Update the current task's runtime statistics. Skip current tasks that * are not in our scheduling class. */ static inline void update_curr_rt(struct rq *rq, u64 now) { struct task_struct *curr = rq->curr; u64 delta_exec; if (!task_has_rt_policy(curr)) return; delta_exec = now - curr->se.exec_start; if (unlikely((s64)delta_exec < 0)) delta_exec = 0; if (unlikely(delta_exec > curr->se.exec_max)) curr->se.exec_max = delta_exec; curr->se.sum_exec_runtime += delta_exec; curr->se.exec_start = now; } static void enqueue_task_rt(struct rq *rq, struct task_struct *p, int wakeup, u64 now) { struct rt_prio_array *array = &rq->rt.active; list_add_tail(&p->run_list, array->queue + p->prio); __set_bit(p->prio, array->bitmap); } /* * Adding/removing a task to/from a priority array: */ static void dequeue_task_rt(struct rq *rq, struct task_struct *p, int sleep, u64 now) { struct rt_prio_array *array = &rq->rt.active; update_curr_rt(rq, now); list_del(&p->run_list); if (list_empty(array->queue + p->prio)) __clear_bit(p->prio, array->bitmap); } /* * Put task to the end of the run list without the overhead of dequeue * followed by enqueue. */ static void requeue_task_rt(struct rq *rq, struct task_struct *p) { struct rt_prio_array *array = &rq->rt.active; list_move_tail(&p->run_list, array->queue + p->prio); } static void yield_task_rt(struct rq *rq, struct task_struct *p) { requeue_task_rt(rq, p); } /* * Preempt the current task with a newly woken task if needed: */ static void check_preempt_curr_rt(struct rq *rq, struct task_struct *p) { if (p->prio < rq->curr->prio) resched_task(rq->curr); } static struct task_struct *pick_next_task_rt(struct rq *rq, u64 now) { struct rt_prio_array *array = &rq->rt.active; struct task_struct *next; struct list_head *queue; int idx; idx = sched_find_first_bit(array->bitmap); if (idx >= MAX_RT_PRIO) return NULL; queue = array->queue + idx; next = list_entry(queue->next, struct task_struct, run_list); next->se.exec_start = now; return next; } static void put_prev_task_rt(struct rq *rq, struct task_struct *p, u64 now) { update_curr_rt(rq, now); p->se.exec_start = 0; } /* * Load-balancing iterator. Note: while the runqueue stays locked * during the whole iteration, the current task might be * dequeued so the iterator has to be dequeue-safe. Here we * achieve that by always pre-iterating before returning * the current task: */ static struct task_struct *load_balance_start_rt(void *arg) { struct rq *rq = arg; struct rt_prio_array *array = &rq->rt.active; struct list_head *head, *curr; struct task_struct *p; int idx; idx = sched_find_first_bit(array->bitmap); if (idx >= MAX_RT_PRIO) return NULL; head = array->queue + idx; curr = head->prev; p = list_entry(curr, struct task_struct, run_list); curr = curr->prev; rq->rt.rt_load_balance_idx = idx; rq->rt.rt_load_balance_head = head; rq->rt.rt_load_balance_curr = curr; return p; } static struct task_struct *load_balance_next_rt(void *arg) { struct rq *rq = arg; struct rt_prio_array *array = &rq->rt.active; struct list_head *head, *curr; struct task_struct *p; int idx; idx = rq->rt.rt_load_balance_idx; head = rq->rt.rt_load_balance_head; curr = rq->rt.rt_load_balance_curr; /* * If we arrived back to the head again then * iterate to the next queue (if any): */ if (unlikely(head == curr)) { int next_idx = find_next_bit(array->bitmap, MAX_RT_PRIO, idx+1); if (next_idx >= MAX_RT_PRIO) return NULL; idx = next_idx; head = array->queue + idx; curr = head->prev; rq->rt.rt_load_balance_idx = idx; rq->rt.rt_load_balance_head = head; } p = list_entry(curr, struct task_struct, run_list); curr = curr->prev; rq->rt.rt_load_balance_curr = curr; return p; } static int load_balance_rt(struct rq *this_rq, int this_cpu, struct rq *busiest, unsigned long max_nr_move, unsigned long max_load_move, struct sched_domain *sd, enum cpu_idle_type idle, int *all_pinned, unsigned long *load_moved) { int this_best_prio, best_prio, best_prio_seen = 0; int nr_moved; struct rq_iterator rt_rq_iterator; best_prio = sched_find_first_bit(busiest->rt.active.bitmap); this_best_prio = sched_find_first_bit(this_rq->rt.active.bitmap); /* * Enable handling of the case where there is more than one task * with the best priority. If the current running task is one * of those with prio==best_prio we know it won't be moved * and therefore it's safe to override the skip (based on load) * of any task we find with that prio. */ if (busiest->curr->prio == best_prio) best_prio_seen = 1; rt_rq_iterator.start = load_balance_start_rt; rt_rq_iterator.next = load_balance_next_rt; /* pass 'busiest' rq argument into * load_balance_[start|next]_rt iterators */ rt_rq_iterator.arg = busiest; nr_moved = balance_tasks(this_rq, this_cpu, busiest, max_nr_move, max_load_move, sd, idle, all_pinned, load_moved, this_best_prio, best_prio, best_prio_seen, &rt_rq_iterator); return nr_moved; } static void task_tick_rt(struct rq *rq, struct task_struct *p) { /* * RR tasks need a special form of timeslice management. * FIFO tasks have no timeslices. */ if (p->policy != SCHED_RR) return; if (--p->time_slice) return; p->time_slice = static_prio_timeslice(p->static_prio); set_tsk_need_resched(p); /* put it at the end of the queue: */ requeue_task_rt(rq, p); } static struct sched_class rt_sched_class __read_mostly = { .enqueue_task = enqueue_task_rt, .dequeue_task = dequeue_task_rt, .yield_task = yield_task_rt, .check_preempt_curr = check_preempt_curr_rt, .pick_next_task = pick_next_task_rt, .put_prev_task = put_prev_task_rt, .load_balance = load_balance_rt, .task_tick = task_tick_rt, };
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
You can’t perform that action at this time.