3 * Copyright (c) 2001-2003 The ffmpeg Project
5 * This file is part of FFmpeg.
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.
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.
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
22 #include "bitstream.h"
27 * First version by Francois Revol (revol@free.fr)
28 * Fringe ADPCM codecs (e.g., DK3, DK4, Westwood)
29 * by Mike Melanson (melanson@pcisys.net)
30 * CD-ROM XA ADPCM codec by BERO
31 * EA ADPCM decoder by Robin Kay (komadori@myrealbox.com)
32 * THP ADPCM decoder by Marco Gerards (mgerards@xs4all.nl)
34 * Features and limitations:
36 * Reference documents:
37 * http://www.pcisys.net/~melanson/codecs/simpleaudio.html
38 * http://www.geocities.com/SiliconValley/8682/aud3.txt
39 * http://openquicktime.sourceforge.net/plugins.htm
40 * XAnim sources (xa_codec.c) http://www.rasnaimaging.com/people/lapus/download.html
41 * http://www.cs.ucla.edu/~leec/mediabench/applications.html
42 * SoX source code http://home.sprynet.com/~cbagwell/sox.html
45 * http://ku-www.ss.titech.ac.jp/~yatsushi/xaadpcm.html
46 * vagpack & depack http://homepages.compuserve.de/bITmASTER32/psx-index.html
47 * readstr http://www.geocities.co.jp/Playtown/2004/
52 #define CLAMP_TO_SHORT(value) \
55 else if (value < -32768) \
58 /* step_table[] and index_table[] are from the ADPCM reference source */
59 /* This is the index table: */
60 static const int index_table[16] = {
61 -1, -1, -1, -1, 2, 4, 6, 8,
62 -1, -1, -1, -1, 2, 4, 6, 8,
66 * This is the step table. Note that many programs use slight deviations from
67 * this table, but such deviations are negligible:
69 static const int step_table[89] = {
70 7, 8, 9, 10, 11, 12, 13, 14, 16, 17,
71 19, 21, 23, 25, 28, 31, 34, 37, 41, 45,
72 50, 55, 60, 66, 73, 80, 88, 97, 107, 118,
73 130, 143, 157, 173, 190, 209, 230, 253, 279, 307,
74 337, 371, 408, 449, 494, 544, 598, 658, 724, 796,
75 876, 963, 1060, 1166, 1282, 1411, 1552, 1707, 1878, 2066,
76 2272, 2499, 2749, 3024, 3327, 3660, 4026, 4428, 4871, 5358,
77 5894, 6484, 7132, 7845, 8630, 9493, 10442, 11487, 12635, 13899,
78 15289, 16818, 18500, 20350, 22385, 24623, 27086, 29794, 32767
81 /* These are for MS-ADPCM */
82 /* AdaptationTable[], AdaptCoeff1[], and AdaptCoeff2[] are from libsndfile */
83 static const int AdaptationTable[] = {
84 230, 230, 230, 230, 307, 409, 512, 614,
85 768, 614, 512, 409, 307, 230, 230, 230
88 static const int AdaptCoeff1[] = {
89 256, 512, 0, 192, 240, 460, 392
92 static const int AdaptCoeff2[] = {
93 0, -256, 0, 64, 0, -208, -232
96 /* These are for CD-ROM XA ADPCM */
97 static const int xa_adpcm_table[5][2] = {
105 static const int ea_adpcm_table[] = {
106 0, 240, 460, 392, 0, 0, -208, -220, 0, 1,
107 3, 4, 7, 8, 10, 11, 0, -1, -3, -4
110 static const int ct_adpcm_table[8] = {
111 0x00E6, 0x00E6, 0x00E6, 0x00E6,
112 0x0133, 0x0199, 0x0200, 0x0266
115 // padded to zero where table size is less then 16
116 static const int swf_index_tables[4][16] = {
118 /*3*/ { -1, -1, 2, 4 },
119 /*4*/ { -1, -1, -1, -1, 2, 4, 6, 8 },
120 /*5*/ { -1, -1, -1, -1, -1, -1, -1, -1, 1, 2, 4, 6, 8, 10, 13, 16 }
123 static const int yamaha_indexscale[] = {
124 230, 230, 230, 230, 307, 409, 512, 614,
125 230, 230, 230, 230, 307, 409, 512, 614
128 static const int yamaha_difflookup[] = {
129 1, 3, 5, 7, 9, 11, 13, 15,
130 -1, -3, -5, -7, -9, -11, -13, -15
135 typedef struct ADPCMChannelStatus {
137 short int step_index;
148 } ADPCMChannelStatus;
150 typedef struct ADPCMContext {
151 int channel; /* for stereo MOVs, decode left, then decode right, then tell it's decoded */
152 ADPCMChannelStatus status[2];
153 short sample_buffer[32]; /* hold left samples while waiting for right samples */
156 /* XXX: implement encoding */
158 #ifdef CONFIG_ENCODERS
159 static int adpcm_encode_init(AVCodecContext *avctx)
161 if (avctx->channels > 2)
162 return -1; /* only stereo or mono =) */
163 switch(avctx->codec->id) {
164 case CODEC_ID_ADPCM_IMA_QT:
165 av_log(avctx, AV_LOG_ERROR, "ADPCM: codec adpcm_ima_qt unsupported for encoding !\n");
166 avctx->frame_size = 64; /* XXX: can multiple of avctx->channels * 64 (left and right blocks are interleaved) */
169 case CODEC_ID_ADPCM_IMA_WAV:
170 avctx->frame_size = (BLKSIZE - 4 * avctx->channels) * 8 / (4 * avctx->channels) + 1; /* each 16 bits sample gives one nibble */
171 /* and we have 4 bytes per channel overhead */
172 avctx->block_align = BLKSIZE;
173 /* seems frame_size isn't taken into account... have to buffer the samples :-( */
175 case CODEC_ID_ADPCM_MS:
176 avctx->frame_size = (BLKSIZE - 7 * avctx->channels) * 2 / avctx->channels + 2; /* each 16 bits sample gives one nibble */
177 /* and we have 7 bytes per channel overhead */
178 avctx->block_align = BLKSIZE;
180 case CODEC_ID_ADPCM_YAMAHA:
181 avctx->frame_size = BLKSIZE * avctx->channels;
182 avctx->block_align = BLKSIZE;
189 avctx->coded_frame= avcodec_alloc_frame();
190 avctx->coded_frame->key_frame= 1;
195 static int adpcm_encode_close(AVCodecContext *avctx)
197 av_freep(&avctx->coded_frame);
203 static inline unsigned char adpcm_ima_compress_sample(ADPCMChannelStatus *c, short sample)
205 int delta = sample - c->prev_sample;
206 int nibble = FFMIN(7, abs(delta)*4/step_table[c->step_index]) + (delta<0)*8;
207 c->prev_sample = c->prev_sample + ((step_table[c->step_index] * yamaha_difflookup[nibble]) / 8);
208 CLAMP_TO_SHORT(c->prev_sample);
209 c->step_index = av_clip(c->step_index + index_table[nibble], 0, 88);
213 static inline unsigned char adpcm_ms_compress_sample(ADPCMChannelStatus *c, short sample)
215 int predictor, nibble, bias;
217 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;
219 nibble= sample - predictor;
220 if(nibble>=0) bias= c->idelta/2;
221 else bias=-c->idelta/2;
223 nibble= (nibble + bias) / c->idelta;
224 nibble= av_clip(nibble, -8, 7)&0x0F;
226 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
227 CLAMP_TO_SHORT(predictor);
229 c->sample2 = c->sample1;
230 c->sample1 = predictor;
232 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
233 if (c->idelta < 16) c->idelta = 16;
238 static inline unsigned char adpcm_yamaha_compress_sample(ADPCMChannelStatus *c, short sample)
247 delta = sample - c->predictor;
249 nibble = FFMIN(7, abs(delta)*4/c->step) + (delta<0)*8;
251 c->predictor = c->predictor + ((c->step * yamaha_difflookup[nibble]) / 8);
252 CLAMP_TO_SHORT(c->predictor);
253 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
254 c->step = av_clip(c->step, 127, 24567);
259 typedef struct TrellisPath {
264 typedef struct TrellisNode {
272 static void adpcm_compress_trellis(AVCodecContext *avctx, const short *samples,
273 uint8_t *dst, ADPCMChannelStatus *c, int n)
275 #define FREEZE_INTERVAL 128
276 //FIXME 6% faster if frontier is a compile-time constant
277 const int frontier = 1 << avctx->trellis;
278 const int stride = avctx->channels;
279 const int version = avctx->codec->id;
280 const int max_paths = frontier*FREEZE_INTERVAL;
281 TrellisPath paths[max_paths], *p;
282 TrellisNode node_buf[2][frontier];
283 TrellisNode *nodep_buf[2][frontier];
284 TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
285 TrellisNode **nodes_next = nodep_buf[1];
286 int pathn = 0, froze = -1, i, j, k;
288 assert(!(max_paths&(max_paths-1)));
290 memset(nodep_buf, 0, sizeof(nodep_buf));
291 nodes[0] = &node_buf[1][0];
294 nodes[0]->step = c->step_index;
295 nodes[0]->sample1 = c->sample1;
296 nodes[0]->sample2 = c->sample2;
297 if(version == CODEC_ID_ADPCM_IMA_WAV)
298 nodes[0]->sample1 = c->prev_sample;
299 if(version == CODEC_ID_ADPCM_MS)
300 nodes[0]->step = c->idelta;
301 if(version == CODEC_ID_ADPCM_YAMAHA) {
303 nodes[0]->step = 127;
304 nodes[0]->sample1 = 0;
306 nodes[0]->step = c->step;
307 nodes[0]->sample1 = c->predictor;
312 TrellisNode *t = node_buf[i&1];
314 int sample = samples[i*stride];
315 memset(nodes_next, 0, frontier*sizeof(TrellisNode*));
316 for(j=0; j<frontier && nodes[j]; j++) {
317 // higher j have higher ssd already, so they're unlikely to use a suboptimal next sample too
318 const int range = (j < frontier/2) ? 1 : 0;
319 const int step = nodes[j]->step;
321 if(version == CODEC_ID_ADPCM_MS) {
322 const int predictor = ((nodes[j]->sample1 * c->coeff1) + (nodes[j]->sample2 * c->coeff2)) / 256;
323 const int div = (sample - predictor) / step;
324 const int nmin = av_clip(div-range, -8, 6);
325 const int nmax = av_clip(div+range, -7, 7);
326 for(nidx=nmin; nidx<=nmax; nidx++) {
327 const int nibble = nidx & 0xf;
328 int dec_sample = predictor + nidx * step;
329 #define STORE_NODE(NAME, STEP_INDEX)\
332 CLAMP_TO_SHORT(dec_sample);\
333 d = sample - dec_sample;\
334 ssd = nodes[j]->ssd + d*d;\
335 if(nodes_next[frontier-1] && ssd >= nodes_next[frontier-1]->ssd)\
337 /* Collapse any two states with the same previous sample value. \
338 * One could also distinguish states by step and by 2nd to last
339 * sample, but the effects of that are negligible. */\
340 for(k=0; k<frontier && nodes_next[k]; k++) {\
341 if(dec_sample == nodes_next[k]->sample1) {\
342 assert(ssd >= nodes_next[k]->ssd);\
346 for(k=0; k<frontier; k++) {\
347 if(!nodes_next[k] || ssd < nodes_next[k]->ssd) {\
348 TrellisNode *u = nodes_next[frontier-1];\
350 assert(pathn < max_paths);\
355 u->step = STEP_INDEX;\
356 u->sample2 = nodes[j]->sample1;\
357 u->sample1 = dec_sample;\
358 paths[u->path].nibble = nibble;\
359 paths[u->path].prev = nodes[j]->path;\
360 memmove(&nodes_next[k+1], &nodes_next[k], (frontier-k-1)*sizeof(TrellisNode*));\
366 STORE_NODE(ms, FFMAX(16, (AdaptationTable[nibble] * step) >> 8));
368 } else if(version == CODEC_ID_ADPCM_IMA_WAV) {
369 #define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\
370 const int predictor = nodes[j]->sample1;\
371 const int div = (sample - predictor) * 4 / STEP_TABLE;\
372 int nmin = av_clip(div-range, -7, 6);\
373 int nmax = av_clip(div+range, -6, 7);\
374 if(nmin<=0) nmin--; /* distinguish -0 from +0 */\
376 for(nidx=nmin; nidx<=nmax; nidx++) {\
377 const int nibble = nidx<0 ? 7-nidx : nidx;\
378 int dec_sample = predictor + (STEP_TABLE * yamaha_difflookup[nibble]) / 8;\
379 STORE_NODE(NAME, STEP_INDEX);\
381 LOOP_NODES(ima, step_table[step], av_clip(step + index_table[nibble], 0, 88));
382 } else { //CODEC_ID_ADPCM_YAMAHA
383 LOOP_NODES(yamaha, step, av_clip((step * yamaha_indexscale[nibble]) >> 8, 127, 24567));
394 if(nodes[0]->ssd > (1<<28)) {
395 for(j=1; j<frontier && nodes[j]; j++)
396 nodes[j]->ssd -= nodes[0]->ssd;
400 // merge old paths to save memory
401 if(i == froze + FREEZE_INTERVAL) {
402 p = &paths[nodes[0]->path];
403 for(k=i; k>froze; k--) {
409 // other nodes might use paths that don't coincide with the frozen one.
410 // checking which nodes do so is too slow, so just kill them all.
411 // this also slightly improves quality, but I don't know why.
412 memset(nodes+1, 0, (frontier-1)*sizeof(TrellisNode*));
416 p = &paths[nodes[0]->path];
417 for(i=n-1; i>froze; i--) {
422 c->predictor = nodes[0]->sample1;
423 c->sample1 = nodes[0]->sample1;
424 c->sample2 = nodes[0]->sample2;
425 c->step_index = nodes[0]->step;
426 c->step = nodes[0]->step;
427 c->idelta = nodes[0]->step;
430 static int adpcm_encode_frame(AVCodecContext *avctx,
431 unsigned char *frame, int buf_size, void *data)
436 ADPCMContext *c = avctx->priv_data;
439 samples = (short *)data;
440 st= avctx->channels == 2;
441 /* n = (BLKSIZE - 4 * avctx->channels) / (2 * 8 * avctx->channels); */
443 switch(avctx->codec->id) {
444 case CODEC_ID_ADPCM_IMA_QT: /* XXX: can't test until we get .mov writer */
446 case CODEC_ID_ADPCM_IMA_WAV:
447 n = avctx->frame_size / 8;
448 c->status[0].prev_sample = (signed short)samples[0]; /* XXX */
449 /* c->status[0].step_index = 0; *//* XXX: not sure how to init the state machine */
450 *dst++ = (c->status[0].prev_sample) & 0xFF; /* little endian */
451 *dst++ = (c->status[0].prev_sample >> 8) & 0xFF;
452 *dst++ = (unsigned char)c->status[0].step_index;
453 *dst++ = 0; /* unknown */
455 if (avctx->channels == 2) {
456 c->status[1].prev_sample = (signed short)samples[1];
457 /* c->status[1].step_index = 0; */
458 *dst++ = (c->status[1].prev_sample) & 0xFF;
459 *dst++ = (c->status[1].prev_sample >> 8) & 0xFF;
460 *dst++ = (unsigned char)c->status[1].step_index;
465 /* stereo: 4 bytes (8 samples) for left, 4 bytes for right, 4 bytes left, ... */
466 if(avctx->trellis > 0) {
468 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n*8);
469 if(avctx->channels == 2)
470 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n*8);
472 *dst++ = buf[0][8*i+0] | (buf[0][8*i+1] << 4);
473 *dst++ = buf[0][8*i+2] | (buf[0][8*i+3] << 4);
474 *dst++ = buf[0][8*i+4] | (buf[0][8*i+5] << 4);
475 *dst++ = buf[0][8*i+6] | (buf[0][8*i+7] << 4);
476 if (avctx->channels == 2) {
477 *dst++ = buf[1][8*i+0] | (buf[1][8*i+1] << 4);
478 *dst++ = buf[1][8*i+2] | (buf[1][8*i+3] << 4);
479 *dst++ = buf[1][8*i+4] | (buf[1][8*i+5] << 4);
480 *dst++ = buf[1][8*i+6] | (buf[1][8*i+7] << 4);
485 *dst = adpcm_ima_compress_sample(&c->status[0], samples[0]) & 0x0F;
486 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels]) << 4) & 0xF0;
488 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 2]) & 0x0F;
489 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 3]) << 4) & 0xF0;
491 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 4]) & 0x0F;
492 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 5]) << 4) & 0xF0;
494 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 6]) & 0x0F;
495 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 7]) << 4) & 0xF0;
498 if (avctx->channels == 2) {
499 *dst = adpcm_ima_compress_sample(&c->status[1], samples[1]);
500 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[3]) << 4;
502 *dst = adpcm_ima_compress_sample(&c->status[1], samples[5]);
503 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[7]) << 4;
505 *dst = adpcm_ima_compress_sample(&c->status[1], samples[9]);
506 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[11]) << 4;
508 *dst = adpcm_ima_compress_sample(&c->status[1], samples[13]);
509 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[15]) << 4;
512 samples += 8 * avctx->channels;
515 case CODEC_ID_ADPCM_MS:
516 for(i=0; i<avctx->channels; i++){
520 c->status[i].coeff1 = AdaptCoeff1[predictor];
521 c->status[i].coeff2 = AdaptCoeff2[predictor];
523 for(i=0; i<avctx->channels; i++){
524 if (c->status[i].idelta < 16)
525 c->status[i].idelta = 16;
527 *dst++ = c->status[i].idelta & 0xFF;
528 *dst++ = c->status[i].idelta >> 8;
530 for(i=0; i<avctx->channels; i++){
531 c->status[i].sample1= *samples++;
533 *dst++ = c->status[i].sample1 & 0xFF;
534 *dst++ = c->status[i].sample1 >> 8;
536 for(i=0; i<avctx->channels; i++){
537 c->status[i].sample2= *samples++;
539 *dst++ = c->status[i].sample2 & 0xFF;
540 *dst++ = c->status[i].sample2 >> 8;
543 if(avctx->trellis > 0) {
544 int n = avctx->block_align - 7*avctx->channels;
546 if(avctx->channels == 1) {
548 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
550 *dst++ = (buf[0][i] << 4) | buf[0][i+1];
552 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
553 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
555 *dst++ = (buf[0][i] << 4) | buf[1][i];
558 for(i=7*avctx->channels; i<avctx->block_align; i++) {
560 nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++)<<4;
561 nibble|= adpcm_ms_compress_sample(&c->status[st], *samples++);
565 case CODEC_ID_ADPCM_YAMAHA:
566 n = avctx->frame_size / 2;
567 if(avctx->trellis > 0) {
570 if(avctx->channels == 1) {
571 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
573 *dst++ = buf[0][i] | (buf[0][i+1] << 4);
575 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
576 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
578 *dst++ = buf[0][i] | (buf[1][i] << 4);
582 for(i = 0; i < avctx->channels; i++) {
584 nibble = adpcm_yamaha_compress_sample(&c->status[i], samples[i]);
585 nibble |= adpcm_yamaha_compress_sample(&c->status[i], samples[i+avctx->channels]) << 4;
588 samples += 2 * avctx->channels;
596 #endif //CONFIG_ENCODERS
598 static int adpcm_decode_init(AVCodecContext * avctx)
600 ADPCMContext *c = avctx->priv_data;
602 if(avctx->channels > 2U){
607 c->status[0].predictor = c->status[1].predictor = 0;
608 c->status[0].step_index = c->status[1].step_index = 0;
609 c->status[0].step = c->status[1].step = 0;
611 switch(avctx->codec->id) {
612 case CODEC_ID_ADPCM_CT:
613 c->status[0].step = c->status[1].step = 511;
621 static inline short adpcm_ima_expand_nibble(ADPCMChannelStatus *c, char nibble, int shift)
625 int sign, delta, diff, step;
627 step = step_table[c->step_index];
628 step_index = c->step_index + index_table[(unsigned)nibble];
629 if (step_index < 0) step_index = 0;
630 else if (step_index > 88) step_index = 88;
634 /* perform direct multiplication instead of series of jumps proposed by
635 * the reference ADPCM implementation since modern CPUs can do the mults
637 diff = ((2 * delta + 1) * step) >> shift;
638 predictor = c->predictor;
639 if (sign) predictor -= diff;
640 else predictor += diff;
642 CLAMP_TO_SHORT(predictor);
643 c->predictor = predictor;
644 c->step_index = step_index;
646 return (short)predictor;
649 static inline short adpcm_ms_expand_nibble(ADPCMChannelStatus *c, char nibble)
653 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;
654 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
655 CLAMP_TO_SHORT(predictor);
657 c->sample2 = c->sample1;
658 c->sample1 = predictor;
659 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
660 if (c->idelta < 16) c->idelta = 16;
662 return (short)predictor;
665 static inline short adpcm_ct_expand_nibble(ADPCMChannelStatus *c, char nibble)
668 int sign, delta, diff;
673 /* perform direct multiplication instead of series of jumps proposed by
674 * the reference ADPCM implementation since modern CPUs can do the mults
676 diff = ((2 * delta + 1) * c->step) >> 3;
677 predictor = c->predictor;
678 /* predictor update is not so trivial: predictor is multiplied on 254/256 before updating */
680 predictor = ((predictor * 254) >> 8) - diff;
682 predictor = ((predictor * 254) >> 8) + diff;
683 /* calculate new step and clamp it to range 511..32767 */
684 new_step = (ct_adpcm_table[nibble & 7] * c->step) >> 8;
691 CLAMP_TO_SHORT(predictor);
692 c->predictor = predictor;
693 return (short)predictor;
696 static inline short adpcm_sbpro_expand_nibble(ADPCMChannelStatus *c, char nibble, int size, int shift)
698 int sign, delta, diff;
700 sign = nibble & (1<<(size-1));
701 delta = nibble & ((1<<(size-1))-1);
702 diff = delta << (7 + c->step + shift);
705 c->predictor -= diff;
707 c->predictor += diff;
710 if (c->predictor > 16256)
711 c->predictor = 16256;
712 else if (c->predictor < -16384)
713 c->predictor = -16384;
715 /* calculate new step */
716 if (delta >= (2*size - 3) && c->step < 3)
718 else if (delta == 0 && c->step > 0)
721 return (short) c->predictor;
724 static inline short adpcm_yamaha_expand_nibble(ADPCMChannelStatus *c, unsigned char nibble)
731 c->predictor += (c->step * yamaha_difflookup[nibble]) / 8;
732 CLAMP_TO_SHORT(c->predictor);
733 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
734 c->step = av_clip(c->step, 127, 24567);
738 static void xa_decode(short *out, const unsigned char *in,
739 ADPCMChannelStatus *left, ADPCMChannelStatus *right, int inc)
742 int shift,filter,f0,f1;
748 shift = 12 - (in[4+i*2] & 15);
749 filter = in[4+i*2] >> 4;
750 f0 = xa_adpcm_table[filter][0];
751 f1 = xa_adpcm_table[filter][1];
759 t = (signed char)(d<<4)>>4;
760 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
768 if (inc==2) { /* stereo */
771 s_1 = right->sample1;
772 s_2 = right->sample2;
773 out = out + 1 - 28*2;
776 shift = 12 - (in[5+i*2] & 15);
777 filter = in[5+i*2] >> 4;
779 f0 = xa_adpcm_table[filter][0];
780 f1 = xa_adpcm_table[filter][1];
785 t = (signed char)d >> 4;
786 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
794 if (inc==2) { /* stereo */
795 right->sample1 = s_1;
796 right->sample2 = s_2;
806 /* DK3 ADPCM support macro */
807 #define DK3_GET_NEXT_NIBBLE() \
808 if (decode_top_nibble_next) \
810 nibble = (last_byte >> 4) & 0x0F; \
811 decode_top_nibble_next = 0; \
815 last_byte = *src++; \
816 if (src >= buf + buf_size) break; \
817 nibble = last_byte & 0x0F; \
818 decode_top_nibble_next = 1; \
821 static int adpcm_decode_frame(AVCodecContext *avctx,
822 void *data, int *data_size,
823 uint8_t *buf, int buf_size)
825 ADPCMContext *c = avctx->priv_data;
826 ADPCMChannelStatus *cs;
827 int n, m, channel, i;
828 int block_predictor[2];
834 /* DK3 ADPCM accounting variables */
835 unsigned char last_byte = 0;
836 unsigned char nibble;
837 int decode_top_nibble_next = 0;
840 /* EA ADPCM state variables */
841 uint32_t samples_in_chunk;
842 int32_t previous_left_sample, previous_right_sample;
843 int32_t current_left_sample, current_right_sample;
844 int32_t next_left_sample, next_right_sample;
845 int32_t coeff1l, coeff2l, coeff1r, coeff2r;
846 uint8_t shift_left, shift_right;
852 //should protect all 4bit ADPCM variants
853 //8 is needed for CODEC_ID_ADPCM_IMA_WAV with 2 channels
855 if(*data_size/4 < buf_size + 8)
859 samples_end= samples + *data_size/2;
863 st = avctx->channels == 2 ? 1 : 0;
865 switch(avctx->codec->id) {
866 case CODEC_ID_ADPCM_IMA_QT:
867 n = (buf_size - 2);/* >> 2*avctx->channels;*/
868 channel = c->channel;
869 cs = &(c->status[channel]);
870 /* (pppppp) (piiiiiii) */
872 /* Bits 15-7 are the _top_ 9 bits of the 16-bit initial predictor value */
873 cs->predictor = (*src++) << 8;
874 cs->predictor |= (*src & 0x80);
875 cs->predictor &= 0xFF80;
878 if(cs->predictor & 0x8000)
879 cs->predictor -= 0x10000;
881 CLAMP_TO_SHORT(cs->predictor);
883 cs->step_index = (*src++) & 0x7F;
885 if (cs->step_index > 88){
886 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
890 cs->step = step_table[cs->step_index];
895 for(m=32; n>0 && m>0; n--, m--) { /* in QuickTime, IMA is encoded by chuncks of 34 bytes (=64 samples) */
896 *samples = adpcm_ima_expand_nibble(cs, src[0] & 0x0F, 3);
897 samples += avctx->channels;
898 *samples = adpcm_ima_expand_nibble(cs, (src[0] >> 4) & 0x0F, 3);
899 samples += avctx->channels;
903 if(st) { /* handle stereo interlacing */
904 c->channel = (channel + 1) % 2; /* we get one packet for left, then one for right data */
905 if(channel == 1) { /* wait for the other packet before outputing anything */
910 case CODEC_ID_ADPCM_IMA_WAV:
911 if (avctx->block_align != 0 && buf_size > avctx->block_align)
912 buf_size = avctx->block_align;
914 // samples_per_block= (block_align-4*chanels)*8 / (bits_per_sample * chanels) + 1;
916 for(i=0; i<avctx->channels; i++){
917 cs = &(c->status[i]);
918 cs->predictor = (int16_t)(src[0] + (src[1]<<8));
921 // XXX: is this correct ??: *samples++ = cs->predictor;
923 cs->step_index = *src++;
924 if (cs->step_index > 88){
925 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
928 if (*src++) av_log(avctx, AV_LOG_ERROR, "unused byte should be null but is %d!!\n", src[-1]); /* unused */
931 while(src < buf + buf_size){
934 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] & 0x0F, 3);
936 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] >> 4 , 3);
942 case CODEC_ID_ADPCM_4XM:
943 cs = &(c->status[0]);
944 c->status[0].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
946 c->status[1].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
948 c->status[0].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
950 c->status[1].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
952 if (cs->step_index < 0) cs->step_index = 0;
953 if (cs->step_index > 88) cs->step_index = 88;
955 m= (buf_size - (src - buf))>>st;
957 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] & 0x0F, 4);
959 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] & 0x0F, 4);
960 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] >> 4, 4);
962 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] >> 4, 4);
968 case CODEC_ID_ADPCM_MS:
969 if (avctx->block_align != 0 && buf_size > avctx->block_align)
970 buf_size = avctx->block_align;
971 n = buf_size - 7 * avctx->channels;
974 block_predictor[0] = av_clip(*src++, 0, 7);
975 block_predictor[1] = 0;
977 block_predictor[1] = av_clip(*src++, 0, 7);
978 c->status[0].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
981 c->status[1].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
984 c->status[0].coeff1 = AdaptCoeff1[block_predictor[0]];
985 c->status[0].coeff2 = AdaptCoeff2[block_predictor[0]];
986 c->status[1].coeff1 = AdaptCoeff1[block_predictor[1]];
987 c->status[1].coeff2 = AdaptCoeff2[block_predictor[1]];
989 c->status[0].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
991 if (st) c->status[1].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
993 c->status[0].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
995 if (st) c->status[1].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
998 *samples++ = c->status[0].sample1;
999 if (st) *samples++ = c->status[1].sample1;
1000 *samples++ = c->status[0].sample2;
1001 if (st) *samples++ = c->status[1].sample2;
1003 *samples++ = adpcm_ms_expand_nibble(&c->status[0], (src[0] >> 4) & 0x0F);
1004 *samples++ = adpcm_ms_expand_nibble(&c->status[st], src[0] & 0x0F);
1008 case CODEC_ID_ADPCM_IMA_DK4:
1009 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1010 buf_size = avctx->block_align;
1012 c->status[0].predictor = (int16_t)(src[0] | (src[1] << 8));
1013 c->status[0].step_index = src[2];
1015 *samples++ = c->status[0].predictor;
1017 c->status[1].predictor = (int16_t)(src[0] | (src[1] << 8));
1018 c->status[1].step_index = src[2];
1020 *samples++ = c->status[1].predictor;
1022 while (src < buf + buf_size) {
1024 /* take care of the top nibble (always left or mono channel) */
1025 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1026 (src[0] >> 4) & 0x0F, 3);
1028 /* take care of the bottom nibble, which is right sample for
1029 * stereo, or another mono sample */
1031 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1034 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1040 case CODEC_ID_ADPCM_IMA_DK3:
1041 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1042 buf_size = avctx->block_align;
1044 if(buf_size + 16 > (samples_end - samples)*3/8)
1047 c->status[0].predictor = (int16_t)(src[10] | (src[11] << 8));
1048 c->status[1].predictor = (int16_t)(src[12] | (src[13] << 8));
1049 c->status[0].step_index = src[14];
1050 c->status[1].step_index = src[15];
1051 /* sign extend the predictors */
1053 diff_channel = c->status[1].predictor;
1055 /* the DK3_GET_NEXT_NIBBLE macro issues the break statement when
1056 * the buffer is consumed */
1059 /* for this algorithm, c->status[0] is the sum channel and
1060 * c->status[1] is the diff channel */
1062 /* process the first predictor of the sum channel */
1063 DK3_GET_NEXT_NIBBLE();
1064 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1066 /* process the diff channel predictor */
1067 DK3_GET_NEXT_NIBBLE();
1068 adpcm_ima_expand_nibble(&c->status[1], nibble, 3);
1070 /* process the first pair of stereo PCM samples */
1071 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1072 *samples++ = c->status[0].predictor + c->status[1].predictor;
1073 *samples++ = c->status[0].predictor - c->status[1].predictor;
1075 /* process the second predictor of the sum channel */
1076 DK3_GET_NEXT_NIBBLE();
1077 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1079 /* process the second pair of stereo PCM samples */
1080 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1081 *samples++ = c->status[0].predictor + c->status[1].predictor;
1082 *samples++ = c->status[0].predictor - c->status[1].predictor;
1085 case CODEC_ID_ADPCM_IMA_WS:
1086 /* no per-block initialization; just start decoding the data */
1087 while (src < buf + buf_size) {
1090 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1091 (src[0] >> 4) & 0x0F, 3);
1092 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1095 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1096 (src[0] >> 4) & 0x0F, 3);
1097 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1104 case CODEC_ID_ADPCM_XA:
1105 c->status[0].sample1 = c->status[0].sample2 =
1106 c->status[1].sample1 = c->status[1].sample2 = 0;
1107 while (buf_size >= 128) {
1108 xa_decode(samples, src, &c->status[0], &c->status[1],
1115 case CODEC_ID_ADPCM_EA:
1116 samples_in_chunk = AV_RL32(src);
1117 if (samples_in_chunk >= ((buf_size - 12) * 2)) {
1122 current_left_sample = (int16_t)AV_RL16(src);
1124 previous_left_sample = (int16_t)AV_RL16(src);
1126 current_right_sample = (int16_t)AV_RL16(src);
1128 previous_right_sample = (int16_t)AV_RL16(src);
1131 for (count1 = 0; count1 < samples_in_chunk/28;count1++) {
1132 coeff1l = ea_adpcm_table[(*src >> 4) & 0x0F];
1133 coeff2l = ea_adpcm_table[((*src >> 4) & 0x0F) + 4];
1134 coeff1r = ea_adpcm_table[*src & 0x0F];
1135 coeff2r = ea_adpcm_table[(*src & 0x0F) + 4];
1138 shift_left = ((*src >> 4) & 0x0F) + 8;
1139 shift_right = (*src & 0x0F) + 8;
1142 for (count2 = 0; count2 < 28; count2++) {
1143 next_left_sample = (((*src & 0xF0) << 24) >> shift_left);
1144 next_right_sample = (((*src & 0x0F) << 28) >> shift_right);
1147 next_left_sample = (next_left_sample +
1148 (current_left_sample * coeff1l) +
1149 (previous_left_sample * coeff2l) + 0x80) >> 8;
1150 next_right_sample = (next_right_sample +
1151 (current_right_sample * coeff1r) +
1152 (previous_right_sample * coeff2r) + 0x80) >> 8;
1153 CLAMP_TO_SHORT(next_left_sample);
1154 CLAMP_TO_SHORT(next_right_sample);
1156 previous_left_sample = current_left_sample;
1157 current_left_sample = next_left_sample;
1158 previous_right_sample = current_right_sample;
1159 current_right_sample = next_right_sample;
1160 *samples++ = (unsigned short)current_left_sample;
1161 *samples++ = (unsigned short)current_right_sample;
1165 case CODEC_ID_ADPCM_IMA_SMJPEG:
1166 c->status[0].predictor = *src;
1168 c->status[0].step_index = *src++;
1169 src++; /* skip another byte before getting to the meat */
1170 while (src < buf + buf_size) {
1171 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1173 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1174 (*src >> 4) & 0x0F, 3);
1178 case CODEC_ID_ADPCM_CT:
1179 while (src < buf + buf_size) {
1181 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1182 (src[0] >> 4) & 0x0F);
1183 *samples++ = adpcm_ct_expand_nibble(&c->status[1],
1186 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1187 (src[0] >> 4) & 0x0F);
1188 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1194 case CODEC_ID_ADPCM_SBPRO_4:
1195 case CODEC_ID_ADPCM_SBPRO_3:
1196 case CODEC_ID_ADPCM_SBPRO_2:
1197 if (!c->status[0].step_index) {
1198 /* the first byte is a raw sample */
1199 *samples++ = 128 * (*src++ - 0x80);
1201 *samples++ = 128 * (*src++ - 0x80);
1202 c->status[0].step_index = 1;
1204 if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_4) {
1205 while (src < buf + buf_size) {
1206 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1207 (src[0] >> 4) & 0x0F, 4, 0);
1208 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1209 src[0] & 0x0F, 4, 0);
1212 } else if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_3) {
1213 while (src < buf + buf_size && samples + 2 < samples_end) {
1214 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1215 (src[0] >> 5) & 0x07, 3, 0);
1216 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1217 (src[0] >> 2) & 0x07, 3, 0);
1218 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1219 src[0] & 0x03, 2, 0);
1223 while (src < buf + buf_size && samples + 3 < samples_end) {
1224 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1225 (src[0] >> 6) & 0x03, 2, 2);
1226 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1227 (src[0] >> 4) & 0x03, 2, 2);
1228 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1229 (src[0] >> 2) & 0x03, 2, 2);
1230 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1231 src[0] & 0x03, 2, 2);
1236 case CODEC_ID_ADPCM_SWF:
1240 int k0, signmask, nb_bits;
1241 int size = buf_size*8;
1243 init_get_bits(&gb, buf, size);
1245 //read bits & inital values
1246 nb_bits = get_bits(&gb, 2)+2;
1247 //av_log(NULL,AV_LOG_INFO,"nb_bits: %d\n", nb_bits);
1248 table = swf_index_tables[nb_bits-2];
1249 k0 = 1 << (nb_bits-2);
1250 signmask = 1 << (nb_bits-1);
1252 for (i = 0; i < avctx->channels; i++) {
1253 *samples++ = c->status[i].predictor = get_sbits(&gb, 16);
1254 c->status[i].step_index = get_bits(&gb, 6);
1257 while (get_bits_count(&gb) < size)
1261 for (i = 0; i < avctx->channels; i++) {
1262 // similar to IMA adpcm
1263 int delta = get_bits(&gb, nb_bits);
1264 int step = step_table[c->status[i].step_index];
1265 long vpdiff = 0; // vpdiff = (delta+0.5)*step/4
1276 if (delta & signmask)
1277 c->status[i].predictor -= vpdiff;
1279 c->status[i].predictor += vpdiff;
1281 c->status[i].step_index += table[delta & (~signmask)];
1283 c->status[i].step_index = av_clip(c->status[i].step_index, 0, 88);
1284 c->status[i].predictor = av_clip(c->status[i].predictor, -32768, 32767);
1286 *samples++ = c->status[i].predictor;
1287 if (samples >= samples_end) {
1288 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1296 case CODEC_ID_ADPCM_YAMAHA:
1297 while (src < buf + buf_size) {
1299 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1301 *samples++ = adpcm_yamaha_expand_nibble(&c->status[1],
1302 (src[0] >> 4) & 0x0F);
1304 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1306 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1307 (src[0] >> 4) & 0x0F);
1312 case CODEC_ID_ADPCM_THP:
1316 unsigned int samplecnt;
1317 int prev1[2], prev2[2];
1320 if (buf_size < 80) {
1321 av_log(avctx, AV_LOG_ERROR, "frame too small\n");
1325 init_get_bits(&gb, src, buf_size * 8);
1328 get_bits_long(&gb, 32); /* Channel size */
1329 samplecnt = get_bits_long(&gb, 32);
1331 for (ch = 0; ch < 2; ch++)
1332 for (i = 0; i < 16; i++)
1333 table[ch][i] = get_sbits(&gb, 16);
1335 /* Initialize the previous sample. */
1336 for (ch = 0; ch < 2; ch++) {
1337 prev1[ch] = get_sbits(&gb, 16);
1338 prev2[ch] = get_sbits(&gb, 16);
1341 if (samplecnt >= (samples_end - samples) / (st + 1)) {
1342 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1346 for (ch = 0; ch <= st; ch++) {
1347 samples = (unsigned short *) data + ch;
1349 /* Read in every sample for this channel. */
1350 for (i = 0; i < samplecnt / 14; i++) {
1351 uint8_t index = get_bits (&gb, 4) & 7;
1352 unsigned int exp = get_bits (&gb, 4);
1353 int factor1 = table[ch][index * 2];
1354 int factor2 = table[ch][index * 2 + 1];
1356 /* Decode 14 samples. */
1357 for (n = 0; n < 14; n++) {
1358 int sampledat = get_sbits (&gb, 4);
1360 *samples = ((prev1[ch]*factor1
1361 + prev2[ch]*factor2) >> 11) + (sampledat << exp);
1362 prev2[ch] = prev1[ch];
1363 prev1[ch] = *samples++;
1365 /* In case of stereo, skip one sample, this sample
1366 is for the other channel. */
1372 /* In the previous loop, in case stereo is used, samples is
1373 increased exactly one time too often. */
1381 *data_size = (uint8_t *)samples - (uint8_t *)data;
1387 #ifdef CONFIG_ENCODERS
1388 #define ADPCM_ENCODER(id,name) \
1389 AVCodec name ## _encoder = { \
1393 sizeof(ADPCMContext), \
1394 adpcm_encode_init, \
1395 adpcm_encode_frame, \
1396 adpcm_encode_close, \
1400 #define ADPCM_ENCODER(id,name)
1403 #ifdef CONFIG_DECODERS
1404 #define ADPCM_DECODER(id,name) \
1405 AVCodec name ## _decoder = { \
1409 sizeof(ADPCMContext), \
1410 adpcm_decode_init, \
1413 adpcm_decode_frame, \
1416 #define ADPCM_DECODER(id,name)
1419 #define ADPCM_CODEC(id, name) \
1420 ADPCM_ENCODER(id,name) ADPCM_DECODER(id,name)
1422 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt);
1423 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav);
1424 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3);
1425 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4);
1426 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws);
1427 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg);
1428 ADPCM_CODEC(CODEC_ID_ADPCM_MS, adpcm_ms);
1429 ADPCM_CODEC(CODEC_ID_ADPCM_4XM, adpcm_4xm);
1430 ADPCM_CODEC(CODEC_ID_ADPCM_XA, adpcm_xa);
1431 ADPCM_CODEC(CODEC_ID_ADPCM_EA, adpcm_ea);
1432 ADPCM_CODEC(CODEC_ID_ADPCM_CT, adpcm_ct);
1433 ADPCM_CODEC(CODEC_ID_ADPCM_SWF, adpcm_swf);
1434 ADPCM_CODEC(CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha);
1435 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4);
1436 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3);
1437 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2);
1438 ADPCM_CODEC(CODEC_ID_ADPCM_THP, adpcm_thp);