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
#include "u.h"
#include "../port/lib.h"
#include "mem.h"
#include "dat.h"
#include "fns.h"
void
qlock(QLock *q)
{
Proc *p, *mp;
if(u)
u->p->qlockpc = getcallerpc(((uchar*)&q) - sizeof(q));
lock(&q->use);
if(!q->locked) {
q->locked = 1;
unlock(&q->use);
return;
}
p = q->tail;
mp = u->p;
if(p == 0)
q->head = mp;
else
p->qnext = mp;
q->tail = mp;
mp->qnext = 0;
mp->state = Queueing;
unlock(&q->use);
sched();
}
int
canqlock(QLock *q)
{
lock(&q->use);
if(q->locked){
unlock(&q->use);
return 0;
}
q->locked = 1;
unlock(&q->use);
return 1;
}
void
qunlock(QLock *q)
{
Proc *p;
lock(&q->use);
p = q->head;
if(p) {
q->head = p->qnext;
if(q->head == 0)
q->tail = 0;
unlock(&q->use);
ready(p);
return;
}
q->locked = 0;
unlock(&q->use);
}
void
rlock(RWlock *l)
{
qlock(&l->x); /* wait here for writers and exclusion */
lock(l);
l->readers++;
canqlock(&l->k); /* block writers if we are the first reader */
unlock(l);
qunlock(&l->x);
}
void
runlock(RWlock *l)
{
lock(l);
if(--l->readers == 0) /* last reader out allows writers */
qunlock(&l->k);
unlock(l);
}
void
wlock(RWlock *l)
{
qlock(&l->x); /* wait here for writers and exclusion */
qlock(&l->k); /* wait here for last reader */
}
void
wunlock(RWlock *l)
{
qunlock(&l->x);
qunlock(&l->k);
}