forked from pabuhr/concurrent-locking
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBurns2.c
79 lines (64 loc) · 2.25 KB
/
Burns2.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
// James E. Burns, Symmetry in Systems of Asynchronous Processes. 22nd Annual
// Symposium on Foundations of Computer Science, 1981, Figure 2, p 170.
#include <stdbool.h>
static TYPE PAD1 CALIGN __attribute__(( unused )); // protect further false sharing
static VTYPE turn CALIGN, * flag CALIGN;
static TYPE PAD2 CALIGN __attribute__(( unused )); // protect further false sharing
static void * Worker( void * arg ) {
TYPE id = (size_t)arg;
uint64_t entry;
#ifdef FAST
unsigned int cnt = 0, oid = id;
#endif // FAST
typeof(N) j;
for ( int r = 0; r < RUNS; r += 1 ) {
RTYPE randomThreadChecksum = 0;
for ( entry = 0; stop == 0; entry += 1 ) {
L0: flag[id] = true; // entry protocol
turn = id; // RACE
Fence(); // force store before more loads
L1: if ( FASTPATH( turn != id ) ) {
flag[id] = false;
Fence(); // force store before more loads
L11: for ( j = 0; j < N; j += 1 )
if ( j != id && flag[j] ) { Pause(); goto L11; }
goto L0;
} else {
// flag[id] = true;
// Fence(); // force store before more loads
L2: if ( FASTPATH( turn != id ) ) goto L1;
for ( j = 0; j < N; j += 1 )
if ( FASTPATH( j != id && flag[j] ) ) goto L2;
} // if
randomThreadChecksum += CriticalSection( id );
flag[id] = false; // exit protocol
#ifdef FAST
id = startpoint( cnt ); // different starting point each experiment
cnt = cycleUp( cnt, NoStartPoints );
#endif // FAST
} // for
__sync_fetch_and_add( &sumOfThreadChecksums, randomThreadChecksum );
#ifdef FAST
id = oid;
#endif // FAST
entries[r][id] = entry;
__sync_fetch_and_add( &Arrived, 1 );
while ( stop != 0 ) Pause();
__sync_fetch_and_add( &Arrived, -1 );
} // for
return NULL;
} // Worker
void __attribute__((noinline)) ctor() {
flag = Allocator( sizeof(typeof(flag[0])) * N );
for ( typeof(N) i = 0; i < N; i += 1 ) { // initialize shared data
flag[i] = false;
} // for
//turn = 0;
} // ctor
void __attribute__((noinline)) dtor() {
free( (void *)flag );
} // dtor
// Local Variables: //
// tab-width: 4 //
// compile-command: "gcc -Wall -Wextra -std=gnu11 -O3 -DNDEBUG -fno-reorder-functions -DPIN -DAlgorithm=Burns2 Harness.c -lpthread -lm -D`hostname` -DCFMT -DCNT=0" //
// End: //