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
|
/*
NAME
rendezvous - user level process synchronization
SYNOPSIS
ulong rendezvous(ulong tag, ulong value)
DESCRIPTION
The rendezvous system call allows two processes to synchro-
nize and exchange a value. In conjunction with the shared
memory system calls (see segattach(2) and fork(2)), it
enables parallel programs to control their scheduling.
Two processes wishing to synchronize call rendezvous with a
common tag, typically an address in memory they share. One
process will arrive at the rendezvous first; it suspends
execution until a second arrives. When a second process
meets the rendezvous the value arguments are exchanged
between the processes and returned as the result of the
respective rendezvous system calls. Both processes are
awakened when the rendezvous succeeds.
The set of tag values which two processes may use to
rendezvous-their tag space-is inherited when a process
forks, unless RFREND is set in the argument to rfork; see
fork(2).
If a rendezvous is interrupted the return value is ~0, so
that value should not be used in normal communication.
* This assumes we're using pthreads and simulates rendezvous using
* shared memory and mutexes.
*/
#include <pthread.h>
#include <lib9.h>
enum
{
VOUSHASH = 257,
};
typedef struct Vous Vous;
struct Vous
{
Vous *link;
Lock lk;
ulong val;
ulong tag;
pthread_mutex_t mutex;
};
static void
ign(int x)
{
USED(x);
}
void /*__attribute__((constructor))*/
ignusr1(void)
{
signal(SIGUSR1, ign);
}
static Vous vouspool[2048];
static int nvousused;
static Vous *vousfree;
static Vous *voushash[VOUSHASH];
static Lock vouslock;
static Vous*
getvous(void)
{
Vous *v;
if(vousfree){
v = vousfree;
vousfree = v->link;
}else if(nvousused < nelem(vouspool)){
v = &vouspool[nvousused++];
pthread_mutex_init(&v->mutex, NULL);
}else
abort();
return v;
}
static void
putvous(Vous *v)
{
lock(&vouslock);
v->link = vousfree;
vousfree = v;
unlock(&vouslock);
}
static Vous*
findvous(ulong tag, ulong val, int *found)
{
int h;
Vous *v, **l;
lock(&vouslock);
h = tag%VOUSHASH;
for(l=&voushash[h], v=*l; v; l=&(*l)->link, v=*l){
if(v->tag == tag){
*l = v->link;
*found = 1;
unlock(&vouslock);
return v;
}
}
v = getvous();
v->link = voushash[h];
v->val = val;
v->tag = tag;
lock(&v->lk);
voushash[h] = v;
unlock(&vouslock);
*found = 0;
return v;
}
#define DBG 0
ulong
rendezvous(ulong tag, ulong val)
{
int found;
ulong rval;
Vous *v;
v = findvous(tag, val, &found);
if(!found){
if(DBG)fprint(2, "tag %lux, sleeping on %p\n", tag, v);
/*
* No rendezvous partner was found; the next guy
* through will find v and wake us, so we must go
* to sleep. Do this by locking the mutex (it is
* unlocked) and then locking it again (our waker will
* unlock it for us).
*/
if(pthread_mutex_lock(&v->mutex) != 0)
abort();
unlock(&v->lk);
if(pthread_mutex_lock(&v->mutex) != 0)
abort();
rval = v->val;
pthread_mutex_unlock(&v->mutex);
if(DBG)fprint(2, " awake on %p\n", v);
unlock(&v->lk);
putvous(v);
}else{
/*
* Found someone to meet. Wake him:
*
* A. lock v->lk (waits for him to lock the mutex once.
* B. unlock the mutex (wakes him up)
*/
if(DBG)fprint(2, "found tag %lux on %p, waking\n", tag, v);
lock(&v->lk);
rval = v->val;
v->val = val;
if(pthread_mutex_unlock(&v->mutex) != 0)
abort();
/* lock passes to him */
}
return rval;
}
|