FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libswscale/slice.c
Date: 2025-04-25 22:50:00
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 41194 static void free_lines(SwsSlice *s)
25 {
26 int i;
27
2/2
✓ Branch 0 taken 82388 times.
✓ Branch 1 taken 41194 times.
 123582 for (i = 0; i < 2; ++i) {
28 82388 int n = s->plane[i].available_lines;
29 int j;
30
2/2
✓ Branch 0 taken 513185 times.
✓ Branch 1 taken 82388 times.
 595573 for (j = 0; j < n; ++j) {
31 513185 av_freep(&s->plane[i].line[j]);
32
2/2
✓ Branch 0 taken 331312 times.
✓ Branch 1 taken 181873 times.
 513185 if (s->is_ring)
33 331312 s->plane[i].line[j+n] = NULL;
34 }
35 }
36
37
2/2
✓ Branch 0 taken 164776 times.
✓ Branch 1 taken 41194 times.
 205970 for (i = 0; i < 4; ++i)
38
2/2
✓ Branch 0 taken 103680 times.
✓ Branch 1 taken 61096 times.
 164776 memset(s->plane[i].line, 0, sizeof(uint8_t*) * s->plane[i].available_lines * (s->is_ring ? 3 : 1));
39 41194 s->should_free_lines = 0;
40 41194 }
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 41194 static int alloc_lines(SwsSlice *s, int size, int width)
47 {
48 int i;
49 41194 int idx[2] = {3, 2};
50
51 41194 s->should_free_lines = 1;
52 41194 s->width = width;
53
54
2/2
✓ Branch 0 taken 82388 times.
✓ Branch 1 taken 41194 times.
 123582 for (i = 0; i < 2; ++i) {
55 82388 int n = s->plane[i].available_lines;
56 int j;
57 82388 int ii = idx[i];
58
59
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 82388 times.
 82388 av_assert0(n == s->plane[ii].available_lines);
60
2/2
✓ Branch 0 taken 513185 times.
✓ Branch 1 taken 82388 times.
 595573 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 513185 s->plane[i].line[j] = av_mallocz(size * 2 + 32);
64
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 513185 times.
 513185 if (!s->plane[i].line[j]) {
65 ✗ free_lines(s);
66 ✗ return AVERROR(ENOMEM);
67 }
68 513185 s->plane[ii].line[j] = s->plane[i].line[j] + size + 16;
69
2/2
✓ Branch 0 taken 331312 times.
✓ Branch 1 taken 181873 times.
 513185 if (s->is_ring) {
70 331312 s->plane[i].line[j+n] = s->plane[i].line[j];
71 331312 s->plane[ii].line[j+n] = s->plane[ii].line[j];
72 }
73 }
74 }
75
76 41194 return 0;
77 }
78
79 93034 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 93034 int size[4] = { lumLines,
83 chrLines,
84 chrLines,
85 lumLines };
86
87 93034 s->h_chr_sub_sample = h_sub_sample;
88 93034 s->v_chr_sub_sample = v_sub_sample;
89 93034 s->fmt = fmt;
90 93034 s->is_ring = ring;
91 93034 s->should_free_lines = 0;
92
93
2/2
✓ Branch 0 taken 372136 times.
✓ Branch 1 taken 93034 times.
 465170 for (i = 0; i < 4; ++i) {
94
2/2
✓ Branch 0 taken 268456 times.
✓ Branch 1 taken 103680 times.
 372136 int n = size[i] * ( ring == 0 ? 1 : 3);
95 372136 s->plane[i].line = av_calloc(n, sizeof(*s->plane[i].line));
96
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 372136 times.
 372136 if (!s->plane[i].line)
97 ✗ return AVERROR(ENOMEM);
98
99
2/2
✓ Branch 0 taken 103680 times.
✓ Branch 1 taken 268456 times.
 372136 s->plane[i].tmp = ring ? s->plane[i].line + size[i] * 2 : NULL;
100 372136 s->plane[i].available_lines = size[i];
101 372136 s->plane[i].sliceY = 0;
102 372136 s->plane[i].sliceH = 0;
103 }
104 93034 return 0;
105 }
106
107 93034 static void free_slice(SwsSlice *s)
108 {
109 int i;
110
1/2
✓ Branch 0 taken 93034 times.
✗ Branch 1 not taken.
 93034 if (s) {
111
2/2
✓ Branch 0 taken 41194 times.
✓ Branch 1 taken 51840 times.
 93034 if (s->should_free_lines)
112 41194 free_lines(s);
113
2/2
✓ Branch 0 taken 372136 times.
✓ Branch 1 taken 93034 times.
 465170 for (i = 0; i < 4; ++i) {
114 372136 av_freep(&s->plane[i].line);
115 372136 s->plane[i].tmp = NULL;
116 }
117 }
118 93034 }
119
120 26441221 int ff_rotate_slice(SwsSlice *s, int lum, int chr)
121 {
122 int i;
123
2/2
✓ Branch 0 taken 26436870 times.
✓ Branch 1 taken 4351 times.
 26441221 if (lum) {
124
2/2
✓ Branch 0 taken 52873740 times.
✓ Branch 1 taken 26436870 times.
 79310610 for (i = 0; i < 4; i+=3) {
125 52873740 int n = s->plane[i].available_lines;
126 52873740 int l = lum - s->plane[i].sliceY;
127
128
2/2
✓ Branch 0 taken 7610666 times.
✓ Branch 1 taken 45263074 times.
 52873740 if (l >= n * 2) {
129 7610666 s->plane[i].sliceY += n;
130 7610666 s->plane[i].sliceH -= n;
131 }
132 }
133 }
134
2/2
✓ Branch 0 taken 26427108 times.
✓ Branch 1 taken 14113 times.
 26441221 if (chr) {
135
2/2
✓ Branch 0 taken 52854216 times.
✓ Branch 1 taken 26427108 times.
 79281324 for (i = 1; i < 3; ++i) {
136 52854216 int n = s->plane[i].available_lines;
137 52854216 int l = chr - s->plane[i].sliceY;
138
139
2/2
✓ Branch 0 taken 4842086 times.
✓ Branch 1 taken 48012130 times.
 52854216 if (l >= n * 2) {
140 4842086 s->plane[i].sliceY += n;
141 4842086 s->plane[i].sliceH -= n;
142 }
143 }
144 }
145 26441221 return 0;
146 }
147
148 1050358 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 1050358 int i = 0;
152
153 1050358 const int start[4] = {lumY,
154 chrY,
155 chrY,
156 lumY};
157
158 1050358 const int end[4] = {lumY +lumH,
159 1050358 chrY + chrH,
160 1050358 chrY + chrH,
161 1050358 lumY + lumH};
162
163 1050358 s->width = srcW;
164
165
4/4
✓ Branch 0 taken 3655391 times.
✓ Branch 1 taken 122095 times.
✓ Branch 2 taken 2727128 times.
✓ Branch 3 taken 928263 times.
 3777486 for (i = 0; i < 4 && src[i] != NULL; ++i) {
166
2/2
✓ Branch 0 taken 83482 times.
✓ Branch 1 taken 2643646 times.
 2727128 uint8_t *const src_i = src[i] + (relative ? 0 : start[i]) * stride[i];
167 int j;
168 2727128 int first = s->plane[i].sliceY;
169 2727128 int n = s->plane[i].available_lines;
170 2727128 int lines = end[i] - start[i];
171 2727128 int tot_lines = end[i] - first;
172
173
4/4
✓ Branch 0 taken 2727119 times.
✓ Branch 1 taken 9 times.
✓ Branch 2 taken 2727064 times.
✓ Branch 3 taken 55 times.
 2727128 if (start[i] >= first && n >= tot_lines) {
174 2727064 s->plane[i].sliceH = FFMAX(tot_lines, s->plane[i].sliceH);
175
2/2
✓ Branch 0 taken 465825073 times.
✓ Branch 1 taken 2727064 times.
 468552137 for (j = 0; j < lines; j+= 1)
176 465825073 s->plane[i].line[start[i] - first + j] = src_i + j * stride[i];
177 } else {
178 64 s->plane[i].sliceY = start[i];
179 64 lines = lines > n ? n : lines;
180 64 s->plane[i].sliceH = lines;
181
2/2
✓ Branch 0 taken 6088 times.
✓ Branch 1 taken 64 times.
 6152 for (j = 0; j < lines; j+= 1)
182 6088 s->plane[i].line[j] = src_i + j * stride[i];
183 }
184
185 }
186
187 1050358 return 0;
188 }
189
190 25920 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 103680 times.
✓ Branch 1 taken 25920 times.
 129600 for (i = 0; i < 4; ++i) {
195 103680 size = s->plane[i].available_lines;
196
2/2
✓ Branch 0 taken 662624 times.
✓ Branch 1 taken 103680 times.
 766304 for (j = 0; j < size; ++j) {
197
2/2
✓ Branch 0 taken 122000 times.
✓ Branch 1 taken 540624 times.
 662624 if (bpc >= 16) {
198 122000 end = (n>>1) + 1;
199
2/2
✓ Branch 0 taken 62198320 times.
✓ Branch 1 taken 122000 times.
 62320320 for (k = 0; k < end; ++k)
200 62198320 ((int32_t*)(s->plane[i].line[j]))[k] = 1<<18;
201 } else {
202 540624 end = n + 1;
203
2/2
✓ Branch 0 taken 250089552 times.
✓ Branch 1 taken 540624 times.
 250630176 for (k = 0; k < end; ++k)
204 250089552 ((int16_t*)(s->plane[i].line[j]))[k] = 1<<14;
205 }
206 }
207 }
208 25920 }
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 25920 static void get_min_buffer_size(SwsInternal *c, int *out_lum_size, int *out_chr_size)
218 {
219 int lumY;
220 25920 int dstH = c->opts.dst_h;
221 25920 int chrDstH = c->chrDstH;
222 25920 int *lumFilterPos = c->vLumFilterPos;
223 25920 int *chrFilterPos = c->vChrFilterPos;
224 25920 int lumFilterSize = c->vLumFilterSize;
225 25920 int chrFilterSize = c->vChrFilterSize;
226 25920 int chrSubSample = c->chrSrcVSubSample;
227
228 25920 *out_lum_size = lumFilterSize;
229 25920 *out_chr_size = chrFilterSize;
230
231
2/2
✓ Branch 0 taken 9477829 times.
✓ Branch 1 taken 25920 times.
 9503749 for (lumY = 0; lumY < dstH; lumY++) {
232 9477829 int chrY = (int64_t)lumY * chrDstH / dstH;
233 9477829 int nextSlice = FFMAX(lumFilterPos[lumY] + lumFilterSize - 1,
234 ((chrFilterPos[chrY] + chrFilterSize - 1)
235 << chrSubSample));
236
237 9477829 nextSlice >>= chrSubSample;
238 9477829 nextSlice <<= chrSubSample;
239 9477829 (*out_lum_size) = FFMAX((*out_lum_size), nextSlice - lumFilterPos[lumY]);
240 9477829 (*out_chr_size) = FFMAX((*out_chr_size), (nextSlice >> chrSubSample) - chrFilterPos[chrY]);
241 }
242 25920 }
243
244
245
246 25920 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 13478 times.
✓ Branch 2 taken 12442 times.
✓ Branch 4 taken 13478 times.
✗ Branch 5 not taken.
 25920 int num_vdesc = isPlanarYUV(c->opts.dst_format) && !isGray(c->opts.dst_format) ? 2 : 1;
253
6/8
✓ Branch 0 taken 16143 times.
✓ Branch 1 taken 9777 times.
✓ Branch 2 taken 12296 times.
✓ Branch 3 taken 3847 times.
✓ Branch 4 taken 12296 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✓ Branch 7 taken 12296 times.
 25920 int need_lum_conv = c->lumToYV12 || c->readLumPlanar || c->alpToYV12 || c->readAlpPlanar;
254
4/4
✓ Branch 0 taken 14747 times.
✓ Branch 1 taken 11173 times.
✓ Branch 2 taken 3426 times.
✓ Branch 3 taken 11321 times.
 25920 int need_chr_conv = c->chrToYV12 || c->readChrPlanar;
255 25920 int need_gamma = c->is_internal_gamma;
256 int srcIdx, dstIdx;
257 25920 int dst_stride = FFALIGN(c->opts.dst_w * sizeof(int16_t) + 66, 16);
258
259
2/2
✓ Branch 1 taken 123 times.
✓ Branch 2 taken 25797 times.
 25920 uint32_t * pal = usePal(c->opts.src_format) ? c->pal_yuv : (uint32_t*)c->input_rgb2yuv_table;
260 25920 int res = 0;
261
262 int lumBufSize;
263 int chrBufSize;
264
265 25920 get_min_buffer_size(c, &lumBufSize, &chrBufSize);
266 25920 lumBufSize = FFMAX(lumBufSize, c->vLumFilterSize + MAX_LINES_AHEAD);
267 25920 chrBufSize = FFMAX(chrBufSize, c->vChrFilterSize + MAX_LINES_AHEAD);
268
269
2/2
✓ Branch 0 taken 4511 times.
✓ Branch 1 taken 21409 times.
 25920 if (c->dstBpc == 16)
270 4511 dst_stride <<= 1;
271
272
2/2
✓ Branch 0 taken 535 times.
✓ Branch 1 taken 25385 times.
 25920 if (c->dstBpc == 32)
273 535 dst_stride <<= 2;
274
275
2/2
✓ Branch 0 taken 13624 times.
✓ Branch 1 taken 12296 times.
 25920 num_ydesc = need_lum_conv ? 2 : 1;
276
2/2
✓ Branch 0 taken 14599 times.
✓ Branch 1 taken 11321 times.
 25920 num_cdesc = need_chr_conv ? 2 : 1;
277
278 25920 c->numSlice = FFMAX(num_ydesc, num_cdesc) + 2;
279
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25920 times.
 25920 c->numDesc = num_ydesc + num_cdesc + num_vdesc + (need_gamma ? 2 : 0);
280 25920 c->descIndex[0] = num_ydesc + (need_gamma ? 1 : 0);
281 25920 c->descIndex[1] = num_ydesc + num_cdesc + (need_gamma ? 1 : 0);
282
283
2/2
✓ Branch 1 taken 411 times.
✓ Branch 2 taken 25509 times.
 25920 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 25920 c->desc = av_calloc(c->numDesc, sizeof(*c->desc));
292
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25920 times.
 25920 if (!c->desc)
293 ✗ return AVERROR(ENOMEM);
294 25920 c->slice = av_calloc(c->numSlice, sizeof(*c->slice));
295
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25920 times.
 25920 if (!c->slice) {
296 ✗ res = AVERROR(ENOMEM);
297 ✗ goto cleanup;
298 }
299
300 25920 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 25920 times.
 25920 if (res < 0) goto cleanup;
302
2/2
✓ Branch 0 taken 15274 times.
✓ Branch 1 taken 25920 times.
 41194 for (i = 1; i < c->numSlice-2; ++i) {
303 15274 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 15274 times.
 15274 if (res < 0) goto cleanup;
305 15274 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 15274 times.
 15274 if (res < 0) goto cleanup;
307 }
308 // horizontal scaler output
309 25920 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 25920 times.
 25920 if (res < 0) goto cleanup;
311 25920 res = alloc_lines(&c->slice[i], dst_stride, c->opts.dst_w);
312
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25920 times.
 25920 if (res < 0) goto cleanup;
313
314 25920 fill_ones(&c->slice[i], dst_stride>>1, c->dstBpc);
315
316 // vertical scaler output
317 25920 ++i;
318 25920 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 25920 times.
 25920 if (res < 0) goto cleanup;
320
321 25920 index = 0;
322 25920 srcIdx = 0;
323 25920 dstIdx = 1;
324
325
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25920 times.
 25920 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 13624 times.
✓ Branch 1 taken 12296 times.
 25920 if (need_lum_conv) {
332 13624 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 13624 times.
 13624 if (res < 0) goto cleanup;
334 13624 c->desc[index].alpha = c->needAlpha;
335 13624 ++index;
336 13624 srcIdx = dstIdx;
337 }
338
339
340 25920 dstIdx = FFMAX(num_ydesc, num_cdesc);
341 25920 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 25920 times.
 25920 if (res < 0) goto cleanup;
343 25920 c->desc[index].alpha = c->needAlpha;
344
345
346 25920 ++index;
347 {
348 25920 srcIdx = 0;
349 25920 dstIdx = 1;
350
2/2
✓ Branch 0 taken 14599 times.
✓ Branch 1 taken 11321 times.
 25920 if (need_chr_conv) {
351 14599 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 14599 times.
 14599 if (res < 0) goto cleanup;
353 14599 ++index;
354 14599 srcIdx = dstIdx;
355 }
356
357 25920 dstIdx = FFMAX(num_ydesc, num_cdesc);
358
2/2
✓ Branch 0 taken 23685 times.
✓ Branch 1 taken 2235 times.
 25920 if (c->needs_hcscale)
359 23685 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 2235 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 25920 times.
 25920 if (res < 0) goto cleanup;
363 }
364
365 25920 ++index;
366 {
367 25920 srcIdx = c->numSlice - 2;
368 25920 dstIdx = c->numSlice - 1;
369 25920 res = ff_init_vscale(c, c->desc + index, c->slice + srcIdx, c->slice + dstIdx);
370
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25920 times.
 25920 if (res < 0) goto cleanup;
371 }
372
373 25920 ++index;
374
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25920 times.
 25920 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 25920 return 0;
380
381 ✗ cleanup:
382 ✗ ff_free_filters(c);
383 ✗ return res;
384 }
385
386 42185 int ff_free_filters(SwsInternal *c)
387 {
388 int i;
389
2/2
✓ Branch 0 taken 25920 times.
✓ Branch 1 taken 16265 times.
 42185 if (c->desc) {
390
2/2
✓ Branch 0 taken 119461 times.
✓ Branch 1 taken 25920 times.
 145381 for (i = 0; i < c->numDesc; ++i)
391 119461 av_freep(&c->desc[i].instance);
392 25920 av_freep(&c->desc);
393 }
394
395
2/2
✓ Branch 0 taken 25920 times.
✓ Branch 1 taken 16265 times.
 42185 if (c->slice) {
396
2/2
✓ Branch 0 taken 93034 times.
✓ Branch 1 taken 25920 times.
 118954 for (i = 0; i < c->numSlice; ++i)
397 93034 free_slice(&c->slice[i]);
398 25920 av_freep(&c->slice);
399 }
400 42185 av_freep(&c->h2f_tables);
401 42185 return 0;
402 }
403