FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavcodec/gsmdec_template.c
Date: 2024-11-20 23:03:26
Exec Total Coverage
Lines: 81 81 100.0%
Functions: 9 9 100.0%
Branches: 32 32 100.0%
Line Branch Exec Source
1 /*
2 * gsm 06.10 decoder
3 * Copyright (c) 2010 Reimar Döffinger <Reimar.Doeffinger@gmx.de>
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 * GSM decoder
25 */
26
27 #include "get_bits.h"
28 #include "gsm.h"
29 #include "gsmdec_data.h"
30
31 2768 static void apcm_dequant_add(GetBitContext *gb, int16_t *dst, const int *frame_bits)
32 {
33 int i, val;
34 2768 int maxidx = get_bits(gb, 6);
35 2768 const int16_t *tab = ff_gsm_dequant_tab[maxidx];
36
2/2
✓ Branch 0 taken 35984 times.
✓ Branch 1 taken 2768 times.
 38752 for (i = 0; i < 13; i++) {
37 35984 val = get_bits(gb, frame_bits[i]);
38 35984 dst[3 * i] += tab[ff_gsm_requant_tab[frame_bits[i]][val]];
39 }
40 2768 }
41
42 1998496 static inline int gsm_mult(int a, int b)
43 {
44 1998496 return (int)(a * (SUINT)b + (1 << 14)) >> 15;
45 }
46
47 2768 static void long_term_synth(int16_t *dst, int lag, int gain_idx)
48 {
49 int i;
50 2768 const int16_t *src = dst - lag;
51 2768 uint16_t gain = ff_gsm_long_term_gain_tab[gain_idx];
52
2/2
✓ Branch 0 taken 110720 times.
✓ Branch 1 taken 2768 times.
 113488 for (i = 0; i < 40; i++)
53 110720 dst[i] = gsm_mult(gain, src[i]);
54 2768 }
55
56 5536 static inline int decode_log_area(int coded, int factor, int offset)
57 {
58 5536 coded <<= 10;
59 5536 coded -= offset;
60 5536 return gsm_mult(coded, factor) * 2;
61 }
62
63 22144 static av_noinline int get_rrp(int filtered)
64 {
65 22144 int abs = FFABS(filtered);
66
2/2
✓ Branch 0 taken 20576 times.
✓ Branch 1 taken 1568 times.
 22144 if (abs < 11059) abs <<= 1;
67
2/2
✓ Branch 0 taken 1480 times.
✓ Branch 1 taken 88 times.
 1568 else if (abs < 20070) abs += 11059;
68 88 else abs = (abs >> 2) + 26112;
69
2/2
✓ Branch 0 taken 9869 times.
✓ Branch 1 taken 12275 times.
 22144 return filtered < 0 ? -abs : abs;
70 }
71
72 110720 static int filter_value(int in, int rrp[8], int v[9])
73 {
74 int i;
75
2/2
✓ Branch 0 taken 885760 times.
✓ Branch 1 taken 110720 times.
 996480 for (i = 7; i >= 0; i--) {
76 885760 in -= gsm_mult(rrp[i], v[i]);
77 885760 v[i + 1] = v[i] + gsm_mult(rrp[i], in);
78 }
79 110720 v[0] = in;
80 110720 return in;
81 }
82
83 692 static void short_term_synth(GSMContext *ctx, int16_t *dst, const int16_t *src)
84 {
85 int i;
86 int rrp[8];
87 692 int *lar = ctx->lar[ctx->lar_idx];
88 692 int *lar_prev = ctx->lar[ctx->lar_idx ^ 1];
89
2/2
✓ Branch 0 taken 5536 times.
✓ Branch 1 taken 692 times.
 6228 for (i = 0; i < 8; i++)
90 5536 rrp[i] = get_rrp((lar_prev[i] >> 2) + (lar_prev[i] >> 1) + (lar[i] >> 2));
91
2/2
✓ Branch 0 taken 8996 times.
✓ Branch 1 taken 692 times.
 9688 for (i = 0; i < 13; i++)
92 8996 dst[i] = filter_value(src[i], rrp, ctx->v);
93
94
2/2
✓ Branch 0 taken 5536 times.
✓ Branch 1 taken 692 times.
 6228 for (i = 0; i < 8; i++)
95 5536 rrp[i] = get_rrp((lar_prev[i] >> 1) + (lar [i] >> 1));
96
2/2
✓ Branch 0 taken 9688 times.
✓ Branch 1 taken 692 times.
 10380 for (i = 13; i < 27; i++)
97 9688 dst[i] = filter_value(src[i], rrp, ctx->v);
98
99
2/2
✓ Branch 0 taken 5536 times.
✓ Branch 1 taken 692 times.
 6228 for (i = 0; i < 8; i++)
100 5536 rrp[i] = get_rrp((lar_prev[i] >> 2) + (lar [i] >> 1) + (lar[i] >> 2));
101
2/2
✓ Branch 0 taken 8996 times.
✓ Branch 1 taken 692 times.
 9688 for (i = 27; i < 40; i++)
102 8996 dst[i] = filter_value(src[i], rrp, ctx->v);
103
104
2/2
✓ Branch 0 taken 5536 times.
✓ Branch 1 taken 692 times.
 6228 for (i = 0; i < 8; i++)
105 5536 rrp[i] = get_rrp(lar[i]);
106
2/2
✓ Branch 0 taken 83040 times.
✓ Branch 1 taken 692 times.
 83732 for (i = 40; i < 160; i++)
107 83040 dst[i] = filter_value(src[i], rrp, ctx->v);
108
109 692 ctx->lar_idx ^= 1;
110 692 }
111
112 692 static int postprocess(int16_t *data, int msr)
113 {
114 int i;
115
2/2
✓ Branch 0 taken 110720 times.
✓ Branch 1 taken 692 times.
 111412 for (i = 0; i < 160; i++) {
116 110720 msr = av_clip_int16(data[i] + gsm_mult(msr, 28180));
117 110720 data[i] = av_clip_int16(msr * 2) & ~7;
118 }
119 692 return msr;
120 }
121
122 692 static int gsm_decode_block(AVCodecContext *avctx, int16_t *samples,
123 GetBitContext *gb, int mode)
124 {
125 692 GSMContext *ctx = avctx->priv_data;
126 int i;
127 692 int16_t *ref_dst = ctx->ref_buf + 120;
128 692 int *lar = ctx->lar[ctx->lar_idx];
129 692 lar[0] = decode_log_area(get_bits(gb, 6), 13107, 1 << 15);
130 692 lar[1] = decode_log_area(get_bits(gb, 6), 13107, 1 << 15);
131 692 lar[2] = decode_log_area(get_bits(gb, 5), 13107, (1 << 14) + 2048*2);
132 692 lar[3] = decode_log_area(get_bits(gb, 5), 13107, (1 << 14) - 2560*2);
133 692 lar[4] = decode_log_area(get_bits(gb, 4), 19223, (1 << 13) + 94*2);
134 692 lar[5] = decode_log_area(get_bits(gb, 4), 17476, (1 << 13) - 1792*2);
135 692 lar[6] = decode_log_area(get_bits(gb, 3), 31454, (1 << 12) - 341*2);
136 692 lar[7] = decode_log_area(get_bits(gb, 3), 29708, (1 << 12) - 1144*2);
137
138
2/2
✓ Branch 0 taken 2768 times.
✓ Branch 1 taken 692 times.
 3460 for (i = 0; i < 4; i++) {
139 2768 int lag = get_bits(gb, 7);
140 2768 int gain_idx = get_bits(gb, 2);
141 2768 int offset = get_bits(gb, 2);
142 2768 lag = av_clip(lag, 40, 120);
143 2768 long_term_synth(ref_dst, lag, gain_idx);
144 2768 apcm_dequant_add(gb, ref_dst + offset, ff_gsm_apcm_bits[mode][i]);
145 2768 ref_dst += 40;
146 }
147 692 memcpy(ctx->ref_buf, ctx->ref_buf + 160, 120 * sizeof(*ctx->ref_buf));
148 692 short_term_synth(ctx, samples, ctx->ref_buf + 120);
149 // for optimal speed this could be merged with short_term_synth,
150 // not done yet because it is a bit ugly
151 692 ctx->msr = postprocess(samples, ctx->msr);
152 692 return 0;
153 }
154