blob: 23abc5685e1e7d301e78d22612f45c91e67ef987 [file] [log] [blame]
Justin Rugglesdda3f0e2011-02-10 17:20:361/*
Diego Biurrun831a1182014-01-29 12:12:592 * AC-3 DSP functions
Justin Rugglesdda3f0e2011-02-10 17:20:363 * Copyright (c) 2011 Justin Ruggles
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
Justin Rugglesdda3f0e2011-02-10 17:20:3622#include "avcodec.h"
Mans Rullgard6d9f52b2011-03-11 02:49:5523#include "ac3.h"
Justin Rugglesdda3f0e2011-02-10 17:20:3624#include "ac3dsp.h"
Mans Rullgardf507a9f2011-04-03 18:38:4125#include "mathops.h"
Justin Rugglesdda3f0e2011-02-10 17:20:3626
27static void ac3_exponent_min_c(uint8_t *exp, int num_reuse_blocks, int nb_coefs)
28{
29 int blk, i;
30
31 if (!num_reuse_blocks)
32 return;
33
34 for (i = 0; i < nb_coefs; i++) {
35 uint8_t min_exp = *exp;
36 uint8_t *exp1 = exp + 256;
37 for (blk = 0; blk < num_reuse_blocks; blk++) {
38 uint8_t next_exp = *exp1;
39 if (next_exp < min_exp)
40 min_exp = next_exp;
41 exp1 += 256;
42 }
43 *exp++ = min_exp;
44 }
45}
46
Justin Rugglesfbb6b492011-02-13 19:49:5047static int ac3_max_msb_abs_int16_c(const int16_t *src, int len)
48{
49 int i, v = 0;
50 for (i = 0; i < len; i++)
51 v |= abs(src[i]);
52 return v;
53}
54
Justin Rugglesf1efbca2011-03-11 21:45:0155static void ac3_lshift_int16_c(int16_t *src, unsigned int len,
56 unsigned int shift)
57{
58 uint32_t *src32 = (uint32_t *)src;
59 const uint32_t mask = ~(((1 << shift) - 1) << 16);
60 int i;
61 len >>= 1;
62 for (i = 0; i < len; i += 8) {
63 src32[i ] = (src32[i ] << shift) & mask;
64 src32[i+1] = (src32[i+1] << shift) & mask;
65 src32[i+2] = (src32[i+2] << shift) & mask;
66 src32[i+3] = (src32[i+3] << shift) & mask;
67 src32[i+4] = (src32[i+4] << shift) & mask;
68 src32[i+5] = (src32[i+5] << shift) & mask;
69 src32[i+6] = (src32[i+6] << shift) & mask;
70 src32[i+7] = (src32[i+7] << shift) & mask;
71 }
72}
73
74static void ac3_rshift_int32_c(int32_t *src, unsigned int len,
75 unsigned int shift)
76{
77 do {
78 *src++ >>= shift;
79 *src++ >>= shift;
80 *src++ >>= shift;
81 *src++ >>= shift;
82 *src++ >>= shift;
83 *src++ >>= shift;
84 *src++ >>= shift;
85 *src++ >>= shift;
86 len -= 8;
87 } while (len > 0);
88}
89
Justin Ruggles0f999cf2011-03-16 02:29:0490static void float_to_fixed24_c(int32_t *dst, const float *src, unsigned int len)
91{
92 const float scale = 1 << 24;
93 do {
94 *dst++ = lrintf(*src++ * scale);
95 *dst++ = lrintf(*src++ * scale);
96 *dst++ = lrintf(*src++ * scale);
97 *dst++ = lrintf(*src++ * scale);
98 *dst++ = lrintf(*src++ * scale);
99 *dst++ = lrintf(*src++ * scale);
100 *dst++ = lrintf(*src++ * scale);
101 *dst++ = lrintf(*src++ * scale);
102 len -= 8;
103 } while (len > 0);
104}
105
Mans Rullgard6d9f52b2011-03-11 02:49:55106static void ac3_bit_alloc_calc_bap_c(int16_t *mask, int16_t *psd,
107 int start, int end,
108 int snr_offset, int floor,
109 const uint8_t *bap_tab, uint8_t *bap)
110{
Mans Rullgard034b03e2012-01-31 18:20:33111 int bin, band, band_end;
Mans Rullgard6d9f52b2011-03-11 02:49:55112
113 /* special case, if snr offset is -960, set all bap's to zero */
114 if (snr_offset == -960) {
115 memset(bap, 0, AC3_MAX_COEFS);
116 return;
117 }
118
119 bin = start;
120 band = ff_ac3_bin_to_band_tab[start];
121 do {
122 int m = (FFMAX(mask[band] - snr_offset - floor, 0) & 0x1FE0) + floor;
Mans Rullgard034b03e2012-01-31 18:20:33123 band_end = ff_ac3_band_start_tab[++band];
124 band_end = FFMIN(band_end, end);
125
Mans Rullgard6d9f52b2011-03-11 02:49:55126 for (; bin < band_end; bin++) {
Peter Meerwald9abc80f2015-02-20 00:35:35127 int address = av_clip_uintp2((psd[bin] - m) >> 5, 6);
Mans Rullgard6d9f52b2011-03-11 02:49:55128 bap[bin] = bap_tab[address];
129 }
Mans Rullgard034b03e2012-01-31 18:20:33130 } while (end > band_end);
Mans Rullgard6d9f52b2011-03-11 02:49:55131}
132
Justin Ruggles6ca23db2011-05-26 19:53:25133static void ac3_update_bap_counts_c(uint16_t mant_cnt[16], uint8_t *bap,
134 int len)
Mans Rullgard52fd16a2011-03-11 17:16:27135{
Justin Rugglesdc0ad402011-05-28 18:40:16136 while (len-- > 0)
Justin Ruggles6ca23db2011-05-26 19:53:25137 mant_cnt[bap[len]]++;
138}
Mans Rullgard52fd16a2011-03-11 17:16:27139
Justin Ruggles6ca23db2011-05-26 19:53:25140DECLARE_ALIGNED(16, const uint16_t, ff_ac3_bap_bits)[16] = {
141 0, 0, 0, 3, 0, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16
142};
143
144static int ac3_compute_mantissa_size_c(uint16_t mant_cnt[6][16])
145{
146 int blk, bap;
147 int bits = 0;
148
149 for (blk = 0; blk < AC3_MAX_BLOCKS; blk++) {
150 // bap=1 : 3 mantissas in 5 bits
151 bits += (mant_cnt[blk][1] / 3) * 5;
152 // bap=2 : 3 mantissas in 7 bits
153 // bap=4 : 2 mantissas in 7 bits
154 bits += ((mant_cnt[blk][2] / 3) + (mant_cnt[blk][4] >> 1)) * 7;
155 // bap=3 : 1 mantissa in 3 bits
156 bits += mant_cnt[blk][3] * 3;
157 // bap=5 to 15 : get bits per mantissa from table
158 for (bap = 5; bap < 16; bap++)
159 bits += mant_cnt[blk][bap] * ff_ac3_bap_bits[bap];
Mans Rullgard52fd16a2011-03-11 17:16:27160 }
161 return bits;
162}
163
Mans Rullgard2310ee42011-03-12 22:16:49164static void ac3_extract_exponents_c(uint8_t *exp, int32_t *coef, int nb_coefs)
165{
166 int i;
167
168 for (i = 0; i < nb_coefs; i++) {
Mans Rullgard2310ee42011-03-12 22:16:49169 int v = abs(coef[i]);
Justin Ruggles8b7b2d62011-06-16 20:55:33170 exp[i] = v ? 23 - av_log2(v) : 24;
Mans Rullgard2310ee42011-03-12 22:16:49171 }
172}
173
Mans Rullgardf507a9f2011-04-03 18:38:41174static void ac3_sum_square_butterfly_int32_c(int64_t sum[4],
175 const int32_t *coef0,
176 const int32_t *coef1,
177 int len)
178{
179 int i;
180
181 sum[0] = sum[1] = sum[2] = sum[3] = 0;
182
183 for (i = 0; i < len; i++) {
184 int lt = coef0[i];
185 int rt = coef1[i];
186 int md = lt + rt;
187 int sd = lt - rt;
188 MAC64(sum[0], lt, lt);
189 MAC64(sum[1], rt, rt);
190 MAC64(sum[2], md, md);
191 MAC64(sum[3], sd, sd);
192 }
193}
194
195static void ac3_sum_square_butterfly_float_c(float sum[4],
196 const float *coef0,
197 const float *coef1,
198 int len)
199{
200 int i;
201
202 sum[0] = sum[1] = sum[2] = sum[3] = 0;
203
204 for (i = 0; i < len; i++) {
205 float lt = coef0[i];
206 float rt = coef1[i];
207 float md = lt + rt;
208 float sd = lt - rt;
209 sum[0] += lt * lt;
210 sum[1] += rt * rt;
211 sum[2] += md * md;
212 sum[3] += sd * sd;
213 }
214}
215
Justin Ruggles43717462015-10-28 14:38:20216static void ac3_downmix_c(float **samples, float **matrix,
Mans Rullgard97cb9232012-09-11 16:55:11217 int out_ch, int in_ch, int len)
218{
219 int i, j;
220 float v0, v1;
221 if (out_ch == 2) {
222 for (i = 0; i < len; i++) {
223 v0 = v1 = 0.0f;
224 for (j = 0; j < in_ch; j++) {
Justin Ruggles43717462015-10-28 14:38:20225 v0 += samples[j][i] * matrix[0][j];
226 v1 += samples[j][i] * matrix[1][j];
Mans Rullgard97cb9232012-09-11 16:55:11227 }
228 samples[0][i] = v0;
229 samples[1][i] = v1;
230 }
231 } else if (out_ch == 1) {
232 for (i = 0; i < len; i++) {
233 v0 = 0.0f;
234 for (j = 0; j < in_ch; j++)
Justin Ruggles43717462015-10-28 14:38:20235 v0 += samples[j][i] * matrix[0][j];
Mans Rullgard97cb9232012-09-11 16:55:11236 samples[0][i] = v0;
237 }
238 }
239}
240
Clément Bœsche39d4ff2017-03-22 10:11:28241static void ac3_downmix_c_fixed(int32_t **samples, int16_t **matrix,
Nedeljko Babic696e34a2014-04-01 14:31:08242 int out_ch, int in_ch, int len)
243{
244 int i, j;
245 int64_t v0, v1;
246 if (out_ch == 2) {
247 for (i = 0; i < len; i++) {
248 v0 = v1 = 0;
249 for (j = 0; j < in_ch; j++) {
Clément Bœsche39d4ff2017-03-22 10:11:28250 v0 += (int64_t)samples[j][i] * matrix[0][j];
251 v1 += (int64_t)samples[j][i] * matrix[1][j];
Nedeljko Babic696e34a2014-04-01 14:31:08252 }
253 samples[0][i] = (v0+2048)>>12;
254 samples[1][i] = (v1+2048)>>12;
255 }
256 } else if (out_ch == 1) {
257 for (i = 0; i < len; i++) {
258 v0 = 0;
259 for (j = 0; j < in_ch; j++)
Clément Bœsche39d4ff2017-03-22 10:11:28260 v0 += (int64_t)samples[j][i] * matrix[0][j];
Nedeljko Babic696e34a2014-04-01 14:31:08261 samples[0][i] = (v0+2048)>>12;
262 }
263 }
264}
265
Diego Biurrun4958f352013-12-06 12:22:40266static void apply_window_int16_c(int16_t *output, const int16_t *input,
267 const int16_t *window, unsigned int len)
268{
269 int i;
270 int len2 = len >> 1;
271
272 for (i = 0; i < len2; i++) {
273 int16_t w = window[i];
274 output[i] = (MUL16(input[i], w) + (1 << 14)) >> 15;
275 output[len-i-1] = (MUL16(input[len-i-1], w) + (1 << 14)) >> 15;
276 }
277}
278
Justin Ruggles0f999cf2011-03-16 02:29:04279av_cold void ff_ac3dsp_init(AC3DSPContext *c, int bit_exact)
Justin Rugglesdda3f0e2011-02-10 17:20:36280{
281 c->ac3_exponent_min = ac3_exponent_min_c;
Justin Rugglesfbb6b492011-02-13 19:49:50282 c->ac3_max_msb_abs_int16 = ac3_max_msb_abs_int16_c;
Justin Rugglesf1efbca2011-03-11 21:45:01283 c->ac3_lshift_int16 = ac3_lshift_int16_c;
284 c->ac3_rshift_int32 = ac3_rshift_int32_c;
Justin Ruggles0f999cf2011-03-16 02:29:04285 c->float_to_fixed24 = float_to_fixed24_c;
Mans Rullgard6d9f52b2011-03-11 02:49:55286 c->bit_alloc_calc_bap = ac3_bit_alloc_calc_bap_c;
Justin Ruggles6ca23db2011-05-26 19:53:25287 c->update_bap_counts = ac3_update_bap_counts_c;
Mans Rullgard52fd16a2011-03-11 17:16:27288 c->compute_mantissa_size = ac3_compute_mantissa_size_c;
Mans Rullgard2310ee42011-03-12 22:16:49289 c->extract_exponents = ac3_extract_exponents_c;
Mans Rullgardf507a9f2011-04-03 18:38:41290 c->sum_square_butterfly_int32 = ac3_sum_square_butterfly_int32_c;
291 c->sum_square_butterfly_float = ac3_sum_square_butterfly_float_c;
Mans Rullgard97cb9232012-09-11 16:55:11292 c->downmix = ac3_downmix_c;
Nedeljko Babic696e34a2014-04-01 14:31:08293 c->downmix_fixed = ac3_downmix_c_fixed;
Diego Biurrun4958f352013-12-06 12:22:40294 c->apply_window_int16 = apply_window_int16_c;
Justin Rugglesdda3f0e2011-02-10 17:20:36295
Mans Rullgardf4855a92011-03-09 19:51:50296 if (ARCH_ARM)
297 ff_ac3dsp_init_arm(c, bit_exact);
Janne Grunauf101eab2012-10-05 17:54:10298 if (ARCH_X86)
Justin Ruggles0f999cf2011-03-16 02:29:04299 ff_ac3dsp_init_x86(c, bit_exact);
Bojan Zivkovica74ae462012-11-06 13:06:21300 if (ARCH_MIPS)
301 ff_ac3dsp_init_mips(c, bit_exact);
Justin Rugglesdda3f0e2011-02-10 17:20:36302}