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

1234 lines
44KB
Raw Blame History 

  1. /*

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

  3.  *

  4.  * This file is part of FFmpeg.

  5.  *

  6.  * FFmpeg is free software; you can redistribute it and/or

  7.  * modify it under the terms of the GNU Lesser General Public

  8.  * License as published by the Free Software Foundation; either

  9.  * version 2.1 of the License, or (at your option) any later version.

  10.  *

  11.  * FFmpeg is distributed in the hope that it will be useful,

  12.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

  13.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

  14.  * Lesser General Public License for more details.

  15.  *

  16.  * You should have received a copy of the GNU Lesser General Public

  17.  * License along with FFmpeg; if not, write to the Free Software

  18.  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

  19.  */

  20. #include "avcodec.h"

  21. #include "get_bits.h"

  22. #include "put_bits.h"

  23. #include "bytestream.h"

  24. #include "adpcm.h"

  25. #include "adpcm_data.h"

  26. 

  27. /**

  28.  * @file

  29.  * ADPCM decoders

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

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

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

  33.  * CD-ROM XA ADPCM codec by BERO

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

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

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

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

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

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

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

  41.  *

  42.  * Features and limitations:

  43.  *

  44.  * Reference documents:

  45.  * http://wiki.multimedia.cx/index.php?title=Category:ADPCM_Audio_Codecs

  46.  * http://www.pcisys.net/~melanson/codecs/simpleaudio.html [dead]

  47.  * http://www.geocities.com/SiliconValley/8682/aud3.txt [dead]

  48.  * http://openquicktime.sourceforge.net/

  49.  * XAnim sources (xa_codec.c) http://xanim.polter.net/

  50.  * http://www.cs.ucla.edu/~leec/mediabench/applications.html [dead]

  51.  * SoX source code http://sox.sourceforge.net/

  52.  *

  53.  * CD-ROM XA:

  54.  * http://ku-www.ss.titech.ac.jp/~yatsushi/xaadpcm.html [dead]

  55.  * vagpack & depack http://homepages.compuserve.de/bITmASTER32/psx-index.html [dead]

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

  57.  */

  58. 

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

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

  61.     {   0,   0 },

  62.     {  60,   0 },

  63.     { 115, -52 },

  64.     {  98, -55 },

  65.     { 122, -60 }

  66. };

  67. 

  68. static const int ea_adpcm_table[] = {

  69.     0,  240,  460,  392,

  70.     0,    0, -208, -220,

  71.     0,    1,    3,    4,

  72.     7,    8,   10,   11,

  73.     0,   -1,   -3,   -4

  74. };

  75. 

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

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

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

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

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

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

  82. };

  83. 

  84. /* end of tables */

  85. 

  86. typedef struct ADPCMDecodeContext {

  87.     AVFrame frame;

  88.     ADPCMChannelStatus status[6];

  89. } ADPCMDecodeContext;

  90. 

  91. static av_cold int adpcm_decode_init(AVCodecContext * avctx)

  92. {

  93.     ADPCMDecodeContext *c = avctx->priv_data;

  94.     unsigned int max_channels = 2;

  95. 

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

  97.     case CODEC_ID_ADPCM_EA_R1:

  98.     case CODEC_ID_ADPCM_EA_R2:

  99.     case CODEC_ID_ADPCM_EA_R3:

  100.     case CODEC_ID_ADPCM_EA_XAS:

  101.         max_channels = 6;

  102.         break;

  103.     }

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

  105.         return -1;

  106.     }

  107. 

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

  109.     case CODEC_ID_ADPCM_CT:

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

  111.         break;

  112.     case CODEC_ID_ADPCM_IMA_WAV:

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

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

  115.             return -1;

  116.         }

  117.         break;

  118.     case CODEC_ID_ADPCM_IMA_WS:

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

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

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

  122.         }

  123.         break;

  124.     default:

  125.         break;

  126.     }

  127.     avctx->sample_fmt = AV_SAMPLE_FMT_S16;

  128. 

  129.     avcodec_get_frame_defaults(&c->frame);

  130.     avctx->coded_frame = &c->frame;

  131. 

  132.     return 0;

  133. }

  134. 

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

  136. {

  137.     int step_index;

  138.     int predictor;

  139.     int sign, delta, diff, step;

  140. 

  141.     step = ff_adpcm_step_table[c->step_index];

  142.     step_index = c->step_index + ff_adpcm_index_table[(unsigned)nibble];

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

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

  145. 

  146.     sign = nibble & 8;

  147.     delta = nibble & 7;

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

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

  150.      * quickly enough */

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

  152.     predictor = c->predictor;

  153.     if (sign) predictor -= diff;

  154.     else predictor += diff;

  155. 

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

  157.     c->step_index = step_index;

  158. 

  159.     return (short)c->predictor;

  160. }

  161. 

  162. static inline int adpcm_ima_qt_expand_nibble(ADPCMChannelStatus *c, int nibble, int shift)

  163. {

  164.     int step_index;

  165.     int predictor;

  166.     int diff, step;

  167. 

  168.     step = ff_adpcm_step_table[c->step_index];

  169.     step_index = c->step_index + ff_adpcm_index_table[nibble];

  170.     step_index = av_clip(step_index, 0, 88);

  171. 

  172.     diff = step >> 3;

  173.     if (nibble & 4) diff += step;

  174.     if (nibble & 2) diff += step >> 1;

  175.     if (nibble & 1) diff += step >> 2;

  176. 

  177.     if (nibble & 8)

  178.         predictor = c->predictor - diff;

  179.     else

  180.         predictor = c->predictor + diff;

  181. 

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

  183.     c->step_index = step_index;

  184. 

  185.     return c->predictor;

  186. }

  187. 

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

  189. {

  190.     int predictor;

  191. 

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

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

  194. 

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

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

  197.     c->idelta = (ff_adpcm_AdaptationTable[(int)nibble] * c->idelta) >> 8;

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

  199. 

  200.     return c->sample1;

  201. }

  202. 

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

  204. {

  205.     int sign, delta, diff;

  206.     int new_step;

  207. 

  208.     sign = nibble & 8;

  209.     delta = nibble & 7;

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

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

  212.      * quickly enough */

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

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

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

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

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

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

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

  220. 

  221.     return (short)c->predictor;

  222. }

  223. 

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

  225. {

  226.     int sign, delta, diff;

  227. 

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

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

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

  231. 

  232.     /* clamp result */

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

  234. 

  235.     /* calculate new step */

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

  237.         c->step++;

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

  239.         c->step--;

  240. 

  241.     return (short) c->predictor;

  242. }

  243. 

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

  245. {

  246.     if(!c->step) {

  247.         c->predictor = 0;

  248.         c->step = 127;

  249.     }

  250. 

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

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

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

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

  255.     return c->predictor;

  256. }

  257. 

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

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

  260. {

  261.     int i, j;

  262.     int shift,filter,f0,f1;

  263.     int s_1,s_2;

  264.     int d,s,t;

  265. 

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

  267. 

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

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

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

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

  272. 

  273.         s_1 = left->sample1;

  274.         s_2 = left->sample2;

  275. 

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

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

  278. 

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

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

  281.             s_2 = s_1;

  282.             s_1 = av_clip_int16(s);

  283.             *out = s_1;

  284.             out += inc;

  285.         }

  286. 

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

  288.             left->sample1 = s_1;

  289.             left->sample2 = s_2;

  290.             s_1 = right->sample1;

  291.             s_2 = right->sample2;

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

  293.         }

  294. 

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

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

  297. 

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

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

  300. 

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

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

  303. 

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

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

  306.             s_2 = s_1;

  307.             s_1 = av_clip_int16(s);

  308.             *out = s_1;

  309.             out += inc;

  310.         }

  311. 

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

  313.             right->sample1 = s_1;

  314.             right->sample2 = s_2;

  315.             out -= 1;

  316.         } else {

  317.             left->sample1 = s_1;

  318.             left->sample2 = s_2;

  319.         }

  320.     }

  321. }

  322. 

  323. /**

  324.  * Get the number of samples that will be decoded from the packet.

  325.  * In one case, this is actually the maximum number of samples possible to

  326.  * decode with the given buf_size.

  327.  *

  328.  * @param[out] coded_samples set to the number of samples as coded in the

  329.  *                           packet, or 0 if the codec does not encode the

  330.  *                           number of samples in each frame.

  331.  */

  332. static int get_nb_samples(AVCodecContext *avctx, const uint8_t *buf,

  333.                           int buf_size, int *coded_samples)

  334. {

  335.     ADPCMDecodeContext *s = avctx->priv_data;

  336.     int nb_samples        = 0;

  337.     int ch                = avctx->channels;

  338.     int has_coded_samples = 0;

  339.     int header_size;

  340. 

  341.     *coded_samples = 0;

  342. 

  343.     if(ch <= 0)

  344.         return 0;

  345. 

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

  347.     /* constant, only check buf_size */

  348.     case CODEC_ID_ADPCM_EA_XAS:

  349.         if (buf_size < 76 * ch)

  350.             return 0;

  351.         nb_samples = 128;

  352.         break;

  353.     case CODEC_ID_ADPCM_IMA_QT:

  354.         if (buf_size < 34 * ch)

  355.             return 0;

  356.         nb_samples = 64;

  357.         break;

  358.     /* simple 4-bit adpcm */

  359.     case CODEC_ID_ADPCM_CT:

  360.     case CODEC_ID_ADPCM_IMA_EA_SEAD:

  361.     case CODEC_ID_ADPCM_IMA_WS:

  362.     case CODEC_ID_ADPCM_YAMAHA:

  363.         nb_samples = buf_size * 2 / ch;

  364.         break;

  365.     }

  366.     if (nb_samples)

  367.         return nb_samples;

  368. 

  369.     /* simple 4-bit adpcm, with header */

  370.     header_size = 0;

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

  372.         case CODEC_ID_ADPCM_4XM:

  373.         case CODEC_ID_ADPCM_IMA_ISS:     header_size = 4 * ch;      break;

  374.         case CODEC_ID_ADPCM_IMA_AMV:     header_size = 8;           break;

  375.         case CODEC_ID_ADPCM_IMA_SMJPEG:  header_size = 4;           break;

  376.     }

  377.     if (header_size > 0)

  378.         return (buf_size - header_size) * 2 / ch;

  379. 

  380.     /* more complex formats */

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

  382.     case CODEC_ID_ADPCM_EA:

  383.         has_coded_samples = 1;

  384.         if (buf_size < 4)

  385.             return 0;

  386.         *coded_samples  = AV_RL32(buf);

  387.         *coded_samples -= *coded_samples % 28;

  388.         nb_samples      = (buf_size - 12) / 30 * 28;

  389.         break;

  390.     case CODEC_ID_ADPCM_IMA_EA_EACS:

  391.         has_coded_samples = 1;

  392.         if (buf_size < 4)

  393.             return 0;

  394.         *coded_samples = AV_RL32(buf);

  395.         nb_samples     = (buf_size - (4 + 8 * ch)) * 2 / ch;

  396.         break;

  397.     case CODEC_ID_ADPCM_EA_MAXIS_XA:

  398.         nb_samples = ((buf_size - ch) / (2 * ch)) * 2 * ch;

  399.         break;

  400.     case CODEC_ID_ADPCM_EA_R1:

  401.     case CODEC_ID_ADPCM_EA_R2:

  402.     case CODEC_ID_ADPCM_EA_R3:

  403.         /* maximum number of samples */

  404.         /* has internal offsets and a per-frame switch to signal raw 16-bit */

  405.         has_coded_samples = 1;

  406.         if (buf_size < 4)

  407.             return 0;

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

  409.         case CODEC_ID_ADPCM_EA_R1:

  410.             header_size    = 4 + 9 * ch;

  411.             *coded_samples = AV_RL32(buf);

  412.             break;

  413.         case CODEC_ID_ADPCM_EA_R2:

  414.             header_size    = 4 + 5 * ch;

  415.             *coded_samples = AV_RL32(buf);

  416.             break;

  417.         case CODEC_ID_ADPCM_EA_R3:

  418.             header_size    = 4 + 5 * ch;

  419.             *coded_samples = AV_RB32(buf);

  420.             break;

  421.         }

  422.         *coded_samples -= *coded_samples % 28;

  423.         nb_samples      = (buf_size - header_size) * 2 / ch;

  424.         nb_samples     -= nb_samples % 28;

  425.         break;

  426.     case CODEC_ID_ADPCM_IMA_DK3:

  427.         if (avctx->block_align > 0)

  428.             buf_size = FFMIN(buf_size, avctx->block_align);

  429.         nb_samples = ((buf_size - 16) * 8 / 3) / ch;

  430.         break;

  431.     case CODEC_ID_ADPCM_IMA_DK4:

  432.         nb_samples = 1 + (buf_size - 4 * ch) * 2 / ch;

  433.         break;

  434.     case CODEC_ID_ADPCM_IMA_WAV:

  435.         if (avctx->block_align > 0)

  436.             buf_size = FFMIN(buf_size, avctx->block_align);

  437.         nb_samples = 1 + (buf_size - 4 * ch) / (4 * ch) * 8;

  438.         break;

  439.     case CODEC_ID_ADPCM_MS:

  440.         if (avctx->block_align > 0)

  441.             buf_size = FFMIN(buf_size, avctx->block_align);

  442.         nb_samples = 2 + (buf_size - 7 * ch) * 2 / ch;

  443.         break;

  444.     case CODEC_ID_ADPCM_SBPRO_2:

  445.     case CODEC_ID_ADPCM_SBPRO_3:

  446.     case CODEC_ID_ADPCM_SBPRO_4:

  447.     {

  448.         int samples_per_byte;

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

  450.         case CODEC_ID_ADPCM_SBPRO_2: samples_per_byte = 4; break;

  451.         case CODEC_ID_ADPCM_SBPRO_3: samples_per_byte = 3; break;

  452.         case CODEC_ID_ADPCM_SBPRO_4: samples_per_byte = 2; break;

  453.         }

  454.         if (!s->status[0].step_index) {

  455.             nb_samples++;

  456.             buf_size -= ch;

  457.         }

  458.         nb_samples += buf_size * samples_per_byte / ch;

  459.         break;

  460.     }

  461.     case CODEC_ID_ADPCM_SWF:

  462.     {

  463.         int buf_bits       = buf_size * 8 - 2;

  464.         int nbits          = (buf[0] >> 6) + 2;

  465.         int block_hdr_size = 22 * ch;

  466.         int block_size     = block_hdr_size + nbits * ch * 4095;

  467.         int nblocks        = buf_bits / block_size;

  468.         int bits_left      = buf_bits - nblocks * block_size;

  469.         nb_samples         = nblocks * 4096;

  470.         if (bits_left >= block_hdr_size)

  471.             nb_samples += 1 + (bits_left - block_hdr_size) / (nbits * ch);

  472.         break;

  473.     }

  474.     case CODEC_ID_ADPCM_THP:

  475.         has_coded_samples = 1;

  476.         if (buf_size < 8)

  477.             return 0;

  478.         *coded_samples  = AV_RB32(&buf[4]);

  479.         *coded_samples -= *coded_samples % 14;

  480.         nb_samples      = (buf_size - 80) / (8 * ch) * 14;

  481.         break;

  482.     case CODEC_ID_ADPCM_XA:

  483.         nb_samples = (buf_size / 128) * 224 / ch;

  484.         break;

  485.     }

  486. 

  487.     /* validate coded sample count */

  488.     if (has_coded_samples && (*coded_samples <= 0 || *coded_samples > nb_samples))

  489.         return AVERROR_INVALIDDATA;

  490. 

  491.     return nb_samples;

  492. }

  493. 

  494. /* DK3 ADPCM support macro */

  495. #define DK3_GET_NEXT_NIBBLE() \

  496.     if (decode_top_nibble_next) \

  497.     { \

  498.         nibble = last_byte >> 4; \

  499.         decode_top_nibble_next = 0; \

  500.     } \

  501.     else \

  502.     { \

  503.         if (end_of_packet) \

  504.             break; \

  505.         last_byte = *src++; \

  506.         if (src >= buf + buf_size) \

  507.             end_of_packet = 1; \

  508.         nibble = last_byte & 0x0F; \

  509.         decode_top_nibble_next = 1; \

  510.     }

  511. 

  512. static int adpcm_decode_frame(AVCodecContext *avctx, void *data,

  513.                               int *got_frame_ptr, AVPacket *avpkt)

  514. {

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

  516.     int buf_size = avpkt->size;

  517.     ADPCMDecodeContext *c = avctx->priv_data;

  518.     ADPCMChannelStatus *cs;

  519.     int n, m, channel, i;

  520.     short *samples;

  521.     const uint8_t *src;

  522.     int st; /* stereo */

  523.     int count1, count2;

  524.     int nb_samples, coded_samples, ret;

  525. 

  526.     nb_samples = get_nb_samples(avctx, buf, buf_size, &coded_samples);

  527.     if (nb_samples <= 0) {

  528.         av_log(avctx, AV_LOG_ERROR, "invalid number of samples in packet\n");

  529.         return AVERROR_INVALIDDATA;

  530.     }

  531. 

  532.     /* get output buffer */

  533.     c->frame.nb_samples = nb_samples;

  534.     if ((ret = avctx->get_buffer(avctx, &c->frame)) < 0) {

  535.         av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");

  536.         return ret;

  537.     }

  538.     samples = (short *)c->frame.data[0];

  539. 

  540.     /* use coded_samples when applicable */

  541.     /* it is always <= nb_samples, so the output buffer will be large enough */

  542.     if (coded_samples) {

  543.         if (coded_samples != nb_samples)

  544.             av_log(avctx, AV_LOG_WARNING, "mismatch in coded sample count\n");

  545.         c->frame.nb_samples = nb_samples = coded_samples;

  546.     }

  547. 

  548.     src = buf;

  549. 

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

  551. 

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

  553.     case CODEC_ID_ADPCM_IMA_QT:

  554.         /* In QuickTime, IMA is encoded by chunks of 34 bytes (=64 samples).

  555.            Channel data is interleaved per-chunk. */

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

  557.             int16_t predictor;

  558.             int step_index;

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

  560.             /* (pppppp) (piiiiiii) */

  561. 

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

  563.             predictor = AV_RB16(src);

  564.             step_index = predictor & 0x7F;

  565.             predictor &= 0xFF80;

  566. 

  567.             src += 2;

  568. 

  569.             if (cs->step_index == step_index) {

  570.                 int diff = (int)predictor - cs->predictor;

  571.                 if (diff < 0)

  572.                     diff = - diff;

  573.                 if (diff > 0x7f)

  574.                     goto update;

  575.             } else {

  576.             update:

  577.                 cs->step_index = step_index;

  578.                 cs->predictor = predictor;

  579.             }

  580. 

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

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

  583.                 cs->step_index = 88;

  584.             }

  585. 

  586.             samples = (short *)c->frame.data[0] + channel;

  587. 

  588.             for (m = 0; m < 32; m++) {

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

  590.                 samples += avctx->channels;

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

  592.                 samples += avctx->channels;

  593.                 src ++;

  594.             }

  595.         }

  596.         break;

  597.     case CODEC_ID_ADPCM_IMA_WAV:

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

  599.             buf_size = avctx->block_align;

  600. 

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

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

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

  604. 

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

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

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

  608.                 cs->step_index = 88;

  609.             }

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

  611.         }

  612. 

  613.         for (n = (nb_samples - 1) / 8; n > 0; n--) {

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

  615.                 cs = &c->status[i];

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

  617.                     uint8_t v = *src++;

  618.                     *samples = adpcm_ima_expand_nibble(cs, v & 0x0F, 3);

  619.                     samples += avctx->channels;

  620.                     *samples = adpcm_ima_expand_nibble(cs, v >> 4  , 3);

  621.                     samples += avctx->channels;

  622.                 }

  623.                 samples -= 8 * avctx->channels - 1;

  624.             }

  625.             samples += 7 * avctx->channels;

  626.         }

  627.         break;

  628.     case CODEC_ID_ADPCM_4XM:

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

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

  631. 

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

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

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

  635.         }

  636. 

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

  638.             samples = (short *)c->frame.data[0] + i;

  639.             cs = &c->status[i];

  640.             for (n = nb_samples >> 1; n > 0; n--, src++) {

  641.                 uint8_t v = *src;

  642.                 *samples = adpcm_ima_expand_nibble(cs, v & 0x0F, 4);

  643.                 samples += avctx->channels;

  644.                 *samples = adpcm_ima_expand_nibble(cs, v >> 4  , 4);

  645.                 samples += avctx->channels;

  646.             }

  647.         }

  648.         break;

  649.     case CODEC_ID_ADPCM_MS:

  650.     {

  651.         int block_predictor;

  652. 

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

  654.             buf_size = avctx->block_align;

  655. 

  656.         block_predictor = av_clip(*src++, 0, 6);

  657.         c->status[0].coeff1 = ff_adpcm_AdaptCoeff1[block_predictor];

  658.         c->status[0].coeff2 = ff_adpcm_AdaptCoeff2[block_predictor];

  659.         if (st) {

  660.             block_predictor = av_clip(*src++, 0, 6);

  661.             c->status[1].coeff1 = ff_adpcm_AdaptCoeff1[block_predictor];

  662.             c->status[1].coeff2 = ff_adpcm_AdaptCoeff2[block_predictor];

  663.         }

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

  665.         if (st){

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

  667.         }

  668. 

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

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

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

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

  673. 

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

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

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

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

  678.         for(n = (nb_samples - 2) >> (1 - st); n > 0; n--, src++) {

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

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

  681.         }

  682.         break;

  683.     }

  684.     case CODEC_ID_ADPCM_IMA_DK4:

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

  686.             buf_size = avctx->block_align;

  687. 

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

  689.             cs = &c->status[channel];

  690.             cs->predictor  = (int16_t)bytestream_get_le16(&src);

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

  692.             src++;

  693.             *samples++ = cs->predictor;

  694.         }

  695.         for (n = nb_samples >> (1 - st); n > 0; n--, src++) {

  696.             uint8_t v = *src;

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

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

  699.         }

  700.         break;

  701.     case CODEC_ID_ADPCM_IMA_DK3:

  702.     {

  703.         unsigned char last_byte = 0;

  704.         unsigned char nibble;

  705.         int decode_top_nibble_next = 0;

  706.         int end_of_packet = 0;

  707.         int diff_channel;

  708. 

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

  710.             buf_size = avctx->block_align;

  711. 

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

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

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

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

  716.         /* sign extend the predictors */

  717.         src += 16;

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

  719. 

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

  721.          * the buffer is consumed */

  722.         while (1) {

  723. 

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

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

  726. 

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

  728.             DK3_GET_NEXT_NIBBLE();

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

  730. 

  731.             /* process the diff channel predictor */

  732.             DK3_GET_NEXT_NIBBLE();

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

  734. 

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

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

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

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

  739. 

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

  741.             DK3_GET_NEXT_NIBBLE();

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

  743. 

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

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

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

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

  748.         }

  749.         break;

  750.     }

  751.     case CODEC_ID_ADPCM_IMA_ISS:

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

  753.             cs = &c->status[channel];

  754.             cs->predictor  = (int16_t)bytestream_get_le16(&src);

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

  756.             src++;

  757.         }

  758. 

  759.         for (n = nb_samples >> (1 - st); n > 0; n--, src++) {

  760.             uint8_t v1, v2;

  761.             uint8_t v = *src;

  762.             /* nibbles are swapped for mono */

  763.             if (st) {

  764.                 v1 = v >> 4;

  765.                 v2 = v & 0x0F;

  766.             } else {

  767.                 v2 = v >> 4;

  768.                 v1 = v & 0x0F;

  769.             }

  770.             *samples++ = adpcm_ima_expand_nibble(&c->status[0 ], v1, 3);

  771.             *samples++ = adpcm_ima_expand_nibble(&c->status[st], v2, 3);

  772.         }

  773.         break;

  774.     case CODEC_ID_ADPCM_IMA_WS:

  775.         while (src < buf + buf_size) {

  776.             uint8_t v = *src++;

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

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

  779.         }

  780.         break;

  781.     case CODEC_ID_ADPCM_XA:

  782.         while (buf_size >= 128) {

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

  784.                 avctx->channels);

  785.             src += 128;

  786.             samples += 28 * 8;

  787.             buf_size -= 128;

  788.         }

  789.         break;

  790.     case CODEC_ID_ADPCM_IMA_EA_EACS:

  791.         src += 4; // skip sample count (already read)

  792. 

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

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

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

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

  797. 

  798.         for (n = nb_samples >> (1 - st); n > 0; n--, src++) {

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

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

  801.         }

  802.         break;

  803.     case CODEC_ID_ADPCM_IMA_EA_SEAD:

  804.         for (n = nb_samples >> (1 - st); n > 0; n--, src++) {

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

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

  807.         }

  808.         break;

  809.     case CODEC_ID_ADPCM_EA:

  810.     {

  811.         int32_t previous_left_sample, previous_right_sample;

  812.         int32_t current_left_sample, current_right_sample;

  813.         int32_t next_left_sample, next_right_sample;

  814.         int32_t coeff1l, coeff2l, coeff1r, coeff2r;

  815.         uint8_t shift_left, shift_right;

  816. 

  817.         /* Each EA ADPCM frame has a 12-byte header followed by 30-byte pieces,

  818.            each coding 28 stereo samples. */

  819. 

  820.         src += 4; // skip sample count (already read)

  821. 

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

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

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

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

  826. 

  827.         for (count1 = 0; count1 < nb_samples / 28; count1++) {

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

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

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

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

  832.             src++;

  833. 

  834.             shift_left  = 20 - (*src >> 4);

  835.             shift_right = 20 - (*src & 0x0F);

  836.             src++;

  837. 

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

  839.                 next_left_sample  = sign_extend(*src >> 4, 4) << shift_left;

  840.                 next_right_sample = sign_extend(*src,      4) << shift_right;

  841.                 src++;

  842. 

  843.                 next_left_sample = (next_left_sample +

  844.                     (current_left_sample * coeff1l) +

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

  846.                 next_right_sample = (next_right_sample +

  847.                     (current_right_sample * coeff1r) +

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

  849. 

  850.                 previous_left_sample = current_left_sample;

  851.                 current_left_sample = av_clip_int16(next_left_sample);

  852.                 previous_right_sample = current_right_sample;

  853.                 current_right_sample = av_clip_int16(next_right_sample);

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

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

  856.             }

  857.         }

  858. 

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

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

  861. 

  862.         break;

  863.     }

  864.     case CODEC_ID_ADPCM_EA_MAXIS_XA:

  865.     {

  866.         int coeff[2][2], shift[2];

  867. 

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

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

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

  871.             shift[channel] = 20 - (*src & 0x0F);

  872.             src++;

  873.         }

  874.         for (count1 = 0; count1 < nb_samples / 2; count1++) {

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

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

  877.                     int32_t sample = sign_extend(src[channel] >> i, 4) << shift[channel];

  878.                     sample = (sample +

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

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

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

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

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

  884.                 }

  885.             }

  886.             src+=avctx->channels;

  887.         }

  888.         /* consume whole packet */

  889.         src = buf + buf_size;

  890.         break;

  891.     }

  892.     case CODEC_ID_ADPCM_EA_R1:

  893.     case CODEC_ID_ADPCM_EA_R2:

  894.     case CODEC_ID_ADPCM_EA_R3: {

  895.         /* channel numbering

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

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

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

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

  900.         int32_t previous_sample, current_sample, next_sample;

  901.         int32_t coeff1, coeff2;

  902.         uint8_t shift;

  903.         unsigned int channel;

  904.         uint16_t *samplesC;

  905.         const uint8_t *srcC;

  906.         const uint8_t *src_end = buf + buf_size;

  907.         int count = 0;

  908. 

  909.         src += 4; // skip sample count (already read)

  910. 

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

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

  913.                                          : bytestream_get_le32(&src))

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

  915. 

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

  917.             srcC  = src + offset;

  918.             samplesC = samples + channel;

  919. 

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

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

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

  923.             } else {

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

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

  926.             }

  927. 

  928.             for (count1 = 0; count1 < nb_samples / 28; count1++) {

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

  930.                     srcC++;

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

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

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

  934. 

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

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

  937.                         samplesC += avctx->channels;

  938.                     }

  939.                 } else {

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

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

  942.                     shift = 20 - (*srcC++ & 0x0F);

  943. 

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

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

  946.                         if (count2 & 1)

  947.                             next_sample = sign_extend(*srcC++,    4) << shift;

  948.                         else

  949.                             next_sample = sign_extend(*srcC >> 4, 4) << shift;

  950. 

  951.                         next_sample += (current_sample  * coeff1) +

  952.                                        (previous_sample * coeff2);

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

  954. 

  955.                         previous_sample = current_sample;

  956.                         current_sample  = next_sample;

  957.                         *samplesC = current_sample;

  958.                         samplesC += avctx->channels;

  959.                     }

  960.                 }

  961.             }

  962.             if (!count) {

  963.                 count = count1;

  964.             } else if (count != count1) {

  965.                 av_log(avctx, AV_LOG_WARNING, "per-channel sample count mismatch\n");

  966.                 count = FFMAX(count, count1);

  967.             }

  968. 

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

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

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

  972.             }

  973.         }

  974. 

  975.         c->frame.nb_samples = count * 28;

  976.         src = src_end;

  977.         break;

  978.     }

  979.     case CODEC_ID_ADPCM_EA_XAS:

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

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

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

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

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

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

  986.                 shift[n] = 20 - (src[2] & 0x0F);

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

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

  989.             }

  990. 

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

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

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

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

  995.                         int level = sign_extend(*src >> (4 - i), 4) << shift[n];

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

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

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

  999.                     }

  1000.                 }

  1001.             }

  1002.         }

  1003.         break;

  1004.     case CODEC_ID_ADPCM_IMA_AMV:

  1005.     case CODEC_ID_ADPCM_IMA_SMJPEG:

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

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

  1008. 

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

  1010.             src+=4;

  1011. 

  1012.         for (n = nb_samples >> (1 - st); n > 0; n--, src++) {

  1013.             char hi, lo;

  1014.             lo = *src & 0x0F;

  1015.             hi = *src >> 4;

  1016. 

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

  1018.                 FFSWAP(char, hi, lo);

  1019. 

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

  1021.                 lo, 3);

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

  1023.                 hi, 3);

  1024.         }

  1025.         break;

  1026.     case CODEC_ID_ADPCM_CT:

  1027.         for (n = nb_samples >> (1 - st); n > 0; n--, src++) {

  1028.             uint8_t v = *src;

  1029.             *samples++ = adpcm_ct_expand_nibble(&c->status[0 ], v >> 4  );

  1030.             *samples++ = adpcm_ct_expand_nibble(&c->status[st], v & 0x0F);

  1031.         }

  1032.         break;

  1033.     case CODEC_ID_ADPCM_SBPRO_4:

  1034.     case CODEC_ID_ADPCM_SBPRO_3:

  1035.     case CODEC_ID_ADPCM_SBPRO_2:

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

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

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

  1039.             if (st)

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

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

  1042.             nb_samples--;

  1043.         }

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

  1045.             for (n = nb_samples >> (1 - st); n > 0; n--, src++) {

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

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

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

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

  1050.             }

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

  1052.             for (n = nb_samples / 3; n > 0; n--, src++) {

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

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

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

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

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

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

  1059.             }

  1060.         } else {

  1061.             for (n = nb_samples >> (2 - st); n > 0; n--, src++) {

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

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

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

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

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

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

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

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

  1070.             }

  1071.         }

  1072.         break;

  1073.     case CODEC_ID_ADPCM_SWF:

  1074.     {

  1075.         GetBitContext gb;

  1076.         const int *table;

  1077.         int k0, signmask, nb_bits, count;

  1078.         int size = buf_size*8;

  1079. 

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

  1081. 

  1082.         //read bits & initial values

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

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

  1085.         table = swf_index_tables[nb_bits-2];

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

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

  1088. 

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

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

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

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

  1093.             }

  1094. 

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

  1096.                 int i;

  1097. 

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

  1099.                     // similar to IMA adpcm

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

  1101.                     int step = ff_adpcm_step_table[c->status[i].step_index];

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

  1103.                     int k = k0;

  1104. 

  1105.                     do {

  1106.                         if (delta & k)

  1107.                             vpdiff += step;

  1108.                         step >>= 1;

  1109.                         k >>= 1;

  1110.                     } while(k);

  1111.                     vpdiff += step;

  1112. 

  1113.                     if (delta & signmask)

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

  1115.                     else

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

  1117. 

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

  1119. 

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

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

  1122. 

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

  1124.                 }

  1125.             }

  1126.         }

  1127.         src += buf_size;

  1128.         break;

  1129.     }

  1130.     case CODEC_ID_ADPCM_YAMAHA:

  1131.         for (n = nb_samples >> (1 - st); n > 0; n--, src++) {

  1132.             uint8_t v = *src;

  1133.             *samples++ = adpcm_yamaha_expand_nibble(&c->status[0 ], v & 0x0F);

  1134.             *samples++ = adpcm_yamaha_expand_nibble(&c->status[st], v >> 4  );

  1135.         }

  1136.         break;

  1137.     case CODEC_ID_ADPCM_THP:

  1138.     {

  1139.         int table[2][16];

  1140.         int prev[2][2];

  1141.         int ch;

  1142. 

  1143.         src += 4; // skip channel size

  1144.         src += 4; // skip number of samples (already read)

  1145. 

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

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

  1148. 

  1149.         /* Initialize the previous sample.  */

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

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

  1152. 

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

  1154.             samples = (short *)c->frame.data[0] + ch;

  1155. 

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

  1157.             for (i = 0; i < nb_samples / 14; i++) {

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

  1159.                 unsigned int exp = *src++ & 15;

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

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

  1162. 

  1163.                 /* Decode 14 samples.  */

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

  1165.                     int32_t sampledat;

  1166.                     if(n&1) sampledat = sign_extend(*src++, 4);

  1167.                     else    sampledat = sign_extend(*src >> 4, 4);

  1168. 

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

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

  1171.                     *samples = av_clip_int16(sampledat);

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

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

  1174. 

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

  1176.                        is for the other channel.  */

  1177.                     samples += st;

  1178.                 }

  1179.             }

  1180.         }

  1181.         break;

  1182.     }

  1183. 

  1184.     default:

  1185.         return -1;

  1186.     }

  1187. 

  1188.     *got_frame_ptr   = 1;

  1189.     *(AVFrame *)data = c->frame;

  1190. 

  1191.     return src - buf;

  1192. }

  1193. 

  1194. 

  1195. #define ADPCM_DECODER(id_, name_, long_name_)               \

  1196. AVCodec ff_ ## name_ ## _decoder = {                        \

  1197.     .name           = #name_,                               \

  1198.     .type           = AVMEDIA_TYPE_AUDIO,                   \

  1199.     .id             = id_,                                  \

  1200.     .priv_data_size = sizeof(ADPCMDecodeContext),           \

  1201.     .init           = adpcm_decode_init,                    \

  1202.     .decode         = adpcm_decode_frame,                   \

  1203.     .capabilities   = CODEC_CAP_DR1,                        \

  1204.     .long_name      = NULL_IF_CONFIG_SMALL(long_name_),     \

  1205. }

  1206. 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  1222. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt, "ADPCM IMA QuickTime");

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

  1224. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav, "ADPCM IMA WAV");

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

  1226. ADPCM_DECODER(CODEC_ID_ADPCM_MS, adpcm_ms, "ADPCM Microsoft");

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

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

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

  1230. ADPCM_DECODER(CODEC_ID_ADPCM_SWF, adpcm_swf, "ADPCM Shockwave Flash");

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

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

  1233. ADPCM_DECODER(CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha, "ADPCM Yamaha");