GCC Code Coverage Report
Directory: ../../../ffmpeg/ Exec Total Coverage
File: src/libavcodec/binkdsp.c Lines: 59 59 100.0 %
Date: 2019-11-22 03:34:36 Branches: 20 20 100.0 %

Line Branch Exec 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 "config.h"
28
#include "libavutil/attributes.h"
29
#include "binkdsp.h"
30
31
#define A1  2896 /* (1/sqrt(2))<<12 */
32
#define A2  2217
33
#define A3  3784
34
#define A4 -5352
35
36
#define MUL(X,Y) ((int)((unsigned)(X) * (Y)) >> 11)
37
38
#define IDCT_TRANSFORM(dest,s0,s1,s2,s3,s4,s5,s6,s7,d0,d1,d2,d3,d4,d5,d6,d7,munge,src) {\
39
    const int a0 = (src)[s0] + (src)[s4]; \
40
    const int a1 = (src)[s0] - (src)[s4]; \
41
    const int a2 = (src)[s2] + (src)[s6]; \
42
    const int a3 = MUL(A1, (src)[s2] - (src)[s6]); \
43
    const int a4 = (src)[s5] + (src)[s3]; \
44
    const int a5 = (src)[s5] - (src)[s3]; \
45
    const int a6 = (src)[s1] + (src)[s7]; \
46
    const int a7 = (src)[s1] - (src)[s7]; \
47
    const int b0 = a4 + a6; \
48
    const int b1 = MUL(A3, a5 + a7); \
49
    const int b2 = MUL(A4, a5) - b0 + b1; \
50
    const int b3 = MUL(A1, a6 - a4) - b2; \
51
    const int b4 = MUL(A2, a7) + b3 - b1; \
52
    (dest)[d0] = munge(a0+a2   +b0); \
53
    (dest)[d1] = munge(a1+a3-a2+b2); \
54
    (dest)[d2] = munge(a1-a3+a2+b3); \
55
    (dest)[d3] = munge(a0-a2   -b4); \
56
    (dest)[d4] = munge(a0-a2   +b4); \
57
    (dest)[d5] = munge(a1-a3+a2-b3); \
58
    (dest)[d6] = munge(a1+a3-a2-b2); \
59
    (dest)[d7] = munge(a0+a2   -b0); \
60
}
61
/* end IDCT_TRANSFORM macro */
62
63
#define MUNGE_NONE(x) (x)
64
#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)
65
66
#define MUNGE_ROW(x) (((x) + 0x7F)>>8)
67
#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)
68
69
364064
static inline void bink_idct_col(int *dest, const int32_t *src)
70
{
71
364064
    if ((src[8]|src[16]|src[24]|src[32]|src[40]|src[48]|src[56])==0) {
72
248207
        dest[0]  =
73
248207
        dest[8]  =
74
248207
        dest[16] =
75
248207
        dest[24] =
76
248207
        dest[32] =
77
248207
        dest[40] =
78
248207
        dest[48] =
79
248207
        dest[56] = src[0];
80
    } else {
81
115857
        IDCT_COL(dest, src);
82
    }
83
364064
}
84
85
9173
static void bink_idct_c(int32_t *block)
86
{
87
    int i;
88
    int temp[64];
89
90
82557
    for (i = 0; i < 8; i++)
91
73384
        bink_idct_col(&temp[i], &block[i]);
92
82557
    for (i = 0; i < 8; i++) {
93
73384
        IDCT_ROW( (&block[8*i]), (&temp[8*i]) );
94
    }
95
9173
}
96
97
9173
static void bink_idct_add_c(uint8_t *dest, int linesize, int32_t *block)
98
{
99
    int i, j;
100
101
9173
    bink_idct_c(block);
102
82557
    for (i = 0; i < 8; i++, dest += linesize, block += 8)
103
660456
        for (j = 0; j < 8; j++)
104
587072
             dest[j] += block[j];
105
9173
}
106
107
36335
static void bink_idct_put_c(uint8_t *dest, int linesize, int32_t *block)
108
{
109
    int i;
110
    int temp[64];
111
327015
    for (i = 0; i < 8; i++)
112
290680
        bink_idct_col(&temp[i], &block[i]);
113
327015
    for (i = 0; i < 8; i++) {
114
290680
        IDCT_ROW( (&dest[i*linesize]), (&temp[8*i]) );
115
    }
116
36335
}
117
118
21107
static void scale_block_c(const uint8_t src[64]/*align 8*/, uint8_t *dst/*align 8*/, int linesize)
119
{
120
    int i, j;
121
21107
    uint16_t *dst1 = (uint16_t *) dst;
122
21107
    uint16_t *dst2 = (uint16_t *)(dst + linesize);
123
124
189963
    for (j = 0; j < 8; j++) {
125
1519704
        for (i = 0; i < 8; i++) {
126
1350848
            dst1[i] = dst2[i] = src[i] * 0x0101;
127
        }
128
168856
        src  += 8;
129
168856
        dst1 += linesize;
130
168856
        dst2 += linesize;
131
    }
132
21107
}
133
134
17330
static void add_pixels8_c(uint8_t *av_restrict pixels, int16_t *block,
135
                          int line_size)
136
{
137
    int i;
138
139
155970
    for (i = 0; i < 8; i++) {
140
138640
        pixels[0] += block[0];
141
138640
        pixels[1] += block[1];
142
138640
        pixels[2] += block[2];
143
138640
        pixels[3] += block[3];
144
138640
        pixels[4] += block[4];
145
138640
        pixels[5] += block[5];
146
138640
        pixels[6] += block[6];
147
138640
        pixels[7] += block[7];
148
138640
        pixels    += line_size;
149
138640
        block     += 8;
150
    }
151
17330
}
152
153
9
av_cold void ff_binkdsp_init(BinkDSPContext *c)
154
{
155
9
    c->idct_add    = bink_idct_add_c;
156
9
    c->idct_put    = bink_idct_put_c;
157
9
    c->scale_block = scale_block_c;
158
9
    c->add_pixels8 = add_pixels8_c;
159
9
}