litmus/jobs.c


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

/* litmus/jobs.c - common job control code
 */

#include <linux/sched.h>

#include <litmus/litmus.h>
#include <litmus/jobs.h>
#include <litmus/trace.h>

static inline void setup_release(struct task_struct *t, lt_t release)
{
	/* prepare next release */
	tsk_rt(t)->job_params.release   = release;
	tsk_rt(t)->job_params.deadline += release + get_rt_period(t);
	tsk_rt(t)->job_params.exec_time = 0;
	/* update job sequence number */
	tsk_rt(t)->job_params.job_no++;

	/* don't confuse Linux */
	t->rt.time_slice = 1;
}

void prepare_for_next_period(struct task_struct *t)
{
	BUG_ON(!t);

	/* Record lateness before we set up the next job's
	 * release and deadline. Lateness may be negative.
	 */
	t->rt_param.job_params.lateness =
		(long long)litmus_clock() - 
		(long long)t->rt_param.job_params.deadline;

	setup_release(t, get_release(t) + get_rt_period(t));
}

void release_at(struct task_struct *t, lt_t start)
{
	BUG_ON(!t);
	setup_release(t, start);
	tsk_rt(t)->completed = 0;
}


/*
 *	Deactivate current task until the beginning of the next period.
 */
long complete_job(void)
{
	lt_t amount;
	lt_t now = litmus_clock();
	lt_t exec_time = tsk_rt(current)->job_params.exec_time;

	tsk_rt(current)->tot_exec_time += exec_time;
	if (lt_before(tsk_rt(current)->max_exec_time, exec_time))
		tsk_rt(current)->max_exec_time = exec_time;

	if (is_tardy(current, now)) {
		amount = now - get_deadline(current);
		if (lt_after(amount, tsk_rt(current)->max_tardy))
			tsk_rt(current)->max_tardy = amount;
		tsk_rt(current)->total_tardy += amount;
		++tsk_rt(current)->missed;
	}

	/* Mark that we do not excute anymore */
	tsk_rt(current)->completed = 1;
	/* call schedule, this will return when a new job arrives
	 * it also takes care of preparing for the next release
	 */
	schedule();
	return 0;
}