FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavutil/fifo.c
Date: 2024-04-25 15:36:26
Exec Total Coverage
Lines: 126 141 89.4%
Functions: 16 18 88.9%
Branches: 59 74 79.7%
Line Branch Exec Source
1 /*
2 * a very simple circular buffer FIFO implementation
3 * Copyright (c) 2000, 2001, 2002 Fabrice Bellard
4 * Copyright (c) 2006 Roman Shaposhnik
5 *
6 * This file is part of FFmpeg.
7 *
8 * FFmpeg is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
12 *
13 * FFmpeg is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
17 *
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with FFmpeg; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 */
22
23 #include <stdint.h>
24 #include <string.h>
25
26 #include "avassert.h"
27 #include "error.h"
28 #include "fifo.h"
29 #include "macros.h"
30 #include "mem.h"
31
32 // by default the FIFO can be auto-grown to 1MB
33 #define AUTO_GROW_DEFAULT_BYTES (1024 * 1024)
34
35 struct AVFifo {
36 uint8_t *buffer;
37
38 size_t elem_size, nb_elems;
39 size_t offset_r, offset_w;
40 // distinguishes the ambiguous situation offset_r == offset_w
41 int is_empty;
42
43 unsigned int flags;
44 size_t auto_grow_limit;
45 };
46
47 49398 AVFifo *av_fifo_alloc2(size_t nb_elems, size_t elem_size,
48 unsigned int flags)
49 {
50 AVFifo *f;
51 49398 void *buffer = NULL;
52
53
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 49398 times.
 49398 if (!elem_size)
54 ✗ return NULL;
55
56
1/2
✓ Branch 0 taken 49398 times.
✗ Branch 1 not taken.
 49398 if (nb_elems) {
57 49398 buffer = av_realloc_array(NULL, nb_elems, elem_size);
58
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 49398 times.
 49398 if (!buffer)
59 ✗ return NULL;
60 }
61 49398 f = av_mallocz(sizeof(*f));
62
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 49398 times.
 49398 if (!f) {
63 ✗ av_free(buffer);
64 ✗ return NULL;
65 }
66 49398 f->buffer = buffer;
67 49398 f->nb_elems = nb_elems;
68 49398 f->elem_size = elem_size;
69 49398 f->is_empty = 1;
70
71 49398 f->flags = flags;
72 49398 f->auto_grow_limit = FFMAX(AUTO_GROW_DEFAULT_BYTES / elem_size, 1);
73
74 49398 return f;
75 }
76
77 ✗ void av_fifo_auto_grow_limit(AVFifo *f, size_t max_elems)
78 {
79 ✗ f->auto_grow_limit = max_elems;
80 ✗ }
81
82 1 size_t av_fifo_elem_size(const AVFifo *f)
83 {
84 1 return f->elem_size;
85 }
86
87 15039699 size_t av_fifo_can_read(const AVFifo *f)
88 {
89
4/4
✓ Branch 0 taken 11313249 times.
✓ Branch 1 taken 3726450 times.
✓ Branch 2 taken 4435471 times.
✓ Branch 3 taken 6877778 times.
 15039699 if (f->offset_w <= f->offset_r && !f->is_empty)
90 4435471 return f->nb_elems - f->offset_r + f->offset_w;
91 10604228 return f->offset_w - f->offset_r;
92 }
93
94 3860418 size_t av_fifo_can_write(const AVFifo *f)
95 {
96 3860418 return f->nb_elems - av_fifo_can_read(f);
97 }
98
99 580 int av_fifo_grow2(AVFifo *f, size_t inc)
100 {
101 uint8_t *tmp;
102
103
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 580 times.
 580 if (inc > SIZE_MAX - f->nb_elems)
104 ✗ return AVERROR(EINVAL);
105
106 580 tmp = av_realloc_array(f->buffer, f->nb_elems + inc, f->elem_size);
107
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 580 times.
 580 if (!tmp)
108 ✗ return AVERROR(ENOMEM);
109 580 f->buffer = tmp;
110
111 // move the data from the beginning of the ring buffer
112 // to the newly allocated space
113
4/4
✓ Branch 0 taken 572 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 554 times.
✓ Branch 3 taken 18 times.
 580 if (f->offset_w <= f->offset_r && !f->is_empty) {
114 554 const size_t copy = FFMIN(inc, f->offset_w);
115 554 memcpy(tmp + f->nb_elems * f->elem_size, tmp, copy * f->elem_size);
116
2/2
✓ Branch 0 taken 37 times.
✓ Branch 1 taken 517 times.
 554 if (copy < f->offset_w) {
117 37 memmove(tmp, tmp + copy * f->elem_size,
118 37 (f->offset_w - copy) * f->elem_size);
119 37 f->offset_w -= copy;
120 } else
121
2/2
✓ Branch 0 taken 511 times.
✓ Branch 1 taken 6 times.
 517 f->offset_w = copy == inc ? 0 : f->nb_elems + copy;
122 }
123
124 580 f->nb_elems += inc;
125
126 580 return 0;
127 }
128
129 1709186 static int fifo_check_space(AVFifo *f, size_t to_write)
130 {
131 1709186 const size_t can_write = av_fifo_can_write(f);
132
2/2
✓ Branch 0 taken 250 times.
✓ Branch 1 taken 1708936 times.
 1709186 const size_t need_grow = to_write > can_write ? to_write - can_write : 0;
133 size_t can_grow;
134
135
2/2
✓ Branch 0 taken 1708936 times.
✓ Branch 1 taken 250 times.
 1709186 if (!need_grow)
136 1708936 return 0;
137
138 500 can_grow = f->auto_grow_limit > f->nb_elems ?
139
1/2
✓ Branch 0 taken 250 times.
✗ Branch 1 not taken.
 250 f->auto_grow_limit - f->nb_elems : 0;
140
2/4
✓ Branch 0 taken 250 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 250 times.
✗ Branch 3 not taken.
 250 if ((f->flags & AV_FIFO_FLAG_AUTO_GROW) && need_grow <= can_grow) {
141 // allocate a bit more than necessary, if we can
142
1/2
✓ Branch 0 taken 250 times.
✗ Branch 1 not taken.
 250 const size_t inc = (need_grow < can_grow / 2 ) ? need_grow * 2 : can_grow;
143 250 return av_fifo_grow2(f, inc);
144 }
145
146 ✗ return AVERROR(ENOSPC);
147 }
148
149 1709186 static int fifo_write_common(AVFifo *f, const uint8_t *buf, size_t *nb_elems,
150 AVFifoCB read_cb, void *opaque)
151 {
152 1709186 size_t to_write = *nb_elems;
153 size_t offset_w;
154 1709186 int ret = 0;
155
156 1709186 ret = fifo_check_space(f, to_write);
157
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1709186 times.
 1709186 if (ret < 0)
158 ✗ return ret;
159
160 1709186 offset_w = f->offset_w;
161
162
2/2
✓ Branch 0 taken 1703948 times.
✓ Branch 1 taken 1709154 times.
 3413102 while (to_write > 0) {
163 1703948 size_t len = FFMIN(f->nb_elems - offset_w, to_write);
164 1703948 uint8_t *wptr = f->buffer + offset_w * f->elem_size;
165
166
2/2
✓ Branch 0 taken 69 times.
✓ Branch 1 taken 1703879 times.
 1703948 if (read_cb) {
167 69 ret = read_cb(opaque, wptr, &len);
168
3/4
✓ Branch 0 taken 69 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 37 times.
✓ Branch 3 taken 32 times.
 69 if (ret < 0 || len == 0)
169 break;
170 } else {
171 1703879 memcpy(wptr, buf, len * f->elem_size);
172 1703879 buf += len * f->elem_size;
173 }
174 1703916 offset_w += len;
175
2/2
✓ Branch 0 taken 223472 times.
✓ Branch 1 taken 1480444 times.
 1703916 if (offset_w >= f->nb_elems)
176 223472 offset_w = 0;
177 1703916 to_write -= len;
178 }
179 1709186 f->offset_w = offset_w;
180
181
2/2
✓ Branch 0 taken 1699208 times.
✓ Branch 1 taken 9978 times.
 1709186 if (*nb_elems != to_write)
182 1699208 f->is_empty = 0;
183 1709186 *nb_elems -= to_write;
184
185 1709186 return ret;
186 }
187
188 1709154 int av_fifo_write(AVFifo *f, const void *buf, size_t nb_elems)
189 {
190 1709154 return fifo_write_common(f, buf, &nb_elems, NULL, NULL);
191 }
192
193 32 int av_fifo_write_from_cb(AVFifo *f, AVFifoCB read_cb,
194 void *opaque, size_t *nb_elems)
195 {
196 32 return fifo_write_common(f, NULL, nb_elems, read_cb, opaque);
197 }
198
199 3169988 static int fifo_peek_common(const AVFifo *f, uint8_t *buf, size_t *nb_elems,
200 size_t offset, AVFifoCB write_cb, void *opaque)
201 {
202 3169988 size_t to_read = *nb_elems;
203 3169988 size_t offset_r = f->offset_r;
204 3169988 size_t can_read = av_fifo_can_read(f);
205 3169988 int ret = 0;
206
207
3/4
✓ Branch 0 taken 3169988 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 1031391 times.
✓ Branch 3 taken 2138597 times.
 3169988 if (offset > can_read || to_read > can_read - offset) {
208 1031391 *nb_elems = 0;
209 1031391 return AVERROR(EINVAL);
210 }
211
212
2/2
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 2138591 times.
 2138597 if (offset_r >= f->nb_elems - offset)
213 6 offset_r -= f->nb_elems - offset;
214 else
215 2138591 offset_r += offset;
216
217
2/2
✓ Branch 0 taken 2143403 times.
✓ Branch 1 taken 2138533 times.
 4281936 while (to_read > 0) {
218 2143403 size_t len = FFMIN(f->nb_elems - offset_r, to_read);
219 2143403 uint8_t *rptr = f->buffer + offset_r * f->elem_size;
220
221
2/2
✓ Branch 0 taken 13033 times.
✓ Branch 1 taken 2130370 times.
 2143403 if (write_cb) {
222 13033 ret = write_cb(opaque, rptr, &len);
223
3/4
✓ Branch 0 taken 13033 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 12969 times.
✓ Branch 3 taken 64 times.
 13033 if (ret < 0 || len == 0)
224 break;
225 } else {
226 2130370 memcpy(buf, rptr, len * f->elem_size);
227 2130370 buf += len * f->elem_size;
228 }
229 2143339 offset_r += len;
230
2/2
✓ Branch 0 taken 324500 times.
✓ Branch 1 taken 1818839 times.
 2143339 if (offset_r >= f->nb_elems)
231 324500 offset_r = 0;
232 2143339 to_read -= len;
233 }
234
235 2138597 *nb_elems -= to_read;
236
237 2138597 return ret;
238 }
239
240 2669157 int av_fifo_read(AVFifo *f, void *buf, size_t nb_elems)
241 {
242 2669157 int ret = fifo_peek_common(f, buf, &nb_elems, 0, NULL, NULL);
243 2669157 av_fifo_drain2(f, nb_elems);
244 2669157 return ret;
245 }
246
247 8195 int av_fifo_read_to_cb(AVFifo *f, AVFifoCB write_cb,
248 void *opaque, size_t *nb_elems)
249 {
250 8195 int ret = fifo_peek_common(f, NULL, nb_elems, 0, write_cb, opaque);
251 8195 av_fifo_drain2(f, *nb_elems);
252 8195 return ret;
253 }
254
255 492604 int av_fifo_peek(const AVFifo *f, void *buf, size_t nb_elems, size_t offset)
256 {
257 492604 return fifo_peek_common(f, buf, &nb_elems, offset, NULL, NULL);
258 }
259
260 32 int av_fifo_peek_to_cb(const AVFifo *f, AVFifoCB write_cb, void *opaque,
261 size_t *nb_elems, size_t offset)
262 {
263 32 return fifo_peek_common(f, NULL, nb_elems, offset, write_cb, opaque);
264 }
265
266 2709165 void av_fifo_drain2(AVFifo *f, size_t size)
267 {
268 2709165 const size_t cur_size = av_fifo_can_read(f);
269
270
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2709165 times.
 2709165 av_assert0(cur_size >= size);
271
2/2
✓ Branch 0 taken 1992529 times.
✓ Branch 1 taken 716636 times.
 2709165 if (cur_size == size)
272 1992529 f->is_empty = 1;
273
274
2/2
✓ Branch 0 taken 222959 times.
✓ Branch 1 taken 2486206 times.
 2709165 if (f->offset_r >= f->nb_elems - size)
275 222959 f->offset_r -= f->nb_elems - size;
276 else
277 2486206 f->offset_r += size;
278 2709165 }
279
280 ✗ void av_fifo_reset2(AVFifo *f)
281 {
282 ✗ f->offset_r = f->offset_w = 0;
283 ✗ f->is_empty = 1;
284 ✗ }
285
286 49676 void av_fifo_freep2(AVFifo **f)
287 {
288
2/2
✓ Branch 0 taken 49398 times.
✓ Branch 1 taken 278 times.
 49676 if (*f) {
289 49398 av_freep(&(*f)->buffer);
290 49398 av_freep(f);
291 }
292 49676 }
293