a752c7ab
 elopes
add first test an...
|
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
|
/*
* Copyright (C) 2015 Kaspar Schleiser <kaspar@schleiser.de>
*
* This file is subject to the terms and conditions of the GNU Lesser
* General Public License v2.1. See the file LICENSE in the top level
* directory for more details.
*/
/**
* @ingroup sys
* @{
* @file
* @brief thread-safe ringbuffer implementation
*
* @author Kaspar Schleiser <kaspar@schleiser.de>
*
* @}
*/
#include "tsrb.h"
static void _push(tsrb_t *rb, char c)
{
rb->buf[rb->writes++ & (rb->size - 1)] = c;
}
static char _pop(tsrb_t *rb)
{
return rb->buf[rb->reads++ & (rb->size - 1)];
}
int tsrb_get_one(tsrb_t *rb)
{
if (!tsrb_empty(rb)) {
return _pop(rb);
}
else {
return -1;
}
}
int tsrb_get(tsrb_t *rb, char *dst, size_t n)
{
size_t tmp = n;
while (tmp && !tsrb_empty(rb)) {
*dst++ = _pop(rb);
tmp--;
}
return (n - tmp);
}
int tsrb_add_one(tsrb_t *rb, char c)
{
if (!tsrb_full(rb)) {
_push(rb, c);
return 0;
}
else {
return -1;
}
}
int tsrb_add(tsrb_t *rb, const char *src, size_t n)
{
size_t tmp = n;
while (tmp && !tsrb_full(rb)) {
_push(rb, *src++);
tmp--;
}
return (n - tmp);
}
|