Coverage Report

Created: 2026-10-28 08:13

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/ffmpeg/libavcodec/binkdsp.c
Line
Count
Source
1
/*
2
 * Bink DSP routines
3
 * Copyright (c) 2009 Konstantin Shishkov
4
 *
5
 * This file is part of FFmpeg.
6
 *
7
 * FFmpeg is free software; you can redistribute it and/or
8
 * modify it under the terms of the GNU Lesser General Public
9
 * License as published by the Free Software Foundation; either
10
 * version 2.1 of the License, or (at your option) any later version.
11
 *
12
 * FFmpeg is distributed in the hope that it will be useful,
13
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
15
 * Lesser General Public License for more details.
16
 *
17
 * You should have received a copy of the GNU Lesser General Public
18
 * License along with FFmpeg; if not, write to the Free Software
19
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20
 */
21
22
/**
23
 * @file
24
 * Bink DSP routines
25
 */
26
27
#include "libavutil/attributes.h"
28
#include "binkdsp.h"
29
30
#define A1  2896 /* (1/sqrt(2))<<12 */
31
#define A2  2217
32
#define A3  3784
33
#define A4 -5352
34
35
36.4M
#define MUL(X,Y) ((int)((unsigned)(X) * (Y)) >> 11)
36
37
7.28M
#define IDCT_TRANSFORM(dest,s0,s1,s2,s3,s4,s5,s6,s7,d0,d1,d2,d3,d4,d5,d6,d7,munge,src) {\
38
7.28M
    const int a0 = (src)[s0] + (src)[s4]; \
39
7.28M
    const int a1 = (src)[s0] - (src)[s4]; \
40
7.28M
    const int a2 = (src)[s2] + (src)[s6]; \
41
7.28M
    const int a3 = MUL(A1, (src)[s2] - (src)[s6]); \
42
7.28M
    const int a4 = (src)[s5] + (src)[s3]; \
43
7.28M
    const int a5 = (src)[s5] - (src)[s3]; \
44
7.28M
    const int a6 = (src)[s1] + (src)[s7]; \
45
7.28M
    const int a7 = (src)[s1] - (src)[s7]; \
46
7.28M
    const int b0 = a4 + a6; \
47
7.28M
    const int b1 = MUL(A3, a5 + a7); \
48
7.28M
    const int b2 = MUL(A4, a5) - b0 + b1; \
49
7.28M
    const int b3 = MUL(A1, a6 - a4) - b2; \
50
7.28M
    const int b4 = MUL(A2, a7) + b3 - b1; \
51
7.28M
    (dest)[d0] = munge(a0+a2   +b0); \
52
7.28M
    (dest)[d1] = munge(a1+a3-a2+b2); \
53
7.28M
    (dest)[d2] = munge(a1-a3+a2+b3); \
54
7.28M
    (dest)[d3] = munge(a0-a2   -b4); \
55
7.28M
    (dest)[d4] = munge(a0-a2   +b4); \
56
7.28M
    (dest)[d5] = munge(a1-a3+a2-b3); \
57
7.28M
    (dest)[d6] = munge(a1+a3-a2-b2); \
58
7.28M
    (dest)[d7] = munge(a0+a2   -b0); \
59
7.28M
}
60
/* end IDCT_TRANSFORM macro */
61
62
21.8M
#define MUNGE_NONE(x) (x)
63
21.8M
#define IDCT_COL(dest,src) IDCT_TRANSFORM(dest,0,8,16,24,32,40,48,56,0,8,16,24,32,40,48,56,MUNGE_NONE,src)
64
65
36.4M
#define MUNGE_ROW(x) (((x) + 0x7F)>>8)
66
36.4M
#define IDCT_ROW(dest,src) IDCT_TRANSFORM(dest,0,1,2,3,4,5,6,7,0,1,2,3,4,5,6,7,MUNGE_ROW,src)
67
68
static inline void bink_idct_col(int *dest, const int32_t *src)
69
4.55M
{
70
4.55M
    if ((src[8]|src[16]|src[24]|src[32]|src[40]|src[48]|src[56])==0) {
71
1.81M
        dest[0]  =
72
1.81M
        dest[8]  =
73
1.81M
        dest[16] =
74
1.81M
        dest[24] =
75
1.81M
        dest[32] =
76
1.81M
        dest[40] =
77
1.81M
        dest[48] =
78
1.81M
        dest[56] = src[0];
79
2.73M
    } else {
80
2.73M
        IDCT_COL(dest, src);
81
2.73M
    }
82
4.55M
}
83
84
static void bink_idct_c(int32_t *block)
85
97.7k
{
86
97.7k
    int i;
87
97.7k
    int temp[64];
88
89
879k
    for (i = 0; i < 8; i++)
90
782k
        bink_idct_col(&temp[i], &block[i]);
91
879k
    for (i = 0; i < 8; i++) {
92
782k
        IDCT_ROW( (&block[8*i]), (&temp[8*i]) );
93
782k
    }
94
97.7k
}
95
96
static void bink_idct_add_c(uint8_t *dest, int linesize, int32_t *block)
97
97.7k
{
98
97.7k
    int i, j;
99
100
97.7k
    bink_idct_c(block);
101
879k
    for (i = 0; i < 8; i++, dest += linesize, block += 8)
102
7.03M
        for (j = 0; j < 8; j++)
103
6.25M
             dest[j] += block[j];
104
97.7k
}
105
106
static void bink_idct_put_c(uint8_t *dest, int linesize, int32_t *block)
107
471k
{
108
471k
    int i;
109
471k
    int temp[64];
110
4.23M
    for (i = 0; i < 8; i++)
111
3.76M
        bink_idct_col(&temp[i], &block[i]);
112
4.23M
    for (i = 0; i < 8; i++) {
113
3.76M
        IDCT_ROW( (&dest[i*linesize]), (&temp[8*i]) );
114
3.76M
    }
115
471k
}
116
117
static void scale_block_c(const uint8_t src[64]/*align 8*/, uint8_t *dst/*align 8*/, int linesize)
118
218k
{
119
218k
    int i, j;
120
218k
    uint16_t *dst1 = (uint16_t *) dst;
121
218k
    uint16_t *dst2 = (uint16_t *)(dst + linesize);
122
123
1.96M
    for (j = 0; j < 8; j++) {
124
15.7M
        for (i = 0; i < 8; i++) {
125
14.0M
            dst1[i] = dst2[i] = src[i] * 0x0101;
126
14.0M
        }
127
1.75M
        src  += 8;
128
1.75M
        dst1 += linesize;
129
1.75M
        dst2 += linesize;
130
1.75M
    }
131
218k
}
132
133
static void add_pixels8_c(uint8_t *restrict pixels, int16_t *block,
134
                          int line_size)
135
1.73M
{
136
1.73M
    int i;
137
138
15.6M
    for (i = 0; i < 8; i++) {
139
13.8M
        pixels[0] += block[0];
140
13.8M
        pixels[1] += block[1];
141
13.8M
        pixels[2] += block[2];
142
13.8M
        pixels[3] += block[3];
143
13.8M
        pixels[4] += block[4];
144
13.8M
        pixels[5] += block[5];
145
13.8M
        pixels[6] += block[6];
146
13.8M
        pixels[7] += block[7];
147
13.8M
        pixels    += line_size;
148
13.8M
        block     += 8;
149
13.8M
    }
150
1.73M
}
151
152
av_cold void ff_binkdsp_init(BinkDSPContext *c)
153
1.61k
{
154
1.61k
    c->idct_add    = bink_idct_add_c;
155
1.61k
    c->idct_put    = bink_idct_put_c;
156
1.61k
    c->scale_block = scale_block_c;
157
1.61k
    c->add_pixels8 = add_pixels8_c;
158
1.61k
}