-
Notifications
You must be signed in to change notification settings - Fork 2
/
worker.c
377 lines (323 loc) · 10.7 KB
/
worker.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
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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
#include <assert.h>
#include <pthread.h>
#include <setjmp.h>
#include <gc/gc.h>
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include "types.h"
#include "9p.h"
#include "list.h"
#include "vector.h"
#include "fid.h"
#include "util.h"
#include "config.h"
#include "worker.h"
#include "heap.h"
#include "disk.h"
#include "claim.h"
#include "lease.h"
#include "walk.h"
/* Static data */
u32 worker_next_priority;
Heap *worker_ready_to_run;
List *worker_thread_pool;
pthread_mutex_t *worker_biglock;
int worker_active;
int worker_priority_cmp(const Worker *a, const Worker *b) {
if (a->priority == b->priority)
return 0;
if (a->priority < b->priority &&
b->priority - a->priority < WORKER_PRIORITY_THRESHOLD)
{
return -1;
}
return 1;
}
void worker_state_init(void) {
worker_next_priority = 0;
worker_ready_to_run =
heap_new(WORKER_READY_QUEUE_SIZE, (Cmpfunc) worker_priority_cmp);
worker_thread_pool = NULL;
worker_biglock = GC_NEW(pthread_mutex_t);
assert(worker_biglock != NULL);
pthread_mutex_init(worker_biglock, NULL);
worker_active = 0;
}
void worker_wake_up_next(void) {
Worker *next = heap_remove(worker_ready_to_run);
if (next == NULL)
return;
cond_signal(next->sleep);
}
/*
* Worker threads
*/
static void *worker_loop(Worker *t) {
int i;
enum worker_transaction_states state;
lock();
if (!heap_isempty(worker_ready_to_run)) {
/* wait for older threads that are ready to run */
worker_wake_up_next();
heap_add(worker_ready_to_run, t);
cond_wait(t->sleep);
}
/* let threads expire after a while so the thread pool can grow and shrink
* as needed without hard limits on the number of threads */
for (i = 0; i < THREAD_LIFETIME; i++) {
if (i > 0) {
/* wait in the pool for a request */
worker_thread_pool = append_elt(worker_thread_pool, t);
cond_wait(t->sleep);
}
worker_active++;
/* initialize the exception handler and catch exceptions */
do {
state = setjmp(t->jmp);
if (state == WORKER_BLOCKED) {
/* wait for the blocking transaction to finish,
* then start over */
worker_cleanup(t);
worker_wake_up_next();
cond_wait(t->sleep);
} else if (state == WORKER_MULTISTEP) {
/* wait for the next step in this grant/revoke op to wake us up
* with more work to do */
if (DEBUG_VERBOSE)
printf("WORKER_MULTISTEP sleeping\n");
worker_cleanup(t);
t->func = NULL;
t->arg = NULL;
worker_wake_up_next();
while (t->func == NULL)
cond_wait(t->sleep);
if (DEBUG_VERBOSE)
printf("WORKER_MULTISTEP waking up\n");
} else if (state == WORKER_RETRY) {
worker_cleanup(t);
}
} while (state != WORKER_ZERO);
/* process the request */
if (t->func != NULL)
t->func(t, t->arg);
worker_cleanup(t);
t->func = NULL;
/* make anyone waiting on this transaction ready to run, then run one */
if (!null(t->blocking)) {
for ( ; !null(t->blocking); t->blocking = cdr(t->blocking))
heap_add(worker_ready_to_run, car(t->blocking));
}
worker_active--;
worker_wake_up_next();
}
unlock();
return NULL;
}
void worker_create(void (*func)(Worker *, void *), void *arg) {
if (null(worker_thread_pool)) {
pthread_t newthread;
pthread_attr_t attr;
Worker *t = GC_NEW(Worker);
assert(t != NULL);
t->sleep = cond_new();
t->func = func;
t->arg = arg;
t->priority = worker_next_priority++;
t->blocking = NULL;
pthread_attr_init(&attr);
pthread_attr_setstacksize(&attr, max(PTHREAD_STACK_MIN, 1024 * 1024));
pthread_create(&newthread, &attr,
(void *(*)(void *)) worker_loop, (void *) t);
pthread_detach(newthread);
} else {
Worker *t = car(worker_thread_pool);
worker_thread_pool = cdr(worker_thread_pool);
t->func = func;
t->arg = arg;
t->priority = worker_next_priority++;
t->blocking = NULL;
if (!heap_isempty(worker_ready_to_run)) {
/* wait for older threads that are ready to run */
worker_wake_up_next();
heap_add(worker_ready_to_run, t);
} else {
cond_signal(t->sleep);
}
}
}
static void unlock_lease_cleanup(Worker *worker, Lease *lease) {
if (--lease->inflight == 0 && lease->wait_for_update != NULL)
worker->blocking = cons(lease->wait_for_update, worker->blocking);
/* note: we leave wait_for_update set to keep the lease locked */
}
#define cleanup(_type) do { \
((_type *) obj)->lock = NULL; \
} while (0)
void worker_cleanup(Worker *worker) {
while (!null(worker->cleanup)) {
enum lock_types type = (enum lock_types) caar(worker->cleanup);
void *obj = cdar(worker->cleanup);
worker->cleanup = cdr(worker->cleanup);
switch (type) {
case LOCK_DIRECTORY: cleanup(struct objectdir); break;
case LOCK_OPENFILE: cleanup(struct openfile); break;
case LOCK_FID: cleanup(Fid); break;
case LOCK_WALK: cleanup(Walk); break;
case LOCK_CLAIM:
cleanup(Claim);
claim_release((Claim *) obj);
break;
case LOCK_LEASE:
unlock_lease_cleanup(worker, (Lease *) obj);
break;
case LOCK_LEASE_EXCLUSIVE:
((Lease *) obj)->wait_for_update = NULL;
break;
case LOCK_REMOTE_FID:
if (vector_get(fid_remote_vector, (u32) obj) ==
(void *) 0xdeadbeef)
{
fid_release_remote((u32) obj);
}
break;
case LOCK_RAW:
raw_delete((u8 *) obj);
break;
default:
assert(0);
}
}
}
#undef cleanup
Worker *worker_attempt_to_acquire(Worker *worker, Worker *other) {
assert(worker != NULL);
if (other == NULL || other == worker)
return worker;
/* we lose */
other->blocking = cons(worker, other->blocking);
longjmp(worker->jmp, WORKER_BLOCKED);
assert(0);
}
void worker_retry(Worker *worker) {
longjmp(worker->jmp, WORKER_RETRY);
}
void lock(void) {
pthread_mutex_lock(worker_biglock);
}
void unlock(void) {
pthread_mutex_unlock(worker_biglock);
}
void lock_lease(Worker *worker, Lease *lease) {
if (lease->wait_for_update == worker)
return;
worker_attempt_to_acquire(worker, lease->wait_for_update);
lease->inflight++;
worker_cleanup_add(worker, LOCK_LEASE, lease);
}
void lock_lease_exclusive(Worker *worker, Lease *lease) {
List *cleanup = worker->cleanup;
List *prev = NULL;
worker_attempt_to_acquire(worker, lease->wait_for_update);
/* clean out any regular locks that we hold on this lease */
while (lease->inflight > 0 && !null(cleanup)) {
if (caar(cleanup) == (void *) LOCK_LEASE && cdar(cleanup) == lease) {
lease->inflight--;
if (null(prev))
worker->cleanup = cdr(cleanup);
else
setcdr(prev, cdr(cleanup));
} else {
prev = cleanup;
}
cleanup = cdr(cleanup);
}
/* prevent any new transactions starting and signal our interest */
lease->wait_for_update = worker;
/* want for existing inflight transactions to finish */
if (lease->inflight > 0)
longjmp(worker->jmp, WORKER_BLOCKED);
/* only add to the cleanup list once we've succeeded */
worker_cleanup_add(worker, LOCK_LEASE_EXCLUSIVE, lease);
}
void lock_lease_extend_multistep(Worker *worker, Lease *lease) {
worker_cleanup_remove(worker, LOCK_LEASE_EXCLUSIVE, lease);
lease->changeinprogress = 1;
}
void lock_lease_join(Worker *worker, List *children) {
for ( ; !null(children); children = cdr(children)) {
Lease *lease = car(children);
while (lease->wait_for_update != worker &&
lease->wait_for_update != NULL)
{
lease->wait_for_update->blocking =
cons(worker, lease->wait_for_update->blocking);
if (DEBUG_VERBOSE)
printf("lock_lease_join: sleeping\n");
cond_wait(worker->sleep);
if (DEBUG_VERBOSE)
printf("lock_lease_join: waking up\n");
}
lease->wait_for_update = worker;
/* we don't bother checking for our own non-exclusive locks */
while (lease->inflight > 0) {
if (DEBUG_VERBOSE)
printf("lock_lease_join: sleeping\n");
cond_wait(worker->sleep);
if (DEBUG_VERBOSE)
printf("lock_lease_join: waking up\n");
}
worker_cleanup_add(worker, LOCK_LEASE_EXCLUSIVE, lease);
}
}
void cond_signal(pthread_cond_t *cond) {
pthread_cond_signal(cond);
}
void cond_broadcast(pthread_cond_t *cond) {
pthread_cond_broadcast(cond);
}
void cond_wait(pthread_cond_t *cond) {
pthread_cond_wait(cond, worker_biglock);
}
pthread_cond_t *cond_new(void) {
pthread_cond_t *cond = GC_NEW(pthread_cond_t);
assert(cond != NULL);
pthread_cond_init(cond, NULL);
return cond;
}
void worker_cleanup_add(Worker *worker, enum lock_types type, void *object) {
worker->cleanup = cons(cons((void *) type, object), worker->cleanup);
}
void worker_cleanup_remove(Worker *worker, enum lock_types type, void *object) {
List *prev = NULL;
List *cur = worker->cleanup;
while (!null(cur)) {
if (caar(cur) == (void *) type && cdar(cur) == object) {
if (prev == NULL)
worker->cleanup = cdr(cur);
else
setcdr(prev, cdr(cur));
return;
}
prev = cur;
cur = cdr(cur);
}
/* fail if we didn't find the requested entry */
assert(0);
}
int worker_active_count(void) {
return worker_active;
}
void worker_multistep_transfer_request(Worker *worker,
void (*func)(Worker *, void *), void *arg)
{
assert(worker->func == NULL);
assert(worker->arg == NULL);
worker->func = func;
worker->arg = arg;
cond_signal(worker->sleep);
}
void worker_multistep_wait(Worker *worker) {
longjmp(worker->jmp, WORKER_MULTISTEP);
assert(0);
}