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