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 /* step_table[] and index_table[] are from the ADPCM reference source */
54 /* This is the index table: */
55 static const int index_table[16] = {
56 -1, -1, -1, -1, 2, 4, 6, 8,
57 -1, -1, -1, -1, 2, 4, 6, 8,
61 * This is the step table. Note that many programs use slight deviations from
62 * this table, but such deviations are negligible:
64 static const int step_table[89] = {
65 7, 8, 9, 10, 11, 12, 13, 14, 16, 17,
66 19, 21, 23, 25, 28, 31, 34, 37, 41, 45,
67 50, 55, 60, 66, 73, 80, 88, 97, 107, 118,
68 130, 143, 157, 173, 190, 209, 230, 253, 279, 307,
69 337, 371, 408, 449, 494, 544, 598, 658, 724, 796,
70 876, 963, 1060, 1166, 1282, 1411, 1552, 1707, 1878, 2066,
71 2272, 2499, 2749, 3024, 3327, 3660, 4026, 4428, 4871, 5358,
72 5894, 6484, 7132, 7845, 8630, 9493, 10442, 11487, 12635, 13899,
73 15289, 16818, 18500, 20350, 22385, 24623, 27086, 29794, 32767
76 /* These are for MS-ADPCM */
77 /* AdaptationTable[], AdaptCoeff1[], and AdaptCoeff2[] are from libsndfile */
78 static const int AdaptationTable[] = {
79 230, 230, 230, 230, 307, 409, 512, 614,
80 768, 614, 512, 409, 307, 230, 230, 230
83 static const int AdaptCoeff1[] = {
84 256, 512, 0, 192, 240, 460, 392
87 static const int AdaptCoeff2[] = {
88 0, -256, 0, 64, 0, -208, -232
91 /* These are for CD-ROM XA ADPCM */
92 static const int xa_adpcm_table[5][2] = {
100 static const int ea_adpcm_table[] = {
101 0, 240, 460, 392, 0, 0, -208, -220, 0, 1,
102 3, 4, 7, 8, 10, 11, 0, -1, -3, -4
105 static const int ct_adpcm_table[8] = {
106 0x00E6, 0x00E6, 0x00E6, 0x00E6,
107 0x0133, 0x0199, 0x0200, 0x0266
110 // padded to zero where table size is less then 16
111 static const int swf_index_tables[4][16] = {
113 /*3*/ { -1, -1, 2, 4 },
114 /*4*/ { -1, -1, -1, -1, 2, 4, 6, 8 },
115 /*5*/ { -1, -1, -1, -1, -1, -1, -1, -1, 1, 2, 4, 6, 8, 10, 13, 16 }
118 static const int yamaha_indexscale[] = {
119 230, 230, 230, 230, 307, 409, 512, 614,
120 230, 230, 230, 230, 307, 409, 512, 614
123 static const int yamaha_difflookup[] = {
124 1, 3, 5, 7, 9, 11, 13, 15,
125 -1, -3, -5, -7, -9, -11, -13, -15
130 typedef struct ADPCMChannelStatus {
132 short int step_index;
143 } ADPCMChannelStatus;
145 typedef struct ADPCMContext {
146 int channel; /* for stereo MOVs, decode left, then decode right, then tell it's decoded */
147 ADPCMChannelStatus status[2];
150 /* XXX: implement encoding */
152 #ifdef CONFIG_ENCODERS
153 static int adpcm_encode_init(AVCodecContext *avctx)
155 if (avctx->channels > 2)
156 return -1; /* only stereo or mono =) */
157 switch(avctx->codec->id) {
158 case CODEC_ID_ADPCM_IMA_QT:
159 av_log(avctx, AV_LOG_ERROR, "ADPCM: codec adpcm_ima_qt unsupported for encoding !\n");
160 avctx->frame_size = 64; /* XXX: can multiple of avctx->channels * 64 (left and right blocks are interleaved) */
163 case CODEC_ID_ADPCM_IMA_WAV:
164 avctx->frame_size = (BLKSIZE - 4 * avctx->channels) * 8 / (4 * avctx->channels) + 1; /* each 16 bits sample gives one nibble */
165 /* and we have 4 bytes per channel overhead */
166 avctx->block_align = BLKSIZE;
167 /* seems frame_size isn't taken into account... have to buffer the samples :-( */
169 case CODEC_ID_ADPCM_MS:
170 avctx->frame_size = (BLKSIZE - 7 * avctx->channels) * 2 / avctx->channels + 2; /* each 16 bits sample gives one nibble */
171 /* and we have 7 bytes per channel overhead */
172 avctx->block_align = BLKSIZE;
174 case CODEC_ID_ADPCM_YAMAHA:
175 avctx->frame_size = BLKSIZE * avctx->channels;
176 avctx->block_align = BLKSIZE;
178 case CODEC_ID_ADPCM_SWF:
179 if (avctx->sample_rate != 11025 &&
180 avctx->sample_rate != 22050 &&
181 avctx->sample_rate != 44100) {
182 av_log(avctx, AV_LOG_ERROR, "Sample rate must be 11025, 22050 or 44100\n");
185 avctx->frame_size = 512 * (avctx->sample_rate / 11025);
192 avctx->coded_frame= avcodec_alloc_frame();
193 avctx->coded_frame->key_frame= 1;
198 static int adpcm_encode_close(AVCodecContext *avctx)
200 av_freep(&avctx->coded_frame);
206 static inline unsigned char adpcm_ima_compress_sample(ADPCMChannelStatus *c, short sample)
208 int delta = sample - c->prev_sample;
209 int nibble = FFMIN(7, abs(delta)*4/step_table[c->step_index]) + (delta<0)*8;
210 c->prev_sample += ((step_table[c->step_index] * yamaha_difflookup[nibble]) / 8);
211 c->prev_sample = av_clip_int16(c->prev_sample);
212 c->step_index = av_clip(c->step_index + index_table[nibble], 0, 88);
216 static inline unsigned char adpcm_ms_compress_sample(ADPCMChannelStatus *c, short sample)
218 int predictor, nibble, bias;
220 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;
222 nibble= sample - predictor;
223 if(nibble>=0) bias= c->idelta/2;
224 else bias=-c->idelta/2;
226 nibble= (nibble + bias) / c->idelta;
227 nibble= av_clip(nibble, -8, 7)&0x0F;
229 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
231 c->sample2 = c->sample1;
232 c->sample1 = av_clip_int16(predictor);
234 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
235 if (c->idelta < 16) c->idelta = 16;
240 static inline unsigned char adpcm_yamaha_compress_sample(ADPCMChannelStatus *c, short sample)
249 delta = sample - c->predictor;
251 nibble = FFMIN(7, abs(delta)*4/c->step) + (delta<0)*8;
253 c->predictor += ((c->step * yamaha_difflookup[nibble]) / 8);
254 c->predictor = av_clip_int16(c->predictor);
255 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
256 c->step = av_clip(c->step, 127, 24567);
261 typedef struct TrellisPath {
266 typedef struct TrellisNode {
274 static void adpcm_compress_trellis(AVCodecContext *avctx, const short *samples,
275 uint8_t *dst, ADPCMChannelStatus *c, int n)
277 #define FREEZE_INTERVAL 128
278 //FIXME 6% faster if frontier is a compile-time constant
279 const int frontier = 1 << avctx->trellis;
280 const int stride = avctx->channels;
281 const int version = avctx->codec->id;
282 const int max_paths = frontier*FREEZE_INTERVAL;
283 TrellisPath paths[max_paths], *p;
284 TrellisNode node_buf[2][frontier];
285 TrellisNode *nodep_buf[2][frontier];
286 TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
287 TrellisNode **nodes_next = nodep_buf[1];
288 int pathn = 0, froze = -1, i, j, k;
290 assert(!(max_paths&(max_paths-1)));
292 memset(nodep_buf, 0, sizeof(nodep_buf));
293 nodes[0] = &node_buf[1][0];
296 nodes[0]->step = c->step_index;
297 nodes[0]->sample1 = c->sample1;
298 nodes[0]->sample2 = c->sample2;
299 if((version == CODEC_ID_ADPCM_IMA_WAV) || (version == CODEC_ID_ADPCM_SWF))
300 nodes[0]->sample1 = c->prev_sample;
301 if(version == CODEC_ID_ADPCM_MS)
302 nodes[0]->step = c->idelta;
303 if(version == CODEC_ID_ADPCM_YAMAHA) {
305 nodes[0]->step = 127;
306 nodes[0]->sample1 = 0;
308 nodes[0]->step = c->step;
309 nodes[0]->sample1 = c->predictor;
314 TrellisNode *t = node_buf[i&1];
316 int sample = samples[i*stride];
317 memset(nodes_next, 0, frontier*sizeof(TrellisNode*));
318 for(j=0; j<frontier && nodes[j]; j++) {
319 // higher j have higher ssd already, so they're unlikely to use a suboptimal next sample too
320 const int range = (j < frontier/2) ? 1 : 0;
321 const int step = nodes[j]->step;
323 if(version == CODEC_ID_ADPCM_MS) {
324 const int predictor = ((nodes[j]->sample1 * c->coeff1) + (nodes[j]->sample2 * c->coeff2)) / 256;
325 const int div = (sample - predictor) / step;
326 const int nmin = av_clip(div-range, -8, 6);
327 const int nmax = av_clip(div+range, -7, 7);
328 for(nidx=nmin; nidx<=nmax; nidx++) {
329 const int nibble = nidx & 0xf;
330 int dec_sample = predictor + nidx * step;
331 #define STORE_NODE(NAME, STEP_INDEX)\
334 dec_sample = av_clip_int16(dec_sample);\
335 d = sample - dec_sample;\
336 ssd = nodes[j]->ssd + d*d;\
337 if(nodes_next[frontier-1] && ssd >= nodes_next[frontier-1]->ssd)\
339 /* Collapse any two states with the same previous sample value. \
340 * One could also distinguish states by step and by 2nd to last
341 * sample, but the effects of that are negligible. */\
342 for(k=0; k<frontier && nodes_next[k]; k++) {\
343 if(dec_sample == nodes_next[k]->sample1) {\
344 assert(ssd >= nodes_next[k]->ssd);\
348 for(k=0; k<frontier; k++) {\
349 if(!nodes_next[k] || ssd < nodes_next[k]->ssd) {\
350 TrellisNode *u = nodes_next[frontier-1];\
352 assert(pathn < max_paths);\
357 u->step = STEP_INDEX;\
358 u->sample2 = nodes[j]->sample1;\
359 u->sample1 = dec_sample;\
360 paths[u->path].nibble = nibble;\
361 paths[u->path].prev = nodes[j]->path;\
362 memmove(&nodes_next[k+1], &nodes_next[k], (frontier-k-1)*sizeof(TrellisNode*));\
368 STORE_NODE(ms, FFMAX(16, (AdaptationTable[nibble] * step) >> 8));
370 } else if((version == CODEC_ID_ADPCM_IMA_WAV)|| (version == CODEC_ID_ADPCM_SWF)) {
371 #define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\
372 const int predictor = nodes[j]->sample1;\
373 const int div = (sample - predictor) * 4 / STEP_TABLE;\
374 int nmin = av_clip(div-range, -7, 6);\
375 int nmax = av_clip(div+range, -6, 7);\
376 if(nmin<=0) nmin--; /* distinguish -0 from +0 */\
378 for(nidx=nmin; nidx<=nmax; nidx++) {\
379 const int nibble = nidx<0 ? 7-nidx : nidx;\
380 int dec_sample = predictor + (STEP_TABLE * yamaha_difflookup[nibble]) / 8;\
381 STORE_NODE(NAME, STEP_INDEX);\
383 LOOP_NODES(ima, step_table[step], av_clip(step + index_table[nibble], 0, 88));
384 } else { //CODEC_ID_ADPCM_YAMAHA
385 LOOP_NODES(yamaha, step, av_clip((step * yamaha_indexscale[nibble]) >> 8, 127, 24567));
396 if(nodes[0]->ssd > (1<<28)) {
397 for(j=1; j<frontier && nodes[j]; j++)
398 nodes[j]->ssd -= nodes[0]->ssd;
402 // merge old paths to save memory
403 if(i == froze + FREEZE_INTERVAL) {
404 p = &paths[nodes[0]->path];
405 for(k=i; k>froze; k--) {
411 // other nodes might use paths that don't coincide with the frozen one.
412 // checking which nodes do so is too slow, so just kill them all.
413 // this also slightly improves quality, but I don't know why.
414 memset(nodes+1, 0, (frontier-1)*sizeof(TrellisNode*));
418 p = &paths[nodes[0]->path];
419 for(i=n-1; i>froze; i--) {
424 c->predictor = nodes[0]->sample1;
425 c->sample1 = nodes[0]->sample1;
426 c->sample2 = nodes[0]->sample2;
427 c->step_index = nodes[0]->step;
428 c->step = nodes[0]->step;
429 c->idelta = nodes[0]->step;
432 static int adpcm_encode_frame(AVCodecContext *avctx,
433 unsigned char *frame, int buf_size, void *data)
438 ADPCMContext *c = avctx->priv_data;
441 samples = (short *)data;
442 st= avctx->channels == 2;
443 /* n = (BLKSIZE - 4 * avctx->channels) / (2 * 8 * avctx->channels); */
445 switch(avctx->codec->id) {
446 case CODEC_ID_ADPCM_IMA_QT: /* XXX: can't test until we get .mov writer */
448 case CODEC_ID_ADPCM_IMA_WAV:
449 n = avctx->frame_size / 8;
450 c->status[0].prev_sample = (signed short)samples[0]; /* XXX */
451 /* c->status[0].step_index = 0; *//* XXX: not sure how to init the state machine */
452 bytestream_put_le16(&dst, c->status[0].prev_sample);
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 bytestream_put_le16(&dst, c->status[1].prev_sample);
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]);
486 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels]) << 4;
488 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 2]);
489 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 3]) << 4;
491 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 4]);
492 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 5]) << 4;
494 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 6]);
495 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 7]) << 4;
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_SWF:
519 init_put_bits(&pb, dst, buf_size*8);
521 n = avctx->frame_size-1;
523 //Store AdpcmCodeSize
524 put_bits(&pb, 2, 2); //Set 4bits flash adpcm format
526 //Init the encoder state
527 for(i=0; i<avctx->channels; i++){
528 c->status[i].step_index = av_clip(c->status[i].step_index, 0, 63); // clip step so it fits 6 bits
529 put_bits(&pb, 16, samples[i] & 0xFFFF);
530 put_bits(&pb, 6, c->status[i].step_index);
531 c->status[i].prev_sample = (signed short)samples[i];
534 if(avctx->trellis > 0) {
536 adpcm_compress_trellis(avctx, samples+2, buf[0], &c->status[0], n);
537 if (avctx->channels == 2)
538 adpcm_compress_trellis(avctx, samples+3, buf[1], &c->status[1], n);
540 put_bits(&pb, 4, buf[0][i]);
541 if (avctx->channels == 2)
542 put_bits(&pb, 4, buf[1][i]);
545 for (i=1; i<avctx->frame_size; i++) {
546 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels*i]));
547 if (avctx->channels == 2)
548 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[1], samples[2*i+1]));
552 dst += put_bits_count(&pb)>>3;
555 case CODEC_ID_ADPCM_MS:
556 for(i=0; i<avctx->channels; i++){
560 c->status[i].coeff1 = AdaptCoeff1[predictor];
561 c->status[i].coeff2 = AdaptCoeff2[predictor];
563 for(i=0; i<avctx->channels; i++){
564 if (c->status[i].idelta < 16)
565 c->status[i].idelta = 16;
567 bytestream_put_le16(&dst, c->status[i].idelta);
569 for(i=0; i<avctx->channels; i++){
570 c->status[i].sample1= *samples++;
572 bytestream_put_le16(&dst, c->status[i].sample1);
574 for(i=0; i<avctx->channels; i++){
575 c->status[i].sample2= *samples++;
577 bytestream_put_le16(&dst, c->status[i].sample2);
580 if(avctx->trellis > 0) {
581 int n = avctx->block_align - 7*avctx->channels;
583 if(avctx->channels == 1) {
585 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
587 *dst++ = (buf[0][i] << 4) | buf[0][i+1];
589 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
590 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
592 *dst++ = (buf[0][i] << 4) | buf[1][i];
595 for(i=7*avctx->channels; i<avctx->block_align; i++) {
597 nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++)<<4;
598 nibble|= adpcm_ms_compress_sample(&c->status[st], *samples++);
602 case CODEC_ID_ADPCM_YAMAHA:
603 n = avctx->frame_size / 2;
604 if(avctx->trellis > 0) {
607 if(avctx->channels == 1) {
608 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
610 *dst++ = buf[0][i] | (buf[0][i+1] << 4);
612 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
613 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
615 *dst++ = buf[0][i] | (buf[1][i] << 4);
619 for(i = 0; i < avctx->channels; i++) {
621 nibble = adpcm_yamaha_compress_sample(&c->status[i], samples[i]);
622 nibble |= adpcm_yamaha_compress_sample(&c->status[i], samples[i+avctx->channels]) << 4;
625 samples += 2 * avctx->channels;
633 #endif //CONFIG_ENCODERS
635 static int adpcm_decode_init(AVCodecContext * avctx)
637 ADPCMContext *c = avctx->priv_data;
639 if(avctx->channels > 2U){
644 c->status[0].predictor = c->status[1].predictor = 0;
645 c->status[0].step_index = c->status[1].step_index = 0;
646 c->status[0].step = c->status[1].step = 0;
648 switch(avctx->codec->id) {
649 case CODEC_ID_ADPCM_CT:
650 c->status[0].step = c->status[1].step = 511;
652 case CODEC_ID_ADPCM_IMA_WS:
653 if (avctx->extradata && avctx->extradata_size == 2 * 4) {
654 c->status[0].predictor = AV_RL32(avctx->extradata);
655 c->status[1].predictor = AV_RL32(avctx->extradata + 4);
664 static inline short adpcm_ima_expand_nibble(ADPCMChannelStatus *c, char nibble, int shift)
668 int sign, delta, diff, step;
670 step = step_table[c->step_index];
671 step_index = c->step_index + index_table[(unsigned)nibble];
672 if (step_index < 0) step_index = 0;
673 else if (step_index > 88) step_index = 88;
677 /* perform direct multiplication instead of series of jumps proposed by
678 * the reference ADPCM implementation since modern CPUs can do the mults
680 diff = ((2 * delta + 1) * step) >> shift;
681 predictor = c->predictor;
682 if (sign) predictor -= diff;
683 else predictor += diff;
685 c->predictor = av_clip_int16(predictor);
686 c->step_index = step_index;
688 return (short)c->predictor;
691 static inline short adpcm_ms_expand_nibble(ADPCMChannelStatus *c, char nibble)
695 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;
696 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
698 c->sample2 = c->sample1;
699 c->sample1 = av_clip_int16(predictor);
700 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
701 if (c->idelta < 16) c->idelta = 16;
706 static inline short adpcm_ct_expand_nibble(ADPCMChannelStatus *c, char nibble)
708 int sign, delta, diff;
713 /* perform direct multiplication instead of series of jumps proposed by
714 * the reference ADPCM implementation since modern CPUs can do the mults
716 diff = ((2 * delta + 1) * c->step) >> 3;
717 /* predictor update is not so trivial: predictor is multiplied on 254/256 before updating */
718 c->predictor = ((c->predictor * 254) >> 8) + (sign ? -diff : diff);
719 c->predictor = av_clip_int16(c->predictor);
720 /* calculate new step and clamp it to range 511..32767 */
721 new_step = (ct_adpcm_table[nibble & 7] * c->step) >> 8;
722 c->step = av_clip(new_step, 511, 32767);
724 return (short)c->predictor;
727 static inline short adpcm_sbpro_expand_nibble(ADPCMChannelStatus *c, char nibble, int size, int shift)
729 int sign, delta, diff;
731 sign = nibble & (1<<(size-1));
732 delta = nibble & ((1<<(size-1))-1);
733 diff = delta << (7 + c->step + shift);
736 c->predictor = av_clip(c->predictor + (sign ? -diff : diff), -16384,16256);
738 /* calculate new step */
739 if (delta >= (2*size - 3) && c->step < 3)
741 else if (delta == 0 && c->step > 0)
744 return (short) c->predictor;
747 static inline short adpcm_yamaha_expand_nibble(ADPCMChannelStatus *c, unsigned char nibble)
754 c->predictor += (c->step * yamaha_difflookup[nibble]) / 8;
755 c->predictor = av_clip_int16(c->predictor);
756 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
757 c->step = av_clip(c->step, 127, 24567);
761 static void xa_decode(short *out, const unsigned char *in,
762 ADPCMChannelStatus *left, ADPCMChannelStatus *right, int inc)
765 int shift,filter,f0,f1;
771 shift = 12 - (in[4+i*2] & 15);
772 filter = in[4+i*2] >> 4;
773 f0 = xa_adpcm_table[filter][0];
774 f1 = xa_adpcm_table[filter][1];
782 t = (signed char)(d<<4)>>4;
783 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
785 s_1 = av_clip_int16(s);
790 if (inc==2) { /* stereo */
793 s_1 = right->sample1;
794 s_2 = right->sample2;
795 out = out + 1 - 28*2;
798 shift = 12 - (in[5+i*2] & 15);
799 filter = in[5+i*2] >> 4;
801 f0 = xa_adpcm_table[filter][0];
802 f1 = xa_adpcm_table[filter][1];
807 t = (signed char)d >> 4;
808 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
810 s_1 = av_clip_int16(s);
815 if (inc==2) { /* stereo */
816 right->sample1 = s_1;
817 right->sample2 = s_2;
827 /* DK3 ADPCM support macro */
828 #define DK3_GET_NEXT_NIBBLE() \
829 if (decode_top_nibble_next) \
831 nibble = (last_byte >> 4) & 0x0F; \
832 decode_top_nibble_next = 0; \
836 last_byte = *src++; \
837 if (src >= buf + buf_size) break; \
838 nibble = last_byte & 0x0F; \
839 decode_top_nibble_next = 1; \
842 static int adpcm_decode_frame(AVCodecContext *avctx,
843 void *data, int *data_size,
844 uint8_t *buf, int buf_size)
846 ADPCMContext *c = avctx->priv_data;
847 ADPCMChannelStatus *cs;
848 int n, m, channel, i;
849 int block_predictor[2];
855 /* DK3 ADPCM accounting variables */
856 unsigned char last_byte = 0;
857 unsigned char nibble;
858 int decode_top_nibble_next = 0;
861 /* EA ADPCM state variables */
862 uint32_t samples_in_chunk;
863 int32_t previous_left_sample, previous_right_sample;
864 int32_t current_left_sample, current_right_sample;
865 int32_t next_left_sample, next_right_sample;
866 int32_t coeff1l, coeff2l, coeff1r, coeff2r;
867 uint8_t shift_left, shift_right;
873 //should protect all 4bit ADPCM variants
874 //8 is needed for CODEC_ID_ADPCM_IMA_WAV with 2 channels
876 if(*data_size/4 < buf_size + 8)
880 samples_end= samples + *data_size/2;
884 st = avctx->channels == 2 ? 1 : 0;
886 switch(avctx->codec->id) {
887 case CODEC_ID_ADPCM_IMA_QT:
888 n = (buf_size - 2);/* >> 2*avctx->channels;*/
889 channel = c->channel;
890 cs = &(c->status[channel]);
891 /* (pppppp) (piiiiiii) */
893 /* Bits 15-7 are the _top_ 9 bits of the 16-bit initial predictor value */
894 cs->predictor = (*src++) << 8;
895 cs->predictor |= (*src & 0x80);
896 cs->predictor &= 0xFF80;
899 if(cs->predictor & 0x8000)
900 cs->predictor -= 0x10000;
902 cs->predictor = av_clip_int16(cs->predictor);
904 cs->step_index = (*src++) & 0x7F;
906 if (cs->step_index > 88){
907 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
911 cs->step = step_table[cs->step_index];
916 for(m=32; n>0 && m>0; n--, m--) { /* in QuickTime, IMA is encoded by chuncks of 34 bytes (=64 samples) */
917 *samples = adpcm_ima_expand_nibble(cs, src[0] & 0x0F, 3);
918 samples += avctx->channels;
919 *samples = adpcm_ima_expand_nibble(cs, (src[0] >> 4) & 0x0F, 3);
920 samples += avctx->channels;
924 if(st) { /* handle stereo interlacing */
925 c->channel = (channel + 1) % 2; /* we get one packet for left, then one for right data */
926 if(channel == 1) { /* wait for the other packet before outputing anything */
931 case CODEC_ID_ADPCM_IMA_WAV:
932 if (avctx->block_align != 0 && buf_size > avctx->block_align)
933 buf_size = avctx->block_align;
935 // samples_per_block= (block_align-4*chanels)*8 / (bits_per_sample * chanels) + 1;
937 for(i=0; i<avctx->channels; i++){
938 cs = &(c->status[i]);
939 cs->predictor = (int16_t)(src[0] + (src[1]<<8));
942 // XXX: is this correct ??: *samples++ = cs->predictor;
944 cs->step_index = *src++;
945 if (cs->step_index > 88){
946 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
949 if (*src++) av_log(avctx, AV_LOG_ERROR, "unused byte should be null but is %d!!\n", src[-1]); /* unused */
952 while(src < buf + buf_size){
955 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] & 0x0F, 3);
957 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] >> 4 , 3);
963 case CODEC_ID_ADPCM_4XM:
964 cs = &(c->status[0]);
965 c->status[0].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
967 c->status[1].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
969 c->status[0].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
971 c->status[1].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
973 if (cs->step_index < 0) cs->step_index = 0;
974 if (cs->step_index > 88) cs->step_index = 88;
976 m= (buf_size - (src - buf))>>st;
978 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] & 0x0F, 4);
980 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] & 0x0F, 4);
981 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] >> 4, 4);
983 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] >> 4, 4);
989 case CODEC_ID_ADPCM_MS:
990 if (avctx->block_align != 0 && buf_size > avctx->block_align)
991 buf_size = avctx->block_align;
992 n = buf_size - 7 * avctx->channels;
995 block_predictor[0] = av_clip(*src++, 0, 7);
996 block_predictor[1] = 0;
998 block_predictor[1] = av_clip(*src++, 0, 7);
999 c->status[0].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1002 c->status[1].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1005 c->status[0].coeff1 = AdaptCoeff1[block_predictor[0]];
1006 c->status[0].coeff2 = AdaptCoeff2[block_predictor[0]];
1007 c->status[1].coeff1 = AdaptCoeff1[block_predictor[1]];
1008 c->status[1].coeff2 = AdaptCoeff2[block_predictor[1]];
1010 c->status[0].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1012 if (st) c->status[1].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1014 c->status[0].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1016 if (st) c->status[1].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1019 *samples++ = c->status[0].sample1;
1020 if (st) *samples++ = c->status[1].sample1;
1021 *samples++ = c->status[0].sample2;
1022 if (st) *samples++ = c->status[1].sample2;
1024 *samples++ = adpcm_ms_expand_nibble(&c->status[0], (src[0] >> 4) & 0x0F);
1025 *samples++ = adpcm_ms_expand_nibble(&c->status[st], src[0] & 0x0F);
1029 case CODEC_ID_ADPCM_IMA_DK4:
1030 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1031 buf_size = avctx->block_align;
1033 c->status[0].predictor = (int16_t)(src[0] | (src[1] << 8));
1034 c->status[0].step_index = src[2];
1036 *samples++ = c->status[0].predictor;
1038 c->status[1].predictor = (int16_t)(src[0] | (src[1] << 8));
1039 c->status[1].step_index = src[2];
1041 *samples++ = c->status[1].predictor;
1043 while (src < buf + buf_size) {
1045 /* take care of the top nibble (always left or mono channel) */
1046 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1047 (src[0] >> 4) & 0x0F, 3);
1049 /* take care of the bottom nibble, which is right sample for
1050 * stereo, or another mono sample */
1052 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1055 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1061 case CODEC_ID_ADPCM_IMA_DK3:
1062 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1063 buf_size = avctx->block_align;
1065 if(buf_size + 16 > (samples_end - samples)*3/8)
1068 c->status[0].predictor = (int16_t)(src[10] | (src[11] << 8));
1069 c->status[1].predictor = (int16_t)(src[12] | (src[13] << 8));
1070 c->status[0].step_index = src[14];
1071 c->status[1].step_index = src[15];
1072 /* sign extend the predictors */
1074 diff_channel = c->status[1].predictor;
1076 /* the DK3_GET_NEXT_NIBBLE macro issues the break statement when
1077 * the buffer is consumed */
1080 /* for this algorithm, c->status[0] is the sum channel and
1081 * c->status[1] is the diff channel */
1083 /* process the first predictor of the sum channel */
1084 DK3_GET_NEXT_NIBBLE();
1085 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1087 /* process the diff channel predictor */
1088 DK3_GET_NEXT_NIBBLE();
1089 adpcm_ima_expand_nibble(&c->status[1], nibble, 3);
1091 /* process the first pair of stereo PCM samples */
1092 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1093 *samples++ = c->status[0].predictor + c->status[1].predictor;
1094 *samples++ = c->status[0].predictor - c->status[1].predictor;
1096 /* process the second predictor of the sum channel */
1097 DK3_GET_NEXT_NIBBLE();
1098 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1100 /* process the second pair of stereo PCM samples */
1101 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1102 *samples++ = c->status[0].predictor + c->status[1].predictor;
1103 *samples++ = c->status[0].predictor - c->status[1].predictor;
1106 case CODEC_ID_ADPCM_IMA_WS:
1107 /* no per-block initialization; just start decoding the data */
1108 while (src < buf + buf_size) {
1111 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1112 (src[0] >> 4) & 0x0F, 3);
1113 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1116 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1117 (src[0] >> 4) & 0x0F, 3);
1118 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1125 case CODEC_ID_ADPCM_XA:
1126 c->status[0].sample1 = c->status[0].sample2 =
1127 c->status[1].sample1 = c->status[1].sample2 = 0;
1128 while (buf_size >= 128) {
1129 xa_decode(samples, src, &c->status[0], &c->status[1],
1136 case CODEC_ID_ADPCM_EA:
1137 samples_in_chunk = AV_RL32(src);
1138 if (samples_in_chunk >= ((buf_size - 12) * 2)) {
1143 current_left_sample = (int16_t)AV_RL16(src);
1145 previous_left_sample = (int16_t)AV_RL16(src);
1147 current_right_sample = (int16_t)AV_RL16(src);
1149 previous_right_sample = (int16_t)AV_RL16(src);
1152 for (count1 = 0; count1 < samples_in_chunk/28;count1++) {
1153 coeff1l = ea_adpcm_table[(*src >> 4) & 0x0F];
1154 coeff2l = ea_adpcm_table[((*src >> 4) & 0x0F) + 4];
1155 coeff1r = ea_adpcm_table[*src & 0x0F];
1156 coeff2r = ea_adpcm_table[(*src & 0x0F) + 4];
1159 shift_left = ((*src >> 4) & 0x0F) + 8;
1160 shift_right = (*src & 0x0F) + 8;
1163 for (count2 = 0; count2 < 28; count2++) {
1164 next_left_sample = (((*src & 0xF0) << 24) >> shift_left);
1165 next_right_sample = (((*src & 0x0F) << 28) >> shift_right);
1168 next_left_sample = (next_left_sample +
1169 (current_left_sample * coeff1l) +
1170 (previous_left_sample * coeff2l) + 0x80) >> 8;
1171 next_right_sample = (next_right_sample +
1172 (current_right_sample * coeff1r) +
1173 (previous_right_sample * coeff2r) + 0x80) >> 8;
1175 previous_left_sample = current_left_sample;
1176 current_left_sample = av_clip_int16(next_left_sample);
1177 previous_right_sample = current_right_sample;
1178 current_right_sample = av_clip_int16(next_right_sample);
1179 *samples++ = (unsigned short)current_left_sample;
1180 *samples++ = (unsigned short)current_right_sample;
1184 case CODEC_ID_ADPCM_IMA_AMV:
1185 case CODEC_ID_ADPCM_IMA_SMJPEG:
1186 c->status[0].predictor = (int16_t)bytestream_get_le16(&src);
1187 c->status[0].step_index = bytestream_get_le16(&src);
1189 if (avctx->codec->id == CODEC_ID_ADPCM_IMA_AMV)
1192 while (src < buf + buf_size) {
1195 hi = (*src >> 4) & 0x0F;
1197 if (avctx->codec->id == CODEC_ID_ADPCM_IMA_AMV)
1198 FFSWAP(char, hi, lo);
1200 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1202 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1207 case CODEC_ID_ADPCM_CT:
1208 while (src < buf + buf_size) {
1210 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1211 (src[0] >> 4) & 0x0F);
1212 *samples++ = adpcm_ct_expand_nibble(&c->status[1],
1215 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1216 (src[0] >> 4) & 0x0F);
1217 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1223 case CODEC_ID_ADPCM_SBPRO_4:
1224 case CODEC_ID_ADPCM_SBPRO_3:
1225 case CODEC_ID_ADPCM_SBPRO_2:
1226 if (!c->status[0].step_index) {
1227 /* the first byte is a raw sample */
1228 *samples++ = 128 * (*src++ - 0x80);
1230 *samples++ = 128 * (*src++ - 0x80);
1231 c->status[0].step_index = 1;
1233 if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_4) {
1234 while (src < buf + buf_size) {
1235 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1236 (src[0] >> 4) & 0x0F, 4, 0);
1237 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1238 src[0] & 0x0F, 4, 0);
1241 } else if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_3) {
1242 while (src < buf + buf_size && samples + 2 < samples_end) {
1243 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1244 (src[0] >> 5) & 0x07, 3, 0);
1245 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1246 (src[0] >> 2) & 0x07, 3, 0);
1247 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1248 src[0] & 0x03, 2, 0);
1252 while (src < buf + buf_size && samples + 3 < samples_end) {
1253 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1254 (src[0] >> 6) & 0x03, 2, 2);
1255 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1256 (src[0] >> 4) & 0x03, 2, 2);
1257 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1258 (src[0] >> 2) & 0x03, 2, 2);
1259 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1260 src[0] & 0x03, 2, 2);
1265 case CODEC_ID_ADPCM_SWF:
1269 int k0, signmask, nb_bits, count;
1270 int size = buf_size*8;
1272 init_get_bits(&gb, buf, size);
1274 //read bits & initial values
1275 nb_bits = get_bits(&gb, 2)+2;
1276 //av_log(NULL,AV_LOG_INFO,"nb_bits: %d\n", nb_bits);
1277 table = swf_index_tables[nb_bits-2];
1278 k0 = 1 << (nb_bits-2);
1279 signmask = 1 << (nb_bits-1);
1281 while (get_bits_count(&gb) <= size - 22*avctx->channels) {
1282 for (i = 0; i < avctx->channels; i++) {
1283 *samples++ = c->status[i].predictor = get_sbits(&gb, 16);
1284 c->status[i].step_index = get_bits(&gb, 6);
1287 for (count = 0; get_bits_count(&gb) <= size - nb_bits*avctx->channels && count < 4095; count++) {
1290 for (i = 0; i < avctx->channels; i++) {
1291 // similar to IMA adpcm
1292 int delta = get_bits(&gb, nb_bits);
1293 int step = step_table[c->status[i].step_index];
1294 long vpdiff = 0; // vpdiff = (delta+0.5)*step/4
1305 if (delta & signmask)
1306 c->status[i].predictor -= vpdiff;
1308 c->status[i].predictor += vpdiff;
1310 c->status[i].step_index += table[delta & (~signmask)];
1312 c->status[i].step_index = av_clip(c->status[i].step_index, 0, 88);
1313 c->status[i].predictor = av_clip_int16(c->status[i].predictor);
1315 *samples++ = c->status[i].predictor;
1316 if (samples >= samples_end) {
1317 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1326 case CODEC_ID_ADPCM_YAMAHA:
1327 while (src < buf + buf_size) {
1329 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1331 *samples++ = adpcm_yamaha_expand_nibble(&c->status[1],
1332 (src[0] >> 4) & 0x0F);
1334 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1336 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1337 (src[0] >> 4) & 0x0F);
1342 case CODEC_ID_ADPCM_THP:
1345 unsigned int samplecnt;
1349 if (buf_size < 80) {
1350 av_log(avctx, AV_LOG_ERROR, "frame too small\n");
1355 samplecnt = bytestream_get_be32(&src);
1357 for (i = 0; i < 32; i++)
1358 table[0][i] = (int16_t)bytestream_get_be16(&src);
1360 /* Initialize the previous sample. */
1361 for (i = 0; i < 4; i++)
1362 prev[0][i] = (int16_t)bytestream_get_be16(&src);
1364 if (samplecnt >= (samples_end - samples) / (st + 1)) {
1365 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1369 for (ch = 0; ch <= st; ch++) {
1370 samples = (unsigned short *) data + ch;
1372 /* Read in every sample for this channel. */
1373 for (i = 0; i < samplecnt / 14; i++) {
1374 int index = (*src >> 4) & 7;
1375 unsigned int exp = 28 - (*src++ & 15);
1376 int factor1 = table[ch][index * 2];
1377 int factor2 = table[ch][index * 2 + 1];
1379 /* Decode 14 samples. */
1380 for (n = 0; n < 14; n++) {
1382 if(n&1) sampledat= *src++ <<28;
1383 else sampledat= (*src&0xF0)<<24;
1385 sampledat = ((prev[ch][0]*factor1
1386 + prev[ch][1]*factor2) >> 11) + (sampledat>>exp);
1387 *samples = av_clip_int16(sampledat);
1388 prev[ch][1] = prev[ch][0];
1389 prev[ch][0] = *samples++;
1391 /* In case of stereo, skip one sample, this sample
1392 is for the other channel. */
1398 /* In the previous loop, in case stereo is used, samples is
1399 increased exactly one time too often. */
1407 *data_size = (uint8_t *)samples - (uint8_t *)data;
1413 #ifdef CONFIG_ENCODERS
1414 #define ADPCM_ENCODER(id,name) \
1415 AVCodec name ## _encoder = { \
1419 sizeof(ADPCMContext), \
1420 adpcm_encode_init, \
1421 adpcm_encode_frame, \
1422 adpcm_encode_close, \
1426 #define ADPCM_ENCODER(id,name)
1429 #ifdef CONFIG_DECODERS
1430 #define ADPCM_DECODER(id,name) \
1431 AVCodec name ## _decoder = { \
1435 sizeof(ADPCMContext), \
1436 adpcm_decode_init, \
1439 adpcm_decode_frame, \
1442 #define ADPCM_DECODER(id,name)
1445 #define ADPCM_CODEC(id, name) \
1446 ADPCM_ENCODER(id,name) ADPCM_DECODER(id,name)
1448 ADPCM_CODEC(CODEC_ID_ADPCM_4XM, adpcm_4xm);
1449 ADPCM_CODEC(CODEC_ID_ADPCM_CT, adpcm_ct);
1450 ADPCM_CODEC(CODEC_ID_ADPCM_EA, adpcm_ea);
1451 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_AMV, adpcm_ima_amv);
1452 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3);
1453 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4);
1454 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt);
1455 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg);
1456 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav);
1457 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws);
1458 ADPCM_CODEC(CODEC_ID_ADPCM_MS, adpcm_ms);
1459 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4);
1460 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3);
1461 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2);
1462 ADPCM_CODEC(CODEC_ID_ADPCM_SWF, adpcm_swf);
1463 ADPCM_CODEC(CODEC_ID_ADPCM_THP, adpcm_thp);
1464 ADPCM_CODEC(CODEC_ID_ADPCM_XA, adpcm_xa);
1465 ADPCM_CODEC(CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha);