-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy pathCLH_Scott_F12.c
101 lines (76 loc) · 2.27 KB
/
CLH_Scott_F12.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
// Michael L. Scott Shared-Memory Synchronization book, Figure 4.12, Chapter 4, page 14
#include <stdbool.h>
typedef struct qnode_t {
#ifndef ATOMIC
struct qnode_t * volatile
#else
_Atomic(struct qnode_t *)
#endif // ! ATOMIC
prev;
#ifndef ATOMIC
volatile bool
#else
_Atomic(bool)
#endif // ! ATOMIC
succ_must_wait;
} qnode CALIGN;
typedef qnode * qnode_ptr;
static TYPE PAD1 CALIGN __attribute__(( unused )); // protect further false sharing
static qnode_ptr tail CALIGN;
static TYPE PAD2 CALIGN __attribute__(( unused )); // protect further false sharing
static inline void clh_lock( qnode_ptr p ) {
p->succ_must_wait = true;
qnode_ptr pred = p->prev = Fas( tail, p );
await( ! pred->succ_must_wait );
WO( Fence(); );
} // clh_lock
static inline void clh_unlock( qnode_ptr * pp ) { // "**" output parameter
WO( Fence(); );
qnode_ptr pred = (*pp)->prev;
(*pp)->succ_must_wait = false;
*pp = pred;
} // clh_unlock
static void * Worker( void * arg ) {
TYPE id = (size_t)arg;
uint64_t entry;
#ifdef FAST
unsigned int cnt = 0, oid = id;
#endif // FAST
NCS_DECL;
qnode_ptr node_ptr = Allocator( sizeof( qnode ) ); // cache alignment
for ( int r = 0; r < RUNS; r += 1 ) {
RTYPE randomThreadChecksum = 0;
*node_ptr = (qnode){ NULL, false };
for ( entry = 0; stop == 0; entry += 1 ) {
NCS;
clh_lock( node_ptr );
randomThreadChecksum += CS( id );
clh_unlock( &node_ptr );
#ifdef FAST
id = startpoint( cnt ); // different starting point each experiment
cnt = cycleUp( cnt, NoStartPoints );
#endif // FAST
} // for
Fai( sumOfThreadChecksums, randomThreadChecksum );
#ifdef FAST
id = oid;
#endif // FAST
entries[r][id] = entry;
Fai( Arrived, 1 );
while ( stop != 0 ) Pause();
Fai( Arrived, -1 );
} // for
free( node_ptr );
return NULL;
} // Worker
void __attribute__((noinline)) ctor() {
tail = Allocator( sizeof( qnode ) ); // cache alignment
*tail = (qnode){ NULL, false };
} // ctor
void __attribute__((noinline)) dtor() {
free( (TYPE *)tail ); // remove volatile
} // dtor
// Local Variables: //
// tab-width: 4 //
// compile-command: "gcc -Wall -Wextra -std=gnu11 -O3 -DNDEBUG -fno-reorder-functions -DPIN -DAlgorithm=CLH_Scott_F12 Harness.c -lpthread -lm -D`hostname` -DCFMT -DCNT=0" //
// End: //