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
|
#ifndef LITMUS_PRIOQ_H
#define LITMUS_PRIOQ_H
#include <litmus/litmus.h>
#include <litmus/binheap.h>
#include <litmus/locking.h>
/* struct for semaphore with priority inheritance */
struct prioq_mutex {
struct litmus_lock litmus_lock;
/* current resource holder */
struct task_struct *owner;
/* highest-priority waiter */
struct task_struct *hp_waiter;
/* priority-ordered queue of waiting tasks.
* Ironically, we don't use a binheap because that would make DGL
* implementation a LOT harder. */
wait_queue_head_t wait;
/* we do some nesting within spinlocks, so we can't use the normal
sleeplocks found in wait_queue_head_t. */
raw_spinlock_t lock;
};
static inline struct prioq_mutex* prioq_mutex_from_lock(struct litmus_lock* lock)
{
return container_of(lock, struct prioq_mutex, litmus_lock);
}
#ifdef CONFIG_LITMUS_DGL_SUPPORT
int prioq_mutex_is_owner(struct litmus_lock *l, struct task_struct *t);
int prioq_mutex_dgl_lock(struct litmus_lock *l, dgl_wait_state_t* dgl_wait, wait_queue_t* wq_node);
void prioq_mutex_enable_priority(struct litmus_lock *l, dgl_wait_state_t* dgl_wait);
void prioq_mutex_dgl_quick_lock(struct litmus_lock *l, struct litmus_lock *cur_lock,
struct task_struct* t, wait_queue_t *q);
int prioq_mutex_dgl_can_quick_lock(struct litmus_lock *l, struct task_struct *t);
#endif
void prioq_mutex_propagate_increase_inheritance(struct litmus_lock* l,
struct task_struct* t,
raw_spinlock_t* to_unlock,
unsigned long irqflags);
void prioq_mutex_propagate_decrease_inheritance(struct litmus_lock* l,
struct task_struct* t,
raw_spinlock_t* to_unlock,
unsigned long irqflags);
int prioq_mutex_lock(struct litmus_lock* l);
int prioq_mutex_unlock(struct litmus_lock* l);
int prioq_mutex_close(struct litmus_lock* l);
void prioq_mutex_free(struct litmus_lock* l);
struct litmus_lock* prioq_mutex_new(struct litmus_lock_ops*);
#endif
|
