FFmpeg coverage


Directory: ../../../ffmpeg/
File: src/libavcodec/mss34dsp.c
Date: 2022-11-28 23:49:43
Exec Total Coverage
Lines: 23 25 92.0%
Branches: 13 16 81.2%

Line Branch Exec Source
1 /*
2 * Common stuff for some Microsoft Screen codecs
3 * Copyright (C) 2012 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 #include <stdint.h>
23 #include "libavutil/common.h"
24 #include "mss34dsp.h"
25 #include "jpegquanttables.h"
26
27 4 void ff_mss34_gen_quant_mat(uint16_t *qmat, int quality, int luma)
28 {
29 int i;
30
2/2
✓ Branch 0 taken 2 times.
✓ Branch 1 taken 2 times.
4 const uint8_t *qsrc = luma ? ff_mjpeg_std_luminance_quant_tbl : ff_mjpeg_std_chrominance_quant_tbl;
31
32
1/2
✓ Branch 0 taken 4 times.
✗ Branch 1 not taken.
4 if (quality >= 50) {
33 4 int scale = 200 - 2 * quality;
34
35
2/2
✓ Branch 0 taken 256 times.
✓ Branch 1 taken 4 times.
260 for (i = 0; i < 64; i++)
36 256 qmat[i] = (qsrc[i] * scale + 50) / 100;
37 } else {
38 for (i = 0; i < 64; i++)
39 qmat[i] = (5000 * qsrc[i] / quality + 50) / 100;
40 }
41 4 }
42
43 #define DCT_TEMPLATE(blk, step, SOP, shift) \
44 const unsigned t0 =-39409U * blk[7 * step] - 58980U * blk[1 * step]; \
45 const unsigned t1 = 39410U * blk[1 * step] - 58980U * blk[7 * step]; \
46 const unsigned t2 =-33410U * blk[5 * step] -167963U * blk[3 * step]; \
47 const unsigned t3 = 33410U * blk[3 * step] -167963U * blk[5 * step]; \
48 const unsigned t4 = blk[3 * step] + blk[7 * step]; \
49 const unsigned t5 = blk[1 * step] + blk[5 * step]; \
50 const unsigned t6 = 77062U * t4 + 51491U * t5; \
51 const unsigned t7 = 77062U * t5 - 51491U * t4; \
52 const unsigned t8 = 35470U * blk[2 * step] - 85623U * blk[6 * step]; \
53 const unsigned t9 = 35470U * blk[6 * step] + 85623U * blk[2 * step]; \
54 const unsigned tA = SOP(blk[0 * step] - blk[4 * step]); \
55 const unsigned tB = SOP(blk[0 * step] + blk[4 * step]); \
56 \
57 blk[0 * step] = (int)( t1 + t6 + t9 + tB) >> shift; \
58 blk[1 * step] = (int)( t3 + t7 + t8 + tA) >> shift; \
59 blk[2 * step] = (int)( t2 + t6 - t8 + tA) >> shift; \
60 blk[3 * step] = (int)( t0 + t7 - t9 + tB) >> shift; \
61 blk[4 * step] = (int)(-(t0 + t7) - t9 + tB) >> shift; \
62 blk[5 * step] = (int)(-(t2 + t6) - t8 + tA) >> shift; \
63 blk[6 * step] = (int)(-(t3 + t7) + t8 + tA) >> shift; \
64 blk[7 * step] = (int)(-(t1 + t6) + t9 + tB) >> shift; \
65
66 #define SOP_ROW(a) (((a) * (1U << 16)) + 0x2000)
67 #define SOP_COL(a) (((a) + 32) * (1U << 16))
68
69 85284 void ff_mss34_dct_put(uint8_t *dst, ptrdiff_t stride, int *block)
70 {
71 int i, j;
72 int *ptr;
73
74 85284 ptr = block;
75
2/2
✓ Branch 0 taken 682272 times.
✓ Branch 1 taken 85284 times.
767556 for (i = 0; i < 8; i++) {
76 682272 DCT_TEMPLATE(ptr, 1, SOP_ROW, 13);
77 682272 ptr += 8;
78 }
79
80 85284 ptr = block;
81
2/2
✓ Branch 0 taken 682272 times.
✓ Branch 1 taken 85284 times.
767556 for (i = 0; i < 8; i++) {
82 682272 DCT_TEMPLATE(ptr, 8, SOP_COL, 22);
83 682272 ptr++;
84 }
85
86 85284 ptr = block;
87
2/2
✓ Branch 0 taken 682272 times.
✓ Branch 1 taken 85284 times.
767556 for (j = 0; j < 8; j++) {
88
2/2
✓ Branch 0 taken 5458176 times.
✓ Branch 1 taken 682272 times.
6140448 for (i = 0; i < 8; i++)
89 5458176 dst[i] = av_clip_uint8(ptr[i] + 128);
90 682272 dst += stride;
91 682272 ptr += 8;
92 }
93 85284 }
94