FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavcodec/vp3dsp.c
Date: 2025-09-01 20:07:09
Exec Total Coverage
Lines: 265 266 99.6%
Functions: 16 16 100.0%
Branches: 45 48 93.8%
Line Branch Exec Source
1 /*
2 * Copyright (C) 2004 The FFmpeg project
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 /**
22 * @file
23 * Standard C DSP-oriented functions cribbed from the original VP3
24 * source code.
25 */
26
27 #include <string.h>
28
29 #include "config.h"
30 #include "libavutil/attributes.h"
31 #include "libavutil/common.h"
32 #include "libavutil/internal.h"
33 #include "libavutil/intreadwrite.h"
34 #include "libavutil/avassert.h"
35
36 #include "rnd_avg.h"
37 #include "vp3dsp.h"
38
39 #define IdctAdjustBeforeShift 8
40 #define xC1S7 64277
41 #define xC2S6 60547
42 #define xC3S5 54491
43 #define xC4S4 46341
44 #define xC5S3 36410
45 #define xC6S2 25080
46 #define xC7S1 12785
47
48 #define M(a, b) ((int)((SUINT)(a) * (b)) >> 16)
49
50 1506309 static av_always_inline void idct(uint8_t *dst, ptrdiff_t stride,
51 int16_t *input, int type)
52 {
53 1506309 int16_t *ip = input;
54
55 int A, B, C, D, Ad, Bd, Cd, Dd, E, F, G, H;
56 int Ed, Gd, Add, Bdd, Fd, Hd;
57
58 int i;
59
60 /* Inverse DCT on the rows now */
61
2/2
✓ Branch 0 taken 12050472 times.
✓ Branch 1 taken 1506309 times.
 13556781 for (i = 0; i < 8; i++) {
62 /* Check for non-zero values */
63 12050472 if (ip[0 * 8] | ip[1 * 8] | ip[2 * 8] | ip[3 * 8] |
64
2/2
✓ Branch 0 taken 2296759 times.
✓ Branch 1 taken 9753713 times.
 12050472 ip[4 * 8] | ip[5 * 8] | ip[6 * 8] | ip[7 * 8]) {
65 2296759 A = M(xC1S7, ip[1 * 8]) + M(xC7S1, ip[7 * 8]);
66 2296759 B = M(xC7S1, ip[1 * 8]) - M(xC1S7, ip[7 * 8]);
67 2296759 C = M(xC3S5, ip[3 * 8]) + M(xC5S3, ip[5 * 8]);
68 2296759 D = M(xC3S5, ip[5 * 8]) - M(xC5S3, ip[3 * 8]);
69
70 2296759 Ad = M(xC4S4, (A - C));
71 2296759 Bd = M(xC4S4, (B - D));
72
73 2296759 Cd = A + C;
74 2296759 Dd = B + D;
75
76 2296759 E = M(xC4S4, (ip[0 * 8] + ip[4 * 8]));
77 2296759 F = M(xC4S4, (ip[0 * 8] - ip[4 * 8]));
78
79 2296759 G = M(xC2S6, ip[2 * 8]) + M(xC6S2, ip[6 * 8]);
80 2296759 H = M(xC6S2, ip[2 * 8]) - M(xC2S6, ip[6 * 8]);
81
82 2296759 Ed = E - G;
83 2296759 Gd = E + G;
84
85 2296759 Add = F + Ad;
86 2296759 Bdd = Bd - H;
87
88 2296759 Fd = F - Ad;
89 2296759 Hd = Bd + H;
90
91 /* Final sequence of operations over-write original inputs. */
92 2296759 ip[0 * 8] = Gd + Cd;
93 2296759 ip[7 * 8] = Gd - Cd;
94
95 2296759 ip[1 * 8] = Add + Hd;
96 2296759 ip[2 * 8] = Add - Hd;
97
98 2296759 ip[3 * 8] = Ed + Dd;
99 2296759 ip[4 * 8] = Ed - Dd;
100
101 2296759 ip[5 * 8] = Fd + Bdd;
102 2296759 ip[6 * 8] = Fd - Bdd;
103 }
104
105 12050472 ip += 1; /* next row */
106 }
107
108 1506309 ip = input;
109
110
2/2
✓ Branch 0 taken 12050472 times.
✓ Branch 1 taken 1506309 times.
 13556781 for (i = 0; i < 8; i++) {
111 /* Check for non-zero values (bitwise or faster than ||) */
112 12050472 if (ip[1] | ip[2] | ip[3] |
113
2/2
✓ Branch 0 taken 3958397 times.
✓ Branch 1 taken 8092075 times.
 12050472 ip[4] | ip[5] | ip[6] | ip[7]) {
114 3958397 A = M(xC1S7, ip[1]) + M(xC7S1, ip[7]);
115 3958397 B = M(xC7S1, ip[1]) - M(xC1S7, ip[7]);
116 3958397 C = M(xC3S5, ip[3]) + M(xC5S3, ip[5]);
117 3958397 D = M(xC3S5, ip[5]) - M(xC5S3, ip[3]);
118
119 3958397 Ad = M(xC4S4, (A - C));
120 3958397 Bd = M(xC4S4, (B - D));
121
122 3958397 Cd = A + C;
123 3958397 Dd = B + D;
124
125 3958397 E = M(xC4S4, (ip[0] + ip[4])) + 8;
126 3958397 F = M(xC4S4, (ip[0] - ip[4])) + 8;
127
128
2/2
✓ Branch 0 taken 742472 times.
✓ Branch 1 taken 3215925 times.
 3958397 if (type == 1) { // HACK
129 742472 E += 16 * 128;
130 742472 F += 16 * 128;
131 }
132
133 3958397 G = M(xC2S6, ip[2]) + M(xC6S2, ip[6]);
134 3958397 H = M(xC6S2, ip[2]) - M(xC2S6, ip[6]);
135
136 3958397 Ed = E - G;
137 3958397 Gd = E + G;
138
139 3958397 Add = F + Ad;
140 3958397 Bdd = Bd - H;
141
142 3958397 Fd = F - Ad;
143 3958397 Hd = Bd + H;
144
145 /* Final sequence of operations over-write original inputs. */
146
2/2
✓ Branch 0 taken 742472 times.
✓ Branch 1 taken 3215925 times.
 3958397 if (type == 1) {
147 742472 dst[0 * stride] = av_clip_uint8((Gd + Cd) >> 4);
148 742472 dst[7 * stride] = av_clip_uint8((Gd - Cd) >> 4);
149
150 742472 dst[1 * stride] = av_clip_uint8((Add + Hd) >> 4);
151 742472 dst[2 * stride] = av_clip_uint8((Add - Hd) >> 4);
152
153 742472 dst[3 * stride] = av_clip_uint8((Ed + Dd) >> 4);
154 742472 dst[4 * stride] = av_clip_uint8((Ed - Dd) >> 4);
155
156 742472 dst[5 * stride] = av_clip_uint8((Fd + Bdd) >> 4);
157 742472 dst[6 * stride] = av_clip_uint8((Fd - Bdd) >> 4);
158 } else {
159 3215925 dst[0 * stride] = av_clip_uint8(dst[0 * stride] + ((Gd + Cd) >> 4));
160 3215925 dst[7 * stride] = av_clip_uint8(dst[7 * stride] + ((Gd - Cd) >> 4));
161
162 3215925 dst[1 * stride] = av_clip_uint8(dst[1 * stride] + ((Add + Hd) >> 4));
163 3215925 dst[2 * stride] = av_clip_uint8(dst[2 * stride] + ((Add - Hd) >> 4));
164
165 3215925 dst[3 * stride] = av_clip_uint8(dst[3 * stride] + ((Ed + Dd) >> 4));
166 3215925 dst[4 * stride] = av_clip_uint8(dst[4 * stride] + ((Ed - Dd) >> 4));
167
168 3215925 dst[5 * stride] = av_clip_uint8(dst[5 * stride] + ((Fd + Bdd) >> 4));
169 3215925 dst[6 * stride] = av_clip_uint8(dst[6 * stride] + ((Fd - Bdd) >> 4));
170 }
171 } else {
172
2/2
✓ Branch 0 taken 2034960 times.
✓ Branch 1 taken 6057115 times.
 8092075 if (type == 1) {
173 2034960 dst[0*stride] =
174 2034960 dst[1*stride] =
175 2034960 dst[2*stride] =
176 2034960 dst[3*stride] =
177 2034960 dst[4*stride] =
178 2034960 dst[5*stride] =
179 2034960 dst[6*stride] =
180 2034960 dst[7*stride] = av_clip_uint8(128 + ((xC4S4 * ip[0] + (IdctAdjustBeforeShift << 16)) >> 20));
181 } else {
182
2/2
✓ Branch 0 taken 1484916 times.
✓ Branch 1 taken 4572199 times.
 6057115 if (ip[0]) {
183 1484916 int v = (xC4S4 * ip[0] + (IdctAdjustBeforeShift << 16)) >> 20;
184 1484916 dst[0 * stride] = av_clip_uint8(dst[0 * stride] + v);
185 1484916 dst[1 * stride] = av_clip_uint8(dst[1 * stride] + v);
186 1484916 dst[2 * stride] = av_clip_uint8(dst[2 * stride] + v);
187 1484916 dst[3 * stride] = av_clip_uint8(dst[3 * stride] + v);
188 1484916 dst[4 * stride] = av_clip_uint8(dst[4 * stride] + v);
189 1484916 dst[5 * stride] = av_clip_uint8(dst[5 * stride] + v);
190 1484916 dst[6 * stride] = av_clip_uint8(dst[6 * stride] + v);
191 1484916 dst[7 * stride] = av_clip_uint8(dst[7 * stride] + v);
192 }
193 }
194 }
195
196 12050472 ip += 8; /* next column */
197 12050472 dst++;
198 }
199 1506309 }
200
201 406566 static av_always_inline void idct10(uint8_t *dst, ptrdiff_t stride,
202 int16_t *input, int type)
203 {
204 406566 int16_t *ip = input;
205
206 int A, B, C, D, Ad, Bd, Cd, Dd, E, F, G, H;
207 int Ed, Gd, Add, Bdd, Fd, Hd;
208
209 int i;
210
211 /* Inverse DCT on the rows now */
212
2/2
✓ Branch 0 taken 1626264 times.
✓ Branch 1 taken 406566 times.
 2032830 for (i = 0; i < 4; i++) {
213 /* Check for non-zero values */
214
2/2
✓ Branch 0 taken 112099 times.
✓ Branch 1 taken 1514165 times.
 1626264 if (ip[0 * 8] | ip[1 * 8] | ip[2 * 8] | ip[3 * 8]) {
215 112099 A = M(xC1S7, ip[1 * 8]);
216 112099 B = M(xC7S1, ip[1 * 8]);
217 112099 C = M(xC3S5, ip[3 * 8]);
218 112099 D = -M(xC5S3, ip[3 * 8]);
219
220 112099 Ad = M(xC4S4, (A - C));
221 112099 Bd = M(xC4S4, (B - D));
222
223 112099 Cd = A + C;
224 112099 Dd = B + D;
225
226 112099 E = M(xC4S4, ip[0 * 8]);
227 112099 F = E;
228
229 112099 G = M(xC2S6, ip[2 * 8]);
230 112099 H = M(xC6S2, ip[2 * 8]);
231
232 112099 Ed = E - G;
233 112099 Gd = E + G;
234
235 112099 Add = F + Ad;
236 112099 Bdd = Bd - H;
237
238 112099 Fd = F - Ad;
239 112099 Hd = Bd + H;
240
241 /* Final sequence of operations over-write original inputs */
242 112099 ip[0 * 8] = Gd + Cd;
243 112099 ip[7 * 8] = Gd - Cd;
244
245 112099 ip[1 * 8] = Add + Hd;
246 112099 ip[2 * 8] = Add - Hd;
247
248 112099 ip[3 * 8] = Ed + Dd;
249 112099 ip[4 * 8] = Ed - Dd;
250
251 112099 ip[5 * 8] = Fd + Bdd;
252 112099 ip[6 * 8] = Fd - Bdd;
253
254 }
255
256 1626264 ip += 1;
257 }
258
259 406566 ip = input;
260
261
2/2
✓ Branch 0 taken 3252528 times.
✓ Branch 1 taken 406566 times.
 3659094 for (i = 0; i < 8; i++) {
262 /* Check for non-zero values (bitwise or faster than ||) */
263
2/2
✓ Branch 0 taken 705927 times.
✓ Branch 1 taken 2546601 times.
 3252528 if (ip[0] | ip[1] | ip[2] | ip[3]) {
264 705927 A = M(xC1S7, ip[1]);
265 705927 B = M(xC7S1, ip[1]);
266 705927 C = M(xC3S5, ip[3]);
267 705927 D = -M(xC5S3, ip[3]);
268
269 705927 Ad = M(xC4S4, (A - C));
270 705927 Bd = M(xC4S4, (B - D));
271
272 705927 Cd = A + C;
273 705927 Dd = B + D;
274
275 705927 E = M(xC4S4, ip[0]);
276
2/2
✓ Branch 0 taken 227418 times.
✓ Branch 1 taken 478509 times.
 705927 if (type == 1)
277 227418 E += 16 * 128;
278 705927 F = E;
279
280 705927 G = M(xC2S6, ip[2]);
281 705927 H = M(xC6S2, ip[2]);
282
283 705927 Ed = E - G;
284 705927 Gd = E + G;
285
286 705927 Add = F + Ad;
287 705927 Bdd = Bd - H;
288
289 705927 Fd = F - Ad;
290 705927 Hd = Bd + H;
291
292 705927 Gd += 8;
293 705927 Add += 8;
294 705927 Ed += 8;
295 705927 Fd += 8;
296
297 /* Final sequence of operations over-write original inputs. */
298
2/2
✓ Branch 0 taken 227418 times.
✓ Branch 1 taken 478509 times.
 705927 if (type == 1) {
299 227418 dst[0 * stride] = av_clip_uint8((Gd + Cd) >> 4);
300 227418 dst[7 * stride] = av_clip_uint8((Gd - Cd) >> 4);
301
302 227418 dst[1 * stride] = av_clip_uint8((Add + Hd) >> 4);
303 227418 dst[2 * stride] = av_clip_uint8((Add - Hd) >> 4);
304
305 227418 dst[3 * stride] = av_clip_uint8((Ed + Dd) >> 4);
306 227418 dst[4 * stride] = av_clip_uint8((Ed - Dd) >> 4);
307
308 227418 dst[5 * stride] = av_clip_uint8((Fd + Bdd) >> 4);
309 227418 dst[6 * stride] = av_clip_uint8((Fd - Bdd) >> 4);
310 } else {
311 478509 dst[0 * stride] = av_clip_uint8(dst[0 * stride] + ((Gd + Cd) >> 4));
312 478509 dst[7 * stride] = av_clip_uint8(dst[7 * stride] + ((Gd - Cd) >> 4));
313
314 478509 dst[1 * stride] = av_clip_uint8(dst[1 * stride] + ((Add + Hd) >> 4));
315 478509 dst[2 * stride] = av_clip_uint8(dst[2 * stride] + ((Add - Hd) >> 4));
316
317 478509 dst[3 * stride] = av_clip_uint8(dst[3 * stride] + ((Ed + Dd) >> 4));
318 478509 dst[4 * stride] = av_clip_uint8(dst[4 * stride] + ((Ed - Dd) >> 4));
319
320 478509 dst[5 * stride] = av_clip_uint8(dst[5 * stride] + ((Fd + Bdd) >> 4));
321 478509 dst[6 * stride] = av_clip_uint8(dst[6 * stride] + ((Fd - Bdd) >> 4));
322 }
323 } else {
324
2/2
✓ Branch 0 taken 52526 times.
✓ Branch 1 taken 2494075 times.
 2546601 if (type == 1) {
325 52526 dst[0*stride] =
326 52526 dst[1*stride] =
327 52526 dst[2*stride] =
328 52526 dst[3*stride] =
329 52526 dst[4*stride] =
330 52526 dst[5*stride] =
331 52526 dst[6*stride] =
332 52526 dst[7*stride] = 128;
333 }
334 }
335
336 3252528 ip += 8;
337 3252528 dst++;
338 }
339 406566 }
340
341 34993 void ff_vp3dsp_idct10_put(uint8_t *dest, ptrdiff_t stride, int16_t *block)
342 {
343 34993 idct10(dest, stride, block, 1);
344 34993 memset(block, 0, sizeof(*block) * 64);
345 34993 }
346
347 371573 void ff_vp3dsp_idct10_add(uint8_t *dest, ptrdiff_t stride, int16_t *block)
348 {
349 371573 idct10(dest, stride, block, 2);
350 371573 memset(block, 0, sizeof(*block) * 64);
351 371573 }
352
353 347179 static void vp3_idct_put_c(uint8_t *dest /* align 8 */, ptrdiff_t stride,
354 int16_t *block /* align 16 */)
355 {
356 347179 idct(dest, stride, block, 1);
357 347179 memset(block, 0, sizeof(*block) * 64);
358 347179 }
359
360 1159130 static void vp3_idct_add_c(uint8_t *dest /* align 8 */, ptrdiff_t stride,
361 int16_t *block /* align 16 */)
362 {
363 1159130 idct(dest, stride, block, 2);
364 1159130 memset(block, 0, sizeof(*block) * 64);
365 1159130 }
366
367 127567 static void vp3_idct_dc_add_c(uint8_t *dest /* align 8 */, ptrdiff_t stride,
368 int16_t *block /* align 16 */)
369 {
370 127567 int i, dc = (block[0] + 15) >> 5;
371
372
2/2
✓ Branch 0 taken 1020536 times.
✓ Branch 1 taken 127567 times.
 1148103 for (i = 0; i < 8; i++) {
373 1020536 dest[0] = av_clip_uint8(dest[0] + dc);
374 1020536 dest[1] = av_clip_uint8(dest[1] + dc);
375 1020536 dest[2] = av_clip_uint8(dest[2] + dc);
376 1020536 dest[3] = av_clip_uint8(dest[3] + dc);
377 1020536 dest[4] = av_clip_uint8(dest[4] + dc);
378 1020536 dest[5] = av_clip_uint8(dest[5] + dc);
379 1020536 dest[6] = av_clip_uint8(dest[6] + dc);
380 1020536 dest[7] = av_clip_uint8(dest[7] + dc);
381 1020536 dest += stride;
382 }
383 127567 block[0] = 0;
384 127567 }
385
386 465940 static av_always_inline void vp3_v_loop_filter_c(uint8_t *first_pixel, ptrdiff_t stride,
387 int *bounding_values, int count)
388 {
389 unsigned char *end;
390 int filter_value;
391 465940 const ptrdiff_t nstride = -stride;
392
393
2/2
✓ Branch 0 taken 4048776 times.
✓ Branch 1 taken 465940 times.
 4514716 for (end = first_pixel + count; first_pixel < end; first_pixel++) {
394 4048776 filter_value = (first_pixel[2 * nstride] - first_pixel[stride]) +
395 4048776 (first_pixel[0] - first_pixel[nstride]) * 3;
396 4048776 filter_value = bounding_values[(filter_value + 4) >> 3];
397
398 4048776 first_pixel[nstride] = av_clip_uint8(first_pixel[nstride] + filter_value);
399 4048776 first_pixel[0] = av_clip_uint8(first_pixel[0] - filter_value);
400 }
401 465940 }
402
403 492808 static av_always_inline void vp3_h_loop_filter_c(uint8_t *first_pixel, ptrdiff_t stride,
404 int *bounding_values, int count)
405 {
406 unsigned char *end;
407 int filter_value;
408
409
2/2
✓ Branch 0 taken 4307536 times.
✓ Branch 1 taken 492808 times.
 4800344 for (end = first_pixel + count * stride; first_pixel != end; first_pixel += stride) {
410 4307536 filter_value = (first_pixel[-2] - first_pixel[1]) +
411 4307536 (first_pixel[ 0] - first_pixel[-1]) * 3;
412 4307536 filter_value = bounding_values[(filter_value + 4) >> 3];
413
414 4307536 first_pixel[-1] = av_clip_uint8(first_pixel[-1] + filter_value);
415 4307536 first_pixel[ 0] = av_clip_uint8(first_pixel[ 0] - filter_value);
416 }
417 492808 }
418
419 #define LOOP_FILTER(prefix, suffix, dim, count) \
420 void prefix##_##dim##_loop_filter_##count##suffix(uint8_t *first_pixel, ptrdiff_t stride, \
421 int *bounding_values) \
422 { \
423 vp3_##dim##_loop_filter_c(first_pixel, stride, bounding_values, count); \
424 }
425
426 385626 static LOOP_FILTER(vp3,_c, v, 8)
427 401540 static LOOP_FILTER(vp3,_c, h, 8)
428 80314 LOOP_FILTER(ff_vp3dsp, , v, 12)
429 91268 LOOP_FILTER(ff_vp3dsp, , h, 12)
430
431 333697 static void put_no_rnd_pixels_l2(uint8_t *dst, const uint8_t *src1,
432 const uint8_t *src2, ptrdiff_t stride, int h)
433 {
434 int i;
435
436
2/2
✓ Branch 0 taken 2669576 times.
✓ Branch 1 taken 333697 times.
 3003273 for (i = 0; i < h; i++) {
437 uint32_t a, b;
438
439 2669576 a = AV_RN32(&src1[i * stride]);
440 2669576 b = AV_RN32(&src2[i * stride]);
441 2669576 AV_WN32A(&dst[i * stride], no_rnd_avg32(a, b));
442 2669576 a = AV_RN32(&src1[i * stride + 4]);
443 2669576 b = AV_RN32(&src2[i * stride + 4]);
444 2669576 AV_WN32A(&dst[i * stride + 4], no_rnd_avg32(a, b));
445 }
446 333697 }
447
448 60 av_cold void ff_vp3dsp_init(VP3DSPContext *c, int flags)
449 {
450 60 c->put_no_rnd_pixels_l2 = put_no_rnd_pixels_l2;
451
452 60 c->idct_put = vp3_idct_put_c;
453 60 c->idct_add = vp3_idct_add_c;
454 60 c->idct_dc_add = vp3_idct_dc_add_c;
455 60 c->v_loop_filter = c->v_loop_filter_unaligned = vp3_v_loop_filter_8_c;
456 60 c->h_loop_filter = c->h_loop_filter_unaligned = vp3_h_loop_filter_8_c;
457
458 #if ARCH_ARM
459 ff_vp3dsp_init_arm(c, flags);
460 #elif ARCH_PPC
461 ff_vp3dsp_init_ppc(c, flags);
462 #elif ARCH_X86
463 60 ff_vp3dsp_init_x86(c, flags);
464 #elif ARCH_MIPS
465 ff_vp3dsp_init_mips(c, flags);
466 #endif
467 60 }
468
469 /*
470 * This function initializes the loop filter boundary limits if the frame's
471 * quality index is different from the previous frame's.
472 *
473 * where sizeof(bounding_values_array) is 256 * sizeof(int)
474 *
475 * The filter_limit_values may not be larger than 127.
476 */
477 472 void ff_vp3dsp_set_bounding_values(int * bounding_values_array, int filter_limit)
478 {
479 472 int *bounding_values = bounding_values_array + 127;
480 int x;
481 int value;
482
483
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 472 times.
 472 av_assert0(filter_limit < 128U);
484
485 /* set up the bounding values */
486 472 memset(bounding_values_array, 0, 256 * sizeof(int));
487
2/2
✓ Branch 0 taken 2662 times.
✓ Branch 1 taken 472 times.
 3134 for (x = 0; x < filter_limit; x++) {
488 2662 bounding_values[-x] = -x;
489 2662 bounding_values[x] = x;
490 }
491
3/4
✓ Branch 0 taken 3134 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 2662 times.
✓ Branch 3 taken 472 times.
 3134 for (x = value = filter_limit; x < 128 && value; x++, value--) {
492 2662 bounding_values[ x] = value;
493 2662 bounding_values[-x] = -value;
494 }
495
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 472 times.
 472 if (value)
496 ✗ bounding_values[128] = value;
497 472 bounding_values[129] = bounding_values[130] = filter_limit * 0x02020202U;
498 472 }
499