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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
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
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
|
#include <linux/percpu.h>
#include <linux/slab.h>
#include <asm/uaccess.h>
#include <litmus/sched_plugin.h>
#include <litmus/preempt.h>
#include <litmus/debug_trace.h>
#include <litmus/litmus.h>
#include <litmus/jobs.h>
#include <litmus/budget.h>
#include <litmus/litmus_proc.h>
#include <litmus/reservation.h>
#include <litmus/polling_reservations.h>
struct pres_task_state {
struct task_client res_info;
int cpu;
};
struct pres_cpu_state {
raw_spinlock_t lock;
struct sup_reservation_environment sup_env;
struct hrtimer timer;
int cpu;
struct task_struct* scheduled;
};
static DEFINE_PER_CPU(struct pres_cpu_state, pres_cpu_state);
#define cpu_state_for(cpu_id) (&per_cpu(pres_cpu_state, cpu_id))
#define local_cpu_state() (&__get_cpu_var(pres_cpu_state))
static struct pres_task_state* get_pres_state(struct task_struct *tsk)
{
return (struct pres_task_state*) tsk_rt(tsk)->plugin_state;
}
static void task_departs(struct task_struct *tsk, int job_complete)
{
struct pres_task_state* state = get_pres_state(tsk);
struct reservation* res;
struct reservation_client *client;
res = state->res_info.client.reservation;
client = &state->res_info.client;
res->ops->client_departs(res, client, job_complete);
}
static void task_arrives(struct task_struct *tsk)
{
struct pres_task_state* state = get_pres_state(tsk);
struct reservation* res;
struct reservation_client *client;
res = state->res_info.client.reservation;
client = &state->res_info.client;
res->ops->client_arrives(res, client);
}
/* NOTE: drops state->lock */
static void pres_update_timer_and_unlock(struct pres_cpu_state *state)
{
int local;
lt_t update, now;
update = state->sup_env.next_scheduler_update;
now = state->sup_env.env.current_time;
/* Be sure we're actually running on the right core,
* as pres_update_timer() is also called from pres_task_resume(),
* which might be called on any CPU when a thread resumes.
*/
local = local_cpu_state() == state;
/* Must drop state lock before calling into hrtimer_start(), which
* may raise a softirq, which in turn may wake ksoftirqd. */
raw_spin_unlock(&state->lock);
if (update <= now) {
litmus_reschedule(state->cpu);
} else if (likely(local && update != SUP_NO_SCHEDULER_UPDATE)) {
/* Reprogram only if not already set correctly. */
if (!hrtimer_active(&state->timer) ||
ktime_to_ns(hrtimer_get_expires(&state->timer)) != update) {
TRACE("canceling timer...\n");
hrtimer_cancel(&state->timer);
TRACE("setting scheduler timer for %llu\n", update);
/* We cannot use hrtimer_start() here because the
* wakeup flag must be set to zero. */
__hrtimer_start_range_ns(&state->timer,
ns_to_ktime(update),
0 /* timer coalescing slack */,
HRTIMER_MODE_ABS_PINNED,
0 /* wakeup */);
}
} else if (unlikely(!local && update != SUP_NO_SCHEDULER_UPDATE)) {
/* Poke remote core only if timer needs to be set earlier than
* it is currently set.
*/
TRACE("pres_update_timer for remote CPU %d (update=%llu, "
"active:%d, set:%llu)\n",
state->cpu,
update,
hrtimer_active(&state->timer),
ktime_to_ns(hrtimer_get_expires(&state->timer)));
if (!hrtimer_active(&state->timer) ||
ktime_to_ns(hrtimer_get_expires(&state->timer)) > update) {
TRACE("poking CPU %d so that it can update its "
"scheduling timer (active:%d, set:%llu)\n",
state->cpu,
hrtimer_active(&state->timer),
ktime_to_ns(hrtimer_get_expires(&state->timer)));
litmus_reschedule(state->cpu);
}
}
}
static enum hrtimer_restart on_scheduling_timer(struct hrtimer *timer)
{
unsigned long flags;
enum hrtimer_restart restart = HRTIMER_NORESTART;
struct pres_cpu_state *state;
lt_t update, now;
state = container_of(timer, struct pres_cpu_state, timer);
/* The scheduling timer should only fire on the local CPU, because
* otherwise deadlocks via timer_cancel() are possible.
* Note: this does not interfere with dedicated interrupt handling, as
* even under dedicated interrupt handling scheduling timers for
* budget enforcement must occur locally on each CPU.
*/
BUG_ON(state->cpu != raw_smp_processor_id());
raw_spin_lock_irqsave(&state->lock, flags);
sup_update_time(&state->sup_env, litmus_clock());
update = state->sup_env.next_scheduler_update;
now = state->sup_env.env.current_time;
TRACE_CUR("on_scheduling_timer at %llu, upd:%llu (for cpu=%d)\n",
now, update, state->cpu);
if (update <= now) {
litmus_reschedule_local();
} else if (update != SUP_NO_SCHEDULER_UPDATE) {
hrtimer_set_expires(timer, ns_to_ktime(update));
restart = HRTIMER_RESTART;
}
raw_spin_unlock_irqrestore(&state->lock, flags);
return restart;
}
static struct task_struct* pres_schedule(struct task_struct * prev)
{
/* next == NULL means "schedule background work". */
struct pres_cpu_state *state = local_cpu_state();
raw_spin_lock(&state->lock);
BUG_ON(state->scheduled && state->scheduled != prev);
BUG_ON(state->scheduled && !is_realtime(prev));
/* update time */
state->sup_env.will_schedule = true;
sup_update_time(&state->sup_env, litmus_clock());
/* remove task from reservation if it blocks */
if (is_realtime(prev) && !is_running(prev))
task_departs(prev, is_completed(prev));
/* figure out what to schedule next */
state->scheduled = sup_dispatch(&state->sup_env);
/* Notify LITMUS^RT core that we've arrived at a scheduling decision. */
sched_state_task_picked();
/* program scheduler timer */
state->sup_env.will_schedule = false;
/* NOTE: drops state->lock */
pres_update_timer_and_unlock(state);
if (prev != state->scheduled && is_realtime(prev))
TRACE_TASK(prev, "descheduled.\n");
if (state->scheduled)
TRACE_TASK(state->scheduled, "scheduled.\n");
return state->scheduled;
}
static void resume_legacy_task_model_updates(struct task_struct *tsk)
{
lt_t now;
if (is_sporadic(tsk)) {
/* If this sporadic task was gone for a "long" time and woke up past
* its deadline, then give it a new budget by triggering a job
* release. This is purely cosmetic and has no effect on the
* P-RES scheduler. */
now = litmus_clock();
if (is_tardy(tsk, now))
release_at(tsk, now);
}
}
/* Called when the state of tsk changes back to TASK_RUNNING.
* We need to requeue the task.
*/
static void pres_task_resume(struct task_struct *tsk)
{
unsigned long flags;
struct pres_task_state* tinfo = get_pres_state(tsk);
struct pres_cpu_state *state = cpu_state_for(tinfo->cpu);
TRACE_TASK(tsk, "thread wakes up at %llu\n", litmus_clock());
raw_spin_lock_irqsave(&state->lock, flags);
/* Requeue if self-suspension was already processed. */
if (state->scheduled != tsk)
{
/* Assumption: litmus_clock() is synchronized across cores,
* since we might not actually be executing on tinfo->cpu
* at the moment. */
sup_update_time(&state->sup_env, litmus_clock());
task_arrives(tsk);
/* NOTE: drops state->lock */
pres_update_timer_and_unlock(state);
local_irq_restore(flags);
} else
raw_spin_unlock_irqrestore(&state->lock, flags);
resume_legacy_task_model_updates(tsk);
}
/* syscall backend for job completions */
static long pres_complete_job(void)
{
ktime_t next_release;
long err;
TRACE_CUR("pres_complete_job at %llu\n", litmus_clock());
tsk_rt(current)->completed = 1;
prepare_for_next_period(current);
next_release = ns_to_ktime(get_release(current));
set_current_state(TASK_INTERRUPTIBLE);
err = schedule_hrtimeout(&next_release, HRTIMER_MODE_ABS);
TRACE_CUR("pres_complete_job returns at %llu\n", litmus_clock());
return err;
}
static long pres_admit_task(struct task_struct *tsk)
{
long err = -ESRCH;
unsigned long flags;
struct reservation *res;
struct pres_cpu_state *state;
struct pres_task_state *tinfo = kzalloc(sizeof(*tinfo), GFP_ATOMIC);
if (!tinfo)
return -ENOMEM;
preempt_disable();
state = cpu_state_for(task_cpu(tsk));
raw_spin_lock_irqsave(&state->lock, flags);
res = sup_find_by_id(&state->sup_env, tsk_rt(tsk)->task_params.cpu);
/* found the appropriate reservation (or vCPU) */
if (res) {
task_client_init(&tinfo->res_info, tsk, res);
tinfo->cpu = task_cpu(tsk);
tsk_rt(tsk)->plugin_state = tinfo;
err = 0;
}
raw_spin_unlock_irqrestore(&state->lock, flags);
preempt_enable();
if (err)
kfree(tinfo);
return err;
}
static void task_new_legacy_task_model_updates(struct task_struct *tsk)
{
lt_t now = litmus_clock();
/* the first job exists starting as of right now */
release_at(tsk, now);
}
static void pres_task_new(struct task_struct *tsk, int on_runqueue,
int is_running)
{
unsigned long flags;
struct pres_task_state* tinfo = get_pres_state(tsk);
struct pres_cpu_state *state = cpu_state_for(tinfo->cpu);
TRACE_TASK(tsk, "new RT task %llu (on_rq:%d, running:%d)\n",
litmus_clock(), on_runqueue, is_running);
/* acquire the lock protecting the state and disable interrupts */
raw_spin_lock_irqsave(&state->lock, flags);
if (is_running) {
state->scheduled = tsk;
/* make sure this task should actually be running */
litmus_reschedule_local();
}
if (on_runqueue || is_running) {
/* Assumption: litmus_clock() is synchronized across cores
* [see comment in pres_task_resume()] */
sup_update_time(&state->sup_env, litmus_clock());
task_arrives(tsk);
/* NOTE: drops state->lock */
pres_update_timer_and_unlock(state);
local_irq_restore(flags);
} else
raw_spin_unlock_irqrestore(&state->lock, flags);
task_new_legacy_task_model_updates(tsk);
}
static void pres_task_exit(struct task_struct *tsk)
{
unsigned long flags;
struct pres_task_state* tinfo = get_pres_state(tsk);
struct pres_cpu_state *state = cpu_state_for(tinfo->cpu);
raw_spin_lock_irqsave(&state->lock, flags);
if (state->scheduled == tsk)
state->scheduled = NULL;
/* remove from queues */
if (is_running(tsk)) {
/* Assumption: litmus_clock() is synchronized across cores
* [see comment in pres_task_resume()] */
sup_update_time(&state->sup_env, litmus_clock());
task_departs(tsk, 0);
/* NOTE: drops state->lock */
pres_update_timer_and_unlock(state);
local_irq_restore(flags);
} else
raw_spin_unlock_irqrestore(&state->lock, flags);
kfree(tsk_rt(tsk)->plugin_state);
tsk_rt(tsk)->plugin_state = NULL;
}
static long create_polling_reservation(
int res_type,
struct reservation_config *config)
{
struct pres_cpu_state *state;
struct reservation* res;
struct polling_reservation *pres;
unsigned long flags;
int use_edf = config->priority == LITMUS_NO_PRIORITY;
int periodic = res_type == PERIODIC_POLLING;
long err = -EINVAL;
if (config->polling_params.budget >
config->polling_params.period) {
printk(KERN_ERR "invalid polling reservation (%u): "
"budget > period\n", config->id);
return -EINVAL;
}
if (config->polling_params.budget >
config->polling_params.relative_deadline
&& config->polling_params.relative_deadline) {
printk(KERN_ERR "invalid polling reservation (%u): "
"budget > deadline\n", config->id);
return -EINVAL;
}
if (config->polling_params.offset >
config->polling_params.period) {
printk(KERN_ERR "invalid polling reservation (%u): "
"offset > period\n", config->id);
return -EINVAL;
}
/* Allocate before we grab a spin lock.
* Todo: would be nice to use a core-local allocation.
*/
pres = kzalloc(sizeof(*pres), GFP_KERNEL);
if (!pres)
return -ENOMEM;
state = cpu_state_for(config->cpu);
raw_spin_lock_irqsave(&state->lock, flags);
res = sup_find_by_id(&state->sup_env, config->id);
if (!res) {
polling_reservation_init(pres, use_edf, periodic,
config->polling_params.budget,
config->polling_params.period,
config->polling_params.relative_deadline,
config->polling_params.offset);
pres->res.id = config->id;
if (!use_edf)
pres->res.priority = config->priority;
sup_add_new_reservation(&state->sup_env, &pres->res);
err = config->id;
} else {
err = -EEXIST;
}
raw_spin_unlock_irqrestore(&state->lock, flags);
if (err < 0)
kfree(pres);
return err;
}
#define MAX_INTERVALS 1024
static long create_table_driven_reservation(
struct reservation_config *config)
{
struct pres_cpu_state *state;
struct reservation* res;
struct table_driven_reservation *td_res = NULL;
struct lt_interval *slots = NULL;
size_t slots_size;
unsigned int i, num_slots;
unsigned long flags;
long err = -EINVAL;
if (!config->table_driven_params.num_intervals) {
printk(KERN_ERR "invalid table-driven reservation (%u): "
"no intervals\n", config->id);
return -EINVAL;
}
if (config->table_driven_params.num_intervals > MAX_INTERVALS) {
printk(KERN_ERR "invalid table-driven reservation (%u): "
"too many intervals (max: %d)\n", config->id, MAX_INTERVALS);
return -EINVAL;
}
num_slots = config->table_driven_params.num_intervals;
slots_size = sizeof(slots[0]) * num_slots;
slots = kzalloc(slots_size, GFP_KERNEL);
if (!slots)
return -ENOMEM;
td_res = kzalloc(sizeof(*td_res), GFP_KERNEL);
if (!td_res)
err = -ENOMEM;
else
err = copy_from_user(slots,
config->table_driven_params.intervals, slots_size);
if (!err) {
/* sanity checks */
for (i = 0; !err && i < num_slots; i++)
if (slots[i].end <= slots[i].start) {
printk(KERN_ERR
"invalid table-driven reservation (%u): "
"invalid interval %u => [%llu, %llu]\n",
config->id, i,
slots[i].start, slots[i].end);
err = -EINVAL;
}
for (i = 0; !err && i + 1 < num_slots; i++)
if (slots[i + 1].start <= slots[i].end) {
printk(KERN_ERR
"invalid table-driven reservation (%u): "
"overlapping intervals %u, %u\n",
config->id, i, i + 1);
err = -EINVAL;
}
if (slots[num_slots - 1].end >
config->table_driven_params.major_cycle_length) {
printk(KERN_ERR
"invalid table-driven reservation (%u): last "
"interval ends past major cycle %llu > %llu\n",
config->id,
slots[num_slots - 1].end,
config->table_driven_params.major_cycle_length);
err = -EINVAL;
}
}
if (!err) {
state = cpu_state_for(config->cpu);
raw_spin_lock_irqsave(&state->lock, flags);
res = sup_find_by_id(&state->sup_env, config->id);
if (!res) {
table_driven_reservation_init(td_res,
config->table_driven_params.major_cycle_length,
slots, num_slots);
td_res->res.id = config->id;
td_res->res.priority = config->priority;
sup_add_new_reservation(&state->sup_env, &td_res->res);
err = config->id;
} else {
err = -EEXIST;
}
raw_spin_unlock_irqrestore(&state->lock, flags);
}
if (err < 0) {
kfree(slots);
kfree(td_res);
}
return err;
}
static long pres_reservation_create(int res_type, void* __user _config)
{
long ret = -EINVAL;
struct reservation_config config;
TRACE("Attempt to create reservation (%d)\n", res_type);
if (copy_from_user(&config, _config, sizeof(config)))
return -EFAULT;
if (config.cpu < 0 || !cpu_online(config.cpu)) {
printk(KERN_ERR "invalid polling reservation (%u): "
"CPU %d offline\n", config.id, config.cpu);
return -EINVAL;
}
switch (res_type) {
case PERIODIC_POLLING:
case SPORADIC_POLLING:
ret = create_polling_reservation(res_type, &config);
break;
case TABLE_DRIVEN:
ret = create_table_driven_reservation(&config);
break;
default:
return -EINVAL;
};
return ret;
}
static struct domain_proc_info pres_domain_proc_info;
static long pres_get_domain_proc_info(struct domain_proc_info **ret)
{
*ret = &pres_domain_proc_info;
return 0;
}
static void pres_setup_domain_proc(void)
{
int i, cpu;
int num_rt_cpus = num_online_cpus();
struct cd_mapping *cpu_map, *domain_map;
memset(&pres_domain_proc_info, sizeof(pres_domain_proc_info), 0);
init_domain_proc_info(&pres_domain_proc_info, num_rt_cpus, num_rt_cpus);
pres_domain_proc_info.num_cpus = num_rt_cpus;
pres_domain_proc_info.num_domains = num_rt_cpus;
i = 0;
for_each_online_cpu(cpu) {
cpu_map = &pres_domain_proc_info.cpu_to_domains[i];
domain_map = &pres_domain_proc_info.domain_to_cpus[i];
cpu_map->id = cpu;
domain_map->id = i;
cpumask_set_cpu(i, cpu_map->mask);
cpumask_set_cpu(cpu, domain_map->mask);
++i;
}
}
static long pres_activate_plugin(void)
{
int cpu;
struct pres_cpu_state *state;
for_each_online_cpu(cpu) {
TRACE("Initializing CPU%d...\n", cpu);
state = cpu_state_for(cpu);
raw_spin_lock_init(&state->lock);
state->cpu = cpu;
state->scheduled = NULL;
sup_init(&state->sup_env);
hrtimer_init(&state->timer, CLOCK_MONOTONIC, HRTIMER_MODE_ABS_PINNED);
state->timer.function = on_scheduling_timer;
}
pres_setup_domain_proc();
return 0;
}
static long pres_deactivate_plugin(void)
{
int cpu;
struct pres_cpu_state *state;
struct reservation *res;
for_each_online_cpu(cpu) {
state = cpu_state_for(cpu);
raw_spin_lock(&state->lock);
hrtimer_cancel(&state->timer);
/* Delete all reservations --- assumes struct reservation
* is prefix of containing struct. */
while (!list_empty(&state->sup_env.active_reservations)) {
res = list_first_entry(
&state->sup_env.active_reservations,
struct reservation, list);
list_del(&res->list);
kfree(res);
}
while (!list_empty(&state->sup_env.inactive_reservations)) {
res = list_first_entry(
&state->sup_env.inactive_reservations,
struct reservation, list);
list_del(&res->list);
kfree(res);
}
while (!list_empty(&state->sup_env.depleted_reservations)) {
res = list_first_entry(
&state->sup_env.depleted_reservations,
struct reservation, list);
list_del(&res->list);
kfree(res);
}
raw_spin_unlock(&state->lock);
}
destroy_domain_proc_info(&pres_domain_proc_info);
return 0;
}
static struct sched_plugin pres_plugin = {
.plugin_name = "P-RES",
.schedule = pres_schedule,
.task_wake_up = pres_task_resume,
.admit_task = pres_admit_task,
.task_new = pres_task_new,
.task_exit = pres_task_exit,
.complete_job = pres_complete_job,
.get_domain_proc_info = pres_get_domain_proc_info,
.activate_plugin = pres_activate_plugin,
.deactivate_plugin = pres_deactivate_plugin,
.reservation_create = pres_reservation_create,
};
static int __init init_pres(void)
{
return register_sched_plugin(&pres_plugin);
}
module_init(init_pres);
|