falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
11377 Commits
32 Branches
369MB
Tree: 4f95f80e2d
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '4f95f80e2d'
${ noResults }
FFmpeg/libavcodec/adpcm.c

1574 lines
56KB
Raw Blame History 

  1. /*

  2.  * ADPCM codecs

  3.  * Copyright (c) 2001-2003 The ffmpeg Project

  4.  *

  5.  * This file is part of FFmpeg.

  6.  *

  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.

  11.  *

  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.

  16.  *

  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

  20.  */

  21. #include "avcodec.h"

  22. #include "bitstream.h"

  23. #include "bytestream.h"

  24. 

  25. /**

  26.  * @file adpcm.c

  27.  * ADPCM codecs.

  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.  * EA ADPCM R1/R2/R3 decoder by Peter Ross (pross@xvid.org)

  34.  * EA IMA EACS decoder by Peter Ross (pross@xvid.org)

  35.  * EA IMA SEAD decoder by Peter Ross (pross@xvid.org)

  36.  * THP ADPCM decoder by Marco Gerards (mgerards@xs4all.nl)

  37.  *

  38.  * Features and limitations:

  39.  *

  40.  * Reference documents:

  41.  * http://www.pcisys.net/~melanson/codecs/simpleaudio.html

  42.  * http://www.geocities.com/SiliconValley/8682/aud3.txt

  43.  * http://openquicktime.sourceforge.net/plugins.htm

  44.  * XAnim sources (xa_codec.c) http://www.rasnaimaging.com/people/lapus/download.html

  45.  * http://www.cs.ucla.edu/~leec/mediabench/applications.html

  46.  * SoX source code http://home.sprynet.com/~cbagwell/sox.html

  47.  *

  48.  * CD-ROM XA:

  49.  * http://ku-www.ss.titech.ac.jp/~yatsushi/xaadpcm.html

  50.  * vagpack & depack http://homepages.compuserve.de/bITmASTER32/psx-index.html

  51.  * readstr http://www.geocities.co.jp/Playtown/2004/

  52.  */

  53. 

  54. #define BLKSIZE 1024

  55. 

  56. /* step_table[] and index_table[] are from the ADPCM reference source */

  57. /* This is the index table: */

  58. static const int index_table[16] = {

  59.     -1, -1, -1, -1, 2, 4, 6, 8,

  60.     -1, -1, -1, -1, 2, 4, 6, 8,

  61. };

  62. 

  63. /**

  64.  * This is the step table. Note that many programs use slight deviations from

  65.  * this table, but such deviations are negligible:

  66.  */

  67. static const int step_table[89] = {

  68.     7, 8, 9, 10, 11, 12, 13, 14, 16, 17,

  69.     19, 21, 23, 25, 28, 31, 34, 37, 41, 45,

  70.     50, 55, 60, 66, 73, 80, 88, 97, 107, 118,

  71.     130, 143, 157, 173, 190, 209, 230, 253, 279, 307,

  72.     337, 371, 408, 449, 494, 544, 598, 658, 724, 796,

  73.     876, 963, 1060, 1166, 1282, 1411, 1552, 1707, 1878, 2066,

  74.     2272, 2499, 2749, 3024, 3327, 3660, 4026, 4428, 4871, 5358,

  75.     5894, 6484, 7132, 7845, 8630, 9493, 10442, 11487, 12635, 13899,

  76.     15289, 16818, 18500, 20350, 22385, 24623, 27086, 29794, 32767

  77. };

  78. 

  79. /* These are for MS-ADPCM */

  80. /* AdaptationTable[], AdaptCoeff1[], and AdaptCoeff2[] are from libsndfile */

  81. static const int AdaptationTable[] = {

  82.         230, 230, 230, 230, 307, 409, 512, 614,

  83.         768, 614, 512, 409, 307, 230, 230, 230

  84. };

  85. 

  86. static const int AdaptCoeff1[] = {

  87.         256, 512, 0, 192, 240, 460, 392

  88. };

  89. 

  90. static const int AdaptCoeff2[] = {

  91.         0, -256, 0, 64, 0, -208, -232

  92. };

  93. 

  94. /* These are for CD-ROM XA ADPCM */

  95. static const int xa_adpcm_table[5][2] = {

  96.    {   0,   0 },

  97.    {  60,   0 },

  98.    { 115, -52 },

  99.    {  98, -55 },

  100.    { 122, -60 }

  101. };

  102. 

  103. static const int ea_adpcm_table[] = {

  104.     0, 240, 460, 392, 0, 0, -208, -220, 0, 1,

  105.     3, 4, 7, 8, 10, 11, 0, -1, -3, -4

  106. };

  107. 

  108. static const int ct_adpcm_table[8] = {

  109.     0x00E6, 0x00E6, 0x00E6, 0x00E6,

  110.     0x0133, 0x0199, 0x0200, 0x0266

  111. };

  112. 

  113. // padded to zero where table size is less then 16

  114. static const int swf_index_tables[4][16] = {

  115.     /*2*/ { -1, 2 },

  116.     /*3*/ { -1, -1, 2, 4 },

  117.     /*4*/ { -1, -1, -1, -1, 2, 4, 6, 8 },

  118.     /*5*/ { -1, -1, -1, -1, -1, -1, -1, -1, 1, 2, 4, 6, 8, 10, 13, 16 }

  119. };

  120. 

  121. static const int yamaha_indexscale[] = {

  122.     230, 230, 230, 230, 307, 409, 512, 614,

  123.     230, 230, 230, 230, 307, 409, 512, 614

  124. };

  125. 

  126. static const int yamaha_difflookup[] = {

  127.     1, 3, 5, 7, 9, 11, 13, 15,

  128.     -1, -3, -5, -7, -9, -11, -13, -15

  129. };

  130. 

  131. /* end of tables */

  132. 

  133. typedef struct ADPCMChannelStatus {

  134.     int predictor;

  135.     short int step_index;

  136.     int step;

  137.     /* for encoding */

  138.     int prev_sample;

  139. 

  140.     /* MS version */

  141.     short sample1;

  142.     short sample2;

  143.     int coeff1;

  144.     int coeff2;

  145.     int idelta;

  146. } ADPCMChannelStatus;

  147. 

  148. typedef struct ADPCMContext {

  149.     int channel; /* for stereo MOVs, decode left, then decode right, then tell it's decoded */

  150.     ADPCMChannelStatus status[6];

  151. } ADPCMContext;

  152. 

  153. /* XXX: implement encoding */

  154. 

  155. #ifdef CONFIG_ENCODERS

  156. static int adpcm_encode_init(AVCodecContext *avctx)

  157. {

  158.     if (avctx->channels > 2)

  159.         return -1; /* only stereo or mono =) */

  160.     switch(avctx->codec->id) {

  161.     case CODEC_ID_ADPCM_IMA_WAV:

  162.         avctx->frame_size = (BLKSIZE - 4 * avctx->channels) * 8 / (4 * avctx->channels) + 1; /* each 16 bits sample gives one nibble */

  163.                                                              /* and we have 4 bytes per channel overhead */

  164.         avctx->block_align = BLKSIZE;

  165.         /* seems frame_size isn't taken into account... have to buffer the samples :-( */

  166.         break;

  167.     case CODEC_ID_ADPCM_MS:

  168.         avctx->frame_size = (BLKSIZE - 7 * avctx->channels) * 2 / avctx->channels + 2; /* each 16 bits sample gives one nibble */

  169.                                                              /* and we have 7 bytes per channel overhead */

  170.         avctx->block_align = BLKSIZE;

  171.         break;

  172.     case CODEC_ID_ADPCM_YAMAHA:

  173.         avctx->frame_size = BLKSIZE * avctx->channels;

  174.         avctx->block_align = BLKSIZE;

  175.         break;

  176.     case CODEC_ID_ADPCM_SWF:

  177.         if (avctx->sample_rate != 11025 &&

  178.             avctx->sample_rate != 22050 &&

  179.             avctx->sample_rate != 44100) {

  180.             av_log(avctx, AV_LOG_ERROR, "Sample rate must be 11025, 22050 or 44100\n");

  181.             return -1;

  182.         }

  183.         avctx->frame_size = 512 * (avctx->sample_rate / 11025);

  184.         break;

  185.     default:

  186.         return -1;

  187.         break;

  188.     }

  189. 

  190.     avctx->coded_frame= avcodec_alloc_frame();

  191.     avctx->coded_frame->key_frame= 1;

  192. 

  193.     return 0;

  194. }

  195. 

  196. static int adpcm_encode_close(AVCodecContext *avctx)

  197. {

  198.     av_freep(&avctx->coded_frame);

  199. 

  200.     return 0;

  201. }

  202. 

  203. 

  204. static inline unsigned char adpcm_ima_compress_sample(ADPCMChannelStatus *c, short sample)

  205. {

  206.     int delta = sample - c->prev_sample;

  207.     int nibble = FFMIN(7, abs(delta)*4/step_table[c->step_index]) + (delta<0)*8;

  208.     c->prev_sample += ((step_table[c->step_index] * yamaha_difflookup[nibble]) / 8);

  209.     c->prev_sample = av_clip_int16(c->prev_sample);

  210.     c->step_index = av_clip(c->step_index + index_table[nibble], 0, 88);

  211.     return nibble;

  212. }

  213. 

  214. static inline unsigned char adpcm_ms_compress_sample(ADPCMChannelStatus *c, short sample)

  215. {

  216.     int predictor, nibble, bias;

  217. 

  218.     predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;

  219. 

  220.     nibble= sample - predictor;

  221.     if(nibble>=0) bias= c->idelta/2;

  222.     else          bias=-c->idelta/2;

  223. 

  224.     nibble= (nibble + bias) / c->idelta;

  225.     nibble= av_clip(nibble, -8, 7)&0x0F;

  226. 

  227.     predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;

  228. 

  229.     c->sample2 = c->sample1;

  230.     c->sample1 = av_clip_int16(predictor);

  231. 

  232.     c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;

  233.     if (c->idelta < 16) c->idelta = 16;

  234. 

  235.     return nibble;

  236. }

  237. 

  238. static inline unsigned char adpcm_yamaha_compress_sample(ADPCMChannelStatus *c, short sample)

  239. {

  240.     int nibble, delta;

  241. 

  242.     if(!c->step) {

  243.         c->predictor = 0;

  244.         c->step = 127;

  245.     }

  246. 

  247.     delta = sample - c->predictor;

  248. 

  249.     nibble = FFMIN(7, abs(delta)*4/c->step) + (delta<0)*8;

  250. 

  251.     c->predictor += ((c->step * yamaha_difflookup[nibble]) / 8);

  252.     c->predictor = av_clip_int16(c->predictor);

  253.     c->step = (c->step * yamaha_indexscale[nibble]) >> 8;

  254.     c->step = av_clip(c->step, 127, 24567);

  255. 

  256.     return nibble;

  257. }

  258. 

  259. typedef struct TrellisPath {

  260.     int nibble;

  261.     int prev;

  262. } TrellisPath;

  263. 

  264. typedef struct TrellisNode {

  265.     uint32_t ssd;

  266.     int path;

  267.     int sample1;

  268.     int sample2;

  269.     int step;

  270. } TrellisNode;

  271. 

  272. static void adpcm_compress_trellis(AVCodecContext *avctx, const short *samples,

  273.                                    uint8_t *dst, ADPCMChannelStatus *c, int n)

  274. {

  275. #define FREEZE_INTERVAL 128

  276.     //FIXME 6% faster if frontier is a compile-time constant

  277.     const int frontier = 1 << avctx->trellis;

  278.     const int stride = avctx->channels;

  279.     const int version = avctx->codec->id;

  280.     const int max_paths = frontier*FREEZE_INTERVAL;

  281.     TrellisPath paths[max_paths], *p;

  282.     TrellisNode node_buf[2][frontier];

  283.     TrellisNode *nodep_buf[2][frontier];

  284.     TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd

  285.     TrellisNode **nodes_next = nodep_buf[1];

  286.     int pathn = 0, froze = -1, i, j, k;

  287. 

  288.     assert(!(max_paths&(max_paths-1)));

  289. 

  290.     memset(nodep_buf, 0, sizeof(nodep_buf));

  291.     nodes[0] = &node_buf[1][0];

  292.     nodes[0]->ssd = 0;

  293.     nodes[0]->path = 0;

  294.     nodes[0]->step = c->step_index;

  295.     nodes[0]->sample1 = c->sample1;

  296.     nodes[0]->sample2 = c->sample2;

  297.     if((version == CODEC_ID_ADPCM_IMA_WAV) || (version == CODEC_ID_ADPCM_SWF))

  298.         nodes[0]->sample1 = c->prev_sample;

  299.     if(version == CODEC_ID_ADPCM_MS)

  300.         nodes[0]->step = c->idelta;

  301.     if(version == CODEC_ID_ADPCM_YAMAHA) {

  302.         if(c->step == 0) {

  303.             nodes[0]->step = 127;

  304.             nodes[0]->sample1 = 0;

  305.         } else {

  306.             nodes[0]->step = c->step;

  307.             nodes[0]->sample1 = c->predictor;

  308.         }

  309.     }

  310. 

  311.     for(i=0; i<n; i++) {

  312.         TrellisNode *t = node_buf[i&1];

  313.         TrellisNode **u;

  314.         int sample = samples[i*stride];

  315.         memset(nodes_next, 0, frontier*sizeof(TrellisNode*));

  316.         for(j=0; j<frontier && nodes[j]; j++) {

  317.             // higher j have higher ssd already, so they're unlikely to use a suboptimal next sample too

  318.             const int range = (j < frontier/2) ? 1 : 0;

  319.             const int step = nodes[j]->step;

  320.             int nidx;

  321.             if(version == CODEC_ID_ADPCM_MS) {

  322.                 const int predictor = ((nodes[j]->sample1 * c->coeff1) + (nodes[j]->sample2 * c->coeff2)) / 256;

  323.                 const int div = (sample - predictor) / step;

  324.                 const int nmin = av_clip(div-range, -8, 6);

  325.                 const int nmax = av_clip(div+range, -7, 7);

  326.                 for(nidx=nmin; nidx<=nmax; nidx++) {

  327.                     const int nibble = nidx & 0xf;

  328.                     int dec_sample = predictor + nidx * step;

  329. #define STORE_NODE(NAME, STEP_INDEX)\

  330.                     int d;\

  331.                     uint32_t ssd;\

  332.                     dec_sample = av_clip_int16(dec_sample);\

  333.                     d = sample - dec_sample;\

  334.                     ssd = nodes[j]->ssd + d*d;\

  335.                     if(nodes_next[frontier-1] && ssd >= nodes_next[frontier-1]->ssd)\

  336.                         continue;\

  337.                     /* Collapse any two states with the same previous sample value. \

  338.                      * One could also distinguish states by step and by 2nd to last

  339.                      * sample, but the effects of that are negligible. */\

  340.                     for(k=0; k<frontier && nodes_next[k]; k++) {\

  341.                         if(dec_sample == nodes_next[k]->sample1) {\

  342.                             assert(ssd >= nodes_next[k]->ssd);\

  343.                             goto next_##NAME;\

  344.                         }\

  345.                     }\

  346.                     for(k=0; k<frontier; k++) {\

  347.                         if(!nodes_next[k] || ssd < nodes_next[k]->ssd) {\

  348.                             TrellisNode *u = nodes_next[frontier-1];\

  349.                             if(!u) {\

  350.                                 assert(pathn < max_paths);\

  351.                                 u = t++;\

  352.                                 u->path = pathn++;\

  353.                             }\

  354.                             u->ssd = ssd;\

  355.                             u->step = STEP_INDEX;\

  356.                             u->sample2 = nodes[j]->sample1;\

  357.                             u->sample1 = dec_sample;\

  358.                             paths[u->path].nibble = nibble;\

  359.                             paths[u->path].prev = nodes[j]->path;\

  360.                             memmove(&nodes_next[k+1], &nodes_next[k], (frontier-k-1)*sizeof(TrellisNode*));\

  361.                             nodes_next[k] = u;\

  362.                             break;\

  363.                         }\

  364.                     }\

  365.                     next_##NAME:;

  366.                     STORE_NODE(ms, FFMAX(16, (AdaptationTable[nibble] * step) >> 8));

  367.                 }

  368.             } else if((version == CODEC_ID_ADPCM_IMA_WAV)|| (version == CODEC_ID_ADPCM_SWF)) {

  369. #define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\

  370.                 const int predictor = nodes[j]->sample1;\

  371.                 const int div = (sample - predictor) * 4 / STEP_TABLE;\

  372.                 int nmin = av_clip(div-range, -7, 6);\

  373.                 int nmax = av_clip(div+range, -6, 7);\

  374.                 if(nmin<=0) nmin--; /* distinguish -0 from +0 */\

  375.                 if(nmax<0) nmax--;\

  376.                 for(nidx=nmin; nidx<=nmax; nidx++) {\

  377.                     const int nibble = nidx<0 ? 7-nidx : nidx;\

  378.                     int dec_sample = predictor + (STEP_TABLE * yamaha_difflookup[nibble]) / 8;\

  379.                     STORE_NODE(NAME, STEP_INDEX);\

  380.                 }

  381.                 LOOP_NODES(ima, step_table[step], av_clip(step + index_table[nibble], 0, 88));

  382.             } else { //CODEC_ID_ADPCM_YAMAHA

  383.                 LOOP_NODES(yamaha, step, av_clip((step * yamaha_indexscale[nibble]) >> 8, 127, 24567));

  384. #undef LOOP_NODES

  385. #undef STORE_NODE

  386.             }

  387.         }

  388. 

  389.         u = nodes;

  390.         nodes = nodes_next;

  391.         nodes_next = u;

  392. 

  393.         // prevent overflow

  394.         if(nodes[0]->ssd > (1<<28)) {

  395.             for(j=1; j<frontier && nodes[j]; j++)

  396.                 nodes[j]->ssd -= nodes[0]->ssd;

  397.             nodes[0]->ssd = 0;

  398.         }

  399. 

  400.         // merge old paths to save memory

  401.         if(i == froze + FREEZE_INTERVAL) {

  402.             p = &paths[nodes[0]->path];

  403.             for(k=i; k>froze; k--) {

  404.                 dst[k] = p->nibble;

  405.                 p = &paths[p->prev];

  406.             }

  407.             froze = i;

  408.             pathn = 0;

  409.             // other nodes might use paths that don't coincide with the frozen one.

  410.             // checking which nodes do so is too slow, so just kill them all.

  411.             // this also slightly improves quality, but I don't know why.

  412.             memset(nodes+1, 0, (frontier-1)*sizeof(TrellisNode*));

  413.         }

  414.     }

  415. 

  416.     p = &paths[nodes[0]->path];

  417.     for(i=n-1; i>froze; i--) {

  418.         dst[i] = p->nibble;

  419.         p = &paths[p->prev];

  420.     }

  421. 

  422.     c->predictor = nodes[0]->sample1;

  423.     c->sample1 = nodes[0]->sample1;

  424.     c->sample2 = nodes[0]->sample2;

  425.     c->step_index = nodes[0]->step;

  426.     c->step = nodes[0]->step;

  427.     c->idelta = nodes[0]->step;

  428. }

  429. 

  430. static int adpcm_encode_frame(AVCodecContext *avctx,

  431.                             unsigned char *frame, int buf_size, void *data)

  432. {

  433.     int n, i, st;

  434.     short *samples;

  435.     unsigned char *dst;

  436.     ADPCMContext *c = avctx->priv_data;

  437. 

  438.     dst = frame;

  439.     samples = (short *)data;

  440.     st= avctx->channels == 2;

  441. /*    n = (BLKSIZE - 4 * avctx->channels) / (2 * 8 * avctx->channels); */

  442. 

  443.     switch(avctx->codec->id) {

  444.     case CODEC_ID_ADPCM_IMA_WAV:

  445.         n = avctx->frame_size / 8;

  446.             c->status[0].prev_sample = (signed short)samples[0]; /* XXX */

  447. /*            c->status[0].step_index = 0; *//* XXX: not sure how to init the state machine */

  448.             bytestream_put_le16(&dst, c->status[0].prev_sample);

  449.             *dst++ = (unsigned char)c->status[0].step_index;

  450.             *dst++ = 0; /* unknown */

  451.             samples++;

  452.             if (avctx->channels == 2) {

  453.                 c->status[1].prev_sample = (signed short)samples[1];

  454. /*                c->status[1].step_index = 0; */

  455.                 bytestream_put_le16(&dst, c->status[1].prev_sample);

  456.                 *dst++ = (unsigned char)c->status[1].step_index;

  457.                 *dst++ = 0;

  458.                 samples++;

  459.             }

  460. 

  461.             /* stereo: 4 bytes (8 samples) for left, 4 bytes for right, 4 bytes left, ... */

  462.             if(avctx->trellis > 0) {

  463.                 uint8_t buf[2][n*8];

  464.                 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n*8);

  465.                 if(avctx->channels == 2)

  466.                     adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n*8);

  467.                 for(i=0; i<n; i++) {

  468.                     *dst++ = buf[0][8*i+0] | (buf[0][8*i+1] << 4);

  469.                     *dst++ = buf[0][8*i+2] | (buf[0][8*i+3] << 4);

  470.                     *dst++ = buf[0][8*i+4] | (buf[0][8*i+5] << 4);

  471.                     *dst++ = buf[0][8*i+6] | (buf[0][8*i+7] << 4);

  472.                     if (avctx->channels == 2) {

  473.                         *dst++ = buf[1][8*i+0] | (buf[1][8*i+1] << 4);

  474.                         *dst++ = buf[1][8*i+2] | (buf[1][8*i+3] << 4);

  475.                         *dst++ = buf[1][8*i+4] | (buf[1][8*i+5] << 4);

  476.                         *dst++ = buf[1][8*i+6] | (buf[1][8*i+7] << 4);

  477.                     }

  478.                 }

  479.             } else

  480.             for (; n>0; n--) {

  481.                 *dst = adpcm_ima_compress_sample(&c->status[0], samples[0]);

  482.                 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels]) << 4;

  483.                 dst++;

  484.                 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 2]);

  485.                 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 3]) << 4;

  486.                 dst++;

  487.                 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 4]);

  488.                 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 5]) << 4;

  489.                 dst++;

  490.                 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 6]);

  491.                 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 7]) << 4;

  492.                 dst++;

  493.                 /* right channel */

  494.                 if (avctx->channels == 2) {

  495.                     *dst = adpcm_ima_compress_sample(&c->status[1], samples[1]);

  496.                     *dst |= adpcm_ima_compress_sample(&c->status[1], samples[3]) << 4;

  497.                     dst++;

  498.                     *dst = adpcm_ima_compress_sample(&c->status[1], samples[5]);

  499.                     *dst |= adpcm_ima_compress_sample(&c->status[1], samples[7]) << 4;

  500.                     dst++;

  501.                     *dst = adpcm_ima_compress_sample(&c->status[1], samples[9]);

  502.                     *dst |= adpcm_ima_compress_sample(&c->status[1], samples[11]) << 4;

  503.                     dst++;

  504.                     *dst = adpcm_ima_compress_sample(&c->status[1], samples[13]);

  505.                     *dst |= adpcm_ima_compress_sample(&c->status[1], samples[15]) << 4;

  506.                     dst++;

  507.                 }

  508.                 samples += 8 * avctx->channels;

  509.             }

  510.         break;

  511.     case CODEC_ID_ADPCM_SWF:

  512.     {

  513.         int i;

  514.         PutBitContext pb;

  515.         init_put_bits(&pb, dst, buf_size*8);

  516. 

  517.         n = avctx->frame_size-1;

  518. 

  519.         //Store AdpcmCodeSize

  520.         put_bits(&pb, 2, 2);                //Set 4bits flash adpcm format

  521. 

  522.         //Init the encoder state

  523.         for(i=0; i<avctx->channels; i++){

  524.             c->status[i].step_index = av_clip(c->status[i].step_index, 0, 63); // clip step so it fits 6 bits

  525.             put_bits(&pb, 16, samples[i] & 0xFFFF);

  526.             put_bits(&pb, 6, c->status[i].step_index);

  527.             c->status[i].prev_sample = (signed short)samples[i];

  528.         }

  529. 

  530.         if(avctx->trellis > 0) {

  531.             uint8_t buf[2][n];

  532.             adpcm_compress_trellis(avctx, samples+2, buf[0], &c->status[0], n);

  533.             if (avctx->channels == 2)

  534.                 adpcm_compress_trellis(avctx, samples+3, buf[1], &c->status[1], n);

  535.             for(i=0; i<n; i++) {

  536.                 put_bits(&pb, 4, buf[0][i]);

  537.                 if (avctx->channels == 2)

  538.                     put_bits(&pb, 4, buf[1][i]);

  539.             }

  540.         } else {

  541.             for (i=1; i<avctx->frame_size; i++) {

  542.                 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels*i]));

  543.                 if (avctx->channels == 2)

  544.                     put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[1], samples[2*i+1]));

  545.             }

  546.         }

  547.         flush_put_bits(&pb);

  548.         dst += put_bits_count(&pb)>>3;

  549.         break;

  550.     }

  551.     case CODEC_ID_ADPCM_MS:

  552.         for(i=0; i<avctx->channels; i++){

  553.             int predictor=0;

  554. 

  555.             *dst++ = predictor;

  556.             c->status[i].coeff1 = AdaptCoeff1[predictor];

  557.             c->status[i].coeff2 = AdaptCoeff2[predictor];

  558.         }

  559.         for(i=0; i<avctx->channels; i++){

  560.             if (c->status[i].idelta < 16)

  561.                 c->status[i].idelta = 16;

  562. 

  563.             bytestream_put_le16(&dst, c->status[i].idelta);

  564.         }

  565.         for(i=0; i<avctx->channels; i++){

  566.             c->status[i].sample1= *samples++;

  567. 

  568.             bytestream_put_le16(&dst, c->status[i].sample1);

  569.         }

  570.         for(i=0; i<avctx->channels; i++){

  571.             c->status[i].sample2= *samples++;

  572. 

  573.             bytestream_put_le16(&dst, c->status[i].sample2);

  574.         }

  575. 

  576.         if(avctx->trellis > 0) {

  577.             int n = avctx->block_align - 7*avctx->channels;

  578.             uint8_t buf[2][n];

  579.             if(avctx->channels == 1) {

  580.                 n *= 2;

  581.                 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);

  582.                 for(i=0; i<n; i+=2)

  583.                     *dst++ = (buf[0][i] << 4) | buf[0][i+1];

  584.             } else {

  585.                 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);

  586.                 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);

  587.                 for(i=0; i<n; i++)

  588.                     *dst++ = (buf[0][i] << 4) | buf[1][i];

  589.             }

  590.         } else

  591.         for(i=7*avctx->channels; i<avctx->block_align; i++) {

  592.             int nibble;

  593.             nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++)<<4;

  594.             nibble|= adpcm_ms_compress_sample(&c->status[st], *samples++);

  595.             *dst++ = nibble;

  596.         }

  597.         break;

  598.     case CODEC_ID_ADPCM_YAMAHA:

  599.         n = avctx->frame_size / 2;

  600.         if(avctx->trellis > 0) {

  601.             uint8_t buf[2][n*2];

  602.             n *= 2;

  603.             if(avctx->channels == 1) {

  604.                 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);

  605.                 for(i=0; i<n; i+=2)

  606.                     *dst++ = buf[0][i] | (buf[0][i+1] << 4);

  607.             } else {

  608.                 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);

  609.                 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);

  610.                 for(i=0; i<n; i++)

  611.                     *dst++ = buf[0][i] | (buf[1][i] << 4);

  612.             }

  613.         } else

  614.         for (; n>0; n--) {

  615.             for(i = 0; i < avctx->channels; i++) {

  616.                 int nibble;

  617.                 nibble  = adpcm_yamaha_compress_sample(&c->status[i], samples[i]);

  618.                 nibble |= adpcm_yamaha_compress_sample(&c->status[i], samples[i+avctx->channels]) << 4;

  619.                 *dst++ = nibble;

  620.             }

  621.             samples += 2 * avctx->channels;

  622.         }

  623.         break;

  624.     default:

  625.         return -1;

  626.     }

  627.     return dst - frame;

  628. }

  629. #endif //CONFIG_ENCODERS

  630. 

  631. static int adpcm_decode_init(AVCodecContext * avctx)

  632. {

  633.     ADPCMContext *c = avctx->priv_data;

  634.     unsigned int max_channels = 2;

  635. 

  636.     switch(avctx->codec->id) {

  637.     case CODEC_ID_ADPCM_EA_R1:

  638.     case CODEC_ID_ADPCM_EA_R2:

  639.     case CODEC_ID_ADPCM_EA_R3:

  640.         max_channels = 6;

  641.         break;

  642.     }

  643.     if(avctx->channels > max_channels){

  644.         return -1;

  645.     }

  646. 

  647.     switch(avctx->codec->id) {

  648.     case CODEC_ID_ADPCM_CT:

  649.         c->status[0].step = c->status[1].step = 511;

  650.         break;

  651.     case CODEC_ID_ADPCM_IMA_WS:

  652.         if (avctx->extradata && avctx->extradata_size == 2 * 4) {

  653.             c->status[0].predictor = AV_RL32(avctx->extradata);

  654.             c->status[1].predictor = AV_RL32(avctx->extradata + 4);

  655.         }

  656.         break;

  657.     default:

  658.         break;

  659.     }

  660.     return 0;

  661. }

  662. 

  663. static inline short adpcm_ima_expand_nibble(ADPCMChannelStatus *c, char nibble, int shift)

  664. {

  665.     int step_index;

  666.     int predictor;

  667.     int sign, delta, diff, step;

  668. 

  669.     step = step_table[c->step_index];

  670.     step_index = c->step_index + index_table[(unsigned)nibble];

  671.     if (step_index < 0) step_index = 0;

  672.     else if (step_index > 88) step_index = 88;

  673. 

  674.     sign = nibble & 8;

  675.     delta = nibble & 7;

  676.     /* perform direct multiplication instead of series of jumps proposed by

  677.      * the reference ADPCM implementation since modern CPUs can do the mults

  678.      * quickly enough */

  679.     diff = ((2 * delta + 1) * step) >> shift;

  680.     predictor = c->predictor;

  681.     if (sign) predictor -= diff;

  682.     else predictor += diff;

  683. 

  684.     c->predictor = av_clip_int16(predictor);

  685.     c->step_index = step_index;

  686. 

  687.     return (short)c->predictor;

  688. }

  689. 

  690. static inline short adpcm_ms_expand_nibble(ADPCMChannelStatus *c, char nibble)

  691. {

  692.     int predictor;

  693. 

  694.     predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;

  695.     predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;

  696. 

  697.     c->sample2 = c->sample1;

  698.     c->sample1 = av_clip_int16(predictor);

  699.     c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;

  700.     if (c->idelta < 16) c->idelta = 16;

  701. 

  702.     return c->sample1;

  703. }

  704. 

  705. static inline short adpcm_ct_expand_nibble(ADPCMChannelStatus *c, char nibble)

  706. {

  707.     int sign, delta, diff;

  708.     int new_step;

  709. 

  710.     sign = nibble & 8;

  711.     delta = nibble & 7;

  712.     /* perform direct multiplication instead of series of jumps proposed by

  713.      * the reference ADPCM implementation since modern CPUs can do the mults

  714.      * quickly enough */

  715.     diff = ((2 * delta + 1) * c->step) >> 3;

  716.     /* predictor update is not so trivial: predictor is multiplied on 254/256 before updating */

  717.     c->predictor = ((c->predictor * 254) >> 8) + (sign ? -diff : diff);

  718.     c->predictor = av_clip_int16(c->predictor);

  719.     /* calculate new step and clamp it to range 511..32767 */

  720.     new_step = (ct_adpcm_table[nibble & 7] * c->step) >> 8;

  721.     c->step = av_clip(new_step, 511, 32767);

  722. 

  723.     return (short)c->predictor;

  724. }

  725. 

  726. static inline short adpcm_sbpro_expand_nibble(ADPCMChannelStatus *c, char nibble, int size, int shift)

  727. {

  728.     int sign, delta, diff;

  729. 

  730.     sign = nibble & (1<<(size-1));

  731.     delta = nibble & ((1<<(size-1))-1);

  732.     diff = delta << (7 + c->step + shift);

  733. 

  734.     /* clamp result */

  735.     c->predictor = av_clip(c->predictor + (sign ? -diff : diff), -16384,16256);

  736. 

  737.     /* calculate new step */

  738.     if (delta >= (2*size - 3) && c->step < 3)

  739.         c->step++;

  740.     else if (delta == 0 && c->step > 0)

  741.         c->step--;

  742. 

  743.     return (short) c->predictor;

  744. }

  745. 

  746. static inline short adpcm_yamaha_expand_nibble(ADPCMChannelStatus *c, unsigned char nibble)

  747. {

  748.     if(!c->step) {

  749.         c->predictor = 0;

  750.         c->step = 127;

  751.     }

  752. 

  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);

  757.     return c->predictor;

  758. }

  759. 

  760. static void xa_decode(short *out, const unsigned char *in,

  761.     ADPCMChannelStatus *left, ADPCMChannelStatus *right, int inc)

  762. {

  763.     int i, j;

  764.     int shift,filter,f0,f1;

  765.     int s_1,s_2;

  766.     int d,s,t;

  767. 

  768.     for(i=0;i<4;i++) {

  769. 

  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];

  774. 

  775.         s_1 = left->sample1;

  776.         s_2 = left->sample2;

  777. 

  778.         for(j=0;j<28;j++) {

  779.             d = in[16+i+j*4];

  780. 

  781.             t = (signed char)(d<<4)>>4;

  782.             s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);

  783.             s_2 = s_1;

  784.             s_1 = av_clip_int16(s);

  785.             *out = s_1;

  786.             out += inc;

  787.         }

  788. 

  789.         if (inc==2) { /* stereo */

  790.             left->sample1 = s_1;

  791.             left->sample2 = s_2;

  792.             s_1 = right->sample1;

  793.             s_2 = right->sample2;

  794.             out = out + 1 - 28*2;

  795.         }

  796. 

  797.         shift  = 12 - (in[5+i*2] & 15);

  798.         filter = in[5+i*2] >> 4;

  799. 

  800.         f0 = xa_adpcm_table[filter][0];

  801.         f1 = xa_adpcm_table[filter][1];

  802. 

  803.         for(j=0;j<28;j++) {

  804.             d = in[16+i+j*4];

  805. 

  806.             t = (signed char)d >> 4;

  807.             s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);

  808.             s_2 = s_1;

  809.             s_1 = av_clip_int16(s);

  810.             *out = s_1;

  811.             out += inc;

  812.         }

  813. 

  814.         if (inc==2) { /* stereo */

  815.             right->sample1 = s_1;

  816.             right->sample2 = s_2;

  817.             out -= 1;

  818.         } else {

  819.             left->sample1 = s_1;

  820.             left->sample2 = s_2;

  821.         }

  822.     }

  823. }

  824. 

  825. 

  826. /* DK3 ADPCM support macro */

  827. #define DK3_GET_NEXT_NIBBLE() \

  828.     if (decode_top_nibble_next) \

  829.     { \

  830.         nibble = (last_byte >> 4) & 0x0F; \

  831.         decode_top_nibble_next = 0; \

  832.     } \

  833.     else \

  834.     { \

  835.         last_byte = *src++; \

  836.         if (src >= buf + buf_size) break; \

  837.         nibble = last_byte & 0x0F; \

  838.         decode_top_nibble_next = 1; \

  839.     }

  840. 

  841. static int adpcm_decode_frame(AVCodecContext *avctx,

  842.                             void *data, int *data_size,

  843.                             uint8_t *buf, int buf_size)

  844. {

  845.     ADPCMContext *c = avctx->priv_data;

  846.     ADPCMChannelStatus *cs;

  847.     int n, m, channel, i;

  848.     int block_predictor[2];

  849.     short *samples;

  850.     short *samples_end;

  851.     uint8_t *src;

  852.     int st; /* stereo */

  853. 

  854.     /* DK3 ADPCM accounting variables */

  855.     unsigned char last_byte = 0;

  856.     unsigned char nibble;

  857.     int decode_top_nibble_next = 0;

  858.     int diff_channel;

  859. 

  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;

  867.     int count1, count2;

  868. 

  869.     if (!buf_size)

  870.         return 0;

  871. 

  872.     //should protect all 4bit ADPCM variants

  873.     //8 is needed for CODEC_ID_ADPCM_IMA_WAV with 2 channels

  874.     //

  875.     if(*data_size/4 < buf_size + 8)

  876.         return -1;

  877. 

  878.     samples = data;

  879.     samples_end= samples + *data_size/2;

  880.     *data_size= 0;

  881.     src = buf;

  882. 

  883.     st = avctx->channels == 2 ? 1 : 0;

  884. 

  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) */

  891. 

  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;

  896. 

  897.         /* sign extension */

  898.         if(cs->predictor & 0x8000)

  899.             cs->predictor -= 0x10000;

  900. 

  901.         cs->predictor = av_clip_int16(cs->predictor);

  902. 

  903.         cs->step_index = (*src++) & 0x7F;

  904. 

  905.         if (cs->step_index > 88){

  906.             av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);

  907.             cs->step_index = 88;

  908.         }

  909. 

  910.         cs->step = step_table[cs->step_index];

  911. 

  912.         if (st && channel)

  913.             samples++;

  914. 

  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;

  920.             src ++;

  921.         }

  922. 

  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 */

  926.                 return src - buf;

  927.             }

  928.         }

  929.         break;

  930.     case CODEC_ID_ADPCM_IMA_WAV:

  931.         if (avctx->block_align != 0 && buf_size > avctx->block_align)

  932.             buf_size = avctx->block_align;

  933. 

  934. //        samples_per_block= (block_align-4*chanels)*8 / (bits_per_sample * chanels) + 1;

  935. 

  936.         for(i=0; i<avctx->channels; i++){

  937.             cs = &(c->status[i]);

  938.             cs->predictor = (int16_t)(src[0] + (src[1]<<8));

  939.             src+=2;

  940. 

  941.         // XXX: is this correct ??: *samples++ = cs->predictor;

  942. 

  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);

  946.                 cs->step_index = 88;

  947.             }

  948.             if (*src++) av_log(avctx, AV_LOG_ERROR, "unused byte should be null but is %d!!\n", src[-1]); /* unused */

  949.         }

  950. 

  951.         while(src < buf + buf_size){

  952.             for(m=0; m<4; m++){

  953.                 for(i=0; i<=st; i++)

  954.                     *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] & 0x0F, 3);

  955.                 for(i=0; i<=st; i++)

  956.                     *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] >> 4  , 3);

  957.                 src++;

  958.             }

  959.             src += 4*st;

  960.         }

  961.         break;

  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;

  965.         if(st){

  966.             c->status[1].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;

  967.         }

  968.         c->status[0].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;

  969.         if(st){

  970.             c->status[1].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;

  971.         }

  972.         if (cs->step_index < 0) cs->step_index = 0;

  973.         if (cs->step_index > 88) cs->step_index = 88;

  974. 

  975.         m= (buf_size - (src - buf))>>st;

  976.         for(i=0; i<m; i++) {

  977.             *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] & 0x0F, 4);

  978.             if (st)

  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);

  981.             if (st)

  982.                 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] >> 4, 4);

  983.         }

  984. 

  985.         src += m<<st;

  986. 

  987.         break;

  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;

  992.         if (n < 0)

  993.             return -1;

  994.         block_predictor[0] = av_clip(*src++, 0, 7);

  995.         block_predictor[1] = 0;

  996.         if (st)

  997.             block_predictor[1] = av_clip(*src++, 0, 7);

  998.         c->status[0].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  999.         src+=2;

  1000.         if (st){

  1001.             c->status[1].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  1002.             src+=2;

  1003.         }

  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]];

  1008. 

  1009.         c->status[0].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  1010.         src+=2;

  1011.         if (st) c->status[1].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  1012.         if (st) src+=2;

  1013.         c->status[0].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  1014.         src+=2;

  1015.         if (st) c->status[1].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  1016.         if (st) src+=2;

  1017. 

  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;

  1022.         for(;n>0;n--) {

  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);

  1025.             src ++;

  1026.         }

  1027.         break;

  1028.     case CODEC_ID_ADPCM_IMA_DK4:

  1029.         if (avctx->block_align != 0 && buf_size > avctx->block_align)

  1030.             buf_size = avctx->block_align;

  1031. 

  1032.         c->status[0].predictor = (int16_t)(src[0] | (src[1] << 8));

  1033.         c->status[0].step_index = src[2];

  1034.         src += 4;

  1035.         *samples++ = c->status[0].predictor;

  1036.         if (st) {

  1037.             c->status[1].predictor = (int16_t)(src[0] | (src[1] << 8));

  1038.             c->status[1].step_index = src[2];

  1039.             src += 4;

  1040.             *samples++ = c->status[1].predictor;

  1041.         }

  1042.         while (src < buf + buf_size) {

  1043. 

  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);

  1047. 

  1048.             /* take care of the bottom nibble, which is right sample for

  1049.              * stereo, or another mono sample */

  1050.             if (st)

  1051.                 *samples++ = adpcm_ima_expand_nibble(&c->status[1],

  1052.                     src[0] & 0x0F, 3);

  1053.             else

  1054.                 *samples++ = adpcm_ima_expand_nibble(&c->status[0],

  1055.                     src[0] & 0x0F, 3);

  1056. 

  1057.             src++;

  1058.         }

  1059.         break;

  1060.     case CODEC_ID_ADPCM_IMA_DK3:

  1061.         if (avctx->block_align != 0 && buf_size > avctx->block_align)

  1062.             buf_size = avctx->block_align;

  1063. 

  1064.         if(buf_size + 16 > (samples_end - samples)*3/8)

  1065.             return -1;

  1066. 

  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 */

  1072.         src += 16;

  1073.         diff_channel = c->status[1].predictor;

  1074. 

  1075.         /* the DK3_GET_NEXT_NIBBLE macro issues the break statement when

  1076.          * the buffer is consumed */

  1077.         while (1) {

  1078. 

  1079.             /* for this algorithm, c->status[0] is the sum channel and

  1080.              * c->status[1] is the diff channel */

  1081. 

  1082.             /* process the first predictor of the sum channel */

  1083.             DK3_GET_NEXT_NIBBLE();

  1084.             adpcm_ima_expand_nibble(&c->status[0], nibble, 3);

  1085. 

  1086.             /* process the diff channel predictor */

  1087.             DK3_GET_NEXT_NIBBLE();

  1088.             adpcm_ima_expand_nibble(&c->status[1], nibble, 3);

  1089. 

  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;

  1094. 

  1095.             /* process the second predictor of the sum channel */

  1096.             DK3_GET_NEXT_NIBBLE();

  1097.             adpcm_ima_expand_nibble(&c->status[0], nibble, 3);

  1098. 

  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;

  1103.         }

  1104.         break;

  1105.     case CODEC_ID_ADPCM_IMA_WS:

  1106.         /* no per-block initialization; just start decoding the data */

  1107.         while (src < buf + buf_size) {

  1108. 

  1109.             if (st) {

  1110.                 *samples++ = adpcm_ima_expand_nibble(&c->status[0],

  1111.                     (src[0] >> 4) & 0x0F, 3);

  1112.                 *samples++ = adpcm_ima_expand_nibble(&c->status[1],

  1113.                     src[0] & 0x0F, 3);

  1114.             } else {

  1115.                 *samples++ = adpcm_ima_expand_nibble(&c->status[0],

  1116.                     (src[0] >> 4) & 0x0F, 3);

  1117.                 *samples++ = adpcm_ima_expand_nibble(&c->status[0],

  1118.                     src[0] & 0x0F, 3);

  1119.             }

  1120. 

  1121.             src++;

  1122.         }

  1123.         break;

  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],

  1129.                 avctx->channels);

  1130.             src += 128;

  1131.             samples += 28 * 8;

  1132.             buf_size -= 128;

  1133.         }

  1134.         break;

  1135.     case CODEC_ID_ADPCM_IMA_EA_EACS:

  1136.         samples_in_chunk = bytestream_get_le32(&src) >> (1-st);

  1137. 

  1138.         if (samples_in_chunk > buf_size-4-(8<<st)) {

  1139.             src += buf_size - 4;

  1140.             break;

  1141.         }

  1142. 

  1143.         for (i=0; i<=st; i++)

  1144.             c->status[i].step_index = bytestream_get_le32(&src);

  1145.         for (i=0; i<=st; i++)

  1146.             c->status[i].predictor  = bytestream_get_le32(&src);

  1147. 

  1148.         for (; samples_in_chunk; samples_in_chunk--, src++) {

  1149.             *samples++ = adpcm_ima_expand_nibble(&c->status[0],  *src>>4,   3);

  1150.             *samples++ = adpcm_ima_expand_nibble(&c->status[st], *src&0x0F, 3);

  1151.         }

  1152.         break;

  1153.     case CODEC_ID_ADPCM_IMA_EA_SEAD:

  1154.         for (; src < buf+buf_size; src++) {

  1155.             *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[0] >> 4, 6);

  1156.             *samples++ = adpcm_ima_expand_nibble(&c->status[st],src[0]&0x0F, 6);

  1157.         }

  1158.         break;

  1159.     case CODEC_ID_ADPCM_EA:

  1160.         samples_in_chunk = AV_RL32(src);

  1161.         if (samples_in_chunk >= ((buf_size - 12) * 2)) {

  1162.             src += buf_size;

  1163.             break;

  1164.         }

  1165.         src += 4;

  1166.         current_left_sample = (int16_t)AV_RL16(src);

  1167.         src += 2;

  1168.         previous_left_sample = (int16_t)AV_RL16(src);

  1169.         src += 2;

  1170.         current_right_sample = (int16_t)AV_RL16(src);

  1171.         src += 2;

  1172.         previous_right_sample = (int16_t)AV_RL16(src);

  1173.         src += 2;

  1174. 

  1175.         for (count1 = 0; count1 < samples_in_chunk/28;count1++) {

  1176.             coeff1l = ea_adpcm_table[(*src >> 4) & 0x0F];

  1177.             coeff2l = ea_adpcm_table[((*src >> 4) & 0x0F) + 4];

  1178.             coeff1r = ea_adpcm_table[*src & 0x0F];

  1179.             coeff2r = ea_adpcm_table[(*src & 0x0F) + 4];

  1180.             src++;

  1181. 

  1182.             shift_left = ((*src >> 4) & 0x0F) + 8;

  1183.             shift_right = (*src & 0x0F) + 8;

  1184.             src++;

  1185. 

  1186.             for (count2 = 0; count2 < 28; count2++) {

  1187.                 next_left_sample = (((*src & 0xF0) << 24) >> shift_left);

  1188.                 next_right_sample = (((*src & 0x0F) << 28) >> shift_right);

  1189.                 src++;

  1190. 

  1191.                 next_left_sample = (next_left_sample +

  1192.                     (current_left_sample * coeff1l) +

  1193.                     (previous_left_sample * coeff2l) + 0x80) >> 8;

  1194.                 next_right_sample = (next_right_sample +

  1195.                     (current_right_sample * coeff1r) +

  1196.                     (previous_right_sample * coeff2r) + 0x80) >> 8;

  1197. 

  1198.                 previous_left_sample = current_left_sample;

  1199.                 current_left_sample = av_clip_int16(next_left_sample);

  1200.                 previous_right_sample = current_right_sample;

  1201.                 current_right_sample = av_clip_int16(next_right_sample);

  1202.                 *samples++ = (unsigned short)current_left_sample;

  1203.                 *samples++ = (unsigned short)current_right_sample;

  1204.             }

  1205.         }

  1206.         break;

  1207.     case CODEC_ID_ADPCM_EA_R1:

  1208.     case CODEC_ID_ADPCM_EA_R2:

  1209.     case CODEC_ID_ADPCM_EA_R3: {

  1210.         /* channel numbering

  1211.            2chan: 0=fl, 1=fr

  1212.            4chan: 0=fl, 1=rl, 2=fr, 3=rr

  1213.            6chan: 0=fl, 1=c,  2=fr, 3=rl,  4=rr, 5=sub */

  1214.         const int big_endian = avctx->codec->id == CODEC_ID_ADPCM_EA_R3;

  1215.         int32_t previous_sample, current_sample, next_sample;

  1216.         int32_t coeff1, coeff2;

  1217.         uint8_t shift;

  1218.         unsigned int channel;

  1219.         uint16_t *samplesC;

  1220.         uint8_t *srcC;

  1221. 

  1222.         samples_in_chunk = (big_endian ? bytestream_get_be32(&src)

  1223.                                        : bytestream_get_le32(&src)) / 28;

  1224.         if (samples_in_chunk > UINT32_MAX/(28*avctx->channels) ||

  1225.             28*samples_in_chunk*avctx->channels > samples_end-samples) {

  1226.             src += buf_size - 4;

  1227.             break;

  1228.         }

  1229. 

  1230.         for (channel=0; channel<avctx->channels; channel++) {

  1231.             srcC = src + (big_endian ? bytestream_get_be32(&src)

  1232.                                      : bytestream_get_le32(&src))

  1233.                        + (avctx->channels-channel-1) * 4;

  1234.             samplesC = samples + channel;

  1235. 

  1236.             if (avctx->codec->id == CODEC_ID_ADPCM_EA_R1) {

  1237.                 current_sample  = (int16_t)bytestream_get_le16(&srcC);

  1238.                 previous_sample = (int16_t)bytestream_get_le16(&srcC);

  1239.             } else {

  1240.                 current_sample  = c->status[channel].predictor;

  1241.                 previous_sample = c->status[channel].prev_sample;

  1242.             }

  1243. 

  1244.             for (count1=0; count1<samples_in_chunk; count1++) {

  1245.                 if (*srcC == 0xEE) {  /* only seen in R2 and R3 */

  1246.                     srcC++;

  1247.                     current_sample  = (int16_t)bytestream_get_be16(&srcC);

  1248.                     previous_sample = (int16_t)bytestream_get_be16(&srcC);

  1249. 

  1250.                     for (count2=0; count2<28; count2++) {

  1251.                         *samplesC = (int16_t)bytestream_get_be16(&srcC);

  1252.                         samplesC += avctx->channels;

  1253.                     }

  1254.                 } else {

  1255.                     coeff1 = ea_adpcm_table[ (*srcC>>4) & 0x0F     ];

  1256.                     coeff2 = ea_adpcm_table[((*srcC>>4) & 0x0F) + 4];

  1257.                     shift = (*srcC++ & 0x0F) + 8;

  1258. 

  1259.                     for (count2=0; count2<28; count2++) {

  1260.                         if (count2 & 1)

  1261.                             next_sample = ((*srcC++ & 0x0F) << 28) >> shift;

  1262.                         else

  1263.                             next_sample = ((*srcC   & 0xF0) << 24) >> shift;

  1264. 

  1265.                         next_sample += (current_sample  * coeff1) +

  1266.                                        (previous_sample * coeff2);

  1267.                         next_sample = av_clip_int16(next_sample >> 8);

  1268. 

  1269.                         previous_sample = current_sample;

  1270.                         current_sample  = next_sample;

  1271.                         *samplesC = current_sample;

  1272.                         samplesC += avctx->channels;

  1273.                     }

  1274.                 }

  1275.             }

  1276. 

  1277.             if (avctx->codec->id != CODEC_ID_ADPCM_EA_R1) {

  1278.                 c->status[channel].predictor   = current_sample;

  1279.                 c->status[channel].prev_sample = previous_sample;

  1280.             }

  1281.         }

  1282. 

  1283.         src = src + buf_size - (4 + 4*avctx->channels);

  1284.         samples += 28 * samples_in_chunk * avctx->channels;

  1285.         break;

  1286.     }

  1287.     case CODEC_ID_ADPCM_IMA_AMV:

  1288.     case CODEC_ID_ADPCM_IMA_SMJPEG:

  1289.         c->status[0].predictor = (int16_t)bytestream_get_le16(&src);

  1290.         c->status[0].step_index = bytestream_get_le16(&src);

  1291. 

  1292.         if (avctx->codec->id == CODEC_ID_ADPCM_IMA_AMV)

  1293.             src+=4;

  1294. 

  1295.         while (src < buf + buf_size) {

  1296.             char hi, lo;

  1297.             lo = *src & 0x0F;

  1298.             hi = (*src >> 4) & 0x0F;

  1299. 

  1300.             if (avctx->codec->id == CODEC_ID_ADPCM_IMA_AMV)

  1301.                 FFSWAP(char, hi, lo);

  1302. 

  1303.             *samples++ = adpcm_ima_expand_nibble(&c->status[0],

  1304.                 lo, 3);

  1305.             *samples++ = adpcm_ima_expand_nibble(&c->status[0],

  1306.                 hi, 3);

  1307.             src++;

  1308.         }

  1309.         break;

  1310.     case CODEC_ID_ADPCM_CT:

  1311.         while (src < buf + buf_size) {

  1312.             if (st) {

  1313.                 *samples++ = adpcm_ct_expand_nibble(&c->status[0],

  1314.                     (src[0] >> 4) & 0x0F);

  1315.                 *samples++ = adpcm_ct_expand_nibble(&c->status[1],

  1316.                     src[0] & 0x0F);

  1317.             } else {

  1318.                 *samples++ = adpcm_ct_expand_nibble(&c->status[0],

  1319.                     (src[0] >> 4) & 0x0F);

  1320.                 *samples++ = adpcm_ct_expand_nibble(&c->status[0],

  1321.                     src[0] & 0x0F);

  1322.             }

  1323.             src++;

  1324.         }

  1325.         break;

  1326.     case CODEC_ID_ADPCM_SBPRO_4:

  1327.     case CODEC_ID_ADPCM_SBPRO_3:

  1328.     case CODEC_ID_ADPCM_SBPRO_2:

  1329.         if (!c->status[0].step_index) {

  1330.             /* the first byte is a raw sample */

  1331.             *samples++ = 128 * (*src++ - 0x80);

  1332.             if (st)

  1333.               *samples++ = 128 * (*src++ - 0x80);

  1334.             c->status[0].step_index = 1;

  1335.         }

  1336.         if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_4) {

  1337.             while (src < buf + buf_size) {

  1338.                 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],

  1339.                     (src[0] >> 4) & 0x0F, 4, 0);

  1340.                 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],

  1341.                     src[0] & 0x0F, 4, 0);

  1342.                 src++;

  1343.             }

  1344.         } else if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_3) {

  1345.             while (src < buf + buf_size && samples + 2 < samples_end) {

  1346.                 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],

  1347.                     (src[0] >> 5) & 0x07, 3, 0);

  1348.                 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],

  1349.                     (src[0] >> 2) & 0x07, 3, 0);

  1350.                 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],

  1351.                     src[0] & 0x03, 2, 0);

  1352.                 src++;

  1353.             }

  1354.         } else {

  1355.             while (src < buf + buf_size && samples + 3 < samples_end) {

  1356.                 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],

  1357.                     (src[0] >> 6) & 0x03, 2, 2);

  1358.                 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],

  1359.                     (src[0] >> 4) & 0x03, 2, 2);

  1360.                 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],

  1361.                     (src[0] >> 2) & 0x03, 2, 2);

  1362.                 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],

  1363.                     src[0] & 0x03, 2, 2);

  1364.                 src++;

  1365.             }

  1366.         }

  1367.         break;

  1368.     case CODEC_ID_ADPCM_SWF:

  1369.     {

  1370.         GetBitContext gb;

  1371.         const int *table;

  1372.         int k0, signmask, nb_bits, count;

  1373.         int size = buf_size*8;

  1374. 

  1375.         init_get_bits(&gb, buf, size);

  1376. 

  1377.         //read bits & initial values

  1378.         nb_bits = get_bits(&gb, 2)+2;

  1379.         //av_log(NULL,AV_LOG_INFO,"nb_bits: %d\n", nb_bits);

  1380.         table = swf_index_tables[nb_bits-2];

  1381.         k0 = 1 << (nb_bits-2);

  1382.         signmask = 1 << (nb_bits-1);

  1383. 

  1384.         while (get_bits_count(&gb) <= size - 22*avctx->channels) {

  1385.             for (i = 0; i < avctx->channels; i++) {

  1386.                 *samples++ = c->status[i].predictor = get_sbits(&gb, 16);

  1387.                 c->status[i].step_index = get_bits(&gb, 6);

  1388.             }

  1389. 

  1390.             for (count = 0; get_bits_count(&gb) <= size - nb_bits*avctx->channels && count < 4095; count++) {

  1391.                 int i;

  1392. 

  1393.                 for (i = 0; i < avctx->channels; i++) {

  1394.                     // similar to IMA adpcm

  1395.                     int delta = get_bits(&gb, nb_bits);

  1396.                     int step = step_table[c->status[i].step_index];

  1397.                     long vpdiff = 0; // vpdiff = (delta+0.5)*step/4

  1398.                     int k = k0;

  1399. 

  1400.                     do {

  1401.                         if (delta & k)

  1402.                             vpdiff += step;

  1403.                         step >>= 1;

  1404.                         k >>= 1;

  1405.                     } while(k);

  1406.                     vpdiff += step;

  1407. 

  1408.                     if (delta & signmask)

  1409.                         c->status[i].predictor -= vpdiff;

  1410.                     else

  1411.                         c->status[i].predictor += vpdiff;

  1412. 

  1413.                     c->status[i].step_index += table[delta & (~signmask)];

  1414. 

  1415.                     c->status[i].step_index = av_clip(c->status[i].step_index, 0, 88);

  1416.                     c->status[i].predictor = av_clip_int16(c->status[i].predictor);

  1417. 

  1418.                     *samples++ = c->status[i].predictor;

  1419.                     if (samples >= samples_end) {

  1420.                         av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");

  1421.                         return -1;

  1422.                     }

  1423.                 }

  1424.             }

  1425.         }

  1426.         src += buf_size;

  1427.         break;

  1428.     }

  1429.     case CODEC_ID_ADPCM_YAMAHA:

  1430.         while (src < buf + buf_size) {

  1431.             if (st) {

  1432.                 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],

  1433.                         src[0] & 0x0F);

  1434.                 *samples++ = adpcm_yamaha_expand_nibble(&c->status[1],

  1435.                         (src[0] >> 4) & 0x0F);

  1436.             } else {

  1437.                 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],

  1438.                         src[0] & 0x0F);

  1439.                 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],

  1440.                         (src[0] >> 4) & 0x0F);

  1441.             }

  1442.             src++;

  1443.         }

  1444.         break;

  1445.     case CODEC_ID_ADPCM_THP:

  1446.     {

  1447.         int table[2][16];

  1448.         unsigned int samplecnt;

  1449.         int prev[2][2];

  1450.         int ch;

  1451. 

  1452.         if (buf_size < 80) {

  1453.             av_log(avctx, AV_LOG_ERROR, "frame too small\n");

  1454.             return -1;

  1455.         }

  1456. 

  1457.         src+=4;

  1458.         samplecnt = bytestream_get_be32(&src);

  1459. 

  1460.         for (i = 0; i < 32; i++)

  1461.             table[0][i] = (int16_t)bytestream_get_be16(&src);

  1462. 

  1463.         /* Initialize the previous sample.  */

  1464.         for (i = 0; i < 4; i++)

  1465.             prev[0][i] = (int16_t)bytestream_get_be16(&src);

  1466. 

  1467.         if (samplecnt >= (samples_end - samples) /  (st + 1)) {

  1468.             av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");

  1469.             return -1;

  1470.         }

  1471. 

  1472.         for (ch = 0; ch <= st; ch++) {

  1473.             samples = (unsigned short *) data + ch;

  1474. 

  1475.             /* Read in every sample for this channel.  */

  1476.             for (i = 0; i < samplecnt / 14; i++) {

  1477.                 int index = (*src >> 4) & 7;

  1478.                 unsigned int exp = 28 - (*src++ & 15);

  1479.                 int factor1 = table[ch][index * 2];

  1480.                 int factor2 = table[ch][index * 2 + 1];

  1481. 

  1482.                 /* Decode 14 samples.  */

  1483.                 for (n = 0; n < 14; n++) {

  1484.                     int32_t sampledat;

  1485.                     if(n&1) sampledat=  *src++    <<28;

  1486.                     else    sampledat= (*src&0xF0)<<24;

  1487. 

  1488.                     sampledat = ((prev[ch][0]*factor1

  1489.                                 + prev[ch][1]*factor2) >> 11) + (sampledat>>exp);

  1490.                     *samples = av_clip_int16(sampledat);

  1491.                     prev[ch][1] = prev[ch][0];

  1492.                     prev[ch][0] = *samples++;

  1493. 

  1494.                     /* In case of stereo, skip one sample, this sample

  1495.                        is for the other channel.  */

  1496.                     samples += st;

  1497.                 }

  1498.             }

  1499.         }

  1500. 

  1501.         /* In the previous loop, in case stereo is used, samples is

  1502.            increased exactly one time too often.  */

  1503.         samples -= st;

  1504.         break;

  1505.     }

  1506. 

  1507.     default:

  1508.         return -1;

  1509.     }

  1510.     *data_size = (uint8_t *)samples - (uint8_t *)data;

  1511.     return src - buf;

  1512. }

  1513. 

  1514. 

  1515. 

  1516. #ifdef CONFIG_ENCODERS

  1517. #define ADPCM_ENCODER(id,name)                  \

  1518. AVCodec name ## _encoder = {                    \

  1519.     #name,                                      \

  1520.     CODEC_TYPE_AUDIO,                           \

  1521.     id,                                         \

  1522.     sizeof(ADPCMContext),                       \

  1523.     adpcm_encode_init,                          \

  1524.     adpcm_encode_frame,                         \

  1525.     adpcm_encode_close,                         \

  1526.     NULL,                                       \

  1527. };

  1528. #else

  1529. #define ADPCM_ENCODER(id,name)

  1530. #endif

  1531. 

  1532. #ifdef CONFIG_DECODERS

  1533. #define ADPCM_DECODER(id,name)                  \

  1534. AVCodec name ## _decoder = {                    \

  1535.     #name,                                      \

  1536.     CODEC_TYPE_AUDIO,                           \

  1537.     id,                                         \

  1538.     sizeof(ADPCMContext),                       \

  1539.     adpcm_decode_init,                          \

  1540.     NULL,                                       \

  1541.     NULL,                                       \

  1542.     adpcm_decode_frame,                         \

  1543. };

  1544. #else

  1545. #define ADPCM_DECODER(id,name)

  1546. #endif

  1547. 

  1548. #define ADPCM_CODEC(id, name)                   \

  1549. ADPCM_ENCODER(id,name) ADPCM_DECODER(id,name)

  1550. 

  1551. ADPCM_DECODER(CODEC_ID_ADPCM_4XM, adpcm_4xm);

  1552. ADPCM_DECODER(CODEC_ID_ADPCM_CT, adpcm_ct);

  1553. ADPCM_DECODER(CODEC_ID_ADPCM_EA, adpcm_ea);

  1554. ADPCM_DECODER(CODEC_ID_ADPCM_EA_R1, adpcm_ea_r1);

  1555. ADPCM_DECODER(CODEC_ID_ADPCM_EA_R2, adpcm_ea_r2);

  1556. ADPCM_DECODER(CODEC_ID_ADPCM_EA_R3, adpcm_ea_r3);

  1557. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_AMV, adpcm_ima_amv);

  1558. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3);

  1559. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4);

  1560. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_EA_EACS, adpcm_ima_ea_eacs);

  1561. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_EA_SEAD, adpcm_ima_ea_sead);

  1562. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt);

  1563. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg);

  1564. ADPCM_CODEC  (CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav);

  1565. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws);

  1566. ADPCM_CODEC  (CODEC_ID_ADPCM_MS, adpcm_ms);

  1567. ADPCM_DECODER(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4);

  1568. ADPCM_DECODER(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3);

  1569. ADPCM_DECODER(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2);

  1570. ADPCM_CODEC  (CODEC_ID_ADPCM_SWF, adpcm_swf);

  1571. ADPCM_DECODER(CODEC_ID_ADPCM_THP, adpcm_thp);

  1572. ADPCM_DECODER(CODEC_ID_ADPCM_XA, adpcm_xa);

  1573. ADPCM_CODEC  (CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha);