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.
11337 Commits
32 Branches
367MB
Tree: a385446f40
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'a385446f40'
${ noResults }
FFmpeg/libavcodec/adpcm.c

1555 lines
55KB
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.  * THP ADPCM decoder by Marco Gerards (mgerards@xs4all.nl)

  35.  *

  36.  * Features and limitations:

  37.  *

  38.  * Reference documents:

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

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

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

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

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

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

  45.  *

  46.  * CD-ROM XA:

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

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

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

  50.  */

  51. 

  52. #define BLKSIZE 1024

  53. 

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

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

  56. static const int index_table[16] = {

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

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

  59. };

  60. 

  61. /**

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

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

  64.  */

  65. static const int step_table[89] = {

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

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

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

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

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

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

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

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

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

  75. };

  76. 

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

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

  79. static const int AdaptationTable[] = {

  80.         230, 230, 230, 230, 307, 409, 512, 614,

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

  82. };

  83. 

  84. static const int AdaptCoeff1[] = {

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

  86. };

  87. 

  88. static const int AdaptCoeff2[] = {

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

  90. };

  91. 

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

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

  94.    {   0,   0 },

  95.    {  60,   0 },

  96.    { 115, -52 },

  97.    {  98, -55 },

  98.    { 122, -60 }

  99. };

  100. 

  101. static const int ea_adpcm_table[] = {

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

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

  104. };

  105. 

  106. static const int ct_adpcm_table[8] = {

  107.     0x00E6, 0x00E6, 0x00E6, 0x00E6,

  108.     0x0133, 0x0199, 0x0200, 0x0266

  109. };

  110. 

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

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

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

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

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

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

  117. };

  118. 

  119. static const int yamaha_indexscale[] = {

  120.     230, 230, 230, 230, 307, 409, 512, 614,

  121.     230, 230, 230, 230, 307, 409, 512, 614

  122. };

  123. 

  124. static const int yamaha_difflookup[] = {

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

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

  127. };

  128. 

  129. /* end of tables */

  130. 

  131. typedef struct ADPCMChannelStatus {

  132.     int predictor;

  133.     short int step_index;

  134.     int step;

  135.     /* for encoding */

  136.     int prev_sample;

  137. 

  138.     /* MS version */

  139.     short sample1;

  140.     short sample2;

  141.     int coeff1;

  142.     int coeff2;

  143.     int idelta;

  144. } ADPCMChannelStatus;

  145. 

  146. typedef struct ADPCMContext {

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

  148.     ADPCMChannelStatus status[6];

  149. } ADPCMContext;

  150. 

  151. /* XXX: implement encoding */

  152. 

  153. #ifdef CONFIG_ENCODERS

  154. static int adpcm_encode_init(AVCodecContext *avctx)

  155. {

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

  162.         return -1;

  163.         break;

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

  169.         break;

  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;

  174.         break;

  175.     case CODEC_ID_ADPCM_YAMAHA:

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

  177.         avctx->block_align = BLKSIZE;

  178.         break;

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

  184.             return -1;

  185.         }

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

  187.         break;

  188.     default:

  189.         return -1;

  190.         break;

  191.     }

  192. 

  193.     avctx->coded_frame= avcodec_alloc_frame();

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

  195. 

  196.     return 0;

  197. }

  198. 

  199. static int adpcm_encode_close(AVCodecContext *avctx)

  200. {

  201.     av_freep(&avctx->coded_frame);

  202. 

  203.     return 0;

  204. }

  205. 

  206. 

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

  208. {

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

  214.     return nibble;

  215. }

  216. 

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

  218. {

  219.     int predictor, nibble, bias;

  220. 

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

  222. 

  223.     nibble= sample - predictor;

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

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

  226. 

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

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

  229. 

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

  231. 

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

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

  234. 

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

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

  237. 

  238.     return nibble;

  239. }

  240. 

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

  242. {

  243.     int nibble, delta;

  244. 

  245.     if(!c->step) {

  246.         c->predictor = 0;

  247.         c->step = 127;

  248.     }

  249. 

  250.     delta = sample - c->predictor;

  251. 

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

  253. 

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

  258. 

  259.     return nibble;

  260. }

  261. 

  262. typedef struct TrellisPath {

  263.     int nibble;

  264.     int prev;

  265. } TrellisPath;

  266. 

  267. typedef struct TrellisNode {

  268.     uint32_t ssd;

  269.     int path;

  270.     int sample1;

  271.     int sample2;

  272.     int step;

  273. } TrellisNode;

  274. 

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

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

  277. {

  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;

  290. 

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

  292. 

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

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

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

  296.     nodes[0]->path = 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) || (version == CODEC_ID_ADPCM_SWF))

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

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

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

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

  308.         } else {

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

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

  311.         }

  312.     }

  313. 

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

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

  316.         TrellisNode **u;

  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;

  323.             int nidx;

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

  333.                     int d;\

  334.                     uint32_t ssd;\

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

  339.                         continue;\

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

  346.                             goto next_##NAME;\

  347.                         }\

  348.                     }\

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

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

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

  352.                             if(!u) {\

  353.                                 assert(pathn < max_paths);\

  354.                                 u = t++;\

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

  356.                             }\

  357.                             u->ssd = ssd;\

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

  364.                             nodes_next[k] = u;\

  365.                             break;\

  366.                         }\

  367.                     }\

  368.                     next_##NAME:;

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

  370.                 }

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

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

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

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

  383.                 }

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

  387. #undef LOOP_NODES

  388. #undef STORE_NODE

  389.             }

  390.         }

  391. 

  392.         u = nodes;

  393.         nodes = nodes_next;

  394.         nodes_next = u;

  395. 

  396.         // prevent overflow

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

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

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

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

  401.         }

  402. 

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

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

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

  409.             }

  410.             froze = i;

  411.             pathn = 0;

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

  416.         }

  417.     }

  418. 

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

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

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

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

  423.     }

  424. 

  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;

  431. }

  432. 

  433. static int adpcm_encode_frame(AVCodecContext *avctx,

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

  435. {

  436.     int n, i, st;

  437.     short *samples;

  438.     unsigned char *dst;

  439.     ADPCMContext *c = avctx->priv_data;

  440. 

  441.     dst = frame;

  442.     samples = (short *)data;

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

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

  445. 

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

  447.     case CODEC_ID_ADPCM_IMA_QT: /* XXX: can't test until we get .mov writer */

  448.         break;

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

  456.             samples++;

  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;

  462.                 *dst++ = 0;

  463.                 samples++;

  464.             }

  465. 

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

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

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

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

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

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

  482.                     }

  483.                 }

  484.             } else

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

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

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

  488.                 dst++;

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

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

  491.                 dst++;

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

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

  494.                 dst++;

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

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

  497.                 dst++;

  498.                 /* right channel */

  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;

  502.                     dst++;

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

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

  505.                     dst++;

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

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

  508.                     dst++;

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

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

  511.                     dst++;

  512.                 }

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

  514.             }

  515.         break;

  516.     case CODEC_ID_ADPCM_SWF:

  517.     {

  518.         int i;

  519.         PutBitContext pb;

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

  521. 

  522.         n = avctx->frame_size-1;

  523. 

  524.         //Store AdpcmCodeSize

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

  526. 

  527.         //Init the encoder state

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

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

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

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

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

  533.         }

  534. 

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

  536.             uint8_t buf[2][n];

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

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

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

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

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

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

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

  544.             }

  545.         } else {

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

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

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

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

  550.             }

  551.         }

  552.         flush_put_bits(&pb);

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

  554.         break;

  555.     }

  556.     case CODEC_ID_ADPCM_MS:

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

  558.             int predictor=0;

  559. 

  560.             *dst++ = predictor;

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

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

  563.         }

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

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

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

  567. 

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

  569.         }

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

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

  572. 

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

  574.         }

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

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

  577. 

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

  579.         }

  580. 

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

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

  583.             uint8_t buf[2][n];

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

  585.                 n *= 2;

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

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

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

  589.             } else {

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

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

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

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

  594.             }

  595.         } else

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

  597.             int nibble;

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

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

  600.             *dst++ = nibble;

  601.         }

  602.         break;

  603.     case CODEC_ID_ADPCM_YAMAHA:

  604.         n = avctx->frame_size / 2;

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

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

  607.             n *= 2;

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

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

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

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

  612.             } else {

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

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

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

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

  617.             }

  618.         } else

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

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

  621.                 int nibble;

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

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

  624.                 *dst++ = nibble;

  625.             }

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

  627.         }

  628.         break;

  629.     default:

  630.         return -1;

  631.     }

  632.     return dst - frame;

  633. }

  634. #endif //CONFIG_ENCODERS

  635. 

  636. static int adpcm_decode_init(AVCodecContext * avctx)

  637. {

  638.     ADPCMContext *c = avctx->priv_data;

  639.     unsigned int max_channels = 2;

  640. 

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

  642.     case CODEC_ID_ADPCM_EA_R1:

  643.     case CODEC_ID_ADPCM_EA_R2:

  644.     case CODEC_ID_ADPCM_EA_R3:

  645.         max_channels = 6;

  646.         break;

  647.     }

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

  649.         return -1;

  650.     }

  651. 

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

  653.     case CODEC_ID_ADPCM_CT:

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

  655.         break;

  656.     case CODEC_ID_ADPCM_IMA_WS:

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

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

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

  660.         }

  661.         break;

  662.     default:

  663.         break;

  664.     }

  665.     return 0;

  666. }

  667. 

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

  669. {

  670.     int step_index;

  671.     int predictor;

  672.     int sign, delta, diff, step;

  673. 

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

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

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

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

  678. 

  679.     sign = nibble & 8;

  680.     delta = nibble & 7;

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

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

  683.      * quickly enough */

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

  685.     predictor = c->predictor;

  686.     if (sign) predictor -= diff;

  687.     else predictor += diff;

  688. 

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

  690.     c->step_index = step_index;

  691. 

  692.     return (short)c->predictor;

  693. }

  694. 

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

  696. {

  697.     int predictor;

  698. 

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

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

  701. 

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

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

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

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

  706. 

  707.     return c->sample1;

  708. }

  709. 

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

  711. {

  712.     int sign, delta, diff;

  713.     int new_step;

  714. 

  715.     sign = nibble & 8;

  716.     delta = nibble & 7;

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

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

  719.      * quickly enough */

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

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

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

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

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

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

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

  727. 

  728.     return (short)c->predictor;

  729. }

  730. 

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

  732. {

  733.     int sign, delta, diff;

  734. 

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

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

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

  738. 

  739.     /* clamp result */

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

  741. 

  742.     /* calculate new step */

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

  744.         c->step++;

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

  746.         c->step--;

  747. 

  748.     return (short) c->predictor;

  749. }

  750. 

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

  752. {

  753.     if(!c->step) {

  754.         c->predictor = 0;

  755.         c->step = 127;

  756.     }

  757. 

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

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

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

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

  762.     return c->predictor;

  763. }

  764. 

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

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

  767. {

  768.     int i, j;

  769.     int shift,filter,f0,f1;

  770.     int s_1,s_2;

  771.     int d,s,t;

  772. 

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

  774. 

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

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

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

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

  779. 

  780.         s_1 = left->sample1;

  781.         s_2 = left->sample2;

  782. 

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

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

  785. 

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

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

  788.             s_2 = s_1;

  789.             s_1 = av_clip_int16(s);

  790.             *out = s_1;

  791.             out += inc;

  792.         }

  793. 

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

  795.             left->sample1 = s_1;

  796.             left->sample2 = s_2;

  797.             s_1 = right->sample1;

  798.             s_2 = right->sample2;

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

  800.         }

  801. 

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

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

  804. 

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

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

  807. 

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

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

  810. 

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

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

  813.             s_2 = s_1;

  814.             s_1 = av_clip_int16(s);

  815.             *out = s_1;

  816.             out += inc;

  817.         }

  818. 

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

  820.             right->sample1 = s_1;

  821.             right->sample2 = s_2;

  822.             out -= 1;

  823.         } else {

  824.             left->sample1 = s_1;

  825.             left->sample2 = s_2;

  826.         }

  827.     }

  828. }

  829. 

  830. 

  831. /* DK3 ADPCM support macro */

  832. #define DK3_GET_NEXT_NIBBLE() \

  833.     if (decode_top_nibble_next) \

  834.     { \

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

  836.         decode_top_nibble_next = 0; \

  837.     } \

  838.     else \

  839.     { \

  840.         last_byte = *src++; \

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

  842.         nibble = last_byte & 0x0F; \

  843.         decode_top_nibble_next = 1; \

  844.     }

  845. 

  846. static int adpcm_decode_frame(AVCodecContext *avctx,

  847.                             void *data, int *data_size,

  848.                             uint8_t *buf, int buf_size)

  849. {

  850.     ADPCMContext *c = avctx->priv_data;

  851.     ADPCMChannelStatus *cs;

  852.     int n, m, channel, i;

  853.     int block_predictor[2];

  854.     short *samples;

  855.     short *samples_end;

  856.     uint8_t *src;

  857.     int st; /* stereo */

  858. 

  859.     /* DK3 ADPCM accounting variables */

  860.     unsigned char last_byte = 0;

  861.     unsigned char nibble;

  862.     int decode_top_nibble_next = 0;

  863.     int diff_channel;

  864. 

  865.     /* EA ADPCM state variables */

  866.     uint32_t samples_in_chunk;

  867.     int32_t previous_left_sample, previous_right_sample;

  868.     int32_t current_left_sample, current_right_sample;

  869.     int32_t next_left_sample, next_right_sample;

  870.     int32_t coeff1l, coeff2l, coeff1r, coeff2r;

  871.     uint8_t shift_left, shift_right;

  872.     int count1, count2;

  873. 

  874.     if (!buf_size)

  875.         return 0;

  876. 

  877.     //should protect all 4bit ADPCM variants

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

  879.     //

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

  881.         return -1;

  882. 

  883.     samples = data;

  884.     samples_end= samples + *data_size/2;

  885.     *data_size= 0;

  886.     src = buf;

  887. 

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

  889. 

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

  891.     case CODEC_ID_ADPCM_IMA_QT:

  892.         n = (buf_size - 2);/* >> 2*avctx->channels;*/

  893.         channel = c->channel;

  894.         cs = &(c->status[channel]);

  895.         /* (pppppp) (piiiiiii) */

  896. 

  897.         /* Bits 15-7 are the _top_ 9 bits of the 16-bit initial predictor value */

  898.         cs->predictor = (*src++) << 8;

  899.         cs->predictor |= (*src & 0x80);

  900.         cs->predictor &= 0xFF80;

  901. 

  902.         /* sign extension */

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

  904.             cs->predictor -= 0x10000;

  905. 

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

  907. 

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

  909. 

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

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

  912.             cs->step_index = 88;

  913.         }

  914. 

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

  916. 

  917.         if (st && channel)

  918.             samples++;

  919. 

  920.         for(m=32; n>0 && m>0; n--, m--) { /* in QuickTime, IMA is encoded by chuncks of 34 bytes (=64 samples) */

  921.             *samples = adpcm_ima_expand_nibble(cs, src[0] & 0x0F, 3);

  922.             samples += avctx->channels;

  923.             *samples = adpcm_ima_expand_nibble(cs, (src[0] >> 4) & 0x0F, 3);

  924.             samples += avctx->channels;

  925.             src ++;

  926.         }

  927. 

  928.         if(st) { /* handle stereo interlacing */

  929.             c->channel = (channel + 1) % 2; /* we get one packet for left, then one for right data */

  930.             if(channel == 1) { /* wait for the other packet before outputing anything */

  931.                 return src - buf;

  932.             }

  933.         }

  934.         break;

  935.     case CODEC_ID_ADPCM_IMA_WAV:

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

  937.             buf_size = avctx->block_align;

  938. 

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

  940. 

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

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

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

  944.             src+=2;

  945. 

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

  947. 

  948.             cs->step_index = *src++;

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

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

  951.                 cs->step_index = 88;

  952.             }

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

  954.         }

  955. 

  956.         while(src < buf + buf_size){

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

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

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

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

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

  962.                 src++;

  963.             }

  964.             src += 4*st;

  965.         }

  966.         break;

  967.     case CODEC_ID_ADPCM_4XM:

  968.         cs = &(c->status[0]);

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

  970.         if(st){

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

  972.         }

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

  974.         if(st){

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

  976.         }

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

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

  979. 

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

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

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

  983.             if (st)

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

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

  986.             if (st)

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

  988.         }

  989. 

  990.         src += m<<st;

  991. 

  992.         break;

  993.     case CODEC_ID_ADPCM_MS:

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

  995.             buf_size = avctx->block_align;

  996.         n = buf_size - 7 * avctx->channels;

  997.         if (n < 0)

  998.             return -1;

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

  1000.         block_predictor[1] = 0;

  1001.         if (st)

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

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

  1004.         src+=2;

  1005.         if (st){

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

  1007.             src+=2;

  1008.         }

  1009.         c->status[0].coeff1 = AdaptCoeff1[block_predictor[0]];

  1010.         c->status[0].coeff2 = AdaptCoeff2[block_predictor[0]];

  1011.         c->status[1].coeff1 = AdaptCoeff1[block_predictor[1]];

  1012.         c->status[1].coeff2 = AdaptCoeff2[block_predictor[1]];

  1013. 

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

  1015.         src+=2;

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

  1017.         if (st) src+=2;

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

  1019.         src+=2;

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

  1021.         if (st) src+=2;

  1022. 

  1023.         *samples++ = c->status[0].sample1;

  1024.         if (st) *samples++ = c->status[1].sample1;

  1025.         *samples++ = c->status[0].sample2;

  1026.         if (st) *samples++ = c->status[1].sample2;

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

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

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

  1030.             src ++;

  1031.         }

  1032.         break;

  1033.     case CODEC_ID_ADPCM_IMA_DK4:

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

  1035.             buf_size = avctx->block_align;

  1036. 

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

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

  1039.         src += 4;

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

  1041.         if (st) {

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

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

  1044.             src += 4;

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

  1046.         }

  1047.         while (src < buf + buf_size) {

  1048. 

  1049.             /* take care of the top nibble (always left or mono channel) */

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

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

  1052. 

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

  1054.              * stereo, or another mono sample */

  1055.             if (st)

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

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

  1058.             else

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

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

  1061. 

  1062.             src++;

  1063.         }

  1064.         break;

  1065.     case CODEC_ID_ADPCM_IMA_DK3:

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

  1067.             buf_size = avctx->block_align;

  1068. 

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

  1070.             return -1;

  1071. 

  1072.         c->status[0].predictor = (int16_t)(src[10] | (src[11] << 8));

  1073.         c->status[1].predictor = (int16_t)(src[12] | (src[13] << 8));

  1074.         c->status[0].step_index = src[14];

  1075.         c->status[1].step_index = src[15];

  1076.         /* sign extend the predictors */

  1077.         src += 16;

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

  1079. 

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

  1081.          * the buffer is consumed */

  1082.         while (1) {

  1083. 

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

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

  1086. 

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

  1088.             DK3_GET_NEXT_NIBBLE();

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

  1090. 

  1091.             /* process the diff channel predictor */

  1092.             DK3_GET_NEXT_NIBBLE();

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

  1094. 

  1095.             /* process the first pair of stereo PCM samples */

  1096.             diff_channel = (diff_channel + c->status[1].predictor) / 2;

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

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

  1099. 

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

  1101.             DK3_GET_NEXT_NIBBLE();

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

  1103. 

  1104.             /* process the second pair of stereo PCM samples */

  1105.             diff_channel = (diff_channel + c->status[1].predictor) / 2;

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

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

  1108.         }

  1109.         break;

  1110.     case CODEC_ID_ADPCM_IMA_WS:

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

  1112.         while (src < buf + buf_size) {

  1113. 

  1114.             if (st) {

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

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

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

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

  1119.             } else {

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

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

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

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

  1124.             }

  1125. 

  1126.             src++;

  1127.         }

  1128.         break;

  1129.     case CODEC_ID_ADPCM_XA:

  1130.         c->status[0].sample1 = c->status[0].sample2 =

  1131.         c->status[1].sample1 = c->status[1].sample2 = 0;

  1132.         while (buf_size >= 128) {

  1133.             xa_decode(samples, src, &c->status[0], &c->status[1],

  1134.                 avctx->channels);

  1135.             src += 128;

  1136.             samples += 28 * 8;

  1137.             buf_size -= 128;

  1138.         }

  1139.         break;

  1140.     case CODEC_ID_ADPCM_EA:

  1141.         samples_in_chunk = AV_RL32(src);

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

  1143.             src += buf_size;

  1144.             break;

  1145.         }

  1146.         src += 4;

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

  1148.         src += 2;

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

  1150.         src += 2;

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

  1152.         src += 2;

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

  1154.         src += 2;

  1155. 

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

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

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

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

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

  1161.             src++;

  1162. 

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

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

  1165.             src++;

  1166. 

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

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

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

  1170.                 src++;

  1171. 

  1172.                 next_left_sample = (next_left_sample +

  1173.                     (current_left_sample * coeff1l) +

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

  1175.                 next_right_sample = (next_right_sample +

  1176.                     (current_right_sample * coeff1r) +

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

  1178. 

  1179.                 previous_left_sample = current_left_sample;

  1180.                 current_left_sample = av_clip_int16(next_left_sample);

  1181.                 previous_right_sample = current_right_sample;

  1182.                 current_right_sample = av_clip_int16(next_right_sample);

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

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

  1185.             }

  1186.         }

  1187.         break;

  1188.     case CODEC_ID_ADPCM_EA_R1:

  1189.     case CODEC_ID_ADPCM_EA_R2:

  1190.     case CODEC_ID_ADPCM_EA_R3: {

  1191.         /* channel numbering

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

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

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

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

  1196.         int32_t previous_sample, current_sample, next_sample;

  1197.         int32_t coeff1, coeff2;

  1198.         uint8_t shift;

  1199.         unsigned int channel;

  1200.         uint16_t *samplesC;

  1201.         uint8_t *srcC;

  1202. 

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

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

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

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

  1207.             src += buf_size - 4;

  1208.             break;

  1209.         }

  1210. 

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

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

  1213.                                      : bytestream_get_le32(&src))

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

  1215.             samplesC = samples + channel;

  1216. 

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

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

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

  1220.             } else {

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

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

  1223.             }

  1224. 

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

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

  1227.                     srcC++;

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

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

  1230. 

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

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

  1233.                         samplesC += avctx->channels;

  1234.                     }

  1235.                 } else {

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

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

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

  1239. 

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

  1241.                         if (count2 & 1)

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

  1243.                         else

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

  1245. 

  1246.                         next_sample += (current_sample  * coeff1) +

  1247.                                        (previous_sample * coeff2);

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

  1249. 

  1250.                         previous_sample = current_sample;

  1251.                         current_sample  = next_sample;

  1252.                         *samplesC = current_sample;

  1253.                         samplesC += avctx->channels;

  1254.                     }

  1255.                 }

  1256.             }

  1257. 

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

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

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

  1261.             }

  1262.         }

  1263. 

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

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

  1266.         break;

  1267.     }

  1268.     case CODEC_ID_ADPCM_IMA_AMV:

  1269.     case CODEC_ID_ADPCM_IMA_SMJPEG:

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

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

  1272. 

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

  1274.             src+=4;

  1275. 

  1276.         while (src < buf + buf_size) {

  1277.             char hi, lo;

  1278.             lo = *src & 0x0F;

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

  1280. 

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

  1282.                 FFSWAP(char, hi, lo);

  1283. 

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

  1285.                 lo, 3);

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

  1287.                 hi, 3);

  1288.             src++;

  1289.         }

  1290.         break;

  1291.     case CODEC_ID_ADPCM_CT:

  1292.         while (src < buf + buf_size) {

  1293.             if (st) {

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

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

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

  1297.                     src[0] & 0x0F);

  1298.             } else {

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

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

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

  1302.                     src[0] & 0x0F);

  1303.             }

  1304.             src++;

  1305.         }

  1306.         break;

  1307.     case CODEC_ID_ADPCM_SBPRO_4:

  1308.     case CODEC_ID_ADPCM_SBPRO_3:

  1309.     case CODEC_ID_ADPCM_SBPRO_2:

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

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

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

  1313.             if (st)

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

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

  1316.         }

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

  1318.             while (src < buf + buf_size) {

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

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

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

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

  1323.                 src++;

  1324.             }

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

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

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

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

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

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

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

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

  1333.                 src++;

  1334.             }

  1335.         } else {

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

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

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

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

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

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

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

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

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

  1345.                 src++;

  1346.             }

  1347.         }

  1348.         break;

  1349.     case CODEC_ID_ADPCM_SWF:

  1350.     {

  1351.         GetBitContext gb;

  1352.         const int *table;

  1353.         int k0, signmask, nb_bits, count;

  1354.         int size = buf_size*8;

  1355. 

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

  1357. 

  1358.         //read bits & initial values

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

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

  1361.         table = swf_index_tables[nb_bits-2];

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

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

  1364. 

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

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

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

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

  1369.             }

  1370. 

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

  1372.                 int i;

  1373. 

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

  1375.                     // similar to IMA adpcm

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

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

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

  1379.                     int k = k0;

  1380. 

  1381.                     do {

  1382.                         if (delta & k)

  1383.                             vpdiff += step;

  1384.                         step >>= 1;

  1385.                         k >>= 1;

  1386.                     } while(k);

  1387.                     vpdiff += step;

  1388. 

  1389.                     if (delta & signmask)

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

  1391.                     else

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

  1393. 

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

  1395. 

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

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

  1398. 

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

  1400.                     if (samples >= samples_end) {

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

  1402.                         return -1;

  1403.                     }

  1404.                 }

  1405.             }

  1406.         }

  1407.         src += buf_size;

  1408.         break;

  1409.     }

  1410.     case CODEC_ID_ADPCM_YAMAHA:

  1411.         while (src < buf + buf_size) {

  1412.             if (st) {

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

  1414.                         src[0] & 0x0F);

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

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

  1417.             } else {

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

  1419.                         src[0] & 0x0F);

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

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

  1422.             }

  1423.             src++;

  1424.         }

  1425.         break;

  1426.     case CODEC_ID_ADPCM_THP:

  1427.     {

  1428.         int table[2][16];

  1429.         unsigned int samplecnt;

  1430.         int prev[2][2];

  1431.         int ch;

  1432. 

  1433.         if (buf_size < 80) {

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

  1435.             return -1;

  1436.         }

  1437. 

  1438.         src+=4;

  1439.         samplecnt = bytestream_get_be32(&src);

  1440. 

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

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

  1443. 

  1444.         /* Initialize the previous sample.  */

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

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

  1447. 

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

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

  1450.             return -1;

  1451.         }

  1452. 

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

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

  1455. 

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

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

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

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

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

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

  1462. 

  1463.                 /* Decode 14 samples.  */

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

  1465.                     int32_t sampledat;

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

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

  1468. 

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

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

  1471.                     *samples = av_clip_int16(sampledat);

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

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

  1474. 

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

  1476.                        is for the other channel.  */

  1477.                     samples += st;

  1478.                 }

  1479.             }

  1480.         }

  1481. 

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

  1483.            increased exactly one time too often.  */

  1484.         samples -= st;

  1485.         break;

  1486.     }

  1487. 

  1488.     default:

  1489.         return -1;

  1490.     }

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

  1492.     return src - buf;

  1493. }

  1494. 

  1495. 

  1496. 

  1497. #ifdef CONFIG_ENCODERS

  1498. #define ADPCM_ENCODER(id,name)                  \

  1499. AVCodec name ## _encoder = {                    \

  1500.     #name,                                      \

  1501.     CODEC_TYPE_AUDIO,                           \

  1502.     id,                                         \

  1503.     sizeof(ADPCMContext),                       \

  1504.     adpcm_encode_init,                          \

  1505.     adpcm_encode_frame,                         \

  1506.     adpcm_encode_close,                         \

  1507.     NULL,                                       \

  1508. };

  1509. #else

  1510. #define ADPCM_ENCODER(id,name)

  1511. #endif

  1512. 

  1513. #ifdef CONFIG_DECODERS

  1514. #define ADPCM_DECODER(id,name)                  \

  1515. AVCodec name ## _decoder = {                    \

  1516.     #name,                                      \

  1517.     CODEC_TYPE_AUDIO,                           \

  1518.     id,                                         \

  1519.     sizeof(ADPCMContext),                       \

  1520.     adpcm_decode_init,                          \

  1521.     NULL,                                       \

  1522.     NULL,                                       \

  1523.     adpcm_decode_frame,                         \

  1524. };

  1525. #else

  1526. #define ADPCM_DECODER(id,name)

  1527. #endif

  1528. 

  1529. #define ADPCM_CODEC(id, name)                   \

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

  1531. 

  1532. ADPCM_CODEC(CODEC_ID_ADPCM_4XM, adpcm_4xm);

  1533. ADPCM_CODEC(CODEC_ID_ADPCM_CT, adpcm_ct);

  1534. ADPCM_CODEC(CODEC_ID_ADPCM_EA, adpcm_ea);

  1535. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_AMV, adpcm_ima_amv);

  1536. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3);

  1537. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4);

  1538. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt);

  1539. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg);

  1540. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav);

  1541. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws);

  1542. ADPCM_CODEC(CODEC_ID_ADPCM_MS, adpcm_ms);

  1543. ADPCM_CODEC(CODEC_ID_ADPCM_EA_R1, adpcm_ea_r1);

  1544. ADPCM_CODEC(CODEC_ID_ADPCM_EA_R2, adpcm_ea_r2);

  1545. ADPCM_CODEC(CODEC_ID_ADPCM_EA_R3, adpcm_ea_r3);

  1546. ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4);

  1547. ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3);

  1548. ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2);

  1549. ADPCM_CODEC(CODEC_ID_ADPCM_SWF, adpcm_swf);

  1550. ADPCM_CODEC(CODEC_ID_ADPCM_THP, adpcm_thp);

  1551. ADPCM_CODEC(CODEC_ID_ADPCM_XA, adpcm_xa);

  1552. ADPCM_CODEC(CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha);

  1553. 

  1554. #undef ADPCM_CODEC