-
Notifications
You must be signed in to change notification settings - Fork 13
Expand file tree
/
Copy pathBarrierTicketDiv.c
More file actions
37 lines (28 loc) · 1.2 KB
/
BarrierTicketDiv.c
File metadata and controls
37 lines (28 loc) · 1.2 KB
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
// Colby Parsons
// Cannot have callback/matching without changing from symmetric to asymmetric. The problem is that the FAI
// unconditionally triggers the other thread(s) to advance. Hence, even if a thread knows it triggers the barrier, it
// has simultaneously unblocked the other threads so there is no safe point.
typedef struct {
TYPE CALIGN group;
VTYPE CALIGN count;
} Barrier;
static TYPE PAD1 CALIGN __attribute__(( unused )); // protect further false sharing
static Barrier b CALIGN;
static TYPE PAD2 CALIGN __attribute__(( unused )); // protect further false sharing
#define BARRIER_DECL
#define BARRIER_CALL block( &b );
static inline void block( Barrier * b ) {
TYPE done = (Fai( b->count, 1 ) / b->group) * b->group + b->group; // Fai references value
await( b->count >= done );
} // block
#include "BarrierWorker.c"
void __attribute__((noinline)) ctor() {
worker_ctor();
b = (Barrier){ .group = N, .count = 0 };
} // ctor
void __attribute__((noinline)) dtor() {
worker_dtor();
} // dtor
// Local Variables: //
// compile-command: "gcc -Wall -Wextra -std=gnu11 -O3 -DNDEBUG -fno-reorder-functions -DPIN -DAlgorithm=BarrierTicketDiv Harness.c -lpthread -lm -D`hostname` -DCFMT" //
// End: //