-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathcircular_buffer.c
390 lines (285 loc) · 9.09 KB
/
circular_buffer.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
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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stddef.h>
#include <assert.h>
#include <stdbool.h>
#include <stdatomic.h>
#include <sys/resource.h>
#include <sys/shm.h>
#include <string.h>
#include <sys/mman.h>
#include <malloc.h>
#include "circular_buffer.h"
#include "shm.h"
// Private functions
static void advance_pointer_n(cbuf_handle_t cbuf, size_t len)
{
assert(cbuf);
if(cbuf->internal->full)
{
cbuf->internal->tail = (cbuf->internal->tail + len) % cbuf->internal->max;
}
cbuf->internal->head = (cbuf->internal->head + len) % cbuf->internal->max;
// We mark full because we will advance tail on the next time around
cbuf->internal->full = (cbuf->internal->head == cbuf->internal->tail);
}
static void advance_pointer(cbuf_handle_t cbuf)
{
assert(cbuf && cbuf->internal);
if(cbuf->internal->full)
{
cbuf->internal->tail = (cbuf->internal->tail + 1) % cbuf->internal->max;
}
cbuf->internal->head = (cbuf->internal->head + 1) % cbuf->internal->max;
// We mark full because we will advance tail on the next time around
cbuf->internal->full = (cbuf->internal->head == cbuf->internal->tail);
}
static void retreat_pointer_n(cbuf_handle_t cbuf, size_t len)
{
assert(cbuf && cbuf->internal);
cbuf->internal->full = false;
cbuf->internal->tail = (cbuf->internal->tail + len) % cbuf->internal->max;
}
static void retreat_pointer(cbuf_handle_t cbuf)
{
assert(cbuf->internal);
cbuf->internal->full = false;
cbuf->internal->tail = (cbuf->internal->tail + 1) % cbuf->internal->max;
}
// User APIs
cbuf_handle_t circular_buf_init(uint8_t* buffer, size_t size)
{
assert(buffer && size);
cbuf_handle_t cbuf = memalign(SHMLBA, sizeof(struct circular_buf_t));
assert(cbuf);
cbuf->internal = memalign(SHMLBA, sizeof(struct circular_buf_t_aux));
assert(cbuf->internal);
cbuf->buffer = buffer;
cbuf->internal->max = size;
circular_buf_reset(cbuf);
atomic_flag_clear(&cbuf->internal->acquire);
assert(circular_buf_empty(cbuf));
return cbuf;
}
cbuf_handle_t circular_buf_init_shm(size_t size, key_t key)
{
assert(size);
cbuf_handle_t cbuf = memalign(SHMLBA, sizeof(struct circular_buf_t));
assert(cbuf);
if (shm_is_created(key, size))
{
fprintf(stderr, "shm key %u already created. Re-creating.\n", key);
shm_destroy(key, size);
}
shm_create(key, size);
cbuf->buffer = shm_attach(key, size);
assert(cbuf->buffer);
key++;
if (shm_is_created(key, sizeof(struct circular_buf_t_aux)))
{
fprintf(stderr, "shm key %u already created. Re-creating.\n", key);
shm_destroy(key, sizeof(struct circular_buf_t_aux));
}
shm_create(key, sizeof(struct circular_buf_t_aux));
cbuf->internal = shm_attach(key, sizeof(struct circular_buf_t_aux));
assert(cbuf->internal);
cbuf->internal->max = size;
atomic_flag_clear(&cbuf->internal->acquire);
circular_buf_reset(cbuf);
assert(circular_buf_empty(cbuf));
return cbuf;
}
cbuf_handle_t circular_buf_connect_shm(size_t size, key_t key)
{
assert(size);
cbuf_handle_t cbuf = memalign(SHMLBA, sizeof(struct circular_buf_t));
assert(cbuf);
cbuf->buffer = shm_attach(key, size);
assert(cbuf->buffer);
cbuf->internal = shm_attach(key+1, sizeof(struct circular_buf_t_aux));
assert(cbuf->internal);
assert (cbuf->internal->max == size);
return cbuf;
}
void circular_buf_free(cbuf_handle_t cbuf)
{
assert(cbuf && cbuf->internal);
free(cbuf->internal);
free(cbuf);
}
void circular_buf_free_shm(cbuf_handle_t cbuf, size_t size, key_t key)
{
assert(cbuf && cbuf->internal && cbuf->buffer);
shm_dettach(key, size, cbuf->buffer);
shm_destroy(key, size);
shm_dettach(key+1, sizeof(struct circular_buf_t_aux), cbuf->internal);
shm_destroy(key+1, sizeof(struct circular_buf_t_aux));
free(cbuf);
}
void circular_buf_reset(cbuf_handle_t cbuf)
{
assert(cbuf && cbuf->internal);
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
cbuf->internal->head = 0;
cbuf->internal->tail = 0;
cbuf->internal->full = false;
atomic_flag_clear(&cbuf->internal->acquire);
}
size_t circular_buf_size(cbuf_handle_t cbuf)
{
assert(cbuf && cbuf->internal);
size_t size = circular_buf_capacity(cbuf);
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
if(!cbuf->internal->full)
{
if(cbuf->internal->head >= cbuf->internal->tail)
{
size = (cbuf->internal->head - cbuf->internal->tail);
}
else
{
size = (cbuf->internal->max + cbuf->internal->head - cbuf->internal->tail);
}
}
atomic_flag_clear(&cbuf->internal->acquire);
return size;
}
size_t circular_buf_free_size(cbuf_handle_t cbuf)
{
assert(cbuf->internal);
size_t size = 0;
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
if(!cbuf->internal->full)
{
if(cbuf->internal->head >= cbuf->internal->tail)
{
size = cbuf->internal->max - (cbuf->internal->head - cbuf->internal->tail);
}
else
{
size = (cbuf->internal->tail - cbuf->internal->head);
}
}
atomic_flag_clear(&cbuf->internal->acquire);
return size;
}
size_t circular_buf_capacity(cbuf_handle_t cbuf)
{
assert(cbuf->internal);
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
size_t capacity = cbuf->internal->max;
atomic_flag_clear(&cbuf->internal->acquire);
return capacity;
}
void circular_buf_put(cbuf_handle_t cbuf, uint8_t data)
{
assert(cbuf && cbuf->internal && cbuf->buffer);
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
cbuf->buffer[cbuf->internal->head] = data;
advance_pointer(cbuf);
atomic_flag_clear(&cbuf->internal->acquire);
}
int circular_buf_put2(cbuf_handle_t cbuf, uint8_t data)
{
assert(cbuf && cbuf->internal && cbuf->buffer);
int r = -1;
if(!circular_buf_full(cbuf))
{
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
cbuf->buffer[cbuf->internal->head] = data;
advance_pointer(cbuf);
atomic_flag_clear(&cbuf->internal->acquire);
r = 0;
}
return r;
}
int circular_buf_get(cbuf_handle_t cbuf, uint8_t * data)
{
assert(cbuf && data && cbuf->internal && cbuf->buffer);
int r = -1;
if(!circular_buf_empty(cbuf))
{
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
*data = cbuf->buffer[cbuf->internal->tail];
retreat_pointer(cbuf);
atomic_flag_clear(&cbuf->internal->acquire);
r = 0;
}
return r;
}
bool circular_buf_empty(cbuf_handle_t cbuf)
{
assert(cbuf && cbuf->internal);
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
bool is_empty = !cbuf->internal->full && (cbuf->internal->head == cbuf->internal->tail);
atomic_flag_clear(&cbuf->internal->acquire);
return is_empty;
}
bool circular_buf_full(cbuf_handle_t cbuf)
{
assert(cbuf && cbuf->internal);
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
bool is_full = cbuf->internal->full;
atomic_flag_clear(&cbuf->internal->acquire);
return is_full;
}
int circular_buf_get_range(cbuf_handle_t cbuf, uint8_t *data, size_t len)
{
assert(cbuf && data && cbuf->internal && cbuf->buffer);
#if 0
for (int i = 0; i < len; i++)
circular_buf_get(cbuf, &data[i]);
return 0;
#endif
#if 1
int r = -1;
size_t size = circular_buf_capacity(cbuf);
if(circular_buf_size(cbuf) >= len)
{
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
if ( ((cbuf->internal->tail + len) % size) > cbuf->internal->tail)
{
memcpy(data, cbuf->buffer + cbuf->internal->tail, len);
}else
{
memcpy(data, cbuf->buffer + cbuf->internal->tail, size - cbuf->internal->tail);
memcpy(data + (size - cbuf->internal->tail), cbuf->buffer, len - (size - cbuf->internal->tail));
}
retreat_pointer_n(cbuf, len);
atomic_flag_clear(&cbuf->internal->acquire);
r = 0;
}
return r;
#endif
}
int circular_buf_put_range(cbuf_handle_t cbuf, uint8_t * data, size_t len)
{
assert(cbuf && cbuf->internal && cbuf->buffer);
#if 0
for (int i = 0; i < len; i++)
circular_buf_put(cbuf, data[i]);
return 0;
#endif
#if 1
int r = -1;
size_t size = circular_buf_capacity(cbuf);
// test if buffer has enough free space
if(!circular_buf_full(cbuf))
{
while (atomic_flag_test_and_set(&cbuf->internal->acquire));
if ( ((cbuf->internal->head + len) % size) > cbuf->internal->head)
{
memcpy(cbuf->buffer + cbuf->internal->head, data, len);
} else
{
memcpy(cbuf->buffer + cbuf->internal->head, data, size - cbuf->internal->head);
memcpy(cbuf->buffer, data + (size - cbuf->internal->head), len - (size - cbuf->internal->head));
}
advance_pointer_n(cbuf, len);
atomic_flag_clear(&cbuf->internal->acquire);
r = 0;
}
return r;
#endif
}