Coverage Report

Created: 2026-06-10 06:58

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/work/dav1d/src/cdef_tmpl.c
Line
Count
Source
1
/*
2
 * Copyright © 2018, VideoLAN and dav1d authors
3
 * Copyright © 2018, Two Orioles, LLC
4
 * All rights reserved.
5
 *
6
 * Redistribution and use in source and binary forms, with or without
7
 * modification, are permitted provided that the following conditions are met:
8
 *
9
 * 1. Redistributions of source code must retain the above copyright notice, this
10
 *    list of conditions and the following disclaimer.
11
 *
12
 * 2. Redistributions in binary form must reproduce the above copyright notice,
13
 *    this list of conditions and the following disclaimer in the documentation
14
 *    and/or other materials provided with the distribution.
15
 *
16
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
17
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
20
 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26
 */
27
28
#include "config.h"
29
30
#include <stdlib.h>
31
32
#include "common/intops.h"
33
34
#include "src/cdef.h"
35
#include "src/tables.h"
36
37
static inline int constrain(const int diff, const int threshold,
38
                            const int shift)
39
534M
{
40
534M
    const int adiff = abs(diff);
41
534M
    return apply_sign(imin(adiff, imax(0, threshold - (adiff >> shift))), diff);
42
534M
}
43
44
static inline void fill(int16_t *tmp, const ptrdiff_t stride,
45
                        const int w, const int h)
46
1.08M
{
47
    /* Use a value that's a large positive number when interpreted as unsigned,
48
     * and a large negative number when interpreted as signed. */
49
10.0M
    for (int y = 0; y < h; y++) {
50
32.7M
        for (int x = 0; x < w; x++)
51
23.8M
            tmp[x] = INT16_MIN;
52
8.93M
        tmp += stride;
53
8.93M
    }
54
1.08M
}
55
56
static void padding(int16_t *tmp, const ptrdiff_t tmp_stride,
57
                    const pixel *src, const ptrdiff_t src_stride,
58
                    const pixel (*left)[2],
59
                    const pixel *top, const pixel *bottom,
60
                    const int w, const int h, const enum CdefEdgeFlags edges)
61
2.38M
{
62
    // fill extended input buffer
63
2.38M
    int x_start = -2, x_end = w + 2, y_start = -2, y_end = h + 2;
64
2.38M
    if (!(edges & CDEF_HAVE_TOP)) {
65
169k
        fill(tmp - 2 - 2 * tmp_stride, tmp_stride, w + 4, 2);
66
169k
        y_start = 0;
67
169k
    }
68
2.38M
    if (!(edges & CDEF_HAVE_BOTTOM)) {
69
167k
        fill(tmp + h * tmp_stride - 2, tmp_stride, w + 4, 2);
70
167k
        y_end -= 2;
71
167k
    }
72
2.38M
    if (!(edges & CDEF_HAVE_LEFT)) {
73
376k
        fill(tmp + y_start * tmp_stride - 2, tmp_stride, 2, y_end - y_start);
74
376k
        x_start = 0;
75
376k
    }
76
2.38M
    if (!(edges & CDEF_HAVE_RIGHT)) {
77
376k
        fill(tmp + y_start * tmp_stride + w, tmp_stride, 2, y_end - y_start);
78
376k
        x_end -= 2;
79
376k
    }
80
81
6.73M
    for (int y = y_start; y < 0; y++) {
82
51.2M
        for (int x = x_start; x < x_end; x++)
83
46.8M
            tmp[x + y * tmp_stride] = top[x];
84
4.35M
        top += PXSTRIDE(src_stride);
85
4.35M
    }
86
19.9M
    for (int y = 0; y < h; y++)
87
47.2M
        for (int x = x_start; x < 0; x++)
88
29.7M
            tmp[x + y * tmp_stride] = left[y][2 + x];
89
18.9M
    for (int y = 0; y < h; y++) {
90
18.4E
        for (int x = (y < h) ? 0 : x_start; x < x_end; x++)
91
154M
            tmp[x] = src[x];
92
16.5M
        src += PXSTRIDE(src_stride);
93
16.5M
        tmp += tmp_stride;
94
16.5M
    }
95
6.67M
    for (int y = h; y < y_end; y++) {
96
50.3M
        for (int x = x_start; x < x_end; x++)
97
46.0M
            tmp[x] = bottom[x];
98
4.29M
        bottom += PXSTRIDE(src_stride);
99
4.29M
        tmp += tmp_stride;
100
4.29M
    }
101
102
2.38M
}
103
104
static NOINLINE void
105
cdef_filter_block_c(pixel *dst, const ptrdiff_t dst_stride,
106
                    const pixel (*left)[2],
107
                    const pixel *const top, const pixel *const bottom,
108
                    const int pri_strength, const int sec_strength,
109
                    const int dir, const int damping, const int w, int h,
110
                    const enum CdefEdgeFlags edges HIGHBD_DECL_SUFFIX)
111
2.39M
{
112
2.39M
    const ptrdiff_t tmp_stride = 12;
113
2.39M
    assert((w == 4 || w == 8) && (h == 4 || h == 8));
114
2.39M
    int16_t tmp_buf[144]; // 12*12 is the maximum value of tmp_stride * (h + 4)
115
2.39M
    int16_t *tmp = tmp_buf + 2 * tmp_stride + 2;
116
117
2.39M
    padding(tmp, tmp_stride, dst, dst_stride, left, top, bottom, w, h, edges);
118
119
2.39M
    if (pri_strength) {
120
1.11M
        const int bitdepth_min_8 = bitdepth_from_max(bitdepth_max) - 8;
121
1.11M
        const int pri_tap = 4 - ((pri_strength >> bitdepth_min_8) & 1);
122
1.11M
        const int pri_shift = imax(0, damping - ulog2(pri_strength));
123
1.11M
        if (sec_strength) {
124
677k
            const int sec_shift = damping - ulog2(sec_strength);
125
4.46M
            do {
126
31.8M
                for (int x = 0; x < w; x++) {
127
27.3M
                    const int px = dst[x];
128
27.3M
                    int sum = 0;
129
27.3M
                    int max = px, min = px;
130
27.3M
                    int pri_tap_k = pri_tap;
131
79.6M
                    for (int k = 0; k < 2; k++) {
132
52.3M
                        const int off1 = dav1d_cdef_directions[dir + 2][k]; // dir
133
52.3M
                        const int p0 = tmp[x + off1];
134
52.3M
                        const int p1 = tmp[x - off1];
135
52.3M
                        sum += pri_tap_k * constrain(p0 - px, pri_strength, pri_shift);
136
52.3M
                        sum += pri_tap_k * constrain(p1 - px, pri_strength, pri_shift);
137
                        // if pri_tap_k == 4 then it becomes 2 else it remains 3
138
52.3M
                        pri_tap_k = (pri_tap_k & 3) | 2;
139
52.3M
                        min = umin(p0, min);
140
52.3M
                        max = imax(p0, max);
141
52.3M
                        min = umin(p1, min);
142
52.3M
                        max = imax(p1, max);
143
52.3M
                        const int off2 = dav1d_cdef_directions[dir + 4][k]; // dir + 2
144
52.3M
                        const int off3 = dav1d_cdef_directions[dir + 0][k]; // dir - 2
145
52.3M
                        const int s0 = tmp[x + off2];
146
52.3M
                        const int s1 = tmp[x - off2];
147
52.3M
                        const int s2 = tmp[x + off3];
148
52.3M
                        const int s3 = tmp[x - off3];
149
                        // sec_tap starts at 2 and becomes 1
150
52.3M
                        const int sec_tap = 2 - k;
151
52.3M
                        sum += sec_tap * constrain(s0 - px, sec_strength, sec_shift);
152
52.3M
                        sum += sec_tap * constrain(s1 - px, sec_strength, sec_shift);
153
52.3M
                        sum += sec_tap * constrain(s2 - px, sec_strength, sec_shift);
154
52.3M
                        sum += sec_tap * constrain(s3 - px, sec_strength, sec_shift);
155
52.3M
                        min = umin(s0, min);
156
52.3M
                        max = imax(s0, max);
157
52.3M
                        min = umin(s1, min);
158
52.3M
                        max = imax(s1, max);
159
52.3M
                        min = umin(s2, min);
160
52.3M
                        max = imax(s2, max);
161
52.3M
                        min = umin(s3, min);
162
52.3M
                        max = imax(s3, max);
163
52.3M
                    }
164
27.3M
                    dst[x] = iclip(px + ((sum - (sum < 0) + 8) >> 4), min, max);
165
27.3M
                }
166
4.46M
                dst += PXSTRIDE(dst_stride);
167
4.46M
                tmp += tmp_stride;
168
4.46M
            } while (--h);
169
677k
        } else { // pri_strength only
170
2.80M
            do {
171
22.4M
                for (int x = 0; x < w; x++) {
172
19.6M
                    const int px = dst[x];
173
19.6M
                    int sum = 0;
174
19.6M
                    int pri_tap_k = pri_tap;
175
58.4M
                    for (int k = 0; k < 2; k++) {
176
38.7M
                        const int off = dav1d_cdef_directions[dir + 2][k]; // dir
177
38.7M
                        const int p0 = tmp[x + off];
178
38.7M
                        const int p1 = tmp[x - off];
179
38.7M
                        sum += pri_tap_k * constrain(p0 - px, pri_strength, pri_shift);
180
38.7M
                        sum += pri_tap_k * constrain(p1 - px, pri_strength, pri_shift);
181
38.7M
                        pri_tap_k = (pri_tap_k & 3) | 2;
182
38.7M
                    }
183
19.6M
                    dst[x] = px + ((sum - (sum < 0) + 8) >> 4);
184
19.6M
                }
185
2.80M
                dst += PXSTRIDE(dst_stride);
186
2.80M
                tmp += tmp_stride;
187
2.80M
            } while (--h);
188
435k
        }
189
1.28M
    } else { // sec_strength only
190
1.28M
        assert(sec_strength);
191
1.28M
        const int sec_shift = damping - ulog2(sec_strength);
192
5.37M
        do {
193
28.8M
            for (int x = 0; x < w; x++) {
194
23.4M
                const int px = dst[x];
195
23.4M
                int sum = 0;
196
68.5M
                for (int k = 0; k < 2; k++) {
197
45.0M
                    const int off1 = dav1d_cdef_directions[dir + 4][k]; // dir + 2
198
45.0M
                    const int off2 = dav1d_cdef_directions[dir + 0][k]; // dir - 2
199
45.0M
                    const int s0 = tmp[x + off1];
200
45.0M
                    const int s1 = tmp[x - off1];
201
45.0M
                    const int s2 = tmp[x + off2];
202
45.0M
                    const int s3 = tmp[x - off2];
203
45.0M
                    const int sec_tap = 2 - k;
204
45.0M
                    sum += sec_tap * constrain(s0 - px, sec_strength, sec_shift);
205
45.0M
                    sum += sec_tap * constrain(s1 - px, sec_strength, sec_shift);
206
45.0M
                    sum += sec_tap * constrain(s2 - px, sec_strength, sec_shift);
207
45.0M
                    sum += sec_tap * constrain(s3 - px, sec_strength, sec_shift);
208
45.0M
                }
209
23.4M
                dst[x] = px + ((sum - (sum < 0) + 8) >> 4);
210
23.4M
            }
211
5.37M
            dst += PXSTRIDE(dst_stride);
212
5.37M
            tmp += tmp_stride;
213
5.37M
        } while (--h);
214
1.28M
    }
215
2.39M
}
216
217
#define cdef_fn(w, h) \
218
static void cdef_filter_block_##w##x##h##_c(pixel *const dst, \
219
                                            const ptrdiff_t stride, \
220
                                            const pixel (*left)[2], \
221
                                            const pixel *const top, \
222
                                            const pixel *const bottom, \
223
                                            const int pri_strength, \
224
                                            const int sec_strength, \
225
                                            const int dir, \
226
                                            const int damping, \
227
                                            const enum CdefEdgeFlags edges \
228
2.38M
                                            HIGHBD_DECL_SUFFIX) \
229
2.38M
{ \
230
2.38M
    cdef_filter_block_c(dst, stride, left, top, bottom, \
231
2.38M
                        pri_strength, sec_strength, dir, damping, w, h, edges HIGHBD_TAIL_SUFFIX); \
232
2.38M
}
cdef_tmpl.c:cdef_filter_block_8x8_c
Line
Count
Source
228
2.03M
                                            HIGHBD_DECL_SUFFIX) \
229
2.03M
{ \
230
2.03M
    cdef_filter_block_c(dst, stride, left, top, bottom, \
231
2.03M
                        pri_strength, sec_strength, dir, damping, w, h, edges HIGHBD_TAIL_SUFFIX); \
232
2.03M
}
cdef_tmpl.c:cdef_filter_block_4x8_c
Line
Count
Source
228
21.0k
                                            HIGHBD_DECL_SUFFIX) \
229
21.0k
{ \
230
21.0k
    cdef_filter_block_c(dst, stride, left, top, bottom, \
231
21.0k
                        pri_strength, sec_strength, dir, damping, w, h, edges HIGHBD_TAIL_SUFFIX); \
232
21.0k
}
cdef_tmpl.c:cdef_filter_block_4x4_c
Line
Count
Source
228
330k
                                            HIGHBD_DECL_SUFFIX) \
229
330k
{ \
230
330k
    cdef_filter_block_c(dst, stride, left, top, bottom, \
231
330k
                        pri_strength, sec_strength, dir, damping, w, h, edges HIGHBD_TAIL_SUFFIX); \
232
330k
}
233
234
cdef_fn(4, 4);
235
cdef_fn(4, 8);
236
cdef_fn(8, 8);
237
238
static int cdef_find_dir_c(const pixel *img, const ptrdiff_t stride,
239
                           unsigned *const var HIGHBD_DECL_SUFFIX)
240
1.67M
{
241
1.67M
    const int bitdepth_min_8 = bitdepth_from_max(bitdepth_max) - 8;
242
1.67M
    int partial_sum_hv[2][8] = { { 0 } };
243
1.67M
    int partial_sum_diag[2][15] = { { 0 } };
244
1.67M
    int partial_sum_alt[4][11] = { { 0 } };
245
246
14.7M
    for (int y = 0; y < 8; y++) {
247
117M
        for (int x = 0; x < 8; x++) {
248
103M
            const int px = (img[x] >> bitdepth_min_8) - 128;
249
250
103M
            partial_sum_diag[0][     y       +  x      ] += px;
251
103M
            partial_sum_alt [0][     y       + (x >> 1)] += px;
252
103M
            partial_sum_hv  [0][     y                 ] += px;
253
103M
            partial_sum_alt [1][3 +  y       - (x >> 1)] += px;
254
103M
            partial_sum_diag[1][7 +  y       -  x      ] += px;
255
103M
            partial_sum_alt [2][3 - (y >> 1) +  x      ] += px;
256
103M
            partial_sum_hv  [1][                x      ] += px;
257
103M
            partial_sum_alt [3][    (y >> 1) +  x      ] += px;
258
103M
        }
259
13.0M
        img += PXSTRIDE(stride);
260
13.0M
    }
261
262
1.67M
    unsigned cost[8] = { 0 };
263
15.1M
    for (int n = 0; n < 8; n++) {
264
13.4M
        cost[2] += partial_sum_hv[0][n] * partial_sum_hv[0][n];
265
13.4M
        cost[6] += partial_sum_hv[1][n] * partial_sum_hv[1][n];
266
13.4M
    }
267
1.67M
    cost[2] *= 105;
268
1.67M
    cost[6] *= 105;
269
270
1.67M
    static const uint16_t div_table[7] = { 840, 420, 280, 210, 168, 140, 120 };
271
13.4M
    for (int n = 0; n < 7; n++) {
272
11.7M
        const int d = div_table[n];
273
11.7M
        cost[0] += (partial_sum_diag[0][n]      * partial_sum_diag[0][n] +
274
11.7M
                    partial_sum_diag[0][14 - n] * partial_sum_diag[0][14 - n]) * d;
275
11.7M
        cost[4] += (partial_sum_diag[1][n]      * partial_sum_diag[1][n] +
276
11.7M
                    partial_sum_diag[1][14 - n] * partial_sum_diag[1][14 - n]) * d;
277
11.7M
    }
278
1.67M
    cost[0] += partial_sum_diag[0][7] * partial_sum_diag[0][7] * 105;
279
1.67M
    cost[4] += partial_sum_diag[1][7] * partial_sum_diag[1][7] * 105;
280
281
8.41M
    for (int n = 0; n < 4; n++) {
282
6.73M
        unsigned *const cost_ptr = &cost[n * 2 + 1];
283
40.4M
        for (int m = 0; m < 5; m++)
284
33.6M
            *cost_ptr += partial_sum_alt[n][3 + m] * partial_sum_alt[n][3 + m];
285
6.73M
        *cost_ptr *= 105;
286
26.9M
        for (int m = 0; m < 3; m++) {
287
20.1M
            const int d = div_table[2 * m + 1];
288
20.1M
            *cost_ptr += (partial_sum_alt[n][m]      * partial_sum_alt[n][m] +
289
20.1M
                          partial_sum_alt[n][10 - m] * partial_sum_alt[n][10 - m]) * d;
290
20.1M
        }
291
6.73M
    }
292
293
1.67M
    int best_dir = 0;
294
1.67M
    unsigned best_cost = cost[0];
295
13.5M
    for (int n = 1; n < 8; n++) {
296
11.8M
        if (cost[n] > best_cost) {
297
685k
            best_cost = cost[n];
298
685k
            best_dir = n;
299
685k
        }
300
11.8M
    }
301
302
1.67M
    *var = (best_cost - (cost[best_dir ^ 4])) >> 10;
303
1.67M
    return best_dir;
304
1.67M
}
305
306
#if HAVE_ASM
307
#if ARCH_AARCH64 || ARCH_ARM
308
#include "src/arm/cdef.h"
309
#elif ARCH_PPC64LE
310
#include "src/ppc/cdef.h"
311
#elif ARCH_RISCV
312
#include "src/riscv/cdef.h"
313
#elif ARCH_X86
314
#include "src/x86/cdef.h"
315
#elif ARCH_LOONGARCH64
316
#include "src/loongarch/cdef.h"
317
#endif
318
#endif
319
320
38.2k
COLD void bitfn(dav1d_cdef_dsp_init)(Dav1dCdefDSPContext *const c) {
321
38.2k
    c->dir = cdef_find_dir_c;
322
38.2k
    c->fb[0] = cdef_filter_block_8x8_c;
323
38.2k
    c->fb[1] = cdef_filter_block_4x8_c;
324
38.2k
    c->fb[2] = cdef_filter_block_4x4_c;
325
326
#if HAVE_ASM
327
#if ARCH_AARCH64 || ARCH_ARM
328
    cdef_dsp_init_arm(c);
329
#elif ARCH_PPC64LE
330
    cdef_dsp_init_ppc(c);
331
#elif ARCH_RISCV
332
    cdef_dsp_init_riscv(c);
333
#elif ARCH_X86
334
    cdef_dsp_init_x86(c);
335
#elif ARCH_LOONGARCH64
336
    cdef_dsp_init_loongarch(c);
337
#endif
338
#endif
339
38.2k
}
dav1d_cdef_dsp_init_8bpc
Line
Count
Source
320
16.4k
COLD void bitfn(dav1d_cdef_dsp_init)(Dav1dCdefDSPContext *const c) {
321
16.4k
    c->dir = cdef_find_dir_c;
322
16.4k
    c->fb[0] = cdef_filter_block_8x8_c;
323
16.4k
    c->fb[1] = cdef_filter_block_4x8_c;
324
16.4k
    c->fb[2] = cdef_filter_block_4x4_c;
325
326
#if HAVE_ASM
327
#if ARCH_AARCH64 || ARCH_ARM
328
    cdef_dsp_init_arm(c);
329
#elif ARCH_PPC64LE
330
    cdef_dsp_init_ppc(c);
331
#elif ARCH_RISCV
332
    cdef_dsp_init_riscv(c);
333
#elif ARCH_X86
334
    cdef_dsp_init_x86(c);
335
#elif ARCH_LOONGARCH64
336
    cdef_dsp_init_loongarch(c);
337
#endif
338
#endif
339
16.4k
}
dav1d_cdef_dsp_init_16bpc
Line
Count
Source
320
21.8k
COLD void bitfn(dav1d_cdef_dsp_init)(Dav1dCdefDSPContext *const c) {
321
21.8k
    c->dir = cdef_find_dir_c;
322
21.8k
    c->fb[0] = cdef_filter_block_8x8_c;
323
21.8k
    c->fb[1] = cdef_filter_block_4x8_c;
324
21.8k
    c->fb[2] = cdef_filter_block_4x4_c;
325
326
#if HAVE_ASM
327
#if ARCH_AARCH64 || ARCH_ARM
328
    cdef_dsp_init_arm(c);
329
#elif ARCH_PPC64LE
330
    cdef_dsp_init_ppc(c);
331
#elif ARCH_RISCV
332
    cdef_dsp_init_riscv(c);
333
#elif ARCH_X86
334
    cdef_dsp_init_x86(c);
335
#elif ARCH_LOONGARCH64
336
    cdef_dsp_init_loongarch(c);
337
#endif
338
#endif
339
21.8k
}