cannam@85
|
1 /*
|
cannam@85
|
2 * libmad - MPEG audio decoder library
|
cannam@85
|
3 * Copyright (C) 2000-2004 Underbit Technologies, Inc.
|
cannam@85
|
4 *
|
cannam@85
|
5 * This program is free software; you can redistribute it and/or modify
|
cannam@85
|
6 * it under the terms of the GNU General Public License as published by
|
cannam@85
|
7 * the Free Software Foundation; either version 2 of the License, or
|
cannam@85
|
8 * (at your option) any later version.
|
cannam@85
|
9 *
|
cannam@85
|
10 * This program is distributed in the hope that it will be useful,
|
cannam@85
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
cannam@85
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
cannam@85
|
13 * GNU General Public License for more details.
|
cannam@85
|
14 *
|
cannam@85
|
15 * You should have received a copy of the GNU General Public License
|
cannam@85
|
16 * along with this program; if not, write to the Free Software
|
cannam@85
|
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
cannam@85
|
18 *
|
cannam@85
|
19 * $Id: layer12.c,v 1.17 2004/02/05 09:02:39 rob Exp $
|
cannam@85
|
20 */
|
cannam@85
|
21
|
cannam@85
|
22 # ifdef HAVE_CONFIG_H
|
cannam@85
|
23 # include "config.h"
|
cannam@85
|
24 # endif
|
cannam@85
|
25
|
cannam@85
|
26 # include "global.h"
|
cannam@85
|
27
|
cannam@85
|
28 # ifdef HAVE_LIMITS_H
|
cannam@85
|
29 # include <limits.h>
|
cannam@85
|
30 # else
|
cannam@85
|
31 # define CHAR_BIT 8
|
cannam@85
|
32 # endif
|
cannam@85
|
33
|
cannam@85
|
34 # include "fixed.h"
|
cannam@85
|
35 # include "bit.h"
|
cannam@85
|
36 # include "stream.h"
|
cannam@85
|
37 # include "frame.h"
|
cannam@85
|
38 # include "layer12.h"
|
cannam@85
|
39
|
cannam@85
|
40 /*
|
cannam@85
|
41 * scalefactor table
|
cannam@85
|
42 * used in both Layer I and Layer II decoding
|
cannam@85
|
43 */
|
cannam@85
|
44 static
|
cannam@85
|
45 mad_fixed_t const sf_table[64] = {
|
cannam@85
|
46 # include "sf_table.dat"
|
cannam@85
|
47 };
|
cannam@85
|
48
|
cannam@85
|
49 /* --- Layer I ------------------------------------------------------------- */
|
cannam@85
|
50
|
cannam@85
|
51 /* linear scaling table */
|
cannam@85
|
52 static
|
cannam@85
|
53 mad_fixed_t const linear_table[14] = {
|
cannam@85
|
54 MAD_F(0x15555555), /* 2^2 / (2^2 - 1) == 1.33333333333333 */
|
cannam@85
|
55 MAD_F(0x12492492), /* 2^3 / (2^3 - 1) == 1.14285714285714 */
|
cannam@85
|
56 MAD_F(0x11111111), /* 2^4 / (2^4 - 1) == 1.06666666666667 */
|
cannam@85
|
57 MAD_F(0x10842108), /* 2^5 / (2^5 - 1) == 1.03225806451613 */
|
cannam@85
|
58 MAD_F(0x10410410), /* 2^6 / (2^6 - 1) == 1.01587301587302 */
|
cannam@85
|
59 MAD_F(0x10204081), /* 2^7 / (2^7 - 1) == 1.00787401574803 */
|
cannam@85
|
60 MAD_F(0x10101010), /* 2^8 / (2^8 - 1) == 1.00392156862745 */
|
cannam@85
|
61 MAD_F(0x10080402), /* 2^9 / (2^9 - 1) == 1.00195694716243 */
|
cannam@85
|
62 MAD_F(0x10040100), /* 2^10 / (2^10 - 1) == 1.00097751710655 */
|
cannam@85
|
63 MAD_F(0x10020040), /* 2^11 / (2^11 - 1) == 1.00048851978505 */
|
cannam@85
|
64 MAD_F(0x10010010), /* 2^12 / (2^12 - 1) == 1.00024420024420 */
|
cannam@85
|
65 MAD_F(0x10008004), /* 2^13 / (2^13 - 1) == 1.00012208521548 */
|
cannam@85
|
66 MAD_F(0x10004001), /* 2^14 / (2^14 - 1) == 1.00006103888177 */
|
cannam@85
|
67 MAD_F(0x10002000) /* 2^15 / (2^15 - 1) == 1.00003051850948 */
|
cannam@85
|
68 };
|
cannam@85
|
69
|
cannam@85
|
70 /*
|
cannam@85
|
71 * NAME: I_sample()
|
cannam@85
|
72 * DESCRIPTION: decode one requantized Layer I sample from a bitstream
|
cannam@85
|
73 */
|
cannam@85
|
74 static
|
cannam@85
|
75 mad_fixed_t I_sample(struct mad_bitptr *ptr, unsigned int nb)
|
cannam@85
|
76 {
|
cannam@85
|
77 mad_fixed_t sample;
|
cannam@85
|
78
|
cannam@85
|
79 sample = mad_bit_read(ptr, nb);
|
cannam@85
|
80
|
cannam@85
|
81 /* invert most significant bit, extend sign, then scale to fixed format */
|
cannam@85
|
82
|
cannam@85
|
83 sample ^= 1 << (nb - 1);
|
cannam@85
|
84 sample |= -(sample & (1 << (nb - 1)));
|
cannam@85
|
85
|
cannam@85
|
86 sample <<= MAD_F_FRACBITS - (nb - 1);
|
cannam@85
|
87
|
cannam@85
|
88 /* requantize the sample */
|
cannam@85
|
89
|
cannam@85
|
90 /* s'' = (2^nb / (2^nb - 1)) * (s''' + 2^(-nb + 1)) */
|
cannam@85
|
91
|
cannam@85
|
92 sample += MAD_F_ONE >> (nb - 1);
|
cannam@85
|
93
|
cannam@85
|
94 return mad_f_mul(sample, linear_table[nb - 2]);
|
cannam@85
|
95
|
cannam@85
|
96 /* s' = factor * s'' */
|
cannam@85
|
97 /* (to be performed by caller) */
|
cannam@85
|
98 }
|
cannam@85
|
99
|
cannam@85
|
100 /*
|
cannam@85
|
101 * NAME: layer->I()
|
cannam@85
|
102 * DESCRIPTION: decode a single Layer I frame
|
cannam@85
|
103 */
|
cannam@85
|
104 int mad_layer_I(struct mad_stream *stream, struct mad_frame *frame)
|
cannam@85
|
105 {
|
cannam@85
|
106 struct mad_header *header = &frame->header;
|
cannam@85
|
107 unsigned int nch, bound, ch, s, sb, nb;
|
cannam@85
|
108 unsigned char allocation[2][32], scalefactor[2][32];
|
cannam@85
|
109
|
cannam@85
|
110 nch = MAD_NCHANNELS(header);
|
cannam@85
|
111
|
cannam@85
|
112 bound = 32;
|
cannam@85
|
113 if (header->mode == MAD_MODE_JOINT_STEREO) {
|
cannam@85
|
114 header->flags |= MAD_FLAG_I_STEREO;
|
cannam@85
|
115 bound = 4 + header->mode_extension * 4;
|
cannam@85
|
116 }
|
cannam@85
|
117
|
cannam@85
|
118 /* check CRC word */
|
cannam@85
|
119
|
cannam@85
|
120 if (header->flags & MAD_FLAG_PROTECTION) {
|
cannam@85
|
121 header->crc_check =
|
cannam@85
|
122 mad_bit_crc(stream->ptr, 4 * (bound * nch + (32 - bound)),
|
cannam@85
|
123 header->crc_check);
|
cannam@85
|
124
|
cannam@85
|
125 if (header->crc_check != header->crc_target &&
|
cannam@85
|
126 !(frame->options & MAD_OPTION_IGNORECRC)) {
|
cannam@85
|
127 stream->error = MAD_ERROR_BADCRC;
|
cannam@85
|
128 return -1;
|
cannam@85
|
129 }
|
cannam@85
|
130 }
|
cannam@85
|
131
|
cannam@85
|
132 /* decode bit allocations */
|
cannam@85
|
133
|
cannam@85
|
134 for (sb = 0; sb < bound; ++sb) {
|
cannam@85
|
135 for (ch = 0; ch < nch; ++ch) {
|
cannam@85
|
136 nb = mad_bit_read(&stream->ptr, 4);
|
cannam@85
|
137
|
cannam@85
|
138 if (nb == 15) {
|
cannam@85
|
139 stream->error = MAD_ERROR_BADBITALLOC;
|
cannam@85
|
140 return -1;
|
cannam@85
|
141 }
|
cannam@85
|
142
|
cannam@85
|
143 allocation[ch][sb] = nb ? nb + 1 : 0;
|
cannam@85
|
144 }
|
cannam@85
|
145 }
|
cannam@85
|
146
|
cannam@85
|
147 for (sb = bound; sb < 32; ++sb) {
|
cannam@85
|
148 nb = mad_bit_read(&stream->ptr, 4);
|
cannam@85
|
149
|
cannam@85
|
150 if (nb == 15) {
|
cannam@85
|
151 stream->error = MAD_ERROR_BADBITALLOC;
|
cannam@85
|
152 return -1;
|
cannam@85
|
153 }
|
cannam@85
|
154
|
cannam@85
|
155 allocation[0][sb] =
|
cannam@85
|
156 allocation[1][sb] = nb ? nb + 1 : 0;
|
cannam@85
|
157 }
|
cannam@85
|
158
|
cannam@85
|
159 /* decode scalefactors */
|
cannam@85
|
160
|
cannam@85
|
161 for (sb = 0; sb < 32; ++sb) {
|
cannam@85
|
162 for (ch = 0; ch < nch; ++ch) {
|
cannam@85
|
163 if (allocation[ch][sb]) {
|
cannam@85
|
164 scalefactor[ch][sb] = mad_bit_read(&stream->ptr, 6);
|
cannam@85
|
165
|
cannam@85
|
166 # if defined(OPT_STRICT)
|
cannam@85
|
167 /*
|
cannam@85
|
168 * Scalefactor index 63 does not appear in Table B.1 of
|
cannam@85
|
169 * ISO/IEC 11172-3. Nonetheless, other implementations accept it,
|
cannam@85
|
170 * so we only reject it if OPT_STRICT is defined.
|
cannam@85
|
171 */
|
cannam@85
|
172 if (scalefactor[ch][sb] == 63) {
|
cannam@85
|
173 stream->error = MAD_ERROR_BADSCALEFACTOR;
|
cannam@85
|
174 return -1;
|
cannam@85
|
175 }
|
cannam@85
|
176 # endif
|
cannam@85
|
177 }
|
cannam@85
|
178 }
|
cannam@85
|
179 }
|
cannam@85
|
180
|
cannam@85
|
181 /* decode samples */
|
cannam@85
|
182
|
cannam@85
|
183 for (s = 0; s < 12; ++s) {
|
cannam@85
|
184 for (sb = 0; sb < bound; ++sb) {
|
cannam@85
|
185 for (ch = 0; ch < nch; ++ch) {
|
cannam@85
|
186 nb = allocation[ch][sb];
|
cannam@85
|
187 frame->sbsample[ch][s][sb] = nb ?
|
cannam@85
|
188 mad_f_mul(I_sample(&stream->ptr, nb),
|
cannam@85
|
189 sf_table[scalefactor[ch][sb]]) : 0;
|
cannam@85
|
190 }
|
cannam@85
|
191 }
|
cannam@85
|
192
|
cannam@85
|
193 for (sb = bound; sb < 32; ++sb) {
|
cannam@85
|
194 if ((nb = allocation[0][sb])) {
|
cannam@85
|
195 mad_fixed_t sample;
|
cannam@85
|
196
|
cannam@85
|
197 sample = I_sample(&stream->ptr, nb);
|
cannam@85
|
198
|
cannam@85
|
199 for (ch = 0; ch < nch; ++ch) {
|
cannam@85
|
200 frame->sbsample[ch][s][sb] =
|
cannam@85
|
201 mad_f_mul(sample, sf_table[scalefactor[ch][sb]]);
|
cannam@85
|
202 }
|
cannam@85
|
203 }
|
cannam@85
|
204 else {
|
cannam@85
|
205 for (ch = 0; ch < nch; ++ch)
|
cannam@85
|
206 frame->sbsample[ch][s][sb] = 0;
|
cannam@85
|
207 }
|
cannam@85
|
208 }
|
cannam@85
|
209 }
|
cannam@85
|
210
|
cannam@85
|
211 return 0;
|
cannam@85
|
212 }
|
cannam@85
|
213
|
cannam@85
|
214 /* --- Layer II ------------------------------------------------------------ */
|
cannam@85
|
215
|
cannam@85
|
216 /* possible quantization per subband table */
|
cannam@85
|
217 static
|
cannam@85
|
218 struct {
|
cannam@85
|
219 unsigned int sblimit;
|
cannam@85
|
220 unsigned char const offsets[30];
|
cannam@85
|
221 } const sbquant_table[5] = {
|
cannam@85
|
222 /* ISO/IEC 11172-3 Table B.2a */
|
cannam@85
|
223 { 27, { 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, /* 0 */
|
cannam@85
|
224 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0 } },
|
cannam@85
|
225 /* ISO/IEC 11172-3 Table B.2b */
|
cannam@85
|
226 { 30, { 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, /* 1 */
|
cannam@85
|
227 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0 } },
|
cannam@85
|
228 /* ISO/IEC 11172-3 Table B.2c */
|
cannam@85
|
229 { 8, { 5, 5, 2, 2, 2, 2, 2, 2 } }, /* 2 */
|
cannam@85
|
230 /* ISO/IEC 11172-3 Table B.2d */
|
cannam@85
|
231 { 12, { 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 } }, /* 3 */
|
cannam@85
|
232 /* ISO/IEC 13818-3 Table B.1 */
|
cannam@85
|
233 { 30, { 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, /* 4 */
|
cannam@85
|
234 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 } }
|
cannam@85
|
235 };
|
cannam@85
|
236
|
cannam@85
|
237 /* bit allocation table */
|
cannam@85
|
238 static
|
cannam@85
|
239 struct {
|
cannam@85
|
240 unsigned short nbal;
|
cannam@85
|
241 unsigned short offset;
|
cannam@85
|
242 } const bitalloc_table[8] = {
|
cannam@85
|
243 { 2, 0 }, /* 0 */
|
cannam@85
|
244 { 2, 3 }, /* 1 */
|
cannam@85
|
245 { 3, 3 }, /* 2 */
|
cannam@85
|
246 { 3, 1 }, /* 3 */
|
cannam@85
|
247 { 4, 2 }, /* 4 */
|
cannam@85
|
248 { 4, 3 }, /* 5 */
|
cannam@85
|
249 { 4, 4 }, /* 6 */
|
cannam@85
|
250 { 4, 5 } /* 7 */
|
cannam@85
|
251 };
|
cannam@85
|
252
|
cannam@85
|
253 /* offsets into quantization class table */
|
cannam@85
|
254 static
|
cannam@85
|
255 unsigned char const offset_table[6][15] = {
|
cannam@85
|
256 { 0, 1, 16 }, /* 0 */
|
cannam@85
|
257 { 0, 1, 2, 3, 4, 5, 16 }, /* 1 */
|
cannam@85
|
258 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 }, /* 2 */
|
cannam@85
|
259 { 0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 }, /* 3 */
|
cannam@85
|
260 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16 }, /* 4 */
|
cannam@85
|
261 { 0, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 } /* 5 */
|
cannam@85
|
262 };
|
cannam@85
|
263
|
cannam@85
|
264 /* quantization class table */
|
cannam@85
|
265 static
|
cannam@85
|
266 struct quantclass {
|
cannam@85
|
267 unsigned short nlevels;
|
cannam@85
|
268 unsigned char group;
|
cannam@85
|
269 unsigned char bits;
|
cannam@85
|
270 mad_fixed_t C;
|
cannam@85
|
271 mad_fixed_t D;
|
cannam@85
|
272 } const qc_table[17] = {
|
cannam@85
|
273 # include "qc_table.dat"
|
cannam@85
|
274 };
|
cannam@85
|
275
|
cannam@85
|
276 /*
|
cannam@85
|
277 * NAME: II_samples()
|
cannam@85
|
278 * DESCRIPTION: decode three requantized Layer II samples from a bitstream
|
cannam@85
|
279 */
|
cannam@85
|
280 static
|
cannam@85
|
281 void II_samples(struct mad_bitptr *ptr,
|
cannam@85
|
282 struct quantclass const *quantclass,
|
cannam@85
|
283 mad_fixed_t output[3])
|
cannam@85
|
284 {
|
cannam@85
|
285 unsigned int nb, s, sample[3];
|
cannam@85
|
286
|
cannam@85
|
287 if ((nb = quantclass->group)) {
|
cannam@85
|
288 unsigned int c, nlevels;
|
cannam@85
|
289
|
cannam@85
|
290 /* degrouping */
|
cannam@85
|
291 c = mad_bit_read(ptr, quantclass->bits);
|
cannam@85
|
292 nlevels = quantclass->nlevels;
|
cannam@85
|
293
|
cannam@85
|
294 for (s = 0; s < 3; ++s) {
|
cannam@85
|
295 sample[s] = c % nlevels;
|
cannam@85
|
296 c /= nlevels;
|
cannam@85
|
297 }
|
cannam@85
|
298 }
|
cannam@85
|
299 else {
|
cannam@85
|
300 nb = quantclass->bits;
|
cannam@85
|
301
|
cannam@85
|
302 for (s = 0; s < 3; ++s)
|
cannam@85
|
303 sample[s] = mad_bit_read(ptr, nb);
|
cannam@85
|
304 }
|
cannam@85
|
305
|
cannam@85
|
306 for (s = 0; s < 3; ++s) {
|
cannam@85
|
307 mad_fixed_t requantized;
|
cannam@85
|
308
|
cannam@85
|
309 /* invert most significant bit, extend sign, then scale to fixed format */
|
cannam@85
|
310
|
cannam@85
|
311 requantized = sample[s] ^ (1 << (nb - 1));
|
cannam@85
|
312 requantized |= -(requantized & (1 << (nb - 1)));
|
cannam@85
|
313
|
cannam@85
|
314 requantized <<= MAD_F_FRACBITS - (nb - 1);
|
cannam@85
|
315
|
cannam@85
|
316 /* requantize the sample */
|
cannam@85
|
317
|
cannam@85
|
318 /* s'' = C * (s''' + D) */
|
cannam@85
|
319
|
cannam@85
|
320 output[s] = mad_f_mul(requantized + quantclass->D, quantclass->C);
|
cannam@85
|
321
|
cannam@85
|
322 /* s' = factor * s'' */
|
cannam@85
|
323 /* (to be performed by caller) */
|
cannam@85
|
324 }
|
cannam@85
|
325 }
|
cannam@85
|
326
|
cannam@85
|
327 /*
|
cannam@85
|
328 * NAME: layer->II()
|
cannam@85
|
329 * DESCRIPTION: decode a single Layer II frame
|
cannam@85
|
330 */
|
cannam@85
|
331 int mad_layer_II(struct mad_stream *stream, struct mad_frame *frame)
|
cannam@85
|
332 {
|
cannam@85
|
333 struct mad_header *header = &frame->header;
|
cannam@85
|
334 struct mad_bitptr start;
|
cannam@85
|
335 unsigned int index, sblimit, nbal, nch, bound, gr, ch, s, sb;
|
cannam@85
|
336 unsigned char const *offsets;
|
cannam@85
|
337 unsigned char allocation[2][32], scfsi[2][32], scalefactor[2][32][3];
|
cannam@85
|
338 mad_fixed_t samples[3];
|
cannam@85
|
339
|
cannam@85
|
340 nch = MAD_NCHANNELS(header);
|
cannam@85
|
341
|
cannam@85
|
342 if (header->flags & MAD_FLAG_LSF_EXT)
|
cannam@85
|
343 index = 4;
|
cannam@85
|
344 else if (header->flags & MAD_FLAG_FREEFORMAT)
|
cannam@85
|
345 goto freeformat;
|
cannam@85
|
346 else {
|
cannam@85
|
347 unsigned long bitrate_per_channel;
|
cannam@85
|
348
|
cannam@85
|
349 bitrate_per_channel = header->bitrate;
|
cannam@85
|
350 if (nch == 2) {
|
cannam@85
|
351 bitrate_per_channel /= 2;
|
cannam@85
|
352
|
cannam@85
|
353 # if defined(OPT_STRICT)
|
cannam@85
|
354 /*
|
cannam@85
|
355 * ISO/IEC 11172-3 allows only single channel mode for 32, 48, 56, and
|
cannam@85
|
356 * 80 kbps bitrates in Layer II, but some encoders ignore this
|
cannam@85
|
357 * restriction. We enforce it if OPT_STRICT is defined.
|
cannam@85
|
358 */
|
cannam@85
|
359 if (bitrate_per_channel <= 28000 || bitrate_per_channel == 40000) {
|
cannam@85
|
360 stream->error = MAD_ERROR_BADMODE;
|
cannam@85
|
361 return -1;
|
cannam@85
|
362 }
|
cannam@85
|
363 # endif
|
cannam@85
|
364 }
|
cannam@85
|
365 else { /* nch == 1 */
|
cannam@85
|
366 if (bitrate_per_channel > 192000) {
|
cannam@85
|
367 /*
|
cannam@85
|
368 * ISO/IEC 11172-3 does not allow single channel mode for 224, 256,
|
cannam@85
|
369 * 320, or 384 kbps bitrates in Layer II.
|
cannam@85
|
370 */
|
cannam@85
|
371 stream->error = MAD_ERROR_BADMODE;
|
cannam@85
|
372 return -1;
|
cannam@85
|
373 }
|
cannam@85
|
374 }
|
cannam@85
|
375
|
cannam@85
|
376 if (bitrate_per_channel <= 48000)
|
cannam@85
|
377 index = (header->samplerate == 32000) ? 3 : 2;
|
cannam@85
|
378 else if (bitrate_per_channel <= 80000)
|
cannam@85
|
379 index = 0;
|
cannam@85
|
380 else {
|
cannam@85
|
381 freeformat:
|
cannam@85
|
382 index = (header->samplerate == 48000) ? 0 : 1;
|
cannam@85
|
383 }
|
cannam@85
|
384 }
|
cannam@85
|
385
|
cannam@85
|
386 sblimit = sbquant_table[index].sblimit;
|
cannam@85
|
387 offsets = sbquant_table[index].offsets;
|
cannam@85
|
388
|
cannam@85
|
389 bound = 32;
|
cannam@85
|
390 if (header->mode == MAD_MODE_JOINT_STEREO) {
|
cannam@85
|
391 header->flags |= MAD_FLAG_I_STEREO;
|
cannam@85
|
392 bound = 4 + header->mode_extension * 4;
|
cannam@85
|
393 }
|
cannam@85
|
394
|
cannam@85
|
395 if (bound > sblimit)
|
cannam@85
|
396 bound = sblimit;
|
cannam@85
|
397
|
cannam@85
|
398 start = stream->ptr;
|
cannam@85
|
399
|
cannam@85
|
400 /* decode bit allocations */
|
cannam@85
|
401
|
cannam@85
|
402 for (sb = 0; sb < bound; ++sb) {
|
cannam@85
|
403 nbal = bitalloc_table[offsets[sb]].nbal;
|
cannam@85
|
404
|
cannam@85
|
405 for (ch = 0; ch < nch; ++ch)
|
cannam@85
|
406 allocation[ch][sb] = mad_bit_read(&stream->ptr, nbal);
|
cannam@85
|
407 }
|
cannam@85
|
408
|
cannam@85
|
409 for (sb = bound; sb < sblimit; ++sb) {
|
cannam@85
|
410 nbal = bitalloc_table[offsets[sb]].nbal;
|
cannam@85
|
411
|
cannam@85
|
412 allocation[0][sb] =
|
cannam@85
|
413 allocation[1][sb] = mad_bit_read(&stream->ptr, nbal);
|
cannam@85
|
414 }
|
cannam@85
|
415
|
cannam@85
|
416 /* decode scalefactor selection info */
|
cannam@85
|
417
|
cannam@85
|
418 for (sb = 0; sb < sblimit; ++sb) {
|
cannam@85
|
419 for (ch = 0; ch < nch; ++ch) {
|
cannam@85
|
420 if (allocation[ch][sb])
|
cannam@85
|
421 scfsi[ch][sb] = mad_bit_read(&stream->ptr, 2);
|
cannam@85
|
422 }
|
cannam@85
|
423 }
|
cannam@85
|
424
|
cannam@85
|
425 /* check CRC word */
|
cannam@85
|
426
|
cannam@85
|
427 if (header->flags & MAD_FLAG_PROTECTION) {
|
cannam@85
|
428 header->crc_check =
|
cannam@85
|
429 mad_bit_crc(start, mad_bit_length(&start, &stream->ptr),
|
cannam@85
|
430 header->crc_check);
|
cannam@85
|
431
|
cannam@85
|
432 if (header->crc_check != header->crc_target &&
|
cannam@85
|
433 !(frame->options & MAD_OPTION_IGNORECRC)) {
|
cannam@85
|
434 stream->error = MAD_ERROR_BADCRC;
|
cannam@85
|
435 return -1;
|
cannam@85
|
436 }
|
cannam@85
|
437 }
|
cannam@85
|
438
|
cannam@85
|
439 /* decode scalefactors */
|
cannam@85
|
440
|
cannam@85
|
441 for (sb = 0; sb < sblimit; ++sb) {
|
cannam@85
|
442 for (ch = 0; ch < nch; ++ch) {
|
cannam@85
|
443 if (allocation[ch][sb]) {
|
cannam@85
|
444 scalefactor[ch][sb][0] = mad_bit_read(&stream->ptr, 6);
|
cannam@85
|
445
|
cannam@85
|
446 switch (scfsi[ch][sb]) {
|
cannam@85
|
447 case 2:
|
cannam@85
|
448 scalefactor[ch][sb][2] =
|
cannam@85
|
449 scalefactor[ch][sb][1] =
|
cannam@85
|
450 scalefactor[ch][sb][0];
|
cannam@85
|
451 break;
|
cannam@85
|
452
|
cannam@85
|
453 case 0:
|
cannam@85
|
454 scalefactor[ch][sb][1] = mad_bit_read(&stream->ptr, 6);
|
cannam@85
|
455 /* fall through */
|
cannam@85
|
456
|
cannam@85
|
457 case 1:
|
cannam@85
|
458 case 3:
|
cannam@85
|
459 scalefactor[ch][sb][2] = mad_bit_read(&stream->ptr, 6);
|
cannam@85
|
460 }
|
cannam@85
|
461
|
cannam@85
|
462 if (scfsi[ch][sb] & 1)
|
cannam@85
|
463 scalefactor[ch][sb][1] = scalefactor[ch][sb][scfsi[ch][sb] - 1];
|
cannam@85
|
464
|
cannam@85
|
465 # if defined(OPT_STRICT)
|
cannam@85
|
466 /*
|
cannam@85
|
467 * Scalefactor index 63 does not appear in Table B.1 of
|
cannam@85
|
468 * ISO/IEC 11172-3. Nonetheless, other implementations accept it,
|
cannam@85
|
469 * so we only reject it if OPT_STRICT is defined.
|
cannam@85
|
470 */
|
cannam@85
|
471 if (scalefactor[ch][sb][0] == 63 ||
|
cannam@85
|
472 scalefactor[ch][sb][1] == 63 ||
|
cannam@85
|
473 scalefactor[ch][sb][2] == 63) {
|
cannam@85
|
474 stream->error = MAD_ERROR_BADSCALEFACTOR;
|
cannam@85
|
475 return -1;
|
cannam@85
|
476 }
|
cannam@85
|
477 # endif
|
cannam@85
|
478 }
|
cannam@85
|
479 }
|
cannam@85
|
480 }
|
cannam@85
|
481
|
cannam@85
|
482 /* decode samples */
|
cannam@85
|
483
|
cannam@85
|
484 for (gr = 0; gr < 12; ++gr) {
|
cannam@85
|
485 for (sb = 0; sb < bound; ++sb) {
|
cannam@85
|
486 for (ch = 0; ch < nch; ++ch) {
|
cannam@85
|
487 if ((index = allocation[ch][sb])) {
|
cannam@85
|
488 index = offset_table[bitalloc_table[offsets[sb]].offset][index - 1];
|
cannam@85
|
489
|
cannam@85
|
490 II_samples(&stream->ptr, &qc_table[index], samples);
|
cannam@85
|
491
|
cannam@85
|
492 for (s = 0; s < 3; ++s) {
|
cannam@85
|
493 frame->sbsample[ch][3 * gr + s][sb] =
|
cannam@85
|
494 mad_f_mul(samples[s], sf_table[scalefactor[ch][sb][gr / 4]]);
|
cannam@85
|
495 }
|
cannam@85
|
496 }
|
cannam@85
|
497 else {
|
cannam@85
|
498 for (s = 0; s < 3; ++s)
|
cannam@85
|
499 frame->sbsample[ch][3 * gr + s][sb] = 0;
|
cannam@85
|
500 }
|
cannam@85
|
501 }
|
cannam@85
|
502 }
|
cannam@85
|
503
|
cannam@85
|
504 for (sb = bound; sb < sblimit; ++sb) {
|
cannam@85
|
505 if ((index = allocation[0][sb])) {
|
cannam@85
|
506 index = offset_table[bitalloc_table[offsets[sb]].offset][index - 1];
|
cannam@85
|
507
|
cannam@85
|
508 II_samples(&stream->ptr, &qc_table[index], samples);
|
cannam@85
|
509
|
cannam@85
|
510 for (ch = 0; ch < nch; ++ch) {
|
cannam@85
|
511 for (s = 0; s < 3; ++s) {
|
cannam@85
|
512 frame->sbsample[ch][3 * gr + s][sb] =
|
cannam@85
|
513 mad_f_mul(samples[s], sf_table[scalefactor[ch][sb][gr / 4]]);
|
cannam@85
|
514 }
|
cannam@85
|
515 }
|
cannam@85
|
516 }
|
cannam@85
|
517 else {
|
cannam@85
|
518 for (ch = 0; ch < nch; ++ch) {
|
cannam@85
|
519 for (s = 0; s < 3; ++s)
|
cannam@85
|
520 frame->sbsample[ch][3 * gr + s][sb] = 0;
|
cannam@85
|
521 }
|
cannam@85
|
522 }
|
cannam@85
|
523 }
|
cannam@85
|
524
|
cannam@85
|
525 for (ch = 0; ch < nch; ++ch) {
|
cannam@85
|
526 for (s = 0; s < 3; ++s) {
|
cannam@85
|
527 for (sb = sblimit; sb < 32; ++sb)
|
cannam@85
|
528 frame->sbsample[ch][3 * gr + s][sb] = 0;
|
cannam@85
|
529 }
|
cannam@85
|
530 }
|
cannam@85
|
531 }
|
cannam@85
|
532
|
cannam@85
|
533 return 0;
|
cannam@85
|
534 }
|