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;
185 case CODEC_ID_ADPCM_SWF:
186 avctx->frame_size = 4*BLKSIZE * avctx->channels;
193 avctx->coded_frame= avcodec_alloc_frame();
194 avctx->coded_frame->key_frame= 1;
199 static int adpcm_encode_close(AVCodecContext *avctx)
201 av_freep(&avctx->coded_frame);
207 static inline unsigned char adpcm_ima_compress_sample(ADPCMChannelStatus *c, short sample)
209 int delta = sample - c->prev_sample;
210 int nibble = FFMIN(7, abs(delta)*4/step_table[c->step_index]) + (delta<0)*8;
211 c->prev_sample = c->prev_sample + ((step_table[c->step_index] * yamaha_difflookup[nibble]) / 8);
212 CLAMP_TO_SHORT(c->prev_sample);
213 c->step_index = av_clip(c->step_index + index_table[nibble], 0, 88);
217 static inline unsigned char adpcm_ms_compress_sample(ADPCMChannelStatus *c, short sample)
219 int predictor, nibble, bias;
221 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;
223 nibble= sample - predictor;
224 if(nibble>=0) bias= c->idelta/2;
225 else bias=-c->idelta/2;
227 nibble= (nibble + bias) / c->idelta;
228 nibble= av_clip(nibble, -8, 7)&0x0F;
230 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
231 CLAMP_TO_SHORT(predictor);
233 c->sample2 = c->sample1;
234 c->sample1 = predictor;
236 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
237 if (c->idelta < 16) c->idelta = 16;
242 static inline unsigned char adpcm_yamaha_compress_sample(ADPCMChannelStatus *c, short sample)
251 delta = sample - c->predictor;
253 nibble = FFMIN(7, abs(delta)*4/c->step) + (delta<0)*8;
255 c->predictor = c->predictor + ((c->step * yamaha_difflookup[nibble]) / 8);
256 CLAMP_TO_SHORT(c->predictor);
257 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
258 c->step = av_clip(c->step, 127, 24567);
263 typedef struct TrellisPath {
268 typedef struct TrellisNode {
276 static void adpcm_compress_trellis(AVCodecContext *avctx, const short *samples,
277 uint8_t *dst, ADPCMChannelStatus *c, int n)
279 #define FREEZE_INTERVAL 128
280 //FIXME 6% faster if frontier is a compile-time constant
281 const int frontier = 1 << avctx->trellis;
282 const int stride = avctx->channels;
283 const int version = avctx->codec->id;
284 const int max_paths = frontier*FREEZE_INTERVAL;
285 TrellisPath paths[max_paths], *p;
286 TrellisNode node_buf[2][frontier];
287 TrellisNode *nodep_buf[2][frontier];
288 TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
289 TrellisNode **nodes_next = nodep_buf[1];
290 int pathn = 0, froze = -1, i, j, k;
292 assert(!(max_paths&(max_paths-1)));
294 memset(nodep_buf, 0, sizeof(nodep_buf));
295 nodes[0] = &node_buf[1][0];
298 nodes[0]->step = c->step_index;
299 nodes[0]->sample1 = c->sample1;
300 nodes[0]->sample2 = c->sample2;
301 if(version == CODEC_ID_ADPCM_IMA_WAV)
302 nodes[0]->sample1 = c->prev_sample;
303 if(version == CODEC_ID_ADPCM_MS)
304 nodes[0]->step = c->idelta;
305 if(version == CODEC_ID_ADPCM_YAMAHA) {
307 nodes[0]->step = 127;
308 nodes[0]->sample1 = 0;
310 nodes[0]->step = c->step;
311 nodes[0]->sample1 = c->predictor;
316 TrellisNode *t = node_buf[i&1];
318 int sample = samples[i*stride];
319 memset(nodes_next, 0, frontier*sizeof(TrellisNode*));
320 for(j=0; j<frontier && nodes[j]; j++) {
321 // higher j have higher ssd already, so they're unlikely to use a suboptimal next sample too
322 const int range = (j < frontier/2) ? 1 : 0;
323 const int step = nodes[j]->step;
325 if(version == CODEC_ID_ADPCM_MS) {
326 const int predictor = ((nodes[j]->sample1 * c->coeff1) + (nodes[j]->sample2 * c->coeff2)) / 256;
327 const int div = (sample - predictor) / step;
328 const int nmin = av_clip(div-range, -8, 6);
329 const int nmax = av_clip(div+range, -7, 7);
330 for(nidx=nmin; nidx<=nmax; nidx++) {
331 const int nibble = nidx & 0xf;
332 int dec_sample = predictor + nidx * step;
333 #define STORE_NODE(NAME, STEP_INDEX)\
336 CLAMP_TO_SHORT(dec_sample);\
337 d = sample - dec_sample;\
338 ssd = nodes[j]->ssd + d*d;\
339 if(nodes_next[frontier-1] && ssd >= nodes_next[frontier-1]->ssd)\
341 /* Collapse any two states with the same previous sample value. \
342 * One could also distinguish states by step and by 2nd to last
343 * sample, but the effects of that are negligible. */\
344 for(k=0; k<frontier && nodes_next[k]; k++) {\
345 if(dec_sample == nodes_next[k]->sample1) {\
346 assert(ssd >= nodes_next[k]->ssd);\
350 for(k=0; k<frontier; k++) {\
351 if(!nodes_next[k] || ssd < nodes_next[k]->ssd) {\
352 TrellisNode *u = nodes_next[frontier-1];\
354 assert(pathn < max_paths);\
359 u->step = STEP_INDEX;\
360 u->sample2 = nodes[j]->sample1;\
361 u->sample1 = dec_sample;\
362 paths[u->path].nibble = nibble;\
363 paths[u->path].prev = nodes[j]->path;\
364 memmove(&nodes_next[k+1], &nodes_next[k], (frontier-k-1)*sizeof(TrellisNode*));\
370 STORE_NODE(ms, FFMAX(16, (AdaptationTable[nibble] * step) >> 8));
372 } else if(version == CODEC_ID_ADPCM_IMA_WAV) {
373 #define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\
374 const int predictor = nodes[j]->sample1;\
375 const int div = (sample - predictor) * 4 / STEP_TABLE;\
376 int nmin = av_clip(div-range, -7, 6);\
377 int nmax = av_clip(div+range, -6, 7);\
378 if(nmin<=0) nmin--; /* distinguish -0 from +0 */\
380 for(nidx=nmin; nidx<=nmax; nidx++) {\
381 const int nibble = nidx<0 ? 7-nidx : nidx;\
382 int dec_sample = predictor + (STEP_TABLE * yamaha_difflookup[nibble]) / 8;\
383 STORE_NODE(NAME, STEP_INDEX);\
385 LOOP_NODES(ima, step_table[step], av_clip(step + index_table[nibble], 0, 88));
386 } else { //CODEC_ID_ADPCM_YAMAHA
387 LOOP_NODES(yamaha, step, av_clip((step * yamaha_indexscale[nibble]) >> 8, 127, 24567));
398 if(nodes[0]->ssd > (1<<28)) {
399 for(j=1; j<frontier && nodes[j]; j++)
400 nodes[j]->ssd -= nodes[0]->ssd;
404 // merge old paths to save memory
405 if(i == froze + FREEZE_INTERVAL) {
406 p = &paths[nodes[0]->path];
407 for(k=i; k>froze; k--) {
413 // other nodes might use paths that don't coincide with the frozen one.
414 // checking which nodes do so is too slow, so just kill them all.
415 // this also slightly improves quality, but I don't know why.
416 memset(nodes+1, 0, (frontier-1)*sizeof(TrellisNode*));
420 p = &paths[nodes[0]->path];
421 for(i=n-1; i>froze; i--) {
426 c->predictor = nodes[0]->sample1;
427 c->sample1 = nodes[0]->sample1;
428 c->sample2 = nodes[0]->sample2;
429 c->step_index = nodes[0]->step;
430 c->step = nodes[0]->step;
431 c->idelta = nodes[0]->step;
434 static int adpcm_encode_frame(AVCodecContext *avctx,
435 unsigned char *frame, int buf_size, void *data)
440 ADPCMContext *c = avctx->priv_data;
443 samples = (short *)data;
444 st= avctx->channels == 2;
445 /* n = (BLKSIZE - 4 * avctx->channels) / (2 * 8 * avctx->channels); */
447 switch(avctx->codec->id) {
448 case CODEC_ID_ADPCM_IMA_QT: /* XXX: can't test until we get .mov writer */
450 case CODEC_ID_ADPCM_IMA_WAV:
451 n = avctx->frame_size / 8;
452 c->status[0].prev_sample = (signed short)samples[0]; /* XXX */
453 /* c->status[0].step_index = 0; *//* XXX: not sure how to init the state machine */
454 *dst++ = (c->status[0].prev_sample) & 0xFF; /* little endian */
455 *dst++ = (c->status[0].prev_sample >> 8) & 0xFF;
456 *dst++ = (unsigned char)c->status[0].step_index;
457 *dst++ = 0; /* unknown */
459 if (avctx->channels == 2) {
460 c->status[1].prev_sample = (signed short)samples[1];
461 /* c->status[1].step_index = 0; */
462 *dst++ = (c->status[1].prev_sample) & 0xFF;
463 *dst++ = (c->status[1].prev_sample >> 8) & 0xFF;
464 *dst++ = (unsigned char)c->status[1].step_index;
469 /* stereo: 4 bytes (8 samples) for left, 4 bytes for right, 4 bytes left, ... */
470 if(avctx->trellis > 0) {
472 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n*8);
473 if(avctx->channels == 2)
474 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n*8);
476 *dst++ = buf[0][8*i+0] | (buf[0][8*i+1] << 4);
477 *dst++ = buf[0][8*i+2] | (buf[0][8*i+3] << 4);
478 *dst++ = buf[0][8*i+4] | (buf[0][8*i+5] << 4);
479 *dst++ = buf[0][8*i+6] | (buf[0][8*i+7] << 4);
480 if (avctx->channels == 2) {
481 *dst++ = buf[1][8*i+0] | (buf[1][8*i+1] << 4);
482 *dst++ = buf[1][8*i+2] | (buf[1][8*i+3] << 4);
483 *dst++ = buf[1][8*i+4] | (buf[1][8*i+5] << 4);
484 *dst++ = buf[1][8*i+6] | (buf[1][8*i+7] << 4);
489 *dst = adpcm_ima_compress_sample(&c->status[0], samples[0]) & 0x0F;
490 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels]) << 4) & 0xF0;
492 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 2]) & 0x0F;
493 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 3]) << 4) & 0xF0;
495 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 4]) & 0x0F;
496 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 5]) << 4) & 0xF0;
498 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 6]) & 0x0F;
499 *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 7]) << 4) & 0xF0;
502 if (avctx->channels == 2) {
503 *dst = adpcm_ima_compress_sample(&c->status[1], samples[1]);
504 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[3]) << 4;
506 *dst = adpcm_ima_compress_sample(&c->status[1], samples[5]);
507 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[7]) << 4;
509 *dst = adpcm_ima_compress_sample(&c->status[1], samples[9]);
510 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[11]) << 4;
512 *dst = adpcm_ima_compress_sample(&c->status[1], samples[13]);
513 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[15]) << 4;
516 samples += 8 * avctx->channels;
519 case CODEC_ID_ADPCM_SWF:
523 init_put_bits(&pb, dst, buf_size*8);
525 //Store AdpcmCodeSize
526 put_bits(&pb, 2, 2); //Set 4bits flash adpcm format
528 //Init the encoder state
529 for(i=0; i<avctx->channels; i++){
530 put_bits(&pb, 16, samples[i] & 0xFFFF);
531 put_bits(&pb, 6, c->status[i].step_index & 0x3F);
532 c->status[i].prev_sample = (signed short)samples[i];
535 for (i=0 ; i<4096 ; i++) {
536 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels*i]) & 0xF);
537 if (avctx->channels == 2)
538 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[1], samples[2*i+1]) & 0xF);
541 dst += (3 + 2048) * avctx->channels;
544 case CODEC_ID_ADPCM_MS:
545 for(i=0; i<avctx->channels; i++){
549 c->status[i].coeff1 = AdaptCoeff1[predictor];
550 c->status[i].coeff2 = AdaptCoeff2[predictor];
552 for(i=0; i<avctx->channels; i++){
553 if (c->status[i].idelta < 16)
554 c->status[i].idelta = 16;
556 *dst++ = c->status[i].idelta & 0xFF;
557 *dst++ = c->status[i].idelta >> 8;
559 for(i=0; i<avctx->channels; i++){
560 c->status[i].sample1= *samples++;
562 *dst++ = c->status[i].sample1 & 0xFF;
563 *dst++ = c->status[i].sample1 >> 8;
565 for(i=0; i<avctx->channels; i++){
566 c->status[i].sample2= *samples++;
568 *dst++ = c->status[i].sample2 & 0xFF;
569 *dst++ = c->status[i].sample2 >> 8;
572 if(avctx->trellis > 0) {
573 int n = avctx->block_align - 7*avctx->channels;
575 if(avctx->channels == 1) {
577 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
579 *dst++ = (buf[0][i] << 4) | buf[0][i+1];
581 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
582 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
584 *dst++ = (buf[0][i] << 4) | buf[1][i];
587 for(i=7*avctx->channels; i<avctx->block_align; i++) {
589 nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++)<<4;
590 nibble|= adpcm_ms_compress_sample(&c->status[st], *samples++);
594 case CODEC_ID_ADPCM_YAMAHA:
595 n = avctx->frame_size / 2;
596 if(avctx->trellis > 0) {
599 if(avctx->channels == 1) {
600 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
602 *dst++ = buf[0][i] | (buf[0][i+1] << 4);
604 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
605 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
607 *dst++ = buf[0][i] | (buf[1][i] << 4);
611 for(i = 0; i < avctx->channels; i++) {
613 nibble = adpcm_yamaha_compress_sample(&c->status[i], samples[i]);
614 nibble |= adpcm_yamaha_compress_sample(&c->status[i], samples[i+avctx->channels]) << 4;
617 samples += 2 * avctx->channels;
625 #endif //CONFIG_ENCODERS
627 static int adpcm_decode_init(AVCodecContext * avctx)
629 ADPCMContext *c = avctx->priv_data;
631 if(avctx->channels > 2U){
636 c->status[0].predictor = c->status[1].predictor = 0;
637 c->status[0].step_index = c->status[1].step_index = 0;
638 c->status[0].step = c->status[1].step = 0;
640 switch(avctx->codec->id) {
641 case CODEC_ID_ADPCM_CT:
642 c->status[0].step = c->status[1].step = 511;
644 case CODEC_ID_ADPCM_IMA_WS:
645 if (avctx->extradata && avctx->extradata_size == 2 * 4) {
646 c->status[0].predictor = AV_RL32(avctx->extradata);
647 c->status[1].predictor = AV_RL32(avctx->extradata + 4);
656 static inline short adpcm_ima_expand_nibble(ADPCMChannelStatus *c, char nibble, int shift)
660 int sign, delta, diff, step;
662 step = step_table[c->step_index];
663 step_index = c->step_index + index_table[(unsigned)nibble];
664 if (step_index < 0) step_index = 0;
665 else if (step_index > 88) step_index = 88;
669 /* perform direct multiplication instead of series of jumps proposed by
670 * the reference ADPCM implementation since modern CPUs can do the mults
672 diff = ((2 * delta + 1) * step) >> shift;
673 predictor = c->predictor;
674 if (sign) predictor -= diff;
675 else predictor += diff;
677 CLAMP_TO_SHORT(predictor);
678 c->predictor = predictor;
679 c->step_index = step_index;
681 return (short)predictor;
684 static inline short adpcm_ms_expand_nibble(ADPCMChannelStatus *c, char nibble)
688 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;
689 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
690 CLAMP_TO_SHORT(predictor);
692 c->sample2 = c->sample1;
693 c->sample1 = predictor;
694 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
695 if (c->idelta < 16) c->idelta = 16;
697 return (short)predictor;
700 static inline short adpcm_ct_expand_nibble(ADPCMChannelStatus *c, char nibble)
703 int sign, delta, diff;
708 /* perform direct multiplication instead of series of jumps proposed by
709 * the reference ADPCM implementation since modern CPUs can do the mults
711 diff = ((2 * delta + 1) * c->step) >> 3;
712 predictor = c->predictor;
713 /* predictor update is not so trivial: predictor is multiplied on 254/256 before updating */
715 predictor = ((predictor * 254) >> 8) - diff;
717 predictor = ((predictor * 254) >> 8) + diff;
718 /* calculate new step and clamp it to range 511..32767 */
719 new_step = (ct_adpcm_table[nibble & 7] * c->step) >> 8;
726 CLAMP_TO_SHORT(predictor);
727 c->predictor = predictor;
728 return (short)predictor;
731 static inline short adpcm_sbpro_expand_nibble(ADPCMChannelStatus *c, char nibble, int size, int shift)
733 int sign, delta, diff;
735 sign = nibble & (1<<(size-1));
736 delta = nibble & ((1<<(size-1))-1);
737 diff = delta << (7 + c->step + shift);
740 c->predictor -= diff;
742 c->predictor += diff;
745 if (c->predictor > 16256)
746 c->predictor = 16256;
747 else if (c->predictor < -16384)
748 c->predictor = -16384;
750 /* calculate new step */
751 if (delta >= (2*size - 3) && c->step < 3)
753 else if (delta == 0 && c->step > 0)
756 return (short) c->predictor;
759 static inline short adpcm_yamaha_expand_nibble(ADPCMChannelStatus *c, unsigned char nibble)
766 c->predictor += (c->step * yamaha_difflookup[nibble]) / 8;
767 CLAMP_TO_SHORT(c->predictor);
768 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
769 c->step = av_clip(c->step, 127, 24567);
773 static void xa_decode(short *out, const unsigned char *in,
774 ADPCMChannelStatus *left, ADPCMChannelStatus *right, int inc)
777 int shift,filter,f0,f1;
783 shift = 12 - (in[4+i*2] & 15);
784 filter = in[4+i*2] >> 4;
785 f0 = xa_adpcm_table[filter][0];
786 f1 = xa_adpcm_table[filter][1];
794 t = (signed char)(d<<4)>>4;
795 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
803 if (inc==2) { /* stereo */
806 s_1 = right->sample1;
807 s_2 = right->sample2;
808 out = out + 1 - 28*2;
811 shift = 12 - (in[5+i*2] & 15);
812 filter = in[5+i*2] >> 4;
814 f0 = xa_adpcm_table[filter][0];
815 f1 = xa_adpcm_table[filter][1];
820 t = (signed char)d >> 4;
821 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
829 if (inc==2) { /* stereo */
830 right->sample1 = s_1;
831 right->sample2 = s_2;
841 /* DK3 ADPCM support macro */
842 #define DK3_GET_NEXT_NIBBLE() \
843 if (decode_top_nibble_next) \
845 nibble = (last_byte >> 4) & 0x0F; \
846 decode_top_nibble_next = 0; \
850 last_byte = *src++; \
851 if (src >= buf + buf_size) break; \
852 nibble = last_byte & 0x0F; \
853 decode_top_nibble_next = 1; \
856 static int adpcm_decode_frame(AVCodecContext *avctx,
857 void *data, int *data_size,
858 uint8_t *buf, int buf_size)
860 ADPCMContext *c = avctx->priv_data;
861 ADPCMChannelStatus *cs;
862 int n, m, channel, i;
863 int block_predictor[2];
869 /* DK3 ADPCM accounting variables */
870 unsigned char last_byte = 0;
871 unsigned char nibble;
872 int decode_top_nibble_next = 0;
875 /* EA ADPCM state variables */
876 uint32_t samples_in_chunk;
877 int32_t previous_left_sample, previous_right_sample;
878 int32_t current_left_sample, current_right_sample;
879 int32_t next_left_sample, next_right_sample;
880 int32_t coeff1l, coeff2l, coeff1r, coeff2r;
881 uint8_t shift_left, shift_right;
887 //should protect all 4bit ADPCM variants
888 //8 is needed for CODEC_ID_ADPCM_IMA_WAV with 2 channels
890 if(*data_size/4 < buf_size + 8)
894 samples_end= samples + *data_size/2;
898 st = avctx->channels == 2 ? 1 : 0;
900 switch(avctx->codec->id) {
901 case CODEC_ID_ADPCM_IMA_QT:
902 n = (buf_size - 2);/* >> 2*avctx->channels;*/
903 channel = c->channel;
904 cs = &(c->status[channel]);
905 /* (pppppp) (piiiiiii) */
907 /* Bits 15-7 are the _top_ 9 bits of the 16-bit initial predictor value */
908 cs->predictor = (*src++) << 8;
909 cs->predictor |= (*src & 0x80);
910 cs->predictor &= 0xFF80;
913 if(cs->predictor & 0x8000)
914 cs->predictor -= 0x10000;
916 CLAMP_TO_SHORT(cs->predictor);
918 cs->step_index = (*src++) & 0x7F;
920 if (cs->step_index > 88){
921 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
925 cs->step = step_table[cs->step_index];
930 for(m=32; n>0 && m>0; n--, m--) { /* in QuickTime, IMA is encoded by chuncks of 34 bytes (=64 samples) */
931 *samples = adpcm_ima_expand_nibble(cs, src[0] & 0x0F, 3);
932 samples += avctx->channels;
933 *samples = adpcm_ima_expand_nibble(cs, (src[0] >> 4) & 0x0F, 3);
934 samples += avctx->channels;
938 if(st) { /* handle stereo interlacing */
939 c->channel = (channel + 1) % 2; /* we get one packet for left, then one for right data */
940 if(channel == 1) { /* wait for the other packet before outputing anything */
945 case CODEC_ID_ADPCM_IMA_WAV:
946 if (avctx->block_align != 0 && buf_size > avctx->block_align)
947 buf_size = avctx->block_align;
949 // samples_per_block= (block_align-4*chanels)*8 / (bits_per_sample * chanels) + 1;
951 for(i=0; i<avctx->channels; i++){
952 cs = &(c->status[i]);
953 cs->predictor = (int16_t)(src[0] + (src[1]<<8));
956 // XXX: is this correct ??: *samples++ = cs->predictor;
958 cs->step_index = *src++;
959 if (cs->step_index > 88){
960 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
963 if (*src++) av_log(avctx, AV_LOG_ERROR, "unused byte should be null but is %d!!\n", src[-1]); /* unused */
966 while(src < buf + buf_size){
969 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] & 0x0F, 3);
971 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] >> 4 , 3);
977 case CODEC_ID_ADPCM_4XM:
978 cs = &(c->status[0]);
979 c->status[0].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
981 c->status[1].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
983 c->status[0].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
985 c->status[1].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
987 if (cs->step_index < 0) cs->step_index = 0;
988 if (cs->step_index > 88) cs->step_index = 88;
990 m= (buf_size - (src - buf))>>st;
992 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] & 0x0F, 4);
994 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] & 0x0F, 4);
995 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] >> 4, 4);
997 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] >> 4, 4);
1003 case CODEC_ID_ADPCM_MS:
1004 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1005 buf_size = avctx->block_align;
1006 n = buf_size - 7 * avctx->channels;
1009 block_predictor[0] = av_clip(*src++, 0, 7);
1010 block_predictor[1] = 0;
1012 block_predictor[1] = av_clip(*src++, 0, 7);
1013 c->status[0].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1016 c->status[1].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1019 c->status[0].coeff1 = AdaptCoeff1[block_predictor[0]];
1020 c->status[0].coeff2 = AdaptCoeff2[block_predictor[0]];
1021 c->status[1].coeff1 = AdaptCoeff1[block_predictor[1]];
1022 c->status[1].coeff2 = AdaptCoeff2[block_predictor[1]];
1024 c->status[0].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1026 if (st) c->status[1].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1028 c->status[0].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1030 if (st) c->status[1].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1033 *samples++ = c->status[0].sample1;
1034 if (st) *samples++ = c->status[1].sample1;
1035 *samples++ = c->status[0].sample2;
1036 if (st) *samples++ = c->status[1].sample2;
1038 *samples++ = adpcm_ms_expand_nibble(&c->status[0], (src[0] >> 4) & 0x0F);
1039 *samples++ = adpcm_ms_expand_nibble(&c->status[st], src[0] & 0x0F);
1043 case CODEC_ID_ADPCM_IMA_DK4:
1044 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1045 buf_size = avctx->block_align;
1047 c->status[0].predictor = (int16_t)(src[0] | (src[1] << 8));
1048 c->status[0].step_index = src[2];
1050 *samples++ = c->status[0].predictor;
1052 c->status[1].predictor = (int16_t)(src[0] | (src[1] << 8));
1053 c->status[1].step_index = src[2];
1055 *samples++ = c->status[1].predictor;
1057 while (src < buf + buf_size) {
1059 /* take care of the top nibble (always left or mono channel) */
1060 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1061 (src[0] >> 4) & 0x0F, 3);
1063 /* take care of the bottom nibble, which is right sample for
1064 * stereo, or another mono sample */
1066 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1069 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1075 case CODEC_ID_ADPCM_IMA_DK3:
1076 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1077 buf_size = avctx->block_align;
1079 if(buf_size + 16 > (samples_end - samples)*3/8)
1082 c->status[0].predictor = (int16_t)(src[10] | (src[11] << 8));
1083 c->status[1].predictor = (int16_t)(src[12] | (src[13] << 8));
1084 c->status[0].step_index = src[14];
1085 c->status[1].step_index = src[15];
1086 /* sign extend the predictors */
1088 diff_channel = c->status[1].predictor;
1090 /* the DK3_GET_NEXT_NIBBLE macro issues the break statement when
1091 * the buffer is consumed */
1094 /* for this algorithm, c->status[0] is the sum channel and
1095 * c->status[1] is the diff channel */
1097 /* process the first predictor of the sum channel */
1098 DK3_GET_NEXT_NIBBLE();
1099 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1101 /* process the diff channel predictor */
1102 DK3_GET_NEXT_NIBBLE();
1103 adpcm_ima_expand_nibble(&c->status[1], nibble, 3);
1105 /* process the first pair of stereo PCM samples */
1106 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1107 *samples++ = c->status[0].predictor + c->status[1].predictor;
1108 *samples++ = c->status[0].predictor - c->status[1].predictor;
1110 /* process the second predictor of the sum channel */
1111 DK3_GET_NEXT_NIBBLE();
1112 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1114 /* process the second pair of stereo PCM samples */
1115 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1116 *samples++ = c->status[0].predictor + c->status[1].predictor;
1117 *samples++ = c->status[0].predictor - c->status[1].predictor;
1120 case CODEC_ID_ADPCM_IMA_WS:
1121 /* no per-block initialization; just start decoding the data */
1122 while (src < buf + buf_size) {
1125 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1126 (src[0] >> 4) & 0x0F, 3);
1127 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1130 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1131 (src[0] >> 4) & 0x0F, 3);
1132 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1139 case CODEC_ID_ADPCM_XA:
1140 c->status[0].sample1 = c->status[0].sample2 =
1141 c->status[1].sample1 = c->status[1].sample2 = 0;
1142 while (buf_size >= 128) {
1143 xa_decode(samples, src, &c->status[0], &c->status[1],
1150 case CODEC_ID_ADPCM_EA:
1151 samples_in_chunk = AV_RL32(src);
1152 if (samples_in_chunk >= ((buf_size - 12) * 2)) {
1157 current_left_sample = (int16_t)AV_RL16(src);
1159 previous_left_sample = (int16_t)AV_RL16(src);
1161 current_right_sample = (int16_t)AV_RL16(src);
1163 previous_right_sample = (int16_t)AV_RL16(src);
1166 for (count1 = 0; count1 < samples_in_chunk/28;count1++) {
1167 coeff1l = ea_adpcm_table[(*src >> 4) & 0x0F];
1168 coeff2l = ea_adpcm_table[((*src >> 4) & 0x0F) + 4];
1169 coeff1r = ea_adpcm_table[*src & 0x0F];
1170 coeff2r = ea_adpcm_table[(*src & 0x0F) + 4];
1173 shift_left = ((*src >> 4) & 0x0F) + 8;
1174 shift_right = (*src & 0x0F) + 8;
1177 for (count2 = 0; count2 < 28; count2++) {
1178 next_left_sample = (((*src & 0xF0) << 24) >> shift_left);
1179 next_right_sample = (((*src & 0x0F) << 28) >> shift_right);
1182 next_left_sample = (next_left_sample +
1183 (current_left_sample * coeff1l) +
1184 (previous_left_sample * coeff2l) + 0x80) >> 8;
1185 next_right_sample = (next_right_sample +
1186 (current_right_sample * coeff1r) +
1187 (previous_right_sample * coeff2r) + 0x80) >> 8;
1188 CLAMP_TO_SHORT(next_left_sample);
1189 CLAMP_TO_SHORT(next_right_sample);
1191 previous_left_sample = current_left_sample;
1192 current_left_sample = next_left_sample;
1193 previous_right_sample = current_right_sample;
1194 current_right_sample = next_right_sample;
1195 *samples++ = (unsigned short)current_left_sample;
1196 *samples++ = (unsigned short)current_right_sample;
1200 case CODEC_ID_ADPCM_IMA_SMJPEG:
1201 c->status[0].predictor = *src;
1203 c->status[0].step_index = *src++;
1204 src++; /* skip another byte before getting to the meat */
1205 while (src < buf + buf_size) {
1206 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1208 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1209 (*src >> 4) & 0x0F, 3);
1213 case CODEC_ID_ADPCM_CT:
1214 while (src < buf + buf_size) {
1216 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1217 (src[0] >> 4) & 0x0F);
1218 *samples++ = adpcm_ct_expand_nibble(&c->status[1],
1221 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1222 (src[0] >> 4) & 0x0F);
1223 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1229 case CODEC_ID_ADPCM_SBPRO_4:
1230 case CODEC_ID_ADPCM_SBPRO_3:
1231 case CODEC_ID_ADPCM_SBPRO_2:
1232 if (!c->status[0].step_index) {
1233 /* the first byte is a raw sample */
1234 *samples++ = 128 * (*src++ - 0x80);
1236 *samples++ = 128 * (*src++ - 0x80);
1237 c->status[0].step_index = 1;
1239 if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_4) {
1240 while (src < buf + buf_size) {
1241 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1242 (src[0] >> 4) & 0x0F, 4, 0);
1243 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1244 src[0] & 0x0F, 4, 0);
1247 } else if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_3) {
1248 while (src < buf + buf_size && samples + 2 < samples_end) {
1249 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1250 (src[0] >> 5) & 0x07, 3, 0);
1251 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1252 (src[0] >> 2) & 0x07, 3, 0);
1253 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1254 src[0] & 0x03, 2, 0);
1258 while (src < buf + buf_size && samples + 3 < samples_end) {
1259 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1260 (src[0] >> 6) & 0x03, 2, 2);
1261 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1262 (src[0] >> 4) & 0x03, 2, 2);
1263 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1264 (src[0] >> 2) & 0x03, 2, 2);
1265 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1266 src[0] & 0x03, 2, 2);
1271 case CODEC_ID_ADPCM_SWF:
1275 int k0, signmask, nb_bits;
1276 int size = buf_size*8;
1278 init_get_bits(&gb, buf, size);
1280 //read bits & inital values
1281 nb_bits = get_bits(&gb, 2)+2;
1282 //av_log(NULL,AV_LOG_INFO,"nb_bits: %d\n", nb_bits);
1283 table = swf_index_tables[nb_bits-2];
1284 k0 = 1 << (nb_bits-2);
1285 signmask = 1 << (nb_bits-1);
1287 for (i = 0; i < avctx->channels; i++) {
1288 *samples++ = c->status[i].predictor = get_sbits(&gb, 16);
1289 c->status[i].step_index = get_bits(&gb, 6);
1292 while (get_bits_count(&gb) < size)
1296 for (i = 0; i < avctx->channels; i++) {
1297 // similar to IMA adpcm
1298 int delta = get_bits(&gb, nb_bits);
1299 int step = step_table[c->status[i].step_index];
1300 long vpdiff = 0; // vpdiff = (delta+0.5)*step/4
1311 if (delta & signmask)
1312 c->status[i].predictor -= vpdiff;
1314 c->status[i].predictor += vpdiff;
1316 c->status[i].step_index += table[delta & (~signmask)];
1318 c->status[i].step_index = av_clip(c->status[i].step_index, 0, 88);
1319 c->status[i].predictor = av_clip(c->status[i].predictor, -32768, 32767);
1321 *samples++ = c->status[i].predictor;
1322 if (samples >= samples_end) {
1323 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1331 case CODEC_ID_ADPCM_YAMAHA:
1332 while (src < buf + buf_size) {
1334 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1336 *samples++ = adpcm_yamaha_expand_nibble(&c->status[1],
1337 (src[0] >> 4) & 0x0F);
1339 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1341 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1342 (src[0] >> 4) & 0x0F);
1347 case CODEC_ID_ADPCM_THP:
1350 unsigned int samplecnt;
1354 if (buf_size < 80) {
1355 av_log(avctx, AV_LOG_ERROR, "frame too small\n");
1360 samplecnt = bytestream_get_be32(&src);
1362 for (i = 0; i < 32; i++)
1363 table[0][i] = (int16_t)bytestream_get_be16(&src);
1365 /* Initialize the previous sample. */
1366 for (i = 0; i < 4; i++)
1367 prev[0][i] = (int16_t)bytestream_get_be16(&src);
1369 if (samplecnt >= (samples_end - samples) / (st + 1)) {
1370 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1374 for (ch = 0; ch <= st; ch++) {
1375 samples = (unsigned short *) data + ch;
1377 /* Read in every sample for this channel. */
1378 for (i = 0; i < samplecnt / 14; i++) {
1379 int index = (*src >> 4) & 7;
1380 unsigned int exp = 28 - (*src++ & 15);
1381 int factor1 = table[ch][index * 2];
1382 int factor2 = table[ch][index * 2 + 1];
1384 /* Decode 14 samples. */
1385 for (n = 0; n < 14; n++) {
1387 if(n&1) sampledat= *src++ <<28;
1388 else sampledat= (*src&0xF0)<<24;
1390 sampledat = ((prev[ch][0]*factor1
1391 + prev[ch][1]*factor2) >> 11) + (sampledat>>exp);
1392 CLAMP_TO_SHORT(sampledat);
1393 *samples = sampledat;
1394 prev[ch][1] = prev[ch][0];
1395 prev[ch][0] = *samples++;
1397 /* In case of stereo, skip one sample, this sample
1398 is for the other channel. */
1404 /* In the previous loop, in case stereo is used, samples is
1405 increased exactly one time too often. */
1413 *data_size = (uint8_t *)samples - (uint8_t *)data;
1419 #ifdef CONFIG_ENCODERS
1420 #define ADPCM_ENCODER(id,name) \
1421 AVCodec name ## _encoder = { \
1425 sizeof(ADPCMContext), \
1426 adpcm_encode_init, \
1427 adpcm_encode_frame, \
1428 adpcm_encode_close, \
1432 #define ADPCM_ENCODER(id,name)
1435 #ifdef CONFIG_DECODERS
1436 #define ADPCM_DECODER(id,name) \
1437 AVCodec name ## _decoder = { \
1441 sizeof(ADPCMContext), \
1442 adpcm_decode_init, \
1445 adpcm_decode_frame, \
1448 #define ADPCM_DECODER(id,name)
1451 #define ADPCM_CODEC(id, name) \
1452 ADPCM_ENCODER(id,name) ADPCM_DECODER(id,name)
1454 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt);
1455 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav);
1456 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3);
1457 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4);
1458 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws);
1459 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg);
1460 ADPCM_CODEC(CODEC_ID_ADPCM_MS, adpcm_ms);
1461 ADPCM_CODEC(CODEC_ID_ADPCM_4XM, adpcm_4xm);
1462 ADPCM_CODEC(CODEC_ID_ADPCM_XA, adpcm_xa);
1463 ADPCM_CODEC(CODEC_ID_ADPCM_EA, adpcm_ea);
1464 ADPCM_CODEC(CODEC_ID_ADPCM_CT, adpcm_ct);
1465 ADPCM_CODEC(CODEC_ID_ADPCM_SWF, adpcm_swf);
1466 ADPCM_CODEC(CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha);
1467 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4);
1468 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3);
1469 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2);
1470 ADPCM_CODEC(CODEC_ID_ADPCM_THP, adpcm_thp);