-
Notifications
You must be signed in to change notification settings - Fork 0
/
lock_free_linked_list.h
190 lines (170 loc) · 4.52 KB
/
lock_free_linked_list.h
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
/*
* lock_free_queue.h
*
* Created on: Jun 5, 2020
* Author: sajeeb
*/
#ifndef LOCK_FREE_LINKED_LIST_H_
#define LOCK_FREE_LINKED_LIST_H_
#ifndef uint
typedef unsigned int uint;
#endif
#include <chrono>
#include <math.h>
#include <stdlib.h>
#include <iostream>
#include <atomic>
#include <mutex>
#include <thread>
#include <assert.h>
#include <condition_variable>
//#define __LOGGER_DEBUGGER__
#include "logger_debugger.h"
using std::atomic;
using std::thread;
using std::condition_variable;
using std::mutex;
#define __force_inline__ __attribute__((always_inline)) inline
class lock_free_queue {
public:
typedef struct node {
char data[256] = {'\0',};
node* next = nullptr;
bool done = false;
FILE* stream;
node(FILE* os) : stream(os) {}
} node;
atomic<node*> _first;
atomic<node*> _last;
atomic<int> num_nodes;
atomic<bool> __kill__;
atomic<bool> __terminated__;
uint flush_interval = pow(2, 13);
atomic<uint> current_flush_count;
atomic<FILE*> _output_stream_;
thread printer;
condition_variable cv, cv1;
mutex mtx, mtx1;
lock_free_queue() {
num_nodes.store(0);
current_flush_count.store(0);
__terminated__.store(false);
__kill__.store(false);
_first.store(NULL);
_last.store(NULL);
set_output_stream(stdout);
printer = thread(lock_free_queue::run, std::ref(*this));
printer.detach();
}
~lock_free_queue() {
__LOGGER_DEBUGGER__("In Destructor.");
__LOGGER_DEBUGGER__("Terminating print thread");
__kill__.store(true);
while (!__terminated__.load()) {
running = true;
cv.notify_one();
}
__LOGGER_DEBUGGER__("Print thread terminated.");
__LOGGER_DEBUGGER__("Number of nodes remaining: %d", num_nodes.load());
flush_all();
}
__force_inline__
node* get() {
return append();
}
__force_inline__
void set_output_stream(FILE* os) {
// __LOGGER_DEBUGGER__("Value before setting stream: %p", _output_stream_.load());
_output_stream_.store(os);
// setbuf(_output_stream_.load(), NULL);
// __LOGGER_DEBUGGER__("Value after setting stream: %p", _output_stream_.load());
}
private:
atomic<bool> running;
/**
* Only gets called in the get function
*/
__force_inline__
node* append() {
if (num_nodes % flush_interval == 0) {
running = false;
std::unique_lock<mutex> lock(mtx1);
cv1.wait_for(lock, std::chrono::nanoseconds(0), [&]{
return (num_nodes % flush_interval);
});
}
running = true;
// __LOGGER_DEBUGGER__("Appending node..");
node* n = new node(_output_stream_);
++num_nodes;
// __LOGGER_DEBUGGER__("new node: %p", n);
node* prev = _last.exchange(n);
// __LOGGER_DEBUGGER__("Checking previous node pointer: %p", prev);
(prev) ? prev->next = n : _first = n;
// __LOGGER_DEBUGGER__("new first: %p", _first.load());
// __LOGGER_DEBUGGER__("Done appending node.");
// if (++current_flush_count % flush_interval) cv.notify_one();
// cv.notify_one();
cv1.notify_all();
return n;
}
/**
* Gets called in flush and run method
*/
__force_inline__
void flush(node* n) {
// __LOGGER_DEBUGGER__("flush");
// __LOGGER_DEBUGGER__("Setting contents of _first to: %p", n->next);
_first.store(n->next);
// __LOGGER_DEBUGGER__("Printing contents of node: %p", n);
// setbuf(n->stream, NULL);
fprintf(n->stream, "%s", n->data);
// __LOGGER_DEBUGGER__("Printed: %s to %p", n->data, n->stream);
// __LOGGER_DEBUGGER__("DELETE: %p", n);
delete n;
--num_nodes;
}
/**
* Gets called only in the destructor
*/
__force_inline__
void flush_all() {
// __LOGGER_DEBUGGER__("flush_all..");
std::lock_guard<mutex> lock(mtx);
node* f;
node* prev_last_node = _last;
while ((f = _first) != nullptr) {
flush(f);
}
_last.compare_exchange_strong(prev_last_node, f);
running = true;
}
/**
*
*/
__force_inline__
static void run(lock_free_queue& q) {
std::unique_lock<std::mutex> lock(q.mtx);
// q.cv.wait_for(lock, std::chrono::seconds(1), [&]{
q.cv.wait(lock, [&]{
// if (q.num_nodes < 8192) return false;
node* f = q._first;
// __LOGGER_DEBUGGER__("f: %p, l: %p", f, l);
for (;f != q._last && f != NULL && f->done;) {
// __LOGGER_DEBUGGER__("Printer thread flushing node: %p", f);
fprintf(f->stream, "%s", f->data);
const node* n = f;
f = f->next;
delete n;
--q.num_nodes;
}
while (!q.running) q.cv1.notify_all();
q._first = f;
// __LOGGER_DEBUGGER__("num_nodes: %d", q.num_nodes.load());
// __LOGGER_DEBUGGER__("Printer thread done flushing");
return (q.__kill__.load()) ? true : false;
});
while (!q.__terminated__.load()) q.__terminated__.store(true);
}
};
#endif /* LOCK_FREE_LINKED_LIST_H_ */