blob: 1fe5724dad959e70be9b48f6d4b8b486a6dd1b80 (
plain)
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
|
#include "rendezvous.h"
#include "osdep/threads.h"
static mp_static_mutex lock = MP_STATIC_MUTEX_INITIALIZER;
static mp_cond wakeup = MP_STATIC_COND_INITIALIZER;
static struct waiter *waiters;
struct waiter {
void *tag;
struct waiter *next;
intptr_t *value;
};
/* A barrier for 2 threads, which can exchange a value when they meet.
* The first thread to call this function will block. As soon as two threads
* are calling this function with the same tag value, they will unblock, and
* on each thread the call returns the value parameter of the _other_ thread.
*
* tag is an arbitrary value, but it must be an unique pointer. If there are
* more than 2 threads using the same tag, things won't work. Typically, it
* will have to point to a memory allocation or to the stack, while pointing
* it to static data is always a bug.
*
* This shouldn't be used for performance critical code (uses a linked list
* of _all_ waiters in the process, and temporarily wakes up _all_ waiters on
* each second call).
*
* This is inspired by: http://9atom.org/magic/man2html/2/rendezvous */
intptr_t mp_rendezvous(void *tag, intptr_t value)
{
struct waiter wait = { .tag = tag, .value = &value };
mp_mutex_lock(&lock);
struct waiter **prev = &waiters;
while (*prev) {
if ((*prev)->tag == tag) {
intptr_t tmp = *(*prev)->value;
*(*prev)->value = value;
value = tmp;
(*prev)->value = NULL; // signals completion
*prev = (*prev)->next; // unlink
mp_cond_broadcast(&wakeup);
goto done;
}
prev = &(*prev)->next;
}
*prev = &wait;
while (wait.value)
mp_cond_wait(&wakeup, &lock);
done:
mp_mutex_unlock(&lock);
return value;
}
|
