FFmpeg coverage


Directory: ../../../ffmpeg/
File: src/libavcodec/hqxdsp.c
Date: 2021-09-22 23:55:11
Exec Total Coverage
Lines: 82 82 100.0%
Branches: 8 8 100.0%

Line Branch Exec Source
1 /*
2 * HQX DSP routines
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 <stdint.h>
22
23 #include "libavutil/common.h"
24
25 #include "hqxdsp.h"
26
27 1774080 static inline void idct_col(int16_t *blk, const uint8_t *quant)
28 {
29 int t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, tA, tB, tC, tD, tE, tF;
30 int t10, t11, t12, t13;
31 int s0, s1, s2, s3, s4, s5, s6, s7;
32
33 1774080 s0 = (int) blk[0 * 8] * quant[0 * 8];
34 1774080 s1 = (int) blk[1 * 8] * quant[1 * 8];
35 1774080 s2 = (int) blk[2 * 8] * quant[2 * 8];
36 1774080 s3 = (int) blk[3 * 8] * quant[3 * 8];
37 1774080 s4 = (int) blk[4 * 8] * quant[4 * 8];
38 1774080 s5 = (int) blk[5 * 8] * quant[5 * 8];
39 1774080 s6 = (int) blk[6 * 8] * quant[6 * 8];
40 1774080 s7 = (int) blk[7 * 8] * quant[7 * 8];
41
42 1774080 t0 = (int)(s3 * 19266U + s5 * 12873U) >> 15;
43 1774080 t1 = (int)(s5 * 19266U - s3 * 12873U) >> 15;
44 1774080 t2 = ((int)(s7 * 4520U + s1 * 22725U) >> 15) - t0;
45 1774080 t3 = ((int)(s1 * 4520U - s7 * 22725U) >> 15) - t1;
46 1774080 t4 = t0 * 2 + t2;
47 1774080 t5 = t1 * 2 + t3;
48 1774080 t6 = t2 - t3;
49 1774080 t7 = t3 * 2 + t6;
50 1774080 t8 = (int)(t6 * 11585U) >> 14;
51 1774080 t9 = (int)(t7 * 11585U) >> 14;
52 1774080 tA = (int)(s2 * 8867U - s6 * 21407U) >> 14;
53 1774080 tB = (int)(s6 * 8867U + s2 * 21407U) >> 14;
54 1774080 tC = (s0 >> 1) - (s4 >> 1);
55 1774080 tD = (s4 >> 1) * 2 + tC;
56 1774080 tE = tC - (tA >> 1);
57 1774080 tF = tD - (tB >> 1);
58 1774080 t10 = tF - t5;
59 1774080 t11 = tE - t8;
60 1774080 t12 = tE + (tA >> 1) * 2 - t9;
61 1774080 t13 = tF + (tB >> 1) * 2 - t4;
62
63 1774080 blk[0 * 8] = t13 + t4 * 2;
64 1774080 blk[1 * 8] = t12 + t9 * 2;
65 1774080 blk[2 * 8] = t11 + t8 * 2;
66 1774080 blk[3 * 8] = t10 + t5 * 2;
67 1774080 blk[4 * 8] = t10;
68 1774080 blk[5 * 8] = t11;
69 1774080 blk[6 * 8] = t12;
70 1774080 blk[7 * 8] = t13;
71 1774080 }
72
73 1774080 static inline void idct_row(int16_t *blk)
74 {
75 int t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, tA, tB, tC, tD, tE, tF;
76 int t10, t11, t12, t13;
77
78 1774080 t0 = (blk[3] * 19266 + blk[5] * 12873) >> 14;
79 1774080 t1 = (blk[5] * 19266 - blk[3] * 12873) >> 14;
80 1774080 t2 = ((blk[7] * 4520 + blk[1] * 22725) >> 14) - t0;
81 1774080 t3 = ((blk[1] * 4520 - blk[7] * 22725) >> 14) - t1;
82 1774080 t4 = t0 * 2 + t2;
83 1774080 t5 = t1 * 2 + t3;
84 1774080 t6 = t2 - t3;
85 1774080 t7 = t3 * 2 + t6;
86 1774080 t8 = (t6 * 11585) >> 14;
87 1774080 t9 = (t7 * 11585) >> 14;
88 1774080 tA = (blk[2] * 8867 - blk[6] * 21407) >> 14;
89 1774080 tB = (blk[6] * 8867 + blk[2] * 21407) >> 14;
90 1774080 tC = blk[0] - blk[4];
91 1774080 tD = blk[4] * 2 + tC;
92 1774080 tE = tC - tA;
93 1774080 tF = tD - tB;
94 1774080 t10 = tF - t5;
95 1774080 t11 = tE - t8;
96 1774080 t12 = tE + tA * 2 - t9;
97 1774080 t13 = tF + tB * 2 - t4;
98
99 1774080 blk[0] = (t13 + t4 * 2 + 4) >> 3;
100 1774080 blk[1] = (t12 + t9 * 2 + 4) >> 3;
101 1774080 blk[2] = (t11 + t8 * 2 + 4) >> 3;
102 1774080 blk[3] = (t10 + t5 * 2 + 4) >> 3;
103 1774080 blk[4] = (t10 + 4) >> 3;
104 1774080 blk[5] = (t11 + 4) >> 3;
105 1774080 blk[6] = (t12 + 4) >> 3;
106 1774080 blk[7] = (t13 + 4) >> 3;
107 1774080 }
108
109 221760 static void hqx_idct_put(uint16_t *dst, ptrdiff_t stride,
110 int16_t *block, const uint8_t *quant)
111 {
112 int i, j;
113
114
2/2
✓ Branch 0 taken 1774080 times.
✓ Branch 1 taken 221760 times.
1995840 for (i = 0; i < 8; i++)
115 1774080 idct_col(block + i, quant + i);
116
2/2
✓ Branch 0 taken 1774080 times.
✓ Branch 1 taken 221760 times.
1995840 for (i = 0; i < 8; i++)
117 1774080 idct_row(block + i * 8);
118
119
2/2
✓ Branch 0 taken 1774080 times.
✓ Branch 1 taken 221760 times.
1995840 for (i = 0; i < 8; i++) {
120
2/2
✓ Branch 0 taken 14192640 times.
✓ Branch 1 taken 1774080 times.
15966720 for (j = 0; j < 8; j++) {
121 14192640 int v = av_clip_uintp2(block[j + i * 8] + 0x800, 12);
122 14192640 dst[j] = (v << 4) | (v >> 8);
123 }
124 1774080 dst += stride >> 1;
125 }
126 221760 }
127
128 4 av_cold void ff_hqxdsp_init(HQXDSPContext *c)
129 {
130 4 c->idct_put = hqx_idct_put;
131 4 }
132