FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavcodec/twinvq.c
Date: 2024-11-20 23:03:26
Exec Total Coverage
Lines: 400 428 93.5%
Functions: 23 23 100.0%
Branches: 144 176 81.8%
Line Branch Exec Source
1 /*
2 * TwinVQ decoder
3 * Copyright (c) 2009 Vitor Sessak
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 <math.h>
23 #include <stdint.h>
24
25 #include "libavutil/channel_layout.h"
26 #include "libavutil/float_dsp.h"
27 #include "libavutil/mem.h"
28 #include "avcodec.h"
29 #include "decode.h"
30 #include "lsp.h"
31 #include "metasound_twinvq_data.h"
32 #include "sinewin.h"
33 #include "twinvq.h"
34
35 /**
36 * Evaluate a single LPC amplitude spectrum envelope coefficient from the line
37 * spectrum pairs.
38 *
39 * @param lsp a vector of the cosine of the LSP values
40 * @param cos_val cos(PI*i/N) where i is the index of the LPC amplitude
41 * @param order the order of the LSP (and the size of the *lsp buffer). Must
42 * be a multiple of four.
43 * @return the LPC value
44 *
45 * @todo reuse code from Vorbis decoder: vorbis_floor0_decode
46 */
47 261804 static float eval_lpc_spectrum(const float *lsp, float cos_val, int order)
48 {
49 int j;
50 261804 float p = 0.5f;
51 261804 float q = 0.5f;
52 261804 float two_cos_w = 2.0f * cos_val;
53
54
2/2
✓ Branch 0 taken 1047216 times.
✓ Branch 1 taken 261804 times.
 1309020 for (j = 0; j + 1 < order; j += 2 * 2) {
55 // Unroll the loop once since order is a multiple of four
56 1047216 q *= lsp[j] - two_cos_w;
57 1047216 p *= lsp[j + 1] - two_cos_w;
58
59 1047216 q *= lsp[j + 2] - two_cos_w;
60 1047216 p *= lsp[j + 3] - two_cos_w;
61 }
62
63 261804 p *= p * (2.0f - two_cos_w);
64 261804 q *= q * (2.0f + two_cos_w);
65
66 261804 return 0.5 / (p + q);
67 }
68
69 /**
70 * Evaluate the LPC amplitude spectrum envelope from the line spectrum pairs.
71 */
72 1 static void eval_lpcenv(TwinVQContext *tctx, const float *cos_vals, float *lpc)
73 {
74 int i;
75 1 const TwinVQModeTab *mtab = tctx->mtab;
76 1 int size_s = mtab->size / mtab->fmode[TWINVQ_FT_SHORT].sub;
77
78
2/2
✓ Branch 0 taken 64 times.
✓ Branch 1 taken 1 times.
 65 for (i = 0; i < size_s / 2; i++) {
79 64 float cos_i = tctx->cos_tabs[0][i];
80 64 lpc[i] = eval_lpc_spectrum(cos_vals, cos_i, mtab->n_lsp);
81 64 lpc[size_s - i - 1] = eval_lpc_spectrum(cos_vals, -cos_i, mtab->n_lsp);
82 }
83 1 }
84
85 259087 static void interpolate(float *out, float v1, float v2, int size)
86 {
87 int i;
88 259087 float step = (v1 - v2) / (size + 1);
89
90
2/2
✓ Branch 0 taken 2297214 times.
✓ Branch 1 taken 259087 times.
 2556301 for (i = 0; i < size; i++) {
91 2297214 v2 += step;
92 2297214 out[i] = v2;
93 }
94 259087 }
95
96 261676 static inline float get_cos(int idx, int part, const float *cos_tab, int size)
97 {
98 87673 return part ? -cos_tab[size - idx - 1]
99
2/2
✓ Branch 0 taken 87673 times.
✓ Branch 1 taken 174003 times.
 261676 : cos_tab[idx];
100 }
101
102 /**
103 * Evaluate the LPC amplitude spectrum envelope from the line spectrum pairs.
104 * Probably for speed reasons, the coefficients are evaluated as
105 * siiiibiiiisiiiibiiiisiiiibiiiisiiiibiiiis ...
106 * where s is an evaluated value, i is a value interpolated from the others
107 * and b might be either calculated or interpolated, depending on an
108 * unexplained condition.
109 *
110 * @param step the size of a block "siiiibiiii"
111 * @param in the cosine of the LSP data
112 * @param part is 0 for 0...PI (positive cosine values) and 1 for PI...2PI
113 * (negative cosine values)
114 * @param size the size of the whole output
115 */
116 5178 static inline void eval_lpcenv_or_interp(TwinVQContext *tctx,
117 enum TwinVQFrameType ftype,
118 float *out, const float *in,
119 int size, int step, int part)
120 {
121 int i;
122 5178 const TwinVQModeTab *mtab = tctx->mtab;
123 5178 const float *cos_tab = tctx->cos_tabs[ftype];
124
125 // Fill the 's'
126
2/2
✓ Branch 0 taken 259296 times.
✓ Branch 1 taken 5178 times.
 264474 for (i = 0; i < size; i += step)
127 259296 out[i] =
128 259296 eval_lpc_spectrum(in,
129 get_cos(i, part, cos_tab, size),
130 259296 mtab->n_lsp);
131
132 // Fill the 'iiiibiiii'
133
2/2
✓ Branch 0 taken 248940 times.
✓ Branch 1 taken 5178 times.
 254118 for (i = step; i <= size - 2 * step; i += step) {
134
2/2
✓ Branch 0 taken 3405 times.
✓ Branch 1 taken 245535 times.
 248940 if (out[i + step] + out[i - step] > 1.95 * out[i] ||
135
2/2
✓ Branch 0 taken 1025 times.
✓ Branch 1 taken 2380 times.
 3405 out[i + step] >= out[i - step]) {
136 246560 interpolate(out + i - step + 1, out[i], out[i - step], step - 1);
137 } else {
138 4760 out[i - step / 2] =
139 2380 eval_lpc_spectrum(in,
140 2380 get_cos(i - step / 2, part, cos_tab, size),
141 2380 mtab->n_lsp);
142 2380 interpolate(out + i - step + 1, out[i - step / 2],
143 2380 out[i - step], step / 2 - 1);
144 2380 interpolate(out + i - step / 2 + 1, out[i],
145 2380 out[i - step / 2], step / 2 - 1);
146 }
147 }
148
149 5178 interpolate(out + size - 2 * step + 1, out[size - step],
150 5178 out[size - 2 * step], step - 1);
151 5178 }
152
153 2589 static void eval_lpcenv_2parts(TwinVQContext *tctx, enum TwinVQFrameType ftype,
154 const float *buf, float *lpc,
155 int size, int step)
156 {
157 2589 eval_lpcenv_or_interp(tctx, ftype, lpc, buf, size / 2, step, 0);
158 2589 eval_lpcenv_or_interp(tctx, ftype, lpc + size / 2, buf, size / 2,
159 2 * step, 1);
160
161 2589 interpolate(lpc + size / 2 - step + 1, lpc[size / 2],
162 2589 lpc[size / 2 - step], step);
163
164 2589 twinvq_memset_float(lpc + size - 2 * step + 1, lpc[size - 2 * step],
165 2589 2 * step - 1);
166 2589 }
167
168 /**
169 * Inverse quantization. Read CB coefficients for cb1 and cb2 from the
170 * bitstream, sum the corresponding vectors and write the result to *out
171 * after permutation.
172 */
173 5067 static void dequant(TwinVQContext *tctx, const uint8_t *cb_bits, float *out,
174 enum TwinVQFrameType ftype,
175 const int16_t *cb0, const int16_t *cb1, int cb_len)
176 {
177 5067 int pos = 0;
178 int i, j;
179
180
2/2
✓ Branch 0 taken 160576 times.
✓ Branch 1 taken 5067 times.
 165643 for (i = 0; i < tctx->n_div[ftype]; i++) {
181 int tmp0, tmp1;
182 160576 int sign0 = 1;
183 160576 int sign1 = 1;
184 const int16_t *tab0, *tab1;
185 160576 int length = tctx->length[ftype][i >= tctx->length_change[ftype]];
186 160576 int bitstream_second_part = (i >= tctx->bits_main_spec_change[ftype]);
187
188 160576 int bits = tctx->bits_main_spec[0][ftype][bitstream_second_part];
189 160576 tmp0 = *cb_bits++;
190
1/2
✓ Branch 0 taken 160576 times.
✗ Branch 1 not taken.
 160576 if (bits == 7) {
191
2/2
✓ Branch 0 taken 80800 times.
✓ Branch 1 taken 79776 times.
 160576 if (tmp0 & 0x40)
192 80800 sign0 = -1;
193 160576 tmp0 &= 0x3F;
194 }
195
196 160576 bits = tctx->bits_main_spec[1][ftype][bitstream_second_part];
197 160576 tmp1 = *cb_bits++;
198
2/2
✓ Branch 0 taken 130057 times.
✓ Branch 1 taken 30519 times.
 160576 if (bits == 7) {
199
2/2
✓ Branch 0 taken 64911 times.
✓ Branch 1 taken 65146 times.
 130057 if (tmp1 & 0x40)
200 64911 sign1 = -1;
201 130057 tmp1 &= 0x3F;
202 }
203
204 160576 tab0 = cb0 + tmp0 * cb_len;
205 160576 tab1 = cb1 + tmp1 * cb_len;
206
207
2/2
✓ Branch 0 taken 2741332 times.
✓ Branch 1 taken 160576 times.
 2901908 for (j = 0; j < length; j++)
208 2741332 out[tctx->permut[ftype][pos + j]] = sign0 * tab0[j] +
209 2741332 sign1 * tab1[j];
210
211 160576 pos += length;
212 }
213 5067 }
214
215 2590 static void dec_gain(TwinVQContext *tctx,
216 enum TwinVQFrameType ftype, float *out)
217 {
218 2590 const TwinVQModeTab *mtab = tctx->mtab;
219 2590 const TwinVQFrameData *bits = &tctx->bits[tctx->cur_frame];
220 int i, j;
221 2590 int channels = tctx->avctx->ch_layout.nb_channels;
222 2590 int sub = mtab->fmode[ftype].sub;
223 2590 float step = TWINVQ_AMP_MAX / ((1 << TWINVQ_GAIN_BITS) - 1);
224 2590 float sub_step = TWINVQ_SUB_AMP_MAX / ((1 << TWINVQ_SUB_GAIN_BITS) - 1);
225
226
2/2
✓ Branch 0 taken 2477 times.
✓ Branch 1 taken 113 times.
 2590 if (ftype == TWINVQ_FT_LONG) {
227
2/2
✓ Branch 0 taken 2477 times.
✓ Branch 1 taken 2477 times.
 4954 for (i = 0; i < channels; i++)
228 2477 out[i] = (1.0 / (1 << 13)) *
229 2477 twinvq_mulawinv(step * 0.5 + step * bits->gain_bits[i],
230 TWINVQ_AMP_MAX, TWINVQ_MULAW_MU);
231 } else {
232
2/2
✓ Branch 0 taken 113 times.
✓ Branch 1 taken 113 times.
 226 for (i = 0; i < channels; i++) {
233 113 float val = (1.0 / (1 << 23)) *
234 113 twinvq_mulawinv(step * 0.5 + step * bits->gain_bits[i],
235 TWINVQ_AMP_MAX, TWINVQ_MULAW_MU);
236
237
2/2
✓ Branch 0 taken 232 times.
✓ Branch 1 taken 113 times.
 345 for (j = 0; j < sub; j++)
238 232 out[i * sub + j] =
239 232 val * twinvq_mulawinv(sub_step * 0.5 +
240 232 sub_step * bits->sub_gain_bits[i * sub + j],
241 TWINVQ_SUB_AMP_MAX, TWINVQ_MULAW_MU);
242 }
243 }
244 2590 }
245
246 /**
247 * Rearrange the LSP coefficients so that they have a minimum distance of
248 * min_dist. This function does it exactly as described in section of 3.2.4
249 * of the G.729 specification (but interestingly is different from what the
250 * reference decoder actually does).
251 */
252 7770 static void rearrange_lsp(int order, float *lsp, float min_dist)
253 {
254 int i;
255 7770 float min_dist2 = min_dist * 0.5;
256
2/2
✓ Branch 0 taken 116550 times.
✓ Branch 1 taken 7770 times.
 124320 for (i = 1; i < order; i++)
257
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 116550 times.
 116550 if (lsp[i] - lsp[i - 1] < min_dist) {
258 ✗ float avg = (lsp[i] + lsp[i - 1]) * 0.5;
259
260 ✗ lsp[i - 1] = avg - min_dist2;
261 ✗ lsp[i] = avg + min_dist2;
262 }
263 7770 }
264
265 2590 static void decode_lsp(TwinVQContext *tctx, int lpc_idx1, uint8_t *lpc_idx2,
266 int lpc_hist_idx, float *lsp, float *hist)
267 {
268 2590 const TwinVQModeTab *mtab = tctx->mtab;
269 int i, j;
270
271 2590 const float *cb = mtab->lspcodebook;
272 2590 const float *cb2 = cb + (1 << mtab->lsp_bit1) * mtab->n_lsp;
273 2590 const float *cb3 = cb2 + (1 << mtab->lsp_bit2) * mtab->n_lsp;
274
275 5180 const int8_t funny_rounding[4] = {
276 -2,
277
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2590 times.
 2590 mtab->lsp_split == 4 ? -2 : 1,
278
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2590 times.
 2590 mtab->lsp_split == 4 ? -2 : 1,
279 0
280 };
281
282 2590 j = 0;
283
2/2
✓ Branch 0 taken 7770 times.
✓ Branch 1 taken 2590 times.
 10360 for (i = 0; i < mtab->lsp_split; i++) {
284 7770 int chunk_end = ((i + 1) * mtab->n_lsp + funny_rounding[i]) /
285 7770 mtab->lsp_split;
286
2/2
✓ Branch 0 taken 41440 times.
✓ Branch 1 taken 7770 times.
 49210 for (; j < chunk_end; j++)
287 41440 lsp[j] = cb[lpc_idx1 * mtab->n_lsp + j] +
288 41440 cb2[lpc_idx2[i] * mtab->n_lsp + j];
289 }
290
291 2590 rearrange_lsp(mtab->n_lsp, lsp, 0.0001);
292
293
2/2
✓ Branch 0 taken 41440 times.
✓ Branch 1 taken 2590 times.
 44030 for (i = 0; i < mtab->n_lsp; i++) {
294 41440 float tmp1 = 1.0 - cb3[lpc_hist_idx * mtab->n_lsp + i];
295 41440 float tmp2 = hist[i] * cb3[lpc_hist_idx * mtab->n_lsp + i];
296 41440 hist[i] = lsp[i];
297 41440 lsp[i] = lsp[i] * tmp1 + tmp2;
298 }
299
300 2590 rearrange_lsp(mtab->n_lsp, lsp, 0.0001);
301 2590 rearrange_lsp(mtab->n_lsp, lsp, 0.000095);
302 2590 ff_sort_nearly_sorted_floats(lsp, mtab->n_lsp);
303 2590 }
304
305 2590 static void dec_lpc_spectrum_inv(TwinVQContext *tctx, float *lsp,
306 enum TwinVQFrameType ftype, float *lpc)
307 {
308 int i;
309 2590 int size = tctx->mtab->size / tctx->mtab->fmode[ftype].sub;
310
311
2/2
✓ Branch 0 taken 41440 times.
✓ Branch 1 taken 2590 times.
 44030 for (i = 0; i < tctx->mtab->n_lsp; i++)
312 41440 lsp[i] = 2 * cos(lsp[i]);
313
314
3/4
✓ Branch 0 taken 2477 times.
✓ Branch 1 taken 112 times.
✓ Branch 2 taken 1 times.
✗ Branch 3 not taken.
 2590 switch (ftype) {
315 2477 case TWINVQ_FT_LONG:
316 2477 eval_lpcenv_2parts(tctx, ftype, lsp, lpc, size, 8);
317 2477 break;
318 112 case TWINVQ_FT_MEDIUM:
319 112 eval_lpcenv_2parts(tctx, ftype, lsp, lpc, size, 2);
320 112 break;
321 1 case TWINVQ_FT_SHORT:
322 1 eval_lpcenv(tctx, lsp, lpc);
323 1 break;
324 }
325 2590 }
326
327 static const uint8_t wtype_to_wsize[] = { 0, 0, 2, 2, 2, 1, 0, 1, 1 };
328
329 2590 static void imdct_and_window(TwinVQContext *tctx, enum TwinVQFrameType ftype,
330 int wtype, float *in, float *prev, int ch)
331 {
332 2590 AVTXContext *tx = tctx->tx[ftype];
333 2590 av_tx_fn tx_fn = tctx->tx_fn[ftype];
334 2590 const TwinVQModeTab *mtab = tctx->mtab;
335 2590 int bsize = mtab->size / mtab->fmode[ftype].sub;
336 2590 int size = mtab->size;
337 2590 float *buf1 = tctx->tmp_buf;
338 int j, first_wsize, wsize; // Window size
339 2590 float *out = tctx->curr_frame + 2 * ch * mtab->size;
340 2590 float *out2 = out;
341 float *prev_buf;
342 2590 int types_sizes[] = {
343 2590 mtab->size / mtab->fmode[TWINVQ_FT_LONG].sub,
344 2590 mtab->size / mtab->fmode[TWINVQ_FT_MEDIUM].sub,
345 2590 mtab->size / (mtab->fmode[TWINVQ_FT_SHORT].sub * 2),
346 };
347
348 2590 wsize = types_sizes[wtype_to_wsize[wtype]];
349 2590 first_wsize = wsize;
350 2590 prev_buf = prev + (size - bsize) / 2;
351
352
2/2
✓ Branch 0 taken 2709 times.
✓ Branch 1 taken 2590 times.
 5299 for (j = 0; j < mtab->fmode[ftype].sub; j++) {
353
2/2
✓ Branch 0 taken 2485 times.
✓ Branch 1 taken 224 times.
 2709 int sub_wtype = ftype == TWINVQ_FT_MEDIUM ? 8 : wtype;
354
355
3/4
✓ Branch 0 taken 2590 times.
✓ Branch 1 taken 119 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 2590 times.
 2709 if (!j && wtype == 4)
356 ✗ sub_wtype = 4;
357
3/4
✓ Branch 0 taken 2590 times.
✓ Branch 1 taken 119 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 2590 times.
 2709 else if (j == mtab->fmode[ftype].sub - 1 && wtype == 7)
358 ✗ sub_wtype = 7;
359
360 2709 wsize = types_sizes[wtype_to_wsize[sub_wtype]];
361
362 2709 tx_fn(tx, buf1 + bsize * j, in + bsize * j, sizeof(float));
363
364 2709 tctx->fdsp->vector_fmul_window(out2, prev_buf + (bsize - wsize) / 2,
365 2709 buf1 + bsize * j,
366 2709 ff_sine_windows[av_log2(wsize)],
367 wsize / 2);
368 2709 out2 += wsize;
369
370 2709 memcpy(out2, buf1 + bsize * j + wsize / 2,
371 2709 (bsize - wsize / 2) * sizeof(float));
372
373
2/2
✓ Branch 0 taken 224 times.
✓ Branch 1 taken 2485 times.
 2709 out2 += ftype == TWINVQ_FT_MEDIUM ? (bsize - wsize) / 2 : bsize - wsize;
374
375 2709 prev_buf = buf1 + bsize * j + bsize / 2;
376 }
377
378 2590 tctx->last_block_pos[ch] = (size + first_wsize) / 2;
379 2590 }
380
381 2590 static void imdct_output(TwinVQContext *tctx, enum TwinVQFrameType ftype,
382 int wtype, float **out, int offset)
383 {
384 2590 const TwinVQModeTab *mtab = tctx->mtab;
385 2590 float *prev_buf = tctx->prev_frame + tctx->last_block_pos[0];
386 2590 int channels = tctx->avctx->ch_layout.nb_channels;
387 int size1, size2, i;
388 float *out1, *out2;
389
390
2/2
✓ Branch 0 taken 2590 times.
✓ Branch 1 taken 2590 times.
 5180 for (i = 0; i < channels; i++)
391 2590 imdct_and_window(tctx, ftype, wtype,
392 2590 tctx->spectrum + i * mtab->size,
393 2590 prev_buf + 2 * i * mtab->size,
394 i);
395
396
2/2
✓ Branch 0 taken 4 times.
✓ Branch 1 taken 2586 times.
 2590 if (!out)
397 4 return;
398
399 2586 size2 = tctx->last_block_pos[0];
400 2586 size1 = mtab->size - size2;
401
402 2586 out1 = &out[0][0] + offset;
403 2586 memcpy(out1, prev_buf, size1 * sizeof(*out1));
404 2586 memcpy(out1 + size1, tctx->curr_frame, size2 * sizeof(*out1));
405
406
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2586 times.
 2586 if (channels == 2) {
407 ✗ out2 = &out[1][0] + offset;
408 ✗ memcpy(out2, &prev_buf[2 * mtab->size],
409 size1 * sizeof(*out2));
410 ✗ memcpy(out2 + size1, &tctx->curr_frame[2 * mtab->size],
411 size2 * sizeof(*out2));
412 ✗ tctx->fdsp->butterflies_float(out1, out2, mtab->size);
413 }
414 }
415
416 2590 static void read_and_decode_spectrum(TwinVQContext *tctx, float *out,
417 enum TwinVQFrameType ftype)
418 {
419 2590 const TwinVQModeTab *mtab = tctx->mtab;
420 2590 TwinVQFrameData *bits = &tctx->bits[tctx->cur_frame];
421 2590 int channels = tctx->avctx->ch_layout.nb_channels;
422 2590 int sub = mtab->fmode[ftype].sub;
423 2590 int block_size = mtab->size / sub;
424 float gain[TWINVQ_CHANNELS_MAX * TWINVQ_SUBBLOCKS_MAX];
425 float ppc_shape[TWINVQ_PPC_SHAPE_LEN_MAX * TWINVQ_CHANNELS_MAX * 4];
426
427 int i, j;
428
429 2590 dequant(tctx, bits->main_coeffs, out, ftype,
430 2590 mtab->fmode[ftype].cb0, mtab->fmode[ftype].cb1,
431 2590 mtab->fmode[ftype].cb_len_read);
432
433 2590 dec_gain(tctx, ftype, gain);
434
435
2/2
✓ Branch 0 taken 2477 times.
✓ Branch 1 taken 113 times.
 2590 if (ftype == TWINVQ_FT_LONG) {
436 2477 int cb_len_p = (tctx->n_div[3] + mtab->ppc_shape_len * channels - 1) /
437 2477 tctx->n_div[3];
438 2477 dequant(tctx, bits->ppc_coeffs, ppc_shape,
439 2477 TWINVQ_FT_PPC, mtab->ppc_shape_cb,
440 2477 mtab->ppc_shape_cb + cb_len_p * TWINVQ_PPC_SHAPE_CB_SIZE,
441 cb_len_p);
442 }
443
444
2/2
✓ Branch 0 taken 2590 times.
✓ Branch 1 taken 2590 times.
 5180 for (i = 0; i < channels; i++) {
445 2590 float *chunk = out + mtab->size * i;
446 float lsp[TWINVQ_LSP_COEFS_MAX];
447
448
2/2
✓ Branch 0 taken 2709 times.
✓ Branch 1 taken 2590 times.
 5299 for (j = 0; j < sub; j++) {
449 2709 tctx->dec_bark_env(tctx, bits->bark1[i][j],
450 2709 bits->bark_use_hist[i][j], i,
451 2709 tctx->tmp_buf, gain[sub * i + j], ftype);
452
453 2709 tctx->fdsp->vector_fmul(chunk + block_size * j,
454 2709 chunk + block_size * j,
455 2709 tctx->tmp_buf, block_size);
456 }
457
458
2/2
✓ Branch 0 taken 2477 times.
✓ Branch 1 taken 113 times.
 2590 if (ftype == TWINVQ_FT_LONG)
459 2477 tctx->decode_ppc(tctx, bits->p_coef[i], bits->g_coef[i],
460 2477 ppc_shape + i * mtab->ppc_shape_len, chunk);
461
462 2590 decode_lsp(tctx, bits->lpc_idx1[i], bits->lpc_idx2[i],
463 2590 bits->lpc_hist_idx[i], lsp, tctx->lsp_hist[i]);
464
465 2590 dec_lpc_spectrum_inv(tctx, lsp, ftype, tctx->tmp_buf);
466
467
2/2
✓ Branch 0 taken 2709 times.
✓ Branch 1 taken 2590 times.
 5299 for (j = 0; j < mtab->fmode[ftype].sub; j++) {
468 2709 tctx->fdsp->vector_fmul(chunk, chunk, tctx->tmp_buf, block_size);
469 2709 chunk += block_size;
470 }
471 }
472 2590 }
473
474 const enum TwinVQFrameType ff_twinvq_wtype_to_ftype_table[] = {
475 TWINVQ_FT_LONG, TWINVQ_FT_LONG, TWINVQ_FT_SHORT, TWINVQ_FT_LONG,
476 TWINVQ_FT_MEDIUM, TWINVQ_FT_LONG, TWINVQ_FT_LONG, TWINVQ_FT_MEDIUM,
477 TWINVQ_FT_MEDIUM
478 };
479
480 2590 int ff_twinvq_decode_frame(AVCodecContext *avctx, AVFrame *frame,
481 int *got_frame_ptr, AVPacket *avpkt)
482 {
483 2590 const uint8_t *buf = avpkt->data;
484 2590 int buf_size = avpkt->size;
485 2590 TwinVQContext *tctx = avctx->priv_data;
486 2590 const TwinVQModeTab *mtab = tctx->mtab;
487 2590 float **out = NULL;
488 int ret;
489
490 /* get output buffer */
491
2/2
✓ Branch 0 taken 2586 times.
✓ Branch 1 taken 4 times.
 2590 if (tctx->discarded_packets >= 2) {
492 2586 frame->nb_samples = mtab->size * tctx->frames_per_packet;
493
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2586 times.
 2586 if ((ret = ff_get_buffer(avctx, frame, 0)) < 0)
494 ✗ return ret;
495 2586 out = (float **)frame->extended_data;
496 }
497
498
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2590 times.
 2590 if (buf_size < avctx->block_align) {
499 ✗ av_log(avctx, AV_LOG_ERROR,
500 "Frame too small (%d bytes). Truncated file?\n", buf_size);
501 ✗ return AVERROR(EINVAL);
502 }
503
504
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2590 times.
 2590 if ((ret = tctx->read_bitstream(avctx, tctx, buf, buf_size)) < 0)
505 ✗ return ret;
506
507
2/2
✓ Branch 0 taken 2590 times.
✓ Branch 1 taken 2590 times.
 5180 for (tctx->cur_frame = 0; tctx->cur_frame < tctx->frames_per_packet;
508 2590 tctx->cur_frame++) {
509 2590 read_and_decode_spectrum(tctx, tctx->spectrum,
510 2590 tctx->bits[tctx->cur_frame].ftype);
511
512 2590 imdct_output(tctx, tctx->bits[tctx->cur_frame].ftype,
513 2590 tctx->bits[tctx->cur_frame].window_type, out,
514 2590 tctx->cur_frame * mtab->size);
515
516 2590 FFSWAP(float *, tctx->curr_frame, tctx->prev_frame);
517 }
518
519
2/2
✓ Branch 0 taken 4 times.
✓ Branch 1 taken 2586 times.
 2590 if (tctx->discarded_packets < 2) {
520 4 tctx->discarded_packets++;
521 4 *got_frame_ptr = 0;
522 4 return buf_size;
523 }
524
525 2586 *got_frame_ptr = 1;
526
527 // VQF can deliver packets 1 byte greater than block align
528
1/2
✓ Branch 0 taken 2586 times.
✗ Branch 1 not taken.
 2586 if (buf_size == avctx->block_align + 1)
529 2586 return buf_size;
530 ✗ return avctx->block_align;
531 }
532
533 /**
534 * Init IMDCT and windowing tables
535 */
536 3 static av_cold int init_mdct_win(TwinVQContext *tctx)
537 {
538 int i, j, ret;
539 3 const TwinVQModeTab *mtab = tctx->mtab;
540 3 int size_s = mtab->size / mtab->fmode[TWINVQ_FT_SHORT].sub;
541 3 int size_m = mtab->size / mtab->fmode[TWINVQ_FT_MEDIUM].sub;
542 3 int channels = tctx->avctx->ch_layout.nb_channels;
543
1/2
✓ Branch 0 taken 3 times.
✗ Branch 1 not taken.
 3 float norm = channels == 1 ? 2.0 : 1.0;
544 3 int table_size = 2 * mtab->size * channels;
545
546
2/2
✓ Branch 0 taken 9 times.
✓ Branch 1 taken 3 times.
 12 for (i = 0; i < 3; i++) {
547 9 int bsize = tctx->mtab->size / tctx->mtab->fmode[i].sub;
548 9 const float scale = -sqrt(norm / bsize) / (1 << 15);
549
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 9 times.
 9 if ((ret = av_tx_init(&tctx->tx[i], &tctx->tx_fn[i], AV_TX_FLOAT_MDCT,
550 1, bsize, &scale, 0)))
551 ✗ return ret;
552 }
553
554
1/2
✓ Branch 1 taken 3 times.
✗ Branch 2 not taken.
 3 if (!FF_ALLOC_TYPED_ARRAY(tctx->tmp_buf, mtab->size) ||
555
1/2
✓ Branch 1 taken 3 times.
✗ Branch 2 not taken.
 3 !FF_ALLOC_TYPED_ARRAY(tctx->spectrum, table_size) ||
556
1/2
✓ Branch 1 taken 3 times.
✗ Branch 2 not taken.
 3 !FF_ALLOC_TYPED_ARRAY(tctx->curr_frame, table_size) ||
557
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 3 times.
 3 !FF_ALLOC_TYPED_ARRAY(tctx->prev_frame, table_size))
558 ✗ return AVERROR(ENOMEM);
559
560
2/2
✓ Branch 0 taken 9 times.
✓ Branch 1 taken 3 times.
 12 for (i = 0; i < 3; i++) {
561 9 int m = 4 * mtab->size / mtab->fmode[i].sub;
562 9 double freq = 2 * M_PI / m;
563
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 9 times.
 9 if (!FF_ALLOC_TYPED_ARRAY(tctx->cos_tabs[i], m / 4))
564 ✗ return AVERROR(ENOMEM);
565
2/2
✓ Branch 0 taken 2505 times.
✓ Branch 1 taken 9 times.
 2514 for (j = 0; j <= m / 8; j++)
566 2505 tctx->cos_tabs[i][j] = cos((2 * j + 1) * freq);
567
2/2
✓ Branch 0 taken 2487 times.
✓ Branch 1 taken 9 times.
 2496 for (j = 1; j < m / 8; j++)
568 2487 tctx->cos_tabs[i][m / 4 - j] = tctx->cos_tabs[i][j];
569 }
570
571 3 ff_init_ff_sine_windows(av_log2(size_m));
572 3 ff_init_ff_sine_windows(av_log2(size_s / 2));
573 3 ff_init_ff_sine_windows(av_log2(mtab->size));
574
575 3 return 0;
576 }
577
578 /**
579 * Interpret the data as if it were a num_blocks x line_len[0] matrix and for
580 * each line do a cyclic permutation, i.e.
581 * abcdefghijklm -> defghijklmabc
582 * where the amount to be shifted is evaluated depending on the column.
583 */
584 12 static void permutate_in_line(int16_t *tab, int num_vect, int num_blocks,
585 int block_size,
586 const uint8_t line_len[2], int length_div,
587 enum TwinVQFrameType ftype)
588 {
589 int i, j;
590
591
2/2
✓ Branch 0 taken 186 times.
✓ Branch 1 taken 12 times.
 198 for (i = 0; i < line_len[0]; i++) {
592 int shift;
593
594
3/4
✓ Branch 0 taken 105 times.
✓ Branch 1 taken 81 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 105 times.
 186 if (num_blocks == 1 ||
595
1/4
✗ Branch 0 not taken.
✗ Branch 1 not taken.
✓ Branch 2 taken 105 times.
✗ Branch 3 not taken.
 105 (ftype == TWINVQ_FT_LONG && num_vect % num_blocks) ||
596
1/2
✓ Branch 0 taken 105 times.
✗ Branch 1 not taken.
 105 (ftype != TWINVQ_FT_LONG && num_vect & 1) ||
597
2/2
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 99 times.
 105 i == line_len[1]) {
598 87 shift = 0;
599
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 99 times.
 99 } else if (ftype == TWINVQ_FT_LONG) {
600 ✗ shift = i;
601 } else
602 99 shift = i * i;
603
604
4/4
✓ Branch 0 taken 9333 times.
✓ Branch 1 taken 177 times.
✓ Branch 2 taken 9324 times.
✓ Branch 3 taken 9 times.
 9510 for (j = 0; j < num_vect && (j + num_vect * i < block_size * num_blocks); j++)
605 9324 tab[i * num_vect + j] = i * num_vect + (j + shift) % num_vect;
606 }
607 12 }
608
609 /**
610 * Interpret the input data as in the following table:
611 *
612 * @verbatim
613 *
614 * abcdefgh
615 * ijklmnop
616 * qrstuvw
617 * x123456
618 *
619 * @endverbatim
620 *
621 * and transpose it, giving the output
622 * aiqxbjr1cks2dlt3emu4fvn5gow6hp
623 */
624 12 static void transpose_perm(int16_t *out, int16_t *in, int num_vect,
625 const uint8_t line_len[2], int length_div)
626 {
627 int i, j;
628 12 int cont = 0;
629
630
2/2
✓ Branch 0 taken 546 times.
✓ Branch 1 taken 12 times.
 558 for (i = 0; i < num_vect; i++)
631
2/2
✓ Branch 0 taken 9324 times.
✓ Branch 1 taken 546 times.
 9870 for (j = 0; j < line_len[i >= length_div]; j++)
632 9324 out[cont++] = in[j * num_vect + i];
633 12 }
634
635 12 static void linear_perm(int16_t *out, int16_t *in, int n_blocks, int size)
636 {
637 12 int block_size = size / n_blocks;
638 int i;
639
640
2/2
✓ Branch 0 taken 9324 times.
✓ Branch 1 taken 12 times.
 9336 for (i = 0; i < size; i++)
641 9324 out[i] = block_size * (in[i] % n_blocks) + in[i] / n_blocks;
642 12 }
643
644 12 static av_cold void construct_perm_table(TwinVQContext *tctx,
645 enum TwinVQFrameType ftype)
646 {
647 int block_size, size;
648 12 const TwinVQModeTab *mtab = tctx->mtab;
649 12 int16_t *tmp_perm = (int16_t *)tctx->tmp_buf;
650
651
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 9 times.
 12 if (ftype == TWINVQ_FT_PPC) {
652 3 size = tctx->avctx->ch_layout.nb_channels;
653 3 block_size = mtab->ppc_shape_len;
654 } else {
655 9 size = tctx->avctx->ch_layout.nb_channels * mtab->fmode[ftype].sub;
656 9 block_size = mtab->size / mtab->fmode[ftype].sub;
657 }
658
659 12 permutate_in_line(tmp_perm, tctx->n_div[ftype], size,
660 12 block_size, tctx->length[ftype],
661 12 tctx->length_change[ftype], ftype);
662
663 12 transpose_perm(tctx->permut[ftype], tmp_perm, tctx->n_div[ftype],
664 12 tctx->length[ftype], tctx->length_change[ftype]);
665
666 12 linear_perm(tctx->permut[ftype], tctx->permut[ftype], size,
667 size * block_size);
668 12 }
669
670 3 static av_cold void init_bitstream_params(TwinVQContext *tctx)
671 {
672 3 const TwinVQModeTab *mtab = tctx->mtab;
673 3 int n_ch = tctx->avctx->ch_layout.nb_channels;
674 3 int total_fr_bits = tctx->avctx->bit_rate * mtab->size /
675 3 tctx->avctx->sample_rate;
676
677 3 int lsp_bits_per_block = n_ch * (mtab->lsp_bit0 + mtab->lsp_bit1 +
678 3 mtab->lsp_split * mtab->lsp_bit2);
679
680 3 int ppc_bits = n_ch * (mtab->pgain_bit + mtab->ppc_shape_bit +
681 3 mtab->ppc_period_bit);
682
683 int bsize_no_main_cb[3], bse_bits[3], i;
684 enum TwinVQFrameType frametype;
685
686
2/2
✓ Branch 0 taken 9 times.
✓ Branch 1 taken 3 times.
 12 for (i = 0; i < 3; i++)
687 // +1 for history usage switch
688 9 bse_bits[i] = n_ch *
689 9 (mtab->fmode[i].bark_n_coef *
690 9 mtab->fmode[i].bark_n_bit + 1);
691
692 3 bsize_no_main_cb[2] = bse_bits[2] + lsp_bits_per_block + ppc_bits +
693 3 TWINVQ_WINDOW_TYPE_BITS + n_ch * TWINVQ_GAIN_BITS;
694
695
2/2
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 3 times.
 9 for (i = 0; i < 2; i++)
696 6 bsize_no_main_cb[i] =
697 6 lsp_bits_per_block + n_ch * TWINVQ_GAIN_BITS +
698 6 TWINVQ_WINDOW_TYPE_BITS +
699 6 mtab->fmode[i].sub * (bse_bits[i] + n_ch * TWINVQ_SUB_GAIN_BITS);
700
701
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 3 if (tctx->codec == TWINVQ_CODEC_METASOUND && !tctx->is_6kbps) {
702 ✗ bsize_no_main_cb[1] += 2;
703 ✗ bsize_no_main_cb[2] += 2;
704 }
705
706 // The remaining bits are all used for the main spectrum coefficients
707
2/2
✓ Branch 0 taken 12 times.
✓ Branch 1 taken 3 times.
 15 for (i = 0; i < 4; i++) {
708 int bit_size, vect_size;
709 int rounded_up, rounded_down, num_rounded_down, num_rounded_up;
710
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 9 times.
 12 if (i == 3) {
711 3 bit_size = n_ch * mtab->ppc_shape_bit;
712 3 vect_size = n_ch * mtab->ppc_shape_len;
713 } else {
714 9 bit_size = total_fr_bits - bsize_no_main_cb[i];
715 9 vect_size = n_ch * mtab->size;
716 }
717
718 12 tctx->n_div[i] = (bit_size + 13) / 14;
719
720 12 rounded_up = (bit_size + tctx->n_div[i] - 1) /
721 12 tctx->n_div[i];
722 12 rounded_down = (bit_size) / tctx->n_div[i];
723 12 num_rounded_down = rounded_up * tctx->n_div[i] - bit_size;
724 12 num_rounded_up = tctx->n_div[i] - num_rounded_down;
725 12 tctx->bits_main_spec[0][i][0] = (rounded_up + 1) / 2;
726 12 tctx->bits_main_spec[1][i][0] = rounded_up / 2;
727 12 tctx->bits_main_spec[0][i][1] = (rounded_down + 1) / 2;
728 12 tctx->bits_main_spec[1][i][1] = rounded_down / 2;
729 12 tctx->bits_main_spec_change[i] = num_rounded_up;
730
731 12 rounded_up = (vect_size + tctx->n_div[i] - 1) /
732 12 tctx->n_div[i];
733 12 rounded_down = (vect_size) / tctx->n_div[i];
734 12 num_rounded_down = rounded_up * tctx->n_div[i] - vect_size;
735 12 num_rounded_up = tctx->n_div[i] - num_rounded_down;
736 12 tctx->length[i][0] = rounded_up;
737 12 tctx->length[i][1] = rounded_down;
738 12 tctx->length_change[i] = num_rounded_up;
739 }
740
741
2/2
✓ Branch 0 taken 12 times.
✓ Branch 1 taken 3 times.
 15 for (frametype = TWINVQ_FT_SHORT; frametype <= TWINVQ_FT_PPC; frametype++)
742 12 construct_perm_table(tctx, frametype);
743 3 }
744
745 3 av_cold int ff_twinvq_decode_close(AVCodecContext *avctx)
746 {
747 3 TwinVQContext *tctx = avctx->priv_data;
748 int i;
749
750
2/2
✓ Branch 0 taken 9 times.
✓ Branch 1 taken 3 times.
 12 for (i = 0; i < 3; i++) {
751 9 av_tx_uninit(&tctx->tx[i]);
752 9 av_freep(&tctx->cos_tabs[i]);
753 }
754
755 3 av_freep(&tctx->curr_frame);
756 3 av_freep(&tctx->spectrum);
757 3 av_freep(&tctx->prev_frame);
758 3 av_freep(&tctx->tmp_buf);
759 3 av_freep(&tctx->fdsp);
760
761 3 return 0;
762 }
763
764 3 av_cold int ff_twinvq_decode_init(AVCodecContext *avctx)
765 {
766 int ret;
767 3 TwinVQContext *tctx = avctx->priv_data;
768 int64_t frames_per_packet;
769
770 3 tctx->avctx = avctx;
771 3 avctx->sample_fmt = AV_SAMPLE_FMT_FLTP;
772
773
2/2
✓ Branch 0 taken 2 times.
✓ Branch 1 taken 1 times.
 3 if (!avctx->block_align) {
774 2 avctx->block_align = tctx->frame_size + 7 >> 3;
775 }
776 3 frames_per_packet = avctx->block_align * 8LL / tctx->frame_size;
777
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
 3 if (frames_per_packet <= 0) {
778 ✗ av_log(avctx, AV_LOG_ERROR, "Block align is %"PRId64" bits, expected %d\n",
779 ✗ avctx->block_align * (int64_t)8, tctx->frame_size);
780 ✗ return AVERROR_INVALIDDATA;
781 }
782
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
 3 if (frames_per_packet > TWINVQ_MAX_FRAMES_PER_PACKET) {
783 ✗ av_log(avctx, AV_LOG_ERROR, "Too many frames per packet (%"PRId64")\n",
784 frames_per_packet);
785 ✗ return AVERROR_INVALIDDATA;
786 }
787 3 tctx->frames_per_packet = frames_per_packet;
788
789 3 tctx->fdsp = avpriv_float_dsp_alloc(avctx->flags & AV_CODEC_FLAG_BITEXACT);
790
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
 3 if (!tctx->fdsp)
791 ✗ return AVERROR(ENOMEM);
792
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 3 times.
 3 if ((ret = init_mdct_win(tctx))) {
793 ✗ av_log(avctx, AV_LOG_ERROR, "Error initializing MDCT\n");
794 ✗ return ret;
795 }
796 3 init_bitstream_params(tctx);
797
798 3 twinvq_memset_float(tctx->bark_hist[0][0], 0.1,
799 FF_ARRAY_ELEMS(tctx->bark_hist));
800
801 3 return 0;
802 }
803