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
|
/*
Copyright 2024 Northern.tech AS
This file is part of CFEngine 3 - written and maintained by Northern.tech AS.
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.
To the extent this program is licensed as part of the Enterprise
versions of CFEngine, the applicable Commercial Open Source License
(COSL) may apply to this file if you as a licensee so wish it. See
included file COSL.txt.
*/
#include <platform.h>
#include <ring_buffer.h>
#include <alloc.h>
#include <misc_lib.h>
struct RingBuffer_
{
void *(*copy)(const void *data);
void (*destroy)(void *data);
void **data;
size_t capacity;
size_t end;
size_t len;
};
struct RingBufferIterator_
{
const RingBuffer *buf;
size_t num_read;
};
RingBuffer *RingBufferNew(size_t capacity, void *(*copy)(const void *), void (*destroy)(void *))
{
assert(capacity > 0);
RingBuffer *buf = xmalloc(sizeof(RingBuffer));
buf->copy = copy;
buf->destroy = destroy;
buf->data = xcalloc(capacity, sizeof(void *));
buf->capacity = MAX(capacity, 1);
buf->len = 0;
buf->end = 0;
return buf;
}
void RingBufferAppend(RingBuffer *buf, void *item)
{
if (buf->data[buf->end] && buf->destroy)
{
buf->destroy(buf->data[buf->end]);
}
buf->data[buf->end] = buf->copy ? buf->copy(item) : item;
buf->end = (buf->end + 1) % buf->capacity;
if (buf->len < buf->capacity)
{
buf->len++;
}
}
void RingBufferClear(RingBuffer *buf)
{
if (buf->destroy)
{
for (size_t i = 0; i < buf->capacity; i++)
{
if (buf->data[i])
{
buf->destroy(buf->data[i]);
buf->data[i] = NULL;
}
}
}
buf->end = 0;
buf->len = 0;
}
size_t RingBufferLength(const RingBuffer *buf)
{
return buf->len;
}
bool RingBufferIsFull(const RingBuffer *buf)
{
return buf->len == buf->capacity;
}
const void *RingBufferHead(const RingBuffer *buf)
{
if (RingBufferLength(buf) == 0)
{
return NULL;
}
if (buf->end == 0)
{
return buf->data[buf->capacity - 1];
}
else
{
return buf->data[buf->end - 1];
}
}
RingBufferIterator *RingBufferIteratorNew(const RingBuffer *buf)
{
RingBufferIterator *iter = xmalloc(sizeof(RingBufferIterator));
iter->buf = buf;
iter->num_read = 0;
return iter;
}
void RingBufferDestroy(RingBuffer *buf)
{
if (buf)
{
RingBufferClear(buf);
free(buf->data);
free(buf);
}
}
void RingBufferIteratorDestroy(RingBufferIterator *iter)
{
if (iter)
{
free(iter);
}
}
const void *RingBufferIteratorNext(RingBufferIterator *iter)
{
if ((iter->buf->len - iter->num_read) == 0)
{
return NULL;
}
size_t offset = iter->num_read;
if (RingBufferIsFull(iter->buf))
{
offset = (iter->buf->end + iter->num_read) % iter->buf->capacity;
}
const void *data = iter->buf->data[offset];
iter->num_read++;
return data;
}
|
