Mercurial > libavcodec.hg
annotate wmadec.c @ 2140:cd1a71898311 libavcodec
TIMER dummies for non-x86
author | michael |
---|---|
date | Mon, 26 Jul 2004 15:52:55 +0000 |
parents | 770743eb4329 |
children | 7524cda1604e |
rev | line source |
---|---|
783 | 1 /* |
2 * WMA compatible decoder | |
3 * Copyright (c) 2002 The FFmpeg Project. | |
4 * | |
5 * This library is free software; you can redistribute it and/or | |
6 * modify it under the terms of the GNU Lesser General Public | |
7 * License as published by the Free Software Foundation; either | |
8 * version 2 of the License, or (at your option) any later version. | |
9 * | |
10 * This library is distributed in the hope that it will be useful, | |
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
13 * Lesser General Public License for more details. | |
14 * | |
15 * You should have received a copy of the GNU Lesser General Public | |
16 * License along with this library; if not, write to the Free Software | |
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
18 */ | |
1106 | 19 |
20 /** | |
21 * @file wmadec.c | |
22 * WMA compatible decoder. | |
1967
2b0fc6b25ab8
add the minimal documentation to make this decoder useful
melanson
parents:
1750
diff
changeset
|
23 * This decoder handles Microsoft Windows Media Audio data, versions 1 & 2. |
2b0fc6b25ab8
add the minimal documentation to make this decoder useful
melanson
parents:
1750
diff
changeset
|
24 * WMA v1 is identified by audio format 0x160 in Microsoft media files |
2b0fc6b25ab8
add the minimal documentation to make this decoder useful
melanson
parents:
1750
diff
changeset
|
25 * (ASF/AVI/WAV). WMA v2 is identified by audio format 0x161. |
2b0fc6b25ab8
add the minimal documentation to make this decoder useful
melanson
parents:
1750
diff
changeset
|
26 * |
2b0fc6b25ab8
add the minimal documentation to make this decoder useful
melanson
parents:
1750
diff
changeset
|
27 * To use this decoder, a calling application must supply the extra data |
2b0fc6b25ab8
add the minimal documentation to make this decoder useful
melanson
parents:
1750
diff
changeset
|
28 * bytes provided with the WMA data. These are the extra, codec-specific |
2b0fc6b25ab8
add the minimal documentation to make this decoder useful
melanson
parents:
1750
diff
changeset
|
29 * bytes at the end of a WAVEFORMATEX data structure. Transmit these bytes |
2b0fc6b25ab8
add the minimal documentation to make this decoder useful
melanson
parents:
1750
diff
changeset
|
30 * to the decoder using the extradata[_size] fields in AVCodecContext. There |
2b0fc6b25ab8
add the minimal documentation to make this decoder useful
melanson
parents:
1750
diff
changeset
|
31 * should be 4 extra bytes for v1 data and 6 extra bytes for v2 data. |
1106 | 32 */ |
33 | |
783 | 34 #include "avcodec.h" |
35 #include "dsputil.h" | |
36 | |
37 /* size of blocks */ | |
38 #define BLOCK_MIN_BITS 7 | |
39 #define BLOCK_MAX_BITS 11 | |
40 #define BLOCK_MAX_SIZE (1 << BLOCK_MAX_BITS) | |
41 | |
42 #define BLOCK_NB_SIZES (BLOCK_MAX_BITS - BLOCK_MIN_BITS + 1) | |
43 | |
44 /* XXX: find exact max size */ | |
45 #define HIGH_BAND_MAX_SIZE 16 | |
46 | |
47 #define NB_LSP_COEFS 10 | |
48 | |
817 | 49 /* XXX: is it a suitable value ? */ |
783 | 50 #define MAX_CODED_SUPERFRAME_SIZE 4096 |
51 | |
52 #define MAX_CHANNELS 2 | |
53 | |
54 #define NOISE_TAB_SIZE 8192 | |
55 | |
56 #define LSP_POW_BITS 7 | |
57 | |
58 typedef struct WMADecodeContext { | |
59 GetBitContext gb; | |
60 int sample_rate; | |
61 int nb_channels; | |
62 int bit_rate; | |
63 int version; /* 1 = 0x160 (WMAV1), 2 = 0x161 (WMAV2) */ | |
64 int block_align; | |
65 int use_bit_reservoir; | |
66 int use_variable_block_len; | |
67 int use_exp_vlc; /* exponent coding: 0 = lsp, 1 = vlc + delta */ | |
68 int use_noise_coding; /* true if perceptual noise is added */ | |
69 int byte_offset_bits; | |
70 VLC exp_vlc; | |
71 int exponent_sizes[BLOCK_NB_SIZES]; | |
72 uint16_t exponent_bands[BLOCK_NB_SIZES][25]; | |
73 int high_band_start[BLOCK_NB_SIZES]; /* index of first coef in high band */ | |
74 int coefs_start; /* first coded coef */ | |
75 int coefs_end[BLOCK_NB_SIZES]; /* max number of coded coefficients */ | |
76 int exponent_high_sizes[BLOCK_NB_SIZES]; | |
77 int exponent_high_bands[BLOCK_NB_SIZES][HIGH_BAND_MAX_SIZE]; | |
78 VLC hgain_vlc; | |
79 | |
80 /* coded values in high bands */ | |
81 int high_band_coded[MAX_CHANNELS][HIGH_BAND_MAX_SIZE]; | |
82 int high_band_values[MAX_CHANNELS][HIGH_BAND_MAX_SIZE]; | |
83 | |
84 /* there are two possible tables for spectral coefficients */ | |
85 VLC coef_vlc[2]; | |
86 uint16_t *run_table[2]; | |
87 uint16_t *level_table[2]; | |
88 /* frame info */ | |
89 int frame_len; /* frame length in samples */ | |
90 int frame_len_bits; /* frame_len = 1 << frame_len_bits */ | |
91 int nb_block_sizes; /* number of block sizes */ | |
92 /* block info */ | |
93 int reset_block_lengths; | |
94 int block_len_bits; /* log2 of current block length */ | |
95 int next_block_len_bits; /* log2 of next block length */ | |
96 int prev_block_len_bits; /* log2 of prev block length */ | |
97 int block_len; /* block length in samples */ | |
98 int block_num; /* block number in current frame */ | |
99 int block_pos; /* current position in frame */ | |
100 uint8_t ms_stereo; /* true if mid/side stereo mode */ | |
101 uint8_t channel_coded[MAX_CHANNELS]; /* true if channel is coded */ | |
972 | 102 float exponents[MAX_CHANNELS][BLOCK_MAX_SIZE] __attribute__((aligned(16))); |
783 | 103 float max_exponent[MAX_CHANNELS]; |
104 int16_t coefs1[MAX_CHANNELS][BLOCK_MAX_SIZE]; | |
972 | 105 float coefs[MAX_CHANNELS][BLOCK_MAX_SIZE] __attribute__((aligned(16))); |
783 | 106 MDCTContext mdct_ctx[BLOCK_NB_SIZES]; |
1031
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
1025
diff
changeset
|
107 float *windows[BLOCK_NB_SIZES]; |
972 | 108 FFTSample mdct_tmp[BLOCK_MAX_SIZE] __attribute__((aligned(16))); /* temporary storage for imdct */ |
783 | 109 /* output buffer for one frame and the last for IMDCT windowing */ |
972 | 110 float frame_out[MAX_CHANNELS][BLOCK_MAX_SIZE * 2] __attribute__((aligned(16))); |
783 | 111 /* last frame info */ |
112 uint8_t last_superframe[MAX_CODED_SUPERFRAME_SIZE + 4]; /* padding added */ | |
113 int last_bitoffset; | |
114 int last_superframe_len; | |
115 float noise_table[NOISE_TAB_SIZE]; | |
116 int noise_index; | |
117 float noise_mult; /* XXX: suppress that and integrate it in the noise array */ | |
118 /* lsp_to_curve tables */ | |
119 float lsp_cos_table[BLOCK_MAX_SIZE]; | |
120 float lsp_pow_e_table[256]; | |
121 float lsp_pow_m_table1[(1 << LSP_POW_BITS)]; | |
122 float lsp_pow_m_table2[(1 << LSP_POW_BITS)]; | |
1343 | 123 |
124 #ifdef TRACE | |
125 int frame_count; | |
126 #endif | |
783 | 127 } WMADecodeContext; |
128 | |
129 typedef struct CoefVLCTable { | |
130 int n; /* total number of codes */ | |
131 const uint32_t *huffcodes; /* VLC bit values */ | |
132 const uint8_t *huffbits; /* VLC bit size */ | |
133 const uint16_t *levels; /* table to build run/level tables */ | |
134 } CoefVLCTable; | |
135 | |
136 static void wma_lsp_to_curve_init(WMADecodeContext *s, int frame_len); | |
137 | |
138 #include "wmadata.h" | |
139 | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
140 #ifdef TRACE |
783 | 141 static void dump_shorts(const char *name, const short *tab, int n) |
142 { | |
143 int i; | |
144 | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
145 tprintf("%s[%d]:\n", name, n); |
783 | 146 for(i=0;i<n;i++) { |
147 if ((i & 7) == 0) | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
148 tprintf("%4d: ", i); |
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
149 tprintf(" %5d.0", tab[i]); |
783 | 150 if ((i & 7) == 7) |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
151 tprintf("\n"); |
783 | 152 } |
153 } | |
154 | |
155 static void dump_floats(const char *name, int prec, const float *tab, int n) | |
156 { | |
157 int i; | |
158 | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
159 tprintf("%s[%d]:\n", name, n); |
783 | 160 for(i=0;i<n;i++) { |
161 if ((i & 7) == 0) | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
162 tprintf("%4d: ", i); |
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
163 tprintf(" %8.*f", prec, tab[i]); |
783 | 164 if ((i & 7) == 7) |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
165 tprintf("\n"); |
783 | 166 } |
167 if ((i & 7) != 0) | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
168 tprintf("\n"); |
783 | 169 } |
170 #endif | |
171 | |
172 /* XXX: use same run/length optimization as mpeg decoders */ | |
173 static void init_coef_vlc(VLC *vlc, | |
174 uint16_t **prun_table, uint16_t **plevel_table, | |
175 const CoefVLCTable *vlc_table) | |
176 { | |
177 int n = vlc_table->n; | |
178 const uint8_t *table_bits = vlc_table->huffbits; | |
179 const uint32_t *table_codes = vlc_table->huffcodes; | |
180 const uint16_t *levels_table = vlc_table->levels; | |
181 uint16_t *run_table, *level_table; | |
182 const uint16_t *p; | |
183 int i, l, j, level; | |
184 | |
185 init_vlc(vlc, 9, n, table_bits, 1, 1, table_codes, 4, 4); | |
186 | |
1031
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
1025
diff
changeset
|
187 run_table = av_malloc(n * sizeof(uint16_t)); |
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
1025
diff
changeset
|
188 level_table = av_malloc(n * sizeof(uint16_t)); |
783 | 189 p = levels_table; |
190 i = 2; | |
191 level = 1; | |
192 while (i < n) { | |
193 l = *p++; | |
194 for(j=0;j<l;j++) { | |
195 run_table[i] = j; | |
196 level_table[i] = level; | |
197 i++; | |
198 } | |
199 level++; | |
200 } | |
201 *prun_table = run_table; | |
202 *plevel_table = level_table; | |
203 } | |
204 | |
205 static int wma_decode_init(AVCodecContext * avctx) | |
206 { | |
207 WMADecodeContext *s = avctx->priv_data; | |
208 int i, flags1, flags2; | |
209 float *window; | |
210 uint8_t *extradata; | |
211 float bps1, high_freq, bps; | |
212 int sample_rate1; | |
213 int coef_vlc_table; | |
214 | |
215 s->sample_rate = avctx->sample_rate; | |
216 s->nb_channels = avctx->channels; | |
217 s->bit_rate = avctx->bit_rate; | |
218 s->block_align = avctx->block_align; | |
219 | |
808
e9bfaabcf07d
fixed nb_block_sizes detection - fixed codec_id test (avctx->codec_id does not need to be initialized)
bellard
parents:
797
diff
changeset
|
220 if (avctx->codec->id == CODEC_ID_WMAV1) { |
783 | 221 s->version = 1; |
222 } else { | |
223 s->version = 2; | |
224 } | |
225 | |
226 /* extract flag infos */ | |
227 flags1 = 0; | |
228 flags2 = 0; | |
229 extradata = avctx->extradata; | |
230 if (s->version == 1 && avctx->extradata_size >= 4) { | |
231 flags1 = extradata[0] | (extradata[1] << 8); | |
232 flags2 = extradata[2] | (extradata[3] << 8); | |
233 } else if (s->version == 2 && avctx->extradata_size >= 6) { | |
234 flags1 = extradata[0] | (extradata[1] << 8) | | |
235 (extradata[2] << 16) | (extradata[3] << 24); | |
236 flags2 = extradata[4] | (extradata[5] << 8); | |
237 } | |
238 s->use_exp_vlc = flags2 & 0x0001; | |
239 s->use_bit_reservoir = flags2 & 0x0002; | |
240 s->use_variable_block_len = flags2 & 0x0004; | |
241 | |
242 /* compute MDCT block size */ | |
243 if (s->sample_rate <= 16000) { | |
244 s->frame_len_bits = 9; | |
795
55add0e7eafb
avoid name clash - fixed again block size selection
bellard
parents:
785
diff
changeset
|
245 } else if (s->sample_rate <= 22050 || |
55add0e7eafb
avoid name clash - fixed again block size selection
bellard
parents:
785
diff
changeset
|
246 (s->sample_rate <= 32000 && s->version == 1)) { |
783 | 247 s->frame_len_bits = 10; |
248 } else { | |
249 s->frame_len_bits = 11; | |
250 } | |
251 s->frame_len = 1 << s->frame_len_bits; | |
252 if (s->use_variable_block_len) { | |
808
e9bfaabcf07d
fixed nb_block_sizes detection - fixed codec_id test (avctx->codec_id does not need to be initialized)
bellard
parents:
797
diff
changeset
|
253 int nb_max, nb; |
e9bfaabcf07d
fixed nb_block_sizes detection - fixed codec_id test (avctx->codec_id does not need to be initialized)
bellard
parents:
797
diff
changeset
|
254 nb = ((flags2 >> 3) & 3) + 1; |
e9bfaabcf07d
fixed nb_block_sizes detection - fixed codec_id test (avctx->codec_id does not need to be initialized)
bellard
parents:
797
diff
changeset
|
255 if ((s->bit_rate / s->nb_channels) >= 32000) |
e9bfaabcf07d
fixed nb_block_sizes detection - fixed codec_id test (avctx->codec_id does not need to be initialized)
bellard
parents:
797
diff
changeset
|
256 nb += 2; |
e9bfaabcf07d
fixed nb_block_sizes detection - fixed codec_id test (avctx->codec_id does not need to be initialized)
bellard
parents:
797
diff
changeset
|
257 nb_max = s->frame_len_bits - BLOCK_MIN_BITS; |
e9bfaabcf07d
fixed nb_block_sizes detection - fixed codec_id test (avctx->codec_id does not need to be initialized)
bellard
parents:
797
diff
changeset
|
258 if (nb > nb_max) |
e9bfaabcf07d
fixed nb_block_sizes detection - fixed codec_id test (avctx->codec_id does not need to be initialized)
bellard
parents:
797
diff
changeset
|
259 nb = nb_max; |
e9bfaabcf07d
fixed nb_block_sizes detection - fixed codec_id test (avctx->codec_id does not need to be initialized)
bellard
parents:
797
diff
changeset
|
260 s->nb_block_sizes = nb + 1; |
783 | 261 } else { |
262 s->nb_block_sizes = 1; | |
263 } | |
264 | |
265 /* init rate dependant parameters */ | |
266 s->use_noise_coding = 1; | |
267 high_freq = s->sample_rate * 0.5; | |
268 | |
269 /* if version 2, then the rates are normalized */ | |
270 sample_rate1 = s->sample_rate; | |
271 if (s->version == 2) { | |
272 if (sample_rate1 >= 44100) | |
273 sample_rate1 = 44100; | |
274 else if (sample_rate1 >= 22050) | |
275 sample_rate1 = 22050; | |
276 else if (sample_rate1 >= 16000) | |
277 sample_rate1 = 16000; | |
278 else if (sample_rate1 >= 11025) | |
279 sample_rate1 = 11025; | |
280 else if (sample_rate1 >= 8000) | |
281 sample_rate1 = 8000; | |
282 } | |
283 | |
284 bps = (float)s->bit_rate / (float)(s->nb_channels * s->sample_rate); | |
285 s->byte_offset_bits = av_log2((int)(bps * s->frame_len / 8.0)) + 2; | |
286 | |
287 /* compute high frequency value and choose if noise coding should | |
288 be activated */ | |
289 bps1 = bps; | |
290 if (s->nb_channels == 2) | |
291 bps1 = bps * 1.6; | |
292 if (sample_rate1 == 44100) { | |
293 if (bps1 >= 0.61) | |
294 s->use_noise_coding = 0; | |
295 else | |
296 high_freq = high_freq * 0.4; | |
297 } else if (sample_rate1 == 22050) { | |
298 if (bps1 >= 1.16) | |
299 s->use_noise_coding = 0; | |
300 else if (bps1 >= 0.72) | |
301 high_freq = high_freq * 0.7; | |
302 else | |
303 high_freq = high_freq * 0.6; | |
304 } else if (sample_rate1 == 16000) { | |
305 if (bps > 0.5) | |
306 high_freq = high_freq * 0.5; | |
307 else | |
308 high_freq = high_freq * 0.3; | |
309 } else if (sample_rate1 == 11025) { | |
310 high_freq = high_freq * 0.7; | |
311 } else if (sample_rate1 == 8000) { | |
312 if (bps <= 0.625) { | |
313 high_freq = high_freq * 0.5; | |
314 } else if (bps > 0.75) { | |
315 s->use_noise_coding = 0; | |
316 } else { | |
317 high_freq = high_freq * 0.65; | |
318 } | |
319 } else { | |
320 if (bps >= 0.8) { | |
321 high_freq = high_freq * 0.75; | |
322 } else if (bps >= 0.6) { | |
323 high_freq = high_freq * 0.6; | |
324 } else { | |
325 high_freq = high_freq * 0.5; | |
326 } | |
327 } | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
328 dprintf("flags1=0x%x flags2=0x%x\n", flags1, flags2); |
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
329 dprintf("version=%d channels=%d sample_rate=%d bitrate=%d block_align=%d\n", |
783 | 330 s->version, s->nb_channels, s->sample_rate, s->bit_rate, |
331 s->block_align); | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
332 dprintf("bps=%f bps1=%f high_freq=%f bitoffset=%d\n", |
783 | 333 bps, bps1, high_freq, s->byte_offset_bits); |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
334 dprintf("use_noise_coding=%d use_exp_vlc=%d nb_block_sizes=%d\n", |
808
e9bfaabcf07d
fixed nb_block_sizes detection - fixed codec_id test (avctx->codec_id does not need to be initialized)
bellard
parents:
797
diff
changeset
|
335 s->use_noise_coding, s->use_exp_vlc, s->nb_block_sizes); |
783 | 336 |
337 /* compute the scale factor band sizes for each MDCT block size */ | |
338 { | |
339 int a, b, pos, lpos, k, block_len, i, j, n; | |
340 const uint8_t *table; | |
341 | |
342 if (s->version == 1) { | |
343 s->coefs_start = 3; | |
344 } else { | |
345 s->coefs_start = 0; | |
346 } | |
347 for(k = 0; k < s->nb_block_sizes; k++) { | |
348 block_len = s->frame_len >> k; | |
349 | |
350 if (s->version == 1) { | |
351 lpos = 0; | |
352 for(i=0;i<25;i++) { | |
353 a = wma_critical_freqs[i]; | |
354 b = s->sample_rate; | |
355 pos = ((block_len * 2 * a) + (b >> 1)) / b; | |
356 if (pos > block_len) | |
357 pos = block_len; | |
358 s->exponent_bands[0][i] = pos - lpos; | |
359 if (pos >= block_len) { | |
360 i++; | |
361 break; | |
362 } | |
363 lpos = pos; | |
364 } | |
365 s->exponent_sizes[0] = i; | |
366 } else { | |
367 /* hardcoded tables */ | |
368 table = NULL; | |
369 a = s->frame_len_bits - BLOCK_MIN_BITS - k; | |
370 if (a < 3) { | |
371 if (s->sample_rate >= 44100) | |
372 table = exponent_band_44100[a]; | |
373 else if (s->sample_rate >= 32000) | |
374 table = exponent_band_32000[a]; | |
375 else if (s->sample_rate >= 22050) | |
376 table = exponent_band_22050[a]; | |
377 } | |
378 if (table) { | |
379 n = *table++; | |
380 for(i=0;i<n;i++) | |
381 s->exponent_bands[k][i] = table[i]; | |
382 s->exponent_sizes[k] = n; | |
383 } else { | |
384 j = 0; | |
385 lpos = 0; | |
386 for(i=0;i<25;i++) { | |
387 a = wma_critical_freqs[i]; | |
388 b = s->sample_rate; | |
389 pos = ((block_len * 2 * a) + (b << 1)) / (4 * b); | |
390 pos <<= 2; | |
391 if (pos > block_len) | |
392 pos = block_len; | |
393 if (pos > lpos) | |
394 s->exponent_bands[k][j++] = pos - lpos; | |
395 if (pos >= block_len) | |
396 break; | |
397 lpos = pos; | |
398 } | |
399 s->exponent_sizes[k] = j; | |
400 } | |
401 } | |
402 | |
403 /* max number of coefs */ | |
404 s->coefs_end[k] = (s->frame_len - ((s->frame_len * 9) / 100)) >> k; | |
405 /* high freq computation */ | |
406 s->high_band_start[k] = (int)((block_len * 2 * high_freq) / | |
407 s->sample_rate + 0.5); | |
408 n = s->exponent_sizes[k]; | |
409 j = 0; | |
410 pos = 0; | |
411 for(i=0;i<n;i++) { | |
412 int start, end; | |
413 start = pos; | |
414 pos += s->exponent_bands[k][i]; | |
415 end = pos; | |
416 if (start < s->high_band_start[k]) | |
417 start = s->high_band_start[k]; | |
418 if (end > s->coefs_end[k]) | |
419 end = s->coefs_end[k]; | |
420 if (end > start) | |
421 s->exponent_high_bands[k][j++] = end - start; | |
422 } | |
423 s->exponent_high_sizes[k] = j; | |
424 #if 0 | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
425 tprintf("%5d: coefs_end=%d high_band_start=%d nb_high_bands=%d: ", |
783 | 426 s->frame_len >> k, |
427 s->coefs_end[k], | |
428 s->high_band_start[k], | |
429 s->exponent_high_sizes[k]); | |
430 for(j=0;j<s->exponent_high_sizes[k];j++) | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
431 tprintf(" %d", s->exponent_high_bands[k][j]); |
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
432 tprintf("\n"); |
783 | 433 #endif |
434 } | |
435 } | |
436 | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
437 #ifdef TRACE |
783 | 438 { |
439 int i, j; | |
440 for(i = 0; i < s->nb_block_sizes; i++) { | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
441 tprintf("%5d: n=%2d:", |
783 | 442 s->frame_len >> i, |
443 s->exponent_sizes[i]); | |
444 for(j=0;j<s->exponent_sizes[i];j++) | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
445 tprintf(" %d", s->exponent_bands[i][j]); |
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
446 tprintf("\n"); |
783 | 447 } |
448 } | |
449 #endif | |
450 | |
451 /* init MDCT */ | |
452 for(i = 0; i < s->nb_block_sizes; i++) | |
795
55add0e7eafb
avoid name clash - fixed again block size selection
bellard
parents:
785
diff
changeset
|
453 ff_mdct_init(&s->mdct_ctx[i], s->frame_len_bits - i + 1, 1); |
783 | 454 |
455 /* init MDCT windows : simple sinus window */ | |
456 for(i = 0; i < s->nb_block_sizes; i++) { | |
457 int n, j; | |
458 float alpha; | |
459 n = 1 << (s->frame_len_bits - i); | |
460 window = av_malloc(sizeof(float) * n); | |
461 alpha = M_PI / (2.0 * n); | |
462 for(j=0;j<n;j++) { | |
463 window[n - j - 1] = sin((j + 0.5) * alpha); | |
464 } | |
465 s->windows[i] = window; | |
466 } | |
467 | |
468 s->reset_block_lengths = 1; | |
469 | |
470 if (s->use_noise_coding) { | |
471 | |
472 /* init the noise generator */ | |
473 if (s->use_exp_vlc) | |
474 s->noise_mult = 0.02; | |
475 else | |
476 s->noise_mult = 0.04; | |
477 | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
478 #ifdef TRACE |
783 | 479 for(i=0;i<NOISE_TAB_SIZE;i++) |
480 s->noise_table[i] = 1.0 * s->noise_mult; | |
481 #else | |
482 { | |
483 unsigned int seed; | |
484 float norm; | |
485 seed = 1; | |
486 norm = (1.0 / (float)(1LL << 31)) * sqrt(3) * s->noise_mult; | |
487 for(i=0;i<NOISE_TAB_SIZE;i++) { | |
488 seed = seed * 314159 + 1; | |
489 s->noise_table[i] = (float)((int)seed) * norm; | |
490 } | |
491 } | |
492 #endif | |
493 init_vlc(&s->hgain_vlc, 9, sizeof(hgain_huffbits), | |
494 hgain_huffbits, 1, 1, | |
495 hgain_huffcodes, 2, 2); | |
496 } | |
497 | |
498 if (s->use_exp_vlc) { | |
499 init_vlc(&s->exp_vlc, 9, sizeof(scale_huffbits), | |
500 scale_huffbits, 1, 1, | |
501 scale_huffcodes, 4, 4); | |
502 } else { | |
503 wma_lsp_to_curve_init(s, s->frame_len); | |
504 } | |
505 | |
506 /* choose the VLC tables for the coefficients */ | |
507 coef_vlc_table = 2; | |
508 if (s->sample_rate >= 32000) { | |
509 if (bps1 < 0.72) | |
510 coef_vlc_table = 0; | |
511 else if (bps1 < 1.16) | |
512 coef_vlc_table = 1; | |
513 } | |
514 | |
515 init_coef_vlc(&s->coef_vlc[0], &s->run_table[0], &s->level_table[0], | |
516 &coef_vlcs[coef_vlc_table * 2]); | |
517 init_coef_vlc(&s->coef_vlc[1], &s->run_table[1], &s->level_table[1], | |
518 &coef_vlcs[coef_vlc_table * 2 + 1]); | |
519 return 0; | |
520 } | |
521 | |
522 /* interpolate values for a bigger or smaller block. The block must | |
523 have multiple sizes */ | |
524 static void interpolate_array(float *scale, int old_size, int new_size) | |
525 { | |
526 int i, j, jincr, k; | |
527 float v; | |
528 | |
529 if (new_size > old_size) { | |
530 jincr = new_size / old_size; | |
531 j = new_size; | |
532 for(i = old_size - 1; i >=0; i--) { | |
533 v = scale[i]; | |
534 k = jincr; | |
535 do { | |
536 scale[--j] = v; | |
537 } while (--k); | |
538 } | |
539 } else if (new_size < old_size) { | |
540 j = 0; | |
541 jincr = old_size / new_size; | |
542 for(i = 0; i < new_size; i++) { | |
543 scale[i] = scale[j]; | |
544 j += jincr; | |
545 } | |
546 } | |
547 } | |
548 | |
549 /* compute x^-0.25 with an exponent and mantissa table. We use linear | |
550 interpolation to reduce the mantissa table size at a small speed | |
551 expense (linear interpolation approximately doubles the number of | |
552 bits of precision). */ | |
553 static inline float pow_m1_4(WMADecodeContext *s, float x) | |
554 { | |
555 union { | |
556 float f; | |
557 unsigned int v; | |
558 } u, t; | |
559 unsigned int e, m; | |
560 float a, b; | |
561 | |
562 u.f = x; | |
563 e = u.v >> 23; | |
564 m = (u.v >> (23 - LSP_POW_BITS)) & ((1 << LSP_POW_BITS) - 1); | |
565 /* build interpolation scale: 1 <= t < 2. */ | |
566 t.v = ((u.v << LSP_POW_BITS) & ((1 << 23) - 1)) | (127 << 23); | |
567 a = s->lsp_pow_m_table1[m]; | |
568 b = s->lsp_pow_m_table2[m]; | |
569 return s->lsp_pow_e_table[e] * (a + b * t.f); | |
570 } | |
571 | |
572 static void wma_lsp_to_curve_init(WMADecodeContext *s, int frame_len) | |
573 { | |
574 float wdel, a, b; | |
575 int i, e, m; | |
576 | |
577 wdel = M_PI / frame_len; | |
578 for(i=0;i<frame_len;i++) | |
579 s->lsp_cos_table[i] = 2.0f * cos(wdel * i); | |
580 | |
581 /* tables for x^-0.25 computation */ | |
582 for(i=0;i<256;i++) { | |
583 e = i - 126; | |
584 s->lsp_pow_e_table[i] = pow(2.0, e * -0.25); | |
585 } | |
586 | |
587 /* NOTE: these two tables are needed to avoid two operations in | |
588 pow_m1_4 */ | |
589 b = 1.0; | |
590 for(i=(1 << LSP_POW_BITS) - 1;i>=0;i--) { | |
591 m = (1 << LSP_POW_BITS) + i; | |
592 a = (float)m * (0.5 / (1 << LSP_POW_BITS)); | |
593 a = pow(a, -0.25); | |
594 s->lsp_pow_m_table1[i] = 2 * a - b; | |
595 s->lsp_pow_m_table2[i] = b - a; | |
596 b = a; | |
597 } | |
598 #if 0 | |
599 for(i=1;i<20;i++) { | |
600 float v, r1, r2; | |
601 v = 5.0 / i; | |
602 r1 = pow_m1_4(s, v); | |
603 r2 = pow(v,-0.25); | |
604 printf("%f^-0.25=%f e=%f\n", v, r1, r2 - r1); | |
605 } | |
606 #endif | |
607 } | |
608 | |
609 /* NOTE: We use the same code as Vorbis here */ | |
610 /* XXX: optimize it further with SSE/3Dnow */ | |
611 static void wma_lsp_to_curve(WMADecodeContext *s, | |
612 float *out, float *val_max_ptr, | |
613 int n, float *lsp) | |
614 { | |
615 int i, j; | |
616 float p, q, w, v, val_max; | |
617 | |
618 val_max = 0; | |
619 for(i=0;i<n;i++) { | |
620 p = 0.5f; | |
621 q = 0.5f; | |
622 w = s->lsp_cos_table[i]; | |
623 for(j=1;j<NB_LSP_COEFS;j+=2){ | |
624 q *= w - lsp[j - 1]; | |
625 p *= w - lsp[j]; | |
626 } | |
627 p *= p * (2.0f - w); | |
628 q *= q * (2.0f + w); | |
629 v = p + q; | |
630 v = pow_m1_4(s, v); | |
631 if (v > val_max) | |
632 val_max = v; | |
633 out[i] = v; | |
634 } | |
635 *val_max_ptr = val_max; | |
636 } | |
637 | |
638 /* decode exponents coded with LSP coefficients (same idea as Vorbis) */ | |
639 static void decode_exp_lsp(WMADecodeContext *s, int ch) | |
640 { | |
641 float lsp_coefs[NB_LSP_COEFS]; | |
642 int val, i; | |
643 | |
644 for(i = 0; i < NB_LSP_COEFS; i++) { | |
645 if (i == 0 || i >= 8) | |
646 val = get_bits(&s->gb, 3); | |
647 else | |
648 val = get_bits(&s->gb, 4); | |
649 lsp_coefs[i] = lsp_codebook[i][val]; | |
650 } | |
651 | |
652 wma_lsp_to_curve(s, s->exponents[ch], &s->max_exponent[ch], | |
653 s->block_len, lsp_coefs); | |
654 } | |
655 | |
656 /* decode exponents coded with VLC codes */ | |
657 static int decode_exp_vlc(WMADecodeContext *s, int ch) | |
658 { | |
659 int last_exp, n, code; | |
660 const uint16_t *ptr, *band_ptr; | |
661 float v, *q, max_scale, *q_end; | |
662 | |
663 band_ptr = s->exponent_bands[s->frame_len_bits - s->block_len_bits]; | |
664 ptr = band_ptr; | |
665 q = s->exponents[ch]; | |
666 q_end = q + s->block_len; | |
667 max_scale = 0; | |
668 if (s->version == 1) { | |
669 last_exp = get_bits(&s->gb, 5) + 10; | |
670 /* XXX: use a table */ | |
671 v = pow(10, last_exp * (1.0 / 16.0)); | |
672 max_scale = v; | |
673 n = *ptr++; | |
674 do { | |
675 *q++ = v; | |
676 } while (--n); | |
677 } | |
678 last_exp = 36; | |
679 while (q < q_end) { | |
680 code = get_vlc(&s->gb, &s->exp_vlc); | |
681 if (code < 0) | |
682 return -1; | |
683 /* NOTE: this offset is the same as MPEG4 AAC ! */ | |
684 last_exp += code - 60; | |
685 /* XXX: use a table */ | |
686 v = pow(10, last_exp * (1.0 / 16.0)); | |
687 if (v > max_scale) | |
688 max_scale = v; | |
689 n = *ptr++; | |
690 do { | |
691 *q++ = v; | |
692 } while (--n); | |
693 } | |
694 s->max_exponent[ch] = max_scale; | |
695 return 0; | |
696 } | |
697 | |
698 /* return 0 if OK. return 1 if last block of frame. return -1 if | |
699 unrecorrable error. */ | |
700 static int wma_decode_block(WMADecodeContext *s) | |
701 { | |
702 int n, v, a, ch, code, bsize; | |
703 int coef_nb_bits, total_gain, parse_exponents; | |
704 float window[BLOCK_MAX_SIZE * 2]; | |
2101 | 705 // XXX: FIXME!! there's a bug somewhere which makes this mandatory under altivec |
706 #ifdef HAVE_ALTIVEC | |
707 volatile int nb_coefs[MAX_CHANNELS] __attribute__((aligned(16))); | |
708 #else | |
783 | 709 int nb_coefs[MAX_CHANNELS]; |
2101 | 710 #endif |
783 | 711 float mdct_norm; |
712 | |
1343 | 713 #ifdef TRACE |
714 tprintf("***decode_block: %d:%d\n", s->frame_count - 1, s->block_num); | |
715 #endif | |
783 | 716 |
717 /* compute current block length */ | |
718 if (s->use_variable_block_len) { | |
719 n = av_log2(s->nb_block_sizes - 1) + 1; | |
720 | |
721 if (s->reset_block_lengths) { | |
722 s->reset_block_lengths = 0; | |
723 v = get_bits(&s->gb, n); | |
724 if (v >= s->nb_block_sizes) | |
725 return -1; | |
726 s->prev_block_len_bits = s->frame_len_bits - v; | |
727 v = get_bits(&s->gb, n); | |
728 if (v >= s->nb_block_sizes) | |
729 return -1; | |
730 s->block_len_bits = s->frame_len_bits - v; | |
731 } else { | |
732 /* update block lengths */ | |
733 s->prev_block_len_bits = s->block_len_bits; | |
734 s->block_len_bits = s->next_block_len_bits; | |
735 } | |
736 v = get_bits(&s->gb, n); | |
737 if (v >= s->nb_block_sizes) | |
738 return -1; | |
739 s->next_block_len_bits = s->frame_len_bits - v; | |
740 } else { | |
741 /* fixed block len */ | |
742 s->next_block_len_bits = s->frame_len_bits; | |
743 s->prev_block_len_bits = s->frame_len_bits; | |
744 s->block_len_bits = s->frame_len_bits; | |
745 } | |
746 | |
747 /* now check if the block length is coherent with the frame length */ | |
748 s->block_len = 1 << s->block_len_bits; | |
749 if ((s->block_pos + s->block_len) > s->frame_len) | |
750 return -1; | |
751 | |
752 if (s->nb_channels == 2) { | |
753 s->ms_stereo = get_bits(&s->gb, 1); | |
754 } | |
755 v = 0; | |
756 for(ch = 0; ch < s->nb_channels; ch++) { | |
757 a = get_bits(&s->gb, 1); | |
758 s->channel_coded[ch] = a; | |
759 v |= a; | |
760 } | |
761 /* if no channel coded, no need to go further */ | |
762 /* XXX: fix potential framing problems */ | |
763 if (!v) | |
764 goto next; | |
765 | |
766 bsize = s->frame_len_bits - s->block_len_bits; | |
767 | |
768 /* read total gain and extract corresponding number of bits for | |
769 coef escape coding */ | |
770 total_gain = 1; | |
771 for(;;) { | |
772 a = get_bits(&s->gb, 7); | |
773 total_gain += a; | |
774 if (a != 127) | |
775 break; | |
776 } | |
777 | |
778 if (total_gain < 15) | |
779 coef_nb_bits = 13; | |
780 else if (total_gain < 32) | |
781 coef_nb_bits = 12; | |
782 else if (total_gain < 40) | |
783 coef_nb_bits = 11; | |
784 else if (total_gain < 45) | |
785 coef_nb_bits = 10; | |
786 else | |
787 coef_nb_bits = 9; | |
788 | |
789 /* compute number of coefficients */ | |
790 n = s->coefs_end[bsize] - s->coefs_start; | |
791 for(ch = 0; ch < s->nb_channels; ch++) | |
792 nb_coefs[ch] = n; | |
793 | |
794 /* complex coding */ | |
795 if (s->use_noise_coding) { | |
796 | |
797 for(ch = 0; ch < s->nb_channels; ch++) { | |
798 if (s->channel_coded[ch]) { | |
799 int i, n, a; | |
800 n = s->exponent_high_sizes[bsize]; | |
801 for(i=0;i<n;i++) { | |
802 a = get_bits(&s->gb, 1); | |
803 s->high_band_coded[ch][i] = a; | |
804 /* if noise coding, the coefficients are not transmitted */ | |
805 if (a) | |
806 nb_coefs[ch] -= s->exponent_high_bands[bsize][i]; | |
807 } | |
808 } | |
809 } | |
810 for(ch = 0; ch < s->nb_channels; ch++) { | |
811 if (s->channel_coded[ch]) { | |
812 int i, n, val, code; | |
813 | |
814 n = s->exponent_high_sizes[bsize]; | |
815 val = (int)0x80000000; | |
816 for(i=0;i<n;i++) { | |
817 if (s->high_band_coded[ch][i]) { | |
818 if (val == (int)0x80000000) { | |
819 val = get_bits(&s->gb, 7) - 19; | |
820 } else { | |
821 code = get_vlc(&s->gb, &s->hgain_vlc); | |
822 if (code < 0) | |
823 return -1; | |
824 val += code - 18; | |
825 } | |
826 s->high_band_values[ch][i] = val; | |
827 } | |
828 } | |
829 } | |
830 } | |
831 } | |
832 | |
833 /* exposant can be interpolated in short blocks. */ | |
834 parse_exponents = 1; | |
835 if (s->block_len_bits != s->frame_len_bits) { | |
836 parse_exponents = get_bits(&s->gb, 1); | |
837 } | |
838 | |
839 if (parse_exponents) { | |
840 for(ch = 0; ch < s->nb_channels; ch++) { | |
841 if (s->channel_coded[ch]) { | |
842 if (s->use_exp_vlc) { | |
843 if (decode_exp_vlc(s, ch) < 0) | |
844 return -1; | |
845 } else { | |
846 decode_exp_lsp(s, ch); | |
847 } | |
848 } | |
849 } | |
850 } else { | |
851 for(ch = 0; ch < s->nb_channels; ch++) { | |
852 if (s->channel_coded[ch]) { | |
853 interpolate_array(s->exponents[ch], 1 << s->prev_block_len_bits, | |
854 s->block_len); | |
855 } | |
856 } | |
857 } | |
858 | |
859 /* parse spectral coefficients : just RLE encoding */ | |
860 for(ch = 0; ch < s->nb_channels; ch++) { | |
861 if (s->channel_coded[ch]) { | |
862 VLC *coef_vlc; | |
863 int level, run, sign, tindex; | |
864 int16_t *ptr, *eptr; | |
865 const int16_t *level_table, *run_table; | |
866 | |
867 /* special VLC tables are used for ms stereo because | |
868 there is potentially less energy there */ | |
869 tindex = (ch == 1 && s->ms_stereo); | |
870 coef_vlc = &s->coef_vlc[tindex]; | |
871 run_table = s->run_table[tindex]; | |
872 level_table = s->level_table[tindex]; | |
873 /* XXX: optimize */ | |
874 ptr = &s->coefs1[ch][0]; | |
875 eptr = ptr + nb_coefs[ch]; | |
876 memset(ptr, 0, s->block_len * sizeof(int16_t)); | |
877 for(;;) { | |
878 code = get_vlc(&s->gb, coef_vlc); | |
879 if (code < 0) | |
880 return -1; | |
881 if (code == 1) { | |
882 /* EOB */ | |
883 break; | |
884 } else if (code == 0) { | |
885 /* escape */ | |
886 level = get_bits(&s->gb, coef_nb_bits); | |
887 /* NOTE: this is rather suboptimal. reading | |
888 block_len_bits would be better */ | |
889 run = get_bits(&s->gb, s->frame_len_bits); | |
890 } else { | |
891 /* normal code */ | |
892 run = run_table[code]; | |
893 level = level_table[code]; | |
894 } | |
895 sign = get_bits(&s->gb, 1); | |
896 if (!sign) | |
897 level = -level; | |
898 ptr += run; | |
899 if (ptr >= eptr) | |
900 return -1; | |
901 *ptr++ = level; | |
902 /* NOTE: EOB can be omitted */ | |
903 if (ptr >= eptr) | |
904 break; | |
905 } | |
906 } | |
907 if (s->version == 1 && s->nb_channels >= 2) { | |
908 align_get_bits(&s->gb); | |
909 } | |
910 } | |
911 | |
912 /* normalize */ | |
913 { | |
914 int n4 = s->block_len / 2; | |
915 mdct_norm = 1.0 / (float)n4; | |
916 if (s->version == 1) { | |
917 mdct_norm *= sqrt(n4); | |
918 } | |
919 } | |
920 | |
921 /* finally compute the MDCT coefficients */ | |
922 for(ch = 0; ch < s->nb_channels; ch++) { | |
923 if (s->channel_coded[ch]) { | |
924 int16_t *coefs1; | |
925 float *coefs, *exponents, mult, mult1, noise, *exp_ptr; | |
926 int i, j, n, n1, last_high_band; | |
927 float exp_power[HIGH_BAND_MAX_SIZE]; | |
928 | |
929 coefs1 = s->coefs1[ch]; | |
930 exponents = s->exponents[ch]; | |
931 mult = pow(10, total_gain * 0.05) / s->max_exponent[ch]; | |
932 mult *= mdct_norm; | |
933 coefs = s->coefs[ch]; | |
934 if (s->use_noise_coding) { | |
935 mult1 = mult; | |
936 /* very low freqs : noise */ | |
937 for(i = 0;i < s->coefs_start; i++) { | |
938 *coefs++ = s->noise_table[s->noise_index] * (*exponents++) * mult1; | |
939 s->noise_index = (s->noise_index + 1) & (NOISE_TAB_SIZE - 1); | |
940 } | |
941 | |
942 n1 = s->exponent_high_sizes[bsize]; | |
943 | |
944 /* compute power of high bands */ | |
945 exp_ptr = exponents + | |
946 s->high_band_start[bsize] - | |
947 s->coefs_start; | |
948 last_high_band = 0; /* avoid warning */ | |
949 for(j=0;j<n1;j++) { | |
950 n = s->exponent_high_bands[s->frame_len_bits - | |
951 s->block_len_bits][j]; | |
952 if (s->high_band_coded[ch][j]) { | |
953 float e2, v; | |
954 e2 = 0; | |
955 for(i = 0;i < n; i++) { | |
956 v = exp_ptr[i]; | |
957 e2 += v * v; | |
958 } | |
959 exp_power[j] = e2 / n; | |
960 last_high_band = j; | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
961 tprintf("%d: power=%f (%d)\n", j, exp_power[j], n); |
783 | 962 } |
963 exp_ptr += n; | |
964 } | |
965 | |
966 /* main freqs and high freqs */ | |
967 for(j=-1;j<n1;j++) { | |
968 if (j < 0) { | |
969 n = s->high_band_start[bsize] - | |
970 s->coefs_start; | |
971 } else { | |
972 n = s->exponent_high_bands[s->frame_len_bits - | |
973 s->block_len_bits][j]; | |
974 } | |
975 if (j >= 0 && s->high_band_coded[ch][j]) { | |
976 /* use noise with specified power */ | |
977 mult1 = sqrt(exp_power[j] / exp_power[last_high_band]); | |
978 /* XXX: use a table */ | |
979 mult1 = mult1 * pow(10, s->high_band_values[ch][j] * 0.05); | |
980 mult1 = mult1 / (s->max_exponent[ch] * s->noise_mult); | |
981 mult1 *= mdct_norm; | |
982 for(i = 0;i < n; i++) { | |
983 noise = s->noise_table[s->noise_index]; | |
984 s->noise_index = (s->noise_index + 1) & (NOISE_TAB_SIZE - 1); | |
985 *coefs++ = (*exponents++) * noise * mult1; | |
986 } | |
987 } else { | |
988 /* coded values + small noise */ | |
989 for(i = 0;i < n; i++) { | |
990 noise = s->noise_table[s->noise_index]; | |
991 s->noise_index = (s->noise_index + 1) & (NOISE_TAB_SIZE - 1); | |
992 *coefs++ = ((*coefs1++) + noise) * (*exponents++) * mult; | |
993 } | |
994 } | |
995 } | |
996 | |
997 /* very high freqs : noise */ | |
998 n = s->block_len - s->coefs_end[bsize]; | |
999 mult1 = mult * exponents[-1]; | |
1000 for(i = 0; i < n; i++) { | |
1001 *coefs++ = s->noise_table[s->noise_index] * mult1; | |
1002 s->noise_index = (s->noise_index + 1) & (NOISE_TAB_SIZE - 1); | |
1003 } | |
1004 } else { | |
1005 /* XXX: optimize more */ | |
1006 for(i = 0;i < s->coefs_start; i++) | |
1007 *coefs++ = 0.0; | |
1008 n = nb_coefs[ch]; | |
1009 for(i = 0;i < n; i++) { | |
1010 *coefs++ = coefs1[i] * exponents[i] * mult; | |
1011 } | |
1012 n = s->block_len - s->coefs_end[bsize]; | |
1013 for(i = 0;i < n; i++) | |
1014 *coefs++ = 0.0; | |
1015 } | |
1016 } | |
1017 } | |
1018 | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
1019 #ifdef TRACE |
783 | 1020 for(ch = 0; ch < s->nb_channels; ch++) { |
1021 if (s->channel_coded[ch]) { | |
1022 dump_floats("exponents", 3, s->exponents[ch], s->block_len); | |
1023 dump_floats("coefs", 1, s->coefs[ch], s->block_len); | |
1024 } | |
1025 } | |
1026 #endif | |
1027 | |
1028 if (s->ms_stereo && s->channel_coded[1]) { | |
1029 float a, b; | |
1030 int i; | |
1031 | |
1032 /* nominal case for ms stereo: we do it before mdct */ | |
1033 /* no need to optimize this case because it should almost | |
1034 never happen */ | |
1035 if (!s->channel_coded[0]) { | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
1036 tprintf("rare ms-stereo case happened\n"); |
783 | 1037 memset(s->coefs[0], 0, sizeof(float) * s->block_len); |
1038 s->channel_coded[0] = 1; | |
1039 } | |
1040 | |
1041 for(i = 0; i < s->block_len; i++) { | |
1042 a = s->coefs[0][i]; | |
1043 b = s->coefs[1][i]; | |
1044 s->coefs[0][i] = a + b; | |
1045 s->coefs[1][i] = a - b; | |
1046 } | |
1047 } | |
1048 | |
1049 /* build the window : we ensure that when the windows overlap | |
1050 their squared sum is always 1 (MDCT reconstruction rule) */ | |
1051 /* XXX: merge with output */ | |
1052 { | |
1053 int i, next_block_len, block_len, prev_block_len, n; | |
1054 float *wptr; | |
1055 | |
1056 block_len = s->block_len; | |
1057 prev_block_len = 1 << s->prev_block_len_bits; | |
1058 next_block_len = 1 << s->next_block_len_bits; | |
1059 | |
1060 /* right part */ | |
1061 wptr = window + block_len; | |
1062 if (block_len <= next_block_len) { | |
1063 for(i=0;i<block_len;i++) | |
1064 *wptr++ = s->windows[bsize][i]; | |
1065 } else { | |
1066 /* overlap */ | |
1067 n = (block_len / 2) - (next_block_len / 2); | |
1068 for(i=0;i<n;i++) | |
1069 *wptr++ = 1.0; | |
1070 for(i=0;i<next_block_len;i++) | |
1071 *wptr++ = s->windows[s->frame_len_bits - s->next_block_len_bits][i]; | |
1072 for(i=0;i<n;i++) | |
1073 *wptr++ = 0.0; | |
1074 } | |
1075 | |
1076 /* left part */ | |
1077 wptr = window + block_len; | |
1078 if (block_len <= prev_block_len) { | |
1079 for(i=0;i<block_len;i++) | |
1080 *--wptr = s->windows[bsize][i]; | |
1081 } else { | |
1082 /* overlap */ | |
1083 n = (block_len / 2) - (prev_block_len / 2); | |
1084 for(i=0;i<n;i++) | |
1085 *--wptr = 1.0; | |
1086 for(i=0;i<prev_block_len;i++) | |
1087 *--wptr = s->windows[s->frame_len_bits - s->prev_block_len_bits][i]; | |
1088 for(i=0;i<n;i++) | |
1089 *--wptr = 0.0; | |
1090 } | |
1091 } | |
1092 | |
1093 | |
1094 for(ch = 0; ch < s->nb_channels; ch++) { | |
1095 if (s->channel_coded[ch]) { | |
972 | 1096 FFTSample output[BLOCK_MAX_SIZE * 2] __attribute__((aligned(16))); |
783 | 1097 float *ptr; |
1098 int i, n4, index, n; | |
1099 | |
1100 n = s->block_len; | |
1101 n4 = s->block_len / 2; | |
795
55add0e7eafb
avoid name clash - fixed again block size selection
bellard
parents:
785
diff
changeset
|
1102 ff_imdct_calc(&s->mdct_ctx[bsize], |
55add0e7eafb
avoid name clash - fixed again block size selection
bellard
parents:
785
diff
changeset
|
1103 output, s->coefs[ch], s->mdct_tmp); |
783 | 1104 |
1105 /* XXX: optimize all that by build the window and | |
1106 multipying/adding at the same time */ | |
1107 /* multiply by the window */ | |
1108 for(i=0;i<n * 2;i++) { | |
1109 output[i] *= window[i]; | |
1110 } | |
1111 | |
1112 /* add in the frame */ | |
1113 index = (s->frame_len / 2) + s->block_pos - n4; | |
1114 ptr = &s->frame_out[ch][index]; | |
1115 for(i=0;i<n * 2;i++) { | |
1116 *ptr += output[i]; | |
1117 ptr++; | |
1118 } | |
1119 | |
1120 /* specific fast case for ms-stereo : add to second | |
1121 channel if it is not coded */ | |
1122 if (s->ms_stereo && !s->channel_coded[1]) { | |
1123 ptr = &s->frame_out[1][index]; | |
1124 for(i=0;i<n * 2;i++) { | |
1125 *ptr += output[i]; | |
1126 ptr++; | |
1127 } | |
1128 } | |
1129 } | |
1130 } | |
1131 next: | |
1132 /* update block number */ | |
1133 s->block_num++; | |
1134 s->block_pos += s->block_len; | |
1135 if (s->block_pos >= s->frame_len) | |
1136 return 1; | |
1137 else | |
1138 return 0; | |
1139 } | |
1140 | |
1141 /* decode a frame of frame_len samples */ | |
1142 static int wma_decode_frame(WMADecodeContext *s, int16_t *samples) | |
1143 { | |
1144 int ret, i, n, a, ch, incr; | |
1145 int16_t *ptr; | |
1146 float *iptr; | |
1147 | |
1343 | 1148 #ifdef TRACE |
1149 tprintf("***decode_frame: %d size=%d\n", s->frame_count++, s->frame_len); | |
1150 #endif | |
783 | 1151 |
1152 /* read each block */ | |
1153 s->block_num = 0; | |
1154 s->block_pos = 0; | |
1155 for(;;) { | |
1156 ret = wma_decode_block(s); | |
1157 if (ret < 0) | |
1158 return -1; | |
1159 if (ret) | |
1160 break; | |
1161 } | |
1162 | |
1163 /* convert frame to integer */ | |
1164 n = s->frame_len; | |
1165 incr = s->nb_channels; | |
1166 for(ch = 0; ch < s->nb_channels; ch++) { | |
1167 ptr = samples + ch; | |
1168 iptr = s->frame_out[ch]; | |
1169 | |
1170 for(i=0;i<n;i++) { | |
797 | 1171 a = lrintf(*iptr++); |
783 | 1172 if (a > 32767) |
1173 a = 32767; | |
1174 else if (a < -32768) | |
1175 a = -32768; | |
1176 *ptr = a; | |
1177 ptr += incr; | |
1178 } | |
1179 /* prepare for next block */ | |
1180 memmove(&s->frame_out[ch][0], &s->frame_out[ch][s->frame_len], | |
1181 s->frame_len * sizeof(float)); | |
1182 /* XXX: suppress this */ | |
1183 memset(&s->frame_out[ch][s->frame_len], 0, | |
1184 s->frame_len * sizeof(float)); | |
1185 } | |
1186 | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
1187 #ifdef TRACE |
783 | 1188 dump_shorts("samples", samples, n * s->nb_channels); |
1189 #endif | |
1190 return 0; | |
1191 } | |
1192 | |
1193 static int wma_decode_superframe(AVCodecContext *avctx, | |
1194 void *data, int *data_size, | |
1064 | 1195 uint8_t *buf, int buf_size) |
783 | 1196 { |
1197 WMADecodeContext *s = avctx->priv_data; | |
1198 int nb_frames, bit_offset, i, pos, len; | |
1199 uint8_t *q; | |
1200 int16_t *samples; | |
1201 | |
1342
f574934c4219
uniformization (now it uses the same trace functions as h264, defined in common.h)
al3x
parents:
1303
diff
changeset
|
1202 tprintf("***decode_superframe:\n"); |
783 | 1203 |
1750 | 1204 if(buf_size==0){ |
1205 s->last_superframe_len = 0; | |
1206 return 0; | |
1207 } | |
1208 | |
783 | 1209 samples = data; |
1210 | |
1025
1f9afd8b9131
GetBitContext.size is allways multiplied by 8 -> use size_in_bits to avoid useless *8 in a few inner loops
michaelni
parents:
972
diff
changeset
|
1211 init_get_bits(&s->gb, buf, buf_size*8); |
783 | 1212 |
1213 if (s->use_bit_reservoir) { | |
1214 /* read super frame header */ | |
1215 get_bits(&s->gb, 4); /* super frame index */ | |
1216 nb_frames = get_bits(&s->gb, 4) - 1; | |
1217 | |
1218 bit_offset = get_bits(&s->gb, s->byte_offset_bits + 3); | |
1219 | |
1220 if (s->last_superframe_len > 0) { | |
1221 // printf("skip=%d\n", s->last_bitoffset); | |
1222 /* add bit_offset bits to last frame */ | |
1223 if ((s->last_superframe_len + ((bit_offset + 7) >> 3)) > | |
1224 MAX_CODED_SUPERFRAME_SIZE) | |
964
6e6773512288
oops : better error resilience - should fix most wma decoding problems
bellard
parents:
819
diff
changeset
|
1225 goto fail; |
783 | 1226 q = s->last_superframe + s->last_superframe_len; |
1227 len = bit_offset; | |
1228 while (len > 0) { | |
1229 *q++ = (get_bits)(&s->gb, 8); | |
1230 len -= 8; | |
1231 } | |
1232 if (len > 0) { | |
1233 *q++ = (get_bits)(&s->gb, len) << (8 - len); | |
1234 } | |
1235 | |
1236 /* XXX: bit_offset bits into last frame */ | |
1025
1f9afd8b9131
GetBitContext.size is allways multiplied by 8 -> use size_in_bits to avoid useless *8 in a few inner loops
michaelni
parents:
972
diff
changeset
|
1237 init_get_bits(&s->gb, s->last_superframe, MAX_CODED_SUPERFRAME_SIZE*8); |
783 | 1238 /* skip unused bits */ |
1239 if (s->last_bitoffset > 0) | |
1240 skip_bits(&s->gb, s->last_bitoffset); | |
1241 /* this frame is stored in the last superframe and in the | |
1242 current one */ | |
1243 if (wma_decode_frame(s, samples) < 0) | |
964
6e6773512288
oops : better error resilience - should fix most wma decoding problems
bellard
parents:
819
diff
changeset
|
1244 goto fail; |
783 | 1245 samples += s->nb_channels * s->frame_len; |
1246 } | |
1247 | |
1248 /* read each frame starting from bit_offset */ | |
1249 pos = bit_offset + 4 + 4 + s->byte_offset_bits + 3; | |
1025
1f9afd8b9131
GetBitContext.size is allways multiplied by 8 -> use size_in_bits to avoid useless *8 in a few inner loops
michaelni
parents:
972
diff
changeset
|
1250 init_get_bits(&s->gb, buf + (pos >> 3), (MAX_CODED_SUPERFRAME_SIZE - (pos >> 3))*8); |
783 | 1251 len = pos & 7; |
1252 if (len > 0) | |
1253 skip_bits(&s->gb, len); | |
1254 | |
1255 s->reset_block_lengths = 1; | |
1256 for(i=0;i<nb_frames;i++) { | |
1257 if (wma_decode_frame(s, samples) < 0) | |
964
6e6773512288
oops : better error resilience - should fix most wma decoding problems
bellard
parents:
819
diff
changeset
|
1258 goto fail; |
783 | 1259 samples += s->nb_channels * s->frame_len; |
1260 } | |
1261 | |
1262 /* we copy the end of the frame in the last frame buffer */ | |
1263 pos = get_bits_count(&s->gb) + ((bit_offset + 4 + 4 + s->byte_offset_bits + 3) & ~7); | |
1264 s->last_bitoffset = pos & 7; | |
1265 pos >>= 3; | |
1266 len = buf_size - pos; | |
819 | 1267 if (len > MAX_CODED_SUPERFRAME_SIZE || len < 0) { |
964
6e6773512288
oops : better error resilience - should fix most wma decoding problems
bellard
parents:
819
diff
changeset
|
1268 goto fail; |
783 | 1269 } |
1270 s->last_superframe_len = len; | |
1271 memcpy(s->last_superframe, buf + pos, len); | |
1272 } else { | |
1273 /* single frame decode */ | |
1274 if (wma_decode_frame(s, samples) < 0) | |
964
6e6773512288
oops : better error resilience - should fix most wma decoding problems
bellard
parents:
819
diff
changeset
|
1275 goto fail; |
783 | 1276 samples += s->nb_channels * s->frame_len; |
1277 } | |
1278 *data_size = (int8_t *)samples - (int8_t *)data; | |
1279 return s->block_align; | |
964
6e6773512288
oops : better error resilience - should fix most wma decoding problems
bellard
parents:
819
diff
changeset
|
1280 fail: |
6e6773512288
oops : better error resilience - should fix most wma decoding problems
bellard
parents:
819
diff
changeset
|
1281 /* when error, we reset the bit reservoir */ |
6e6773512288
oops : better error resilience - should fix most wma decoding problems
bellard
parents:
819
diff
changeset
|
1282 s->last_superframe_len = 0; |
6e6773512288
oops : better error resilience - should fix most wma decoding problems
bellard
parents:
819
diff
changeset
|
1283 return -1; |
783 | 1284 } |
1285 | |
1286 static int wma_decode_end(AVCodecContext *avctx) | |
1287 { | |
1288 WMADecodeContext *s = avctx->priv_data; | |
1289 int i; | |
1290 | |
1291 for(i = 0; i < s->nb_block_sizes; i++) | |
795
55add0e7eafb
avoid name clash - fixed again block size selection
bellard
parents:
785
diff
changeset
|
1292 ff_mdct_end(&s->mdct_ctx[i]); |
783 | 1293 for(i = 0; i < s->nb_block_sizes; i++) |
1294 av_free(s->windows[i]); | |
1295 | |
1296 if (s->use_exp_vlc) { | |
1297 free_vlc(&s->exp_vlc); | |
1298 } | |
1299 if (s->use_noise_coding) { | |
1300 free_vlc(&s->hgain_vlc); | |
1301 } | |
1302 for(i = 0;i < 2; i++) { | |
1303 free_vlc(&s->coef_vlc[i]); | |
1304 av_free(s->run_table[i]); | |
1305 av_free(s->level_table[i]); | |
1306 } | |
1307 | |
1308 return 0; | |
1309 } | |
1310 | |
1311 AVCodec wmav1_decoder = | |
1312 { | |
1313 "wmav1", | |
1314 CODEC_TYPE_AUDIO, | |
1315 CODEC_ID_WMAV1, | |
1316 sizeof(WMADecodeContext), | |
1317 wma_decode_init, | |
1318 NULL, | |
1319 wma_decode_end, | |
1320 wma_decode_superframe, | |
1321 }; | |
1322 | |
1323 AVCodec wmav2_decoder = | |
1324 { | |
1325 "wmav2", | |
1326 CODEC_TYPE_AUDIO, | |
1327 CODEC_ID_WMAV2, | |
1328 sizeof(WMADecodeContext), | |
1329 wma_decode_init, | |
1330 NULL, | |
1331 wma_decode_end, | |
1332 wma_decode_superframe, | |
1333 }; |