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
|
/******************************************************************************
*
* Copyright (C) 2015 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
******************************************************************************/
#include <assert.h>
#include <stdlib.h>
#include "osi/include/allocator.h"
#include "osi/include/ringbuffer.h"
struct ringbuffer_t {
size_t total;
size_t available;
uint8_t *base;
uint8_t *head;
uint8_t *tail;
};
ringbuffer_t* ringbuffer_init(const size_t size) {
ringbuffer_t* p = osi_calloc(sizeof(ringbuffer_t));
if (p == 0)
return NULL;
p->base = osi_calloc(size);
if (p->base == 0) {
osi_free(p);
return NULL;
}
p->head = p->tail = p->base;
p->total = p->available = size;
return p;
}
void ringbuffer_free(ringbuffer_t *rb) {
if (rb != NULL)
osi_free(rb->base);
osi_free(rb);
}
size_t ringbuffer_available(const ringbuffer_t *rb) {
assert(rb);
return rb->available;
}
size_t ringbuffer_size(const ringbuffer_t *rb) {
assert(rb);
return rb->total - rb->available;
}
size_t ringbuffer_insert(ringbuffer_t *rb, const uint8_t *p, size_t length) {
assert(rb);
assert(p);
if (length > ringbuffer_available(rb))
length = ringbuffer_available(rb);
for (size_t i = 0; i != length; ++i) {
*rb->tail++ = *p++;
if (rb->tail >= (rb->base + rb->total))
rb->tail = rb->base;
}
rb->available -= length;
return length;
}
size_t ringbuffer_delete(ringbuffer_t *rb, size_t length) {
assert(rb);
if (length > ringbuffer_size(rb))
length = ringbuffer_size(rb);
rb->head += length;
if (rb->head >= (rb->base + rb->total))
rb->head -= rb->total;
rb->available += length;
return length;
}
size_t ringbuffer_peek(const ringbuffer_t *rb, uint8_t *p, size_t length) {
assert(rb);
assert(p);
uint8_t *b = rb->head;
size_t copied = 0;
while (copied < length && copied < ringbuffer_size(rb)) {
*p++ = *b++;
if (b >= (rb->base + rb->total))
b = rb->base;
++copied;
}
return copied;
}
size_t ringbuffer_pop(ringbuffer_t *rb, uint8_t *p, size_t length) {
assert(rb);
assert(p);
const size_t copied = ringbuffer_peek(rb, p, length);
rb->head += copied;
if (rb->head >= (rb->base + rb->total))
rb->head -= rb->total;
rb->available += copied;
return copied;
}
|
