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
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
|
/* SPDX-License-Identifier: BSD-3-Clause
* Copyright(c) 2010-2014 Intel Corporation.
* Copyright (c) 2009, Olivier MATZ <zer0@droids-corp.org>
* All rights reserved.
*/
#include <string.h>
#include <errno.h>
#include <stdio.h>
#include "cmdline_cirbuf.h"
int
cirbuf_init(struct cirbuf *cbuf, char *buf, unsigned int start, unsigned int maxlen)
{
if (!cbuf || !buf)
return -EINVAL;
cbuf->maxlen = maxlen;
cbuf->len = 0;
cbuf->start = start;
cbuf->end = start;
cbuf->buf = buf;
return 0;
}
/* multiple add */
int
cirbuf_add_buf_head(struct cirbuf *cbuf, const char *c, unsigned int n)
{
unsigned int e;
if (!cbuf || !c || !n || n > CIRBUF_GET_FREELEN(cbuf))
return -EINVAL;
e = CIRBUF_IS_EMPTY(cbuf) ? 1 : 0;
if (n < cbuf->start + e) {
dprintf("s[%d] -> d[%d] (%d)\n", 0, cbuf->start - n + e, n);
memcpy(cbuf->buf + cbuf->start - n + e, c, n);
}
else {
dprintf("s[%d] -> d[%d] (%d)\n", + n - (cbuf->start + e), 0,
cbuf->start + e);
dprintf("s[%d] -> d[%d] (%d)\n", cbuf->maxlen - n +
(cbuf->start + e), 0, n - (cbuf->start + e));
memcpy(cbuf->buf, c + n - (cbuf->start + e) , cbuf->start + e);
memcpy(cbuf->buf + cbuf->maxlen - n + (cbuf->start + e), c,
n - (cbuf->start + e));
}
cbuf->len += n;
cbuf->start += (cbuf->maxlen - n + e);
cbuf->start %= cbuf->maxlen;
return n;
}
/* multiple add */
int
cirbuf_add_buf_tail(struct cirbuf *cbuf, const char *c, unsigned int n)
{
unsigned int e;
if (!cbuf || !c || !n || n > CIRBUF_GET_FREELEN(cbuf))
return -EINVAL;
e = CIRBUF_IS_EMPTY(cbuf) ? 1 : 0;
if (n < cbuf->maxlen - cbuf->end - 1 + e) {
dprintf("s[%d] -> d[%d] (%d)\n", 0, cbuf->end + !e, n);
memcpy(cbuf->buf + cbuf->end + !e, c, n);
}
else {
dprintf("s[%d] -> d[%d] (%d)\n", cbuf->end + !e, 0,
cbuf->maxlen - cbuf->end - 1 + e);
dprintf("s[%d] -> d[%d] (%d)\n", cbuf->maxlen - cbuf->end - 1 +
e, 0, n - cbuf->maxlen + cbuf->end + 1 - e);
memcpy(cbuf->buf + cbuf->end + !e, c, cbuf->maxlen -
cbuf->end - 1 + e);
memcpy(cbuf->buf, c + cbuf->maxlen - cbuf->end - 1 + e,
n - cbuf->maxlen + cbuf->end + 1 - e);
}
cbuf->len += n;
cbuf->end += n - e;
cbuf->end %= cbuf->maxlen;
return n;
}
/* add at head */
static inline void
__cirbuf_add_head(struct cirbuf * cbuf, char c)
{
if (!CIRBUF_IS_EMPTY(cbuf)) {
cbuf->start += (cbuf->maxlen - 1);
cbuf->start %= cbuf->maxlen;
}
cbuf->buf[cbuf->start] = c;
cbuf->len ++;
}
int
cirbuf_add_head_safe(struct cirbuf * cbuf, char c)
{
if (cbuf && !CIRBUF_IS_FULL(cbuf)) {
__cirbuf_add_head(cbuf, c);
return 0;
}
return -EINVAL;
}
void
cirbuf_add_head(struct cirbuf * cbuf, char c)
{
__cirbuf_add_head(cbuf, c);
}
/* add at tail */
static inline void
__cirbuf_add_tail(struct cirbuf * cbuf, char c)
{
if (!CIRBUF_IS_EMPTY(cbuf)) {
cbuf->end ++;
cbuf->end %= cbuf->maxlen;
}
cbuf->buf[cbuf->end] = c;
cbuf->len ++;
}
int
cirbuf_add_tail_safe(struct cirbuf * cbuf, char c)
{
if (cbuf && !CIRBUF_IS_FULL(cbuf)) {
__cirbuf_add_tail(cbuf, c);
return 0;
}
return -EINVAL;
}
void
cirbuf_add_tail(struct cirbuf * cbuf, char c)
{
__cirbuf_add_tail(cbuf, c);
}
static inline void
__cirbuf_shift_left(struct cirbuf *cbuf)
{
unsigned int i;
char tmp = cbuf->buf[cbuf->start];
for (i=0 ; i<cbuf->len ; i++) {
cbuf->buf[(cbuf->start+i)%cbuf->maxlen] =
cbuf->buf[(cbuf->start+i+1)%cbuf->maxlen];
}
cbuf->buf[(cbuf->start-1+cbuf->maxlen)%cbuf->maxlen] = tmp;
cbuf->start += (cbuf->maxlen - 1);
cbuf->start %= cbuf->maxlen;
cbuf->end += (cbuf->maxlen - 1);
cbuf->end %= cbuf->maxlen;
}
static inline void
__cirbuf_shift_right(struct cirbuf *cbuf)
{
unsigned int i;
char tmp = cbuf->buf[cbuf->end];
for (i=0 ; i<cbuf->len ; i++) {
cbuf->buf[(cbuf->end+cbuf->maxlen-i)%cbuf->maxlen] =
cbuf->buf[(cbuf->end+cbuf->maxlen-i-1)%cbuf->maxlen];
}
cbuf->buf[(cbuf->end+1)%cbuf->maxlen] = tmp;
cbuf->start += 1;
cbuf->start %= cbuf->maxlen;
cbuf->end += 1;
cbuf->end %= cbuf->maxlen;
}
/* XXX we could do a better algorithm here... */
int
cirbuf_align_left(struct cirbuf * cbuf)
{
if (!cbuf)
return -EINVAL;
if (cbuf->start < cbuf->maxlen/2) {
while (cbuf->start != 0) {
__cirbuf_shift_left(cbuf);
}
}
else {
while (cbuf->start != 0) {
__cirbuf_shift_right(cbuf);
}
}
return 0;
}
/* XXX we could do a better algorithm here... */
int
cirbuf_align_right(struct cirbuf * cbuf)
{
if (!cbuf)
return -EINVAL;
if (cbuf->start >= cbuf->maxlen/2) {
while (cbuf->end != cbuf->maxlen-1) {
__cirbuf_shift_left(cbuf);
}
}
else {
while (cbuf->start != cbuf->maxlen-1) {
__cirbuf_shift_right(cbuf);
}
}
return 0;
}
/* buffer del */
int
cirbuf_del_buf_head(struct cirbuf *cbuf, unsigned int size)
{
if (!cbuf || !size || size > CIRBUF_GET_LEN(cbuf))
return -EINVAL;
cbuf->len -= size;
if (CIRBUF_IS_EMPTY(cbuf)) {
cbuf->start += size - 1;
cbuf->start %= cbuf->maxlen;
}
else {
cbuf->start += size;
cbuf->start %= cbuf->maxlen;
}
return 0;
}
/* buffer del */
int
cirbuf_del_buf_tail(struct cirbuf *cbuf, unsigned int size)
{
if (!cbuf || !size || size > CIRBUF_GET_LEN(cbuf))
return -EINVAL;
cbuf->len -= size;
if (CIRBUF_IS_EMPTY(cbuf)) {
cbuf->end += (cbuf->maxlen - size + 1);
cbuf->end %= cbuf->maxlen;
}
else {
cbuf->end += (cbuf->maxlen - size);
cbuf->end %= cbuf->maxlen;
}
return 0;
}
/* del at head */
static inline void
__cirbuf_del_head(struct cirbuf * cbuf)
{
cbuf->len --;
if (!CIRBUF_IS_EMPTY(cbuf)) {
cbuf->start ++;
cbuf->start %= cbuf->maxlen;
}
}
int
cirbuf_del_head_safe(struct cirbuf * cbuf)
{
if (cbuf && !CIRBUF_IS_EMPTY(cbuf)) {
__cirbuf_del_head(cbuf);
return 0;
}
return -EINVAL;
}
void
cirbuf_del_head(struct cirbuf * cbuf)
{
__cirbuf_del_head(cbuf);
}
/* del at tail */
static inline void
__cirbuf_del_tail(struct cirbuf * cbuf)
{
cbuf->len --;
if (!CIRBUF_IS_EMPTY(cbuf)) {
cbuf->end += (cbuf->maxlen - 1);
cbuf->end %= cbuf->maxlen;
}
}
int
cirbuf_del_tail_safe(struct cirbuf * cbuf)
{
if (cbuf && !CIRBUF_IS_EMPTY(cbuf)) {
__cirbuf_del_tail(cbuf);
return 0;
}
return -EINVAL;
}
void
cirbuf_del_tail(struct cirbuf * cbuf)
{
__cirbuf_del_tail(cbuf);
}
/* convert to buffer */
int
cirbuf_get_buf_head(struct cirbuf *cbuf, char *c, unsigned int size)
{
unsigned int n;
if (!cbuf || !c)
return -EINVAL;
n = (size < CIRBUF_GET_LEN(cbuf)) ? size : CIRBUF_GET_LEN(cbuf);
if (!n)
return 0;
if (cbuf->start <= cbuf->end) {
dprintf("s[%d] -> d[%d] (%d)\n", cbuf->start, 0, n);
memcpy(c, cbuf->buf + cbuf->start , n);
}
else {
/* check if we need to go from end to the beginning */
if (n <= cbuf->maxlen - cbuf->start) {
dprintf("s[%d] -> d[%d] (%d)\n", 0, cbuf->start, n);
memcpy(c, cbuf->buf + cbuf->start , n);
}
else {
dprintf("s[%d] -> d[%d] (%d)\n", cbuf->start, 0,
cbuf->maxlen - cbuf->start);
dprintf("s[%d] -> d[%d] (%d)\n", 0, cbuf->maxlen - cbuf->start,
n - cbuf->maxlen + cbuf->start);
memcpy(c, cbuf->buf + cbuf->start , cbuf->maxlen - cbuf->start);
memcpy(c + cbuf->maxlen - cbuf->start, cbuf->buf,
n - cbuf->maxlen + cbuf->start);
}
}
return n;
}
/* convert to buffer */
int
cirbuf_get_buf_tail(struct cirbuf *cbuf, char *c, unsigned int size)
{
unsigned int n;
if (!cbuf || !c)
return -EINVAL;
n = (size < CIRBUF_GET_LEN(cbuf)) ? size : CIRBUF_GET_LEN(cbuf);
if (!n)
return 0;
if (cbuf->start <= cbuf->end) {
dprintf("s[%d] -> d[%d] (%d)\n", cbuf->end - n + 1, 0, n);
memcpy(c, cbuf->buf + cbuf->end - n + 1, n);
}
else {
/* check if we need to go from end to the beginning */
if (n <= cbuf->end + 1) {
dprintf("s[%d] -> d[%d] (%d)\n", 0, cbuf->end - n + 1, n);
memcpy(c, cbuf->buf + cbuf->end - n + 1, n);
}
else {
dprintf("s[%d] -> d[%d] (%d)\n", 0,
cbuf->maxlen - cbuf->start, cbuf->end + 1);
dprintf("s[%d] -> d[%d] (%d)\n",
cbuf->maxlen - n + cbuf->end + 1, 0, n - cbuf->end - 1);
memcpy(c + cbuf->maxlen - cbuf->start,
cbuf->buf, cbuf->end + 1);
memcpy(c, cbuf->buf + cbuf->maxlen - n + cbuf->end +1,
n - cbuf->end - 1);
}
}
return n;
}
/* get head or get tail */
char
cirbuf_get_head(struct cirbuf * cbuf)
{
return cbuf->buf[cbuf->start];
}
/* get head or get tail */
char
cirbuf_get_tail(struct cirbuf * cbuf)
{
return cbuf->buf[cbuf->end];
}
|
