1 /*
2 * ALAC (Apple Lossless Audio Codec) decoder
3 * Copyright (c) 2005 David Hammerton
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 /**
23 * @file
24 * ALAC (Apple Lossless Audio Codec) decoder
25 * @author 2005 David Hammerton
26 * @see http://crazney.net/programs/itunes/alac.html
27 *
28 * Note: This decoder expects a 36-byte QuickTime atom to be
29 * passed through the extradata[_size] fields. This atom is tacked onto
30 * the end of an 'alac' stsd atom and has the following format:
31 *
32 * 32bit atom size
33 * 32bit tag ("alac")
34 * 32bit tag version (0)
35 * 32bit samples per frame (used when not set explicitly in the frames)
36 * 8bit compatible version (0)
37 * 8bit sample size
38 * 8bit history mult (40)
39 * 8bit initial history (10)
40 * 8bit rice param limit (14)
41 * 8bit channels
42 * 16bit maxRun (255)
43 * 32bit max coded frame size (0 means unknown)
44 * 32bit average bitrate (0 means unknown)
45 * 32bit samplerate
46 */
47
48 #include <inttypes.h>
49
60
61 #define ALAC_EXTRADATA_SIZE 36
62
68
72
78
79 int extra_bits;
/**< number of extra bits beyond 16-bit */
80 int nb_samples;
/**< number of samples in the current frame */
81
85
87 {
89
90 if (x > 8) { /* RICE THRESHOLD */
91 /* use alternative encoding */
93 } else if (k != 1) {
95
96 /* multiply x by 2^k - 1, as part of their strange algorithm */
97 x = (x << k) - x;
98
99 if (extrabits > 1) {
100 x += extrabits - 1;
102 } else
104 }
105 return x;
106 }
107
109 int nb_samples,
int bps,
int rice_history_mult)
110 {
111 int i;
113 int sign_modifier = 0;
114
115 for (i = 0; i < nb_samples; i++) {
116 int k;
117 unsigned int x;
118
120 return -1;
121
122 /* calculate rice param and decode next value */
123 k =
av_log2((history >> 9) + 3);
126 x += sign_modifier;
127 sign_modifier = 0;
128 output_buffer[i] = (x >> 1) ^ -(x & 1);
129
130 /* update the history */
131 if (x > 0xffff)
132 history = 0xffff;
133 else
134 history += x * rice_history_mult -
135 ((history * rice_history_mult) >> 9);
136
137 /* special case: there may be compressed blocks of 0 */
138 if ((history < 128) && (i + 1 < nb_samples)) {
139 int block_size;
140
141 /* calculate rice param and decode block size */
142 k = 7 -
av_log2(history) + ((history + 16) >> 6);
145
146 if (block_size > 0) {
147 if (block_size >= nb_samples - i) {
149 "invalid zero block size of %d %d %d\n", block_size,
150 nb_samples, i);
151 block_size = nb_samples - i - 1;
152 }
153 memset(&output_buffer[i + 1], 0,
154 block_size * sizeof(*output_buffer));
155 i += block_size;
156 }
157 if (block_size <= 0xffff)
158 sign_modifier = 1;
159 history = 0;
160 }
161 }
162 return 0;
163 }
164
166 {
168 }
169
171 int nb_samples,
int bps, int16_t *lpc_coefs,
172 int lpc_order, int lpc_quant)
173 {
174 int i;
176
177 /* first sample always copies */
178 *buffer_out = *error_buffer;
179
180 if (nb_samples <= 1)
181 return;
182
183 if (!lpc_order) {
184 memcpy(&buffer_out[1], &error_buffer[1],
185 (nb_samples - 1) * sizeof(*buffer_out));
186 return;
187 }
188
189 if (lpc_order == 31) {
190 /* simple 1st-order prediction */
191 for (i = 1; i < nb_samples; i++) {
192 buffer_out[i] =
sign_extend(buffer_out[i - 1] + error_buffer[i],
193 bps);
194 }
195 return;
196 }
197
198 /* read warm-up samples */
199 for (i = 1; i <= lpc_order && i < nb_samples; i++)
200 buffer_out[i] =
sign_extend(buffer_out[i - 1] + error_buffer[i], bps);
201
202 /* NOTE: 4 and 8 are very common cases that could be optimized. */
203
204 for (; i < nb_samples; i++) {
205 int j;
207 int error_val = error_buffer[i];
208 int error_sign;
209 int d = *pred++;
210
211 /* LPC prediction */
212 for (j = 0; j < lpc_order; j++)
213 val += (pred[j] - d) * lpc_coefs[j];
214 val = (val + (1 << (lpc_quant - 1))) >> lpc_quant;
215 val += d + error_val;
217
218 /* adapt LPC coefficients */
220 if (error_sign) {
221 for (j = 0; j < lpc_order && error_val * error_sign > 0; j++) {
222 int sign;
223 val = d - pred[j];
225 lpc_coefs[j] -= sign;
226 val *= sign;
227 error_val -= (val >> lpc_quant) * (j + 1);
228 }
229 }
230 }
231 }
232
234 int decorr_shift, int decorr_left_weight)
235 {
236 int i;
237
238 for (i = 0; i < nb_samples; i++) {
240
241 a = buffer[0][i];
242 b = buffer[1][i];
243
244 a -= (b * decorr_left_weight) >> decorr_shift;
246
249 }
250 }
251
254 {
255 int i, ch;
256
257 for (ch = 0; ch < channels; ch++)
258 for (i = 0; i < nb_samples; i++)
259 buffer[ch][i] = (buffer[ch][i] << extra_bits) | extra_bits_buffer[ch][i];
260 }
261
263 int channels)
264 {
266 int has_size,
bps, is_compressed, decorr_shift, decorr_left_weight,
ret;
267 uint32_t output_samples;
268 int i, ch;
269
270 skip_bits(&alac->
gb, 4);
/* element instance tag */
272
273 /* the number of output samples is stored in the frame */
275
281 }
282
283 /* whether the frame is compressed */
285
286 if (has_size)
288 else
292 output_samples);
294 }
297 /* get output buffer */
301 }
else if (output_samples != alac->
nb_samples) {
305 }
308 for (ch = 0; ch < channels; ch++)
310 }
311
312 if (is_compressed) {
313 int16_t lpc_coefs[2][32];
314 int lpc_order[2];
315 int prediction_type[2];
316 int lpc_quant[2];
317 int rice_history_mult[2];
318
321
322 for (ch = 0; ch < channels; ch++) {
325 rice_history_mult[ch] =
get_bits(&alac->
gb, 3);
327
330
331 /* read the predictor table */
332 for (i = lpc_order[ch] - 1; i >= 0; i--)
334 }
335
339 return -1;
340 for (ch = 0; ch < channels; ch++)
342 }
343 }
344 for (ch = 0; ch < channels; ch++) {
348 if(ret<0)
350
351 /* adaptive FIR filter */
352 if (prediction_type[ch] == 15) {
353 /* Prediction type 15 runs the adaptive FIR twice.
354 * The first pass uses the special-case coef_num = 31, while
355 * the second pass uses the coefs from the bitstream.
356 *
357 * However, this prediction type is not currently used by the
358 * reference encoder.
359 */
363 } else if (prediction_type[ch] > 0) {
365 prediction_type[ch]);
366 }
369 bps, lpc_coefs[ch], lpc_order[ch], lpc_quant[ch]);
370 }
371 } else {
372 /* not compressed, easy case */
375 return -1;
376 for (ch = 0; ch < channels; ch++) {
379 }
380 }
382 decorr_shift = 0;
383 decorr_left_weight = 0;
384 }
385
389 }
390
391 if (channels == 2 && decorr_left_weight) {
393 decorr_shift, decorr_left_weight);
394 }
395
399 }
400
403 case 16: {
404 for (ch = 0; ch < channels; ch++) {
405 int16_t *outbuffer = (int16_t *)frame->
extended_data[ch_index + ch];
408 }}
409 break;
410 case 24: {
411 for (ch = 0; ch < channels; ch++) {
414 }}
415 break;
416 }
417 }else{
419 case 16: {
420 int16_t *outbuffer = ((int16_t *)frame->
extended_data[0]) + ch_index;
422 for (ch = 0; ch < channels; ch++)
424 outbuffer += alac->
channels - channels;
425 }
426 }
427 break;
428 case 24: {
431 for (ch = 0; ch < channels; ch++)
433 outbuffer += alac->
channels - channels;
434 }
435 }
436 break;
437 case 32: {
440 for (ch = 0; ch < channels; ch++)
442 outbuffer += alac->
channels - channels;
443 }
444 }
445 break;
446 }
447 }
448
449 return 0;
450 }
451
453 int *got_frame_ptr,
AVPacket *avpkt)
454 {
458 int channels;
459 int ch,
ret, got_end;
460
463
464 got_end = 0;
466 ch = 0;
470 got_end = 1;
471 break;
472 }
476 }
477
478 channels = (element ==
TYPE_CPE) ? 2 : 1;
479 if (ch + channels > alac->
channels ||
483 }
484
487 channels);
490
491 ch += channels;
492 }
493 if (!got_end) {
496 }
497
501 }
502
504 *got_frame_ptr = 1;
505 else
507
509 }
510
512 {
514
515 int ch;
521 }
522
523 return 0;
524 }
525
527 {
528 int ch;
530
533 buf_size, buf_alloc_fail);
534
538 buf_size, buf_alloc_fail);
539 }
540
542 buf_size, buf_alloc_fail);
543 }
544 return 0;
545 buf_alloc_fail:
548 }
549
551 {
553
556
558
563 "max samples per frame invalid: %"PRIu32"\n",
566 }
571 alac->
rice_limit = bytestream2_get_byteu(&gb);
572 alac->
channels = bytestream2_get_byteu(&gb);
573 bytestream2_get_be16u(&gb); // maxRun
574 bytestream2_get_be32u(&gb); // max coded frame size
575 bytestream2_get_be32u(&gb); // average bitrate
576 bytestream2_get_be32u(&gb); // samplerate
577
578 return 0;
579 }
580
582 {
584 int req_packed;
587
588 /* initialize from the extradata */
592 }
595 return -1;
596 }
597
601 break;
602 case 24:
604 break;
607 }
609
613 } else {
616 else
618 }
623 }
625
629 }
630
631 return 0;
632 }
633
635 {
639 }
640
642 { "extra_bits_bug", "Force non-standard decoding process",
646 };
647
653 };
654
666 .priv_class = &alac_class
667 };