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];
148 short sample_buffer[32]; /* hold left samples while waiting for right samples */
151 /* XXX: implement encoding */
153 #ifdef CONFIG_ENCODERS
154 static int adpcm_encode_init(AVCodecContext *avctx)
156 if (avctx->channels > 2)
157 return -1; /* only stereo or mono =) */
158 switch(avctx->codec->id) {
159 case CODEC_ID_ADPCM_IMA_QT:
160 av_log(avctx, AV_LOG_ERROR, "ADPCM: codec adpcm_ima_qt unsupported for encoding !\n");
161 avctx->frame_size = 64; /* XXX: can multiple of avctx->channels * 64 (left and right blocks are interleaved) */
164 case CODEC_ID_ADPCM_IMA_WAV:
165 avctx->frame_size = (BLKSIZE - 4 * avctx->channels) * 8 / (4 * avctx->channels) + 1; /* each 16 bits sample gives one nibble */
166 /* and we have 4 bytes per channel overhead */
167 avctx->block_align = BLKSIZE;
168 /* seems frame_size isn't taken into account... have to buffer the samples :-( */
170 case CODEC_ID_ADPCM_MS:
171 avctx->frame_size = (BLKSIZE - 7 * avctx->channels) * 2 / avctx->channels + 2; /* each 16 bits sample gives one nibble */
172 /* and we have 7 bytes per channel overhead */
173 avctx->block_align = BLKSIZE;
175 case CODEC_ID_ADPCM_YAMAHA:
176 avctx->frame_size = BLKSIZE * avctx->channels;
177 avctx->block_align = BLKSIZE;
179 case CODEC_ID_ADPCM_SWF:
180 if (avctx->sample_rate != 11025 &&
181 avctx->sample_rate != 22050 &&
182 avctx->sample_rate != 44100) {
183 av_log(avctx, AV_LOG_ERROR, "Sample rate must be 11025, 22050 or 44100\n");
186 avctx->frame_size = 512 * (avctx->sample_rate / 11025);
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 += ((step_table[c->step_index] * yamaha_difflookup[nibble]) / 8);
212 c->prev_sample = av_clip_int16(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;
232 c->sample2 = c->sample1;
233 c->sample1 = av_clip_int16(predictor);
235 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
236 if (c->idelta < 16) c->idelta = 16;
241 static inline unsigned char adpcm_yamaha_compress_sample(ADPCMChannelStatus *c, short sample)
250 delta = sample - c->predictor;
252 nibble = FFMIN(7, abs(delta)*4/c->step) + (delta<0)*8;
254 c->predictor += ((c->step * yamaha_difflookup[nibble]) / 8);
255 c->predictor = av_clip_int16(c->predictor);
256 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
257 c->step = av_clip(c->step, 127, 24567);
262 typedef struct TrellisPath {
267 typedef struct TrellisNode {
275 static void adpcm_compress_trellis(AVCodecContext *avctx, const short *samples,
276 uint8_t *dst, ADPCMChannelStatus *c, int n)
278 #define FREEZE_INTERVAL 128
279 //FIXME 6% faster if frontier is a compile-time constant
280 const int frontier = 1 << avctx->trellis;
281 const int stride = avctx->channels;
282 const int version = avctx->codec->id;
283 const int max_paths = frontier*FREEZE_INTERVAL;
284 TrellisPath paths[max_paths], *p;
285 TrellisNode node_buf[2][frontier];
286 TrellisNode *nodep_buf[2][frontier];
287 TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
288 TrellisNode **nodes_next = nodep_buf[1];
289 int pathn = 0, froze = -1, i, j, k;
291 assert(!(max_paths&(max_paths-1)));
293 memset(nodep_buf, 0, sizeof(nodep_buf));
294 nodes[0] = &node_buf[1][0];
297 nodes[0]->step = c->step_index;
298 nodes[0]->sample1 = c->sample1;
299 nodes[0]->sample2 = c->sample2;
300 if(version == CODEC_ID_ADPCM_IMA_WAV)
301 nodes[0]->sample1 = c->prev_sample;
302 if(version == CODEC_ID_ADPCM_MS)
303 nodes[0]->step = c->idelta;
304 if(version == CODEC_ID_ADPCM_YAMAHA) {
306 nodes[0]->step = 127;
307 nodes[0]->sample1 = 0;
309 nodes[0]->step = c->step;
310 nodes[0]->sample1 = c->predictor;
315 TrellisNode *t = node_buf[i&1];
317 int sample = samples[i*stride];
318 memset(nodes_next, 0, frontier*sizeof(TrellisNode*));
319 for(j=0; j<frontier && nodes[j]; j++) {
320 // higher j have higher ssd already, so they're unlikely to use a suboptimal next sample too
321 const int range = (j < frontier/2) ? 1 : 0;
322 const int step = nodes[j]->step;
324 if(version == CODEC_ID_ADPCM_MS) {
325 const int predictor = ((nodes[j]->sample1 * c->coeff1) + (nodes[j]->sample2 * c->coeff2)) / 256;
326 const int div = (sample - predictor) / step;
327 const int nmin = av_clip(div-range, -8, 6);
328 const int nmax = av_clip(div+range, -7, 7);
329 for(nidx=nmin; nidx<=nmax; nidx++) {
330 const int nibble = nidx & 0xf;
331 int dec_sample = predictor + nidx * step;
332 #define STORE_NODE(NAME, STEP_INDEX)\
335 dec_sample = av_clip_int16(dec_sample);\
336 d = sample - dec_sample;\
337 ssd = nodes[j]->ssd + d*d;\
338 if(nodes_next[frontier-1] && ssd >= nodes_next[frontier-1]->ssd)\
340 /* Collapse any two states with the same previous sample value. \
341 * One could also distinguish states by step and by 2nd to last
342 * sample, but the effects of that are negligible. */\
343 for(k=0; k<frontier && nodes_next[k]; k++) {\
344 if(dec_sample == nodes_next[k]->sample1) {\
345 assert(ssd >= nodes_next[k]->ssd);\
349 for(k=0; k<frontier; k++) {\
350 if(!nodes_next[k] || ssd < nodes_next[k]->ssd) {\
351 TrellisNode *u = nodes_next[frontier-1];\
353 assert(pathn < max_paths);\
358 u->step = STEP_INDEX;\
359 u->sample2 = nodes[j]->sample1;\
360 u->sample1 = dec_sample;\
361 paths[u->path].nibble = nibble;\
362 paths[u->path].prev = nodes[j]->path;\
363 memmove(&nodes_next[k+1], &nodes_next[k], (frontier-k-1)*sizeof(TrellisNode*));\
369 STORE_NODE(ms, FFMAX(16, (AdaptationTable[nibble] * step) >> 8));
371 } else if(version == CODEC_ID_ADPCM_IMA_WAV) {
372 #define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\
373 const int predictor = nodes[j]->sample1;\
374 const int div = (sample - predictor) * 4 / STEP_TABLE;\
375 int nmin = av_clip(div-range, -7, 6);\
376 int nmax = av_clip(div+range, -6, 7);\
377 if(nmin<=0) nmin--; /* distinguish -0 from +0 */\
379 for(nidx=nmin; nidx<=nmax; nidx++) {\
380 const int nibble = nidx<0 ? 7-nidx : nidx;\
381 int dec_sample = predictor + (STEP_TABLE * yamaha_difflookup[nibble]) / 8;\
382 STORE_NODE(NAME, STEP_INDEX);\
384 LOOP_NODES(ima, step_table[step], av_clip(step + index_table[nibble], 0, 88));
385 } else { //CODEC_ID_ADPCM_YAMAHA
386 LOOP_NODES(yamaha, step, av_clip((step * yamaha_indexscale[nibble]) >> 8, 127, 24567));
397 if(nodes[0]->ssd > (1<<28)) {
398 for(j=1; j<frontier && nodes[j]; j++)
399 nodes[j]->ssd -= nodes[0]->ssd;
403 // merge old paths to save memory
404 if(i == froze + FREEZE_INTERVAL) {
405 p = &paths[nodes[0]->path];
406 for(k=i; k>froze; k--) {
412 // other nodes might use paths that don't coincide with the frozen one.
413 // checking which nodes do so is too slow, so just kill them all.
414 // this also slightly improves quality, but I don't know why.
415 memset(nodes+1, 0, (frontier-1)*sizeof(TrellisNode*));
419 p = &paths[nodes[0]->path];
420 for(i=n-1; i>froze; i--) {
425 c->predictor = nodes[0]->sample1;
426 c->sample1 = nodes[0]->sample1;
427 c->sample2 = nodes[0]->sample2;
428 c->step_index = nodes[0]->step;
429 c->step = nodes[0]->step;
430 c->idelta = nodes[0]->step;
433 static int adpcm_encode_frame(AVCodecContext *avctx,
434 unsigned char *frame, int buf_size, void *data)
439 ADPCMContext *c = avctx->priv_data;
442 samples = (short *)data;
443 st= avctx->channels == 2;
444 /* n = (BLKSIZE - 4 * avctx->channels) / (2 * 8 * avctx->channels); */
446 switch(avctx->codec->id) {
447 case CODEC_ID_ADPCM_IMA_QT: /* XXX: can't test until we get .mov writer */
449 case CODEC_ID_ADPCM_IMA_WAV:
450 n = avctx->frame_size / 8;
451 c->status[0].prev_sample = (signed short)samples[0]; /* XXX */
452 /* c->status[0].step_index = 0; *//* XXX: not sure how to init the state machine */
453 bytestream_put_le16(&dst, c->status[0].prev_sample);
454 *dst++ = (unsigned char)c->status[0].step_index;
455 *dst++ = 0; /* unknown */
457 if (avctx->channels == 2) {
458 c->status[1].prev_sample = (signed short)samples[1];
459 /* c->status[1].step_index = 0; */
460 bytestream_put_le16(&dst, c->status[1].prev_sample);
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_SWF:
520 init_put_bits(&pb, dst, buf_size*8);
522 //Store AdpcmCodeSize
523 put_bits(&pb, 2, 2); //Set 4bits flash adpcm format
525 //Init the encoder state
526 for(i=0; i<avctx->channels; i++){
527 c->status[i].step_index = av_clip(c->status[i].step_index, 0, 63); // clip step so it fits 6 bits
528 put_bits(&pb, 16, samples[i] & 0xFFFF);
529 put_bits(&pb, 6, c->status[i].step_index);
530 c->status[i].prev_sample = (signed short)samples[i];
533 for (i=1; i<avctx->frame_size; i++) {
534 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels*i]) & 0xF);
535 if (avctx->channels == 2)
536 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[1], samples[2*i+1]) & 0xF);
539 dst += put_bits_count(&pb)>>3;
542 case CODEC_ID_ADPCM_MS:
543 for(i=0; i<avctx->channels; i++){
547 c->status[i].coeff1 = AdaptCoeff1[predictor];
548 c->status[i].coeff2 = AdaptCoeff2[predictor];
550 for(i=0; i<avctx->channels; i++){
551 if (c->status[i].idelta < 16)
552 c->status[i].idelta = 16;
554 bytestream_put_le16(&dst, c->status[i].idelta);
556 for(i=0; i<avctx->channels; i++){
557 c->status[i].sample1= *samples++;
559 bytestream_put_le16(&dst, c->status[i].sample1);
561 for(i=0; i<avctx->channels; i++){
562 c->status[i].sample2= *samples++;
564 bytestream_put_le16(&dst, c->status[i].sample2);
567 if(avctx->trellis > 0) {
568 int n = avctx->block_align - 7*avctx->channels;
570 if(avctx->channels == 1) {
572 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
574 *dst++ = (buf[0][i] << 4) | buf[0][i+1];
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] << 4) | buf[1][i];
582 for(i=7*avctx->channels; i<avctx->block_align; i++) {
584 nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++)<<4;
585 nibble|= adpcm_ms_compress_sample(&c->status[st], *samples++);
589 case CODEC_ID_ADPCM_YAMAHA:
590 n = avctx->frame_size / 2;
591 if(avctx->trellis > 0) {
594 if(avctx->channels == 1) {
595 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
597 *dst++ = buf[0][i] | (buf[0][i+1] << 4);
599 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
600 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
602 *dst++ = buf[0][i] | (buf[1][i] << 4);
606 for(i = 0; i < avctx->channels; i++) {
608 nibble = adpcm_yamaha_compress_sample(&c->status[i], samples[i]);
609 nibble |= adpcm_yamaha_compress_sample(&c->status[i], samples[i+avctx->channels]) << 4;
612 samples += 2 * avctx->channels;
620 #endif //CONFIG_ENCODERS
622 static int adpcm_decode_init(AVCodecContext * avctx)
624 ADPCMContext *c = avctx->priv_data;
626 if(avctx->channels > 2U){
631 c->status[0].predictor = c->status[1].predictor = 0;
632 c->status[0].step_index = c->status[1].step_index = 0;
633 c->status[0].step = c->status[1].step = 0;
635 switch(avctx->codec->id) {
636 case CODEC_ID_ADPCM_CT:
637 c->status[0].step = c->status[1].step = 511;
639 case CODEC_ID_ADPCM_IMA_WS:
640 if (avctx->extradata && avctx->extradata_size == 2 * 4) {
641 c->status[0].predictor = AV_RL32(avctx->extradata);
642 c->status[1].predictor = AV_RL32(avctx->extradata + 4);
651 static inline short adpcm_ima_expand_nibble(ADPCMChannelStatus *c, char nibble, int shift)
655 int sign, delta, diff, step;
657 step = step_table[c->step_index];
658 step_index = c->step_index + index_table[(unsigned)nibble];
659 if (step_index < 0) step_index = 0;
660 else if (step_index > 88) step_index = 88;
664 /* perform direct multiplication instead of series of jumps proposed by
665 * the reference ADPCM implementation since modern CPUs can do the mults
667 diff = ((2 * delta + 1) * step) >> shift;
668 predictor = c->predictor;
669 if (sign) predictor -= diff;
670 else predictor += diff;
672 c->predictor = av_clip_int16(predictor);
673 c->step_index = step_index;
675 return (short)c->predictor;
678 static inline short adpcm_ms_expand_nibble(ADPCMChannelStatus *c, char nibble)
682 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;
683 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
685 c->sample2 = c->sample1;
686 c->sample1 = av_clip_int16(predictor);
687 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
688 if (c->idelta < 16) c->idelta = 16;
693 static inline short adpcm_ct_expand_nibble(ADPCMChannelStatus *c, char nibble)
695 int sign, delta, diff;
700 /* perform direct multiplication instead of series of jumps proposed by
701 * the reference ADPCM implementation since modern CPUs can do the mults
703 diff = ((2 * delta + 1) * c->step) >> 3;
704 /* predictor update is not so trivial: predictor is multiplied on 254/256 before updating */
705 c->predictor = ((c->predictor * 254) >> 8) + (sign ? -diff : diff);
706 c->predictor = av_clip_int16(c->predictor);
707 /* calculate new step and clamp it to range 511..32767 */
708 new_step = (ct_adpcm_table[nibble & 7] * c->step) >> 8;
715 return (short)c->predictor;
718 static inline short adpcm_sbpro_expand_nibble(ADPCMChannelStatus *c, char nibble, int size, int shift)
720 int sign, delta, diff;
722 sign = nibble & (1<<(size-1));
723 delta = nibble & ((1<<(size-1))-1);
724 diff = delta << (7 + c->step + shift);
727 c->predictor -= diff;
729 c->predictor += diff;
732 if (c->predictor > 16256)
733 c->predictor = 16256;
734 else if (c->predictor < -16384)
735 c->predictor = -16384;
737 /* calculate new step */
738 if (delta >= (2*size - 3) && c->step < 3)
740 else if (delta == 0 && c->step > 0)
743 return (short) c->predictor;
746 static inline short adpcm_yamaha_expand_nibble(ADPCMChannelStatus *c, unsigned char nibble)
753 c->predictor += (c->step * yamaha_difflookup[nibble]) / 8;
754 c->predictor = av_clip_int16(c->predictor);
755 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
756 c->step = av_clip(c->step, 127, 24567);
760 static void xa_decode(short *out, const unsigned char *in,
761 ADPCMChannelStatus *left, ADPCMChannelStatus *right, int inc)
764 int shift,filter,f0,f1;
770 shift = 12 - (in[4+i*2] & 15);
771 filter = in[4+i*2] >> 4;
772 f0 = xa_adpcm_table[filter][0];
773 f1 = xa_adpcm_table[filter][1];
781 t = (signed char)(d<<4)>>4;
782 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
784 s_1 = av_clip_int16(s);
789 if (inc==2) { /* stereo */
792 s_1 = right->sample1;
793 s_2 = right->sample2;
794 out = out + 1 - 28*2;
797 shift = 12 - (in[5+i*2] & 15);
798 filter = in[5+i*2] >> 4;
800 f0 = xa_adpcm_table[filter][0];
801 f1 = xa_adpcm_table[filter][1];
806 t = (signed char)d >> 4;
807 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
809 s_1 = av_clip_int16(s);
814 if (inc==2) { /* stereo */
815 right->sample1 = s_1;
816 right->sample2 = s_2;
826 /* DK3 ADPCM support macro */
827 #define DK3_GET_NEXT_NIBBLE() \
828 if (decode_top_nibble_next) \
830 nibble = (last_byte >> 4) & 0x0F; \
831 decode_top_nibble_next = 0; \
835 last_byte = *src++; \
836 if (src >= buf + buf_size) break; \
837 nibble = last_byte & 0x0F; \
838 decode_top_nibble_next = 1; \
841 static int adpcm_decode_frame(AVCodecContext *avctx,
842 void *data, int *data_size,
843 uint8_t *buf, int buf_size)
845 ADPCMContext *c = avctx->priv_data;
846 ADPCMChannelStatus *cs;
847 int n, m, channel, i;
848 int block_predictor[2];
854 /* DK3 ADPCM accounting variables */
855 unsigned char last_byte = 0;
856 unsigned char nibble;
857 int decode_top_nibble_next = 0;
860 /* EA ADPCM state variables */
861 uint32_t samples_in_chunk;
862 int32_t previous_left_sample, previous_right_sample;
863 int32_t current_left_sample, current_right_sample;
864 int32_t next_left_sample, next_right_sample;
865 int32_t coeff1l, coeff2l, coeff1r, coeff2r;
866 uint8_t shift_left, shift_right;
872 //should protect all 4bit ADPCM variants
873 //8 is needed for CODEC_ID_ADPCM_IMA_WAV with 2 channels
875 if(*data_size/4 < buf_size + 8)
879 samples_end= samples + *data_size/2;
883 st = avctx->channels == 2 ? 1 : 0;
885 switch(avctx->codec->id) {
886 case CODEC_ID_ADPCM_IMA_QT:
887 n = (buf_size - 2);/* >> 2*avctx->channels;*/
888 channel = c->channel;
889 cs = &(c->status[channel]);
890 /* (pppppp) (piiiiiii) */
892 /* Bits 15-7 are the _top_ 9 bits of the 16-bit initial predictor value */
893 cs->predictor = (*src++) << 8;
894 cs->predictor |= (*src & 0x80);
895 cs->predictor &= 0xFF80;
898 if(cs->predictor & 0x8000)
899 cs->predictor -= 0x10000;
901 cs->predictor = av_clip_int16(cs->predictor);
903 cs->step_index = (*src++) & 0x7F;
905 if (cs->step_index > 88){
906 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
910 cs->step = step_table[cs->step_index];
915 for(m=32; n>0 && m>0; n--, m--) { /* in QuickTime, IMA is encoded by chuncks of 34 bytes (=64 samples) */
916 *samples = adpcm_ima_expand_nibble(cs, src[0] & 0x0F, 3);
917 samples += avctx->channels;
918 *samples = adpcm_ima_expand_nibble(cs, (src[0] >> 4) & 0x0F, 3);
919 samples += avctx->channels;
923 if(st) { /* handle stereo interlacing */
924 c->channel = (channel + 1) % 2; /* we get one packet for left, then one for right data */
925 if(channel == 1) { /* wait for the other packet before outputing anything */
930 case CODEC_ID_ADPCM_IMA_WAV:
931 if (avctx->block_align != 0 && buf_size > avctx->block_align)
932 buf_size = avctx->block_align;
934 // samples_per_block= (block_align-4*chanels)*8 / (bits_per_sample * chanels) + 1;
936 for(i=0; i<avctx->channels; i++){
937 cs = &(c->status[i]);
938 cs->predictor = (int16_t)(src[0] + (src[1]<<8));
941 // XXX: is this correct ??: *samples++ = cs->predictor;
943 cs->step_index = *src++;
944 if (cs->step_index > 88){
945 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
948 if (*src++) av_log(avctx, AV_LOG_ERROR, "unused byte should be null but is %d!!\n", src[-1]); /* unused */
951 while(src < buf + buf_size){
954 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] & 0x0F, 3);
956 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] >> 4 , 3);
962 case CODEC_ID_ADPCM_4XM:
963 cs = &(c->status[0]);
964 c->status[0].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
966 c->status[1].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
968 c->status[0].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
970 c->status[1].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
972 if (cs->step_index < 0) cs->step_index = 0;
973 if (cs->step_index > 88) cs->step_index = 88;
975 m= (buf_size - (src - buf))>>st;
977 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] & 0x0F, 4);
979 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] & 0x0F, 4);
980 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] >> 4, 4);
982 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] >> 4, 4);
988 case CODEC_ID_ADPCM_MS:
989 if (avctx->block_align != 0 && buf_size > avctx->block_align)
990 buf_size = avctx->block_align;
991 n = buf_size - 7 * avctx->channels;
994 block_predictor[0] = av_clip(*src++, 0, 7);
995 block_predictor[1] = 0;
997 block_predictor[1] = av_clip(*src++, 0, 7);
998 c->status[0].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1001 c->status[1].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1004 c->status[0].coeff1 = AdaptCoeff1[block_predictor[0]];
1005 c->status[0].coeff2 = AdaptCoeff2[block_predictor[0]];
1006 c->status[1].coeff1 = AdaptCoeff1[block_predictor[1]];
1007 c->status[1].coeff2 = AdaptCoeff2[block_predictor[1]];
1009 c->status[0].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1011 if (st) c->status[1].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1013 c->status[0].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1015 if (st) c->status[1].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1018 *samples++ = c->status[0].sample1;
1019 if (st) *samples++ = c->status[1].sample1;
1020 *samples++ = c->status[0].sample2;
1021 if (st) *samples++ = c->status[1].sample2;
1023 *samples++ = adpcm_ms_expand_nibble(&c->status[0], (src[0] >> 4) & 0x0F);
1024 *samples++ = adpcm_ms_expand_nibble(&c->status[st], src[0] & 0x0F);
1028 case CODEC_ID_ADPCM_IMA_DK4:
1029 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1030 buf_size = avctx->block_align;
1032 c->status[0].predictor = (int16_t)(src[0] | (src[1] << 8));
1033 c->status[0].step_index = src[2];
1035 *samples++ = c->status[0].predictor;
1037 c->status[1].predictor = (int16_t)(src[0] | (src[1] << 8));
1038 c->status[1].step_index = src[2];
1040 *samples++ = c->status[1].predictor;
1042 while (src < buf + buf_size) {
1044 /* take care of the top nibble (always left or mono channel) */
1045 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1046 (src[0] >> 4) & 0x0F, 3);
1048 /* take care of the bottom nibble, which is right sample for
1049 * stereo, or another mono sample */
1051 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1054 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1060 case CODEC_ID_ADPCM_IMA_DK3:
1061 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1062 buf_size = avctx->block_align;
1064 if(buf_size + 16 > (samples_end - samples)*3/8)
1067 c->status[0].predictor = (int16_t)(src[10] | (src[11] << 8));
1068 c->status[1].predictor = (int16_t)(src[12] | (src[13] << 8));
1069 c->status[0].step_index = src[14];
1070 c->status[1].step_index = src[15];
1071 /* sign extend the predictors */
1073 diff_channel = c->status[1].predictor;
1075 /* the DK3_GET_NEXT_NIBBLE macro issues the break statement when
1076 * the buffer is consumed */
1079 /* for this algorithm, c->status[0] is the sum channel and
1080 * c->status[1] is the diff channel */
1082 /* process the first predictor of the sum channel */
1083 DK3_GET_NEXT_NIBBLE();
1084 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1086 /* process the diff channel predictor */
1087 DK3_GET_NEXT_NIBBLE();
1088 adpcm_ima_expand_nibble(&c->status[1], nibble, 3);
1090 /* process the first pair of stereo PCM samples */
1091 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1092 *samples++ = c->status[0].predictor + c->status[1].predictor;
1093 *samples++ = c->status[0].predictor - c->status[1].predictor;
1095 /* process the second predictor of the sum channel */
1096 DK3_GET_NEXT_NIBBLE();
1097 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1099 /* process the second pair of stereo PCM samples */
1100 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1101 *samples++ = c->status[0].predictor + c->status[1].predictor;
1102 *samples++ = c->status[0].predictor - c->status[1].predictor;
1105 case CODEC_ID_ADPCM_IMA_WS:
1106 /* no per-block initialization; just start decoding the data */
1107 while (src < buf + buf_size) {
1110 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1111 (src[0] >> 4) & 0x0F, 3);
1112 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1115 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1116 (src[0] >> 4) & 0x0F, 3);
1117 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1124 case CODEC_ID_ADPCM_XA:
1125 c->status[0].sample1 = c->status[0].sample2 =
1126 c->status[1].sample1 = c->status[1].sample2 = 0;
1127 while (buf_size >= 128) {
1128 xa_decode(samples, src, &c->status[0], &c->status[1],
1135 case CODEC_ID_ADPCM_EA:
1136 samples_in_chunk = AV_RL32(src);
1137 if (samples_in_chunk >= ((buf_size - 12) * 2)) {
1142 current_left_sample = (int16_t)AV_RL16(src);
1144 previous_left_sample = (int16_t)AV_RL16(src);
1146 current_right_sample = (int16_t)AV_RL16(src);
1148 previous_right_sample = (int16_t)AV_RL16(src);
1151 for (count1 = 0; count1 < samples_in_chunk/28;count1++) {
1152 coeff1l = ea_adpcm_table[(*src >> 4) & 0x0F];
1153 coeff2l = ea_adpcm_table[((*src >> 4) & 0x0F) + 4];
1154 coeff1r = ea_adpcm_table[*src & 0x0F];
1155 coeff2r = ea_adpcm_table[(*src & 0x0F) + 4];
1158 shift_left = ((*src >> 4) & 0x0F) + 8;
1159 shift_right = (*src & 0x0F) + 8;
1162 for (count2 = 0; count2 < 28; count2++) {
1163 next_left_sample = (((*src & 0xF0) << 24) >> shift_left);
1164 next_right_sample = (((*src & 0x0F) << 28) >> shift_right);
1167 next_left_sample = (next_left_sample +
1168 (current_left_sample * coeff1l) +
1169 (previous_left_sample * coeff2l) + 0x80) >> 8;
1170 next_right_sample = (next_right_sample +
1171 (current_right_sample * coeff1r) +
1172 (previous_right_sample * coeff2r) + 0x80) >> 8;
1174 previous_left_sample = current_left_sample;
1175 current_left_sample = av_clip_int16(next_left_sample);
1176 previous_right_sample = current_right_sample;
1177 current_right_sample = av_clip_int16(next_right_sample);
1178 *samples++ = (unsigned short)current_left_sample;
1179 *samples++ = (unsigned short)current_right_sample;
1183 case CODEC_ID_ADPCM_IMA_SMJPEG:
1184 c->status[0].predictor = *src;
1186 c->status[0].step_index = *src++;
1187 src++; /* skip another byte before getting to the meat */
1188 while (src < buf + buf_size) {
1189 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1191 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1192 (*src >> 4) & 0x0F, 3);
1196 case CODEC_ID_ADPCM_CT:
1197 while (src < buf + buf_size) {
1199 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1200 (src[0] >> 4) & 0x0F);
1201 *samples++ = adpcm_ct_expand_nibble(&c->status[1],
1204 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1205 (src[0] >> 4) & 0x0F);
1206 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1212 case CODEC_ID_ADPCM_SBPRO_4:
1213 case CODEC_ID_ADPCM_SBPRO_3:
1214 case CODEC_ID_ADPCM_SBPRO_2:
1215 if (!c->status[0].step_index) {
1216 /* the first byte is a raw sample */
1217 *samples++ = 128 * (*src++ - 0x80);
1219 *samples++ = 128 * (*src++ - 0x80);
1220 c->status[0].step_index = 1;
1222 if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_4) {
1223 while (src < buf + buf_size) {
1224 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1225 (src[0] >> 4) & 0x0F, 4, 0);
1226 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1227 src[0] & 0x0F, 4, 0);
1230 } else if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_3) {
1231 while (src < buf + buf_size && samples + 2 < samples_end) {
1232 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1233 (src[0] >> 5) & 0x07, 3, 0);
1234 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1235 (src[0] >> 2) & 0x07, 3, 0);
1236 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1237 src[0] & 0x03, 2, 0);
1241 while (src < buf + buf_size && samples + 3 < samples_end) {
1242 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1243 (src[0] >> 6) & 0x03, 2, 2);
1244 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1245 (src[0] >> 4) & 0x03, 2, 2);
1246 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1247 (src[0] >> 2) & 0x03, 2, 2);
1248 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1249 src[0] & 0x03, 2, 2);
1254 case CODEC_ID_ADPCM_SWF:
1258 int k0, signmask, nb_bits, count;
1259 int size = buf_size*8;
1261 init_get_bits(&gb, buf, size);
1263 //read bits & initial values
1264 nb_bits = get_bits(&gb, 2)+2;
1265 //av_log(NULL,AV_LOG_INFO,"nb_bits: %d\n", nb_bits);
1266 table = swf_index_tables[nb_bits-2];
1267 k0 = 1 << (nb_bits-2);
1268 signmask = 1 << (nb_bits-1);
1270 while (get_bits_count(&gb) <= size - 22*avctx->channels) {
1271 for (i = 0; i < avctx->channels; i++) {
1272 *samples++ = c->status[i].predictor = get_sbits(&gb, 16);
1273 c->status[i].step_index = get_bits(&gb, 6);
1276 for (count = 0; get_bits_count(&gb) <= size - nb_bits*avctx->channels && count < 4095; count++) {
1279 for (i = 0; i < avctx->channels; i++) {
1280 // similar to IMA adpcm
1281 int delta = get_bits(&gb, nb_bits);
1282 int step = step_table[c->status[i].step_index];
1283 long vpdiff = 0; // vpdiff = (delta+0.5)*step/4
1294 if (delta & signmask)
1295 c->status[i].predictor -= vpdiff;
1297 c->status[i].predictor += vpdiff;
1299 c->status[i].step_index += table[delta & (~signmask)];
1301 c->status[i].step_index = av_clip(c->status[i].step_index, 0, 88);
1302 c->status[i].predictor = av_clip_int16(c->status[i].predictor);
1304 *samples++ = c->status[i].predictor;
1305 if (samples >= samples_end) {
1306 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1315 case CODEC_ID_ADPCM_YAMAHA:
1316 while (src < buf + buf_size) {
1318 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1320 *samples++ = adpcm_yamaha_expand_nibble(&c->status[1],
1321 (src[0] >> 4) & 0x0F);
1323 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1325 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1326 (src[0] >> 4) & 0x0F);
1331 case CODEC_ID_ADPCM_THP:
1334 unsigned int samplecnt;
1338 if (buf_size < 80) {
1339 av_log(avctx, AV_LOG_ERROR, "frame too small\n");
1344 samplecnt = bytestream_get_be32(&src);
1346 for (i = 0; i < 32; i++)
1347 table[0][i] = (int16_t)bytestream_get_be16(&src);
1349 /* Initialize the previous sample. */
1350 for (i = 0; i < 4; i++)
1351 prev[0][i] = (int16_t)bytestream_get_be16(&src);
1353 if (samplecnt >= (samples_end - samples) / (st + 1)) {
1354 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1358 for (ch = 0; ch <= st; ch++) {
1359 samples = (unsigned short *) data + ch;
1361 /* Read in every sample for this channel. */
1362 for (i = 0; i < samplecnt / 14; i++) {
1363 int index = (*src >> 4) & 7;
1364 unsigned int exp = 28 - (*src++ & 15);
1365 int factor1 = table[ch][index * 2];
1366 int factor2 = table[ch][index * 2 + 1];
1368 /* Decode 14 samples. */
1369 for (n = 0; n < 14; n++) {
1371 if(n&1) sampledat= *src++ <<28;
1372 else sampledat= (*src&0xF0)<<24;
1374 sampledat = ((prev[ch][0]*factor1
1375 + prev[ch][1]*factor2) >> 11) + (sampledat>>exp);
1376 *samples = av_clip_int16(sampledat);
1377 prev[ch][1] = prev[ch][0];
1378 prev[ch][0] = *samples++;
1380 /* In case of stereo, skip one sample, this sample
1381 is for the other channel. */
1387 /* In the previous loop, in case stereo is used, samples is
1388 increased exactly one time too often. */
1396 *data_size = (uint8_t *)samples - (uint8_t *)data;
1402 #ifdef CONFIG_ENCODERS
1403 #define ADPCM_ENCODER(id,name) \
1404 AVCodec name ## _encoder = { \
1408 sizeof(ADPCMContext), \
1409 adpcm_encode_init, \
1410 adpcm_encode_frame, \
1411 adpcm_encode_close, \
1415 #define ADPCM_ENCODER(id,name)
1418 #ifdef CONFIG_DECODERS
1419 #define ADPCM_DECODER(id,name) \
1420 AVCodec name ## _decoder = { \
1424 sizeof(ADPCMContext), \
1425 adpcm_decode_init, \
1428 adpcm_decode_frame, \
1431 #define ADPCM_DECODER(id,name)
1434 #define ADPCM_CODEC(id, name) \
1435 ADPCM_ENCODER(id,name) ADPCM_DECODER(id,name)
1437 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt);
1438 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav);
1439 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3);
1440 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4);
1441 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws);
1442 ADPCM_CODEC(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg);
1443 ADPCM_CODEC(CODEC_ID_ADPCM_MS, adpcm_ms);
1444 ADPCM_CODEC(CODEC_ID_ADPCM_4XM, adpcm_4xm);
1445 ADPCM_CODEC(CODEC_ID_ADPCM_XA, adpcm_xa);
1446 ADPCM_CODEC(CODEC_ID_ADPCM_EA, adpcm_ea);
1447 ADPCM_CODEC(CODEC_ID_ADPCM_CT, adpcm_ct);
1448 ADPCM_CODEC(CODEC_ID_ADPCM_SWF, adpcm_swf);
1449 ADPCM_CODEC(CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha);
1450 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4);
1451 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3);
1452 ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2);
1453 ADPCM_CODEC(CODEC_ID_ADPCM_THP, adpcm_thp);