aboutsummaryrefslogtreecommitdiffstats
path: root/kernel/rt_domain.c
blob: 4875c53076e5cd99f151a71ebe0bc8919c9f5084 (plain) (blame)
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
/*
 * kernel/rt_domain.c
 *
 * LITMUS real-time infrastructure. This file contains the 
 * functions that manipulate RT domains. RT domains are an abstraction
 * of a ready queue and a release queue.
 */

#include <linux/percpu.h>
#include <linux/sched.h>
#include <linux/list.h>

#include <linux/litmus.h>
#include <linux/sched_plugin.h>
#include <linux/sched_trace.h>

#include <linux/rt_domain.h>


static int dummy_resched(rt_domain_t *rt) 
{
	return 0;
}

static int dummy_order(struct list_head* a, struct list_head* b)
{
	return 0;
}

int release_order(struct list_head* a, struct list_head* b)
{
	return earlier_release(
		list_entry(a, struct task_struct, rt_list),
		list_entry(b, struct task_struct, rt_list));
}


void rt_domain_init(rt_domain_t *rt, 
		    check_resched_needed_t f,
		    list_cmp_t order) 
{
	BUG_ON(!rt);
	if (!f)
		f = dummy_resched;
	if (!order)
		order = dummy_order;
	INIT_LIST_HEAD(&rt->ready_queue);
	INIT_LIST_HEAD(&rt->release_queue);
	rt->ready_lock  	= RW_LOCK_UNLOCKED;
	rt->release_lock 	= SPIN_LOCK_UNLOCKED;
	rt->check_resched 	= f;
	rt->order		= order;
}

/* add_ready - add a real-time task to the rt ready queue. It must be runnable.
 * @new:      the newly released task
 */
void __add_ready(rt_domain_t* rt, struct task_struct *new) 
{	
	TRACE("rt: adding %s/%d (%u, %u) to ready queue\n", 
	      new->comm, new->pid, get_exec_cost(new), get_rt_period(new));

	if (!list_insert(&new->rt_list, &rt->ready_queue, rt->order))
		rt->check_resched(rt);
}

struct task_struct* __take_ready(rt_domain_t* rt) 
{
	struct task_struct *t = __peek_ready(rt);

	/* kick it out of the ready list */
	if (t)
		list_del(&t->rt_list);	
	return t;
}

struct task_struct* __peek_ready(rt_domain_t* rt)
{
	if (!list_empty(&rt->ready_queue))
		return next_ready(rt);
	else
		return NULL;
}

struct task_struct* __take_ready_rq(rt_domain_t* rt, runqueue_t* rq, int cpu)
{
	struct task_struct *task = __take_ready(rt);

	if (task) {
		set_task_cpu(task, cpu);
		__activate_task(task, rq);
	}
	return task;
}

/* add_release - add a real-time task to the rt release queue.
 * @task:        the sleeping task
 */
void __add_release(rt_domain_t* rt, struct task_struct *task) 
{
	TRACE("rt: adding %s/%d (%u, %u) rel=%d to release queue\n", 
	      task->comm, task->pid, get_exec_cost(task), get_rt_period(task),
	      get_release(task));
	
	list_insert(&task->rt_list, &rt->release_queue, release_order);
}

void __release_pending(rt_domain_t* rt)
{
	struct list_head *pos, *save;
	struct task_struct   *queued;
	list_for_each_safe(pos, save, &rt->release_queue) {
		queued = list_entry(pos, struct task_struct, rt_list);
		if (likely(is_released(queued))) {
			/* this one is ready to go*/
			list_del(pos);
			set_rt_flags(queued, RT_F_RUNNING);
			
			sched_trace_job_release(queued);
			
			/* now it can be picked up */
			barrier();
			add_ready(rt, queued);
		} 
		else
			/* the release queue is ordered */
			break;			
	}
}

void try_release_pending(rt_domain_t* rt) 
{
	unsigned long flags;

	if (spin_trylock_irqsave(&rt->release_lock, flags)) {
		__release_pending(rt);
		spin_unlock_irqrestore(&rt->release_lock, flags);
	}
}	    	    

void rerelease_all(rt_domain_t *rt,  
		   release_at_t release) 
{
	unsigned long flags;

	spin_lock_irqsave(&rt->release_lock, flags);
	write_lock(&rt->ready_lock);

	__rerelease_all(rt, release);
	
	write_unlock(&rt->ready_lock);
	spin_unlock_irqrestore(&rt->release_lock, flags);
}

void __rerelease_all(rt_domain_t *rt,
		     release_at_t release) 
{
	jiffie_t start = jiffies + 10;
	struct list_head tmp_list;
	struct list_head *pos, *n;
	struct task_struct *t;
	
	INIT_LIST_HEAD(&tmp_list);

	while (!list_empty(&rt->release_queue)) {
		pos = rt->release_queue.next;
		list_del(pos);
		list_add(pos, &tmp_list);	       
	}
	while (!list_empty(&rt->ready_queue)) {
		pos = rt->ready_queue.next;
		list_del(pos);
		list_add(pos, &tmp_list);
	}

	list_for_each_safe(pos, n, &tmp_list) {
		t = list_entry(pos, struct task_struct, rt_list);
		list_del(pos);
		release(t, start);
		__add_release(rt, t);
	}

}