/work/toxav/ring_buffer.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* SPDX-License-Identifier: GPL-3.0-or-later |
2 | | * Copyright © 2016-2025 The TokTok team. |
3 | | * Copyright © 2013 Tox project. |
4 | | * Copyright © 2013 plutooo |
5 | | */ |
6 | | #include "ring_buffer.h" |
7 | | |
8 | | #include <stdlib.h> |
9 | | |
10 | | #include "../toxcore/ccompat.h" |
11 | | |
12 | | struct RingBuffer { |
13 | | uint16_t size; /* Max size */ |
14 | | uint16_t start; |
15 | | uint16_t end; |
16 | | void **data; |
17 | | }; |
18 | | |
19 | | bool rb_full(const RingBuffer *b) |
20 | 6 | { |
21 | 6 | return (b->end + 1) % b->size == b->start; |
22 | 6 | } |
23 | | |
24 | | bool rb_empty(const RingBuffer *b) |
25 | 144 | { |
26 | 144 | return b->end == b->start; |
27 | 144 | } |
28 | | |
29 | | /** |
30 | | * @retval NULL on success |
31 | | * @return input value "p" on failure, so caller can free on failed rb_write |
32 | | */ |
33 | | void *rb_write(RingBuffer *b, void *p) |
34 | 482 | { |
35 | 482 | if (b == nullptr) { |
36 | 0 | return p; |
37 | 0 | } |
38 | | |
39 | 482 | void *rc = nullptr; |
40 | | |
41 | 482 | if ((b->end + 1) % b->size == b->start) { /* full */ |
42 | 8 | rc = b->data[b->start]; |
43 | 8 | } |
44 | | |
45 | 482 | b->data[b->end] = p; |
46 | 482 | b->end = (b->end + 1) % b->size; |
47 | | |
48 | 482 | if (b->end == b->start) { |
49 | 8 | b->start = (b->start + 1) % b->size; |
50 | 8 | } |
51 | | |
52 | 482 | return rc; |
53 | 482 | } |
54 | | |
55 | | bool rb_read(RingBuffer *b, void **p) |
56 | 239 | { |
57 | 239 | if (b->end == b->start) { /* Empty */ |
58 | 136 | *p = nullptr; |
59 | 136 | return false; |
60 | 136 | } |
61 | | |
62 | 103 | *p = b->data[b->start]; |
63 | 103 | b->start = (b->start + 1) % b->size; |
64 | 103 | return true; |
65 | 239 | } |
66 | | |
67 | | RingBuffer *rb_new(int size) |
68 | 48 | { |
69 | 48 | RingBuffer *buf = (RingBuffer *)calloc(1, sizeof(RingBuffer)); |
70 | | |
71 | 48 | if (buf == nullptr) { |
72 | 0 | return nullptr; |
73 | 0 | } |
74 | | |
75 | 48 | buf->size = size + 1; /* include empty elem */ |
76 | 48 | buf->data = (void **)calloc(buf->size, sizeof(void *)); |
77 | | |
78 | 48 | if (buf->data == nullptr) { |
79 | 0 | free(buf); |
80 | 0 | return nullptr; |
81 | 0 | } |
82 | | |
83 | 48 | return buf; |
84 | 48 | } |
85 | | |
86 | | void rb_kill(RingBuffer *b) |
87 | 48 | { |
88 | 48 | if (b != nullptr) { |
89 | 48 | free(b->data); |
90 | 48 | free(b); |
91 | 48 | } |
92 | 48 | } |
93 | | |
94 | | uint16_t rb_size(const RingBuffer *b) |
95 | 141 | { |
96 | 141 | if (rb_empty(b)) { |
97 | 77 | return 0; |
98 | 77 | } |
99 | | |
100 | 64 | return |
101 | 64 | b->end > b->start ? |
102 | 33 | b->end - b->start : |
103 | 64 | (b->size - b->start) + b->end; |
104 | 141 | } |
105 | | |
106 | | uint16_t rb_data(const RingBuffer *b, void **dest) |
107 | 6 | { |
108 | 6 | uint16_t i; |
109 | 6 | const uint16_t size = rb_size(b); |
110 | | |
111 | 18 | for (i = 0; i < size; ++i) { |
112 | 12 | dest[i] = b->data[(b->start + i) % b->size]; |
113 | 12 | } |
114 | | |
115 | 6 | return i; |
116 | 6 | } |