FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libswscale/slice.c
Date: 2025-03-08 20:38:41
Exec Total Coverage
Lines: 212 227 93.4%
Functions: 10 10 100.0%
Branches: 126 154 81.8%
Line Branch Exec Source
1 /*
2 * Copyright (C) 2015 Pedro Arthur <bygrandao@gmail.com>
3 *
4 * This file is part of FFmpeg.
5 *
6 * FFmpeg is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
10 *
11 * FFmpeg is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with FFmpeg; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21 #include "libavutil/mem.h"
22 #include "swscale_internal.h"
23
24 31690 static void free_lines(SwsSlice *s)
25 {
26 int i;
27
2/2
✓ Branch 0 taken 63380 times.
✓ Branch 1 taken 31690 times.
 95070 for (i = 0; i < 2; ++i) {
28 63380 int n = s->plane[i].available_lines;
29 int j;
30
2/2
✓ Branch 0 taken 400681 times.
✓ Branch 1 taken 63380 times.
 464061 for (j = 0; j < n; ++j) {
31 400681 av_freep(&s->plane[i].line[j]);
32
2/2
✓ Branch 0 taken 271412 times.
✓ Branch 1 taken 129269 times.
 400681 if (s->is_ring)
33 271412 s->plane[i].line[j+n] = NULL;
34 }
35 }
36
37
2/2
✓ Branch 0 taken 126760 times.
✓ Branch 1 taken 31690 times.
 158450 for (i = 0; i < 4; ++i)
38
2/2
✓ Branch 0 taken 83436 times.
✓ Branch 1 taken 43324 times.
 126760 memset(s->plane[i].line, 0, sizeof(uint8_t*) * s->plane[i].available_lines * (s->is_ring ? 3 : 1));
39 31690 s->should_free_lines = 0;
40 31690 }
41
42 /*
43 slice lines contains extra bytes for vectorial code thus @size
44 is the allocated memory size and @width is the number of pixels
45 */
46 31690 static int alloc_lines(SwsSlice *s, int size, int width)
47 {
48 int i;
49 31690 int idx[2] = {3, 2};
50
51 31690 s->should_free_lines = 1;
52 31690 s->width = width;
53
54
2/2
✓ Branch 0 taken 63380 times.
✓ Branch 1 taken 31690 times.
 95070 for (i = 0; i < 2; ++i) {
55 63380 int n = s->plane[i].available_lines;
56 int j;
57 63380 int ii = idx[i];
58
59
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 63380 times.
 63380 av_assert0(n == s->plane[ii].available_lines);
60
2/2
✓ Branch 0 taken 400681 times.
✓ Branch 1 taken 63380 times.
 464061 for (j = 0; j < n; ++j) {
61 // chroma plane line U and V are expected to be contiguous in memory
62 // by mmx vertical scaler code
63 400681 s->plane[i].line[j] = av_mallocz(size * 2 + 32);
64
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 400681 times.
 400681 if (!s->plane[i].line[j]) {
65 ✗ free_lines(s);
66 ✗ return AVERROR(ENOMEM);
67 }
68 400681 s->plane[ii].line[j] = s->plane[i].line[j] + size + 16;
69
2/2
✓ Branch 0 taken 271412 times.
✓ Branch 1 taken 129269 times.
 400681 if (s->is_ring) {
70 271412 s->plane[i].line[j+n] = s->plane[i].line[j];
71 271412 s->plane[ii].line[j+n] = s->plane[ii].line[j];
72 }
73 }
74 }
75
76 31690 return 0;
77 }
78
79 73408 static int alloc_slice(SwsSlice *s, enum AVPixelFormat fmt, int lumLines, int chrLines, int h_sub_sample, int v_sub_sample, int ring)
80 {
81 int i;
82 73408 int size[4] = { lumLines,
83 chrLines,
84 chrLines,
85 lumLines };
86
87 73408 s->h_chr_sub_sample = h_sub_sample;
88 73408 s->v_chr_sub_sample = v_sub_sample;
89 73408 s->fmt = fmt;
90 73408 s->is_ring = ring;
91 73408 s->should_free_lines = 0;
92
93
2/2
✓ Branch 0 taken 293632 times.
✓ Branch 1 taken 73408 times.
 367040 for (i = 0; i < 4; ++i) {
94
2/2
✓ Branch 0 taken 210196 times.
✓ Branch 1 taken 83436 times.
 293632 int n = size[i] * ( ring == 0 ? 1 : 3);
95 293632 s->plane[i].line = av_calloc(n, sizeof(*s->plane[i].line));
96
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 293632 times.
 293632 if (!s->plane[i].line)
97 ✗ return AVERROR(ENOMEM);
98
99
2/2
✓ Branch 0 taken 83436 times.
✓ Branch 1 taken 210196 times.
 293632 s->plane[i].tmp = ring ? s->plane[i].line + size[i] * 2 : NULL;
100 293632 s->plane[i].available_lines = size[i];
101 293632 s->plane[i].sliceY = 0;
102 293632 s->plane[i].sliceH = 0;
103 }
104 73408 return 0;
105 }
106
107 73408 static void free_slice(SwsSlice *s)
108 {
109 int i;
110
1/2
✓ Branch 0 taken 73408 times.
✗ Branch 1 not taken.
 73408 if (s) {
111
2/2
✓ Branch 0 taken 31690 times.
✓ Branch 1 taken 41718 times.
 73408 if (s->should_free_lines)
112 31690 free_lines(s);
113
2/2
✓ Branch 0 taken 293632 times.
✓ Branch 1 taken 73408 times.
 367040 for (i = 0; i < 4; ++i) {
114 293632 av_freep(&s->plane[i].line);
115 293632 s->plane[i].tmp = NULL;
116 }
117 }
118 73408 }
119
120 22617311 int ff_rotate_slice(SwsSlice *s, int lum, int chr)
121 {
122 int i;
123
2/2
✓ Branch 0 taken 22612960 times.
✓ Branch 1 taken 4351 times.
 22617311 if (lum) {
124
2/2
✓ Branch 0 taken 45225920 times.
✓ Branch 1 taken 22612960 times.
 67838880 for (i = 0; i < 4; i+=3) {
125 45225920 int n = s->plane[i].available_lines;
126 45225920 int l = lum - s->plane[i].sliceY;
127
128
2/2
✓ Branch 0 taken 6329858 times.
✓ Branch 1 taken 38896062 times.
 45225920 if (l >= n * 2) {
129 6329858 s->plane[i].sliceY += n;
130 6329858 s->plane[i].sliceH -= n;
131 }
132 }
133 }
134
2/2
✓ Branch 0 taken 22603297 times.
✓ Branch 1 taken 14014 times.
 22617311 if (chr) {
135
2/2
✓ Branch 0 taken 45206594 times.
✓ Branch 1 taken 22603297 times.
 67809891 for (i = 1; i < 3; ++i) {
136 45206594 int n = s->plane[i].available_lines;
137 45206594 int l = chr - s->plane[i].sliceY;
138
139
2/2
✓ Branch 0 taken 3886270 times.
✓ Branch 1 taken 41320324 times.
 45206594 if (l >= n * 2) {
140 3886270 s->plane[i].sliceY += n;
141 3886270 s->plane[i].sliceH -= n;
142 }
143 }
144 }
145 22617311 return 0;
146 }
147
148 813628 int ff_init_slice_from_src(SwsSlice * s, uint8_t *const src[4], const int stride[4],
149 int srcW, int lumY, int lumH, int chrY, int chrH, int relative)
150 {
151 813628 int i = 0;
152
153 813628 const int start[4] = {lumY,
154 chrY,
155 chrY,
156 lumY};
157
158 813628 const int end[4] = {lumY +lumH,
159 813628 chrY + chrH,
160 813628 chrY + chrH,
161 813628 lumY + lumH};
162
163 813628 s->width = srcW;
164
165
4/4
✓ Branch 0 taken 2907830 times.
✓ Branch 1 taken 104547 times.
✓ Branch 2 taken 2198749 times.
✓ Branch 3 taken 709081 times.
 3012377 for (i = 0; i < 4 && src[i] != NULL; ++i) {
166
2/2
✓ Branch 0 taken 83212 times.
✓ Branch 1 taken 2115537 times.
 2198749 uint8_t *const src_i = src[i] + (relative ? 0 : start[i]) * stride[i];
167 int j;
168 2198749 int first = s->plane[i].sliceY;
169 2198749 int n = s->plane[i].available_lines;
170 2198749 int lines = end[i] - start[i];
171 2198749 int tot_lines = end[i] - first;
172
173
4/4
✓ Branch 0 taken 2198740 times.
✓ Branch 1 taken 9 times.
✓ Branch 2 taken 2198674 times.
✓ Branch 3 taken 66 times.
 2198749 if (start[i] >= first && n >= tot_lines) {
174 2198674 s->plane[i].sliceH = FFMAX(tot_lines, s->plane[i].sliceH);
175
2/2
✓ Branch 0 taken 379172413 times.
✓ Branch 1 taken 2198674 times.
 381371087 for (j = 0; j < lines; j+= 1)
176 379172413 s->plane[i].line[start[i] - first + j] = src_i + j * stride[i];
177 } else {
178 75 s->plane[i].sliceY = start[i];
179 75 lines = lines > n ? n : lines;
180 75 s->plane[i].sliceH = lines;
181
2/2
✓ Branch 0 taken 6980 times.
✓ Branch 1 taken 75 times.
 7055 for (j = 0; j < lines; j+= 1)
182 6980 s->plane[i].line[j] = src_i + j * stride[i];
183 }
184
185 }
186
187 813628 return 0;
188 }
189
190 20859 static void fill_ones(SwsSlice *s, int n, int bpc)
191 {
192 int i, j, k, size, end;
193
194
2/2
✓ Branch 0 taken 83436 times.
✓ Branch 1 taken 20859 times.
 104295 for (i = 0; i < 4; ++i) {
195 83436 size = s->plane[i].available_lines;
196
2/2
✓ Branch 0 taken 542824 times.
✓ Branch 1 taken 83436 times.
 626260 for (j = 0; j < size; ++j) {
197
2/2
✓ Branch 0 taken 108440 times.
✓ Branch 1 taken 434384 times.
 542824 if (bpc >= 16) {
198 108440 end = (n>>1) + 1;
199
2/2
✓ Branch 0 taken 56869240 times.
✓ Branch 1 taken 108440 times.
 56977680 for (k = 0; k < end; ++k)
200 56869240 ((int32_t*)(s->plane[i].line[j]))[k] = 1<<18;
201 } else {
202 434384 end = n + 1;
203
2/2
✓ Branch 0 taken 208401488 times.
✓ Branch 1 taken 434384 times.
 208835872 for (k = 0; k < end; ++k)
204 208401488 ((int16_t*)(s->plane[i].line[j]))[k] = 1<<14;
205 }
206 }
207 }
208 20859 }
209
210 /*
211 Calculates the minimum ring buffer size, it should be able to store vFilterSize
212 more n lines where n is the max difference between each adjacent slice which
213 outputs a line.
214 The n lines are needed only when there is not enough src lines to output a single
215 dst line, then we should buffer these lines to process them on the next call to scale.
216 */
217 20859 static void get_min_buffer_size(SwsInternal *c, int *out_lum_size, int *out_chr_size)
218 {
219 int lumY;
220 20859 int dstH = c->opts.dst_h;
221 20859 int chrDstH = c->chrDstH;
222 20859 int *lumFilterPos = c->vLumFilterPos;
223 20859 int *chrFilterPos = c->vChrFilterPos;
224 20859 int lumFilterSize = c->vLumFilterSize;
225 20859 int chrFilterSize = c->vChrFilterSize;
226 20859 int chrSubSample = c->chrSrcVSubSample;
227
228 20859 *out_lum_size = lumFilterSize;
229 20859 *out_chr_size = chrFilterSize;
230
231
2/2
✓ Branch 0 taken 8022415 times.
✓ Branch 1 taken 20859 times.
 8043274 for (lumY = 0; lumY < dstH; lumY++) {
232 8022415 int chrY = (int64_t)lumY * chrDstH / dstH;
233 8022415 int nextSlice = FFMAX(lumFilterPos[lumY] + lumFilterSize - 1,
234 ((chrFilterPos[chrY] + chrFilterSize - 1)
235 << chrSubSample));
236
237 8022415 nextSlice >>= chrSubSample;
238 8022415 nextSlice <<= chrSubSample;
239 8022415 (*out_lum_size) = FFMAX((*out_lum_size), nextSlice - lumFilterPos[lumY]);
240 8022415 (*out_chr_size) = FFMAX((*out_chr_size), (nextSlice >> chrSubSample) - chrFilterPos[chrY]);
241 }
242 20859 }
243
244
245
246 20859 int ff_init_filters(SwsInternal * c)
247 {
248 int i;
249 int index;
250 int num_ydesc;
251 int num_cdesc;
252
3/4
✓ Branch 1 taken 9559 times.
✓ Branch 2 taken 11300 times.
✓ Branch 4 taken 9559 times.
✗ Branch 5 not taken.
 20859 int num_vdesc = isPlanarYUV(c->opts.dst_format) && !isGray(c->opts.dst_format) ? 2 : 1;
253
6/8
✓ Branch 0 taken 14243 times.
✓ Branch 1 taken 6616 times.
✓ Branch 2 taken 10568 times.
✓ Branch 3 taken 3675 times.
✓ Branch 4 taken 10568 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✓ Branch 7 taken 10568 times.
 20859 int need_lum_conv = c->lumToYV12 || c->readLumPlanar || c->alpToYV12 || c->readAlpPlanar;
254
4/4
✓ Branch 0 taken 13799 times.
✓ Branch 1 taken 7060 times.
✓ Branch 2 taken 3255 times.
✓ Branch 3 taken 10544 times.
 20859 int need_chr_conv = c->chrToYV12 || c->readChrPlanar;
255 20859 int need_gamma = c->is_internal_gamma;
256 int srcIdx, dstIdx;
257 20859 int dst_stride = FFALIGN(c->opts.dst_w * sizeof(int16_t) + 66, 16);
258
259
2/2
✓ Branch 1 taken 92 times.
✓ Branch 2 taken 20767 times.
 20859 uint32_t * pal = usePal(c->opts.src_format) ? c->pal_yuv : (uint32_t*)c->input_rgb2yuv_table;
260 20859 int res = 0;
261
262 int lumBufSize;
263 int chrBufSize;
264
265 20859 get_min_buffer_size(c, &lumBufSize, &chrBufSize);
266 20859 lumBufSize = FFMAX(lumBufSize, c->vLumFilterSize + MAX_LINES_AHEAD);
267 20859 chrBufSize = FFMAX(chrBufSize, c->vChrFilterSize + MAX_LINES_AHEAD);
268
269
2/2
✓ Branch 0 taken 3941 times.
✓ Branch 1 taken 16918 times.
 20859 if (c->dstBpc == 16)
270 3941 dst_stride <<= 1;
271
272
2/2
✓ Branch 0 taken 535 times.
✓ Branch 1 taken 20324 times.
 20859 if (c->dstBpc == 32)
273 535 dst_stride <<= 2;
274
275
2/2
✓ Branch 0 taken 10291 times.
✓ Branch 1 taken 10568 times.
 20859 num_ydesc = need_lum_conv ? 2 : 1;
276
2/2
✓ Branch 0 taken 10315 times.
✓ Branch 1 taken 10544 times.
 20859 num_cdesc = need_chr_conv ? 2 : 1;
277
278 20859 c->numSlice = FFMAX(num_ydesc, num_cdesc) + 2;
279
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 c->numDesc = num_ydesc + num_cdesc + num_vdesc + (need_gamma ? 2 : 0);
280 20859 c->descIndex[0] = num_ydesc + (need_gamma ? 1 : 0);
281 20859 c->descIndex[1] = num_ydesc + num_cdesc + (need_gamma ? 1 : 0);
282
283
2/2
✓ Branch 1 taken 411 times.
✓ Branch 2 taken 20448 times.
 20859 if (isFloat16(c->opts.src_format)) {
284 411 c->h2f_tables = av_malloc(sizeof(*c->h2f_tables));
285
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 411 times.
 411 if (!c->h2f_tables)
286 ✗ return AVERROR(ENOMEM);
287 411 ff_init_half2float_tables(c->h2f_tables);
288 411 c->input_opaque = c->h2f_tables;
289 }
290
291 20859 c->desc = av_calloc(c->numDesc, sizeof(*c->desc));
292
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (!c->desc)
293 ✗ return AVERROR(ENOMEM);
294 20859 c->slice = av_calloc(c->numSlice, sizeof(*c->slice));
295
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (!c->slice) {
296 ✗ res = AVERROR(ENOMEM);
297 ✗ goto cleanup;
298 }
299
300 20859 res = alloc_slice(&c->slice[0], c->opts.src_format, c->opts.src_h, c->chrSrcH, c->chrSrcHSubSample, c->chrSrcVSubSample, 0);
301
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (res < 0) goto cleanup;
302
2/2
✓ Branch 0 taken 10831 times.
✓ Branch 1 taken 20859 times.
 31690 for (i = 1; i < c->numSlice-2; ++i) {
303 10831 res = alloc_slice(&c->slice[i], c->opts.src_format, lumBufSize, chrBufSize, c->chrSrcHSubSample, c->chrSrcVSubSample, 0);
304
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 10831 times.
 10831 if (res < 0) goto cleanup;
305 10831 res = alloc_lines(&c->slice[i], FFALIGN(c->opts.src_w*2+78, 16), c->opts.src_w);
306
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 10831 times.
 10831 if (res < 0) goto cleanup;
307 }
308 // horizontal scaler output
309 20859 res = alloc_slice(&c->slice[i], c->opts.src_format, lumBufSize, chrBufSize, c->chrDstHSubSample, c->chrDstVSubSample, 1);
310
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (res < 0) goto cleanup;
311 20859 res = alloc_lines(&c->slice[i], dst_stride, c->opts.dst_w);
312
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (res < 0) goto cleanup;
313
314 20859 fill_ones(&c->slice[i], dst_stride>>1, c->dstBpc);
315
316 // vertical scaler output
317 20859 ++i;
318 20859 res = alloc_slice(&c->slice[i], c->opts.dst_format, c->opts.dst_h, c->chrDstH, c->chrDstHSubSample, c->chrDstVSubSample, 0);
319
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (res < 0) goto cleanup;
320
321 20859 index = 0;
322 20859 srcIdx = 0;
323 20859 dstIdx = 1;
324
325
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (need_gamma) {
326 ✗ res = ff_init_gamma_convert(c->desc + index, c->slice + srcIdx, c->inv_gamma);
327 ✗ if (res < 0) goto cleanup;
328 ✗ ++index;
329 }
330
331
2/2
✓ Branch 0 taken 10291 times.
✓ Branch 1 taken 10568 times.
 20859 if (need_lum_conv) {
332 10291 res = ff_init_desc_fmt_convert(&c->desc[index], &c->slice[srcIdx], &c->slice[dstIdx], pal);
333
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 10291 times.
 10291 if (res < 0) goto cleanup;
334 10291 c->desc[index].alpha = c->needAlpha;
335 10291 ++index;
336 10291 srcIdx = dstIdx;
337 }
338
339
340 20859 dstIdx = FFMAX(num_ydesc, num_cdesc);
341 20859 res = ff_init_desc_hscale(&c->desc[index], &c->slice[srcIdx], &c->slice[dstIdx], c->hLumFilter, c->hLumFilterPos, c->hLumFilterSize, c->lumXInc);
342
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (res < 0) goto cleanup;
343 20859 c->desc[index].alpha = c->needAlpha;
344
345
346 20859 ++index;
347 {
348 20859 srcIdx = 0;
349 20859 dstIdx = 1;
350
2/2
✓ Branch 0 taken 10315 times.
✓ Branch 1 taken 10544 times.
 20859 if (need_chr_conv) {
351 10315 res = ff_init_desc_cfmt_convert(&c->desc[index], &c->slice[srcIdx], &c->slice[dstIdx], pal);
352
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 10315 times.
 10315 if (res < 0) goto cleanup;
353 10315 ++index;
354 10315 srcIdx = dstIdx;
355 }
356
357 20859 dstIdx = FFMAX(num_ydesc, num_cdesc);
358
2/2
✓ Branch 0 taken 19115 times.
✓ Branch 1 taken 1744 times.
 20859 if (c->needs_hcscale)
359 19115 res = ff_init_desc_chscale(&c->desc[index], &c->slice[srcIdx], &c->slice[dstIdx], c->hChrFilter, c->hChrFilterPos, c->hChrFilterSize, c->chrXInc);
360 else
361 1744 res = ff_init_desc_no_chr(&c->desc[index], &c->slice[srcIdx], &c->slice[dstIdx]);
362
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (res < 0) goto cleanup;
363 }
364
365 20859 ++index;
366 {
367 20859 srcIdx = c->numSlice - 2;
368 20859 dstIdx = c->numSlice - 1;
369 20859 res = ff_init_vscale(c, c->desc + index, c->slice + srcIdx, c->slice + dstIdx);
370
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (res < 0) goto cleanup;
371 }
372
373 20859 ++index;
374
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20859 times.
 20859 if (need_gamma) {
375 ✗ res = ff_init_gamma_convert(c->desc + index, c->slice + dstIdx, c->gamma);
376 ✗ if (res < 0) goto cleanup;
377 }
378
379 20859 return 0;
380
381 ✗ cleanup:
382 ✗ ff_free_filters(c);
383 ✗ return res;
384 }
385
386 35821 int ff_free_filters(SwsInternal *c)
387 {
388 int i;
389
2/2
✓ Branch 0 taken 20859 times.
✓ Branch 1 taken 14962 times.
 35821 if (c->desc) {
390
2/2
✓ Branch 0 taken 92742 times.
✓ Branch 1 taken 20859 times.
 113601 for (i = 0; i < c->numDesc; ++i)
391 92742 av_freep(&c->desc[i].instance);
392 20859 av_freep(&c->desc);
393 }
394
395
2/2
✓ Branch 0 taken 20859 times.
✓ Branch 1 taken 14962 times.
 35821 if (c->slice) {
396
2/2
✓ Branch 0 taken 73408 times.
✓ Branch 1 taken 20859 times.
 94267 for (i = 0; i < c->numSlice; ++i)
397 73408 free_slice(&c->slice[i]);
398 20859 av_freep(&c->slice);
399 }
400 35821 av_freep(&c->h2f_tables);
401 35821 return 0;
402 }
403