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.
26621 Commits
32 Branches
2.4GB
Tree: cef4b74bf2
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'cef4b74bf2'
${ noResults }
FFmpeg/libavcodec/adpcm.c

1748 lines
64KB
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 "get_bits.h"

  23. #include "put_bits.h"

  24. #include "bytestream.h"

  25. 

  26. /**

  27.  * @file

  28.  * ADPCM codecs.

  29.  * First version by Francois Revol (revol@free.fr)

  30.  * Fringe ADPCM codecs (e.g., DK3, DK4, Westwood)

  31.  *   by Mike Melanson (melanson@pcisys.net)

  32.  * CD-ROM XA ADPCM codec by BERO

  33.  * EA ADPCM decoder by Robin Kay (komadori@myrealbox.com)

  34.  * EA ADPCM R1/R2/R3 decoder by Peter Ross (pross@xvid.org)

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

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

  37.  * EA ADPCM XAS decoder by Peter Ross (pross@xvid.org)

  38.  * MAXIS EA ADPCM decoder by Robert Marston (rmarston@gmail.com)

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

  40.  *

  41.  * Features and limitations:

  42.  *

  43.  * Reference documents:

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

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

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

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

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

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

  50.  *

  51.  * CD-ROM XA:

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

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

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

  55.  */

  56. 

  57. #define BLKSIZE 1024

  58. 

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

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

  61. static const int index_table[16] = {

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

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

  64. };

  65. 

  66. /**

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

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

  69.  */

  70. static const int step_table[89] = {

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

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

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

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

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

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

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

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

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

  80. };

  81. 

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

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

  84. static const int AdaptationTable[] = {

  85.         230, 230, 230, 230, 307, 409, 512, 614,

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

  87. };

  88. 

  89. /** Divided by 4 to fit in 8-bit integers */

  90. static const uint8_t AdaptCoeff1[] = {

  91.         64, 128, 0, 48, 60, 115, 98

  92. };

  93. 

  94. /** Divided by 4 to fit in 8-bit integers */

  95. static const int8_t AdaptCoeff2[] = {

  96.         0, -64, 0, 16, 0, -52, -58

  97. };

  98. 

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

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

  101.    {   0,   0 },

  102.    {  60,   0 },

  103.    { 115, -52 },

  104.    {  98, -55 },

  105.    { 122, -60 }

  106. };

  107. 

  108. static const int ea_adpcm_table[] = {

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

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

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

  149.     int nibble;

  150.     int prev;

  151. } TrellisPath;

  152. 

  153. typedef struct TrellisNode {

  154.     uint32_t ssd;

  155.     int path;

  156.     int sample1;

  157.     int sample2;

  158.     int step;

  159. } TrellisNode;

  160. 

  161. typedef struct ADPCMContext {

  162.     ADPCMChannelStatus status[6];

  163.     TrellisPath *paths;

  164.     TrellisNode *node_buf;

  165.     TrellisNode **nodep_buf;

  166. } ADPCMContext;

  167. 

  168. #define FREEZE_INTERVAL 128

  169. 

  170. /* XXX: implement encoding */

  171. 

  172. #if CONFIG_ENCODERS

  173. static av_cold int adpcm_encode_init(AVCodecContext *avctx)

  174. {

  175.     ADPCMContext *s = avctx->priv_data;

  176.     uint8_t *extradata;

  177.     int i;

  178.     if (avctx->channels > 2)

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

  180. 

  181.     if(avctx->trellis && (unsigned)avctx->trellis > 16U){

  182.         av_log(avctx, AV_LOG_ERROR, "invalid trellis size\n");

  183.         return -1;

  184.     }

  185. 

  186.     if (avctx->trellis) {

  187.         int frontier = 1 << avctx->trellis;

  188.         int max_paths =  frontier * FREEZE_INTERVAL;

  189.         FF_ALLOC_OR_GOTO(avctx, s->paths,     max_paths * sizeof(*s->paths), error);

  190.         FF_ALLOC_OR_GOTO(avctx, s->node_buf,  2 * frontier * sizeof(*s->node_buf), error);

  191.         FF_ALLOC_OR_GOTO(avctx, s->nodep_buf, 2 * frontier * sizeof(*s->nodep_buf), error);

  192.     }

  193. 

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

  195.     case CODEC_ID_ADPCM_IMA_WAV:

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

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

  198.         avctx->block_align = BLKSIZE;

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

  200.         break;

  201.     case CODEC_ID_ADPCM_IMA_QT:

  202.         avctx->frame_size = 64;

  203.         avctx->block_align = 34 * avctx->channels;

  204.         break;

  205.     case CODEC_ID_ADPCM_MS:

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

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

  208.         avctx->block_align = BLKSIZE;

  209.         avctx->extradata_size = 32;

  210.         extradata = avctx->extradata = av_malloc(avctx->extradata_size);

  211.         if (!extradata)

  212.             return AVERROR(ENOMEM);

  213.         bytestream_put_le16(&extradata, avctx->frame_size);

  214.         bytestream_put_le16(&extradata, 7); /* wNumCoef */

  215.         for (i = 0; i < 7; i++) {

  216.             bytestream_put_le16(&extradata, AdaptCoeff1[i] * 4);

  217.             bytestream_put_le16(&extradata, AdaptCoeff2[i] * 4);

  218.         }

  219.         break;

  220.     case CODEC_ID_ADPCM_YAMAHA:

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

  222.         avctx->block_align = BLKSIZE;

  223.         break;

  224.     case CODEC_ID_ADPCM_SWF:

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

  226.             avctx->sample_rate != 22050 &&

  227.             avctx->sample_rate != 44100) {

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

  229.             goto error;

  230.         }

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

  232.         break;

  233.     default:

  234.         goto error;

  235.     }

  236. 

  237.     avctx->coded_frame= avcodec_alloc_frame();

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

  239. 

  240.     return 0;

  241. error:

  242.     av_freep(&s->paths);

  243.     av_freep(&s->node_buf);

  244.     av_freep(&s->nodep_buf);

  245.     return -1;

  246. }

  247. 

  248. static av_cold int adpcm_encode_close(AVCodecContext *avctx)

  249. {

  250.     ADPCMContext *s = avctx->priv_data;

  251.     av_freep(&avctx->coded_frame);

  252.     av_freep(&s->paths);

  253.     av_freep(&s->node_buf);

  254.     av_freep(&s->nodep_buf);

  255. 

  256.     return 0;

  257. }

  258. 

  259. 

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

  261. {

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

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

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

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

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

  267.     return nibble;

  268. }

  269. 

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

  271. {

  272.     int predictor, nibble, bias;

  273. 

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

  275. 

  276.     nibble= sample - predictor;

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

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

  279. 

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

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

  282. 

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

  284. 

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

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

  287. 

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

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

  290. 

  291.     return nibble;

  292. }

  293. 

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

  295. {

  296.     int nibble, delta;

  297. 

  298.     if(!c->step) {

  299.         c->predictor = 0;

  300.         c->step = 127;

  301.     }

  302. 

  303.     delta = sample - c->predictor;

  304. 

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

  306. 

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

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

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

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

  311. 

  312.     return nibble;

  313. }

  314. 

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

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

  317. {

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

  319.     ADPCMContext *s = avctx->priv_data;

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

  321.     const int stride = avctx->channels;

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

  323.     TrellisPath *paths = s->paths, *p;

  324.     TrellisNode *node_buf = s->node_buf;

  325.     TrellisNode **nodep_buf = s->nodep_buf;

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

  327.     TrellisNode **nodes_next = nodep_buf + frontier;

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

  329. 

  330.     memset(nodep_buf, 0, 2 * frontier * sizeof(*nodep_buf));

  331.     nodes[0] = node_buf + frontier;

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

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

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

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

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

  337.     if((version == CODEC_ID_ADPCM_IMA_WAV) || (version == CODEC_ID_ADPCM_IMA_QT) || (version == CODEC_ID_ADPCM_SWF))

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

  339.     if(version == CODEC_ID_ADPCM_MS)

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

  341.     if(version == CODEC_ID_ADPCM_YAMAHA) {

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

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

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

  345.         } else {

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

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

  348.         }

  349.     }

  350. 

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

  352.         TrellisNode *t = node_buf + frontier*(i&1);

  353.         TrellisNode **u;

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

  355.         int heap_pos = 0;

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

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

  358.             // higher j have higher ssd already, so they're likely to yield a suboptimal next sample too

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

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

  361.             int nidx;

  362.             if(version == CODEC_ID_ADPCM_MS) {

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

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

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

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

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

  368.                     const int nibble = nidx & 0xf;

  369.                     int dec_sample = predictor + nidx * step;

  370. #define STORE_NODE(NAME, STEP_INDEX)\

  371.                     int d;\

  372.                     uint32_t ssd;\

  373.                     int pos;\

  374.                     TrellisNode *u;\

  375.                     dec_sample = av_clip_int16(dec_sample);\

  376.                     d = sample - dec_sample;\

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

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

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

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

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

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

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

  384.                             goto next_##NAME;\

  385.                         }\

  386.                     }\

  387.                     if (heap_pos < frontier) {\

  388.                         pos = heap_pos++;\

  389.                     } else {\

  390.                         /* Try to replace one of the leaf nodes with the new \

  391.                          * one, but try a different slot each time. */\

  392.                         pos = (frontier >> 1) + (heap_pos++ & ((frontier >> 1) - 1));\

  393.                         if (ssd > nodes_next[pos]->ssd)\

  394.                             goto next_##NAME;\

  395.                     }\

  396.                     u = nodes_next[pos];\

  397.                     if(!u) {\

  398.                         assert(pathn < FREEZE_INTERVAL<<avctx->trellis);\

  399.                         u = t++;\

  400.                         nodes_next[pos] = u;\

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

  402.                     }\

  403.                     u->ssd = ssd;\

  404.                     u->step = STEP_INDEX;\

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

  406.                     u->sample1 = dec_sample;\

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

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

  409.                     /* Sift the newly inserted node down in the heap to \

  410.                      * restore the heap property. */\

  411.                     while (pos > 0) {\

  412.                         int parent = (pos - 1) >> 1;\

  413.                         if (nodes_next[parent]->ssd <= ssd)\

  414.                             break;\

  415.                         FFSWAP(TrellisNode*, nodes_next[parent], nodes_next[pos]);\

  416.                         pos = parent;\

  417.                     }\

  418.                     next_##NAME:;

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

  420.                 }

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

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

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

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

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

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

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

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

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

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

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

  432.                     STORE_NODE(NAME, STEP_INDEX);\

  433.                 }

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

  435.             } else { //CODEC_ID_ADPCM_YAMAHA

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

  437. #undef LOOP_NODES

  438. #undef STORE_NODE

  439.             }

  440.         }

  441. 

  442.         u = nodes;

  443.         nodes = nodes_next;

  444.         nodes_next = u;

  445. 

  446.         // prevent overflow

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

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

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

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

  451.         }

  452. 

  453.         // merge old paths to save memory

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

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

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

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

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

  459.             }

  460.             froze = i;

  461.             pathn = 0;

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

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

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

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

  466.         }

  467.     }

  468. 

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

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

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

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

  473.     }

  474. 

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

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

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

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

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

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

  481. }

  482. 

  483. static int adpcm_encode_frame(AVCodecContext *avctx,

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

  485. {

  486.     int n, i, st;

  487.     short *samples;

  488.     unsigned char *dst;

  489.     ADPCMContext *c = avctx->priv_data;

  490.     uint8_t *buf;

  491. 

  492.     dst = frame;

  493.     samples = (short *)data;

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

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

  496. 

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

  498.     case CODEC_ID_ADPCM_IMA_WAV:

  499.         n = avctx->frame_size / 8;

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

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

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

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

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

  505.             samples++;

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

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

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

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

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

  511.                 *dst++ = 0;

  512.                 samples++;

  513.             }

  514. 

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

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

  517.                 FF_ALLOC_OR_GOTO(avctx, buf, 2*n*8, error);

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

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

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

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

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

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

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

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

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

  527.                         uint8_t *buf1 = buf + n*8;

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

  529.                         *dst++ = buf1[8*i+2] | (buf1[8*i+3] << 4);

  530.                         *dst++ = buf1[8*i+4] | (buf1[8*i+5] << 4);

  531.                         *dst++ = buf1[8*i+6] | (buf1[8*i+7] << 4);

  532.                     }

  533.                 }

  534.                 av_free(buf);

  535.             } else

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

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

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

  539.                 dst++;

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

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

  542.                 dst++;

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

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

  545.                 dst++;

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

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

  548.                 dst++;

  549.                 /* right channel */

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

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

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

  553.                     dst++;

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

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

  556.                     dst++;

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

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

  559.                     dst++;

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

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

  562.                     dst++;

  563.                 }

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

  565.             }

  566.         break;

  567.     case CODEC_ID_ADPCM_IMA_QT:

  568.     {

  569.         int ch, i;

  570.         PutBitContext pb;

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

  572. 

  573.         for(ch=0; ch<avctx->channels; ch++){

  574.             put_bits(&pb, 9, (c->status[ch].prev_sample + 0x10000) >> 7);

  575.             put_bits(&pb, 7, c->status[ch].step_index);

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

  577.                 uint8_t buf[64];

  578.                 adpcm_compress_trellis(avctx, samples+ch, buf, &c->status[ch], 64);

  579.                 for(i=0; i<64; i++)

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

  581.                 c->status[ch].prev_sample = c->status[ch].predictor & ~0x7F;

  582.             } else {

  583.                 for (i=0; i<64; i+=2){

  584.                     int t1, t2;

  585.                     t1 = adpcm_ima_compress_sample(&c->status[ch], samples[avctx->channels*(i+0)+ch]);

  586.                     t2 = adpcm_ima_compress_sample(&c->status[ch], samples[avctx->channels*(i+1)+ch]);

  587.                     put_bits(&pb, 4, t2);

  588.                     put_bits(&pb, 4, t1);

  589.                 }

  590.                 c->status[ch].prev_sample &= ~0x7F;

  591.             }

  592.         }

  593. 

  594.         flush_put_bits(&pb);

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

  596.         break;

  597.     }

  598.     case CODEC_ID_ADPCM_SWF:

  599.     {

  600.         int i;

  601.         PutBitContext pb;

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

  603. 

  604.         n = avctx->frame_size-1;

  605. 

  606.         //Store AdpcmCodeSize

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

  608. 

  609.         //Init the encoder state

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

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

  612.             put_sbits(&pb, 16, samples[i]);

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

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

  615.         }

  616. 

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

  618.             FF_ALLOC_OR_GOTO(avctx, buf, 2*n, error);

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

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

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

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

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

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

  625.                     put_bits(&pb, 4, buf[n+i]);

  626.             }

  627.             av_free(buf);

  628.         } else {

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

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

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

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

  633.             }

  634.         }

  635.         flush_put_bits(&pb);

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

  637.         break;

  638.     }

  639.     case CODEC_ID_ADPCM_MS:

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

  641.             int predictor=0;

  642. 

  643.             *dst++ = predictor;

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

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

  646.         }

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

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

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

  650. 

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

  652.         }

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

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

  655.         }

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

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

  658. 

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

  660.         }

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

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

  663. 

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

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

  666.             FF_ALLOC_OR_GOTO(avctx, buf, 2*n, error);

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

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

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

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

  671.             } else {

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

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

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

  675.                     *dst++ = (buf[i] << 4) | buf[n+i];

  676.             }

  677.             av_free(buf);

  678.         } else

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

  680.             int nibble;

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

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

  683.             *dst++ = nibble;

  684.         }

  685.         break;

  686.     case CODEC_ID_ADPCM_YAMAHA:

  687.         n = avctx->frame_size / 2;

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

  689.             FF_ALLOC_OR_GOTO(avctx, buf, 2*n*2, error);

  690.             n *= 2;

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

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

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

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

  695.             } else {

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

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

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

  699.                     *dst++ = buf[i] | (buf[n+i] << 4);

  700.             }

  701.             av_free(buf);

  702.         } else

  703.             for (n *= avctx->channels; n>0; n--) {

  704.                 int nibble;

  705.                 nibble  = adpcm_yamaha_compress_sample(&c->status[ 0], *samples++);

  706.                 nibble |= adpcm_yamaha_compress_sample(&c->status[st], *samples++) << 4;

  707.                 *dst++ = nibble;

  708.             }

  709.         break;

  710.     default:

  711.     error:

  712.         return -1;

  713.     }

  714.     return dst - frame;

  715. }

  716. #endif //CONFIG_ENCODERS

  717. 

  718. static av_cold int adpcm_decode_init(AVCodecContext * avctx)

  719. {

  720.     ADPCMContext *c = avctx->priv_data;

  721.     unsigned int max_channels = 2;

  722. 

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

  724.     case CODEC_ID_ADPCM_EA_R1:

  725.     case CODEC_ID_ADPCM_EA_R2:

  726.     case CODEC_ID_ADPCM_EA_R3:

  727.         max_channels = 6;

  728.         break;

  729.     }

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

  731.         return -1;

  732.     }

  733. 

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

  735.     case CODEC_ID_ADPCM_CT:

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

  737.         break;

  738.     case CODEC_ID_ADPCM_IMA_WAV:

  739.         if (avctx->bits_per_coded_sample != 4) {

  740.             av_log(avctx, AV_LOG_ERROR, "Only 4-bit ADPCM IMA WAV files are supported\n");

  741.             return -1;

  742.         }

  743.         break;

  744.     case CODEC_ID_ADPCM_IMA_WS:

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

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

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

  748.         }

  749.         break;

  750.     default:

  751.         break;

  752.     }

  753.     avctx->sample_fmt = AV_SAMPLE_FMT_S16;

  754.     return 0;

  755. }

  756. 

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

  758. {

  759.     int step_index;

  760.     int predictor;

  761.     int sign, delta, diff, step;

  762. 

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

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

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

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

  767. 

  768.     sign = nibble & 8;

  769.     delta = nibble & 7;

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

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

  772.      * quickly enough */

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

  774.     predictor = c->predictor;

  775.     if (sign) predictor -= diff;

  776.     else predictor += diff;

  777. 

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

  779.     c->step_index = step_index;

  780. 

  781.     return (short)c->predictor;

  782. }

  783. 

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

  785. {

  786.     int predictor;

  787. 

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

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

  790. 

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

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

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

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

  795. 

  796.     return c->sample1;

  797. }

  798. 

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

  800. {

  801.     int sign, delta, diff;

  802.     int new_step;

  803. 

  804.     sign = nibble & 8;

  805.     delta = nibble & 7;

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

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

  808.      * quickly enough */

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

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

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

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

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

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

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

  816. 

  817.     return (short)c->predictor;

  818. }

  819. 

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

  821. {

  822.     int sign, delta, diff;

  823. 

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

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

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

  827. 

  828.     /* clamp result */

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

  830. 

  831.     /* calculate new step */

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

  833.         c->step++;

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

  835.         c->step--;

  836. 

  837.     return (short) c->predictor;

  838. }

  839. 

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

  841. {

  842.     if(!c->step) {

  843.         c->predictor = 0;

  844.         c->step = 127;

  845.     }

  846. 

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

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

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

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

  851.     return c->predictor;

  852. }

  853. 

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

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

  856. {

  857.     int i, j;

  858.     int shift,filter,f0,f1;

  859.     int s_1,s_2;

  860.     int d,s,t;

  861. 

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

  863. 

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

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

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

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

  868. 

  869.         s_1 = left->sample1;

  870.         s_2 = left->sample2;

  871. 

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

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

  874. 

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

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

  877.             s_2 = s_1;

  878.             s_1 = av_clip_int16(s);

  879.             *out = s_1;

  880.             out += inc;

  881.         }

  882. 

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

  884.             left->sample1 = s_1;

  885.             left->sample2 = s_2;

  886.             s_1 = right->sample1;

  887.             s_2 = right->sample2;

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

  889.         }

  890. 

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

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

  893. 

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

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

  896. 

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

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

  899. 

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

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

  902.             s_2 = s_1;

  903.             s_1 = av_clip_int16(s);

  904.             *out = s_1;

  905.             out += inc;

  906.         }

  907. 

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

  909.             right->sample1 = s_1;

  910.             right->sample2 = s_2;

  911.             out -= 1;

  912.         } else {

  913.             left->sample1 = s_1;

  914.             left->sample2 = s_2;

  915.         }

  916.     }

  917. }

  918. 

  919. 

  920. /* DK3 ADPCM support macro */

  921. #define DK3_GET_NEXT_NIBBLE() \

  922.     if (decode_top_nibble_next) \

  923.     { \

  924.         nibble = last_byte >> 4; \

  925.         decode_top_nibble_next = 0; \

  926.     } \

  927.     else \

  928.     { \

  929.         last_byte = *src++; \

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

  931.         nibble = last_byte & 0x0F; \

  932.         decode_top_nibble_next = 1; \

  933.     }

  934. 

  935. static int adpcm_decode_frame(AVCodecContext *avctx,

  936.                             void *data, int *data_size,

  937.                             AVPacket *avpkt)

  938. {

  939.     const uint8_t *buf = avpkt->data;

  940.     int buf_size = avpkt->size;

  941.     ADPCMContext *c = avctx->priv_data;

  942.     ADPCMChannelStatus *cs;

  943.     int n, m, channel, i;

  944.     int block_predictor[2];

  945.     short *samples;

  946.     short *samples_end;

  947.     const uint8_t *src;

  948.     int st; /* stereo */

  949. 

  950.     /* DK3 ADPCM accounting variables */

  951.     unsigned char last_byte = 0;

  952.     unsigned char nibble;

  953.     int decode_top_nibble_next = 0;

  954.     int diff_channel;

  955. 

  956.     /* EA ADPCM state variables */

  957.     uint32_t samples_in_chunk;

  958.     int32_t previous_left_sample, previous_right_sample;

  959.     int32_t current_left_sample, current_right_sample;

  960.     int32_t next_left_sample, next_right_sample;

  961.     int32_t coeff1l, coeff2l, coeff1r, coeff2r;

  962.     uint8_t shift_left, shift_right;

  963.     int count1, count2;

  964.     int coeff[2][2], shift[2];//used in EA MAXIS ADPCM

  965. 

  966.     if (!buf_size)

  967.         return 0;

  968. 

  969.     //should protect all 4bit ADPCM variants

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

  971.     //

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

  973.         return -1;

  974. 

  975.     samples = data;

  976.     samples_end= samples + *data_size/2;

  977.     *data_size= 0;

  978.     src = buf;

  979. 

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

  981. 

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

  983.     case CODEC_ID_ADPCM_IMA_QT:

  984.         n = buf_size - 2*avctx->channels;

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

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

  987.             /* (pppppp) (piiiiiii) */

  988. 

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

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

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

  992.             cs->predictor &= 0xFF80;

  993. 

  994.             /* sign extension */

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

  996.                 cs->predictor -= 0x10000;

  997. 

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

  999. 

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

  1001. 

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

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

  1004.                 cs->step_index = 88;

  1005.             }

  1006. 

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

  1008. 

  1009.             samples = (short*)data + channel;

  1010. 

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

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

  1013.                 samples += avctx->channels;

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

  1015.                 samples += avctx->channels;

  1016.                 src ++;

  1017.             }

  1018.         }

  1019.         if (st)

  1020.             samples--;

  1021.         break;

  1022.     case CODEC_ID_ADPCM_IMA_WAV:

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

  1024.             buf_size = avctx->block_align;

  1025. 

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

  1027. 

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

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

  1030.             cs->predictor = *samples++ = (int16_t)bytestream_get_le16(&src);

  1031. 

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

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

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

  1035.                 cs->step_index = 88;

  1036.             }

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

  1038.         }

  1039. 

  1040.         while(src < buf + buf_size){

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

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

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

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

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

  1046.                 src++;

  1047.             }

  1048.             src += 4*st;

  1049.         }

  1050.         break;

  1051.     case CODEC_ID_ADPCM_4XM:

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

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

  1054.         if(st){

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

  1056.         }

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

  1058.         if(st){

  1059.             c->status[1].step_index= (int16_t)bytestream_get_le16(&src);

  1060.         }

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

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

  1063. 

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

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

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

  1067.             if (st)

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

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

  1070.             if (st)

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

  1072.         }

  1073. 

  1074.         src += m<<st;

  1075. 

  1076.         break;

  1077.     case CODEC_ID_ADPCM_MS:

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

  1079.             buf_size = avctx->block_align;

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

  1081.         if (n < 0)

  1082.             return -1;

  1083.         block_predictor[0] = av_clip(*src++, 0, 6);

  1084.         block_predictor[1] = 0;

  1085.         if (st)

  1086.             block_predictor[1] = av_clip(*src++, 0, 6);

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

  1088.         if (st){

  1089.             c->status[1].idelta = (int16_t)bytestream_get_le16(&src);

  1090.         }

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

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

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

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

  1095. 

  1096.         c->status[0].sample1 = bytestream_get_le16(&src);

  1097.         if (st) c->status[1].sample1 = bytestream_get_le16(&src);

  1098.         c->status[0].sample2 = bytestream_get_le16(&src);

  1099.         if (st) c->status[1].sample2 = bytestream_get_le16(&src);

  1100. 

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

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

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

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

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

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

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

  1108.             src ++;

  1109.         }

  1110.         break;

  1111.     case CODEC_ID_ADPCM_IMA_DK4:

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

  1113.             buf_size = avctx->block_align;

  1114. 

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

  1116.         c->status[0].step_index = *src++;

  1117.         src++;

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

  1119.         if (st) {

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

  1121.             c->status[1].step_index = *src++;

  1122.             src++;

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

  1124.         }

  1125.         while (src < buf + buf_size) {

  1126. 

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

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

  1129.                 src[0] >> 4, 3);

  1130. 

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

  1132.              * stereo, or another mono sample */

  1133.             if (st)

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

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

  1136.             else

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

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

  1139. 

  1140.             src++;

  1141.         }

  1142.         break;

  1143.     case CODEC_ID_ADPCM_IMA_DK3:

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

  1145.             buf_size = avctx->block_align;

  1146. 

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

  1148.             return -1;

  1149. 

  1150.         c->status[0].predictor  = (int16_t)AV_RL16(src + 10);

  1151.         c->status[1].predictor  = (int16_t)AV_RL16(src + 12);

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

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

  1154.         /* sign extend the predictors */

  1155.         src += 16;

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

  1157. 

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

  1159.          * the buffer is consumed */

  1160.         while (1) {

  1161. 

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

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

  1164. 

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

  1166.             DK3_GET_NEXT_NIBBLE();

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

  1168. 

  1169.             /* process the diff channel predictor */

  1170.             DK3_GET_NEXT_NIBBLE();

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

  1172. 

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

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

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

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

  1177. 

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

  1179.             DK3_GET_NEXT_NIBBLE();

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

  1181. 

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

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

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

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

  1186.         }

  1187.         break;

  1188.     case CODEC_ID_ADPCM_IMA_ISS:

  1189.         c->status[0].predictor  = (int16_t)AV_RL16(src + 0);

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

  1191.         src += 4;

  1192.         if(st) {

  1193.             c->status[1].predictor  = (int16_t)AV_RL16(src + 0);

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

  1195.             src += 4;

  1196.         }

  1197. 

  1198.         while (src < buf + buf_size) {

  1199. 

  1200.             if (st) {

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

  1202.                     src[0] >> 4  , 3);

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

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

  1205.             } else {

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

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

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

  1209.                     src[0] >> 4  , 3);

  1210.             }

  1211. 

  1212.             src++;

  1213.         }

  1214.         break;

  1215.     case CODEC_ID_ADPCM_IMA_WS:

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

  1217.         while (src < buf + buf_size) {

  1218. 

  1219.             if (st) {

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

  1221.                     src[0] >> 4  , 3);

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

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

  1224.             } else {

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

  1226.                     src[0] >> 4  , 3);

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

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

  1229.             }

  1230. 

  1231.             src++;

  1232.         }

  1233.         break;

  1234.     case CODEC_ID_ADPCM_XA:

  1235.         while (buf_size >= 128) {

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

  1237.                 avctx->channels);

  1238.             src += 128;

  1239.             samples += 28 * 8;

  1240.             buf_size -= 128;

  1241.         }

  1242.         break;

  1243.     case CODEC_ID_ADPCM_IMA_EA_EACS:

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

  1245. 

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

  1247.             src += buf_size - 4;

  1248.             break;

  1249.         }

  1250. 

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

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

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

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

  1255. 

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

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

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

  1259.         }

  1260.         break;

  1261.     case CODEC_ID_ADPCM_IMA_EA_SEAD:

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

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

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

  1265.         }

  1266.         break;

  1267.     case CODEC_ID_ADPCM_EA:

  1268.         if (buf_size < 4 || AV_RL32(src) >= ((buf_size - 12) * 2)) {

  1269.             src += buf_size;

  1270.             break;

  1271.         }

  1272.         samples_in_chunk = AV_RL32(src);

  1273.         src += 4;

  1274.         current_left_sample   = (int16_t)bytestream_get_le16(&src);

  1275.         previous_left_sample  = (int16_t)bytestream_get_le16(&src);

  1276.         current_right_sample  = (int16_t)bytestream_get_le16(&src);

  1277.         previous_right_sample = (int16_t)bytestream_get_le16(&src);

  1278. 

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

  1280.             coeff1l = ea_adpcm_table[ *src >> 4       ];

  1281.             coeff2l = ea_adpcm_table[(*src >> 4  ) + 4];

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

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

  1284.             src++;

  1285. 

  1286.             shift_left  = (*src >> 4  ) + 8;

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

  1288.             src++;

  1289. 

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

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

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

  1293.                 src++;

  1294. 

  1295.                 next_left_sample = (next_left_sample +

  1296.                     (current_left_sample * coeff1l) +

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

  1298.                 next_right_sample = (next_right_sample +

  1299.                     (current_right_sample * coeff1r) +

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

  1301. 

  1302.                 previous_left_sample = current_left_sample;

  1303.                 current_left_sample = av_clip_int16(next_left_sample);

  1304.                 previous_right_sample = current_right_sample;

  1305.                 current_right_sample = av_clip_int16(next_right_sample);

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

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

  1308.             }

  1309.         }

  1310. 

  1311.         if (src - buf == buf_size - 2)

  1312.             src += 2; // Skip terminating 0x0000

  1313. 

  1314.         break;

  1315.     case CODEC_ID_ADPCM_EA_MAXIS_XA:

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

  1317.             for (i=0; i<2; i++)

  1318.                 coeff[channel][i] = ea_adpcm_table[(*src >> 4) + 4*i];

  1319.             shift[channel] = (*src & 0x0F) + 8;

  1320.             src++;

  1321.         }

  1322.         for (count1 = 0; count1 < (buf_size - avctx->channels) / avctx->channels; count1++) {

  1323.             for(i = 4; i >= 0; i-=4) { /* Pairwise samples LL RR (st) or LL LL (mono) */

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

  1325.                     int32_t sample = (int32_t)(((*(src+channel) >> i) & 0x0F) << 0x1C) >> shift[channel];

  1326.                     sample = (sample +

  1327.                              c->status[channel].sample1 * coeff[channel][0] +

  1328.                              c->status[channel].sample2 * coeff[channel][1] + 0x80) >> 8;

  1329.                     c->status[channel].sample2 = c->status[channel].sample1;

  1330.                     c->status[channel].sample1 = av_clip_int16(sample);

  1331.                     *samples++ = c->status[channel].sample1;

  1332.                 }

  1333.             }

  1334.             src+=avctx->channels;

  1335.         }

  1336.         break;

  1337.     case CODEC_ID_ADPCM_EA_R1:

  1338.     case CODEC_ID_ADPCM_EA_R2:

  1339.     case CODEC_ID_ADPCM_EA_R3: {

  1340.         /* channel numbering

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

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

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

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

  1345.         int32_t previous_sample, current_sample, next_sample;

  1346.         int32_t coeff1, coeff2;

  1347.         uint8_t shift;

  1348.         unsigned int channel;

  1349.         uint16_t *samplesC;

  1350.         const uint8_t *srcC;

  1351.         const uint8_t *src_end = buf + buf_size;

  1352. 

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

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

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

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

  1357.             src += buf_size - 4;

  1358.             break;

  1359.         }

  1360. 

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

  1362.             int32_t offset = (big_endian ? bytestream_get_be32(&src)

  1363.                                          : bytestream_get_le32(&src))

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

  1365. 

  1366.             if ((offset < 0) || (offset >= src_end - src - 4)) break;

  1367.             srcC  = src + offset;

  1368.             samplesC = samples + channel;

  1369. 

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

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

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

  1373.             } else {

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

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

  1376.             }

  1377. 

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

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

  1380.                     srcC++;

  1381.                     if (srcC > src_end - 30*2) break;

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

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

  1384. 

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

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

  1387.                         samplesC += avctx->channels;

  1388.                     }

  1389.                 } else {

  1390.                     coeff1 = ea_adpcm_table[ *srcC>>4     ];

  1391.                     coeff2 = ea_adpcm_table[(*srcC>>4) + 4];

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

  1393. 

  1394.                     if (srcC > src_end - 14) break;

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

  1396.                         if (count2 & 1)

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

  1398.                         else

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

  1400. 

  1401.                         next_sample += (current_sample  * coeff1) +

  1402.                                        (previous_sample * coeff2);

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

  1404. 

  1405.                         previous_sample = current_sample;

  1406.                         current_sample  = next_sample;

  1407.                         *samplesC = current_sample;

  1408.                         samplesC += avctx->channels;

  1409.                     }

  1410.                 }

  1411.             }

  1412. 

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

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

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

  1416.             }

  1417.         }

  1418. 

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

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

  1421.         break;

  1422.     }

  1423.     case CODEC_ID_ADPCM_EA_XAS:

  1424.         if (samples_end-samples < 32*4*avctx->channels

  1425.             || buf_size < (4+15)*4*avctx->channels) {

  1426.             src += buf_size;

  1427.             break;

  1428.         }

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

  1430.             int coeff[2][4], shift[4];

  1431.             short *s2, *s = &samples[channel];

  1432.             for (n=0; n<4; n++, s+=32*avctx->channels) {

  1433.                 for (i=0; i<2; i++)

  1434.                     coeff[i][n] = ea_adpcm_table[(src[0]&0x0F)+4*i];

  1435.                 shift[n] = (src[2]&0x0F) + 8;

  1436.                 for (s2=s, i=0; i<2; i++, src+=2, s2+=avctx->channels)

  1437.                     s2[0] = (src[0]&0xF0) + (src[1]<<8);

  1438.             }

  1439. 

  1440.             for (m=2; m<32; m+=2) {

  1441.                 s = &samples[m*avctx->channels + channel];

  1442.                 for (n=0; n<4; n++, src++, s+=32*avctx->channels) {

  1443.                     for (s2=s, i=0; i<8; i+=4, s2+=avctx->channels) {

  1444.                         int level = (int32_t)((*src & (0xF0>>i)) << (24+i)) >> shift[n];

  1445.                         int pred  = s2[-1*avctx->channels] * coeff[0][n]

  1446.                                   + s2[-2*avctx->channels] * coeff[1][n];

  1447.                         s2[0] = av_clip_int16((level + pred + 0x80) >> 8);

  1448.                     }

  1449.                 }

  1450.             }

  1451.         }

  1452.         samples += 32*4*avctx->channels;

  1453.         break;

  1454.     case CODEC_ID_ADPCM_IMA_AMV:

  1455.     case CODEC_ID_ADPCM_IMA_SMJPEG:

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

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

  1458. 

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

  1460.             src+=4;

  1461. 

  1462.         while (src < buf + buf_size) {

  1463.             char hi, lo;

  1464.             lo = *src & 0x0F;

  1465.             hi = *src >> 4;

  1466. 

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

  1468.                 FFSWAP(char, hi, lo);

  1469. 

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

  1471.                 lo, 3);

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

  1473.                 hi, 3);

  1474.             src++;

  1475.         }

  1476.         break;

  1477.     case CODEC_ID_ADPCM_CT:

  1478.         while (src < buf + buf_size) {

  1479.             if (st) {

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

  1481.                     src[0] >> 4);

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

  1483.                     src[0] & 0x0F);

  1484.             } else {

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

  1486.                     src[0] >> 4);

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

  1488.                     src[0] & 0x0F);

  1489.             }

  1490.             src++;

  1491.         }

  1492.         break;

  1493.     case CODEC_ID_ADPCM_SBPRO_4:

  1494.     case CODEC_ID_ADPCM_SBPRO_3:

  1495.     case CODEC_ID_ADPCM_SBPRO_2:

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

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

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

  1499.             if (st)

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

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

  1502.         }

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

  1504.             while (src < buf + buf_size) {

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

  1506.                     src[0] >> 4, 4, 0);

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

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

  1509.                 src++;

  1510.             }

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

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

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

  1514.                      src[0] >> 5        , 3, 0);

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

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

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

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

  1519.                 src++;

  1520.             }

  1521.         } else {

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

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

  1524.                      src[0] >> 6        , 2, 2);

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

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

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

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

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

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

  1531.                 src++;

  1532.             }

  1533.         }

  1534.         break;

  1535.     case CODEC_ID_ADPCM_SWF:

  1536.     {

  1537.         GetBitContext gb;

  1538.         const int *table;

  1539.         int k0, signmask, nb_bits, count;

  1540.         int size = buf_size*8;

  1541. 

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

  1543. 

  1544.         //read bits & initial values

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

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

  1547.         table = swf_index_tables[nb_bits-2];

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

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

  1550. 

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

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

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

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

  1555.             }

  1556. 

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

  1558.                 int i;

  1559. 

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

  1561.                     // similar to IMA adpcm

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

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

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

  1565.                     int k = k0;

  1566. 

  1567.                     do {

  1568.                         if (delta & k)

  1569.                             vpdiff += step;

  1570.                         step >>= 1;

  1571.                         k >>= 1;

  1572.                     } while(k);

  1573.                     vpdiff += step;

  1574. 

  1575.                     if (delta & signmask)

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

  1577.                     else

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

  1579. 

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

  1581. 

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

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

  1584. 

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

  1586.                     if (samples >= samples_end) {

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

  1588.                         return -1;

  1589.                     }

  1590.                 }

  1591.             }

  1592.         }

  1593.         src += buf_size;

  1594.         break;

  1595.     }

  1596.     case CODEC_ID_ADPCM_YAMAHA:

  1597.         while (src < buf + buf_size) {

  1598.             if (st) {

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

  1600.                         src[0] & 0x0F);

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

  1602.                         src[0] >> 4  );

  1603.             } else {

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

  1605.                         src[0] & 0x0F);

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

  1607.                         src[0] >> 4  );

  1608.             }

  1609.             src++;

  1610.         }

  1611.         break;

  1612.     case CODEC_ID_ADPCM_THP:

  1613.     {

  1614.         int table[2][16];

  1615.         unsigned int samplecnt;

  1616.         int prev[2][2];

  1617.         int ch;

  1618. 

  1619.         if (buf_size < 80) {

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

  1621.             return -1;

  1622.         }

  1623. 

  1624.         src+=4;

  1625.         samplecnt = bytestream_get_be32(&src);

  1626. 

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

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

  1629. 

  1630.         /* Initialize the previous sample.  */

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

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

  1633. 

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

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

  1636.             return -1;

  1637.         }

  1638. 

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

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

  1641. 

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

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

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

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

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

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

  1648. 

  1649.                 /* Decode 14 samples.  */

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

  1651.                     int32_t sampledat;

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

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

  1654. 

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

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

  1657.                     *samples = av_clip_int16(sampledat);

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

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

  1660. 

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

  1662.                        is for the other channel.  */

  1663.                     samples += st;

  1664.                 }

  1665.             }

  1666.         }

  1667. 

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

  1669.            increased exactly one time too often.  */

  1670.         samples -= st;

  1671.         break;

  1672.     }

  1673. 

  1674.     default:

  1675.         return -1;

  1676.     }

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

  1678.     return src - buf;

  1679. }

  1680. 

  1681. 

  1682. 

  1683. #if CONFIG_ENCODERS

  1684. #define ADPCM_ENCODER(id,name,long_name_)       \

  1685. AVCodec name ## _encoder = {                    \

  1686.     #name,                                      \

  1687.     AVMEDIA_TYPE_AUDIO,                         \

  1688.     id,                                         \

  1689.     sizeof(ADPCMContext),                       \

  1690.     adpcm_encode_init,                          \

  1691.     adpcm_encode_frame,                         \

  1692.     adpcm_encode_close,                         \

  1693.     NULL,                                       \

  1694.     .sample_fmts = (const enum AVSampleFormat[]){AV_SAMPLE_FMT_S16,AV_SAMPLE_FMT_NONE}, \

  1695.     .long_name = NULL_IF_CONFIG_SMALL(long_name_), \

  1696. };

  1697. #else

  1698. #define ADPCM_ENCODER(id,name,long_name_)

  1699. #endif

  1700. 

  1701. #if CONFIG_DECODERS

  1702. #define ADPCM_DECODER(id,name,long_name_)       \

  1703. AVCodec name ## _decoder = {                    \

  1704.     #name,                                      \

  1705.     AVMEDIA_TYPE_AUDIO,                         \

  1706.     id,                                         \

  1707.     sizeof(ADPCMContext),                       \

  1708.     adpcm_decode_init,                          \

  1709.     NULL,                                       \

  1710.     NULL,                                       \

  1711.     adpcm_decode_frame,                         \

  1712.     .long_name = NULL_IF_CONFIG_SMALL(long_name_), \

  1713. };

  1714. #else

  1715. #define ADPCM_DECODER(id,name,long_name_)

  1716. #endif

  1717. 

  1718. #define ADPCM_CODEC(id,name,long_name_)         \

  1719.     ADPCM_ENCODER(id,name,long_name_) ADPCM_DECODER(id,name,long_name_)

  1720. 

  1721. /* Note: Do not forget to add new entries to the Makefile as well. */

  1722. ADPCM_DECODER(CODEC_ID_ADPCM_4XM, adpcm_4xm, "ADPCM 4X Movie");

  1723. ADPCM_DECODER(CODEC_ID_ADPCM_CT, adpcm_ct, "ADPCM Creative Technology");

  1724. ADPCM_DECODER(CODEC_ID_ADPCM_EA, adpcm_ea, "ADPCM Electronic Arts");

  1725. ADPCM_DECODER(CODEC_ID_ADPCM_EA_MAXIS_XA, adpcm_ea_maxis_xa, "ADPCM Electronic Arts Maxis CDROM XA");

  1726. ADPCM_DECODER(CODEC_ID_ADPCM_EA_R1, adpcm_ea_r1, "ADPCM Electronic Arts R1");

  1727. ADPCM_DECODER(CODEC_ID_ADPCM_EA_R2, adpcm_ea_r2, "ADPCM Electronic Arts R2");

  1728. ADPCM_DECODER(CODEC_ID_ADPCM_EA_R3, adpcm_ea_r3, "ADPCM Electronic Arts R3");

  1729. ADPCM_DECODER(CODEC_ID_ADPCM_EA_XAS, adpcm_ea_xas, "ADPCM Electronic Arts XAS");

  1730. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_AMV, adpcm_ima_amv, "ADPCM IMA AMV");

  1731. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3, "ADPCM IMA Duck DK3");

  1732. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4, "ADPCM IMA Duck DK4");

  1733. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_EA_EACS, adpcm_ima_ea_eacs, "ADPCM IMA Electronic Arts EACS");

  1734. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_EA_SEAD, adpcm_ima_ea_sead, "ADPCM IMA Electronic Arts SEAD");

  1735. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_ISS, adpcm_ima_iss, "ADPCM IMA Funcom ISS");

  1736. ADPCM_CODEC  (CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt, "ADPCM IMA QuickTime");

  1737. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg, "ADPCM IMA Loki SDL MJPEG");

  1738. ADPCM_CODEC  (CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav, "ADPCM IMA WAV");

  1739. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws, "ADPCM IMA Westwood");

  1740. ADPCM_CODEC  (CODEC_ID_ADPCM_MS, adpcm_ms, "ADPCM Microsoft");

  1741. ADPCM_DECODER(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2, "ADPCM Sound Blaster Pro 2-bit");

  1742. ADPCM_DECODER(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3, "ADPCM Sound Blaster Pro 2.6-bit");

  1743. ADPCM_DECODER(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4, "ADPCM Sound Blaster Pro 4-bit");

  1744. ADPCM_CODEC  (CODEC_ID_ADPCM_SWF, adpcm_swf, "ADPCM Shockwave Flash");

  1745. ADPCM_DECODER(CODEC_ID_ADPCM_THP, adpcm_thp, "ADPCM Nintendo Gamecube THP");

  1746. ADPCM_DECODER(CODEC_ID_ADPCM_XA, adpcm_xa, "ADPCM CDROM XA");

  1747. ADPCM_CODEC  (CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha, "ADPCM Yamaha");