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"
23 #include "bytestream.h"
28 * First version by Francois Revol (revol@free.fr)
29 * Fringe ADPCM codecs (e.g., DK3, DK4, Westwood)
30 * by Mike Melanson (melanson@pcisys.net)
31 * CD-ROM XA ADPCM codec by BERO
32 * EA ADPCM decoder by Robin Kay (komadori@myrealbox.com)
33 * THP ADPCM decoder by Marco Gerards (mgerards@xs4all.nl)
35 * Features and limitations:
37 * Reference documents:
38 * http://www.pcisys.net/~melanson/codecs/simpleaudio.html
39 * http://www.geocities.com/SiliconValley/8682/aud3.txt
40 * http://openquicktime.sourceforge.net/plugins.htm
41 * XAnim sources (xa_codec.c) http://www.rasnaimaging.com/people/lapus/download.html
42 * http://www.cs.ucla.edu/~leec/mediabench/applications.html
43 * SoX source code http://home.sprynet.com/~cbagwell/sox.html
46 * http://ku-www.ss.titech.ac.jp/~yatsushi/xaadpcm.html
47 * vagpack & depack http://homepages.compuserve.de/bITmASTER32/psx-index.html
48 * readstr http://www.geocities.co.jp/Playtown/2004/
53 #define CLAMP_TO_SHORT(value) \
56 else if (value < -32768) \
59 /* step_table[] and index_table[] are from the ADPCM reference source */
60 /* This is the index table: */
61 static const int index_table[16] = {
62 -1, -1, -1, -1, 2, 4, 6, 8,
63 -1, -1, -1, -1, 2, 4, 6, 8,
67 * This is the step table. Note that many programs use slight deviations from
68 * this table, but such deviations are negligible:
70 static const int step_table[89] = {
71 7, 8, 9, 10, 11, 12, 13, 14, 16, 17,
72 19, 21, 23, 25, 28, 31, 34, 37, 41, 45,
73 50, 55, 60, 66, 73, 80, 88, 97, 107, 118,
74 130, 143, 157, 173, 190, 209, 230, 253, 279, 307,
75 337, 371, 408, 449, 494, 544, 598, 658, 724, 796,
76 876, 963, 1060, 1166, 1282, 1411, 1552, 1707, 1878, 2066,
77 2272, 2499, 2749, 3024, 3327, 3660, 4026, 4428, 4871, 5358,
78 5894, 6484, 7132, 7845, 8630, 9493, 10442, 11487, 12635, 13899,
79 15289, 16818, 18500, 20350, 22385, 24623, 27086, 29794, 32767
82 /* These are for MS-ADPCM */
83 /* AdaptationTable[], AdaptCoeff1[], and AdaptCoeff2[] are from libsndfile */
84 static const int AdaptationTable[] = {
85 230, 230, 230, 230, 307, 409, 512, 614,
86 768, 614, 512, 409, 307, 230, 230, 230
89 static const int AdaptCoeff1[] = {
90 256, 512, 0, 192, 240, 460, 392
93 static const int AdaptCoeff2[] = {
94 0, -256, 0, 64, 0, -208, -232
97 /* These are for CD-ROM XA ADPCM */
98 static const int xa_adpcm_table[5][2] = {
106 static const int ea_adpcm_table[] = {
107 0, 240, 460, 392, 0, 0, -208, -220, 0, 1,
108 3, 4, 7, 8, 10, 11, 0, -1, -3, -4
111 static const int ct_adpcm_table[8] = {
112 0x00E6, 0x00E6, 0x00E6, 0x00E6,
113 0x0133, 0x0199, 0x0200, 0x0266
116 // padded to zero where table size is less then 16
117 static const int swf_index_tables[4][16] = {
119 /*3*/ { -1, -1, 2, 4 },
120 /*4*/ { -1, -1, -1, -1, 2, 4, 6, 8 },
121 /*5*/ { -1, -1, -1, -1, -1, -1, -1, -1, 1, 2, 4, 6, 8, 10, 13, 16 }
124 static const int yamaha_indexscale[] = {
125 230, 230, 230, 230, 307, 409, 512, 614,
126 230, 230, 230, 230, 307, 409, 512, 614
129 static const int yamaha_difflookup[] = {
130 1, 3, 5, 7, 9, 11, 13, 15,
131 -1, -3, -5, -7, -9, -11, -13, -15
136 typedef struct ADPCMChannelStatus {
138 short int step_index;
149 } ADPCMChannelStatus;
151 typedef struct ADPCMContext {
152 int channel; /* for stereo MOVs, decode left, then decode right, then tell it's decoded */
153 ADPCMChannelStatus status[2];
154 short sample_buffer[32]; /* hold left samples while waiting for right samples */
157 /* XXX: implement encoding */
159 #ifdef CONFIG_ENCODERS
160 static int adpcm_encode_init(AVCodecContext *avctx)
162 if (avctx->channels > 2)
163 return -1; /* only stereo or mono =) */
164 switch(avctx->codec->id) {
165 case CODEC_ID_ADPCM_IMA_QT:
166 av_log(avctx, AV_LOG_ERROR, "ADPCM: codec adpcm_ima_qt unsupported for encoding !\n");
167 avctx->frame_size = 64; /* XXX: can multiple of avctx->channels * 64 (left and right blocks are interleaved) */
170 case CODEC_ID_ADPCM_IMA_WAV:
171 avctx->frame_size = (BLKSIZE - 4 * avctx->channels) * 8 / (4 * avctx->channels) + 1; /* each 16 bits sample gives one nibble */
172 /* and we have 4 bytes per channel overhead */
173 avctx->block_align = BLKSIZE;
174 /* seems frame_size isn't taken into account... have to buffer the samples :-( */
176 case CODEC_ID_ADPCM_MS:
177 avctx->frame_size = (BLKSIZE - 7 * avctx->channels) * 2 / avctx->channels + 2; /* each 16 bits sample gives one nibble */
178 /* and we have 7 bytes per channel overhead */
179 avctx->block_align = BLKSIZE;
181 case CODEC_ID_ADPCM_YAMAHA:
182 avctx->frame_size = BLKSIZE * avctx->channels;
183 avctx->block_align = BLKSIZE;
190 avctx->coded_frame= avcodec_alloc_frame();
191 avctx->coded_frame->key_frame= 1;
196 static int adpcm_encode_close(AVCodecContext *avctx)
198 av_freep(&avctx->coded_frame);
204 static inline unsigned char adpcm_ima_compress_sample(ADPCMChannelStatus *c, short sample)
206 int delta = sample - c->prev_sample;
207 int nibble = FFMIN(7, abs(delta)*4/step_table[c->step_index]) + (delta<0)*8;
208 c->prev_sample = c->prev_sample + ((step_table[c->step_index] * yamaha_difflookup[nibble]) / 8);
209 CLAMP_TO_SHORT(c->prev_sample);
210 c->step_index = av_clip(c->step_index + index_table[nibble], 0, 88);
214 static inline unsigned char adpcm_ms_compress_sample(ADPCMChannelStatus *c, short sample)
216 int predictor, nibble, bias;
218 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;
220 nibble= sample - predictor;
221 if(nibble>=0) bias= c->idelta/2;
222 else bias=-c->idelta/2;
224 nibble= (nibble + bias) / c->idelta;
225 nibble= av_clip(nibble, -8, 7)&0x0F;
227 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
228 CLAMP_TO_SHORT(predictor);
230 c->sample2 = c->sample1;
231 c->sample1 = predictor;
233 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
234 if (c->idelta < 16) c->idelta = 16;
239 static inline unsigned char adpcm_yamaha_compress_sample(ADPCMChannelStatus *c, short sample)
248 delta = sample - c->predictor;
250 nibble = FFMIN(7, abs(delta)*4/c->step) + (delta<0)*8;
252 c->predictor = c->predictor + ((c->step * yamaha_difflookup[nibble]) / 8);
253 CLAMP_TO_SHORT(c->predictor);
254 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
255 c->step = av_clip(c->step, 127, 24567);
260 typedef struct TrellisPath {
265 typedef struct TrellisNode {
273 static void adpcm_compress_trellis(AVCodecContext *avctx, const short *samples,
274 uint8_t *dst, ADPCMChannelStatus *c, int n)
276 #define FREEZE_INTERVAL 128
277 //FIXME 6% faster if frontier is a compile-time constant
278 const int frontier = 1 << avctx->trellis;
279 const int stride = avctx->channels;
280 const int version = avctx->codec->id;
281 const int max_paths = frontier*FREEZE_INTERVAL;
282 TrellisPath paths[max_paths], *p;
283 TrellisNode node_buf[2][frontier];
284 TrellisNode *nodep_buf[2][frontier];
285 TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
286 TrellisNode **nodes_next = nodep_buf[1];
287 int pathn = 0, froze = -1, i, j, k;
289 assert(!(max_paths&(max_paths-1)));
291 memset(nodep_buf, 0, sizeof(nodep_buf));
292 nodes[0] = &node_buf[1][0];
295 nodes[0]->step = c->step_index;
296 nodes[0]->sample1 = c->sample1;
297 nodes[0]->sample2 = c->sample2;
298 if(version == CODEC_ID_ADPCM_IMA_WAV)
299 nodes[0]->sample1 = c->prev_sample;
300 if(version == CODEC_ID_ADPCM_MS)
301 nodes[0]->step = c->idelta;
302 if(version == CODEC_ID_ADPCM_YAMAHA) {
304 nodes[0]->step = 127;
305 nodes[0]->sample1 = 0;
307 nodes[0]->step = c->step;
308 nodes[0]->sample1 = c->predictor;
313 TrellisNode *t = node_buf[i&1];
315 int sample = samples[i*stride];
316 memset(nodes_next, 0, frontier*sizeof(TrellisNode*));
317 for(j=0; j<frontier && nodes[j]; j++) {
318 // higher j have higher ssd already, so they're unlikely to use a suboptimal next sample too
319 const int range = (j < frontier/2) ? 1 : 0;
320 const int step = nodes[j]->step;
322 if(version == CODEC_ID_ADPCM_MS) {
323 const int predictor = ((nodes[j]->sample1 * c->coeff1) + (nodes[j]->sample2 * c->coeff2)) / 256;
324 const int div = (sample - predictor) / step;
325 const int nmin = av_clip(div-range, -8, 6);
326 const int nmax = av_clip(div+range, -7, 7);
327 for(nidx=nmin; nidx<=nmax; nidx++) {
328 const int nibble = nidx & 0xf;
329 int dec_sample = predictor + nidx * step;
330 #define STORE_NODE(NAME, STEP_INDEX)\
333 CLAMP_TO_SHORT(dec_sample);\
334 d = sample - dec_sample;\
335 ssd = nodes[j]->ssd + d*d;\
336 if(nodes_next[frontier-1] && ssd >= nodes_next[frontier-1]->ssd)\
338 /* Collapse any two states with the same previous sample value. \
339 * One could also distinguish states by step and by 2nd to last
340 * sample, but the effects of that are negligible. */\
341 for(k=0; k<frontier && nodes_next[k]; k++) {\
342 if(dec_sample == nodes_next[k]->sample1) {\
343 assert(ssd >= nodes_next[k]->ssd);\
347 for(k=0; k<frontier; k++) {\
348 if(!nodes_next[k] || ssd < nodes_next[k]->ssd) {\
349 TrellisNode *u = nodes_next[frontier-1];\
351 assert(pathn < max_paths);\
356 u->step = STEP_INDEX;\
357 u->sample2 = nodes[j]->sample1;\
358 u->sample1 = dec_sample;\
359 paths[u->path].nibble = nibble;\
360 paths[u->path].prev = nodes[j]->path;\
361 memmove(&nodes_next[k+1], &nodes_next[k], (frontier-k-1)*sizeof(TrellisNode*));\
367 STORE_NODE(ms, FFMAX(16, (AdaptationTable[nibble] * step) >> 8));
369 } else if(version == CODEC_ID_ADPCM_IMA_WAV) {
370 #define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\
371 const int predictor = nodes[j]->sample1;\
372 const int div = (sample - predictor) * 4 / STEP_TABLE;\
373 int nmin = av_clip(div-range, -7, 6);\
374 int nmax = av_clip(div+range, -6, 7);\
375 if(nmin<=0) nmin--; /* distinguish -0 from +0 */\
377 for(nidx=nmin; nidx<=nmax; nidx++) {\
378 const int nibble = nidx<0 ? 7-nidx : nidx;\
379 int dec_sample = predictor + (STEP_TABLE * yamaha_difflookup[nibble]) / 8;\
380 STORE_NODE(NAME, STEP_INDEX);\
382 LOOP_NODES(ima, step_table[step], av_clip(step + index_table[nibble], 0, 88));
383 } else { //CODEC_ID_ADPCM_YAMAHA
384 LOOP_NODES(yamaha, step, av_clip((step * yamaha_indexscale[nibble]) >> 8, 127, 24567));
395 if(nodes[0]->ssd > (1<<28)) {
396 for(j=1; j<frontier && nodes[j]; j++)
397 nodes[j]->ssd -= nodes[0]->ssd;
401 // merge old paths to save memory
402 if(i == froze + FREEZE_INTERVAL) {
403 p = &paths[nodes[0]->path];
404 for(k=i; k>froze; k--) {
410 // other nodes might use paths that don't coincide with the frozen one.
411 // checking which nodes do so is too slow, so just kill them all.
412 // this also slightly improves quality, but I don't know why.
413 memset(nodes+1, 0, (frontier-1)*sizeof(TrellisNode*));
417 p = &paths[nodes[0]->path];
418 for(i=n-1; i>froze; i--) {
423 c->predictor = nodes[0]->sample1;
424 c->sample1 = nodes[0]->sample1;
425 c->sample2 = nodes[0]->sample2;
426 c->step_index = nodes[0]->step;
427 c->step = nodes[0]->step;
428 c->idelta = nodes[0]->step;
431 static int adpcm_encode_frame(AVCodecContext *avctx,
432 unsigned char *frame, int buf_size, void *data)
437 ADPCMContext *c = avctx->priv_data;
440 samples = (short *)data;
441 st= avctx->channels == 2;
442 /* n = (BLKSIZE - 4 * avctx->channels) / (2 * 8 * avctx->channels); */
444 switch(avctx->codec->id) {
445 case CODEC_ID_ADPCM_IMA_QT: /* XXX: can't test until we get .mov writer */
447 case CODEC_ID_ADPCM_IMA_WAV:
448 n = avctx->frame_size / 8;
449 c->status[0].prev_sample = (signed short)samples[0]; /* XXX */
450 /* c->status[0].step_index = 0; *//* XXX: not sure how to init the state machine */
451 *dst++ = (c->status[0].prev_sample) & 0xFF; /* little endian */
452 *dst++ = (c->status[0].prev_sample >> 8) & 0xFF;
453 *dst++ = (unsigned char)c->status[0].step_index;
454 *dst++ = 0; /* unknown */
456 if (avctx->channels == 2) {
457 c->status[1].prev_sample = (signed short)samples[1];
458 /* c->status[1].step_index = 0; */
459 *dst++ = (c->status[1].prev_sample) & 0xFF;
460 *dst++ = (c->status[1].prev_sample >> 8) & 0xFF;
461 *dst++ = (unsigned char)c->status[1].step_index;
466 /* stereo: 4 bytes (8 samples) for left, 4 bytes for right, 4 bytes left, ... */
467 if(avctx->trellis > 0) {
469 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n*8);
470 if(avctx->channels == 2)
471 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n*8);
473 *dst++ = buf[0][8*i+0] | (buf[0][8*i+1] << 4);
474 *dst++ = buf[0][8*i+2] | (buf[0][8*i+3] << 4);
475 *dst++ = buf[0][8*i+4] | (buf[0][8*i+5] << 4);
476 *dst++ = buf[0][8*i+6] | (buf[0][8*i+7] << 4);
477 if (avctx->channels == 2) {
478 *dst++ = buf[1][8*i+0] | (buf[1][8*i+1] << 4);
479 *dst++ = buf[1][8*i+2] | (buf[1][8*i+3] << 4);
480 *dst++ = buf[1][8*i+4] | (buf[1][8*i+5] << 4);
481 *dst++ = buf[1][8*i+6] | (buf[1][8*i+7] << 4);
486 *dst = adpcm_ima_compress_sample(&c->status[0], samples[0]) & 0x0F;
487 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels]) << 4) & 0xF0;
489 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 2]) & 0x0F;
490 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 3]) << 4) & 0xF0;
492 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 4]) & 0x0F;
493 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 5]) << 4) & 0xF0;
495 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 6]) & 0x0F;
496 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 7]) << 4) & 0xF0;
499 if (avctx->channels == 2) {
500 *dst = adpcm_ima_compress_sample(&c->status[1], samples[1]);
501 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[3]) << 4;
503 *dst = adpcm_ima_compress_sample(&c->status[1], samples[5]);
504 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[7]) << 4;
506 *dst = adpcm_ima_compress_sample(&c->status[1], samples[9]);
507 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[11]) << 4;
509 *dst = adpcm_ima_compress_sample(&c->status[1], samples[13]);
510 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[15]) << 4;
513 samples += 8 * avctx->channels;
516 case CODEC_ID_ADPCM_MS:
517 for(i=0; i<avctx->channels; i++){
521 c->status[i].coeff1 = AdaptCoeff1[predictor];
522 c->status[i].coeff2 = AdaptCoeff2[predictor];
524 for(i=0; i<avctx->channels; i++){
525 if (c->status[i].idelta < 16)
526 c->status[i].idelta = 16;
528 *dst++ = c->status[i].idelta & 0xFF;
529 *dst++ = c->status[i].idelta >> 8;
531 for(i=0; i<avctx->channels; i++){
532 c->status[i].sample1= *samples++;
534 *dst++ = c->status[i].sample1 & 0xFF;
535 *dst++ = c->status[i].sample1 >> 8;
537 for(i=0; i<avctx->channels; i++){
538 c->status[i].sample2= *samples++;
540 *dst++ = c->status[i].sample2 & 0xFF;
541 *dst++ = c->status[i].sample2 >> 8;
544 if(avctx->trellis > 0) {
545 int n = avctx->block_align - 7*avctx->channels;
547 if(avctx->channels == 1) {
549 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
551 *dst++ = (buf[0][i] << 4) | buf[0][i+1];
553 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
554 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
556 *dst++ = (buf[0][i] << 4) | buf[1][i];
559 for(i=7*avctx->channels; i<avctx->block_align; i++) {
561 nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++)<<4;
562 nibble|= adpcm_ms_compress_sample(&c->status[st], *samples++);
566 case CODEC_ID_ADPCM_YAMAHA:
567 n = avctx->frame_size / 2;
568 if(avctx->trellis > 0) {
571 if(avctx->channels == 1) {
572 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
574 *dst++ = buf[0][i] | (buf[0][i+1] << 4);
576 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
577 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
579 *dst++ = buf[0][i] | (buf[1][i] << 4);
583 for(i = 0; i < avctx->channels; i++) {
585 nibble = adpcm_yamaha_compress_sample(&c->status[i], samples[i]);
586 nibble |= adpcm_yamaha_compress_sample(&c->status[i], samples[i+avctx->channels]) << 4;
589 samples += 2 * avctx->channels;
597 #endif //CONFIG_ENCODERS
599 static int adpcm_decode_init(AVCodecContext * avctx)
601 ADPCMContext *c = avctx->priv_data;
603 if(avctx->channels > 2U){
608 c->status[0].predictor = c->status[1].predictor = 0;
609 c->status[0].step_index = c->status[1].step_index = 0;
610 c->status[0].step = c->status[1].step = 0;
612 switch(avctx->codec->id) {
613 case CODEC_ID_ADPCM_CT:
614 c->status[0].step = c->status[1].step = 511;
616 case CODEC_ID_ADPCM_IMA_WS:
617 if (avctx->extradata && avctx->extradata_size == 2 * 4) {
618 c->status[0].predictor = AV_RL32(avctx->extradata);
619 c->status[1].predictor = AV_RL32(avctx->extradata + 4);
628 static inline short adpcm_ima_expand_nibble(ADPCMChannelStatus *c, char nibble, int shift)
632 int sign, delta, diff, step;
634 step = step_table[c->step_index];
635 step_index = c->step_index + index_table[(unsigned)nibble];
636 if (step_index < 0) step_index = 0;
637 else if (step_index > 88) step_index = 88;
641 /* perform direct multiplication instead of series of jumps proposed by
642 * the reference ADPCM implementation since modern CPUs can do the mults
644 diff = ((2 * delta + 1) * step) >> shift;
645 predictor = c->predictor;
646 if (sign) predictor -= diff;
647 else predictor += diff;
649 CLAMP_TO_SHORT(predictor);
650 c->predictor = predictor;
651 c->step_index = step_index;
653 return (short)predictor;
656 static inline short adpcm_ms_expand_nibble(ADPCMChannelStatus *c, char nibble)
660 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;
661 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
662 CLAMP_TO_SHORT(predictor);
664 c->sample2 = c->sample1;
665 c->sample1 = predictor;
666 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
667 if (c->idelta < 16) c->idelta = 16;
669 return (short)predictor;
672 static inline short adpcm_ct_expand_nibble(ADPCMChannelStatus *c, char nibble)
675 int sign, delta, diff;
680 /* perform direct multiplication instead of series of jumps proposed by
681 * the reference ADPCM implementation since modern CPUs can do the mults
683 diff = ((2 * delta + 1) * c->step) >> 3;
684 predictor = c->predictor;
685 /* predictor update is not so trivial: predictor is multiplied on 254/256 before updating */
687 predictor = ((predictor * 254) >> 8) - diff;
689 predictor = ((predictor * 254) >> 8) + diff;
690 /* calculate new step and clamp it to range 511..32767 */
691 new_step = (ct_adpcm_table[nibble & 7] * c->step) >> 8;
698 CLAMP_TO_SHORT(predictor);
699 c->predictor = predictor;
700 return (short)predictor;
703 static inline short adpcm_sbpro_expand_nibble(ADPCMChannelStatus *c, char nibble, int size, int shift)
705 int sign, delta, diff;
707 sign = nibble & (1<<(size-1));
708 delta = nibble & ((1<<(size-1))-1);
709 diff = delta << (7 + c->step + shift);
712 c->predictor -= diff;
714 c->predictor += diff;
717 if (c->predictor > 16256)
718 c->predictor = 16256;
719 else if (c->predictor < -16384)
720 c->predictor = -16384;
722 /* calculate new step */
723 if (delta >= (2*size - 3) && c->step < 3)
725 else if (delta == 0 && c->step > 0)
728 return (short) c->predictor;
731 static inline short adpcm_yamaha_expand_nibble(ADPCMChannelStatus *c, unsigned char nibble)
738 c->predictor += (c->step * yamaha_difflookup[nibble]) / 8;
739 CLAMP_TO_SHORT(c->predictor);
740 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
741 c->step = av_clip(c->step, 127, 24567);
745 static void xa_decode(short *out, const unsigned char *in,
746 ADPCMChannelStatus *left, ADPCMChannelStatus *right, int inc)
749 int shift,filter,f0,f1;
755 shift = 12 - (in[4+i*2] & 15);
756 filter = in[4+i*2] >> 4;
757 f0 = xa_adpcm_table[filter][0];
758 f1 = xa_adpcm_table[filter][1];
766 t = (signed char)(d<<4)>>4;
767 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
775 if (inc==2) { /* stereo */
778 s_1 = right->sample1;
779 s_2 = right->sample2;
780 out = out + 1 - 28*2;
783 shift = 12 - (in[5+i*2] & 15);
784 filter = in[5+i*2] >> 4;
786 f0 = xa_adpcm_table[filter][0];
787 f1 = xa_adpcm_table[filter][1];
792 t = (signed char)d >> 4;
793 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
801 if (inc==2) { /* stereo */
802 right->sample1 = s_1;
803 right->sample2 = s_2;
813 /* DK3 ADPCM support macro */
814 #define DK3_GET_NEXT_NIBBLE() \
815 if (decode_top_nibble_next) \
817 nibble = (last_byte >> 4) & 0x0F; \
818 decode_top_nibble_next = 0; \
822 last_byte = *src++; \
823 if (src >= buf + buf_size) break; \
824 nibble = last_byte & 0x0F; \
825 decode_top_nibble_next = 1; \
828 static int adpcm_decode_frame(AVCodecContext *avctx,
829 void *data, int *data_size,
830 uint8_t *buf, int buf_size)
832 ADPCMContext *c = avctx->priv_data;
833 ADPCMChannelStatus *cs;
834 int n, m, channel, i;
835 int block_predictor[2];
841 /* DK3 ADPCM accounting variables */
842 unsigned char last_byte = 0;
843 unsigned char nibble;
844 int decode_top_nibble_next = 0;
847 /* EA ADPCM state variables */
848 uint32_t samples_in_chunk;
849 int32_t previous_left_sample, previous_right_sample;
850 int32_t current_left_sample, current_right_sample;
851 int32_t next_left_sample, next_right_sample;
852 int32_t coeff1l, coeff2l, coeff1r, coeff2r;
853 uint8_t shift_left, shift_right;
859 //should protect all 4bit ADPCM variants
860 //8 is needed for CODEC_ID_ADPCM_IMA_WAV with 2 channels
862 if(*data_size/4 < buf_size + 8)
866 samples_end= samples + *data_size/2;
870 st = avctx->channels == 2 ? 1 : 0;
872 switch(avctx->codec->id) {
873 case CODEC_ID_ADPCM_IMA_QT:
874 n = (buf_size - 2);/* >> 2*avctx->channels;*/
875 channel = c->channel;
876 cs = &(c->status[channel]);
877 /* (pppppp) (piiiiiii) */
879 /* Bits 15-7 are the _top_ 9 bits of the 16-bit initial predictor value */
880 cs->predictor = (*src++) << 8;
881 cs->predictor |= (*src & 0x80);
882 cs->predictor &= 0xFF80;
885 if(cs->predictor & 0x8000)
886 cs->predictor -= 0x10000;
888 CLAMP_TO_SHORT(cs->predictor);
890 cs->step_index = (*src++) & 0x7F;
892 if (cs->step_index > 88){
893 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
897 cs->step = step_table[cs->step_index];
902 for(m=32; n>0 && m>0; n--, m--) { /* in QuickTime, IMA is encoded by chuncks of 34 bytes (=64 samples) */
903 *samples = adpcm_ima_expand_nibble(cs, src[0] & 0x0F, 3);
904 samples += avctx->channels;
905 *samples = adpcm_ima_expand_nibble(cs, (src[0] >> 4) & 0x0F, 3);
906 samples += avctx->channels;
910 if(st) { /* handle stereo interlacing */
911 c->channel = (channel + 1) % 2; /* we get one packet for left, then one for right data */
912 if(channel == 1) { /* wait for the other packet before outputing anything */
917 case CODEC_ID_ADPCM_IMA_WAV:
918 if (avctx->block_align != 0 && buf_size > avctx->block_align)
919 buf_size = avctx->block_align;
921 // samples_per_block= (block_align-4*chanels)*8 / (bits_per_sample * chanels) + 1;
923 for(i=0; i<avctx->channels; i++){
924 cs = &(c->status[i]);
925 cs->predictor = (int16_t)(src[0] + (src[1]<<8));
928 // XXX: is this correct ??: *samples++ = cs->predictor;
930 cs->step_index = *src++;
931 if (cs->step_index > 88){
932 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
935 if (*src++) av_log(avctx, AV_LOG_ERROR, "unused byte should be null but is %d!!\n", src[-1]); /* unused */
938 while(src < buf + buf_size){
941 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] & 0x0F, 3);
943 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] >> 4 , 3);
949 case CODEC_ID_ADPCM_4XM:
950 cs = &(c->status[0]);
951 c->status[0].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
953 c->status[1].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
955 c->status[0].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
957 c->status[1].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
959 if (cs->step_index < 0) cs->step_index = 0;
960 if (cs->step_index > 88) cs->step_index = 88;
962 m= (buf_size - (src - buf))>>st;
964 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] & 0x0F, 4);
966 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] & 0x0F, 4);
967 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] >> 4, 4);
969 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] >> 4, 4);
975 case CODEC_ID_ADPCM_MS:
976 if (avctx->block_align != 0 && buf_size > avctx->block_align)
977 buf_size = avctx->block_align;
978 n = buf_size - 7 * avctx->channels;
981 block_predictor[0] = av_clip(*src++, 0, 7);
982 block_predictor[1] = 0;
984 block_predictor[1] = av_clip(*src++, 0, 7);
985 c->status[0].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
988 c->status[1].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
991 c->status[0].coeff1 = AdaptCoeff1[block_predictor[0]];
992 c->status[0].coeff2 = AdaptCoeff2[block_predictor[0]];
993 c->status[1].coeff1 = AdaptCoeff1[block_predictor[1]];
994 c->status[1].coeff2 = AdaptCoeff2[block_predictor[1]];
996 c->status[0].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
998 if (st) c->status[1].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1000 c->status[0].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1002 if (st) c->status[1].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1005 *samples++ = c->status[0].sample1;
1006 if (st) *samples++ = c->status[1].sample1;
1007 *samples++ = c->status[0].sample2;
1008 if (st) *samples++ = c->status[1].sample2;
1010 *samples++ = adpcm_ms_expand_nibble(&c->status[0], (src[0] >> 4) & 0x0F);
1011 *samples++ = adpcm_ms_expand_nibble(&c->status[st], src[0] & 0x0F);
1015 case CODEC_ID_ADPCM_IMA_DK4:
1016 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1017 buf_size = avctx->block_align;
1019 c->status[0].predictor = (int16_t)(src[0] | (src[1] << 8));
1020 c->status[0].step_index = src[2];
1022 *samples++ = c->status[0].predictor;
1024 c->status[1].predictor = (int16_t)(src[0] | (src[1] << 8));
1025 c->status[1].step_index = src[2];
1027 *samples++ = c->status[1].predictor;
1029 while (src < buf + buf_size) {
1031 /* take care of the top nibble (always left or mono channel) */
1032 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1033 (src[0] >> 4) & 0x0F, 3);
1035 /* take care of the bottom nibble, which is right sample for
1036 * stereo, or another mono sample */
1038 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1041 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1047 case CODEC_ID_ADPCM_IMA_DK3:
1048 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1049 buf_size = avctx->block_align;
1051 if(buf_size + 16 > (samples_end - samples)*3/8)
1054 c->status[0].predictor = (int16_t)(src[10] | (src[11] << 8));
1055 c->status[1].predictor = (int16_t)(src[12] | (src[13] << 8));
1056 c->status[0].step_index = src[14];
1057 c->status[1].step_index = src[15];
1058 /* sign extend the predictors */
1060 diff_channel = c->status[1].predictor;
1062 /* the DK3_GET_NEXT_NIBBLE macro issues the break statement when
1063 * the buffer is consumed */
1066 /* for this algorithm, c->status[0] is the sum channel and
1067 * c->status[1] is the diff channel */
1069 /* process the first predictor of the sum channel */
1070 DK3_GET_NEXT_NIBBLE();
1071 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1073 /* process the diff channel predictor */
1074 DK3_GET_NEXT_NIBBLE();
1075 adpcm_ima_expand_nibble(&c->status[1], nibble, 3);
1077 /* process the first pair of stereo PCM samples */
1078 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1079 *samples++ = c->status[0].predictor + c->status[1].predictor;
1080 *samples++ = c->status[0].predictor - c->status[1].predictor;
1082 /* process the second predictor of the sum channel */
1083 DK3_GET_NEXT_NIBBLE();
1084 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1086 /* process the second pair of stereo PCM samples */
1087 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1088 *samples++ = c->status[0].predictor + c->status[1].predictor;
1089 *samples++ = c->status[0].predictor - c->status[1].predictor;
1092 case CODEC_ID_ADPCM_IMA_WS:
1093 /* no per-block initialization; just start decoding the data */
1094 while (src < buf + buf_size) {
1097 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1098 (src[0] >> 4) & 0x0F, 3);
1099 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1102 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1103 (src[0] >> 4) & 0x0F, 3);
1104 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1111 case CODEC_ID_ADPCM_XA:
1112 c->status[0].sample1 = c->status[0].sample2 =
1113 c->status[1].sample1 = c->status[1].sample2 = 0;
1114 while (buf_size >= 128) {
1115 xa_decode(samples, src, &c->status[0], &c->status[1],
1122 case CODEC_ID_ADPCM_EA:
1123 samples_in_chunk = AV_RL32(src);
1124 if (samples_in_chunk >= ((buf_size - 12) * 2)) {
1129 current_left_sample = (int16_t)AV_RL16(src);
1131 previous_left_sample = (int16_t)AV_RL16(src);
1133 current_right_sample = (int16_t)AV_RL16(src);
1135 previous_right_sample = (int16_t)AV_RL16(src);
1138 for (count1 = 0; count1 < samples_in_chunk/28;count1++) {
1139 coeff1l = ea_adpcm_table[(*src >> 4) & 0x0F];
1140 coeff2l = ea_adpcm_table[((*src >> 4) & 0x0F) + 4];
1141 coeff1r = ea_adpcm_table[*src & 0x0F];
1142 coeff2r = ea_adpcm_table[(*src & 0x0F) + 4];
1145 shift_left = ((*src >> 4) & 0x0F) + 8;
1146 shift_right = (*src & 0x0F) + 8;
1149 for (count2 = 0; count2 < 28; count2++) {
1150 next_left_sample = (((*src & 0xF0) << 24) >> shift_left);
1151 next_right_sample = (((*src & 0x0F) << 28) >> shift_right);
1154 next_left_sample = (next_left_sample +
1155 (current_left_sample * coeff1l) +
1156 (previous_left_sample * coeff2l) + 0x80) >> 8;
1157 next_right_sample = (next_right_sample +
1158 (current_right_sample * coeff1r) +
1159 (previous_right_sample * coeff2r) + 0x80) >> 8;
1160 CLAMP_TO_SHORT(next_left_sample);
1161 CLAMP_TO_SHORT(next_right_sample);
1163 previous_left_sample = current_left_sample;
1164 current_left_sample = next_left_sample;
1165 previous_right_sample = current_right_sample;
1166 current_right_sample = next_right_sample;
1167 *samples++ = (unsigned short)current_left_sample;
1168 *samples++ = (unsigned short)current_right_sample;
1172 case CODEC_ID_ADPCM_IMA_SMJPEG:
1173 c->status[0].predictor = *src;
1175 c->status[0].step_index = *src++;
1176 src++; /* skip another byte before getting to the meat */
1177 while (src < buf + buf_size) {
1178 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1180 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1181 (*src >> 4) & 0x0F, 3);
1185 case CODEC_ID_ADPCM_CT:
1186 while (src < buf + buf_size) {
1188 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1189 (src[0] >> 4) & 0x0F);
1190 *samples++ = adpcm_ct_expand_nibble(&c->status[1],
1193 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1194 (src[0] >> 4) & 0x0F);
1195 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1201 case CODEC_ID_ADPCM_SBPRO_4:
1202 case CODEC_ID_ADPCM_SBPRO_3:
1203 case CODEC_ID_ADPCM_SBPRO_2:
1204 if (!c->status[0].step_index) {
1205 /* the first byte is a raw sample */
1206 *samples++ = 128 * (*src++ - 0x80);
1208 *samples++ = 128 * (*src++ - 0x80);
1209 c->status[0].step_index = 1;
1211 if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_4) {
1212 while (src < buf + buf_size) {
1213 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1214 (src[0] >> 4) & 0x0F, 4, 0);
1215 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1216 src[0] & 0x0F, 4, 0);
1219 } else if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_3) {
1220 while (src < buf + buf_size && samples + 2 < samples_end) {
1221 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1222 (src[0] >> 5) & 0x07, 3, 0);
1223 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1224 (src[0] >> 2) & 0x07, 3, 0);
1225 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1226 src[0] & 0x03, 2, 0);
1230 while (src < buf + buf_size && samples + 3 < samples_end) {
1231 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1232 (src[0] >> 6) & 0x03, 2, 2);
1233 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1234 (src[0] >> 4) & 0x03, 2, 2);
1235 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1236 (src[0] >> 2) & 0x03, 2, 2);
1237 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1238 src[0] & 0x03, 2, 2);
1243 case CODEC_ID_ADPCM_SWF:
1247 int k0, signmask, nb_bits;
1248 int size = buf_size*8;
1250 init_get_bits(&gb, buf, size);
1252 //read bits & inital values
1253 nb_bits = get_bits(&gb, 2)+2;
1254 //av_log(NULL,AV_LOG_INFO,"nb_bits: %d\n", nb_bits);
1255 table = swf_index_tables[nb_bits-2];
1256 k0 = 1 << (nb_bits-2);
1257 signmask = 1 << (nb_bits-1);
1259 for (i = 0; i < avctx->channels; i++) {
1260 *samples++ = c->status[i].predictor = get_sbits(&gb, 16);
1261 c->status[i].step_index = get_bits(&gb, 6);
1264 while (get_bits_count(&gb) < size)
1268 for (i = 0; i < avctx->channels; i++) {
1269 // similar to IMA adpcm
1270 int delta = get_bits(&gb, nb_bits);
1271 int step = step_table[c->status[i].step_index];
1272 long vpdiff = 0; // vpdiff = (delta+0.5)*step/4
1283 if (delta & signmask)
1284 c->status[i].predictor -= vpdiff;
1286 c->status[i].predictor += vpdiff;
1288 c->status[i].step_index += table[delta & (~signmask)];
1290 c->status[i].step_index = av_clip(c->status[i].step_index, 0, 88);
1291 c->status[i].predictor = av_clip(c->status[i].predictor, -32768, 32767);
1293 *samples++ = c->status[i].predictor;
1294 if (samples >= samples_end) {
1295 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1303 case CODEC_ID_ADPCM_YAMAHA:
1304 while (src < buf + buf_size) {
1306 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1308 *samples++ = adpcm_yamaha_expand_nibble(&c->status[1],
1309 (src[0] >> 4) & 0x0F);
1311 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1313 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1314 (src[0] >> 4) & 0x0F);
1319 case CODEC_ID_ADPCM_THP:
1322 unsigned int samplecnt;
1326 if (buf_size < 80) {
1327 av_log(avctx, AV_LOG_ERROR, "frame too small\n");
1332 samplecnt = bytestream_get_be32(&src);
1334 for (i = 0; i < 32; i++)
1335 table[0][i] = (int16_t)bytestream_get_be16(&src);
1337 /* Initialize the previous sample. */
1338 for (i = 0; i < 4; i++)
1339 prev[0][i] = (int16_t)bytestream_get_be16(&src);
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 int index = (*src >> 4) & 7;
1352 unsigned int exp = 28 - (*src++ & 15);
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++) {
1359 if(n&1) sampledat= *src++ <<28;
1360 else sampledat= (*src&0xF0)<<24;
1362 *samples = ((prev[ch][0]*factor1
1363 + prev[ch][1]*factor2) >> 11) + (sampledat>>exp);
1364 prev[ch][1] = prev[ch][0];
1365 prev[ch][0] = *samples++;
1367 /* In case of stereo, skip one sample, this sample
1368 is for the other channel. */
1374 /* In the previous loop, in case stereo is used, samples is
1375 increased exactly one time too often. */
1383 *data_size = (uint8_t *)samples - (uint8_t *)data;
1389 #ifdef CONFIG_ENCODERS
1390 #define ADPCM_ENCODER(id,name) \
1391 AVCodec name ## _encoder = { \
1395 sizeof(ADPCMContext), \
1396 adpcm_encode_init, \
1397 adpcm_encode_frame, \
1398 adpcm_encode_close, \
1402 #define ADPCM_ENCODER(id,name)
1405 #ifdef CONFIG_DECODERS
1406 #define ADPCM_DECODER(id,name) \
1407 AVCodec name ## _decoder = { \
1411 sizeof(ADPCMContext), \
1412 adpcm_decode_init, \
1415 adpcm_decode_frame, \
1418 #define ADPCM_DECODER(id,name)
1421 #define ADPCM_CODEC(id, name) \
1422 ADPCM_ENCODER(id,name) ADPCM_DECODER(id,name)
1424 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt);
1425 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav);
1426 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3);
1427 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4);
1428 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws);
1429 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg);
1430 ADPCM_CODEC(CODEC_ID_ADPCM_MS, adpcm_ms);
1431 ADPCM_CODEC(CODEC_ID_ADPCM_4XM, adpcm_4xm);
1432 ADPCM_CODEC(CODEC_ID_ADPCM_XA, adpcm_xa);
1433 ADPCM_CODEC(CODEC_ID_ADPCM_EA, adpcm_ea);
1434 ADPCM_CODEC(CODEC_ID_ADPCM_CT, adpcm_ct);
1435 ADPCM_CODEC(CODEC_ID_ADPCM_SWF, adpcm_swf);
1436 ADPCM_CODEC(CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha);
1437 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4);
1438 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3);
1439 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2);
1440 ADPCM_CODEC(CODEC_ID_ADPCM_THP, adpcm_thp);