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
|
/*
This file is part of Deadbeef Player source code
http://deadbeef.sourceforge.net
basic ring buffer implementation
Copyright (C) 2009-2012 Alexey Yakovenko
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
Alexey Yakovenko waker@users.sourceforge.net
*/
#include <string.h>
#include "ringbuf.h"
void
ringbuf_init (ringbuf_t *p, char *buffer, size_t size) {
memset (p, 0, sizeof (ringbuf_t));
p->bytes = buffer;
p->cursor = 0;
p->size = size;
p->remaining = 0;
}
int
ringbuf_write (ringbuf_t *p, char *bytes, size_t size) {
if (p->size - p->remaining < size) {
return -1;
}
size_t cursor = p->cursor + p->remaining;
cursor %= p->size;
if (p->size - cursor >= size) { // split
memcpy (p->bytes + cursor, bytes, size);
p->remaining += size;
}
else {
size_t n = p->size - cursor;
if (n > 0) {
memcpy (p->bytes + cursor, bytes, n);
p->remaining += n;
size -= n;
bytes += n;
}
memcpy (p->bytes, bytes, size);
p->remaining += size;
}
return 0;
}
int
ringbuf_read (ringbuf_t *p, char *bytes, size_t size) {
if (p->remaining < size) {
size = p->remaining;
}
int rb = size;
if (p->size - p->cursor >= size) {
memcpy (bytes, p->bytes + p->cursor, size);
p->cursor += size;
p->remaining -= size;
}
else {
size_t n = p->size - p->cursor;
if (n > 0) {
memcpy (bytes, p->bytes + p->cursor, n);
p->cursor += n;
p->remaining -= n;
bytes += n;
size -= n;
}
memcpy (bytes, p->bytes, size);
p->cursor = size;
p->remaining -= size;
}
return rb;
}
|
